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 /* Perform Koenig lookup. FN is the postfix-expression representing
1851 the function (or functions) to call; ARGS are the arguments to the
1852 call. Returns the functions to be considered by overload
1856 perform_koenig_lookup (tree fn, VEC(tree,gc) *args)
1858 tree identifier = NULL_TREE;
1859 tree functions = NULL_TREE;
1860 tree tmpl_args = NULL_TREE;
1861 bool template_id = false;
1863 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1865 /* Use a separate flag to handle null args. */
1867 tmpl_args = TREE_OPERAND (fn, 1);
1868 fn = TREE_OPERAND (fn, 0);
1871 /* Find the name of the overloaded function. */
1872 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1874 else if (is_overloaded_fn (fn))
1877 identifier = DECL_NAME (get_first_fn (functions));
1879 else if (DECL_P (fn))
1882 identifier = DECL_NAME (fn);
1885 /* A call to a namespace-scope function using an unqualified name.
1887 Do Koenig lookup -- unless any of the arguments are
1889 if (!any_type_dependent_arguments_p (args)
1890 && !any_dependent_template_arguments_p (tmpl_args))
1892 fn = lookup_arg_dependent (identifier, functions, args);
1894 /* The unqualified name could not be resolved. */
1895 fn = unqualified_fn_lookup_error (identifier);
1898 if (fn && template_id)
1899 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1904 /* Generate an expression for `FN (ARGS)'. This may change the
1907 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1908 as a virtual call, even if FN is virtual. (This flag is set when
1909 encountering an expression where the function name is explicitly
1910 qualified. For example a call to `X::f' never generates a virtual
1913 Returns code for the call. */
1916 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1917 bool koenig_p, tsubst_flags_t complain)
1921 VEC(tree,gc) *orig_args = NULL;
1923 if (fn == error_mark_node)
1924 return error_mark_node;
1926 gcc_assert (!TYPE_P (fn));
1930 if (processing_template_decl)
1932 if (type_dependent_expression_p (fn)
1933 || any_type_dependent_arguments_p (*args))
1935 result = build_nt_call_vec (fn, *args);
1936 KOENIG_LOOKUP_P (result) = koenig_p;
1941 tree fndecl = OVL_CURRENT (fn);
1942 if (TREE_CODE (fndecl) != FUNCTION_DECL
1943 || !TREE_THIS_VOLATILE (fndecl))
1949 current_function_returns_abnormally = 1;
1953 orig_args = make_tree_vector_copy (*args);
1954 if (!BASELINK_P (fn)
1955 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1956 && TREE_TYPE (fn) != unknown_type_node)
1957 fn = build_non_dependent_expr (fn);
1958 make_args_non_dependent (*args);
1961 if (is_overloaded_fn (fn))
1962 fn = baselink_for_fns (fn);
1965 if (BASELINK_P (fn))
1969 /* A call to a member function. From [over.call.func]:
1971 If the keyword this is in scope and refers to the class of
1972 that member function, or a derived class thereof, then the
1973 function call is transformed into a qualified function call
1974 using (*this) as the postfix-expression to the left of the
1975 . operator.... [Otherwise] a contrived object of type T
1976 becomes the implied object argument.
1978 This paragraph is unclear about this situation:
1980 struct A { void f(); };
1981 struct B : public A {};
1982 struct C : public A { void g() { B::f(); }};
1984 In particular, for `B::f', this paragraph does not make clear
1985 whether "the class of that member function" refers to `A' or
1986 to `B'. We believe it refers to `B'. */
1987 if (current_class_type
1988 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1990 && current_class_ref)
1991 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1995 tree representative_fn;
1997 representative_fn = BASELINK_FUNCTIONS (fn);
1998 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1999 representative_fn = TREE_OPERAND (representative_fn, 0);
2000 representative_fn = get_first_fn (representative_fn);
2001 object = build_dummy_object (DECL_CONTEXT (representative_fn));
2004 if (processing_template_decl)
2006 if (type_dependent_expression_p (object))
2008 tree ret = build_nt_call_vec (orig_fn, orig_args);
2009 release_tree_vector (orig_args);
2012 object = build_non_dependent_expr (object);
2015 result = build_new_method_call (object, fn, args, NULL_TREE,
2017 ? LOOKUP_NONVIRTUAL : 0),
2021 else if (is_overloaded_fn (fn))
2023 /* If the function is an overloaded builtin, resolve it. */
2024 if (TREE_CODE (fn) == FUNCTION_DECL
2025 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2026 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2027 result = resolve_overloaded_builtin (input_location, fn, *args);
2030 /* A call to a namespace-scope function. */
2031 result = build_new_function_call (fn, args, koenig_p, complain);
2033 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2035 if (!VEC_empty (tree, *args))
2036 error ("arguments to destructor are not allowed");
2037 /* Mark the pseudo-destructor call as having side-effects so
2038 that we do not issue warnings about its use. */
2039 result = build1 (NOP_EXPR,
2041 TREE_OPERAND (fn, 0));
2042 TREE_SIDE_EFFECTS (result) = 1;
2044 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2045 /* If the "function" is really an object of class type, it might
2046 have an overloaded `operator ()'. */
2047 result = build_op_call (fn, args, complain);
2050 /* A call where the function is unknown. */
2051 result = cp_build_function_call_vec (fn, args, complain);
2053 if (processing_template_decl)
2055 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2056 KOENIG_LOOKUP_P (result) = koenig_p;
2057 release_tree_vector (orig_args);
2063 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2064 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2065 POSTDECREMENT_EXPR.) */
2068 finish_increment_expr (tree expr, enum tree_code code)
2070 return build_x_unary_op (code, expr, tf_warning_or_error);
2073 /* Finish a use of `this'. Returns an expression for `this'. */
2076 finish_this_expr (void)
2080 /* In a lambda expression, 'this' refers to the captured 'this'. */
2081 if (current_function_decl
2082 && LAMBDA_FUNCTION_P (current_function_decl))
2083 result = (lambda_expr_this_capture
2084 (CLASSTYPE_LAMBDA_EXPR (current_class_type)));
2085 else if (current_class_ptr)
2086 result = current_class_ptr;
2087 else if (current_function_decl
2088 && DECL_STATIC_FUNCTION_P (current_function_decl))
2090 error ("%<this%> is unavailable for static member functions");
2091 result = error_mark_node;
2095 if (current_function_decl)
2096 error ("invalid use of %<this%> in non-member function");
2098 error ("invalid use of %<this%> at top level");
2099 result = error_mark_node;
2105 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2106 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2107 the TYPE for the type given. If SCOPE is non-NULL, the expression
2108 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2111 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2113 if (object == error_mark_node || destructor == error_mark_node)
2114 return error_mark_node;
2116 gcc_assert (TYPE_P (destructor));
2118 if (!processing_template_decl)
2120 if (scope == error_mark_node)
2122 error ("invalid qualifying scope in pseudo-destructor name");
2123 return error_mark_node;
2125 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2127 error ("qualified type %qT does not match destructor name ~%qT",
2129 return error_mark_node;
2133 /* [expr.pseudo] says both:
2135 The type designated by the pseudo-destructor-name shall be
2136 the same as the object type.
2140 The cv-unqualified versions of the object type and of the
2141 type designated by the pseudo-destructor-name shall be the
2144 We implement the more generous second sentence, since that is
2145 what most other compilers do. */
2146 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2149 error ("%qE is not of type %qT", object, destructor);
2150 return error_mark_node;
2154 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2157 /* Finish an expression of the form CODE EXPR. */
2160 finish_unary_op_expr (enum tree_code code, tree expr)
2162 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2163 /* Inside a template, build_x_unary_op does not fold the
2164 expression. So check whether the result is folded before
2165 setting TREE_NEGATED_INT. */
2166 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2167 && TREE_CODE (result) == INTEGER_CST
2168 && !TYPE_UNSIGNED (TREE_TYPE (result))
2169 && INT_CST_LT (result, integer_zero_node))
2171 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2172 setting TREE_NEGATED_INT. */
2173 result = copy_node (result);
2174 TREE_NEGATED_INT (result) = 1;
2176 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2177 overflow_warning (input_location, result);
2182 /* Finish a compound-literal expression. TYPE is the type to which
2183 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2186 finish_compound_literal (tree type, tree compound_literal)
2188 if (type == error_mark_node)
2189 return error_mark_node;
2191 if (!TYPE_OBJ_P (type))
2193 error ("compound literal of non-object type %qT", type);
2194 return error_mark_node;
2197 if (processing_template_decl)
2199 TREE_TYPE (compound_literal) = type;
2200 /* Mark the expression as a compound literal. */
2201 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2202 return compound_literal;
2205 type = complete_type (type);
2207 if (TYPE_NON_AGGREGATE_CLASS (type))
2209 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2210 everywhere that deals with function arguments would be a pain, so
2211 just wrap it in a TREE_LIST. The parser set a flag so we know
2212 that it came from T{} rather than T({}). */
2213 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2214 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2215 return build_functional_cast (type, compound_literal, tf_error);
2218 if (TREE_CODE (type) == ARRAY_TYPE
2219 && check_array_initializer (NULL_TREE, type, compound_literal))
2220 return error_mark_node;
2221 compound_literal = reshape_init (type, compound_literal);
2222 if (TREE_CODE (type) == ARRAY_TYPE)
2223 cp_complete_array_type (&type, compound_literal, false);
2224 compound_literal = digest_init (type, compound_literal);
2225 if ((!at_function_scope_p () || cp_type_readonly (type))
2226 && initializer_constant_valid_p (compound_literal, type))
2228 tree decl = create_temporary_var (type);
2229 DECL_INITIAL (decl) = compound_literal;
2230 TREE_STATIC (decl) = 1;
2231 decl = pushdecl_top_level (decl);
2232 DECL_NAME (decl) = make_anon_name ();
2233 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2237 return get_target_expr (compound_literal);
2240 /* Return the declaration for the function-name variable indicated by
2244 finish_fname (tree id)
2248 decl = fname_decl (input_location, C_RID_CODE (id), id);
2249 if (processing_template_decl)
2250 decl = DECL_NAME (decl);
2254 /* Finish a translation unit. */
2257 finish_translation_unit (void)
2259 /* In case there were missing closebraces,
2260 get us back to the global binding level. */
2262 while (current_namespace != global_namespace)
2265 /* Do file scope __FUNCTION__ et al. */
2266 finish_fname_decls ();
2269 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2270 Returns the parameter. */
2273 finish_template_type_parm (tree aggr, tree identifier)
2275 if (aggr != class_type_node)
2277 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2278 aggr = class_type_node;
2281 return build_tree_list (aggr, identifier);
2284 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2285 Returns the parameter. */
2288 finish_template_template_parm (tree aggr, tree identifier)
2290 tree decl = build_decl (input_location,
2291 TYPE_DECL, identifier, NULL_TREE);
2292 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2293 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2294 DECL_TEMPLATE_RESULT (tmpl) = decl;
2295 DECL_ARTIFICIAL (decl) = 1;
2296 end_template_decl ();
2298 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2300 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2301 /*is_primary=*/true, /*is_partial=*/false,
2304 return finish_template_type_parm (aggr, tmpl);
2307 /* ARGUMENT is the default-argument value for a template template
2308 parameter. If ARGUMENT is invalid, issue error messages and return
2309 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2312 check_template_template_default_arg (tree argument)
2314 if (TREE_CODE (argument) != TEMPLATE_DECL
2315 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2316 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2318 if (TREE_CODE (argument) == TYPE_DECL)
2319 error ("invalid use of type %qT as a default value for a template "
2320 "template-parameter", TREE_TYPE (argument));
2322 error ("invalid default argument for a template template parameter");
2323 return error_mark_node;
2329 /* Begin a class definition, as indicated by T. */
2332 begin_class_definition (tree t, tree attributes)
2334 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2335 return error_mark_node;
2337 if (processing_template_parmlist)
2339 error ("definition of %q#T inside template parameter list", t);
2340 return error_mark_node;
2342 /* A non-implicit typename comes from code like:
2344 template <typename T> struct A {
2345 template <typename U> struct A<T>::B ...
2347 This is erroneous. */
2348 else if (TREE_CODE (t) == TYPENAME_TYPE)
2350 error ("invalid definition of qualified type %qT", t);
2351 t = error_mark_node;
2354 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2356 t = make_class_type (RECORD_TYPE);
2357 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2360 /* Update the location of the decl. */
2361 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2363 if (TYPE_BEING_DEFINED (t))
2365 t = make_class_type (TREE_CODE (t));
2366 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2368 maybe_process_partial_specialization (t);
2370 TYPE_BEING_DEFINED (t) = 1;
2372 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2374 if (flag_pack_struct)
2377 TYPE_PACKED (t) = 1;
2378 /* Even though the type is being defined for the first time
2379 here, there might have been a forward declaration, so there
2380 might be cv-qualified variants of T. */
2381 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2382 TYPE_PACKED (v) = 1;
2384 /* Reset the interface data, at the earliest possible
2385 moment, as it might have been set via a class foo;
2387 if (! TYPE_ANONYMOUS_P (t))
2389 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2390 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2391 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2392 (t, finfo->interface_unknown);
2394 reset_specialization();
2396 /* Make a declaration for this class in its own scope. */
2397 build_self_reference ();
2402 /* Finish the member declaration given by DECL. */
2405 finish_member_declaration (tree decl)
2407 if (decl == error_mark_node || decl == NULL_TREE)
2410 if (decl == void_type_node)
2411 /* The COMPONENT was a friend, not a member, and so there's
2412 nothing for us to do. */
2415 /* We should see only one DECL at a time. */
2416 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2418 /* Set up access control for DECL. */
2420 = (current_access_specifier == access_private_node);
2421 TREE_PROTECTED (decl)
2422 = (current_access_specifier == access_protected_node);
2423 if (TREE_CODE (decl) == TEMPLATE_DECL)
2425 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2426 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2429 /* Mark the DECL as a member of the current class. */
2430 DECL_CONTEXT (decl) = current_class_type;
2432 /* Check for bare parameter packs in the member variable declaration. */
2433 if (TREE_CODE (decl) == FIELD_DECL)
2435 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2436 TREE_TYPE (decl) = error_mark_node;
2437 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2438 DECL_ATTRIBUTES (decl) = NULL_TREE;
2443 A C language linkage is ignored for the names of class members
2444 and the member function type of class member functions. */
2445 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2446 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2448 /* Put functions on the TYPE_METHODS list and everything else on the
2449 TYPE_FIELDS list. Note that these are built up in reverse order.
2450 We reverse them (to obtain declaration order) in finish_struct. */
2451 if (TREE_CODE (decl) == FUNCTION_DECL
2452 || DECL_FUNCTION_TEMPLATE_P (decl))
2454 /* We also need to add this function to the
2455 CLASSTYPE_METHOD_VEC. */
2456 if (add_method (current_class_type, decl, NULL_TREE))
2458 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2459 TYPE_METHODS (current_class_type) = decl;
2461 maybe_add_class_template_decl_list (current_class_type, decl,
2465 /* Enter the DECL into the scope of the class. */
2466 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2467 || pushdecl_class_level (decl))
2469 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2470 go at the beginning. The reason is that lookup_field_1
2471 searches the list in order, and we want a field name to
2472 override a type name so that the "struct stat hack" will
2473 work. In particular:
2475 struct S { enum E { }; int E } s;
2478 is valid. In addition, the FIELD_DECLs must be maintained in
2479 declaration order so that class layout works as expected.
2480 However, we don't need that order until class layout, so we
2481 save a little time by putting FIELD_DECLs on in reverse order
2482 here, and then reversing them in finish_struct_1. (We could
2483 also keep a pointer to the correct insertion points in the
2486 if (TREE_CODE (decl) == TYPE_DECL)
2487 TYPE_FIELDS (current_class_type)
2488 = chainon (TYPE_FIELDS (current_class_type), decl);
2491 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2492 TYPE_FIELDS (current_class_type) = decl;
2495 maybe_add_class_template_decl_list (current_class_type, decl,
2500 note_decl_for_pch (decl);
2503 /* DECL has been declared while we are building a PCH file. Perform
2504 actions that we might normally undertake lazily, but which can be
2505 performed now so that they do not have to be performed in
2506 translation units which include the PCH file. */
2509 note_decl_for_pch (tree decl)
2511 gcc_assert (pch_file);
2513 /* There's a good chance that we'll have to mangle names at some
2514 point, even if only for emission in debugging information. */
2515 if ((TREE_CODE (decl) == VAR_DECL
2516 || TREE_CODE (decl) == FUNCTION_DECL)
2517 && !processing_template_decl)
2521 /* Finish processing a complete template declaration. The PARMS are
2522 the template parameters. */
2525 finish_template_decl (tree parms)
2528 end_template_decl ();
2530 end_specialization ();
2533 /* Finish processing a template-id (which names a type) of the form
2534 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2535 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2536 the scope of template-id indicated. */
2539 finish_template_type (tree name, tree args, int entering_scope)
2543 decl = lookup_template_class (name, args,
2544 NULL_TREE, NULL_TREE, entering_scope,
2545 tf_warning_or_error | tf_user);
2546 if (decl != error_mark_node)
2547 decl = TYPE_STUB_DECL (decl);
2552 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2553 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2554 BASE_CLASS, or NULL_TREE if an error occurred. The
2555 ACCESS_SPECIFIER is one of
2556 access_{default,public,protected_private}_node. For a virtual base
2557 we set TREE_TYPE. */
2560 finish_base_specifier (tree base, tree access, bool virtual_p)
2564 if (base == error_mark_node)
2566 error ("invalid base-class specification");
2569 else if (! MAYBE_CLASS_TYPE_P (base))
2571 error ("%qT is not a class type", base);
2576 if (cp_type_quals (base) != 0)
2578 error ("base class %qT has cv qualifiers", base);
2579 base = TYPE_MAIN_VARIANT (base);
2581 result = build_tree_list (access, base);
2583 TREE_TYPE (result) = integer_type_node;
2589 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2590 what we found when we tried to do the lookup.
2591 LOCATION is the location of the NAME identifier;
2592 The location is used in the error message*/
2595 qualified_name_lookup_error (tree scope, tree name,
2596 tree decl, location_t location)
2598 if (scope == error_mark_node)
2599 ; /* We already complained. */
2600 else if (TYPE_P (scope))
2602 if (!COMPLETE_TYPE_P (scope))
2603 error_at (location, "incomplete type %qT used in nested name specifier",
2605 else if (TREE_CODE (decl) == TREE_LIST)
2607 error_at (location, "reference to %<%T::%D%> is ambiguous",
2609 print_candidates (decl);
2612 error_at (location, "%qD is not a member of %qT", name, scope);
2614 else if (scope != global_namespace)
2615 error_at (location, "%qD is not a member of %qD", name, scope);
2617 error_at (location, "%<::%D%> has not been declared", name);
2620 /* If FNS is a member function, a set of member functions, or a
2621 template-id referring to one or more member functions, return a
2622 BASELINK for FNS, incorporating the current access context.
2623 Otherwise, return FNS unchanged. */
2626 baselink_for_fns (tree fns)
2631 if (BASELINK_P (fns)
2632 || error_operand_p (fns))
2636 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2637 fn = TREE_OPERAND (fn, 0);
2638 fn = get_first_fn (fn);
2639 if (!DECL_FUNCTION_MEMBER_P (fn))
2642 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2644 cl = DECL_CONTEXT (fn);
2645 cl = TYPE_BINFO (cl);
2646 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2649 /* Returns true iff DECL is an automatic variable from a function outside
2653 outer_automatic_var_p (tree decl)
2655 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2656 && DECL_FUNCTION_SCOPE_P (decl)
2657 && !TREE_STATIC (decl)
2658 && DECL_CONTEXT (decl) != current_function_decl);
2661 /* Returns true iff DECL is a capture field from a lambda that is not our
2662 immediate context. */
2665 outer_lambda_capture_p (tree decl)
2667 return (TREE_CODE (decl) == FIELD_DECL
2668 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2669 && (!current_class_type
2670 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2673 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2674 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2675 if non-NULL, is the type or namespace used to explicitly qualify
2676 ID_EXPRESSION. DECL is the entity to which that name has been
2679 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2680 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2681 be set to true if this expression isn't permitted in a
2682 constant-expression, but it is otherwise not set by this function.
2683 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2684 constant-expression, but a non-constant expression is also
2687 DONE is true if this expression is a complete postfix-expression;
2688 it is false if this expression is followed by '->', '[', '(', etc.
2689 ADDRESS_P is true iff this expression is the operand of '&'.
2690 TEMPLATE_P is true iff the qualified-id was of the form
2691 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2692 appears as a template argument.
2694 If an error occurs, and it is the kind of error that might cause
2695 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2696 is the caller's responsibility to issue the message. *ERROR_MSG
2697 will be a string with static storage duration, so the caller need
2700 Return an expression for the entity, after issuing appropriate
2701 diagnostics. This function is also responsible for transforming a
2702 reference to a non-static member into a COMPONENT_REF that makes
2703 the use of "this" explicit.
2705 Upon return, *IDK will be filled in appropriately. */
2707 finish_id_expression (tree id_expression,
2711 bool integral_constant_expression_p,
2712 bool allow_non_integral_constant_expression_p,
2713 bool *non_integral_constant_expression_p,
2717 bool template_arg_p,
2718 const char **error_msg,
2719 location_t location)
2721 /* Initialize the output parameters. */
2722 *idk = CP_ID_KIND_NONE;
2725 if (id_expression == error_mark_node)
2726 return error_mark_node;
2727 /* If we have a template-id, then no further lookup is
2728 required. If the template-id was for a template-class, we
2729 will sometimes have a TYPE_DECL at this point. */
2730 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2731 || TREE_CODE (decl) == TYPE_DECL)
2733 /* Look up the name. */
2736 if (decl == error_mark_node)
2738 /* Name lookup failed. */
2741 || (!dependent_type_p (scope)
2742 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2743 && IDENTIFIER_TYPENAME_P (id_expression)
2744 && dependent_type_p (TREE_TYPE (id_expression))))))
2746 /* If the qualifying type is non-dependent (and the name
2747 does not name a conversion operator to a dependent
2748 type), issue an error. */
2749 qualified_name_lookup_error (scope, id_expression, decl, location);
2750 return error_mark_node;
2754 /* It may be resolved via Koenig lookup. */
2755 *idk = CP_ID_KIND_UNQUALIFIED;
2756 return id_expression;
2759 decl = id_expression;
2761 /* If DECL is a variable that would be out of scope under
2762 ANSI/ISO rules, but in scope in the ARM, name lookup
2763 will succeed. Issue a diagnostic here. */
2765 decl = check_for_out_of_scope_variable (decl);
2767 /* Remember that the name was used in the definition of
2768 the current class so that we can check later to see if
2769 the meaning would have been different after the class
2770 was entirely defined. */
2771 if (!scope && decl != error_mark_node)
2772 maybe_note_name_used_in_class (id_expression, decl);
2774 /* Disallow uses of local variables from containing functions, except
2775 within lambda-expressions. */
2776 if ((outer_automatic_var_p (decl)
2777 || outer_lambda_capture_p (decl))
2778 /* It's not a use (3.2) if we're in an unevaluated context. */
2779 && !cp_unevaluated_operand)
2781 tree context = DECL_CONTEXT (decl);
2782 tree containing_function = current_function_decl;
2783 tree lambda_stack = NULL_TREE;
2784 tree lambda_expr = NULL_TREE;
2785 tree initializer = decl;
2787 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2788 support for an approach in which a reference to a local
2789 [constant] automatic variable in a nested class or lambda body
2790 would enter the expression as an rvalue, which would reduce
2791 the complexity of the problem"
2793 FIXME update for final resolution of core issue 696. */
2794 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2795 return integral_constant_value (decl);
2797 if (TYPE_P (context))
2799 /* Implicit capture of an explicit capture. */
2800 context = lambda_function (context);
2801 initializer = thisify_lambda_field (decl);
2804 /* If we are in a lambda function, we can move out until we hit
2806 2. a non-lambda function, or
2807 3. a non-default capturing lambda function. */
2808 while (context != containing_function
2809 && LAMBDA_FUNCTION_P (containing_function))
2811 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2812 (DECL_CONTEXT (containing_function));
2814 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2818 lambda_stack = tree_cons (NULL_TREE,
2823 = decl_function_context (containing_function);
2826 if (context == containing_function)
2828 decl = add_default_capture (lambda_stack,
2829 /*id=*/DECL_NAME (decl),
2832 else if (lambda_expr)
2834 error ("%qD is not captured", decl);
2835 return error_mark_node;
2839 error (TREE_CODE (decl) == VAR_DECL
2840 ? "use of %<auto%> variable from containing function"
2841 : "use of parameter from containing function");
2842 error (" %q+#D declared here", decl);
2843 return error_mark_node;
2848 /* If we didn't find anything, or what we found was a type,
2849 then this wasn't really an id-expression. */
2850 if (TREE_CODE (decl) == TEMPLATE_DECL
2851 && !DECL_FUNCTION_TEMPLATE_P (decl))
2853 *error_msg = "missing template arguments";
2854 return error_mark_node;
2856 else if (TREE_CODE (decl) == TYPE_DECL
2857 || TREE_CODE (decl) == NAMESPACE_DECL)
2859 *error_msg = "expected primary-expression";
2860 return error_mark_node;
2863 /* If the name resolved to a template parameter, there is no
2864 need to look it up again later. */
2865 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2866 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2870 *idk = CP_ID_KIND_NONE;
2871 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2872 decl = TEMPLATE_PARM_DECL (decl);
2873 r = convert_from_reference (DECL_INITIAL (decl));
2875 if (integral_constant_expression_p
2876 && !dependent_type_p (TREE_TYPE (decl))
2877 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2879 if (!allow_non_integral_constant_expression_p)
2880 error ("template parameter %qD of type %qT is not allowed in "
2881 "an integral constant expression because it is not of "
2882 "integral or enumeration type", decl, TREE_TYPE (decl));
2883 *non_integral_constant_expression_p = true;
2887 /* Similarly, we resolve enumeration constants to their
2888 underlying values. */
2889 else if (TREE_CODE (decl) == CONST_DECL)
2891 *idk = CP_ID_KIND_NONE;
2892 if (!processing_template_decl)
2894 used_types_insert (TREE_TYPE (decl));
2895 return DECL_INITIAL (decl);
2903 /* If the declaration was explicitly qualified indicate
2904 that. The semantics of `A::f(3)' are different than
2905 `f(3)' if `f' is virtual. */
2907 ? CP_ID_KIND_QUALIFIED
2908 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2909 ? CP_ID_KIND_TEMPLATE_ID
2910 : CP_ID_KIND_UNQUALIFIED));
2915 An id-expression is type-dependent if it contains an
2916 identifier that was declared with a dependent type.
2918 The standard is not very specific about an id-expression that
2919 names a set of overloaded functions. What if some of them
2920 have dependent types and some of them do not? Presumably,
2921 such a name should be treated as a dependent name. */
2922 /* Assume the name is not dependent. */
2923 dependent_p = false;
2924 if (!processing_template_decl)
2925 /* No names are dependent outside a template. */
2927 /* A template-id where the name of the template was not resolved
2928 is definitely dependent. */
2929 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2930 && (TREE_CODE (TREE_OPERAND (decl, 0))
2931 == IDENTIFIER_NODE))
2933 /* For anything except an overloaded function, just check its
2935 else if (!is_overloaded_fn (decl))
2937 = dependent_type_p (TREE_TYPE (decl));
2938 /* For a set of overloaded functions, check each of the
2944 if (BASELINK_P (fns))
2945 fns = BASELINK_FUNCTIONS (fns);
2947 /* For a template-id, check to see if the template
2948 arguments are dependent. */
2949 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2951 tree args = TREE_OPERAND (fns, 1);
2952 dependent_p = any_dependent_template_arguments_p (args);
2953 /* The functions are those referred to by the
2955 fns = TREE_OPERAND (fns, 0);
2958 /* If there are no dependent template arguments, go through
2959 the overloaded functions. */
2960 while (fns && !dependent_p)
2962 tree fn = OVL_CURRENT (fns);
2964 /* Member functions of dependent classes are
2966 if (TREE_CODE (fn) == FUNCTION_DECL
2967 && type_dependent_expression_p (fn))
2969 else if (TREE_CODE (fn) == TEMPLATE_DECL
2970 && dependent_template_p (fn))
2973 fns = OVL_NEXT (fns);
2977 /* If the name was dependent on a template parameter, we will
2978 resolve the name at instantiation time. */
2981 /* Create a SCOPE_REF for qualified names, if the scope is
2987 if (address_p && done)
2988 decl = finish_qualified_id_expr (scope, decl,
2994 tree type = NULL_TREE;
2995 if (DECL_P (decl) && !dependent_scope_p (scope))
2996 type = TREE_TYPE (decl);
2997 decl = build_qualified_name (type,
3003 if (TREE_TYPE (decl))
3004 decl = convert_from_reference (decl);
3007 /* A TEMPLATE_ID already contains all the information we
3009 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3010 return id_expression;
3011 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3012 /* If we found a variable, then name lookup during the
3013 instantiation will always resolve to the same VAR_DECL
3014 (or an instantiation thereof). */
3015 if (TREE_CODE (decl) == VAR_DECL
3016 || TREE_CODE (decl) == PARM_DECL)
3017 return convert_from_reference (decl);
3018 /* The same is true for FIELD_DECL, but we also need to
3019 make sure that the syntax is correct. */
3020 else if (TREE_CODE (decl) == FIELD_DECL)
3022 /* Since SCOPE is NULL here, this is an unqualified name.
3023 Access checking has been performed during name lookup
3024 already. Turn off checking to avoid duplicate errors. */
3025 push_deferring_access_checks (dk_no_check);
3026 decl = finish_non_static_data_member
3027 (decl, current_class_ref,
3028 /*qualifying_scope=*/NULL_TREE);
3029 pop_deferring_access_checks ();
3032 return id_expression;
3035 /* Only certain kinds of names are allowed in constant
3036 expression. Enumerators and template parameters have already
3037 been handled above. */
3038 if (integral_constant_expression_p
3039 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
3040 && ! builtin_valid_in_constant_expr_p (decl))
3042 if (!allow_non_integral_constant_expression_p)
3044 error ("%qD cannot appear in a constant-expression", decl);
3045 return error_mark_node;
3047 *non_integral_constant_expression_p = true;
3050 if (TREE_CODE (decl) == NAMESPACE_DECL)
3052 error ("use of namespace %qD as expression", decl);
3053 return error_mark_node;
3055 else if (DECL_CLASS_TEMPLATE_P (decl))
3057 error ("use of class template %qT as expression", decl);
3058 return error_mark_node;
3060 else if (TREE_CODE (decl) == TREE_LIST)
3062 /* Ambiguous reference to base members. */
3063 error ("request for member %qD is ambiguous in "
3064 "multiple inheritance lattice", id_expression);
3065 print_candidates (decl);
3066 return error_mark_node;
3069 /* Mark variable-like entities as used. Functions are similarly
3070 marked either below or after overload resolution. */
3071 if (TREE_CODE (decl) == VAR_DECL
3072 || TREE_CODE (decl) == PARM_DECL
3073 || TREE_CODE (decl) == RESULT_DECL)
3078 decl = (adjust_result_of_qualified_name_lookup
3079 (decl, scope, current_class_type));
3081 if (TREE_CODE (decl) == FUNCTION_DECL)
3084 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3085 decl = finish_qualified_id_expr (scope,
3093 tree r = convert_from_reference (decl);
3095 if (processing_template_decl && TYPE_P (scope))
3096 r = build_qualified_name (TREE_TYPE (r),
3102 else if (TREE_CODE (decl) == FIELD_DECL)
3104 /* Since SCOPE is NULL here, this is an unqualified name.
3105 Access checking has been performed during name lookup
3106 already. Turn off checking to avoid duplicate errors. */
3107 push_deferring_access_checks (dk_no_check);
3108 decl = finish_non_static_data_member (decl, current_class_ref,
3109 /*qualifying_scope=*/NULL_TREE);
3110 pop_deferring_access_checks ();
3112 else if (is_overloaded_fn (decl))
3117 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
3118 first_fn = TREE_OPERAND (first_fn, 0);
3119 first_fn = get_first_fn (first_fn);
3120 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3121 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3123 if (!really_overloaded_fn (decl))
3124 mark_used (first_fn);
3127 && TREE_CODE (first_fn) == FUNCTION_DECL
3128 && DECL_FUNCTION_MEMBER_P (first_fn)
3129 && !shared_member_p (decl))
3131 /* A set of member functions. */
3132 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3133 return finish_class_member_access_expr (decl, id_expression,
3134 /*template_p=*/false,
3135 tf_warning_or_error);
3138 decl = baselink_for_fns (decl);
3142 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3143 && DECL_CLASS_SCOPE_P (decl))
3145 tree context = context_for_name_lookup (decl);
3146 if (context != current_class_type)
3148 tree path = currently_open_derived_class (context);
3149 perform_or_defer_access_check (TYPE_BINFO (path),
3154 decl = convert_from_reference (decl);
3158 if (TREE_DEPRECATED (decl))
3159 warn_deprecated_use (decl, NULL_TREE);
3164 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3165 use as a type-specifier. */
3168 finish_typeof (tree expr)
3172 if (type_dependent_expression_p (expr))
3174 type = cxx_make_type (TYPEOF_TYPE);
3175 TYPEOF_TYPE_EXPR (type) = expr;
3176 SET_TYPE_STRUCTURAL_EQUALITY (type);
3181 type = unlowered_expr_type (expr);
3183 if (!type || type == unknown_type_node)
3185 error ("type of %qE is unknown", expr);
3186 return error_mark_node;
3192 /* Perform C++-specific checks for __builtin_offsetof before calling
3196 finish_offsetof (tree expr)
3198 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3200 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3201 TREE_OPERAND (expr, 2));
3202 return error_mark_node;
3204 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3205 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3206 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3208 if (TREE_CODE (expr) == COMPONENT_REF
3209 || TREE_CODE (expr) == COMPOUND_EXPR)
3210 expr = TREE_OPERAND (expr, 1);
3211 error ("cannot apply %<offsetof%> to member function %qD", expr);
3212 return error_mark_node;
3214 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3215 expr = TREE_OPERAND (expr, 0);
3216 return fold_offsetof (expr, NULL_TREE);
3219 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3220 function is broken out from the above for the benefit of the tree-ssa
3224 simplify_aggr_init_expr (tree *tp)
3226 tree aggr_init_expr = *tp;
3228 /* Form an appropriate CALL_EXPR. */
3229 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3230 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3231 tree type = TREE_TYPE (slot);
3234 enum style_t { ctor, arg, pcc } style;
3236 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3238 #ifdef PCC_STATIC_STRUCT_RETURN
3244 gcc_assert (TREE_ADDRESSABLE (type));
3248 call_expr = build_call_array_loc (input_location,
3249 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3251 aggr_init_expr_nargs (aggr_init_expr),
3252 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3256 /* Replace the first argument to the ctor with the address of the
3258 cxx_mark_addressable (slot);
3259 CALL_EXPR_ARG (call_expr, 0) =
3260 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3262 else if (style == arg)
3264 /* Just mark it addressable here, and leave the rest to
3265 expand_call{,_inline}. */
3266 cxx_mark_addressable (slot);
3267 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3268 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3270 else if (style == pcc)
3272 /* If we're using the non-reentrant PCC calling convention, then we
3273 need to copy the returned value out of the static buffer into the
3275 push_deferring_access_checks (dk_no_check);
3276 call_expr = build_aggr_init (slot, call_expr,
3277 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3278 tf_warning_or_error);
3279 pop_deferring_access_checks ();
3280 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3283 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3285 tree init = build_zero_init (type, NULL_TREE,
3286 /*static_storage_p=*/false);
3287 init = build2 (INIT_EXPR, void_type_node, slot, init);
3288 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3295 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3298 emit_associated_thunks (tree fn)
3300 /* When we use vcall offsets, we emit thunks with the virtual
3301 functions to which they thunk. The whole point of vcall offsets
3302 is so that you can know statically the entire set of thunks that
3303 will ever be needed for a given virtual function, thereby
3304 enabling you to output all the thunks with the function itself. */
3305 if (DECL_VIRTUAL_P (fn)
3306 /* Do not emit thunks for extern template instantiations. */
3307 && ! DECL_REALLY_EXTERN (fn))
3311 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3313 if (!THUNK_ALIAS (thunk))
3315 use_thunk (thunk, /*emit_p=*/1);
3316 if (DECL_RESULT_THUNK_P (thunk))
3320 for (probe = DECL_THUNKS (thunk);
3321 probe; probe = TREE_CHAIN (probe))
3322 use_thunk (probe, /*emit_p=*/1);
3326 gcc_assert (!DECL_THUNKS (thunk));
3331 /* Generate RTL for FN. */
3334 expand_or_defer_fn_1 (tree fn)
3336 /* When the parser calls us after finishing the body of a template
3337 function, we don't really want to expand the body. */
3338 if (processing_template_decl)
3340 /* Normally, collection only occurs in rest_of_compilation. So,
3341 if we don't collect here, we never collect junk generated
3342 during the processing of templates until we hit a
3343 non-template function. It's not safe to do this inside a
3344 nested class, though, as the parser may have local state that
3345 is not a GC root. */
3346 if (!function_depth)
3351 gcc_assert (DECL_SAVED_TREE (fn));
3353 /* If this is a constructor or destructor body, we have to clone
3355 if (maybe_clone_body (fn))
3357 /* We don't want to process FN again, so pretend we've written
3358 it out, even though we haven't. */
3359 TREE_ASM_WRITTEN (fn) = 1;
3360 DECL_SAVED_TREE (fn) = NULL_TREE;
3364 /* We make a decision about linkage for these functions at the end
3365 of the compilation. Until that point, we do not want the back
3366 end to output them -- but we do want it to see the bodies of
3367 these functions so that it can inline them as appropriate. */
3368 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3370 if (DECL_INTERFACE_KNOWN (fn))
3371 /* We've already made a decision as to how this function will
3375 DECL_EXTERNAL (fn) = 1;
3376 DECL_NOT_REALLY_EXTERN (fn) = 1;
3377 note_vague_linkage_fn (fn);
3378 /* A non-template inline function with external linkage will
3379 always be COMDAT. As we must eventually determine the
3380 linkage of all functions, and as that causes writes to
3381 the data mapped in from the PCH file, it's advantageous
3382 to mark the functions at this point. */
3383 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3385 /* This function must have external linkage, as
3386 otherwise DECL_INTERFACE_KNOWN would have been
3388 gcc_assert (TREE_PUBLIC (fn));
3389 comdat_linkage (fn);
3390 DECL_INTERFACE_KNOWN (fn) = 1;
3394 import_export_decl (fn);
3396 /* If the user wants us to keep all inline functions, then mark
3397 this function as needed so that finish_file will make sure to
3398 output it later. Similarly, all dllexport'd functions must
3399 be emitted; there may be callers in other DLLs. */
3400 if ((flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3401 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3405 /* There's no reason to do any of the work here if we're only doing
3406 semantic analysis; this code just generates RTL. */
3407 if (flag_syntax_only)
3414 expand_or_defer_fn (tree fn)
3416 if (expand_or_defer_fn_1 (fn))
3420 /* Expand or defer, at the whim of the compilation unit manager. */
3421 cgraph_finalize_function (fn, function_depth > 1);
3434 /* Helper function for walk_tree, used by finalize_nrv below. */
3437 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3439 struct nrv_data *dp = (struct nrv_data *)data;
3442 /* No need to walk into types. There wouldn't be any need to walk into
3443 non-statements, except that we have to consider STMT_EXPRs. */
3446 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3447 but differs from using NULL_TREE in that it indicates that we care
3448 about the value of the RESULT_DECL. */
3449 else if (TREE_CODE (*tp) == RETURN_EXPR)
3450 TREE_OPERAND (*tp, 0) = dp->result;
3451 /* Change all cleanups for the NRV to only run when an exception is
3453 else if (TREE_CODE (*tp) == CLEANUP_STMT
3454 && CLEANUP_DECL (*tp) == dp->var)
3455 CLEANUP_EH_ONLY (*tp) = 1;
3456 /* Replace the DECL_EXPR for the NRV with an initialization of the
3457 RESULT_DECL, if needed. */
3458 else if (TREE_CODE (*tp) == DECL_EXPR
3459 && DECL_EXPR_DECL (*tp) == dp->var)
3462 if (DECL_INITIAL (dp->var)
3463 && DECL_INITIAL (dp->var) != error_mark_node)
3464 init = build2 (INIT_EXPR, void_type_node, dp->result,
3465 DECL_INITIAL (dp->var));
3467 init = build_empty_stmt (EXPR_LOCATION (*tp));
3468 DECL_INITIAL (dp->var) = NULL_TREE;
3469 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3472 /* And replace all uses of the NRV with the RESULT_DECL. */
3473 else if (*tp == dp->var)
3476 /* Avoid walking into the same tree more than once. Unfortunately, we
3477 can't just use walk_tree_without duplicates because it would only call
3478 us for the first occurrence of dp->var in the function body. */
3479 slot = htab_find_slot (dp->visited, *tp, INSERT);
3485 /* Keep iterating. */
3489 /* Called from finish_function to implement the named return value
3490 optimization by overriding all the RETURN_EXPRs and pertinent
3491 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3492 RESULT_DECL for the function. */
3495 finalize_nrv (tree *tp, tree var, tree result)
3497 struct nrv_data data;
3499 /* Copy debugging information from VAR to RESULT. */
3500 DECL_NAME (result) = DECL_NAME (var);
3501 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3502 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3503 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3504 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3505 /* Don't forget that we take its address. */
3506 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3509 data.result = result;
3510 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3511 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3512 htab_delete (data.visited);
3515 /* Return the declaration for the function called by CALL_EXPR T,
3516 TYPE is the class type of the clause decl. */
3519 omp_clause_info_fndecl (tree t, tree type)
3521 tree ret = get_callee_fndecl (t);
3526 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3527 t = CALL_EXPR_FN (t);
3529 if (TREE_CODE (t) == OBJ_TYPE_REF)
3531 t = cp_fold_obj_type_ref (t, type);
3532 if (TREE_CODE (t) == ADDR_EXPR
3533 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3534 return TREE_OPERAND (t, 0);
3540 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3543 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3544 bool need_copy_ctor, bool need_copy_assignment)
3546 int save_errorcount = errorcount;
3549 /* Always allocate 3 elements for simplicity. These are the
3550 function decls for the ctor, dtor, and assignment op.
3551 This layout is known to the three lang hooks,
3552 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3553 and cxx_omp_clause_assign_op. */
3554 info = make_tree_vec (3);
3555 CP_OMP_CLAUSE_INFO (c) = info;
3557 if (need_default_ctor
3558 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3562 if (need_default_ctor)
3566 t = build_int_cst (build_pointer_type (type), 0);
3567 t = build1 (INDIRECT_REF, type, t);
3568 vec = make_tree_vector_single (t);
3570 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3571 &vec, type, LOOKUP_NORMAL,
3572 tf_warning_or_error);
3575 release_tree_vector (vec);
3577 if (targetm.cxx.cdtor_returns_this () || errorcount)
3578 /* Because constructors and destructors return this,
3579 the call will have been cast to "void". Remove the
3580 cast here. We would like to use STRIP_NOPS, but it
3581 wouldn't work here because TYPE_MODE (t) and
3582 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3583 They are VOIDmode and Pmode, respectively. */
3584 if (TREE_CODE (t) == NOP_EXPR)
3585 t = TREE_OPERAND (t, 0);
3587 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3590 if ((need_default_ctor || need_copy_ctor)
3591 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3593 t = build_int_cst (build_pointer_type (type), 0);
3594 t = build1 (INDIRECT_REF, type, t);
3595 t = build_special_member_call (t, complete_dtor_identifier,
3596 NULL, type, LOOKUP_NORMAL,
3597 tf_warning_or_error);
3599 if (targetm.cxx.cdtor_returns_this () || errorcount)
3600 /* Because constructors and destructors return this,
3601 the call will have been cast to "void". Remove the
3602 cast here. We would like to use STRIP_NOPS, but it
3603 wouldn't work here because TYPE_MODE (t) and
3604 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3605 They are VOIDmode and Pmode, respectively. */
3606 if (TREE_CODE (t) == NOP_EXPR)
3607 t = TREE_OPERAND (t, 0);
3609 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3612 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3616 t = build_int_cst (build_pointer_type (type), 0);
3617 t = build1 (INDIRECT_REF, type, t);
3618 vec = make_tree_vector_single (t);
3619 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3620 &vec, type, LOOKUP_NORMAL,
3621 tf_warning_or_error);
3622 release_tree_vector (vec);
3624 /* We'll have called convert_from_reference on the call, which
3625 may well have added an indirect_ref. It's unneeded here,
3626 and in the way, so kill it. */
3627 if (TREE_CODE (t) == INDIRECT_REF)
3628 t = TREE_OPERAND (t, 0);
3630 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3633 return errorcount != save_errorcount;
3636 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3637 Remove any elements from the list that are invalid. */
3640 finish_omp_clauses (tree clauses)
3642 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3643 tree c, t, *pc = &clauses;
3646 bitmap_obstack_initialize (NULL);
3647 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3648 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3649 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3651 for (pc = &clauses, c = clauses; c ; c = *pc)
3653 bool remove = false;
3655 switch (OMP_CLAUSE_CODE (c))
3657 case OMP_CLAUSE_SHARED:
3659 goto check_dup_generic;
3660 case OMP_CLAUSE_PRIVATE:
3662 goto check_dup_generic;
3663 case OMP_CLAUSE_REDUCTION:
3665 goto check_dup_generic;
3666 case OMP_CLAUSE_COPYPRIVATE:
3667 name = "copyprivate";
3668 goto check_dup_generic;
3669 case OMP_CLAUSE_COPYIN:
3671 goto check_dup_generic;
3673 t = OMP_CLAUSE_DECL (c);
3674 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3676 if (processing_template_decl)
3679 error ("%qD is not a variable in clause %qs", t, name);
3681 error ("%qE is not a variable in clause %qs", t, name);
3684 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3685 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3686 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3688 error ("%qD appears more than once in data clauses", t);
3692 bitmap_set_bit (&generic_head, DECL_UID (t));
3695 case OMP_CLAUSE_FIRSTPRIVATE:
3696 t = OMP_CLAUSE_DECL (c);
3697 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3699 if (processing_template_decl)
3702 error ("%qD is not a variable in clause %<firstprivate%>", t);
3704 error ("%qE is not a variable in clause %<firstprivate%>", t);
3707 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3708 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3710 error ("%qD appears more than once in data clauses", t);
3714 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3717 case OMP_CLAUSE_LASTPRIVATE:
3718 t = OMP_CLAUSE_DECL (c);
3719 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3721 if (processing_template_decl)
3724 error ("%qD is not a variable in clause %<lastprivate%>", t);
3726 error ("%qE is not a variable in clause %<lastprivate%>", t);
3729 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3730 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3732 error ("%qD appears more than once in data clauses", t);
3736 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3740 t = OMP_CLAUSE_IF_EXPR (c);
3741 t = maybe_convert_cond (t);
3742 if (t == error_mark_node)
3744 OMP_CLAUSE_IF_EXPR (c) = t;
3747 case OMP_CLAUSE_NUM_THREADS:
3748 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3749 if (t == error_mark_node)
3751 else if (!type_dependent_expression_p (t)
3752 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3754 error ("num_threads expression must be integral");
3759 case OMP_CLAUSE_SCHEDULE:
3760 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3763 else if (t == error_mark_node)
3765 else if (!type_dependent_expression_p (t)
3766 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3768 error ("schedule chunk size expression must be integral");
3773 case OMP_CLAUSE_NOWAIT:
3774 case OMP_CLAUSE_ORDERED:
3775 case OMP_CLAUSE_DEFAULT:
3776 case OMP_CLAUSE_UNTIED:
3777 case OMP_CLAUSE_COLLAPSE:
3785 *pc = OMP_CLAUSE_CHAIN (c);
3787 pc = &OMP_CLAUSE_CHAIN (c);
3790 for (pc = &clauses, c = clauses; c ; c = *pc)
3792 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3793 bool remove = false;
3794 bool need_complete_non_reference = false;
3795 bool need_default_ctor = false;
3796 bool need_copy_ctor = false;
3797 bool need_copy_assignment = false;
3798 bool need_implicitly_determined = false;
3799 tree type, inner_type;
3803 case OMP_CLAUSE_SHARED:
3805 need_implicitly_determined = true;
3807 case OMP_CLAUSE_PRIVATE:
3809 need_complete_non_reference = true;
3810 need_default_ctor = true;
3811 need_implicitly_determined = true;
3813 case OMP_CLAUSE_FIRSTPRIVATE:
3814 name = "firstprivate";
3815 need_complete_non_reference = true;
3816 need_copy_ctor = true;
3817 need_implicitly_determined = true;
3819 case OMP_CLAUSE_LASTPRIVATE:
3820 name = "lastprivate";
3821 need_complete_non_reference = true;
3822 need_copy_assignment = true;
3823 need_implicitly_determined = true;
3825 case OMP_CLAUSE_REDUCTION:
3827 need_implicitly_determined = true;
3829 case OMP_CLAUSE_COPYPRIVATE:
3830 name = "copyprivate";
3831 need_copy_assignment = true;
3833 case OMP_CLAUSE_COPYIN:
3835 need_copy_assignment = true;
3838 pc = &OMP_CLAUSE_CHAIN (c);
3842 t = OMP_CLAUSE_DECL (c);
3843 if (processing_template_decl
3844 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3846 pc = &OMP_CLAUSE_CHAIN (c);
3852 case OMP_CLAUSE_LASTPRIVATE:
3853 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3854 need_default_ctor = true;
3857 case OMP_CLAUSE_REDUCTION:
3858 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3859 || POINTER_TYPE_P (TREE_TYPE (t)))
3861 error ("%qE has invalid type for %<reduction%>", t);
3864 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3866 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3874 error ("%qE has invalid type for %<reduction(%s)%>",
3875 t, operator_name_info[r_code].name);
3881 case OMP_CLAUSE_COPYIN:
3882 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3884 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3893 if (need_complete_non_reference)
3895 t = require_complete_type (t);
3896 if (t == error_mark_node)
3898 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3900 error ("%qE has reference type for %qs", t, name);
3904 if (need_implicitly_determined)
3906 const char *share_name = NULL;
3908 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3909 share_name = "threadprivate";
3910 else switch (cxx_omp_predetermined_sharing (t))
3912 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3914 case OMP_CLAUSE_DEFAULT_SHARED:
3915 share_name = "shared";
3917 case OMP_CLAUSE_DEFAULT_PRIVATE:
3918 share_name = "private";
3925 error ("%qE is predetermined %qs for %qs",
3926 t, share_name, name);
3931 /* We're interested in the base element, not arrays. */
3932 inner_type = type = TREE_TYPE (t);
3933 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3934 inner_type = TREE_TYPE (inner_type);
3936 /* Check for special function availability by building a call to one.
3937 Save the results, because later we won't be in the right context
3938 for making these queries. */
3939 if (CLASS_TYPE_P (inner_type)
3940 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3941 && !type_dependent_expression_p (t)
3942 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3943 need_copy_ctor, need_copy_assignment))
3947 *pc = OMP_CLAUSE_CHAIN (c);
3949 pc = &OMP_CLAUSE_CHAIN (c);
3952 bitmap_obstack_release (NULL);
3956 /* For all variables in the tree_list VARS, mark them as thread local. */
3959 finish_omp_threadprivate (tree vars)
3963 /* Mark every variable in VARS to be assigned thread local storage. */
3964 for (t = vars; t; t = TREE_CHAIN (t))
3966 tree v = TREE_PURPOSE (t);
3968 if (error_operand_p (v))
3970 else if (TREE_CODE (v) != VAR_DECL)
3971 error ("%<threadprivate%> %qD is not file, namespace "
3972 "or block scope variable", v);
3973 /* If V had already been marked threadprivate, it doesn't matter
3974 whether it had been used prior to this point. */
3975 else if (TREE_USED (v)
3976 && (DECL_LANG_SPECIFIC (v) == NULL
3977 || !CP_DECL_THREADPRIVATE_P (v)))
3978 error ("%qE declared %<threadprivate%> after first use", v);
3979 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3980 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3981 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3982 error ("%<threadprivate%> %qE has incomplete type", v);
3983 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3984 && CP_DECL_CONTEXT (v) != current_class_type)
3985 error ("%<threadprivate%> %qE directive not "
3986 "in %qT definition", v, CP_DECL_CONTEXT (v));
3989 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3990 if (DECL_LANG_SPECIFIC (v) == NULL)
3992 retrofit_lang_decl (v);
3994 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3995 after the allocation of the lang_decl structure. */
3996 if (DECL_DISCRIMINATOR_P (v))
3997 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4000 if (! DECL_THREAD_LOCAL_P (v))
4002 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4003 /* If rtl has been already set for this var, call
4004 make_decl_rtl once again, so that encode_section_info
4005 has a chance to look at the new decl flags. */
4006 if (DECL_RTL_SET_P (v))
4009 CP_DECL_THREADPRIVATE_P (v) = 1;
4014 /* Build an OpenMP structured block. */
4017 begin_omp_structured_block (void)
4019 return do_pushlevel (sk_omp);
4023 finish_omp_structured_block (tree block)
4025 return do_poplevel (block);
4028 /* Similarly, except force the retention of the BLOCK. */
4031 begin_omp_parallel (void)
4033 keep_next_level (true);
4034 return begin_omp_structured_block ();
4038 finish_omp_parallel (tree clauses, tree body)
4042 body = finish_omp_structured_block (body);
4044 stmt = make_node (OMP_PARALLEL);
4045 TREE_TYPE (stmt) = void_type_node;
4046 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4047 OMP_PARALLEL_BODY (stmt) = body;
4049 return add_stmt (stmt);
4053 begin_omp_task (void)
4055 keep_next_level (true);
4056 return begin_omp_structured_block ();
4060 finish_omp_task (tree clauses, tree body)
4064 body = finish_omp_structured_block (body);
4066 stmt = make_node (OMP_TASK);
4067 TREE_TYPE (stmt) = void_type_node;
4068 OMP_TASK_CLAUSES (stmt) = clauses;
4069 OMP_TASK_BODY (stmt) = body;
4071 return add_stmt (stmt);
4074 /* Helper function for finish_omp_for. Convert Ith random access iterator
4075 into integral iterator. Return FALSE if successful. */
4078 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4079 tree condv, tree incrv, tree *body,
4080 tree *pre_body, tree clauses)
4082 tree diff, iter_init, iter_incr = NULL, last;
4083 tree incr_var = NULL, orig_pre_body, orig_body, c;
4084 tree decl = TREE_VEC_ELT (declv, i);
4085 tree init = TREE_VEC_ELT (initv, i);
4086 tree cond = TREE_VEC_ELT (condv, i);
4087 tree incr = TREE_VEC_ELT (incrv, i);
4089 location_t elocus = locus;
4091 if (init && EXPR_HAS_LOCATION (init))
4092 elocus = EXPR_LOCATION (init);
4094 switch (TREE_CODE (cond))
4100 if (TREE_OPERAND (cond, 1) == iter)
4101 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4102 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4103 if (TREE_OPERAND (cond, 0) != iter)
4104 cond = error_mark_node;
4107 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4108 TREE_OPERAND (cond, 1), ERROR_MARK,
4109 NULL, tf_warning_or_error);
4110 if (error_operand_p (tem))
4115 cond = error_mark_node;
4118 if (cond == error_mark_node)
4120 error_at (elocus, "invalid controlling predicate");
4123 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4124 ERROR_MARK, iter, ERROR_MARK, NULL,
4125 tf_warning_or_error);
4126 if (error_operand_p (diff))
4128 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4130 error_at (elocus, "difference between %qE and %qD does not have integer type",
4131 TREE_OPERAND (cond, 1), iter);
4135 switch (TREE_CODE (incr))
4137 case PREINCREMENT_EXPR:
4138 case PREDECREMENT_EXPR:
4139 case POSTINCREMENT_EXPR:
4140 case POSTDECREMENT_EXPR:
4141 if (TREE_OPERAND (incr, 0) != iter)
4143 incr = error_mark_node;
4146 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4147 tf_warning_or_error);
4148 if (error_operand_p (iter_incr))
4150 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4151 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4152 incr = integer_one_node;
4154 incr = integer_minus_one_node;
4157 if (TREE_OPERAND (incr, 0) != iter)
4158 incr = error_mark_node;
4159 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4160 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4162 tree rhs = TREE_OPERAND (incr, 1);
4163 if (TREE_OPERAND (rhs, 0) == iter)
4165 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4167 incr = error_mark_node;
4170 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4171 TREE_OPERAND (rhs, 1),
4172 tf_warning_or_error);
4173 if (error_operand_p (iter_incr))
4175 incr = TREE_OPERAND (rhs, 1);
4176 incr = cp_convert (TREE_TYPE (diff), incr);
4177 if (TREE_CODE (rhs) == MINUS_EXPR)
4179 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4180 incr = fold_if_not_in_template (incr);
4182 if (TREE_CODE (incr) != INTEGER_CST
4183 && (TREE_CODE (incr) != NOP_EXPR
4184 || (TREE_CODE (TREE_OPERAND (incr, 0))
4189 else if (TREE_OPERAND (rhs, 1) == iter)
4191 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4192 || TREE_CODE (rhs) != PLUS_EXPR)
4193 incr = error_mark_node;
4196 iter_incr = build_x_binary_op (PLUS_EXPR,
4197 TREE_OPERAND (rhs, 0),
4200 tf_warning_or_error);
4201 if (error_operand_p (iter_incr))
4203 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4205 tf_warning_or_error);
4206 if (error_operand_p (iter_incr))
4208 incr = TREE_OPERAND (rhs, 0);
4213 incr = error_mark_node;
4216 incr = error_mark_node;
4219 incr = error_mark_node;
4223 if (incr == error_mark_node)
4225 error_at (elocus, "invalid increment expression");
4229 incr = cp_convert (TREE_TYPE (diff), incr);
4230 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4231 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4232 && OMP_CLAUSE_DECL (c) == iter)
4235 decl = create_temporary_var (TREE_TYPE (diff));
4237 add_decl_expr (decl);
4238 last = create_temporary_var (TREE_TYPE (diff));
4240 add_decl_expr (last);
4241 if (c && iter_incr == NULL)
4243 incr_var = create_temporary_var (TREE_TYPE (diff));
4244 pushdecl (incr_var);
4245 add_decl_expr (incr_var);
4247 gcc_assert (stmts_are_full_exprs_p ());
4249 orig_pre_body = *pre_body;
4250 *pre_body = push_stmt_list ();
4252 add_stmt (orig_pre_body);
4254 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4255 tf_warning_or_error));
4256 init = build_int_cst (TREE_TYPE (diff), 0);
4257 if (c && iter_incr == NULL)
4259 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4260 incr, tf_warning_or_error));
4262 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4263 tf_warning_or_error);
4265 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4266 tf_warning_or_error));
4267 *pre_body = pop_stmt_list (*pre_body);
4269 cond = cp_build_binary_op (elocus,
4270 TREE_CODE (cond), decl, diff,
4271 tf_warning_or_error);
4272 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4273 elocus, incr, NULL_TREE);
4276 *body = push_stmt_list ();
4277 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4278 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4279 tf_warning_or_error);
4280 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4281 finish_expr_stmt (iter_init);
4282 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4283 tf_warning_or_error));
4284 add_stmt (orig_body);
4285 *body = pop_stmt_list (*body);
4289 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4290 finish_expr_stmt (iter_incr);
4291 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4292 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4295 TREE_VEC_ELT (declv, i) = decl;
4296 TREE_VEC_ELT (initv, i) = init;
4297 TREE_VEC_ELT (condv, i) = cond;
4298 TREE_VEC_ELT (incrv, i) = incr;
4303 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4304 are directly for their associated operands in the statement. DECL
4305 and INIT are a combo; if DECL is NULL then INIT ought to be a
4306 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4307 optional statements that need to go before the loop into its
4311 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4312 tree incrv, tree body, tree pre_body, tree clauses)
4314 tree omp_for = NULL, orig_incr = NULL;
4315 tree decl, init, cond, incr;
4319 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4320 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4321 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4322 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4324 decl = TREE_VEC_ELT (declv, i);
4325 init = TREE_VEC_ELT (initv, i);
4326 cond = TREE_VEC_ELT (condv, i);
4327 incr = TREE_VEC_ELT (incrv, i);
4333 switch (TREE_CODE (init))
4336 decl = TREE_OPERAND (init, 0);
4337 init = TREE_OPERAND (init, 1);
4340 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4342 decl = TREE_OPERAND (init, 0);
4343 init = TREE_OPERAND (init, 2);
4353 "expected iteration declaration or initialization");
4358 if (init && EXPR_HAS_LOCATION (init))
4359 elocus = EXPR_LOCATION (init);
4363 error_at (elocus, "missing controlling predicate");
4369 error_at (elocus, "missing increment expression");
4373 TREE_VEC_ELT (declv, i) = decl;
4374 TREE_VEC_ELT (initv, i) = init;
4377 if (dependent_omp_for_p (declv, initv, condv, incrv))
4381 stmt = make_node (OMP_FOR);
4383 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4385 /* This is really just a place-holder. We'll be decomposing this
4386 again and going through the cp_build_modify_expr path below when
4387 we instantiate the thing. */
4388 TREE_VEC_ELT (initv, i)
4389 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4390 TREE_VEC_ELT (initv, i));
4393 TREE_TYPE (stmt) = void_type_node;
4394 OMP_FOR_INIT (stmt) = initv;
4395 OMP_FOR_COND (stmt) = condv;
4396 OMP_FOR_INCR (stmt) = incrv;
4397 OMP_FOR_BODY (stmt) = body;
4398 OMP_FOR_PRE_BODY (stmt) = pre_body;
4399 OMP_FOR_CLAUSES (stmt) = clauses;
4401 SET_EXPR_LOCATION (stmt, locus);
4402 return add_stmt (stmt);
4405 if (processing_template_decl)
4406 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4408 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4410 decl = TREE_VEC_ELT (declv, i);
4411 init = TREE_VEC_ELT (initv, i);
4412 cond = TREE_VEC_ELT (condv, i);
4413 incr = TREE_VEC_ELT (incrv, i);
4415 TREE_VEC_ELT (orig_incr, i) = incr;
4418 if (init && EXPR_HAS_LOCATION (init))
4419 elocus = EXPR_LOCATION (init);
4423 error_at (elocus, "expected iteration declaration or initialization");
4427 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4430 TREE_VEC_ELT (orig_incr, i) = incr;
4431 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4432 TREE_CODE (TREE_OPERAND (incr, 1)),
4433 TREE_OPERAND (incr, 2),
4434 tf_warning_or_error);
4437 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4439 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4440 incrv, &body, &pre_body, clauses))
4445 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4446 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4448 error_at (elocus, "invalid type for iteration variable %qE", decl);
4452 if (!processing_template_decl)
4454 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4455 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4458 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4460 && TREE_SIDE_EFFECTS (cond)
4461 && COMPARISON_CLASS_P (cond)
4462 && !processing_template_decl)
4464 tree t = TREE_OPERAND (cond, 0);
4465 if (TREE_SIDE_EFFECTS (t)
4467 && (TREE_CODE (t) != NOP_EXPR
4468 || TREE_OPERAND (t, 0) != decl))
4469 TREE_OPERAND (cond, 0)
4470 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4472 t = TREE_OPERAND (cond, 1);
4473 if (TREE_SIDE_EFFECTS (t)
4475 && (TREE_CODE (t) != NOP_EXPR
4476 || TREE_OPERAND (t, 0) != decl))
4477 TREE_OPERAND (cond, 1)
4478 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4480 if (decl == error_mark_node || init == error_mark_node)
4483 TREE_VEC_ELT (declv, i) = decl;
4484 TREE_VEC_ELT (initv, i) = init;
4485 TREE_VEC_ELT (condv, i) = cond;
4486 TREE_VEC_ELT (incrv, i) = incr;
4490 if (IS_EMPTY_STMT (pre_body))
4493 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4496 if (omp_for == NULL)
4499 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4501 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4502 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4504 if (TREE_CODE (incr) != MODIFY_EXPR)
4507 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4508 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4509 && !processing_template_decl)
4511 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4512 if (TREE_SIDE_EFFECTS (t)
4514 && (TREE_CODE (t) != NOP_EXPR
4515 || TREE_OPERAND (t, 0) != decl))
4516 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4517 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4519 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4520 if (TREE_SIDE_EFFECTS (t)
4522 && (TREE_CODE (t) != NOP_EXPR
4523 || TREE_OPERAND (t, 0) != decl))
4524 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4525 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4529 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4531 if (omp_for != NULL)
4532 OMP_FOR_CLAUSES (omp_for) = clauses;
4537 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4546 dependent_p = false;
4549 /* Even in a template, we can detect invalid uses of the atomic
4550 pragma if neither LHS nor RHS is type-dependent. */
4551 if (processing_template_decl)
4553 dependent_p = (type_dependent_expression_p (lhs)
4554 || type_dependent_expression_p (rhs));
4557 lhs = build_non_dependent_expr (lhs);
4558 rhs = build_non_dependent_expr (rhs);
4563 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4564 if (stmt == error_mark_node)
4567 if (processing_template_decl)
4568 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4569 build2 (code, void_type_node, orig_lhs, orig_rhs));
4574 finish_omp_barrier (void)
4576 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4577 VEC(tree,gc) *vec = make_tree_vector ();
4578 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4579 release_tree_vector (vec);
4580 finish_expr_stmt (stmt);
4584 finish_omp_flush (void)
4586 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4587 VEC(tree,gc) *vec = make_tree_vector ();
4588 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4589 release_tree_vector (vec);
4590 finish_expr_stmt (stmt);
4594 finish_omp_taskwait (void)
4596 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4597 VEC(tree,gc) *vec = make_tree_vector ();
4598 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4599 release_tree_vector (vec);
4600 finish_expr_stmt (stmt);
4604 init_cp_semantics (void)
4608 /* Build a STATIC_ASSERT for a static assertion with the condition
4609 CONDITION and the message text MESSAGE. LOCATION is the location
4610 of the static assertion in the source code. When MEMBER_P, this
4611 static assertion is a member of a class. */
4613 finish_static_assert (tree condition, tree message, location_t location,
4616 if (check_for_bare_parameter_packs (condition))
4617 condition = error_mark_node;
4619 if (type_dependent_expression_p (condition)
4620 || value_dependent_expression_p (condition))
4622 /* We're in a template; build a STATIC_ASSERT and put it in
4626 assertion = make_node (STATIC_ASSERT);
4627 STATIC_ASSERT_CONDITION (assertion) = condition;
4628 STATIC_ASSERT_MESSAGE (assertion) = message;
4629 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4632 maybe_add_class_template_decl_list (current_class_type,
4636 add_stmt (assertion);
4641 /* Fold the expression and convert it to a boolean value. */
4642 condition = fold_non_dependent_expr (condition);
4643 condition = cp_convert (boolean_type_node, condition);
4645 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4646 /* Do nothing; the condition is satisfied. */
4650 location_t saved_loc = input_location;
4652 input_location = location;
4653 if (TREE_CODE (condition) == INTEGER_CST
4654 && integer_zerop (condition))
4655 /* Report the error. */
4656 error ("static assertion failed: %E", message);
4657 else if (condition && condition != error_mark_node)
4658 error ("non-constant condition for static assertion");
4659 input_location = saved_loc;
4663 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4664 just return the type even though EXPR is a type-dependent expression.
4665 The ABI specifies which cases this applies to, which is a subset of the
4669 describable_type (tree expr)
4671 tree type = NULL_TREE;
4673 if (! type_dependent_expression_p (expr)
4674 && ! type_unknown_p (expr))
4676 type = unlowered_expr_type (expr);
4677 if (real_lvalue_p (expr))
4678 type = build_reference_type (type);
4684 switch (TREE_CODE (expr))
4690 /* Named rvalue reference becomes lvalue. */
4691 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4696 case TEMPLATE_PARM_INDEX:
4698 case STATIC_CAST_EXPR:
4699 case REINTERPRET_CAST_EXPR:
4700 case CONST_CAST_EXPR:
4701 case DYNAMIC_CAST_EXPR:
4702 type = TREE_TYPE (expr);
4707 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4708 if (ptrtype && POINTER_TYPE_P (ptrtype))
4709 type = build_reference_type (TREE_TYPE (ptrtype));
4714 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4715 type = TREE_TYPE (expr);
4719 if (type && type_uses_auto (type))
4725 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4726 suitable for use as a type-specifier.
4728 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4729 id-expression or a class member access, FALSE when it was parsed as
4730 a full expression. */
4733 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4735 tree orig_expr = expr;
4736 tree type = NULL_TREE;
4738 if (!expr || error_operand_p (expr))
4739 return error_mark_node;
4742 || TREE_CODE (expr) == TYPE_DECL
4743 || (TREE_CODE (expr) == BIT_NOT_EXPR
4744 && TYPE_P (TREE_OPERAND (expr, 0))))
4746 error ("argument to decltype must be an expression");
4747 return error_mark_node;
4750 if (type_dependent_expression_p (expr))
4752 if (id_expression_or_member_access_p)
4754 switch (TREE_CODE (expr))
4761 case TEMPLATE_PARM_INDEX:
4762 type = TREE_TYPE (expr);
4770 if (type && !type_uses_auto (type))
4773 type = cxx_make_type (DECLTYPE_TYPE);
4774 DECLTYPE_TYPE_EXPR (type) = expr;
4775 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4776 = id_expression_or_member_access_p;
4777 SET_TYPE_STRUCTURAL_EQUALITY (type);
4782 /* The type denoted by decltype(e) is defined as follows: */
4784 expr = resolve_nondeduced_context (expr);
4785 if (id_expression_or_member_access_p)
4787 /* If e is an id-expression or a class member access (5.2.5
4788 [expr.ref]), decltype(e) is defined as the type of the entity
4789 named by e. If there is no such entity, or e names a set of
4790 overloaded functions, the program is ill-formed. */
4791 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4792 expr = lookup_name (expr);
4794 if (TREE_CODE (expr) == INDIRECT_REF)
4795 /* This can happen when the expression is, e.g., "a.b". Just
4796 look at the underlying operand. */
4797 expr = TREE_OPERAND (expr, 0);
4799 if (TREE_CODE (expr) == OFFSET_REF
4800 || TREE_CODE (expr) == MEMBER_REF)
4801 /* We're only interested in the field itself. If it is a
4802 BASELINK, we will need to see through it in the next
4804 expr = TREE_OPERAND (expr, 1);
4806 if (TREE_CODE (expr) == BASELINK)
4807 /* See through BASELINK nodes to the underlying functions. */
4808 expr = BASELINK_FUNCTIONS (expr);
4810 if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
4811 expr = TREE_OPERAND (expr, 0);
4813 if (TREE_CODE (expr) == OVERLOAD)
4815 if (OVL_CHAIN (expr)
4816 || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL)
4818 error ("%qE refers to a set of overloaded functions", orig_expr);
4819 return error_mark_node;
4822 /* An overload set containing only one function: just look
4823 at that function. */
4824 expr = OVL_FUNCTION (expr);
4827 switch (TREE_CODE (expr))
4830 if (DECL_BIT_FIELD_TYPE (expr))
4832 type = DECL_BIT_FIELD_TYPE (expr);
4835 /* Fall through for fields that aren't bitfields. */
4842 case TEMPLATE_PARM_INDEX:
4843 type = TREE_TYPE (expr);
4847 type = error_mark_node;
4851 type = is_bitfield_expr_with_lowered_type (expr);
4853 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4860 /* We can get here when the id-expression refers to an
4862 type = TREE_TYPE (expr);
4866 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4867 || TREE_CODE (expr) == SCOPE_REF);
4868 error ("argument to decltype must be an expression");
4869 return error_mark_node;
4874 /* Expressions of reference type are sometimes wrapped in
4875 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4876 representation, not part of the language, so we have to look
4878 if (TREE_CODE (expr) == INDIRECT_REF
4879 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4881 expr = TREE_OPERAND (expr, 0);
4883 if (TREE_CODE (expr) == CALL_EXPR)
4885 /* If e is a function call (5.2.2 [expr.call]) or an
4886 invocation of an overloaded operator (parentheses around e
4887 are ignored), decltype(e) is defined as the return type of
4889 tree fndecl = get_callee_fndecl (expr);
4890 if (fndecl && fndecl != error_mark_node)
4891 type = TREE_TYPE (TREE_TYPE (fndecl));
4894 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4895 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4896 || TREE_CODE (target_type) == POINTER_TYPE)
4897 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4898 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4899 type = TREE_TYPE (TREE_TYPE (target_type));
4901 sorry ("unable to determine the declared type of expression %<%E%>",
4907 type = is_bitfield_expr_with_lowered_type (expr);
4910 /* Bitfields are special, because their type encodes the
4911 number of bits they store. If the expression referenced a
4912 bitfield, TYPE now has the declared type of that
4914 type = cp_build_qualified_type (type,
4915 cp_type_quals (TREE_TYPE (expr)));
4917 if (real_lvalue_p (expr))
4918 type = build_reference_type (type);
4920 /* Within a lambda-expression:
4922 Every occurrence of decltype((x)) where x is a possibly
4923 parenthesized id-expression that names an entity of
4924 automatic storage duration is treated as if x were
4925 transformed into an access to a corresponding data member
4926 of the closure type that would have been declared if x
4927 were a use of the denoted entity. */
4928 else if (outer_automatic_var_p (expr)
4929 && current_function_decl
4930 && LAMBDA_FUNCTION_P (current_function_decl))
4931 type = capture_decltype (expr);
4934 /* Otherwise, where T is the type of e, if e is an lvalue,
4935 decltype(e) is defined as T&, otherwise decltype(e) is
4937 type = TREE_TYPE (expr);
4938 if (type == error_mark_node)
4939 return error_mark_node;
4940 else if (expr == current_class_ptr)
4941 /* If the expression is just "this", we want the
4942 cv-unqualified pointer for the "this" type. */
4943 type = TYPE_MAIN_VARIANT (type);
4944 else if (real_lvalue_p (expr))
4946 if (TREE_CODE (type) != REFERENCE_TYPE)
4947 type = build_reference_type (type);
4950 type = non_reference (type);
4955 if (!type || type == unknown_type_node)
4957 error ("type of %qE is unknown", expr);
4958 return error_mark_node;
4964 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4965 __has_nothrow_copy, depending on assign_p. */
4968 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4975 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4978 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4980 else if (TYPE_HAS_INIT_REF (type))
4982 /* If construction of the copy constructor was postponed, create
4984 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4985 lazily_declare_fn (sfk_copy_constructor, type);
4986 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
4987 lazily_declare_fn (sfk_move_constructor, type);
4988 fns = CLASSTYPE_CONSTRUCTORS (type);
4993 for (; fns; fns = OVL_NEXT (fns))
4995 tree fn = OVL_CURRENT (fns);
4999 if (copy_fn_p (fn) == 0)
5002 else if (copy_fn_p (fn) <= 0)
5005 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5012 /* Actually evaluates the trait. */
5015 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5017 enum tree_code type_code1;
5020 type_code1 = TREE_CODE (type1);
5024 case CPTK_HAS_NOTHROW_ASSIGN:
5025 type1 = strip_array_types (type1);
5026 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5027 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5028 || (CLASS_TYPE_P (type1)
5029 && classtype_has_nothrow_assign_or_copy_p (type1,
5032 case CPTK_HAS_TRIVIAL_ASSIGN:
5033 /* ??? The standard seems to be missing the "or array of such a class
5034 type" wording for this trait. */
5035 type1 = strip_array_types (type1);
5036 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5037 && (trivial_type_p (type1)
5038 || (CLASS_TYPE_P (type1)
5039 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
5041 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5042 type1 = strip_array_types (type1);
5043 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5044 || (CLASS_TYPE_P (type1)
5045 && (t = locate_ctor (type1, NULL))
5046 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5048 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5049 type1 = strip_array_types (type1);
5050 return (trivial_type_p (type1)
5051 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5053 case CPTK_HAS_NOTHROW_COPY:
5054 type1 = strip_array_types (type1);
5055 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5056 || (CLASS_TYPE_P (type1)
5057 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5059 case CPTK_HAS_TRIVIAL_COPY:
5060 /* ??? The standard seems to be missing the "or array of such a class
5061 type" wording for this trait. */
5062 type1 = strip_array_types (type1);
5063 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5064 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
5066 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5067 type1 = strip_array_types (type1);
5068 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5069 || (CLASS_TYPE_P (type1)
5070 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5072 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5073 return (CLASS_TYPE_P (type1)
5074 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
5076 case CPTK_IS_ABSTRACT:
5077 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5079 case CPTK_IS_BASE_OF:
5080 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5081 && DERIVED_FROM_P (type1, type2));
5084 return (NON_UNION_CLASS_TYPE_P (type1));
5086 case CPTK_IS_CONVERTIBLE_TO:
5091 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5094 return (type_code1 == ENUMERAL_TYPE);
5097 return (pod_type_p (type1));
5099 case CPTK_IS_POLYMORPHIC:
5100 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5102 case CPTK_IS_STD_LAYOUT:
5103 return (std_layout_type_p (type1));
5105 case CPTK_IS_TRIVIAL:
5106 return (trivial_type_p (type1));
5109 return (type_code1 == UNION_TYPE);
5117 /* Returns true if TYPE is a complete type, an array of unknown bound,
5118 or (possibly cv-qualified) void, returns false otherwise. */
5121 check_trait_type (tree type)
5123 if (COMPLETE_TYPE_P (type))
5126 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
5129 if (VOID_TYPE_P (type))
5135 /* Process a trait expression. */
5138 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5140 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5141 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5142 || kind == CPTK_HAS_NOTHROW_COPY
5143 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5144 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5145 || kind == CPTK_HAS_TRIVIAL_COPY
5146 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5147 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5148 || kind == CPTK_IS_ABSTRACT
5149 || kind == CPTK_IS_BASE_OF
5150 || kind == CPTK_IS_CLASS
5151 || kind == CPTK_IS_CONVERTIBLE_TO
5152 || kind == CPTK_IS_EMPTY
5153 || kind == CPTK_IS_ENUM
5154 || kind == CPTK_IS_POD
5155 || kind == CPTK_IS_POLYMORPHIC
5156 || kind == CPTK_IS_STD_LAYOUT
5157 || kind == CPTK_IS_TRIVIAL
5158 || kind == CPTK_IS_UNION);
5160 if (kind == CPTK_IS_CONVERTIBLE_TO)
5162 sorry ("__is_convertible_to");
5163 return error_mark_node;
5166 if (type1 == error_mark_node
5167 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5168 && type2 == error_mark_node))
5169 return error_mark_node;
5171 if (processing_template_decl)
5173 tree trait_expr = make_node (TRAIT_EXPR);
5174 TREE_TYPE (trait_expr) = boolean_type_node;
5175 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5176 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5177 TRAIT_EXPR_KIND (trait_expr) = kind;
5181 complete_type (type1);
5183 complete_type (type2);
5187 case CPTK_HAS_NOTHROW_ASSIGN:
5188 case CPTK_HAS_TRIVIAL_ASSIGN:
5189 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5190 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5191 case CPTK_HAS_NOTHROW_COPY:
5192 case CPTK_HAS_TRIVIAL_COPY:
5193 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5194 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5195 case CPTK_IS_ABSTRACT:
5198 case CPTK_IS_POLYMORPHIC:
5199 case CPTK_IS_STD_LAYOUT:
5200 case CPTK_IS_TRIVIAL:
5201 if (!check_trait_type (type1))
5203 error ("incomplete type %qT not allowed", type1);
5204 return error_mark_node;
5208 case CPTK_IS_BASE_OF:
5209 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5210 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5211 && !COMPLETE_TYPE_P (type2))
5213 error ("incomplete type %qT not allowed", type2);
5214 return error_mark_node;
5223 case CPTK_IS_CONVERTIBLE_TO:
5228 return (trait_expr_value (kind, type1, type2)
5229 ? boolean_true_node : boolean_false_node);
5232 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5233 which is ignored for C++. */
5236 set_float_const_decimal64 (void)
5241 clear_float_const_decimal64 (void)
5246 float_const_decimal64_p (void)
5251 /* Return true if T is a literal type. */
5254 literal_type_p (tree t)
5256 if (SCALAR_TYPE_P (t))
5258 if (CLASS_TYPE_P (t))
5259 return CLASSTYPE_LITERAL_P (t);
5260 if (TREE_CODE (t) == ARRAY_TYPE)
5261 return literal_type_p (strip_array_types (t));
5266 /* If DECL is a variable declared `constexpr', require its type
5267 be literal. Return the DECL if OK, otherwise NULL. */
5270 ensure_literal_type_for_constexpr_object (tree decl)
5272 tree type = TREE_TYPE (decl);
5273 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5274 && !processing_template_decl && !literal_type_p (type))
5276 error ("the type %qT of constexpr variable %qD is not literal",
5283 /* Return non-null if FUN certainly designates a valid constexpr function
5284 declaration. Otherwise return NULL. Issue appropriate diagnostics
5285 if necessary. Note that we only check the declaration, not the body
5289 validate_constexpr_fundecl (tree fun)
5291 tree rettype = NULL;
5294 /* Don't bother if FUN is not marked constexpr. */
5295 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5298 /* For a function template, we have absolutely no guarantee that all
5299 instantiations will be constexpr. */
5300 if (TREE_CODE (fun) == TEMPLATE_DECL)
5303 parm = FUNCTION_FIRST_USER_PARM (fun);
5304 for (; parm != NULL; parm = TREE_CHAIN (parm))
5306 tree type = TREE_TYPE (parm);
5307 if (dependent_type_p (type))
5309 if (!literal_type_p (type))
5311 error ("parameter %q#D is not of literal type", parm);
5316 if (DECL_CONSTRUCTOR_P (fun))
5319 rettype = TREE_TYPE (TREE_TYPE (fun));
5320 if (dependent_type_p (rettype))
5322 if (!literal_type_p (rettype))
5324 error ("return type %qT of function %qD is not a literal type",
5325 TREE_TYPE (TREE_TYPE (fun)), fun);
5332 /* Constructor for a lambda expression. */
5335 build_lambda_expr (void)
5337 tree lambda = make_node (LAMBDA_EXPR);
5338 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
5339 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
5340 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
5341 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
5342 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
5346 /* Create the closure object for a LAMBDA_EXPR. */
5349 build_lambda_object (tree lambda_expr)
5351 /* Build aggregate constructor call.
5352 - cp_parser_braced_list
5353 - cp_parser_functional_cast */
5354 VEC(constructor_elt,gc) *elts = NULL;
5355 tree node, expr, type;
5356 location_t saved_loc;
5358 if (processing_template_decl)
5361 /* Make sure any error messages refer to the lambda-introducer. */
5362 saved_loc = input_location;
5363 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
5365 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
5367 node = TREE_CHAIN (node))
5369 tree field = TREE_PURPOSE (node);
5370 tree val = TREE_VALUE (node);
5372 /* Mere mortals can't copy arrays with aggregate initialization, so
5373 do some magic to make it work here. */
5374 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
5375 val = build_array_copy (val);
5376 else if (DECL_NORMAL_CAPTURE_P (field)
5377 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
5379 /* "the entities that are captured by copy are used to
5380 direct-initialize each corresponding non-static data
5381 member of the resulting closure object."
5383 There's normally no way to express direct-initialization
5384 from an element of a CONSTRUCTOR, so we build up a special
5385 TARGET_EXPR to bypass the usual copy-initialization. */
5386 val = force_rvalue (val);
5387 if (TREE_CODE (val) == TARGET_EXPR)
5388 TARGET_EXPR_DIRECT_INIT_P (val) = true;
5391 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
5394 expr = build_constructor (init_list_type_node, elts);
5395 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
5397 /* N2927: "[The closure] class type is not an aggregate."
5398 But we briefly treat it as an aggregate to make this simpler. */
5399 type = TREE_TYPE (lambda_expr);
5400 CLASSTYPE_NON_AGGREGATE (type) = 0;
5401 expr = finish_compound_literal (type, expr);
5402 CLASSTYPE_NON_AGGREGATE (type) = 1;
5404 input_location = saved_loc;
5408 /* Return an initialized RECORD_TYPE for LAMBDA.
5409 LAMBDA must have its explicit captures already. */
5412 begin_lambda_type (tree lambda)
5417 /* Unique name. This is just like an unnamed class, but we cannot use
5418 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5420 name = make_lambda_name ();
5422 /* Create the new RECORD_TYPE for this lambda. */
5423 type = xref_tag (/*tag_code=*/record_type,
5425 /*scope=*/ts_within_enclosing_non_class,
5426 /*template_header_p=*/false);
5429 /* Designate it as a struct so that we can use aggregate initialization. */
5430 CLASSTYPE_DECLARED_CLASS (type) = false;
5432 /* Clear base types. */
5433 xref_basetypes (type, /*bases=*/NULL_TREE);
5435 /* Start the class. */
5436 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
5438 /* Cross-reference the expression and the type. */
5439 TREE_TYPE (lambda) = type;
5440 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
5445 /* Returns the type to use for the return type of the operator() of a
5449 lambda_return_type (tree expr)
5452 if (type_dependent_expression_p (expr))
5454 type = cxx_make_type (DECLTYPE_TYPE);
5455 DECLTYPE_TYPE_EXPR (type) = expr;
5456 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
5457 SET_TYPE_STRUCTURAL_EQUALITY (type);
5460 type = type_decays_to (unlowered_expr_type (expr));
5464 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5468 lambda_function (tree lambda)
5471 if (TREE_CODE (lambda) == LAMBDA_EXPR)
5472 type = TREE_TYPE (lambda);
5475 gcc_assert (LAMBDA_TYPE_P (type));
5476 /* Don't let debug_tree cause instantiation. */
5477 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
5479 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
5480 /*protect=*/0, /*want_type=*/false);
5482 lambda = BASELINK_FUNCTIONS (lambda);
5486 /* Returns the type to use for the FIELD_DECL corresponding to the
5488 The caller should add REFERENCE_TYPE for capture by reference. */
5491 lambda_capture_field_type (tree expr)
5494 if (type_dependent_expression_p (expr))
5496 type = cxx_make_type (DECLTYPE_TYPE);
5497 DECLTYPE_TYPE_EXPR (type) = expr;
5498 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
5499 SET_TYPE_STRUCTURAL_EQUALITY (type);
5502 type = non_reference (unlowered_expr_type (expr));
5506 /* Recompute the return type for LAMBDA with body of the form:
5507 { return EXPR ; } */
5510 apply_lambda_return_type (tree lambda, tree return_type)
5512 tree fco = lambda_function (lambda);
5515 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
5517 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5518 it would interfere with instantiating the closure type. */
5519 if (dependent_type_p (return_type))
5521 if (return_type == error_mark_node)
5524 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5525 TREE_TYPE (METHOD_TYPE) == return-type */
5526 TREE_TYPE (TREE_TYPE (fco)) = return_type;
5528 result = DECL_RESULT (fco);
5529 if (result == NULL_TREE)
5532 /* We already have a DECL_RESULT from start_preparsed_function.
5533 Now we need to redo the work it and allocate_struct_function
5534 did to reflect the new type. */
5535 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
5536 TYPE_MAIN_VARIANT (return_type));
5537 DECL_ARTIFICIAL (result) = 1;
5538 DECL_IGNORED_P (result) = 1;
5539 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
5542 DECL_RESULT (fco) = result;
5544 if (!processing_template_decl && aggregate_value_p (result, fco))
5546 #ifdef PCC_STATIC_STRUCT_RETURN
5547 cfun->returns_pcc_struct = 1;
5549 cfun->returns_struct = 1;
5554 /* DECL is a local variable or parameter from the surrounding scope of a
5555 lambda-expression. Returns the decltype for a use of the capture field
5556 for DECL even if it hasn't been captured yet. */
5559 capture_decltype (tree decl)
5561 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
5562 /* FIXME do lookup instead of list walk? */
5563 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
5567 type = TREE_TYPE (TREE_PURPOSE (cap));
5569 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
5572 error ("%qD is not captured", decl);
5573 return error_mark_node;
5576 type = TREE_TYPE (decl);
5577 if (TREE_CODE (type) == REFERENCE_TYPE
5578 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
5579 type = TREE_TYPE (type);
5582 case CPLD_REFERENCE:
5583 type = TREE_TYPE (decl);
5584 if (TREE_CODE (type) != REFERENCE_TYPE)
5585 type = build_reference_type (TREE_TYPE (decl));
5592 if (TREE_CODE (type) != REFERENCE_TYPE)
5594 if (!LAMBDA_EXPR_MUTABLE_P (lam))
5595 type = cp_build_qualified_type (type, (TYPE_QUALS (type)
5597 type = build_reference_type (type);
5602 /* From an ID and INITIALIZER, create a capture (by reference if
5603 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5607 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
5608 bool explicit_init_p)
5613 type = lambda_capture_field_type (initializer);
5616 type = build_reference_type (type);
5617 if (!real_lvalue_p (initializer))
5618 error ("cannot capture %qE by reference", initializer);
5621 /* Make member variable. */
5622 member = build_lang_decl (FIELD_DECL, id, type);
5623 if (!explicit_init_p)
5624 /* Normal captures are invisible to name lookup but uses are replaced
5625 with references to the capture field; we implement this by only
5626 really making them invisible in unevaluated context; see
5627 qualify_lookup. For now, let's make explicitly initialized captures
5629 DECL_NORMAL_CAPTURE_P (member) = true;
5631 /* Add it to the appropriate closure class. */
5632 finish_member_declaration (member);
5634 LAMBDA_EXPR_CAPTURE_LIST (lambda)
5635 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
5637 if (id == get_identifier ("__this"))
5639 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
5640 error ("already captured %<this%> in lambda expression");
5641 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
5647 /* Given a FIELD_DECL decl belonging to a closure type, return a
5648 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5652 thisify_lambda_field (tree decl)
5654 tree context = lambda_function (DECL_CONTEXT (decl));
5655 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
5657 tf_warning_or_error);
5658 return finish_non_static_data_member (decl, object,
5659 /*qualifying_scope*/NULL_TREE);
5662 /* Similar to add_capture, except this works on a stack of nested lambdas.
5663 BY_REFERENCE_P in this case is derived from the default capture mode.
5664 Returns the capture for the lambda at the bottom of the stack. */
5667 add_default_capture (tree lambda_stack, tree id, tree initializer)
5669 bool this_capture_p = (id == get_identifier ("__this"));
5671 tree member = NULL_TREE;
5673 tree saved_class_type = current_class_type;
5677 for (node = lambda_stack;
5679 node = TREE_CHAIN (node))
5681 tree lambda = TREE_VALUE (node);
5683 current_class_type = TREE_TYPE (lambda);
5684 member = add_capture (lambda,
5689 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
5690 == CPLD_REFERENCE)),
5691 /*explicit_init_p=*/false);
5692 initializer = thisify_lambda_field (member);
5695 current_class_type = saved_class_type;
5700 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5701 INDIRECT_REF, possibly adding it through default capturing. */
5704 lambda_expr_this_capture (tree lambda)
5708 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5710 /* Try to default capture 'this' if we can. */
5712 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
5714 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
5715 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
5716 tree init = NULL_TREE;
5718 /* If we are in a lambda function, we can move out until we hit:
5719 1. a non-lambda function,
5720 2. a lambda function capturing 'this', or
5721 3. a non-default capturing lambda function. */
5722 while (LAMBDA_FUNCTION_P (containing_function))
5725 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
5727 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
5729 /* An outer lambda has already captured 'this'. */
5730 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5731 init = thisify_lambda_field (cap);
5735 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
5736 /* An outer lambda won't let us capture 'this'. */
5739 lambda_stack = tree_cons (NULL_TREE,
5743 containing_function = decl_function_context (containing_function);
5746 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
5747 && !LAMBDA_FUNCTION_P (containing_function))
5748 /* First parameter is 'this'. */
5749 init = DECL_ARGUMENTS (containing_function);
5752 this_capture = add_default_capture (lambda_stack,
5753 /*id=*/get_identifier ("__this"),
5759 error ("%<this%> was not captured for this lambda function");
5760 result = error_mark_node;
5764 /* To make sure that current_class_ref is for the lambda. */
5765 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
5767 result = finish_non_static_data_member (this_capture,
5769 /*qualifying_scope=*/NULL_TREE);
5771 /* If 'this' is captured, each use of 'this' is transformed into an
5772 access to the corresponding unnamed data member of the closure
5773 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5774 ensures that the transformed expression is an rvalue. ] */
5775 result = rvalue (result);
5781 /* If the closure TYPE has a static op(), also add a conversion to function
5785 maybe_add_lambda_conv_op (tree type)
5787 bool nested = (current_function_decl != NULL_TREE);
5788 tree callop = lambda_function (type);
5789 tree rettype, name, fntype, fn, body, compound_stmt;
5791 if (!DECL_STATIC_FUNCTION_P (callop))
5794 rettype = build_pointer_type (TREE_TYPE (callop));
5795 name = mangle_conv_op_name_for_type (rettype);
5796 fntype = build_function_type (rettype, void_list_node);
5797 fn = build_lang_decl (FUNCTION_DECL, name, fntype);
5798 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5800 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5801 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5802 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5804 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
5805 grokclassfn (type, fn, NO_SPECIAL);
5806 set_linkage_according_to_type (type, fn);
5807 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5808 DECL_IN_AGGR_P (fn) = 1;
5809 DECL_ARTIFICIAL (fn) = 1;
5810 DECL_NOT_REALLY_EXTERN (fn) = 1;
5811 DECL_DECLARED_INLINE_P (fn) = 1;
5812 DECL_STATIC_FUNCTION_P (fn) = 1;
5814 add_method (type, fn, NULL_TREE);
5817 push_function_context ();
5818 start_preparsed_function (fn, NULL_TREE,
5819 SF_PRE_PARSED | SF_INCLASS_INLINE);
5820 body = begin_function_body ();
5821 compound_stmt = begin_compound_stmt (0);
5823 finish_return_stmt (decay_conversion (callop));
5825 finish_compound_stmt (compound_stmt);
5826 finish_function_body (body);
5828 expand_or_defer_fn (finish_function (2));
5830 pop_function_context ();
5832 #include "gt-cp-semantics.h"