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 if (!processing_template_decl)
551 destination = cp_convert (ptr_type_node, destination);
552 if (error_operand_p (destination))
555 /* We don't inline calls to functions with computed gotos.
556 Those functions are typically up to some funny business,
557 and may be depending on the labels being at particular
558 addresses, or some such. */
559 DECL_UNINLINABLE (current_function_decl) = 1;
562 check_goto (destination);
564 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
567 /* COND is the condition-expression for an if, while, etc.,
568 statement. Convert it to a boolean value, if appropriate.
569 In addition, verify sequence points if -Wsequence-point is enabled. */
572 maybe_convert_cond (tree cond)
574 /* Empty conditions remain empty. */
578 /* Wait until we instantiate templates before doing conversion. */
579 if (processing_template_decl)
582 if (warn_sequence_point)
583 verify_sequence_points (cond);
585 /* Do the conversion. */
586 cond = convert_from_reference (cond);
588 if (TREE_CODE (cond) == MODIFY_EXPR
589 && !TREE_NO_WARNING (cond)
592 warning (OPT_Wparentheses,
593 "suggest parentheses around assignment used as truth value");
594 TREE_NO_WARNING (cond) = 1;
597 return condition_conversion (cond);
600 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
603 finish_expr_stmt (tree expr)
607 if (expr != NULL_TREE)
609 if (!processing_template_decl)
611 if (warn_sequence_point)
612 verify_sequence_points (expr);
613 if (TREE_CODE (expr) != MODIFY_EXPR)
614 /* Expr is not being 'used' here, otherwise we whould have
615 called mark_{rl}value_use use here, which would have in turn
616 called mark_exp_read. Rather, we call mark_exp_read directly
617 to avoid some warnings when
618 -Wunused-but-set-{variable,parameter} is in effect. */
619 mark_exp_read (expr);
620 expr = convert_to_void (expr, "statement", tf_warning_or_error);
622 else if (!type_dependent_expression_p (expr))
623 convert_to_void (build_non_dependent_expr (expr), "statement",
624 tf_warning_or_error);
626 if (check_for_bare_parameter_packs (expr))
627 expr = error_mark_node;
629 /* Simplification of inner statement expressions, compound exprs,
630 etc can result in us already having an EXPR_STMT. */
631 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
633 if (TREE_CODE (expr) != EXPR_STMT)
634 expr = build_stmt (input_location, EXPR_STMT, expr);
635 expr = maybe_cleanup_point_expr_void (expr);
647 /* Begin an if-statement. Returns a newly created IF_STMT if
654 scope = do_pushlevel (sk_block);
655 r = build_stmt (input_location, IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
656 TREE_CHAIN (r) = scope;
657 begin_cond (&IF_COND (r));
661 /* Process the COND of an if-statement, which may be given by
665 finish_if_stmt_cond (tree cond, tree if_stmt)
667 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
669 THEN_CLAUSE (if_stmt) = push_stmt_list ();
672 /* Finish the then-clause of an if-statement, which may be given by
676 finish_then_clause (tree if_stmt)
678 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
682 /* Begin the else-clause of an if-statement. */
685 begin_else_clause (tree if_stmt)
687 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
690 /* Finish the else-clause of an if-statement, which may be given by
694 finish_else_clause (tree if_stmt)
696 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
699 /* Finish an if-statement. */
702 finish_if_stmt (tree if_stmt)
704 tree scope = TREE_CHAIN (if_stmt);
705 TREE_CHAIN (if_stmt) = NULL;
706 add_stmt (do_poplevel (scope));
710 /* Begin a while-statement. Returns a newly created WHILE_STMT if
714 begin_while_stmt (void)
717 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
719 WHILE_BODY (r) = do_pushlevel (sk_block);
720 begin_cond (&WHILE_COND (r));
724 /* Process the COND of a while-statement, which may be given by
728 finish_while_stmt_cond (tree cond, tree while_stmt)
730 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
731 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
734 /* Finish a while-statement, which may be given by WHILE_STMT. */
737 finish_while_stmt (tree while_stmt)
739 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
743 /* Begin a do-statement. Returns a newly created DO_STMT if
749 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
751 DO_BODY (r) = push_stmt_list ();
755 /* Finish the body of a do-statement, which may be given by DO_STMT. */
758 finish_do_body (tree do_stmt)
760 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
762 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
763 body = STATEMENT_LIST_TAIL (body)->stmt;
765 if (IS_EMPTY_STMT (body))
766 warning (OPT_Wempty_body,
767 "suggest explicit braces around empty body in %<do%> statement");
770 /* Finish a do-statement, which may be given by DO_STMT, and whose
771 COND is as indicated. */
774 finish_do_stmt (tree cond, tree do_stmt)
776 cond = maybe_convert_cond (cond);
777 DO_COND (do_stmt) = cond;
781 /* Finish a return-statement. The EXPRESSION returned, if any, is as
785 finish_return_stmt (tree expr)
790 expr = check_return_expr (expr, &no_warning);
792 if (flag_openmp && !check_omp_return ())
793 return error_mark_node;
794 if (!processing_template_decl)
796 if (warn_sequence_point)
797 verify_sequence_points (expr);
799 if (DECL_DESTRUCTOR_P (current_function_decl)
800 || (DECL_CONSTRUCTOR_P (current_function_decl)
801 && targetm.cxx.cdtor_returns_this ()))
803 /* Similarly, all destructors must run destructors for
804 base-classes before returning. So, all returns in a
805 destructor get sent to the DTOR_LABEL; finish_function emits
806 code to return a value there. */
807 return finish_goto_stmt (cdtor_label);
811 r = build_stmt (input_location, RETURN_EXPR, expr);
812 TREE_NO_WARNING (r) |= no_warning;
813 r = maybe_cleanup_point_expr_void (r);
820 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
823 begin_for_stmt (void)
827 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
828 NULL_TREE, NULL_TREE);
830 if (flag_new_for_scope > 0)
831 TREE_CHAIN (r) = do_pushlevel (sk_for);
833 if (processing_template_decl)
834 FOR_INIT_STMT (r) = push_stmt_list ();
839 /* Finish the for-init-statement of a for-statement, which may be
840 given by FOR_STMT. */
843 finish_for_init_stmt (tree for_stmt)
845 if (processing_template_decl)
846 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
848 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
849 begin_cond (&FOR_COND (for_stmt));
852 /* Finish the COND of a for-statement, which may be given by
856 finish_for_cond (tree cond, tree for_stmt)
858 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
859 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
862 /* Finish the increment-EXPRESSION in a for-statement, which may be
863 given by FOR_STMT. */
866 finish_for_expr (tree expr, tree for_stmt)
870 /* If EXPR is an overloaded function, issue an error; there is no
871 context available to use to perform overload resolution. */
872 if (type_unknown_p (expr))
874 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
875 expr = error_mark_node;
877 if (!processing_template_decl)
879 if (warn_sequence_point)
880 verify_sequence_points (expr);
881 expr = convert_to_void (expr, "3rd expression in for",
882 tf_warning_or_error);
884 else if (!type_dependent_expression_p (expr))
885 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for",
886 tf_warning_or_error);
887 expr = maybe_cleanup_point_expr_void (expr);
888 if (check_for_bare_parameter_packs (expr))
889 expr = error_mark_node;
890 FOR_EXPR (for_stmt) = expr;
893 /* Finish the body of a for-statement, which may be given by
894 FOR_STMT. The increment-EXPR for the loop must be
898 finish_for_stmt (tree for_stmt)
900 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
902 /* Pop the scope for the body of the loop. */
903 if (flag_new_for_scope > 0)
905 tree scope = TREE_CHAIN (for_stmt);
906 TREE_CHAIN (for_stmt) = NULL;
907 add_stmt (do_poplevel (scope));
913 /* Finish a break-statement. */
916 finish_break_stmt (void)
918 return add_stmt (build_stmt (input_location, BREAK_STMT));
921 /* Finish a continue-statement. */
924 finish_continue_stmt (void)
926 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
929 /* Begin a switch-statement. Returns a new SWITCH_STMT if
933 begin_switch_stmt (void)
937 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
939 scope = do_pushlevel (sk_block);
940 TREE_CHAIN (r) = scope;
941 begin_cond (&SWITCH_STMT_COND (r));
946 /* Finish the cond of a switch-statement. */
949 finish_switch_cond (tree cond, tree switch_stmt)
951 tree orig_type = NULL;
952 if (!processing_template_decl)
954 /* Convert the condition to an integer or enumeration type. */
955 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
956 if (cond == NULL_TREE)
958 error ("switch quantity not an integer");
959 cond = error_mark_node;
961 orig_type = TREE_TYPE (cond);
962 if (cond != error_mark_node)
966 Integral promotions are performed. */
967 cond = perform_integral_promotions (cond);
968 cond = maybe_cleanup_point_expr (cond);
971 if (check_for_bare_parameter_packs (cond))
972 cond = error_mark_node;
973 else if (!processing_template_decl && warn_sequence_point)
974 verify_sequence_points (cond);
976 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
977 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
978 add_stmt (switch_stmt);
979 push_switch (switch_stmt);
980 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
983 /* Finish the body of a switch-statement, which may be given by
984 SWITCH_STMT. The COND to switch on is indicated. */
987 finish_switch_stmt (tree switch_stmt)
991 SWITCH_STMT_BODY (switch_stmt) =
992 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
996 scope = TREE_CHAIN (switch_stmt);
997 TREE_CHAIN (switch_stmt) = NULL;
998 add_stmt (do_poplevel (scope));
1001 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1005 begin_try_block (void)
1007 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1009 TRY_STMTS (r) = push_stmt_list ();
1013 /* Likewise, for a function-try-block. The block returned in
1014 *COMPOUND_STMT is an artificial outer scope, containing the
1015 function-try-block. */
1018 begin_function_try_block (tree *compound_stmt)
1021 /* This outer scope does not exist in the C++ standard, but we need
1022 a place to put __FUNCTION__ and similar variables. */
1023 *compound_stmt = begin_compound_stmt (0);
1024 r = begin_try_block ();
1025 FN_TRY_BLOCK_P (r) = 1;
1029 /* Finish a try-block, which may be given by TRY_BLOCK. */
1032 finish_try_block (tree try_block)
1034 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1035 TRY_HANDLERS (try_block) = push_stmt_list ();
1038 /* Finish the body of a cleanup try-block, which may be given by
1042 finish_cleanup_try_block (tree try_block)
1044 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1047 /* Finish an implicitly generated try-block, with a cleanup is given
1051 finish_cleanup (tree cleanup, tree try_block)
1053 TRY_HANDLERS (try_block) = cleanup;
1054 CLEANUP_P (try_block) = 1;
1057 /* Likewise, for a function-try-block. */
1060 finish_function_try_block (tree try_block)
1062 finish_try_block (try_block);
1063 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1064 the try block, but moving it inside. */
1065 in_function_try_handler = 1;
1068 /* Finish a handler-sequence for a try-block, which may be given by
1072 finish_handler_sequence (tree try_block)
1074 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1075 check_handlers (TRY_HANDLERS (try_block));
1078 /* Finish the handler-seq for a function-try-block, given by
1079 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1080 begin_function_try_block. */
1083 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1085 in_function_try_handler = 0;
1086 finish_handler_sequence (try_block);
1087 finish_compound_stmt (compound_stmt);
1090 /* Begin a handler. Returns a HANDLER if appropriate. */
1093 begin_handler (void)
1097 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1100 /* Create a binding level for the eh_info and the exception object
1102 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1107 /* Finish the handler-parameters for a handler, which may be given by
1108 HANDLER. DECL is the declaration for the catch parameter, or NULL
1109 if this is a `catch (...)' clause. */
1112 finish_handler_parms (tree decl, tree handler)
1114 tree type = NULL_TREE;
1115 if (processing_template_decl)
1119 decl = pushdecl (decl);
1120 decl = push_template_decl (decl);
1121 HANDLER_PARMS (handler) = decl;
1122 type = TREE_TYPE (decl);
1126 type = expand_start_catch_block (decl);
1127 HANDLER_TYPE (handler) = type;
1128 if (!processing_template_decl && type)
1129 mark_used (eh_type_info (type));
1132 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1133 the return value from the matching call to finish_handler_parms. */
1136 finish_handler (tree handler)
1138 if (!processing_template_decl)
1139 expand_end_catch_block ();
1140 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1143 /* Begin a compound statement. FLAGS contains some bits that control the
1144 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1145 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1146 block of a function. If BCS_TRY_BLOCK is set, this is the block
1147 created on behalf of a TRY statement. Returns a token to be passed to
1148 finish_compound_stmt. */
1151 begin_compound_stmt (unsigned int flags)
1155 if (flags & BCS_NO_SCOPE)
1157 r = push_stmt_list ();
1158 STATEMENT_LIST_NO_SCOPE (r) = 1;
1160 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1161 But, if it's a statement-expression with a scopeless block, there's
1162 nothing to keep, and we don't want to accidentally keep a block
1163 *inside* the scopeless block. */
1164 keep_next_level (false);
1167 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1169 /* When processing a template, we need to remember where the braces were,
1170 so that we can set up identical scopes when instantiating the template
1171 later. BIND_EXPR is a handy candidate for this.
1172 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1173 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1174 processing templates. */
1175 if (processing_template_decl)
1177 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1178 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1179 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1180 TREE_SIDE_EFFECTS (r) = 1;
1186 /* Finish a compound-statement, which is given by STMT. */
1189 finish_compound_stmt (tree stmt)
1191 if (TREE_CODE (stmt) == BIND_EXPR)
1192 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1193 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1194 stmt = pop_stmt_list (stmt);
1197 /* Destroy any ObjC "super" receivers that may have been
1199 objc_clear_super_receiver ();
1201 stmt = do_poplevel (stmt);
1204 /* ??? See c_end_compound_stmt wrt statement expressions. */
1209 /* Finish an asm-statement, whose components are a STRING, some
1210 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1211 LABELS. Also note whether the asm-statement should be
1212 considered volatile. */
1215 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1216 tree input_operands, tree clobbers, tree labels)
1220 int ninputs = list_length (input_operands);
1221 int noutputs = list_length (output_operands);
1223 if (!processing_template_decl)
1225 const char *constraint;
1226 const char **oconstraints;
1227 bool allows_mem, allows_reg, is_inout;
1231 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1233 string = resolve_asm_operand_names (string, output_operands,
1234 input_operands, labels);
1236 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1238 operand = TREE_VALUE (t);
1240 /* ??? Really, this should not be here. Users should be using a
1241 proper lvalue, dammit. But there's a long history of using
1242 casts in the output operands. In cases like longlong.h, this
1243 becomes a primitive form of typechecking -- if the cast can be
1244 removed, then the output operand had a type of the proper width;
1245 otherwise we'll get an error. Gross, but ... */
1246 STRIP_NOPS (operand);
1248 operand = mark_lvalue_use (operand);
1250 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1251 operand = error_mark_node;
1253 if (operand != error_mark_node
1254 && (TREE_READONLY (operand)
1255 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1256 /* Functions are not modifiable, even though they are
1258 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1259 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1260 /* If it's an aggregate and any field is const, then it is
1261 effectively const. */
1262 || (CLASS_TYPE_P (TREE_TYPE (operand))
1263 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1264 readonly_error (operand, REK_ASSIGNMENT_ASM);
1266 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1267 oconstraints[i] = constraint;
1269 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1270 &allows_mem, &allows_reg, &is_inout))
1272 /* If the operand is going to end up in memory,
1273 mark it addressable. */
1274 if (!allows_reg && !cxx_mark_addressable (operand))
1275 operand = error_mark_node;
1278 operand = error_mark_node;
1280 TREE_VALUE (t) = operand;
1283 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1285 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1286 operand = decay_conversion (TREE_VALUE (t));
1288 /* If the type of the operand hasn't been determined (e.g.,
1289 because it involves an overloaded function), then issue
1290 an error message. There's no context available to
1291 resolve the overloading. */
1292 if (TREE_TYPE (operand) == unknown_type_node)
1294 error ("type of asm operand %qE could not be determined",
1296 operand = error_mark_node;
1299 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1300 oconstraints, &allows_mem, &allows_reg))
1302 /* If the operand is going to end up in memory,
1303 mark it addressable. */
1304 if (!allows_reg && allows_mem)
1306 /* Strip the nops as we allow this case. FIXME, this really
1307 should be rejected or made deprecated. */
1308 STRIP_NOPS (operand);
1309 if (!cxx_mark_addressable (operand))
1310 operand = error_mark_node;
1314 operand = error_mark_node;
1316 TREE_VALUE (t) = operand;
1320 r = build_stmt (input_location, ASM_EXPR, string,
1321 output_operands, input_operands,
1323 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1324 r = maybe_cleanup_point_expr_void (r);
1325 return add_stmt (r);
1328 /* Finish a label with the indicated NAME. Returns the new label. */
1331 finish_label_stmt (tree name)
1333 tree decl = define_label (input_location, name);
1335 if (decl == error_mark_node)
1336 return error_mark_node;
1338 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1343 /* Finish a series of declarations for local labels. G++ allows users
1344 to declare "local" labels, i.e., labels with scope. This extension
1345 is useful when writing code involving statement-expressions. */
1348 finish_label_decl (tree name)
1350 if (!at_function_scope_p ())
1352 error ("__label__ declarations are only allowed in function scopes");
1356 add_decl_expr (declare_local_label (name));
1359 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1362 finish_decl_cleanup (tree decl, tree cleanup)
1364 push_cleanup (decl, cleanup, false);
1367 /* If the current scope exits with an exception, run CLEANUP. */
1370 finish_eh_cleanup (tree cleanup)
1372 push_cleanup (NULL, cleanup, true);
1375 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1376 order they were written by the user. Each node is as for
1377 emit_mem_initializers. */
1380 finish_mem_initializers (tree mem_inits)
1382 /* Reorder the MEM_INITS so that they are in the order they appeared
1383 in the source program. */
1384 mem_inits = nreverse (mem_inits);
1386 if (processing_template_decl)
1390 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1392 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1393 check for bare parameter packs in the TREE_VALUE, because
1394 any parameter packs in the TREE_VALUE have already been
1395 bound as part of the TREE_PURPOSE. See
1396 make_pack_expansion for more information. */
1397 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1398 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1399 TREE_VALUE (mem) = error_mark_node;
1402 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1405 emit_mem_initializers (mem_inits);
1408 /* Finish a parenthesized expression EXPR. */
1411 finish_parenthesized_expr (tree expr)
1414 /* This inhibits warnings in c_common_truthvalue_conversion. */
1415 TREE_NO_WARNING (expr) = 1;
1417 if (TREE_CODE (expr) == OFFSET_REF)
1418 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1419 enclosed in parentheses. */
1420 PTRMEM_OK_P (expr) = 0;
1422 if (TREE_CODE (expr) == STRING_CST)
1423 PAREN_STRING_LITERAL_P (expr) = 1;
1428 /* Finish a reference to a non-static data member (DECL) that is not
1429 preceded by `.' or `->'. */
1432 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1434 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1438 tree scope = qualifying_scope;
1439 if (scope == NULL_TREE)
1440 scope = context_for_name_lookup (decl);
1441 object = maybe_dummy_object (scope, NULL);
1444 /* DR 613: Can use non-static data members without an associated
1445 object in sizeof/decltype/alignof. */
1446 if (is_dummy_object (object) && cp_unevaluated_operand == 0
1447 && (!processing_template_decl || !current_class_ref))
1449 if (current_function_decl
1450 && DECL_STATIC_FUNCTION_P (current_function_decl))
1451 error ("invalid use of member %q+D in static member function", decl);
1453 error ("invalid use of non-static data member %q+D", decl);
1454 error ("from this location");
1456 return error_mark_node;
1459 if (current_class_ptr)
1460 TREE_USED (current_class_ptr) = 1;
1461 if (processing_template_decl && !qualifying_scope)
1463 tree type = TREE_TYPE (decl);
1465 if (TREE_CODE (type) == REFERENCE_TYPE)
1466 type = TREE_TYPE (type);
1469 /* Set the cv qualifiers. */
1470 int quals = (current_class_ref
1471 ? cp_type_quals (TREE_TYPE (current_class_ref))
1472 : TYPE_UNQUALIFIED);
1474 if (DECL_MUTABLE_P (decl))
1475 quals &= ~TYPE_QUAL_CONST;
1477 quals |= cp_type_quals (TREE_TYPE (decl));
1478 type = cp_build_qualified_type (type, quals);
1481 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1483 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1484 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1486 else if (processing_template_decl)
1487 return build_qualified_name (TREE_TYPE (decl),
1490 /*template_p=*/false);
1493 tree access_type = TREE_TYPE (object);
1495 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1498 /* If the data member was named `C::M', convert `*this' to `C'
1500 if (qualifying_scope)
1502 tree binfo = NULL_TREE;
1503 object = build_scoped_ref (object, qualifying_scope,
1507 return build_class_member_access_expr (object, decl,
1508 /*access_path=*/NULL_TREE,
1509 /*preserve_reference=*/false,
1510 tf_warning_or_error);
1514 /* If we are currently parsing a template and we encountered a typedef
1515 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1516 adds the typedef to a list tied to the current template.
1517 At tempate instantiatin time, that list is walked and access check
1518 performed for each typedef.
1519 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1522 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1524 location_t location)
1526 tree template_info = NULL;
1527 tree cs = current_scope ();
1529 if (!is_typedef_decl (typedef_decl)
1531 || !CLASS_TYPE_P (context)
1535 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1536 template_info = get_template_info (cs);
1539 && TI_TEMPLATE (template_info)
1540 && !currently_open_class (context))
1541 append_type_to_template_for_access_check (cs, typedef_decl,
1545 /* DECL was the declaration to which a qualified-id resolved. Issue
1546 an error message if it is not accessible. If OBJECT_TYPE is
1547 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1548 type of `*x', or `x', respectively. If the DECL was named as
1549 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1552 check_accessibility_of_qualified_id (tree decl,
1554 tree nested_name_specifier)
1557 tree qualifying_type = NULL_TREE;
1559 /* If we are parsing a template declaration and if decl is a typedef,
1560 add it to a list tied to the template.
1561 At template instantiation time, that list will be walked and
1562 access check performed. */
1563 add_typedef_to_current_template_for_access_check (decl,
1564 nested_name_specifier
1565 ? nested_name_specifier
1566 : DECL_CONTEXT (decl),
1569 /* If we're not checking, return immediately. */
1570 if (deferred_access_no_check)
1573 /* Determine the SCOPE of DECL. */
1574 scope = context_for_name_lookup (decl);
1575 /* If the SCOPE is not a type, then DECL is not a member. */
1576 if (!TYPE_P (scope))
1578 /* Compute the scope through which DECL is being accessed. */
1580 /* OBJECT_TYPE might not be a class type; consider:
1582 class A { typedef int I; };
1586 In this case, we will have "A::I" as the DECL, but "I" as the
1588 && CLASS_TYPE_P (object_type)
1589 && DERIVED_FROM_P (scope, object_type))
1590 /* If we are processing a `->' or `.' expression, use the type of the
1592 qualifying_type = object_type;
1593 else if (nested_name_specifier)
1595 /* If the reference is to a non-static member of the
1596 current class, treat it as if it were referenced through
1598 if (DECL_NONSTATIC_MEMBER_P (decl)
1599 && current_class_ptr
1600 && DERIVED_FROM_P (scope, current_class_type))
1601 qualifying_type = current_class_type;
1602 /* Otherwise, use the type indicated by the
1603 nested-name-specifier. */
1605 qualifying_type = nested_name_specifier;
1608 /* Otherwise, the name must be from the current class or one of
1610 qualifying_type = currently_open_derived_class (scope);
1613 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1614 or similar in a default argument value. */
1615 && CLASS_TYPE_P (qualifying_type)
1616 && !dependent_type_p (qualifying_type))
1617 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1621 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1622 class named to the left of the "::" operator. DONE is true if this
1623 expression is a complete postfix-expression; it is false if this
1624 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1625 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1626 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1627 is true iff this qualified name appears as a template argument. */
1630 finish_qualified_id_expr (tree qualifying_class,
1635 bool template_arg_p)
1637 gcc_assert (TYPE_P (qualifying_class));
1639 if (error_operand_p (expr))
1640 return error_mark_node;
1642 if (DECL_P (expr) || BASELINK_P (expr))
1646 check_template_keyword (expr);
1648 /* If EXPR occurs as the operand of '&', use special handling that
1649 permits a pointer-to-member. */
1650 if (address_p && done)
1652 if (TREE_CODE (expr) == SCOPE_REF)
1653 expr = TREE_OPERAND (expr, 1);
1654 expr = build_offset_ref (qualifying_class, expr,
1655 /*address_p=*/true);
1659 /* Within the scope of a class, turn references to non-static
1660 members into expression of the form "this->...". */
1662 /* But, within a template argument, we do not want make the
1663 transformation, as there is no "this" pointer. */
1665 else if (TREE_CODE (expr) == FIELD_DECL)
1667 push_deferring_access_checks (dk_no_check);
1668 expr = finish_non_static_data_member (expr, NULL_TREE,
1670 pop_deferring_access_checks ();
1672 else if (BASELINK_P (expr) && !processing_template_decl)
1676 /* See if any of the functions are non-static members. */
1677 /* If so, the expression may be relative to 'this'. */
1678 if (!shared_member_p (expr)
1679 && (ob = maybe_dummy_object (qualifying_class, NULL),
1680 !is_dummy_object (ob)))
1681 expr = (build_class_member_access_expr
1684 BASELINK_ACCESS_BINFO (expr),
1685 /*preserve_reference=*/false,
1686 tf_warning_or_error));
1688 /* The expression is a qualified name whose address is not
1690 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1696 /* Begin a statement-expression. The value returned must be passed to
1697 finish_stmt_expr. */
1700 begin_stmt_expr (void)
1702 return push_stmt_list ();
1705 /* Process the final expression of a statement expression. EXPR can be
1706 NULL, if the final expression is empty. Return a STATEMENT_LIST
1707 containing all the statements in the statement-expression, or
1708 ERROR_MARK_NODE if there was an error. */
1711 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1713 if (error_operand_p (expr))
1715 /* The type of the statement-expression is the type of the last
1717 TREE_TYPE (stmt_expr) = error_mark_node;
1718 return error_mark_node;
1721 /* If the last statement does not have "void" type, then the value
1722 of the last statement is the value of the entire expression. */
1725 tree type = TREE_TYPE (expr);
1727 if (processing_template_decl)
1729 expr = build_stmt (input_location, EXPR_STMT, expr);
1730 expr = add_stmt (expr);
1731 /* Mark the last statement so that we can recognize it as such at
1732 template-instantiation time. */
1733 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1735 else if (VOID_TYPE_P (type))
1737 /* Just treat this like an ordinary statement. */
1738 expr = finish_expr_stmt (expr);
1742 /* It actually has a value we need to deal with. First, force it
1743 to be an rvalue so that we won't need to build up a copy
1744 constructor call later when we try to assign it to something. */
1745 expr = force_rvalue (expr);
1746 if (error_operand_p (expr))
1747 return error_mark_node;
1749 /* Update for array-to-pointer decay. */
1750 type = TREE_TYPE (expr);
1752 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1753 normal statement, but don't convert to void or actually add
1755 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1756 expr = maybe_cleanup_point_expr (expr);
1760 /* The type of the statement-expression is the type of the last
1762 TREE_TYPE (stmt_expr) = type;
1768 /* Finish a statement-expression. EXPR should be the value returned
1769 by the previous begin_stmt_expr. Returns an expression
1770 representing the statement-expression. */
1773 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1778 if (error_operand_p (stmt_expr))
1780 pop_stmt_list (stmt_expr);
1781 return error_mark_node;
1784 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1786 type = TREE_TYPE (stmt_expr);
1787 result = pop_stmt_list (stmt_expr);
1788 TREE_TYPE (result) = type;
1790 if (processing_template_decl)
1792 result = build_min (STMT_EXPR, type, result);
1793 TREE_SIDE_EFFECTS (result) = 1;
1794 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1796 else if (CLASS_TYPE_P (type))
1798 /* Wrap the statement-expression in a TARGET_EXPR so that the
1799 temporary object created by the final expression is destroyed at
1800 the end of the full-expression containing the
1801 statement-expression. */
1802 result = force_target_expr (type, result);
1808 /* Returns the expression which provides the value of STMT_EXPR. */
1811 stmt_expr_value_expr (tree stmt_expr)
1813 tree t = STMT_EXPR_STMT (stmt_expr);
1815 if (TREE_CODE (t) == BIND_EXPR)
1816 t = BIND_EXPR_BODY (t);
1818 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1819 t = STATEMENT_LIST_TAIL (t)->stmt;
1821 if (TREE_CODE (t) == EXPR_STMT)
1822 t = EXPR_STMT_EXPR (t);
1827 /* Return TRUE iff EXPR_STMT is an empty list of
1828 expression statements. */
1831 empty_expr_stmt_p (tree expr_stmt)
1833 tree body = NULL_TREE;
1835 if (expr_stmt == void_zero_node)
1840 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1841 body = EXPR_STMT_EXPR (expr_stmt);
1842 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1848 if (TREE_CODE (body) == STATEMENT_LIST)
1849 return tsi_end_p (tsi_start (body));
1851 return empty_expr_stmt_p (body);
1856 /* Perform Koenig lookup. FN is the postfix-expression representing
1857 the function (or functions) to call; ARGS are the arguments to the
1858 call. Returns the functions to be considered by overload
1862 perform_koenig_lookup (tree fn, VEC(tree,gc) *args)
1864 tree identifier = NULL_TREE;
1865 tree functions = NULL_TREE;
1866 tree tmpl_args = NULL_TREE;
1867 bool template_id = false;
1869 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1871 /* Use a separate flag to handle null args. */
1873 tmpl_args = TREE_OPERAND (fn, 1);
1874 fn = TREE_OPERAND (fn, 0);
1877 /* Find the name of the overloaded function. */
1878 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1880 else if (is_overloaded_fn (fn))
1883 identifier = DECL_NAME (get_first_fn (functions));
1885 else if (DECL_P (fn))
1888 identifier = DECL_NAME (fn);
1891 /* A call to a namespace-scope function using an unqualified name.
1893 Do Koenig lookup -- unless any of the arguments are
1895 if (!any_type_dependent_arguments_p (args)
1896 && !any_dependent_template_arguments_p (tmpl_args))
1898 fn = lookup_arg_dependent (identifier, functions, args);
1900 /* The unqualified name could not be resolved. */
1901 fn = unqualified_fn_lookup_error (identifier);
1904 if (fn && template_id)
1905 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1910 /* Generate an expression for `FN (ARGS)'. This may change the
1913 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1914 as a virtual call, even if FN is virtual. (This flag is set when
1915 encountering an expression where the function name is explicitly
1916 qualified. For example a call to `X::f' never generates a virtual
1919 Returns code for the call. */
1922 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1923 bool koenig_p, tsubst_flags_t complain)
1927 VEC(tree,gc) *orig_args = NULL;
1929 if (fn == error_mark_node)
1930 return error_mark_node;
1932 gcc_assert (!TYPE_P (fn));
1936 if (processing_template_decl)
1938 if (type_dependent_expression_p (fn)
1939 || any_type_dependent_arguments_p (*args))
1941 result = build_nt_call_vec (fn, *args);
1942 KOENIG_LOOKUP_P (result) = koenig_p;
1947 tree fndecl = OVL_CURRENT (fn);
1948 if (TREE_CODE (fndecl) != FUNCTION_DECL
1949 || !TREE_THIS_VOLATILE (fndecl))
1955 current_function_returns_abnormally = 1;
1959 orig_args = make_tree_vector_copy (*args);
1960 if (!BASELINK_P (fn)
1961 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1962 && TREE_TYPE (fn) != unknown_type_node)
1963 fn = build_non_dependent_expr (fn);
1964 make_args_non_dependent (*args);
1967 if (is_overloaded_fn (fn))
1968 fn = baselink_for_fns (fn);
1971 if (BASELINK_P (fn))
1975 /* A call to a member function. From [over.call.func]:
1977 If the keyword this is in scope and refers to the class of
1978 that member function, or a derived class thereof, then the
1979 function call is transformed into a qualified function call
1980 using (*this) as the postfix-expression to the left of the
1981 . operator.... [Otherwise] a contrived object of type T
1982 becomes the implied object argument.
1986 struct A { void f(); };
1987 struct B : public A {};
1988 struct C : public A { void g() { B::f(); }};
1990 "the class of that member function" refers to `A'. But 11.2
1991 [class.access.base] says that we need to convert 'this' to B* as
1992 part of the access, so we pass 'B' to maybe_dummy_object. */
1994 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1997 if (processing_template_decl)
1999 if (type_dependent_expression_p (object))
2001 tree ret = build_nt_call_vec (orig_fn, orig_args);
2002 release_tree_vector (orig_args);
2005 object = build_non_dependent_expr (object);
2008 result = build_new_method_call (object, fn, args, NULL_TREE,
2010 ? LOOKUP_NONVIRTUAL : 0),
2014 else if (is_overloaded_fn (fn))
2016 /* If the function is an overloaded builtin, resolve it. */
2017 if (TREE_CODE (fn) == FUNCTION_DECL
2018 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2019 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2020 result = resolve_overloaded_builtin (input_location, fn, *args);
2023 /* A call to a namespace-scope function. */
2024 result = build_new_function_call (fn, args, koenig_p, complain);
2026 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2028 if (!VEC_empty (tree, *args))
2029 error ("arguments to destructor are not allowed");
2030 /* Mark the pseudo-destructor call as having side-effects so
2031 that we do not issue warnings about its use. */
2032 result = build1 (NOP_EXPR,
2034 TREE_OPERAND (fn, 0));
2035 TREE_SIDE_EFFECTS (result) = 1;
2037 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2038 /* If the "function" is really an object of class type, it might
2039 have an overloaded `operator ()'. */
2040 result = build_op_call (fn, args, complain);
2043 /* A call where the function is unknown. */
2044 result = cp_build_function_call_vec (fn, args, complain);
2046 if (processing_template_decl)
2048 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2049 KOENIG_LOOKUP_P (result) = koenig_p;
2050 release_tree_vector (orig_args);
2056 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2057 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2058 POSTDECREMENT_EXPR.) */
2061 finish_increment_expr (tree expr, enum tree_code code)
2063 return build_x_unary_op (code, expr, tf_warning_or_error);
2066 /* Finish a use of `this'. Returns an expression for `this'. */
2069 finish_this_expr (void)
2073 if (current_class_ptr)
2075 tree type = TREE_TYPE (current_class_ref);
2077 /* In a lambda expression, 'this' refers to the captured 'this'. */
2078 if (LAMBDA_TYPE_P (type))
2079 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2081 result = current_class_ptr;
2084 else if (current_function_decl
2085 && DECL_STATIC_FUNCTION_P (current_function_decl))
2087 error ("%<this%> is unavailable for static member functions");
2088 result = error_mark_node;
2092 if (current_function_decl)
2093 error ("invalid use of %<this%> in non-member function");
2095 error ("invalid use of %<this%> at top level");
2096 result = error_mark_node;
2102 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2103 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2104 the TYPE for the type given. If SCOPE is non-NULL, the expression
2105 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2108 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2110 if (object == error_mark_node || destructor == error_mark_node)
2111 return error_mark_node;
2113 gcc_assert (TYPE_P (destructor));
2115 if (!processing_template_decl)
2117 if (scope == error_mark_node)
2119 error ("invalid qualifying scope in pseudo-destructor name");
2120 return error_mark_node;
2122 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2124 error ("qualified type %qT does not match destructor name ~%qT",
2126 return error_mark_node;
2130 /* [expr.pseudo] says both:
2132 The type designated by the pseudo-destructor-name shall be
2133 the same as the object type.
2137 The cv-unqualified versions of the object type and of the
2138 type designated by the pseudo-destructor-name shall be the
2141 We implement the more generous second sentence, since that is
2142 what most other compilers do. */
2143 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2146 error ("%qE is not of type %qT", object, destructor);
2147 return error_mark_node;
2151 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2154 /* Finish an expression of the form CODE EXPR. */
2157 finish_unary_op_expr (enum tree_code code, tree expr)
2159 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2160 /* Inside a template, build_x_unary_op does not fold the
2161 expression. So check whether the result is folded before
2162 setting TREE_NEGATED_INT. */
2163 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2164 && TREE_CODE (result) == INTEGER_CST
2165 && !TYPE_UNSIGNED (TREE_TYPE (result))
2166 && INT_CST_LT (result, integer_zero_node))
2168 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2169 setting TREE_NEGATED_INT. */
2170 result = copy_node (result);
2171 TREE_NEGATED_INT (result) = 1;
2173 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2174 overflow_warning (input_location, result);
2179 /* Finish a compound-literal expression. TYPE is the type to which
2180 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2183 finish_compound_literal (tree type, tree compound_literal)
2185 if (type == error_mark_node)
2186 return error_mark_node;
2188 if (!TYPE_OBJ_P (type))
2190 error ("compound literal of non-object type %qT", type);
2191 return error_mark_node;
2194 if (processing_template_decl)
2196 TREE_TYPE (compound_literal) = type;
2197 /* Mark the expression as a compound literal. */
2198 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2199 return compound_literal;
2202 type = complete_type (type);
2204 if (TYPE_NON_AGGREGATE_CLASS (type))
2206 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2207 everywhere that deals with function arguments would be a pain, so
2208 just wrap it in a TREE_LIST. The parser set a flag so we know
2209 that it came from T{} rather than T({}). */
2210 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2211 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2212 return build_functional_cast (type, compound_literal, tf_error);
2215 if (TREE_CODE (type) == ARRAY_TYPE
2216 && check_array_initializer (NULL_TREE, type, compound_literal))
2217 return error_mark_node;
2218 compound_literal = reshape_init (type, compound_literal);
2219 if (TREE_CODE (type) == ARRAY_TYPE)
2220 cp_complete_array_type (&type, compound_literal, false);
2221 compound_literal = digest_init (type, compound_literal);
2222 if ((!at_function_scope_p () || cp_type_readonly (type))
2223 && initializer_constant_valid_p (compound_literal, type))
2225 tree decl = create_temporary_var (type);
2226 DECL_INITIAL (decl) = compound_literal;
2227 TREE_STATIC (decl) = 1;
2228 cp_apply_type_quals_to_decl (cp_type_quals (type), decl);
2229 decl = pushdecl_top_level (decl);
2230 DECL_NAME (decl) = make_anon_name ();
2231 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2235 return get_target_expr (compound_literal);
2238 /* Return the declaration for the function-name variable indicated by
2242 finish_fname (tree id)
2246 decl = fname_decl (input_location, C_RID_CODE (id), id);
2247 if (processing_template_decl)
2248 decl = DECL_NAME (decl);
2252 /* Finish a translation unit. */
2255 finish_translation_unit (void)
2257 /* In case there were missing closebraces,
2258 get us back to the global binding level. */
2260 while (current_namespace != global_namespace)
2263 /* Do file scope __FUNCTION__ et al. */
2264 finish_fname_decls ();
2267 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2268 Returns the parameter. */
2271 finish_template_type_parm (tree aggr, tree identifier)
2273 if (aggr != class_type_node)
2275 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2276 aggr = class_type_node;
2279 return build_tree_list (aggr, identifier);
2282 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2283 Returns the parameter. */
2286 finish_template_template_parm (tree aggr, tree identifier)
2288 tree decl = build_decl (input_location,
2289 TYPE_DECL, identifier, NULL_TREE);
2290 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2291 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2292 DECL_TEMPLATE_RESULT (tmpl) = decl;
2293 DECL_ARTIFICIAL (decl) = 1;
2294 end_template_decl ();
2296 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2298 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2299 /*is_primary=*/true, /*is_partial=*/false,
2302 return finish_template_type_parm (aggr, tmpl);
2305 /* ARGUMENT is the default-argument value for a template template
2306 parameter. If ARGUMENT is invalid, issue error messages and return
2307 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2310 check_template_template_default_arg (tree argument)
2312 if (TREE_CODE (argument) != TEMPLATE_DECL
2313 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2314 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2316 if (TREE_CODE (argument) == TYPE_DECL)
2317 error ("invalid use of type %qT as a default value for a template "
2318 "template-parameter", TREE_TYPE (argument));
2320 error ("invalid default argument for a template template parameter");
2321 return error_mark_node;
2327 /* Begin a class definition, as indicated by T. */
2330 begin_class_definition (tree t, tree attributes)
2332 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2333 return error_mark_node;
2335 if (processing_template_parmlist)
2337 error ("definition of %q#T inside template parameter list", t);
2338 return error_mark_node;
2341 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2342 are passed the same as decimal scalar types. */
2343 if (TREE_CODE (t) == RECORD_TYPE
2344 && !processing_template_decl)
2346 tree ns = TYPE_CONTEXT (t);
2347 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2348 && DECL_CONTEXT (ns) == std_node
2350 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2352 const char *n = TYPE_NAME_STRING (t);
2353 if ((strcmp (n, "decimal32") == 0)
2354 || (strcmp (n, "decimal64") == 0)
2355 || (strcmp (n, "decimal128") == 0))
2356 TYPE_TRANSPARENT_AGGR (t) = 1;
2360 /* A non-implicit typename comes from code like:
2362 template <typename T> struct A {
2363 template <typename U> struct A<T>::B ...
2365 This is erroneous. */
2366 else if (TREE_CODE (t) == TYPENAME_TYPE)
2368 error ("invalid definition of qualified type %qT", t);
2369 t = error_mark_node;
2372 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2374 t = make_class_type (RECORD_TYPE);
2375 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2378 if (TYPE_BEING_DEFINED (t))
2380 t = make_class_type (TREE_CODE (t));
2381 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2383 maybe_process_partial_specialization (t);
2385 TYPE_BEING_DEFINED (t) = 1;
2387 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2389 if (flag_pack_struct)
2392 TYPE_PACKED (t) = 1;
2393 /* Even though the type is being defined for the first time
2394 here, there might have been a forward declaration, so there
2395 might be cv-qualified variants of T. */
2396 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2397 TYPE_PACKED (v) = 1;
2399 /* Reset the interface data, at the earliest possible
2400 moment, as it might have been set via a class foo;
2402 if (! TYPE_ANONYMOUS_P (t))
2404 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2405 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2406 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2407 (t, finfo->interface_unknown);
2409 reset_specialization();
2411 /* Make a declaration for this class in its own scope. */
2412 build_self_reference ();
2417 /* Finish the member declaration given by DECL. */
2420 finish_member_declaration (tree decl)
2422 if (decl == error_mark_node || decl == NULL_TREE)
2425 if (decl == void_type_node)
2426 /* The COMPONENT was a friend, not a member, and so there's
2427 nothing for us to do. */
2430 /* We should see only one DECL at a time. */
2431 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2433 /* Set up access control for DECL. */
2435 = (current_access_specifier == access_private_node);
2436 TREE_PROTECTED (decl)
2437 = (current_access_specifier == access_protected_node);
2438 if (TREE_CODE (decl) == TEMPLATE_DECL)
2440 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2441 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2444 /* Mark the DECL as a member of the current class. */
2445 DECL_CONTEXT (decl) = current_class_type;
2447 /* Check for bare parameter packs in the member variable declaration. */
2448 if (TREE_CODE (decl) == FIELD_DECL)
2450 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2451 TREE_TYPE (decl) = error_mark_node;
2452 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2453 DECL_ATTRIBUTES (decl) = NULL_TREE;
2458 A C language linkage is ignored for the names of class members
2459 and the member function type of class member functions. */
2460 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2461 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2463 /* Put functions on the TYPE_METHODS list and everything else on the
2464 TYPE_FIELDS list. Note that these are built up in reverse order.
2465 We reverse them (to obtain declaration order) in finish_struct. */
2466 if (TREE_CODE (decl) == FUNCTION_DECL
2467 || DECL_FUNCTION_TEMPLATE_P (decl))
2469 /* We also need to add this function to the
2470 CLASSTYPE_METHOD_VEC. */
2471 if (add_method (current_class_type, decl, NULL_TREE))
2473 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2474 TYPE_METHODS (current_class_type) = decl;
2476 maybe_add_class_template_decl_list (current_class_type, decl,
2480 /* Enter the DECL into the scope of the class. */
2481 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2482 || pushdecl_class_level (decl))
2484 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2485 go at the beginning. The reason is that lookup_field_1
2486 searches the list in order, and we want a field name to
2487 override a type name so that the "struct stat hack" will
2488 work. In particular:
2490 struct S { enum E { }; int E } s;
2493 is valid. In addition, the FIELD_DECLs must be maintained in
2494 declaration order so that class layout works as expected.
2495 However, we don't need that order until class layout, so we
2496 save a little time by putting FIELD_DECLs on in reverse order
2497 here, and then reversing them in finish_struct_1. (We could
2498 also keep a pointer to the correct insertion points in the
2501 if (TREE_CODE (decl) == TYPE_DECL)
2502 TYPE_FIELDS (current_class_type)
2503 = chainon (TYPE_FIELDS (current_class_type), decl);
2506 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2507 TYPE_FIELDS (current_class_type) = decl;
2510 maybe_add_class_template_decl_list (current_class_type, decl,
2515 note_decl_for_pch (decl);
2518 /* DECL has been declared while we are building a PCH file. Perform
2519 actions that we might normally undertake lazily, but which can be
2520 performed now so that they do not have to be performed in
2521 translation units which include the PCH file. */
2524 note_decl_for_pch (tree decl)
2526 gcc_assert (pch_file);
2528 /* There's a good chance that we'll have to mangle names at some
2529 point, even if only for emission in debugging information. */
2530 if ((TREE_CODE (decl) == VAR_DECL
2531 || TREE_CODE (decl) == FUNCTION_DECL)
2532 && !processing_template_decl)
2536 /* Finish processing a complete template declaration. The PARMS are
2537 the template parameters. */
2540 finish_template_decl (tree parms)
2543 end_template_decl ();
2545 end_specialization ();
2548 /* Finish processing a template-id (which names a type) of the form
2549 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2550 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2551 the scope of template-id indicated. */
2554 finish_template_type (tree name, tree args, int entering_scope)
2558 decl = lookup_template_class (name, args,
2559 NULL_TREE, NULL_TREE, entering_scope,
2560 tf_warning_or_error | tf_user);
2561 if (decl != error_mark_node)
2562 decl = TYPE_STUB_DECL (decl);
2567 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2568 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2569 BASE_CLASS, or NULL_TREE if an error occurred. The
2570 ACCESS_SPECIFIER is one of
2571 access_{default,public,protected_private}_node. For a virtual base
2572 we set TREE_TYPE. */
2575 finish_base_specifier (tree base, tree access, bool virtual_p)
2579 if (base == error_mark_node)
2581 error ("invalid base-class specification");
2584 else if (! MAYBE_CLASS_TYPE_P (base))
2586 error ("%qT is not a class type", base);
2591 if (cp_type_quals (base) != 0)
2593 error ("base class %qT has cv qualifiers", base);
2594 base = TYPE_MAIN_VARIANT (base);
2596 result = build_tree_list (access, base);
2598 TREE_TYPE (result) = integer_type_node;
2604 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2605 what we found when we tried to do the lookup.
2606 LOCATION is the location of the NAME identifier;
2607 The location is used in the error message*/
2610 qualified_name_lookup_error (tree scope, tree name,
2611 tree decl, location_t location)
2613 if (scope == error_mark_node)
2614 ; /* We already complained. */
2615 else if (TYPE_P (scope))
2617 if (!COMPLETE_TYPE_P (scope))
2618 error_at (location, "incomplete type %qT used in nested name specifier",
2620 else if (TREE_CODE (decl) == TREE_LIST)
2622 error_at (location, "reference to %<%T::%D%> is ambiguous",
2624 print_candidates (decl);
2627 error_at (location, "%qD is not a member of %qT", name, scope);
2629 else if (scope != global_namespace)
2630 error_at (location, "%qD is not a member of %qD", name, scope);
2632 error_at (location, "%<::%D%> has not been declared", name);
2635 /* If FNS is a member function, a set of member functions, or a
2636 template-id referring to one or more member functions, return a
2637 BASELINK for FNS, incorporating the current access context.
2638 Otherwise, return FNS unchanged. */
2641 baselink_for_fns (tree fns)
2646 if (BASELINK_P (fns)
2647 || error_operand_p (fns))
2651 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2652 fn = TREE_OPERAND (fn, 0);
2653 fn = get_first_fn (fn);
2654 if (!DECL_FUNCTION_MEMBER_P (fn))
2657 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2659 cl = DECL_CONTEXT (fn);
2660 cl = TYPE_BINFO (cl);
2661 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2664 /* Returns true iff DECL is an automatic variable from a function outside
2668 outer_automatic_var_p (tree decl)
2670 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2671 && DECL_FUNCTION_SCOPE_P (decl)
2672 && !TREE_STATIC (decl)
2673 && DECL_CONTEXT (decl) != current_function_decl);
2676 /* Returns true iff DECL is a capture field from a lambda that is not our
2677 immediate context. */
2680 outer_lambda_capture_p (tree decl)
2682 return (TREE_CODE (decl) == FIELD_DECL
2683 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2684 && (!current_class_type
2685 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2688 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2689 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2690 if non-NULL, is the type or namespace used to explicitly qualify
2691 ID_EXPRESSION. DECL is the entity to which that name has been
2694 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2695 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2696 be set to true if this expression isn't permitted in a
2697 constant-expression, but it is otherwise not set by this function.
2698 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2699 constant-expression, but a non-constant expression is also
2702 DONE is true if this expression is a complete postfix-expression;
2703 it is false if this expression is followed by '->', '[', '(', etc.
2704 ADDRESS_P is true iff this expression is the operand of '&'.
2705 TEMPLATE_P is true iff the qualified-id was of the form
2706 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2707 appears as a template argument.
2709 If an error occurs, and it is the kind of error that might cause
2710 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2711 is the caller's responsibility to issue the message. *ERROR_MSG
2712 will be a string with static storage duration, so the caller need
2715 Return an expression for the entity, after issuing appropriate
2716 diagnostics. This function is also responsible for transforming a
2717 reference to a non-static member into a COMPONENT_REF that makes
2718 the use of "this" explicit.
2720 Upon return, *IDK will be filled in appropriately. */
2722 finish_id_expression (tree id_expression,
2726 bool integral_constant_expression_p,
2727 bool allow_non_integral_constant_expression_p,
2728 bool *non_integral_constant_expression_p,
2732 bool template_arg_p,
2733 const char **error_msg,
2734 location_t location)
2736 /* Initialize the output parameters. */
2737 *idk = CP_ID_KIND_NONE;
2740 if (id_expression == error_mark_node)
2741 return error_mark_node;
2742 /* If we have a template-id, then no further lookup is
2743 required. If the template-id was for a template-class, we
2744 will sometimes have a TYPE_DECL at this point. */
2745 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2746 || TREE_CODE (decl) == TYPE_DECL)
2748 /* Look up the name. */
2751 if (decl == error_mark_node)
2753 /* Name lookup failed. */
2756 || (!dependent_type_p (scope)
2757 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2758 && IDENTIFIER_TYPENAME_P (id_expression)
2759 && dependent_type_p (TREE_TYPE (id_expression))))))
2761 /* If the qualifying type is non-dependent (and the name
2762 does not name a conversion operator to a dependent
2763 type), issue an error. */
2764 qualified_name_lookup_error (scope, id_expression, decl, location);
2765 return error_mark_node;
2769 /* It may be resolved via Koenig lookup. */
2770 *idk = CP_ID_KIND_UNQUALIFIED;
2771 return id_expression;
2774 decl = id_expression;
2776 /* If DECL is a variable that would be out of scope under
2777 ANSI/ISO rules, but in scope in the ARM, name lookup
2778 will succeed. Issue a diagnostic here. */
2780 decl = check_for_out_of_scope_variable (decl);
2782 /* Remember that the name was used in the definition of
2783 the current class so that we can check later to see if
2784 the meaning would have been different after the class
2785 was entirely defined. */
2786 if (!scope && decl != error_mark_node)
2787 maybe_note_name_used_in_class (id_expression, decl);
2789 /* Disallow uses of local variables from containing functions, except
2790 within lambda-expressions. */
2791 if ((outer_automatic_var_p (decl)
2792 || outer_lambda_capture_p (decl))
2793 /* It's not a use (3.2) if we're in an unevaluated context. */
2794 && !cp_unevaluated_operand)
2796 tree context = DECL_CONTEXT (decl);
2797 tree containing_function = current_function_decl;
2798 tree lambda_stack = NULL_TREE;
2799 tree lambda_expr = NULL_TREE;
2800 tree initializer = decl;
2802 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2803 support for an approach in which a reference to a local
2804 [constant] automatic variable in a nested class or lambda body
2805 would enter the expression as an rvalue, which would reduce
2806 the complexity of the problem"
2808 FIXME update for final resolution of core issue 696. */
2809 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2810 return integral_constant_value (decl);
2812 if (TYPE_P (context))
2814 /* Implicit capture of an explicit capture. */
2815 context = lambda_function (context);
2816 initializer = thisify_lambda_field (decl);
2819 /* If we are in a lambda function, we can move out until we hit
2821 2. a non-lambda function, or
2822 3. a non-default capturing lambda function. */
2823 while (context != containing_function
2824 && LAMBDA_FUNCTION_P (containing_function))
2826 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2827 (DECL_CONTEXT (containing_function));
2829 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2833 lambda_stack = tree_cons (NULL_TREE,
2838 = decl_function_context (containing_function);
2841 if (context == containing_function)
2843 decl = add_default_capture (lambda_stack,
2844 /*id=*/DECL_NAME (decl),
2847 else if (lambda_expr)
2849 error ("%qD is not captured", decl);
2850 return error_mark_node;
2854 error (TREE_CODE (decl) == VAR_DECL
2855 ? "use of %<auto%> variable from containing function"
2856 : "use of parameter from containing function");
2857 error (" %q+#D declared here", decl);
2858 return error_mark_node;
2863 /* If we didn't find anything, or what we found was a type,
2864 then this wasn't really an id-expression. */
2865 if (TREE_CODE (decl) == TEMPLATE_DECL
2866 && !DECL_FUNCTION_TEMPLATE_P (decl))
2868 *error_msg = "missing template arguments";
2869 return error_mark_node;
2871 else if (TREE_CODE (decl) == TYPE_DECL
2872 || TREE_CODE (decl) == NAMESPACE_DECL)
2874 *error_msg = "expected primary-expression";
2875 return error_mark_node;
2878 /* If the name resolved to a template parameter, there is no
2879 need to look it up again later. */
2880 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2881 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2885 *idk = CP_ID_KIND_NONE;
2886 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2887 decl = TEMPLATE_PARM_DECL (decl);
2888 r = convert_from_reference (DECL_INITIAL (decl));
2890 if (integral_constant_expression_p
2891 && !dependent_type_p (TREE_TYPE (decl))
2892 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2894 if (!allow_non_integral_constant_expression_p)
2895 error ("template parameter %qD of type %qT is not allowed in "
2896 "an integral constant expression because it is not of "
2897 "integral or enumeration type", decl, TREE_TYPE (decl));
2898 *non_integral_constant_expression_p = true;
2902 /* Similarly, we resolve enumeration constants to their
2903 underlying values. */
2904 else if (TREE_CODE (decl) == CONST_DECL)
2906 *idk = CP_ID_KIND_NONE;
2907 if (!processing_template_decl)
2909 used_types_insert (TREE_TYPE (decl));
2910 return DECL_INITIAL (decl);
2918 /* If the declaration was explicitly qualified indicate
2919 that. The semantics of `A::f(3)' are different than
2920 `f(3)' if `f' is virtual. */
2922 ? CP_ID_KIND_QUALIFIED
2923 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2924 ? CP_ID_KIND_TEMPLATE_ID
2925 : CP_ID_KIND_UNQUALIFIED));
2930 An id-expression is type-dependent if it contains an
2931 identifier that was declared with a dependent type.
2933 The standard is not very specific about an id-expression that
2934 names a set of overloaded functions. What if some of them
2935 have dependent types and some of them do not? Presumably,
2936 such a name should be treated as a dependent name. */
2937 /* Assume the name is not dependent. */
2938 dependent_p = false;
2939 if (!processing_template_decl)
2940 /* No names are dependent outside a template. */
2942 /* A template-id where the name of the template was not resolved
2943 is definitely dependent. */
2944 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2945 && (TREE_CODE (TREE_OPERAND (decl, 0))
2946 == IDENTIFIER_NODE))
2948 /* For anything except an overloaded function, just check its
2950 else if (!is_overloaded_fn (decl))
2952 = dependent_type_p (TREE_TYPE (decl));
2953 /* For a set of overloaded functions, check each of the
2959 if (BASELINK_P (fns))
2960 fns = BASELINK_FUNCTIONS (fns);
2962 /* For a template-id, check to see if the template
2963 arguments are dependent. */
2964 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2966 tree args = TREE_OPERAND (fns, 1);
2967 dependent_p = any_dependent_template_arguments_p (args);
2968 /* The functions are those referred to by the
2970 fns = TREE_OPERAND (fns, 0);
2973 /* If there are no dependent template arguments, go through
2974 the overloaded functions. */
2975 while (fns && !dependent_p)
2977 tree fn = OVL_CURRENT (fns);
2979 /* Member functions of dependent classes are
2981 if (TREE_CODE (fn) == FUNCTION_DECL
2982 && type_dependent_expression_p (fn))
2984 else if (TREE_CODE (fn) == TEMPLATE_DECL
2985 && dependent_template_p (fn))
2988 fns = OVL_NEXT (fns);
2992 /* If the name was dependent on a template parameter, we will
2993 resolve the name at instantiation time. */
2996 /* Create a SCOPE_REF for qualified names, if the scope is
3002 if (address_p && done)
3003 decl = finish_qualified_id_expr (scope, decl,
3009 tree type = NULL_TREE;
3010 if (DECL_P (decl) && !dependent_scope_p (scope))
3011 type = TREE_TYPE (decl);
3012 decl = build_qualified_name (type,
3018 if (TREE_TYPE (decl))
3019 decl = convert_from_reference (decl);
3022 /* A TEMPLATE_ID already contains all the information we
3024 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3025 return id_expression;
3026 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3027 /* If we found a variable, then name lookup during the
3028 instantiation will always resolve to the same VAR_DECL
3029 (or an instantiation thereof). */
3030 if (TREE_CODE (decl) == VAR_DECL
3031 || TREE_CODE (decl) == PARM_DECL)
3032 return convert_from_reference (decl);
3033 /* The same is true for FIELD_DECL, but we also need to
3034 make sure that the syntax is correct. */
3035 else if (TREE_CODE (decl) == FIELD_DECL)
3037 /* Since SCOPE is NULL here, this is an unqualified name.
3038 Access checking has been performed during name lookup
3039 already. Turn off checking to avoid duplicate errors. */
3040 push_deferring_access_checks (dk_no_check);
3041 decl = finish_non_static_data_member
3043 /*qualifying_scope=*/NULL_TREE);
3044 pop_deferring_access_checks ();
3047 return id_expression;
3050 /* Only certain kinds of names are allowed in constant
3051 expression. Enumerators and template parameters have already
3052 been handled above. */
3053 if (integral_constant_expression_p
3054 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
3055 && ! builtin_valid_in_constant_expr_p (decl))
3057 if (!allow_non_integral_constant_expression_p)
3059 error ("%qD cannot appear in a constant-expression", decl);
3060 return error_mark_node;
3062 *non_integral_constant_expression_p = true;
3065 if (TREE_CODE (decl) == NAMESPACE_DECL)
3067 error ("use of namespace %qD as expression", decl);
3068 return error_mark_node;
3070 else if (DECL_CLASS_TEMPLATE_P (decl))
3072 error ("use of class template %qT as expression", decl);
3073 return error_mark_node;
3075 else if (TREE_CODE (decl) == TREE_LIST)
3077 /* Ambiguous reference to base members. */
3078 error ("request for member %qD is ambiguous in "
3079 "multiple inheritance lattice", id_expression);
3080 print_candidates (decl);
3081 return error_mark_node;
3084 /* Mark variable-like entities as used. Functions are similarly
3085 marked either below or after overload resolution. */
3086 if (TREE_CODE (decl) == VAR_DECL
3087 || TREE_CODE (decl) == PARM_DECL
3088 || TREE_CODE (decl) == RESULT_DECL)
3093 decl = (adjust_result_of_qualified_name_lookup
3094 (decl, scope, current_class_type));
3096 if (TREE_CODE (decl) == FUNCTION_DECL)
3099 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3100 decl = finish_qualified_id_expr (scope,
3108 tree r = convert_from_reference (decl);
3110 if (processing_template_decl && TYPE_P (scope))
3111 r = build_qualified_name (TREE_TYPE (r),
3117 else if (TREE_CODE (decl) == FIELD_DECL)
3119 /* Since SCOPE is NULL here, this is an unqualified name.
3120 Access checking has been performed during name lookup
3121 already. Turn off checking to avoid duplicate errors. */
3122 push_deferring_access_checks (dk_no_check);
3123 decl = finish_non_static_data_member (decl, NULL_TREE,
3124 /*qualifying_scope=*/NULL_TREE);
3125 pop_deferring_access_checks ();
3127 else if (is_overloaded_fn (decl))
3131 first_fn = get_first_fn (decl);
3132 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3133 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3135 if (!really_overloaded_fn (decl))
3136 mark_used (first_fn);
3139 && TREE_CODE (first_fn) == FUNCTION_DECL
3140 && DECL_FUNCTION_MEMBER_P (first_fn)
3141 && !shared_member_p (decl))
3143 /* A set of member functions. */
3144 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3145 return finish_class_member_access_expr (decl, id_expression,
3146 /*template_p=*/false,
3147 tf_warning_or_error);
3150 decl = baselink_for_fns (decl);
3154 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3155 && DECL_CLASS_SCOPE_P (decl))
3157 tree context = context_for_name_lookup (decl);
3158 if (context != current_class_type)
3160 tree path = currently_open_derived_class (context);
3161 perform_or_defer_access_check (TYPE_BINFO (path),
3166 decl = convert_from_reference (decl);
3170 if (TREE_DEPRECATED (decl))
3171 warn_deprecated_use (decl, NULL_TREE);
3176 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3177 use as a type-specifier. */
3180 finish_typeof (tree expr)
3184 if (type_dependent_expression_p (expr))
3186 type = cxx_make_type (TYPEOF_TYPE);
3187 TYPEOF_TYPE_EXPR (type) = expr;
3188 SET_TYPE_STRUCTURAL_EQUALITY (type);
3193 expr = mark_type_use (expr);
3195 type = unlowered_expr_type (expr);
3197 if (!type || type == unknown_type_node)
3199 error ("type of %qE is unknown", expr);
3200 return error_mark_node;
3206 /* Perform C++-specific checks for __builtin_offsetof before calling
3210 finish_offsetof (tree expr)
3212 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3214 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3215 TREE_OPERAND (expr, 2));
3216 return error_mark_node;
3218 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3219 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3220 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3222 if (TREE_CODE (expr) == COMPONENT_REF
3223 || TREE_CODE (expr) == COMPOUND_EXPR)
3224 expr = TREE_OPERAND (expr, 1);
3225 error ("cannot apply %<offsetof%> to member function %qD", expr);
3226 return error_mark_node;
3228 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3229 expr = TREE_OPERAND (expr, 0);
3230 return fold_offsetof (expr, NULL_TREE);
3233 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3234 function is broken out from the above for the benefit of the tree-ssa
3238 simplify_aggr_init_expr (tree *tp)
3240 tree aggr_init_expr = *tp;
3242 /* Form an appropriate CALL_EXPR. */
3243 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3244 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3245 tree type = TREE_TYPE (slot);
3248 enum style_t { ctor, arg, pcc } style;
3250 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3252 #ifdef PCC_STATIC_STRUCT_RETURN
3258 gcc_assert (TREE_ADDRESSABLE (type));
3262 call_expr = build_call_array_loc (input_location,
3263 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3265 aggr_init_expr_nargs (aggr_init_expr),
3266 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3270 /* Replace the first argument to the ctor with the address of the
3272 cxx_mark_addressable (slot);
3273 CALL_EXPR_ARG (call_expr, 0) =
3274 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3276 else if (style == arg)
3278 /* Just mark it addressable here, and leave the rest to
3279 expand_call{,_inline}. */
3280 cxx_mark_addressable (slot);
3281 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3282 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3284 else if (style == pcc)
3286 /* If we're using the non-reentrant PCC calling convention, then we
3287 need to copy the returned value out of the static buffer into the
3289 push_deferring_access_checks (dk_no_check);
3290 call_expr = build_aggr_init (slot, call_expr,
3291 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3292 tf_warning_or_error);
3293 pop_deferring_access_checks ();
3294 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3297 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3299 tree init = build_zero_init (type, NULL_TREE,
3300 /*static_storage_p=*/false);
3301 init = build2 (INIT_EXPR, void_type_node, slot, init);
3302 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3309 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3312 emit_associated_thunks (tree fn)
3314 /* When we use vcall offsets, we emit thunks with the virtual
3315 functions to which they thunk. The whole point of vcall offsets
3316 is so that you can know statically the entire set of thunks that
3317 will ever be needed for a given virtual function, thereby
3318 enabling you to output all the thunks with the function itself. */
3319 if (DECL_VIRTUAL_P (fn)
3320 /* Do not emit thunks for extern template instantiations. */
3321 && ! DECL_REALLY_EXTERN (fn))
3325 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3327 if (!THUNK_ALIAS (thunk))
3329 use_thunk (thunk, /*emit_p=*/1);
3330 if (DECL_RESULT_THUNK_P (thunk))
3334 for (probe = DECL_THUNKS (thunk);
3335 probe; probe = TREE_CHAIN (probe))
3336 use_thunk (probe, /*emit_p=*/1);
3340 gcc_assert (!DECL_THUNKS (thunk));
3345 /* Generate RTL for FN. */
3348 expand_or_defer_fn_1 (tree fn)
3350 /* When the parser calls us after finishing the body of a template
3351 function, we don't really want to expand the body. */
3352 if (processing_template_decl)
3354 /* Normally, collection only occurs in rest_of_compilation. So,
3355 if we don't collect here, we never collect junk generated
3356 during the processing of templates until we hit a
3357 non-template function. It's not safe to do this inside a
3358 nested class, though, as the parser may have local state that
3359 is not a GC root. */
3360 if (!function_depth)
3365 gcc_assert (DECL_SAVED_TREE (fn));
3367 /* If this is a constructor or destructor body, we have to clone
3369 if (maybe_clone_body (fn))
3371 /* We don't want to process FN again, so pretend we've written
3372 it out, even though we haven't. */
3373 TREE_ASM_WRITTEN (fn) = 1;
3374 DECL_SAVED_TREE (fn) = NULL_TREE;
3378 /* We make a decision about linkage for these functions at the end
3379 of the compilation. Until that point, we do not want the back
3380 end to output them -- but we do want it to see the bodies of
3381 these functions so that it can inline them as appropriate. */
3382 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3384 if (DECL_INTERFACE_KNOWN (fn))
3385 /* We've already made a decision as to how this function will
3389 DECL_EXTERNAL (fn) = 1;
3390 DECL_NOT_REALLY_EXTERN (fn) = 1;
3391 note_vague_linkage_fn (fn);
3392 /* A non-template inline function with external linkage will
3393 always be COMDAT. As we must eventually determine the
3394 linkage of all functions, and as that causes writes to
3395 the data mapped in from the PCH file, it's advantageous
3396 to mark the functions at this point. */
3397 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3399 /* This function must have external linkage, as
3400 otherwise DECL_INTERFACE_KNOWN would have been
3402 gcc_assert (TREE_PUBLIC (fn));
3403 comdat_linkage (fn);
3404 DECL_INTERFACE_KNOWN (fn) = 1;
3408 import_export_decl (fn);
3410 /* If the user wants us to keep all inline functions, then mark
3411 this function as needed so that finish_file will make sure to
3412 output it later. Similarly, all dllexport'd functions must
3413 be emitted; there may be callers in other DLLs. */
3414 if ((flag_keep_inline_functions
3415 && DECL_DECLARED_INLINE_P (fn)
3416 && !DECL_REALLY_EXTERN (fn))
3417 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3421 /* There's no reason to do any of the work here if we're only doing
3422 semantic analysis; this code just generates RTL. */
3423 if (flag_syntax_only)
3430 expand_or_defer_fn (tree fn)
3432 if (expand_or_defer_fn_1 (fn))
3436 /* Expand or defer, at the whim of the compilation unit manager. */
3437 cgraph_finalize_function (fn, function_depth > 1);
3438 emit_associated_thunks (fn);
3451 /* Helper function for walk_tree, used by finalize_nrv below. */
3454 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3456 struct nrv_data *dp = (struct nrv_data *)data;
3459 /* No need to walk into types. There wouldn't be any need to walk into
3460 non-statements, except that we have to consider STMT_EXPRs. */
3463 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3464 but differs from using NULL_TREE in that it indicates that we care
3465 about the value of the RESULT_DECL. */
3466 else if (TREE_CODE (*tp) == RETURN_EXPR)
3467 TREE_OPERAND (*tp, 0) = dp->result;
3468 /* Change all cleanups for the NRV to only run when an exception is
3470 else if (TREE_CODE (*tp) == CLEANUP_STMT
3471 && CLEANUP_DECL (*tp) == dp->var)
3472 CLEANUP_EH_ONLY (*tp) = 1;
3473 /* Replace the DECL_EXPR for the NRV with an initialization of the
3474 RESULT_DECL, if needed. */
3475 else if (TREE_CODE (*tp) == DECL_EXPR
3476 && DECL_EXPR_DECL (*tp) == dp->var)
3479 if (DECL_INITIAL (dp->var)
3480 && DECL_INITIAL (dp->var) != error_mark_node)
3481 init = build2 (INIT_EXPR, void_type_node, dp->result,
3482 DECL_INITIAL (dp->var));
3484 init = build_empty_stmt (EXPR_LOCATION (*tp));
3485 DECL_INITIAL (dp->var) = NULL_TREE;
3486 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3489 /* And replace all uses of the NRV with the RESULT_DECL. */
3490 else if (*tp == dp->var)
3493 /* Avoid walking into the same tree more than once. Unfortunately, we
3494 can't just use walk_tree_without duplicates because it would only call
3495 us for the first occurrence of dp->var in the function body. */
3496 slot = htab_find_slot (dp->visited, *tp, INSERT);
3502 /* Keep iterating. */
3506 /* Called from finish_function to implement the named return value
3507 optimization by overriding all the RETURN_EXPRs and pertinent
3508 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3509 RESULT_DECL for the function. */
3512 finalize_nrv (tree *tp, tree var, tree result)
3514 struct nrv_data data;
3516 /* Copy debugging information from VAR to RESULT. */
3517 DECL_NAME (result) = DECL_NAME (var);
3518 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3519 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3520 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3521 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3522 /* Don't forget that we take its address. */
3523 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3526 data.result = result;
3527 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3528 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3529 htab_delete (data.visited);
3532 /* Return the declaration for the function called by CALL_EXPR T,
3533 TYPE is the class type of the clause decl. */
3536 omp_clause_info_fndecl (tree t, tree type)
3538 tree ret = get_callee_fndecl (t);
3543 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3544 t = CALL_EXPR_FN (t);
3546 if (TREE_CODE (t) == OBJ_TYPE_REF)
3548 t = cp_fold_obj_type_ref (t, type);
3549 if (TREE_CODE (t) == ADDR_EXPR
3550 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3551 return TREE_OPERAND (t, 0);
3557 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3560 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3561 bool need_copy_ctor, bool need_copy_assignment)
3563 int save_errorcount = errorcount;
3566 /* Always allocate 3 elements for simplicity. These are the
3567 function decls for the ctor, dtor, and assignment op.
3568 This layout is known to the three lang hooks,
3569 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3570 and cxx_omp_clause_assign_op. */
3571 info = make_tree_vec (3);
3572 CP_OMP_CLAUSE_INFO (c) = info;
3574 if (need_default_ctor
3575 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3579 if (need_default_ctor)
3583 t = build_int_cst (build_pointer_type (type), 0);
3584 t = build1 (INDIRECT_REF, type, t);
3585 vec = make_tree_vector_single (t);
3587 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3588 &vec, type, LOOKUP_NORMAL,
3589 tf_warning_or_error);
3592 release_tree_vector (vec);
3594 if (targetm.cxx.cdtor_returns_this () || errorcount)
3595 /* Because constructors and destructors return this,
3596 the call will have been cast to "void". Remove the
3597 cast here. We would like to use STRIP_NOPS, but it
3598 wouldn't work here because TYPE_MODE (t) and
3599 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3600 They are VOIDmode and Pmode, respectively. */
3601 if (TREE_CODE (t) == NOP_EXPR)
3602 t = TREE_OPERAND (t, 0);
3604 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3607 if ((need_default_ctor || need_copy_ctor)
3608 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3610 t = build_int_cst (build_pointer_type (type), 0);
3611 t = build1 (INDIRECT_REF, type, t);
3612 t = build_special_member_call (t, complete_dtor_identifier,
3613 NULL, type, LOOKUP_NORMAL,
3614 tf_warning_or_error);
3616 if (targetm.cxx.cdtor_returns_this () || errorcount)
3617 /* Because constructors and destructors return this,
3618 the call will have been cast to "void". Remove the
3619 cast here. We would like to use STRIP_NOPS, but it
3620 wouldn't work here because TYPE_MODE (t) and
3621 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3622 They are VOIDmode and Pmode, respectively. */
3623 if (TREE_CODE (t) == NOP_EXPR)
3624 t = TREE_OPERAND (t, 0);
3626 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3629 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3633 t = build_int_cst (build_pointer_type (type), 0);
3634 t = build1 (INDIRECT_REF, type, t);
3635 vec = make_tree_vector_single (t);
3636 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3637 &vec, type, LOOKUP_NORMAL,
3638 tf_warning_or_error);
3639 release_tree_vector (vec);
3641 /* We'll have called convert_from_reference on the call, which
3642 may well have added an indirect_ref. It's unneeded here,
3643 and in the way, so kill it. */
3644 if (TREE_CODE (t) == INDIRECT_REF)
3645 t = TREE_OPERAND (t, 0);
3647 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3650 return errorcount != save_errorcount;
3653 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3654 Remove any elements from the list that are invalid. */
3657 finish_omp_clauses (tree clauses)
3659 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3660 tree c, t, *pc = &clauses;
3663 bitmap_obstack_initialize (NULL);
3664 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3665 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3666 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3668 for (pc = &clauses, c = clauses; c ; c = *pc)
3670 bool remove = false;
3672 switch (OMP_CLAUSE_CODE (c))
3674 case OMP_CLAUSE_SHARED:
3676 goto check_dup_generic;
3677 case OMP_CLAUSE_PRIVATE:
3679 goto check_dup_generic;
3680 case OMP_CLAUSE_REDUCTION:
3682 goto check_dup_generic;
3683 case OMP_CLAUSE_COPYPRIVATE:
3684 name = "copyprivate";
3685 goto check_dup_generic;
3686 case OMP_CLAUSE_COPYIN:
3688 goto check_dup_generic;
3690 t = OMP_CLAUSE_DECL (c);
3691 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3693 if (processing_template_decl)
3696 error ("%qD is not a variable in clause %qs", t, name);
3698 error ("%qE is not a variable in clause %qs", t, name);
3701 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3702 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3703 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3705 error ("%qD appears more than once in data clauses", t);
3709 bitmap_set_bit (&generic_head, DECL_UID (t));
3712 case OMP_CLAUSE_FIRSTPRIVATE:
3713 t = OMP_CLAUSE_DECL (c);
3714 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3716 if (processing_template_decl)
3719 error ("%qD is not a variable in clause %<firstprivate%>", t);
3721 error ("%qE is not a variable in clause %<firstprivate%>", t);
3724 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3725 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3727 error ("%qD appears more than once in data clauses", t);
3731 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3734 case OMP_CLAUSE_LASTPRIVATE:
3735 t = OMP_CLAUSE_DECL (c);
3736 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3738 if (processing_template_decl)
3741 error ("%qD is not a variable in clause %<lastprivate%>", t);
3743 error ("%qE is not a variable in clause %<lastprivate%>", t);
3746 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3747 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3749 error ("%qD appears more than once in data clauses", t);
3753 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3757 t = OMP_CLAUSE_IF_EXPR (c);
3758 t = maybe_convert_cond (t);
3759 if (t == error_mark_node)
3761 OMP_CLAUSE_IF_EXPR (c) = t;
3764 case OMP_CLAUSE_NUM_THREADS:
3765 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3766 if (t == error_mark_node)
3768 else if (!type_dependent_expression_p (t)
3769 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3771 error ("num_threads expression must be integral");
3776 case OMP_CLAUSE_SCHEDULE:
3777 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3780 else if (t == error_mark_node)
3782 else if (!type_dependent_expression_p (t)
3783 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3785 error ("schedule chunk size expression must be integral");
3790 case OMP_CLAUSE_NOWAIT:
3791 case OMP_CLAUSE_ORDERED:
3792 case OMP_CLAUSE_DEFAULT:
3793 case OMP_CLAUSE_UNTIED:
3794 case OMP_CLAUSE_COLLAPSE:
3802 *pc = OMP_CLAUSE_CHAIN (c);
3804 pc = &OMP_CLAUSE_CHAIN (c);
3807 for (pc = &clauses, c = clauses; c ; c = *pc)
3809 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3810 bool remove = false;
3811 bool need_complete_non_reference = false;
3812 bool need_default_ctor = false;
3813 bool need_copy_ctor = false;
3814 bool need_copy_assignment = false;
3815 bool need_implicitly_determined = false;
3816 tree type, inner_type;
3820 case OMP_CLAUSE_SHARED:
3822 need_implicitly_determined = true;
3824 case OMP_CLAUSE_PRIVATE:
3826 need_complete_non_reference = true;
3827 need_default_ctor = true;
3828 need_implicitly_determined = true;
3830 case OMP_CLAUSE_FIRSTPRIVATE:
3831 name = "firstprivate";
3832 need_complete_non_reference = true;
3833 need_copy_ctor = true;
3834 need_implicitly_determined = true;
3836 case OMP_CLAUSE_LASTPRIVATE:
3837 name = "lastprivate";
3838 need_complete_non_reference = true;
3839 need_copy_assignment = true;
3840 need_implicitly_determined = true;
3842 case OMP_CLAUSE_REDUCTION:
3844 need_implicitly_determined = true;
3846 case OMP_CLAUSE_COPYPRIVATE:
3847 name = "copyprivate";
3848 need_copy_assignment = true;
3850 case OMP_CLAUSE_COPYIN:
3852 need_copy_assignment = true;
3855 pc = &OMP_CLAUSE_CHAIN (c);
3859 t = OMP_CLAUSE_DECL (c);
3860 if (processing_template_decl
3861 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3863 pc = &OMP_CLAUSE_CHAIN (c);
3869 case OMP_CLAUSE_LASTPRIVATE:
3870 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3871 need_default_ctor = true;
3874 case OMP_CLAUSE_REDUCTION:
3875 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3876 || POINTER_TYPE_P (TREE_TYPE (t)))
3878 error ("%qE has invalid type for %<reduction%>", t);
3881 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3883 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3891 error ("%qE has invalid type for %<reduction(%s)%>",
3892 t, operator_name_info[r_code].name);
3898 case OMP_CLAUSE_COPYIN:
3899 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3901 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3910 if (need_complete_non_reference)
3912 t = require_complete_type (t);
3913 if (t == error_mark_node)
3915 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3917 error ("%qE has reference type for %qs", t, name);
3921 if (need_implicitly_determined)
3923 const char *share_name = NULL;
3925 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3926 share_name = "threadprivate";
3927 else switch (cxx_omp_predetermined_sharing (t))
3929 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3931 case OMP_CLAUSE_DEFAULT_SHARED:
3932 share_name = "shared";
3934 case OMP_CLAUSE_DEFAULT_PRIVATE:
3935 share_name = "private";
3942 error ("%qE is predetermined %qs for %qs",
3943 t, share_name, name);
3948 /* We're interested in the base element, not arrays. */
3949 inner_type = type = TREE_TYPE (t);
3950 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3951 inner_type = TREE_TYPE (inner_type);
3953 /* Check for special function availability by building a call to one.
3954 Save the results, because later we won't be in the right context
3955 for making these queries. */
3956 if (CLASS_TYPE_P (inner_type)
3957 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3958 && !type_dependent_expression_p (t)
3959 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3960 need_copy_ctor, need_copy_assignment))
3964 *pc = OMP_CLAUSE_CHAIN (c);
3966 pc = &OMP_CLAUSE_CHAIN (c);
3969 bitmap_obstack_release (NULL);
3973 /* For all variables in the tree_list VARS, mark them as thread local. */
3976 finish_omp_threadprivate (tree vars)
3980 /* Mark every variable in VARS to be assigned thread local storage. */
3981 for (t = vars; t; t = TREE_CHAIN (t))
3983 tree v = TREE_PURPOSE (t);
3985 if (error_operand_p (v))
3987 else if (TREE_CODE (v) != VAR_DECL)
3988 error ("%<threadprivate%> %qD is not file, namespace "
3989 "or block scope variable", v);
3990 /* If V had already been marked threadprivate, it doesn't matter
3991 whether it had been used prior to this point. */
3992 else if (TREE_USED (v)
3993 && (DECL_LANG_SPECIFIC (v) == NULL
3994 || !CP_DECL_THREADPRIVATE_P (v)))
3995 error ("%qE declared %<threadprivate%> after first use", v);
3996 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3997 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3998 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3999 error ("%<threadprivate%> %qE has incomplete type", v);
4000 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4001 && CP_DECL_CONTEXT (v) != current_class_type)
4002 error ("%<threadprivate%> %qE directive not "
4003 "in %qT definition", v, CP_DECL_CONTEXT (v));
4006 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4007 if (DECL_LANG_SPECIFIC (v) == NULL)
4009 retrofit_lang_decl (v);
4011 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4012 after the allocation of the lang_decl structure. */
4013 if (DECL_DISCRIMINATOR_P (v))
4014 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4017 if (! DECL_THREAD_LOCAL_P (v))
4019 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4020 /* If rtl has been already set for this var, call
4021 make_decl_rtl once again, so that encode_section_info
4022 has a chance to look at the new decl flags. */
4023 if (DECL_RTL_SET_P (v))
4026 CP_DECL_THREADPRIVATE_P (v) = 1;
4031 /* Build an OpenMP structured block. */
4034 begin_omp_structured_block (void)
4036 return do_pushlevel (sk_omp);
4040 finish_omp_structured_block (tree block)
4042 return do_poplevel (block);
4045 /* Similarly, except force the retention of the BLOCK. */
4048 begin_omp_parallel (void)
4050 keep_next_level (true);
4051 return begin_omp_structured_block ();
4055 finish_omp_parallel (tree clauses, tree body)
4059 body = finish_omp_structured_block (body);
4061 stmt = make_node (OMP_PARALLEL);
4062 TREE_TYPE (stmt) = void_type_node;
4063 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4064 OMP_PARALLEL_BODY (stmt) = body;
4066 return add_stmt (stmt);
4070 begin_omp_task (void)
4072 keep_next_level (true);
4073 return begin_omp_structured_block ();
4077 finish_omp_task (tree clauses, tree body)
4081 body = finish_omp_structured_block (body);
4083 stmt = make_node (OMP_TASK);
4084 TREE_TYPE (stmt) = void_type_node;
4085 OMP_TASK_CLAUSES (stmt) = clauses;
4086 OMP_TASK_BODY (stmt) = body;
4088 return add_stmt (stmt);
4091 /* Helper function for finish_omp_for. Convert Ith random access iterator
4092 into integral iterator. Return FALSE if successful. */
4095 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4096 tree condv, tree incrv, tree *body,
4097 tree *pre_body, tree clauses)
4099 tree diff, iter_init, iter_incr = NULL, last;
4100 tree incr_var = NULL, orig_pre_body, orig_body, c;
4101 tree decl = TREE_VEC_ELT (declv, i);
4102 tree init = TREE_VEC_ELT (initv, i);
4103 tree cond = TREE_VEC_ELT (condv, i);
4104 tree incr = TREE_VEC_ELT (incrv, i);
4106 location_t elocus = locus;
4108 if (init && EXPR_HAS_LOCATION (init))
4109 elocus = EXPR_LOCATION (init);
4111 switch (TREE_CODE (cond))
4117 if (TREE_OPERAND (cond, 1) == iter)
4118 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4119 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4120 if (TREE_OPERAND (cond, 0) != iter)
4121 cond = error_mark_node;
4124 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4125 TREE_OPERAND (cond, 1), ERROR_MARK,
4126 NULL, tf_warning_or_error);
4127 if (error_operand_p (tem))
4132 cond = error_mark_node;
4135 if (cond == error_mark_node)
4137 error_at (elocus, "invalid controlling predicate");
4140 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4141 ERROR_MARK, iter, ERROR_MARK, NULL,
4142 tf_warning_or_error);
4143 if (error_operand_p (diff))
4145 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4147 error_at (elocus, "difference between %qE and %qD does not have integer type",
4148 TREE_OPERAND (cond, 1), iter);
4152 switch (TREE_CODE (incr))
4154 case PREINCREMENT_EXPR:
4155 case PREDECREMENT_EXPR:
4156 case POSTINCREMENT_EXPR:
4157 case POSTDECREMENT_EXPR:
4158 if (TREE_OPERAND (incr, 0) != iter)
4160 incr = error_mark_node;
4163 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4164 tf_warning_or_error);
4165 if (error_operand_p (iter_incr))
4167 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4168 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4169 incr = integer_one_node;
4171 incr = integer_minus_one_node;
4174 if (TREE_OPERAND (incr, 0) != iter)
4175 incr = error_mark_node;
4176 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4177 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4179 tree rhs = TREE_OPERAND (incr, 1);
4180 if (TREE_OPERAND (rhs, 0) == iter)
4182 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4184 incr = error_mark_node;
4187 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4188 TREE_OPERAND (rhs, 1),
4189 tf_warning_or_error);
4190 if (error_operand_p (iter_incr))
4192 incr = TREE_OPERAND (rhs, 1);
4193 incr = cp_convert (TREE_TYPE (diff), incr);
4194 if (TREE_CODE (rhs) == MINUS_EXPR)
4196 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4197 incr = fold_if_not_in_template (incr);
4199 if (TREE_CODE (incr) != INTEGER_CST
4200 && (TREE_CODE (incr) != NOP_EXPR
4201 || (TREE_CODE (TREE_OPERAND (incr, 0))
4206 else if (TREE_OPERAND (rhs, 1) == iter)
4208 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4209 || TREE_CODE (rhs) != PLUS_EXPR)
4210 incr = error_mark_node;
4213 iter_incr = build_x_binary_op (PLUS_EXPR,
4214 TREE_OPERAND (rhs, 0),
4217 tf_warning_or_error);
4218 if (error_operand_p (iter_incr))
4220 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4222 tf_warning_or_error);
4223 if (error_operand_p (iter_incr))
4225 incr = TREE_OPERAND (rhs, 0);
4230 incr = error_mark_node;
4233 incr = error_mark_node;
4236 incr = error_mark_node;
4240 if (incr == error_mark_node)
4242 error_at (elocus, "invalid increment expression");
4246 incr = cp_convert (TREE_TYPE (diff), incr);
4247 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4248 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4249 && OMP_CLAUSE_DECL (c) == iter)
4252 decl = create_temporary_var (TREE_TYPE (diff));
4254 add_decl_expr (decl);
4255 last = create_temporary_var (TREE_TYPE (diff));
4257 add_decl_expr (last);
4258 if (c && iter_incr == NULL)
4260 incr_var = create_temporary_var (TREE_TYPE (diff));
4261 pushdecl (incr_var);
4262 add_decl_expr (incr_var);
4264 gcc_assert (stmts_are_full_exprs_p ());
4266 orig_pre_body = *pre_body;
4267 *pre_body = push_stmt_list ();
4269 add_stmt (orig_pre_body);
4271 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4272 tf_warning_or_error));
4273 init = build_int_cst (TREE_TYPE (diff), 0);
4274 if (c && iter_incr == NULL)
4276 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4277 incr, tf_warning_or_error));
4279 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4280 tf_warning_or_error);
4282 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4283 tf_warning_or_error));
4284 *pre_body = pop_stmt_list (*pre_body);
4286 cond = cp_build_binary_op (elocus,
4287 TREE_CODE (cond), decl, diff,
4288 tf_warning_or_error);
4289 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4290 elocus, incr, NULL_TREE);
4293 *body = push_stmt_list ();
4294 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4295 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4296 tf_warning_or_error);
4297 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4298 finish_expr_stmt (iter_init);
4299 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4300 tf_warning_or_error));
4301 add_stmt (orig_body);
4302 *body = pop_stmt_list (*body);
4306 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4307 finish_expr_stmt (iter_incr);
4308 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4309 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4312 TREE_VEC_ELT (declv, i) = decl;
4313 TREE_VEC_ELT (initv, i) = init;
4314 TREE_VEC_ELT (condv, i) = cond;
4315 TREE_VEC_ELT (incrv, i) = incr;
4320 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4321 are directly for their associated operands in the statement. DECL
4322 and INIT are a combo; if DECL is NULL then INIT ought to be a
4323 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4324 optional statements that need to go before the loop into its
4328 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4329 tree incrv, tree body, tree pre_body, tree clauses)
4331 tree omp_for = NULL, orig_incr = NULL;
4332 tree decl, init, cond, incr;
4336 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4337 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4338 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4339 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4341 decl = TREE_VEC_ELT (declv, i);
4342 init = TREE_VEC_ELT (initv, i);
4343 cond = TREE_VEC_ELT (condv, i);
4344 incr = TREE_VEC_ELT (incrv, i);
4350 switch (TREE_CODE (init))
4353 decl = TREE_OPERAND (init, 0);
4354 init = TREE_OPERAND (init, 1);
4357 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4359 decl = TREE_OPERAND (init, 0);
4360 init = TREE_OPERAND (init, 2);
4370 "expected iteration declaration or initialization");
4375 if (init && EXPR_HAS_LOCATION (init))
4376 elocus = EXPR_LOCATION (init);
4380 error_at (elocus, "missing controlling predicate");
4386 error_at (elocus, "missing increment expression");
4390 TREE_VEC_ELT (declv, i) = decl;
4391 TREE_VEC_ELT (initv, i) = init;
4394 if (dependent_omp_for_p (declv, initv, condv, incrv))
4398 stmt = make_node (OMP_FOR);
4400 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4402 /* This is really just a place-holder. We'll be decomposing this
4403 again and going through the cp_build_modify_expr path below when
4404 we instantiate the thing. */
4405 TREE_VEC_ELT (initv, i)
4406 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4407 TREE_VEC_ELT (initv, i));
4410 TREE_TYPE (stmt) = void_type_node;
4411 OMP_FOR_INIT (stmt) = initv;
4412 OMP_FOR_COND (stmt) = condv;
4413 OMP_FOR_INCR (stmt) = incrv;
4414 OMP_FOR_BODY (stmt) = body;
4415 OMP_FOR_PRE_BODY (stmt) = pre_body;
4416 OMP_FOR_CLAUSES (stmt) = clauses;
4418 SET_EXPR_LOCATION (stmt, locus);
4419 return add_stmt (stmt);
4422 if (processing_template_decl)
4423 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4425 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4427 decl = TREE_VEC_ELT (declv, i);
4428 init = TREE_VEC_ELT (initv, i);
4429 cond = TREE_VEC_ELT (condv, i);
4430 incr = TREE_VEC_ELT (incrv, i);
4432 TREE_VEC_ELT (orig_incr, i) = incr;
4435 if (init && EXPR_HAS_LOCATION (init))
4436 elocus = EXPR_LOCATION (init);
4440 error_at (elocus, "expected iteration declaration or initialization");
4444 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4447 TREE_VEC_ELT (orig_incr, i) = incr;
4448 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4449 TREE_CODE (TREE_OPERAND (incr, 1)),
4450 TREE_OPERAND (incr, 2),
4451 tf_warning_or_error);
4454 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4456 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4457 incrv, &body, &pre_body, clauses))
4462 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4463 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4465 error_at (elocus, "invalid type for iteration variable %qE", decl);
4469 if (!processing_template_decl)
4471 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4472 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4475 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4477 && TREE_SIDE_EFFECTS (cond)
4478 && COMPARISON_CLASS_P (cond)
4479 && !processing_template_decl)
4481 tree t = TREE_OPERAND (cond, 0);
4482 if (TREE_SIDE_EFFECTS (t)
4484 && (TREE_CODE (t) != NOP_EXPR
4485 || TREE_OPERAND (t, 0) != decl))
4486 TREE_OPERAND (cond, 0)
4487 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4489 t = TREE_OPERAND (cond, 1);
4490 if (TREE_SIDE_EFFECTS (t)
4492 && (TREE_CODE (t) != NOP_EXPR
4493 || TREE_OPERAND (t, 0) != decl))
4494 TREE_OPERAND (cond, 1)
4495 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4497 if (decl == error_mark_node || init == error_mark_node)
4500 TREE_VEC_ELT (declv, i) = decl;
4501 TREE_VEC_ELT (initv, i) = init;
4502 TREE_VEC_ELT (condv, i) = cond;
4503 TREE_VEC_ELT (incrv, i) = incr;
4507 if (IS_EMPTY_STMT (pre_body))
4510 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4513 if (omp_for == NULL)
4516 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4518 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4519 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4521 if (TREE_CODE (incr) != MODIFY_EXPR)
4524 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4525 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4526 && !processing_template_decl)
4528 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4529 if (TREE_SIDE_EFFECTS (t)
4531 && (TREE_CODE (t) != NOP_EXPR
4532 || TREE_OPERAND (t, 0) != decl))
4533 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4534 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4536 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4537 if (TREE_SIDE_EFFECTS (t)
4539 && (TREE_CODE (t) != NOP_EXPR
4540 || TREE_OPERAND (t, 0) != decl))
4541 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4542 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4546 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4548 if (omp_for != NULL)
4549 OMP_FOR_CLAUSES (omp_for) = clauses;
4554 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4563 dependent_p = false;
4566 /* Even in a template, we can detect invalid uses of the atomic
4567 pragma if neither LHS nor RHS is type-dependent. */
4568 if (processing_template_decl)
4570 dependent_p = (type_dependent_expression_p (lhs)
4571 || type_dependent_expression_p (rhs));
4574 lhs = build_non_dependent_expr (lhs);
4575 rhs = build_non_dependent_expr (rhs);
4580 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4581 if (stmt == error_mark_node)
4584 if (processing_template_decl)
4585 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4586 build2 (code, void_type_node, orig_lhs, orig_rhs));
4591 finish_omp_barrier (void)
4593 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4594 VEC(tree,gc) *vec = make_tree_vector ();
4595 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4596 release_tree_vector (vec);
4597 finish_expr_stmt (stmt);
4601 finish_omp_flush (void)
4603 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4604 VEC(tree,gc) *vec = make_tree_vector ();
4605 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4606 release_tree_vector (vec);
4607 finish_expr_stmt (stmt);
4611 finish_omp_taskwait (void)
4613 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4614 VEC(tree,gc) *vec = make_tree_vector ();
4615 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4616 release_tree_vector (vec);
4617 finish_expr_stmt (stmt);
4621 init_cp_semantics (void)
4625 /* Build a STATIC_ASSERT for a static assertion with the condition
4626 CONDITION and the message text MESSAGE. LOCATION is the location
4627 of the static assertion in the source code. When MEMBER_P, this
4628 static assertion is a member of a class. */
4630 finish_static_assert (tree condition, tree message, location_t location,
4633 if (check_for_bare_parameter_packs (condition))
4634 condition = error_mark_node;
4636 if (type_dependent_expression_p (condition)
4637 || value_dependent_expression_p (condition))
4639 /* We're in a template; build a STATIC_ASSERT and put it in
4643 assertion = make_node (STATIC_ASSERT);
4644 STATIC_ASSERT_CONDITION (assertion) = condition;
4645 STATIC_ASSERT_MESSAGE (assertion) = message;
4646 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4649 maybe_add_class_template_decl_list (current_class_type,
4653 add_stmt (assertion);
4658 /* Fold the expression and convert it to a boolean value. */
4659 condition = fold_non_dependent_expr (condition);
4660 condition = cp_convert (boolean_type_node, condition);
4662 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4663 /* Do nothing; the condition is satisfied. */
4667 location_t saved_loc = input_location;
4669 input_location = location;
4670 if (TREE_CODE (condition) == INTEGER_CST
4671 && integer_zerop (condition))
4672 /* Report the error. */
4673 error ("static assertion failed: %E", message);
4674 else if (condition && condition != error_mark_node)
4675 error ("non-constant condition for static assertion");
4676 input_location = saved_loc;
4680 /* Returns the type of EXPR for cases where we can determine it even though
4681 EXPR is a type-dependent expression. */
4684 describable_type (tree expr)
4686 tree type = NULL_TREE;
4688 if (! type_dependent_expression_p (expr)
4689 && ! type_unknown_p (expr))
4691 type = unlowered_expr_type (expr);
4692 if (real_lvalue_p (expr))
4693 type = build_reference_type (type);
4699 switch (TREE_CODE (expr))
4705 return TREE_TYPE (expr);
4710 case TEMPLATE_PARM_INDEX:
4712 case STATIC_CAST_EXPR:
4713 case REINTERPRET_CAST_EXPR:
4714 case CONST_CAST_EXPR:
4715 case DYNAMIC_CAST_EXPR:
4716 type = TREE_TYPE (expr);
4721 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4722 if (ptrtype && POINTER_TYPE_P (ptrtype))
4723 type = build_reference_type (TREE_TYPE (ptrtype));
4728 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4729 type = TREE_TYPE (expr);
4733 if (type && type_uses_auto (type))
4739 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4740 suitable for use as a type-specifier.
4742 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4743 id-expression or a class member access, FALSE when it was parsed as
4744 a full expression. */
4747 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4749 tree orig_expr = expr;
4750 tree type = NULL_TREE;
4752 if (!expr || error_operand_p (expr))
4753 return error_mark_node;
4756 || TREE_CODE (expr) == TYPE_DECL
4757 || (TREE_CODE (expr) == BIT_NOT_EXPR
4758 && TYPE_P (TREE_OPERAND (expr, 0))))
4760 error ("argument to decltype must be an expression");
4761 return error_mark_node;
4764 if (type_dependent_expression_p (expr)
4765 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4766 if it isn't dependent, so that we can check access control at
4767 instantiation time, so defer the decltype as well (PR 42277). */
4768 || (id_expression_or_member_access_p
4769 && processing_template_decl
4770 && TREE_CODE (expr) == COMPONENT_REF))
4772 if (id_expression_or_member_access_p)
4774 switch (TREE_CODE (expr))
4781 case TEMPLATE_PARM_INDEX:
4782 type = TREE_TYPE (expr);
4790 if (type && !type_uses_auto (type))
4794 type = cxx_make_type (DECLTYPE_TYPE);
4795 DECLTYPE_TYPE_EXPR (type) = expr;
4796 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4797 = id_expression_or_member_access_p;
4798 SET_TYPE_STRUCTURAL_EQUALITY (type);
4803 /* The type denoted by decltype(e) is defined as follows: */
4805 expr = resolve_nondeduced_context (expr);
4807 /* To get the size of a static data member declared as an array of
4808 unknown bound, we need to instantiate it. */
4809 if (TREE_CODE (expr) == VAR_DECL
4810 && VAR_HAD_UNKNOWN_BOUND (expr)
4811 && DECL_TEMPLATE_INSTANTIATION (expr))
4812 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
4814 if (id_expression_or_member_access_p)
4816 /* If e is an id-expression or a class member access (5.2.5
4817 [expr.ref]), decltype(e) is defined as the type of the entity
4818 named by e. If there is no such entity, or e names a set of
4819 overloaded functions, the program is ill-formed. */
4820 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4821 expr = lookup_name (expr);
4823 if (TREE_CODE (expr) == INDIRECT_REF)
4824 /* This can happen when the expression is, e.g., "a.b". Just
4825 look at the underlying operand. */
4826 expr = TREE_OPERAND (expr, 0);
4828 if (TREE_CODE (expr) == OFFSET_REF
4829 || TREE_CODE (expr) == MEMBER_REF)
4830 /* We're only interested in the field itself. If it is a
4831 BASELINK, we will need to see through it in the next
4833 expr = TREE_OPERAND (expr, 1);
4835 if (TREE_CODE (expr) == BASELINK)
4836 /* See through BASELINK nodes to the underlying functions. */
4837 expr = BASELINK_FUNCTIONS (expr);
4839 if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
4840 expr = TREE_OPERAND (expr, 0);
4842 if (TREE_CODE (expr) == OVERLOAD)
4844 if (OVL_CHAIN (expr)
4845 || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL)
4847 error ("%qE refers to a set of overloaded functions", orig_expr);
4848 return error_mark_node;
4851 /* An overload set containing only one function: just look
4852 at that function. */
4853 expr = OVL_FUNCTION (expr);
4856 switch (TREE_CODE (expr))
4859 if (DECL_BIT_FIELD_TYPE (expr))
4861 type = DECL_BIT_FIELD_TYPE (expr);
4864 /* Fall through for fields that aren't bitfields. */
4871 case TEMPLATE_PARM_INDEX:
4872 expr = mark_type_use (expr);
4873 type = TREE_TYPE (expr);
4877 type = error_mark_node;
4881 mark_type_use (expr);
4882 type = is_bitfield_expr_with_lowered_type (expr);
4884 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4891 /* We can get here when the id-expression refers to an
4893 type = TREE_TYPE (expr);
4897 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4898 || TREE_CODE (expr) == SCOPE_REF);
4899 error ("argument to decltype must be an expression");
4900 return error_mark_node;
4905 /* Expressions of reference type are sometimes wrapped in
4906 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4907 representation, not part of the language, so we have to look
4909 if (TREE_CODE (expr) == INDIRECT_REF
4910 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4912 expr = TREE_OPERAND (expr, 0);
4914 if (TREE_CODE (expr) == CALL_EXPR)
4916 /* If e is a function call (5.2.2 [expr.call]) or an
4917 invocation of an overloaded operator (parentheses around e
4918 are ignored), decltype(e) is defined as the return type of
4920 tree fndecl = get_callee_fndecl (expr);
4921 if (fndecl && fndecl != error_mark_node)
4922 type = TREE_TYPE (TREE_TYPE (fndecl));
4925 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4926 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4927 || TREE_CODE (target_type) == POINTER_TYPE)
4928 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4929 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4930 type = TREE_TYPE (TREE_TYPE (target_type));
4931 else if (processing_template_decl)
4932 /* Within a template finish_call_expr doesn't resolve
4933 CALL_EXPR_FN, so even though this decltype isn't really
4934 dependent let's defer resolving it. */
4935 goto treat_as_dependent;
4937 sorry ("unable to determine the declared type of expression %<%E%>",
4943 type = is_bitfield_expr_with_lowered_type (expr);
4946 /* Bitfields are special, because their type encodes the
4947 number of bits they store. If the expression referenced a
4948 bitfield, TYPE now has the declared type of that
4950 type = cp_build_qualified_type (type,
4951 cp_type_quals (TREE_TYPE (expr)));
4953 if (real_lvalue_p (expr))
4954 type = build_reference_type (type);
4956 /* Within a lambda-expression:
4958 Every occurrence of decltype((x)) where x is a possibly
4959 parenthesized id-expression that names an entity of
4960 automatic storage duration is treated as if x were
4961 transformed into an access to a corresponding data member
4962 of the closure type that would have been declared if x
4963 were a use of the denoted entity. */
4964 else if (outer_automatic_var_p (expr)
4965 && current_function_decl
4966 && LAMBDA_FUNCTION_P (current_function_decl))
4967 type = capture_decltype (expr);
4970 /* Otherwise, where T is the type of e, if e is an lvalue,
4971 decltype(e) is defined as T&, otherwise decltype(e) is
4973 type = TREE_TYPE (expr);
4974 if (type == error_mark_node)
4975 return error_mark_node;
4976 else if (expr == current_class_ptr)
4977 /* If the expression is just "this", we want the
4978 cv-unqualified pointer for the "this" type. */
4979 type = TYPE_MAIN_VARIANT (type);
4980 else if (real_lvalue_p (expr))
4982 if (TREE_CODE (type) != REFERENCE_TYPE)
4983 type = build_reference_type (type);
4986 type = non_reference (type);
4991 if (!type || type == unknown_type_node)
4993 error ("type of %qE is unknown", expr);
4994 return error_mark_node;
5000 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5001 __has_nothrow_copy, depending on assign_p. */
5004 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5011 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5014 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5016 else if (TYPE_HAS_INIT_REF (type))
5018 /* If construction of the copy constructor was postponed, create
5020 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5021 lazily_declare_fn (sfk_copy_constructor, type);
5022 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5023 lazily_declare_fn (sfk_move_constructor, type);
5024 fns = CLASSTYPE_CONSTRUCTORS (type);
5029 for (; fns; fns = OVL_NEXT (fns))
5031 tree fn = OVL_CURRENT (fns);
5035 if (copy_fn_p (fn) == 0)
5038 else if (copy_fn_p (fn) <= 0)
5041 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5048 /* Actually evaluates the trait. */
5051 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5053 enum tree_code type_code1;
5056 type_code1 = TREE_CODE (type1);
5060 case CPTK_HAS_NOTHROW_ASSIGN:
5061 type1 = strip_array_types (type1);
5062 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5063 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5064 || (CLASS_TYPE_P (type1)
5065 && classtype_has_nothrow_assign_or_copy_p (type1,
5068 case CPTK_HAS_TRIVIAL_ASSIGN:
5069 /* ??? The standard seems to be missing the "or array of such a class
5070 type" wording for this trait. */
5071 type1 = strip_array_types (type1);
5072 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5073 && (trivial_type_p (type1)
5074 || (CLASS_TYPE_P (type1)
5075 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
5077 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5078 type1 = strip_array_types (type1);
5079 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5080 || (CLASS_TYPE_P (type1)
5081 && (t = locate_ctor (type1, NULL))
5082 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5084 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5085 type1 = strip_array_types (type1);
5086 return (trivial_type_p (type1)
5087 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5089 case CPTK_HAS_NOTHROW_COPY:
5090 type1 = strip_array_types (type1);
5091 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5092 || (CLASS_TYPE_P (type1)
5093 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5095 case CPTK_HAS_TRIVIAL_COPY:
5096 /* ??? The standard seems to be missing the "or array of such a class
5097 type" wording for this trait. */
5098 type1 = strip_array_types (type1);
5099 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5100 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
5102 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5103 type1 = strip_array_types (type1);
5104 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5105 || (CLASS_TYPE_P (type1)
5106 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5108 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5109 return (CLASS_TYPE_P (type1)
5110 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
5112 case CPTK_IS_ABSTRACT:
5113 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5115 case CPTK_IS_BASE_OF:
5116 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5117 && DERIVED_FROM_P (type1, type2));
5120 return (NON_UNION_CLASS_TYPE_P (type1));
5122 case CPTK_IS_CONVERTIBLE_TO:
5127 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5130 return (type_code1 == ENUMERAL_TYPE);
5133 return (pod_type_p (type1));
5135 case CPTK_IS_POLYMORPHIC:
5136 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5138 case CPTK_IS_STD_LAYOUT:
5139 return (std_layout_type_p (type1));
5141 case CPTK_IS_TRIVIAL:
5142 return (trivial_type_p (type1));
5145 return (type_code1 == UNION_TYPE);
5153 /* Returns true if TYPE is a complete type, an array of unknown bound,
5154 or (possibly cv-qualified) void, returns false otherwise. */
5157 check_trait_type (tree type)
5159 if (COMPLETE_TYPE_P (type))
5162 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
5165 if (VOID_TYPE_P (type))
5171 /* Process a trait expression. */
5174 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5176 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5177 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5178 || kind == CPTK_HAS_NOTHROW_COPY
5179 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5180 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5181 || kind == CPTK_HAS_TRIVIAL_COPY
5182 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5183 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5184 || kind == CPTK_IS_ABSTRACT
5185 || kind == CPTK_IS_BASE_OF
5186 || kind == CPTK_IS_CLASS
5187 || kind == CPTK_IS_CONVERTIBLE_TO
5188 || kind == CPTK_IS_EMPTY
5189 || kind == CPTK_IS_ENUM
5190 || kind == CPTK_IS_POD
5191 || kind == CPTK_IS_POLYMORPHIC
5192 || kind == CPTK_IS_STD_LAYOUT
5193 || kind == CPTK_IS_TRIVIAL
5194 || kind == CPTK_IS_UNION);
5196 if (kind == CPTK_IS_CONVERTIBLE_TO)
5198 sorry ("__is_convertible_to");
5199 return error_mark_node;
5202 if (type1 == error_mark_node
5203 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5204 && type2 == error_mark_node))
5205 return error_mark_node;
5207 if (processing_template_decl)
5209 tree trait_expr = make_node (TRAIT_EXPR);
5210 TREE_TYPE (trait_expr) = boolean_type_node;
5211 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5212 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5213 TRAIT_EXPR_KIND (trait_expr) = kind;
5217 complete_type (type1);
5219 complete_type (type2);
5223 case CPTK_HAS_NOTHROW_ASSIGN:
5224 case CPTK_HAS_TRIVIAL_ASSIGN:
5225 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5226 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5227 case CPTK_HAS_NOTHROW_COPY:
5228 case CPTK_HAS_TRIVIAL_COPY:
5229 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5230 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5231 case CPTK_IS_ABSTRACT:
5234 case CPTK_IS_POLYMORPHIC:
5235 case CPTK_IS_STD_LAYOUT:
5236 case CPTK_IS_TRIVIAL:
5237 if (!check_trait_type (type1))
5239 error ("incomplete type %qT not allowed", type1);
5240 return error_mark_node;
5244 case CPTK_IS_BASE_OF:
5245 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5246 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5247 && !COMPLETE_TYPE_P (type2))
5249 error ("incomplete type %qT not allowed", type2);
5250 return error_mark_node;
5259 case CPTK_IS_CONVERTIBLE_TO:
5264 return (trait_expr_value (kind, type1, type2)
5265 ? boolean_true_node : boolean_false_node);
5268 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5269 which is ignored for C++. */
5272 set_float_const_decimal64 (void)
5277 clear_float_const_decimal64 (void)
5282 float_const_decimal64_p (void)
5287 /* Return true if T is a literal type. */
5290 literal_type_p (tree t)
5292 if (SCALAR_TYPE_P (t))
5294 if (CLASS_TYPE_P (t))
5295 return CLASSTYPE_LITERAL_P (t);
5296 if (TREE_CODE (t) == ARRAY_TYPE)
5297 return literal_type_p (strip_array_types (t));
5302 /* If DECL is a variable declared `constexpr', require its type
5303 be literal. Return the DECL if OK, otherwise NULL. */
5306 ensure_literal_type_for_constexpr_object (tree decl)
5308 tree type = TREE_TYPE (decl);
5309 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5310 && !processing_template_decl && !literal_type_p (type))
5312 error ("the type %qT of constexpr variable %qD is not literal",
5319 /* Return non-null if FUN certainly designates a valid constexpr function
5320 declaration. Otherwise return NULL. Issue appropriate diagnostics
5321 if necessary. Note that we only check the declaration, not the body
5325 validate_constexpr_fundecl (tree fun)
5327 tree rettype = NULL;
5330 /* Don't bother if FUN is not marked constexpr. */
5331 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5334 /* For a function template, we have absolutely no guarantee that all
5335 instantiations will be constexpr. */
5336 if (TREE_CODE (fun) == TEMPLATE_DECL)
5339 parm = FUNCTION_FIRST_USER_PARM (fun);
5340 for (; parm != NULL; parm = TREE_CHAIN (parm))
5342 tree type = TREE_TYPE (parm);
5343 if (dependent_type_p (type))
5345 if (!literal_type_p (type))
5347 error ("parameter %q#D is not of literal type", parm);
5352 if (DECL_CONSTRUCTOR_P (fun))
5355 rettype = TREE_TYPE (TREE_TYPE (fun));
5356 if (dependent_type_p (rettype))
5358 if (!literal_type_p (rettype))
5360 error ("return type %qT of function %qD is not a literal type",
5361 TREE_TYPE (TREE_TYPE (fun)), fun);
5368 /* Constructor for a lambda expression. */
5371 build_lambda_expr (void)
5373 tree lambda = make_node (LAMBDA_EXPR);
5374 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
5375 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
5376 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
5377 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
5378 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
5382 /* Create the closure object for a LAMBDA_EXPR. */
5385 build_lambda_object (tree lambda_expr)
5387 /* Build aggregate constructor call.
5388 - cp_parser_braced_list
5389 - cp_parser_functional_cast */
5390 VEC(constructor_elt,gc) *elts = NULL;
5391 tree node, expr, type;
5392 location_t saved_loc;
5394 if (processing_template_decl)
5397 /* Make sure any error messages refer to the lambda-introducer. */
5398 saved_loc = input_location;
5399 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
5401 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
5403 node = TREE_CHAIN (node))
5405 tree field = TREE_PURPOSE (node);
5406 tree val = TREE_VALUE (node);
5411 /* Mere mortals can't copy arrays with aggregate initialization, so
5412 do some magic to make it work here. */
5413 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
5414 val = build_array_copy (val);
5415 else if (DECL_NORMAL_CAPTURE_P (field)
5416 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
5418 /* "the entities that are captured by copy are used to
5419 direct-initialize each corresponding non-static data
5420 member of the resulting closure object."
5422 There's normally no way to express direct-initialization
5423 from an element of a CONSTRUCTOR, so we build up a special
5424 TARGET_EXPR to bypass the usual copy-initialization. */
5425 val = force_rvalue (val);
5426 if (TREE_CODE (val) == TARGET_EXPR)
5427 TARGET_EXPR_DIRECT_INIT_P (val) = true;
5430 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
5433 expr = build_constructor (init_list_type_node, elts);
5434 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
5436 /* N2927: "[The closure] class type is not an aggregate."
5437 But we briefly treat it as an aggregate to make this simpler. */
5438 type = TREE_TYPE (lambda_expr);
5439 CLASSTYPE_NON_AGGREGATE (type) = 0;
5440 expr = finish_compound_literal (type, expr);
5441 CLASSTYPE_NON_AGGREGATE (type) = 1;
5443 input_location = saved_loc;
5447 /* Return an initialized RECORD_TYPE for LAMBDA.
5448 LAMBDA must have its explicit captures already. */
5451 begin_lambda_type (tree lambda)
5456 /* Unique name. This is just like an unnamed class, but we cannot use
5457 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5459 name = make_lambda_name ();
5461 /* Create the new RECORD_TYPE for this lambda. */
5462 type = xref_tag (/*tag_code=*/record_type,
5464 /*scope=*/ts_within_enclosing_non_class,
5465 /*template_header_p=*/false);
5468 /* Designate it as a struct so that we can use aggregate initialization. */
5469 CLASSTYPE_DECLARED_CLASS (type) = false;
5471 /* Clear base types. */
5472 xref_basetypes (type, /*bases=*/NULL_TREE);
5474 /* Start the class. */
5475 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
5477 /* Cross-reference the expression and the type. */
5478 TREE_TYPE (lambda) = type;
5479 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
5484 /* Returns the type to use for the return type of the operator() of a
5488 lambda_return_type (tree expr)
5491 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
5493 warning (0, "cannot deduce lambda return type from a braced-init-list");
5494 return void_type_node;
5496 if (type_dependent_expression_p (expr))
5498 type = cxx_make_type (DECLTYPE_TYPE);
5499 DECLTYPE_TYPE_EXPR (type) = expr;
5500 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
5501 SET_TYPE_STRUCTURAL_EQUALITY (type);
5504 type = type_decays_to (unlowered_expr_type (expr));
5508 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5512 lambda_function (tree lambda)
5515 if (TREE_CODE (lambda) == LAMBDA_EXPR)
5516 type = TREE_TYPE (lambda);
5519 gcc_assert (LAMBDA_TYPE_P (type));
5520 /* Don't let debug_tree cause instantiation. */
5521 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
5523 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
5524 /*protect=*/0, /*want_type=*/false);
5526 lambda = BASELINK_FUNCTIONS (lambda);
5530 /* Returns the type to use for the FIELD_DECL corresponding to the
5532 The caller should add REFERENCE_TYPE for capture by reference. */
5535 lambda_capture_field_type (tree expr)
5538 if (type_dependent_expression_p (expr))
5540 type = cxx_make_type (DECLTYPE_TYPE);
5541 DECLTYPE_TYPE_EXPR (type) = expr;
5542 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
5543 SET_TYPE_STRUCTURAL_EQUALITY (type);
5546 type = non_reference (unlowered_expr_type (expr));
5550 /* Recompute the return type for LAMBDA with body of the form:
5551 { return EXPR ; } */
5554 apply_lambda_return_type (tree lambda, tree return_type)
5556 tree fco = lambda_function (lambda);
5559 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
5561 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5562 it would interfere with instantiating the closure type. */
5563 if (dependent_type_p (return_type))
5565 if (return_type == error_mark_node)
5568 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5569 TREE_TYPE (METHOD_TYPE) == return-type */
5570 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
5572 result = DECL_RESULT (fco);
5573 if (result == NULL_TREE)
5576 /* We already have a DECL_RESULT from start_preparsed_function.
5577 Now we need to redo the work it and allocate_struct_function
5578 did to reflect the new type. */
5579 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
5580 TYPE_MAIN_VARIANT (return_type));
5581 DECL_ARTIFICIAL (result) = 1;
5582 DECL_IGNORED_P (result) = 1;
5583 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
5586 DECL_RESULT (fco) = result;
5588 if (!processing_template_decl && aggregate_value_p (result, fco))
5590 #ifdef PCC_STATIC_STRUCT_RETURN
5591 cfun->returns_pcc_struct = 1;
5593 cfun->returns_struct = 1;
5598 /* DECL is a local variable or parameter from the surrounding scope of a
5599 lambda-expression. Returns the decltype for a use of the capture field
5600 for DECL even if it hasn't been captured yet. */
5603 capture_decltype (tree decl)
5605 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
5606 /* FIXME do lookup instead of list walk? */
5607 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
5611 type = TREE_TYPE (TREE_PURPOSE (cap));
5613 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
5616 error ("%qD is not captured", decl);
5617 return error_mark_node;
5620 type = TREE_TYPE (decl);
5621 if (TREE_CODE (type) == REFERENCE_TYPE
5622 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
5623 type = TREE_TYPE (type);
5626 case CPLD_REFERENCE:
5627 type = TREE_TYPE (decl);
5628 if (TREE_CODE (type) != REFERENCE_TYPE)
5629 type = build_reference_type (TREE_TYPE (decl));
5636 if (TREE_CODE (type) != REFERENCE_TYPE)
5638 if (!LAMBDA_EXPR_MUTABLE_P (lam))
5639 type = cp_build_qualified_type (type, (TYPE_QUALS (type)
5641 type = build_reference_type (type);
5646 /* From an ID and INITIALIZER, create a capture (by reference if
5647 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5651 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
5652 bool explicit_init_p)
5657 type = lambda_capture_field_type (initializer);
5660 type = build_reference_type (type);
5661 if (!real_lvalue_p (initializer))
5662 error ("cannot capture %qE by reference", initializer);
5665 /* Make member variable. */
5666 member = build_lang_decl (FIELD_DECL, id, type);
5667 if (!explicit_init_p)
5668 /* Normal captures are invisible to name lookup but uses are replaced
5669 with references to the capture field; we implement this by only
5670 really making them invisible in unevaluated context; see
5671 qualify_lookup. For now, let's make explicitly initialized captures
5673 DECL_NORMAL_CAPTURE_P (member) = true;
5675 /* Add it to the appropriate closure class if we've started it. */
5676 if (current_class_type && current_class_type == TREE_TYPE (lambda))
5677 finish_member_declaration (member);
5679 LAMBDA_EXPR_CAPTURE_LIST (lambda)
5680 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
5682 if (id == get_identifier ("__this"))
5684 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
5685 error ("already captured %<this%> in lambda expression");
5686 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
5692 /* Register all the capture members on the list CAPTURES, which is the
5693 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
5695 void register_capture_members (tree captures)
5699 register_capture_members (TREE_CHAIN (captures));
5700 finish_member_declaration (TREE_PURPOSE (captures));
5704 /* Given a FIELD_DECL decl belonging to a closure type, return a
5705 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5709 thisify_lambda_field (tree decl)
5711 tree context = lambda_function (DECL_CONTEXT (decl));
5712 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
5714 tf_warning_or_error);
5715 return finish_non_static_data_member (decl, object,
5716 /*qualifying_scope*/NULL_TREE);
5719 /* Similar to add_capture, except this works on a stack of nested lambdas.
5720 BY_REFERENCE_P in this case is derived from the default capture mode.
5721 Returns the capture for the lambda at the bottom of the stack. */
5724 add_default_capture (tree lambda_stack, tree id, tree initializer)
5726 bool this_capture_p = (id == get_identifier ("__this"));
5728 tree member = NULL_TREE;
5730 tree saved_class_type = current_class_type;
5734 for (node = lambda_stack;
5736 node = TREE_CHAIN (node))
5738 tree lambda = TREE_VALUE (node);
5740 current_class_type = TREE_TYPE (lambda);
5741 member = add_capture (lambda,
5746 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
5747 == CPLD_REFERENCE)),
5748 /*explicit_init_p=*/false);
5749 initializer = thisify_lambda_field (member);
5752 current_class_type = saved_class_type;
5757 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5758 INDIRECT_REF, possibly adding it through default capturing. */
5761 lambda_expr_this_capture (tree lambda)
5765 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5767 /* Try to default capture 'this' if we can. */
5769 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
5771 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
5772 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
5773 tree init = NULL_TREE;
5775 /* If we are in a lambda function, we can move out until we hit:
5776 1. a non-lambda function,
5777 2. a lambda function capturing 'this', or
5778 3. a non-default capturing lambda function. */
5779 while (LAMBDA_FUNCTION_P (containing_function))
5782 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
5784 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
5786 /* An outer lambda has already captured 'this'. */
5787 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5788 init = thisify_lambda_field (cap);
5792 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
5793 /* An outer lambda won't let us capture 'this'. */
5796 lambda_stack = tree_cons (NULL_TREE,
5800 containing_function = decl_function_context (containing_function);
5803 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
5804 && !LAMBDA_FUNCTION_P (containing_function))
5805 /* First parameter is 'this'. */
5806 init = DECL_ARGUMENTS (containing_function);
5809 this_capture = add_default_capture (lambda_stack,
5810 /*id=*/get_identifier ("__this"),
5816 error ("%<this%> was not captured for this lambda function");
5817 result = error_mark_node;
5821 /* To make sure that current_class_ref is for the lambda. */
5822 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
5824 result = finish_non_static_data_member (this_capture,
5826 /*qualifying_scope=*/NULL_TREE);
5828 /* If 'this' is captured, each use of 'this' is transformed into an
5829 access to the corresponding unnamed data member of the closure
5830 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5831 ensures that the transformed expression is an rvalue. ] */
5832 result = rvalue (result);
5838 /* Returns the method basetype of the innermost non-lambda function, or
5839 NULL_TREE if none. */
5842 nonlambda_method_basetype (void)
5845 if (!current_class_ref)
5848 type = current_class_type;
5849 if (!LAMBDA_TYPE_P (type))
5852 /* Find the nearest enclosing non-lambda function. */
5853 fn = TYPE_NAME (type);
5855 fn = decl_function_context (fn);
5856 while (fn && LAMBDA_FUNCTION_P (fn));
5858 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5861 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
5864 /* If the closure TYPE has a static op(), also add a conversion to function
5868 maybe_add_lambda_conv_op (tree type)
5870 bool nested = (current_function_decl != NULL_TREE);
5871 tree callop = lambda_function (type);
5872 tree rettype, name, fntype, fn, body, compound_stmt;
5873 tree thistype, stattype, statfn, convfn, call, arg;
5874 VEC (tree, gc) *argvec;
5876 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
5879 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
5880 FUNCTION_ARG_CHAIN (callop));
5882 /* First build up the conversion op. */
5884 rettype = build_pointer_type (stattype);
5885 name = mangle_conv_op_name_for_type (rettype);
5886 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
5887 fntype = build_method_type_directly (thistype, rettype, void_list_node);
5888 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
5889 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5891 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5892 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5893 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5895 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
5896 grokclassfn (type, fn, NO_SPECIAL);
5897 set_linkage_according_to_type (type, fn);
5898 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5899 DECL_IN_AGGR_P (fn) = 1;
5900 DECL_ARTIFICIAL (fn) = 1;
5901 DECL_NOT_REALLY_EXTERN (fn) = 1;
5902 DECL_DECLARED_INLINE_P (fn) = 1;
5903 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
5905 DECL_INTERFACE_KNOWN (fn) = 1;
5907 add_method (type, fn, NULL_TREE);
5909 /* Generic thunk code fails for varargs; we'll complain in mark_used if
5910 the conversion op is used. */
5911 if (varargs_function_p (callop))
5913 DECL_DELETED_FN (fn) = 1;
5917 /* Now build up the thunk to be returned. */
5919 name = get_identifier ("_FUN");
5920 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
5921 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5922 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5923 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5924 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5925 grokclassfn (type, fn, NO_SPECIAL);
5926 set_linkage_according_to_type (type, fn);
5927 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5928 DECL_IN_AGGR_P (fn) = 1;
5929 DECL_ARTIFICIAL (fn) = 1;
5930 DECL_NOT_REALLY_EXTERN (fn) = 1;
5931 DECL_DECLARED_INLINE_P (fn) = 1;
5932 DECL_STATIC_FUNCTION_P (fn) = 1;
5933 DECL_ARGUMENTS (fn) = copy_list (TREE_CHAIN (DECL_ARGUMENTS (callop)));
5934 for (arg = DECL_ARGUMENTS (fn); arg; arg = TREE_CHAIN (arg))
5935 DECL_CONTEXT (arg) = fn;
5937 DECL_INTERFACE_KNOWN (fn) = 1;
5939 add_method (type, fn, NULL_TREE);
5942 push_function_context ();
5944 /* Generate the body of the thunk. */
5946 start_preparsed_function (statfn, NULL_TREE,
5947 SF_PRE_PARSED | SF_INCLASS_INLINE);
5948 if (DECL_ONE_ONLY (statfn))
5950 /* Put the thunk in the same comdat group as the call op. */
5951 struct cgraph_node *callop_node, *thunk_node;
5952 DECL_COMDAT_GROUP (statfn) = DECL_COMDAT_GROUP (callop);
5953 callop_node = cgraph_node (callop);
5954 thunk_node = cgraph_node (statfn);
5955 gcc_assert (callop_node->same_comdat_group == NULL);
5956 gcc_assert (thunk_node->same_comdat_group == NULL);
5957 callop_node->same_comdat_group = thunk_node;
5958 thunk_node->same_comdat_group = callop_node;
5960 body = begin_function_body ();
5961 compound_stmt = begin_compound_stmt (0);
5963 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
5965 argvec = make_tree_vector ();
5966 VEC_quick_push (tree, argvec, arg);
5967 for (arg = DECL_ARGUMENTS (statfn); arg; arg = TREE_CHAIN (arg))
5968 VEC_safe_push (tree, gc, argvec, arg);
5969 call = build_call_a (callop, VEC_length (tree, argvec),
5970 VEC_address (tree, argvec));
5971 CALL_FROM_THUNK_P (call) = 1;
5972 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
5973 call = build_cplus_new (TREE_TYPE (call), call);
5974 call = convert_from_reference (call);
5975 finish_return_stmt (call);
5977 finish_compound_stmt (compound_stmt);
5978 finish_function_body (body);
5980 expand_or_defer_fn (finish_function (2));
5982 /* Generate the body of the conversion op. */
5984 start_preparsed_function (convfn, NULL_TREE,
5985 SF_PRE_PARSED | SF_INCLASS_INLINE);
5986 body = begin_function_body ();
5987 compound_stmt = begin_compound_stmt (0);
5989 finish_return_stmt (decay_conversion (statfn));
5991 finish_compound_stmt (compound_stmt);
5992 finish_function_body (body);
5994 expand_or_defer_fn (finish_function (2));
5997 pop_function_context ();
5999 #include "gt-cp-semantics.h"