1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008, 2009 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
34 #include "tree-inline.h"
35 #include "tree-mudflap.h"
44 #include "diagnostic.h"
46 #include "tree-iterator.h"
51 /* There routines provide a modular interface to perform many parsing
52 operations. They may therefore be used during actual parsing, or
53 during template instantiation, which may be regarded as a
54 degenerate form of parsing. */
56 static tree maybe_convert_cond (tree);
57 static tree finalize_nrv_r (tree *, int *, void *);
58 static tree capture_decltype (tree);
61 /* Deferred Access Checking Overview
62 ---------------------------------
64 Most C++ expressions and declarations require access checking
65 to be performed during parsing. However, in several cases,
66 this has to be treated differently.
68 For member declarations, access checking has to be deferred
69 until more information about the declaration is known. For
81 When we are parsing the function return type `A::X', we don't
82 really know if this is allowed until we parse the function name.
84 Furthermore, some contexts require that access checking is
85 never performed at all. These include class heads, and template
88 Typical use of access checking functions is described here:
90 1. When we enter a context that requires certain access checking
91 mode, the function `push_deferring_access_checks' is called with
92 DEFERRING argument specifying the desired mode. Access checking
93 may be performed immediately (dk_no_deferred), deferred
94 (dk_deferred), or not performed (dk_no_check).
96 2. When a declaration such as a type, or a variable, is encountered,
97 the function `perform_or_defer_access_check' is called. It
98 maintains a VEC of all deferred checks.
100 3. The global `current_class_type' or `current_function_decl' is then
101 setup by the parser. `enforce_access' relies on these information
104 4. Upon exiting the context mentioned in step 1,
105 `perform_deferred_access_checks' is called to check all declaration
106 stored in the VEC. `pop_deferring_access_checks' is then
107 called to restore the previous access checking mode.
109 In case of parsing error, we simply call `pop_deferring_access_checks'
110 without `perform_deferred_access_checks'. */
112 typedef struct GTY(()) deferred_access {
113 /* A VEC representing name-lookups for which we have deferred
114 checking access controls. We cannot check the accessibility of
115 names used in a decl-specifier-seq until we know what is being
116 declared because code like:
123 A::B* A::f() { return 0; }
125 is valid, even though `A::B' is not generally accessible. */
126 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
128 /* The current mode of access checks. */
129 enum deferring_kind deferring_access_checks_kind;
132 DEF_VEC_O (deferred_access);
133 DEF_VEC_ALLOC_O (deferred_access,gc);
135 /* Data for deferred access checking. */
136 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
137 static GTY(()) unsigned deferred_access_no_check;
139 /* Save the current deferred access states and start deferred
140 access checking iff DEFER_P is true. */
143 push_deferring_access_checks (deferring_kind deferring)
145 /* For context like template instantiation, access checking
146 disabling applies to all nested context. */
147 if (deferred_access_no_check || deferring == dk_no_check)
148 deferred_access_no_check++;
151 deferred_access *ptr;
153 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
154 ptr->deferred_access_checks = NULL;
155 ptr->deferring_access_checks_kind = deferring;
159 /* Resume deferring access checks again after we stopped doing
163 resume_deferring_access_checks (void)
165 if (!deferred_access_no_check)
166 VEC_last (deferred_access, deferred_access_stack)
167 ->deferring_access_checks_kind = dk_deferred;
170 /* Stop deferring access checks. */
173 stop_deferring_access_checks (void)
175 if (!deferred_access_no_check)
176 VEC_last (deferred_access, deferred_access_stack)
177 ->deferring_access_checks_kind = dk_no_deferred;
180 /* Discard the current deferred access checks and restore the
184 pop_deferring_access_checks (void)
186 if (deferred_access_no_check)
187 deferred_access_no_check--;
189 VEC_pop (deferred_access, deferred_access_stack);
192 /* Returns a TREE_LIST representing the deferred checks.
193 The TREE_PURPOSE of each node is the type through which the
194 access occurred; the TREE_VALUE is the declaration named.
197 VEC (deferred_access_check,gc)*
198 get_deferred_access_checks (void)
200 if (deferred_access_no_check)
203 return (VEC_last (deferred_access, deferred_access_stack)
204 ->deferred_access_checks);
207 /* Take current deferred checks and combine with the
208 previous states if we also defer checks previously.
209 Otherwise perform checks now. */
212 pop_to_parent_deferring_access_checks (void)
214 if (deferred_access_no_check)
215 deferred_access_no_check--;
218 VEC (deferred_access_check,gc) *checks;
219 deferred_access *ptr;
221 checks = (VEC_last (deferred_access, deferred_access_stack)
222 ->deferred_access_checks);
224 VEC_pop (deferred_access, deferred_access_stack);
225 ptr = VEC_last (deferred_access, deferred_access_stack);
226 if (ptr->deferring_access_checks_kind == dk_no_deferred)
229 perform_access_checks (checks);
233 /* Merge with parent. */
235 deferred_access_check *chk, *probe;
238 VEC_iterate (deferred_access_check, checks, i, chk) ;
242 VEC_iterate (deferred_access_check,
243 ptr->deferred_access_checks, j, probe) ;
246 if (probe->binfo == chk->binfo &&
247 probe->decl == chk->decl &&
248 probe->diag_decl == chk->diag_decl)
251 /* Insert into parent's checks. */
252 VEC_safe_push (deferred_access_check, gc,
253 ptr->deferred_access_checks, chk);
260 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
261 is the BINFO indicating the qualifying scope used to access the
262 DECL node stored in the TREE_VALUE of the node. */
265 perform_access_checks (VEC (deferred_access_check,gc)* checks)
268 deferred_access_check *chk;
273 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
274 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
277 /* Perform the deferred access checks.
279 After performing the checks, we still have to keep the list
280 `deferred_access_stack->deferred_access_checks' since we may want
281 to check access for them again later in a different context.
288 A::X A::a, x; // No error for `A::a', error for `x'
290 We have to perform deferred access of `A::X', first with `A::a',
294 perform_deferred_access_checks (void)
296 perform_access_checks (get_deferred_access_checks ());
299 /* Defer checking the accessibility of DECL, when looked up in
300 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
303 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
306 deferred_access *ptr;
307 deferred_access_check *chk;
308 deferred_access_check *new_access;
311 /* Exit if we are in a context that no access checking is performed.
313 if (deferred_access_no_check)
316 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
318 ptr = VEC_last (deferred_access, deferred_access_stack);
320 /* If we are not supposed to defer access checks, just check now. */
321 if (ptr->deferring_access_checks_kind == dk_no_deferred)
323 enforce_access (binfo, decl, diag_decl);
327 /* See if we are already going to perform this check. */
329 VEC_iterate (deferred_access_check,
330 ptr->deferred_access_checks, i, chk) ;
333 if (chk->decl == decl && chk->binfo == binfo &&
334 chk->diag_decl == diag_decl)
339 /* If not, record the check. */
341 VEC_safe_push (deferred_access_check, gc,
342 ptr->deferred_access_checks, 0);
343 new_access->binfo = binfo;
344 new_access->decl = decl;
345 new_access->diag_decl = diag_decl;
348 /* Returns nonzero if the current statement is a full expression,
349 i.e. temporaries created during that statement should be destroyed
350 at the end of the statement. */
353 stmts_are_full_exprs_p (void)
355 return current_stmt_tree ()->stmts_are_full_exprs_p;
358 /* T is a statement. Add it to the statement-tree. This is the C++
359 version. The C/ObjC frontends have a slightly different version of
365 enum tree_code code = TREE_CODE (t);
367 if (EXPR_P (t) && code != LABEL_EXPR)
369 if (!EXPR_HAS_LOCATION (t))
370 SET_EXPR_LOCATION (t, input_location);
372 /* When we expand a statement-tree, we must know whether or not the
373 statements are full-expressions. We record that fact here. */
374 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
377 /* Add T to the statement-tree. Non-side-effect statements need to be
378 recorded during statement expressions. */
379 append_to_statement_list_force (t, &cur_stmt_list);
384 /* Returns the stmt_tree to which statements are currently being added. */
387 current_stmt_tree (void)
390 ? &cfun->language->base.x_stmt_tree
391 : &scope_chain->x_stmt_tree);
394 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
397 maybe_cleanup_point_expr (tree expr)
399 if (!processing_template_decl && stmts_are_full_exprs_p ())
400 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
404 /* Like maybe_cleanup_point_expr except have the type of the new expression be
405 void so we don't need to create a temporary variable to hold the inner
406 expression. The reason why we do this is because the original type might be
407 an aggregate and we cannot create a temporary variable for that type. */
410 maybe_cleanup_point_expr_void (tree expr)
412 if (!processing_template_decl && stmts_are_full_exprs_p ())
413 expr = fold_build_cleanup_point_expr (void_type_node, expr);
419 /* Create a declaration statement for the declaration given by the DECL. */
422 add_decl_expr (tree decl)
424 tree r = build_stmt (input_location, DECL_EXPR, decl);
425 if (DECL_INITIAL (decl)
426 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
427 r = maybe_cleanup_point_expr_void (r);
431 /* Finish a scope. */
434 do_poplevel (tree stmt_list)
438 if (stmts_are_full_exprs_p ())
439 block = poplevel (kept_level_p (), 1, 0);
441 stmt_list = pop_stmt_list (stmt_list);
443 if (!processing_template_decl)
445 stmt_list = c_build_bind_expr (input_location, block, stmt_list);
446 /* ??? See c_end_compound_stmt re statement expressions. */
452 /* Begin a new scope. */
455 do_pushlevel (scope_kind sk)
457 tree ret = push_stmt_list ();
458 if (stmts_are_full_exprs_p ())
459 begin_scope (sk, NULL);
463 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
464 when the current scope is exited. EH_ONLY is true when this is not
465 meant to apply to normal control flow transfer. */
468 push_cleanup (tree decl, tree cleanup, bool eh_only)
470 tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl);
471 CLEANUP_EH_ONLY (stmt) = eh_only;
473 CLEANUP_BODY (stmt) = push_stmt_list ();
476 /* Begin a conditional that might contain a declaration. When generating
477 normal code, we want the declaration to appear before the statement
478 containing the conditional. When generating template code, we want the
479 conditional to be rendered as the raw DECL_EXPR. */
482 begin_cond (tree *cond_p)
484 if (processing_template_decl)
485 *cond_p = push_stmt_list ();
488 /* Finish such a conditional. */
491 finish_cond (tree *cond_p, tree expr)
493 if (processing_template_decl)
495 tree cond = pop_stmt_list (*cond_p);
496 if (TREE_CODE (cond) == DECL_EXPR)
499 if (check_for_bare_parameter_packs (expr))
500 *cond_p = error_mark_node;
505 /* If *COND_P specifies a conditional with a declaration, transform the
508 for (; A x = 42;) { }
510 while (true) { A x = 42; if (!x) break; }
511 for (;;) { A x = 42; if (!x) break; }
512 The statement list for BODY will be empty if the conditional did
513 not declare anything. */
516 simplify_loop_decl_cond (tree *cond_p, tree body)
520 if (!TREE_SIDE_EFFECTS (body))
524 *cond_p = boolean_true_node;
526 if_stmt = begin_if_stmt ();
527 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
528 finish_if_stmt_cond (cond, if_stmt);
529 finish_break_stmt ();
530 finish_then_clause (if_stmt);
531 finish_if_stmt (if_stmt);
534 /* Finish a goto-statement. */
537 finish_goto_stmt (tree destination)
539 if (TREE_CODE (destination) == IDENTIFIER_NODE)
540 destination = lookup_label (destination);
542 /* We warn about unused labels with -Wunused. That means we have to
543 mark the used labels as used. */
544 if (TREE_CODE (destination) == LABEL_DECL)
545 TREE_USED (destination) = 1;
548 /* The DESTINATION is being used as an rvalue. */
549 if (!processing_template_decl)
551 destination = decay_conversion (destination);
552 destination = cp_convert (ptr_type_node, destination);
553 if (error_operand_p (destination))
556 /* We don't inline calls to functions with computed gotos.
557 Those functions are typically up to some funny business,
558 and may be depending on the labels being at particular
559 addresses, or some such. */
560 DECL_UNINLINABLE (current_function_decl) = 1;
563 check_goto (destination);
565 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
568 /* COND is the condition-expression for an if, while, etc.,
569 statement. Convert it to a boolean value, if appropriate.
570 In addition, verify sequence points if -Wsequence-point is enabled. */
573 maybe_convert_cond (tree cond)
575 /* Empty conditions remain empty. */
579 /* Wait until we instantiate templates before doing conversion. */
580 if (processing_template_decl)
583 if (warn_sequence_point)
584 verify_sequence_points (cond);
586 /* Do the conversion. */
587 cond = convert_from_reference (cond);
589 if (TREE_CODE (cond) == MODIFY_EXPR
590 && !TREE_NO_WARNING (cond)
593 warning (OPT_Wparentheses,
594 "suggest parentheses around assignment used as truth value");
595 TREE_NO_WARNING (cond) = 1;
598 return condition_conversion (cond);
601 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
604 finish_expr_stmt (tree expr)
608 if (expr != NULL_TREE)
610 if (!processing_template_decl)
612 if (warn_sequence_point)
613 verify_sequence_points (expr);
614 expr = convert_to_void (expr, "statement", tf_warning_or_error);
616 else if (!type_dependent_expression_p (expr))
617 convert_to_void (build_non_dependent_expr (expr), "statement",
618 tf_warning_or_error);
620 if (check_for_bare_parameter_packs (expr))
621 expr = error_mark_node;
623 /* Simplification of inner statement expressions, compound exprs,
624 etc can result in us already having an EXPR_STMT. */
625 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
627 if (TREE_CODE (expr) != EXPR_STMT)
628 expr = build_stmt (input_location, EXPR_STMT, expr);
629 expr = maybe_cleanup_point_expr_void (expr);
641 /* Begin an if-statement. Returns a newly created IF_STMT if
648 scope = do_pushlevel (sk_block);
649 r = build_stmt (input_location, IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
650 TREE_CHAIN (r) = scope;
651 begin_cond (&IF_COND (r));
655 /* Process the COND of an if-statement, which may be given by
659 finish_if_stmt_cond (tree cond, tree if_stmt)
661 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
663 THEN_CLAUSE (if_stmt) = push_stmt_list ();
666 /* Finish the then-clause of an if-statement, which may be given by
670 finish_then_clause (tree if_stmt)
672 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
676 /* Begin the else-clause of an if-statement. */
679 begin_else_clause (tree if_stmt)
681 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
684 /* Finish the else-clause of an if-statement, which may be given by
688 finish_else_clause (tree if_stmt)
690 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
693 /* Finish an if-statement. */
696 finish_if_stmt (tree if_stmt)
698 tree scope = TREE_CHAIN (if_stmt);
699 TREE_CHAIN (if_stmt) = NULL;
700 add_stmt (do_poplevel (scope));
704 /* Begin a while-statement. Returns a newly created WHILE_STMT if
708 begin_while_stmt (void)
711 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
713 WHILE_BODY (r) = do_pushlevel (sk_block);
714 begin_cond (&WHILE_COND (r));
718 /* Process the COND of a while-statement, which may be given by
722 finish_while_stmt_cond (tree cond, tree while_stmt)
724 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
725 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
728 /* Finish a while-statement, which may be given by WHILE_STMT. */
731 finish_while_stmt (tree while_stmt)
733 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
737 /* Begin a do-statement. Returns a newly created DO_STMT if
743 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
745 DO_BODY (r) = push_stmt_list ();
749 /* Finish the body of a do-statement, which may be given by DO_STMT. */
752 finish_do_body (tree do_stmt)
754 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
756 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
757 body = STATEMENT_LIST_TAIL (body)->stmt;
759 if (IS_EMPTY_STMT (body))
760 warning (OPT_Wempty_body,
761 "suggest explicit braces around empty body in %<do%> statement");
764 /* Finish a do-statement, which may be given by DO_STMT, and whose
765 COND is as indicated. */
768 finish_do_stmt (tree cond, tree do_stmt)
770 cond = maybe_convert_cond (cond);
771 DO_COND (do_stmt) = cond;
775 /* Finish a return-statement. The EXPRESSION returned, if any, is as
779 finish_return_stmt (tree expr)
784 expr = check_return_expr (expr, &no_warning);
786 if (flag_openmp && !check_omp_return ())
787 return error_mark_node;
788 if (!processing_template_decl)
790 if (warn_sequence_point)
791 verify_sequence_points (expr);
793 if (DECL_DESTRUCTOR_P (current_function_decl)
794 || (DECL_CONSTRUCTOR_P (current_function_decl)
795 && targetm.cxx.cdtor_returns_this ()))
797 /* Similarly, all destructors must run destructors for
798 base-classes before returning. So, all returns in a
799 destructor get sent to the DTOR_LABEL; finish_function emits
800 code to return a value there. */
801 return finish_goto_stmt (cdtor_label);
805 r = build_stmt (input_location, RETURN_EXPR, expr);
806 TREE_NO_WARNING (r) |= no_warning;
807 r = maybe_cleanup_point_expr_void (r);
814 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
817 begin_for_stmt (void)
821 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
822 NULL_TREE, NULL_TREE);
824 if (flag_new_for_scope > 0)
825 TREE_CHAIN (r) = do_pushlevel (sk_for);
827 if (processing_template_decl)
828 FOR_INIT_STMT (r) = push_stmt_list ();
833 /* Finish the for-init-statement of a for-statement, which may be
834 given by FOR_STMT. */
837 finish_for_init_stmt (tree for_stmt)
839 if (processing_template_decl)
840 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
842 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
843 begin_cond (&FOR_COND (for_stmt));
846 /* Finish the COND of a for-statement, which may be given by
850 finish_for_cond (tree cond, tree for_stmt)
852 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
853 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
856 /* Finish the increment-EXPRESSION in a for-statement, which may be
857 given by FOR_STMT. */
860 finish_for_expr (tree expr, tree for_stmt)
864 /* If EXPR is an overloaded function, issue an error; there is no
865 context available to use to perform overload resolution. */
866 if (type_unknown_p (expr))
868 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
869 expr = error_mark_node;
871 if (!processing_template_decl)
873 if (warn_sequence_point)
874 verify_sequence_points (expr);
875 expr = convert_to_void (expr, "3rd expression in for",
876 tf_warning_or_error);
878 else if (!type_dependent_expression_p (expr))
879 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for",
880 tf_warning_or_error);
881 expr = maybe_cleanup_point_expr_void (expr);
882 if (check_for_bare_parameter_packs (expr))
883 expr = error_mark_node;
884 FOR_EXPR (for_stmt) = expr;
887 /* Finish the body of a for-statement, which may be given by
888 FOR_STMT. The increment-EXPR for the loop must be
892 finish_for_stmt (tree for_stmt)
894 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
896 /* Pop the scope for the body of the loop. */
897 if (flag_new_for_scope > 0)
899 tree scope = TREE_CHAIN (for_stmt);
900 TREE_CHAIN (for_stmt) = NULL;
901 add_stmt (do_poplevel (scope));
907 /* Finish a break-statement. */
910 finish_break_stmt (void)
912 return add_stmt (build_stmt (input_location, BREAK_STMT));
915 /* Finish a continue-statement. */
918 finish_continue_stmt (void)
920 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
923 /* Begin a switch-statement. Returns a new SWITCH_STMT if
927 begin_switch_stmt (void)
931 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
933 scope = do_pushlevel (sk_block);
934 TREE_CHAIN (r) = scope;
935 begin_cond (&SWITCH_STMT_COND (r));
940 /* Finish the cond of a switch-statement. */
943 finish_switch_cond (tree cond, tree switch_stmt)
945 tree orig_type = NULL;
946 if (!processing_template_decl)
948 /* Convert the condition to an integer or enumeration type. */
949 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
950 if (cond == NULL_TREE)
952 error ("switch quantity not an integer");
953 cond = error_mark_node;
955 orig_type = TREE_TYPE (cond);
956 if (cond != error_mark_node)
960 Integral promotions are performed. */
961 cond = perform_integral_promotions (cond);
962 cond = maybe_cleanup_point_expr (cond);
965 if (check_for_bare_parameter_packs (cond))
966 cond = error_mark_node;
967 else if (!processing_template_decl && warn_sequence_point)
968 verify_sequence_points (cond);
970 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
971 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
972 add_stmt (switch_stmt);
973 push_switch (switch_stmt);
974 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
977 /* Finish the body of a switch-statement, which may be given by
978 SWITCH_STMT. The COND to switch on is indicated. */
981 finish_switch_stmt (tree switch_stmt)
985 SWITCH_STMT_BODY (switch_stmt) =
986 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
990 scope = TREE_CHAIN (switch_stmt);
991 TREE_CHAIN (switch_stmt) = NULL;
992 add_stmt (do_poplevel (scope));
995 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
999 begin_try_block (void)
1001 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1003 TRY_STMTS (r) = push_stmt_list ();
1007 /* Likewise, for a function-try-block. The block returned in
1008 *COMPOUND_STMT is an artificial outer scope, containing the
1009 function-try-block. */
1012 begin_function_try_block (tree *compound_stmt)
1015 /* This outer scope does not exist in the C++ standard, but we need
1016 a place to put __FUNCTION__ and similar variables. */
1017 *compound_stmt = begin_compound_stmt (0);
1018 r = begin_try_block ();
1019 FN_TRY_BLOCK_P (r) = 1;
1023 /* Finish a try-block, which may be given by TRY_BLOCK. */
1026 finish_try_block (tree try_block)
1028 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1029 TRY_HANDLERS (try_block) = push_stmt_list ();
1032 /* Finish the body of a cleanup try-block, which may be given by
1036 finish_cleanup_try_block (tree try_block)
1038 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1041 /* Finish an implicitly generated try-block, with a cleanup is given
1045 finish_cleanup (tree cleanup, tree try_block)
1047 TRY_HANDLERS (try_block) = cleanup;
1048 CLEANUP_P (try_block) = 1;
1051 /* Likewise, for a function-try-block. */
1054 finish_function_try_block (tree try_block)
1056 finish_try_block (try_block);
1057 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1058 the try block, but moving it inside. */
1059 in_function_try_handler = 1;
1062 /* Finish a handler-sequence for a try-block, which may be given by
1066 finish_handler_sequence (tree try_block)
1068 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1069 check_handlers (TRY_HANDLERS (try_block));
1072 /* Finish the handler-seq for a function-try-block, given by
1073 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1074 begin_function_try_block. */
1077 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1079 in_function_try_handler = 0;
1080 finish_handler_sequence (try_block);
1081 finish_compound_stmt (compound_stmt);
1084 /* Begin a handler. Returns a HANDLER if appropriate. */
1087 begin_handler (void)
1091 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1094 /* Create a binding level for the eh_info and the exception object
1096 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1101 /* Finish the handler-parameters for a handler, which may be given by
1102 HANDLER. DECL is the declaration for the catch parameter, or NULL
1103 if this is a `catch (...)' clause. */
1106 finish_handler_parms (tree decl, tree handler)
1108 tree type = NULL_TREE;
1109 if (processing_template_decl)
1113 decl = pushdecl (decl);
1114 decl = push_template_decl (decl);
1115 HANDLER_PARMS (handler) = decl;
1116 type = TREE_TYPE (decl);
1120 type = expand_start_catch_block (decl);
1121 HANDLER_TYPE (handler) = type;
1122 if (!processing_template_decl && type)
1123 mark_used (eh_type_info (type));
1126 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1127 the return value from the matching call to finish_handler_parms. */
1130 finish_handler (tree handler)
1132 if (!processing_template_decl)
1133 expand_end_catch_block ();
1134 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1137 /* Begin a compound statement. FLAGS contains some bits that control the
1138 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1139 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1140 block of a function. If BCS_TRY_BLOCK is set, this is the block
1141 created on behalf of a TRY statement. Returns a token to be passed to
1142 finish_compound_stmt. */
1145 begin_compound_stmt (unsigned int flags)
1149 if (flags & BCS_NO_SCOPE)
1151 r = push_stmt_list ();
1152 STATEMENT_LIST_NO_SCOPE (r) = 1;
1154 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1155 But, if it's a statement-expression with a scopeless block, there's
1156 nothing to keep, and we don't want to accidentally keep a block
1157 *inside* the scopeless block. */
1158 keep_next_level (false);
1161 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1163 /* When processing a template, we need to remember where the braces were,
1164 so that we can set up identical scopes when instantiating the template
1165 later. BIND_EXPR is a handy candidate for this.
1166 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1167 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1168 processing templates. */
1169 if (processing_template_decl)
1171 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1172 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1173 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1174 TREE_SIDE_EFFECTS (r) = 1;
1180 /* Finish a compound-statement, which is given by STMT. */
1183 finish_compound_stmt (tree stmt)
1185 if (TREE_CODE (stmt) == BIND_EXPR)
1186 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1187 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1188 stmt = pop_stmt_list (stmt);
1191 /* Destroy any ObjC "super" receivers that may have been
1193 objc_clear_super_receiver ();
1195 stmt = do_poplevel (stmt);
1198 /* ??? See c_end_compound_stmt wrt statement expressions. */
1203 /* Finish an asm-statement, whose components are a STRING, some
1204 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1205 LABELS. Also note whether the asm-statement should be
1206 considered volatile. */
1209 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1210 tree input_operands, tree clobbers, tree labels)
1214 int ninputs = list_length (input_operands);
1215 int noutputs = list_length (output_operands);
1217 if (!processing_template_decl)
1219 const char *constraint;
1220 const char **oconstraints;
1221 bool allows_mem, allows_reg, is_inout;
1225 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1227 string = resolve_asm_operand_names (string, output_operands,
1228 input_operands, labels);
1230 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1232 operand = TREE_VALUE (t);
1234 /* ??? Really, this should not be here. Users should be using a
1235 proper lvalue, dammit. But there's a long history of using
1236 casts in the output operands. In cases like longlong.h, this
1237 becomes a primitive form of typechecking -- if the cast can be
1238 removed, then the output operand had a type of the proper width;
1239 otherwise we'll get an error. Gross, but ... */
1240 STRIP_NOPS (operand);
1242 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1243 operand = error_mark_node;
1245 if (operand != error_mark_node
1246 && (TREE_READONLY (operand)
1247 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1248 /* Functions are not modifiable, even though they are
1250 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1251 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1252 /* If it's an aggregate and any field is const, then it is
1253 effectively const. */
1254 || (CLASS_TYPE_P (TREE_TYPE (operand))
1255 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1256 readonly_error (operand, "assignment (via 'asm' output)");
1258 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1259 oconstraints[i] = constraint;
1261 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1262 &allows_mem, &allows_reg, &is_inout))
1264 /* If the operand is going to end up in memory,
1265 mark it addressable. */
1266 if (!allows_reg && !cxx_mark_addressable (operand))
1267 operand = error_mark_node;
1270 operand = error_mark_node;
1272 TREE_VALUE (t) = operand;
1275 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1277 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1278 operand = decay_conversion (TREE_VALUE (t));
1280 /* If the type of the operand hasn't been determined (e.g.,
1281 because it involves an overloaded function), then issue
1282 an error message. There's no context available to
1283 resolve the overloading. */
1284 if (TREE_TYPE (operand) == unknown_type_node)
1286 error ("type of asm operand %qE could not be determined",
1288 operand = error_mark_node;
1291 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1292 oconstraints, &allows_mem, &allows_reg))
1294 /* If the operand is going to end up in memory,
1295 mark it addressable. */
1296 if (!allows_reg && allows_mem)
1298 /* Strip the nops as we allow this case. FIXME, this really
1299 should be rejected or made deprecated. */
1300 STRIP_NOPS (operand);
1301 if (!cxx_mark_addressable (operand))
1302 operand = error_mark_node;
1306 operand = error_mark_node;
1308 TREE_VALUE (t) = operand;
1312 r = build_stmt (input_location, ASM_EXPR, string,
1313 output_operands, input_operands,
1315 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1316 r = maybe_cleanup_point_expr_void (r);
1317 return add_stmt (r);
1320 /* Finish a label with the indicated NAME. Returns the new label. */
1323 finish_label_stmt (tree name)
1325 tree decl = define_label (input_location, name);
1327 if (decl == error_mark_node)
1328 return error_mark_node;
1330 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1335 /* Finish a series of declarations for local labels. G++ allows users
1336 to declare "local" labels, i.e., labels with scope. This extension
1337 is useful when writing code involving statement-expressions. */
1340 finish_label_decl (tree name)
1342 if (!at_function_scope_p ())
1344 error ("__label__ declarations are only allowed in function scopes");
1348 add_decl_expr (declare_local_label (name));
1351 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1354 finish_decl_cleanup (tree decl, tree cleanup)
1356 push_cleanup (decl, cleanup, false);
1359 /* If the current scope exits with an exception, run CLEANUP. */
1362 finish_eh_cleanup (tree cleanup)
1364 push_cleanup (NULL, cleanup, true);
1367 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1368 order they were written by the user. Each node is as for
1369 emit_mem_initializers. */
1372 finish_mem_initializers (tree mem_inits)
1374 /* Reorder the MEM_INITS so that they are in the order they appeared
1375 in the source program. */
1376 mem_inits = nreverse (mem_inits);
1378 if (processing_template_decl)
1382 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1384 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1385 check for bare parameter packs in the TREE_VALUE, because
1386 any parameter packs in the TREE_VALUE have already been
1387 bound as part of the TREE_PURPOSE. See
1388 make_pack_expansion for more information. */
1389 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1390 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1391 TREE_VALUE (mem) = error_mark_node;
1394 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1397 emit_mem_initializers (mem_inits);
1400 /* Finish a parenthesized expression EXPR. */
1403 finish_parenthesized_expr (tree expr)
1406 /* This inhibits warnings in c_common_truthvalue_conversion. */
1407 TREE_NO_WARNING (expr) = 1;
1409 if (TREE_CODE (expr) == OFFSET_REF)
1410 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1411 enclosed in parentheses. */
1412 PTRMEM_OK_P (expr) = 0;
1414 if (TREE_CODE (expr) == STRING_CST)
1415 PAREN_STRING_LITERAL_P (expr) = 1;
1420 /* Finish a reference to a non-static data member (DECL) that is not
1421 preceded by `.' or `->'. */
1424 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1426 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1428 if (!object && cp_unevaluated_operand != 0)
1430 /* DR 613: Can use non-static data members without an associated
1431 object in sizeof/decltype/alignof. */
1432 tree scope = qualifying_scope;
1433 if (scope == NULL_TREE)
1434 scope = context_for_name_lookup (decl);
1435 object = maybe_dummy_object (scope, NULL);
1440 if (current_function_decl
1441 && DECL_STATIC_FUNCTION_P (current_function_decl))
1442 error ("invalid use of member %q+D in static member function", decl);
1444 error ("invalid use of non-static data member %q+D", decl);
1445 error ("from this location");
1447 return error_mark_node;
1450 /* If decl is a field, object has a lambda type, and decl is not a member
1451 of that type, then we have a reference to a member of 'this' from a
1452 lambda inside a non-static member function, and we must get to decl
1453 through the 'this' capture. If decl is not a member of that object,
1454 either, then its access will still fail later. */
1455 if (LAMBDA_TYPE_P (TREE_TYPE (object))
1456 && !same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (decl),
1457 TREE_TYPE (object)))
1458 object = cp_build_indirect_ref (lambda_expr_this_capture
1459 (CLASSTYPE_LAMBDA_EXPR
1460 (TREE_TYPE (object))),
1462 /*complain=*/tf_warning_or_error);
1464 if (current_class_ptr)
1465 TREE_USED (current_class_ptr) = 1;
1466 if (processing_template_decl && !qualifying_scope)
1468 tree type = TREE_TYPE (decl);
1470 if (TREE_CODE (type) == REFERENCE_TYPE)
1471 type = TREE_TYPE (type);
1474 /* Set the cv qualifiers. */
1475 int quals = (current_class_ref
1476 ? cp_type_quals (TREE_TYPE (current_class_ref))
1477 : TYPE_UNQUALIFIED);
1479 if (DECL_MUTABLE_P (decl))
1480 quals &= ~TYPE_QUAL_CONST;
1482 quals |= cp_type_quals (TREE_TYPE (decl));
1483 type = cp_build_qualified_type (type, quals);
1486 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1490 tree access_type = TREE_TYPE (object);
1491 tree lookup_context = context_for_name_lookup (decl);
1493 while (!DERIVED_FROM_P (lookup_context, access_type))
1495 access_type = TYPE_CONTEXT (access_type);
1496 while (access_type && DECL_P (access_type))
1497 access_type = DECL_CONTEXT (access_type);
1501 error ("object missing in reference to %q+D", decl);
1502 error ("from this location");
1503 return error_mark_node;
1507 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1508 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1510 if (processing_template_decl)
1511 return build_qualified_name (TREE_TYPE (decl),
1514 /*template_p=*/false);
1516 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1519 /* If the data member was named `C::M', convert `*this' to `C'
1521 if (qualifying_scope)
1523 tree binfo = NULL_TREE;
1524 object = build_scoped_ref (object, qualifying_scope,
1528 return build_class_member_access_expr (object, decl,
1529 /*access_path=*/NULL_TREE,
1530 /*preserve_reference=*/false,
1531 tf_warning_or_error);
1535 /* DECL was the declaration to which a qualified-id resolved. Issue
1536 an error message if it is not accessible. If OBJECT_TYPE is
1537 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1538 type of `*x', or `x', respectively. If the DECL was named as
1539 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1542 check_accessibility_of_qualified_id (tree decl,
1544 tree nested_name_specifier)
1547 tree qualifying_type = NULL_TREE;
1549 /* If we are parsing a template declaration and if decl is a typedef,
1550 add it to a list tied to the template.
1551 At template instantiation time, that list will be walked and
1552 access check performed. */
1553 if (is_typedef_decl (decl))
1555 /* This the scope through which type_decl is accessed.
1556 It will be useful information later to do access check for
1558 tree scope = nested_name_specifier
1559 ? nested_name_specifier
1560 : DECL_CONTEXT (decl);
1561 tree templ_info = NULL;
1562 tree cs = current_scope ();
1564 if (cs && (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL))
1565 templ_info = get_template_info (cs);
1568 && TI_TEMPLATE (templ_info)
1570 && CLASS_TYPE_P (scope)
1571 && !currently_open_class (scope))
1572 append_type_to_template_for_access_check (current_scope (), decl, scope);
1575 /* If we're not checking, return immediately. */
1576 if (deferred_access_no_check)
1579 /* Determine the SCOPE of DECL. */
1580 scope = context_for_name_lookup (decl);
1581 /* If the SCOPE is not a type, then DECL is not a member. */
1582 if (!TYPE_P (scope))
1584 /* Compute the scope through which DECL is being accessed. */
1586 /* OBJECT_TYPE might not be a class type; consider:
1588 class A { typedef int I; };
1592 In this case, we will have "A::I" as the DECL, but "I" as the
1594 && CLASS_TYPE_P (object_type)
1595 && DERIVED_FROM_P (scope, object_type))
1596 /* If we are processing a `->' or `.' expression, use the type of the
1598 qualifying_type = object_type;
1599 else if (nested_name_specifier)
1601 /* If the reference is to a non-static member of the
1602 current class, treat it as if it were referenced through
1604 if (DECL_NONSTATIC_MEMBER_P (decl)
1605 && current_class_ptr
1606 && DERIVED_FROM_P (scope, current_class_type))
1607 qualifying_type = current_class_type;
1608 /* Otherwise, use the type indicated by the
1609 nested-name-specifier. */
1611 qualifying_type = nested_name_specifier;
1614 /* Otherwise, the name must be from the current class or one of
1616 qualifying_type = currently_open_derived_class (scope);
1619 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1620 or similar in a default argument value. */
1621 && CLASS_TYPE_P (qualifying_type)
1622 && !dependent_type_p (qualifying_type))
1623 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1627 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1628 class named to the left of the "::" operator. DONE is true if this
1629 expression is a complete postfix-expression; it is false if this
1630 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1631 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1632 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1633 is true iff this qualified name appears as a template argument. */
1636 finish_qualified_id_expr (tree qualifying_class,
1641 bool template_arg_p)
1643 gcc_assert (TYPE_P (qualifying_class));
1645 if (error_operand_p (expr))
1646 return error_mark_node;
1648 if (DECL_P (expr) || BASELINK_P (expr))
1652 check_template_keyword (expr);
1654 /* If EXPR occurs as the operand of '&', use special handling that
1655 permits a pointer-to-member. */
1656 if (address_p && done)
1658 if (TREE_CODE (expr) == SCOPE_REF)
1659 expr = TREE_OPERAND (expr, 1);
1660 expr = build_offset_ref (qualifying_class, expr,
1661 /*address_p=*/true);
1665 /* Within the scope of a class, turn references to non-static
1666 members into expression of the form "this->...". */
1668 /* But, within a template argument, we do not want make the
1669 transformation, as there is no "this" pointer. */
1671 else if (TREE_CODE (expr) == FIELD_DECL)
1673 push_deferring_access_checks (dk_no_check);
1674 expr = finish_non_static_data_member (expr, current_class_ref,
1676 pop_deferring_access_checks ();
1678 else if (BASELINK_P (expr) && !processing_template_decl)
1682 /* See if any of the functions are non-static members. */
1683 fns = BASELINK_FUNCTIONS (expr);
1684 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1685 fns = TREE_OPERAND (fns, 0);
1686 /* If so, the expression may be relative to 'this'. */
1687 if (!shared_member_p (fns)
1688 && current_class_ref
1689 && DERIVED_FROM_P (qualifying_class, TREE_TYPE (current_class_ref)))
1690 expr = (build_class_member_access_expr
1691 (maybe_dummy_object (qualifying_class, NULL),
1693 BASELINK_ACCESS_BINFO (expr),
1694 /*preserve_reference=*/false,
1695 tf_warning_or_error));
1697 /* The expression is a qualified name whose address is not
1699 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1705 /* Begin a statement-expression. The value returned must be passed to
1706 finish_stmt_expr. */
1709 begin_stmt_expr (void)
1711 return push_stmt_list ();
1714 /* Process the final expression of a statement expression. EXPR can be
1715 NULL, if the final expression is empty. Return a STATEMENT_LIST
1716 containing all the statements in the statement-expression, or
1717 ERROR_MARK_NODE if there was an error. */
1720 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1722 if (error_operand_p (expr))
1724 /* The type of the statement-expression is the type of the last
1726 TREE_TYPE (stmt_expr) = error_mark_node;
1727 return error_mark_node;
1730 /* If the last statement does not have "void" type, then the value
1731 of the last statement is the value of the entire expression. */
1734 tree type = TREE_TYPE (expr);
1736 if (processing_template_decl)
1738 expr = build_stmt (input_location, EXPR_STMT, expr);
1739 expr = add_stmt (expr);
1740 /* Mark the last statement so that we can recognize it as such at
1741 template-instantiation time. */
1742 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1744 else if (VOID_TYPE_P (type))
1746 /* Just treat this like an ordinary statement. */
1747 expr = finish_expr_stmt (expr);
1751 /* It actually has a value we need to deal with. First, force it
1752 to be an rvalue so that we won't need to build up a copy
1753 constructor call later when we try to assign it to something. */
1754 expr = force_rvalue (expr);
1755 if (error_operand_p (expr))
1756 return error_mark_node;
1758 /* Update for array-to-pointer decay. */
1759 type = TREE_TYPE (expr);
1761 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1762 normal statement, but don't convert to void or actually add
1764 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1765 expr = maybe_cleanup_point_expr (expr);
1769 /* The type of the statement-expression is the type of the last
1771 TREE_TYPE (stmt_expr) = type;
1777 /* Finish a statement-expression. EXPR should be the value returned
1778 by the previous begin_stmt_expr. Returns an expression
1779 representing the statement-expression. */
1782 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1787 if (error_operand_p (stmt_expr))
1789 pop_stmt_list (stmt_expr);
1790 return error_mark_node;
1793 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1795 type = TREE_TYPE (stmt_expr);
1796 result = pop_stmt_list (stmt_expr);
1797 TREE_TYPE (result) = type;
1799 if (processing_template_decl)
1801 result = build_min (STMT_EXPR, type, result);
1802 TREE_SIDE_EFFECTS (result) = 1;
1803 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1805 else if (CLASS_TYPE_P (type))
1807 /* Wrap the statement-expression in a TARGET_EXPR so that the
1808 temporary object created by the final expression is destroyed at
1809 the end of the full-expression containing the
1810 statement-expression. */
1811 result = force_target_expr (type, result);
1817 /* Returns the expression which provides the value of STMT_EXPR. */
1820 stmt_expr_value_expr (tree stmt_expr)
1822 tree t = STMT_EXPR_STMT (stmt_expr);
1824 if (TREE_CODE (t) == BIND_EXPR)
1825 t = BIND_EXPR_BODY (t);
1827 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1828 t = STATEMENT_LIST_TAIL (t)->stmt;
1830 if (TREE_CODE (t) == EXPR_STMT)
1831 t = EXPR_STMT_EXPR (t);
1836 /* Perform Koenig lookup. FN is the postfix-expression representing
1837 the function (or functions) to call; ARGS are the arguments to the
1838 call. Returns the functions to be considered by overload
1842 perform_koenig_lookup (tree fn, VEC(tree,gc) *args)
1844 tree identifier = NULL_TREE;
1845 tree functions = NULL_TREE;
1846 tree tmpl_args = NULL_TREE;
1847 bool template_id = false;
1849 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1851 /* Use a separate flag to handle null args. */
1853 tmpl_args = TREE_OPERAND (fn, 1);
1854 fn = TREE_OPERAND (fn, 0);
1857 /* Find the name of the overloaded function. */
1858 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1860 else if (is_overloaded_fn (fn))
1863 identifier = DECL_NAME (get_first_fn (functions));
1865 else if (DECL_P (fn))
1868 identifier = DECL_NAME (fn);
1871 /* A call to a namespace-scope function using an unqualified name.
1873 Do Koenig lookup -- unless any of the arguments are
1875 if (!any_type_dependent_arguments_p (args)
1876 && !any_dependent_template_arguments_p (tmpl_args))
1878 fn = lookup_arg_dependent (identifier, functions, args);
1880 /* The unqualified name could not be resolved. */
1881 fn = unqualified_fn_lookup_error (identifier);
1884 if (fn && template_id)
1885 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1890 /* Generate an expression for `FN (ARGS)'. This may change the
1893 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1894 as a virtual call, even if FN is virtual. (This flag is set when
1895 encountering an expression where the function name is explicitly
1896 qualified. For example a call to `X::f' never generates a virtual
1899 Returns code for the call. */
1902 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1903 bool koenig_p, tsubst_flags_t complain)
1907 VEC(tree,gc) *orig_args = NULL;
1909 if (fn == error_mark_node)
1910 return error_mark_node;
1912 gcc_assert (!TYPE_P (fn));
1916 if (processing_template_decl)
1918 if (type_dependent_expression_p (fn)
1919 || any_type_dependent_arguments_p (*args))
1921 result = build_nt_call_vec (fn, *args);
1922 KOENIG_LOOKUP_P (result) = koenig_p;
1927 tree fndecl = OVL_CURRENT (fn);
1928 if (TREE_CODE (fndecl) != FUNCTION_DECL
1929 || !TREE_THIS_VOLATILE (fndecl))
1935 current_function_returns_abnormally = 1;
1939 orig_args = make_tree_vector_copy (*args);
1940 if (!BASELINK_P (fn)
1941 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1942 && TREE_TYPE (fn) != unknown_type_node)
1943 fn = build_non_dependent_expr (fn);
1944 make_args_non_dependent (*args);
1947 if (is_overloaded_fn (fn))
1948 fn = baselink_for_fns (fn);
1951 if (BASELINK_P (fn))
1955 /* A call to a member function. From [over.call.func]:
1957 If the keyword this is in scope and refers to the class of
1958 that member function, or a derived class thereof, then the
1959 function call is transformed into a qualified function call
1960 using (*this) as the postfix-expression to the left of the
1961 . operator.... [Otherwise] a contrived object of type T
1962 becomes the implied object argument.
1964 This paragraph is unclear about this situation:
1966 struct A { void f(); };
1967 struct B : public A {};
1968 struct C : public A { void g() { B::f(); }};
1970 In particular, for `B::f', this paragraph does not make clear
1971 whether "the class of that member function" refers to `A' or
1972 to `B'. We believe it refers to `B'. */
1973 if (current_class_type
1974 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1976 && current_class_ref)
1977 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1981 tree representative_fn;
1983 representative_fn = BASELINK_FUNCTIONS (fn);
1984 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1985 representative_fn = TREE_OPERAND (representative_fn, 0);
1986 representative_fn = get_first_fn (representative_fn);
1987 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1990 if (processing_template_decl)
1992 if (type_dependent_expression_p (object))
1994 tree ret = build_nt_call_vec (orig_fn, orig_args);
1995 release_tree_vector (orig_args);
1998 object = build_non_dependent_expr (object);
2001 result = build_new_method_call (object, fn, args, NULL_TREE,
2003 ? LOOKUP_NONVIRTUAL : 0),
2007 else if (is_overloaded_fn (fn))
2009 /* If the function is an overloaded builtin, resolve it. */
2010 if (TREE_CODE (fn) == FUNCTION_DECL
2011 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2012 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2013 result = resolve_overloaded_builtin (input_location, fn, *args);
2016 /* A call to a namespace-scope function. */
2017 result = build_new_function_call (fn, args, koenig_p, complain);
2019 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2021 if (!VEC_empty (tree, *args))
2022 error ("arguments to destructor are not allowed");
2023 /* Mark the pseudo-destructor call as having side-effects so
2024 that we do not issue warnings about its use. */
2025 result = build1 (NOP_EXPR,
2027 TREE_OPERAND (fn, 0));
2028 TREE_SIDE_EFFECTS (result) = 1;
2030 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2031 /* If the "function" is really an object of class type, it might
2032 have an overloaded `operator ()'. */
2033 result = build_op_call (fn, args, complain);
2036 /* A call where the function is unknown. */
2037 result = cp_build_function_call_vec (fn, args, complain);
2039 if (processing_template_decl)
2041 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2042 KOENIG_LOOKUP_P (result) = koenig_p;
2043 release_tree_vector (orig_args);
2049 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2050 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2051 POSTDECREMENT_EXPR.) */
2054 finish_increment_expr (tree expr, enum tree_code code)
2056 return build_x_unary_op (code, expr, tf_warning_or_error);
2059 /* Finish a use of `this'. Returns an expression for `this'. */
2062 finish_this_expr (void)
2066 if (current_class_ptr)
2068 tree type = TREE_TYPE (current_class_ref);
2070 /* In a lambda expression, 'this' refers to the captured 'this'. */
2071 if (LAMBDA_TYPE_P (type))
2072 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2074 result = current_class_ptr;
2077 else if (current_function_decl
2078 && DECL_STATIC_FUNCTION_P (current_function_decl))
2080 error ("%<this%> is unavailable for static member functions");
2081 result = error_mark_node;
2085 if (current_function_decl)
2086 error ("invalid use of %<this%> in non-member function");
2088 error ("invalid use of %<this%> at top level");
2089 result = error_mark_node;
2095 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2096 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2097 the TYPE for the type given. If SCOPE is non-NULL, the expression
2098 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2101 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2103 if (object == error_mark_node || destructor == error_mark_node)
2104 return error_mark_node;
2106 gcc_assert (TYPE_P (destructor));
2108 if (!processing_template_decl)
2110 if (scope == error_mark_node)
2112 error ("invalid qualifying scope in pseudo-destructor name");
2113 return error_mark_node;
2115 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2117 error ("qualified type %qT does not match destructor name ~%qT",
2119 return error_mark_node;
2123 /* [expr.pseudo] says both:
2125 The type designated by the pseudo-destructor-name shall be
2126 the same as the object type.
2130 The cv-unqualified versions of the object type and of the
2131 type designated by the pseudo-destructor-name shall be the
2134 We implement the more generous second sentence, since that is
2135 what most other compilers do. */
2136 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2139 error ("%qE is not of type %qT", object, destructor);
2140 return error_mark_node;
2144 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2147 /* Finish an expression of the form CODE EXPR. */
2150 finish_unary_op_expr (enum tree_code code, tree expr)
2152 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2153 /* Inside a template, build_x_unary_op does not fold the
2154 expression. So check whether the result is folded before
2155 setting TREE_NEGATED_INT. */
2156 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2157 && TREE_CODE (result) == INTEGER_CST
2158 && !TYPE_UNSIGNED (TREE_TYPE (result))
2159 && INT_CST_LT (result, integer_zero_node))
2161 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2162 setting TREE_NEGATED_INT. */
2163 result = copy_node (result);
2164 TREE_NEGATED_INT (result) = 1;
2166 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2167 overflow_warning (input_location, result);
2172 /* Finish a compound-literal expression. TYPE is the type to which
2173 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2176 finish_compound_literal (tree type, tree compound_literal)
2178 if (type == error_mark_node)
2179 return error_mark_node;
2181 if (!TYPE_OBJ_P (type))
2183 error ("compound literal of non-object type %qT", type);
2184 return error_mark_node;
2187 if (processing_template_decl)
2189 TREE_TYPE (compound_literal) = type;
2190 /* Mark the expression as a compound literal. */
2191 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2192 return compound_literal;
2195 type = complete_type (type);
2197 if (TYPE_NON_AGGREGATE_CLASS (type))
2199 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2200 everywhere that deals with function arguments would be a pain, so
2201 just wrap it in a TREE_LIST. The parser set a flag so we know
2202 that it came from T{} rather than T({}). */
2203 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2204 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2205 return build_functional_cast (type, compound_literal, tf_error);
2208 if (TREE_CODE (type) == ARRAY_TYPE
2209 && check_array_initializer (NULL_TREE, type, compound_literal))
2210 return error_mark_node;
2211 compound_literal = reshape_init (type, compound_literal);
2212 if (TREE_CODE (type) == ARRAY_TYPE)
2213 cp_complete_array_type (&type, compound_literal, false);
2214 compound_literal = digest_init (type, compound_literal);
2215 if ((!at_function_scope_p () || cp_type_readonly (type))
2216 && initializer_constant_valid_p (compound_literal, type))
2218 tree decl = create_temporary_var (type);
2219 DECL_INITIAL (decl) = compound_literal;
2220 TREE_STATIC (decl) = 1;
2221 decl = pushdecl_top_level (decl);
2222 DECL_NAME (decl) = make_anon_name ();
2223 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2227 return get_target_expr (compound_literal);
2230 /* Return the declaration for the function-name variable indicated by
2234 finish_fname (tree id)
2238 decl = fname_decl (input_location, C_RID_CODE (id), id);
2239 if (processing_template_decl)
2240 decl = DECL_NAME (decl);
2244 /* Finish a translation unit. */
2247 finish_translation_unit (void)
2249 /* In case there were missing closebraces,
2250 get us back to the global binding level. */
2252 while (current_namespace != global_namespace)
2255 /* Do file scope __FUNCTION__ et al. */
2256 finish_fname_decls ();
2259 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2260 Returns the parameter. */
2263 finish_template_type_parm (tree aggr, tree identifier)
2265 if (aggr != class_type_node)
2267 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2268 aggr = class_type_node;
2271 return build_tree_list (aggr, identifier);
2274 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2275 Returns the parameter. */
2278 finish_template_template_parm (tree aggr, tree identifier)
2280 tree decl = build_decl (input_location,
2281 TYPE_DECL, identifier, NULL_TREE);
2282 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2283 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2284 DECL_TEMPLATE_RESULT (tmpl) = decl;
2285 DECL_ARTIFICIAL (decl) = 1;
2286 end_template_decl ();
2288 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2290 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2291 /*is_primary=*/true, /*is_partial=*/false,
2294 return finish_template_type_parm (aggr, tmpl);
2297 /* ARGUMENT is the default-argument value for a template template
2298 parameter. If ARGUMENT is invalid, issue error messages and return
2299 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2302 check_template_template_default_arg (tree argument)
2304 if (TREE_CODE (argument) != TEMPLATE_DECL
2305 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2306 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2308 if (TREE_CODE (argument) == TYPE_DECL)
2309 error ("invalid use of type %qT as a default value for a template "
2310 "template-parameter", TREE_TYPE (argument));
2312 error ("invalid default argument for a template template parameter");
2313 return error_mark_node;
2319 /* Begin a class definition, as indicated by T. */
2322 begin_class_definition (tree t, tree attributes)
2324 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2325 return error_mark_node;
2327 if (processing_template_parmlist)
2329 error ("definition of %q#T inside template parameter list", t);
2330 return error_mark_node;
2332 /* A non-implicit typename comes from code like:
2334 template <typename T> struct A {
2335 template <typename U> struct A<T>::B ...
2337 This is erroneous. */
2338 else if (TREE_CODE (t) == TYPENAME_TYPE)
2340 error ("invalid definition of qualified type %qT", t);
2341 t = error_mark_node;
2344 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2346 t = make_class_type (RECORD_TYPE);
2347 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2350 /* Update the location of the decl. */
2351 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2353 if (TYPE_BEING_DEFINED (t))
2355 t = make_class_type (TREE_CODE (t));
2356 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2358 maybe_process_partial_specialization (t);
2360 TYPE_BEING_DEFINED (t) = 1;
2362 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2364 if (flag_pack_struct)
2367 TYPE_PACKED (t) = 1;
2368 /* Even though the type is being defined for the first time
2369 here, there might have been a forward declaration, so there
2370 might be cv-qualified variants of T. */
2371 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2372 TYPE_PACKED (v) = 1;
2374 /* Reset the interface data, at the earliest possible
2375 moment, as it might have been set via a class foo;
2377 if (! TYPE_ANONYMOUS_P (t))
2379 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2380 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2381 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2382 (t, finfo->interface_unknown);
2384 reset_specialization();
2386 /* Make a declaration for this class in its own scope. */
2387 build_self_reference ();
2392 /* Finish the member declaration given by DECL. */
2395 finish_member_declaration (tree decl)
2397 if (decl == error_mark_node || decl == NULL_TREE)
2400 if (decl == void_type_node)
2401 /* The COMPONENT was a friend, not a member, and so there's
2402 nothing for us to do. */
2405 /* We should see only one DECL at a time. */
2406 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2408 /* Set up access control for DECL. */
2410 = (current_access_specifier == access_private_node);
2411 TREE_PROTECTED (decl)
2412 = (current_access_specifier == access_protected_node);
2413 if (TREE_CODE (decl) == TEMPLATE_DECL)
2415 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2416 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2419 /* Mark the DECL as a member of the current class. */
2420 DECL_CONTEXT (decl) = current_class_type;
2422 /* Check for bare parameter packs in the member variable declaration. */
2423 if (TREE_CODE (decl) == FIELD_DECL)
2425 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2426 TREE_TYPE (decl) = error_mark_node;
2427 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2428 DECL_ATTRIBUTES (decl) = NULL_TREE;
2433 A C language linkage is ignored for the names of class members
2434 and the member function type of class member functions. */
2435 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2436 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2438 /* Put functions on the TYPE_METHODS list and everything else on the
2439 TYPE_FIELDS list. Note that these are built up in reverse order.
2440 We reverse them (to obtain declaration order) in finish_struct. */
2441 if (TREE_CODE (decl) == FUNCTION_DECL
2442 || DECL_FUNCTION_TEMPLATE_P (decl))
2444 /* We also need to add this function to the
2445 CLASSTYPE_METHOD_VEC. */
2446 if (add_method (current_class_type, decl, NULL_TREE))
2448 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2449 TYPE_METHODS (current_class_type) = decl;
2451 maybe_add_class_template_decl_list (current_class_type, decl,
2455 /* Enter the DECL into the scope of the class. */
2456 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2457 || pushdecl_class_level (decl))
2459 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2460 go at the beginning. The reason is that lookup_field_1
2461 searches the list in order, and we want a field name to
2462 override a type name so that the "struct stat hack" will
2463 work. In particular:
2465 struct S { enum E { }; int E } s;
2468 is valid. In addition, the FIELD_DECLs must be maintained in
2469 declaration order so that class layout works as expected.
2470 However, we don't need that order until class layout, so we
2471 save a little time by putting FIELD_DECLs on in reverse order
2472 here, and then reversing them in finish_struct_1. (We could
2473 also keep a pointer to the correct insertion points in the
2476 if (TREE_CODE (decl) == TYPE_DECL)
2477 TYPE_FIELDS (current_class_type)
2478 = chainon (TYPE_FIELDS (current_class_type), decl);
2481 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2482 TYPE_FIELDS (current_class_type) = decl;
2485 maybe_add_class_template_decl_list (current_class_type, decl,
2490 note_decl_for_pch (decl);
2493 /* DECL has been declared while we are building a PCH file. Perform
2494 actions that we might normally undertake lazily, but which can be
2495 performed now so that they do not have to be performed in
2496 translation units which include the PCH file. */
2499 note_decl_for_pch (tree decl)
2501 gcc_assert (pch_file);
2503 /* There's a good chance that we'll have to mangle names at some
2504 point, even if only for emission in debugging information. */
2505 if ((TREE_CODE (decl) == VAR_DECL
2506 || TREE_CODE (decl) == FUNCTION_DECL)
2507 && !processing_template_decl)
2511 /* Finish processing a complete template declaration. The PARMS are
2512 the template parameters. */
2515 finish_template_decl (tree parms)
2518 end_template_decl ();
2520 end_specialization ();
2523 /* Finish processing a template-id (which names a type) of the form
2524 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2525 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2526 the scope of template-id indicated. */
2529 finish_template_type (tree name, tree args, int entering_scope)
2533 decl = lookup_template_class (name, args,
2534 NULL_TREE, NULL_TREE, entering_scope,
2535 tf_warning_or_error | tf_user);
2536 if (decl != error_mark_node)
2537 decl = TYPE_STUB_DECL (decl);
2542 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2543 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2544 BASE_CLASS, or NULL_TREE if an error occurred. The
2545 ACCESS_SPECIFIER is one of
2546 access_{default,public,protected_private}_node. For a virtual base
2547 we set TREE_TYPE. */
2550 finish_base_specifier (tree base, tree access, bool virtual_p)
2554 if (base == error_mark_node)
2556 error ("invalid base-class specification");
2559 else if (! MAYBE_CLASS_TYPE_P (base))
2561 error ("%qT is not a class type", base);
2566 if (cp_type_quals (base) != 0)
2568 error ("base class %qT has cv qualifiers", base);
2569 base = TYPE_MAIN_VARIANT (base);
2571 result = build_tree_list (access, base);
2573 TREE_TYPE (result) = integer_type_node;
2579 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2580 what we found when we tried to do the lookup.
2581 LOCATION is the location of the NAME identifier;
2582 The location is used in the error message*/
2585 qualified_name_lookup_error (tree scope, tree name,
2586 tree decl, location_t location)
2588 if (scope == error_mark_node)
2589 ; /* We already complained. */
2590 else if (TYPE_P (scope))
2592 if (!COMPLETE_TYPE_P (scope))
2593 error_at (location, "incomplete type %qT used in nested name specifier",
2595 else if (TREE_CODE (decl) == TREE_LIST)
2597 error_at (location, "reference to %<%T::%D%> is ambiguous",
2599 print_candidates (decl);
2602 error_at (location, "%qD is not a member of %qT", name, scope);
2604 else if (scope != global_namespace)
2605 error_at (location, "%qD is not a member of %qD", name, scope);
2607 error_at (location, "%<::%D%> has not been declared", name);
2610 /* If FNS is a member function, a set of member functions, or a
2611 template-id referring to one or more member functions, return a
2612 BASELINK for FNS, incorporating the current access context.
2613 Otherwise, return FNS unchanged. */
2616 baselink_for_fns (tree fns)
2621 if (BASELINK_P (fns)
2622 || error_operand_p (fns))
2626 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2627 fn = TREE_OPERAND (fn, 0);
2628 fn = get_first_fn (fn);
2629 if (!DECL_FUNCTION_MEMBER_P (fn))
2632 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2634 cl = DECL_CONTEXT (fn);
2635 cl = TYPE_BINFO (cl);
2636 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2639 /* Returns true iff DECL is an automatic variable from a function outside
2643 outer_automatic_var_p (tree decl)
2645 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2646 && DECL_FUNCTION_SCOPE_P (decl)
2647 && !TREE_STATIC (decl)
2648 && DECL_CONTEXT (decl) != current_function_decl);
2651 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2652 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2653 if non-NULL, is the type or namespace used to explicitly qualify
2654 ID_EXPRESSION. DECL is the entity to which that name has been
2657 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2658 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2659 be set to true if this expression isn't permitted in a
2660 constant-expression, but it is otherwise not set by this function.
2661 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2662 constant-expression, but a non-constant expression is also
2665 DONE is true if this expression is a complete postfix-expression;
2666 it is false if this expression is followed by '->', '[', '(', etc.
2667 ADDRESS_P is true iff this expression is the operand of '&'.
2668 TEMPLATE_P is true iff the qualified-id was of the form
2669 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2670 appears as a template argument.
2672 If an error occurs, and it is the kind of error that might cause
2673 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2674 is the caller's responsibility to issue the message. *ERROR_MSG
2675 will be a string with static storage duration, so the caller need
2678 Return an expression for the entity, after issuing appropriate
2679 diagnostics. This function is also responsible for transforming a
2680 reference to a non-static member into a COMPONENT_REF that makes
2681 the use of "this" explicit.
2683 Upon return, *IDK will be filled in appropriately. */
2685 finish_id_expression (tree id_expression,
2689 bool integral_constant_expression_p,
2690 bool allow_non_integral_constant_expression_p,
2691 bool *non_integral_constant_expression_p,
2695 bool template_arg_p,
2696 const char **error_msg,
2697 location_t location)
2699 /* Initialize the output parameters. */
2700 *idk = CP_ID_KIND_NONE;
2703 if (id_expression == error_mark_node)
2704 return error_mark_node;
2705 /* If we have a template-id, then no further lookup is
2706 required. If the template-id was for a template-class, we
2707 will sometimes have a TYPE_DECL at this point. */
2708 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2709 || TREE_CODE (decl) == TYPE_DECL)
2711 /* Look up the name. */
2714 if (decl == error_mark_node)
2716 /* Name lookup failed. */
2719 || (!dependent_type_p (scope)
2720 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2721 && IDENTIFIER_TYPENAME_P (id_expression)
2722 && dependent_type_p (TREE_TYPE (id_expression))))))
2724 /* If the qualifying type is non-dependent (and the name
2725 does not name a conversion operator to a dependent
2726 type), issue an error. */
2727 qualified_name_lookup_error (scope, id_expression, decl, location);
2728 return error_mark_node;
2732 /* It may be resolved via Koenig lookup. */
2733 *idk = CP_ID_KIND_UNQUALIFIED;
2734 return id_expression;
2737 decl = id_expression;
2739 /* If DECL is a variable that would be out of scope under
2740 ANSI/ISO rules, but in scope in the ARM, name lookup
2741 will succeed. Issue a diagnostic here. */
2743 decl = check_for_out_of_scope_variable (decl);
2745 /* Remember that the name was used in the definition of
2746 the current class so that we can check later to see if
2747 the meaning would have been different after the class
2748 was entirely defined. */
2749 if (!scope && decl != error_mark_node)
2750 maybe_note_name_used_in_class (id_expression, decl);
2752 /* Disallow uses of local variables from containing functions, except
2753 within lambda-expressions. */
2754 if (outer_automatic_var_p (decl)
2755 /* It's not a use (3.2) if we're in an unevaluated context. */
2756 && !cp_unevaluated_operand)
2758 tree context = DECL_CONTEXT (decl);
2759 tree containing_function = current_function_decl;
2760 tree lambda_stack = NULL_TREE;
2761 tree lambda_expr = NULL_TREE;
2763 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2764 support for an approach in which a reference to a local
2765 [constant] automatic variable in a nested class or lambda body
2766 would enter the expression as an rvalue, which would reduce
2767 the complexity of the problem"
2769 FIXME update for final resolution of core issue 696. */
2770 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2771 return integral_constant_value (decl);
2773 /* If we are in a lambda function, we can move out until we hit
2775 2. a non-lambda function, or
2776 3. a non-default capturing lambda function. */
2777 while (context != containing_function
2778 && LAMBDA_FUNCTION_P (containing_function))
2780 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2781 (DECL_CONTEXT (containing_function));
2783 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2787 lambda_stack = tree_cons (NULL_TREE,
2792 = decl_function_context (containing_function);
2795 if (context == containing_function)
2797 decl = add_default_capture (lambda_stack,
2798 /*id=*/DECL_NAME (decl),
2799 /*initializer=*/decl);
2801 else if (lambda_expr)
2803 error ("%qD is not captured", decl);
2804 return error_mark_node;
2808 error (TREE_CODE (decl) == VAR_DECL
2809 ? "use of %<auto%> variable from containing function"
2810 : "use of parameter from containing function");
2811 error (" %q+#D declared here", decl);
2812 return error_mark_node;
2817 /* If we didn't find anything, or what we found was a type,
2818 then this wasn't really an id-expression. */
2819 if (TREE_CODE (decl) == TEMPLATE_DECL
2820 && !DECL_FUNCTION_TEMPLATE_P (decl))
2822 *error_msg = "missing template arguments";
2823 return error_mark_node;
2825 else if (TREE_CODE (decl) == TYPE_DECL
2826 || TREE_CODE (decl) == NAMESPACE_DECL)
2828 *error_msg = "expected primary-expression";
2829 return error_mark_node;
2832 /* If the name resolved to a template parameter, there is no
2833 need to look it up again later. */
2834 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2835 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2839 *idk = CP_ID_KIND_NONE;
2840 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2841 decl = TEMPLATE_PARM_DECL (decl);
2842 r = convert_from_reference (DECL_INITIAL (decl));
2844 if (integral_constant_expression_p
2845 && !dependent_type_p (TREE_TYPE (decl))
2846 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2848 if (!allow_non_integral_constant_expression_p)
2849 error ("template parameter %qD of type %qT is not allowed in "
2850 "an integral constant expression because it is not of "
2851 "integral or enumeration type", decl, TREE_TYPE (decl));
2852 *non_integral_constant_expression_p = true;
2856 /* Similarly, we resolve enumeration constants to their
2857 underlying values. */
2858 else if (TREE_CODE (decl) == CONST_DECL)
2860 *idk = CP_ID_KIND_NONE;
2861 if (!processing_template_decl)
2863 used_types_insert (TREE_TYPE (decl));
2864 return DECL_INITIAL (decl);
2872 /* If the declaration was explicitly qualified indicate
2873 that. The semantics of `A::f(3)' are different than
2874 `f(3)' if `f' is virtual. */
2876 ? CP_ID_KIND_QUALIFIED
2877 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2878 ? CP_ID_KIND_TEMPLATE_ID
2879 : CP_ID_KIND_UNQUALIFIED));
2884 An id-expression is type-dependent if it contains an
2885 identifier that was declared with a dependent type.
2887 The standard is not very specific about an id-expression that
2888 names a set of overloaded functions. What if some of them
2889 have dependent types and some of them do not? Presumably,
2890 such a name should be treated as a dependent name. */
2891 /* Assume the name is not dependent. */
2892 dependent_p = false;
2893 if (!processing_template_decl)
2894 /* No names are dependent outside a template. */
2896 /* A template-id where the name of the template was not resolved
2897 is definitely dependent. */
2898 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2899 && (TREE_CODE (TREE_OPERAND (decl, 0))
2900 == IDENTIFIER_NODE))
2902 /* For anything except an overloaded function, just check its
2904 else if (!is_overloaded_fn (decl))
2906 = dependent_type_p (TREE_TYPE (decl));
2907 /* For a set of overloaded functions, check each of the
2913 if (BASELINK_P (fns))
2914 fns = BASELINK_FUNCTIONS (fns);
2916 /* For a template-id, check to see if the template
2917 arguments are dependent. */
2918 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2920 tree args = TREE_OPERAND (fns, 1);
2921 dependent_p = any_dependent_template_arguments_p (args);
2922 /* The functions are those referred to by the
2924 fns = TREE_OPERAND (fns, 0);
2927 /* If there are no dependent template arguments, go through
2928 the overloaded functions. */
2929 while (fns && !dependent_p)
2931 tree fn = OVL_CURRENT (fns);
2933 /* Member functions of dependent classes are
2935 if (TREE_CODE (fn) == FUNCTION_DECL
2936 && type_dependent_expression_p (fn))
2938 else if (TREE_CODE (fn) == TEMPLATE_DECL
2939 && dependent_template_p (fn))
2942 fns = OVL_NEXT (fns);
2946 /* If the name was dependent on a template parameter, we will
2947 resolve the name at instantiation time. */
2950 /* Create a SCOPE_REF for qualified names, if the scope is
2956 if (address_p && done)
2957 decl = finish_qualified_id_expr (scope, decl,
2963 tree type = NULL_TREE;
2964 if (DECL_P (decl) && !dependent_scope_p (scope))
2965 type = TREE_TYPE (decl);
2966 decl = build_qualified_name (type,
2972 if (TREE_TYPE (decl))
2973 decl = convert_from_reference (decl);
2976 /* A TEMPLATE_ID already contains all the information we
2978 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2979 return id_expression;
2980 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2981 /* If we found a variable, then name lookup during the
2982 instantiation will always resolve to the same VAR_DECL
2983 (or an instantiation thereof). */
2984 if (TREE_CODE (decl) == VAR_DECL
2985 || TREE_CODE (decl) == PARM_DECL)
2986 return convert_from_reference (decl);
2987 /* The same is true for FIELD_DECL, but we also need to
2988 make sure that the syntax is correct. */
2989 else if (TREE_CODE (decl) == FIELD_DECL)
2991 /* Since SCOPE is NULL here, this is an unqualified name.
2992 Access checking has been performed during name lookup
2993 already. Turn off checking to avoid duplicate errors. */
2994 push_deferring_access_checks (dk_no_check);
2995 decl = finish_non_static_data_member
2996 (decl, current_class_ref,
2997 /*qualifying_scope=*/NULL_TREE);
2998 pop_deferring_access_checks ();
3001 return id_expression;
3004 /* Only certain kinds of names are allowed in constant
3005 expression. Enumerators and template parameters have already
3006 been handled above. */
3007 if (integral_constant_expression_p
3008 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
3009 && ! builtin_valid_in_constant_expr_p (decl))
3011 if (!allow_non_integral_constant_expression_p)
3013 error ("%qD cannot appear in a constant-expression", decl);
3014 return error_mark_node;
3016 *non_integral_constant_expression_p = true;
3019 if (TREE_CODE (decl) == NAMESPACE_DECL)
3021 error ("use of namespace %qD as expression", decl);
3022 return error_mark_node;
3024 else if (DECL_CLASS_TEMPLATE_P (decl))
3026 error ("use of class template %qT as expression", decl);
3027 return error_mark_node;
3029 else if (TREE_CODE (decl) == TREE_LIST)
3031 /* Ambiguous reference to base members. */
3032 error ("request for member %qD is ambiguous in "
3033 "multiple inheritance lattice", id_expression);
3034 print_candidates (decl);
3035 return error_mark_node;
3038 /* Mark variable-like entities as used. Functions are similarly
3039 marked either below or after overload resolution. */
3040 if (TREE_CODE (decl) == VAR_DECL
3041 || TREE_CODE (decl) == PARM_DECL
3042 || TREE_CODE (decl) == RESULT_DECL)
3047 decl = (adjust_result_of_qualified_name_lookup
3048 (decl, scope, current_class_type));
3050 if (TREE_CODE (decl) == FUNCTION_DECL)
3053 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3054 decl = finish_qualified_id_expr (scope,
3062 tree r = convert_from_reference (decl);
3064 if (processing_template_decl && TYPE_P (scope))
3065 r = build_qualified_name (TREE_TYPE (r),
3071 else if (TREE_CODE (decl) == FIELD_DECL)
3073 /* Since SCOPE is NULL here, this is an unqualified name.
3074 Access checking has been performed during name lookup
3075 already. Turn off checking to avoid duplicate errors. */
3076 push_deferring_access_checks (dk_no_check);
3077 decl = finish_non_static_data_member (decl, current_class_ref,
3078 /*qualifying_scope=*/NULL_TREE);
3079 pop_deferring_access_checks ();
3081 else if (is_overloaded_fn (decl))
3086 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
3087 first_fn = TREE_OPERAND (first_fn, 0);
3088 first_fn = get_first_fn (first_fn);
3089 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3090 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3092 if (!really_overloaded_fn (decl))
3093 mark_used (first_fn);
3096 && TREE_CODE (first_fn) == FUNCTION_DECL
3097 && DECL_FUNCTION_MEMBER_P (first_fn)
3098 && !shared_member_p (decl))
3100 /* A set of member functions. */
3101 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3102 return finish_class_member_access_expr (decl, id_expression,
3103 /*template_p=*/false,
3104 tf_warning_or_error);
3107 decl = baselink_for_fns (decl);
3111 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3112 && DECL_CLASS_SCOPE_P (decl))
3114 tree context = context_for_name_lookup (decl);
3115 if (context != current_class_type)
3117 tree path = currently_open_derived_class (context);
3118 perform_or_defer_access_check (TYPE_BINFO (path),
3123 decl = convert_from_reference (decl);
3127 if (TREE_DEPRECATED (decl))
3128 warn_deprecated_use (decl, NULL_TREE);
3133 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3134 use as a type-specifier. */
3137 finish_typeof (tree expr)
3141 if (type_dependent_expression_p (expr))
3143 type = cxx_make_type (TYPEOF_TYPE);
3144 TYPEOF_TYPE_EXPR (type) = expr;
3145 SET_TYPE_STRUCTURAL_EQUALITY (type);
3150 type = unlowered_expr_type (expr);
3152 if (!type || type == unknown_type_node)
3154 error ("type of %qE is unknown", expr);
3155 return error_mark_node;
3161 /* Perform C++-specific checks for __builtin_offsetof before calling
3165 finish_offsetof (tree expr)
3167 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3169 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3170 TREE_OPERAND (expr, 2));
3171 return error_mark_node;
3173 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3174 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3175 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3177 if (TREE_CODE (expr) == COMPONENT_REF
3178 || TREE_CODE (expr) == COMPOUND_EXPR)
3179 expr = TREE_OPERAND (expr, 1);
3180 error ("cannot apply %<offsetof%> to member function %qD", expr);
3181 return error_mark_node;
3183 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3184 expr = TREE_OPERAND (expr, 0);
3185 return fold_offsetof (expr, NULL_TREE);
3188 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3189 function is broken out from the above for the benefit of the tree-ssa
3193 simplify_aggr_init_expr (tree *tp)
3195 tree aggr_init_expr = *tp;
3197 /* Form an appropriate CALL_EXPR. */
3198 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3199 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3200 tree type = TREE_TYPE (slot);
3203 enum style_t { ctor, arg, pcc } style;
3205 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3207 #ifdef PCC_STATIC_STRUCT_RETURN
3213 gcc_assert (TREE_ADDRESSABLE (type));
3217 call_expr = build_call_array_loc (input_location,
3218 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3220 aggr_init_expr_nargs (aggr_init_expr),
3221 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3225 /* Replace the first argument to the ctor with the address of the
3227 cxx_mark_addressable (slot);
3228 CALL_EXPR_ARG (call_expr, 0) =
3229 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3231 else if (style == arg)
3233 /* Just mark it addressable here, and leave the rest to
3234 expand_call{,_inline}. */
3235 cxx_mark_addressable (slot);
3236 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3237 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3239 else if (style == pcc)
3241 /* If we're using the non-reentrant PCC calling convention, then we
3242 need to copy the returned value out of the static buffer into the
3244 push_deferring_access_checks (dk_no_check);
3245 call_expr = build_aggr_init (slot, call_expr,
3246 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3247 tf_warning_or_error);
3248 pop_deferring_access_checks ();
3249 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3252 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3254 tree init = build_zero_init (type, NULL_TREE,
3255 /*static_storage_p=*/false);
3256 init = build2 (INIT_EXPR, void_type_node, slot, init);
3257 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3264 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3267 emit_associated_thunks (tree fn)
3269 /* When we use vcall offsets, we emit thunks with the virtual
3270 functions to which they thunk. The whole point of vcall offsets
3271 is so that you can know statically the entire set of thunks that
3272 will ever be needed for a given virtual function, thereby
3273 enabling you to output all the thunks with the function itself. */
3274 if (DECL_VIRTUAL_P (fn)
3275 /* Do not emit thunks for extern template instantiations. */
3276 && ! DECL_REALLY_EXTERN (fn))
3280 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3282 if (!THUNK_ALIAS (thunk))
3284 use_thunk (thunk, /*emit_p=*/1);
3285 if (DECL_RESULT_THUNK_P (thunk))
3289 for (probe = DECL_THUNKS (thunk);
3290 probe; probe = TREE_CHAIN (probe))
3291 use_thunk (probe, /*emit_p=*/1);
3295 gcc_assert (!DECL_THUNKS (thunk));
3300 /* Generate RTL for FN. */
3303 expand_or_defer_fn (tree fn)
3305 /* When the parser calls us after finishing the body of a template
3306 function, we don't really want to expand the body. */
3307 if (processing_template_decl)
3309 /* Normally, collection only occurs in rest_of_compilation. So,
3310 if we don't collect here, we never collect junk generated
3311 during the processing of templates until we hit a
3312 non-template function. It's not safe to do this inside a
3313 nested class, though, as the parser may have local state that
3314 is not a GC root. */
3315 if (!function_depth)
3320 gcc_assert (DECL_SAVED_TREE (fn));
3322 /* If this is a constructor or destructor body, we have to clone
3324 if (maybe_clone_body (fn))
3326 /* We don't want to process FN again, so pretend we've written
3327 it out, even though we haven't. */
3328 TREE_ASM_WRITTEN (fn) = 1;
3329 DECL_SAVED_TREE (fn) = NULL_TREE;
3333 /* We make a decision about linkage for these functions at the end
3334 of the compilation. Until that point, we do not want the back
3335 end to output them -- but we do want it to see the bodies of
3336 these functions so that it can inline them as appropriate. */
3337 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3339 if (DECL_INTERFACE_KNOWN (fn))
3340 /* We've already made a decision as to how this function will
3344 DECL_EXTERNAL (fn) = 1;
3345 DECL_NOT_REALLY_EXTERN (fn) = 1;
3346 note_vague_linkage_fn (fn);
3347 /* A non-template inline function with external linkage will
3348 always be COMDAT. As we must eventually determine the
3349 linkage of all functions, and as that causes writes to
3350 the data mapped in from the PCH file, it's advantageous
3351 to mark the functions at this point. */
3352 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3354 /* This function must have external linkage, as
3355 otherwise DECL_INTERFACE_KNOWN would have been
3357 gcc_assert (TREE_PUBLIC (fn));
3358 comdat_linkage (fn);
3359 DECL_INTERFACE_KNOWN (fn) = 1;
3363 import_export_decl (fn);
3365 /* If the user wants us to keep all inline functions, then mark
3366 this function as needed so that finish_file will make sure to
3367 output it later. Similarly, all dllexport'd functions must
3368 be emitted; there may be callers in other DLLs. */
3369 if ((flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3370 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3374 /* There's no reason to do any of the work here if we're only doing
3375 semantic analysis; this code just generates RTL. */
3376 if (flag_syntax_only)
3381 /* Expand or defer, at the whim of the compilation unit manager. */
3382 cgraph_finalize_function (fn, function_depth > 1);
3394 /* Helper function for walk_tree, used by finalize_nrv below. */
3397 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3399 struct nrv_data *dp = (struct nrv_data *)data;
3402 /* No need to walk into types. There wouldn't be any need to walk into
3403 non-statements, except that we have to consider STMT_EXPRs. */
3406 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3407 but differs from using NULL_TREE in that it indicates that we care
3408 about the value of the RESULT_DECL. */
3409 else if (TREE_CODE (*tp) == RETURN_EXPR)
3410 TREE_OPERAND (*tp, 0) = dp->result;
3411 /* Change all cleanups for the NRV to only run when an exception is
3413 else if (TREE_CODE (*tp) == CLEANUP_STMT
3414 && CLEANUP_DECL (*tp) == dp->var)
3415 CLEANUP_EH_ONLY (*tp) = 1;
3416 /* Replace the DECL_EXPR for the NRV with an initialization of the
3417 RESULT_DECL, if needed. */
3418 else if (TREE_CODE (*tp) == DECL_EXPR
3419 && DECL_EXPR_DECL (*tp) == dp->var)
3422 if (DECL_INITIAL (dp->var)
3423 && DECL_INITIAL (dp->var) != error_mark_node)
3424 init = build2 (INIT_EXPR, void_type_node, dp->result,
3425 DECL_INITIAL (dp->var));
3427 init = build_empty_stmt (EXPR_LOCATION (*tp));
3428 DECL_INITIAL (dp->var) = NULL_TREE;
3429 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3432 /* And replace all uses of the NRV with the RESULT_DECL. */
3433 else if (*tp == dp->var)
3436 /* Avoid walking into the same tree more than once. Unfortunately, we
3437 can't just use walk_tree_without duplicates because it would only call
3438 us for the first occurrence of dp->var in the function body. */
3439 slot = htab_find_slot (dp->visited, *tp, INSERT);
3445 /* Keep iterating. */
3449 /* Called from finish_function to implement the named return value
3450 optimization by overriding all the RETURN_EXPRs and pertinent
3451 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3452 RESULT_DECL for the function. */
3455 finalize_nrv (tree *tp, tree var, tree result)
3457 struct nrv_data data;
3459 /* Copy debugging information from VAR to RESULT. */
3460 DECL_NAME (result) = DECL_NAME (var);
3461 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3462 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3463 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3464 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3465 /* Don't forget that we take its address. */
3466 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3469 data.result = result;
3470 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3471 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3472 htab_delete (data.visited);
3475 /* Return the declaration for the function called by CALL_EXPR T,
3476 TYPE is the class type of the clause decl. */
3479 omp_clause_info_fndecl (tree t, tree type)
3481 tree ret = get_callee_fndecl (t);
3486 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3487 t = CALL_EXPR_FN (t);
3489 if (TREE_CODE (t) == OBJ_TYPE_REF)
3491 t = cp_fold_obj_type_ref (t, type);
3492 if (TREE_CODE (t) == ADDR_EXPR
3493 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3494 return TREE_OPERAND (t, 0);
3500 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3503 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3504 bool need_copy_ctor, bool need_copy_assignment)
3506 int save_errorcount = errorcount;
3509 /* Always allocate 3 elements for simplicity. These are the
3510 function decls for the ctor, dtor, and assignment op.
3511 This layout is known to the three lang hooks,
3512 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3513 and cxx_omp_clause_assign_op. */
3514 info = make_tree_vec (3);
3515 CP_OMP_CLAUSE_INFO (c) = info;
3517 if (need_default_ctor
3518 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3522 if (need_default_ctor)
3526 t = build_int_cst (build_pointer_type (type), 0);
3527 t = build1 (INDIRECT_REF, type, t);
3528 vec = make_tree_vector_single (t);
3530 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3531 &vec, type, LOOKUP_NORMAL,
3532 tf_warning_or_error);
3535 release_tree_vector (vec);
3537 if (targetm.cxx.cdtor_returns_this () || errorcount)
3538 /* Because constructors and destructors return this,
3539 the call will have been cast to "void". Remove the
3540 cast here. We would like to use STRIP_NOPS, but it
3541 wouldn't work here because TYPE_MODE (t) and
3542 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3543 They are VOIDmode and Pmode, respectively. */
3544 if (TREE_CODE (t) == NOP_EXPR)
3545 t = TREE_OPERAND (t, 0);
3547 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3550 if ((need_default_ctor || need_copy_ctor)
3551 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3553 t = build_int_cst (build_pointer_type (type), 0);
3554 t = build1 (INDIRECT_REF, type, t);
3555 t = build_special_member_call (t, complete_dtor_identifier,
3556 NULL, type, LOOKUP_NORMAL,
3557 tf_warning_or_error);
3559 if (targetm.cxx.cdtor_returns_this () || errorcount)
3560 /* Because constructors and destructors return this,
3561 the call will have been cast to "void". Remove the
3562 cast here. We would like to use STRIP_NOPS, but it
3563 wouldn't work here because TYPE_MODE (t) and
3564 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3565 They are VOIDmode and Pmode, respectively. */
3566 if (TREE_CODE (t) == NOP_EXPR)
3567 t = TREE_OPERAND (t, 0);
3569 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3572 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3576 t = build_int_cst (build_pointer_type (type), 0);
3577 t = build1 (INDIRECT_REF, type, t);
3578 vec = make_tree_vector_single (t);
3579 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3580 &vec, type, LOOKUP_NORMAL,
3581 tf_warning_or_error);
3582 release_tree_vector (vec);
3584 /* We'll have called convert_from_reference on the call, which
3585 may well have added an indirect_ref. It's unneeded here,
3586 and in the way, so kill it. */
3587 if (TREE_CODE (t) == INDIRECT_REF)
3588 t = TREE_OPERAND (t, 0);
3590 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3593 return errorcount != save_errorcount;
3596 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3597 Remove any elements from the list that are invalid. */
3600 finish_omp_clauses (tree clauses)
3602 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3603 tree c, t, *pc = &clauses;
3606 bitmap_obstack_initialize (NULL);
3607 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3608 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3609 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3611 for (pc = &clauses, c = clauses; c ; c = *pc)
3613 bool remove = false;
3615 switch (OMP_CLAUSE_CODE (c))
3617 case OMP_CLAUSE_SHARED:
3619 goto check_dup_generic;
3620 case OMP_CLAUSE_PRIVATE:
3622 goto check_dup_generic;
3623 case OMP_CLAUSE_REDUCTION:
3625 goto check_dup_generic;
3626 case OMP_CLAUSE_COPYPRIVATE:
3627 name = "copyprivate";
3628 goto check_dup_generic;
3629 case OMP_CLAUSE_COPYIN:
3631 goto check_dup_generic;
3633 t = OMP_CLAUSE_DECL (c);
3634 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3636 if (processing_template_decl)
3639 error ("%qD is not a variable in clause %qs", t, name);
3641 error ("%qE is not a variable in clause %qs", t, name);
3644 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3645 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3646 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3648 error ("%qD appears more than once in data clauses", t);
3652 bitmap_set_bit (&generic_head, DECL_UID (t));
3655 case OMP_CLAUSE_FIRSTPRIVATE:
3656 t = OMP_CLAUSE_DECL (c);
3657 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3659 if (processing_template_decl)
3662 error ("%qD is not a variable in clause %<firstprivate%>", t);
3664 error ("%qE is not a variable in clause %<firstprivate%>", t);
3667 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3668 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3670 error ("%qD appears more than once in data clauses", t);
3674 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3677 case OMP_CLAUSE_LASTPRIVATE:
3678 t = OMP_CLAUSE_DECL (c);
3679 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3681 if (processing_template_decl)
3684 error ("%qD is not a variable in clause %<lastprivate%>", t);
3686 error ("%qE is not a variable in clause %<lastprivate%>", t);
3689 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3690 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3692 error ("%qD appears more than once in data clauses", t);
3696 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3700 t = OMP_CLAUSE_IF_EXPR (c);
3701 t = maybe_convert_cond (t);
3702 if (t == error_mark_node)
3704 OMP_CLAUSE_IF_EXPR (c) = t;
3707 case OMP_CLAUSE_NUM_THREADS:
3708 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3709 if (t == error_mark_node)
3711 else if (!type_dependent_expression_p (t)
3712 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3714 error ("num_threads expression must be integral");
3719 case OMP_CLAUSE_SCHEDULE:
3720 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3723 else if (t == error_mark_node)
3725 else if (!type_dependent_expression_p (t)
3726 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3728 error ("schedule chunk size expression must be integral");
3733 case OMP_CLAUSE_NOWAIT:
3734 case OMP_CLAUSE_ORDERED:
3735 case OMP_CLAUSE_DEFAULT:
3736 case OMP_CLAUSE_UNTIED:
3737 case OMP_CLAUSE_COLLAPSE:
3745 *pc = OMP_CLAUSE_CHAIN (c);
3747 pc = &OMP_CLAUSE_CHAIN (c);
3750 for (pc = &clauses, c = clauses; c ; c = *pc)
3752 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3753 bool remove = false;
3754 bool need_complete_non_reference = false;
3755 bool need_default_ctor = false;
3756 bool need_copy_ctor = false;
3757 bool need_copy_assignment = false;
3758 bool need_implicitly_determined = false;
3759 tree type, inner_type;
3763 case OMP_CLAUSE_SHARED:
3765 need_implicitly_determined = true;
3767 case OMP_CLAUSE_PRIVATE:
3769 need_complete_non_reference = true;
3770 need_default_ctor = true;
3771 need_implicitly_determined = true;
3773 case OMP_CLAUSE_FIRSTPRIVATE:
3774 name = "firstprivate";
3775 need_complete_non_reference = true;
3776 need_copy_ctor = true;
3777 need_implicitly_determined = true;
3779 case OMP_CLAUSE_LASTPRIVATE:
3780 name = "lastprivate";
3781 need_complete_non_reference = true;
3782 need_copy_assignment = true;
3783 need_implicitly_determined = true;
3785 case OMP_CLAUSE_REDUCTION:
3787 need_implicitly_determined = true;
3789 case OMP_CLAUSE_COPYPRIVATE:
3790 name = "copyprivate";
3791 need_copy_assignment = true;
3793 case OMP_CLAUSE_COPYIN:
3795 need_copy_assignment = true;
3798 pc = &OMP_CLAUSE_CHAIN (c);
3802 t = OMP_CLAUSE_DECL (c);
3803 if (processing_template_decl
3804 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3806 pc = &OMP_CLAUSE_CHAIN (c);
3812 case OMP_CLAUSE_LASTPRIVATE:
3813 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3814 need_default_ctor = true;
3817 case OMP_CLAUSE_REDUCTION:
3818 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3819 || POINTER_TYPE_P (TREE_TYPE (t)))
3821 error ("%qE has invalid type for %<reduction%>", t);
3824 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3826 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3834 error ("%qE has invalid type for %<reduction(%s)%>",
3835 t, operator_name_info[r_code].name);
3841 case OMP_CLAUSE_COPYIN:
3842 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3844 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3853 if (need_complete_non_reference)
3855 t = require_complete_type (t);
3856 if (t == error_mark_node)
3858 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3860 error ("%qE has reference type for %qs", t, name);
3864 if (need_implicitly_determined)
3866 const char *share_name = NULL;
3868 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3869 share_name = "threadprivate";
3870 else switch (cxx_omp_predetermined_sharing (t))
3872 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3874 case OMP_CLAUSE_DEFAULT_SHARED:
3875 share_name = "shared";
3877 case OMP_CLAUSE_DEFAULT_PRIVATE:
3878 share_name = "private";
3885 error ("%qE is predetermined %qs for %qs",
3886 t, share_name, name);
3891 /* We're interested in the base element, not arrays. */
3892 inner_type = type = TREE_TYPE (t);
3893 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3894 inner_type = TREE_TYPE (inner_type);
3896 /* Check for special function availability by building a call to one.
3897 Save the results, because later we won't be in the right context
3898 for making these queries. */
3899 if (CLASS_TYPE_P (inner_type)
3900 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3901 && !type_dependent_expression_p (t)
3902 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3903 need_copy_ctor, need_copy_assignment))
3907 *pc = OMP_CLAUSE_CHAIN (c);
3909 pc = &OMP_CLAUSE_CHAIN (c);
3912 bitmap_obstack_release (NULL);
3916 /* For all variables in the tree_list VARS, mark them as thread local. */
3919 finish_omp_threadprivate (tree vars)
3923 /* Mark every variable in VARS to be assigned thread local storage. */
3924 for (t = vars; t; t = TREE_CHAIN (t))
3926 tree v = TREE_PURPOSE (t);
3928 if (error_operand_p (v))
3930 else if (TREE_CODE (v) != VAR_DECL)
3931 error ("%<threadprivate%> %qD is not file, namespace "
3932 "or block scope variable", v);
3933 /* If V had already been marked threadprivate, it doesn't matter
3934 whether it had been used prior to this point. */
3935 else if (TREE_USED (v)
3936 && (DECL_LANG_SPECIFIC (v) == NULL
3937 || !CP_DECL_THREADPRIVATE_P (v)))
3938 error ("%qE declared %<threadprivate%> after first use", v);
3939 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3940 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3941 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3942 error ("%<threadprivate%> %qE has incomplete type", v);
3943 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3944 && CP_DECL_CONTEXT (v) != current_class_type)
3945 error ("%<threadprivate%> %qE directive not "
3946 "in %qT definition", v, CP_DECL_CONTEXT (v));
3949 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3950 if (DECL_LANG_SPECIFIC (v) == NULL)
3952 retrofit_lang_decl (v);
3954 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3955 after the allocation of the lang_decl structure. */
3956 if (DECL_DISCRIMINATOR_P (v))
3957 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
3960 if (! DECL_THREAD_LOCAL_P (v))
3962 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3963 /* If rtl has been already set for this var, call
3964 make_decl_rtl once again, so that encode_section_info
3965 has a chance to look at the new decl flags. */
3966 if (DECL_RTL_SET_P (v))
3969 CP_DECL_THREADPRIVATE_P (v) = 1;
3974 /* Build an OpenMP structured block. */
3977 begin_omp_structured_block (void)
3979 return do_pushlevel (sk_omp);
3983 finish_omp_structured_block (tree block)
3985 return do_poplevel (block);
3988 /* Similarly, except force the retention of the BLOCK. */
3991 begin_omp_parallel (void)
3993 keep_next_level (true);
3994 return begin_omp_structured_block ();
3998 finish_omp_parallel (tree clauses, tree body)
4002 body = finish_omp_structured_block (body);
4004 stmt = make_node (OMP_PARALLEL);
4005 TREE_TYPE (stmt) = void_type_node;
4006 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4007 OMP_PARALLEL_BODY (stmt) = body;
4009 return add_stmt (stmt);
4013 begin_omp_task (void)
4015 keep_next_level (true);
4016 return begin_omp_structured_block ();
4020 finish_omp_task (tree clauses, tree body)
4024 body = finish_omp_structured_block (body);
4026 stmt = make_node (OMP_TASK);
4027 TREE_TYPE (stmt) = void_type_node;
4028 OMP_TASK_CLAUSES (stmt) = clauses;
4029 OMP_TASK_BODY (stmt) = body;
4031 return add_stmt (stmt);
4034 /* Helper function for finish_omp_for. Convert Ith random access iterator
4035 into integral iterator. Return FALSE if successful. */
4038 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4039 tree condv, tree incrv, tree *body,
4040 tree *pre_body, tree clauses)
4042 tree diff, iter_init, iter_incr = NULL, last;
4043 tree incr_var = NULL, orig_pre_body, orig_body, c;
4044 tree decl = TREE_VEC_ELT (declv, i);
4045 tree init = TREE_VEC_ELT (initv, i);
4046 tree cond = TREE_VEC_ELT (condv, i);
4047 tree incr = TREE_VEC_ELT (incrv, i);
4049 location_t elocus = locus;
4051 if (init && EXPR_HAS_LOCATION (init))
4052 elocus = EXPR_LOCATION (init);
4054 switch (TREE_CODE (cond))
4060 if (TREE_OPERAND (cond, 1) == iter)
4061 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4062 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4063 if (TREE_OPERAND (cond, 0) != iter)
4064 cond = error_mark_node;
4067 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4068 TREE_OPERAND (cond, 1), ERROR_MARK,
4069 NULL, tf_warning_or_error);
4070 if (error_operand_p (tem))
4075 cond = error_mark_node;
4078 if (cond == error_mark_node)
4080 error_at (elocus, "invalid controlling predicate");
4083 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4084 ERROR_MARK, iter, ERROR_MARK, NULL,
4085 tf_warning_or_error);
4086 if (error_operand_p (diff))
4088 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4090 error_at (elocus, "difference between %qE and %qD does not have integer type",
4091 TREE_OPERAND (cond, 1), iter);
4095 switch (TREE_CODE (incr))
4097 case PREINCREMENT_EXPR:
4098 case PREDECREMENT_EXPR:
4099 case POSTINCREMENT_EXPR:
4100 case POSTDECREMENT_EXPR:
4101 if (TREE_OPERAND (incr, 0) != iter)
4103 incr = error_mark_node;
4106 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4107 tf_warning_or_error);
4108 if (error_operand_p (iter_incr))
4110 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4111 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4112 incr = integer_one_node;
4114 incr = integer_minus_one_node;
4117 if (TREE_OPERAND (incr, 0) != iter)
4118 incr = error_mark_node;
4119 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4120 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4122 tree rhs = TREE_OPERAND (incr, 1);
4123 if (TREE_OPERAND (rhs, 0) == iter)
4125 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4127 incr = error_mark_node;
4130 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4131 TREE_OPERAND (rhs, 1),
4132 tf_warning_or_error);
4133 if (error_operand_p (iter_incr))
4135 incr = TREE_OPERAND (rhs, 1);
4136 incr = cp_convert (TREE_TYPE (diff), incr);
4137 if (TREE_CODE (rhs) == MINUS_EXPR)
4139 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4140 incr = fold_if_not_in_template (incr);
4142 if (TREE_CODE (incr) != INTEGER_CST
4143 && (TREE_CODE (incr) != NOP_EXPR
4144 || (TREE_CODE (TREE_OPERAND (incr, 0))
4149 else if (TREE_OPERAND (rhs, 1) == iter)
4151 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4152 || TREE_CODE (rhs) != PLUS_EXPR)
4153 incr = error_mark_node;
4156 iter_incr = build_x_binary_op (PLUS_EXPR,
4157 TREE_OPERAND (rhs, 0),
4160 tf_warning_or_error);
4161 if (error_operand_p (iter_incr))
4163 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4165 tf_warning_or_error);
4166 if (error_operand_p (iter_incr))
4168 incr = TREE_OPERAND (rhs, 0);
4173 incr = error_mark_node;
4176 incr = error_mark_node;
4179 incr = error_mark_node;
4183 if (incr == error_mark_node)
4185 error_at (elocus, "invalid increment expression");
4189 incr = cp_convert (TREE_TYPE (diff), incr);
4190 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4191 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4192 && OMP_CLAUSE_DECL (c) == iter)
4195 decl = create_temporary_var (TREE_TYPE (diff));
4197 add_decl_expr (decl);
4198 last = create_temporary_var (TREE_TYPE (diff));
4200 add_decl_expr (last);
4201 if (c && iter_incr == NULL)
4203 incr_var = create_temporary_var (TREE_TYPE (diff));
4204 pushdecl (incr_var);
4205 add_decl_expr (incr_var);
4207 gcc_assert (stmts_are_full_exprs_p ());
4209 orig_pre_body = *pre_body;
4210 *pre_body = push_stmt_list ();
4212 add_stmt (orig_pre_body);
4214 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4215 tf_warning_or_error));
4216 init = build_int_cst (TREE_TYPE (diff), 0);
4217 if (c && iter_incr == NULL)
4219 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4220 incr, tf_warning_or_error));
4222 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4223 tf_warning_or_error);
4225 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4226 tf_warning_or_error));
4227 *pre_body = pop_stmt_list (*pre_body);
4229 cond = cp_build_binary_op (elocus,
4230 TREE_CODE (cond), decl, diff,
4231 tf_warning_or_error);
4232 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4233 elocus, incr, NULL_TREE);
4236 *body = push_stmt_list ();
4237 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4238 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4239 tf_warning_or_error);
4240 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4241 finish_expr_stmt (iter_init);
4242 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4243 tf_warning_or_error));
4244 add_stmt (orig_body);
4245 *body = pop_stmt_list (*body);
4249 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4250 finish_expr_stmt (iter_incr);
4251 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4252 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4255 TREE_VEC_ELT (declv, i) = decl;
4256 TREE_VEC_ELT (initv, i) = init;
4257 TREE_VEC_ELT (condv, i) = cond;
4258 TREE_VEC_ELT (incrv, i) = incr;
4263 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4264 are directly for their associated operands in the statement. DECL
4265 and INIT are a combo; if DECL is NULL then INIT ought to be a
4266 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4267 optional statements that need to go before the loop into its
4271 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4272 tree incrv, tree body, tree pre_body, tree clauses)
4274 tree omp_for = NULL, orig_incr = NULL;
4275 tree decl, init, cond, incr;
4279 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4280 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4281 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4282 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4284 decl = TREE_VEC_ELT (declv, i);
4285 init = TREE_VEC_ELT (initv, i);
4286 cond = TREE_VEC_ELT (condv, i);
4287 incr = TREE_VEC_ELT (incrv, i);
4293 switch (TREE_CODE (init))
4296 decl = TREE_OPERAND (init, 0);
4297 init = TREE_OPERAND (init, 1);
4300 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4302 decl = TREE_OPERAND (init, 0);
4303 init = TREE_OPERAND (init, 2);
4313 "expected iteration declaration or initialization");
4318 if (init && EXPR_HAS_LOCATION (init))
4319 elocus = EXPR_LOCATION (init);
4323 error_at (elocus, "missing controlling predicate");
4329 error_at (elocus, "missing increment expression");
4333 TREE_VEC_ELT (declv, i) = decl;
4334 TREE_VEC_ELT (initv, i) = init;
4337 if (dependent_omp_for_p (declv, initv, condv, incrv))
4341 stmt = make_node (OMP_FOR);
4343 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4345 /* This is really just a place-holder. We'll be decomposing this
4346 again and going through the cp_build_modify_expr path below when
4347 we instantiate the thing. */
4348 TREE_VEC_ELT (initv, i)
4349 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4350 TREE_VEC_ELT (initv, i));
4353 TREE_TYPE (stmt) = void_type_node;
4354 OMP_FOR_INIT (stmt) = initv;
4355 OMP_FOR_COND (stmt) = condv;
4356 OMP_FOR_INCR (stmt) = incrv;
4357 OMP_FOR_BODY (stmt) = body;
4358 OMP_FOR_PRE_BODY (stmt) = pre_body;
4359 OMP_FOR_CLAUSES (stmt) = clauses;
4361 SET_EXPR_LOCATION (stmt, locus);
4362 return add_stmt (stmt);
4365 if (processing_template_decl)
4366 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4368 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4370 decl = TREE_VEC_ELT (declv, i);
4371 init = TREE_VEC_ELT (initv, i);
4372 cond = TREE_VEC_ELT (condv, i);
4373 incr = TREE_VEC_ELT (incrv, i);
4375 TREE_VEC_ELT (orig_incr, i) = incr;
4378 if (init && EXPR_HAS_LOCATION (init))
4379 elocus = EXPR_LOCATION (init);
4383 error_at (elocus, "expected iteration declaration or initialization");
4387 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4390 TREE_VEC_ELT (orig_incr, i) = incr;
4391 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4392 TREE_CODE (TREE_OPERAND (incr, 1)),
4393 TREE_OPERAND (incr, 2),
4394 tf_warning_or_error);
4397 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4399 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4400 incrv, &body, &pre_body, clauses))
4405 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4406 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4408 error_at (elocus, "invalid type for iteration variable %qE", decl);
4412 if (!processing_template_decl)
4414 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4415 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4418 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4420 && TREE_SIDE_EFFECTS (cond)
4421 && COMPARISON_CLASS_P (cond)
4422 && !processing_template_decl)
4424 tree t = TREE_OPERAND (cond, 0);
4425 if (TREE_SIDE_EFFECTS (t)
4427 && (TREE_CODE (t) != NOP_EXPR
4428 || TREE_OPERAND (t, 0) != decl))
4429 TREE_OPERAND (cond, 0)
4430 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4432 t = TREE_OPERAND (cond, 1);
4433 if (TREE_SIDE_EFFECTS (t)
4435 && (TREE_CODE (t) != NOP_EXPR
4436 || TREE_OPERAND (t, 0) != decl))
4437 TREE_OPERAND (cond, 1)
4438 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4440 if (decl == error_mark_node || init == error_mark_node)
4443 TREE_VEC_ELT (declv, i) = decl;
4444 TREE_VEC_ELT (initv, i) = init;
4445 TREE_VEC_ELT (condv, i) = cond;
4446 TREE_VEC_ELT (incrv, i) = incr;
4450 if (IS_EMPTY_STMT (pre_body))
4453 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4456 if (omp_for == NULL)
4459 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4461 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4462 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4464 if (TREE_CODE (incr) != MODIFY_EXPR)
4467 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4468 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4469 && !processing_template_decl)
4471 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4472 if (TREE_SIDE_EFFECTS (t)
4474 && (TREE_CODE (t) != NOP_EXPR
4475 || TREE_OPERAND (t, 0) != decl))
4476 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4477 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4479 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4480 if (TREE_SIDE_EFFECTS (t)
4482 && (TREE_CODE (t) != NOP_EXPR
4483 || TREE_OPERAND (t, 0) != decl))
4484 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4485 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4489 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4491 if (omp_for != NULL)
4492 OMP_FOR_CLAUSES (omp_for) = clauses;
4497 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4506 dependent_p = false;
4509 /* Even in a template, we can detect invalid uses of the atomic
4510 pragma if neither LHS nor RHS is type-dependent. */
4511 if (processing_template_decl)
4513 dependent_p = (type_dependent_expression_p (lhs)
4514 || type_dependent_expression_p (rhs));
4517 lhs = build_non_dependent_expr (lhs);
4518 rhs = build_non_dependent_expr (rhs);
4523 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4524 if (stmt == error_mark_node)
4527 if (processing_template_decl)
4528 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4529 build2 (code, void_type_node, orig_lhs, orig_rhs));
4534 finish_omp_barrier (void)
4536 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4537 VEC(tree,gc) *vec = make_tree_vector ();
4538 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4539 release_tree_vector (vec);
4540 finish_expr_stmt (stmt);
4544 finish_omp_flush (void)
4546 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4547 VEC(tree,gc) *vec = make_tree_vector ();
4548 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4549 release_tree_vector (vec);
4550 finish_expr_stmt (stmt);
4554 finish_omp_taskwait (void)
4556 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4557 VEC(tree,gc) *vec = make_tree_vector ();
4558 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4559 release_tree_vector (vec);
4560 finish_expr_stmt (stmt);
4564 init_cp_semantics (void)
4568 /* Build a STATIC_ASSERT for a static assertion with the condition
4569 CONDITION and the message text MESSAGE. LOCATION is the location
4570 of the static assertion in the source code. When MEMBER_P, this
4571 static assertion is a member of a class. */
4573 finish_static_assert (tree condition, tree message, location_t location,
4576 if (check_for_bare_parameter_packs (condition))
4577 condition = error_mark_node;
4579 if (type_dependent_expression_p (condition)
4580 || value_dependent_expression_p (condition))
4582 /* We're in a template; build a STATIC_ASSERT and put it in
4586 assertion = make_node (STATIC_ASSERT);
4587 STATIC_ASSERT_CONDITION (assertion) = condition;
4588 STATIC_ASSERT_MESSAGE (assertion) = message;
4589 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4592 maybe_add_class_template_decl_list (current_class_type,
4596 add_stmt (assertion);
4601 /* Fold the expression and convert it to a boolean value. */
4602 condition = fold_non_dependent_expr (condition);
4603 condition = cp_convert (boolean_type_node, condition);
4605 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4606 /* Do nothing; the condition is satisfied. */
4610 location_t saved_loc = input_location;
4612 input_location = location;
4613 if (TREE_CODE (condition) == INTEGER_CST
4614 && integer_zerop (condition))
4615 /* Report the error. */
4616 error ("static assertion failed: %E", message);
4617 else if (condition && condition != error_mark_node)
4618 error ("non-constant condition for static assertion");
4619 input_location = saved_loc;
4623 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4624 just return the type even though EXPR is a type-dependent expression.
4625 The ABI specifies which cases this applies to, which is a subset of the
4629 describable_type (tree expr)
4631 tree type = NULL_TREE;
4633 if (! type_dependent_expression_p (expr)
4634 && ! type_unknown_p (expr))
4636 type = unlowered_expr_type (expr);
4637 if (real_lvalue_p (expr))
4638 type = build_reference_type (type);
4644 switch (TREE_CODE (expr))
4650 /* Named rvalue reference becomes lvalue. */
4651 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4656 case TEMPLATE_PARM_INDEX:
4658 case STATIC_CAST_EXPR:
4659 case REINTERPRET_CAST_EXPR:
4660 case CONST_CAST_EXPR:
4661 case DYNAMIC_CAST_EXPR:
4662 type = TREE_TYPE (expr);
4667 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4668 if (ptrtype && POINTER_TYPE_P (ptrtype))
4669 type = build_reference_type (TREE_TYPE (ptrtype));
4674 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4675 type = TREE_TYPE (expr);
4679 if (type && type_uses_auto (type))
4685 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4686 suitable for use as a type-specifier.
4688 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4689 id-expression or a class member access, FALSE when it was parsed as
4690 a full expression. */
4693 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4695 tree orig_expr = expr;
4696 tree type = NULL_TREE;
4698 if (!expr || error_operand_p (expr))
4699 return error_mark_node;
4702 || TREE_CODE (expr) == TYPE_DECL
4703 || (TREE_CODE (expr) == BIT_NOT_EXPR
4704 && TYPE_P (TREE_OPERAND (expr, 0))))
4706 error ("argument to decltype must be an expression");
4707 return error_mark_node;
4710 if (type_dependent_expression_p (expr))
4712 if (id_expression_or_member_access_p)
4714 switch (TREE_CODE (expr))
4721 case TEMPLATE_PARM_INDEX:
4722 type = TREE_TYPE (expr);
4730 if (type && !type_uses_auto (type))
4733 type = cxx_make_type (DECLTYPE_TYPE);
4734 DECLTYPE_TYPE_EXPR (type) = expr;
4735 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4736 = id_expression_or_member_access_p;
4737 SET_TYPE_STRUCTURAL_EQUALITY (type);
4742 /* The type denoted by decltype(e) is defined as follows: */
4744 if (id_expression_or_member_access_p)
4746 /* If e is an id-expression or a class member access (5.2.5
4747 [expr.ref]), decltype(e) is defined as the type of the entity
4748 named by e. If there is no such entity, or e names a set of
4749 overloaded functions, the program is ill-formed. */
4750 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4751 expr = lookup_name (expr);
4753 if (TREE_CODE (expr) == INDIRECT_REF)
4754 /* This can happen when the expression is, e.g., "a.b". Just
4755 look at the underlying operand. */
4756 expr = TREE_OPERAND (expr, 0);
4758 if (TREE_CODE (expr) == OFFSET_REF
4759 || TREE_CODE (expr) == MEMBER_REF)
4760 /* We're only interested in the field itself. If it is a
4761 BASELINK, we will need to see through it in the next
4763 expr = TREE_OPERAND (expr, 1);
4765 if (TREE_CODE (expr) == BASELINK)
4766 /* See through BASELINK nodes to the underlying functions. */
4767 expr = BASELINK_FUNCTIONS (expr);
4769 if (TREE_CODE (expr) == OVERLOAD)
4771 if (OVL_CHAIN (expr))
4773 error ("%qE refers to a set of overloaded functions", orig_expr);
4774 return error_mark_node;
4777 /* An overload set containing only one function: just look
4778 at that function. */
4779 expr = OVL_FUNCTION (expr);
4782 switch (TREE_CODE (expr))
4785 if (DECL_BIT_FIELD_TYPE (expr))
4787 type = DECL_BIT_FIELD_TYPE (expr);
4790 /* Fall through for fields that aren't bitfields. */
4797 case TEMPLATE_PARM_INDEX:
4798 type = TREE_TYPE (expr);
4802 type = error_mark_node;
4806 type = is_bitfield_expr_with_lowered_type (expr);
4808 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4815 /* We can get here when the id-expression refers to an
4817 type = TREE_TYPE (expr);
4821 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4822 || TREE_CODE (expr) == SCOPE_REF);
4823 error ("argument to decltype must be an expression");
4824 return error_mark_node;
4829 /* Expressions of reference type are sometimes wrapped in
4830 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4831 representation, not part of the language, so we have to look
4833 if (TREE_CODE (expr) == INDIRECT_REF
4834 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4836 expr = TREE_OPERAND (expr, 0);
4838 if (TREE_CODE (expr) == CALL_EXPR)
4840 /* If e is a function call (5.2.2 [expr.call]) or an
4841 invocation of an overloaded operator (parentheses around e
4842 are ignored), decltype(e) is defined as the return type of
4844 tree fndecl = get_callee_fndecl (expr);
4845 if (fndecl && fndecl != error_mark_node)
4846 type = TREE_TYPE (TREE_TYPE (fndecl));
4849 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4850 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4851 || TREE_CODE (target_type) == POINTER_TYPE)
4852 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4853 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4854 type = TREE_TYPE (TREE_TYPE (target_type));
4856 sorry ("unable to determine the declared type of expression %<%E%>",
4862 type = is_bitfield_expr_with_lowered_type (expr);
4865 /* Bitfields are special, because their type encodes the
4866 number of bits they store. If the expression referenced a
4867 bitfield, TYPE now has the declared type of that
4869 type = cp_build_qualified_type (type,
4870 cp_type_quals (TREE_TYPE (expr)));
4872 if (real_lvalue_p (expr))
4873 type = build_reference_type (type);
4875 /* Within a lambda-expression:
4877 Every occurrence of decltype((x)) where x is a possibly
4878 parenthesized id-expression that names an entity of
4879 automatic storage duration is treated as if x were
4880 transformed into an access to a corresponding data member
4881 of the closure type that would have been declared if x
4882 were a use of the denoted entity. */
4883 else if (outer_automatic_var_p (expr)
4884 && current_function_decl
4885 && LAMBDA_FUNCTION_P (current_function_decl))
4886 type = capture_decltype (expr);
4889 /* Otherwise, where T is the type of e, if e is an lvalue,
4890 decltype(e) is defined as T&, otherwise decltype(e) is
4892 type = TREE_TYPE (expr);
4893 if (type == error_mark_node)
4894 return error_mark_node;
4895 else if (expr == current_class_ptr)
4896 /* If the expression is just "this", we want the
4897 cv-unqualified pointer for the "this" type. */
4898 type = TYPE_MAIN_VARIANT (type);
4899 else if (real_lvalue_p (expr))
4901 if (TREE_CODE (type) != REFERENCE_TYPE)
4902 type = build_reference_type (type);
4905 type = non_reference (type);
4910 if (!type || type == unknown_type_node)
4912 error ("type of %qE is unknown", expr);
4913 return error_mark_node;
4919 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4920 __has_nothrow_copy, depending on assign_p. */
4923 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4930 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4933 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4935 else if (TYPE_HAS_INIT_REF (type))
4937 /* If construction of the copy constructor was postponed, create
4939 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4940 lazily_declare_fn (sfk_copy_constructor, type);
4941 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
4942 lazily_declare_fn (sfk_move_constructor, type);
4943 fns = CLASSTYPE_CONSTRUCTORS (type);
4948 for (; fns; fns = OVL_NEXT (fns))
4950 tree fn = OVL_CURRENT (fns);
4954 if (copy_fn_p (fn) == 0)
4957 else if (copy_fn_p (fn) <= 0)
4960 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4967 /* Actually evaluates the trait. */
4970 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4972 enum tree_code type_code1;
4975 type_code1 = TREE_CODE (type1);
4979 case CPTK_HAS_NOTHROW_ASSIGN:
4980 type1 = strip_array_types (type1);
4981 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4982 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4983 || (CLASS_TYPE_P (type1)
4984 && classtype_has_nothrow_assign_or_copy_p (type1,
4987 case CPTK_HAS_TRIVIAL_ASSIGN:
4988 /* ??? The standard seems to be missing the "or array of such a class
4989 type" wording for this trait. */
4990 type1 = strip_array_types (type1);
4991 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4992 && (trivial_type_p (type1)
4993 || (CLASS_TYPE_P (type1)
4994 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4996 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4997 type1 = strip_array_types (type1);
4998 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4999 || (CLASS_TYPE_P (type1)
5000 && (t = locate_ctor (type1, NULL))
5001 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5003 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5004 type1 = strip_array_types (type1);
5005 return (trivial_type_p (type1)
5006 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5008 case CPTK_HAS_NOTHROW_COPY:
5009 type1 = strip_array_types (type1);
5010 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5011 || (CLASS_TYPE_P (type1)
5012 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5014 case CPTK_HAS_TRIVIAL_COPY:
5015 /* ??? The standard seems to be missing the "or array of such a class
5016 type" wording for this trait. */
5017 type1 = strip_array_types (type1);
5018 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5019 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
5021 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5022 type1 = strip_array_types (type1);
5023 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5024 || (CLASS_TYPE_P (type1)
5025 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5027 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5028 return (CLASS_TYPE_P (type1)
5029 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
5031 case CPTK_IS_ABSTRACT:
5032 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5034 case CPTK_IS_BASE_OF:
5035 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5036 && DERIVED_FROM_P (type1, type2));
5039 return (NON_UNION_CLASS_TYPE_P (type1));
5041 case CPTK_IS_CONVERTIBLE_TO:
5046 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5049 return (type_code1 == ENUMERAL_TYPE);
5052 return (pod_type_p (type1));
5054 case CPTK_IS_POLYMORPHIC:
5055 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5057 case CPTK_IS_STD_LAYOUT:
5058 return (std_layout_type_p (type1));
5060 case CPTK_IS_TRIVIAL:
5061 return (trivial_type_p (type1));
5064 return (type_code1 == UNION_TYPE);
5072 /* Returns true if TYPE is a complete type, an array of unknown bound,
5073 or (possibly cv-qualified) void, returns false otherwise. */
5076 check_trait_type (tree type)
5078 if (COMPLETE_TYPE_P (type))
5081 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
5084 if (VOID_TYPE_P (type))
5090 /* Process a trait expression. */
5093 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5095 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5096 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5097 || kind == CPTK_HAS_NOTHROW_COPY
5098 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5099 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5100 || kind == CPTK_HAS_TRIVIAL_COPY
5101 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5102 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5103 || kind == CPTK_IS_ABSTRACT
5104 || kind == CPTK_IS_BASE_OF
5105 || kind == CPTK_IS_CLASS
5106 || kind == CPTK_IS_CONVERTIBLE_TO
5107 || kind == CPTK_IS_EMPTY
5108 || kind == CPTK_IS_ENUM
5109 || kind == CPTK_IS_POD
5110 || kind == CPTK_IS_POLYMORPHIC
5111 || kind == CPTK_IS_STD_LAYOUT
5112 || kind == CPTK_IS_TRIVIAL
5113 || kind == CPTK_IS_UNION);
5115 if (kind == CPTK_IS_CONVERTIBLE_TO)
5117 sorry ("__is_convertible_to");
5118 return error_mark_node;
5121 if (type1 == error_mark_node
5122 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5123 && type2 == error_mark_node))
5124 return error_mark_node;
5126 if (processing_template_decl)
5128 tree trait_expr = make_node (TRAIT_EXPR);
5129 TREE_TYPE (trait_expr) = boolean_type_node;
5130 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5131 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5132 TRAIT_EXPR_KIND (trait_expr) = kind;
5136 complete_type (type1);
5138 complete_type (type2);
5142 case CPTK_HAS_NOTHROW_ASSIGN:
5143 case CPTK_HAS_TRIVIAL_ASSIGN:
5144 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5145 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5146 case CPTK_HAS_NOTHROW_COPY:
5147 case CPTK_HAS_TRIVIAL_COPY:
5148 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5149 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5150 case CPTK_IS_ABSTRACT:
5153 case CPTK_IS_POLYMORPHIC:
5154 case CPTK_IS_STD_LAYOUT:
5155 case CPTK_IS_TRIVIAL:
5156 if (!check_trait_type (type1))
5158 error ("incomplete type %qT not allowed", type1);
5159 return error_mark_node;
5163 case CPTK_IS_BASE_OF:
5164 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5165 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5166 && !COMPLETE_TYPE_P (type2))
5168 error ("incomplete type %qT not allowed", type2);
5169 return error_mark_node;
5178 case CPTK_IS_CONVERTIBLE_TO:
5183 return (trait_expr_value (kind, type1, type2)
5184 ? boolean_true_node : boolean_false_node);
5187 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5188 which is ignored for C++. */
5191 set_float_const_decimal64 (void)
5196 clear_float_const_decimal64 (void)
5201 float_const_decimal64_p (void)
5206 /* Return true if T is a literal type. */
5209 literal_type_p (tree t)
5211 if (SCALAR_TYPE_P (t))
5213 if (CLASS_TYPE_P (t))
5214 return CLASSTYPE_LITERAL_P (t);
5215 if (TREE_CODE (t) == ARRAY_TYPE)
5216 return literal_type_p (strip_array_types (t));
5221 /* If DECL is a variable declared `constexpr', require its type
5222 be literal. Return the DECL if OK, otherwise NULL. */
5225 ensure_literal_type_for_constexpr_object (tree decl)
5227 tree type = TREE_TYPE (decl);
5228 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5229 && !processing_template_decl && !literal_type_p (type))
5231 error ("the type %qT of constexpr variable %qD is not literal",
5238 /* Return non-null if FUN certainly designates a valid constexpr function
5239 declaration. Otherwise return NULL. Issue appropriate diagnostics
5240 if necessary. Note that we only check the declaration, not the body
5244 validate_constexpr_fundecl (tree fun)
5246 tree rettype = NULL;
5249 /* Don't bother if FUN is not marked constexpr. */
5250 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5253 /* For a function template, we have absolutely no guarantee that all
5254 instantiations will be constexpr. */
5255 if (TREE_CODE (fun) == TEMPLATE_DECL)
5258 parm = FUNCTION_FIRST_USER_PARM (fun);
5259 for (; parm != NULL; parm = TREE_CHAIN (parm))
5261 tree type = TREE_TYPE (parm);
5262 if (dependent_type_p (type))
5264 if (!literal_type_p (type))
5266 error ("parameter %q#D is not of literal type", parm);
5271 if (DECL_CONSTRUCTOR_P (fun))
5274 rettype = TREE_TYPE (TREE_TYPE (fun));
5275 if (dependent_type_p (rettype))
5277 if (!literal_type_p (rettype))
5279 error ("return type %qT of function %qD is not a literal type",
5280 TREE_TYPE (TREE_TYPE (fun)), fun);
5287 /* Constructor for a lambda expression. */
5290 build_lambda_expr (void)
5292 tree lambda = make_node (LAMBDA_EXPR);
5293 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
5294 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
5295 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
5296 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
5297 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
5301 /* Create the closure object for a LAMBDA_EXPR. */
5304 build_lambda_object (tree lambda_expr)
5306 /* Build aggregate constructor call.
5307 - cp_parser_braced_list
5308 - cp_parser_functional_cast */
5309 VEC(constructor_elt,gc) *elts = NULL;
5310 tree node, expr, type;
5311 location_t saved_loc;
5313 if (processing_template_decl)
5316 /* Make sure any error messages refer to the lambda-introducer. */
5317 saved_loc = input_location;
5318 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
5320 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
5322 node = TREE_CHAIN (node))
5324 tree field = TREE_PURPOSE (node);
5325 tree val = TREE_VALUE (node);
5327 /* Mere mortals can't copy arrays with aggregate initialization, so
5328 do some magic to make it work here. */
5329 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
5330 val = build_array_copy (val);
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 (type_dependent_expression_p (expr))
5395 type = cxx_make_type (DECLTYPE_TYPE);
5396 DECLTYPE_TYPE_EXPR (type) = expr;
5397 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
5398 SET_TYPE_STRUCTURAL_EQUALITY (type);
5401 type = type_decays_to (unlowered_expr_type (expr));
5405 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5409 lambda_function (tree lambda)
5412 if (TREE_CODE (lambda) == LAMBDA_EXPR)
5413 type = TREE_TYPE (lambda);
5416 gcc_assert (LAMBDA_TYPE_P (type));
5417 /* Don't let debug_tree cause instantiation. */
5418 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
5420 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
5421 /*protect=*/0, /*want_type=*/false);
5423 lambda = BASELINK_FUNCTIONS (lambda);
5427 /* Returns the type to use for the FIELD_DECL corresponding to the
5429 The caller should add REFERENCE_TYPE for capture by reference. */
5432 lambda_capture_field_type (tree expr)
5435 if (type_dependent_expression_p (expr))
5437 type = cxx_make_type (DECLTYPE_TYPE);
5438 DECLTYPE_TYPE_EXPR (type) = expr;
5439 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
5440 SET_TYPE_STRUCTURAL_EQUALITY (type);
5443 type = non_reference (unlowered_expr_type (expr));
5447 /* Recompute the return type for LAMBDA with body of the form:
5448 { return EXPR ; } */
5451 apply_lambda_return_type (tree lambda, tree return_type)
5453 tree fco = lambda_function (lambda);
5456 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
5458 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5459 it would interfere with instantiating the closure type. */
5460 if (dependent_type_p (return_type))
5462 if (return_type == error_mark_node)
5465 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5466 TREE_TYPE (METHOD_TYPE) == return-type */
5467 TREE_TYPE (TREE_TYPE (fco)) = return_type;
5469 result = DECL_RESULT (fco);
5470 if (result == NULL_TREE)
5473 /* We already have a DECL_RESULT from start_preparsed_function.
5474 Now we need to redo the work it and allocate_struct_function
5475 did to reflect the new type. */
5476 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
5477 TYPE_MAIN_VARIANT (return_type));
5478 DECL_ARTIFICIAL (result) = 1;
5479 DECL_IGNORED_P (result) = 1;
5480 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
5483 DECL_RESULT (fco) = result;
5485 if (!processing_template_decl && aggregate_value_p (result, fco))
5487 #ifdef PCC_STATIC_STRUCT_RETURN
5488 cfun->returns_pcc_struct = 1;
5490 cfun->returns_struct = 1;
5495 /* DECL is a local variable or parameter from the surrounding scope of a
5496 lambda-expression. Returns the decltype for a use of the capture field
5497 for DECL even if it hasn't been captured yet. */
5500 capture_decltype (tree decl)
5502 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
5503 /* FIXME do lookup instead of list walk? */
5504 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
5508 type = TREE_TYPE (TREE_PURPOSE (cap));
5510 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
5513 error ("%qD is not captured", decl);
5514 return error_mark_node;
5517 type = TREE_TYPE (decl);
5518 if (TREE_CODE (type) == REFERENCE_TYPE
5519 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
5520 type = TREE_TYPE (type);
5523 case CPLD_REFERENCE:
5524 type = TREE_TYPE (decl);
5525 if (TREE_CODE (type) != REFERENCE_TYPE)
5526 type = build_reference_type (TREE_TYPE (decl));
5533 if (TREE_CODE (type) != REFERENCE_TYPE)
5535 if (!LAMBDA_EXPR_MUTABLE_P (lam))
5536 type = cp_build_qualified_type (type, (TYPE_QUALS (type)
5538 type = build_reference_type (type);
5543 /* From an ID and INITIALIZER, create a capture (by reference if
5544 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5548 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p)
5553 type = lambda_capture_field_type (initializer);
5556 type = build_reference_type (type);
5557 if (!real_lvalue_p (initializer))
5558 error ("cannot capture %qE by reference", initializer);
5561 /* Make member variable. */
5562 member = build_lang_decl (FIELD_DECL, id, type);
5564 /* Add it to the appropriate closure class. */
5565 finish_member_declaration (member);
5567 LAMBDA_EXPR_CAPTURE_LIST (lambda)
5568 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
5570 if (id == get_identifier ("__this"))
5572 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
5573 error ("already captured %<this%> in lambda expression");
5574 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
5580 /* Similar to add_capture, except this works on a stack of nested lambdas.
5581 BY_REFERENCE_P in this case is derived from the default capture mode.
5582 Returns the capture for the lambda at the bottom of the stack. */
5585 add_default_capture (tree lambda_stack, tree id, tree initializer)
5587 bool this_capture_p = (id == get_identifier ("__this"));
5589 tree member = NULL_TREE;
5591 tree saved_class_type = current_class_type;
5595 for (node = lambda_stack;
5597 node = TREE_CHAIN (node))
5599 tree lambda = TREE_VALUE (node);
5601 current_class_type = TREE_TYPE (lambda);
5602 member = add_capture (lambda,
5607 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
5608 == CPLD_REFERENCE)));
5611 /* Have to get the old value of current_class_ref. */
5612 tree object = cp_build_indirect_ref (DECL_ARGUMENTS
5613 (lambda_function (lambda)),
5615 /*complain=*/tf_warning_or_error);
5616 initializer = finish_non_static_data_member
5617 (member, object, /*qualifying_scope=*/NULL_TREE);
5621 current_class_type = saved_class_type;
5626 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5627 INDIRECT_REF, possibly adding it through default capturing. */
5630 lambda_expr_this_capture (tree lambda)
5634 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5636 /* Try to default capture 'this' if we can. */
5638 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
5640 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
5641 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
5642 tree init = NULL_TREE;
5644 /* If we are in a lambda function, we can move out until we hit:
5645 1. a non-lambda function,
5646 2. a lambda function capturing 'this', or
5647 3. a non-default capturing lambda function. */
5648 while (LAMBDA_FUNCTION_P (containing_function))
5651 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
5653 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
5655 /* An outer lambda has already captured 'this'. */
5656 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5658 = cp_build_indirect_ref (DECL_ARGUMENTS (containing_function),
5659 "", tf_warning_or_error);
5660 init = finish_non_static_data_member (cap, lthis, NULL_TREE);
5664 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
5665 /* An outer lambda won't let us capture 'this'. */
5668 lambda_stack = tree_cons (NULL_TREE,
5672 containing_function = decl_function_context (containing_function);
5675 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
5676 && !LAMBDA_FUNCTION_P (containing_function))
5677 /* First parameter is 'this'. */
5678 init = DECL_ARGUMENTS (containing_function);
5681 this_capture = add_default_capture (lambda_stack,
5682 /*id=*/get_identifier ("__this"),
5688 error ("%<this%> was not captured for this lambda function");
5689 result = error_mark_node;
5693 /* To make sure that current_class_ref is for the lambda. */
5694 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
5696 result = finish_non_static_data_member (this_capture,
5698 /*qualifying_scope=*/NULL_TREE);
5700 /* If 'this' is captured, each use of 'this' is transformed into an
5701 access to the corresponding unnamed data member of the closure
5702 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5703 ensures that the transformed expression is an rvalue. ] */
5704 result = rvalue (result);
5710 #include "gt-cp-semantics.h"