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, REK_ASSIGNMENT_ASM);
1259 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1260 oconstraints[i] = constraint;
1262 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1263 &allows_mem, &allows_reg, &is_inout))
1265 /* If the operand is going to end up in memory,
1266 mark it addressable. */
1267 if (!allows_reg && !cxx_mark_addressable (operand))
1268 operand = error_mark_node;
1271 operand = error_mark_node;
1273 TREE_VALUE (t) = operand;
1276 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1278 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1279 operand = decay_conversion (TREE_VALUE (t));
1281 /* If the type of the operand hasn't been determined (e.g.,
1282 because it involves an overloaded function), then issue
1283 an error message. There's no context available to
1284 resolve the overloading. */
1285 if (TREE_TYPE (operand) == unknown_type_node)
1287 error ("type of asm operand %qE could not be determined",
1289 operand = error_mark_node;
1292 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1293 oconstraints, &allows_mem, &allows_reg))
1295 /* If the operand is going to end up in memory,
1296 mark it addressable. */
1297 if (!allows_reg && allows_mem)
1299 /* Strip the nops as we allow this case. FIXME, this really
1300 should be rejected or made deprecated. */
1301 STRIP_NOPS (operand);
1302 if (!cxx_mark_addressable (operand))
1303 operand = error_mark_node;
1307 operand = error_mark_node;
1309 TREE_VALUE (t) = operand;
1313 r = build_stmt (input_location, ASM_EXPR, string,
1314 output_operands, input_operands,
1316 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1317 r = maybe_cleanup_point_expr_void (r);
1318 return add_stmt (r);
1321 /* Finish a label with the indicated NAME. Returns the new label. */
1324 finish_label_stmt (tree name)
1326 tree decl = define_label (input_location, name);
1328 if (decl == error_mark_node)
1329 return error_mark_node;
1331 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1336 /* Finish a series of declarations for local labels. G++ allows users
1337 to declare "local" labels, i.e., labels with scope. This extension
1338 is useful when writing code involving statement-expressions. */
1341 finish_label_decl (tree name)
1343 if (!at_function_scope_p ())
1345 error ("__label__ declarations are only allowed in function scopes");
1349 add_decl_expr (declare_local_label (name));
1352 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1355 finish_decl_cleanup (tree decl, tree cleanup)
1357 push_cleanup (decl, cleanup, false);
1360 /* If the current scope exits with an exception, run CLEANUP. */
1363 finish_eh_cleanup (tree cleanup)
1365 push_cleanup (NULL, cleanup, true);
1368 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1369 order they were written by the user. Each node is as for
1370 emit_mem_initializers. */
1373 finish_mem_initializers (tree mem_inits)
1375 /* Reorder the MEM_INITS so that they are in the order they appeared
1376 in the source program. */
1377 mem_inits = nreverse (mem_inits);
1379 if (processing_template_decl)
1383 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1385 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1386 check for bare parameter packs in the TREE_VALUE, because
1387 any parameter packs in the TREE_VALUE have already been
1388 bound as part of the TREE_PURPOSE. See
1389 make_pack_expansion for more information. */
1390 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1391 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1392 TREE_VALUE (mem) = error_mark_node;
1395 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1398 emit_mem_initializers (mem_inits);
1401 /* Finish a parenthesized expression EXPR. */
1404 finish_parenthesized_expr (tree expr)
1407 /* This inhibits warnings in c_common_truthvalue_conversion. */
1408 TREE_NO_WARNING (expr) = 1;
1410 if (TREE_CODE (expr) == OFFSET_REF)
1411 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1412 enclosed in parentheses. */
1413 PTRMEM_OK_P (expr) = 0;
1415 if (TREE_CODE (expr) == STRING_CST)
1416 PAREN_STRING_LITERAL_P (expr) = 1;
1421 /* Finish a reference to a non-static data member (DECL) that is not
1422 preceded by `.' or `->'. */
1425 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1427 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1429 if (!object && cp_unevaluated_operand != 0)
1431 /* DR 613: Can use non-static data members without an associated
1432 object in sizeof/decltype/alignof. */
1433 tree scope = qualifying_scope;
1434 if (scope == NULL_TREE)
1435 scope = context_for_name_lookup (decl);
1436 object = maybe_dummy_object (scope, NULL);
1441 if (current_function_decl
1442 && DECL_STATIC_FUNCTION_P (current_function_decl))
1443 error ("invalid use of member %q+D in static member function", decl);
1445 error ("invalid use of non-static data member %q+D", decl);
1446 error ("from this location");
1448 return error_mark_node;
1451 /* If decl is a non-capture field and object has a lambda type,
1452 then we have a reference to a member of 'this' from a
1453 lambda inside a non-static member function, and we must get to decl
1454 through the 'this' capture. If decl is not a member of that object,
1455 either, then its access will still fail later. */
1456 if (LAMBDA_TYPE_P (TREE_TYPE (object))
1457 && !LAMBDA_TYPE_P (DECL_CONTEXT (decl)))
1458 object = cp_build_indirect_ref (lambda_expr_this_capture
1459 (CLASSTYPE_LAMBDA_EXPR
1460 (TREE_TYPE (object))),
1462 /*complain=*/tf_warning_or_error);
1464 if (current_class_ptr)
1465 TREE_USED (current_class_ptr) = 1;
1466 if (processing_template_decl && !qualifying_scope)
1468 tree type = TREE_TYPE (decl);
1470 if (TREE_CODE (type) == REFERENCE_TYPE)
1471 type = TREE_TYPE (type);
1474 /* Set the cv qualifiers. */
1475 int quals = (current_class_ref
1476 ? cp_type_quals (TREE_TYPE (current_class_ref))
1477 : TYPE_UNQUALIFIED);
1479 if (DECL_MUTABLE_P (decl))
1480 quals &= ~TYPE_QUAL_CONST;
1482 quals |= cp_type_quals (TREE_TYPE (decl));
1483 type = cp_build_qualified_type (type, quals);
1486 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1488 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1489 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1491 else if (processing_template_decl)
1492 return build_qualified_name (TREE_TYPE (decl),
1495 /*template_p=*/false);
1498 tree access_type = TREE_TYPE (object);
1499 tree lookup_context = context_for_name_lookup (decl);
1501 while (!DERIVED_FROM_P (lookup_context, access_type))
1503 access_type = TYPE_CONTEXT (access_type);
1504 while (access_type && DECL_P (access_type))
1505 access_type = DECL_CONTEXT (access_type);
1509 error ("object missing in reference to %q+D", decl);
1510 error ("from this location");
1511 return error_mark_node;
1515 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1518 /* If the data member was named `C::M', convert `*this' to `C'
1520 if (qualifying_scope)
1522 tree binfo = NULL_TREE;
1523 object = build_scoped_ref (object, qualifying_scope,
1527 return build_class_member_access_expr (object, decl,
1528 /*access_path=*/NULL_TREE,
1529 /*preserve_reference=*/false,
1530 tf_warning_or_error);
1534 /* If we are currently parsing a template and we encountered a typedef
1535 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1536 adds the typedef to a list tied to the current template.
1537 At tempate instantiatin time, that list is walked and access check
1538 performed for each typedef.
1539 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1542 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1544 location_t location)
1546 tree template_info = NULL;
1547 tree cs = current_scope ();
1549 if (!is_typedef_decl (typedef_decl)
1551 || !CLASS_TYPE_P (context)
1555 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1556 template_info = get_template_info (cs);
1559 && TI_TEMPLATE (template_info)
1560 && !currently_open_class (context))
1561 append_type_to_template_for_access_check (cs, typedef_decl,
1565 /* DECL was the declaration to which a qualified-id resolved. Issue
1566 an error message if it is not accessible. If OBJECT_TYPE is
1567 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1568 type of `*x', or `x', respectively. If the DECL was named as
1569 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1572 check_accessibility_of_qualified_id (tree decl,
1574 tree nested_name_specifier)
1577 tree qualifying_type = NULL_TREE;
1579 /* If we are parsing a template declaration and if decl is a typedef,
1580 add it to a list tied to the template.
1581 At template instantiation time, that list will be walked and
1582 access check performed. */
1583 add_typedef_to_current_template_for_access_check (decl,
1584 nested_name_specifier
1585 ? nested_name_specifier
1586 : DECL_CONTEXT (decl),
1589 /* If we're not checking, return immediately. */
1590 if (deferred_access_no_check)
1593 /* Determine the SCOPE of DECL. */
1594 scope = context_for_name_lookup (decl);
1595 /* If the SCOPE is not a type, then DECL is not a member. */
1596 if (!TYPE_P (scope))
1598 /* Compute the scope through which DECL is being accessed. */
1600 /* OBJECT_TYPE might not be a class type; consider:
1602 class A { typedef int I; };
1606 In this case, we will have "A::I" as the DECL, but "I" as the
1608 && CLASS_TYPE_P (object_type)
1609 && DERIVED_FROM_P (scope, object_type))
1610 /* If we are processing a `->' or `.' expression, use the type of the
1612 qualifying_type = object_type;
1613 else if (nested_name_specifier)
1615 /* If the reference is to a non-static member of the
1616 current class, treat it as if it were referenced through
1618 if (DECL_NONSTATIC_MEMBER_P (decl)
1619 && current_class_ptr
1620 && DERIVED_FROM_P (scope, current_class_type))
1621 qualifying_type = current_class_type;
1622 /* Otherwise, use the type indicated by the
1623 nested-name-specifier. */
1625 qualifying_type = nested_name_specifier;
1628 /* Otherwise, the name must be from the current class or one of
1630 qualifying_type = currently_open_derived_class (scope);
1633 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1634 or similar in a default argument value. */
1635 && CLASS_TYPE_P (qualifying_type)
1636 && !dependent_type_p (qualifying_type))
1637 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1641 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1642 class named to the left of the "::" operator. DONE is true if this
1643 expression is a complete postfix-expression; it is false if this
1644 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1645 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1646 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1647 is true iff this qualified name appears as a template argument. */
1650 finish_qualified_id_expr (tree qualifying_class,
1655 bool template_arg_p)
1657 gcc_assert (TYPE_P (qualifying_class));
1659 if (error_operand_p (expr))
1660 return error_mark_node;
1662 if (DECL_P (expr) || BASELINK_P (expr))
1666 check_template_keyword (expr);
1668 /* If EXPR occurs as the operand of '&', use special handling that
1669 permits a pointer-to-member. */
1670 if (address_p && done)
1672 if (TREE_CODE (expr) == SCOPE_REF)
1673 expr = TREE_OPERAND (expr, 1);
1674 expr = build_offset_ref (qualifying_class, expr,
1675 /*address_p=*/true);
1679 /* Within the scope of a class, turn references to non-static
1680 members into expression of the form "this->...". */
1682 /* But, within a template argument, we do not want make the
1683 transformation, as there is no "this" pointer. */
1685 else if (TREE_CODE (expr) == FIELD_DECL)
1687 push_deferring_access_checks (dk_no_check);
1688 expr = finish_non_static_data_member (expr, current_class_ref,
1690 pop_deferring_access_checks ();
1692 else if (BASELINK_P (expr) && !processing_template_decl)
1696 /* See if any of the functions are non-static members. */
1697 fns = BASELINK_FUNCTIONS (expr);
1698 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1699 fns = TREE_OPERAND (fns, 0);
1700 /* If so, the expression may be relative to 'this'. */
1701 if (!shared_member_p (fns)
1702 && current_class_ref
1703 && DERIVED_FROM_P (qualifying_class, TREE_TYPE (current_class_ref)))
1704 expr = (build_class_member_access_expr
1705 (maybe_dummy_object (qualifying_class, NULL),
1707 BASELINK_ACCESS_BINFO (expr),
1708 /*preserve_reference=*/false,
1709 tf_warning_or_error));
1711 /* The expression is a qualified name whose address is not
1713 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1719 /* Begin a statement-expression. The value returned must be passed to
1720 finish_stmt_expr. */
1723 begin_stmt_expr (void)
1725 return push_stmt_list ();
1728 /* Process the final expression of a statement expression. EXPR can be
1729 NULL, if the final expression is empty. Return a STATEMENT_LIST
1730 containing all the statements in the statement-expression, or
1731 ERROR_MARK_NODE if there was an error. */
1734 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1736 if (error_operand_p (expr))
1738 /* The type of the statement-expression is the type of the last
1740 TREE_TYPE (stmt_expr) = error_mark_node;
1741 return error_mark_node;
1744 /* If the last statement does not have "void" type, then the value
1745 of the last statement is the value of the entire expression. */
1748 tree type = TREE_TYPE (expr);
1750 if (processing_template_decl)
1752 expr = build_stmt (input_location, EXPR_STMT, expr);
1753 expr = add_stmt (expr);
1754 /* Mark the last statement so that we can recognize it as such at
1755 template-instantiation time. */
1756 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1758 else if (VOID_TYPE_P (type))
1760 /* Just treat this like an ordinary statement. */
1761 expr = finish_expr_stmt (expr);
1765 /* It actually has a value we need to deal with. First, force it
1766 to be an rvalue so that we won't need to build up a copy
1767 constructor call later when we try to assign it to something. */
1768 expr = force_rvalue (expr);
1769 if (error_operand_p (expr))
1770 return error_mark_node;
1772 /* Update for array-to-pointer decay. */
1773 type = TREE_TYPE (expr);
1775 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1776 normal statement, but don't convert to void or actually add
1778 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1779 expr = maybe_cleanup_point_expr (expr);
1783 /* The type of the statement-expression is the type of the last
1785 TREE_TYPE (stmt_expr) = type;
1791 /* Finish a statement-expression. EXPR should be the value returned
1792 by the previous begin_stmt_expr. Returns an expression
1793 representing the statement-expression. */
1796 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1801 if (error_operand_p (stmt_expr))
1803 pop_stmt_list (stmt_expr);
1804 return error_mark_node;
1807 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1809 type = TREE_TYPE (stmt_expr);
1810 result = pop_stmt_list (stmt_expr);
1811 TREE_TYPE (result) = type;
1813 if (processing_template_decl)
1815 result = build_min (STMT_EXPR, type, result);
1816 TREE_SIDE_EFFECTS (result) = 1;
1817 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1819 else if (CLASS_TYPE_P (type))
1821 /* Wrap the statement-expression in a TARGET_EXPR so that the
1822 temporary object created by the final expression is destroyed at
1823 the end of the full-expression containing the
1824 statement-expression. */
1825 result = force_target_expr (type, result);
1831 /* Returns the expression which provides the value of STMT_EXPR. */
1834 stmt_expr_value_expr (tree stmt_expr)
1836 tree t = STMT_EXPR_STMT (stmt_expr);
1838 if (TREE_CODE (t) == BIND_EXPR)
1839 t = BIND_EXPR_BODY (t);
1841 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1842 t = STATEMENT_LIST_TAIL (t)->stmt;
1844 if (TREE_CODE (t) == EXPR_STMT)
1845 t = EXPR_STMT_EXPR (t);
1850 /* Return TRUE iff EXPR_STMT is an empty list of
1851 expression statements. */
1854 empty_expr_stmt_p (tree expr_stmt)
1856 tree body = NULL_TREE;
1858 if (expr_stmt == void_zero_node)
1863 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1864 body = EXPR_STMT_EXPR (expr_stmt);
1865 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1871 if (TREE_CODE (body) == STATEMENT_LIST)
1872 return tsi_end_p (tsi_start (body));
1874 return empty_expr_stmt_p (body);
1879 /* Perform Koenig lookup. FN is the postfix-expression representing
1880 the function (or functions) to call; ARGS are the arguments to the
1881 call. Returns the functions to be considered by overload
1885 perform_koenig_lookup (tree fn, VEC(tree,gc) *args)
1887 tree identifier = NULL_TREE;
1888 tree functions = NULL_TREE;
1889 tree tmpl_args = NULL_TREE;
1890 bool template_id = false;
1892 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1894 /* Use a separate flag to handle null args. */
1896 tmpl_args = TREE_OPERAND (fn, 1);
1897 fn = TREE_OPERAND (fn, 0);
1900 /* Find the name of the overloaded function. */
1901 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1903 else if (is_overloaded_fn (fn))
1906 identifier = DECL_NAME (get_first_fn (functions));
1908 else if (DECL_P (fn))
1911 identifier = DECL_NAME (fn);
1914 /* A call to a namespace-scope function using an unqualified name.
1916 Do Koenig lookup -- unless any of the arguments are
1918 if (!any_type_dependent_arguments_p (args)
1919 && !any_dependent_template_arguments_p (tmpl_args))
1921 fn = lookup_arg_dependent (identifier, functions, args);
1923 /* The unqualified name could not be resolved. */
1924 fn = unqualified_fn_lookup_error (identifier);
1927 if (fn && template_id)
1928 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1933 /* Generate an expression for `FN (ARGS)'. This may change the
1936 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1937 as a virtual call, even if FN is virtual. (This flag is set when
1938 encountering an expression where the function name is explicitly
1939 qualified. For example a call to `X::f' never generates a virtual
1942 Returns code for the call. */
1945 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1946 bool koenig_p, tsubst_flags_t complain)
1950 VEC(tree,gc) *orig_args = NULL;
1952 if (fn == error_mark_node)
1953 return error_mark_node;
1955 gcc_assert (!TYPE_P (fn));
1959 if (processing_template_decl)
1961 if (type_dependent_expression_p (fn)
1962 || any_type_dependent_arguments_p (*args))
1964 result = build_nt_call_vec (fn, *args);
1965 KOENIG_LOOKUP_P (result) = koenig_p;
1970 tree fndecl = OVL_CURRENT (fn);
1971 if (TREE_CODE (fndecl) != FUNCTION_DECL
1972 || !TREE_THIS_VOLATILE (fndecl))
1978 current_function_returns_abnormally = 1;
1982 orig_args = make_tree_vector_copy (*args);
1983 if (!BASELINK_P (fn)
1984 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1985 && TREE_TYPE (fn) != unknown_type_node)
1986 fn = build_non_dependent_expr (fn);
1987 make_args_non_dependent (*args);
1990 if (is_overloaded_fn (fn))
1991 fn = baselink_for_fns (fn);
1994 if (BASELINK_P (fn))
1998 /* A call to a member function. From [over.call.func]:
2000 If the keyword this is in scope and refers to the class of
2001 that member function, or a derived class thereof, then the
2002 function call is transformed into a qualified function call
2003 using (*this) as the postfix-expression to the left of the
2004 . operator.... [Otherwise] a contrived object of type T
2005 becomes the implied object argument.
2007 This paragraph is unclear about this situation:
2009 struct A { void f(); };
2010 struct B : public A {};
2011 struct C : public A { void g() { B::f(); }};
2013 In particular, for `B::f', this paragraph does not make clear
2014 whether "the class of that member function" refers to `A' or
2015 to `B'. We believe it refers to `B'. */
2016 if (current_class_type
2017 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2019 && current_class_ref)
2020 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2024 tree representative_fn;
2026 representative_fn = BASELINK_FUNCTIONS (fn);
2027 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
2028 representative_fn = TREE_OPERAND (representative_fn, 0);
2029 representative_fn = get_first_fn (representative_fn);
2030 object = build_dummy_object (DECL_CONTEXT (representative_fn));
2033 if (processing_template_decl)
2035 if (type_dependent_expression_p (object))
2037 tree ret = build_nt_call_vec (orig_fn, orig_args);
2038 release_tree_vector (orig_args);
2041 object = build_non_dependent_expr (object);
2044 result = build_new_method_call (object, fn, args, NULL_TREE,
2046 ? LOOKUP_NONVIRTUAL : 0),
2050 else if (is_overloaded_fn (fn))
2052 /* If the function is an overloaded builtin, resolve it. */
2053 if (TREE_CODE (fn) == FUNCTION_DECL
2054 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2055 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2056 result = resolve_overloaded_builtin (input_location, fn, *args);
2059 /* A call to a namespace-scope function. */
2060 result = build_new_function_call (fn, args, koenig_p, complain);
2062 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2064 if (!VEC_empty (tree, *args))
2065 error ("arguments to destructor are not allowed");
2066 /* Mark the pseudo-destructor call as having side-effects so
2067 that we do not issue warnings about its use. */
2068 result = build1 (NOP_EXPR,
2070 TREE_OPERAND (fn, 0));
2071 TREE_SIDE_EFFECTS (result) = 1;
2073 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2074 /* If the "function" is really an object of class type, it might
2075 have an overloaded `operator ()'. */
2076 result = build_op_call (fn, args, complain);
2079 /* A call where the function is unknown. */
2080 result = cp_build_function_call_vec (fn, args, complain);
2082 if (processing_template_decl)
2084 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2085 KOENIG_LOOKUP_P (result) = koenig_p;
2086 release_tree_vector (orig_args);
2092 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2093 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2094 POSTDECREMENT_EXPR.) */
2097 finish_increment_expr (tree expr, enum tree_code code)
2099 return build_x_unary_op (code, expr, tf_warning_or_error);
2102 /* Finish a use of `this'. Returns an expression for `this'. */
2105 finish_this_expr (void)
2109 /* In a lambda expression, 'this' refers to the captured 'this'. */
2110 if (current_function_decl
2111 && LAMBDA_FUNCTION_P (current_function_decl))
2112 result = (lambda_expr_this_capture
2113 (CLASSTYPE_LAMBDA_EXPR (current_class_type)));
2114 else if (current_class_ptr)
2115 result = current_class_ptr;
2116 else if (current_function_decl
2117 && DECL_STATIC_FUNCTION_P (current_function_decl))
2119 error ("%<this%> is unavailable for static member functions");
2120 result = error_mark_node;
2124 if (current_function_decl)
2125 error ("invalid use of %<this%> in non-member function");
2127 error ("invalid use of %<this%> at top level");
2128 result = error_mark_node;
2134 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2135 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2136 the TYPE for the type given. If SCOPE is non-NULL, the expression
2137 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2140 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2142 if (object == error_mark_node || destructor == error_mark_node)
2143 return error_mark_node;
2145 gcc_assert (TYPE_P (destructor));
2147 if (!processing_template_decl)
2149 if (scope == error_mark_node)
2151 error ("invalid qualifying scope in pseudo-destructor name");
2152 return error_mark_node;
2154 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2156 error ("qualified type %qT does not match destructor name ~%qT",
2158 return error_mark_node;
2162 /* [expr.pseudo] says both:
2164 The type designated by the pseudo-destructor-name shall be
2165 the same as the object type.
2169 The cv-unqualified versions of the object type and of the
2170 type designated by the pseudo-destructor-name shall be the
2173 We implement the more generous second sentence, since that is
2174 what most other compilers do. */
2175 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2178 error ("%qE is not of type %qT", object, destructor);
2179 return error_mark_node;
2183 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2186 /* Finish an expression of the form CODE EXPR. */
2189 finish_unary_op_expr (enum tree_code code, tree expr)
2191 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2192 /* Inside a template, build_x_unary_op does not fold the
2193 expression. So check whether the result is folded before
2194 setting TREE_NEGATED_INT. */
2195 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2196 && TREE_CODE (result) == INTEGER_CST
2197 && !TYPE_UNSIGNED (TREE_TYPE (result))
2198 && INT_CST_LT (result, integer_zero_node))
2200 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2201 setting TREE_NEGATED_INT. */
2202 result = copy_node (result);
2203 TREE_NEGATED_INT (result) = 1;
2205 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2206 overflow_warning (input_location, result);
2211 /* Finish a compound-literal expression. TYPE is the type to which
2212 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2215 finish_compound_literal (tree type, tree compound_literal)
2217 if (type == error_mark_node)
2218 return error_mark_node;
2220 if (!TYPE_OBJ_P (type))
2222 error ("compound literal of non-object type %qT", type);
2223 return error_mark_node;
2226 if (processing_template_decl)
2228 TREE_TYPE (compound_literal) = type;
2229 /* Mark the expression as a compound literal. */
2230 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2231 return compound_literal;
2234 type = complete_type (type);
2236 if (TYPE_NON_AGGREGATE_CLASS (type))
2238 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2239 everywhere that deals with function arguments would be a pain, so
2240 just wrap it in a TREE_LIST. The parser set a flag so we know
2241 that it came from T{} rather than T({}). */
2242 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2243 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2244 return build_functional_cast (type, compound_literal, tf_error);
2247 if (TREE_CODE (type) == ARRAY_TYPE
2248 && check_array_initializer (NULL_TREE, type, compound_literal))
2249 return error_mark_node;
2250 compound_literal = reshape_init (type, compound_literal);
2251 if (TREE_CODE (type) == ARRAY_TYPE)
2252 cp_complete_array_type (&type, compound_literal, false);
2253 compound_literal = digest_init (type, compound_literal);
2254 if ((!at_function_scope_p () || cp_type_readonly (type))
2255 && initializer_constant_valid_p (compound_literal, type))
2257 tree decl = create_temporary_var (type);
2258 DECL_INITIAL (decl) = compound_literal;
2259 TREE_STATIC (decl) = 1;
2260 decl = pushdecl_top_level (decl);
2261 DECL_NAME (decl) = make_anon_name ();
2262 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2266 return get_target_expr (compound_literal);
2269 /* Return the declaration for the function-name variable indicated by
2273 finish_fname (tree id)
2277 decl = fname_decl (input_location, C_RID_CODE (id), id);
2278 if (processing_template_decl)
2279 decl = DECL_NAME (decl);
2283 /* Finish a translation unit. */
2286 finish_translation_unit (void)
2288 /* In case there were missing closebraces,
2289 get us back to the global binding level. */
2291 while (current_namespace != global_namespace)
2294 /* Do file scope __FUNCTION__ et al. */
2295 finish_fname_decls ();
2298 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2299 Returns the parameter. */
2302 finish_template_type_parm (tree aggr, tree identifier)
2304 if (aggr != class_type_node)
2306 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2307 aggr = class_type_node;
2310 return build_tree_list (aggr, identifier);
2313 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2314 Returns the parameter. */
2317 finish_template_template_parm (tree aggr, tree identifier)
2319 tree decl = build_decl (input_location,
2320 TYPE_DECL, identifier, NULL_TREE);
2321 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2322 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2323 DECL_TEMPLATE_RESULT (tmpl) = decl;
2324 DECL_ARTIFICIAL (decl) = 1;
2325 end_template_decl ();
2327 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2329 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2330 /*is_primary=*/true, /*is_partial=*/false,
2333 return finish_template_type_parm (aggr, tmpl);
2336 /* ARGUMENT is the default-argument value for a template template
2337 parameter. If ARGUMENT is invalid, issue error messages and return
2338 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2341 check_template_template_default_arg (tree argument)
2343 if (TREE_CODE (argument) != TEMPLATE_DECL
2344 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2345 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2347 if (TREE_CODE (argument) == TYPE_DECL)
2348 error ("invalid use of type %qT as a default value for a template "
2349 "template-parameter", TREE_TYPE (argument));
2351 error ("invalid default argument for a template template parameter");
2352 return error_mark_node;
2358 /* Begin a class definition, as indicated by T. */
2361 begin_class_definition (tree t, tree attributes)
2363 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2364 return error_mark_node;
2366 if (processing_template_parmlist)
2368 error ("definition of %q#T inside template parameter list", t);
2369 return error_mark_node;
2371 /* A non-implicit typename comes from code like:
2373 template <typename T> struct A {
2374 template <typename U> struct A<T>::B ...
2376 This is erroneous. */
2377 else if (TREE_CODE (t) == TYPENAME_TYPE)
2379 error ("invalid definition of qualified type %qT", t);
2380 t = error_mark_node;
2383 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2385 t = make_class_type (RECORD_TYPE);
2386 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2389 /* Update the location of the decl. */
2390 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2392 if (TYPE_BEING_DEFINED (t))
2394 t = make_class_type (TREE_CODE (t));
2395 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2397 maybe_process_partial_specialization (t);
2399 TYPE_BEING_DEFINED (t) = 1;
2401 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2403 if (flag_pack_struct)
2406 TYPE_PACKED (t) = 1;
2407 /* Even though the type is being defined for the first time
2408 here, there might have been a forward declaration, so there
2409 might be cv-qualified variants of T. */
2410 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2411 TYPE_PACKED (v) = 1;
2413 /* Reset the interface data, at the earliest possible
2414 moment, as it might have been set via a class foo;
2416 if (! TYPE_ANONYMOUS_P (t))
2418 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2419 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2420 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2421 (t, finfo->interface_unknown);
2423 reset_specialization();
2425 /* Make a declaration for this class in its own scope. */
2426 build_self_reference ();
2431 /* Finish the member declaration given by DECL. */
2434 finish_member_declaration (tree decl)
2436 if (decl == error_mark_node || decl == NULL_TREE)
2439 if (decl == void_type_node)
2440 /* The COMPONENT was a friend, not a member, and so there's
2441 nothing for us to do. */
2444 /* We should see only one DECL at a time. */
2445 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2447 /* Set up access control for DECL. */
2449 = (current_access_specifier == access_private_node);
2450 TREE_PROTECTED (decl)
2451 = (current_access_specifier == access_protected_node);
2452 if (TREE_CODE (decl) == TEMPLATE_DECL)
2454 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2455 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2458 /* Mark the DECL as a member of the current class. */
2459 DECL_CONTEXT (decl) = current_class_type;
2461 /* Check for bare parameter packs in the member variable declaration. */
2462 if (TREE_CODE (decl) == FIELD_DECL)
2464 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2465 TREE_TYPE (decl) = error_mark_node;
2466 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2467 DECL_ATTRIBUTES (decl) = NULL_TREE;
2472 A C language linkage is ignored for the names of class members
2473 and the member function type of class member functions. */
2474 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2475 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2477 /* Put functions on the TYPE_METHODS list and everything else on the
2478 TYPE_FIELDS list. Note that these are built up in reverse order.
2479 We reverse them (to obtain declaration order) in finish_struct. */
2480 if (TREE_CODE (decl) == FUNCTION_DECL
2481 || DECL_FUNCTION_TEMPLATE_P (decl))
2483 /* We also need to add this function to the
2484 CLASSTYPE_METHOD_VEC. */
2485 if (add_method (current_class_type, decl, NULL_TREE))
2487 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2488 TYPE_METHODS (current_class_type) = decl;
2490 maybe_add_class_template_decl_list (current_class_type, decl,
2494 /* Enter the DECL into the scope of the class. */
2495 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2496 || pushdecl_class_level (decl))
2498 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2499 go at the beginning. The reason is that lookup_field_1
2500 searches the list in order, and we want a field name to
2501 override a type name so that the "struct stat hack" will
2502 work. In particular:
2504 struct S { enum E { }; int E } s;
2507 is valid. In addition, the FIELD_DECLs must be maintained in
2508 declaration order so that class layout works as expected.
2509 However, we don't need that order until class layout, so we
2510 save a little time by putting FIELD_DECLs on in reverse order
2511 here, and then reversing them in finish_struct_1. (We could
2512 also keep a pointer to the correct insertion points in the
2515 if (TREE_CODE (decl) == TYPE_DECL)
2516 TYPE_FIELDS (current_class_type)
2517 = chainon (TYPE_FIELDS (current_class_type), decl);
2520 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2521 TYPE_FIELDS (current_class_type) = decl;
2524 maybe_add_class_template_decl_list (current_class_type, decl,
2529 note_decl_for_pch (decl);
2532 /* DECL has been declared while we are building a PCH file. Perform
2533 actions that we might normally undertake lazily, but which can be
2534 performed now so that they do not have to be performed in
2535 translation units which include the PCH file. */
2538 note_decl_for_pch (tree decl)
2540 gcc_assert (pch_file);
2542 /* There's a good chance that we'll have to mangle names at some
2543 point, even if only for emission in debugging information. */
2544 if ((TREE_CODE (decl) == VAR_DECL
2545 || TREE_CODE (decl) == FUNCTION_DECL)
2546 && !processing_template_decl)
2550 /* Finish processing a complete template declaration. The PARMS are
2551 the template parameters. */
2554 finish_template_decl (tree parms)
2557 end_template_decl ();
2559 end_specialization ();
2562 /* Finish processing a template-id (which names a type) of the form
2563 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2564 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2565 the scope of template-id indicated. */
2568 finish_template_type (tree name, tree args, int entering_scope)
2572 decl = lookup_template_class (name, args,
2573 NULL_TREE, NULL_TREE, entering_scope,
2574 tf_warning_or_error | tf_user);
2575 if (decl != error_mark_node)
2576 decl = TYPE_STUB_DECL (decl);
2581 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2582 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2583 BASE_CLASS, or NULL_TREE if an error occurred. The
2584 ACCESS_SPECIFIER is one of
2585 access_{default,public,protected_private}_node. For a virtual base
2586 we set TREE_TYPE. */
2589 finish_base_specifier (tree base, tree access, bool virtual_p)
2593 if (base == error_mark_node)
2595 error ("invalid base-class specification");
2598 else if (! MAYBE_CLASS_TYPE_P (base))
2600 error ("%qT is not a class type", base);
2605 if (cp_type_quals (base) != 0)
2607 error ("base class %qT has cv qualifiers", base);
2608 base = TYPE_MAIN_VARIANT (base);
2610 result = build_tree_list (access, base);
2612 TREE_TYPE (result) = integer_type_node;
2618 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2619 what we found when we tried to do the lookup.
2620 LOCATION is the location of the NAME identifier;
2621 The location is used in the error message*/
2624 qualified_name_lookup_error (tree scope, tree name,
2625 tree decl, location_t location)
2627 if (scope == error_mark_node)
2628 ; /* We already complained. */
2629 else if (TYPE_P (scope))
2631 if (!COMPLETE_TYPE_P (scope))
2632 error_at (location, "incomplete type %qT used in nested name specifier",
2634 else if (TREE_CODE (decl) == TREE_LIST)
2636 error_at (location, "reference to %<%T::%D%> is ambiguous",
2638 print_candidates (decl);
2641 error_at (location, "%qD is not a member of %qT", name, scope);
2643 else if (scope != global_namespace)
2644 error_at (location, "%qD is not a member of %qD", name, scope);
2646 error_at (location, "%<::%D%> has not been declared", name);
2649 /* If FNS is a member function, a set of member functions, or a
2650 template-id referring to one or more member functions, return a
2651 BASELINK for FNS, incorporating the current access context.
2652 Otherwise, return FNS unchanged. */
2655 baselink_for_fns (tree fns)
2660 if (BASELINK_P (fns)
2661 || error_operand_p (fns))
2665 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2666 fn = TREE_OPERAND (fn, 0);
2667 fn = get_first_fn (fn);
2668 if (!DECL_FUNCTION_MEMBER_P (fn))
2671 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2673 cl = DECL_CONTEXT (fn);
2674 cl = TYPE_BINFO (cl);
2675 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2678 /* Returns true iff DECL is an automatic variable from a function outside
2682 outer_automatic_var_p (tree decl)
2684 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2685 && DECL_FUNCTION_SCOPE_P (decl)
2686 && !TREE_STATIC (decl)
2687 && DECL_CONTEXT (decl) != current_function_decl);
2690 /* Returns true iff DECL is a capture field from a lambda that is not our
2691 immediate context. */
2694 outer_lambda_capture_p (tree decl)
2696 return (TREE_CODE (decl) == FIELD_DECL
2697 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2698 && (!current_class_type
2699 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2702 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2703 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2704 if non-NULL, is the type or namespace used to explicitly qualify
2705 ID_EXPRESSION. DECL is the entity to which that name has been
2708 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2709 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2710 be set to true if this expression isn't permitted in a
2711 constant-expression, but it is otherwise not set by this function.
2712 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2713 constant-expression, but a non-constant expression is also
2716 DONE is true if this expression is a complete postfix-expression;
2717 it is false if this expression is followed by '->', '[', '(', etc.
2718 ADDRESS_P is true iff this expression is the operand of '&'.
2719 TEMPLATE_P is true iff the qualified-id was of the form
2720 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2721 appears as a template argument.
2723 If an error occurs, and it is the kind of error that might cause
2724 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2725 is the caller's responsibility to issue the message. *ERROR_MSG
2726 will be a string with static storage duration, so the caller need
2729 Return an expression for the entity, after issuing appropriate
2730 diagnostics. This function is also responsible for transforming a
2731 reference to a non-static member into a COMPONENT_REF that makes
2732 the use of "this" explicit.
2734 Upon return, *IDK will be filled in appropriately. */
2736 finish_id_expression (tree id_expression,
2740 bool integral_constant_expression_p,
2741 bool allow_non_integral_constant_expression_p,
2742 bool *non_integral_constant_expression_p,
2746 bool template_arg_p,
2747 const char **error_msg,
2748 location_t location)
2750 /* Initialize the output parameters. */
2751 *idk = CP_ID_KIND_NONE;
2754 if (id_expression == error_mark_node)
2755 return error_mark_node;
2756 /* If we have a template-id, then no further lookup is
2757 required. If the template-id was for a template-class, we
2758 will sometimes have a TYPE_DECL at this point. */
2759 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2760 || TREE_CODE (decl) == TYPE_DECL)
2762 /* Look up the name. */
2765 if (decl == error_mark_node)
2767 /* Name lookup failed. */
2770 || (!dependent_type_p (scope)
2771 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2772 && IDENTIFIER_TYPENAME_P (id_expression)
2773 && dependent_type_p (TREE_TYPE (id_expression))))))
2775 /* If the qualifying type is non-dependent (and the name
2776 does not name a conversion operator to a dependent
2777 type), issue an error. */
2778 qualified_name_lookup_error (scope, id_expression, decl, location);
2779 return error_mark_node;
2783 /* It may be resolved via Koenig lookup. */
2784 *idk = CP_ID_KIND_UNQUALIFIED;
2785 return id_expression;
2788 decl = id_expression;
2790 /* If DECL is a variable that would be out of scope under
2791 ANSI/ISO rules, but in scope in the ARM, name lookup
2792 will succeed. Issue a diagnostic here. */
2794 decl = check_for_out_of_scope_variable (decl);
2796 /* Remember that the name was used in the definition of
2797 the current class so that we can check later to see if
2798 the meaning would have been different after the class
2799 was entirely defined. */
2800 if (!scope && decl != error_mark_node)
2801 maybe_note_name_used_in_class (id_expression, decl);
2803 /* Disallow uses of local variables from containing functions, except
2804 within lambda-expressions. */
2805 if ((outer_automatic_var_p (decl)
2806 || outer_lambda_capture_p (decl))
2807 /* It's not a use (3.2) if we're in an unevaluated context. */
2808 && !cp_unevaluated_operand)
2810 tree context = DECL_CONTEXT (decl);
2811 tree containing_function = current_function_decl;
2812 tree lambda_stack = NULL_TREE;
2813 tree lambda_expr = NULL_TREE;
2814 tree initializer = decl;
2816 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2817 support for an approach in which a reference to a local
2818 [constant] automatic variable in a nested class or lambda body
2819 would enter the expression as an rvalue, which would reduce
2820 the complexity of the problem"
2822 FIXME update for final resolution of core issue 696. */
2823 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2824 return integral_constant_value (decl);
2826 if (TYPE_P (context))
2828 /* Implicit capture of an explicit capture. */
2829 context = lambda_function (context);
2830 initializer = thisify_lambda_field (decl);
2833 /* If we are in a lambda function, we can move out until we hit
2835 2. a non-lambda function, or
2836 3. a non-default capturing lambda function. */
2837 while (context != containing_function
2838 && LAMBDA_FUNCTION_P (containing_function))
2840 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2841 (DECL_CONTEXT (containing_function));
2843 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2847 lambda_stack = tree_cons (NULL_TREE,
2852 = decl_function_context (containing_function);
2855 if (context == containing_function)
2857 decl = add_default_capture (lambda_stack,
2858 /*id=*/DECL_NAME (decl),
2861 else if (lambda_expr)
2863 error ("%qD is not captured", decl);
2864 return error_mark_node;
2868 error (TREE_CODE (decl) == VAR_DECL
2869 ? "use of %<auto%> variable from containing function"
2870 : "use of parameter from containing function");
2871 error (" %q+#D declared here", decl);
2872 return error_mark_node;
2877 /* If we didn't find anything, or what we found was a type,
2878 then this wasn't really an id-expression. */
2879 if (TREE_CODE (decl) == TEMPLATE_DECL
2880 && !DECL_FUNCTION_TEMPLATE_P (decl))
2882 *error_msg = "missing template arguments";
2883 return error_mark_node;
2885 else if (TREE_CODE (decl) == TYPE_DECL
2886 || TREE_CODE (decl) == NAMESPACE_DECL)
2888 *error_msg = "expected primary-expression";
2889 return error_mark_node;
2892 /* If the name resolved to a template parameter, there is no
2893 need to look it up again later. */
2894 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2895 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2899 *idk = CP_ID_KIND_NONE;
2900 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2901 decl = TEMPLATE_PARM_DECL (decl);
2902 r = convert_from_reference (DECL_INITIAL (decl));
2904 if (integral_constant_expression_p
2905 && !dependent_type_p (TREE_TYPE (decl))
2906 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2908 if (!allow_non_integral_constant_expression_p)
2909 error ("template parameter %qD of type %qT is not allowed in "
2910 "an integral constant expression because it is not of "
2911 "integral or enumeration type", decl, TREE_TYPE (decl));
2912 *non_integral_constant_expression_p = true;
2916 /* Similarly, we resolve enumeration constants to their
2917 underlying values. */
2918 else if (TREE_CODE (decl) == CONST_DECL)
2920 *idk = CP_ID_KIND_NONE;
2921 if (!processing_template_decl)
2923 used_types_insert (TREE_TYPE (decl));
2924 return DECL_INITIAL (decl);
2932 /* If the declaration was explicitly qualified indicate
2933 that. The semantics of `A::f(3)' are different than
2934 `f(3)' if `f' is virtual. */
2936 ? CP_ID_KIND_QUALIFIED
2937 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2938 ? CP_ID_KIND_TEMPLATE_ID
2939 : CP_ID_KIND_UNQUALIFIED));
2944 An id-expression is type-dependent if it contains an
2945 identifier that was declared with a dependent type.
2947 The standard is not very specific about an id-expression that
2948 names a set of overloaded functions. What if some of them
2949 have dependent types and some of them do not? Presumably,
2950 such a name should be treated as a dependent name. */
2951 /* Assume the name is not dependent. */
2952 dependent_p = false;
2953 if (!processing_template_decl)
2954 /* No names are dependent outside a template. */
2956 /* A template-id where the name of the template was not resolved
2957 is definitely dependent. */
2958 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2959 && (TREE_CODE (TREE_OPERAND (decl, 0))
2960 == IDENTIFIER_NODE))
2962 /* For anything except an overloaded function, just check its
2964 else if (!is_overloaded_fn (decl))
2966 = dependent_type_p (TREE_TYPE (decl));
2967 /* For a set of overloaded functions, check each of the
2973 if (BASELINK_P (fns))
2974 fns = BASELINK_FUNCTIONS (fns);
2976 /* For a template-id, check to see if the template
2977 arguments are dependent. */
2978 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2980 tree args = TREE_OPERAND (fns, 1);
2981 dependent_p = any_dependent_template_arguments_p (args);
2982 /* The functions are those referred to by the
2984 fns = TREE_OPERAND (fns, 0);
2987 /* If there are no dependent template arguments, go through
2988 the overloaded functions. */
2989 while (fns && !dependent_p)
2991 tree fn = OVL_CURRENT (fns);
2993 /* Member functions of dependent classes are
2995 if (TREE_CODE (fn) == FUNCTION_DECL
2996 && type_dependent_expression_p (fn))
2998 else if (TREE_CODE (fn) == TEMPLATE_DECL
2999 && dependent_template_p (fn))
3002 fns = OVL_NEXT (fns);
3006 /* If the name was dependent on a template parameter, we will
3007 resolve the name at instantiation time. */
3010 /* Create a SCOPE_REF for qualified names, if the scope is
3016 if (address_p && done)
3017 decl = finish_qualified_id_expr (scope, decl,
3023 tree type = NULL_TREE;
3024 if (DECL_P (decl) && !dependent_scope_p (scope))
3025 type = TREE_TYPE (decl);
3026 decl = build_qualified_name (type,
3032 if (TREE_TYPE (decl))
3033 decl = convert_from_reference (decl);
3036 /* A TEMPLATE_ID already contains all the information we
3038 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3039 return id_expression;
3040 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3041 /* If we found a variable, then name lookup during the
3042 instantiation will always resolve to the same VAR_DECL
3043 (or an instantiation thereof). */
3044 if (TREE_CODE (decl) == VAR_DECL
3045 || TREE_CODE (decl) == PARM_DECL)
3046 return convert_from_reference (decl);
3047 /* The same is true for FIELD_DECL, but we also need to
3048 make sure that the syntax is correct. */
3049 else if (TREE_CODE (decl) == FIELD_DECL)
3051 /* Since SCOPE is NULL here, this is an unqualified name.
3052 Access checking has been performed during name lookup
3053 already. Turn off checking to avoid duplicate errors. */
3054 push_deferring_access_checks (dk_no_check);
3055 decl = finish_non_static_data_member
3056 (decl, current_class_ref,
3057 /*qualifying_scope=*/NULL_TREE);
3058 pop_deferring_access_checks ();
3061 return id_expression;
3064 /* Only certain kinds of names are allowed in constant
3065 expression. Enumerators and template parameters have already
3066 been handled above. */
3067 if (integral_constant_expression_p
3068 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
3069 && ! builtin_valid_in_constant_expr_p (decl))
3071 if (!allow_non_integral_constant_expression_p)
3073 error ("%qD cannot appear in a constant-expression", decl);
3074 return error_mark_node;
3076 *non_integral_constant_expression_p = true;
3079 if (TREE_CODE (decl) == NAMESPACE_DECL)
3081 error ("use of namespace %qD as expression", decl);
3082 return error_mark_node;
3084 else if (DECL_CLASS_TEMPLATE_P (decl))
3086 error ("use of class template %qT as expression", decl);
3087 return error_mark_node;
3089 else if (TREE_CODE (decl) == TREE_LIST)
3091 /* Ambiguous reference to base members. */
3092 error ("request for member %qD is ambiguous in "
3093 "multiple inheritance lattice", id_expression);
3094 print_candidates (decl);
3095 return error_mark_node;
3098 /* Mark variable-like entities as used. Functions are similarly
3099 marked either below or after overload resolution. */
3100 if (TREE_CODE (decl) == VAR_DECL
3101 || TREE_CODE (decl) == PARM_DECL
3102 || TREE_CODE (decl) == RESULT_DECL)
3107 decl = (adjust_result_of_qualified_name_lookup
3108 (decl, scope, current_class_type));
3110 if (TREE_CODE (decl) == FUNCTION_DECL)
3113 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3114 decl = finish_qualified_id_expr (scope,
3122 tree r = convert_from_reference (decl);
3124 if (processing_template_decl && TYPE_P (scope))
3125 r = build_qualified_name (TREE_TYPE (r),
3131 else if (TREE_CODE (decl) == FIELD_DECL)
3133 /* Since SCOPE is NULL here, this is an unqualified name.
3134 Access checking has been performed during name lookup
3135 already. Turn off checking to avoid duplicate errors. */
3136 push_deferring_access_checks (dk_no_check);
3137 decl = finish_non_static_data_member (decl, current_class_ref,
3138 /*qualifying_scope=*/NULL_TREE);
3139 pop_deferring_access_checks ();
3141 else if (is_overloaded_fn (decl))
3146 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
3147 first_fn = TREE_OPERAND (first_fn, 0);
3148 first_fn = get_first_fn (first_fn);
3149 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3150 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3152 if (!really_overloaded_fn (decl))
3153 mark_used (first_fn);
3156 && TREE_CODE (first_fn) == FUNCTION_DECL
3157 && DECL_FUNCTION_MEMBER_P (first_fn)
3158 && !shared_member_p (decl))
3160 /* A set of member functions. */
3161 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3162 return finish_class_member_access_expr (decl, id_expression,
3163 /*template_p=*/false,
3164 tf_warning_or_error);
3167 decl = baselink_for_fns (decl);
3171 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3172 && DECL_CLASS_SCOPE_P (decl))
3174 tree context = context_for_name_lookup (decl);
3175 if (context != current_class_type)
3177 tree path = currently_open_derived_class (context);
3178 perform_or_defer_access_check (TYPE_BINFO (path),
3183 decl = convert_from_reference (decl);
3187 if (TREE_DEPRECATED (decl))
3188 warn_deprecated_use (decl, NULL_TREE);
3193 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3194 use as a type-specifier. */
3197 finish_typeof (tree expr)
3201 if (type_dependent_expression_p (expr))
3203 type = cxx_make_type (TYPEOF_TYPE);
3204 TYPEOF_TYPE_EXPR (type) = expr;
3205 SET_TYPE_STRUCTURAL_EQUALITY (type);
3210 type = unlowered_expr_type (expr);
3212 if (!type || type == unknown_type_node)
3214 error ("type of %qE is unknown", expr);
3215 return error_mark_node;
3221 /* Perform C++-specific checks for __builtin_offsetof before calling
3225 finish_offsetof (tree expr)
3227 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3229 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3230 TREE_OPERAND (expr, 2));
3231 return error_mark_node;
3233 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3234 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3235 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3237 if (TREE_CODE (expr) == COMPONENT_REF
3238 || TREE_CODE (expr) == COMPOUND_EXPR)
3239 expr = TREE_OPERAND (expr, 1);
3240 error ("cannot apply %<offsetof%> to member function %qD", expr);
3241 return error_mark_node;
3243 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3244 expr = TREE_OPERAND (expr, 0);
3245 return fold_offsetof (expr, NULL_TREE);
3248 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3249 function is broken out from the above for the benefit of the tree-ssa
3253 simplify_aggr_init_expr (tree *tp)
3255 tree aggr_init_expr = *tp;
3257 /* Form an appropriate CALL_EXPR. */
3258 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3259 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3260 tree type = TREE_TYPE (slot);
3263 enum style_t { ctor, arg, pcc } style;
3265 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3267 #ifdef PCC_STATIC_STRUCT_RETURN
3273 gcc_assert (TREE_ADDRESSABLE (type));
3277 call_expr = build_call_array_loc (input_location,
3278 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3280 aggr_init_expr_nargs (aggr_init_expr),
3281 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3285 /* Replace the first argument to the ctor with the address of the
3287 cxx_mark_addressable (slot);
3288 CALL_EXPR_ARG (call_expr, 0) =
3289 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3291 else if (style == arg)
3293 /* Just mark it addressable here, and leave the rest to
3294 expand_call{,_inline}. */
3295 cxx_mark_addressable (slot);
3296 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3297 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3299 else if (style == pcc)
3301 /* If we're using the non-reentrant PCC calling convention, then we
3302 need to copy the returned value out of the static buffer into the
3304 push_deferring_access_checks (dk_no_check);
3305 call_expr = build_aggr_init (slot, call_expr,
3306 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3307 tf_warning_or_error);
3308 pop_deferring_access_checks ();
3309 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3312 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3314 tree init = build_zero_init (type, NULL_TREE,
3315 /*static_storage_p=*/false);
3316 init = build2 (INIT_EXPR, void_type_node, slot, init);
3317 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3324 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3327 emit_associated_thunks (tree fn)
3329 /* When we use vcall offsets, we emit thunks with the virtual
3330 functions to which they thunk. The whole point of vcall offsets
3331 is so that you can know statically the entire set of thunks that
3332 will ever be needed for a given virtual function, thereby
3333 enabling you to output all the thunks with the function itself. */
3334 if (DECL_VIRTUAL_P (fn)
3335 /* Do not emit thunks for extern template instantiations. */
3336 && ! DECL_REALLY_EXTERN (fn))
3340 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3342 if (!THUNK_ALIAS (thunk))
3344 use_thunk (thunk, /*emit_p=*/1);
3345 if (DECL_RESULT_THUNK_P (thunk))
3349 for (probe = DECL_THUNKS (thunk);
3350 probe; probe = TREE_CHAIN (probe))
3351 use_thunk (probe, /*emit_p=*/1);
3355 gcc_assert (!DECL_THUNKS (thunk));
3360 /* Generate RTL for FN. */
3363 expand_or_defer_fn_1 (tree fn)
3365 /* When the parser calls us after finishing the body of a template
3366 function, we don't really want to expand the body. */
3367 if (processing_template_decl)
3369 /* Normally, collection only occurs in rest_of_compilation. So,
3370 if we don't collect here, we never collect junk generated
3371 during the processing of templates until we hit a
3372 non-template function. It's not safe to do this inside a
3373 nested class, though, as the parser may have local state that
3374 is not a GC root. */
3375 if (!function_depth)
3380 gcc_assert (DECL_SAVED_TREE (fn));
3382 /* If this is a constructor or destructor body, we have to clone
3384 if (maybe_clone_body (fn))
3386 /* We don't want to process FN again, so pretend we've written
3387 it out, even though we haven't. */
3388 TREE_ASM_WRITTEN (fn) = 1;
3389 DECL_SAVED_TREE (fn) = NULL_TREE;
3393 /* We make a decision about linkage for these functions at the end
3394 of the compilation. Until that point, we do not want the back
3395 end to output them -- but we do want it to see the bodies of
3396 these functions so that it can inline them as appropriate. */
3397 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3399 if (DECL_INTERFACE_KNOWN (fn))
3400 /* We've already made a decision as to how this function will
3404 DECL_EXTERNAL (fn) = 1;
3405 DECL_NOT_REALLY_EXTERN (fn) = 1;
3406 note_vague_linkage_fn (fn);
3407 /* A non-template inline function with external linkage will
3408 always be COMDAT. As we must eventually determine the
3409 linkage of all functions, and as that causes writes to
3410 the data mapped in from the PCH file, it's advantageous
3411 to mark the functions at this point. */
3412 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3414 /* This function must have external linkage, as
3415 otherwise DECL_INTERFACE_KNOWN would have been
3417 gcc_assert (TREE_PUBLIC (fn));
3418 comdat_linkage (fn);
3419 DECL_INTERFACE_KNOWN (fn) = 1;
3423 import_export_decl (fn);
3425 /* If the user wants us to keep all inline functions, then mark
3426 this function as needed so that finish_file will make sure to
3427 output it later. Similarly, all dllexport'd functions must
3428 be emitted; there may be callers in other DLLs. */
3429 if ((flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3430 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3434 /* There's no reason to do any of the work here if we're only doing
3435 semantic analysis; this code just generates RTL. */
3436 if (flag_syntax_only)
3443 expand_or_defer_fn (tree fn)
3445 if (expand_or_defer_fn_1 (fn))
3449 /* Expand or defer, at the whim of the compilation unit manager. */
3450 cgraph_finalize_function (fn, function_depth > 1);
3451 emit_associated_thunks (fn);
3464 /* Helper function for walk_tree, used by finalize_nrv below. */
3467 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3469 struct nrv_data *dp = (struct nrv_data *)data;
3472 /* No need to walk into types. There wouldn't be any need to walk into
3473 non-statements, except that we have to consider STMT_EXPRs. */
3476 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3477 but differs from using NULL_TREE in that it indicates that we care
3478 about the value of the RESULT_DECL. */
3479 else if (TREE_CODE (*tp) == RETURN_EXPR)
3480 TREE_OPERAND (*tp, 0) = dp->result;
3481 /* Change all cleanups for the NRV to only run when an exception is
3483 else if (TREE_CODE (*tp) == CLEANUP_STMT
3484 && CLEANUP_DECL (*tp) == dp->var)
3485 CLEANUP_EH_ONLY (*tp) = 1;
3486 /* Replace the DECL_EXPR for the NRV with an initialization of the
3487 RESULT_DECL, if needed. */
3488 else if (TREE_CODE (*tp) == DECL_EXPR
3489 && DECL_EXPR_DECL (*tp) == dp->var)
3492 if (DECL_INITIAL (dp->var)
3493 && DECL_INITIAL (dp->var) != error_mark_node)
3494 init = build2 (INIT_EXPR, void_type_node, dp->result,
3495 DECL_INITIAL (dp->var));
3497 init = build_empty_stmt (EXPR_LOCATION (*tp));
3498 DECL_INITIAL (dp->var) = NULL_TREE;
3499 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3502 /* And replace all uses of the NRV with the RESULT_DECL. */
3503 else if (*tp == dp->var)
3506 /* Avoid walking into the same tree more than once. Unfortunately, we
3507 can't just use walk_tree_without duplicates because it would only call
3508 us for the first occurrence of dp->var in the function body. */
3509 slot = htab_find_slot (dp->visited, *tp, INSERT);
3515 /* Keep iterating. */
3519 /* Called from finish_function to implement the named return value
3520 optimization by overriding all the RETURN_EXPRs and pertinent
3521 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3522 RESULT_DECL for the function. */
3525 finalize_nrv (tree *tp, tree var, tree result)
3527 struct nrv_data data;
3529 /* Copy debugging information from VAR to RESULT. */
3530 DECL_NAME (result) = DECL_NAME (var);
3531 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3532 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3533 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3534 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3535 /* Don't forget that we take its address. */
3536 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3539 data.result = result;
3540 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3541 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3542 htab_delete (data.visited);
3545 /* Return the declaration for the function called by CALL_EXPR T,
3546 TYPE is the class type of the clause decl. */
3549 omp_clause_info_fndecl (tree t, tree type)
3551 tree ret = get_callee_fndecl (t);
3556 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3557 t = CALL_EXPR_FN (t);
3559 if (TREE_CODE (t) == OBJ_TYPE_REF)
3561 t = cp_fold_obj_type_ref (t, type);
3562 if (TREE_CODE (t) == ADDR_EXPR
3563 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3564 return TREE_OPERAND (t, 0);
3570 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3573 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3574 bool need_copy_ctor, bool need_copy_assignment)
3576 int save_errorcount = errorcount;
3579 /* Always allocate 3 elements for simplicity. These are the
3580 function decls for the ctor, dtor, and assignment op.
3581 This layout is known to the three lang hooks,
3582 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3583 and cxx_omp_clause_assign_op. */
3584 info = make_tree_vec (3);
3585 CP_OMP_CLAUSE_INFO (c) = info;
3587 if (need_default_ctor
3588 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3592 if (need_default_ctor)
3596 t = build_int_cst (build_pointer_type (type), 0);
3597 t = build1 (INDIRECT_REF, type, t);
3598 vec = make_tree_vector_single (t);
3600 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3601 &vec, type, LOOKUP_NORMAL,
3602 tf_warning_or_error);
3605 release_tree_vector (vec);
3607 if (targetm.cxx.cdtor_returns_this () || errorcount)
3608 /* Because constructors and destructors return this,
3609 the call will have been cast to "void". Remove the
3610 cast here. We would like to use STRIP_NOPS, but it
3611 wouldn't work here because TYPE_MODE (t) and
3612 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3613 They are VOIDmode and Pmode, respectively. */
3614 if (TREE_CODE (t) == NOP_EXPR)
3615 t = TREE_OPERAND (t, 0);
3617 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3620 if ((need_default_ctor || need_copy_ctor)
3621 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3623 t = build_int_cst (build_pointer_type (type), 0);
3624 t = build1 (INDIRECT_REF, type, t);
3625 t = build_special_member_call (t, complete_dtor_identifier,
3626 NULL, type, LOOKUP_NORMAL,
3627 tf_warning_or_error);
3629 if (targetm.cxx.cdtor_returns_this () || errorcount)
3630 /* Because constructors and destructors return this,
3631 the call will have been cast to "void". Remove the
3632 cast here. We would like to use STRIP_NOPS, but it
3633 wouldn't work here because TYPE_MODE (t) and
3634 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3635 They are VOIDmode and Pmode, respectively. */
3636 if (TREE_CODE (t) == NOP_EXPR)
3637 t = TREE_OPERAND (t, 0);
3639 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3642 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3646 t = build_int_cst (build_pointer_type (type), 0);
3647 t = build1 (INDIRECT_REF, type, t);
3648 vec = make_tree_vector_single (t);
3649 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3650 &vec, type, LOOKUP_NORMAL,
3651 tf_warning_or_error);
3652 release_tree_vector (vec);
3654 /* We'll have called convert_from_reference on the call, which
3655 may well have added an indirect_ref. It's unneeded here,
3656 and in the way, so kill it. */
3657 if (TREE_CODE (t) == INDIRECT_REF)
3658 t = TREE_OPERAND (t, 0);
3660 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3663 return errorcount != save_errorcount;
3666 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3667 Remove any elements from the list that are invalid. */
3670 finish_omp_clauses (tree clauses)
3672 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3673 tree c, t, *pc = &clauses;
3676 bitmap_obstack_initialize (NULL);
3677 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3678 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3679 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3681 for (pc = &clauses, c = clauses; c ; c = *pc)
3683 bool remove = false;
3685 switch (OMP_CLAUSE_CODE (c))
3687 case OMP_CLAUSE_SHARED:
3689 goto check_dup_generic;
3690 case OMP_CLAUSE_PRIVATE:
3692 goto check_dup_generic;
3693 case OMP_CLAUSE_REDUCTION:
3695 goto check_dup_generic;
3696 case OMP_CLAUSE_COPYPRIVATE:
3697 name = "copyprivate";
3698 goto check_dup_generic;
3699 case OMP_CLAUSE_COPYIN:
3701 goto check_dup_generic;
3703 t = OMP_CLAUSE_DECL (c);
3704 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3706 if (processing_template_decl)
3709 error ("%qD is not a variable in clause %qs", t, name);
3711 error ("%qE is not a variable in clause %qs", t, name);
3714 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3715 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3716 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3718 error ("%qD appears more than once in data clauses", t);
3722 bitmap_set_bit (&generic_head, DECL_UID (t));
3725 case OMP_CLAUSE_FIRSTPRIVATE:
3726 t = OMP_CLAUSE_DECL (c);
3727 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3729 if (processing_template_decl)
3732 error ("%qD is not a variable in clause %<firstprivate%>", t);
3734 error ("%qE is not a variable in clause %<firstprivate%>", t);
3737 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3738 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3740 error ("%qD appears more than once in data clauses", t);
3744 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3747 case OMP_CLAUSE_LASTPRIVATE:
3748 t = OMP_CLAUSE_DECL (c);
3749 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3751 if (processing_template_decl)
3754 error ("%qD is not a variable in clause %<lastprivate%>", t);
3756 error ("%qE is not a variable in clause %<lastprivate%>", t);
3759 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3760 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3762 error ("%qD appears more than once in data clauses", t);
3766 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3770 t = OMP_CLAUSE_IF_EXPR (c);
3771 t = maybe_convert_cond (t);
3772 if (t == error_mark_node)
3774 OMP_CLAUSE_IF_EXPR (c) = t;
3777 case OMP_CLAUSE_NUM_THREADS:
3778 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3779 if (t == error_mark_node)
3781 else if (!type_dependent_expression_p (t)
3782 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3784 error ("num_threads expression must be integral");
3789 case OMP_CLAUSE_SCHEDULE:
3790 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3793 else if (t == error_mark_node)
3795 else if (!type_dependent_expression_p (t)
3796 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3798 error ("schedule chunk size expression must be integral");
3803 case OMP_CLAUSE_NOWAIT:
3804 case OMP_CLAUSE_ORDERED:
3805 case OMP_CLAUSE_DEFAULT:
3806 case OMP_CLAUSE_UNTIED:
3807 case OMP_CLAUSE_COLLAPSE:
3815 *pc = OMP_CLAUSE_CHAIN (c);
3817 pc = &OMP_CLAUSE_CHAIN (c);
3820 for (pc = &clauses, c = clauses; c ; c = *pc)
3822 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3823 bool remove = false;
3824 bool need_complete_non_reference = false;
3825 bool need_default_ctor = false;
3826 bool need_copy_ctor = false;
3827 bool need_copy_assignment = false;
3828 bool need_implicitly_determined = false;
3829 tree type, inner_type;
3833 case OMP_CLAUSE_SHARED:
3835 need_implicitly_determined = true;
3837 case OMP_CLAUSE_PRIVATE:
3839 need_complete_non_reference = true;
3840 need_default_ctor = true;
3841 need_implicitly_determined = true;
3843 case OMP_CLAUSE_FIRSTPRIVATE:
3844 name = "firstprivate";
3845 need_complete_non_reference = true;
3846 need_copy_ctor = true;
3847 need_implicitly_determined = true;
3849 case OMP_CLAUSE_LASTPRIVATE:
3850 name = "lastprivate";
3851 need_complete_non_reference = true;
3852 need_copy_assignment = true;
3853 need_implicitly_determined = true;
3855 case OMP_CLAUSE_REDUCTION:
3857 need_implicitly_determined = true;
3859 case OMP_CLAUSE_COPYPRIVATE:
3860 name = "copyprivate";
3861 need_copy_assignment = true;
3863 case OMP_CLAUSE_COPYIN:
3865 need_copy_assignment = true;
3868 pc = &OMP_CLAUSE_CHAIN (c);
3872 t = OMP_CLAUSE_DECL (c);
3873 if (processing_template_decl
3874 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3876 pc = &OMP_CLAUSE_CHAIN (c);
3882 case OMP_CLAUSE_LASTPRIVATE:
3883 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3884 need_default_ctor = true;
3887 case OMP_CLAUSE_REDUCTION:
3888 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3889 || POINTER_TYPE_P (TREE_TYPE (t)))
3891 error ("%qE has invalid type for %<reduction%>", t);
3894 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3896 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3904 error ("%qE has invalid type for %<reduction(%s)%>",
3905 t, operator_name_info[r_code].name);
3911 case OMP_CLAUSE_COPYIN:
3912 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3914 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3923 if (need_complete_non_reference)
3925 t = require_complete_type (t);
3926 if (t == error_mark_node)
3928 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3930 error ("%qE has reference type for %qs", t, name);
3934 if (need_implicitly_determined)
3936 const char *share_name = NULL;
3938 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3939 share_name = "threadprivate";
3940 else switch (cxx_omp_predetermined_sharing (t))
3942 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3944 case OMP_CLAUSE_DEFAULT_SHARED:
3945 share_name = "shared";
3947 case OMP_CLAUSE_DEFAULT_PRIVATE:
3948 share_name = "private";
3955 error ("%qE is predetermined %qs for %qs",
3956 t, share_name, name);
3961 /* We're interested in the base element, not arrays. */
3962 inner_type = type = TREE_TYPE (t);
3963 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3964 inner_type = TREE_TYPE (inner_type);
3966 /* Check for special function availability by building a call to one.
3967 Save the results, because later we won't be in the right context
3968 for making these queries. */
3969 if (CLASS_TYPE_P (inner_type)
3970 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3971 && !type_dependent_expression_p (t)
3972 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3973 need_copy_ctor, need_copy_assignment))
3977 *pc = OMP_CLAUSE_CHAIN (c);
3979 pc = &OMP_CLAUSE_CHAIN (c);
3982 bitmap_obstack_release (NULL);
3986 /* For all variables in the tree_list VARS, mark them as thread local. */
3989 finish_omp_threadprivate (tree vars)
3993 /* Mark every variable in VARS to be assigned thread local storage. */
3994 for (t = vars; t; t = TREE_CHAIN (t))
3996 tree v = TREE_PURPOSE (t);
3998 if (error_operand_p (v))
4000 else if (TREE_CODE (v) != VAR_DECL)
4001 error ("%<threadprivate%> %qD is not file, namespace "
4002 "or block scope variable", v);
4003 /* If V had already been marked threadprivate, it doesn't matter
4004 whether it had been used prior to this point. */
4005 else if (TREE_USED (v)
4006 && (DECL_LANG_SPECIFIC (v) == NULL
4007 || !CP_DECL_THREADPRIVATE_P (v)))
4008 error ("%qE declared %<threadprivate%> after first use", v);
4009 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4010 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4011 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
4012 error ("%<threadprivate%> %qE has incomplete type", v);
4013 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4014 && CP_DECL_CONTEXT (v) != current_class_type)
4015 error ("%<threadprivate%> %qE directive not "
4016 "in %qT definition", v, CP_DECL_CONTEXT (v));
4019 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4020 if (DECL_LANG_SPECIFIC (v) == NULL)
4022 retrofit_lang_decl (v);
4024 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4025 after the allocation of the lang_decl structure. */
4026 if (DECL_DISCRIMINATOR_P (v))
4027 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4030 if (! DECL_THREAD_LOCAL_P (v))
4032 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4033 /* If rtl has been already set for this var, call
4034 make_decl_rtl once again, so that encode_section_info
4035 has a chance to look at the new decl flags. */
4036 if (DECL_RTL_SET_P (v))
4039 CP_DECL_THREADPRIVATE_P (v) = 1;
4044 /* Build an OpenMP structured block. */
4047 begin_omp_structured_block (void)
4049 return do_pushlevel (sk_omp);
4053 finish_omp_structured_block (tree block)
4055 return do_poplevel (block);
4058 /* Similarly, except force the retention of the BLOCK. */
4061 begin_omp_parallel (void)
4063 keep_next_level (true);
4064 return begin_omp_structured_block ();
4068 finish_omp_parallel (tree clauses, tree body)
4072 body = finish_omp_structured_block (body);
4074 stmt = make_node (OMP_PARALLEL);
4075 TREE_TYPE (stmt) = void_type_node;
4076 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4077 OMP_PARALLEL_BODY (stmt) = body;
4079 return add_stmt (stmt);
4083 begin_omp_task (void)
4085 keep_next_level (true);
4086 return begin_omp_structured_block ();
4090 finish_omp_task (tree clauses, tree body)
4094 body = finish_omp_structured_block (body);
4096 stmt = make_node (OMP_TASK);
4097 TREE_TYPE (stmt) = void_type_node;
4098 OMP_TASK_CLAUSES (stmt) = clauses;
4099 OMP_TASK_BODY (stmt) = body;
4101 return add_stmt (stmt);
4104 /* Helper function for finish_omp_for. Convert Ith random access iterator
4105 into integral iterator. Return FALSE if successful. */
4108 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4109 tree condv, tree incrv, tree *body,
4110 tree *pre_body, tree clauses)
4112 tree diff, iter_init, iter_incr = NULL, last;
4113 tree incr_var = NULL, orig_pre_body, orig_body, c;
4114 tree decl = TREE_VEC_ELT (declv, i);
4115 tree init = TREE_VEC_ELT (initv, i);
4116 tree cond = TREE_VEC_ELT (condv, i);
4117 tree incr = TREE_VEC_ELT (incrv, i);
4119 location_t elocus = locus;
4121 if (init && EXPR_HAS_LOCATION (init))
4122 elocus = EXPR_LOCATION (init);
4124 switch (TREE_CODE (cond))
4130 if (TREE_OPERAND (cond, 1) == iter)
4131 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4132 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4133 if (TREE_OPERAND (cond, 0) != iter)
4134 cond = error_mark_node;
4137 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4138 TREE_OPERAND (cond, 1), ERROR_MARK,
4139 NULL, tf_warning_or_error);
4140 if (error_operand_p (tem))
4145 cond = error_mark_node;
4148 if (cond == error_mark_node)
4150 error_at (elocus, "invalid controlling predicate");
4153 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4154 ERROR_MARK, iter, ERROR_MARK, NULL,
4155 tf_warning_or_error);
4156 if (error_operand_p (diff))
4158 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4160 error_at (elocus, "difference between %qE and %qD does not have integer type",
4161 TREE_OPERAND (cond, 1), iter);
4165 switch (TREE_CODE (incr))
4167 case PREINCREMENT_EXPR:
4168 case PREDECREMENT_EXPR:
4169 case POSTINCREMENT_EXPR:
4170 case POSTDECREMENT_EXPR:
4171 if (TREE_OPERAND (incr, 0) != iter)
4173 incr = error_mark_node;
4176 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4177 tf_warning_or_error);
4178 if (error_operand_p (iter_incr))
4180 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4181 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4182 incr = integer_one_node;
4184 incr = integer_minus_one_node;
4187 if (TREE_OPERAND (incr, 0) != iter)
4188 incr = error_mark_node;
4189 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4190 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4192 tree rhs = TREE_OPERAND (incr, 1);
4193 if (TREE_OPERAND (rhs, 0) == iter)
4195 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4197 incr = error_mark_node;
4200 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4201 TREE_OPERAND (rhs, 1),
4202 tf_warning_or_error);
4203 if (error_operand_p (iter_incr))
4205 incr = TREE_OPERAND (rhs, 1);
4206 incr = cp_convert (TREE_TYPE (diff), incr);
4207 if (TREE_CODE (rhs) == MINUS_EXPR)
4209 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4210 incr = fold_if_not_in_template (incr);
4212 if (TREE_CODE (incr) != INTEGER_CST
4213 && (TREE_CODE (incr) != NOP_EXPR
4214 || (TREE_CODE (TREE_OPERAND (incr, 0))
4219 else if (TREE_OPERAND (rhs, 1) == iter)
4221 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4222 || TREE_CODE (rhs) != PLUS_EXPR)
4223 incr = error_mark_node;
4226 iter_incr = build_x_binary_op (PLUS_EXPR,
4227 TREE_OPERAND (rhs, 0),
4230 tf_warning_or_error);
4231 if (error_operand_p (iter_incr))
4233 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4235 tf_warning_or_error);
4236 if (error_operand_p (iter_incr))
4238 incr = TREE_OPERAND (rhs, 0);
4243 incr = error_mark_node;
4246 incr = error_mark_node;
4249 incr = error_mark_node;
4253 if (incr == error_mark_node)
4255 error_at (elocus, "invalid increment expression");
4259 incr = cp_convert (TREE_TYPE (diff), incr);
4260 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4261 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4262 && OMP_CLAUSE_DECL (c) == iter)
4265 decl = create_temporary_var (TREE_TYPE (diff));
4267 add_decl_expr (decl);
4268 last = create_temporary_var (TREE_TYPE (diff));
4270 add_decl_expr (last);
4271 if (c && iter_incr == NULL)
4273 incr_var = create_temporary_var (TREE_TYPE (diff));
4274 pushdecl (incr_var);
4275 add_decl_expr (incr_var);
4277 gcc_assert (stmts_are_full_exprs_p ());
4279 orig_pre_body = *pre_body;
4280 *pre_body = push_stmt_list ();
4282 add_stmt (orig_pre_body);
4284 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4285 tf_warning_or_error));
4286 init = build_int_cst (TREE_TYPE (diff), 0);
4287 if (c && iter_incr == NULL)
4289 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4290 incr, tf_warning_or_error));
4292 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4293 tf_warning_or_error);
4295 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4296 tf_warning_or_error));
4297 *pre_body = pop_stmt_list (*pre_body);
4299 cond = cp_build_binary_op (elocus,
4300 TREE_CODE (cond), decl, diff,
4301 tf_warning_or_error);
4302 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4303 elocus, incr, NULL_TREE);
4306 *body = push_stmt_list ();
4307 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4308 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4309 tf_warning_or_error);
4310 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4311 finish_expr_stmt (iter_init);
4312 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4313 tf_warning_or_error));
4314 add_stmt (orig_body);
4315 *body = pop_stmt_list (*body);
4319 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4320 finish_expr_stmt (iter_incr);
4321 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4322 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4325 TREE_VEC_ELT (declv, i) = decl;
4326 TREE_VEC_ELT (initv, i) = init;
4327 TREE_VEC_ELT (condv, i) = cond;
4328 TREE_VEC_ELT (incrv, i) = incr;
4333 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4334 are directly for their associated operands in the statement. DECL
4335 and INIT are a combo; if DECL is NULL then INIT ought to be a
4336 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4337 optional statements that need to go before the loop into its
4341 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4342 tree incrv, tree body, tree pre_body, tree clauses)
4344 tree omp_for = NULL, orig_incr = NULL;
4345 tree decl, init, cond, incr;
4349 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4350 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4351 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4352 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4354 decl = TREE_VEC_ELT (declv, i);
4355 init = TREE_VEC_ELT (initv, i);
4356 cond = TREE_VEC_ELT (condv, i);
4357 incr = TREE_VEC_ELT (incrv, i);
4363 switch (TREE_CODE (init))
4366 decl = TREE_OPERAND (init, 0);
4367 init = TREE_OPERAND (init, 1);
4370 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4372 decl = TREE_OPERAND (init, 0);
4373 init = TREE_OPERAND (init, 2);
4383 "expected iteration declaration or initialization");
4388 if (init && EXPR_HAS_LOCATION (init))
4389 elocus = EXPR_LOCATION (init);
4393 error_at (elocus, "missing controlling predicate");
4399 error_at (elocus, "missing increment expression");
4403 TREE_VEC_ELT (declv, i) = decl;
4404 TREE_VEC_ELT (initv, i) = init;
4407 if (dependent_omp_for_p (declv, initv, condv, incrv))
4411 stmt = make_node (OMP_FOR);
4413 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4415 /* This is really just a place-holder. We'll be decomposing this
4416 again and going through the cp_build_modify_expr path below when
4417 we instantiate the thing. */
4418 TREE_VEC_ELT (initv, i)
4419 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4420 TREE_VEC_ELT (initv, i));
4423 TREE_TYPE (stmt) = void_type_node;
4424 OMP_FOR_INIT (stmt) = initv;
4425 OMP_FOR_COND (stmt) = condv;
4426 OMP_FOR_INCR (stmt) = incrv;
4427 OMP_FOR_BODY (stmt) = body;
4428 OMP_FOR_PRE_BODY (stmt) = pre_body;
4429 OMP_FOR_CLAUSES (stmt) = clauses;
4431 SET_EXPR_LOCATION (stmt, locus);
4432 return add_stmt (stmt);
4435 if (processing_template_decl)
4436 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4438 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4440 decl = TREE_VEC_ELT (declv, i);
4441 init = TREE_VEC_ELT (initv, i);
4442 cond = TREE_VEC_ELT (condv, i);
4443 incr = TREE_VEC_ELT (incrv, i);
4445 TREE_VEC_ELT (orig_incr, i) = incr;
4448 if (init && EXPR_HAS_LOCATION (init))
4449 elocus = EXPR_LOCATION (init);
4453 error_at (elocus, "expected iteration declaration or initialization");
4457 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4460 TREE_VEC_ELT (orig_incr, i) = incr;
4461 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4462 TREE_CODE (TREE_OPERAND (incr, 1)),
4463 TREE_OPERAND (incr, 2),
4464 tf_warning_or_error);
4467 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4469 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4470 incrv, &body, &pre_body, clauses))
4475 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4476 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4478 error_at (elocus, "invalid type for iteration variable %qE", decl);
4482 if (!processing_template_decl)
4484 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4485 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4488 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4490 && TREE_SIDE_EFFECTS (cond)
4491 && COMPARISON_CLASS_P (cond)
4492 && !processing_template_decl)
4494 tree t = TREE_OPERAND (cond, 0);
4495 if (TREE_SIDE_EFFECTS (t)
4497 && (TREE_CODE (t) != NOP_EXPR
4498 || TREE_OPERAND (t, 0) != decl))
4499 TREE_OPERAND (cond, 0)
4500 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4502 t = TREE_OPERAND (cond, 1);
4503 if (TREE_SIDE_EFFECTS (t)
4505 && (TREE_CODE (t) != NOP_EXPR
4506 || TREE_OPERAND (t, 0) != decl))
4507 TREE_OPERAND (cond, 1)
4508 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4510 if (decl == error_mark_node || init == error_mark_node)
4513 TREE_VEC_ELT (declv, i) = decl;
4514 TREE_VEC_ELT (initv, i) = init;
4515 TREE_VEC_ELT (condv, i) = cond;
4516 TREE_VEC_ELT (incrv, i) = incr;
4520 if (IS_EMPTY_STMT (pre_body))
4523 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4526 if (omp_for == NULL)
4529 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4531 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4532 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4534 if (TREE_CODE (incr) != MODIFY_EXPR)
4537 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4538 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4539 && !processing_template_decl)
4541 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4542 if (TREE_SIDE_EFFECTS (t)
4544 && (TREE_CODE (t) != NOP_EXPR
4545 || TREE_OPERAND (t, 0) != decl))
4546 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4547 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4549 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4550 if (TREE_SIDE_EFFECTS (t)
4552 && (TREE_CODE (t) != NOP_EXPR
4553 || TREE_OPERAND (t, 0) != decl))
4554 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4555 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4559 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4561 if (omp_for != NULL)
4562 OMP_FOR_CLAUSES (omp_for) = clauses;
4567 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4576 dependent_p = false;
4579 /* Even in a template, we can detect invalid uses of the atomic
4580 pragma if neither LHS nor RHS is type-dependent. */
4581 if (processing_template_decl)
4583 dependent_p = (type_dependent_expression_p (lhs)
4584 || type_dependent_expression_p (rhs));
4587 lhs = build_non_dependent_expr (lhs);
4588 rhs = build_non_dependent_expr (rhs);
4593 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4594 if (stmt == error_mark_node)
4597 if (processing_template_decl)
4598 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4599 build2 (code, void_type_node, orig_lhs, orig_rhs));
4604 finish_omp_barrier (void)
4606 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4607 VEC(tree,gc) *vec = make_tree_vector ();
4608 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4609 release_tree_vector (vec);
4610 finish_expr_stmt (stmt);
4614 finish_omp_flush (void)
4616 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4617 VEC(tree,gc) *vec = make_tree_vector ();
4618 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4619 release_tree_vector (vec);
4620 finish_expr_stmt (stmt);
4624 finish_omp_taskwait (void)
4626 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4627 VEC(tree,gc) *vec = make_tree_vector ();
4628 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4629 release_tree_vector (vec);
4630 finish_expr_stmt (stmt);
4634 init_cp_semantics (void)
4638 /* Build a STATIC_ASSERT for a static assertion with the condition
4639 CONDITION and the message text MESSAGE. LOCATION is the location
4640 of the static assertion in the source code. When MEMBER_P, this
4641 static assertion is a member of a class. */
4643 finish_static_assert (tree condition, tree message, location_t location,
4646 if (check_for_bare_parameter_packs (condition))
4647 condition = error_mark_node;
4649 if (type_dependent_expression_p (condition)
4650 || value_dependent_expression_p (condition))
4652 /* We're in a template; build a STATIC_ASSERT and put it in
4656 assertion = make_node (STATIC_ASSERT);
4657 STATIC_ASSERT_CONDITION (assertion) = condition;
4658 STATIC_ASSERT_MESSAGE (assertion) = message;
4659 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4662 maybe_add_class_template_decl_list (current_class_type,
4666 add_stmt (assertion);
4671 /* Fold the expression and convert it to a boolean value. */
4672 condition = fold_non_dependent_expr (condition);
4673 condition = cp_convert (boolean_type_node, condition);
4675 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4676 /* Do nothing; the condition is satisfied. */
4680 location_t saved_loc = input_location;
4682 input_location = location;
4683 if (TREE_CODE (condition) == INTEGER_CST
4684 && integer_zerop (condition))
4685 /* Report the error. */
4686 error ("static assertion failed: %E", message);
4687 else if (condition && condition != error_mark_node)
4688 error ("non-constant condition for static assertion");
4689 input_location = saved_loc;
4693 /* Returns the type of EXPR for cases where we can determine it even though
4694 EXPR is a type-dependent expression. */
4697 describable_type (tree expr)
4699 tree type = NULL_TREE;
4701 if (! type_dependent_expression_p (expr)
4702 && ! type_unknown_p (expr))
4704 type = unlowered_expr_type (expr);
4705 if (real_lvalue_p (expr))
4706 type = build_reference_type (type);
4712 switch (TREE_CODE (expr))
4718 return TREE_TYPE (expr);
4723 case TEMPLATE_PARM_INDEX:
4725 case STATIC_CAST_EXPR:
4726 case REINTERPRET_CAST_EXPR:
4727 case CONST_CAST_EXPR:
4728 case DYNAMIC_CAST_EXPR:
4729 type = TREE_TYPE (expr);
4734 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4735 if (ptrtype && POINTER_TYPE_P (ptrtype))
4736 type = build_reference_type (TREE_TYPE (ptrtype));
4741 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4742 type = TREE_TYPE (expr);
4746 if (type && type_uses_auto (type))
4752 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4753 suitable for use as a type-specifier.
4755 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4756 id-expression or a class member access, FALSE when it was parsed as
4757 a full expression. */
4760 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4762 tree orig_expr = expr;
4763 tree type = NULL_TREE;
4765 if (!expr || error_operand_p (expr))
4766 return error_mark_node;
4769 || TREE_CODE (expr) == TYPE_DECL
4770 || (TREE_CODE (expr) == BIT_NOT_EXPR
4771 && TYPE_P (TREE_OPERAND (expr, 0))))
4773 error ("argument to decltype must be an expression");
4774 return error_mark_node;
4777 if (type_dependent_expression_p (expr)
4778 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4779 if it isn't dependent, so that we can check access control at
4780 instantiation time, so defer the decltype as well (PR 42277). */
4781 || (id_expression_or_member_access_p
4782 && processing_template_decl
4783 && TREE_CODE (expr) == COMPONENT_REF))
4785 if (id_expression_or_member_access_p)
4787 switch (TREE_CODE (expr))
4794 case TEMPLATE_PARM_INDEX:
4795 type = TREE_TYPE (expr);
4803 if (type && !type_uses_auto (type))
4806 type = cxx_make_type (DECLTYPE_TYPE);
4807 DECLTYPE_TYPE_EXPR (type) = expr;
4808 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4809 = id_expression_or_member_access_p;
4810 SET_TYPE_STRUCTURAL_EQUALITY (type);
4815 /* The type denoted by decltype(e) is defined as follows: */
4817 expr = resolve_nondeduced_context (expr);
4818 if (id_expression_or_member_access_p)
4820 /* If e is an id-expression or a class member access (5.2.5
4821 [expr.ref]), decltype(e) is defined as the type of the entity
4822 named by e. If there is no such entity, or e names a set of
4823 overloaded functions, the program is ill-formed. */
4824 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4825 expr = lookup_name (expr);
4827 if (TREE_CODE (expr) == INDIRECT_REF)
4828 /* This can happen when the expression is, e.g., "a.b". Just
4829 look at the underlying operand. */
4830 expr = TREE_OPERAND (expr, 0);
4832 if (TREE_CODE (expr) == OFFSET_REF
4833 || TREE_CODE (expr) == MEMBER_REF)
4834 /* We're only interested in the field itself. If it is a
4835 BASELINK, we will need to see through it in the next
4837 expr = TREE_OPERAND (expr, 1);
4839 if (TREE_CODE (expr) == BASELINK)
4840 /* See through BASELINK nodes to the underlying functions. */
4841 expr = BASELINK_FUNCTIONS (expr);
4843 if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
4844 expr = TREE_OPERAND (expr, 0);
4846 if (TREE_CODE (expr) == OVERLOAD)
4848 if (OVL_CHAIN (expr)
4849 || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL)
4851 error ("%qE refers to a set of overloaded functions", orig_expr);
4852 return error_mark_node;
4855 /* An overload set containing only one function: just look
4856 at that function. */
4857 expr = OVL_FUNCTION (expr);
4860 switch (TREE_CODE (expr))
4863 if (DECL_BIT_FIELD_TYPE (expr))
4865 type = DECL_BIT_FIELD_TYPE (expr);
4868 /* Fall through for fields that aren't bitfields. */
4875 case TEMPLATE_PARM_INDEX:
4876 type = TREE_TYPE (expr);
4880 type = error_mark_node;
4884 type = is_bitfield_expr_with_lowered_type (expr);
4886 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4893 /* We can get here when the id-expression refers to an
4895 type = TREE_TYPE (expr);
4899 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4900 || TREE_CODE (expr) == SCOPE_REF);
4901 error ("argument to decltype must be an expression");
4902 return error_mark_node;
4907 /* Expressions of reference type are sometimes wrapped in
4908 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4909 representation, not part of the language, so we have to look
4911 if (TREE_CODE (expr) == INDIRECT_REF
4912 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4914 expr = TREE_OPERAND (expr, 0);
4916 if (TREE_CODE (expr) == CALL_EXPR)
4918 /* If e is a function call (5.2.2 [expr.call]) or an
4919 invocation of an overloaded operator (parentheses around e
4920 are ignored), decltype(e) is defined as the return type of
4922 tree fndecl = get_callee_fndecl (expr);
4923 if (fndecl && fndecl != error_mark_node)
4924 type = TREE_TYPE (TREE_TYPE (fndecl));
4927 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4928 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4929 || TREE_CODE (target_type) == POINTER_TYPE)
4930 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4931 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4932 type = TREE_TYPE (TREE_TYPE (target_type));
4934 sorry ("unable to determine the declared type of expression %<%E%>",
4940 type = is_bitfield_expr_with_lowered_type (expr);
4943 /* Bitfields are special, because their type encodes the
4944 number of bits they store. If the expression referenced a
4945 bitfield, TYPE now has the declared type of that
4947 type = cp_build_qualified_type (type,
4948 cp_type_quals (TREE_TYPE (expr)));
4950 if (real_lvalue_p (expr))
4951 type = build_reference_type (type);
4953 /* Within a lambda-expression:
4955 Every occurrence of decltype((x)) where x is a possibly
4956 parenthesized id-expression that names an entity of
4957 automatic storage duration is treated as if x were
4958 transformed into an access to a corresponding data member
4959 of the closure type that would have been declared if x
4960 were a use of the denoted entity. */
4961 else if (outer_automatic_var_p (expr)
4962 && current_function_decl
4963 && LAMBDA_FUNCTION_P (current_function_decl))
4964 type = capture_decltype (expr);
4967 /* Otherwise, where T is the type of e, if e is an lvalue,
4968 decltype(e) is defined as T&, otherwise decltype(e) is
4970 type = TREE_TYPE (expr);
4971 if (type == error_mark_node)
4972 return error_mark_node;
4973 else if (expr == current_class_ptr)
4974 /* If the expression is just "this", we want the
4975 cv-unqualified pointer for the "this" type. */
4976 type = TYPE_MAIN_VARIANT (type);
4977 else if (real_lvalue_p (expr))
4979 if (TREE_CODE (type) != REFERENCE_TYPE)
4980 type = build_reference_type (type);
4983 type = non_reference (type);
4988 if (!type || type == unknown_type_node)
4990 error ("type of %qE is unknown", expr);
4991 return error_mark_node;
4997 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4998 __has_nothrow_copy, depending on assign_p. */
5001 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5008 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5011 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5013 else if (TYPE_HAS_INIT_REF (type))
5015 /* If construction of the copy constructor was postponed, create
5017 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5018 lazily_declare_fn (sfk_copy_constructor, type);
5019 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5020 lazily_declare_fn (sfk_move_constructor, type);
5021 fns = CLASSTYPE_CONSTRUCTORS (type);
5026 for (; fns; fns = OVL_NEXT (fns))
5028 tree fn = OVL_CURRENT (fns);
5032 if (copy_fn_p (fn) == 0)
5035 else if (copy_fn_p (fn) <= 0)
5038 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5045 /* Actually evaluates the trait. */
5048 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5050 enum tree_code type_code1;
5053 type_code1 = TREE_CODE (type1);
5057 case CPTK_HAS_NOTHROW_ASSIGN:
5058 type1 = strip_array_types (type1);
5059 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5060 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5061 || (CLASS_TYPE_P (type1)
5062 && classtype_has_nothrow_assign_or_copy_p (type1,
5065 case CPTK_HAS_TRIVIAL_ASSIGN:
5066 /* ??? The standard seems to be missing the "or array of such a class
5067 type" wording for this trait. */
5068 type1 = strip_array_types (type1);
5069 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5070 && (trivial_type_p (type1)
5071 || (CLASS_TYPE_P (type1)
5072 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
5074 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5075 type1 = strip_array_types (type1);
5076 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5077 || (CLASS_TYPE_P (type1)
5078 && (t = locate_ctor (type1, NULL))
5079 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5081 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5082 type1 = strip_array_types (type1);
5083 return (trivial_type_p (type1)
5084 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5086 case CPTK_HAS_NOTHROW_COPY:
5087 type1 = strip_array_types (type1);
5088 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5089 || (CLASS_TYPE_P (type1)
5090 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5092 case CPTK_HAS_TRIVIAL_COPY:
5093 /* ??? The standard seems to be missing the "or array of such a class
5094 type" wording for this trait. */
5095 type1 = strip_array_types (type1);
5096 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5097 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
5099 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5100 type1 = strip_array_types (type1);
5101 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5102 || (CLASS_TYPE_P (type1)
5103 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5105 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5106 return (CLASS_TYPE_P (type1)
5107 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
5109 case CPTK_IS_ABSTRACT:
5110 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5112 case CPTK_IS_BASE_OF:
5113 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5114 && DERIVED_FROM_P (type1, type2));
5117 return (NON_UNION_CLASS_TYPE_P (type1));
5119 case CPTK_IS_CONVERTIBLE_TO:
5124 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5127 return (type_code1 == ENUMERAL_TYPE);
5130 return (pod_type_p (type1));
5132 case CPTK_IS_POLYMORPHIC:
5133 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5135 case CPTK_IS_STD_LAYOUT:
5136 return (std_layout_type_p (type1));
5138 case CPTK_IS_TRIVIAL:
5139 return (trivial_type_p (type1));
5142 return (type_code1 == UNION_TYPE);
5150 /* Returns true if TYPE is a complete type, an array of unknown bound,
5151 or (possibly cv-qualified) void, returns false otherwise. */
5154 check_trait_type (tree type)
5156 if (COMPLETE_TYPE_P (type))
5159 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
5162 if (VOID_TYPE_P (type))
5168 /* Process a trait expression. */
5171 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5173 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5174 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5175 || kind == CPTK_HAS_NOTHROW_COPY
5176 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5177 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5178 || kind == CPTK_HAS_TRIVIAL_COPY
5179 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5180 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5181 || kind == CPTK_IS_ABSTRACT
5182 || kind == CPTK_IS_BASE_OF
5183 || kind == CPTK_IS_CLASS
5184 || kind == CPTK_IS_CONVERTIBLE_TO
5185 || kind == CPTK_IS_EMPTY
5186 || kind == CPTK_IS_ENUM
5187 || kind == CPTK_IS_POD
5188 || kind == CPTK_IS_POLYMORPHIC
5189 || kind == CPTK_IS_STD_LAYOUT
5190 || kind == CPTK_IS_TRIVIAL
5191 || kind == CPTK_IS_UNION);
5193 if (kind == CPTK_IS_CONVERTIBLE_TO)
5195 sorry ("__is_convertible_to");
5196 return error_mark_node;
5199 if (type1 == error_mark_node
5200 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5201 && type2 == error_mark_node))
5202 return error_mark_node;
5204 if (processing_template_decl)
5206 tree trait_expr = make_node (TRAIT_EXPR);
5207 TREE_TYPE (trait_expr) = boolean_type_node;
5208 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5209 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5210 TRAIT_EXPR_KIND (trait_expr) = kind;
5214 complete_type (type1);
5216 complete_type (type2);
5220 case CPTK_HAS_NOTHROW_ASSIGN:
5221 case CPTK_HAS_TRIVIAL_ASSIGN:
5222 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5223 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5224 case CPTK_HAS_NOTHROW_COPY:
5225 case CPTK_HAS_TRIVIAL_COPY:
5226 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5227 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5228 case CPTK_IS_ABSTRACT:
5231 case CPTK_IS_POLYMORPHIC:
5232 case CPTK_IS_STD_LAYOUT:
5233 case CPTK_IS_TRIVIAL:
5234 if (!check_trait_type (type1))
5236 error ("incomplete type %qT not allowed", type1);
5237 return error_mark_node;
5241 case CPTK_IS_BASE_OF:
5242 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5243 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5244 && !COMPLETE_TYPE_P (type2))
5246 error ("incomplete type %qT not allowed", type2);
5247 return error_mark_node;
5256 case CPTK_IS_CONVERTIBLE_TO:
5261 return (trait_expr_value (kind, type1, type2)
5262 ? boolean_true_node : boolean_false_node);
5265 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5266 which is ignored for C++. */
5269 set_float_const_decimal64 (void)
5274 clear_float_const_decimal64 (void)
5279 float_const_decimal64_p (void)
5284 /* Return true if T is a literal type. */
5287 literal_type_p (tree t)
5289 if (SCALAR_TYPE_P (t))
5291 if (CLASS_TYPE_P (t))
5292 return CLASSTYPE_LITERAL_P (t);
5293 if (TREE_CODE (t) == ARRAY_TYPE)
5294 return literal_type_p (strip_array_types (t));
5299 /* If DECL is a variable declared `constexpr', require its type
5300 be literal. Return the DECL if OK, otherwise NULL. */
5303 ensure_literal_type_for_constexpr_object (tree decl)
5305 tree type = TREE_TYPE (decl);
5306 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5307 && !processing_template_decl && !literal_type_p (type))
5309 error ("the type %qT of constexpr variable %qD is not literal",
5316 /* Return non-null if FUN certainly designates a valid constexpr function
5317 declaration. Otherwise return NULL. Issue appropriate diagnostics
5318 if necessary. Note that we only check the declaration, not the body
5322 validate_constexpr_fundecl (tree fun)
5324 tree rettype = NULL;
5327 /* Don't bother if FUN is not marked constexpr. */
5328 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5331 /* For a function template, we have absolutely no guarantee that all
5332 instantiations will be constexpr. */
5333 if (TREE_CODE (fun) == TEMPLATE_DECL)
5336 parm = FUNCTION_FIRST_USER_PARM (fun);
5337 for (; parm != NULL; parm = TREE_CHAIN (parm))
5339 tree type = TREE_TYPE (parm);
5340 if (dependent_type_p (type))
5342 if (!literal_type_p (type))
5344 error ("parameter %q#D is not of literal type", parm);
5349 if (DECL_CONSTRUCTOR_P (fun))
5352 rettype = TREE_TYPE (TREE_TYPE (fun));
5353 if (dependent_type_p (rettype))
5355 if (!literal_type_p (rettype))
5357 error ("return type %qT of function %qD is not a literal type",
5358 TREE_TYPE (TREE_TYPE (fun)), fun);
5365 /* Constructor for a lambda expression. */
5368 build_lambda_expr (void)
5370 tree lambda = make_node (LAMBDA_EXPR);
5371 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
5372 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
5373 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
5374 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
5375 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
5379 /* Create the closure object for a LAMBDA_EXPR. */
5382 build_lambda_object (tree lambda_expr)
5384 /* Build aggregate constructor call.
5385 - cp_parser_braced_list
5386 - cp_parser_functional_cast */
5387 VEC(constructor_elt,gc) *elts = NULL;
5388 tree node, expr, type;
5389 location_t saved_loc;
5391 if (processing_template_decl)
5394 /* Make sure any error messages refer to the lambda-introducer. */
5395 saved_loc = input_location;
5396 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
5398 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
5400 node = TREE_CHAIN (node))
5402 tree field = TREE_PURPOSE (node);
5403 tree val = TREE_VALUE (node);
5405 /* Mere mortals can't copy arrays with aggregate initialization, so
5406 do some magic to make it work here. */
5407 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
5408 val = build_array_copy (val);
5409 else if (DECL_NORMAL_CAPTURE_P (field)
5410 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
5412 /* "the entities that are captured by copy are used to
5413 direct-initialize each corresponding non-static data
5414 member of the resulting closure object."
5416 There's normally no way to express direct-initialization
5417 from an element of a CONSTRUCTOR, so we build up a special
5418 TARGET_EXPR to bypass the usual copy-initialization. */
5419 val = force_rvalue (val);
5420 if (TREE_CODE (val) == TARGET_EXPR)
5421 TARGET_EXPR_DIRECT_INIT_P (val) = true;
5424 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
5427 expr = build_constructor (init_list_type_node, elts);
5428 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
5430 /* N2927: "[The closure] class type is not an aggregate."
5431 But we briefly treat it as an aggregate to make this simpler. */
5432 type = TREE_TYPE (lambda_expr);
5433 CLASSTYPE_NON_AGGREGATE (type) = 0;
5434 expr = finish_compound_literal (type, expr);
5435 CLASSTYPE_NON_AGGREGATE (type) = 1;
5437 input_location = saved_loc;
5441 /* Return an initialized RECORD_TYPE for LAMBDA.
5442 LAMBDA must have its explicit captures already. */
5445 begin_lambda_type (tree lambda)
5450 /* Unique name. This is just like an unnamed class, but we cannot use
5451 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5453 name = make_lambda_name ();
5455 /* Create the new RECORD_TYPE for this lambda. */
5456 type = xref_tag (/*tag_code=*/record_type,
5458 /*scope=*/ts_within_enclosing_non_class,
5459 /*template_header_p=*/false);
5462 /* Designate it as a struct so that we can use aggregate initialization. */
5463 CLASSTYPE_DECLARED_CLASS (type) = false;
5465 /* Clear base types. */
5466 xref_basetypes (type, /*bases=*/NULL_TREE);
5468 /* Start the class. */
5469 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
5471 /* Cross-reference the expression and the type. */
5472 TREE_TYPE (lambda) = type;
5473 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
5478 /* Returns the type to use for the return type of the operator() of a
5482 lambda_return_type (tree expr)
5485 if (type_dependent_expression_p (expr))
5487 type = cxx_make_type (DECLTYPE_TYPE);
5488 DECLTYPE_TYPE_EXPR (type) = expr;
5489 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
5490 SET_TYPE_STRUCTURAL_EQUALITY (type);
5493 type = type_decays_to (unlowered_expr_type (expr));
5497 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5501 lambda_function (tree lambda)
5504 if (TREE_CODE (lambda) == LAMBDA_EXPR)
5505 type = TREE_TYPE (lambda);
5508 gcc_assert (LAMBDA_TYPE_P (type));
5509 /* Don't let debug_tree cause instantiation. */
5510 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
5512 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
5513 /*protect=*/0, /*want_type=*/false);
5515 lambda = BASELINK_FUNCTIONS (lambda);
5519 /* Returns the type to use for the FIELD_DECL corresponding to the
5521 The caller should add REFERENCE_TYPE for capture by reference. */
5524 lambda_capture_field_type (tree expr)
5527 if (type_dependent_expression_p (expr))
5529 type = cxx_make_type (DECLTYPE_TYPE);
5530 DECLTYPE_TYPE_EXPR (type) = expr;
5531 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
5532 SET_TYPE_STRUCTURAL_EQUALITY (type);
5535 type = non_reference (unlowered_expr_type (expr));
5539 /* Recompute the return type for LAMBDA with body of the form:
5540 { return EXPR ; } */
5543 apply_lambda_return_type (tree lambda, tree return_type)
5545 tree fco = lambda_function (lambda);
5548 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
5550 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5551 it would interfere with instantiating the closure type. */
5552 if (dependent_type_p (return_type))
5554 if (return_type == error_mark_node)
5557 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5558 TREE_TYPE (METHOD_TYPE) == return-type */
5559 TREE_TYPE (TREE_TYPE (fco)) = return_type;
5561 result = DECL_RESULT (fco);
5562 if (result == NULL_TREE)
5565 /* We already have a DECL_RESULT from start_preparsed_function.
5566 Now we need to redo the work it and allocate_struct_function
5567 did to reflect the new type. */
5568 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
5569 TYPE_MAIN_VARIANT (return_type));
5570 DECL_ARTIFICIAL (result) = 1;
5571 DECL_IGNORED_P (result) = 1;
5572 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
5575 DECL_RESULT (fco) = result;
5577 if (!processing_template_decl && aggregate_value_p (result, fco))
5579 #ifdef PCC_STATIC_STRUCT_RETURN
5580 cfun->returns_pcc_struct = 1;
5582 cfun->returns_struct = 1;
5587 /* DECL is a local variable or parameter from the surrounding scope of a
5588 lambda-expression. Returns the decltype for a use of the capture field
5589 for DECL even if it hasn't been captured yet. */
5592 capture_decltype (tree decl)
5594 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
5595 /* FIXME do lookup instead of list walk? */
5596 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
5600 type = TREE_TYPE (TREE_PURPOSE (cap));
5602 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
5605 error ("%qD is not captured", decl);
5606 return error_mark_node;
5609 type = TREE_TYPE (decl);
5610 if (TREE_CODE (type) == REFERENCE_TYPE
5611 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
5612 type = TREE_TYPE (type);
5615 case CPLD_REFERENCE:
5616 type = TREE_TYPE (decl);
5617 if (TREE_CODE (type) != REFERENCE_TYPE)
5618 type = build_reference_type (TREE_TYPE (decl));
5625 if (TREE_CODE (type) != REFERENCE_TYPE)
5627 if (!LAMBDA_EXPR_MUTABLE_P (lam))
5628 type = cp_build_qualified_type (type, (TYPE_QUALS (type)
5630 type = build_reference_type (type);
5635 /* From an ID and INITIALIZER, create a capture (by reference if
5636 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5640 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
5641 bool explicit_init_p)
5646 type = lambda_capture_field_type (initializer);
5649 type = build_reference_type (type);
5650 if (!real_lvalue_p (initializer))
5651 error ("cannot capture %qE by reference", initializer);
5654 /* Make member variable. */
5655 member = build_lang_decl (FIELD_DECL, id, type);
5656 if (!explicit_init_p)
5657 /* Normal captures are invisible to name lookup but uses are replaced
5658 with references to the capture field; we implement this by only
5659 really making them invisible in unevaluated context; see
5660 qualify_lookup. For now, let's make explicitly initialized captures
5662 DECL_NORMAL_CAPTURE_P (member) = true;
5664 /* Add it to the appropriate closure class. */
5665 finish_member_declaration (member);
5667 LAMBDA_EXPR_CAPTURE_LIST (lambda)
5668 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
5670 if (id == get_identifier ("__this"))
5672 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
5673 error ("already captured %<this%> in lambda expression");
5674 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
5680 /* Given a FIELD_DECL decl belonging to a closure type, return a
5681 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5685 thisify_lambda_field (tree decl)
5687 tree context = lambda_function (DECL_CONTEXT (decl));
5688 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
5690 tf_warning_or_error);
5691 return finish_non_static_data_member (decl, object,
5692 /*qualifying_scope*/NULL_TREE);
5695 /* Similar to add_capture, except this works on a stack of nested lambdas.
5696 BY_REFERENCE_P in this case is derived from the default capture mode.
5697 Returns the capture for the lambda at the bottom of the stack. */
5700 add_default_capture (tree lambda_stack, tree id, tree initializer)
5702 bool this_capture_p = (id == get_identifier ("__this"));
5704 tree member = NULL_TREE;
5706 tree saved_class_type = current_class_type;
5710 for (node = lambda_stack;
5712 node = TREE_CHAIN (node))
5714 tree lambda = TREE_VALUE (node);
5716 current_class_type = TREE_TYPE (lambda);
5717 member = add_capture (lambda,
5722 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
5723 == CPLD_REFERENCE)),
5724 /*explicit_init_p=*/false);
5725 initializer = thisify_lambda_field (member);
5728 current_class_type = saved_class_type;
5733 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5734 INDIRECT_REF, possibly adding it through default capturing. */
5737 lambda_expr_this_capture (tree lambda)
5741 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5743 /* Try to default capture 'this' if we can. */
5745 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
5747 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
5748 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
5749 tree init = NULL_TREE;
5751 /* If we are in a lambda function, we can move out until we hit:
5752 1. a non-lambda function,
5753 2. a lambda function capturing 'this', or
5754 3. a non-default capturing lambda function. */
5755 while (LAMBDA_FUNCTION_P (containing_function))
5758 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
5760 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
5762 /* An outer lambda has already captured 'this'. */
5763 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5764 init = thisify_lambda_field (cap);
5768 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
5769 /* An outer lambda won't let us capture 'this'. */
5772 lambda_stack = tree_cons (NULL_TREE,
5776 containing_function = decl_function_context (containing_function);
5779 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
5780 && !LAMBDA_FUNCTION_P (containing_function))
5781 /* First parameter is 'this'. */
5782 init = DECL_ARGUMENTS (containing_function);
5785 this_capture = add_default_capture (lambda_stack,
5786 /*id=*/get_identifier ("__this"),
5792 error ("%<this%> was not captured for this lambda function");
5793 result = error_mark_node;
5797 /* To make sure that current_class_ref is for the lambda. */
5798 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
5800 result = finish_non_static_data_member (this_capture,
5802 /*qualifying_scope=*/NULL_TREE);
5804 /* If 'this' is captured, each use of 'this' is transformed into an
5805 access to the corresponding unnamed data member of the closure
5806 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5807 ensures that the transformed expression is an rvalue. ] */
5808 result = rvalue (result);
5814 /* If the closure TYPE has a static op(), also add a conversion to function
5818 maybe_add_lambda_conv_op (tree type)
5820 bool nested = (current_function_decl != NULL_TREE);
5821 tree callop = lambda_function (type);
5822 tree rettype, name, fntype, fn, body, compound_stmt;
5824 if (!DECL_STATIC_FUNCTION_P (callop))
5827 rettype = build_pointer_type (TREE_TYPE (callop));
5828 name = mangle_conv_op_name_for_type (rettype);
5829 fntype = build_function_type (rettype, void_list_node);
5830 fn = build_lang_decl (FUNCTION_DECL, name, fntype);
5831 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5833 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5834 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5835 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5837 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
5838 grokclassfn (type, fn, NO_SPECIAL);
5839 set_linkage_according_to_type (type, fn);
5840 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5841 DECL_IN_AGGR_P (fn) = 1;
5842 DECL_ARTIFICIAL (fn) = 1;
5843 DECL_NOT_REALLY_EXTERN (fn) = 1;
5844 DECL_DECLARED_INLINE_P (fn) = 1;
5845 DECL_STATIC_FUNCTION_P (fn) = 1;
5847 add_method (type, fn, NULL_TREE);
5850 push_function_context ();
5851 start_preparsed_function (fn, NULL_TREE,
5852 SF_PRE_PARSED | SF_INCLASS_INLINE);
5853 body = begin_function_body ();
5854 compound_stmt = begin_compound_stmt (0);
5856 finish_return_stmt (decay_conversion (callop));
5858 finish_compound_stmt (compound_stmt);
5859 finish_function_body (body);
5861 expand_or_defer_fn (finish_function (2));
5863 pop_function_context ();
5865 #include "gt-cp-semantics.h"