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;
2372 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2373 are passed the same as decimal scalar types. */
2374 if (TREE_CODE (t) == RECORD_TYPE
2375 && !processing_template_decl)
2377 tree ns = TYPE_CONTEXT (t);
2378 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2379 && DECL_CONTEXT (ns) == std_node
2380 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2382 const char *n = TYPE_NAME_STRING (t);
2383 if ((strcmp (n, "decimal32") == 0)
2384 || (strcmp (n, "decimal64") == 0)
2385 || (strcmp (n, "decimal128") == 0))
2386 TYPE_TRANSPARENT_AGGR (t) = 1;
2390 /* A non-implicit typename comes from code like:
2392 template <typename T> struct A {
2393 template <typename U> struct A<T>::B ...
2395 This is erroneous. */
2396 else if (TREE_CODE (t) == TYPENAME_TYPE)
2398 error ("invalid definition of qualified type %qT", t);
2399 t = error_mark_node;
2402 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2404 t = make_class_type (RECORD_TYPE);
2405 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2408 /* Update the location of the decl. */
2409 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2411 if (TYPE_BEING_DEFINED (t))
2413 t = make_class_type (TREE_CODE (t));
2414 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2416 maybe_process_partial_specialization (t);
2418 TYPE_BEING_DEFINED (t) = 1;
2420 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2422 if (flag_pack_struct)
2425 TYPE_PACKED (t) = 1;
2426 /* Even though the type is being defined for the first time
2427 here, there might have been a forward declaration, so there
2428 might be cv-qualified variants of T. */
2429 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2430 TYPE_PACKED (v) = 1;
2432 /* Reset the interface data, at the earliest possible
2433 moment, as it might have been set via a class foo;
2435 if (! TYPE_ANONYMOUS_P (t))
2437 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2438 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2439 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2440 (t, finfo->interface_unknown);
2442 reset_specialization();
2444 /* Make a declaration for this class in its own scope. */
2445 build_self_reference ();
2450 /* Finish the member declaration given by DECL. */
2453 finish_member_declaration (tree decl)
2455 if (decl == error_mark_node || decl == NULL_TREE)
2458 if (decl == void_type_node)
2459 /* The COMPONENT was a friend, not a member, and so there's
2460 nothing for us to do. */
2463 /* We should see only one DECL at a time. */
2464 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2466 /* Set up access control for DECL. */
2468 = (current_access_specifier == access_private_node);
2469 TREE_PROTECTED (decl)
2470 = (current_access_specifier == access_protected_node);
2471 if (TREE_CODE (decl) == TEMPLATE_DECL)
2473 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2474 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2477 /* Mark the DECL as a member of the current class. */
2478 DECL_CONTEXT (decl) = current_class_type;
2480 /* Check for bare parameter packs in the member variable declaration. */
2481 if (TREE_CODE (decl) == FIELD_DECL)
2483 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2484 TREE_TYPE (decl) = error_mark_node;
2485 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2486 DECL_ATTRIBUTES (decl) = NULL_TREE;
2491 A C language linkage is ignored for the names of class members
2492 and the member function type of class member functions. */
2493 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2494 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2496 /* Put functions on the TYPE_METHODS list and everything else on the
2497 TYPE_FIELDS list. Note that these are built up in reverse order.
2498 We reverse them (to obtain declaration order) in finish_struct. */
2499 if (TREE_CODE (decl) == FUNCTION_DECL
2500 || DECL_FUNCTION_TEMPLATE_P (decl))
2502 /* We also need to add this function to the
2503 CLASSTYPE_METHOD_VEC. */
2504 if (add_method (current_class_type, decl, NULL_TREE))
2506 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2507 TYPE_METHODS (current_class_type) = decl;
2509 maybe_add_class_template_decl_list (current_class_type, decl,
2513 /* Enter the DECL into the scope of the class. */
2514 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2515 || pushdecl_class_level (decl))
2517 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2518 go at the beginning. The reason is that lookup_field_1
2519 searches the list in order, and we want a field name to
2520 override a type name so that the "struct stat hack" will
2521 work. In particular:
2523 struct S { enum E { }; int E } s;
2526 is valid. In addition, the FIELD_DECLs must be maintained in
2527 declaration order so that class layout works as expected.
2528 However, we don't need that order until class layout, so we
2529 save a little time by putting FIELD_DECLs on in reverse order
2530 here, and then reversing them in finish_struct_1. (We could
2531 also keep a pointer to the correct insertion points in the
2534 if (TREE_CODE (decl) == TYPE_DECL)
2535 TYPE_FIELDS (current_class_type)
2536 = chainon (TYPE_FIELDS (current_class_type), decl);
2539 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2540 TYPE_FIELDS (current_class_type) = decl;
2543 maybe_add_class_template_decl_list (current_class_type, decl,
2548 note_decl_for_pch (decl);
2551 /* DECL has been declared while we are building a PCH file. Perform
2552 actions that we might normally undertake lazily, but which can be
2553 performed now so that they do not have to be performed in
2554 translation units which include the PCH file. */
2557 note_decl_for_pch (tree decl)
2559 gcc_assert (pch_file);
2561 /* There's a good chance that we'll have to mangle names at some
2562 point, even if only for emission in debugging information. */
2563 if ((TREE_CODE (decl) == VAR_DECL
2564 || TREE_CODE (decl) == FUNCTION_DECL)
2565 && !processing_template_decl)
2569 /* Finish processing a complete template declaration. The PARMS are
2570 the template parameters. */
2573 finish_template_decl (tree parms)
2576 end_template_decl ();
2578 end_specialization ();
2581 /* Finish processing a template-id (which names a type) of the form
2582 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2583 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2584 the scope of template-id indicated. */
2587 finish_template_type (tree name, tree args, int entering_scope)
2591 decl = lookup_template_class (name, args,
2592 NULL_TREE, NULL_TREE, entering_scope,
2593 tf_warning_or_error | tf_user);
2594 if (decl != error_mark_node)
2595 decl = TYPE_STUB_DECL (decl);
2600 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2601 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2602 BASE_CLASS, or NULL_TREE if an error occurred. The
2603 ACCESS_SPECIFIER is one of
2604 access_{default,public,protected_private}_node. For a virtual base
2605 we set TREE_TYPE. */
2608 finish_base_specifier (tree base, tree access, bool virtual_p)
2612 if (base == error_mark_node)
2614 error ("invalid base-class specification");
2617 else if (! MAYBE_CLASS_TYPE_P (base))
2619 error ("%qT is not a class type", base);
2624 if (cp_type_quals (base) != 0)
2626 error ("base class %qT has cv qualifiers", base);
2627 base = TYPE_MAIN_VARIANT (base);
2629 result = build_tree_list (access, base);
2631 TREE_TYPE (result) = integer_type_node;
2637 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2638 what we found when we tried to do the lookup.
2639 LOCATION is the location of the NAME identifier;
2640 The location is used in the error message*/
2643 qualified_name_lookup_error (tree scope, tree name,
2644 tree decl, location_t location)
2646 if (scope == error_mark_node)
2647 ; /* We already complained. */
2648 else if (TYPE_P (scope))
2650 if (!COMPLETE_TYPE_P (scope))
2651 error_at (location, "incomplete type %qT used in nested name specifier",
2653 else if (TREE_CODE (decl) == TREE_LIST)
2655 error_at (location, "reference to %<%T::%D%> is ambiguous",
2657 print_candidates (decl);
2660 error_at (location, "%qD is not a member of %qT", name, scope);
2662 else if (scope != global_namespace)
2663 error_at (location, "%qD is not a member of %qD", name, scope);
2665 error_at (location, "%<::%D%> has not been declared", name);
2668 /* If FNS is a member function, a set of member functions, or a
2669 template-id referring to one or more member functions, return a
2670 BASELINK for FNS, incorporating the current access context.
2671 Otherwise, return FNS unchanged. */
2674 baselink_for_fns (tree fns)
2679 if (BASELINK_P (fns)
2680 || error_operand_p (fns))
2684 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2685 fn = TREE_OPERAND (fn, 0);
2686 fn = get_first_fn (fn);
2687 if (!DECL_FUNCTION_MEMBER_P (fn))
2690 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2692 cl = DECL_CONTEXT (fn);
2693 cl = TYPE_BINFO (cl);
2694 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2697 /* Returns true iff DECL is an automatic variable from a function outside
2701 outer_automatic_var_p (tree decl)
2703 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2704 && DECL_FUNCTION_SCOPE_P (decl)
2705 && !TREE_STATIC (decl)
2706 && DECL_CONTEXT (decl) != current_function_decl);
2709 /* Returns true iff DECL is a capture field from a lambda that is not our
2710 immediate context. */
2713 outer_lambda_capture_p (tree decl)
2715 return (TREE_CODE (decl) == FIELD_DECL
2716 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2717 && (!current_class_type
2718 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2721 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2722 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2723 if non-NULL, is the type or namespace used to explicitly qualify
2724 ID_EXPRESSION. DECL is the entity to which that name has been
2727 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2728 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2729 be set to true if this expression isn't permitted in a
2730 constant-expression, but it is otherwise not set by this function.
2731 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2732 constant-expression, but a non-constant expression is also
2735 DONE is true if this expression is a complete postfix-expression;
2736 it is false if this expression is followed by '->', '[', '(', etc.
2737 ADDRESS_P is true iff this expression is the operand of '&'.
2738 TEMPLATE_P is true iff the qualified-id was of the form
2739 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2740 appears as a template argument.
2742 If an error occurs, and it is the kind of error that might cause
2743 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2744 is the caller's responsibility to issue the message. *ERROR_MSG
2745 will be a string with static storage duration, so the caller need
2748 Return an expression for the entity, after issuing appropriate
2749 diagnostics. This function is also responsible for transforming a
2750 reference to a non-static member into a COMPONENT_REF that makes
2751 the use of "this" explicit.
2753 Upon return, *IDK will be filled in appropriately. */
2755 finish_id_expression (tree id_expression,
2759 bool integral_constant_expression_p,
2760 bool allow_non_integral_constant_expression_p,
2761 bool *non_integral_constant_expression_p,
2765 bool template_arg_p,
2766 const char **error_msg,
2767 location_t location)
2769 /* Initialize the output parameters. */
2770 *idk = CP_ID_KIND_NONE;
2773 if (id_expression == error_mark_node)
2774 return error_mark_node;
2775 /* If we have a template-id, then no further lookup is
2776 required. If the template-id was for a template-class, we
2777 will sometimes have a TYPE_DECL at this point. */
2778 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2779 || TREE_CODE (decl) == TYPE_DECL)
2781 /* Look up the name. */
2784 if (decl == error_mark_node)
2786 /* Name lookup failed. */
2789 || (!dependent_type_p (scope)
2790 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2791 && IDENTIFIER_TYPENAME_P (id_expression)
2792 && dependent_type_p (TREE_TYPE (id_expression))))))
2794 /* If the qualifying type is non-dependent (and the name
2795 does not name a conversion operator to a dependent
2796 type), issue an error. */
2797 qualified_name_lookup_error (scope, id_expression, decl, location);
2798 return error_mark_node;
2802 /* It may be resolved via Koenig lookup. */
2803 *idk = CP_ID_KIND_UNQUALIFIED;
2804 return id_expression;
2807 decl = id_expression;
2809 /* If DECL is a variable that would be out of scope under
2810 ANSI/ISO rules, but in scope in the ARM, name lookup
2811 will succeed. Issue a diagnostic here. */
2813 decl = check_for_out_of_scope_variable (decl);
2815 /* Remember that the name was used in the definition of
2816 the current class so that we can check later to see if
2817 the meaning would have been different after the class
2818 was entirely defined. */
2819 if (!scope && decl != error_mark_node)
2820 maybe_note_name_used_in_class (id_expression, decl);
2822 /* Disallow uses of local variables from containing functions, except
2823 within lambda-expressions. */
2824 if ((outer_automatic_var_p (decl)
2825 || outer_lambda_capture_p (decl))
2826 /* It's not a use (3.2) if we're in an unevaluated context. */
2827 && !cp_unevaluated_operand)
2829 tree context = DECL_CONTEXT (decl);
2830 tree containing_function = current_function_decl;
2831 tree lambda_stack = NULL_TREE;
2832 tree lambda_expr = NULL_TREE;
2833 tree initializer = decl;
2835 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2836 support for an approach in which a reference to a local
2837 [constant] automatic variable in a nested class or lambda body
2838 would enter the expression as an rvalue, which would reduce
2839 the complexity of the problem"
2841 FIXME update for final resolution of core issue 696. */
2842 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2843 return integral_constant_value (decl);
2845 if (TYPE_P (context))
2847 /* Implicit capture of an explicit capture. */
2848 context = lambda_function (context);
2849 initializer = thisify_lambda_field (decl);
2852 /* If we are in a lambda function, we can move out until we hit
2854 2. a non-lambda function, or
2855 3. a non-default capturing lambda function. */
2856 while (context != containing_function
2857 && LAMBDA_FUNCTION_P (containing_function))
2859 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2860 (DECL_CONTEXT (containing_function));
2862 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2866 lambda_stack = tree_cons (NULL_TREE,
2871 = decl_function_context (containing_function);
2874 if (context == containing_function)
2876 decl = add_default_capture (lambda_stack,
2877 /*id=*/DECL_NAME (decl),
2880 else if (lambda_expr)
2882 error ("%qD is not captured", decl);
2883 return error_mark_node;
2887 error (TREE_CODE (decl) == VAR_DECL
2888 ? "use of %<auto%> variable from containing function"
2889 : "use of parameter from containing function");
2890 error (" %q+#D declared here", decl);
2891 return error_mark_node;
2896 /* If we didn't find anything, or what we found was a type,
2897 then this wasn't really an id-expression. */
2898 if (TREE_CODE (decl) == TEMPLATE_DECL
2899 && !DECL_FUNCTION_TEMPLATE_P (decl))
2901 *error_msg = "missing template arguments";
2902 return error_mark_node;
2904 else if (TREE_CODE (decl) == TYPE_DECL
2905 || TREE_CODE (decl) == NAMESPACE_DECL)
2907 *error_msg = "expected primary-expression";
2908 return error_mark_node;
2911 /* If the name resolved to a template parameter, there is no
2912 need to look it up again later. */
2913 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2914 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2918 *idk = CP_ID_KIND_NONE;
2919 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2920 decl = TEMPLATE_PARM_DECL (decl);
2921 r = convert_from_reference (DECL_INITIAL (decl));
2923 if (integral_constant_expression_p
2924 && !dependent_type_p (TREE_TYPE (decl))
2925 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2927 if (!allow_non_integral_constant_expression_p)
2928 error ("template parameter %qD of type %qT is not allowed in "
2929 "an integral constant expression because it is not of "
2930 "integral or enumeration type", decl, TREE_TYPE (decl));
2931 *non_integral_constant_expression_p = true;
2935 /* Similarly, we resolve enumeration constants to their
2936 underlying values. */
2937 else if (TREE_CODE (decl) == CONST_DECL)
2939 *idk = CP_ID_KIND_NONE;
2940 if (!processing_template_decl)
2942 used_types_insert (TREE_TYPE (decl));
2943 return DECL_INITIAL (decl);
2951 /* If the declaration was explicitly qualified indicate
2952 that. The semantics of `A::f(3)' are different than
2953 `f(3)' if `f' is virtual. */
2955 ? CP_ID_KIND_QUALIFIED
2956 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2957 ? CP_ID_KIND_TEMPLATE_ID
2958 : CP_ID_KIND_UNQUALIFIED));
2963 An id-expression is type-dependent if it contains an
2964 identifier that was declared with a dependent type.
2966 The standard is not very specific about an id-expression that
2967 names a set of overloaded functions. What if some of them
2968 have dependent types and some of them do not? Presumably,
2969 such a name should be treated as a dependent name. */
2970 /* Assume the name is not dependent. */
2971 dependent_p = false;
2972 if (!processing_template_decl)
2973 /* No names are dependent outside a template. */
2975 /* A template-id where the name of the template was not resolved
2976 is definitely dependent. */
2977 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2978 && (TREE_CODE (TREE_OPERAND (decl, 0))
2979 == IDENTIFIER_NODE))
2981 /* For anything except an overloaded function, just check its
2983 else if (!is_overloaded_fn (decl))
2985 = dependent_type_p (TREE_TYPE (decl));
2986 /* For a set of overloaded functions, check each of the
2992 if (BASELINK_P (fns))
2993 fns = BASELINK_FUNCTIONS (fns);
2995 /* For a template-id, check to see if the template
2996 arguments are dependent. */
2997 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2999 tree args = TREE_OPERAND (fns, 1);
3000 dependent_p = any_dependent_template_arguments_p (args);
3001 /* The functions are those referred to by the
3003 fns = TREE_OPERAND (fns, 0);
3006 /* If there are no dependent template arguments, go through
3007 the overloaded functions. */
3008 while (fns && !dependent_p)
3010 tree fn = OVL_CURRENT (fns);
3012 /* Member functions of dependent classes are
3014 if (TREE_CODE (fn) == FUNCTION_DECL
3015 && type_dependent_expression_p (fn))
3017 else if (TREE_CODE (fn) == TEMPLATE_DECL
3018 && dependent_template_p (fn))
3021 fns = OVL_NEXT (fns);
3025 /* If the name was dependent on a template parameter, we will
3026 resolve the name at instantiation time. */
3029 /* Create a SCOPE_REF for qualified names, if the scope is
3035 if (address_p && done)
3036 decl = finish_qualified_id_expr (scope, decl,
3042 tree type = NULL_TREE;
3043 if (DECL_P (decl) && !dependent_scope_p (scope))
3044 type = TREE_TYPE (decl);
3045 decl = build_qualified_name (type,
3051 if (TREE_TYPE (decl))
3052 decl = convert_from_reference (decl);
3055 /* A TEMPLATE_ID already contains all the information we
3057 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3058 return id_expression;
3059 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3060 /* If we found a variable, then name lookup during the
3061 instantiation will always resolve to the same VAR_DECL
3062 (or an instantiation thereof). */
3063 if (TREE_CODE (decl) == VAR_DECL
3064 || TREE_CODE (decl) == PARM_DECL)
3065 return convert_from_reference (decl);
3066 /* The same is true for FIELD_DECL, but we also need to
3067 make sure that the syntax is correct. */
3068 else if (TREE_CODE (decl) == FIELD_DECL)
3070 /* Since SCOPE is NULL here, this is an unqualified name.
3071 Access checking has been performed during name lookup
3072 already. Turn off checking to avoid duplicate errors. */
3073 push_deferring_access_checks (dk_no_check);
3074 decl = finish_non_static_data_member
3075 (decl, current_class_ref,
3076 /*qualifying_scope=*/NULL_TREE);
3077 pop_deferring_access_checks ();
3080 return id_expression;
3083 /* Only certain kinds of names are allowed in constant
3084 expression. Enumerators and template parameters have already
3085 been handled above. */
3086 if (integral_constant_expression_p
3087 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
3088 && ! builtin_valid_in_constant_expr_p (decl))
3090 if (!allow_non_integral_constant_expression_p)
3092 error ("%qD cannot appear in a constant-expression", decl);
3093 return error_mark_node;
3095 *non_integral_constant_expression_p = true;
3098 if (TREE_CODE (decl) == NAMESPACE_DECL)
3100 error ("use of namespace %qD as expression", decl);
3101 return error_mark_node;
3103 else if (DECL_CLASS_TEMPLATE_P (decl))
3105 error ("use of class template %qT as expression", decl);
3106 return error_mark_node;
3108 else if (TREE_CODE (decl) == TREE_LIST)
3110 /* Ambiguous reference to base members. */
3111 error ("request for member %qD is ambiguous in "
3112 "multiple inheritance lattice", id_expression);
3113 print_candidates (decl);
3114 return error_mark_node;
3117 /* Mark variable-like entities as used. Functions are similarly
3118 marked either below or after overload resolution. */
3119 if (TREE_CODE (decl) == VAR_DECL
3120 || TREE_CODE (decl) == PARM_DECL
3121 || TREE_CODE (decl) == RESULT_DECL)
3126 decl = (adjust_result_of_qualified_name_lookup
3127 (decl, scope, current_class_type));
3129 if (TREE_CODE (decl) == FUNCTION_DECL)
3132 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3133 decl = finish_qualified_id_expr (scope,
3141 tree r = convert_from_reference (decl);
3143 if (processing_template_decl && TYPE_P (scope))
3144 r = build_qualified_name (TREE_TYPE (r),
3150 else if (TREE_CODE (decl) == FIELD_DECL)
3152 /* Since SCOPE is NULL here, this is an unqualified name.
3153 Access checking has been performed during name lookup
3154 already. Turn off checking to avoid duplicate errors. */
3155 push_deferring_access_checks (dk_no_check);
3156 decl = finish_non_static_data_member (decl, current_class_ref,
3157 /*qualifying_scope=*/NULL_TREE);
3158 pop_deferring_access_checks ();
3160 else if (is_overloaded_fn (decl))
3165 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
3166 first_fn = TREE_OPERAND (first_fn, 0);
3167 first_fn = get_first_fn (first_fn);
3168 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3169 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3171 if (!really_overloaded_fn (decl))
3172 mark_used (first_fn);
3175 && TREE_CODE (first_fn) == FUNCTION_DECL
3176 && DECL_FUNCTION_MEMBER_P (first_fn)
3177 && !shared_member_p (decl))
3179 /* A set of member functions. */
3180 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3181 return finish_class_member_access_expr (decl, id_expression,
3182 /*template_p=*/false,
3183 tf_warning_or_error);
3186 decl = baselink_for_fns (decl);
3190 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3191 && DECL_CLASS_SCOPE_P (decl))
3193 tree context = context_for_name_lookup (decl);
3194 if (context != current_class_type)
3196 tree path = currently_open_derived_class (context);
3197 perform_or_defer_access_check (TYPE_BINFO (path),
3202 decl = convert_from_reference (decl);
3206 if (TREE_DEPRECATED (decl))
3207 warn_deprecated_use (decl, NULL_TREE);
3212 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3213 use as a type-specifier. */
3216 finish_typeof (tree expr)
3220 if (type_dependent_expression_p (expr))
3222 type = cxx_make_type (TYPEOF_TYPE);
3223 TYPEOF_TYPE_EXPR (type) = expr;
3224 SET_TYPE_STRUCTURAL_EQUALITY (type);
3229 type = unlowered_expr_type (expr);
3231 if (!type || type == unknown_type_node)
3233 error ("type of %qE is unknown", expr);
3234 return error_mark_node;
3240 /* Perform C++-specific checks for __builtin_offsetof before calling
3244 finish_offsetof (tree expr)
3246 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3248 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3249 TREE_OPERAND (expr, 2));
3250 return error_mark_node;
3252 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3253 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3254 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3256 if (TREE_CODE (expr) == COMPONENT_REF
3257 || TREE_CODE (expr) == COMPOUND_EXPR)
3258 expr = TREE_OPERAND (expr, 1);
3259 error ("cannot apply %<offsetof%> to member function %qD", expr);
3260 return error_mark_node;
3262 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3263 expr = TREE_OPERAND (expr, 0);
3264 return fold_offsetof (expr, NULL_TREE);
3267 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3268 function is broken out from the above for the benefit of the tree-ssa
3272 simplify_aggr_init_expr (tree *tp)
3274 tree aggr_init_expr = *tp;
3276 /* Form an appropriate CALL_EXPR. */
3277 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3278 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3279 tree type = TREE_TYPE (slot);
3282 enum style_t { ctor, arg, pcc } style;
3284 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3286 #ifdef PCC_STATIC_STRUCT_RETURN
3292 gcc_assert (TREE_ADDRESSABLE (type));
3296 call_expr = build_call_array_loc (input_location,
3297 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3299 aggr_init_expr_nargs (aggr_init_expr),
3300 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3304 /* Replace the first argument to the ctor with the address of the
3306 cxx_mark_addressable (slot);
3307 CALL_EXPR_ARG (call_expr, 0) =
3308 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3310 else if (style == arg)
3312 /* Just mark it addressable here, and leave the rest to
3313 expand_call{,_inline}. */
3314 cxx_mark_addressable (slot);
3315 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3316 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3318 else if (style == pcc)
3320 /* If we're using the non-reentrant PCC calling convention, then we
3321 need to copy the returned value out of the static buffer into the
3323 push_deferring_access_checks (dk_no_check);
3324 call_expr = build_aggr_init (slot, call_expr,
3325 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3326 tf_warning_or_error);
3327 pop_deferring_access_checks ();
3328 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3331 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3333 tree init = build_zero_init (type, NULL_TREE,
3334 /*static_storage_p=*/false);
3335 init = build2 (INIT_EXPR, void_type_node, slot, init);
3336 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3343 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3346 emit_associated_thunks (tree fn)
3348 /* When we use vcall offsets, we emit thunks with the virtual
3349 functions to which they thunk. The whole point of vcall offsets
3350 is so that you can know statically the entire set of thunks that
3351 will ever be needed for a given virtual function, thereby
3352 enabling you to output all the thunks with the function itself. */
3353 if (DECL_VIRTUAL_P (fn)
3354 /* Do not emit thunks for extern template instantiations. */
3355 && ! DECL_REALLY_EXTERN (fn))
3359 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3361 if (!THUNK_ALIAS (thunk))
3363 use_thunk (thunk, /*emit_p=*/1);
3364 if (DECL_RESULT_THUNK_P (thunk))
3368 for (probe = DECL_THUNKS (thunk);
3369 probe; probe = TREE_CHAIN (probe))
3370 use_thunk (probe, /*emit_p=*/1);
3374 gcc_assert (!DECL_THUNKS (thunk));
3379 /* Generate RTL for FN. */
3382 expand_or_defer_fn_1 (tree fn)
3384 /* When the parser calls us after finishing the body of a template
3385 function, we don't really want to expand the body. */
3386 if (processing_template_decl)
3388 /* Normally, collection only occurs in rest_of_compilation. So,
3389 if we don't collect here, we never collect junk generated
3390 during the processing of templates until we hit a
3391 non-template function. It's not safe to do this inside a
3392 nested class, though, as the parser may have local state that
3393 is not a GC root. */
3394 if (!function_depth)
3399 gcc_assert (DECL_SAVED_TREE (fn));
3401 /* If this is a constructor or destructor body, we have to clone
3403 if (maybe_clone_body (fn))
3405 /* We don't want to process FN again, so pretend we've written
3406 it out, even though we haven't. */
3407 TREE_ASM_WRITTEN (fn) = 1;
3408 DECL_SAVED_TREE (fn) = NULL_TREE;
3412 /* We make a decision about linkage for these functions at the end
3413 of the compilation. Until that point, we do not want the back
3414 end to output them -- but we do want it to see the bodies of
3415 these functions so that it can inline them as appropriate. */
3416 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3418 if (DECL_INTERFACE_KNOWN (fn))
3419 /* We've already made a decision as to how this function will
3423 DECL_EXTERNAL (fn) = 1;
3424 DECL_NOT_REALLY_EXTERN (fn) = 1;
3425 note_vague_linkage_fn (fn);
3426 /* A non-template inline function with external linkage will
3427 always be COMDAT. As we must eventually determine the
3428 linkage of all functions, and as that causes writes to
3429 the data mapped in from the PCH file, it's advantageous
3430 to mark the functions at this point. */
3431 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3433 /* This function must have external linkage, as
3434 otherwise DECL_INTERFACE_KNOWN would have been
3436 gcc_assert (TREE_PUBLIC (fn));
3437 comdat_linkage (fn);
3438 DECL_INTERFACE_KNOWN (fn) = 1;
3442 import_export_decl (fn);
3444 /* If the user wants us to keep all inline functions, then mark
3445 this function as needed so that finish_file will make sure to
3446 output it later. Similarly, all dllexport'd functions must
3447 be emitted; there may be callers in other DLLs. */
3448 if ((flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3449 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3453 /* There's no reason to do any of the work here if we're only doing
3454 semantic analysis; this code just generates RTL. */
3455 if (flag_syntax_only)
3462 expand_or_defer_fn (tree fn)
3464 if (expand_or_defer_fn_1 (fn))
3468 /* Expand or defer, at the whim of the compilation unit manager. */
3469 cgraph_finalize_function (fn, function_depth > 1);
3470 emit_associated_thunks (fn);
3483 /* Helper function for walk_tree, used by finalize_nrv below. */
3486 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3488 struct nrv_data *dp = (struct nrv_data *)data;
3491 /* No need to walk into types. There wouldn't be any need to walk into
3492 non-statements, except that we have to consider STMT_EXPRs. */
3495 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3496 but differs from using NULL_TREE in that it indicates that we care
3497 about the value of the RESULT_DECL. */
3498 else if (TREE_CODE (*tp) == RETURN_EXPR)
3499 TREE_OPERAND (*tp, 0) = dp->result;
3500 /* Change all cleanups for the NRV to only run when an exception is
3502 else if (TREE_CODE (*tp) == CLEANUP_STMT
3503 && CLEANUP_DECL (*tp) == dp->var)
3504 CLEANUP_EH_ONLY (*tp) = 1;
3505 /* Replace the DECL_EXPR for the NRV with an initialization of the
3506 RESULT_DECL, if needed. */
3507 else if (TREE_CODE (*tp) == DECL_EXPR
3508 && DECL_EXPR_DECL (*tp) == dp->var)
3511 if (DECL_INITIAL (dp->var)
3512 && DECL_INITIAL (dp->var) != error_mark_node)
3513 init = build2 (INIT_EXPR, void_type_node, dp->result,
3514 DECL_INITIAL (dp->var));
3516 init = build_empty_stmt (EXPR_LOCATION (*tp));
3517 DECL_INITIAL (dp->var) = NULL_TREE;
3518 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3521 /* And replace all uses of the NRV with the RESULT_DECL. */
3522 else if (*tp == dp->var)
3525 /* Avoid walking into the same tree more than once. Unfortunately, we
3526 can't just use walk_tree_without duplicates because it would only call
3527 us for the first occurrence of dp->var in the function body. */
3528 slot = htab_find_slot (dp->visited, *tp, INSERT);
3534 /* Keep iterating. */
3538 /* Called from finish_function to implement the named return value
3539 optimization by overriding all the RETURN_EXPRs and pertinent
3540 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3541 RESULT_DECL for the function. */
3544 finalize_nrv (tree *tp, tree var, tree result)
3546 struct nrv_data data;
3548 /* Copy debugging information from VAR to RESULT. */
3549 DECL_NAME (result) = DECL_NAME (var);
3550 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3551 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3552 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3553 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3554 /* Don't forget that we take its address. */
3555 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3558 data.result = result;
3559 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3560 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3561 htab_delete (data.visited);
3564 /* Return the declaration for the function called by CALL_EXPR T,
3565 TYPE is the class type of the clause decl. */
3568 omp_clause_info_fndecl (tree t, tree type)
3570 tree ret = get_callee_fndecl (t);
3575 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3576 t = CALL_EXPR_FN (t);
3578 if (TREE_CODE (t) == OBJ_TYPE_REF)
3580 t = cp_fold_obj_type_ref (t, type);
3581 if (TREE_CODE (t) == ADDR_EXPR
3582 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3583 return TREE_OPERAND (t, 0);
3589 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3592 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3593 bool need_copy_ctor, bool need_copy_assignment)
3595 int save_errorcount = errorcount;
3598 /* Always allocate 3 elements for simplicity. These are the
3599 function decls for the ctor, dtor, and assignment op.
3600 This layout is known to the three lang hooks,
3601 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3602 and cxx_omp_clause_assign_op. */
3603 info = make_tree_vec (3);
3604 CP_OMP_CLAUSE_INFO (c) = info;
3606 if (need_default_ctor
3607 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3611 if (need_default_ctor)
3615 t = build_int_cst (build_pointer_type (type), 0);
3616 t = build1 (INDIRECT_REF, type, t);
3617 vec = make_tree_vector_single (t);
3619 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3620 &vec, type, LOOKUP_NORMAL,
3621 tf_warning_or_error);
3624 release_tree_vector (vec);
3626 if (targetm.cxx.cdtor_returns_this () || errorcount)
3627 /* Because constructors and destructors return this,
3628 the call will have been cast to "void". Remove the
3629 cast here. We would like to use STRIP_NOPS, but it
3630 wouldn't work here because TYPE_MODE (t) and
3631 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3632 They are VOIDmode and Pmode, respectively. */
3633 if (TREE_CODE (t) == NOP_EXPR)
3634 t = TREE_OPERAND (t, 0);
3636 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3639 if ((need_default_ctor || need_copy_ctor)
3640 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3642 t = build_int_cst (build_pointer_type (type), 0);
3643 t = build1 (INDIRECT_REF, type, t);
3644 t = build_special_member_call (t, complete_dtor_identifier,
3645 NULL, type, LOOKUP_NORMAL,
3646 tf_warning_or_error);
3648 if (targetm.cxx.cdtor_returns_this () || errorcount)
3649 /* Because constructors and destructors return this,
3650 the call will have been cast to "void". Remove the
3651 cast here. We would like to use STRIP_NOPS, but it
3652 wouldn't work here because TYPE_MODE (t) and
3653 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3654 They are VOIDmode and Pmode, respectively. */
3655 if (TREE_CODE (t) == NOP_EXPR)
3656 t = TREE_OPERAND (t, 0);
3658 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3661 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3665 t = build_int_cst (build_pointer_type (type), 0);
3666 t = build1 (INDIRECT_REF, type, t);
3667 vec = make_tree_vector_single (t);
3668 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3669 &vec, type, LOOKUP_NORMAL,
3670 tf_warning_or_error);
3671 release_tree_vector (vec);
3673 /* We'll have called convert_from_reference on the call, which
3674 may well have added an indirect_ref. It's unneeded here,
3675 and in the way, so kill it. */
3676 if (TREE_CODE (t) == INDIRECT_REF)
3677 t = TREE_OPERAND (t, 0);
3679 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3682 return errorcount != save_errorcount;
3685 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3686 Remove any elements from the list that are invalid. */
3689 finish_omp_clauses (tree clauses)
3691 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3692 tree c, t, *pc = &clauses;
3695 bitmap_obstack_initialize (NULL);
3696 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3697 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3698 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3700 for (pc = &clauses, c = clauses; c ; c = *pc)
3702 bool remove = false;
3704 switch (OMP_CLAUSE_CODE (c))
3706 case OMP_CLAUSE_SHARED:
3708 goto check_dup_generic;
3709 case OMP_CLAUSE_PRIVATE:
3711 goto check_dup_generic;
3712 case OMP_CLAUSE_REDUCTION:
3714 goto check_dup_generic;
3715 case OMP_CLAUSE_COPYPRIVATE:
3716 name = "copyprivate";
3717 goto check_dup_generic;
3718 case OMP_CLAUSE_COPYIN:
3720 goto check_dup_generic;
3722 t = OMP_CLAUSE_DECL (c);
3723 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3725 if (processing_template_decl)
3728 error ("%qD is not a variable in clause %qs", t, name);
3730 error ("%qE is not a variable in clause %qs", t, name);
3733 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3734 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3735 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3737 error ("%qD appears more than once in data clauses", t);
3741 bitmap_set_bit (&generic_head, DECL_UID (t));
3744 case OMP_CLAUSE_FIRSTPRIVATE:
3745 t = OMP_CLAUSE_DECL (c);
3746 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3748 if (processing_template_decl)
3751 error ("%qD is not a variable in clause %<firstprivate%>", t);
3753 error ("%qE is not a variable in clause %<firstprivate%>", t);
3756 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3757 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3759 error ("%qD appears more than once in data clauses", t);
3763 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3766 case OMP_CLAUSE_LASTPRIVATE:
3767 t = OMP_CLAUSE_DECL (c);
3768 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3770 if (processing_template_decl)
3773 error ("%qD is not a variable in clause %<lastprivate%>", t);
3775 error ("%qE is not a variable in clause %<lastprivate%>", t);
3778 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3779 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3781 error ("%qD appears more than once in data clauses", t);
3785 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3789 t = OMP_CLAUSE_IF_EXPR (c);
3790 t = maybe_convert_cond (t);
3791 if (t == error_mark_node)
3793 OMP_CLAUSE_IF_EXPR (c) = t;
3796 case OMP_CLAUSE_NUM_THREADS:
3797 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3798 if (t == error_mark_node)
3800 else if (!type_dependent_expression_p (t)
3801 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3803 error ("num_threads expression must be integral");
3808 case OMP_CLAUSE_SCHEDULE:
3809 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3812 else if (t == error_mark_node)
3814 else if (!type_dependent_expression_p (t)
3815 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3817 error ("schedule chunk size expression must be integral");
3822 case OMP_CLAUSE_NOWAIT:
3823 case OMP_CLAUSE_ORDERED:
3824 case OMP_CLAUSE_DEFAULT:
3825 case OMP_CLAUSE_UNTIED:
3826 case OMP_CLAUSE_COLLAPSE:
3834 *pc = OMP_CLAUSE_CHAIN (c);
3836 pc = &OMP_CLAUSE_CHAIN (c);
3839 for (pc = &clauses, c = clauses; c ; c = *pc)
3841 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3842 bool remove = false;
3843 bool need_complete_non_reference = false;
3844 bool need_default_ctor = false;
3845 bool need_copy_ctor = false;
3846 bool need_copy_assignment = false;
3847 bool need_implicitly_determined = false;
3848 tree type, inner_type;
3852 case OMP_CLAUSE_SHARED:
3854 need_implicitly_determined = true;
3856 case OMP_CLAUSE_PRIVATE:
3858 need_complete_non_reference = true;
3859 need_default_ctor = true;
3860 need_implicitly_determined = true;
3862 case OMP_CLAUSE_FIRSTPRIVATE:
3863 name = "firstprivate";
3864 need_complete_non_reference = true;
3865 need_copy_ctor = true;
3866 need_implicitly_determined = true;
3868 case OMP_CLAUSE_LASTPRIVATE:
3869 name = "lastprivate";
3870 need_complete_non_reference = true;
3871 need_copy_assignment = true;
3872 need_implicitly_determined = true;
3874 case OMP_CLAUSE_REDUCTION:
3876 need_implicitly_determined = true;
3878 case OMP_CLAUSE_COPYPRIVATE:
3879 name = "copyprivate";
3880 need_copy_assignment = true;
3882 case OMP_CLAUSE_COPYIN:
3884 need_copy_assignment = true;
3887 pc = &OMP_CLAUSE_CHAIN (c);
3891 t = OMP_CLAUSE_DECL (c);
3892 if (processing_template_decl
3893 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3895 pc = &OMP_CLAUSE_CHAIN (c);
3901 case OMP_CLAUSE_LASTPRIVATE:
3902 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3903 need_default_ctor = true;
3906 case OMP_CLAUSE_REDUCTION:
3907 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3908 || POINTER_TYPE_P (TREE_TYPE (t)))
3910 error ("%qE has invalid type for %<reduction%>", t);
3913 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3915 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3923 error ("%qE has invalid type for %<reduction(%s)%>",
3924 t, operator_name_info[r_code].name);
3930 case OMP_CLAUSE_COPYIN:
3931 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3933 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3942 if (need_complete_non_reference)
3944 t = require_complete_type (t);
3945 if (t == error_mark_node)
3947 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3949 error ("%qE has reference type for %qs", t, name);
3953 if (need_implicitly_determined)
3955 const char *share_name = NULL;
3957 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3958 share_name = "threadprivate";
3959 else switch (cxx_omp_predetermined_sharing (t))
3961 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3963 case OMP_CLAUSE_DEFAULT_SHARED:
3964 share_name = "shared";
3966 case OMP_CLAUSE_DEFAULT_PRIVATE:
3967 share_name = "private";
3974 error ("%qE is predetermined %qs for %qs",
3975 t, share_name, name);
3980 /* We're interested in the base element, not arrays. */
3981 inner_type = type = TREE_TYPE (t);
3982 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3983 inner_type = TREE_TYPE (inner_type);
3985 /* Check for special function availability by building a call to one.
3986 Save the results, because later we won't be in the right context
3987 for making these queries. */
3988 if (CLASS_TYPE_P (inner_type)
3989 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3990 && !type_dependent_expression_p (t)
3991 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3992 need_copy_ctor, need_copy_assignment))
3996 *pc = OMP_CLAUSE_CHAIN (c);
3998 pc = &OMP_CLAUSE_CHAIN (c);
4001 bitmap_obstack_release (NULL);
4005 /* For all variables in the tree_list VARS, mark them as thread local. */
4008 finish_omp_threadprivate (tree vars)
4012 /* Mark every variable in VARS to be assigned thread local storage. */
4013 for (t = vars; t; t = TREE_CHAIN (t))
4015 tree v = TREE_PURPOSE (t);
4017 if (error_operand_p (v))
4019 else if (TREE_CODE (v) != VAR_DECL)
4020 error ("%<threadprivate%> %qD is not file, namespace "
4021 "or block scope variable", v);
4022 /* If V had already been marked threadprivate, it doesn't matter
4023 whether it had been used prior to this point. */
4024 else if (TREE_USED (v)
4025 && (DECL_LANG_SPECIFIC (v) == NULL
4026 || !CP_DECL_THREADPRIVATE_P (v)))
4027 error ("%qE declared %<threadprivate%> after first use", v);
4028 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4029 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4030 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
4031 error ("%<threadprivate%> %qE has incomplete type", v);
4032 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4033 && CP_DECL_CONTEXT (v) != current_class_type)
4034 error ("%<threadprivate%> %qE directive not "
4035 "in %qT definition", v, CP_DECL_CONTEXT (v));
4038 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4039 if (DECL_LANG_SPECIFIC (v) == NULL)
4041 retrofit_lang_decl (v);
4043 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4044 after the allocation of the lang_decl structure. */
4045 if (DECL_DISCRIMINATOR_P (v))
4046 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4049 if (! DECL_THREAD_LOCAL_P (v))
4051 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4052 /* If rtl has been already set for this var, call
4053 make_decl_rtl once again, so that encode_section_info
4054 has a chance to look at the new decl flags. */
4055 if (DECL_RTL_SET_P (v))
4058 CP_DECL_THREADPRIVATE_P (v) = 1;
4063 /* Build an OpenMP structured block. */
4066 begin_omp_structured_block (void)
4068 return do_pushlevel (sk_omp);
4072 finish_omp_structured_block (tree block)
4074 return do_poplevel (block);
4077 /* Similarly, except force the retention of the BLOCK. */
4080 begin_omp_parallel (void)
4082 keep_next_level (true);
4083 return begin_omp_structured_block ();
4087 finish_omp_parallel (tree clauses, tree body)
4091 body = finish_omp_structured_block (body);
4093 stmt = make_node (OMP_PARALLEL);
4094 TREE_TYPE (stmt) = void_type_node;
4095 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4096 OMP_PARALLEL_BODY (stmt) = body;
4098 return add_stmt (stmt);
4102 begin_omp_task (void)
4104 keep_next_level (true);
4105 return begin_omp_structured_block ();
4109 finish_omp_task (tree clauses, tree body)
4113 body = finish_omp_structured_block (body);
4115 stmt = make_node (OMP_TASK);
4116 TREE_TYPE (stmt) = void_type_node;
4117 OMP_TASK_CLAUSES (stmt) = clauses;
4118 OMP_TASK_BODY (stmt) = body;
4120 return add_stmt (stmt);
4123 /* Helper function for finish_omp_for. Convert Ith random access iterator
4124 into integral iterator. Return FALSE if successful. */
4127 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4128 tree condv, tree incrv, tree *body,
4129 tree *pre_body, tree clauses)
4131 tree diff, iter_init, iter_incr = NULL, last;
4132 tree incr_var = NULL, orig_pre_body, orig_body, c;
4133 tree decl = TREE_VEC_ELT (declv, i);
4134 tree init = TREE_VEC_ELT (initv, i);
4135 tree cond = TREE_VEC_ELT (condv, i);
4136 tree incr = TREE_VEC_ELT (incrv, i);
4138 location_t elocus = locus;
4140 if (init && EXPR_HAS_LOCATION (init))
4141 elocus = EXPR_LOCATION (init);
4143 switch (TREE_CODE (cond))
4149 if (TREE_OPERAND (cond, 1) == iter)
4150 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4151 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4152 if (TREE_OPERAND (cond, 0) != iter)
4153 cond = error_mark_node;
4156 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4157 TREE_OPERAND (cond, 1), ERROR_MARK,
4158 NULL, tf_warning_or_error);
4159 if (error_operand_p (tem))
4164 cond = error_mark_node;
4167 if (cond == error_mark_node)
4169 error_at (elocus, "invalid controlling predicate");
4172 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4173 ERROR_MARK, iter, ERROR_MARK, NULL,
4174 tf_warning_or_error);
4175 if (error_operand_p (diff))
4177 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4179 error_at (elocus, "difference between %qE and %qD does not have integer type",
4180 TREE_OPERAND (cond, 1), iter);
4184 switch (TREE_CODE (incr))
4186 case PREINCREMENT_EXPR:
4187 case PREDECREMENT_EXPR:
4188 case POSTINCREMENT_EXPR:
4189 case POSTDECREMENT_EXPR:
4190 if (TREE_OPERAND (incr, 0) != iter)
4192 incr = error_mark_node;
4195 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4196 tf_warning_or_error);
4197 if (error_operand_p (iter_incr))
4199 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4200 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4201 incr = integer_one_node;
4203 incr = integer_minus_one_node;
4206 if (TREE_OPERAND (incr, 0) != iter)
4207 incr = error_mark_node;
4208 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4209 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4211 tree rhs = TREE_OPERAND (incr, 1);
4212 if (TREE_OPERAND (rhs, 0) == iter)
4214 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4216 incr = error_mark_node;
4219 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4220 TREE_OPERAND (rhs, 1),
4221 tf_warning_or_error);
4222 if (error_operand_p (iter_incr))
4224 incr = TREE_OPERAND (rhs, 1);
4225 incr = cp_convert (TREE_TYPE (diff), incr);
4226 if (TREE_CODE (rhs) == MINUS_EXPR)
4228 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4229 incr = fold_if_not_in_template (incr);
4231 if (TREE_CODE (incr) != INTEGER_CST
4232 && (TREE_CODE (incr) != NOP_EXPR
4233 || (TREE_CODE (TREE_OPERAND (incr, 0))
4238 else if (TREE_OPERAND (rhs, 1) == iter)
4240 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4241 || TREE_CODE (rhs) != PLUS_EXPR)
4242 incr = error_mark_node;
4245 iter_incr = build_x_binary_op (PLUS_EXPR,
4246 TREE_OPERAND (rhs, 0),
4249 tf_warning_or_error);
4250 if (error_operand_p (iter_incr))
4252 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4254 tf_warning_or_error);
4255 if (error_operand_p (iter_incr))
4257 incr = TREE_OPERAND (rhs, 0);
4262 incr = error_mark_node;
4265 incr = error_mark_node;
4268 incr = error_mark_node;
4272 if (incr == error_mark_node)
4274 error_at (elocus, "invalid increment expression");
4278 incr = cp_convert (TREE_TYPE (diff), incr);
4279 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4280 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4281 && OMP_CLAUSE_DECL (c) == iter)
4284 decl = create_temporary_var (TREE_TYPE (diff));
4286 add_decl_expr (decl);
4287 last = create_temporary_var (TREE_TYPE (diff));
4289 add_decl_expr (last);
4290 if (c && iter_incr == NULL)
4292 incr_var = create_temporary_var (TREE_TYPE (diff));
4293 pushdecl (incr_var);
4294 add_decl_expr (incr_var);
4296 gcc_assert (stmts_are_full_exprs_p ());
4298 orig_pre_body = *pre_body;
4299 *pre_body = push_stmt_list ();
4301 add_stmt (orig_pre_body);
4303 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4304 tf_warning_or_error));
4305 init = build_int_cst (TREE_TYPE (diff), 0);
4306 if (c && iter_incr == NULL)
4308 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4309 incr, tf_warning_or_error));
4311 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4312 tf_warning_or_error);
4314 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4315 tf_warning_or_error));
4316 *pre_body = pop_stmt_list (*pre_body);
4318 cond = cp_build_binary_op (elocus,
4319 TREE_CODE (cond), decl, diff,
4320 tf_warning_or_error);
4321 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4322 elocus, incr, NULL_TREE);
4325 *body = push_stmt_list ();
4326 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4327 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4328 tf_warning_or_error);
4329 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4330 finish_expr_stmt (iter_init);
4331 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4332 tf_warning_or_error));
4333 add_stmt (orig_body);
4334 *body = pop_stmt_list (*body);
4338 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4339 finish_expr_stmt (iter_incr);
4340 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4341 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4344 TREE_VEC_ELT (declv, i) = decl;
4345 TREE_VEC_ELT (initv, i) = init;
4346 TREE_VEC_ELT (condv, i) = cond;
4347 TREE_VEC_ELT (incrv, i) = incr;
4352 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4353 are directly for their associated operands in the statement. DECL
4354 and INIT are a combo; if DECL is NULL then INIT ought to be a
4355 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4356 optional statements that need to go before the loop into its
4360 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4361 tree incrv, tree body, tree pre_body, tree clauses)
4363 tree omp_for = NULL, orig_incr = NULL;
4364 tree decl, init, cond, incr;
4368 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4369 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4370 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4371 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4373 decl = TREE_VEC_ELT (declv, i);
4374 init = TREE_VEC_ELT (initv, i);
4375 cond = TREE_VEC_ELT (condv, i);
4376 incr = TREE_VEC_ELT (incrv, i);
4382 switch (TREE_CODE (init))
4385 decl = TREE_OPERAND (init, 0);
4386 init = TREE_OPERAND (init, 1);
4389 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4391 decl = TREE_OPERAND (init, 0);
4392 init = TREE_OPERAND (init, 2);
4402 "expected iteration declaration or initialization");
4407 if (init && EXPR_HAS_LOCATION (init))
4408 elocus = EXPR_LOCATION (init);
4412 error_at (elocus, "missing controlling predicate");
4418 error_at (elocus, "missing increment expression");
4422 TREE_VEC_ELT (declv, i) = decl;
4423 TREE_VEC_ELT (initv, i) = init;
4426 if (dependent_omp_for_p (declv, initv, condv, incrv))
4430 stmt = make_node (OMP_FOR);
4432 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4434 /* This is really just a place-holder. We'll be decomposing this
4435 again and going through the cp_build_modify_expr path below when
4436 we instantiate the thing. */
4437 TREE_VEC_ELT (initv, i)
4438 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4439 TREE_VEC_ELT (initv, i));
4442 TREE_TYPE (stmt) = void_type_node;
4443 OMP_FOR_INIT (stmt) = initv;
4444 OMP_FOR_COND (stmt) = condv;
4445 OMP_FOR_INCR (stmt) = incrv;
4446 OMP_FOR_BODY (stmt) = body;
4447 OMP_FOR_PRE_BODY (stmt) = pre_body;
4448 OMP_FOR_CLAUSES (stmt) = clauses;
4450 SET_EXPR_LOCATION (stmt, locus);
4451 return add_stmt (stmt);
4454 if (processing_template_decl)
4455 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4457 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4459 decl = TREE_VEC_ELT (declv, i);
4460 init = TREE_VEC_ELT (initv, i);
4461 cond = TREE_VEC_ELT (condv, i);
4462 incr = TREE_VEC_ELT (incrv, i);
4464 TREE_VEC_ELT (orig_incr, i) = incr;
4467 if (init && EXPR_HAS_LOCATION (init))
4468 elocus = EXPR_LOCATION (init);
4472 error_at (elocus, "expected iteration declaration or initialization");
4476 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4479 TREE_VEC_ELT (orig_incr, i) = incr;
4480 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4481 TREE_CODE (TREE_OPERAND (incr, 1)),
4482 TREE_OPERAND (incr, 2),
4483 tf_warning_or_error);
4486 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4488 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4489 incrv, &body, &pre_body, clauses))
4494 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4495 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4497 error_at (elocus, "invalid type for iteration variable %qE", decl);
4501 if (!processing_template_decl)
4503 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4504 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4507 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4509 && TREE_SIDE_EFFECTS (cond)
4510 && COMPARISON_CLASS_P (cond)
4511 && !processing_template_decl)
4513 tree t = TREE_OPERAND (cond, 0);
4514 if (TREE_SIDE_EFFECTS (t)
4516 && (TREE_CODE (t) != NOP_EXPR
4517 || TREE_OPERAND (t, 0) != decl))
4518 TREE_OPERAND (cond, 0)
4519 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4521 t = TREE_OPERAND (cond, 1);
4522 if (TREE_SIDE_EFFECTS (t)
4524 && (TREE_CODE (t) != NOP_EXPR
4525 || TREE_OPERAND (t, 0) != decl))
4526 TREE_OPERAND (cond, 1)
4527 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4529 if (decl == error_mark_node || init == error_mark_node)
4532 TREE_VEC_ELT (declv, i) = decl;
4533 TREE_VEC_ELT (initv, i) = init;
4534 TREE_VEC_ELT (condv, i) = cond;
4535 TREE_VEC_ELT (incrv, i) = incr;
4539 if (IS_EMPTY_STMT (pre_body))
4542 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4545 if (omp_for == NULL)
4548 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4550 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4551 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4553 if (TREE_CODE (incr) != MODIFY_EXPR)
4556 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4557 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4558 && !processing_template_decl)
4560 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4561 if (TREE_SIDE_EFFECTS (t)
4563 && (TREE_CODE (t) != NOP_EXPR
4564 || TREE_OPERAND (t, 0) != decl))
4565 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4566 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4568 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4569 if (TREE_SIDE_EFFECTS (t)
4571 && (TREE_CODE (t) != NOP_EXPR
4572 || TREE_OPERAND (t, 0) != decl))
4573 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4574 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4578 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4580 if (omp_for != NULL)
4581 OMP_FOR_CLAUSES (omp_for) = clauses;
4586 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4595 dependent_p = false;
4598 /* Even in a template, we can detect invalid uses of the atomic
4599 pragma if neither LHS nor RHS is type-dependent. */
4600 if (processing_template_decl)
4602 dependent_p = (type_dependent_expression_p (lhs)
4603 || type_dependent_expression_p (rhs));
4606 lhs = build_non_dependent_expr (lhs);
4607 rhs = build_non_dependent_expr (rhs);
4612 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4613 if (stmt == error_mark_node)
4616 if (processing_template_decl)
4617 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4618 build2 (code, void_type_node, orig_lhs, orig_rhs));
4623 finish_omp_barrier (void)
4625 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4626 VEC(tree,gc) *vec = make_tree_vector ();
4627 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4628 release_tree_vector (vec);
4629 finish_expr_stmt (stmt);
4633 finish_omp_flush (void)
4635 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4636 VEC(tree,gc) *vec = make_tree_vector ();
4637 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4638 release_tree_vector (vec);
4639 finish_expr_stmt (stmt);
4643 finish_omp_taskwait (void)
4645 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4646 VEC(tree,gc) *vec = make_tree_vector ();
4647 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4648 release_tree_vector (vec);
4649 finish_expr_stmt (stmt);
4653 init_cp_semantics (void)
4657 /* Build a STATIC_ASSERT for a static assertion with the condition
4658 CONDITION and the message text MESSAGE. LOCATION is the location
4659 of the static assertion in the source code. When MEMBER_P, this
4660 static assertion is a member of a class. */
4662 finish_static_assert (tree condition, tree message, location_t location,
4665 if (check_for_bare_parameter_packs (condition))
4666 condition = error_mark_node;
4668 if (type_dependent_expression_p (condition)
4669 || value_dependent_expression_p (condition))
4671 /* We're in a template; build a STATIC_ASSERT and put it in
4675 assertion = make_node (STATIC_ASSERT);
4676 STATIC_ASSERT_CONDITION (assertion) = condition;
4677 STATIC_ASSERT_MESSAGE (assertion) = message;
4678 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4681 maybe_add_class_template_decl_list (current_class_type,
4685 add_stmt (assertion);
4690 /* Fold the expression and convert it to a boolean value. */
4691 condition = fold_non_dependent_expr (condition);
4692 condition = cp_convert (boolean_type_node, condition);
4694 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4695 /* Do nothing; the condition is satisfied. */
4699 location_t saved_loc = input_location;
4701 input_location = location;
4702 if (TREE_CODE (condition) == INTEGER_CST
4703 && integer_zerop (condition))
4704 /* Report the error. */
4705 error ("static assertion failed: %E", message);
4706 else if (condition && condition != error_mark_node)
4707 error ("non-constant condition for static assertion");
4708 input_location = saved_loc;
4712 /* Returns the type of EXPR for cases where we can determine it even though
4713 EXPR is a type-dependent expression. */
4716 describable_type (tree expr)
4718 tree type = NULL_TREE;
4720 if (! type_dependent_expression_p (expr)
4721 && ! type_unknown_p (expr))
4723 type = unlowered_expr_type (expr);
4724 if (real_lvalue_p (expr))
4725 type = build_reference_type (type);
4731 switch (TREE_CODE (expr))
4737 return TREE_TYPE (expr);
4742 case TEMPLATE_PARM_INDEX:
4744 case STATIC_CAST_EXPR:
4745 case REINTERPRET_CAST_EXPR:
4746 case CONST_CAST_EXPR:
4747 case DYNAMIC_CAST_EXPR:
4748 type = TREE_TYPE (expr);
4753 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4754 if (ptrtype && POINTER_TYPE_P (ptrtype))
4755 type = build_reference_type (TREE_TYPE (ptrtype));
4760 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4761 type = TREE_TYPE (expr);
4765 if (type && type_uses_auto (type))
4771 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4772 suitable for use as a type-specifier.
4774 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4775 id-expression or a class member access, FALSE when it was parsed as
4776 a full expression. */
4779 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4781 tree orig_expr = expr;
4782 tree type = NULL_TREE;
4784 if (!expr || error_operand_p (expr))
4785 return error_mark_node;
4788 || TREE_CODE (expr) == TYPE_DECL
4789 || (TREE_CODE (expr) == BIT_NOT_EXPR
4790 && TYPE_P (TREE_OPERAND (expr, 0))))
4792 error ("argument to decltype must be an expression");
4793 return error_mark_node;
4796 if (type_dependent_expression_p (expr)
4797 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4798 if it isn't dependent, so that we can check access control at
4799 instantiation time, so defer the decltype as well (PR 42277). */
4800 || (id_expression_or_member_access_p
4801 && processing_template_decl
4802 && TREE_CODE (expr) == COMPONENT_REF))
4804 if (id_expression_or_member_access_p)
4806 switch (TREE_CODE (expr))
4813 case TEMPLATE_PARM_INDEX:
4814 type = TREE_TYPE (expr);
4822 if (type && !type_uses_auto (type))
4826 type = cxx_make_type (DECLTYPE_TYPE);
4827 DECLTYPE_TYPE_EXPR (type) = expr;
4828 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4829 = id_expression_or_member_access_p;
4830 SET_TYPE_STRUCTURAL_EQUALITY (type);
4835 /* The type denoted by decltype(e) is defined as follows: */
4837 expr = resolve_nondeduced_context (expr);
4838 if (id_expression_or_member_access_p)
4840 /* If e is an id-expression or a class member access (5.2.5
4841 [expr.ref]), decltype(e) is defined as the type of the entity
4842 named by e. If there is no such entity, or e names a set of
4843 overloaded functions, the program is ill-formed. */
4844 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4845 expr = lookup_name (expr);
4847 if (TREE_CODE (expr) == INDIRECT_REF)
4848 /* This can happen when the expression is, e.g., "a.b". Just
4849 look at the underlying operand. */
4850 expr = TREE_OPERAND (expr, 0);
4852 if (TREE_CODE (expr) == OFFSET_REF
4853 || TREE_CODE (expr) == MEMBER_REF)
4854 /* We're only interested in the field itself. If it is a
4855 BASELINK, we will need to see through it in the next
4857 expr = TREE_OPERAND (expr, 1);
4859 if (TREE_CODE (expr) == BASELINK)
4860 /* See through BASELINK nodes to the underlying functions. */
4861 expr = BASELINK_FUNCTIONS (expr);
4863 if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
4864 expr = TREE_OPERAND (expr, 0);
4866 if (TREE_CODE (expr) == OVERLOAD)
4868 if (OVL_CHAIN (expr)
4869 || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL)
4871 error ("%qE refers to a set of overloaded functions", orig_expr);
4872 return error_mark_node;
4875 /* An overload set containing only one function: just look
4876 at that function. */
4877 expr = OVL_FUNCTION (expr);
4880 switch (TREE_CODE (expr))
4883 if (DECL_BIT_FIELD_TYPE (expr))
4885 type = DECL_BIT_FIELD_TYPE (expr);
4888 /* Fall through for fields that aren't bitfields. */
4895 case TEMPLATE_PARM_INDEX:
4896 type = TREE_TYPE (expr);
4900 type = error_mark_node;
4904 type = is_bitfield_expr_with_lowered_type (expr);
4906 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4913 /* We can get here when the id-expression refers to an
4915 type = TREE_TYPE (expr);
4919 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4920 || TREE_CODE (expr) == SCOPE_REF);
4921 error ("argument to decltype must be an expression");
4922 return error_mark_node;
4927 /* Expressions of reference type are sometimes wrapped in
4928 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4929 representation, not part of the language, so we have to look
4931 if (TREE_CODE (expr) == INDIRECT_REF
4932 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4934 expr = TREE_OPERAND (expr, 0);
4936 if (TREE_CODE (expr) == CALL_EXPR)
4938 /* If e is a function call (5.2.2 [expr.call]) or an
4939 invocation of an overloaded operator (parentheses around e
4940 are ignored), decltype(e) is defined as the return type of
4942 tree fndecl = get_callee_fndecl (expr);
4943 if (fndecl && fndecl != error_mark_node)
4944 type = TREE_TYPE (TREE_TYPE (fndecl));
4947 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4948 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4949 || TREE_CODE (target_type) == POINTER_TYPE)
4950 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4951 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4952 type = TREE_TYPE (TREE_TYPE (target_type));
4953 else if (processing_template_decl)
4954 /* Within a template finish_call_expr doesn't resolve
4955 CALL_EXPR_FN, so even though this decltype isn't really
4956 dependent let's defer resolving it. */
4957 goto treat_as_dependent;
4959 sorry ("unable to determine the declared type of expression %<%E%>",
4965 type = is_bitfield_expr_with_lowered_type (expr);
4968 /* Bitfields are special, because their type encodes the
4969 number of bits they store. If the expression referenced a
4970 bitfield, TYPE now has the declared type of that
4972 type = cp_build_qualified_type (type,
4973 cp_type_quals (TREE_TYPE (expr)));
4975 if (real_lvalue_p (expr))
4976 type = build_reference_type (type);
4978 /* Within a lambda-expression:
4980 Every occurrence of decltype((x)) where x is a possibly
4981 parenthesized id-expression that names an entity of
4982 automatic storage duration is treated as if x were
4983 transformed into an access to a corresponding data member
4984 of the closure type that would have been declared if x
4985 were a use of the denoted entity. */
4986 else if (outer_automatic_var_p (expr)
4987 && current_function_decl
4988 && LAMBDA_FUNCTION_P (current_function_decl))
4989 type = capture_decltype (expr);
4992 /* Otherwise, where T is the type of e, if e is an lvalue,
4993 decltype(e) is defined as T&, otherwise decltype(e) is
4995 type = TREE_TYPE (expr);
4996 if (type == error_mark_node)
4997 return error_mark_node;
4998 else if (expr == current_class_ptr)
4999 /* If the expression is just "this", we want the
5000 cv-unqualified pointer for the "this" type. */
5001 type = TYPE_MAIN_VARIANT (type);
5002 else if (real_lvalue_p (expr))
5004 if (TREE_CODE (type) != REFERENCE_TYPE)
5005 type = build_reference_type (type);
5008 type = non_reference (type);
5013 if (!type || type == unknown_type_node)
5015 error ("type of %qE is unknown", expr);
5016 return error_mark_node;
5022 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5023 __has_nothrow_copy, depending on assign_p. */
5026 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5033 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5036 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5038 else if (TYPE_HAS_INIT_REF (type))
5040 /* If construction of the copy constructor was postponed, create
5042 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5043 lazily_declare_fn (sfk_copy_constructor, type);
5044 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5045 lazily_declare_fn (sfk_move_constructor, type);
5046 fns = CLASSTYPE_CONSTRUCTORS (type);
5051 for (; fns; fns = OVL_NEXT (fns))
5053 tree fn = OVL_CURRENT (fns);
5057 if (copy_fn_p (fn) == 0)
5060 else if (copy_fn_p (fn) <= 0)
5063 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5070 /* Actually evaluates the trait. */
5073 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5075 enum tree_code type_code1;
5078 type_code1 = TREE_CODE (type1);
5082 case CPTK_HAS_NOTHROW_ASSIGN:
5083 type1 = strip_array_types (type1);
5084 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5085 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5086 || (CLASS_TYPE_P (type1)
5087 && classtype_has_nothrow_assign_or_copy_p (type1,
5090 case CPTK_HAS_TRIVIAL_ASSIGN:
5091 /* ??? The standard seems to be missing the "or array of such a class
5092 type" wording for this trait. */
5093 type1 = strip_array_types (type1);
5094 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5095 && (trivial_type_p (type1)
5096 || (CLASS_TYPE_P (type1)
5097 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
5099 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5100 type1 = strip_array_types (type1);
5101 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5102 || (CLASS_TYPE_P (type1)
5103 && (t = locate_ctor (type1, NULL))
5104 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5106 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5107 type1 = strip_array_types (type1);
5108 return (trivial_type_p (type1)
5109 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5111 case CPTK_HAS_NOTHROW_COPY:
5112 type1 = strip_array_types (type1);
5113 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5114 || (CLASS_TYPE_P (type1)
5115 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5117 case CPTK_HAS_TRIVIAL_COPY:
5118 /* ??? The standard seems to be missing the "or array of such a class
5119 type" wording for this trait. */
5120 type1 = strip_array_types (type1);
5121 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5122 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
5124 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5125 type1 = strip_array_types (type1);
5126 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5127 || (CLASS_TYPE_P (type1)
5128 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5130 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5131 return (CLASS_TYPE_P (type1)
5132 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
5134 case CPTK_IS_ABSTRACT:
5135 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5137 case CPTK_IS_BASE_OF:
5138 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5139 && DERIVED_FROM_P (type1, type2));
5142 return (NON_UNION_CLASS_TYPE_P (type1));
5144 case CPTK_IS_CONVERTIBLE_TO:
5149 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5152 return (type_code1 == ENUMERAL_TYPE);
5155 return (pod_type_p (type1));
5157 case CPTK_IS_POLYMORPHIC:
5158 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5160 case CPTK_IS_STD_LAYOUT:
5161 return (std_layout_type_p (type1));
5163 case CPTK_IS_TRIVIAL:
5164 return (trivial_type_p (type1));
5167 return (type_code1 == UNION_TYPE);
5175 /* Returns true if TYPE is a complete type, an array of unknown bound,
5176 or (possibly cv-qualified) void, returns false otherwise. */
5179 check_trait_type (tree type)
5181 if (COMPLETE_TYPE_P (type))
5184 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
5187 if (VOID_TYPE_P (type))
5193 /* Process a trait expression. */
5196 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5198 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5199 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5200 || kind == CPTK_HAS_NOTHROW_COPY
5201 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5202 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5203 || kind == CPTK_HAS_TRIVIAL_COPY
5204 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5205 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5206 || kind == CPTK_IS_ABSTRACT
5207 || kind == CPTK_IS_BASE_OF
5208 || kind == CPTK_IS_CLASS
5209 || kind == CPTK_IS_CONVERTIBLE_TO
5210 || kind == CPTK_IS_EMPTY
5211 || kind == CPTK_IS_ENUM
5212 || kind == CPTK_IS_POD
5213 || kind == CPTK_IS_POLYMORPHIC
5214 || kind == CPTK_IS_STD_LAYOUT
5215 || kind == CPTK_IS_TRIVIAL
5216 || kind == CPTK_IS_UNION);
5218 if (kind == CPTK_IS_CONVERTIBLE_TO)
5220 sorry ("__is_convertible_to");
5221 return error_mark_node;
5224 if (type1 == error_mark_node
5225 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5226 && type2 == error_mark_node))
5227 return error_mark_node;
5229 if (processing_template_decl)
5231 tree trait_expr = make_node (TRAIT_EXPR);
5232 TREE_TYPE (trait_expr) = boolean_type_node;
5233 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5234 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5235 TRAIT_EXPR_KIND (trait_expr) = kind;
5239 complete_type (type1);
5241 complete_type (type2);
5245 case CPTK_HAS_NOTHROW_ASSIGN:
5246 case CPTK_HAS_TRIVIAL_ASSIGN:
5247 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5248 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5249 case CPTK_HAS_NOTHROW_COPY:
5250 case CPTK_HAS_TRIVIAL_COPY:
5251 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5252 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5253 case CPTK_IS_ABSTRACT:
5256 case CPTK_IS_POLYMORPHIC:
5257 case CPTK_IS_STD_LAYOUT:
5258 case CPTK_IS_TRIVIAL:
5259 if (!check_trait_type (type1))
5261 error ("incomplete type %qT not allowed", type1);
5262 return error_mark_node;
5266 case CPTK_IS_BASE_OF:
5267 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5268 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5269 && !COMPLETE_TYPE_P (type2))
5271 error ("incomplete type %qT not allowed", type2);
5272 return error_mark_node;
5281 case CPTK_IS_CONVERTIBLE_TO:
5286 return (trait_expr_value (kind, type1, type2)
5287 ? boolean_true_node : boolean_false_node);
5290 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5291 which is ignored for C++. */
5294 set_float_const_decimal64 (void)
5299 clear_float_const_decimal64 (void)
5304 float_const_decimal64_p (void)
5309 /* Return true if T is a literal type. */
5312 literal_type_p (tree t)
5314 if (SCALAR_TYPE_P (t))
5316 if (CLASS_TYPE_P (t))
5317 return CLASSTYPE_LITERAL_P (t);
5318 if (TREE_CODE (t) == ARRAY_TYPE)
5319 return literal_type_p (strip_array_types (t));
5324 /* If DECL is a variable declared `constexpr', require its type
5325 be literal. Return the DECL if OK, otherwise NULL. */
5328 ensure_literal_type_for_constexpr_object (tree decl)
5330 tree type = TREE_TYPE (decl);
5331 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5332 && !processing_template_decl && !literal_type_p (type))
5334 error ("the type %qT of constexpr variable %qD is not literal",
5341 /* Return non-null if FUN certainly designates a valid constexpr function
5342 declaration. Otherwise return NULL. Issue appropriate diagnostics
5343 if necessary. Note that we only check the declaration, not the body
5347 validate_constexpr_fundecl (tree fun)
5349 tree rettype = NULL;
5352 /* Don't bother if FUN is not marked constexpr. */
5353 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5356 /* For a function template, we have absolutely no guarantee that all
5357 instantiations will be constexpr. */
5358 if (TREE_CODE (fun) == TEMPLATE_DECL)
5361 parm = FUNCTION_FIRST_USER_PARM (fun);
5362 for (; parm != NULL; parm = TREE_CHAIN (parm))
5364 tree type = TREE_TYPE (parm);
5365 if (dependent_type_p (type))
5367 if (!literal_type_p (type))
5369 error ("parameter %q#D is not of literal type", parm);
5374 if (DECL_CONSTRUCTOR_P (fun))
5377 rettype = TREE_TYPE (TREE_TYPE (fun));
5378 if (dependent_type_p (rettype))
5380 if (!literal_type_p (rettype))
5382 error ("return type %qT of function %qD is not a literal type",
5383 TREE_TYPE (TREE_TYPE (fun)), fun);
5390 /* Constructor for a lambda expression. */
5393 build_lambda_expr (void)
5395 tree lambda = make_node (LAMBDA_EXPR);
5396 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
5397 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
5398 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
5399 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
5400 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
5404 /* Create the closure object for a LAMBDA_EXPR. */
5407 build_lambda_object (tree lambda_expr)
5409 /* Build aggregate constructor call.
5410 - cp_parser_braced_list
5411 - cp_parser_functional_cast */
5412 VEC(constructor_elt,gc) *elts = NULL;
5413 tree node, expr, type;
5414 location_t saved_loc;
5416 if (processing_template_decl)
5419 /* Make sure any error messages refer to the lambda-introducer. */
5420 saved_loc = input_location;
5421 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
5423 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
5425 node = TREE_CHAIN (node))
5427 tree field = TREE_PURPOSE (node);
5428 tree val = TREE_VALUE (node);
5433 /* Mere mortals can't copy arrays with aggregate initialization, so
5434 do some magic to make it work here. */
5435 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
5436 val = build_array_copy (val);
5437 else if (DECL_NORMAL_CAPTURE_P (field)
5438 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
5440 /* "the entities that are captured by copy are used to
5441 direct-initialize each corresponding non-static data
5442 member of the resulting closure object."
5444 There's normally no way to express direct-initialization
5445 from an element of a CONSTRUCTOR, so we build up a special
5446 TARGET_EXPR to bypass the usual copy-initialization. */
5447 val = force_rvalue (val);
5448 if (TREE_CODE (val) == TARGET_EXPR)
5449 TARGET_EXPR_DIRECT_INIT_P (val) = true;
5452 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
5455 expr = build_constructor (init_list_type_node, elts);
5456 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
5458 /* N2927: "[The closure] class type is not an aggregate."
5459 But we briefly treat it as an aggregate to make this simpler. */
5460 type = TREE_TYPE (lambda_expr);
5461 CLASSTYPE_NON_AGGREGATE (type) = 0;
5462 expr = finish_compound_literal (type, expr);
5463 CLASSTYPE_NON_AGGREGATE (type) = 1;
5465 input_location = saved_loc;
5469 /* Return an initialized RECORD_TYPE for LAMBDA.
5470 LAMBDA must have its explicit captures already. */
5473 begin_lambda_type (tree lambda)
5478 /* Unique name. This is just like an unnamed class, but we cannot use
5479 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5481 name = make_lambda_name ();
5483 /* Create the new RECORD_TYPE for this lambda. */
5484 type = xref_tag (/*tag_code=*/record_type,
5486 /*scope=*/ts_within_enclosing_non_class,
5487 /*template_header_p=*/false);
5490 /* Designate it as a struct so that we can use aggregate initialization. */
5491 CLASSTYPE_DECLARED_CLASS (type) = false;
5493 /* Clear base types. */
5494 xref_basetypes (type, /*bases=*/NULL_TREE);
5496 /* Start the class. */
5497 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
5499 /* Cross-reference the expression and the type. */
5500 TREE_TYPE (lambda) = type;
5501 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
5506 /* Returns the type to use for the return type of the operator() of a
5510 lambda_return_type (tree expr)
5513 if (type_dependent_expression_p (expr))
5515 type = cxx_make_type (DECLTYPE_TYPE);
5516 DECLTYPE_TYPE_EXPR (type) = expr;
5517 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
5518 SET_TYPE_STRUCTURAL_EQUALITY (type);
5521 type = type_decays_to (unlowered_expr_type (expr));
5525 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5529 lambda_function (tree lambda)
5532 if (TREE_CODE (lambda) == LAMBDA_EXPR)
5533 type = TREE_TYPE (lambda);
5536 gcc_assert (LAMBDA_TYPE_P (type));
5537 /* Don't let debug_tree cause instantiation. */
5538 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
5540 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
5541 /*protect=*/0, /*want_type=*/false);
5543 lambda = BASELINK_FUNCTIONS (lambda);
5547 /* Returns the type to use for the FIELD_DECL corresponding to the
5549 The caller should add REFERENCE_TYPE for capture by reference. */
5552 lambda_capture_field_type (tree expr)
5555 if (type_dependent_expression_p (expr))
5557 type = cxx_make_type (DECLTYPE_TYPE);
5558 DECLTYPE_TYPE_EXPR (type) = expr;
5559 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
5560 SET_TYPE_STRUCTURAL_EQUALITY (type);
5563 type = non_reference (unlowered_expr_type (expr));
5567 /* Recompute the return type for LAMBDA with body of the form:
5568 { return EXPR ; } */
5571 apply_lambda_return_type (tree lambda, tree return_type)
5573 tree fco = lambda_function (lambda);
5576 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
5578 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5579 it would interfere with instantiating the closure type. */
5580 if (dependent_type_p (return_type))
5582 if (return_type == error_mark_node)
5585 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5586 TREE_TYPE (METHOD_TYPE) == return-type */
5587 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
5589 result = DECL_RESULT (fco);
5590 if (result == NULL_TREE)
5593 /* We already have a DECL_RESULT from start_preparsed_function.
5594 Now we need to redo the work it and allocate_struct_function
5595 did to reflect the new type. */
5596 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
5597 TYPE_MAIN_VARIANT (return_type));
5598 DECL_ARTIFICIAL (result) = 1;
5599 DECL_IGNORED_P (result) = 1;
5600 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
5603 DECL_RESULT (fco) = result;
5605 if (!processing_template_decl && aggregate_value_p (result, fco))
5607 #ifdef PCC_STATIC_STRUCT_RETURN
5608 cfun->returns_pcc_struct = 1;
5610 cfun->returns_struct = 1;
5615 /* DECL is a local variable or parameter from the surrounding scope of a
5616 lambda-expression. Returns the decltype for a use of the capture field
5617 for DECL even if it hasn't been captured yet. */
5620 capture_decltype (tree decl)
5622 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
5623 /* FIXME do lookup instead of list walk? */
5624 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
5628 type = TREE_TYPE (TREE_PURPOSE (cap));
5630 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
5633 error ("%qD is not captured", decl);
5634 return error_mark_node;
5637 type = TREE_TYPE (decl);
5638 if (TREE_CODE (type) == REFERENCE_TYPE
5639 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
5640 type = TREE_TYPE (type);
5643 case CPLD_REFERENCE:
5644 type = TREE_TYPE (decl);
5645 if (TREE_CODE (type) != REFERENCE_TYPE)
5646 type = build_reference_type (TREE_TYPE (decl));
5653 if (TREE_CODE (type) != REFERENCE_TYPE)
5655 if (!LAMBDA_EXPR_MUTABLE_P (lam))
5656 type = cp_build_qualified_type (type, (TYPE_QUALS (type)
5658 type = build_reference_type (type);
5663 /* From an ID and INITIALIZER, create a capture (by reference if
5664 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5668 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
5669 bool explicit_init_p)
5674 type = lambda_capture_field_type (initializer);
5677 type = build_reference_type (type);
5678 if (!real_lvalue_p (initializer))
5679 error ("cannot capture %qE by reference", initializer);
5682 /* Make member variable. */
5683 member = build_lang_decl (FIELD_DECL, id, type);
5684 if (!explicit_init_p)
5685 /* Normal captures are invisible to name lookup but uses are replaced
5686 with references to the capture field; we implement this by only
5687 really making them invisible in unevaluated context; see
5688 qualify_lookup. For now, let's make explicitly initialized captures
5690 DECL_NORMAL_CAPTURE_P (member) = true;
5692 /* Add it to the appropriate closure class. */
5693 finish_member_declaration (member);
5695 LAMBDA_EXPR_CAPTURE_LIST (lambda)
5696 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
5698 if (id == get_identifier ("__this"))
5700 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
5701 error ("already captured %<this%> in lambda expression");
5702 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
5708 /* Given a FIELD_DECL decl belonging to a closure type, return a
5709 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5713 thisify_lambda_field (tree decl)
5715 tree context = lambda_function (DECL_CONTEXT (decl));
5716 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
5718 tf_warning_or_error);
5719 return finish_non_static_data_member (decl, object,
5720 /*qualifying_scope*/NULL_TREE);
5723 /* Similar to add_capture, except this works on a stack of nested lambdas.
5724 BY_REFERENCE_P in this case is derived from the default capture mode.
5725 Returns the capture for the lambda at the bottom of the stack. */
5728 add_default_capture (tree lambda_stack, tree id, tree initializer)
5730 bool this_capture_p = (id == get_identifier ("__this"));
5732 tree member = NULL_TREE;
5734 tree saved_class_type = current_class_type;
5738 for (node = lambda_stack;
5740 node = TREE_CHAIN (node))
5742 tree lambda = TREE_VALUE (node);
5744 current_class_type = TREE_TYPE (lambda);
5745 member = add_capture (lambda,
5750 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
5751 == CPLD_REFERENCE)),
5752 /*explicit_init_p=*/false);
5753 initializer = thisify_lambda_field (member);
5756 current_class_type = saved_class_type;
5761 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5762 INDIRECT_REF, possibly adding it through default capturing. */
5765 lambda_expr_this_capture (tree lambda)
5769 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5771 /* Try to default capture 'this' if we can. */
5773 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
5775 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
5776 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
5777 tree init = NULL_TREE;
5779 /* If we are in a lambda function, we can move out until we hit:
5780 1. a non-lambda function,
5781 2. a lambda function capturing 'this', or
5782 3. a non-default capturing lambda function. */
5783 while (LAMBDA_FUNCTION_P (containing_function))
5786 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
5788 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
5790 /* An outer lambda has already captured 'this'. */
5791 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5792 init = thisify_lambda_field (cap);
5796 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
5797 /* An outer lambda won't let us capture 'this'. */
5800 lambda_stack = tree_cons (NULL_TREE,
5804 containing_function = decl_function_context (containing_function);
5807 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
5808 && !LAMBDA_FUNCTION_P (containing_function))
5809 /* First parameter is 'this'. */
5810 init = DECL_ARGUMENTS (containing_function);
5813 this_capture = add_default_capture (lambda_stack,
5814 /*id=*/get_identifier ("__this"),
5820 error ("%<this%> was not captured for this lambda function");
5821 result = error_mark_node;
5825 /* To make sure that current_class_ref is for the lambda. */
5826 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
5828 result = finish_non_static_data_member (this_capture,
5830 /*qualifying_scope=*/NULL_TREE);
5832 /* If 'this' is captured, each use of 'this' is transformed into an
5833 access to the corresponding unnamed data member of the closure
5834 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5835 ensures that the transformed expression is an rvalue. ] */
5836 result = rvalue (result);
5842 /* If the closure TYPE has a static op(), also add a conversion to function
5846 maybe_add_lambda_conv_op (tree type)
5848 bool nested = (current_function_decl != NULL_TREE);
5849 tree callop = lambda_function (type);
5850 tree rettype, name, fntype, fn, body, compound_stmt;
5852 if (!DECL_STATIC_FUNCTION_P (callop))
5855 rettype = build_pointer_type (TREE_TYPE (callop));
5856 name = mangle_conv_op_name_for_type (rettype);
5857 fntype = build_function_type (rettype, void_list_node);
5858 fn = build_lang_decl (FUNCTION_DECL, name, fntype);
5859 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5861 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5862 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5863 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5865 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
5866 grokclassfn (type, fn, NO_SPECIAL);
5867 set_linkage_according_to_type (type, fn);
5868 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5869 DECL_IN_AGGR_P (fn) = 1;
5870 DECL_ARTIFICIAL (fn) = 1;
5871 DECL_NOT_REALLY_EXTERN (fn) = 1;
5872 DECL_DECLARED_INLINE_P (fn) = 1;
5873 DECL_STATIC_FUNCTION_P (fn) = 1;
5875 DECL_INTERFACE_KNOWN (fn) = 1;
5877 add_method (type, fn, NULL_TREE);
5880 push_function_context ();
5881 start_preparsed_function (fn, NULL_TREE,
5882 SF_PRE_PARSED | SF_INCLASS_INLINE);
5883 body = begin_function_body ();
5884 compound_stmt = begin_compound_stmt (0);
5886 finish_return_stmt (decay_conversion (callop));
5888 finish_compound_stmt (compound_stmt);
5889 finish_function_body (body);
5891 expand_or_defer_fn (finish_function (2));
5893 pop_function_context ();
5895 #include "gt-cp-semantics.h"