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 /* DECL was the declaration to which a qualified-id resolved. Issue
1535 an error message if it is not accessible. If OBJECT_TYPE is
1536 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1537 type of `*x', or `x', respectively. If the DECL was named as
1538 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1541 check_accessibility_of_qualified_id (tree decl,
1543 tree nested_name_specifier)
1546 tree qualifying_type = NULL_TREE;
1548 /* If we are parsing a template declaration and if decl is a typedef,
1549 add it to a list tied to the template.
1550 At template instantiation time, that list will be walked and
1551 access check performed. */
1552 if (is_typedef_decl (decl))
1554 /* This the scope through which type_decl is accessed.
1555 It will be useful information later to do access check for
1557 tree scope = nested_name_specifier
1558 ? nested_name_specifier
1559 : DECL_CONTEXT (decl);
1560 tree templ_info = NULL;
1561 tree cs = current_scope ();
1563 if (cs && (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL))
1564 templ_info = get_template_info (cs);
1567 && TI_TEMPLATE (templ_info)
1569 && CLASS_TYPE_P (scope)
1570 && !currently_open_class (scope))
1571 append_type_to_template_for_access_check (current_scope (), decl, scope);
1574 /* If we're not checking, return immediately. */
1575 if (deferred_access_no_check)
1578 /* Determine the SCOPE of DECL. */
1579 scope = context_for_name_lookup (decl);
1580 /* If the SCOPE is not a type, then DECL is not a member. */
1581 if (!TYPE_P (scope))
1583 /* Compute the scope through which DECL is being accessed. */
1585 /* OBJECT_TYPE might not be a class type; consider:
1587 class A { typedef int I; };
1591 In this case, we will have "A::I" as the DECL, but "I" as the
1593 && CLASS_TYPE_P (object_type)
1594 && DERIVED_FROM_P (scope, object_type))
1595 /* If we are processing a `->' or `.' expression, use the type of the
1597 qualifying_type = object_type;
1598 else if (nested_name_specifier)
1600 /* If the reference is to a non-static member of the
1601 current class, treat it as if it were referenced through
1603 if (DECL_NONSTATIC_MEMBER_P (decl)
1604 && current_class_ptr
1605 && DERIVED_FROM_P (scope, current_class_type))
1606 qualifying_type = current_class_type;
1607 /* Otherwise, use the type indicated by the
1608 nested-name-specifier. */
1610 qualifying_type = nested_name_specifier;
1613 /* Otherwise, the name must be from the current class or one of
1615 qualifying_type = currently_open_derived_class (scope);
1618 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1619 or similar in a default argument value. */
1620 && CLASS_TYPE_P (qualifying_type)
1621 && !dependent_type_p (qualifying_type))
1622 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1626 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1627 class named to the left of the "::" operator. DONE is true if this
1628 expression is a complete postfix-expression; it is false if this
1629 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1630 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1631 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1632 is true iff this qualified name appears as a template argument. */
1635 finish_qualified_id_expr (tree qualifying_class,
1640 bool template_arg_p)
1642 gcc_assert (TYPE_P (qualifying_class));
1644 if (error_operand_p (expr))
1645 return error_mark_node;
1647 if (DECL_P (expr) || BASELINK_P (expr))
1651 check_template_keyword (expr);
1653 /* If EXPR occurs as the operand of '&', use special handling that
1654 permits a pointer-to-member. */
1655 if (address_p && done)
1657 if (TREE_CODE (expr) == SCOPE_REF)
1658 expr = TREE_OPERAND (expr, 1);
1659 expr = build_offset_ref (qualifying_class, expr,
1660 /*address_p=*/true);
1664 /* Within the scope of a class, turn references to non-static
1665 members into expression of the form "this->...". */
1667 /* But, within a template argument, we do not want make the
1668 transformation, as there is no "this" pointer. */
1670 else if (TREE_CODE (expr) == FIELD_DECL)
1672 push_deferring_access_checks (dk_no_check);
1673 expr = finish_non_static_data_member (expr, current_class_ref,
1675 pop_deferring_access_checks ();
1677 else if (BASELINK_P (expr) && !processing_template_decl)
1681 /* See if any of the functions are non-static members. */
1682 fns = BASELINK_FUNCTIONS (expr);
1683 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1684 fns = TREE_OPERAND (fns, 0);
1685 /* If so, the expression may be relative to 'this'. */
1686 if (!shared_member_p (fns)
1687 && current_class_ref
1688 && DERIVED_FROM_P (qualifying_class, TREE_TYPE (current_class_ref)))
1689 expr = (build_class_member_access_expr
1690 (maybe_dummy_object (qualifying_class, NULL),
1692 BASELINK_ACCESS_BINFO (expr),
1693 /*preserve_reference=*/false,
1694 tf_warning_or_error));
1696 /* The expression is a qualified name whose address is not
1698 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1704 /* Begin a statement-expression. The value returned must be passed to
1705 finish_stmt_expr. */
1708 begin_stmt_expr (void)
1710 return push_stmt_list ();
1713 /* Process the final expression of a statement expression. EXPR can be
1714 NULL, if the final expression is empty. Return a STATEMENT_LIST
1715 containing all the statements in the statement-expression, or
1716 ERROR_MARK_NODE if there was an error. */
1719 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1721 if (error_operand_p (expr))
1723 /* The type of the statement-expression is the type of the last
1725 TREE_TYPE (stmt_expr) = error_mark_node;
1726 return error_mark_node;
1729 /* If the last statement does not have "void" type, then the value
1730 of the last statement is the value of the entire expression. */
1733 tree type = TREE_TYPE (expr);
1735 if (processing_template_decl)
1737 expr = build_stmt (input_location, EXPR_STMT, expr);
1738 expr = add_stmt (expr);
1739 /* Mark the last statement so that we can recognize it as such at
1740 template-instantiation time. */
1741 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1743 else if (VOID_TYPE_P (type))
1745 /* Just treat this like an ordinary statement. */
1746 expr = finish_expr_stmt (expr);
1750 /* It actually has a value we need to deal with. First, force it
1751 to be an rvalue so that we won't need to build up a copy
1752 constructor call later when we try to assign it to something. */
1753 expr = force_rvalue (expr);
1754 if (error_operand_p (expr))
1755 return error_mark_node;
1757 /* Update for array-to-pointer decay. */
1758 type = TREE_TYPE (expr);
1760 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1761 normal statement, but don't convert to void or actually add
1763 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1764 expr = maybe_cleanup_point_expr (expr);
1768 /* The type of the statement-expression is the type of the last
1770 TREE_TYPE (stmt_expr) = type;
1776 /* Finish a statement-expression. EXPR should be the value returned
1777 by the previous begin_stmt_expr. Returns an expression
1778 representing the statement-expression. */
1781 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1786 if (error_operand_p (stmt_expr))
1788 pop_stmt_list (stmt_expr);
1789 return error_mark_node;
1792 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1794 type = TREE_TYPE (stmt_expr);
1795 result = pop_stmt_list (stmt_expr);
1796 TREE_TYPE (result) = type;
1798 if (processing_template_decl)
1800 result = build_min (STMT_EXPR, type, result);
1801 TREE_SIDE_EFFECTS (result) = 1;
1802 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1804 else if (CLASS_TYPE_P (type))
1806 /* Wrap the statement-expression in a TARGET_EXPR so that the
1807 temporary object created by the final expression is destroyed at
1808 the end of the full-expression containing the
1809 statement-expression. */
1810 result = force_target_expr (type, result);
1816 /* Returns the expression which provides the value of STMT_EXPR. */
1819 stmt_expr_value_expr (tree stmt_expr)
1821 tree t = STMT_EXPR_STMT (stmt_expr);
1823 if (TREE_CODE (t) == BIND_EXPR)
1824 t = BIND_EXPR_BODY (t);
1826 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1827 t = STATEMENT_LIST_TAIL (t)->stmt;
1829 if (TREE_CODE (t) == EXPR_STMT)
1830 t = EXPR_STMT_EXPR (t);
1835 /* Perform Koenig lookup. FN is the postfix-expression representing
1836 the function (or functions) to call; ARGS are the arguments to the
1837 call. Returns the functions to be considered by overload
1841 perform_koenig_lookup (tree fn, VEC(tree,gc) *args)
1843 tree identifier = NULL_TREE;
1844 tree functions = NULL_TREE;
1845 tree tmpl_args = NULL_TREE;
1846 bool template_id = false;
1848 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1850 /* Use a separate flag to handle null args. */
1852 tmpl_args = TREE_OPERAND (fn, 1);
1853 fn = TREE_OPERAND (fn, 0);
1856 /* Find the name of the overloaded function. */
1857 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1859 else if (is_overloaded_fn (fn))
1862 identifier = DECL_NAME (get_first_fn (functions));
1864 else if (DECL_P (fn))
1867 identifier = DECL_NAME (fn);
1870 /* A call to a namespace-scope function using an unqualified name.
1872 Do Koenig lookup -- unless any of the arguments are
1874 if (!any_type_dependent_arguments_p (args)
1875 && !any_dependent_template_arguments_p (tmpl_args))
1877 fn = lookup_arg_dependent (identifier, functions, args);
1879 /* The unqualified name could not be resolved. */
1880 fn = unqualified_fn_lookup_error (identifier);
1883 if (fn && template_id)
1884 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1889 /* Generate an expression for `FN (ARGS)'. This may change the
1892 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1893 as a virtual call, even if FN is virtual. (This flag is set when
1894 encountering an expression where the function name is explicitly
1895 qualified. For example a call to `X::f' never generates a virtual
1898 Returns code for the call. */
1901 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1902 bool koenig_p, tsubst_flags_t complain)
1906 VEC(tree,gc) *orig_args = NULL;
1908 if (fn == error_mark_node)
1909 return error_mark_node;
1911 gcc_assert (!TYPE_P (fn));
1915 if (processing_template_decl)
1917 if (type_dependent_expression_p (fn)
1918 || any_type_dependent_arguments_p (*args))
1920 result = build_nt_call_vec (fn, *args);
1921 KOENIG_LOOKUP_P (result) = koenig_p;
1926 tree fndecl = OVL_CURRENT (fn);
1927 if (TREE_CODE (fndecl) != FUNCTION_DECL
1928 || !TREE_THIS_VOLATILE (fndecl))
1934 current_function_returns_abnormally = 1;
1938 orig_args = make_tree_vector_copy (*args);
1939 if (!BASELINK_P (fn)
1940 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1941 && TREE_TYPE (fn) != unknown_type_node)
1942 fn = build_non_dependent_expr (fn);
1943 make_args_non_dependent (*args);
1946 if (is_overloaded_fn (fn))
1947 fn = baselink_for_fns (fn);
1950 if (BASELINK_P (fn))
1954 /* A call to a member function. From [over.call.func]:
1956 If the keyword this is in scope and refers to the class of
1957 that member function, or a derived class thereof, then the
1958 function call is transformed into a qualified function call
1959 using (*this) as the postfix-expression to the left of the
1960 . operator.... [Otherwise] a contrived object of type T
1961 becomes the implied object argument.
1963 This paragraph is unclear about this situation:
1965 struct A { void f(); };
1966 struct B : public A {};
1967 struct C : public A { void g() { B::f(); }};
1969 In particular, for `B::f', this paragraph does not make clear
1970 whether "the class of that member function" refers to `A' or
1971 to `B'. We believe it refers to `B'. */
1972 if (current_class_type
1973 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1975 && current_class_ref)
1976 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1980 tree representative_fn;
1982 representative_fn = BASELINK_FUNCTIONS (fn);
1983 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1984 representative_fn = TREE_OPERAND (representative_fn, 0);
1985 representative_fn = get_first_fn (representative_fn);
1986 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1989 if (processing_template_decl)
1991 if (type_dependent_expression_p (object))
1993 tree ret = build_nt_call_vec (orig_fn, orig_args);
1994 release_tree_vector (orig_args);
1997 object = build_non_dependent_expr (object);
2000 result = build_new_method_call (object, fn, args, NULL_TREE,
2002 ? LOOKUP_NONVIRTUAL : 0),
2006 else if (is_overloaded_fn (fn))
2008 /* If the function is an overloaded builtin, resolve it. */
2009 if (TREE_CODE (fn) == FUNCTION_DECL
2010 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2011 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2012 result = resolve_overloaded_builtin (input_location, fn, *args);
2015 /* A call to a namespace-scope function. */
2016 result = build_new_function_call (fn, args, koenig_p, complain);
2018 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2020 if (!VEC_empty (tree, *args))
2021 error ("arguments to destructor are not allowed");
2022 /* Mark the pseudo-destructor call as having side-effects so
2023 that we do not issue warnings about its use. */
2024 result = build1 (NOP_EXPR,
2026 TREE_OPERAND (fn, 0));
2027 TREE_SIDE_EFFECTS (result) = 1;
2029 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2030 /* If the "function" is really an object of class type, it might
2031 have an overloaded `operator ()'. */
2032 result = build_op_call (fn, args, complain);
2035 /* A call where the function is unknown. */
2036 result = cp_build_function_call_vec (fn, args, complain);
2038 if (processing_template_decl)
2040 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2041 KOENIG_LOOKUP_P (result) = koenig_p;
2042 release_tree_vector (orig_args);
2048 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2049 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2050 POSTDECREMENT_EXPR.) */
2053 finish_increment_expr (tree expr, enum tree_code code)
2055 return build_x_unary_op (code, expr, tf_warning_or_error);
2058 /* Finish a use of `this'. Returns an expression for `this'. */
2061 finish_this_expr (void)
2065 /* In a lambda expression, 'this' refers to the captured 'this'. */
2066 if (current_function_decl
2067 && LAMBDA_FUNCTION_P (current_function_decl))
2068 result = (lambda_expr_this_capture
2069 (CLASSTYPE_LAMBDA_EXPR (current_class_type)));
2070 else if (current_class_ptr)
2071 result = current_class_ptr;
2072 else if (current_function_decl
2073 && DECL_STATIC_FUNCTION_P (current_function_decl))
2075 error ("%<this%> is unavailable for static member functions");
2076 result = error_mark_node;
2080 if (current_function_decl)
2081 error ("invalid use of %<this%> in non-member function");
2083 error ("invalid use of %<this%> at top level");
2084 result = error_mark_node;
2090 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2091 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2092 the TYPE for the type given. If SCOPE is non-NULL, the expression
2093 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2096 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2098 if (object == error_mark_node || destructor == error_mark_node)
2099 return error_mark_node;
2101 gcc_assert (TYPE_P (destructor));
2103 if (!processing_template_decl)
2105 if (scope == error_mark_node)
2107 error ("invalid qualifying scope in pseudo-destructor name");
2108 return error_mark_node;
2110 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2112 error ("qualified type %qT does not match destructor name ~%qT",
2114 return error_mark_node;
2118 /* [expr.pseudo] says both:
2120 The type designated by the pseudo-destructor-name shall be
2121 the same as the object type.
2125 The cv-unqualified versions of the object type and of the
2126 type designated by the pseudo-destructor-name shall be the
2129 We implement the more generous second sentence, since that is
2130 what most other compilers do. */
2131 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2134 error ("%qE is not of type %qT", object, destructor);
2135 return error_mark_node;
2139 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2142 /* Finish an expression of the form CODE EXPR. */
2145 finish_unary_op_expr (enum tree_code code, tree expr)
2147 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2148 /* Inside a template, build_x_unary_op does not fold the
2149 expression. So check whether the result is folded before
2150 setting TREE_NEGATED_INT. */
2151 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2152 && TREE_CODE (result) == INTEGER_CST
2153 && !TYPE_UNSIGNED (TREE_TYPE (result))
2154 && INT_CST_LT (result, integer_zero_node))
2156 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2157 setting TREE_NEGATED_INT. */
2158 result = copy_node (result);
2159 TREE_NEGATED_INT (result) = 1;
2161 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2162 overflow_warning (input_location, result);
2167 /* Finish a compound-literal expression. TYPE is the type to which
2168 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2171 finish_compound_literal (tree type, tree compound_literal)
2173 if (type == error_mark_node)
2174 return error_mark_node;
2176 if (!TYPE_OBJ_P (type))
2178 error ("compound literal of non-object type %qT", type);
2179 return error_mark_node;
2182 if (processing_template_decl)
2184 TREE_TYPE (compound_literal) = type;
2185 /* Mark the expression as a compound literal. */
2186 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2187 return compound_literal;
2190 type = complete_type (type);
2192 if (TYPE_NON_AGGREGATE_CLASS (type))
2194 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2195 everywhere that deals with function arguments would be a pain, so
2196 just wrap it in a TREE_LIST. The parser set a flag so we know
2197 that it came from T{} rather than T({}). */
2198 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2199 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2200 return build_functional_cast (type, compound_literal, tf_error);
2203 if (TREE_CODE (type) == ARRAY_TYPE
2204 && check_array_initializer (NULL_TREE, type, compound_literal))
2205 return error_mark_node;
2206 compound_literal = reshape_init (type, compound_literal);
2207 if (TREE_CODE (type) == ARRAY_TYPE)
2208 cp_complete_array_type (&type, compound_literal, false);
2209 compound_literal = digest_init (type, compound_literal);
2210 if ((!at_function_scope_p () || cp_type_readonly (type))
2211 && initializer_constant_valid_p (compound_literal, type))
2213 tree decl = create_temporary_var (type);
2214 DECL_INITIAL (decl) = compound_literal;
2215 TREE_STATIC (decl) = 1;
2216 decl = pushdecl_top_level (decl);
2217 DECL_NAME (decl) = make_anon_name ();
2218 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2222 return get_target_expr (compound_literal);
2225 /* Return the declaration for the function-name variable indicated by
2229 finish_fname (tree id)
2233 decl = fname_decl (input_location, C_RID_CODE (id), id);
2234 if (processing_template_decl)
2235 decl = DECL_NAME (decl);
2239 /* Finish a translation unit. */
2242 finish_translation_unit (void)
2244 /* In case there were missing closebraces,
2245 get us back to the global binding level. */
2247 while (current_namespace != global_namespace)
2250 /* Do file scope __FUNCTION__ et al. */
2251 finish_fname_decls ();
2254 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2255 Returns the parameter. */
2258 finish_template_type_parm (tree aggr, tree identifier)
2260 if (aggr != class_type_node)
2262 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2263 aggr = class_type_node;
2266 return build_tree_list (aggr, identifier);
2269 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2270 Returns the parameter. */
2273 finish_template_template_parm (tree aggr, tree identifier)
2275 tree decl = build_decl (input_location,
2276 TYPE_DECL, identifier, NULL_TREE);
2277 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2278 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2279 DECL_TEMPLATE_RESULT (tmpl) = decl;
2280 DECL_ARTIFICIAL (decl) = 1;
2281 end_template_decl ();
2283 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2285 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2286 /*is_primary=*/true, /*is_partial=*/false,
2289 return finish_template_type_parm (aggr, tmpl);
2292 /* ARGUMENT is the default-argument value for a template template
2293 parameter. If ARGUMENT is invalid, issue error messages and return
2294 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2297 check_template_template_default_arg (tree argument)
2299 if (TREE_CODE (argument) != TEMPLATE_DECL
2300 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2301 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2303 if (TREE_CODE (argument) == TYPE_DECL)
2304 error ("invalid use of type %qT as a default value for a template "
2305 "template-parameter", TREE_TYPE (argument));
2307 error ("invalid default argument for a template template parameter");
2308 return error_mark_node;
2314 /* Begin a class definition, as indicated by T. */
2317 begin_class_definition (tree t, tree attributes)
2319 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2320 return error_mark_node;
2322 if (processing_template_parmlist)
2324 error ("definition of %q#T inside template parameter list", t);
2325 return error_mark_node;
2327 /* A non-implicit typename comes from code like:
2329 template <typename T> struct A {
2330 template <typename U> struct A<T>::B ...
2332 This is erroneous. */
2333 else if (TREE_CODE (t) == TYPENAME_TYPE)
2335 error ("invalid definition of qualified type %qT", t);
2336 t = error_mark_node;
2339 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2341 t = make_class_type (RECORD_TYPE);
2342 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2345 /* Update the location of the decl. */
2346 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2348 if (TYPE_BEING_DEFINED (t))
2350 t = make_class_type (TREE_CODE (t));
2351 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2353 maybe_process_partial_specialization (t);
2355 TYPE_BEING_DEFINED (t) = 1;
2357 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2359 if (flag_pack_struct)
2362 TYPE_PACKED (t) = 1;
2363 /* Even though the type is being defined for the first time
2364 here, there might have been a forward declaration, so there
2365 might be cv-qualified variants of T. */
2366 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2367 TYPE_PACKED (v) = 1;
2369 /* Reset the interface data, at the earliest possible
2370 moment, as it might have been set via a class foo;
2372 if (! TYPE_ANONYMOUS_P (t))
2374 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2375 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2376 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2377 (t, finfo->interface_unknown);
2379 reset_specialization();
2381 /* Make a declaration for this class in its own scope. */
2382 build_self_reference ();
2387 /* Finish the member declaration given by DECL. */
2390 finish_member_declaration (tree decl)
2392 if (decl == error_mark_node || decl == NULL_TREE)
2395 if (decl == void_type_node)
2396 /* The COMPONENT was a friend, not a member, and so there's
2397 nothing for us to do. */
2400 /* We should see only one DECL at a time. */
2401 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2403 /* Set up access control for DECL. */
2405 = (current_access_specifier == access_private_node);
2406 TREE_PROTECTED (decl)
2407 = (current_access_specifier == access_protected_node);
2408 if (TREE_CODE (decl) == TEMPLATE_DECL)
2410 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2411 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2414 /* Mark the DECL as a member of the current class. */
2415 DECL_CONTEXT (decl) = current_class_type;
2417 /* Check for bare parameter packs in the member variable declaration. */
2418 if (TREE_CODE (decl) == FIELD_DECL)
2420 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2421 TREE_TYPE (decl) = error_mark_node;
2422 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2423 DECL_ATTRIBUTES (decl) = NULL_TREE;
2428 A C language linkage is ignored for the names of class members
2429 and the member function type of class member functions. */
2430 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2431 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2433 /* Put functions on the TYPE_METHODS list and everything else on the
2434 TYPE_FIELDS list. Note that these are built up in reverse order.
2435 We reverse them (to obtain declaration order) in finish_struct. */
2436 if (TREE_CODE (decl) == FUNCTION_DECL
2437 || DECL_FUNCTION_TEMPLATE_P (decl))
2439 /* We also need to add this function to the
2440 CLASSTYPE_METHOD_VEC. */
2441 if (add_method (current_class_type, decl, NULL_TREE))
2443 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2444 TYPE_METHODS (current_class_type) = decl;
2446 maybe_add_class_template_decl_list (current_class_type, decl,
2450 /* Enter the DECL into the scope of the class. */
2451 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2452 || pushdecl_class_level (decl))
2454 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2455 go at the beginning. The reason is that lookup_field_1
2456 searches the list in order, and we want a field name to
2457 override a type name so that the "struct stat hack" will
2458 work. In particular:
2460 struct S { enum E { }; int E } s;
2463 is valid. In addition, the FIELD_DECLs must be maintained in
2464 declaration order so that class layout works as expected.
2465 However, we don't need that order until class layout, so we
2466 save a little time by putting FIELD_DECLs on in reverse order
2467 here, and then reversing them in finish_struct_1. (We could
2468 also keep a pointer to the correct insertion points in the
2471 if (TREE_CODE (decl) == TYPE_DECL)
2472 TYPE_FIELDS (current_class_type)
2473 = chainon (TYPE_FIELDS (current_class_type), decl);
2476 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2477 TYPE_FIELDS (current_class_type) = decl;
2480 maybe_add_class_template_decl_list (current_class_type, decl,
2485 note_decl_for_pch (decl);
2488 /* DECL has been declared while we are building a PCH file. Perform
2489 actions that we might normally undertake lazily, but which can be
2490 performed now so that they do not have to be performed in
2491 translation units which include the PCH file. */
2494 note_decl_for_pch (tree decl)
2496 gcc_assert (pch_file);
2498 /* There's a good chance that we'll have to mangle names at some
2499 point, even if only for emission in debugging information. */
2500 if ((TREE_CODE (decl) == VAR_DECL
2501 || TREE_CODE (decl) == FUNCTION_DECL)
2502 && !processing_template_decl)
2506 /* Finish processing a complete template declaration. The PARMS are
2507 the template parameters. */
2510 finish_template_decl (tree parms)
2513 end_template_decl ();
2515 end_specialization ();
2518 /* Finish processing a template-id (which names a type) of the form
2519 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2520 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2521 the scope of template-id indicated. */
2524 finish_template_type (tree name, tree args, int entering_scope)
2528 decl = lookup_template_class (name, args,
2529 NULL_TREE, NULL_TREE, entering_scope,
2530 tf_warning_or_error | tf_user);
2531 if (decl != error_mark_node)
2532 decl = TYPE_STUB_DECL (decl);
2537 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2538 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2539 BASE_CLASS, or NULL_TREE if an error occurred. The
2540 ACCESS_SPECIFIER is one of
2541 access_{default,public,protected_private}_node. For a virtual base
2542 we set TREE_TYPE. */
2545 finish_base_specifier (tree base, tree access, bool virtual_p)
2549 if (base == error_mark_node)
2551 error ("invalid base-class specification");
2554 else if (! MAYBE_CLASS_TYPE_P (base))
2556 error ("%qT is not a class type", base);
2561 if (cp_type_quals (base) != 0)
2563 error ("base class %qT has cv qualifiers", base);
2564 base = TYPE_MAIN_VARIANT (base);
2566 result = build_tree_list (access, base);
2568 TREE_TYPE (result) = integer_type_node;
2574 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2575 what we found when we tried to do the lookup.
2576 LOCATION is the location of the NAME identifier;
2577 The location is used in the error message*/
2580 qualified_name_lookup_error (tree scope, tree name,
2581 tree decl, location_t location)
2583 if (scope == error_mark_node)
2584 ; /* We already complained. */
2585 else if (TYPE_P (scope))
2587 if (!COMPLETE_TYPE_P (scope))
2588 error_at (location, "incomplete type %qT used in nested name specifier",
2590 else if (TREE_CODE (decl) == TREE_LIST)
2592 error_at (location, "reference to %<%T::%D%> is ambiguous",
2594 print_candidates (decl);
2597 error_at (location, "%qD is not a member of %qT", name, scope);
2599 else if (scope != global_namespace)
2600 error_at (location, "%qD is not a member of %qD", name, scope);
2602 error_at (location, "%<::%D%> has not been declared", name);
2605 /* If FNS is a member function, a set of member functions, or a
2606 template-id referring to one or more member functions, return a
2607 BASELINK for FNS, incorporating the current access context.
2608 Otherwise, return FNS unchanged. */
2611 baselink_for_fns (tree fns)
2616 if (BASELINK_P (fns)
2617 || error_operand_p (fns))
2621 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2622 fn = TREE_OPERAND (fn, 0);
2623 fn = get_first_fn (fn);
2624 if (!DECL_FUNCTION_MEMBER_P (fn))
2627 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2629 cl = DECL_CONTEXT (fn);
2630 cl = TYPE_BINFO (cl);
2631 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2634 /* Returns true iff DECL is an automatic variable from a function outside
2638 outer_automatic_var_p (tree decl)
2640 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2641 && DECL_FUNCTION_SCOPE_P (decl)
2642 && !TREE_STATIC (decl)
2643 && DECL_CONTEXT (decl) != current_function_decl);
2646 /* Returns true iff DECL is a capture field from a lambda that is not our
2647 immediate context. */
2650 outer_lambda_capture_p (tree decl)
2652 return (TREE_CODE (decl) == FIELD_DECL
2653 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2654 && (!current_class_type
2655 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2658 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2659 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2660 if non-NULL, is the type or namespace used to explicitly qualify
2661 ID_EXPRESSION. DECL is the entity to which that name has been
2664 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2665 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2666 be set to true if this expression isn't permitted in a
2667 constant-expression, but it is otherwise not set by this function.
2668 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2669 constant-expression, but a non-constant expression is also
2672 DONE is true if this expression is a complete postfix-expression;
2673 it is false if this expression is followed by '->', '[', '(', etc.
2674 ADDRESS_P is true iff this expression is the operand of '&'.
2675 TEMPLATE_P is true iff the qualified-id was of the form
2676 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2677 appears as a template argument.
2679 If an error occurs, and it is the kind of error that might cause
2680 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2681 is the caller's responsibility to issue the message. *ERROR_MSG
2682 will be a string with static storage duration, so the caller need
2685 Return an expression for the entity, after issuing appropriate
2686 diagnostics. This function is also responsible for transforming a
2687 reference to a non-static member into a COMPONENT_REF that makes
2688 the use of "this" explicit.
2690 Upon return, *IDK will be filled in appropriately. */
2692 finish_id_expression (tree id_expression,
2696 bool integral_constant_expression_p,
2697 bool allow_non_integral_constant_expression_p,
2698 bool *non_integral_constant_expression_p,
2702 bool template_arg_p,
2703 const char **error_msg,
2704 location_t location)
2706 /* Initialize the output parameters. */
2707 *idk = CP_ID_KIND_NONE;
2710 if (id_expression == error_mark_node)
2711 return error_mark_node;
2712 /* If we have a template-id, then no further lookup is
2713 required. If the template-id was for a template-class, we
2714 will sometimes have a TYPE_DECL at this point. */
2715 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2716 || TREE_CODE (decl) == TYPE_DECL)
2718 /* Look up the name. */
2721 if (decl == error_mark_node)
2723 /* Name lookup failed. */
2726 || (!dependent_type_p (scope)
2727 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2728 && IDENTIFIER_TYPENAME_P (id_expression)
2729 && dependent_type_p (TREE_TYPE (id_expression))))))
2731 /* If the qualifying type is non-dependent (and the name
2732 does not name a conversion operator to a dependent
2733 type), issue an error. */
2734 qualified_name_lookup_error (scope, id_expression, decl, location);
2735 return error_mark_node;
2739 /* It may be resolved via Koenig lookup. */
2740 *idk = CP_ID_KIND_UNQUALIFIED;
2741 return id_expression;
2744 decl = id_expression;
2746 /* If DECL is a variable that would be out of scope under
2747 ANSI/ISO rules, but in scope in the ARM, name lookup
2748 will succeed. Issue a diagnostic here. */
2750 decl = check_for_out_of_scope_variable (decl);
2752 /* Remember that the name was used in the definition of
2753 the current class so that we can check later to see if
2754 the meaning would have been different after the class
2755 was entirely defined. */
2756 if (!scope && decl != error_mark_node)
2757 maybe_note_name_used_in_class (id_expression, decl);
2759 /* Disallow uses of local variables from containing functions, except
2760 within lambda-expressions. */
2761 if ((outer_automatic_var_p (decl)
2762 || outer_lambda_capture_p (decl))
2763 /* It's not a use (3.2) if we're in an unevaluated context. */
2764 && !cp_unevaluated_operand)
2766 tree context = DECL_CONTEXT (decl);
2767 tree containing_function = current_function_decl;
2768 tree lambda_stack = NULL_TREE;
2769 tree lambda_expr = NULL_TREE;
2770 tree initializer = decl;
2772 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2773 support for an approach in which a reference to a local
2774 [constant] automatic variable in a nested class or lambda body
2775 would enter the expression as an rvalue, which would reduce
2776 the complexity of the problem"
2778 FIXME update for final resolution of core issue 696. */
2779 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2780 return integral_constant_value (decl);
2782 if (TYPE_P (context))
2784 /* Implicit capture of an explicit capture. */
2785 context = lambda_function (context);
2786 initializer = thisify_lambda_field (decl);
2789 /* If we are in a lambda function, we can move out until we hit
2791 2. a non-lambda function, or
2792 3. a non-default capturing lambda function. */
2793 while (context != containing_function
2794 && LAMBDA_FUNCTION_P (containing_function))
2796 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2797 (DECL_CONTEXT (containing_function));
2799 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2803 lambda_stack = tree_cons (NULL_TREE,
2808 = decl_function_context (containing_function);
2811 if (context == containing_function)
2813 decl = add_default_capture (lambda_stack,
2814 /*id=*/DECL_NAME (decl),
2817 else if (lambda_expr)
2819 error ("%qD is not captured", decl);
2820 return error_mark_node;
2824 error (TREE_CODE (decl) == VAR_DECL
2825 ? "use of %<auto%> variable from containing function"
2826 : "use of parameter from containing function");
2827 error (" %q+#D declared here", decl);
2828 return error_mark_node;
2833 /* If we didn't find anything, or what we found was a type,
2834 then this wasn't really an id-expression. */
2835 if (TREE_CODE (decl) == TEMPLATE_DECL
2836 && !DECL_FUNCTION_TEMPLATE_P (decl))
2838 *error_msg = "missing template arguments";
2839 return error_mark_node;
2841 else if (TREE_CODE (decl) == TYPE_DECL
2842 || TREE_CODE (decl) == NAMESPACE_DECL)
2844 *error_msg = "expected primary-expression";
2845 return error_mark_node;
2848 /* If the name resolved to a template parameter, there is no
2849 need to look it up again later. */
2850 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2851 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2855 *idk = CP_ID_KIND_NONE;
2856 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2857 decl = TEMPLATE_PARM_DECL (decl);
2858 r = convert_from_reference (DECL_INITIAL (decl));
2860 if (integral_constant_expression_p
2861 && !dependent_type_p (TREE_TYPE (decl))
2862 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2864 if (!allow_non_integral_constant_expression_p)
2865 error ("template parameter %qD of type %qT is not allowed in "
2866 "an integral constant expression because it is not of "
2867 "integral or enumeration type", decl, TREE_TYPE (decl));
2868 *non_integral_constant_expression_p = true;
2872 /* Similarly, we resolve enumeration constants to their
2873 underlying values. */
2874 else if (TREE_CODE (decl) == CONST_DECL)
2876 *idk = CP_ID_KIND_NONE;
2877 if (!processing_template_decl)
2879 used_types_insert (TREE_TYPE (decl));
2880 return DECL_INITIAL (decl);
2888 /* If the declaration was explicitly qualified indicate
2889 that. The semantics of `A::f(3)' are different than
2890 `f(3)' if `f' is virtual. */
2892 ? CP_ID_KIND_QUALIFIED
2893 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2894 ? CP_ID_KIND_TEMPLATE_ID
2895 : CP_ID_KIND_UNQUALIFIED));
2900 An id-expression is type-dependent if it contains an
2901 identifier that was declared with a dependent type.
2903 The standard is not very specific about an id-expression that
2904 names a set of overloaded functions. What if some of them
2905 have dependent types and some of them do not? Presumably,
2906 such a name should be treated as a dependent name. */
2907 /* Assume the name is not dependent. */
2908 dependent_p = false;
2909 if (!processing_template_decl)
2910 /* No names are dependent outside a template. */
2912 /* A template-id where the name of the template was not resolved
2913 is definitely dependent. */
2914 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2915 && (TREE_CODE (TREE_OPERAND (decl, 0))
2916 == IDENTIFIER_NODE))
2918 /* For anything except an overloaded function, just check its
2920 else if (!is_overloaded_fn (decl))
2922 = dependent_type_p (TREE_TYPE (decl));
2923 /* For a set of overloaded functions, check each of the
2929 if (BASELINK_P (fns))
2930 fns = BASELINK_FUNCTIONS (fns);
2932 /* For a template-id, check to see if the template
2933 arguments are dependent. */
2934 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2936 tree args = TREE_OPERAND (fns, 1);
2937 dependent_p = any_dependent_template_arguments_p (args);
2938 /* The functions are those referred to by the
2940 fns = TREE_OPERAND (fns, 0);
2943 /* If there are no dependent template arguments, go through
2944 the overloaded functions. */
2945 while (fns && !dependent_p)
2947 tree fn = OVL_CURRENT (fns);
2949 /* Member functions of dependent classes are
2951 if (TREE_CODE (fn) == FUNCTION_DECL
2952 && type_dependent_expression_p (fn))
2954 else if (TREE_CODE (fn) == TEMPLATE_DECL
2955 && dependent_template_p (fn))
2958 fns = OVL_NEXT (fns);
2962 /* If the name was dependent on a template parameter, we will
2963 resolve the name at instantiation time. */
2966 /* Create a SCOPE_REF for qualified names, if the scope is
2972 if (address_p && done)
2973 decl = finish_qualified_id_expr (scope, decl,
2979 tree type = NULL_TREE;
2980 if (DECL_P (decl) && !dependent_scope_p (scope))
2981 type = TREE_TYPE (decl);
2982 decl = build_qualified_name (type,
2988 if (TREE_TYPE (decl))
2989 decl = convert_from_reference (decl);
2992 /* A TEMPLATE_ID already contains all the information we
2994 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2995 return id_expression;
2996 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2997 /* If we found a variable, then name lookup during the
2998 instantiation will always resolve to the same VAR_DECL
2999 (or an instantiation thereof). */
3000 if (TREE_CODE (decl) == VAR_DECL
3001 || TREE_CODE (decl) == PARM_DECL)
3002 return convert_from_reference (decl);
3003 /* The same is true for FIELD_DECL, but we also need to
3004 make sure that the syntax is correct. */
3005 else if (TREE_CODE (decl) == FIELD_DECL)
3007 /* Since SCOPE is NULL here, this is an unqualified name.
3008 Access checking has been performed during name lookup
3009 already. Turn off checking to avoid duplicate errors. */
3010 push_deferring_access_checks (dk_no_check);
3011 decl = finish_non_static_data_member
3012 (decl, current_class_ref,
3013 /*qualifying_scope=*/NULL_TREE);
3014 pop_deferring_access_checks ();
3017 return id_expression;
3020 /* Only certain kinds of names are allowed in constant
3021 expression. Enumerators and template parameters have already
3022 been handled above. */
3023 if (integral_constant_expression_p
3024 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
3025 && ! builtin_valid_in_constant_expr_p (decl))
3027 if (!allow_non_integral_constant_expression_p)
3029 error ("%qD cannot appear in a constant-expression", decl);
3030 return error_mark_node;
3032 *non_integral_constant_expression_p = true;
3035 if (TREE_CODE (decl) == NAMESPACE_DECL)
3037 error ("use of namespace %qD as expression", decl);
3038 return error_mark_node;
3040 else if (DECL_CLASS_TEMPLATE_P (decl))
3042 error ("use of class template %qT as expression", decl);
3043 return error_mark_node;
3045 else if (TREE_CODE (decl) == TREE_LIST)
3047 /* Ambiguous reference to base members. */
3048 error ("request for member %qD is ambiguous in "
3049 "multiple inheritance lattice", id_expression);
3050 print_candidates (decl);
3051 return error_mark_node;
3054 /* Mark variable-like entities as used. Functions are similarly
3055 marked either below or after overload resolution. */
3056 if (TREE_CODE (decl) == VAR_DECL
3057 || TREE_CODE (decl) == PARM_DECL
3058 || TREE_CODE (decl) == RESULT_DECL)
3063 decl = (adjust_result_of_qualified_name_lookup
3064 (decl, scope, current_class_type));
3066 if (TREE_CODE (decl) == FUNCTION_DECL)
3069 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3070 decl = finish_qualified_id_expr (scope,
3078 tree r = convert_from_reference (decl);
3080 if (processing_template_decl && TYPE_P (scope))
3081 r = build_qualified_name (TREE_TYPE (r),
3087 else if (TREE_CODE (decl) == FIELD_DECL)
3089 /* Since SCOPE is NULL here, this is an unqualified name.
3090 Access checking has been performed during name lookup
3091 already. Turn off checking to avoid duplicate errors. */
3092 push_deferring_access_checks (dk_no_check);
3093 decl = finish_non_static_data_member (decl, current_class_ref,
3094 /*qualifying_scope=*/NULL_TREE);
3095 pop_deferring_access_checks ();
3097 else if (is_overloaded_fn (decl))
3102 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
3103 first_fn = TREE_OPERAND (first_fn, 0);
3104 first_fn = get_first_fn (first_fn);
3105 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3106 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3108 if (!really_overloaded_fn (decl))
3109 mark_used (first_fn);
3112 && TREE_CODE (first_fn) == FUNCTION_DECL
3113 && DECL_FUNCTION_MEMBER_P (first_fn)
3114 && !shared_member_p (decl))
3116 /* A set of member functions. */
3117 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3118 return finish_class_member_access_expr (decl, id_expression,
3119 /*template_p=*/false,
3120 tf_warning_or_error);
3123 decl = baselink_for_fns (decl);
3127 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3128 && DECL_CLASS_SCOPE_P (decl))
3130 tree context = context_for_name_lookup (decl);
3131 if (context != current_class_type)
3133 tree path = currently_open_derived_class (context);
3134 perform_or_defer_access_check (TYPE_BINFO (path),
3139 decl = convert_from_reference (decl);
3143 if (TREE_DEPRECATED (decl))
3144 warn_deprecated_use (decl, NULL_TREE);
3149 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3150 use as a type-specifier. */
3153 finish_typeof (tree expr)
3157 if (type_dependent_expression_p (expr))
3159 type = cxx_make_type (TYPEOF_TYPE);
3160 TYPEOF_TYPE_EXPR (type) = expr;
3161 SET_TYPE_STRUCTURAL_EQUALITY (type);
3166 type = unlowered_expr_type (expr);
3168 if (!type || type == unknown_type_node)
3170 error ("type of %qE is unknown", expr);
3171 return error_mark_node;
3177 /* Perform C++-specific checks for __builtin_offsetof before calling
3181 finish_offsetof (tree expr)
3183 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3185 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3186 TREE_OPERAND (expr, 2));
3187 return error_mark_node;
3189 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3190 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3191 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3193 if (TREE_CODE (expr) == COMPONENT_REF
3194 || TREE_CODE (expr) == COMPOUND_EXPR)
3195 expr = TREE_OPERAND (expr, 1);
3196 error ("cannot apply %<offsetof%> to member function %qD", expr);
3197 return error_mark_node;
3199 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3200 expr = TREE_OPERAND (expr, 0);
3201 return fold_offsetof (expr, NULL_TREE);
3204 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3205 function is broken out from the above for the benefit of the tree-ssa
3209 simplify_aggr_init_expr (tree *tp)
3211 tree aggr_init_expr = *tp;
3213 /* Form an appropriate CALL_EXPR. */
3214 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3215 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3216 tree type = TREE_TYPE (slot);
3219 enum style_t { ctor, arg, pcc } style;
3221 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3223 #ifdef PCC_STATIC_STRUCT_RETURN
3229 gcc_assert (TREE_ADDRESSABLE (type));
3233 call_expr = build_call_array_loc (input_location,
3234 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3236 aggr_init_expr_nargs (aggr_init_expr),
3237 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3241 /* Replace the first argument to the ctor with the address of the
3243 cxx_mark_addressable (slot);
3244 CALL_EXPR_ARG (call_expr, 0) =
3245 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3247 else if (style == arg)
3249 /* Just mark it addressable here, and leave the rest to
3250 expand_call{,_inline}. */
3251 cxx_mark_addressable (slot);
3252 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3253 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3255 else if (style == pcc)
3257 /* If we're using the non-reentrant PCC calling convention, then we
3258 need to copy the returned value out of the static buffer into the
3260 push_deferring_access_checks (dk_no_check);
3261 call_expr = build_aggr_init (slot, call_expr,
3262 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3263 tf_warning_or_error);
3264 pop_deferring_access_checks ();
3265 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3268 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3270 tree init = build_zero_init (type, NULL_TREE,
3271 /*static_storage_p=*/false);
3272 init = build2 (INIT_EXPR, void_type_node, slot, init);
3273 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3280 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3283 emit_associated_thunks (tree fn)
3285 /* When we use vcall offsets, we emit thunks with the virtual
3286 functions to which they thunk. The whole point of vcall offsets
3287 is so that you can know statically the entire set of thunks that
3288 will ever be needed for a given virtual function, thereby
3289 enabling you to output all the thunks with the function itself. */
3290 if (DECL_VIRTUAL_P (fn)
3291 /* Do not emit thunks for extern template instantiations. */
3292 && ! DECL_REALLY_EXTERN (fn))
3296 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3298 if (!THUNK_ALIAS (thunk))
3300 use_thunk (thunk, /*emit_p=*/1);
3301 if (DECL_RESULT_THUNK_P (thunk))
3305 for (probe = DECL_THUNKS (thunk);
3306 probe; probe = TREE_CHAIN (probe))
3307 use_thunk (probe, /*emit_p=*/1);
3311 gcc_assert (!DECL_THUNKS (thunk));
3316 /* Generate RTL for FN. */
3319 expand_or_defer_fn (tree fn)
3321 /* When the parser calls us after finishing the body of a template
3322 function, we don't really want to expand the body. */
3323 if (processing_template_decl)
3325 /* Normally, collection only occurs in rest_of_compilation. So,
3326 if we don't collect here, we never collect junk generated
3327 during the processing of templates until we hit a
3328 non-template function. It's not safe to do this inside a
3329 nested class, though, as the parser may have local state that
3330 is not a GC root. */
3331 if (!function_depth)
3336 gcc_assert (DECL_SAVED_TREE (fn));
3338 /* If this is a constructor or destructor body, we have to clone
3340 if (maybe_clone_body (fn))
3342 /* We don't want to process FN again, so pretend we've written
3343 it out, even though we haven't. */
3344 TREE_ASM_WRITTEN (fn) = 1;
3345 DECL_SAVED_TREE (fn) = NULL_TREE;
3349 /* We make a decision about linkage for these functions at the end
3350 of the compilation. Until that point, we do not want the back
3351 end to output them -- but we do want it to see the bodies of
3352 these functions so that it can inline them as appropriate. */
3353 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3355 if (DECL_INTERFACE_KNOWN (fn))
3356 /* We've already made a decision as to how this function will
3360 DECL_EXTERNAL (fn) = 1;
3361 DECL_NOT_REALLY_EXTERN (fn) = 1;
3362 note_vague_linkage_fn (fn);
3363 /* A non-template inline function with external linkage will
3364 always be COMDAT. As we must eventually determine the
3365 linkage of all functions, and as that causes writes to
3366 the data mapped in from the PCH file, it's advantageous
3367 to mark the functions at this point. */
3368 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3370 /* This function must have external linkage, as
3371 otherwise DECL_INTERFACE_KNOWN would have been
3373 gcc_assert (TREE_PUBLIC (fn));
3374 comdat_linkage (fn);
3375 DECL_INTERFACE_KNOWN (fn) = 1;
3379 import_export_decl (fn);
3381 /* If the user wants us to keep all inline functions, then mark
3382 this function as needed so that finish_file will make sure to
3383 output it later. Similarly, all dllexport'd functions must
3384 be emitted; there may be callers in other DLLs. */
3385 if ((flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3386 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3390 /* There's no reason to do any of the work here if we're only doing
3391 semantic analysis; this code just generates RTL. */
3392 if (flag_syntax_only)
3397 /* Expand or defer, at the whim of the compilation unit manager. */
3398 cgraph_finalize_function (fn, function_depth > 1);
3410 /* Helper function for walk_tree, used by finalize_nrv below. */
3413 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3415 struct nrv_data *dp = (struct nrv_data *)data;
3418 /* No need to walk into types. There wouldn't be any need to walk into
3419 non-statements, except that we have to consider STMT_EXPRs. */
3422 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3423 but differs from using NULL_TREE in that it indicates that we care
3424 about the value of the RESULT_DECL. */
3425 else if (TREE_CODE (*tp) == RETURN_EXPR)
3426 TREE_OPERAND (*tp, 0) = dp->result;
3427 /* Change all cleanups for the NRV to only run when an exception is
3429 else if (TREE_CODE (*tp) == CLEANUP_STMT
3430 && CLEANUP_DECL (*tp) == dp->var)
3431 CLEANUP_EH_ONLY (*tp) = 1;
3432 /* Replace the DECL_EXPR for the NRV with an initialization of the
3433 RESULT_DECL, if needed. */
3434 else if (TREE_CODE (*tp) == DECL_EXPR
3435 && DECL_EXPR_DECL (*tp) == dp->var)
3438 if (DECL_INITIAL (dp->var)
3439 && DECL_INITIAL (dp->var) != error_mark_node)
3440 init = build2 (INIT_EXPR, void_type_node, dp->result,
3441 DECL_INITIAL (dp->var));
3443 init = build_empty_stmt (EXPR_LOCATION (*tp));
3444 DECL_INITIAL (dp->var) = NULL_TREE;
3445 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3448 /* And replace all uses of the NRV with the RESULT_DECL. */
3449 else if (*tp == dp->var)
3452 /* Avoid walking into the same tree more than once. Unfortunately, we
3453 can't just use walk_tree_without duplicates because it would only call
3454 us for the first occurrence of dp->var in the function body. */
3455 slot = htab_find_slot (dp->visited, *tp, INSERT);
3461 /* Keep iterating. */
3465 /* Called from finish_function to implement the named return value
3466 optimization by overriding all the RETURN_EXPRs and pertinent
3467 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3468 RESULT_DECL for the function. */
3471 finalize_nrv (tree *tp, tree var, tree result)
3473 struct nrv_data data;
3475 /* Copy debugging information from VAR to RESULT. */
3476 DECL_NAME (result) = DECL_NAME (var);
3477 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3478 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3479 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3480 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3481 /* Don't forget that we take its address. */
3482 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3485 data.result = result;
3486 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3487 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3488 htab_delete (data.visited);
3491 /* Return the declaration for the function called by CALL_EXPR T,
3492 TYPE is the class type of the clause decl. */
3495 omp_clause_info_fndecl (tree t, tree type)
3497 tree ret = get_callee_fndecl (t);
3502 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3503 t = CALL_EXPR_FN (t);
3505 if (TREE_CODE (t) == OBJ_TYPE_REF)
3507 t = cp_fold_obj_type_ref (t, type);
3508 if (TREE_CODE (t) == ADDR_EXPR
3509 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3510 return TREE_OPERAND (t, 0);
3516 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3519 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3520 bool need_copy_ctor, bool need_copy_assignment)
3522 int save_errorcount = errorcount;
3525 /* Always allocate 3 elements for simplicity. These are the
3526 function decls for the ctor, dtor, and assignment op.
3527 This layout is known to the three lang hooks,
3528 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3529 and cxx_omp_clause_assign_op. */
3530 info = make_tree_vec (3);
3531 CP_OMP_CLAUSE_INFO (c) = info;
3533 if (need_default_ctor
3534 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3538 if (need_default_ctor)
3542 t = build_int_cst (build_pointer_type (type), 0);
3543 t = build1 (INDIRECT_REF, type, t);
3544 vec = make_tree_vector_single (t);
3546 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3547 &vec, type, LOOKUP_NORMAL,
3548 tf_warning_or_error);
3551 release_tree_vector (vec);
3553 if (targetm.cxx.cdtor_returns_this () || errorcount)
3554 /* Because constructors and destructors return this,
3555 the call will have been cast to "void". Remove the
3556 cast here. We would like to use STRIP_NOPS, but it
3557 wouldn't work here because TYPE_MODE (t) and
3558 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3559 They are VOIDmode and Pmode, respectively. */
3560 if (TREE_CODE (t) == NOP_EXPR)
3561 t = TREE_OPERAND (t, 0);
3563 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3566 if ((need_default_ctor || need_copy_ctor)
3567 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3569 t = build_int_cst (build_pointer_type (type), 0);
3570 t = build1 (INDIRECT_REF, type, t);
3571 t = build_special_member_call (t, complete_dtor_identifier,
3572 NULL, type, LOOKUP_NORMAL,
3573 tf_warning_or_error);
3575 if (targetm.cxx.cdtor_returns_this () || errorcount)
3576 /* Because constructors and destructors return this,
3577 the call will have been cast to "void". Remove the
3578 cast here. We would like to use STRIP_NOPS, but it
3579 wouldn't work here because TYPE_MODE (t) and
3580 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3581 They are VOIDmode and Pmode, respectively. */
3582 if (TREE_CODE (t) == NOP_EXPR)
3583 t = TREE_OPERAND (t, 0);
3585 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3588 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3592 t = build_int_cst (build_pointer_type (type), 0);
3593 t = build1 (INDIRECT_REF, type, t);
3594 vec = make_tree_vector_single (t);
3595 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3596 &vec, type, LOOKUP_NORMAL,
3597 tf_warning_or_error);
3598 release_tree_vector (vec);
3600 /* We'll have called convert_from_reference on the call, which
3601 may well have added an indirect_ref. It's unneeded here,
3602 and in the way, so kill it. */
3603 if (TREE_CODE (t) == INDIRECT_REF)
3604 t = TREE_OPERAND (t, 0);
3606 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3609 return errorcount != save_errorcount;
3612 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3613 Remove any elements from the list that are invalid. */
3616 finish_omp_clauses (tree clauses)
3618 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3619 tree c, t, *pc = &clauses;
3622 bitmap_obstack_initialize (NULL);
3623 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3624 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3625 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3627 for (pc = &clauses, c = clauses; c ; c = *pc)
3629 bool remove = false;
3631 switch (OMP_CLAUSE_CODE (c))
3633 case OMP_CLAUSE_SHARED:
3635 goto check_dup_generic;
3636 case OMP_CLAUSE_PRIVATE:
3638 goto check_dup_generic;
3639 case OMP_CLAUSE_REDUCTION:
3641 goto check_dup_generic;
3642 case OMP_CLAUSE_COPYPRIVATE:
3643 name = "copyprivate";
3644 goto check_dup_generic;
3645 case OMP_CLAUSE_COPYIN:
3647 goto check_dup_generic;
3649 t = OMP_CLAUSE_DECL (c);
3650 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3652 if (processing_template_decl)
3655 error ("%qD is not a variable in clause %qs", t, name);
3657 error ("%qE is not a variable in clause %qs", t, name);
3660 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3661 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3662 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3664 error ("%qD appears more than once in data clauses", t);
3668 bitmap_set_bit (&generic_head, DECL_UID (t));
3671 case OMP_CLAUSE_FIRSTPRIVATE:
3672 t = OMP_CLAUSE_DECL (c);
3673 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3675 if (processing_template_decl)
3678 error ("%qD is not a variable in clause %<firstprivate%>", t);
3680 error ("%qE is not a variable in clause %<firstprivate%>", t);
3683 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3684 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3686 error ("%qD appears more than once in data clauses", t);
3690 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3693 case OMP_CLAUSE_LASTPRIVATE:
3694 t = OMP_CLAUSE_DECL (c);
3695 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3697 if (processing_template_decl)
3700 error ("%qD is not a variable in clause %<lastprivate%>", t);
3702 error ("%qE is not a variable in clause %<lastprivate%>", t);
3705 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3706 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3708 error ("%qD appears more than once in data clauses", t);
3712 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3716 t = OMP_CLAUSE_IF_EXPR (c);
3717 t = maybe_convert_cond (t);
3718 if (t == error_mark_node)
3720 OMP_CLAUSE_IF_EXPR (c) = t;
3723 case OMP_CLAUSE_NUM_THREADS:
3724 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3725 if (t == error_mark_node)
3727 else if (!type_dependent_expression_p (t)
3728 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3730 error ("num_threads expression must be integral");
3735 case OMP_CLAUSE_SCHEDULE:
3736 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3739 else if (t == error_mark_node)
3741 else if (!type_dependent_expression_p (t)
3742 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3744 error ("schedule chunk size expression must be integral");
3749 case OMP_CLAUSE_NOWAIT:
3750 case OMP_CLAUSE_ORDERED:
3751 case OMP_CLAUSE_DEFAULT:
3752 case OMP_CLAUSE_UNTIED:
3753 case OMP_CLAUSE_COLLAPSE:
3761 *pc = OMP_CLAUSE_CHAIN (c);
3763 pc = &OMP_CLAUSE_CHAIN (c);
3766 for (pc = &clauses, c = clauses; c ; c = *pc)
3768 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3769 bool remove = false;
3770 bool need_complete_non_reference = false;
3771 bool need_default_ctor = false;
3772 bool need_copy_ctor = false;
3773 bool need_copy_assignment = false;
3774 bool need_implicitly_determined = false;
3775 tree type, inner_type;
3779 case OMP_CLAUSE_SHARED:
3781 need_implicitly_determined = true;
3783 case OMP_CLAUSE_PRIVATE:
3785 need_complete_non_reference = true;
3786 need_default_ctor = true;
3787 need_implicitly_determined = true;
3789 case OMP_CLAUSE_FIRSTPRIVATE:
3790 name = "firstprivate";
3791 need_complete_non_reference = true;
3792 need_copy_ctor = true;
3793 need_implicitly_determined = true;
3795 case OMP_CLAUSE_LASTPRIVATE:
3796 name = "lastprivate";
3797 need_complete_non_reference = true;
3798 need_copy_assignment = true;
3799 need_implicitly_determined = true;
3801 case OMP_CLAUSE_REDUCTION:
3803 need_implicitly_determined = true;
3805 case OMP_CLAUSE_COPYPRIVATE:
3806 name = "copyprivate";
3807 need_copy_assignment = true;
3809 case OMP_CLAUSE_COPYIN:
3811 need_copy_assignment = true;
3814 pc = &OMP_CLAUSE_CHAIN (c);
3818 t = OMP_CLAUSE_DECL (c);
3819 if (processing_template_decl
3820 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3822 pc = &OMP_CLAUSE_CHAIN (c);
3828 case OMP_CLAUSE_LASTPRIVATE:
3829 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3830 need_default_ctor = true;
3833 case OMP_CLAUSE_REDUCTION:
3834 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3835 || POINTER_TYPE_P (TREE_TYPE (t)))
3837 error ("%qE has invalid type for %<reduction%>", t);
3840 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3842 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3850 error ("%qE has invalid type for %<reduction(%s)%>",
3851 t, operator_name_info[r_code].name);
3857 case OMP_CLAUSE_COPYIN:
3858 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3860 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3869 if (need_complete_non_reference)
3871 t = require_complete_type (t);
3872 if (t == error_mark_node)
3874 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3876 error ("%qE has reference type for %qs", t, name);
3880 if (need_implicitly_determined)
3882 const char *share_name = NULL;
3884 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3885 share_name = "threadprivate";
3886 else switch (cxx_omp_predetermined_sharing (t))
3888 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3890 case OMP_CLAUSE_DEFAULT_SHARED:
3891 share_name = "shared";
3893 case OMP_CLAUSE_DEFAULT_PRIVATE:
3894 share_name = "private";
3901 error ("%qE is predetermined %qs for %qs",
3902 t, share_name, name);
3907 /* We're interested in the base element, not arrays. */
3908 inner_type = type = TREE_TYPE (t);
3909 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3910 inner_type = TREE_TYPE (inner_type);
3912 /* Check for special function availability by building a call to one.
3913 Save the results, because later we won't be in the right context
3914 for making these queries. */
3915 if (CLASS_TYPE_P (inner_type)
3916 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3917 && !type_dependent_expression_p (t)
3918 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3919 need_copy_ctor, need_copy_assignment))
3923 *pc = OMP_CLAUSE_CHAIN (c);
3925 pc = &OMP_CLAUSE_CHAIN (c);
3928 bitmap_obstack_release (NULL);
3932 /* For all variables in the tree_list VARS, mark them as thread local. */
3935 finish_omp_threadprivate (tree vars)
3939 /* Mark every variable in VARS to be assigned thread local storage. */
3940 for (t = vars; t; t = TREE_CHAIN (t))
3942 tree v = TREE_PURPOSE (t);
3944 if (error_operand_p (v))
3946 else if (TREE_CODE (v) != VAR_DECL)
3947 error ("%<threadprivate%> %qD is not file, namespace "
3948 "or block scope variable", v);
3949 /* If V had already been marked threadprivate, it doesn't matter
3950 whether it had been used prior to this point. */
3951 else if (TREE_USED (v)
3952 && (DECL_LANG_SPECIFIC (v) == NULL
3953 || !CP_DECL_THREADPRIVATE_P (v)))
3954 error ("%qE declared %<threadprivate%> after first use", v);
3955 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3956 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3957 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3958 error ("%<threadprivate%> %qE has incomplete type", v);
3959 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3960 && CP_DECL_CONTEXT (v) != current_class_type)
3961 error ("%<threadprivate%> %qE directive not "
3962 "in %qT definition", v, CP_DECL_CONTEXT (v));
3965 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3966 if (DECL_LANG_SPECIFIC (v) == NULL)
3968 retrofit_lang_decl (v);
3970 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3971 after the allocation of the lang_decl structure. */
3972 if (DECL_DISCRIMINATOR_P (v))
3973 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
3976 if (! DECL_THREAD_LOCAL_P (v))
3978 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3979 /* If rtl has been already set for this var, call
3980 make_decl_rtl once again, so that encode_section_info
3981 has a chance to look at the new decl flags. */
3982 if (DECL_RTL_SET_P (v))
3985 CP_DECL_THREADPRIVATE_P (v) = 1;
3990 /* Build an OpenMP structured block. */
3993 begin_omp_structured_block (void)
3995 return do_pushlevel (sk_omp);
3999 finish_omp_structured_block (tree block)
4001 return do_poplevel (block);
4004 /* Similarly, except force the retention of the BLOCK. */
4007 begin_omp_parallel (void)
4009 keep_next_level (true);
4010 return begin_omp_structured_block ();
4014 finish_omp_parallel (tree clauses, tree body)
4018 body = finish_omp_structured_block (body);
4020 stmt = make_node (OMP_PARALLEL);
4021 TREE_TYPE (stmt) = void_type_node;
4022 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4023 OMP_PARALLEL_BODY (stmt) = body;
4025 return add_stmt (stmt);
4029 begin_omp_task (void)
4031 keep_next_level (true);
4032 return begin_omp_structured_block ();
4036 finish_omp_task (tree clauses, tree body)
4040 body = finish_omp_structured_block (body);
4042 stmt = make_node (OMP_TASK);
4043 TREE_TYPE (stmt) = void_type_node;
4044 OMP_TASK_CLAUSES (stmt) = clauses;
4045 OMP_TASK_BODY (stmt) = body;
4047 return add_stmt (stmt);
4050 /* Helper function for finish_omp_for. Convert Ith random access iterator
4051 into integral iterator. Return FALSE if successful. */
4054 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4055 tree condv, tree incrv, tree *body,
4056 tree *pre_body, tree clauses)
4058 tree diff, iter_init, iter_incr = NULL, last;
4059 tree incr_var = NULL, orig_pre_body, orig_body, c;
4060 tree decl = TREE_VEC_ELT (declv, i);
4061 tree init = TREE_VEC_ELT (initv, i);
4062 tree cond = TREE_VEC_ELT (condv, i);
4063 tree incr = TREE_VEC_ELT (incrv, i);
4065 location_t elocus = locus;
4067 if (init && EXPR_HAS_LOCATION (init))
4068 elocus = EXPR_LOCATION (init);
4070 switch (TREE_CODE (cond))
4076 if (TREE_OPERAND (cond, 1) == iter)
4077 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4078 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4079 if (TREE_OPERAND (cond, 0) != iter)
4080 cond = error_mark_node;
4083 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4084 TREE_OPERAND (cond, 1), ERROR_MARK,
4085 NULL, tf_warning_or_error);
4086 if (error_operand_p (tem))
4091 cond = error_mark_node;
4094 if (cond == error_mark_node)
4096 error_at (elocus, "invalid controlling predicate");
4099 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4100 ERROR_MARK, iter, ERROR_MARK, NULL,
4101 tf_warning_or_error);
4102 if (error_operand_p (diff))
4104 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4106 error_at (elocus, "difference between %qE and %qD does not have integer type",
4107 TREE_OPERAND (cond, 1), iter);
4111 switch (TREE_CODE (incr))
4113 case PREINCREMENT_EXPR:
4114 case PREDECREMENT_EXPR:
4115 case POSTINCREMENT_EXPR:
4116 case POSTDECREMENT_EXPR:
4117 if (TREE_OPERAND (incr, 0) != iter)
4119 incr = error_mark_node;
4122 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4123 tf_warning_or_error);
4124 if (error_operand_p (iter_incr))
4126 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4127 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4128 incr = integer_one_node;
4130 incr = integer_minus_one_node;
4133 if (TREE_OPERAND (incr, 0) != iter)
4134 incr = error_mark_node;
4135 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4136 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4138 tree rhs = TREE_OPERAND (incr, 1);
4139 if (TREE_OPERAND (rhs, 0) == iter)
4141 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4143 incr = error_mark_node;
4146 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4147 TREE_OPERAND (rhs, 1),
4148 tf_warning_or_error);
4149 if (error_operand_p (iter_incr))
4151 incr = TREE_OPERAND (rhs, 1);
4152 incr = cp_convert (TREE_TYPE (diff), incr);
4153 if (TREE_CODE (rhs) == MINUS_EXPR)
4155 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4156 incr = fold_if_not_in_template (incr);
4158 if (TREE_CODE (incr) != INTEGER_CST
4159 && (TREE_CODE (incr) != NOP_EXPR
4160 || (TREE_CODE (TREE_OPERAND (incr, 0))
4165 else if (TREE_OPERAND (rhs, 1) == iter)
4167 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4168 || TREE_CODE (rhs) != PLUS_EXPR)
4169 incr = error_mark_node;
4172 iter_incr = build_x_binary_op (PLUS_EXPR,
4173 TREE_OPERAND (rhs, 0),
4176 tf_warning_or_error);
4177 if (error_operand_p (iter_incr))
4179 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4181 tf_warning_or_error);
4182 if (error_operand_p (iter_incr))
4184 incr = TREE_OPERAND (rhs, 0);
4189 incr = error_mark_node;
4192 incr = error_mark_node;
4195 incr = error_mark_node;
4199 if (incr == error_mark_node)
4201 error_at (elocus, "invalid increment expression");
4205 incr = cp_convert (TREE_TYPE (diff), incr);
4206 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4207 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4208 && OMP_CLAUSE_DECL (c) == iter)
4211 decl = create_temporary_var (TREE_TYPE (diff));
4213 add_decl_expr (decl);
4214 last = create_temporary_var (TREE_TYPE (diff));
4216 add_decl_expr (last);
4217 if (c && iter_incr == NULL)
4219 incr_var = create_temporary_var (TREE_TYPE (diff));
4220 pushdecl (incr_var);
4221 add_decl_expr (incr_var);
4223 gcc_assert (stmts_are_full_exprs_p ());
4225 orig_pre_body = *pre_body;
4226 *pre_body = push_stmt_list ();
4228 add_stmt (orig_pre_body);
4230 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4231 tf_warning_or_error));
4232 init = build_int_cst (TREE_TYPE (diff), 0);
4233 if (c && iter_incr == NULL)
4235 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4236 incr, tf_warning_or_error));
4238 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4239 tf_warning_or_error);
4241 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4242 tf_warning_or_error));
4243 *pre_body = pop_stmt_list (*pre_body);
4245 cond = cp_build_binary_op (elocus,
4246 TREE_CODE (cond), decl, diff,
4247 tf_warning_or_error);
4248 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4249 elocus, incr, NULL_TREE);
4252 *body = push_stmt_list ();
4253 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4254 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4255 tf_warning_or_error);
4256 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4257 finish_expr_stmt (iter_init);
4258 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4259 tf_warning_or_error));
4260 add_stmt (orig_body);
4261 *body = pop_stmt_list (*body);
4265 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4266 finish_expr_stmt (iter_incr);
4267 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4268 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4271 TREE_VEC_ELT (declv, i) = decl;
4272 TREE_VEC_ELT (initv, i) = init;
4273 TREE_VEC_ELT (condv, i) = cond;
4274 TREE_VEC_ELT (incrv, i) = incr;
4279 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4280 are directly for their associated operands in the statement. DECL
4281 and INIT are a combo; if DECL is NULL then INIT ought to be a
4282 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4283 optional statements that need to go before the loop into its
4287 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4288 tree incrv, tree body, tree pre_body, tree clauses)
4290 tree omp_for = NULL, orig_incr = NULL;
4291 tree decl, init, cond, incr;
4295 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4296 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4297 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4298 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4300 decl = TREE_VEC_ELT (declv, i);
4301 init = TREE_VEC_ELT (initv, i);
4302 cond = TREE_VEC_ELT (condv, i);
4303 incr = TREE_VEC_ELT (incrv, i);
4309 switch (TREE_CODE (init))
4312 decl = TREE_OPERAND (init, 0);
4313 init = TREE_OPERAND (init, 1);
4316 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4318 decl = TREE_OPERAND (init, 0);
4319 init = TREE_OPERAND (init, 2);
4329 "expected iteration declaration or initialization");
4334 if (init && EXPR_HAS_LOCATION (init))
4335 elocus = EXPR_LOCATION (init);
4339 error_at (elocus, "missing controlling predicate");
4345 error_at (elocus, "missing increment expression");
4349 TREE_VEC_ELT (declv, i) = decl;
4350 TREE_VEC_ELT (initv, i) = init;
4353 if (dependent_omp_for_p (declv, initv, condv, incrv))
4357 stmt = make_node (OMP_FOR);
4359 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4361 /* This is really just a place-holder. We'll be decomposing this
4362 again and going through the cp_build_modify_expr path below when
4363 we instantiate the thing. */
4364 TREE_VEC_ELT (initv, i)
4365 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4366 TREE_VEC_ELT (initv, i));
4369 TREE_TYPE (stmt) = void_type_node;
4370 OMP_FOR_INIT (stmt) = initv;
4371 OMP_FOR_COND (stmt) = condv;
4372 OMP_FOR_INCR (stmt) = incrv;
4373 OMP_FOR_BODY (stmt) = body;
4374 OMP_FOR_PRE_BODY (stmt) = pre_body;
4375 OMP_FOR_CLAUSES (stmt) = clauses;
4377 SET_EXPR_LOCATION (stmt, locus);
4378 return add_stmt (stmt);
4381 if (processing_template_decl)
4382 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4384 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4386 decl = TREE_VEC_ELT (declv, i);
4387 init = TREE_VEC_ELT (initv, i);
4388 cond = TREE_VEC_ELT (condv, i);
4389 incr = TREE_VEC_ELT (incrv, i);
4391 TREE_VEC_ELT (orig_incr, i) = incr;
4394 if (init && EXPR_HAS_LOCATION (init))
4395 elocus = EXPR_LOCATION (init);
4399 error_at (elocus, "expected iteration declaration or initialization");
4403 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4406 TREE_VEC_ELT (orig_incr, i) = incr;
4407 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4408 TREE_CODE (TREE_OPERAND (incr, 1)),
4409 TREE_OPERAND (incr, 2),
4410 tf_warning_or_error);
4413 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4415 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4416 incrv, &body, &pre_body, clauses))
4421 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4422 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4424 error_at (elocus, "invalid type for iteration variable %qE", decl);
4428 if (!processing_template_decl)
4430 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4431 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4434 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4436 && TREE_SIDE_EFFECTS (cond)
4437 && COMPARISON_CLASS_P (cond)
4438 && !processing_template_decl)
4440 tree t = TREE_OPERAND (cond, 0);
4441 if (TREE_SIDE_EFFECTS (t)
4443 && (TREE_CODE (t) != NOP_EXPR
4444 || TREE_OPERAND (t, 0) != decl))
4445 TREE_OPERAND (cond, 0)
4446 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4448 t = TREE_OPERAND (cond, 1);
4449 if (TREE_SIDE_EFFECTS (t)
4451 && (TREE_CODE (t) != NOP_EXPR
4452 || TREE_OPERAND (t, 0) != decl))
4453 TREE_OPERAND (cond, 1)
4454 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4456 if (decl == error_mark_node || init == error_mark_node)
4459 TREE_VEC_ELT (declv, i) = decl;
4460 TREE_VEC_ELT (initv, i) = init;
4461 TREE_VEC_ELT (condv, i) = cond;
4462 TREE_VEC_ELT (incrv, i) = incr;
4466 if (IS_EMPTY_STMT (pre_body))
4469 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4472 if (omp_for == NULL)
4475 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4477 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4478 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4480 if (TREE_CODE (incr) != MODIFY_EXPR)
4483 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4484 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4485 && !processing_template_decl)
4487 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4488 if (TREE_SIDE_EFFECTS (t)
4490 && (TREE_CODE (t) != NOP_EXPR
4491 || TREE_OPERAND (t, 0) != decl))
4492 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4493 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4495 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4496 if (TREE_SIDE_EFFECTS (t)
4498 && (TREE_CODE (t) != NOP_EXPR
4499 || TREE_OPERAND (t, 0) != decl))
4500 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4501 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4505 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4507 if (omp_for != NULL)
4508 OMP_FOR_CLAUSES (omp_for) = clauses;
4513 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4522 dependent_p = false;
4525 /* Even in a template, we can detect invalid uses of the atomic
4526 pragma if neither LHS nor RHS is type-dependent. */
4527 if (processing_template_decl)
4529 dependent_p = (type_dependent_expression_p (lhs)
4530 || type_dependent_expression_p (rhs));
4533 lhs = build_non_dependent_expr (lhs);
4534 rhs = build_non_dependent_expr (rhs);
4539 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4540 if (stmt == error_mark_node)
4543 if (processing_template_decl)
4544 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4545 build2 (code, void_type_node, orig_lhs, orig_rhs));
4550 finish_omp_barrier (void)
4552 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4553 VEC(tree,gc) *vec = make_tree_vector ();
4554 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4555 release_tree_vector (vec);
4556 finish_expr_stmt (stmt);
4560 finish_omp_flush (void)
4562 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4563 VEC(tree,gc) *vec = make_tree_vector ();
4564 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4565 release_tree_vector (vec);
4566 finish_expr_stmt (stmt);
4570 finish_omp_taskwait (void)
4572 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4573 VEC(tree,gc) *vec = make_tree_vector ();
4574 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4575 release_tree_vector (vec);
4576 finish_expr_stmt (stmt);
4580 init_cp_semantics (void)
4584 /* Build a STATIC_ASSERT for a static assertion with the condition
4585 CONDITION and the message text MESSAGE. LOCATION is the location
4586 of the static assertion in the source code. When MEMBER_P, this
4587 static assertion is a member of a class. */
4589 finish_static_assert (tree condition, tree message, location_t location,
4592 if (check_for_bare_parameter_packs (condition))
4593 condition = error_mark_node;
4595 if (type_dependent_expression_p (condition)
4596 || value_dependent_expression_p (condition))
4598 /* We're in a template; build a STATIC_ASSERT and put it in
4602 assertion = make_node (STATIC_ASSERT);
4603 STATIC_ASSERT_CONDITION (assertion) = condition;
4604 STATIC_ASSERT_MESSAGE (assertion) = message;
4605 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4608 maybe_add_class_template_decl_list (current_class_type,
4612 add_stmt (assertion);
4617 /* Fold the expression and convert it to a boolean value. */
4618 condition = fold_non_dependent_expr (condition);
4619 condition = cp_convert (boolean_type_node, condition);
4621 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4622 /* Do nothing; the condition is satisfied. */
4626 location_t saved_loc = input_location;
4628 input_location = location;
4629 if (TREE_CODE (condition) == INTEGER_CST
4630 && integer_zerop (condition))
4631 /* Report the error. */
4632 error ("static assertion failed: %E", message);
4633 else if (condition && condition != error_mark_node)
4634 error ("non-constant condition for static assertion");
4635 input_location = saved_loc;
4639 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4640 just return the type even though EXPR is a type-dependent expression.
4641 The ABI specifies which cases this applies to, which is a subset of the
4645 describable_type (tree expr)
4647 tree type = NULL_TREE;
4649 if (! type_dependent_expression_p (expr)
4650 && ! type_unknown_p (expr))
4652 type = unlowered_expr_type (expr);
4653 if (real_lvalue_p (expr))
4654 type = build_reference_type (type);
4660 switch (TREE_CODE (expr))
4666 /* Named rvalue reference becomes lvalue. */
4667 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4672 case TEMPLATE_PARM_INDEX:
4674 case STATIC_CAST_EXPR:
4675 case REINTERPRET_CAST_EXPR:
4676 case CONST_CAST_EXPR:
4677 case DYNAMIC_CAST_EXPR:
4678 type = TREE_TYPE (expr);
4683 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4684 if (ptrtype && POINTER_TYPE_P (ptrtype))
4685 type = build_reference_type (TREE_TYPE (ptrtype));
4690 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4691 type = TREE_TYPE (expr);
4695 if (type && type_uses_auto (type))
4701 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4702 suitable for use as a type-specifier.
4704 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4705 id-expression or a class member access, FALSE when it was parsed as
4706 a full expression. */
4709 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4711 tree orig_expr = expr;
4712 tree type = NULL_TREE;
4714 if (!expr || error_operand_p (expr))
4715 return error_mark_node;
4718 || TREE_CODE (expr) == TYPE_DECL
4719 || (TREE_CODE (expr) == BIT_NOT_EXPR
4720 && TYPE_P (TREE_OPERAND (expr, 0))))
4722 error ("argument to decltype must be an expression");
4723 return error_mark_node;
4726 if (type_dependent_expression_p (expr))
4728 if (id_expression_or_member_access_p)
4730 switch (TREE_CODE (expr))
4737 case TEMPLATE_PARM_INDEX:
4738 type = TREE_TYPE (expr);
4746 if (type && !type_uses_auto (type))
4749 type = cxx_make_type (DECLTYPE_TYPE);
4750 DECLTYPE_TYPE_EXPR (type) = expr;
4751 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4752 = id_expression_or_member_access_p;
4753 SET_TYPE_STRUCTURAL_EQUALITY (type);
4758 /* The type denoted by decltype(e) is defined as follows: */
4760 expr = resolve_nondeduced_context (expr);
4761 if (id_expression_or_member_access_p)
4763 /* If e is an id-expression or a class member access (5.2.5
4764 [expr.ref]), decltype(e) is defined as the type of the entity
4765 named by e. If there is no such entity, or e names a set of
4766 overloaded functions, the program is ill-formed. */
4767 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4768 expr = lookup_name (expr);
4770 if (TREE_CODE (expr) == INDIRECT_REF)
4771 /* This can happen when the expression is, e.g., "a.b". Just
4772 look at the underlying operand. */
4773 expr = TREE_OPERAND (expr, 0);
4775 if (TREE_CODE (expr) == OFFSET_REF
4776 || TREE_CODE (expr) == MEMBER_REF)
4777 /* We're only interested in the field itself. If it is a
4778 BASELINK, we will need to see through it in the next
4780 expr = TREE_OPERAND (expr, 1);
4782 if (TREE_CODE (expr) == BASELINK)
4783 /* See through BASELINK nodes to the underlying functions. */
4784 expr = BASELINK_FUNCTIONS (expr);
4786 if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
4787 expr = TREE_OPERAND (expr, 0);
4789 if (TREE_CODE (expr) == OVERLOAD)
4791 if (OVL_CHAIN (expr)
4792 || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL)
4794 error ("%qE refers to a set of overloaded functions", orig_expr);
4795 return error_mark_node;
4798 /* An overload set containing only one function: just look
4799 at that function. */
4800 expr = OVL_FUNCTION (expr);
4803 switch (TREE_CODE (expr))
4806 if (DECL_BIT_FIELD_TYPE (expr))
4808 type = DECL_BIT_FIELD_TYPE (expr);
4811 /* Fall through for fields that aren't bitfields. */
4818 case TEMPLATE_PARM_INDEX:
4819 type = TREE_TYPE (expr);
4823 type = error_mark_node;
4827 type = is_bitfield_expr_with_lowered_type (expr);
4829 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4836 /* We can get here when the id-expression refers to an
4838 type = TREE_TYPE (expr);
4842 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4843 || TREE_CODE (expr) == SCOPE_REF);
4844 error ("argument to decltype must be an expression");
4845 return error_mark_node;
4850 /* Expressions of reference type are sometimes wrapped in
4851 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4852 representation, not part of the language, so we have to look
4854 if (TREE_CODE (expr) == INDIRECT_REF
4855 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4857 expr = TREE_OPERAND (expr, 0);
4859 if (TREE_CODE (expr) == CALL_EXPR)
4861 /* If e is a function call (5.2.2 [expr.call]) or an
4862 invocation of an overloaded operator (parentheses around e
4863 are ignored), decltype(e) is defined as the return type of
4865 tree fndecl = get_callee_fndecl (expr);
4866 if (fndecl && fndecl != error_mark_node)
4867 type = TREE_TYPE (TREE_TYPE (fndecl));
4870 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4871 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4872 || TREE_CODE (target_type) == POINTER_TYPE)
4873 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4874 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4875 type = TREE_TYPE (TREE_TYPE (target_type));
4877 sorry ("unable to determine the declared type of expression %<%E%>",
4883 type = is_bitfield_expr_with_lowered_type (expr);
4886 /* Bitfields are special, because their type encodes the
4887 number of bits they store. If the expression referenced a
4888 bitfield, TYPE now has the declared type of that
4890 type = cp_build_qualified_type (type,
4891 cp_type_quals (TREE_TYPE (expr)));
4893 if (real_lvalue_p (expr))
4894 type = build_reference_type (type);
4896 /* Within a lambda-expression:
4898 Every occurrence of decltype((x)) where x is a possibly
4899 parenthesized id-expression that names an entity of
4900 automatic storage duration is treated as if x were
4901 transformed into an access to a corresponding data member
4902 of the closure type that would have been declared if x
4903 were a use of the denoted entity. */
4904 else if (outer_automatic_var_p (expr)
4905 && current_function_decl
4906 && LAMBDA_FUNCTION_P (current_function_decl))
4907 type = capture_decltype (expr);
4910 /* Otherwise, where T is the type of e, if e is an lvalue,
4911 decltype(e) is defined as T&, otherwise decltype(e) is
4913 type = TREE_TYPE (expr);
4914 if (type == error_mark_node)
4915 return error_mark_node;
4916 else if (expr == current_class_ptr)
4917 /* If the expression is just "this", we want the
4918 cv-unqualified pointer for the "this" type. */
4919 type = TYPE_MAIN_VARIANT (type);
4920 else if (real_lvalue_p (expr))
4922 if (TREE_CODE (type) != REFERENCE_TYPE)
4923 type = build_reference_type (type);
4926 type = non_reference (type);
4931 if (!type || type == unknown_type_node)
4933 error ("type of %qE is unknown", expr);
4934 return error_mark_node;
4940 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4941 __has_nothrow_copy, depending on assign_p. */
4944 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4951 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4954 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4956 else if (TYPE_HAS_INIT_REF (type))
4958 /* If construction of the copy constructor was postponed, create
4960 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4961 lazily_declare_fn (sfk_copy_constructor, type);
4962 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
4963 lazily_declare_fn (sfk_move_constructor, type);
4964 fns = CLASSTYPE_CONSTRUCTORS (type);
4969 for (; fns; fns = OVL_NEXT (fns))
4971 tree fn = OVL_CURRENT (fns);
4975 if (copy_fn_p (fn) == 0)
4978 else if (copy_fn_p (fn) <= 0)
4981 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4988 /* Actually evaluates the trait. */
4991 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4993 enum tree_code type_code1;
4996 type_code1 = TREE_CODE (type1);
5000 case CPTK_HAS_NOTHROW_ASSIGN:
5001 type1 = strip_array_types (type1);
5002 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5003 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5004 || (CLASS_TYPE_P (type1)
5005 && classtype_has_nothrow_assign_or_copy_p (type1,
5008 case CPTK_HAS_TRIVIAL_ASSIGN:
5009 /* ??? The standard seems to be missing the "or array of such a class
5010 type" wording for this trait. */
5011 type1 = strip_array_types (type1);
5012 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5013 && (trivial_type_p (type1)
5014 || (CLASS_TYPE_P (type1)
5015 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
5017 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5018 type1 = strip_array_types (type1);
5019 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5020 || (CLASS_TYPE_P (type1)
5021 && (t = locate_ctor (type1, NULL))
5022 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5024 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5025 type1 = strip_array_types (type1);
5026 return (trivial_type_p (type1)
5027 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5029 case CPTK_HAS_NOTHROW_COPY:
5030 type1 = strip_array_types (type1);
5031 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5032 || (CLASS_TYPE_P (type1)
5033 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5035 case CPTK_HAS_TRIVIAL_COPY:
5036 /* ??? The standard seems to be missing the "or array of such a class
5037 type" wording for this trait. */
5038 type1 = strip_array_types (type1);
5039 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5040 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
5042 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5043 type1 = strip_array_types (type1);
5044 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5045 || (CLASS_TYPE_P (type1)
5046 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5048 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5049 return (CLASS_TYPE_P (type1)
5050 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
5052 case CPTK_IS_ABSTRACT:
5053 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5055 case CPTK_IS_BASE_OF:
5056 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5057 && DERIVED_FROM_P (type1, type2));
5060 return (NON_UNION_CLASS_TYPE_P (type1));
5062 case CPTK_IS_CONVERTIBLE_TO:
5067 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5070 return (type_code1 == ENUMERAL_TYPE);
5073 return (pod_type_p (type1));
5075 case CPTK_IS_POLYMORPHIC:
5076 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5078 case CPTK_IS_STD_LAYOUT:
5079 return (std_layout_type_p (type1));
5081 case CPTK_IS_TRIVIAL:
5082 return (trivial_type_p (type1));
5085 return (type_code1 == UNION_TYPE);
5093 /* Returns true if TYPE is a complete type, an array of unknown bound,
5094 or (possibly cv-qualified) void, returns false otherwise. */
5097 check_trait_type (tree type)
5099 if (COMPLETE_TYPE_P (type))
5102 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
5105 if (VOID_TYPE_P (type))
5111 /* Process a trait expression. */
5114 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5116 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5117 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5118 || kind == CPTK_HAS_NOTHROW_COPY
5119 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5120 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5121 || kind == CPTK_HAS_TRIVIAL_COPY
5122 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5123 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5124 || kind == CPTK_IS_ABSTRACT
5125 || kind == CPTK_IS_BASE_OF
5126 || kind == CPTK_IS_CLASS
5127 || kind == CPTK_IS_CONVERTIBLE_TO
5128 || kind == CPTK_IS_EMPTY
5129 || kind == CPTK_IS_ENUM
5130 || kind == CPTK_IS_POD
5131 || kind == CPTK_IS_POLYMORPHIC
5132 || kind == CPTK_IS_STD_LAYOUT
5133 || kind == CPTK_IS_TRIVIAL
5134 || kind == CPTK_IS_UNION);
5136 if (kind == CPTK_IS_CONVERTIBLE_TO)
5138 sorry ("__is_convertible_to");
5139 return error_mark_node;
5142 if (type1 == error_mark_node
5143 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5144 && type2 == error_mark_node))
5145 return error_mark_node;
5147 if (processing_template_decl)
5149 tree trait_expr = make_node (TRAIT_EXPR);
5150 TREE_TYPE (trait_expr) = boolean_type_node;
5151 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5152 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5153 TRAIT_EXPR_KIND (trait_expr) = kind;
5157 complete_type (type1);
5159 complete_type (type2);
5163 case CPTK_HAS_NOTHROW_ASSIGN:
5164 case CPTK_HAS_TRIVIAL_ASSIGN:
5165 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5166 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5167 case CPTK_HAS_NOTHROW_COPY:
5168 case CPTK_HAS_TRIVIAL_COPY:
5169 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5170 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5171 case CPTK_IS_ABSTRACT:
5174 case CPTK_IS_POLYMORPHIC:
5175 case CPTK_IS_STD_LAYOUT:
5176 case CPTK_IS_TRIVIAL:
5177 if (!check_trait_type (type1))
5179 error ("incomplete type %qT not allowed", type1);
5180 return error_mark_node;
5184 case CPTK_IS_BASE_OF:
5185 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5186 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5187 && !COMPLETE_TYPE_P (type2))
5189 error ("incomplete type %qT not allowed", type2);
5190 return error_mark_node;
5199 case CPTK_IS_CONVERTIBLE_TO:
5204 return (trait_expr_value (kind, type1, type2)
5205 ? boolean_true_node : boolean_false_node);
5208 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5209 which is ignored for C++. */
5212 set_float_const_decimal64 (void)
5217 clear_float_const_decimal64 (void)
5222 float_const_decimal64_p (void)
5227 /* Return true if T is a literal type. */
5230 literal_type_p (tree t)
5232 if (SCALAR_TYPE_P (t))
5234 if (CLASS_TYPE_P (t))
5235 return CLASSTYPE_LITERAL_P (t);
5236 if (TREE_CODE (t) == ARRAY_TYPE)
5237 return literal_type_p (strip_array_types (t));
5242 /* If DECL is a variable declared `constexpr', require its type
5243 be literal. Return the DECL if OK, otherwise NULL. */
5246 ensure_literal_type_for_constexpr_object (tree decl)
5248 tree type = TREE_TYPE (decl);
5249 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5250 && !processing_template_decl && !literal_type_p (type))
5252 error ("the type %qT of constexpr variable %qD is not literal",
5259 /* Return non-null if FUN certainly designates a valid constexpr function
5260 declaration. Otherwise return NULL. Issue appropriate diagnostics
5261 if necessary. Note that we only check the declaration, not the body
5265 validate_constexpr_fundecl (tree fun)
5267 tree rettype = NULL;
5270 /* Don't bother if FUN is not marked constexpr. */
5271 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5274 /* For a function template, we have absolutely no guarantee that all
5275 instantiations will be constexpr. */
5276 if (TREE_CODE (fun) == TEMPLATE_DECL)
5279 parm = FUNCTION_FIRST_USER_PARM (fun);
5280 for (; parm != NULL; parm = TREE_CHAIN (parm))
5282 tree type = TREE_TYPE (parm);
5283 if (dependent_type_p (type))
5285 if (!literal_type_p (type))
5287 error ("parameter %q#D is not of literal type", parm);
5292 if (DECL_CONSTRUCTOR_P (fun))
5295 rettype = TREE_TYPE (TREE_TYPE (fun));
5296 if (dependent_type_p (rettype))
5298 if (!literal_type_p (rettype))
5300 error ("return type %qT of function %qD is not a literal type",
5301 TREE_TYPE (TREE_TYPE (fun)), fun);
5308 /* Constructor for a lambda expression. */
5311 build_lambda_expr (void)
5313 tree lambda = make_node (LAMBDA_EXPR);
5314 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
5315 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
5316 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
5317 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
5318 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
5322 /* Create the closure object for a LAMBDA_EXPR. */
5325 build_lambda_object (tree lambda_expr)
5327 /* Build aggregate constructor call.
5328 - cp_parser_braced_list
5329 - cp_parser_functional_cast */
5330 VEC(constructor_elt,gc) *elts = NULL;
5331 tree node, expr, type;
5332 location_t saved_loc;
5334 if (processing_template_decl)
5337 /* Make sure any error messages refer to the lambda-introducer. */
5338 saved_loc = input_location;
5339 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
5341 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
5343 node = TREE_CHAIN (node))
5345 tree field = TREE_PURPOSE (node);
5346 tree val = TREE_VALUE (node);
5348 /* Mere mortals can't copy arrays with aggregate initialization, so
5349 do some magic to make it work here. */
5350 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
5351 val = build_array_copy (val);
5352 else if (DECL_NORMAL_CAPTURE_P (field)
5353 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
5355 /* "the entities that are captured by copy are used to
5356 direct-initialize each corresponding non-static data
5357 member of the resulting closure object."
5359 There's normally no way to express direct-initialization
5360 from an element of a CONSTRUCTOR, so we build up a special
5361 TARGET_EXPR to bypass the usual copy-initialization. */
5362 val = force_rvalue (val);
5363 if (TREE_CODE (val) == TARGET_EXPR)
5364 TARGET_EXPR_DIRECT_INIT_P (val) = true;
5367 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
5370 expr = build_constructor (init_list_type_node, elts);
5371 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
5373 /* N2927: "[The closure] class type is not an aggregate."
5374 But we briefly treat it as an aggregate to make this simpler. */
5375 type = TREE_TYPE (lambda_expr);
5376 CLASSTYPE_NON_AGGREGATE (type) = 0;
5377 expr = finish_compound_literal (type, expr);
5378 CLASSTYPE_NON_AGGREGATE (type) = 1;
5380 input_location = saved_loc;
5384 /* Return an initialized RECORD_TYPE for LAMBDA.
5385 LAMBDA must have its explicit captures already. */
5388 begin_lambda_type (tree lambda)
5393 /* Unique name. This is just like an unnamed class, but we cannot use
5394 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5396 name = make_lambda_name ();
5398 /* Create the new RECORD_TYPE for this lambda. */
5399 type = xref_tag (/*tag_code=*/record_type,
5401 /*scope=*/ts_within_enclosing_non_class,
5402 /*template_header_p=*/false);
5405 /* Designate it as a struct so that we can use aggregate initialization. */
5406 CLASSTYPE_DECLARED_CLASS (type) = false;
5408 /* Clear base types. */
5409 xref_basetypes (type, /*bases=*/NULL_TREE);
5411 /* Start the class. */
5412 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
5414 /* Cross-reference the expression and the type. */
5415 TREE_TYPE (lambda) = type;
5416 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
5421 /* Returns the type to use for the return type of the operator() of a
5425 lambda_return_type (tree expr)
5428 if (type_dependent_expression_p (expr))
5430 type = cxx_make_type (DECLTYPE_TYPE);
5431 DECLTYPE_TYPE_EXPR (type) = expr;
5432 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
5433 SET_TYPE_STRUCTURAL_EQUALITY (type);
5436 type = type_decays_to (unlowered_expr_type (expr));
5440 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5444 lambda_function (tree lambda)
5447 if (TREE_CODE (lambda) == LAMBDA_EXPR)
5448 type = TREE_TYPE (lambda);
5451 gcc_assert (LAMBDA_TYPE_P (type));
5452 /* Don't let debug_tree cause instantiation. */
5453 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
5455 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
5456 /*protect=*/0, /*want_type=*/false);
5458 lambda = BASELINK_FUNCTIONS (lambda);
5462 /* Returns the type to use for the FIELD_DECL corresponding to the
5464 The caller should add REFERENCE_TYPE for capture by reference. */
5467 lambda_capture_field_type (tree expr)
5470 if (type_dependent_expression_p (expr))
5472 type = cxx_make_type (DECLTYPE_TYPE);
5473 DECLTYPE_TYPE_EXPR (type) = expr;
5474 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
5475 SET_TYPE_STRUCTURAL_EQUALITY (type);
5478 type = non_reference (unlowered_expr_type (expr));
5482 /* Recompute the return type for LAMBDA with body of the form:
5483 { return EXPR ; } */
5486 apply_lambda_return_type (tree lambda, tree return_type)
5488 tree fco = lambda_function (lambda);
5491 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
5493 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5494 it would interfere with instantiating the closure type. */
5495 if (dependent_type_p (return_type))
5497 if (return_type == error_mark_node)
5500 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5501 TREE_TYPE (METHOD_TYPE) == return-type */
5502 TREE_TYPE (TREE_TYPE (fco)) = return_type;
5504 result = DECL_RESULT (fco);
5505 if (result == NULL_TREE)
5508 /* We already have a DECL_RESULT from start_preparsed_function.
5509 Now we need to redo the work it and allocate_struct_function
5510 did to reflect the new type. */
5511 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
5512 TYPE_MAIN_VARIANT (return_type));
5513 DECL_ARTIFICIAL (result) = 1;
5514 DECL_IGNORED_P (result) = 1;
5515 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
5518 DECL_RESULT (fco) = result;
5520 if (!processing_template_decl && aggregate_value_p (result, fco))
5522 #ifdef PCC_STATIC_STRUCT_RETURN
5523 cfun->returns_pcc_struct = 1;
5525 cfun->returns_struct = 1;
5530 /* DECL is a local variable or parameter from the surrounding scope of a
5531 lambda-expression. Returns the decltype for a use of the capture field
5532 for DECL even if it hasn't been captured yet. */
5535 capture_decltype (tree decl)
5537 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
5538 /* FIXME do lookup instead of list walk? */
5539 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
5543 type = TREE_TYPE (TREE_PURPOSE (cap));
5545 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
5548 error ("%qD is not captured", decl);
5549 return error_mark_node;
5552 type = TREE_TYPE (decl);
5553 if (TREE_CODE (type) == REFERENCE_TYPE
5554 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
5555 type = TREE_TYPE (type);
5558 case CPLD_REFERENCE:
5559 type = TREE_TYPE (decl);
5560 if (TREE_CODE (type) != REFERENCE_TYPE)
5561 type = build_reference_type (TREE_TYPE (decl));
5568 if (TREE_CODE (type) != REFERENCE_TYPE)
5570 if (!LAMBDA_EXPR_MUTABLE_P (lam))
5571 type = cp_build_qualified_type (type, (TYPE_QUALS (type)
5573 type = build_reference_type (type);
5578 /* From an ID and INITIALIZER, create a capture (by reference if
5579 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5583 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
5584 bool explicit_init_p)
5589 type = lambda_capture_field_type (initializer);
5592 type = build_reference_type (type);
5593 if (!real_lvalue_p (initializer))
5594 error ("cannot capture %qE by reference", initializer);
5597 /* Make member variable. */
5598 member = build_lang_decl (FIELD_DECL, id, type);
5599 if (!explicit_init_p)
5600 /* Normal captures are invisible to name lookup but uses are replaced
5601 with references to the capture field; we implement this by only
5602 really making them invisible in unevaluated context; see
5603 qualify_lookup. For now, let's make explicitly initialized captures
5605 DECL_NORMAL_CAPTURE_P (member) = true;
5607 /* Add it to the appropriate closure class. */
5608 finish_member_declaration (member);
5610 LAMBDA_EXPR_CAPTURE_LIST (lambda)
5611 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
5613 if (id == get_identifier ("__this"))
5615 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
5616 error ("already captured %<this%> in lambda expression");
5617 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
5623 /* Given a FIELD_DECL decl belonging to a closure type, return a
5624 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5628 thisify_lambda_field (tree decl)
5630 tree context = lambda_function (DECL_CONTEXT (decl));
5631 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
5633 tf_warning_or_error);
5634 return finish_non_static_data_member (decl, object,
5635 /*qualifying_scope*/NULL_TREE);
5638 /* Similar to add_capture, except this works on a stack of nested lambdas.
5639 BY_REFERENCE_P in this case is derived from the default capture mode.
5640 Returns the capture for the lambda at the bottom of the stack. */
5643 add_default_capture (tree lambda_stack, tree id, tree initializer)
5645 bool this_capture_p = (id == get_identifier ("__this"));
5647 tree member = NULL_TREE;
5649 tree saved_class_type = current_class_type;
5653 for (node = lambda_stack;
5655 node = TREE_CHAIN (node))
5657 tree lambda = TREE_VALUE (node);
5659 current_class_type = TREE_TYPE (lambda);
5660 member = add_capture (lambda,
5665 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
5666 == CPLD_REFERENCE)),
5667 /*explicit_init_p=*/false);
5668 initializer = thisify_lambda_field (member);
5671 current_class_type = saved_class_type;
5676 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5677 INDIRECT_REF, possibly adding it through default capturing. */
5680 lambda_expr_this_capture (tree lambda)
5684 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5686 /* Try to default capture 'this' if we can. */
5688 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
5690 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
5691 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
5692 tree init = NULL_TREE;
5694 /* If we are in a lambda function, we can move out until we hit:
5695 1. a non-lambda function,
5696 2. a lambda function capturing 'this', or
5697 3. a non-default capturing lambda function. */
5698 while (LAMBDA_FUNCTION_P (containing_function))
5701 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
5703 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
5705 /* An outer lambda has already captured 'this'. */
5706 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5707 init = thisify_lambda_field (cap);
5711 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
5712 /* An outer lambda won't let us capture 'this'. */
5715 lambda_stack = tree_cons (NULL_TREE,
5719 containing_function = decl_function_context (containing_function);
5722 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
5723 && !LAMBDA_FUNCTION_P (containing_function))
5724 /* First parameter is 'this'. */
5725 init = DECL_ARGUMENTS (containing_function);
5728 this_capture = add_default_capture (lambda_stack,
5729 /*id=*/get_identifier ("__this"),
5735 error ("%<this%> was not captured for this lambda function");
5736 result = error_mark_node;
5740 /* To make sure that current_class_ref is for the lambda. */
5741 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
5743 result = finish_non_static_data_member (this_capture,
5745 /*qualifying_scope=*/NULL_TREE);
5747 /* If 'this' is captured, each use of 'this' is transformed into an
5748 access to the corresponding unnamed data member of the closure
5749 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5750 ensures that the transformed expression is an rvalue. ] */
5751 result = rvalue (result);
5757 /* If the closure TYPE has a static op(), also add a conversion to function
5761 maybe_add_lambda_conv_op (tree type)
5763 bool nested = (current_function_decl != NULL_TREE);
5764 tree callop = lambda_function (type);
5765 tree rettype, name, fntype, fn, body, compound_stmt;
5767 if (!DECL_STATIC_FUNCTION_P (callop))
5770 rettype = build_pointer_type (TREE_TYPE (callop));
5771 name = mangle_conv_op_name_for_type (rettype);
5772 fntype = build_function_type (rettype, void_list_node);
5773 fn = build_lang_decl (FUNCTION_DECL, name, fntype);
5774 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5776 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5777 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5778 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5780 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
5781 grokclassfn (type, fn, NO_SPECIAL);
5782 set_linkage_according_to_type (type, fn);
5783 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5784 DECL_IN_AGGR_P (fn) = 1;
5785 DECL_ARTIFICIAL (fn) = 1;
5786 DECL_NOT_REALLY_EXTERN (fn) = 1;
5787 DECL_DECLARED_INLINE_P (fn) = 1;
5788 DECL_STATIC_FUNCTION_P (fn) = 1;
5790 add_method (type, fn, NULL_TREE);
5793 push_function_context ();
5794 start_preparsed_function (fn, NULL_TREE,
5795 SF_PRE_PARSED | SF_INCLASS_INLINE);
5796 body = begin_function_body ();
5797 compound_stmt = begin_compound_stmt (0);
5799 finish_return_stmt (decay_conversion (callop));
5801 finish_compound_stmt (compound_stmt);
5802 finish_function_body (body);
5804 expand_or_defer_fn (finish_function (2));
5806 pop_function_context ();
5808 #include "gt-cp-semantics.h"