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, 2010 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"
33 #include "c-family/c-common.h"
34 #include "tree-inline.h"
35 #include "tree-mudflap.h"
40 #include "diagnostic.h"
42 #include "tree-iterator.h"
48 /* There routines provide a modular interface to perform many parsing
49 operations. They may therefore be used during actual parsing, or
50 during template instantiation, which may be regarded as a
51 degenerate form of parsing. */
53 static tree maybe_convert_cond (tree);
54 static tree finalize_nrv_r (tree *, int *, void *);
55 static tree capture_decltype (tree);
56 static tree thisify_lambda_field (tree);
59 /* Deferred Access Checking Overview
60 ---------------------------------
62 Most C++ expressions and declarations require access checking
63 to be performed during parsing. However, in several cases,
64 this has to be treated differently.
66 For member declarations, access checking has to be deferred
67 until more information about the declaration is known. For
79 When we are parsing the function return type `A::X', we don't
80 really know if this is allowed until we parse the function name.
82 Furthermore, some contexts require that access checking is
83 never performed at all. These include class heads, and template
86 Typical use of access checking functions is described here:
88 1. When we enter a context that requires certain access checking
89 mode, the function `push_deferring_access_checks' is called with
90 DEFERRING argument specifying the desired mode. Access checking
91 may be performed immediately (dk_no_deferred), deferred
92 (dk_deferred), or not performed (dk_no_check).
94 2. When a declaration such as a type, or a variable, is encountered,
95 the function `perform_or_defer_access_check' is called. It
96 maintains a VEC of all deferred checks.
98 3. The global `current_class_type' or `current_function_decl' is then
99 setup by the parser. `enforce_access' relies on these information
102 4. Upon exiting the context mentioned in step 1,
103 `perform_deferred_access_checks' is called to check all declaration
104 stored in the VEC. `pop_deferring_access_checks' is then
105 called to restore the previous access checking mode.
107 In case of parsing error, we simply call `pop_deferring_access_checks'
108 without `perform_deferred_access_checks'. */
110 typedef struct GTY(()) deferred_access {
111 /* A VEC representing name-lookups for which we have deferred
112 checking access controls. We cannot check the accessibility of
113 names used in a decl-specifier-seq until we know what is being
114 declared because code like:
121 A::B* A::f() { return 0; }
123 is valid, even though `A::B' is not generally accessible. */
124 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
126 /* The current mode of access checks. */
127 enum deferring_kind deferring_access_checks_kind;
130 DEF_VEC_O (deferred_access);
131 DEF_VEC_ALLOC_O (deferred_access,gc);
133 /* Data for deferred access checking. */
134 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
135 static GTY(()) unsigned deferred_access_no_check;
137 /* Save the current deferred access states and start deferred
138 access checking iff DEFER_P is true. */
141 push_deferring_access_checks (deferring_kind deferring)
143 /* For context like template instantiation, access checking
144 disabling applies to all nested context. */
145 if (deferred_access_no_check || deferring == dk_no_check)
146 deferred_access_no_check++;
149 deferred_access *ptr;
151 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
152 ptr->deferred_access_checks = NULL;
153 ptr->deferring_access_checks_kind = deferring;
157 /* Resume deferring access checks again after we stopped doing
161 resume_deferring_access_checks (void)
163 if (!deferred_access_no_check)
164 VEC_last (deferred_access, deferred_access_stack)
165 ->deferring_access_checks_kind = dk_deferred;
168 /* Stop deferring access checks. */
171 stop_deferring_access_checks (void)
173 if (!deferred_access_no_check)
174 VEC_last (deferred_access, deferred_access_stack)
175 ->deferring_access_checks_kind = dk_no_deferred;
178 /* Discard the current deferred access checks and restore the
182 pop_deferring_access_checks (void)
184 if (deferred_access_no_check)
185 deferred_access_no_check--;
187 VEC_pop (deferred_access, deferred_access_stack);
190 /* Returns a TREE_LIST representing the deferred checks.
191 The TREE_PURPOSE of each node is the type through which the
192 access occurred; the TREE_VALUE is the declaration named.
195 VEC (deferred_access_check,gc)*
196 get_deferred_access_checks (void)
198 if (deferred_access_no_check)
201 return (VEC_last (deferred_access, deferred_access_stack)
202 ->deferred_access_checks);
205 /* Take current deferred checks and combine with the
206 previous states if we also defer checks previously.
207 Otherwise perform checks now. */
210 pop_to_parent_deferring_access_checks (void)
212 if (deferred_access_no_check)
213 deferred_access_no_check--;
216 VEC (deferred_access_check,gc) *checks;
217 deferred_access *ptr;
219 checks = (VEC_last (deferred_access, deferred_access_stack)
220 ->deferred_access_checks);
222 VEC_pop (deferred_access, deferred_access_stack);
223 ptr = VEC_last (deferred_access, deferred_access_stack);
224 if (ptr->deferring_access_checks_kind == dk_no_deferred)
227 perform_access_checks (checks);
231 /* Merge with parent. */
233 deferred_access_check *chk, *probe;
235 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
237 FOR_EACH_VEC_ELT (deferred_access_check,
238 ptr->deferred_access_checks, j, probe)
240 if (probe->binfo == chk->binfo &&
241 probe->decl == chk->decl &&
242 probe->diag_decl == chk->diag_decl)
245 /* Insert into parent's checks. */
246 VEC_safe_push (deferred_access_check, gc,
247 ptr->deferred_access_checks, chk);
254 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
255 is the BINFO indicating the qualifying scope used to access the
256 DECL node stored in the TREE_VALUE of the node. */
259 perform_access_checks (VEC (deferred_access_check,gc)* checks)
262 deferred_access_check *chk;
267 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
268 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
271 /* Perform the deferred access checks.
273 After performing the checks, we still have to keep the list
274 `deferred_access_stack->deferred_access_checks' since we may want
275 to check access for them again later in a different context.
282 A::X A::a, x; // No error for `A::a', error for `x'
284 We have to perform deferred access of `A::X', first with `A::a',
288 perform_deferred_access_checks (void)
290 perform_access_checks (get_deferred_access_checks ());
293 /* Defer checking the accessibility of DECL, when looked up in
294 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
297 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
300 deferred_access *ptr;
301 deferred_access_check *chk;
302 deferred_access_check *new_access;
305 /* Exit if we are in a context that no access checking is performed.
307 if (deferred_access_no_check)
310 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
312 ptr = VEC_last (deferred_access, deferred_access_stack);
314 /* If we are not supposed to defer access checks, just check now. */
315 if (ptr->deferring_access_checks_kind == dk_no_deferred)
317 enforce_access (binfo, decl, diag_decl);
321 /* See if we are already going to perform this check. */
322 FOR_EACH_VEC_ELT (deferred_access_check,
323 ptr->deferred_access_checks, i, chk)
325 if (chk->decl == decl && chk->binfo == binfo &&
326 chk->diag_decl == diag_decl)
331 /* If not, record the check. */
333 VEC_safe_push (deferred_access_check, gc,
334 ptr->deferred_access_checks, 0);
335 new_access->binfo = binfo;
336 new_access->decl = decl;
337 new_access->diag_decl = diag_decl;
340 /* Returns nonzero if the current statement is a full expression,
341 i.e. temporaries created during that statement should be destroyed
342 at the end of the statement. */
345 stmts_are_full_exprs_p (void)
347 return current_stmt_tree ()->stmts_are_full_exprs_p;
350 /* T is a statement. Add it to the statement-tree. This is the C++
351 version. The C/ObjC frontends have a slightly different version of
357 enum tree_code code = TREE_CODE (t);
359 if (EXPR_P (t) && code != LABEL_EXPR)
361 if (!EXPR_HAS_LOCATION (t))
362 SET_EXPR_LOCATION (t, input_location);
364 /* When we expand a statement-tree, we must know whether or not the
365 statements are full-expressions. We record that fact here. */
366 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
369 /* Add T to the statement-tree. Non-side-effect statements need to be
370 recorded during statement expressions. */
371 append_to_statement_list_force (t, &cur_stmt_list);
376 /* Returns the stmt_tree to which statements are currently being added. */
379 current_stmt_tree (void)
382 ? &cfun->language->base.x_stmt_tree
383 : &scope_chain->x_stmt_tree);
386 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
389 maybe_cleanup_point_expr (tree expr)
391 if (!processing_template_decl && stmts_are_full_exprs_p ())
392 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
396 /* Like maybe_cleanup_point_expr except have the type of the new expression be
397 void so we don't need to create a temporary variable to hold the inner
398 expression. The reason why we do this is because the original type might be
399 an aggregate and we cannot create a temporary variable for that type. */
402 maybe_cleanup_point_expr_void (tree expr)
404 if (!processing_template_decl && stmts_are_full_exprs_p ())
405 expr = fold_build_cleanup_point_expr (void_type_node, expr);
411 /* Create a declaration statement for the declaration given by the DECL. */
414 add_decl_expr (tree decl)
416 tree r = build_stmt (input_location, DECL_EXPR, decl);
417 if (DECL_INITIAL (decl)
418 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
419 r = maybe_cleanup_point_expr_void (r);
423 /* Finish a scope. */
426 do_poplevel (tree stmt_list)
430 if (stmts_are_full_exprs_p ())
431 block = poplevel (kept_level_p (), 1, 0);
433 stmt_list = pop_stmt_list (stmt_list);
435 if (!processing_template_decl)
437 stmt_list = c_build_bind_expr (input_location, block, stmt_list);
438 /* ??? See c_end_compound_stmt re statement expressions. */
444 /* Begin a new scope. */
447 do_pushlevel (scope_kind sk)
449 tree ret = push_stmt_list ();
450 if (stmts_are_full_exprs_p ())
451 begin_scope (sk, NULL);
455 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
456 when the current scope is exited. EH_ONLY is true when this is not
457 meant to apply to normal control flow transfer. */
460 push_cleanup (tree decl, tree cleanup, bool eh_only)
462 tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl);
463 CLEANUP_EH_ONLY (stmt) = eh_only;
465 CLEANUP_BODY (stmt) = push_stmt_list ();
468 /* Begin a conditional that might contain a declaration. When generating
469 normal code, we want the declaration to appear before the statement
470 containing the conditional. When generating template code, we want the
471 conditional to be rendered as the raw DECL_EXPR. */
474 begin_cond (tree *cond_p)
476 if (processing_template_decl)
477 *cond_p = push_stmt_list ();
480 /* Finish such a conditional. */
483 finish_cond (tree *cond_p, tree expr)
485 if (processing_template_decl)
487 tree cond = pop_stmt_list (*cond_p);
488 if (TREE_CODE (cond) == DECL_EXPR)
491 if (check_for_bare_parameter_packs (expr))
492 *cond_p = error_mark_node;
497 /* If *COND_P specifies a conditional with a declaration, transform the
500 for (; A x = 42;) { }
502 while (true) { A x = 42; if (!x) break; }
503 for (;;) { A x = 42; if (!x) break; }
504 The statement list for BODY will be empty if the conditional did
505 not declare anything. */
508 simplify_loop_decl_cond (tree *cond_p, tree body)
512 if (!TREE_SIDE_EFFECTS (body))
516 *cond_p = boolean_true_node;
518 if_stmt = begin_if_stmt ();
519 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
520 finish_if_stmt_cond (cond, if_stmt);
521 finish_break_stmt ();
522 finish_then_clause (if_stmt);
523 finish_if_stmt (if_stmt);
526 /* Finish a goto-statement. */
529 finish_goto_stmt (tree destination)
531 if (TREE_CODE (destination) == IDENTIFIER_NODE)
532 destination = lookup_label (destination);
534 /* We warn about unused labels with -Wunused. That means we have to
535 mark the used labels as used. */
536 if (TREE_CODE (destination) == LABEL_DECL)
537 TREE_USED (destination) = 1;
540 if (!processing_template_decl)
542 destination = cp_convert (ptr_type_node, destination);
543 if (error_operand_p (destination))
546 /* We don't inline calls to functions with computed gotos.
547 Those functions are typically up to some funny business,
548 and may be depending on the labels being at particular
549 addresses, or some such. */
550 DECL_UNINLINABLE (current_function_decl) = 1;
553 check_goto (destination);
555 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
558 /* COND is the condition-expression for an if, while, etc.,
559 statement. Convert it to a boolean value, if appropriate.
560 In addition, verify sequence points if -Wsequence-point is enabled. */
563 maybe_convert_cond (tree cond)
565 /* Empty conditions remain empty. */
569 /* Wait until we instantiate templates before doing conversion. */
570 if (processing_template_decl)
573 if (warn_sequence_point)
574 verify_sequence_points (cond);
576 /* Do the conversion. */
577 cond = convert_from_reference (cond);
579 if (TREE_CODE (cond) == MODIFY_EXPR
580 && !TREE_NO_WARNING (cond)
583 warning (OPT_Wparentheses,
584 "suggest parentheses around assignment used as truth value");
585 TREE_NO_WARNING (cond) = 1;
588 return condition_conversion (cond);
591 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
594 finish_expr_stmt (tree expr)
598 if (expr != NULL_TREE)
600 if (!processing_template_decl)
602 if (warn_sequence_point)
603 verify_sequence_points (expr);
604 expr = convert_to_void (expr, ICV_STATEMENT, tf_warning_or_error);
606 else if (!type_dependent_expression_p (expr))
607 convert_to_void (build_non_dependent_expr (expr), ICV_STATEMENT,
608 tf_warning_or_error);
610 if (check_for_bare_parameter_packs (expr))
611 expr = error_mark_node;
613 /* Simplification of inner statement expressions, compound exprs,
614 etc can result in us already having an EXPR_STMT. */
615 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
617 if (TREE_CODE (expr) != EXPR_STMT)
618 expr = build_stmt (input_location, EXPR_STMT, expr);
619 expr = maybe_cleanup_point_expr_void (expr);
631 /* Begin an if-statement. Returns a newly created IF_STMT if
638 scope = do_pushlevel (sk_block);
639 r = build_stmt (input_location, IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
640 TREE_CHAIN (r) = scope;
641 begin_cond (&IF_COND (r));
645 /* Process the COND of an if-statement, which may be given by
649 finish_if_stmt_cond (tree cond, tree if_stmt)
651 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
653 THEN_CLAUSE (if_stmt) = push_stmt_list ();
656 /* Finish the then-clause of an if-statement, which may be given by
660 finish_then_clause (tree if_stmt)
662 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
666 /* Begin the else-clause of an if-statement. */
669 begin_else_clause (tree if_stmt)
671 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
674 /* Finish the else-clause of an if-statement, which may be given by
678 finish_else_clause (tree if_stmt)
680 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
683 /* Finish an if-statement. */
686 finish_if_stmt (tree if_stmt)
688 tree scope = TREE_CHAIN (if_stmt);
689 TREE_CHAIN (if_stmt) = NULL;
690 add_stmt (do_poplevel (scope));
694 /* Begin a while-statement. Returns a newly created WHILE_STMT if
698 begin_while_stmt (void)
701 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
703 WHILE_BODY (r) = do_pushlevel (sk_block);
704 begin_cond (&WHILE_COND (r));
708 /* Process the COND of a while-statement, which may be given by
712 finish_while_stmt_cond (tree cond, tree while_stmt)
714 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
715 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
718 /* Finish a while-statement, which may be given by WHILE_STMT. */
721 finish_while_stmt (tree while_stmt)
723 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
727 /* Begin a do-statement. Returns a newly created DO_STMT if
733 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
735 DO_BODY (r) = push_stmt_list ();
739 /* Finish the body of a do-statement, which may be given by DO_STMT. */
742 finish_do_body (tree do_stmt)
744 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
746 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
747 body = STATEMENT_LIST_TAIL (body)->stmt;
749 if (IS_EMPTY_STMT (body))
750 warning (OPT_Wempty_body,
751 "suggest explicit braces around empty body in %<do%> statement");
754 /* Finish a do-statement, which may be given by DO_STMT, and whose
755 COND is as indicated. */
758 finish_do_stmt (tree cond, tree do_stmt)
760 cond = maybe_convert_cond (cond);
761 DO_COND (do_stmt) = cond;
765 /* Finish a return-statement. The EXPRESSION returned, if any, is as
769 finish_return_stmt (tree expr)
774 expr = check_return_expr (expr, &no_warning);
776 if (flag_openmp && !check_omp_return ())
777 return error_mark_node;
778 if (!processing_template_decl)
780 if (warn_sequence_point)
781 verify_sequence_points (expr);
783 if (DECL_DESTRUCTOR_P (current_function_decl)
784 || (DECL_CONSTRUCTOR_P (current_function_decl)
785 && targetm.cxx.cdtor_returns_this ()))
787 /* Similarly, all destructors must run destructors for
788 base-classes before returning. So, all returns in a
789 destructor get sent to the DTOR_LABEL; finish_function emits
790 code to return a value there. */
791 return finish_goto_stmt (cdtor_label);
795 r = build_stmt (input_location, RETURN_EXPR, expr);
796 TREE_NO_WARNING (r) |= no_warning;
797 r = maybe_cleanup_point_expr_void (r);
804 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
807 begin_for_stmt (void)
811 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
812 NULL_TREE, NULL_TREE);
814 if (flag_new_for_scope > 0)
815 TREE_CHAIN (r) = do_pushlevel (sk_for);
817 if (processing_template_decl)
818 FOR_INIT_STMT (r) = push_stmt_list ();
823 /* Finish the for-init-statement of a for-statement, which may be
824 given by FOR_STMT. */
827 finish_for_init_stmt (tree for_stmt)
829 if (processing_template_decl)
830 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
832 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
833 begin_cond (&FOR_COND (for_stmt));
836 /* Finish the COND of a for-statement, which may be given by
840 finish_for_cond (tree cond, tree for_stmt)
842 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
843 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
846 /* Finish the increment-EXPRESSION in a for-statement, which may be
847 given by FOR_STMT. */
850 finish_for_expr (tree expr, tree for_stmt)
854 /* If EXPR is an overloaded function, issue an error; there is no
855 context available to use to perform overload resolution. */
856 if (type_unknown_p (expr))
858 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
859 expr = error_mark_node;
861 if (!processing_template_decl)
863 if (warn_sequence_point)
864 verify_sequence_points (expr);
865 expr = convert_to_void (expr, ICV_THIRD_IN_FOR,
866 tf_warning_or_error);
868 else if (!type_dependent_expression_p (expr))
869 convert_to_void (build_non_dependent_expr (expr), ICV_THIRD_IN_FOR,
870 tf_warning_or_error);
871 expr = maybe_cleanup_point_expr_void (expr);
872 if (check_for_bare_parameter_packs (expr))
873 expr = error_mark_node;
874 FOR_EXPR (for_stmt) = expr;
877 /* Finish the body of a for-statement, which may be given by
878 FOR_STMT. The increment-EXPR for the loop must be
882 finish_for_stmt (tree for_stmt)
884 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
886 /* Pop the scope for the body of the loop. */
887 if (flag_new_for_scope > 0)
889 tree scope = TREE_CHAIN (for_stmt);
890 TREE_CHAIN (for_stmt) = NULL;
891 add_stmt (do_poplevel (scope));
897 /* Finish a break-statement. */
900 finish_break_stmt (void)
902 return add_stmt (build_stmt (input_location, BREAK_STMT));
905 /* Finish a continue-statement. */
908 finish_continue_stmt (void)
910 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
913 /* Begin a switch-statement. Returns a new SWITCH_STMT if
917 begin_switch_stmt (void)
921 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
923 scope = do_pushlevel (sk_block);
924 TREE_CHAIN (r) = scope;
925 begin_cond (&SWITCH_STMT_COND (r));
930 /* Finish the cond of a switch-statement. */
933 finish_switch_cond (tree cond, tree switch_stmt)
935 tree orig_type = NULL;
936 if (!processing_template_decl)
938 /* Convert the condition to an integer or enumeration type. */
939 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
940 if (cond == NULL_TREE)
942 error ("switch quantity not an integer");
943 cond = error_mark_node;
945 orig_type = TREE_TYPE (cond);
946 if (cond != error_mark_node)
950 Integral promotions are performed. */
951 cond = perform_integral_promotions (cond);
952 cond = maybe_cleanup_point_expr (cond);
955 if (check_for_bare_parameter_packs (cond))
956 cond = error_mark_node;
957 else if (!processing_template_decl && warn_sequence_point)
958 verify_sequence_points (cond);
960 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
961 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
962 add_stmt (switch_stmt);
963 push_switch (switch_stmt);
964 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
967 /* Finish the body of a switch-statement, which may be given by
968 SWITCH_STMT. The COND to switch on is indicated. */
971 finish_switch_stmt (tree switch_stmt)
975 SWITCH_STMT_BODY (switch_stmt) =
976 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
980 scope = TREE_CHAIN (switch_stmt);
981 TREE_CHAIN (switch_stmt) = NULL;
982 add_stmt (do_poplevel (scope));
985 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
989 begin_try_block (void)
991 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
993 TRY_STMTS (r) = push_stmt_list ();
997 /* Likewise, for a function-try-block. The block returned in
998 *COMPOUND_STMT is an artificial outer scope, containing the
999 function-try-block. */
1002 begin_function_try_block (tree *compound_stmt)
1005 /* This outer scope does not exist in the C++ standard, but we need
1006 a place to put __FUNCTION__ and similar variables. */
1007 *compound_stmt = begin_compound_stmt (0);
1008 r = begin_try_block ();
1009 FN_TRY_BLOCK_P (r) = 1;
1013 /* Finish a try-block, which may be given by TRY_BLOCK. */
1016 finish_try_block (tree try_block)
1018 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1019 TRY_HANDLERS (try_block) = push_stmt_list ();
1022 /* Finish the body of a cleanup try-block, which may be given by
1026 finish_cleanup_try_block (tree try_block)
1028 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1031 /* Finish an implicitly generated try-block, with a cleanup is given
1035 finish_cleanup (tree cleanup, tree try_block)
1037 TRY_HANDLERS (try_block) = cleanup;
1038 CLEANUP_P (try_block) = 1;
1041 /* Likewise, for a function-try-block. */
1044 finish_function_try_block (tree try_block)
1046 finish_try_block (try_block);
1047 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1048 the try block, but moving it inside. */
1049 in_function_try_handler = 1;
1052 /* Finish a handler-sequence for a try-block, which may be given by
1056 finish_handler_sequence (tree try_block)
1058 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1059 check_handlers (TRY_HANDLERS (try_block));
1062 /* Finish the handler-seq for a function-try-block, given by
1063 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1064 begin_function_try_block. */
1067 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1069 in_function_try_handler = 0;
1070 finish_handler_sequence (try_block);
1071 finish_compound_stmt (compound_stmt);
1074 /* Begin a handler. Returns a HANDLER if appropriate. */
1077 begin_handler (void)
1081 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1084 /* Create a binding level for the eh_info and the exception object
1086 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1091 /* Finish the handler-parameters for a handler, which may be given by
1092 HANDLER. DECL is the declaration for the catch parameter, or NULL
1093 if this is a `catch (...)' clause. */
1096 finish_handler_parms (tree decl, tree handler)
1098 tree type = NULL_TREE;
1099 if (processing_template_decl)
1103 decl = pushdecl (decl);
1104 decl = push_template_decl (decl);
1105 HANDLER_PARMS (handler) = decl;
1106 type = TREE_TYPE (decl);
1110 type = expand_start_catch_block (decl);
1111 HANDLER_TYPE (handler) = type;
1112 if (!processing_template_decl && type)
1113 mark_used (eh_type_info (type));
1116 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1117 the return value from the matching call to finish_handler_parms. */
1120 finish_handler (tree handler)
1122 if (!processing_template_decl)
1123 expand_end_catch_block ();
1124 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1127 /* Begin a compound statement. FLAGS contains some bits that control the
1128 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1129 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1130 block of a function. If BCS_TRY_BLOCK is set, this is the block
1131 created on behalf of a TRY statement. Returns a token to be passed to
1132 finish_compound_stmt. */
1135 begin_compound_stmt (unsigned int flags)
1139 if (flags & BCS_NO_SCOPE)
1141 r = push_stmt_list ();
1142 STATEMENT_LIST_NO_SCOPE (r) = 1;
1144 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1145 But, if it's a statement-expression with a scopeless block, there's
1146 nothing to keep, and we don't want to accidentally keep a block
1147 *inside* the scopeless block. */
1148 keep_next_level (false);
1151 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1153 /* When processing a template, we need to remember where the braces were,
1154 so that we can set up identical scopes when instantiating the template
1155 later. BIND_EXPR is a handy candidate for this.
1156 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1157 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1158 processing templates. */
1159 if (processing_template_decl)
1161 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1162 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1163 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1164 TREE_SIDE_EFFECTS (r) = 1;
1170 /* Finish a compound-statement, which is given by STMT. */
1173 finish_compound_stmt (tree stmt)
1175 if (TREE_CODE (stmt) == BIND_EXPR)
1176 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1177 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1178 stmt = pop_stmt_list (stmt);
1181 /* Destroy any ObjC "super" receivers that may have been
1183 objc_clear_super_receiver ();
1185 stmt = do_poplevel (stmt);
1188 /* ??? See c_end_compound_stmt wrt statement expressions. */
1193 /* Finish an asm-statement, whose components are a STRING, some
1194 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1195 LABELS. Also note whether the asm-statement should be
1196 considered volatile. */
1199 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1200 tree input_operands, tree clobbers, tree labels)
1204 int ninputs = list_length (input_operands);
1205 int noutputs = list_length (output_operands);
1207 if (!processing_template_decl)
1209 const char *constraint;
1210 const char **oconstraints;
1211 bool allows_mem, allows_reg, is_inout;
1215 oconstraints = XALLOCAVEC (const char *, noutputs);
1217 string = resolve_asm_operand_names (string, output_operands,
1218 input_operands, labels);
1220 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1222 operand = TREE_VALUE (t);
1224 /* ??? Really, this should not be here. Users should be using a
1225 proper lvalue, dammit. But there's a long history of using
1226 casts in the output operands. In cases like longlong.h, this
1227 becomes a primitive form of typechecking -- if the cast can be
1228 removed, then the output operand had a type of the proper width;
1229 otherwise we'll get an error. Gross, but ... */
1230 STRIP_NOPS (operand);
1232 operand = mark_lvalue_use (operand);
1234 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1235 operand = error_mark_node;
1237 if (operand != error_mark_node
1238 && (TREE_READONLY (operand)
1239 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1240 /* Functions are not modifiable, even though they are
1242 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1243 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1244 /* If it's an aggregate and any field is const, then it is
1245 effectively const. */
1246 || (CLASS_TYPE_P (TREE_TYPE (operand))
1247 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1248 readonly_error (operand, REK_ASSIGNMENT_ASM);
1250 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1251 oconstraints[i] = constraint;
1253 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1254 &allows_mem, &allows_reg, &is_inout))
1256 /* If the operand is going to end up in memory,
1257 mark it addressable. */
1258 if (!allows_reg && !cxx_mark_addressable (operand))
1259 operand = error_mark_node;
1262 operand = error_mark_node;
1264 TREE_VALUE (t) = operand;
1267 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1269 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1270 operand = decay_conversion (TREE_VALUE (t));
1272 /* If the type of the operand hasn't been determined (e.g.,
1273 because it involves an overloaded function), then issue
1274 an error message. There's no context available to
1275 resolve the overloading. */
1276 if (TREE_TYPE (operand) == unknown_type_node)
1278 error ("type of asm operand %qE could not be determined",
1280 operand = error_mark_node;
1283 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1284 oconstraints, &allows_mem, &allows_reg))
1286 /* If the operand is going to end up in memory,
1287 mark it addressable. */
1288 if (!allows_reg && allows_mem)
1290 /* Strip the nops as we allow this case. FIXME, this really
1291 should be rejected or made deprecated. */
1292 STRIP_NOPS (operand);
1293 if (!cxx_mark_addressable (operand))
1294 operand = error_mark_node;
1298 operand = error_mark_node;
1300 TREE_VALUE (t) = operand;
1304 r = build_stmt (input_location, ASM_EXPR, string,
1305 output_operands, input_operands,
1307 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1308 r = maybe_cleanup_point_expr_void (r);
1309 return add_stmt (r);
1312 /* Finish a label with the indicated NAME. Returns the new label. */
1315 finish_label_stmt (tree name)
1317 tree decl = define_label (input_location, name);
1319 if (decl == error_mark_node)
1320 return error_mark_node;
1322 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1327 /* Finish a series of declarations for local labels. G++ allows users
1328 to declare "local" labels, i.e., labels with scope. This extension
1329 is useful when writing code involving statement-expressions. */
1332 finish_label_decl (tree name)
1334 if (!at_function_scope_p ())
1336 error ("__label__ declarations are only allowed in function scopes");
1340 add_decl_expr (declare_local_label (name));
1343 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1346 finish_decl_cleanup (tree decl, tree cleanup)
1348 push_cleanup (decl, cleanup, false);
1351 /* If the current scope exits with an exception, run CLEANUP. */
1354 finish_eh_cleanup (tree cleanup)
1356 push_cleanup (NULL, cleanup, true);
1359 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1360 order they were written by the user. Each node is as for
1361 emit_mem_initializers. */
1364 finish_mem_initializers (tree mem_inits)
1366 /* Reorder the MEM_INITS so that they are in the order they appeared
1367 in the source program. */
1368 mem_inits = nreverse (mem_inits);
1370 if (processing_template_decl)
1374 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1376 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1377 check for bare parameter packs in the TREE_VALUE, because
1378 any parameter packs in the TREE_VALUE have already been
1379 bound as part of the TREE_PURPOSE. See
1380 make_pack_expansion for more information. */
1381 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1382 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1383 TREE_VALUE (mem) = error_mark_node;
1386 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1389 emit_mem_initializers (mem_inits);
1392 /* Finish a parenthesized expression EXPR. */
1395 finish_parenthesized_expr (tree expr)
1398 /* This inhibits warnings in c_common_truthvalue_conversion. */
1399 TREE_NO_WARNING (expr) = 1;
1401 if (TREE_CODE (expr) == OFFSET_REF)
1402 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1403 enclosed in parentheses. */
1404 PTRMEM_OK_P (expr) = 0;
1406 if (TREE_CODE (expr) == STRING_CST)
1407 PAREN_STRING_LITERAL_P (expr) = 1;
1412 /* Finish a reference to a non-static data member (DECL) that is not
1413 preceded by `.' or `->'. */
1416 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1418 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1422 tree scope = qualifying_scope;
1423 if (scope == NULL_TREE)
1424 scope = context_for_name_lookup (decl);
1425 object = maybe_dummy_object (scope, NULL);
1428 /* DR 613: Can use non-static data members without an associated
1429 object in sizeof/decltype/alignof. */
1430 if (is_dummy_object (object) && cp_unevaluated_operand == 0
1431 && (!processing_template_decl || !current_class_ref))
1433 if (current_function_decl
1434 && DECL_STATIC_FUNCTION_P (current_function_decl))
1435 error ("invalid use of member %q+D in static member function", decl);
1437 error ("invalid use of non-static data member %q+D", decl);
1438 error ("from this location");
1440 return error_mark_node;
1443 if (current_class_ptr)
1444 TREE_USED (current_class_ptr) = 1;
1445 if (processing_template_decl && !qualifying_scope)
1447 tree type = TREE_TYPE (decl);
1449 if (TREE_CODE (type) == REFERENCE_TYPE)
1450 type = TREE_TYPE (type);
1453 /* Set the cv qualifiers. */
1454 int quals = (current_class_ref
1455 ? cp_type_quals (TREE_TYPE (current_class_ref))
1456 : TYPE_UNQUALIFIED);
1458 if (DECL_MUTABLE_P (decl))
1459 quals &= ~TYPE_QUAL_CONST;
1461 quals |= cp_type_quals (TREE_TYPE (decl));
1462 type = cp_build_qualified_type (type, quals);
1465 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1467 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1468 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1470 else if (processing_template_decl)
1471 return build_qualified_name (TREE_TYPE (decl),
1474 /*template_p=*/false);
1477 tree access_type = TREE_TYPE (object);
1479 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1482 /* If the data member was named `C::M', convert `*this' to `C'
1484 if (qualifying_scope)
1486 tree binfo = NULL_TREE;
1487 object = build_scoped_ref (object, qualifying_scope,
1491 return build_class_member_access_expr (object, decl,
1492 /*access_path=*/NULL_TREE,
1493 /*preserve_reference=*/false,
1494 tf_warning_or_error);
1498 /* If we are currently parsing a template and we encountered a typedef
1499 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1500 adds the typedef to a list tied to the current template.
1501 At tempate instantiatin time, that list is walked and access check
1502 performed for each typedef.
1503 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1506 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1508 location_t location)
1510 tree template_info = NULL;
1511 tree cs = current_scope ();
1513 if (!is_typedef_decl (typedef_decl)
1515 || !CLASS_TYPE_P (context)
1519 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1520 template_info = get_template_info (cs);
1523 && TI_TEMPLATE (template_info)
1524 && !currently_open_class (context))
1525 append_type_to_template_for_access_check (cs, typedef_decl,
1529 /* DECL was the declaration to which a qualified-id resolved. Issue
1530 an error message if it is not accessible. If OBJECT_TYPE is
1531 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1532 type of `*x', or `x', respectively. If the DECL was named as
1533 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1536 check_accessibility_of_qualified_id (tree decl,
1538 tree nested_name_specifier)
1541 tree qualifying_type = NULL_TREE;
1543 /* If we are parsing a template declaration and if decl is a typedef,
1544 add it to a list tied to the template.
1545 At template instantiation time, that list will be walked and
1546 access check performed. */
1547 add_typedef_to_current_template_for_access_check (decl,
1548 nested_name_specifier
1549 ? nested_name_specifier
1550 : DECL_CONTEXT (decl),
1553 /* If we're not checking, return immediately. */
1554 if (deferred_access_no_check)
1557 /* Determine the SCOPE of DECL. */
1558 scope = context_for_name_lookup (decl);
1559 /* If the SCOPE is not a type, then DECL is not a member. */
1560 if (!TYPE_P (scope))
1562 /* Compute the scope through which DECL is being accessed. */
1564 /* OBJECT_TYPE might not be a class type; consider:
1566 class A { typedef int I; };
1570 In this case, we will have "A::I" as the DECL, but "I" as the
1572 && CLASS_TYPE_P (object_type)
1573 && DERIVED_FROM_P (scope, object_type))
1574 /* If we are processing a `->' or `.' expression, use the type of the
1576 qualifying_type = object_type;
1577 else if (nested_name_specifier)
1579 /* If the reference is to a non-static member of the
1580 current class, treat it as if it were referenced through
1582 if (DECL_NONSTATIC_MEMBER_P (decl)
1583 && current_class_ptr
1584 && DERIVED_FROM_P (scope, current_class_type))
1585 qualifying_type = current_class_type;
1586 /* Otherwise, use the type indicated by the
1587 nested-name-specifier. */
1589 qualifying_type = nested_name_specifier;
1592 /* Otherwise, the name must be from the current class or one of
1594 qualifying_type = currently_open_derived_class (scope);
1597 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1598 or similar in a default argument value. */
1599 && CLASS_TYPE_P (qualifying_type)
1600 && !dependent_type_p (qualifying_type))
1601 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1605 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1606 class named to the left of the "::" operator. DONE is true if this
1607 expression is a complete postfix-expression; it is false if this
1608 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1609 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1610 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1611 is true iff this qualified name appears as a template argument. */
1614 finish_qualified_id_expr (tree qualifying_class,
1619 bool template_arg_p)
1621 gcc_assert (TYPE_P (qualifying_class));
1623 if (error_operand_p (expr))
1624 return error_mark_node;
1626 if (DECL_P (expr) || BASELINK_P (expr))
1630 check_template_keyword (expr);
1632 /* If EXPR occurs as the operand of '&', use special handling that
1633 permits a pointer-to-member. */
1634 if (address_p && done)
1636 if (TREE_CODE (expr) == SCOPE_REF)
1637 expr = TREE_OPERAND (expr, 1);
1638 expr = build_offset_ref (qualifying_class, expr,
1639 /*address_p=*/true);
1643 /* Within the scope of a class, turn references to non-static
1644 members into expression of the form "this->...". */
1646 /* But, within a template argument, we do not want make the
1647 transformation, as there is no "this" pointer. */
1649 else if (TREE_CODE (expr) == FIELD_DECL)
1651 push_deferring_access_checks (dk_no_check);
1652 expr = finish_non_static_data_member (expr, NULL_TREE,
1654 pop_deferring_access_checks ();
1656 else if (BASELINK_P (expr) && !processing_template_decl)
1660 /* See if any of the functions are non-static members. */
1661 /* If so, the expression may be relative to 'this'. */
1662 if (!shared_member_p (expr)
1663 && (ob = maybe_dummy_object (qualifying_class, NULL),
1664 !is_dummy_object (ob)))
1665 expr = (build_class_member_access_expr
1668 BASELINK_ACCESS_BINFO (expr),
1669 /*preserve_reference=*/false,
1670 tf_warning_or_error));
1672 /* The expression is a qualified name whose address is not
1674 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1680 /* Begin a statement-expression. The value returned must be passed to
1681 finish_stmt_expr. */
1684 begin_stmt_expr (void)
1686 return push_stmt_list ();
1689 /* Process the final expression of a statement expression. EXPR can be
1690 NULL, if the final expression is empty. Return a STATEMENT_LIST
1691 containing all the statements in the statement-expression, or
1692 ERROR_MARK_NODE if there was an error. */
1695 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1697 if (error_operand_p (expr))
1699 /* The type of the statement-expression is the type of the last
1701 TREE_TYPE (stmt_expr) = error_mark_node;
1702 return error_mark_node;
1705 /* If the last statement does not have "void" type, then the value
1706 of the last statement is the value of the entire expression. */
1709 tree type = TREE_TYPE (expr);
1711 if (processing_template_decl)
1713 expr = build_stmt (input_location, EXPR_STMT, expr);
1714 expr = add_stmt (expr);
1715 /* Mark the last statement so that we can recognize it as such at
1716 template-instantiation time. */
1717 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1719 else if (VOID_TYPE_P (type))
1721 /* Just treat this like an ordinary statement. */
1722 expr = finish_expr_stmt (expr);
1726 /* It actually has a value we need to deal with. First, force it
1727 to be an rvalue so that we won't need to build up a copy
1728 constructor call later when we try to assign it to something. */
1729 expr = force_rvalue (expr);
1730 if (error_operand_p (expr))
1731 return error_mark_node;
1733 /* Update for array-to-pointer decay. */
1734 type = TREE_TYPE (expr);
1736 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1737 normal statement, but don't convert to void or actually add
1739 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1740 expr = maybe_cleanup_point_expr (expr);
1744 /* The type of the statement-expression is the type of the last
1746 TREE_TYPE (stmt_expr) = type;
1752 /* Finish a statement-expression. EXPR should be the value returned
1753 by the previous begin_stmt_expr. Returns an expression
1754 representing the statement-expression. */
1757 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1762 if (error_operand_p (stmt_expr))
1764 pop_stmt_list (stmt_expr);
1765 return error_mark_node;
1768 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1770 type = TREE_TYPE (stmt_expr);
1771 result = pop_stmt_list (stmt_expr);
1772 TREE_TYPE (result) = type;
1774 if (processing_template_decl)
1776 result = build_min (STMT_EXPR, type, result);
1777 TREE_SIDE_EFFECTS (result) = 1;
1778 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1780 else if (CLASS_TYPE_P (type))
1782 /* Wrap the statement-expression in a TARGET_EXPR so that the
1783 temporary object created by the final expression is destroyed at
1784 the end of the full-expression containing the
1785 statement-expression. */
1786 result = force_target_expr (type, result);
1792 /* Returns the expression which provides the value of STMT_EXPR. */
1795 stmt_expr_value_expr (tree stmt_expr)
1797 tree t = STMT_EXPR_STMT (stmt_expr);
1799 if (TREE_CODE (t) == BIND_EXPR)
1800 t = BIND_EXPR_BODY (t);
1802 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1803 t = STATEMENT_LIST_TAIL (t)->stmt;
1805 if (TREE_CODE (t) == EXPR_STMT)
1806 t = EXPR_STMT_EXPR (t);
1811 /* Return TRUE iff EXPR_STMT is an empty list of
1812 expression statements. */
1815 empty_expr_stmt_p (tree expr_stmt)
1817 tree body = NULL_TREE;
1819 if (expr_stmt == void_zero_node)
1824 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1825 body = EXPR_STMT_EXPR (expr_stmt);
1826 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1832 if (TREE_CODE (body) == STATEMENT_LIST)
1833 return tsi_end_p (tsi_start (body));
1835 return empty_expr_stmt_p (body);
1840 /* Perform Koenig lookup. FN is the postfix-expression representing
1841 the function (or functions) to call; ARGS are the arguments to the
1842 call. Returns the functions to be considered by overload
1846 perform_koenig_lookup (tree fn, VEC(tree,gc) *args)
1848 tree identifier = NULL_TREE;
1849 tree functions = NULL_TREE;
1850 tree tmpl_args = NULL_TREE;
1851 bool template_id = false;
1853 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1855 /* Use a separate flag to handle null args. */
1857 tmpl_args = TREE_OPERAND (fn, 1);
1858 fn = TREE_OPERAND (fn, 0);
1861 /* Find the name of the overloaded function. */
1862 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1864 else if (is_overloaded_fn (fn))
1867 identifier = DECL_NAME (get_first_fn (functions));
1869 else if (DECL_P (fn))
1872 identifier = DECL_NAME (fn);
1875 /* A call to a namespace-scope function using an unqualified name.
1877 Do Koenig lookup -- unless any of the arguments are
1879 if (!any_type_dependent_arguments_p (args)
1880 && !any_dependent_template_arguments_p (tmpl_args))
1882 fn = lookup_arg_dependent (identifier, functions, args);
1884 /* The unqualified name could not be resolved. */
1885 fn = unqualified_fn_lookup_error (identifier);
1888 if (fn && template_id)
1889 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1894 /* Generate an expression for `FN (ARGS)'. This may change the
1897 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1898 as a virtual call, even if FN is virtual. (This flag is set when
1899 encountering an expression where the function name is explicitly
1900 qualified. For example a call to `X::f' never generates a virtual
1903 Returns code for the call. */
1906 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1907 bool koenig_p, tsubst_flags_t complain)
1911 VEC(tree,gc) *orig_args = NULL;
1913 if (fn == error_mark_node)
1914 return error_mark_node;
1916 gcc_assert (!TYPE_P (fn));
1920 if (processing_template_decl)
1922 if (type_dependent_expression_p (fn)
1923 || any_type_dependent_arguments_p (*args))
1925 result = build_nt_call_vec (fn, *args);
1926 KOENIG_LOOKUP_P (result) = koenig_p;
1931 tree fndecl = OVL_CURRENT (fn);
1932 if (TREE_CODE (fndecl) != FUNCTION_DECL
1933 || !TREE_THIS_VOLATILE (fndecl))
1939 current_function_returns_abnormally = 1;
1943 orig_args = make_tree_vector_copy (*args);
1944 if (!BASELINK_P (fn)
1945 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1946 && TREE_TYPE (fn) != unknown_type_node)
1947 fn = build_non_dependent_expr (fn);
1948 make_args_non_dependent (*args);
1951 if (is_overloaded_fn (fn))
1952 fn = baselink_for_fns (fn);
1955 if (BASELINK_P (fn))
1959 /* A call to a member function. From [over.call.func]:
1961 If the keyword this is in scope and refers to the class of
1962 that member function, or a derived class thereof, then the
1963 function call is transformed into a qualified function call
1964 using (*this) as the postfix-expression to the left of the
1965 . operator.... [Otherwise] a contrived object of type T
1966 becomes the implied object argument.
1970 struct A { void f(); };
1971 struct B : public A {};
1972 struct C : public A { void g() { B::f(); }};
1974 "the class of that member function" refers to `A'. But 11.2
1975 [class.access.base] says that we need to convert 'this' to B* as
1976 part of the access, so we pass 'B' to maybe_dummy_object. */
1978 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1981 if (processing_template_decl)
1983 if (type_dependent_expression_p (object))
1985 tree ret = build_nt_call_vec (orig_fn, orig_args);
1986 release_tree_vector (orig_args);
1989 object = build_non_dependent_expr (object);
1992 result = build_new_method_call (object, fn, args, NULL_TREE,
1994 ? LOOKUP_NONVIRTUAL : 0),
1998 else if (is_overloaded_fn (fn))
2000 /* If the function is an overloaded builtin, resolve it. */
2001 if (TREE_CODE (fn) == FUNCTION_DECL
2002 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2003 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2004 result = resolve_overloaded_builtin (input_location, fn, *args);
2007 /* A call to a namespace-scope function. */
2008 result = build_new_function_call (fn, args, koenig_p, complain);
2010 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2012 if (!VEC_empty (tree, *args))
2013 error ("arguments to destructor are not allowed");
2014 /* Mark the pseudo-destructor call as having side-effects so
2015 that we do not issue warnings about its use. */
2016 result = build1 (NOP_EXPR,
2018 TREE_OPERAND (fn, 0));
2019 TREE_SIDE_EFFECTS (result) = 1;
2021 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2022 /* If the "function" is really an object of class type, it might
2023 have an overloaded `operator ()'. */
2024 result = build_op_call (fn, args, complain);
2027 /* A call where the function is unknown. */
2028 result = cp_build_function_call_vec (fn, args, complain);
2030 if (processing_template_decl)
2032 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2033 KOENIG_LOOKUP_P (result) = koenig_p;
2034 release_tree_vector (orig_args);
2040 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2041 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2042 POSTDECREMENT_EXPR.) */
2045 finish_increment_expr (tree expr, enum tree_code code)
2047 return build_x_unary_op (code, expr, tf_warning_or_error);
2050 /* Finish a use of `this'. Returns an expression for `this'. */
2053 finish_this_expr (void)
2057 if (current_class_ptr)
2059 tree type = TREE_TYPE (current_class_ref);
2061 /* In a lambda expression, 'this' refers to the captured 'this'. */
2062 if (LAMBDA_TYPE_P (type))
2063 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2065 result = current_class_ptr;
2068 else if (current_function_decl
2069 && DECL_STATIC_FUNCTION_P (current_function_decl))
2071 error ("%<this%> is unavailable for static member functions");
2072 result = error_mark_node;
2076 if (current_function_decl)
2077 error ("invalid use of %<this%> in non-member function");
2079 error ("invalid use of %<this%> at top level");
2080 result = error_mark_node;
2086 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2087 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2088 the TYPE for the type given. If SCOPE is non-NULL, the expression
2089 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2092 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2094 if (object == error_mark_node || destructor == error_mark_node)
2095 return error_mark_node;
2097 gcc_assert (TYPE_P (destructor));
2099 if (!processing_template_decl)
2101 if (scope == error_mark_node)
2103 error ("invalid qualifying scope in pseudo-destructor name");
2104 return error_mark_node;
2106 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2108 error ("qualified type %qT does not match destructor name ~%qT",
2110 return error_mark_node;
2114 /* [expr.pseudo] says both:
2116 The type designated by the pseudo-destructor-name shall be
2117 the same as the object type.
2121 The cv-unqualified versions of the object type and of the
2122 type designated by the pseudo-destructor-name shall be the
2125 We implement the more generous second sentence, since that is
2126 what most other compilers do. */
2127 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2130 error ("%qE is not of type %qT", object, destructor);
2131 return error_mark_node;
2135 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2138 /* Finish an expression of the form CODE EXPR. */
2141 finish_unary_op_expr (enum tree_code code, tree expr)
2143 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2144 /* Inside a template, build_x_unary_op does not fold the
2145 expression. So check whether the result is folded before
2146 setting TREE_NEGATED_INT. */
2147 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2148 && TREE_CODE (result) == INTEGER_CST
2149 && !TYPE_UNSIGNED (TREE_TYPE (result))
2150 && INT_CST_LT (result, integer_zero_node))
2152 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2153 setting TREE_NEGATED_INT. */
2154 result = copy_node (result);
2155 TREE_NEGATED_INT (result) = 1;
2157 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2158 overflow_warning (input_location, result);
2163 /* Finish a compound-literal expression. TYPE is the type to which
2164 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2167 finish_compound_literal (tree type, tree compound_literal)
2169 if (type == error_mark_node)
2170 return error_mark_node;
2172 if (!TYPE_OBJ_P (type))
2174 error ("compound literal of non-object type %qT", type);
2175 return error_mark_node;
2178 if (processing_template_decl)
2180 TREE_TYPE (compound_literal) = type;
2181 /* Mark the expression as a compound literal. */
2182 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2183 return compound_literal;
2186 type = complete_type (type);
2188 if (TYPE_NON_AGGREGATE_CLASS (type))
2190 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2191 everywhere that deals with function arguments would be a pain, so
2192 just wrap it in a TREE_LIST. The parser set a flag so we know
2193 that it came from T{} rather than T({}). */
2194 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2195 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2196 return build_functional_cast (type, compound_literal, tf_error);
2199 if (TREE_CODE (type) == ARRAY_TYPE
2200 && check_array_initializer (NULL_TREE, type, compound_literal))
2201 return error_mark_node;
2202 compound_literal = reshape_init (type, compound_literal);
2203 if (TREE_CODE (type) == ARRAY_TYPE)
2204 cp_complete_array_type (&type, compound_literal, false);
2205 compound_literal = digest_init (type, compound_literal);
2206 return get_target_expr (compound_literal);
2209 /* Return the declaration for the function-name variable indicated by
2213 finish_fname (tree id)
2217 decl = fname_decl (input_location, C_RID_CODE (id), id);
2218 if (processing_template_decl)
2219 decl = DECL_NAME (decl);
2223 /* Finish a translation unit. */
2226 finish_translation_unit (void)
2228 /* In case there were missing closebraces,
2229 get us back to the global binding level. */
2231 while (current_namespace != global_namespace)
2234 /* Do file scope __FUNCTION__ et al. */
2235 finish_fname_decls ();
2238 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2239 Returns the parameter. */
2242 finish_template_type_parm (tree aggr, tree identifier)
2244 if (aggr != class_type_node)
2246 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2247 aggr = class_type_node;
2250 return build_tree_list (aggr, identifier);
2253 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2254 Returns the parameter. */
2257 finish_template_template_parm (tree aggr, tree identifier)
2259 tree decl = build_decl (input_location,
2260 TYPE_DECL, identifier, NULL_TREE);
2261 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2262 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2263 DECL_TEMPLATE_RESULT (tmpl) = decl;
2264 DECL_ARTIFICIAL (decl) = 1;
2265 end_template_decl ();
2267 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2269 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2270 /*is_primary=*/true, /*is_partial=*/false,
2273 return finish_template_type_parm (aggr, tmpl);
2276 /* ARGUMENT is the default-argument value for a template template
2277 parameter. If ARGUMENT is invalid, issue error messages and return
2278 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2281 check_template_template_default_arg (tree argument)
2283 if (TREE_CODE (argument) != TEMPLATE_DECL
2284 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2285 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2287 if (TREE_CODE (argument) == TYPE_DECL)
2288 error ("invalid use of type %qT as a default value for a template "
2289 "template-parameter", TREE_TYPE (argument));
2291 error ("invalid default argument for a template template parameter");
2292 return error_mark_node;
2298 /* Begin a class definition, as indicated by T. */
2301 begin_class_definition (tree t, tree attributes)
2303 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2304 return error_mark_node;
2306 if (processing_template_parmlist)
2308 error ("definition of %q#T inside template parameter list", t);
2309 return error_mark_node;
2312 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2313 are passed the same as decimal scalar types. */
2314 if (TREE_CODE (t) == RECORD_TYPE
2315 && !processing_template_decl)
2317 tree ns = TYPE_CONTEXT (t);
2318 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2319 && DECL_CONTEXT (ns) == std_node
2321 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2323 const char *n = TYPE_NAME_STRING (t);
2324 if ((strcmp (n, "decimal32") == 0)
2325 || (strcmp (n, "decimal64") == 0)
2326 || (strcmp (n, "decimal128") == 0))
2327 TYPE_TRANSPARENT_AGGR (t) = 1;
2331 /* A non-implicit typename comes from code like:
2333 template <typename T> struct A {
2334 template <typename U> struct A<T>::B ...
2336 This is erroneous. */
2337 else if (TREE_CODE (t) == TYPENAME_TYPE)
2339 error ("invalid definition of qualified type %qT", t);
2340 t = error_mark_node;
2343 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2345 t = make_class_type (RECORD_TYPE);
2346 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2349 if (TYPE_BEING_DEFINED (t))
2351 t = make_class_type (TREE_CODE (t));
2352 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2354 maybe_process_partial_specialization (t);
2356 TYPE_BEING_DEFINED (t) = 1;
2358 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2360 if (flag_pack_struct)
2363 TYPE_PACKED (t) = 1;
2364 /* Even though the type is being defined for the first time
2365 here, there might have been a forward declaration, so there
2366 might be cv-qualified variants of T. */
2367 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2368 TYPE_PACKED (v) = 1;
2370 /* Reset the interface data, at the earliest possible
2371 moment, as it might have been set via a class foo;
2373 if (! TYPE_ANONYMOUS_P (t))
2375 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2376 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2377 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2378 (t, finfo->interface_unknown);
2380 reset_specialization();
2382 /* Make a declaration for this class in its own scope. */
2383 build_self_reference ();
2388 /* Finish the member declaration given by DECL. */
2391 finish_member_declaration (tree decl)
2393 if (decl == error_mark_node || decl == NULL_TREE)
2396 if (decl == void_type_node)
2397 /* The COMPONENT was a friend, not a member, and so there's
2398 nothing for us to do. */
2401 /* We should see only one DECL at a time. */
2402 gcc_assert (DECL_CHAIN (decl) == NULL_TREE);
2404 /* Set up access control for DECL. */
2406 = (current_access_specifier == access_private_node);
2407 TREE_PROTECTED (decl)
2408 = (current_access_specifier == access_protected_node);
2409 if (TREE_CODE (decl) == TEMPLATE_DECL)
2411 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2412 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2415 /* Mark the DECL as a member of the current class. */
2416 DECL_CONTEXT (decl) = current_class_type;
2418 /* Check for bare parameter packs in the member variable declaration. */
2419 if (TREE_CODE (decl) == FIELD_DECL)
2421 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2422 TREE_TYPE (decl) = error_mark_node;
2423 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2424 DECL_ATTRIBUTES (decl) = NULL_TREE;
2429 A C language linkage is ignored for the names of class members
2430 and the member function type of class member functions. */
2431 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2432 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2434 /* Put functions on the TYPE_METHODS list and everything else on the
2435 TYPE_FIELDS list. Note that these are built up in reverse order.
2436 We reverse them (to obtain declaration order) in finish_struct. */
2437 if (TREE_CODE (decl) == FUNCTION_DECL
2438 || DECL_FUNCTION_TEMPLATE_P (decl))
2440 /* We also need to add this function to the
2441 CLASSTYPE_METHOD_VEC. */
2442 if (add_method (current_class_type, decl, NULL_TREE))
2444 DECL_CHAIN (decl) = TYPE_METHODS (current_class_type);
2445 TYPE_METHODS (current_class_type) = decl;
2447 maybe_add_class_template_decl_list (current_class_type, decl,
2451 /* Enter the DECL into the scope of the class. */
2452 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2453 || pushdecl_class_level (decl))
2455 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2456 go at the beginning. The reason is that lookup_field_1
2457 searches the list in order, and we want a field name to
2458 override a type name so that the "struct stat hack" will
2459 work. In particular:
2461 struct S { enum E { }; int E } s;
2464 is valid. In addition, the FIELD_DECLs must be maintained in
2465 declaration order so that class layout works as expected.
2466 However, we don't need that order until class layout, so we
2467 save a little time by putting FIELD_DECLs on in reverse order
2468 here, and then reversing them in finish_struct_1. (We could
2469 also keep a pointer to the correct insertion points in the
2472 if (TREE_CODE (decl) == TYPE_DECL)
2473 TYPE_FIELDS (current_class_type)
2474 = chainon (TYPE_FIELDS (current_class_type), decl);
2477 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2478 TYPE_FIELDS (current_class_type) = decl;
2481 maybe_add_class_template_decl_list (current_class_type, decl,
2486 note_decl_for_pch (decl);
2489 /* DECL has been declared while we are building a PCH file. Perform
2490 actions that we might normally undertake lazily, but which can be
2491 performed now so that they do not have to be performed in
2492 translation units which include the PCH file. */
2495 note_decl_for_pch (tree decl)
2497 gcc_assert (pch_file);
2499 /* There's a good chance that we'll have to mangle names at some
2500 point, even if only for emission in debugging information. */
2501 if ((TREE_CODE (decl) == VAR_DECL
2502 || TREE_CODE (decl) == FUNCTION_DECL)
2503 && !processing_template_decl)
2507 /* Finish processing a complete template declaration. The PARMS are
2508 the template parameters. */
2511 finish_template_decl (tree parms)
2514 end_template_decl ();
2516 end_specialization ();
2519 /* Finish processing a template-id (which names a type) of the form
2520 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2521 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2522 the scope of template-id indicated. */
2525 finish_template_type (tree name, tree args, int entering_scope)
2529 decl = lookup_template_class (name, args,
2530 NULL_TREE, NULL_TREE, entering_scope,
2531 tf_warning_or_error | tf_user);
2532 if (decl != error_mark_node)
2533 decl = TYPE_STUB_DECL (decl);
2538 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2539 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2540 BASE_CLASS, or NULL_TREE if an error occurred. The
2541 ACCESS_SPECIFIER is one of
2542 access_{default,public,protected_private}_node. For a virtual base
2543 we set TREE_TYPE. */
2546 finish_base_specifier (tree base, tree access, bool virtual_p)
2550 if (base == error_mark_node)
2552 error ("invalid base-class specification");
2555 else if (! MAYBE_CLASS_TYPE_P (base))
2557 error ("%qT is not a class type", base);
2562 if (cp_type_quals (base) != 0)
2564 error ("base class %qT has cv qualifiers", base);
2565 base = TYPE_MAIN_VARIANT (base);
2567 result = build_tree_list (access, base);
2569 TREE_TYPE (result) = integer_type_node;
2575 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2576 what we found when we tried to do the lookup.
2577 LOCATION is the location of the NAME identifier;
2578 The location is used in the error message*/
2581 qualified_name_lookup_error (tree scope, tree name,
2582 tree decl, location_t location)
2584 if (scope == error_mark_node)
2585 ; /* We already complained. */
2586 else if (TYPE_P (scope))
2588 if (!COMPLETE_TYPE_P (scope))
2589 error_at (location, "incomplete type %qT used in nested name specifier",
2591 else if (TREE_CODE (decl) == TREE_LIST)
2593 error_at (location, "reference to %<%T::%D%> is ambiguous",
2595 print_candidates (decl);
2598 error_at (location, "%qD is not a member of %qT", name, scope);
2600 else if (scope != global_namespace)
2601 error_at (location, "%qD is not a member of %qD", name, scope);
2603 error_at (location, "%<::%D%> has not been declared", name);
2606 /* If FNS is a member function, a set of member functions, or a
2607 template-id referring to one or more member functions, return a
2608 BASELINK for FNS, incorporating the current access context.
2609 Otherwise, return FNS unchanged. */
2612 baselink_for_fns (tree fns)
2617 if (BASELINK_P (fns)
2618 || error_operand_p (fns))
2622 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2623 fn = TREE_OPERAND (fn, 0);
2624 fn = get_first_fn (fn);
2625 if (!DECL_FUNCTION_MEMBER_P (fn))
2628 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2630 cl = DECL_CONTEXT (fn);
2631 cl = TYPE_BINFO (cl);
2632 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2635 /* Returns true iff DECL is an automatic variable from a function outside
2639 outer_automatic_var_p (tree decl)
2641 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2642 && DECL_FUNCTION_SCOPE_P (decl)
2643 && !TREE_STATIC (decl)
2644 && DECL_CONTEXT (decl) != current_function_decl);
2647 /* Returns true iff DECL is a capture field from a lambda that is not our
2648 immediate context. */
2651 outer_lambda_capture_p (tree decl)
2653 return (TREE_CODE (decl) == FIELD_DECL
2654 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2655 && (!current_class_type
2656 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2659 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2660 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2661 if non-NULL, is the type or namespace used to explicitly qualify
2662 ID_EXPRESSION. DECL is the entity to which that name has been
2665 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2666 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2667 be set to true if this expression isn't permitted in a
2668 constant-expression, but it is otherwise not set by this function.
2669 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2670 constant-expression, but a non-constant expression is also
2673 DONE is true if this expression is a complete postfix-expression;
2674 it is false if this expression is followed by '->', '[', '(', etc.
2675 ADDRESS_P is true iff this expression is the operand of '&'.
2676 TEMPLATE_P is true iff the qualified-id was of the form
2677 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2678 appears as a template argument.
2680 If an error occurs, and it is the kind of error that might cause
2681 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2682 is the caller's responsibility to issue the message. *ERROR_MSG
2683 will be a string with static storage duration, so the caller need
2686 Return an expression for the entity, after issuing appropriate
2687 diagnostics. This function is also responsible for transforming a
2688 reference to a non-static member into a COMPONENT_REF that makes
2689 the use of "this" explicit.
2691 Upon return, *IDK will be filled in appropriately. */
2693 finish_id_expression (tree id_expression,
2697 bool integral_constant_expression_p,
2698 bool allow_non_integral_constant_expression_p,
2699 bool *non_integral_constant_expression_p,
2703 bool template_arg_p,
2704 const char **error_msg,
2705 location_t location)
2707 /* Initialize the output parameters. */
2708 *idk = CP_ID_KIND_NONE;
2711 if (id_expression == error_mark_node)
2712 return error_mark_node;
2713 /* If we have a template-id, then no further lookup is
2714 required. If the template-id was for a template-class, we
2715 will sometimes have a TYPE_DECL at this point. */
2716 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2717 || TREE_CODE (decl) == TYPE_DECL)
2719 /* Look up the name. */
2722 if (decl == error_mark_node)
2724 /* Name lookup failed. */
2727 || (!dependent_type_p (scope)
2728 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2729 && IDENTIFIER_TYPENAME_P (id_expression)
2730 && dependent_type_p (TREE_TYPE (id_expression))))))
2732 /* If the qualifying type is non-dependent (and the name
2733 does not name a conversion operator to a dependent
2734 type), issue an error. */
2735 qualified_name_lookup_error (scope, id_expression, decl, location);
2736 return error_mark_node;
2740 /* It may be resolved via Koenig lookup. */
2741 *idk = CP_ID_KIND_UNQUALIFIED;
2742 return id_expression;
2745 decl = id_expression;
2747 /* If DECL is a variable that would be out of scope under
2748 ANSI/ISO rules, but in scope in the ARM, name lookup
2749 will succeed. Issue a diagnostic here. */
2751 decl = check_for_out_of_scope_variable (decl);
2753 /* Remember that the name was used in the definition of
2754 the current class so that we can check later to see if
2755 the meaning would have been different after the class
2756 was entirely defined. */
2757 if (!scope && decl != error_mark_node)
2758 maybe_note_name_used_in_class (id_expression, decl);
2760 /* Disallow uses of local variables from containing functions, except
2761 within lambda-expressions. */
2762 if ((outer_automatic_var_p (decl)
2763 || outer_lambda_capture_p (decl))
2764 /* It's not a use (3.2) if we're in an unevaluated context. */
2765 && !cp_unevaluated_operand)
2767 tree context = DECL_CONTEXT (decl);
2768 tree containing_function = current_function_decl;
2769 tree lambda_stack = NULL_TREE;
2770 tree lambda_expr = NULL_TREE;
2771 tree initializer = decl;
2773 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2774 support for an approach in which a reference to a local
2775 [constant] automatic variable in a nested class or lambda body
2776 would enter the expression as an rvalue, which would reduce
2777 the complexity of the problem"
2779 FIXME update for final resolution of core issue 696. */
2780 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2781 return integral_constant_value (decl);
2783 if (TYPE_P (context))
2785 /* Implicit capture of an explicit capture. */
2786 context = lambda_function (context);
2787 initializer = thisify_lambda_field (decl);
2790 /* If we are in a lambda function, we can move out until we hit
2792 2. a non-lambda function, or
2793 3. a non-default capturing lambda function. */
2794 while (context != containing_function
2795 && LAMBDA_FUNCTION_P (containing_function))
2797 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2798 (DECL_CONTEXT (containing_function));
2800 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2804 lambda_stack = tree_cons (NULL_TREE,
2809 = decl_function_context (containing_function);
2812 if (context == containing_function)
2814 decl = add_default_capture (lambda_stack,
2815 /*id=*/DECL_NAME (decl),
2818 else if (lambda_expr)
2820 error ("%qD is not captured", decl);
2821 return error_mark_node;
2825 error (TREE_CODE (decl) == VAR_DECL
2826 ? "use of %<auto%> variable from containing function"
2827 : "use of parameter from containing function");
2828 error (" %q+#D declared here", decl);
2829 return error_mark_node;
2834 /* If we didn't find anything, or what we found was a type,
2835 then this wasn't really an id-expression. */
2836 if (TREE_CODE (decl) == TEMPLATE_DECL
2837 && !DECL_FUNCTION_TEMPLATE_P (decl))
2839 *error_msg = "missing template arguments";
2840 return error_mark_node;
2842 else if (TREE_CODE (decl) == TYPE_DECL
2843 || TREE_CODE (decl) == NAMESPACE_DECL)
2845 *error_msg = "expected primary-expression";
2846 return error_mark_node;
2849 /* If the name resolved to a template parameter, there is no
2850 need to look it up again later. */
2851 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2852 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2856 *idk = CP_ID_KIND_NONE;
2857 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2858 decl = TEMPLATE_PARM_DECL (decl);
2859 r = convert_from_reference (DECL_INITIAL (decl));
2861 if (integral_constant_expression_p
2862 && !dependent_type_p (TREE_TYPE (decl))
2863 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2865 if (!allow_non_integral_constant_expression_p)
2866 error ("template parameter %qD of type %qT is not allowed in "
2867 "an integral constant expression because it is not of "
2868 "integral or enumeration type", decl, TREE_TYPE (decl));
2869 *non_integral_constant_expression_p = true;
2873 /* Similarly, we resolve enumeration constants to their
2874 underlying values. */
2875 else if (TREE_CODE (decl) == CONST_DECL)
2877 *idk = CP_ID_KIND_NONE;
2878 if (!processing_template_decl)
2880 used_types_insert (TREE_TYPE (decl));
2881 return DECL_INITIAL (decl);
2889 /* If the declaration was explicitly qualified indicate
2890 that. The semantics of `A::f(3)' are different than
2891 `f(3)' if `f' is virtual. */
2893 ? CP_ID_KIND_QUALIFIED
2894 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2895 ? CP_ID_KIND_TEMPLATE_ID
2896 : CP_ID_KIND_UNQUALIFIED));
2901 An id-expression is type-dependent if it contains an
2902 identifier that was declared with a dependent type.
2904 The standard is not very specific about an id-expression that
2905 names a set of overloaded functions. What if some of them
2906 have dependent types and some of them do not? Presumably,
2907 such a name should be treated as a dependent name. */
2908 /* Assume the name is not dependent. */
2909 dependent_p = false;
2910 if (!processing_template_decl)
2911 /* No names are dependent outside a template. */
2913 /* A template-id where the name of the template was not resolved
2914 is definitely dependent. */
2915 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2916 && (TREE_CODE (TREE_OPERAND (decl, 0))
2917 == IDENTIFIER_NODE))
2919 /* For anything except an overloaded function, just check its
2921 else if (!is_overloaded_fn (decl))
2923 = dependent_type_p (TREE_TYPE (decl));
2924 /* For a set of overloaded functions, check each of the
2930 if (BASELINK_P (fns))
2931 fns = BASELINK_FUNCTIONS (fns);
2933 /* For a template-id, check to see if the template
2934 arguments are dependent. */
2935 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2937 tree args = TREE_OPERAND (fns, 1);
2938 dependent_p = any_dependent_template_arguments_p (args);
2939 /* The functions are those referred to by the
2941 fns = TREE_OPERAND (fns, 0);
2944 /* If there are no dependent template arguments, go through
2945 the overloaded functions. */
2946 while (fns && !dependent_p)
2948 tree fn = OVL_CURRENT (fns);
2950 /* Member functions of dependent classes are
2952 if (TREE_CODE (fn) == FUNCTION_DECL
2953 && type_dependent_expression_p (fn))
2955 else if (TREE_CODE (fn) == TEMPLATE_DECL
2956 && dependent_template_p (fn))
2959 fns = OVL_NEXT (fns);
2963 /* If the name was dependent on a template parameter, we will
2964 resolve the name at instantiation time. */
2967 /* Create a SCOPE_REF for qualified names, if the scope is
2973 if (address_p && done)
2974 decl = finish_qualified_id_expr (scope, decl,
2980 tree type = NULL_TREE;
2981 if (DECL_P (decl) && !dependent_scope_p (scope))
2982 type = TREE_TYPE (decl);
2983 decl = build_qualified_name (type,
2989 if (TREE_TYPE (decl))
2990 decl = convert_from_reference (decl);
2993 /* A TEMPLATE_ID already contains all the information we
2995 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2996 return id_expression;
2997 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2998 /* If we found a variable, then name lookup during the
2999 instantiation will always resolve to the same VAR_DECL
3000 (or an instantiation thereof). */
3001 if (TREE_CODE (decl) == VAR_DECL
3002 || TREE_CODE (decl) == PARM_DECL)
3003 return convert_from_reference (decl);
3004 /* The same is true for FIELD_DECL, but we also need to
3005 make sure that the syntax is correct. */
3006 else if (TREE_CODE (decl) == FIELD_DECL)
3008 /* Since SCOPE is NULL here, this is an unqualified name.
3009 Access checking has been performed during name lookup
3010 already. Turn off checking to avoid duplicate errors. */
3011 push_deferring_access_checks (dk_no_check);
3012 decl = finish_non_static_data_member
3014 /*qualifying_scope=*/NULL_TREE);
3015 pop_deferring_access_checks ();
3018 return id_expression;
3021 /* Only certain kinds of names are allowed in constant
3022 expression. Enumerators and template parameters have already
3023 been handled above. */
3024 if (integral_constant_expression_p
3025 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
3026 && ! builtin_valid_in_constant_expr_p (decl))
3028 if (!allow_non_integral_constant_expression_p)
3030 error ("%qD cannot appear in a constant-expression", decl);
3031 return error_mark_node;
3033 *non_integral_constant_expression_p = true;
3036 if (TREE_CODE (decl) == NAMESPACE_DECL)
3038 error ("use of namespace %qD as expression", decl);
3039 return error_mark_node;
3041 else if (DECL_CLASS_TEMPLATE_P (decl))
3043 error ("use of class template %qT as expression", decl);
3044 return error_mark_node;
3046 else if (TREE_CODE (decl) == TREE_LIST)
3048 /* Ambiguous reference to base members. */
3049 error ("request for member %qD is ambiguous in "
3050 "multiple inheritance lattice", id_expression);
3051 print_candidates (decl);
3052 return error_mark_node;
3055 /* Mark variable-like entities as used. Functions are similarly
3056 marked either below or after overload resolution. */
3057 if (TREE_CODE (decl) == VAR_DECL
3058 || TREE_CODE (decl) == PARM_DECL
3059 || TREE_CODE (decl) == RESULT_DECL)
3064 decl = (adjust_result_of_qualified_name_lookup
3065 (decl, scope, current_class_type));
3067 if (TREE_CODE (decl) == FUNCTION_DECL)
3070 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3071 decl = finish_qualified_id_expr (scope,
3079 tree r = convert_from_reference (decl);
3081 /* In a template, return a SCOPE_REF for most qualified-ids
3082 so that we can check access at instantiation time. But if
3083 we're looking at a member of the current instantiation, we
3084 know we have access and building up the SCOPE_REF confuses
3085 non-type template argument handling. */
3086 if (processing_template_decl && TYPE_P (scope)
3087 && !currently_open_class (scope))
3088 r = build_qualified_name (TREE_TYPE (r),
3094 else if (TREE_CODE (decl) == FIELD_DECL)
3096 /* Since SCOPE is NULL here, this is an unqualified name.
3097 Access checking has been performed during name lookup
3098 already. Turn off checking to avoid duplicate errors. */
3099 push_deferring_access_checks (dk_no_check);
3100 decl = finish_non_static_data_member (decl, NULL_TREE,
3101 /*qualifying_scope=*/NULL_TREE);
3102 pop_deferring_access_checks ();
3104 else if (is_overloaded_fn (decl))
3108 first_fn = get_first_fn (decl);
3109 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3110 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3112 if (!really_overloaded_fn (decl))
3113 mark_used (first_fn);
3116 && TREE_CODE (first_fn) == FUNCTION_DECL
3117 && DECL_FUNCTION_MEMBER_P (first_fn)
3118 && !shared_member_p (decl))
3120 /* A set of member functions. */
3121 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3122 return finish_class_member_access_expr (decl, id_expression,
3123 /*template_p=*/false,
3124 tf_warning_or_error);
3127 decl = baselink_for_fns (decl);
3131 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3132 && DECL_CLASS_SCOPE_P (decl))
3134 tree context = context_for_name_lookup (decl);
3135 if (context != current_class_type)
3137 tree path = currently_open_derived_class (context);
3138 perform_or_defer_access_check (TYPE_BINFO (path),
3143 decl = convert_from_reference (decl);
3147 if (TREE_DEPRECATED (decl))
3148 warn_deprecated_use (decl, NULL_TREE);
3153 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3154 use as a type-specifier. */
3157 finish_typeof (tree expr)
3161 if (type_dependent_expression_p (expr))
3163 type = cxx_make_type (TYPEOF_TYPE);
3164 TYPEOF_TYPE_EXPR (type) = expr;
3165 SET_TYPE_STRUCTURAL_EQUALITY (type);
3170 expr = mark_type_use (expr);
3172 type = unlowered_expr_type (expr);
3174 if (!type || type == unknown_type_node)
3176 error ("type of %qE is unknown", expr);
3177 return error_mark_node;
3183 /* Perform C++-specific checks for __builtin_offsetof before calling
3187 finish_offsetof (tree expr)
3189 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3191 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3192 TREE_OPERAND (expr, 2));
3193 return error_mark_node;
3195 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3196 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3197 || TREE_TYPE (expr) == unknown_type_node)
3199 if (TREE_CODE (expr) == COMPONENT_REF
3200 || TREE_CODE (expr) == COMPOUND_EXPR)
3201 expr = TREE_OPERAND (expr, 1);
3202 error ("cannot apply %<offsetof%> to member function %qD", expr);
3203 return error_mark_node;
3205 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3206 expr = TREE_OPERAND (expr, 0);
3207 return fold_offsetof (expr, NULL_TREE);
3210 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3211 function is broken out from the above for the benefit of the tree-ssa
3215 simplify_aggr_init_expr (tree *tp)
3217 tree aggr_init_expr = *tp;
3219 /* Form an appropriate CALL_EXPR. */
3220 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3221 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3222 tree type = TREE_TYPE (slot);
3225 enum style_t { ctor, arg, pcc } style;
3227 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3229 #ifdef PCC_STATIC_STRUCT_RETURN
3235 gcc_assert (TREE_ADDRESSABLE (type));
3239 call_expr = build_call_array_loc (input_location,
3240 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3242 aggr_init_expr_nargs (aggr_init_expr),
3243 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3244 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3248 /* Replace the first argument to the ctor with the address of the
3250 cxx_mark_addressable (slot);
3251 CALL_EXPR_ARG (call_expr, 0) =
3252 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3254 else if (style == arg)
3256 /* Just mark it addressable here, and leave the rest to
3257 expand_call{,_inline}. */
3258 cxx_mark_addressable (slot);
3259 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3260 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3262 else if (style == pcc)
3264 /* If we're using the non-reentrant PCC calling convention, then we
3265 need to copy the returned value out of the static buffer into the
3267 push_deferring_access_checks (dk_no_check);
3268 call_expr = build_aggr_init (slot, call_expr,
3269 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3270 tf_warning_or_error);
3271 pop_deferring_access_checks ();
3272 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3275 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3277 tree init = build_zero_init (type, NULL_TREE,
3278 /*static_storage_p=*/false);
3279 init = build2 (INIT_EXPR, void_type_node, slot, init);
3280 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3287 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3290 emit_associated_thunks (tree fn)
3292 /* When we use vcall offsets, we emit thunks with the virtual
3293 functions to which they thunk. The whole point of vcall offsets
3294 is so that you can know statically the entire set of thunks that
3295 will ever be needed for a given virtual function, thereby
3296 enabling you to output all the thunks with the function itself. */
3297 if (DECL_VIRTUAL_P (fn)
3298 /* Do not emit thunks for extern template instantiations. */
3299 && ! DECL_REALLY_EXTERN (fn))
3303 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3305 if (!THUNK_ALIAS (thunk))
3307 use_thunk (thunk, /*emit_p=*/1);
3308 if (DECL_RESULT_THUNK_P (thunk))
3312 for (probe = DECL_THUNKS (thunk);
3313 probe; probe = DECL_CHAIN (probe))
3314 use_thunk (probe, /*emit_p=*/1);
3318 gcc_assert (!DECL_THUNKS (thunk));
3323 /* Generate RTL for FN. */
3326 expand_or_defer_fn_1 (tree fn)
3328 /* When the parser calls us after finishing the body of a template
3329 function, we don't really want to expand the body. */
3330 if (processing_template_decl)
3332 /* Normally, collection only occurs in rest_of_compilation. So,
3333 if we don't collect here, we never collect junk generated
3334 during the processing of templates until we hit a
3335 non-template function. It's not safe to do this inside a
3336 nested class, though, as the parser may have local state that
3337 is not a GC root. */
3338 if (!function_depth)
3343 gcc_assert (DECL_SAVED_TREE (fn));
3345 /* If this is a constructor or destructor body, we have to clone
3347 if (maybe_clone_body (fn))
3349 /* We don't want to process FN again, so pretend we've written
3350 it out, even though we haven't. */
3351 TREE_ASM_WRITTEN (fn) = 1;
3352 DECL_SAVED_TREE (fn) = NULL_TREE;
3356 /* We make a decision about linkage for these functions at the end
3357 of the compilation. Until that point, we do not want the back
3358 end to output them -- but we do want it to see the bodies of
3359 these functions so that it can inline them as appropriate. */
3360 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3362 if (DECL_INTERFACE_KNOWN (fn))
3363 /* We've already made a decision as to how this function will
3367 DECL_EXTERNAL (fn) = 1;
3368 DECL_NOT_REALLY_EXTERN (fn) = 1;
3369 note_vague_linkage_fn (fn);
3370 /* A non-template inline function with external linkage will
3371 always be COMDAT. As we must eventually determine the
3372 linkage of all functions, and as that causes writes to
3373 the data mapped in from the PCH file, it's advantageous
3374 to mark the functions at this point. */
3375 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3377 /* This function must have external linkage, as
3378 otherwise DECL_INTERFACE_KNOWN would have been
3380 gcc_assert (TREE_PUBLIC (fn));
3381 comdat_linkage (fn);
3382 DECL_INTERFACE_KNOWN (fn) = 1;
3386 import_export_decl (fn);
3388 /* If the user wants us to keep all inline functions, then mark
3389 this function as needed so that finish_file will make sure to
3390 output it later. Similarly, all dllexport'd functions must
3391 be emitted; there may be callers in other DLLs. */
3392 if ((flag_keep_inline_functions
3393 && DECL_DECLARED_INLINE_P (fn)
3394 && !DECL_REALLY_EXTERN (fn))
3395 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3399 /* There's no reason to do any of the work here if we're only doing
3400 semantic analysis; this code just generates RTL. */
3401 if (flag_syntax_only)
3408 expand_or_defer_fn (tree fn)
3410 if (expand_or_defer_fn_1 (fn))
3414 /* Expand or defer, at the whim of the compilation unit manager. */
3415 cgraph_finalize_function (fn, function_depth > 1);
3416 emit_associated_thunks (fn);
3429 /* Helper function for walk_tree, used by finalize_nrv below. */
3432 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3434 struct nrv_data *dp = (struct nrv_data *)data;
3437 /* No need to walk into types. There wouldn't be any need to walk into
3438 non-statements, except that we have to consider STMT_EXPRs. */
3441 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3442 but differs from using NULL_TREE in that it indicates that we care
3443 about the value of the RESULT_DECL. */
3444 else if (TREE_CODE (*tp) == RETURN_EXPR)
3445 TREE_OPERAND (*tp, 0) = dp->result;
3446 /* Change all cleanups for the NRV to only run when an exception is
3448 else if (TREE_CODE (*tp) == CLEANUP_STMT
3449 && CLEANUP_DECL (*tp) == dp->var)
3450 CLEANUP_EH_ONLY (*tp) = 1;
3451 /* Replace the DECL_EXPR for the NRV with an initialization of the
3452 RESULT_DECL, if needed. */
3453 else if (TREE_CODE (*tp) == DECL_EXPR
3454 && DECL_EXPR_DECL (*tp) == dp->var)
3457 if (DECL_INITIAL (dp->var)
3458 && DECL_INITIAL (dp->var) != error_mark_node)
3459 init = build2 (INIT_EXPR, void_type_node, dp->result,
3460 DECL_INITIAL (dp->var));
3462 init = build_empty_stmt (EXPR_LOCATION (*tp));
3463 DECL_INITIAL (dp->var) = NULL_TREE;
3464 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3467 /* And replace all uses of the NRV with the RESULT_DECL. */
3468 else if (*tp == dp->var)
3471 /* Avoid walking into the same tree more than once. Unfortunately, we
3472 can't just use walk_tree_without duplicates because it would only call
3473 us for the first occurrence of dp->var in the function body. */
3474 slot = htab_find_slot (dp->visited, *tp, INSERT);
3480 /* Keep iterating. */
3484 /* Called from finish_function to implement the named return value
3485 optimization by overriding all the RETURN_EXPRs and pertinent
3486 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3487 RESULT_DECL for the function. */
3490 finalize_nrv (tree *tp, tree var, tree result)
3492 struct nrv_data data;
3494 /* Copy name from VAR to RESULT. */
3495 DECL_NAME (result) = DECL_NAME (var);
3496 /* Don't forget that we take its address. */
3497 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3498 /* Finally set DECL_VALUE_EXPR to avoid assigning
3499 a stack slot at -O0 for the original var and debug info
3500 uses RESULT location for VAR. */
3501 SET_DECL_VALUE_EXPR (var, result);
3502 DECL_HAS_VALUE_EXPR_P (var) = 1;
3505 data.result = result;
3506 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3507 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3508 htab_delete (data.visited);
3511 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3514 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3515 bool need_copy_ctor, bool need_copy_assignment)
3517 int save_errorcount = errorcount;
3520 /* Always allocate 3 elements for simplicity. These are the
3521 function decls for the ctor, dtor, and assignment op.
3522 This layout is known to the three lang hooks,
3523 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3524 and cxx_omp_clause_assign_op. */
3525 info = make_tree_vec (3);
3526 CP_OMP_CLAUSE_INFO (c) = info;
3528 if (need_default_ctor || need_copy_ctor)
3530 if (need_default_ctor)
3531 t = get_default_ctor (type);
3533 t = get_copy_ctor (type);
3535 if (t && !trivial_fn_p (t))
3536 TREE_VEC_ELT (info, 0) = t;
3539 if ((need_default_ctor || need_copy_ctor)
3540 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3541 TREE_VEC_ELT (info, 1) = get_dtor (type);
3543 if (need_copy_assignment)
3545 t = get_copy_assign (type);
3547 if (t && !trivial_fn_p (t))
3548 TREE_VEC_ELT (info, 2) = t;
3551 return errorcount != save_errorcount;
3554 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3555 Remove any elements from the list that are invalid. */
3558 finish_omp_clauses (tree clauses)
3560 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3561 tree c, t, *pc = &clauses;
3564 bitmap_obstack_initialize (NULL);
3565 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3566 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3567 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3569 for (pc = &clauses, c = clauses; c ; c = *pc)
3571 bool remove = false;
3573 switch (OMP_CLAUSE_CODE (c))
3575 case OMP_CLAUSE_SHARED:
3577 goto check_dup_generic;
3578 case OMP_CLAUSE_PRIVATE:
3580 goto check_dup_generic;
3581 case OMP_CLAUSE_REDUCTION:
3583 goto check_dup_generic;
3584 case OMP_CLAUSE_COPYPRIVATE:
3585 name = "copyprivate";
3586 goto check_dup_generic;
3587 case OMP_CLAUSE_COPYIN:
3589 goto check_dup_generic;
3591 t = OMP_CLAUSE_DECL (c);
3592 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3594 if (processing_template_decl)
3597 error ("%qD is not a variable in clause %qs", t, name);
3599 error ("%qE is not a variable in clause %qs", t, name);
3602 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3603 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3604 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3606 error ("%qD appears more than once in data clauses", t);
3610 bitmap_set_bit (&generic_head, DECL_UID (t));
3613 case OMP_CLAUSE_FIRSTPRIVATE:
3614 t = OMP_CLAUSE_DECL (c);
3615 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3617 if (processing_template_decl)
3620 error ("%qD is not a variable in clause %<firstprivate%>", t);
3622 error ("%qE is not a variable in clause %<firstprivate%>", t);
3625 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3626 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3628 error ("%qD appears more than once in data clauses", t);
3632 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3635 case OMP_CLAUSE_LASTPRIVATE:
3636 t = OMP_CLAUSE_DECL (c);
3637 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3639 if (processing_template_decl)
3642 error ("%qD is not a variable in clause %<lastprivate%>", t);
3644 error ("%qE is not a variable in clause %<lastprivate%>", t);
3647 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3648 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3650 error ("%qD appears more than once in data clauses", t);
3654 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3658 t = OMP_CLAUSE_IF_EXPR (c);
3659 t = maybe_convert_cond (t);
3660 if (t == error_mark_node)
3662 OMP_CLAUSE_IF_EXPR (c) = t;
3665 case OMP_CLAUSE_NUM_THREADS:
3666 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3667 if (t == error_mark_node)
3669 else if (!type_dependent_expression_p (t)
3670 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3672 error ("num_threads expression must be integral");
3677 case OMP_CLAUSE_SCHEDULE:
3678 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3681 else if (t == error_mark_node)
3683 else if (!type_dependent_expression_p (t)
3684 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3686 error ("schedule chunk size expression must be integral");
3691 case OMP_CLAUSE_NOWAIT:
3692 case OMP_CLAUSE_ORDERED:
3693 case OMP_CLAUSE_DEFAULT:
3694 case OMP_CLAUSE_UNTIED:
3695 case OMP_CLAUSE_COLLAPSE:
3703 *pc = OMP_CLAUSE_CHAIN (c);
3705 pc = &OMP_CLAUSE_CHAIN (c);
3708 for (pc = &clauses, c = clauses; c ; c = *pc)
3710 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3711 bool remove = false;
3712 bool need_complete_non_reference = false;
3713 bool need_default_ctor = false;
3714 bool need_copy_ctor = false;
3715 bool need_copy_assignment = false;
3716 bool need_implicitly_determined = false;
3717 tree type, inner_type;
3721 case OMP_CLAUSE_SHARED:
3723 need_implicitly_determined = true;
3725 case OMP_CLAUSE_PRIVATE:
3727 need_complete_non_reference = true;
3728 need_default_ctor = true;
3729 need_implicitly_determined = true;
3731 case OMP_CLAUSE_FIRSTPRIVATE:
3732 name = "firstprivate";
3733 need_complete_non_reference = true;
3734 need_copy_ctor = true;
3735 need_implicitly_determined = true;
3737 case OMP_CLAUSE_LASTPRIVATE:
3738 name = "lastprivate";
3739 need_complete_non_reference = true;
3740 need_copy_assignment = true;
3741 need_implicitly_determined = true;
3743 case OMP_CLAUSE_REDUCTION:
3745 need_implicitly_determined = true;
3747 case OMP_CLAUSE_COPYPRIVATE:
3748 name = "copyprivate";
3749 need_copy_assignment = true;
3751 case OMP_CLAUSE_COPYIN:
3753 need_copy_assignment = true;
3756 pc = &OMP_CLAUSE_CHAIN (c);
3760 t = OMP_CLAUSE_DECL (c);
3761 if (processing_template_decl
3762 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3764 pc = &OMP_CLAUSE_CHAIN (c);
3770 case OMP_CLAUSE_LASTPRIVATE:
3771 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3772 need_default_ctor = true;
3775 case OMP_CLAUSE_REDUCTION:
3776 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3777 || POINTER_TYPE_P (TREE_TYPE (t)))
3779 error ("%qE has invalid type for %<reduction%>", t);
3782 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3784 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3792 error ("%qE has invalid type for %<reduction(%s)%>",
3793 t, operator_name_info[r_code].name);
3799 case OMP_CLAUSE_COPYIN:
3800 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3802 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3811 if (need_complete_non_reference)
3813 t = require_complete_type (t);
3814 if (t == error_mark_node)
3816 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3818 error ("%qE has reference type for %qs", t, name);
3822 if (need_implicitly_determined)
3824 const char *share_name = NULL;
3826 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3827 share_name = "threadprivate";
3828 else switch (cxx_omp_predetermined_sharing (t))
3830 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3832 case OMP_CLAUSE_DEFAULT_SHARED:
3833 share_name = "shared";
3835 case OMP_CLAUSE_DEFAULT_PRIVATE:
3836 share_name = "private";
3843 error ("%qE is predetermined %qs for %qs",
3844 t, share_name, name);
3849 /* We're interested in the base element, not arrays. */
3850 inner_type = type = TREE_TYPE (t);
3851 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3852 inner_type = TREE_TYPE (inner_type);
3854 /* Check for special function availability by building a call to one.
3855 Save the results, because later we won't be in the right context
3856 for making these queries. */
3857 if (CLASS_TYPE_P (inner_type)
3858 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3859 && !type_dependent_expression_p (t)
3860 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3861 need_copy_ctor, need_copy_assignment))
3865 *pc = OMP_CLAUSE_CHAIN (c);
3867 pc = &OMP_CLAUSE_CHAIN (c);
3870 bitmap_obstack_release (NULL);
3874 /* For all variables in the tree_list VARS, mark them as thread local. */
3877 finish_omp_threadprivate (tree vars)
3881 /* Mark every variable in VARS to be assigned thread local storage. */
3882 for (t = vars; t; t = TREE_CHAIN (t))
3884 tree v = TREE_PURPOSE (t);
3886 if (error_operand_p (v))
3888 else if (TREE_CODE (v) != VAR_DECL)
3889 error ("%<threadprivate%> %qD is not file, namespace "
3890 "or block scope variable", v);
3891 /* If V had already been marked threadprivate, it doesn't matter
3892 whether it had been used prior to this point. */
3893 else if (TREE_USED (v)
3894 && (DECL_LANG_SPECIFIC (v) == NULL
3895 || !CP_DECL_THREADPRIVATE_P (v)))
3896 error ("%qE declared %<threadprivate%> after first use", v);
3897 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3898 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3899 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3900 error ("%<threadprivate%> %qE has incomplete type", v);
3901 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3902 && CP_DECL_CONTEXT (v) != current_class_type)
3903 error ("%<threadprivate%> %qE directive not "
3904 "in %qT definition", v, CP_DECL_CONTEXT (v));
3907 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3908 if (DECL_LANG_SPECIFIC (v) == NULL)
3910 retrofit_lang_decl (v);
3912 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3913 after the allocation of the lang_decl structure. */
3914 if (DECL_DISCRIMINATOR_P (v))
3915 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
3918 if (! DECL_THREAD_LOCAL_P (v))
3920 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3921 /* If rtl has been already set for this var, call
3922 make_decl_rtl once again, so that encode_section_info
3923 has a chance to look at the new decl flags. */
3924 if (DECL_RTL_SET_P (v))
3927 CP_DECL_THREADPRIVATE_P (v) = 1;
3932 /* Build an OpenMP structured block. */
3935 begin_omp_structured_block (void)
3937 return do_pushlevel (sk_omp);
3941 finish_omp_structured_block (tree block)
3943 return do_poplevel (block);
3946 /* Similarly, except force the retention of the BLOCK. */
3949 begin_omp_parallel (void)
3951 keep_next_level (true);
3952 return begin_omp_structured_block ();
3956 finish_omp_parallel (tree clauses, tree body)
3960 body = finish_omp_structured_block (body);
3962 stmt = make_node (OMP_PARALLEL);
3963 TREE_TYPE (stmt) = void_type_node;
3964 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3965 OMP_PARALLEL_BODY (stmt) = body;
3967 return add_stmt (stmt);
3971 begin_omp_task (void)
3973 keep_next_level (true);
3974 return begin_omp_structured_block ();
3978 finish_omp_task (tree clauses, tree body)
3982 body = finish_omp_structured_block (body);
3984 stmt = make_node (OMP_TASK);
3985 TREE_TYPE (stmt) = void_type_node;
3986 OMP_TASK_CLAUSES (stmt) = clauses;
3987 OMP_TASK_BODY (stmt) = body;
3989 return add_stmt (stmt);
3992 /* Helper function for finish_omp_for. Convert Ith random access iterator
3993 into integral iterator. Return FALSE if successful. */
3996 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3997 tree condv, tree incrv, tree *body,
3998 tree *pre_body, tree clauses)
4000 tree diff, iter_init, iter_incr = NULL, last;
4001 tree incr_var = NULL, orig_pre_body, orig_body, c;
4002 tree decl = TREE_VEC_ELT (declv, i);
4003 tree init = TREE_VEC_ELT (initv, i);
4004 tree cond = TREE_VEC_ELT (condv, i);
4005 tree incr = TREE_VEC_ELT (incrv, i);
4007 location_t elocus = locus;
4009 if (init && EXPR_HAS_LOCATION (init))
4010 elocus = EXPR_LOCATION (init);
4012 switch (TREE_CODE (cond))
4018 if (TREE_OPERAND (cond, 1) == iter)
4019 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4020 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4021 if (TREE_OPERAND (cond, 0) != iter)
4022 cond = error_mark_node;
4025 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4026 TREE_OPERAND (cond, 1), ERROR_MARK,
4027 NULL, tf_warning_or_error);
4028 if (error_operand_p (tem))
4033 cond = error_mark_node;
4036 if (cond == error_mark_node)
4038 error_at (elocus, "invalid controlling predicate");
4041 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4042 ERROR_MARK, iter, ERROR_MARK, NULL,
4043 tf_warning_or_error);
4044 if (error_operand_p (diff))
4046 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4048 error_at (elocus, "difference between %qE and %qD does not have integer type",
4049 TREE_OPERAND (cond, 1), iter);
4053 switch (TREE_CODE (incr))
4055 case PREINCREMENT_EXPR:
4056 case PREDECREMENT_EXPR:
4057 case POSTINCREMENT_EXPR:
4058 case POSTDECREMENT_EXPR:
4059 if (TREE_OPERAND (incr, 0) != iter)
4061 incr = error_mark_node;
4064 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4065 tf_warning_or_error);
4066 if (error_operand_p (iter_incr))
4068 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4069 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4070 incr = integer_one_node;
4072 incr = integer_minus_one_node;
4075 if (TREE_OPERAND (incr, 0) != iter)
4076 incr = error_mark_node;
4077 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4078 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4080 tree rhs = TREE_OPERAND (incr, 1);
4081 if (TREE_OPERAND (rhs, 0) == iter)
4083 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4085 incr = error_mark_node;
4088 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4089 TREE_OPERAND (rhs, 1),
4090 tf_warning_or_error);
4091 if (error_operand_p (iter_incr))
4093 incr = TREE_OPERAND (rhs, 1);
4094 incr = cp_convert (TREE_TYPE (diff), incr);
4095 if (TREE_CODE (rhs) == MINUS_EXPR)
4097 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4098 incr = fold_if_not_in_template (incr);
4100 if (TREE_CODE (incr) != INTEGER_CST
4101 && (TREE_CODE (incr) != NOP_EXPR
4102 || (TREE_CODE (TREE_OPERAND (incr, 0))
4107 else if (TREE_OPERAND (rhs, 1) == iter)
4109 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4110 || TREE_CODE (rhs) != PLUS_EXPR)
4111 incr = error_mark_node;
4114 iter_incr = build_x_binary_op (PLUS_EXPR,
4115 TREE_OPERAND (rhs, 0),
4118 tf_warning_or_error);
4119 if (error_operand_p (iter_incr))
4121 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4123 tf_warning_or_error);
4124 if (error_operand_p (iter_incr))
4126 incr = TREE_OPERAND (rhs, 0);
4131 incr = error_mark_node;
4134 incr = error_mark_node;
4137 incr = error_mark_node;
4141 if (incr == error_mark_node)
4143 error_at (elocus, "invalid increment expression");
4147 incr = cp_convert (TREE_TYPE (diff), incr);
4148 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4149 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4150 && OMP_CLAUSE_DECL (c) == iter)
4153 decl = create_temporary_var (TREE_TYPE (diff));
4155 add_decl_expr (decl);
4156 last = create_temporary_var (TREE_TYPE (diff));
4158 add_decl_expr (last);
4159 if (c && iter_incr == NULL)
4161 incr_var = create_temporary_var (TREE_TYPE (diff));
4162 pushdecl (incr_var);
4163 add_decl_expr (incr_var);
4165 gcc_assert (stmts_are_full_exprs_p ());
4167 orig_pre_body = *pre_body;
4168 *pre_body = push_stmt_list ();
4170 add_stmt (orig_pre_body);
4172 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4173 tf_warning_or_error));
4174 init = build_int_cst (TREE_TYPE (diff), 0);
4175 if (c && iter_incr == NULL)
4177 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4178 incr, tf_warning_or_error));
4180 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4181 tf_warning_or_error);
4183 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4184 tf_warning_or_error));
4185 *pre_body = pop_stmt_list (*pre_body);
4187 cond = cp_build_binary_op (elocus,
4188 TREE_CODE (cond), decl, diff,
4189 tf_warning_or_error);
4190 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4191 elocus, incr, NULL_TREE);
4194 *body = push_stmt_list ();
4195 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4196 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4197 tf_warning_or_error);
4198 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4199 finish_expr_stmt (iter_init);
4200 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4201 tf_warning_or_error));
4202 add_stmt (orig_body);
4203 *body = pop_stmt_list (*body);
4207 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4208 finish_expr_stmt (iter_incr);
4209 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4210 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4213 TREE_VEC_ELT (declv, i) = decl;
4214 TREE_VEC_ELT (initv, i) = init;
4215 TREE_VEC_ELT (condv, i) = cond;
4216 TREE_VEC_ELT (incrv, i) = incr;
4221 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4222 are directly for their associated operands in the statement. DECL
4223 and INIT are a combo; if DECL is NULL then INIT ought to be a
4224 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4225 optional statements that need to go before the loop into its
4229 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4230 tree incrv, tree body, tree pre_body, tree clauses)
4232 tree omp_for = NULL, orig_incr = NULL;
4233 tree decl, init, cond, incr;
4237 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4238 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4239 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4240 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4242 decl = TREE_VEC_ELT (declv, i);
4243 init = TREE_VEC_ELT (initv, i);
4244 cond = TREE_VEC_ELT (condv, i);
4245 incr = TREE_VEC_ELT (incrv, i);
4251 switch (TREE_CODE (init))
4254 decl = TREE_OPERAND (init, 0);
4255 init = TREE_OPERAND (init, 1);
4258 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4260 decl = TREE_OPERAND (init, 0);
4261 init = TREE_OPERAND (init, 2);
4271 "expected iteration declaration or initialization");
4276 if (init && EXPR_HAS_LOCATION (init))
4277 elocus = EXPR_LOCATION (init);
4281 error_at (elocus, "missing controlling predicate");
4287 error_at (elocus, "missing increment expression");
4291 TREE_VEC_ELT (declv, i) = decl;
4292 TREE_VEC_ELT (initv, i) = init;
4295 if (dependent_omp_for_p (declv, initv, condv, incrv))
4299 stmt = make_node (OMP_FOR);
4301 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4303 /* This is really just a place-holder. We'll be decomposing this
4304 again and going through the cp_build_modify_expr path below when
4305 we instantiate the thing. */
4306 TREE_VEC_ELT (initv, i)
4307 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4308 TREE_VEC_ELT (initv, i));
4311 TREE_TYPE (stmt) = void_type_node;
4312 OMP_FOR_INIT (stmt) = initv;
4313 OMP_FOR_COND (stmt) = condv;
4314 OMP_FOR_INCR (stmt) = incrv;
4315 OMP_FOR_BODY (stmt) = body;
4316 OMP_FOR_PRE_BODY (stmt) = pre_body;
4317 OMP_FOR_CLAUSES (stmt) = clauses;
4319 SET_EXPR_LOCATION (stmt, locus);
4320 return add_stmt (stmt);
4323 if (processing_template_decl)
4324 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4326 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4328 decl = TREE_VEC_ELT (declv, i);
4329 init = TREE_VEC_ELT (initv, i);
4330 cond = TREE_VEC_ELT (condv, i);
4331 incr = TREE_VEC_ELT (incrv, i);
4333 TREE_VEC_ELT (orig_incr, i) = incr;
4336 if (init && EXPR_HAS_LOCATION (init))
4337 elocus = EXPR_LOCATION (init);
4341 error_at (elocus, "expected iteration declaration or initialization");
4345 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4348 TREE_VEC_ELT (orig_incr, i) = incr;
4349 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4350 TREE_CODE (TREE_OPERAND (incr, 1)),
4351 TREE_OPERAND (incr, 2),
4352 tf_warning_or_error);
4355 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4357 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4358 incrv, &body, &pre_body, clauses))
4363 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4364 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4366 error_at (elocus, "invalid type for iteration variable %qE", decl);
4370 if (!processing_template_decl)
4372 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4373 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4376 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4378 && TREE_SIDE_EFFECTS (cond)
4379 && COMPARISON_CLASS_P (cond)
4380 && !processing_template_decl)
4382 tree t = TREE_OPERAND (cond, 0);
4383 if (TREE_SIDE_EFFECTS (t)
4385 && (TREE_CODE (t) != NOP_EXPR
4386 || TREE_OPERAND (t, 0) != decl))
4387 TREE_OPERAND (cond, 0)
4388 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4390 t = TREE_OPERAND (cond, 1);
4391 if (TREE_SIDE_EFFECTS (t)
4393 && (TREE_CODE (t) != NOP_EXPR
4394 || TREE_OPERAND (t, 0) != decl))
4395 TREE_OPERAND (cond, 1)
4396 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4398 if (decl == error_mark_node || init == error_mark_node)
4401 TREE_VEC_ELT (declv, i) = decl;
4402 TREE_VEC_ELT (initv, i) = init;
4403 TREE_VEC_ELT (condv, i) = cond;
4404 TREE_VEC_ELT (incrv, i) = incr;
4408 if (IS_EMPTY_STMT (pre_body))
4411 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4414 if (omp_for == NULL)
4417 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4419 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4420 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4422 if (TREE_CODE (incr) != MODIFY_EXPR)
4425 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4426 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4427 && !processing_template_decl)
4429 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4430 if (TREE_SIDE_EFFECTS (t)
4432 && (TREE_CODE (t) != NOP_EXPR
4433 || TREE_OPERAND (t, 0) != decl))
4434 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4435 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4437 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4438 if (TREE_SIDE_EFFECTS (t)
4440 && (TREE_CODE (t) != NOP_EXPR
4441 || TREE_OPERAND (t, 0) != decl))
4442 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4443 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4447 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4449 if (omp_for != NULL)
4450 OMP_FOR_CLAUSES (omp_for) = clauses;
4455 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4464 dependent_p = false;
4467 /* Even in a template, we can detect invalid uses of the atomic
4468 pragma if neither LHS nor RHS is type-dependent. */
4469 if (processing_template_decl)
4471 dependent_p = (type_dependent_expression_p (lhs)
4472 || type_dependent_expression_p (rhs));
4475 lhs = build_non_dependent_expr (lhs);
4476 rhs = build_non_dependent_expr (rhs);
4481 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4482 if (stmt == error_mark_node)
4485 if (processing_template_decl)
4486 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4487 build2 (code, void_type_node, orig_lhs, orig_rhs));
4492 finish_omp_barrier (void)
4494 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4495 VEC(tree,gc) *vec = make_tree_vector ();
4496 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4497 release_tree_vector (vec);
4498 finish_expr_stmt (stmt);
4502 finish_omp_flush (void)
4504 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4505 VEC(tree,gc) *vec = make_tree_vector ();
4506 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4507 release_tree_vector (vec);
4508 finish_expr_stmt (stmt);
4512 finish_omp_taskwait (void)
4514 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4515 VEC(tree,gc) *vec = make_tree_vector ();
4516 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4517 release_tree_vector (vec);
4518 finish_expr_stmt (stmt);
4522 init_cp_semantics (void)
4526 /* Build a STATIC_ASSERT for a static assertion with the condition
4527 CONDITION and the message text MESSAGE. LOCATION is the location
4528 of the static assertion in the source code. When MEMBER_P, this
4529 static assertion is a member of a class. */
4531 finish_static_assert (tree condition, tree message, location_t location,
4534 if (check_for_bare_parameter_packs (condition))
4535 condition = error_mark_node;
4537 if (type_dependent_expression_p (condition)
4538 || value_dependent_expression_p (condition))
4540 /* We're in a template; build a STATIC_ASSERT and put it in
4544 assertion = make_node (STATIC_ASSERT);
4545 STATIC_ASSERT_CONDITION (assertion) = condition;
4546 STATIC_ASSERT_MESSAGE (assertion) = message;
4547 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4550 maybe_add_class_template_decl_list (current_class_type,
4554 add_stmt (assertion);
4559 /* Fold the expression and convert it to a boolean value. */
4560 condition = fold_non_dependent_expr (condition);
4561 condition = cp_convert (boolean_type_node, condition);
4563 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4564 /* Do nothing; the condition is satisfied. */
4568 location_t saved_loc = input_location;
4570 input_location = location;
4571 if (TREE_CODE (condition) == INTEGER_CST
4572 && integer_zerop (condition))
4573 /* Report the error. */
4574 error ("static assertion failed: %E", message);
4575 else if (condition && condition != error_mark_node)
4576 error ("non-constant condition for static assertion");
4577 input_location = saved_loc;
4581 /* Returns the type of EXPR for cases where we can determine it even though
4582 EXPR is a type-dependent expression. */
4585 describable_type (tree expr)
4587 tree type = NULL_TREE;
4589 if (! type_dependent_expression_p (expr)
4590 && ! type_unknown_p (expr))
4592 type = unlowered_expr_type (expr);
4593 if (real_lvalue_p (expr))
4594 type = build_reference_type (type);
4600 switch (TREE_CODE (expr))
4606 return TREE_TYPE (expr);
4611 case TEMPLATE_PARM_INDEX:
4613 case STATIC_CAST_EXPR:
4614 case REINTERPRET_CAST_EXPR:
4615 case CONST_CAST_EXPR:
4616 case DYNAMIC_CAST_EXPR:
4617 type = TREE_TYPE (expr);
4622 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4623 if (ptrtype && POINTER_TYPE_P (ptrtype))
4624 type = build_reference_type (TREE_TYPE (ptrtype));
4629 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4630 type = TREE_TYPE (expr);
4634 if (type && type_uses_auto (type))
4640 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4641 suitable for use as a type-specifier.
4643 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4644 id-expression or a class member access, FALSE when it was parsed as
4645 a full expression. */
4648 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4650 tree orig_expr = expr;
4651 tree type = NULL_TREE;
4653 if (!expr || error_operand_p (expr))
4654 return error_mark_node;
4657 || TREE_CODE (expr) == TYPE_DECL
4658 || (TREE_CODE (expr) == BIT_NOT_EXPR
4659 && TYPE_P (TREE_OPERAND (expr, 0))))
4661 error ("argument to decltype must be an expression");
4662 return error_mark_node;
4665 if (type_dependent_expression_p (expr)
4666 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4667 if it isn't dependent, so that we can check access control at
4668 instantiation time, so defer the decltype as well (PR 42277). */
4669 || (id_expression_or_member_access_p
4670 && processing_template_decl
4671 && TREE_CODE (expr) == COMPONENT_REF))
4673 if (id_expression_or_member_access_p)
4675 switch (TREE_CODE (expr))
4682 case TEMPLATE_PARM_INDEX:
4683 type = TREE_TYPE (expr);
4691 if (type && !type_uses_auto (type))
4695 type = cxx_make_type (DECLTYPE_TYPE);
4696 DECLTYPE_TYPE_EXPR (type) = expr;
4697 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4698 = id_expression_or_member_access_p;
4699 SET_TYPE_STRUCTURAL_EQUALITY (type);
4704 /* The type denoted by decltype(e) is defined as follows: */
4706 expr = resolve_nondeduced_context (expr);
4708 /* To get the size of a static data member declared as an array of
4709 unknown bound, we need to instantiate it. */
4710 if (TREE_CODE (expr) == VAR_DECL
4711 && VAR_HAD_UNKNOWN_BOUND (expr)
4712 && DECL_TEMPLATE_INSTANTIATION (expr))
4713 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
4715 if (id_expression_or_member_access_p)
4717 /* If e is an id-expression or a class member access (5.2.5
4718 [expr.ref]), decltype(e) is defined as the type of the entity
4719 named by e. If there is no such entity, or e names a set of
4720 overloaded functions, the program is ill-formed. */
4721 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4722 expr = lookup_name (expr);
4724 if (TREE_CODE (expr) == INDIRECT_REF)
4725 /* This can happen when the expression is, e.g., "a.b". Just
4726 look at the underlying operand. */
4727 expr = TREE_OPERAND (expr, 0);
4729 if (TREE_CODE (expr) == OFFSET_REF
4730 || TREE_CODE (expr) == MEMBER_REF)
4731 /* We're only interested in the field itself. If it is a
4732 BASELINK, we will need to see through it in the next
4734 expr = TREE_OPERAND (expr, 1);
4736 if (TREE_CODE (expr) == BASELINK)
4737 /* See through BASELINK nodes to the underlying functions. */
4738 expr = BASELINK_FUNCTIONS (expr);
4740 if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
4741 expr = TREE_OPERAND (expr, 0);
4743 if (TREE_CODE (expr) == OVERLOAD)
4745 if (OVL_CHAIN (expr)
4746 || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL)
4748 error ("%qE refers to a set of overloaded functions", orig_expr);
4749 return error_mark_node;
4752 /* An overload set containing only one function: just look
4753 at that function. */
4754 expr = OVL_FUNCTION (expr);
4757 switch (TREE_CODE (expr))
4760 if (DECL_BIT_FIELD_TYPE (expr))
4762 type = DECL_BIT_FIELD_TYPE (expr);
4765 /* Fall through for fields that aren't bitfields. */
4772 case TEMPLATE_PARM_INDEX:
4773 expr = mark_type_use (expr);
4774 type = TREE_TYPE (expr);
4778 type = error_mark_node;
4782 mark_type_use (expr);
4783 type = is_bitfield_expr_with_lowered_type (expr);
4785 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4792 /* We can get here when the id-expression refers to an
4794 type = TREE_TYPE (expr);
4798 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4799 || TREE_CODE (expr) == SCOPE_REF);
4800 error ("argument to decltype must be an expression");
4801 return error_mark_node;
4806 /* Expressions of reference type are sometimes wrapped in
4807 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4808 representation, not part of the language, so we have to look
4810 if (TREE_CODE (expr) == INDIRECT_REF
4811 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4813 expr = TREE_OPERAND (expr, 0);
4815 if (TREE_CODE (expr) == CALL_EXPR)
4817 /* If e is a function call (5.2.2 [expr.call]) or an
4818 invocation of an overloaded operator (parentheses around e
4819 are ignored), decltype(e) is defined as the return type of
4821 tree fndecl = get_callee_fndecl (expr);
4822 if (fndecl && fndecl != error_mark_node)
4823 type = TREE_TYPE (TREE_TYPE (fndecl));
4826 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4827 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4828 || TREE_CODE (target_type) == POINTER_TYPE)
4829 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4830 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4831 type = TREE_TYPE (TREE_TYPE (target_type));
4832 else if (processing_template_decl)
4833 /* Within a template finish_call_expr doesn't resolve
4834 CALL_EXPR_FN, so even though this decltype isn't really
4835 dependent let's defer resolving it. */
4836 goto treat_as_dependent;
4838 sorry ("unable to determine the declared type of expression %<%E%>",
4844 type = is_bitfield_expr_with_lowered_type (expr);
4847 /* Bitfields are special, because their type encodes the
4848 number of bits they store. If the expression referenced a
4849 bitfield, TYPE now has the declared type of that
4851 type = cp_build_qualified_type (type,
4852 cp_type_quals (TREE_TYPE (expr)));
4854 if (real_lvalue_p (expr))
4855 type = build_reference_type (type);
4857 /* Within a lambda-expression:
4859 Every occurrence of decltype((x)) where x is a possibly
4860 parenthesized id-expression that names an entity of
4861 automatic storage duration is treated as if x were
4862 transformed into an access to a corresponding data member
4863 of the closure type that would have been declared if x
4864 were a use of the denoted entity. */
4865 else if (outer_automatic_var_p (expr)
4866 && current_function_decl
4867 && LAMBDA_FUNCTION_P (current_function_decl))
4868 type = capture_decltype (expr);
4871 /* Otherwise, where T is the type of e, if e is an lvalue,
4872 decltype(e) is defined as T&, otherwise decltype(e) is
4874 type = TREE_TYPE (expr);
4875 if (type == error_mark_node)
4876 return error_mark_node;
4877 else if (expr == current_class_ptr)
4878 /* If the expression is just "this", we want the
4879 cv-unqualified pointer for the "this" type. */
4880 type = TYPE_MAIN_VARIANT (type);
4881 else if (real_lvalue_p (expr))
4883 if (TREE_CODE (type) != REFERENCE_TYPE
4884 || TYPE_REF_IS_RVALUE (type))
4885 type = build_reference_type (non_reference (type));
4888 type = non_reference (type);
4893 if (!type || type == unknown_type_node)
4895 error ("type of %qE is unknown", expr);
4896 return error_mark_node;
4902 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4903 __has_nothrow_copy, depending on assign_p. */
4906 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4913 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4916 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4918 else if (TYPE_HAS_COPY_CTOR (type))
4920 /* If construction of the copy constructor was postponed, create
4922 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4923 lazily_declare_fn (sfk_copy_constructor, type);
4924 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
4925 lazily_declare_fn (sfk_move_constructor, type);
4926 fns = CLASSTYPE_CONSTRUCTORS (type);
4931 for (; fns; fns = OVL_NEXT (fns))
4933 tree fn = OVL_CURRENT (fns);
4937 if (copy_fn_p (fn) == 0)
4940 else if (copy_fn_p (fn) <= 0)
4943 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4950 /* Actually evaluates the trait. */
4953 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4955 enum tree_code type_code1;
4958 type_code1 = TREE_CODE (type1);
4962 case CPTK_HAS_NOTHROW_ASSIGN:
4963 type1 = strip_array_types (type1);
4964 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4965 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4966 || (CLASS_TYPE_P (type1)
4967 && classtype_has_nothrow_assign_or_copy_p (type1,
4970 case CPTK_HAS_TRIVIAL_ASSIGN:
4971 /* ??? The standard seems to be missing the "or array of such a class
4972 type" wording for this trait. */
4973 type1 = strip_array_types (type1);
4974 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4975 && (trivial_type_p (type1)
4976 || (CLASS_TYPE_P (type1)
4977 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
4979 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4980 type1 = strip_array_types (type1);
4981 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4982 || (CLASS_TYPE_P (type1)
4983 && (t = locate_ctor (type1))
4984 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4986 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4987 type1 = strip_array_types (type1);
4988 return (trivial_type_p (type1)
4989 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4991 case CPTK_HAS_NOTHROW_COPY:
4992 type1 = strip_array_types (type1);
4993 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4994 || (CLASS_TYPE_P (type1)
4995 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4997 case CPTK_HAS_TRIVIAL_COPY:
4998 /* ??? The standard seems to be missing the "or array of such a class
4999 type" wording for this trait. */
5000 type1 = strip_array_types (type1);
5001 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5002 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
5004 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5005 type1 = strip_array_types (type1);
5006 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5007 || (CLASS_TYPE_P (type1)
5008 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5010 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5011 return type_has_virtual_destructor (type1);
5013 case CPTK_IS_ABSTRACT:
5014 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5016 case CPTK_IS_BASE_OF:
5017 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5018 && DERIVED_FROM_P (type1, type2));
5021 return (NON_UNION_CLASS_TYPE_P (type1));
5023 case CPTK_IS_CONVERTIBLE_TO:
5028 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5031 return (type_code1 == ENUMERAL_TYPE);
5034 return (pod_type_p (type1));
5036 case CPTK_IS_POLYMORPHIC:
5037 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5039 case CPTK_IS_STD_LAYOUT:
5040 return (std_layout_type_p (type1));
5042 case CPTK_IS_TRIVIAL:
5043 return (trivial_type_p (type1));
5046 return (type_code1 == UNION_TYPE);
5054 /* Returns true if TYPE is a complete type, an array of unknown bound,
5055 or (possibly cv-qualified) void, returns false otherwise. */
5058 check_trait_type (tree type)
5060 if (COMPLETE_TYPE_P (type))
5063 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
5064 && COMPLETE_TYPE_P (TREE_TYPE (type)))
5067 if (VOID_TYPE_P (type))
5073 /* Process a trait expression. */
5076 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5078 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5079 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5080 || kind == CPTK_HAS_NOTHROW_COPY
5081 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5082 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5083 || kind == CPTK_HAS_TRIVIAL_COPY
5084 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5085 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5086 || kind == CPTK_IS_ABSTRACT
5087 || kind == CPTK_IS_BASE_OF
5088 || kind == CPTK_IS_CLASS
5089 || kind == CPTK_IS_CONVERTIBLE_TO
5090 || kind == CPTK_IS_EMPTY
5091 || kind == CPTK_IS_ENUM
5092 || kind == CPTK_IS_POD
5093 || kind == CPTK_IS_POLYMORPHIC
5094 || kind == CPTK_IS_STD_LAYOUT
5095 || kind == CPTK_IS_TRIVIAL
5096 || kind == CPTK_IS_UNION);
5098 if (kind == CPTK_IS_CONVERTIBLE_TO)
5100 sorry ("__is_convertible_to");
5101 return error_mark_node;
5104 if (type1 == error_mark_node
5105 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5106 && type2 == error_mark_node))
5107 return error_mark_node;
5109 if (processing_template_decl)
5111 tree trait_expr = make_node (TRAIT_EXPR);
5112 TREE_TYPE (trait_expr) = boolean_type_node;
5113 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5114 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5115 TRAIT_EXPR_KIND (trait_expr) = kind;
5119 complete_type (type1);
5121 complete_type (type2);
5125 case CPTK_HAS_NOTHROW_ASSIGN:
5126 case CPTK_HAS_TRIVIAL_ASSIGN:
5127 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5128 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5129 case CPTK_HAS_NOTHROW_COPY:
5130 case CPTK_HAS_TRIVIAL_COPY:
5131 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5132 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5133 case CPTK_IS_ABSTRACT:
5136 case CPTK_IS_POLYMORPHIC:
5137 case CPTK_IS_STD_LAYOUT:
5138 case CPTK_IS_TRIVIAL:
5139 if (!check_trait_type (type1))
5141 error ("incomplete type %qT not allowed", type1);
5142 return error_mark_node;
5146 case CPTK_IS_BASE_OF:
5147 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5148 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5149 && !COMPLETE_TYPE_P (type2))
5151 error ("incomplete type %qT not allowed", type2);
5152 return error_mark_node;
5161 case CPTK_IS_CONVERTIBLE_TO:
5166 return (trait_expr_value (kind, type1, type2)
5167 ? boolean_true_node : boolean_false_node);
5170 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5171 which is ignored for C++. */
5174 set_float_const_decimal64 (void)
5179 clear_float_const_decimal64 (void)
5184 float_const_decimal64_p (void)
5189 /* Return true if T is a literal type. */
5192 literal_type_p (tree t)
5194 if (SCALAR_TYPE_P (t))
5196 if (CLASS_TYPE_P (t))
5197 return CLASSTYPE_LITERAL_P (t);
5198 if (TREE_CODE (t) == ARRAY_TYPE)
5199 return literal_type_p (strip_array_types (t));
5204 /* If DECL is a variable declared `constexpr', require its type
5205 be literal. Return the DECL if OK, otherwise NULL. */
5208 ensure_literal_type_for_constexpr_object (tree decl)
5210 tree type = TREE_TYPE (decl);
5211 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5212 && !processing_template_decl && !literal_type_p (type))
5214 error ("the type %qT of constexpr variable %qD is not literal",
5221 /* Return non-null if FUN certainly designates a valid constexpr function
5222 declaration. Otherwise return NULL. Issue appropriate diagnostics
5223 if necessary. Note that we only check the declaration, not the body
5227 validate_constexpr_fundecl (tree fun)
5229 tree rettype = NULL;
5232 /* Don't bother if FUN is not marked constexpr. */
5233 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5236 /* For a function template, we have absolutely no guarantee that all
5237 instantiations will be constexpr. */
5238 if (TREE_CODE (fun) == TEMPLATE_DECL)
5241 parm = FUNCTION_FIRST_USER_PARM (fun);
5242 for (; parm != NULL; parm = TREE_CHAIN (parm))
5244 tree type = TREE_TYPE (parm);
5245 if (dependent_type_p (type))
5247 if (!literal_type_p (type))
5249 error ("parameter %q#D is not of literal type", parm);
5254 if (DECL_CONSTRUCTOR_P (fun))
5257 rettype = TREE_TYPE (TREE_TYPE (fun));
5258 if (dependent_type_p (rettype))
5260 if (!literal_type_p (rettype))
5262 error ("return type %qT of function %qD is not a literal type",
5263 TREE_TYPE (TREE_TYPE (fun)), fun);
5270 /* Constructor for a lambda expression. */
5273 build_lambda_expr (void)
5275 tree lambda = make_node (LAMBDA_EXPR);
5276 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
5277 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
5278 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
5279 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
5280 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
5284 /* Create the closure object for a LAMBDA_EXPR. */
5287 build_lambda_object (tree lambda_expr)
5289 /* Build aggregate constructor call.
5290 - cp_parser_braced_list
5291 - cp_parser_functional_cast */
5292 VEC(constructor_elt,gc) *elts = NULL;
5293 tree node, expr, type;
5294 location_t saved_loc;
5296 if (processing_template_decl)
5299 /* Make sure any error messages refer to the lambda-introducer. */
5300 saved_loc = input_location;
5301 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
5303 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
5305 node = TREE_CHAIN (node))
5307 tree field = TREE_PURPOSE (node);
5308 tree val = TREE_VALUE (node);
5313 /* Mere mortals can't copy arrays with aggregate initialization, so
5314 do some magic to make it work here. */
5315 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
5316 val = build_array_copy (val);
5317 else if (DECL_NORMAL_CAPTURE_P (field)
5318 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
5320 /* "the entities that are captured by copy are used to
5321 direct-initialize each corresponding non-static data
5322 member of the resulting closure object."
5324 There's normally no way to express direct-initialization
5325 from an element of a CONSTRUCTOR, so we build up a special
5326 TARGET_EXPR to bypass the usual copy-initialization. */
5327 val = force_rvalue (val);
5328 if (TREE_CODE (val) == TARGET_EXPR)
5329 TARGET_EXPR_DIRECT_INIT_P (val) = true;
5332 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
5335 expr = build_constructor (init_list_type_node, elts);
5336 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
5338 /* N2927: "[The closure] class type is not an aggregate."
5339 But we briefly treat it as an aggregate to make this simpler. */
5340 type = TREE_TYPE (lambda_expr);
5341 CLASSTYPE_NON_AGGREGATE (type) = 0;
5342 expr = finish_compound_literal (type, expr);
5343 CLASSTYPE_NON_AGGREGATE (type) = 1;
5345 input_location = saved_loc;
5349 /* Return an initialized RECORD_TYPE for LAMBDA.
5350 LAMBDA must have its explicit captures already. */
5353 begin_lambda_type (tree lambda)
5358 /* Unique name. This is just like an unnamed class, but we cannot use
5359 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5361 name = make_lambda_name ();
5363 /* Create the new RECORD_TYPE for this lambda. */
5364 type = xref_tag (/*tag_code=*/record_type,
5366 /*scope=*/ts_within_enclosing_non_class,
5367 /*template_header_p=*/false);
5370 /* Designate it as a struct so that we can use aggregate initialization. */
5371 CLASSTYPE_DECLARED_CLASS (type) = false;
5373 /* Clear base types. */
5374 xref_basetypes (type, /*bases=*/NULL_TREE);
5376 /* Start the class. */
5377 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
5379 /* Cross-reference the expression and the type. */
5380 TREE_TYPE (lambda) = type;
5381 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
5386 /* Returns the type to use for the return type of the operator() of a
5390 lambda_return_type (tree expr)
5393 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
5395 warning (0, "cannot deduce lambda return type from a braced-init-list");
5396 return void_type_node;
5398 if (type_dependent_expression_p (expr))
5400 type = cxx_make_type (DECLTYPE_TYPE);
5401 DECLTYPE_TYPE_EXPR (type) = expr;
5402 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
5403 SET_TYPE_STRUCTURAL_EQUALITY (type);
5406 type = type_decays_to (unlowered_expr_type (expr));
5410 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5414 lambda_function (tree lambda)
5417 if (TREE_CODE (lambda) == LAMBDA_EXPR)
5418 type = TREE_TYPE (lambda);
5421 gcc_assert (LAMBDA_TYPE_P (type));
5422 /* Don't let debug_tree cause instantiation. */
5423 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
5425 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
5426 /*protect=*/0, /*want_type=*/false);
5428 lambda = BASELINK_FUNCTIONS (lambda);
5432 /* Returns the type to use for the FIELD_DECL corresponding to the
5434 The caller should add REFERENCE_TYPE for capture by reference. */
5437 lambda_capture_field_type (tree expr)
5440 if (type_dependent_expression_p (expr))
5442 type = cxx_make_type (DECLTYPE_TYPE);
5443 DECLTYPE_TYPE_EXPR (type) = expr;
5444 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
5445 SET_TYPE_STRUCTURAL_EQUALITY (type);
5448 type = non_reference (unlowered_expr_type (expr));
5452 /* Recompute the return type for LAMBDA with body of the form:
5453 { return EXPR ; } */
5456 apply_lambda_return_type (tree lambda, tree return_type)
5458 tree fco = lambda_function (lambda);
5461 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
5463 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5464 it would interfere with instantiating the closure type. */
5465 if (dependent_type_p (return_type))
5467 if (return_type == error_mark_node)
5470 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5471 TREE_TYPE (METHOD_TYPE) == return-type */
5472 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
5474 result = DECL_RESULT (fco);
5475 if (result == NULL_TREE)
5478 /* We already have a DECL_RESULT from start_preparsed_function.
5479 Now we need to redo the work it and allocate_struct_function
5480 did to reflect the new type. */
5481 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
5482 TYPE_MAIN_VARIANT (return_type));
5483 DECL_ARTIFICIAL (result) = 1;
5484 DECL_IGNORED_P (result) = 1;
5485 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
5488 DECL_RESULT (fco) = result;
5490 if (!processing_template_decl && aggregate_value_p (result, fco))
5492 #ifdef PCC_STATIC_STRUCT_RETURN
5493 cfun->returns_pcc_struct = 1;
5495 cfun->returns_struct = 1;
5500 /* DECL is a local variable or parameter from the surrounding scope of a
5501 lambda-expression. Returns the decltype for a use of the capture field
5502 for DECL even if it hasn't been captured yet. */
5505 capture_decltype (tree decl)
5507 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
5508 /* FIXME do lookup instead of list walk? */
5509 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
5513 type = TREE_TYPE (TREE_PURPOSE (cap));
5515 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
5518 error ("%qD is not captured", decl);
5519 return error_mark_node;
5522 type = TREE_TYPE (decl);
5523 if (TREE_CODE (type) == REFERENCE_TYPE
5524 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
5525 type = TREE_TYPE (type);
5528 case CPLD_REFERENCE:
5529 type = TREE_TYPE (decl);
5530 if (TREE_CODE (type) != REFERENCE_TYPE)
5531 type = build_reference_type (TREE_TYPE (decl));
5538 if (TREE_CODE (type) != REFERENCE_TYPE)
5540 if (!LAMBDA_EXPR_MUTABLE_P (lam))
5541 type = cp_build_qualified_type (type, (cp_type_quals (type)
5543 type = build_reference_type (type);
5548 /* From an ID and INITIALIZER, create a capture (by reference if
5549 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5553 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
5554 bool explicit_init_p)
5559 type = lambda_capture_field_type (initializer);
5562 type = build_reference_type (type);
5563 if (!real_lvalue_p (initializer))
5564 error ("cannot capture %qE by reference", initializer);
5567 /* Make member variable. */
5568 member = build_lang_decl (FIELD_DECL, id, type);
5569 if (!explicit_init_p)
5570 /* Normal captures are invisible to name lookup but uses are replaced
5571 with references to the capture field; we implement this by only
5572 really making them invisible in unevaluated context; see
5573 qualify_lookup. For now, let's make explicitly initialized captures
5575 DECL_NORMAL_CAPTURE_P (member) = true;
5577 /* Add it to the appropriate closure class if we've started it. */
5578 if (current_class_type && current_class_type == TREE_TYPE (lambda))
5579 finish_member_declaration (member);
5581 LAMBDA_EXPR_CAPTURE_LIST (lambda)
5582 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
5584 if (id == get_identifier ("__this"))
5586 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
5587 error ("already captured %<this%> in lambda expression");
5588 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
5594 /* Register all the capture members on the list CAPTURES, which is the
5595 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
5597 void register_capture_members (tree captures)
5601 register_capture_members (TREE_CHAIN (captures));
5602 finish_member_declaration (TREE_PURPOSE (captures));
5606 /* Given a FIELD_DECL decl belonging to a closure type, return a
5607 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5611 thisify_lambda_field (tree decl)
5613 tree context = lambda_function (DECL_CONTEXT (decl));
5614 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
5616 tf_warning_or_error);
5617 return finish_non_static_data_member (decl, object,
5618 /*qualifying_scope*/NULL_TREE);
5621 /* Similar to add_capture, except this works on a stack of nested lambdas.
5622 BY_REFERENCE_P in this case is derived from the default capture mode.
5623 Returns the capture for the lambda at the bottom of the stack. */
5626 add_default_capture (tree lambda_stack, tree id, tree initializer)
5628 bool this_capture_p = (id == get_identifier ("__this"));
5630 tree member = NULL_TREE;
5632 tree saved_class_type = current_class_type;
5636 for (node = lambda_stack;
5638 node = TREE_CHAIN (node))
5640 tree lambda = TREE_VALUE (node);
5642 current_class_type = TREE_TYPE (lambda);
5643 member = add_capture (lambda,
5648 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
5649 == CPLD_REFERENCE)),
5650 /*explicit_init_p=*/false);
5651 initializer = thisify_lambda_field (member);
5654 current_class_type = saved_class_type;
5659 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5660 INDIRECT_REF, possibly adding it through default capturing. */
5663 lambda_expr_this_capture (tree lambda)
5667 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5669 /* Try to default capture 'this' if we can. */
5671 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
5673 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
5674 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
5675 tree init = NULL_TREE;
5677 /* If we are in a lambda function, we can move out until we hit:
5678 1. a non-lambda function,
5679 2. a lambda function capturing 'this', or
5680 3. a non-default capturing lambda function. */
5681 while (LAMBDA_FUNCTION_P (containing_function))
5684 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
5686 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
5688 /* An outer lambda has already captured 'this'. */
5689 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5690 init = thisify_lambda_field (cap);
5694 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
5695 /* An outer lambda won't let us capture 'this'. */
5698 lambda_stack = tree_cons (NULL_TREE,
5702 containing_function = decl_function_context (containing_function);
5705 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
5706 && !LAMBDA_FUNCTION_P (containing_function))
5707 /* First parameter is 'this'. */
5708 init = DECL_ARGUMENTS (containing_function);
5711 this_capture = add_default_capture (lambda_stack,
5712 /*id=*/get_identifier ("__this"),
5718 error ("%<this%> was not captured for this lambda function");
5719 result = error_mark_node;
5723 /* To make sure that current_class_ref is for the lambda. */
5724 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
5726 result = finish_non_static_data_member (this_capture,
5728 /*qualifying_scope=*/NULL_TREE);
5730 /* If 'this' is captured, each use of 'this' is transformed into an
5731 access to the corresponding unnamed data member of the closure
5732 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5733 ensures that the transformed expression is an rvalue. ] */
5734 result = rvalue (result);
5740 /* Returns the method basetype of the innermost non-lambda function, or
5741 NULL_TREE if none. */
5744 nonlambda_method_basetype (void)
5747 if (!current_class_ref)
5750 type = current_class_type;
5751 if (!LAMBDA_TYPE_P (type))
5754 /* Find the nearest enclosing non-lambda function. */
5755 fn = TYPE_NAME (type);
5757 fn = decl_function_context (fn);
5758 while (fn && LAMBDA_FUNCTION_P (fn));
5760 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5763 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
5766 /* If the closure TYPE has a static op(), also add a conversion to function
5770 maybe_add_lambda_conv_op (tree type)
5772 bool nested = (current_function_decl != NULL_TREE);
5773 tree callop = lambda_function (type);
5774 tree rettype, name, fntype, fn, body, compound_stmt;
5775 tree thistype, stattype, statfn, convfn, call, arg;
5776 VEC (tree, gc) *argvec;
5778 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
5781 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
5782 FUNCTION_ARG_CHAIN (callop));
5784 /* First build up the conversion op. */
5786 rettype = build_pointer_type (stattype);
5787 name = mangle_conv_op_name_for_type (rettype);
5788 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
5789 fntype = build_method_type_directly (thistype, rettype, void_list_node);
5790 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
5791 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5793 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5794 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5795 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5797 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
5798 grokclassfn (type, fn, NO_SPECIAL);
5799 set_linkage_according_to_type (type, fn);
5800 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5801 DECL_IN_AGGR_P (fn) = 1;
5802 DECL_ARTIFICIAL (fn) = 1;
5803 DECL_NOT_REALLY_EXTERN (fn) = 1;
5804 DECL_DECLARED_INLINE_P (fn) = 1;
5805 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
5807 DECL_INTERFACE_KNOWN (fn) = 1;
5809 add_method (type, fn, NULL_TREE);
5811 /* Generic thunk code fails for varargs; we'll complain in mark_used if
5812 the conversion op is used. */
5813 if (varargs_function_p (callop))
5815 DECL_DELETED_FN (fn) = 1;
5819 /* Now build up the thunk to be returned. */
5821 name = get_identifier ("_FUN");
5822 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
5823 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5824 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5825 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5826 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5827 grokclassfn (type, fn, NO_SPECIAL);
5828 set_linkage_according_to_type (type, fn);
5829 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5830 DECL_IN_AGGR_P (fn) = 1;
5831 DECL_ARTIFICIAL (fn) = 1;
5832 DECL_NOT_REALLY_EXTERN (fn) = 1;
5833 DECL_DECLARED_INLINE_P (fn) = 1;
5834 DECL_STATIC_FUNCTION_P (fn) = 1;
5835 DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop)));
5836 for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg))
5837 DECL_CONTEXT (arg) = fn;
5839 DECL_INTERFACE_KNOWN (fn) = 1;
5841 add_method (type, fn, NULL_TREE);
5844 push_function_context ();
5846 /* Generate the body of the thunk. */
5848 start_preparsed_function (statfn, NULL_TREE,
5849 SF_PRE_PARSED | SF_INCLASS_INLINE);
5850 if (DECL_ONE_ONLY (statfn))
5852 /* Put the thunk in the same comdat group as the call op. */
5853 struct cgraph_node *callop_node, *thunk_node;
5854 DECL_COMDAT_GROUP (statfn) = DECL_COMDAT_GROUP (callop);
5855 callop_node = cgraph_node (callop);
5856 thunk_node = cgraph_node (statfn);
5857 gcc_assert (callop_node->same_comdat_group == NULL);
5858 gcc_assert (thunk_node->same_comdat_group == NULL);
5859 callop_node->same_comdat_group = thunk_node;
5860 thunk_node->same_comdat_group = callop_node;
5862 body = begin_function_body ();
5863 compound_stmt = begin_compound_stmt (0);
5865 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
5867 argvec = make_tree_vector ();
5868 VEC_quick_push (tree, argvec, arg);
5869 for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg))
5870 VEC_safe_push (tree, gc, argvec, arg);
5871 call = build_call_a (callop, VEC_length (tree, argvec),
5872 VEC_address (tree, argvec));
5873 CALL_FROM_THUNK_P (call) = 1;
5874 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
5875 call = build_cplus_new (TREE_TYPE (call), call);
5876 call = convert_from_reference (call);
5877 finish_return_stmt (call);
5879 finish_compound_stmt (compound_stmt);
5880 finish_function_body (body);
5882 expand_or_defer_fn (finish_function (2));
5884 /* Generate the body of the conversion op. */
5886 start_preparsed_function (convfn, NULL_TREE,
5887 SF_PRE_PARSED | SF_INCLASS_INLINE);
5888 body = begin_function_body ();
5889 compound_stmt = begin_compound_stmt (0);
5891 finish_return_stmt (decay_conversion (statfn));
5893 finish_compound_stmt (compound_stmt);
5894 finish_function_body (body);
5896 expand_or_defer_fn (finish_function (2));
5899 pop_function_context ();
5901 #include "gt-cp-semantics.h"