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 *);
60 /* Deferred Access Checking Overview
61 ---------------------------------
63 Most C++ expressions and declarations require access checking
64 to be performed during parsing. However, in several cases,
65 this has to be treated differently.
67 For member declarations, access checking has to be deferred
68 until more information about the declaration is known. For
80 When we are parsing the function return type `A::X', we don't
81 really know if this is allowed until we parse the function name.
83 Furthermore, some contexts require that access checking is
84 never performed at all. These include class heads, and template
87 Typical use of access checking functions is described here:
89 1. When we enter a context that requires certain access checking
90 mode, the function `push_deferring_access_checks' is called with
91 DEFERRING argument specifying the desired mode. Access checking
92 may be performed immediately (dk_no_deferred), deferred
93 (dk_deferred), or not performed (dk_no_check).
95 2. When a declaration such as a type, or a variable, is encountered,
96 the function `perform_or_defer_access_check' is called. It
97 maintains a VEC of all deferred checks.
99 3. The global `current_class_type' or `current_function_decl' is then
100 setup by the parser. `enforce_access' relies on these information
103 4. Upon exiting the context mentioned in step 1,
104 `perform_deferred_access_checks' is called to check all declaration
105 stored in the VEC. `pop_deferring_access_checks' is then
106 called to restore the previous access checking mode.
108 In case of parsing error, we simply call `pop_deferring_access_checks'
109 without `perform_deferred_access_checks'. */
111 typedef struct GTY(()) deferred_access {
112 /* A VEC representing name-lookups for which we have deferred
113 checking access controls. We cannot check the accessibility of
114 names used in a decl-specifier-seq until we know what is being
115 declared because code like:
122 A::B* A::f() { return 0; }
124 is valid, even though `A::B' is not generally accessible. */
125 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
127 /* The current mode of access checks. */
128 enum deferring_kind deferring_access_checks_kind;
131 DEF_VEC_O (deferred_access);
132 DEF_VEC_ALLOC_O (deferred_access,gc);
134 /* Data for deferred access checking. */
135 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
136 static GTY(()) unsigned deferred_access_no_check;
138 /* Save the current deferred access states and start deferred
139 access checking iff DEFER_P is true. */
142 push_deferring_access_checks (deferring_kind deferring)
144 /* For context like template instantiation, access checking
145 disabling applies to all nested context. */
146 if (deferred_access_no_check || deferring == dk_no_check)
147 deferred_access_no_check++;
150 deferred_access *ptr;
152 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
153 ptr->deferred_access_checks = NULL;
154 ptr->deferring_access_checks_kind = deferring;
158 /* Resume deferring access checks again after we stopped doing
162 resume_deferring_access_checks (void)
164 if (!deferred_access_no_check)
165 VEC_last (deferred_access, deferred_access_stack)
166 ->deferring_access_checks_kind = dk_deferred;
169 /* Stop deferring access checks. */
172 stop_deferring_access_checks (void)
174 if (!deferred_access_no_check)
175 VEC_last (deferred_access, deferred_access_stack)
176 ->deferring_access_checks_kind = dk_no_deferred;
179 /* Discard the current deferred access checks and restore the
183 pop_deferring_access_checks (void)
185 if (deferred_access_no_check)
186 deferred_access_no_check--;
188 VEC_pop (deferred_access, deferred_access_stack);
191 /* Returns a TREE_LIST representing the deferred checks.
192 The TREE_PURPOSE of each node is the type through which the
193 access occurred; the TREE_VALUE is the declaration named.
196 VEC (deferred_access_check,gc)*
197 get_deferred_access_checks (void)
199 if (deferred_access_no_check)
202 return (VEC_last (deferred_access, deferred_access_stack)
203 ->deferred_access_checks);
206 /* Take current deferred checks and combine with the
207 previous states if we also defer checks previously.
208 Otherwise perform checks now. */
211 pop_to_parent_deferring_access_checks (void)
213 if (deferred_access_no_check)
214 deferred_access_no_check--;
217 VEC (deferred_access_check,gc) *checks;
218 deferred_access *ptr;
220 checks = (VEC_last (deferred_access, deferred_access_stack)
221 ->deferred_access_checks);
223 VEC_pop (deferred_access, deferred_access_stack);
224 ptr = VEC_last (deferred_access, deferred_access_stack);
225 if (ptr->deferring_access_checks_kind == dk_no_deferred)
228 perform_access_checks (checks);
232 /* Merge with parent. */
234 deferred_access_check *chk, *probe;
237 VEC_iterate (deferred_access_check, checks, i, chk) ;
241 VEC_iterate (deferred_access_check,
242 ptr->deferred_access_checks, j, probe) ;
245 if (probe->binfo == chk->binfo &&
246 probe->decl == chk->decl &&
247 probe->diag_decl == chk->diag_decl)
250 /* Insert into parent's checks. */
251 VEC_safe_push (deferred_access_check, gc,
252 ptr->deferred_access_checks, chk);
259 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
260 is the BINFO indicating the qualifying scope used to access the
261 DECL node stored in the TREE_VALUE of the node. */
264 perform_access_checks (VEC (deferred_access_check,gc)* checks)
267 deferred_access_check *chk;
272 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
273 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
276 /* Perform the deferred access checks.
278 After performing the checks, we still have to keep the list
279 `deferred_access_stack->deferred_access_checks' since we may want
280 to check access for them again later in a different context.
287 A::X A::a, x; // No error for `A::a', error for `x'
289 We have to perform deferred access of `A::X', first with `A::a',
293 perform_deferred_access_checks (void)
295 perform_access_checks (get_deferred_access_checks ());
298 /* Defer checking the accessibility of DECL, when looked up in
299 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
302 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
305 deferred_access *ptr;
306 deferred_access_check *chk;
307 deferred_access_check *new_access;
310 /* Exit if we are in a context that no access checking is performed.
312 if (deferred_access_no_check)
315 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
317 ptr = VEC_last (deferred_access, deferred_access_stack);
319 /* If we are not supposed to defer access checks, just check now. */
320 if (ptr->deferring_access_checks_kind == dk_no_deferred)
322 enforce_access (binfo, decl, diag_decl);
326 /* See if we are already going to perform this check. */
328 VEC_iterate (deferred_access_check,
329 ptr->deferred_access_checks, i, chk) ;
332 if (chk->decl == decl && chk->binfo == binfo &&
333 chk->diag_decl == diag_decl)
338 /* If not, record the check. */
340 VEC_safe_push (deferred_access_check, gc,
341 ptr->deferred_access_checks, 0);
342 new_access->binfo = binfo;
343 new_access->decl = decl;
344 new_access->diag_decl = diag_decl;
347 /* Returns nonzero if the current statement is a full expression,
348 i.e. temporaries created during that statement should be destroyed
349 at the end of the statement. */
352 stmts_are_full_exprs_p (void)
354 return current_stmt_tree ()->stmts_are_full_exprs_p;
357 /* T is a statement. Add it to the statement-tree. This is the C++
358 version. The C/ObjC frontends have a slightly different version of
364 enum tree_code code = TREE_CODE (t);
366 if (EXPR_P (t) && code != LABEL_EXPR)
368 if (!EXPR_HAS_LOCATION (t))
369 SET_EXPR_LOCATION (t, input_location);
371 /* When we expand a statement-tree, we must know whether or not the
372 statements are full-expressions. We record that fact here. */
373 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
376 /* Add T to the statement-tree. Non-side-effect statements need to be
377 recorded during statement expressions. */
378 append_to_statement_list_force (t, &cur_stmt_list);
383 /* Returns the stmt_tree to which statements are currently being added. */
386 current_stmt_tree (void)
389 ? &cfun->language->base.x_stmt_tree
390 : &scope_chain->x_stmt_tree);
393 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
396 maybe_cleanup_point_expr (tree expr)
398 if (!processing_template_decl && stmts_are_full_exprs_p ())
399 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
403 /* Like maybe_cleanup_point_expr except have the type of the new expression be
404 void so we don't need to create a temporary variable to hold the inner
405 expression. The reason why we do this is because the original type might be
406 an aggregate and we cannot create a temporary variable for that type. */
409 maybe_cleanup_point_expr_void (tree expr)
411 if (!processing_template_decl && stmts_are_full_exprs_p ())
412 expr = fold_build_cleanup_point_expr (void_type_node, expr);
418 /* Create a declaration statement for the declaration given by the DECL. */
421 add_decl_expr (tree decl)
423 tree r = build_stmt (DECL_EXPR, decl);
424 if (DECL_INITIAL (decl)
425 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
426 r = maybe_cleanup_point_expr_void (r);
430 /* Finish a scope. */
433 do_poplevel (tree stmt_list)
437 if (stmts_are_full_exprs_p ())
438 block = poplevel (kept_level_p (), 1, 0);
440 stmt_list = pop_stmt_list (stmt_list);
442 if (!processing_template_decl)
444 stmt_list = c_build_bind_expr (block, stmt_list);
445 /* ??? See c_end_compound_stmt re statement expressions. */
451 /* Begin a new scope. */
454 do_pushlevel (scope_kind sk)
456 tree ret = push_stmt_list ();
457 if (stmts_are_full_exprs_p ())
458 begin_scope (sk, NULL);
462 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
463 when the current scope is exited. EH_ONLY is true when this is not
464 meant to apply to normal control flow transfer. */
467 push_cleanup (tree decl, tree cleanup, bool eh_only)
469 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
470 CLEANUP_EH_ONLY (stmt) = eh_only;
472 CLEANUP_BODY (stmt) = push_stmt_list ();
475 /* Begin a conditional that might contain a declaration. When generating
476 normal code, we want the declaration to appear before the statement
477 containing the conditional. When generating template code, we want the
478 conditional to be rendered as the raw DECL_EXPR. */
481 begin_cond (tree *cond_p)
483 if (processing_template_decl)
484 *cond_p = push_stmt_list ();
487 /* Finish such a conditional. */
490 finish_cond (tree *cond_p, tree expr)
492 if (processing_template_decl)
494 tree cond = pop_stmt_list (*cond_p);
495 if (TREE_CODE (cond) == DECL_EXPR)
498 if (check_for_bare_parameter_packs (expr))
499 *cond_p = error_mark_node;
504 /* If *COND_P specifies a conditional with a declaration, transform the
507 for (; A x = 42;) { }
509 while (true) { A x = 42; if (!x) break; }
510 for (;;) { A x = 42; if (!x) break; }
511 The statement list for BODY will be empty if the conditional did
512 not declare anything. */
515 simplify_loop_decl_cond (tree *cond_p, tree body)
519 if (!TREE_SIDE_EFFECTS (body))
523 *cond_p = boolean_true_node;
525 if_stmt = begin_if_stmt ();
526 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
527 finish_if_stmt_cond (cond, if_stmt);
528 finish_break_stmt ();
529 finish_then_clause (if_stmt);
530 finish_if_stmt (if_stmt);
533 /* Finish a goto-statement. */
536 finish_goto_stmt (tree destination)
538 if (TREE_CODE (destination) == IDENTIFIER_NODE)
539 destination = lookup_label (destination);
541 /* We warn about unused labels with -Wunused. That means we have to
542 mark the used labels as used. */
543 if (TREE_CODE (destination) == LABEL_DECL)
544 TREE_USED (destination) = 1;
547 /* The DESTINATION is being used as an rvalue. */
548 if (!processing_template_decl)
550 destination = decay_conversion (destination);
551 destination = cp_convert (ptr_type_node, destination);
552 if (error_operand_p (destination))
555 /* We don't inline calls to functions with computed gotos.
556 Those functions are typically up to some funny business,
557 and may be depending on the labels being at particular
558 addresses, or some such. */
559 DECL_UNINLINABLE (current_function_decl) = 1;
562 check_goto (destination);
564 return add_stmt (build_stmt (GOTO_EXPR, destination));
567 /* COND is the condition-expression for an if, while, etc.,
568 statement. Convert it to a boolean value, if appropriate.
569 In addition, verify sequence points if -Wsequence-point is enabled. */
572 maybe_convert_cond (tree cond)
574 /* Empty conditions remain empty. */
578 /* Wait until we instantiate templates before doing conversion. */
579 if (processing_template_decl)
582 if (warn_sequence_point)
583 verify_sequence_points (cond);
585 /* Do the conversion. */
586 cond = convert_from_reference (cond);
588 if (TREE_CODE (cond) == MODIFY_EXPR
589 && !TREE_NO_WARNING (cond)
592 warning (OPT_Wparentheses,
593 "suggest parentheses around assignment used as truth value");
594 TREE_NO_WARNING (cond) = 1;
597 return condition_conversion (cond);
600 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
603 finish_expr_stmt (tree expr)
607 if (expr != NULL_TREE)
609 if (!processing_template_decl)
611 if (warn_sequence_point)
612 verify_sequence_points (expr);
613 expr = convert_to_void (expr, "statement", tf_warning_or_error);
615 else if (!type_dependent_expression_p (expr))
616 convert_to_void (build_non_dependent_expr (expr), "statement",
617 tf_warning_or_error);
619 if (check_for_bare_parameter_packs (expr))
620 expr = error_mark_node;
622 /* Simplification of inner statement expressions, compound exprs,
623 etc can result in us already having an EXPR_STMT. */
624 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
626 if (TREE_CODE (expr) != EXPR_STMT)
627 expr = build_stmt (EXPR_STMT, expr);
628 expr = maybe_cleanup_point_expr_void (expr);
640 /* Begin an if-statement. Returns a newly created IF_STMT if
647 scope = do_pushlevel (sk_block);
648 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
649 TREE_CHAIN (r) = scope;
650 begin_cond (&IF_COND (r));
654 /* Process the COND of an if-statement, which may be given by
658 finish_if_stmt_cond (tree cond, tree if_stmt)
660 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
662 THEN_CLAUSE (if_stmt) = push_stmt_list ();
665 /* Finish the then-clause of an if-statement, which may be given by
669 finish_then_clause (tree if_stmt)
671 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
675 /* Begin the else-clause of an if-statement. */
678 begin_else_clause (tree if_stmt)
680 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
683 /* Finish the else-clause of an if-statement, which may be given by
687 finish_else_clause (tree if_stmt)
689 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
692 /* Finish an if-statement. */
695 finish_if_stmt (tree if_stmt)
697 tree scope = TREE_CHAIN (if_stmt);
698 TREE_CHAIN (if_stmt) = NULL;
699 add_stmt (do_poplevel (scope));
703 /* Begin a while-statement. Returns a newly created WHILE_STMT if
707 begin_while_stmt (void)
710 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
712 WHILE_BODY (r) = do_pushlevel (sk_block);
713 begin_cond (&WHILE_COND (r));
717 /* Process the COND of a while-statement, which may be given by
721 finish_while_stmt_cond (tree cond, tree while_stmt)
723 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
724 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
727 /* Finish a while-statement, which may be given by WHILE_STMT. */
730 finish_while_stmt (tree while_stmt)
732 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
736 /* Begin a do-statement. Returns a newly created DO_STMT if
742 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
744 DO_BODY (r) = push_stmt_list ();
748 /* Finish the body of a do-statement, which may be given by DO_STMT. */
751 finish_do_body (tree do_stmt)
753 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
755 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
756 body = STATEMENT_LIST_TAIL (body)->stmt;
758 if (IS_EMPTY_STMT (body))
759 warning (OPT_Wempty_body,
760 "suggest explicit braces around empty body in %<do%> statement");
763 /* Finish a do-statement, which may be given by DO_STMT, and whose
764 COND is as indicated. */
767 finish_do_stmt (tree cond, tree do_stmt)
769 cond = maybe_convert_cond (cond);
770 DO_COND (do_stmt) = cond;
774 /* Finish a return-statement. The EXPRESSION returned, if any, is as
778 finish_return_stmt (tree expr)
783 expr = check_return_expr (expr, &no_warning);
785 if (flag_openmp && !check_omp_return ())
786 return error_mark_node;
787 if (!processing_template_decl)
789 if (warn_sequence_point)
790 verify_sequence_points (expr);
792 if (DECL_DESTRUCTOR_P (current_function_decl)
793 || (DECL_CONSTRUCTOR_P (current_function_decl)
794 && targetm.cxx.cdtor_returns_this ()))
796 /* Similarly, all destructors must run destructors for
797 base-classes before returning. So, all returns in a
798 destructor get sent to the DTOR_LABEL; finish_function emits
799 code to return a value there. */
800 return finish_goto_stmt (cdtor_label);
804 r = build_stmt (RETURN_EXPR, expr);
805 TREE_NO_WARNING (r) |= no_warning;
806 r = maybe_cleanup_point_expr_void (r);
813 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
816 begin_for_stmt (void)
820 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
821 NULL_TREE, NULL_TREE);
823 if (flag_new_for_scope > 0)
824 TREE_CHAIN (r) = do_pushlevel (sk_for);
826 if (processing_template_decl)
827 FOR_INIT_STMT (r) = push_stmt_list ();
832 /* Finish the for-init-statement of a for-statement, which may be
833 given by FOR_STMT. */
836 finish_for_init_stmt (tree for_stmt)
838 if (processing_template_decl)
839 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
841 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
842 begin_cond (&FOR_COND (for_stmt));
845 /* Finish the COND of a for-statement, which may be given by
849 finish_for_cond (tree cond, tree for_stmt)
851 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
852 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
855 /* Finish the increment-EXPRESSION in a for-statement, which may be
856 given by FOR_STMT. */
859 finish_for_expr (tree expr, tree for_stmt)
863 /* If EXPR is an overloaded function, issue an error; there is no
864 context available to use to perform overload resolution. */
865 if (type_unknown_p (expr))
867 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
868 expr = error_mark_node;
870 if (!processing_template_decl)
872 if (warn_sequence_point)
873 verify_sequence_points (expr);
874 expr = convert_to_void (expr, "3rd expression in for",
875 tf_warning_or_error);
877 else if (!type_dependent_expression_p (expr))
878 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for",
879 tf_warning_or_error);
880 expr = maybe_cleanup_point_expr_void (expr);
881 if (check_for_bare_parameter_packs (expr))
882 expr = error_mark_node;
883 FOR_EXPR (for_stmt) = expr;
886 /* Finish the body of a for-statement, which may be given by
887 FOR_STMT. The increment-EXPR for the loop must be
891 finish_for_stmt (tree for_stmt)
893 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
895 /* Pop the scope for the body of the loop. */
896 if (flag_new_for_scope > 0)
898 tree scope = TREE_CHAIN (for_stmt);
899 TREE_CHAIN (for_stmt) = NULL;
900 add_stmt (do_poplevel (scope));
906 /* Finish a break-statement. */
909 finish_break_stmt (void)
911 return add_stmt (build_stmt (BREAK_STMT));
914 /* Finish a continue-statement. */
917 finish_continue_stmt (void)
919 return add_stmt (build_stmt (CONTINUE_STMT));
922 /* Begin a switch-statement. Returns a new SWITCH_STMT if
926 begin_switch_stmt (void)
930 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
932 scope = do_pushlevel (sk_block);
933 TREE_CHAIN (r) = scope;
934 begin_cond (&SWITCH_STMT_COND (r));
939 /* Finish the cond of a switch-statement. */
942 finish_switch_cond (tree cond, tree switch_stmt)
944 tree orig_type = NULL;
945 if (!processing_template_decl)
947 /* Convert the condition to an integer or enumeration type. */
948 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
949 if (cond == NULL_TREE)
951 error ("switch quantity not an integer");
952 cond = error_mark_node;
954 orig_type = TREE_TYPE (cond);
955 if (cond != error_mark_node)
959 Integral promotions are performed. */
960 cond = perform_integral_promotions (cond);
961 cond = maybe_cleanup_point_expr (cond);
964 if (check_for_bare_parameter_packs (cond))
965 cond = error_mark_node;
966 else if (!processing_template_decl && warn_sequence_point)
967 verify_sequence_points (cond);
969 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
970 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
971 add_stmt (switch_stmt);
972 push_switch (switch_stmt);
973 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
976 /* Finish the body of a switch-statement, which may be given by
977 SWITCH_STMT. The COND to switch on is indicated. */
980 finish_switch_stmt (tree switch_stmt)
984 SWITCH_STMT_BODY (switch_stmt) =
985 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
989 scope = TREE_CHAIN (switch_stmt);
990 TREE_CHAIN (switch_stmt) = NULL;
991 add_stmt (do_poplevel (scope));
994 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
998 begin_try_block (void)
1000 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
1002 TRY_STMTS (r) = push_stmt_list ();
1006 /* Likewise, for a function-try-block. The block returned in
1007 *COMPOUND_STMT is an artificial outer scope, containing the
1008 function-try-block. */
1011 begin_function_try_block (tree *compound_stmt)
1014 /* This outer scope does not exist in the C++ standard, but we need
1015 a place to put __FUNCTION__ and similar variables. */
1016 *compound_stmt = begin_compound_stmt (0);
1017 r = begin_try_block ();
1018 FN_TRY_BLOCK_P (r) = 1;
1022 /* Finish a try-block, which may be given by TRY_BLOCK. */
1025 finish_try_block (tree try_block)
1027 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1028 TRY_HANDLERS (try_block) = push_stmt_list ();
1031 /* Finish the body of a cleanup try-block, which may be given by
1035 finish_cleanup_try_block (tree try_block)
1037 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1040 /* Finish an implicitly generated try-block, with a cleanup is given
1044 finish_cleanup (tree cleanup, tree try_block)
1046 TRY_HANDLERS (try_block) = cleanup;
1047 CLEANUP_P (try_block) = 1;
1050 /* Likewise, for a function-try-block. */
1053 finish_function_try_block (tree try_block)
1055 finish_try_block (try_block);
1056 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1057 the try block, but moving it inside. */
1058 in_function_try_handler = 1;
1061 /* Finish a handler-sequence for a try-block, which may be given by
1065 finish_handler_sequence (tree try_block)
1067 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1068 check_handlers (TRY_HANDLERS (try_block));
1071 /* Finish the handler-seq for a function-try-block, given by
1072 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1073 begin_function_try_block. */
1076 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1078 in_function_try_handler = 0;
1079 finish_handler_sequence (try_block);
1080 finish_compound_stmt (compound_stmt);
1083 /* Begin a handler. Returns a HANDLER if appropriate. */
1086 begin_handler (void)
1090 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1093 /* Create a binding level for the eh_info and the exception object
1095 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1100 /* Finish the handler-parameters for a handler, which may be given by
1101 HANDLER. DECL is the declaration for the catch parameter, or NULL
1102 if this is a `catch (...)' clause. */
1105 finish_handler_parms (tree decl, tree handler)
1107 tree type = NULL_TREE;
1108 if (processing_template_decl)
1112 decl = pushdecl (decl);
1113 decl = push_template_decl (decl);
1114 HANDLER_PARMS (handler) = decl;
1115 type = TREE_TYPE (decl);
1119 type = expand_start_catch_block (decl);
1120 HANDLER_TYPE (handler) = type;
1121 if (!processing_template_decl && type)
1122 mark_used (eh_type_info (type));
1125 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1126 the return value from the matching call to finish_handler_parms. */
1129 finish_handler (tree handler)
1131 if (!processing_template_decl)
1132 expand_end_catch_block ();
1133 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1136 /* Begin a compound statement. FLAGS contains some bits that control the
1137 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1138 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1139 block of a function. If BCS_TRY_BLOCK is set, this is the block
1140 created on behalf of a TRY statement. Returns a token to be passed to
1141 finish_compound_stmt. */
1144 begin_compound_stmt (unsigned int flags)
1148 if (flags & BCS_NO_SCOPE)
1150 r = push_stmt_list ();
1151 STATEMENT_LIST_NO_SCOPE (r) = 1;
1153 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1154 But, if it's a statement-expression with a scopeless block, there's
1155 nothing to keep, and we don't want to accidentally keep a block
1156 *inside* the scopeless block. */
1157 keep_next_level (false);
1160 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1162 /* When processing a template, we need to remember where the braces were,
1163 so that we can set up identical scopes when instantiating the template
1164 later. BIND_EXPR is a handy candidate for this.
1165 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1166 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1167 processing templates. */
1168 if (processing_template_decl)
1170 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1171 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1172 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1173 TREE_SIDE_EFFECTS (r) = 1;
1179 /* Finish a compound-statement, which is given by STMT. */
1182 finish_compound_stmt (tree stmt)
1184 if (TREE_CODE (stmt) == BIND_EXPR)
1185 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1186 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1187 stmt = pop_stmt_list (stmt);
1190 /* Destroy any ObjC "super" receivers that may have been
1192 objc_clear_super_receiver ();
1194 stmt = do_poplevel (stmt);
1197 /* ??? See c_end_compound_stmt wrt statement expressions. */
1202 /* Finish an asm-statement, whose components are a STRING, some
1203 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1204 whether the asm-statement should be considered volatile. */
1207 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1208 tree input_operands, tree clobbers)
1212 int ninputs = list_length (input_operands);
1213 int noutputs = list_length (output_operands);
1215 if (!processing_template_decl)
1217 const char *constraint;
1218 const char **oconstraints;
1219 bool allows_mem, allows_reg, is_inout;
1223 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1225 string = resolve_asm_operand_names (string, output_operands,
1228 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1230 operand = TREE_VALUE (t);
1232 /* ??? Really, this should not be here. Users should be using a
1233 proper lvalue, dammit. But there's a long history of using
1234 casts in the output operands. In cases like longlong.h, this
1235 becomes a primitive form of typechecking -- if the cast can be
1236 removed, then the output operand had a type of the proper width;
1237 otherwise we'll get an error. Gross, but ... */
1238 STRIP_NOPS (operand);
1240 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1241 operand = error_mark_node;
1243 if (operand != error_mark_node
1244 && (TREE_READONLY (operand)
1245 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1246 /* Functions are not modifiable, even though they are
1248 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1249 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1250 /* If it's an aggregate and any field is const, then it is
1251 effectively const. */
1252 || (CLASS_TYPE_P (TREE_TYPE (operand))
1253 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1254 readonly_error (operand, "assignment (via 'asm' output)");
1256 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1257 oconstraints[i] = constraint;
1259 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1260 &allows_mem, &allows_reg, &is_inout))
1262 /* If the operand is going to end up in memory,
1263 mark it addressable. */
1264 if (!allows_reg && !cxx_mark_addressable (operand))
1265 operand = error_mark_node;
1268 operand = error_mark_node;
1270 TREE_VALUE (t) = operand;
1273 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1275 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1276 operand = decay_conversion (TREE_VALUE (t));
1278 /* If the type of the operand hasn't been determined (e.g.,
1279 because it involves an overloaded function), then issue
1280 an error message. There's no context available to
1281 resolve the overloading. */
1282 if (TREE_TYPE (operand) == unknown_type_node)
1284 error ("type of asm operand %qE could not be determined",
1286 operand = error_mark_node;
1289 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1290 oconstraints, &allows_mem, &allows_reg))
1292 /* If the operand is going to end up in memory,
1293 mark it addressable. */
1294 if (!allows_reg && allows_mem)
1296 /* Strip the nops as we allow this case. FIXME, this really
1297 should be rejected or made deprecated. */
1298 STRIP_NOPS (operand);
1299 if (!cxx_mark_addressable (operand))
1300 operand = error_mark_node;
1304 operand = error_mark_node;
1306 TREE_VALUE (t) = operand;
1310 r = build_stmt (ASM_EXPR, string,
1311 output_operands, input_operands,
1313 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1314 r = maybe_cleanup_point_expr_void (r);
1315 return add_stmt (r);
1318 /* Finish a label with the indicated NAME. Returns the new label. */
1321 finish_label_stmt (tree name)
1323 tree decl = define_label (input_location, name);
1325 if (decl == error_mark_node)
1326 return error_mark_node;
1328 add_stmt (build_stmt (LABEL_EXPR, decl));
1333 /* Finish a series of declarations for local labels. G++ allows users
1334 to declare "local" labels, i.e., labels with scope. This extension
1335 is useful when writing code involving statement-expressions. */
1338 finish_label_decl (tree name)
1340 if (!at_function_scope_p ())
1342 error ("__label__ declarations are only allowed in function scopes");
1346 add_decl_expr (declare_local_label (name));
1349 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1352 finish_decl_cleanup (tree decl, tree cleanup)
1354 push_cleanup (decl, cleanup, false);
1357 /* If the current scope exits with an exception, run CLEANUP. */
1360 finish_eh_cleanup (tree cleanup)
1362 push_cleanup (NULL, cleanup, true);
1365 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1366 order they were written by the user. Each node is as for
1367 emit_mem_initializers. */
1370 finish_mem_initializers (tree mem_inits)
1372 /* Reorder the MEM_INITS so that they are in the order they appeared
1373 in the source program. */
1374 mem_inits = nreverse (mem_inits);
1376 if (processing_template_decl)
1380 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1382 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1383 check for bare parameter packs in the TREE_VALUE, because
1384 any parameter packs in the TREE_VALUE have already been
1385 bound as part of the TREE_PURPOSE. See
1386 make_pack_expansion for more information. */
1387 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1388 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1389 TREE_VALUE (mem) = error_mark_node;
1392 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1395 emit_mem_initializers (mem_inits);
1398 /* Finish a parenthesized expression EXPR. */
1401 finish_parenthesized_expr (tree expr)
1404 /* This inhibits warnings in c_common_truthvalue_conversion. */
1405 TREE_NO_WARNING (expr) = 1;
1407 if (TREE_CODE (expr) == OFFSET_REF)
1408 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1409 enclosed in parentheses. */
1410 PTRMEM_OK_P (expr) = 0;
1412 if (TREE_CODE (expr) == STRING_CST)
1413 PAREN_STRING_LITERAL_P (expr) = 1;
1418 /* Finish a reference to a non-static data member (DECL) that is not
1419 preceded by `.' or `->'. */
1422 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1424 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1426 if (!object && skip_evaluation)
1428 /* DR 613: Can use non-static data members without an associated
1429 object in sizeof/decltype/alignof. */
1430 tree scope = qualifying_scope;
1431 if (scope == NULL_TREE)
1432 scope = context_for_name_lookup (decl);
1433 object = maybe_dummy_object (scope, NULL);
1438 if (current_function_decl
1439 && DECL_STATIC_FUNCTION_P (current_function_decl))
1440 error ("invalid use of member %q+D in static member function", decl);
1442 error ("invalid use of non-static data member %q+D", decl);
1443 error ("from this location");
1445 return error_mark_node;
1447 if (current_class_ptr)
1448 TREE_USED (current_class_ptr) = 1;
1449 if (processing_template_decl && !qualifying_scope)
1451 tree type = TREE_TYPE (decl);
1453 if (TREE_CODE (type) == REFERENCE_TYPE)
1454 type = TREE_TYPE (type);
1457 /* Set the cv qualifiers. */
1458 int quals = (current_class_ref
1459 ? cp_type_quals (TREE_TYPE (current_class_ref))
1460 : TYPE_UNQUALIFIED);
1462 if (DECL_MUTABLE_P (decl))
1463 quals &= ~TYPE_QUAL_CONST;
1465 quals |= cp_type_quals (TREE_TYPE (decl));
1466 type = cp_build_qualified_type (type, quals);
1469 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1473 tree access_type = TREE_TYPE (object);
1474 tree lookup_context = context_for_name_lookup (decl);
1476 while (!DERIVED_FROM_P (lookup_context, access_type))
1478 access_type = TYPE_CONTEXT (access_type);
1479 while (access_type && DECL_P (access_type))
1480 access_type = DECL_CONTEXT (access_type);
1484 error ("object missing in reference to %q+D", decl);
1485 error ("from this location");
1486 return error_mark_node;
1490 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1491 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1493 if (processing_template_decl)
1494 return build_qualified_name (TREE_TYPE (decl),
1497 /*template_p=*/false);
1499 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1502 /* If the data member was named `C::M', convert `*this' to `C'
1504 if (qualifying_scope)
1506 tree binfo = NULL_TREE;
1507 object = build_scoped_ref (object, qualifying_scope,
1511 return build_class_member_access_expr (object, decl,
1512 /*access_path=*/NULL_TREE,
1513 /*preserve_reference=*/false,
1514 tf_warning_or_error);
1518 /* DECL was the declaration to which a qualified-id resolved. Issue
1519 an error message if it is not accessible. If OBJECT_TYPE is
1520 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1521 type of `*x', or `x', respectively. If the DECL was named as
1522 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1525 check_accessibility_of_qualified_id (tree decl,
1527 tree nested_name_specifier)
1530 tree qualifying_type = NULL_TREE;
1532 /* If we are parsing a template declaration and if decl is a typedef,
1533 add it to a list tied to the template.
1534 At template instantiation time, that list will be walked and
1535 access check performed. */
1536 if (is_typedef_decl (decl))
1538 /* This the scope through which type_decl is accessed.
1539 It will be useful information later to do access check for
1541 tree scope = nested_name_specifier
1542 ? nested_name_specifier
1543 : DECL_CONTEXT (decl);
1544 tree templ_info = NULL;
1545 tree cs = current_scope ();
1547 if (cs && (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL))
1548 templ_info = get_template_info (cs);
1551 && TI_TEMPLATE (templ_info)
1553 && CLASS_TYPE_P (scope)
1554 && !currently_open_class (scope))
1555 append_type_to_template_for_access_check (current_scope (), decl, scope);
1558 /* If we're not checking, return immediately. */
1559 if (deferred_access_no_check)
1562 /* Determine the SCOPE of DECL. */
1563 scope = context_for_name_lookup (decl);
1564 /* If the SCOPE is not a type, then DECL is not a member. */
1565 if (!TYPE_P (scope))
1567 /* Compute the scope through which DECL is being accessed. */
1569 /* OBJECT_TYPE might not be a class type; consider:
1571 class A { typedef int I; };
1575 In this case, we will have "A::I" as the DECL, but "I" as the
1577 && CLASS_TYPE_P (object_type)
1578 && DERIVED_FROM_P (scope, object_type))
1579 /* If we are processing a `->' or `.' expression, use the type of the
1581 qualifying_type = object_type;
1582 else if (nested_name_specifier)
1584 /* If the reference is to a non-static member of the
1585 current class, treat it as if it were referenced through
1587 if (DECL_NONSTATIC_MEMBER_P (decl)
1588 && current_class_ptr
1589 && DERIVED_FROM_P (scope, current_class_type))
1590 qualifying_type = current_class_type;
1591 /* Otherwise, use the type indicated by the
1592 nested-name-specifier. */
1594 qualifying_type = nested_name_specifier;
1597 /* Otherwise, the name must be from the current class or one of
1599 qualifying_type = currently_open_derived_class (scope);
1602 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1603 or similar in a default argument value. */
1604 && CLASS_TYPE_P (qualifying_type)
1605 && !dependent_type_p (qualifying_type))
1606 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1610 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1611 class named to the left of the "::" operator. DONE is true if this
1612 expression is a complete postfix-expression; it is false if this
1613 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1614 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1615 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1616 is true iff this qualified name appears as a template argument. */
1619 finish_qualified_id_expr (tree qualifying_class,
1624 bool template_arg_p)
1626 gcc_assert (TYPE_P (qualifying_class));
1628 if (error_operand_p (expr))
1629 return error_mark_node;
1631 if (DECL_P (expr) || BASELINK_P (expr))
1635 check_template_keyword (expr);
1637 /* If EXPR occurs as the operand of '&', use special handling that
1638 permits a pointer-to-member. */
1639 if (address_p && done)
1641 if (TREE_CODE (expr) == SCOPE_REF)
1642 expr = TREE_OPERAND (expr, 1);
1643 expr = build_offset_ref (qualifying_class, expr,
1644 /*address_p=*/true);
1648 /* Within the scope of a class, turn references to non-static
1649 members into expression of the form "this->...". */
1651 /* But, within a template argument, we do not want make the
1652 transformation, as there is no "this" pointer. */
1654 else if (TREE_CODE (expr) == FIELD_DECL)
1656 push_deferring_access_checks (dk_no_check);
1657 expr = finish_non_static_data_member (expr, current_class_ref,
1659 pop_deferring_access_checks ();
1661 else if (BASELINK_P (expr) && !processing_template_decl)
1665 /* See if any of the functions are non-static members. */
1666 fns = BASELINK_FUNCTIONS (expr);
1667 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1668 fns = TREE_OPERAND (fns, 0);
1669 /* If so, the expression may be relative to 'this'. */
1670 if (!shared_member_p (fns)
1671 && current_class_ref
1672 && DERIVED_FROM_P (qualifying_class, TREE_TYPE (current_class_ref)))
1673 expr = (build_class_member_access_expr
1674 (maybe_dummy_object (qualifying_class, NULL),
1676 BASELINK_ACCESS_BINFO (expr),
1677 /*preserve_reference=*/false,
1678 tf_warning_or_error));
1680 /* The expression is a qualified name whose address is not
1682 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1688 /* Begin a statement-expression. The value returned must be passed to
1689 finish_stmt_expr. */
1692 begin_stmt_expr (void)
1694 return push_stmt_list ();
1697 /* Process the final expression of a statement expression. EXPR can be
1698 NULL, if the final expression is empty. Return a STATEMENT_LIST
1699 containing all the statements in the statement-expression, or
1700 ERROR_MARK_NODE if there was an error. */
1703 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1705 if (error_operand_p (expr))
1707 /* The type of the statement-expression is the type of the last
1709 TREE_TYPE (stmt_expr) = error_mark_node;
1710 return error_mark_node;
1713 /* If the last statement does not have "void" type, then the value
1714 of the last statement is the value of the entire expression. */
1717 tree type = TREE_TYPE (expr);
1719 if (processing_template_decl)
1721 expr = build_stmt (EXPR_STMT, expr);
1722 expr = add_stmt (expr);
1723 /* Mark the last statement so that we can recognize it as such at
1724 template-instantiation time. */
1725 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1727 else if (VOID_TYPE_P (type))
1729 /* Just treat this like an ordinary statement. */
1730 expr = finish_expr_stmt (expr);
1734 /* It actually has a value we need to deal with. First, force it
1735 to be an rvalue so that we won't need to build up a copy
1736 constructor call later when we try to assign it to something. */
1737 expr = force_rvalue (expr);
1738 if (error_operand_p (expr))
1739 return error_mark_node;
1741 /* Update for array-to-pointer decay. */
1742 type = TREE_TYPE (expr);
1744 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1745 normal statement, but don't convert to void or actually add
1747 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1748 expr = maybe_cleanup_point_expr (expr);
1752 /* The type of the statement-expression is the type of the last
1754 TREE_TYPE (stmt_expr) = type;
1760 /* Finish a statement-expression. EXPR should be the value returned
1761 by the previous begin_stmt_expr. Returns an expression
1762 representing the statement-expression. */
1765 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1770 if (error_operand_p (stmt_expr))
1772 pop_stmt_list (stmt_expr);
1773 return error_mark_node;
1776 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1778 type = TREE_TYPE (stmt_expr);
1779 result = pop_stmt_list (stmt_expr);
1780 TREE_TYPE (result) = type;
1782 if (processing_template_decl)
1784 result = build_min (STMT_EXPR, type, result);
1785 TREE_SIDE_EFFECTS (result) = 1;
1786 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1788 else if (CLASS_TYPE_P (type))
1790 /* Wrap the statement-expression in a TARGET_EXPR so that the
1791 temporary object created by the final expression is destroyed at
1792 the end of the full-expression containing the
1793 statement-expression. */
1794 result = force_target_expr (type, result);
1800 /* Returns the expression which provides the value of STMT_EXPR. */
1803 stmt_expr_value_expr (tree stmt_expr)
1805 tree t = STMT_EXPR_STMT (stmt_expr);
1807 if (TREE_CODE (t) == BIND_EXPR)
1808 t = BIND_EXPR_BODY (t);
1810 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1811 t = STATEMENT_LIST_TAIL (t)->stmt;
1813 if (TREE_CODE (t) == EXPR_STMT)
1814 t = EXPR_STMT_EXPR (t);
1819 /* Perform Koenig lookup. FN is the postfix-expression representing
1820 the function (or functions) to call; ARGS are the arguments to the
1821 call. Returns the functions to be considered by overload
1825 perform_koenig_lookup (tree fn, VEC(tree,gc) *args)
1827 tree identifier = NULL_TREE;
1828 tree functions = NULL_TREE;
1829 tree tmpl_args = NULL_TREE;
1831 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1833 tmpl_args = TREE_OPERAND (fn, 1);
1834 fn = TREE_OPERAND (fn, 0);
1837 /* Find the name of the overloaded function. */
1838 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1840 else if (is_overloaded_fn (fn))
1843 identifier = DECL_NAME (get_first_fn (functions));
1845 else if (DECL_P (fn))
1848 identifier = DECL_NAME (fn);
1851 /* A call to a namespace-scope function using an unqualified name.
1853 Do Koenig lookup -- unless any of the arguments are
1855 if (!any_type_dependent_arguments_p (args)
1856 && !any_dependent_template_arguments_p (tmpl_args))
1858 fn = lookup_arg_dependent (identifier, functions, args);
1860 /* The unqualified name could not be resolved. */
1861 fn = unqualified_fn_lookup_error (identifier);
1864 if (fn && tmpl_args)
1865 fn = build_nt (TEMPLATE_ID_EXPR, fn, tmpl_args);
1870 /* Generate an expression for `FN (ARGS)'. This may change the
1873 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1874 as a virtual call, even if FN is virtual. (This flag is set when
1875 encountering an expression where the function name is explicitly
1876 qualified. For example a call to `X::f' never generates a virtual
1879 Returns code for the call. */
1882 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1883 bool koenig_p, tsubst_flags_t complain)
1887 VEC(tree,gc) *orig_args = NULL;
1889 if (fn == error_mark_node)
1890 return error_mark_node;
1892 gcc_assert (!TYPE_P (fn));
1896 if (processing_template_decl)
1898 if (type_dependent_expression_p (fn)
1899 || any_type_dependent_arguments_p (*args))
1901 result = build_nt_call_vec (fn, *args);
1902 KOENIG_LOOKUP_P (result) = koenig_p;
1907 tree fndecl = OVL_CURRENT (fn);
1908 if (TREE_CODE (fndecl) != FUNCTION_DECL
1909 || !TREE_THIS_VOLATILE (fndecl))
1915 current_function_returns_abnormally = 1;
1919 orig_args = make_tree_vector_copy (*args);
1920 if (!BASELINK_P (fn)
1921 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1922 && TREE_TYPE (fn) != unknown_type_node)
1923 fn = build_non_dependent_expr (fn);
1924 make_args_non_dependent (*args);
1927 if (is_overloaded_fn (fn))
1928 fn = baselink_for_fns (fn);
1931 if (BASELINK_P (fn))
1935 /* A call to a member function. From [over.call.func]:
1937 If the keyword this is in scope and refers to the class of
1938 that member function, or a derived class thereof, then the
1939 function call is transformed into a qualified function call
1940 using (*this) as the postfix-expression to the left of the
1941 . operator.... [Otherwise] a contrived object of type T
1942 becomes the implied object argument.
1944 This paragraph is unclear about this situation:
1946 struct A { void f(); };
1947 struct B : public A {};
1948 struct C : public A { void g() { B::f(); }};
1950 In particular, for `B::f', this paragraph does not make clear
1951 whether "the class of that member function" refers to `A' or
1952 to `B'. We believe it refers to `B'. */
1953 if (current_class_type
1954 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1956 && current_class_ref)
1957 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1961 tree representative_fn;
1963 representative_fn = BASELINK_FUNCTIONS (fn);
1964 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1965 representative_fn = TREE_OPERAND (representative_fn, 0);
1966 representative_fn = get_first_fn (representative_fn);
1967 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1970 if (processing_template_decl)
1972 if (type_dependent_expression_p (object))
1974 tree ret = build_nt_call_vec (orig_fn, orig_args);
1975 release_tree_vector (orig_args);
1978 object = build_non_dependent_expr (object);
1981 result = build_new_method_call (object, fn, args, NULL_TREE,
1983 ? LOOKUP_NONVIRTUAL : 0),
1987 else if (is_overloaded_fn (fn))
1989 /* If the function is an overloaded builtin, resolve it. */
1990 if (TREE_CODE (fn) == FUNCTION_DECL
1991 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1992 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1993 result = resolve_overloaded_builtin (fn, *args);
1996 /* A call to a namespace-scope function. */
1997 result = build_new_function_call (fn, args, koenig_p, complain);
1999 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2001 if (!VEC_empty (tree, *args))
2002 error ("arguments to destructor are not allowed");
2003 /* Mark the pseudo-destructor call as having side-effects so
2004 that we do not issue warnings about its use. */
2005 result = build1 (NOP_EXPR,
2007 TREE_OPERAND (fn, 0));
2008 TREE_SIDE_EFFECTS (result) = 1;
2010 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2011 /* If the "function" is really an object of class type, it might
2012 have an overloaded `operator ()'. */
2013 result = build_op_call (fn, args, complain);
2016 /* A call where the function is unknown. */
2017 result = cp_build_function_call_vec (fn, args, complain);
2019 if (processing_template_decl)
2021 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2022 KOENIG_LOOKUP_P (result) = koenig_p;
2023 release_tree_vector (orig_args);
2029 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2030 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2031 POSTDECREMENT_EXPR.) */
2034 finish_increment_expr (tree expr, enum tree_code code)
2036 return build_x_unary_op (code, expr, tf_warning_or_error);
2039 /* Finish a use of `this'. Returns an expression for `this'. */
2042 finish_this_expr (void)
2046 if (current_class_ptr)
2048 result = current_class_ptr;
2050 else if (current_function_decl
2051 && DECL_STATIC_FUNCTION_P (current_function_decl))
2053 error ("%<this%> is unavailable for static member functions");
2054 result = error_mark_node;
2058 if (current_function_decl)
2059 error ("invalid use of %<this%> in non-member function");
2061 error ("invalid use of %<this%> at top level");
2062 result = error_mark_node;
2068 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2069 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2070 the TYPE for the type given. If SCOPE is non-NULL, the expression
2071 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2074 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2076 if (object == error_mark_node || destructor == error_mark_node)
2077 return error_mark_node;
2079 gcc_assert (TYPE_P (destructor));
2081 if (!processing_template_decl)
2083 if (scope == error_mark_node)
2085 error ("invalid qualifying scope in pseudo-destructor name");
2086 return error_mark_node;
2088 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2090 error ("qualified type %qT does not match destructor name ~%qT",
2092 return error_mark_node;
2096 /* [expr.pseudo] says both:
2098 The type designated by the pseudo-destructor-name shall be
2099 the same as the object type.
2103 The cv-unqualified versions of the object type and of the
2104 type designated by the pseudo-destructor-name shall be the
2107 We implement the more generous second sentence, since that is
2108 what most other compilers do. */
2109 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2112 error ("%qE is not of type %qT", object, destructor);
2113 return error_mark_node;
2117 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2120 /* Finish an expression of the form CODE EXPR. */
2123 finish_unary_op_expr (enum tree_code code, tree expr)
2125 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2126 /* Inside a template, build_x_unary_op does not fold the
2127 expression. So check whether the result is folded before
2128 setting TREE_NEGATED_INT. */
2129 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2130 && TREE_CODE (result) == INTEGER_CST
2131 && !TYPE_UNSIGNED (TREE_TYPE (result))
2132 && INT_CST_LT (result, integer_zero_node))
2134 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2135 setting TREE_NEGATED_INT. */
2136 result = copy_node (result);
2137 TREE_NEGATED_INT (result) = 1;
2139 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2140 overflow_warning (result);
2145 /* Finish a compound-literal expression. TYPE is the type to which
2146 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2149 finish_compound_literal (tree type, tree compound_literal)
2151 if (type == error_mark_node)
2152 return error_mark_node;
2154 if (!TYPE_OBJ_P (type))
2156 error ("compound literal of non-object type %qT", type);
2157 return error_mark_node;
2160 if (processing_template_decl)
2162 TREE_TYPE (compound_literal) = type;
2163 /* Mark the expression as a compound literal. */
2164 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2165 return compound_literal;
2168 type = complete_type (type);
2170 if (TYPE_NON_AGGREGATE_CLASS (type))
2172 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2173 everywhere that deals with function arguments would be a pain, so
2174 just wrap it in a TREE_LIST. The parser set a flag so we know
2175 that it came from T{} rather than T({}). */
2176 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2177 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2178 return build_functional_cast (type, compound_literal, tf_error);
2181 if (TREE_CODE (type) == ARRAY_TYPE
2182 && check_array_initializer (NULL_TREE, type, compound_literal))
2183 return error_mark_node;
2184 compound_literal = reshape_init (type, compound_literal);
2185 if (TREE_CODE (type) == ARRAY_TYPE)
2186 cp_complete_array_type (&type, compound_literal, false);
2187 compound_literal = digest_init (type, compound_literal);
2188 if ((!at_function_scope_p () || cp_type_readonly (type))
2189 && initializer_constant_valid_p (compound_literal, type))
2191 tree decl = create_temporary_var (type);
2192 DECL_INITIAL (decl) = compound_literal;
2193 TREE_STATIC (decl) = 1;
2194 decl = pushdecl_top_level (decl);
2195 DECL_NAME (decl) = make_anon_name ();
2196 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2200 return get_target_expr (compound_literal);
2203 /* Return the declaration for the function-name variable indicated by
2207 finish_fname (tree id)
2211 decl = fname_decl (input_location, C_RID_CODE (id), id);
2212 if (processing_template_decl)
2213 decl = DECL_NAME (decl);
2217 /* Finish a translation unit. */
2220 finish_translation_unit (void)
2222 /* In case there were missing closebraces,
2223 get us back to the global binding level. */
2225 while (current_namespace != global_namespace)
2228 /* Do file scope __FUNCTION__ et al. */
2229 finish_fname_decls ();
2232 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2233 Returns the parameter. */
2236 finish_template_type_parm (tree aggr, tree identifier)
2238 if (aggr != class_type_node)
2240 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2241 aggr = class_type_node;
2244 return build_tree_list (aggr, identifier);
2247 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2248 Returns the parameter. */
2251 finish_template_template_parm (tree aggr, tree identifier)
2253 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2254 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2255 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2256 DECL_TEMPLATE_RESULT (tmpl) = decl;
2257 DECL_ARTIFICIAL (decl) = 1;
2258 end_template_decl ();
2260 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2262 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2263 /*is_primary=*/true, /*is_partial=*/false,
2266 return finish_template_type_parm (aggr, tmpl);
2269 /* ARGUMENT is the default-argument value for a template template
2270 parameter. If ARGUMENT is invalid, issue error messages and return
2271 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2274 check_template_template_default_arg (tree argument)
2276 if (TREE_CODE (argument) != TEMPLATE_DECL
2277 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2278 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2280 if (TREE_CODE (argument) == TYPE_DECL)
2281 error ("invalid use of type %qT as a default value for a template "
2282 "template-parameter", TREE_TYPE (argument));
2284 error ("invalid default argument for a template template parameter");
2285 return error_mark_node;
2291 /* Begin a class definition, as indicated by T. */
2294 begin_class_definition (tree t, tree attributes)
2296 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2297 return error_mark_node;
2299 if (processing_template_parmlist)
2301 error ("definition of %q#T inside template parameter list", t);
2302 return error_mark_node;
2304 /* A non-implicit typename comes from code like:
2306 template <typename T> struct A {
2307 template <typename U> struct A<T>::B ...
2309 This is erroneous. */
2310 else if (TREE_CODE (t) == TYPENAME_TYPE)
2312 error ("invalid definition of qualified type %qT", t);
2313 t = error_mark_node;
2316 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2318 t = make_class_type (RECORD_TYPE);
2319 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2322 /* Update the location of the decl. */
2323 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2325 if (TYPE_BEING_DEFINED (t))
2327 t = make_class_type (TREE_CODE (t));
2328 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2330 maybe_process_partial_specialization (t);
2332 TYPE_BEING_DEFINED (t) = 1;
2334 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2336 if (flag_pack_struct)
2339 TYPE_PACKED (t) = 1;
2340 /* Even though the type is being defined for the first time
2341 here, there might have been a forward declaration, so there
2342 might be cv-qualified variants of T. */
2343 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2344 TYPE_PACKED (v) = 1;
2346 /* Reset the interface data, at the earliest possible
2347 moment, as it might have been set via a class foo;
2349 if (! TYPE_ANONYMOUS_P (t))
2351 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2352 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2353 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2354 (t, finfo->interface_unknown);
2356 reset_specialization();
2358 /* Make a declaration for this class in its own scope. */
2359 build_self_reference ();
2364 /* Finish the member declaration given by DECL. */
2367 finish_member_declaration (tree decl)
2369 if (decl == error_mark_node || decl == NULL_TREE)
2372 if (decl == void_type_node)
2373 /* The COMPONENT was a friend, not a member, and so there's
2374 nothing for us to do. */
2377 /* We should see only one DECL at a time. */
2378 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2380 /* Set up access control for DECL. */
2382 = (current_access_specifier == access_private_node);
2383 TREE_PROTECTED (decl)
2384 = (current_access_specifier == access_protected_node);
2385 if (TREE_CODE (decl) == TEMPLATE_DECL)
2387 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2388 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2391 /* Mark the DECL as a member of the current class. */
2392 DECL_CONTEXT (decl) = current_class_type;
2394 /* Check for bare parameter packs in the member variable declaration. */
2395 if (TREE_CODE (decl) == FIELD_DECL)
2397 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2398 TREE_TYPE (decl) = error_mark_node;
2399 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2400 DECL_ATTRIBUTES (decl) = NULL_TREE;
2405 A C language linkage is ignored for the names of class members
2406 and the member function type of class member functions. */
2407 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2408 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2410 /* Put functions on the TYPE_METHODS list and everything else on the
2411 TYPE_FIELDS list. Note that these are built up in reverse order.
2412 We reverse them (to obtain declaration order) in finish_struct. */
2413 if (TREE_CODE (decl) == FUNCTION_DECL
2414 || DECL_FUNCTION_TEMPLATE_P (decl))
2416 /* We also need to add this function to the
2417 CLASSTYPE_METHOD_VEC. */
2418 if (add_method (current_class_type, decl, NULL_TREE))
2420 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2421 TYPE_METHODS (current_class_type) = decl;
2423 maybe_add_class_template_decl_list (current_class_type, decl,
2427 /* Enter the DECL into the scope of the class. */
2428 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2429 || pushdecl_class_level (decl))
2431 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2432 go at the beginning. The reason is that lookup_field_1
2433 searches the list in order, and we want a field name to
2434 override a type name so that the "struct stat hack" will
2435 work. In particular:
2437 struct S { enum E { }; int E } s;
2440 is valid. In addition, the FIELD_DECLs must be maintained in
2441 declaration order so that class layout works as expected.
2442 However, we don't need that order until class layout, so we
2443 save a little time by putting FIELD_DECLs on in reverse order
2444 here, and then reversing them in finish_struct_1. (We could
2445 also keep a pointer to the correct insertion points in the
2448 if (TREE_CODE (decl) == TYPE_DECL)
2449 TYPE_FIELDS (current_class_type)
2450 = chainon (TYPE_FIELDS (current_class_type), decl);
2453 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2454 TYPE_FIELDS (current_class_type) = decl;
2457 maybe_add_class_template_decl_list (current_class_type, decl,
2462 note_decl_for_pch (decl);
2465 /* DECL has been declared while we are building a PCH file. Perform
2466 actions that we might normally undertake lazily, but which can be
2467 performed now so that they do not have to be performed in
2468 translation units which include the PCH file. */
2471 note_decl_for_pch (tree decl)
2473 gcc_assert (pch_file);
2475 /* There's a good chance that we'll have to mangle names at some
2476 point, even if only for emission in debugging information. */
2477 if ((TREE_CODE (decl) == VAR_DECL
2478 || TREE_CODE (decl) == FUNCTION_DECL)
2479 && !processing_template_decl)
2483 /* Finish processing a complete template declaration. The PARMS are
2484 the template parameters. */
2487 finish_template_decl (tree parms)
2490 end_template_decl ();
2492 end_specialization ();
2495 /* Finish processing a template-id (which names a type) of the form
2496 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2497 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2498 the scope of template-id indicated. */
2501 finish_template_type (tree name, tree args, int entering_scope)
2505 decl = lookup_template_class (name, args,
2506 NULL_TREE, NULL_TREE, entering_scope,
2507 tf_warning_or_error | tf_user);
2508 if (decl != error_mark_node)
2509 decl = TYPE_STUB_DECL (decl);
2514 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2515 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2516 BASE_CLASS, or NULL_TREE if an error occurred. The
2517 ACCESS_SPECIFIER is one of
2518 access_{default,public,protected_private}_node. For a virtual base
2519 we set TREE_TYPE. */
2522 finish_base_specifier (tree base, tree access, bool virtual_p)
2526 if (base == error_mark_node)
2528 error ("invalid base-class specification");
2531 else if (! MAYBE_CLASS_TYPE_P (base))
2533 error ("%qT is not a class type", base);
2538 if (cp_type_quals (base) != 0)
2540 error ("base class %qT has cv qualifiers", base);
2541 base = TYPE_MAIN_VARIANT (base);
2543 result = build_tree_list (access, base);
2545 TREE_TYPE (result) = integer_type_node;
2551 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2552 what we found when we tried to do the lookup.
2553 LOCATION is the location of the NAME identifier;
2554 The location is used in the error message*/
2557 qualified_name_lookup_error (tree scope, tree name,
2558 tree decl, location_t location)
2560 if (scope == error_mark_node)
2561 ; /* We already complained. */
2562 else if (TYPE_P (scope))
2564 if (!COMPLETE_TYPE_P (scope))
2565 error ("%Hincomplete type %qT used in nested name specifier",
2567 else if (TREE_CODE (decl) == TREE_LIST)
2569 error ("%Hreference to %<%T::%D%> is ambiguous", &location, scope, name);
2570 print_candidates (decl);
2573 error ("%H%qD is not a member of %qT", &location, name, scope);
2575 else if (scope != global_namespace)
2576 error ("%H%qD is not a member of %qD", &location, name, scope);
2578 error ("%H%<::%D%> has not been declared", &location, name);
2581 /* If FNS is a member function, a set of member functions, or a
2582 template-id referring to one or more member functions, return a
2583 BASELINK for FNS, incorporating the current access context.
2584 Otherwise, return FNS unchanged. */
2587 baselink_for_fns (tree fns)
2592 if (BASELINK_P (fns)
2593 || error_operand_p (fns))
2597 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2598 fn = TREE_OPERAND (fn, 0);
2599 fn = get_first_fn (fn);
2600 if (!DECL_FUNCTION_MEMBER_P (fn))
2603 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2605 cl = DECL_CONTEXT (fn);
2606 cl = TYPE_BINFO (cl);
2607 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2610 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2611 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2612 if non-NULL, is the type or namespace used to explicitly qualify
2613 ID_EXPRESSION. DECL is the entity to which that name has been
2616 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2617 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2618 be set to true if this expression isn't permitted in a
2619 constant-expression, but it is otherwise not set by this function.
2620 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2621 constant-expression, but a non-constant expression is also
2624 DONE is true if this expression is a complete postfix-expression;
2625 it is false if this expression is followed by '->', '[', '(', etc.
2626 ADDRESS_P is true iff this expression is the operand of '&'.
2627 TEMPLATE_P is true iff the qualified-id was of the form
2628 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2629 appears as a template argument.
2631 If an error occurs, and it is the kind of error that might cause
2632 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2633 is the caller's responsibility to issue the message. *ERROR_MSG
2634 will be a string with static storage duration, so the caller need
2637 Return an expression for the entity, after issuing appropriate
2638 diagnostics. This function is also responsible for transforming a
2639 reference to a non-static member into a COMPONENT_REF that makes
2640 the use of "this" explicit.
2642 Upon return, *IDK will be filled in appropriately. */
2644 finish_id_expression (tree id_expression,
2648 bool integral_constant_expression_p,
2649 bool allow_non_integral_constant_expression_p,
2650 bool *non_integral_constant_expression_p,
2654 bool template_arg_p,
2655 const char **error_msg,
2656 location_t location)
2658 /* Initialize the output parameters. */
2659 *idk = CP_ID_KIND_NONE;
2662 if (id_expression == error_mark_node)
2663 return error_mark_node;
2664 /* If we have a template-id, then no further lookup is
2665 required. If the template-id was for a template-class, we
2666 will sometimes have a TYPE_DECL at this point. */
2667 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2668 || TREE_CODE (decl) == TYPE_DECL)
2670 /* Look up the name. */
2673 if (decl == error_mark_node)
2675 /* Name lookup failed. */
2678 || (!dependent_type_p (scope)
2679 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2680 && IDENTIFIER_TYPENAME_P (id_expression)
2681 && dependent_type_p (TREE_TYPE (id_expression))))))
2683 /* If the qualifying type is non-dependent (and the name
2684 does not name a conversion operator to a dependent
2685 type), issue an error. */
2686 qualified_name_lookup_error (scope, id_expression, decl, location);
2687 return error_mark_node;
2691 /* It may be resolved via Koenig lookup. */
2692 *idk = CP_ID_KIND_UNQUALIFIED;
2693 return id_expression;
2696 decl = id_expression;
2698 /* If DECL is a variable that would be out of scope under
2699 ANSI/ISO rules, but in scope in the ARM, name lookup
2700 will succeed. Issue a diagnostic here. */
2702 decl = check_for_out_of_scope_variable (decl);
2704 /* Remember that the name was used in the definition of
2705 the current class so that we can check later to see if
2706 the meaning would have been different after the class
2707 was entirely defined. */
2708 if (!scope && decl != error_mark_node)
2709 maybe_note_name_used_in_class (id_expression, decl);
2711 /* Disallow uses of local variables from containing functions. */
2712 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2714 tree context = decl_function_context (decl);
2715 if (context != NULL_TREE && context != current_function_decl
2716 && ! TREE_STATIC (decl))
2718 error (TREE_CODE (decl) == VAR_DECL
2719 ? "use of %<auto%> variable from containing function"
2720 : "use of parameter from containing function");
2721 error (" %q+#D declared here", decl);
2722 return error_mark_node;
2727 /* If we didn't find anything, or what we found was a type,
2728 then this wasn't really an id-expression. */
2729 if (TREE_CODE (decl) == TEMPLATE_DECL
2730 && !DECL_FUNCTION_TEMPLATE_P (decl))
2732 *error_msg = "missing template arguments";
2733 return error_mark_node;
2735 else if (TREE_CODE (decl) == TYPE_DECL
2736 || TREE_CODE (decl) == NAMESPACE_DECL)
2738 *error_msg = "expected primary-expression";
2739 return error_mark_node;
2742 /* If the name resolved to a template parameter, there is no
2743 need to look it up again later. */
2744 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2745 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2749 *idk = CP_ID_KIND_NONE;
2750 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2751 decl = TEMPLATE_PARM_DECL (decl);
2752 r = convert_from_reference (DECL_INITIAL (decl));
2754 if (integral_constant_expression_p
2755 && !dependent_type_p (TREE_TYPE (decl))
2756 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2758 if (!allow_non_integral_constant_expression_p)
2759 error ("template parameter %qD of type %qT is not allowed in "
2760 "an integral constant expression because it is not of "
2761 "integral or enumeration type", decl, TREE_TYPE (decl));
2762 *non_integral_constant_expression_p = true;
2766 /* Similarly, we resolve enumeration constants to their
2767 underlying values. */
2768 else if (TREE_CODE (decl) == CONST_DECL)
2770 *idk = CP_ID_KIND_NONE;
2771 if (!processing_template_decl)
2773 used_types_insert (TREE_TYPE (decl));
2774 return DECL_INITIAL (decl);
2782 /* If the declaration was explicitly qualified indicate
2783 that. The semantics of `A::f(3)' are different than
2784 `f(3)' if `f' is virtual. */
2786 ? CP_ID_KIND_QUALIFIED
2787 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2788 ? CP_ID_KIND_TEMPLATE_ID
2789 : CP_ID_KIND_UNQUALIFIED));
2794 An id-expression is type-dependent if it contains an
2795 identifier that was declared with a dependent type.
2797 The standard is not very specific about an id-expression that
2798 names a set of overloaded functions. What if some of them
2799 have dependent types and some of them do not? Presumably,
2800 such a name should be treated as a dependent name. */
2801 /* Assume the name is not dependent. */
2802 dependent_p = false;
2803 if (!processing_template_decl)
2804 /* No names are dependent outside a template. */
2806 /* A template-id where the name of the template was not resolved
2807 is definitely dependent. */
2808 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2809 && (TREE_CODE (TREE_OPERAND (decl, 0))
2810 == IDENTIFIER_NODE))
2812 /* For anything except an overloaded function, just check its
2814 else if (!is_overloaded_fn (decl))
2816 = dependent_type_p (TREE_TYPE (decl));
2817 /* For a set of overloaded functions, check each of the
2823 if (BASELINK_P (fns))
2824 fns = BASELINK_FUNCTIONS (fns);
2826 /* For a template-id, check to see if the template
2827 arguments are dependent. */
2828 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2830 tree args = TREE_OPERAND (fns, 1);
2831 dependent_p = any_dependent_template_arguments_p (args);
2832 /* The functions are those referred to by the
2834 fns = TREE_OPERAND (fns, 0);
2837 /* If there are no dependent template arguments, go through
2838 the overloaded functions. */
2839 while (fns && !dependent_p)
2841 tree fn = OVL_CURRENT (fns);
2843 /* Member functions of dependent classes are
2845 if (TREE_CODE (fn) == FUNCTION_DECL
2846 && type_dependent_expression_p (fn))
2848 else if (TREE_CODE (fn) == TEMPLATE_DECL
2849 && dependent_template_p (fn))
2852 fns = OVL_NEXT (fns);
2856 /* If the name was dependent on a template parameter, we will
2857 resolve the name at instantiation time. */
2860 /* Create a SCOPE_REF for qualified names, if the scope is
2866 if (address_p && done)
2867 decl = finish_qualified_id_expr (scope, decl,
2873 tree type = NULL_TREE;
2874 if (DECL_P (decl) && !dependent_scope_p (scope))
2875 type = TREE_TYPE (decl);
2876 decl = build_qualified_name (type,
2882 if (TREE_TYPE (decl))
2883 decl = convert_from_reference (decl);
2886 /* A TEMPLATE_ID already contains all the information we
2888 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2889 return id_expression;
2890 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2891 /* If we found a variable, then name lookup during the
2892 instantiation will always resolve to the same VAR_DECL
2893 (or an instantiation thereof). */
2894 if (TREE_CODE (decl) == VAR_DECL
2895 || TREE_CODE (decl) == PARM_DECL)
2896 return convert_from_reference (decl);
2897 /* The same is true for FIELD_DECL, but we also need to
2898 make sure that the syntax is correct. */
2899 else if (TREE_CODE (decl) == FIELD_DECL)
2901 /* Since SCOPE is NULL here, this is an unqualified name.
2902 Access checking has been performed during name lookup
2903 already. Turn off checking to avoid duplicate errors. */
2904 push_deferring_access_checks (dk_no_check);
2905 decl = finish_non_static_data_member
2906 (decl, current_class_ref,
2907 /*qualifying_scope=*/NULL_TREE);
2908 pop_deferring_access_checks ();
2911 return id_expression;
2914 /* Only certain kinds of names are allowed in constant
2915 expression. Enumerators and template parameters have already
2916 been handled above. */
2917 if (integral_constant_expression_p
2918 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2919 && ! builtin_valid_in_constant_expr_p (decl))
2921 if (!allow_non_integral_constant_expression_p)
2923 error ("%qD cannot appear in a constant-expression", decl);
2924 return error_mark_node;
2926 *non_integral_constant_expression_p = true;
2929 if (TREE_CODE (decl) == NAMESPACE_DECL)
2931 error ("use of namespace %qD as expression", decl);
2932 return error_mark_node;
2934 else if (DECL_CLASS_TEMPLATE_P (decl))
2936 error ("use of class template %qT as expression", decl);
2937 return error_mark_node;
2939 else if (TREE_CODE (decl) == TREE_LIST)
2941 /* Ambiguous reference to base members. */
2942 error ("request for member %qD is ambiguous in "
2943 "multiple inheritance lattice", id_expression);
2944 print_candidates (decl);
2945 return error_mark_node;
2948 /* Mark variable-like entities as used. Functions are similarly
2949 marked either below or after overload resolution. */
2950 if (TREE_CODE (decl) == VAR_DECL
2951 || TREE_CODE (decl) == PARM_DECL
2952 || TREE_CODE (decl) == RESULT_DECL)
2957 decl = (adjust_result_of_qualified_name_lookup
2958 (decl, scope, current_class_type));
2960 if (TREE_CODE (decl) == FUNCTION_DECL)
2963 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2964 decl = finish_qualified_id_expr (scope,
2972 tree r = convert_from_reference (decl);
2974 if (processing_template_decl && TYPE_P (scope))
2975 r = build_qualified_name (TREE_TYPE (r),
2981 else if (TREE_CODE (decl) == FIELD_DECL)
2983 /* Since SCOPE is NULL here, this is an unqualified name.
2984 Access checking has been performed during name lookup
2985 already. Turn off checking to avoid duplicate errors. */
2986 push_deferring_access_checks (dk_no_check);
2987 decl = finish_non_static_data_member (decl, current_class_ref,
2988 /*qualifying_scope=*/NULL_TREE);
2989 pop_deferring_access_checks ();
2991 else if (is_overloaded_fn (decl))
2996 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2997 first_fn = TREE_OPERAND (first_fn, 0);
2998 first_fn = get_first_fn (first_fn);
2999 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3000 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3002 if (!really_overloaded_fn (decl))
3003 mark_used (first_fn);
3006 && TREE_CODE (first_fn) == FUNCTION_DECL
3007 && DECL_FUNCTION_MEMBER_P (first_fn)
3008 && !shared_member_p (decl))
3010 /* A set of member functions. */
3011 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3012 return finish_class_member_access_expr (decl, id_expression,
3013 /*template_p=*/false,
3014 tf_warning_or_error);
3017 decl = baselink_for_fns (decl);
3021 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3022 && DECL_CLASS_SCOPE_P (decl))
3024 tree context = context_for_name_lookup (decl);
3025 if (context != current_class_type)
3027 tree path = currently_open_derived_class (context);
3028 perform_or_defer_access_check (TYPE_BINFO (path),
3033 decl = convert_from_reference (decl);
3037 if (TREE_DEPRECATED (decl))
3038 warn_deprecated_use (decl, NULL_TREE);
3043 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3044 use as a type-specifier. */
3047 finish_typeof (tree expr)
3051 if (type_dependent_expression_p (expr))
3053 type = cxx_make_type (TYPEOF_TYPE);
3054 TYPEOF_TYPE_EXPR (type) = expr;
3055 SET_TYPE_STRUCTURAL_EQUALITY (type);
3060 type = unlowered_expr_type (expr);
3062 if (!type || type == unknown_type_node)
3064 error ("type of %qE is unknown", expr);
3065 return error_mark_node;
3071 /* Perform C++-specific checks for __builtin_offsetof before calling
3075 finish_offsetof (tree expr)
3077 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3079 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3080 TREE_OPERAND (expr, 2));
3081 return error_mark_node;
3083 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3084 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3085 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3087 if (TREE_CODE (expr) == COMPONENT_REF
3088 || TREE_CODE (expr) == COMPOUND_EXPR)
3089 expr = TREE_OPERAND (expr, 1);
3090 error ("cannot apply %<offsetof%> to member function %qD", expr);
3091 return error_mark_node;
3093 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3094 expr = TREE_OPERAND (expr, 0);
3095 return fold_offsetof (expr, NULL_TREE);
3098 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3099 function is broken out from the above for the benefit of the tree-ssa
3103 simplify_aggr_init_expr (tree *tp)
3105 tree aggr_init_expr = *tp;
3107 /* Form an appropriate CALL_EXPR. */
3108 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3109 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3110 tree type = TREE_TYPE (slot);
3113 enum style_t { ctor, arg, pcc } style;
3115 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3117 #ifdef PCC_STATIC_STRUCT_RETURN
3123 gcc_assert (TREE_ADDRESSABLE (type));
3127 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3129 aggr_init_expr_nargs (aggr_init_expr),
3130 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3134 /* Replace the first argument to the ctor with the address of the
3136 cxx_mark_addressable (slot);
3137 CALL_EXPR_ARG (call_expr, 0) =
3138 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3140 else if (style == arg)
3142 /* Just mark it addressable here, and leave the rest to
3143 expand_call{,_inline}. */
3144 cxx_mark_addressable (slot);
3145 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3146 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3148 else if (style == pcc)
3150 /* If we're using the non-reentrant PCC calling convention, then we
3151 need to copy the returned value out of the static buffer into the
3153 push_deferring_access_checks (dk_no_check);
3154 call_expr = build_aggr_init (slot, call_expr,
3155 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3156 tf_warning_or_error);
3157 pop_deferring_access_checks ();
3158 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3161 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3163 tree init = build_zero_init (type, NULL_TREE,
3164 /*static_storage_p=*/false);
3165 init = build2 (INIT_EXPR, void_type_node, slot, init);
3166 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3173 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3176 emit_associated_thunks (tree fn)
3178 /* When we use vcall offsets, we emit thunks with the virtual
3179 functions to which they thunk. The whole point of vcall offsets
3180 is so that you can know statically the entire set of thunks that
3181 will ever be needed for a given virtual function, thereby
3182 enabling you to output all the thunks with the function itself. */
3183 if (DECL_VIRTUAL_P (fn))
3187 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3189 if (!THUNK_ALIAS (thunk))
3191 use_thunk (thunk, /*emit_p=*/1);
3192 if (DECL_RESULT_THUNK_P (thunk))
3196 for (probe = DECL_THUNKS (thunk);
3197 probe; probe = TREE_CHAIN (probe))
3198 use_thunk (probe, /*emit_p=*/1);
3202 gcc_assert (!DECL_THUNKS (thunk));
3207 /* Generate RTL for FN. */
3210 expand_or_defer_fn (tree fn)
3212 /* When the parser calls us after finishing the body of a template
3213 function, we don't really want to expand the body. */
3214 if (processing_template_decl)
3216 /* Normally, collection only occurs in rest_of_compilation. So,
3217 if we don't collect here, we never collect junk generated
3218 during the processing of templates until we hit a
3219 non-template function. It's not safe to do this inside a
3220 nested class, though, as the parser may have local state that
3221 is not a GC root. */
3222 if (!function_depth)
3227 gcc_assert (gimple_body (fn));
3229 /* If this is a constructor or destructor body, we have to clone
3231 if (maybe_clone_body (fn))
3233 /* We don't want to process FN again, so pretend we've written
3234 it out, even though we haven't. */
3235 TREE_ASM_WRITTEN (fn) = 1;
3239 /* We make a decision about linkage for these functions at the end
3240 of the compilation. Until that point, we do not want the back
3241 end to output them -- but we do want it to see the bodies of
3242 these functions so that it can inline them as appropriate. */
3243 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3245 if (DECL_INTERFACE_KNOWN (fn))
3246 /* We've already made a decision as to how this function will
3250 DECL_EXTERNAL (fn) = 1;
3251 DECL_NOT_REALLY_EXTERN (fn) = 1;
3252 note_vague_linkage_fn (fn);
3253 /* A non-template inline function with external linkage will
3254 always be COMDAT. As we must eventually determine the
3255 linkage of all functions, and as that causes writes to
3256 the data mapped in from the PCH file, it's advantageous
3257 to mark the functions at this point. */
3258 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3260 /* This function must have external linkage, as
3261 otherwise DECL_INTERFACE_KNOWN would have been
3263 gcc_assert (TREE_PUBLIC (fn));
3264 comdat_linkage (fn);
3265 DECL_INTERFACE_KNOWN (fn) = 1;
3269 import_export_decl (fn);
3271 /* If the user wants us to keep all inline functions, then mark
3272 this function as needed so that finish_file will make sure to
3273 output it later. Similarly, all dllexport'd functions must
3274 be emitted; there may be callers in other DLLs. */
3275 if ((flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3276 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3280 /* There's no reason to do any of the work here if we're only doing
3281 semantic analysis; this code just generates RTL. */
3282 if (flag_syntax_only)
3287 /* Expand or defer, at the whim of the compilation unit manager. */
3288 cgraph_finalize_function (fn, function_depth > 1);
3300 /* Helper function for walk_tree, used by finalize_nrv below. */
3303 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3305 struct nrv_data *dp = (struct nrv_data *)data;
3308 /* No need to walk into types. There wouldn't be any need to walk into
3309 non-statements, except that we have to consider STMT_EXPRs. */
3312 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3313 but differs from using NULL_TREE in that it indicates that we care
3314 about the value of the RESULT_DECL. */
3315 else if (TREE_CODE (*tp) == RETURN_EXPR)
3316 TREE_OPERAND (*tp, 0) = dp->result;
3317 /* Change all cleanups for the NRV to only run when an exception is
3319 else if (TREE_CODE (*tp) == CLEANUP_STMT
3320 && CLEANUP_DECL (*tp) == dp->var)
3321 CLEANUP_EH_ONLY (*tp) = 1;
3322 /* Replace the DECL_EXPR for the NRV with an initialization of the
3323 RESULT_DECL, if needed. */
3324 else if (TREE_CODE (*tp) == DECL_EXPR
3325 && DECL_EXPR_DECL (*tp) == dp->var)
3328 if (DECL_INITIAL (dp->var)
3329 && DECL_INITIAL (dp->var) != error_mark_node)
3330 init = build2 (INIT_EXPR, void_type_node, dp->result,
3331 DECL_INITIAL (dp->var));
3333 init = build_empty_stmt ();
3334 DECL_INITIAL (dp->var) = NULL_TREE;
3335 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3338 /* And replace all uses of the NRV with the RESULT_DECL. */
3339 else if (*tp == dp->var)
3342 /* Avoid walking into the same tree more than once. Unfortunately, we
3343 can't just use walk_tree_without duplicates because it would only call
3344 us for the first occurrence of dp->var in the function body. */
3345 slot = htab_find_slot (dp->visited, *tp, INSERT);
3351 /* Keep iterating. */
3355 /* Called from finish_function to implement the named return value
3356 optimization by overriding all the RETURN_EXPRs and pertinent
3357 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3358 RESULT_DECL for the function. */
3361 finalize_nrv (tree *tp, tree var, tree result)
3363 struct nrv_data data;
3365 /* Copy debugging information from VAR to RESULT. */
3366 DECL_NAME (result) = DECL_NAME (var);
3367 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3368 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3369 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3370 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3371 /* Don't forget that we take its address. */
3372 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3375 data.result = result;
3376 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3377 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3378 htab_delete (data.visited);
3381 /* Return the declaration for the function called by CALL_EXPR T,
3382 TYPE is the class type of the clause decl. */
3385 omp_clause_info_fndecl (tree t, tree type)
3387 tree ret = get_callee_fndecl (t);
3392 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3393 t = CALL_EXPR_FN (t);
3395 if (TREE_CODE (t) == OBJ_TYPE_REF)
3397 t = cp_fold_obj_type_ref (t, type);
3398 if (TREE_CODE (t) == ADDR_EXPR
3399 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3400 return TREE_OPERAND (t, 0);
3406 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3409 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3410 bool need_copy_ctor, bool need_copy_assignment)
3412 int save_errorcount = errorcount;
3415 /* Always allocate 3 elements for simplicity. These are the
3416 function decls for the ctor, dtor, and assignment op.
3417 This layout is known to the three lang hooks,
3418 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3419 and cxx_omp_clause_assign_op. */
3420 info = make_tree_vec (3);
3421 CP_OMP_CLAUSE_INFO (c) = info;
3423 if (need_default_ctor
3424 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3428 if (need_default_ctor)
3432 t = build_int_cst (build_pointer_type (type), 0);
3433 t = build1 (INDIRECT_REF, type, t);
3434 vec = make_tree_vector_single (t);
3436 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3437 &vec, type, LOOKUP_NORMAL,
3438 tf_warning_or_error);
3441 release_tree_vector (vec);
3443 if (targetm.cxx.cdtor_returns_this () || errorcount)
3444 /* Because constructors and destructors return this,
3445 the call will have been cast to "void". Remove the
3446 cast here. We would like to use STRIP_NOPS, but it
3447 wouldn't work here because TYPE_MODE (t) and
3448 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3449 They are VOIDmode and Pmode, respectively. */
3450 if (TREE_CODE (t) == NOP_EXPR)
3451 t = TREE_OPERAND (t, 0);
3453 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3456 if ((need_default_ctor || need_copy_ctor)
3457 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3459 t = build_int_cst (build_pointer_type (type), 0);
3460 t = build1 (INDIRECT_REF, type, t);
3461 t = build_special_member_call (t, complete_dtor_identifier,
3462 NULL, type, LOOKUP_NORMAL,
3463 tf_warning_or_error);
3465 if (targetm.cxx.cdtor_returns_this () || errorcount)
3466 /* Because constructors and destructors return this,
3467 the call will have been cast to "void". Remove the
3468 cast here. We would like to use STRIP_NOPS, but it
3469 wouldn't work here because TYPE_MODE (t) and
3470 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3471 They are VOIDmode and Pmode, respectively. */
3472 if (TREE_CODE (t) == NOP_EXPR)
3473 t = TREE_OPERAND (t, 0);
3475 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3478 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3482 t = build_int_cst (build_pointer_type (type), 0);
3483 t = build1 (INDIRECT_REF, type, t);
3484 vec = make_tree_vector_single (t);
3485 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3486 &vec, type, LOOKUP_NORMAL,
3487 tf_warning_or_error);
3488 release_tree_vector (vec);
3490 /* We'll have called convert_from_reference on the call, which
3491 may well have added an indirect_ref. It's unneeded here,
3492 and in the way, so kill it. */
3493 if (TREE_CODE (t) == INDIRECT_REF)
3494 t = TREE_OPERAND (t, 0);
3496 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3499 return errorcount != save_errorcount;
3502 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3503 Remove any elements from the list that are invalid. */
3506 finish_omp_clauses (tree clauses)
3508 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3509 tree c, t, *pc = &clauses;
3512 bitmap_obstack_initialize (NULL);
3513 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3514 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3515 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3517 for (pc = &clauses, c = clauses; c ; c = *pc)
3519 bool remove = false;
3521 switch (OMP_CLAUSE_CODE (c))
3523 case OMP_CLAUSE_SHARED:
3525 goto check_dup_generic;
3526 case OMP_CLAUSE_PRIVATE:
3528 goto check_dup_generic;
3529 case OMP_CLAUSE_REDUCTION:
3531 goto check_dup_generic;
3532 case OMP_CLAUSE_COPYPRIVATE:
3533 name = "copyprivate";
3534 goto check_dup_generic;
3535 case OMP_CLAUSE_COPYIN:
3537 goto check_dup_generic;
3539 t = OMP_CLAUSE_DECL (c);
3540 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3542 if (processing_template_decl)
3545 error ("%qD is not a variable in clause %qs", t, name);
3547 error ("%qE is not a variable in clause %qs", t, name);
3550 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3551 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3552 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3554 error ("%qD appears more than once in data clauses", t);
3558 bitmap_set_bit (&generic_head, DECL_UID (t));
3561 case OMP_CLAUSE_FIRSTPRIVATE:
3562 t = OMP_CLAUSE_DECL (c);
3563 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3565 if (processing_template_decl)
3568 error ("%qD is not a variable in clause %<firstprivate%>", t);
3570 error ("%qE is not a variable in clause %<firstprivate%>", t);
3573 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3574 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3576 error ("%qD appears more than once in data clauses", t);
3580 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3583 case OMP_CLAUSE_LASTPRIVATE:
3584 t = OMP_CLAUSE_DECL (c);
3585 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3587 if (processing_template_decl)
3590 error ("%qD is not a variable in clause %<lastprivate%>", t);
3592 error ("%qE is not a variable in clause %<lastprivate%>", t);
3595 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3596 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3598 error ("%qD appears more than once in data clauses", t);
3602 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3606 t = OMP_CLAUSE_IF_EXPR (c);
3607 t = maybe_convert_cond (t);
3608 if (t == error_mark_node)
3610 OMP_CLAUSE_IF_EXPR (c) = t;
3613 case OMP_CLAUSE_NUM_THREADS:
3614 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3615 if (t == error_mark_node)
3617 else if (!type_dependent_expression_p (t)
3618 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3620 error ("num_threads expression must be integral");
3625 case OMP_CLAUSE_SCHEDULE:
3626 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3629 else if (t == error_mark_node)
3631 else if (!type_dependent_expression_p (t)
3632 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3634 error ("schedule chunk size expression must be integral");
3639 case OMP_CLAUSE_NOWAIT:
3640 case OMP_CLAUSE_ORDERED:
3641 case OMP_CLAUSE_DEFAULT:
3642 case OMP_CLAUSE_UNTIED:
3643 case OMP_CLAUSE_COLLAPSE:
3651 *pc = OMP_CLAUSE_CHAIN (c);
3653 pc = &OMP_CLAUSE_CHAIN (c);
3656 for (pc = &clauses, c = clauses; c ; c = *pc)
3658 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3659 bool remove = false;
3660 bool need_complete_non_reference = false;
3661 bool need_default_ctor = false;
3662 bool need_copy_ctor = false;
3663 bool need_copy_assignment = false;
3664 bool need_implicitly_determined = false;
3665 tree type, inner_type;
3669 case OMP_CLAUSE_SHARED:
3671 need_implicitly_determined = true;
3673 case OMP_CLAUSE_PRIVATE:
3675 need_complete_non_reference = true;
3676 need_default_ctor = true;
3677 need_implicitly_determined = true;
3679 case OMP_CLAUSE_FIRSTPRIVATE:
3680 name = "firstprivate";
3681 need_complete_non_reference = true;
3682 need_copy_ctor = true;
3683 need_implicitly_determined = true;
3685 case OMP_CLAUSE_LASTPRIVATE:
3686 name = "lastprivate";
3687 need_complete_non_reference = true;
3688 need_copy_assignment = true;
3689 need_implicitly_determined = true;
3691 case OMP_CLAUSE_REDUCTION:
3693 need_implicitly_determined = true;
3695 case OMP_CLAUSE_COPYPRIVATE:
3696 name = "copyprivate";
3697 need_copy_assignment = true;
3699 case OMP_CLAUSE_COPYIN:
3701 need_copy_assignment = true;
3704 pc = &OMP_CLAUSE_CHAIN (c);
3708 t = OMP_CLAUSE_DECL (c);
3709 if (processing_template_decl
3710 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3712 pc = &OMP_CLAUSE_CHAIN (c);
3718 case OMP_CLAUSE_LASTPRIVATE:
3719 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3720 need_default_ctor = true;
3723 case OMP_CLAUSE_REDUCTION:
3724 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3725 || POINTER_TYPE_P (TREE_TYPE (t)))
3727 error ("%qE has invalid type for %<reduction%>", t);
3730 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3732 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3740 error ("%qE has invalid type for %<reduction(%s)%>",
3741 t, operator_name_info[r_code].name);
3747 case OMP_CLAUSE_COPYIN:
3748 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3750 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3759 if (need_complete_non_reference)
3761 t = require_complete_type (t);
3762 if (t == error_mark_node)
3764 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3766 error ("%qE has reference type for %qs", t, name);
3770 if (need_implicitly_determined)
3772 const char *share_name = NULL;
3774 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3775 share_name = "threadprivate";
3776 else switch (cxx_omp_predetermined_sharing (t))
3778 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3780 case OMP_CLAUSE_DEFAULT_SHARED:
3781 share_name = "shared";
3783 case OMP_CLAUSE_DEFAULT_PRIVATE:
3784 share_name = "private";
3791 error ("%qE is predetermined %qs for %qs",
3792 t, share_name, name);
3797 /* We're interested in the base element, not arrays. */
3798 inner_type = type = TREE_TYPE (t);
3799 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3800 inner_type = TREE_TYPE (inner_type);
3802 /* Check for special function availability by building a call to one.
3803 Save the results, because later we won't be in the right context
3804 for making these queries. */
3805 if (CLASS_TYPE_P (inner_type)
3806 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3807 && !type_dependent_expression_p (t)
3808 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3809 need_copy_ctor, need_copy_assignment))
3813 *pc = OMP_CLAUSE_CHAIN (c);
3815 pc = &OMP_CLAUSE_CHAIN (c);
3818 bitmap_obstack_release (NULL);
3822 /* For all variables in the tree_list VARS, mark them as thread local. */
3825 finish_omp_threadprivate (tree vars)
3829 /* Mark every variable in VARS to be assigned thread local storage. */
3830 for (t = vars; t; t = TREE_CHAIN (t))
3832 tree v = TREE_PURPOSE (t);
3834 if (error_operand_p (v))
3836 else if (TREE_CODE (v) != VAR_DECL)
3837 error ("%<threadprivate%> %qD is not file, namespace "
3838 "or block scope variable", v);
3839 /* If V had already been marked threadprivate, it doesn't matter
3840 whether it had been used prior to this point. */
3841 else if (TREE_USED (v)
3842 && (DECL_LANG_SPECIFIC (v) == NULL
3843 || !CP_DECL_THREADPRIVATE_P (v)))
3844 error ("%qE declared %<threadprivate%> after first use", v);
3845 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3846 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3847 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3848 error ("%<threadprivate%> %qE has incomplete type", v);
3849 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3850 && CP_DECL_CONTEXT (v) != current_class_type)
3851 error ("%<threadprivate%> %qE directive not "
3852 "in %qT definition", v, CP_DECL_CONTEXT (v));
3855 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3856 if (DECL_LANG_SPECIFIC (v) == NULL)
3858 retrofit_lang_decl (v);
3860 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3861 after the allocation of the lang_decl structure. */
3862 if (DECL_DISCRIMINATOR_P (v))
3863 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3866 if (! DECL_THREAD_LOCAL_P (v))
3868 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3869 /* If rtl has been already set for this var, call
3870 make_decl_rtl once again, so that encode_section_info
3871 has a chance to look at the new decl flags. */
3872 if (DECL_RTL_SET_P (v))
3875 CP_DECL_THREADPRIVATE_P (v) = 1;
3880 /* Build an OpenMP structured block. */
3883 begin_omp_structured_block (void)
3885 return do_pushlevel (sk_omp);
3889 finish_omp_structured_block (tree block)
3891 return do_poplevel (block);
3894 /* Similarly, except force the retention of the BLOCK. */
3897 begin_omp_parallel (void)
3899 keep_next_level (true);
3900 return begin_omp_structured_block ();
3904 finish_omp_parallel (tree clauses, tree body)
3908 body = finish_omp_structured_block (body);
3910 stmt = make_node (OMP_PARALLEL);
3911 TREE_TYPE (stmt) = void_type_node;
3912 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3913 OMP_PARALLEL_BODY (stmt) = body;
3915 return add_stmt (stmt);
3919 begin_omp_task (void)
3921 keep_next_level (true);
3922 return begin_omp_structured_block ();
3926 finish_omp_task (tree clauses, tree body)
3930 body = finish_omp_structured_block (body);
3932 stmt = make_node (OMP_TASK);
3933 TREE_TYPE (stmt) = void_type_node;
3934 OMP_TASK_CLAUSES (stmt) = clauses;
3935 OMP_TASK_BODY (stmt) = body;
3937 return add_stmt (stmt);
3940 /* Helper function for finish_omp_for. Convert Ith random access iterator
3941 into integral iterator. Return FALSE if successful. */
3944 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3945 tree condv, tree incrv, tree *body,
3946 tree *pre_body, tree clauses)
3948 tree diff, iter_init, iter_incr = NULL, last;
3949 tree incr_var = NULL, orig_pre_body, orig_body, c;
3950 tree decl = TREE_VEC_ELT (declv, i);
3951 tree init = TREE_VEC_ELT (initv, i);
3952 tree cond = TREE_VEC_ELT (condv, i);
3953 tree incr = TREE_VEC_ELT (incrv, i);
3955 location_t elocus = locus;
3957 if (init && EXPR_HAS_LOCATION (init))
3958 elocus = EXPR_LOCATION (init);
3960 switch (TREE_CODE (cond))
3966 if (TREE_OPERAND (cond, 1) == iter)
3967 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
3968 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
3969 if (TREE_OPERAND (cond, 0) != iter)
3970 cond = error_mark_node;
3973 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3974 TREE_OPERAND (cond, 1), ERROR_MARK,
3975 NULL, tf_warning_or_error);
3976 if (error_operand_p (tem))
3981 cond = error_mark_node;
3984 if (cond == error_mark_node)
3986 error ("%Hinvalid controlling predicate", &elocus);
3989 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
3990 ERROR_MARK, iter, ERROR_MARK, NULL,
3991 tf_warning_or_error);
3992 if (error_operand_p (diff))
3994 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
3996 error ("%Hdifference between %qE and %qD does not have integer type",
3997 &elocus, TREE_OPERAND (cond, 1), iter);
4001 switch (TREE_CODE (incr))
4003 case PREINCREMENT_EXPR:
4004 case PREDECREMENT_EXPR:
4005 case POSTINCREMENT_EXPR:
4006 case POSTDECREMENT_EXPR:
4007 if (TREE_OPERAND (incr, 0) != iter)
4009 incr = error_mark_node;
4012 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4013 tf_warning_or_error);
4014 if (error_operand_p (iter_incr))
4016 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4017 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4018 incr = integer_one_node;
4020 incr = integer_minus_one_node;
4023 if (TREE_OPERAND (incr, 0) != iter)
4024 incr = error_mark_node;
4025 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4026 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4028 tree rhs = TREE_OPERAND (incr, 1);
4029 if (TREE_OPERAND (rhs, 0) == iter)
4031 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4033 incr = error_mark_node;
4036 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4037 TREE_OPERAND (rhs, 1),
4038 tf_warning_or_error);
4039 if (error_operand_p (iter_incr))
4041 incr = TREE_OPERAND (rhs, 1);
4042 incr = cp_convert (TREE_TYPE (diff), incr);
4043 if (TREE_CODE (rhs) == MINUS_EXPR)
4045 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4046 incr = fold_if_not_in_template (incr);
4048 if (TREE_CODE (incr) != INTEGER_CST
4049 && (TREE_CODE (incr) != NOP_EXPR
4050 || (TREE_CODE (TREE_OPERAND (incr, 0))
4055 else if (TREE_OPERAND (rhs, 1) == iter)
4057 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4058 || TREE_CODE (rhs) != PLUS_EXPR)
4059 incr = error_mark_node;
4062 iter_incr = build_x_binary_op (PLUS_EXPR,
4063 TREE_OPERAND (rhs, 0),
4066 tf_warning_or_error);
4067 if (error_operand_p (iter_incr))
4069 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4071 tf_warning_or_error);
4072 if (error_operand_p (iter_incr))
4074 incr = TREE_OPERAND (rhs, 0);
4079 incr = error_mark_node;
4082 incr = error_mark_node;
4085 incr = error_mark_node;
4089 if (incr == error_mark_node)
4091 error ("%Hinvalid increment expression", &elocus);
4095 incr = cp_convert (TREE_TYPE (diff), incr);
4096 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4097 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4098 && OMP_CLAUSE_DECL (c) == iter)
4101 decl = create_temporary_var (TREE_TYPE (diff));
4103 add_decl_expr (decl);
4104 last = create_temporary_var (TREE_TYPE (diff));
4106 add_decl_expr (last);
4107 if (c && iter_incr == NULL)
4109 incr_var = create_temporary_var (TREE_TYPE (diff));
4110 pushdecl (incr_var);
4111 add_decl_expr (incr_var);
4113 gcc_assert (stmts_are_full_exprs_p ());
4115 orig_pre_body = *pre_body;
4116 *pre_body = push_stmt_list ();
4118 add_stmt (orig_pre_body);
4120 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4121 tf_warning_or_error));
4122 init = build_int_cst (TREE_TYPE (diff), 0);
4123 if (c && iter_incr == NULL)
4125 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4126 incr, tf_warning_or_error));
4128 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4129 tf_warning_or_error);
4131 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4132 tf_warning_or_error));
4133 *pre_body = pop_stmt_list (*pre_body);
4135 cond = cp_build_binary_op (elocus,
4136 TREE_CODE (cond), decl, diff,
4137 tf_warning_or_error);
4138 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4142 *body = push_stmt_list ();
4143 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4144 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4145 tf_warning_or_error);
4146 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4147 finish_expr_stmt (iter_init);
4148 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4149 tf_warning_or_error));
4150 add_stmt (orig_body);
4151 *body = pop_stmt_list (*body);
4155 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4156 finish_expr_stmt (iter_incr);
4157 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4158 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4161 TREE_VEC_ELT (declv, i) = decl;
4162 TREE_VEC_ELT (initv, i) = init;
4163 TREE_VEC_ELT (condv, i) = cond;
4164 TREE_VEC_ELT (incrv, i) = incr;
4169 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4170 are directly for their associated operands in the statement. DECL
4171 and INIT are a combo; if DECL is NULL then INIT ought to be a
4172 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4173 optional statements that need to go before the loop into its
4177 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4178 tree incrv, tree body, tree pre_body, tree clauses)
4180 tree omp_for = NULL, orig_incr = NULL;
4181 tree decl, init, cond, incr;
4185 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4186 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4187 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4188 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4190 decl = TREE_VEC_ELT (declv, i);
4191 init = TREE_VEC_ELT (initv, i);
4192 cond = TREE_VEC_ELT (condv, i);
4193 incr = TREE_VEC_ELT (incrv, i);
4199 switch (TREE_CODE (init))
4202 decl = TREE_OPERAND (init, 0);
4203 init = TREE_OPERAND (init, 1);
4206 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4208 decl = TREE_OPERAND (init, 0);
4209 init = TREE_OPERAND (init, 2);
4218 error ("%Hexpected iteration declaration or initialization",
4224 if (init && EXPR_HAS_LOCATION (init))
4225 elocus = EXPR_LOCATION (init);
4229 error ("%Hmissing controlling predicate", &elocus);
4235 error ("%Hmissing increment expression", &elocus);
4239 TREE_VEC_ELT (declv, i) = decl;
4240 TREE_VEC_ELT (initv, i) = init;
4243 if (dependent_omp_for_p (declv, initv, condv, incrv))
4247 stmt = make_node (OMP_FOR);
4249 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4251 /* This is really just a place-holder. We'll be decomposing this
4252 again and going through the cp_build_modify_expr path below when
4253 we instantiate the thing. */
4254 TREE_VEC_ELT (initv, i)
4255 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4256 TREE_VEC_ELT (initv, i));
4259 TREE_TYPE (stmt) = void_type_node;
4260 OMP_FOR_INIT (stmt) = initv;
4261 OMP_FOR_COND (stmt) = condv;
4262 OMP_FOR_INCR (stmt) = incrv;
4263 OMP_FOR_BODY (stmt) = body;
4264 OMP_FOR_PRE_BODY (stmt) = pre_body;
4265 OMP_FOR_CLAUSES (stmt) = clauses;
4267 SET_EXPR_LOCATION (stmt, locus);
4268 return add_stmt (stmt);
4271 if (processing_template_decl)
4272 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4274 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4276 decl = TREE_VEC_ELT (declv, i);
4277 init = TREE_VEC_ELT (initv, i);
4278 cond = TREE_VEC_ELT (condv, i);
4279 incr = TREE_VEC_ELT (incrv, i);
4281 TREE_VEC_ELT (orig_incr, i) = incr;
4284 if (init && EXPR_HAS_LOCATION (init))
4285 elocus = EXPR_LOCATION (init);
4289 error ("%Hexpected iteration declaration or initialization",
4294 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4297 TREE_VEC_ELT (orig_incr, i) = incr;
4298 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4299 TREE_CODE (TREE_OPERAND (incr, 1)),
4300 TREE_OPERAND (incr, 2),
4301 tf_warning_or_error);
4304 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4306 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4307 incrv, &body, &pre_body, clauses))
4312 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4313 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4315 error ("%Hinvalid type for iteration variable %qE", &elocus, decl);
4319 if (!processing_template_decl)
4321 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4322 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4325 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4327 && TREE_SIDE_EFFECTS (cond)
4328 && COMPARISON_CLASS_P (cond)
4329 && !processing_template_decl)
4331 tree t = TREE_OPERAND (cond, 0);
4332 if (TREE_SIDE_EFFECTS (t)
4334 && (TREE_CODE (t) != NOP_EXPR
4335 || TREE_OPERAND (t, 0) != decl))
4336 TREE_OPERAND (cond, 0)
4337 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4339 t = TREE_OPERAND (cond, 1);
4340 if (TREE_SIDE_EFFECTS (t)
4342 && (TREE_CODE (t) != NOP_EXPR
4343 || TREE_OPERAND (t, 0) != decl))
4344 TREE_OPERAND (cond, 1)
4345 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4347 if (decl == error_mark_node || init == error_mark_node)
4350 TREE_VEC_ELT (declv, i) = decl;
4351 TREE_VEC_ELT (initv, i) = init;
4352 TREE_VEC_ELT (condv, i) = cond;
4353 TREE_VEC_ELT (incrv, i) = incr;
4357 if (IS_EMPTY_STMT (pre_body))
4360 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4363 if (omp_for == NULL)
4366 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4368 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4369 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4371 if (TREE_CODE (incr) != MODIFY_EXPR)
4374 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4375 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4376 && !processing_template_decl)
4378 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4379 if (TREE_SIDE_EFFECTS (t)
4381 && (TREE_CODE (t) != NOP_EXPR
4382 || TREE_OPERAND (t, 0) != decl))
4383 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4384 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4386 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4387 if (TREE_SIDE_EFFECTS (t)
4389 && (TREE_CODE (t) != NOP_EXPR
4390 || TREE_OPERAND (t, 0) != decl))
4391 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4392 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4396 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4398 if (omp_for != NULL)
4399 OMP_FOR_CLAUSES (omp_for) = clauses;
4404 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4413 dependent_p = false;
4416 /* Even in a template, we can detect invalid uses of the atomic
4417 pragma if neither LHS nor RHS is type-dependent. */
4418 if (processing_template_decl)
4420 dependent_p = (type_dependent_expression_p (lhs)
4421 || type_dependent_expression_p (rhs));
4424 lhs = build_non_dependent_expr (lhs);
4425 rhs = build_non_dependent_expr (rhs);
4430 stmt = c_finish_omp_atomic (code, lhs, rhs);
4431 if (stmt == error_mark_node)
4434 if (processing_template_decl)
4435 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4436 build2 (code, void_type_node, orig_lhs, orig_rhs));
4441 finish_omp_barrier (void)
4443 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4444 VEC(tree,gc) *vec = make_tree_vector ();
4445 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4446 release_tree_vector (vec);
4447 finish_expr_stmt (stmt);
4451 finish_omp_flush (void)
4453 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4454 VEC(tree,gc) *vec = make_tree_vector ();
4455 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4456 release_tree_vector (vec);
4457 finish_expr_stmt (stmt);
4461 finish_omp_taskwait (void)
4463 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4464 VEC(tree,gc) *vec = make_tree_vector ();
4465 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4466 release_tree_vector (vec);
4467 finish_expr_stmt (stmt);
4471 init_cp_semantics (void)
4475 /* Build a STATIC_ASSERT for a static assertion with the condition
4476 CONDITION and the message text MESSAGE. LOCATION is the location
4477 of the static assertion in the source code. When MEMBER_P, this
4478 static assertion is a member of a class. */
4480 finish_static_assert (tree condition, tree message, location_t location,
4483 if (check_for_bare_parameter_packs (condition))
4484 condition = error_mark_node;
4486 if (type_dependent_expression_p (condition)
4487 || value_dependent_expression_p (condition))
4489 /* We're in a template; build a STATIC_ASSERT and put it in
4493 assertion = make_node (STATIC_ASSERT);
4494 STATIC_ASSERT_CONDITION (assertion) = condition;
4495 STATIC_ASSERT_MESSAGE (assertion) = message;
4496 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4499 maybe_add_class_template_decl_list (current_class_type,
4503 add_stmt (assertion);
4508 /* Fold the expression and convert it to a boolean value. */
4509 condition = fold_non_dependent_expr (condition);
4510 condition = cp_convert (boolean_type_node, condition);
4512 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4513 /* Do nothing; the condition is satisfied. */
4517 location_t saved_loc = input_location;
4519 input_location = location;
4520 if (TREE_CODE (condition) == INTEGER_CST
4521 && integer_zerop (condition))
4522 /* Report the error. */
4523 error ("static assertion failed: %E", message);
4524 else if (condition && condition != error_mark_node)
4525 error ("non-constant condition for static assertion");
4526 input_location = saved_loc;
4530 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4531 just return the type even though EXPR is a type-dependent expression.
4532 The ABI specifies which cases this applies to, which is a subset of the
4536 describable_type (tree expr)
4538 tree type = NULL_TREE;
4540 /* processing_template_decl isn't set when we're called from the mangling
4541 code, so bump it now. */
4542 ++processing_template_decl;
4543 if (! type_dependent_expression_p (expr)
4544 && ! type_unknown_p (expr))
4546 type = TREE_TYPE (expr);
4547 if (real_lvalue_p (expr))
4548 type = build_reference_type (type);
4550 --processing_template_decl;
4555 switch (TREE_CODE (expr))
4561 /* Named rvalue reference becomes lvalue. */
4562 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4567 case TEMPLATE_PARM_INDEX:
4569 case STATIC_CAST_EXPR:
4570 case REINTERPRET_CAST_EXPR:
4571 case CONST_CAST_EXPR:
4572 case DYNAMIC_CAST_EXPR:
4573 type = TREE_TYPE (expr);
4578 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4579 if (ptrtype && POINTER_TYPE_P (ptrtype))
4580 type = build_reference_type (TREE_TYPE (ptrtype));
4585 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4586 type = TREE_TYPE (expr);
4590 if (type && type_uses_auto (type))
4596 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4597 suitable for use as a type-specifier.
4599 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4600 id-expression or a class member access, FALSE when it was parsed as
4601 a full expression. */
4604 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4606 tree orig_expr = expr;
4607 tree type = NULL_TREE;
4609 if (!expr || error_operand_p (expr))
4610 return error_mark_node;
4613 || TREE_CODE (expr) == TYPE_DECL
4614 || (TREE_CODE (expr) == BIT_NOT_EXPR
4615 && TYPE_P (TREE_OPERAND (expr, 0))))
4617 error ("argument to decltype must be an expression");
4618 return error_mark_node;
4621 if (type_dependent_expression_p (expr))
4623 if (id_expression_or_member_access_p)
4625 switch (TREE_CODE (expr))
4632 case TEMPLATE_PARM_INDEX:
4633 type = TREE_TYPE (expr);
4641 if (type && !type_uses_auto (type))
4644 type = cxx_make_type (DECLTYPE_TYPE);
4645 DECLTYPE_TYPE_EXPR (type) = expr;
4646 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4647 = id_expression_or_member_access_p;
4648 SET_TYPE_STRUCTURAL_EQUALITY (type);
4653 /* The type denoted by decltype(e) is defined as follows: */
4655 if (id_expression_or_member_access_p)
4657 /* If e is an id-expression or a class member access (5.2.5
4658 [expr.ref]), decltype(e) is defined as the type of the entity
4659 named by e. If there is no such entity, or e names a set of
4660 overloaded functions, the program is ill-formed. */
4661 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4662 expr = lookup_name (expr);
4664 if (TREE_CODE (expr) == INDIRECT_REF)
4665 /* This can happen when the expression is, e.g., "a.b". Just
4666 look at the underlying operand. */
4667 expr = TREE_OPERAND (expr, 0);
4669 if (TREE_CODE (expr) == OFFSET_REF
4670 || TREE_CODE (expr) == MEMBER_REF)
4671 /* We're only interested in the field itself. If it is a
4672 BASELINK, we will need to see through it in the next
4674 expr = TREE_OPERAND (expr, 1);
4676 if (TREE_CODE (expr) == BASELINK)
4677 /* See through BASELINK nodes to the underlying functions. */
4678 expr = BASELINK_FUNCTIONS (expr);
4680 if (TREE_CODE (expr) == OVERLOAD)
4682 if (OVL_CHAIN (expr))
4684 error ("%qE refers to a set of overloaded functions", orig_expr);
4685 return error_mark_node;
4688 /* An overload set containing only one function: just look
4689 at that function. */
4690 expr = OVL_FUNCTION (expr);
4693 switch (TREE_CODE (expr))
4696 if (DECL_BIT_FIELD_TYPE (expr))
4698 type = DECL_BIT_FIELD_TYPE (expr);
4701 /* Fall through for fields that aren't bitfields. */
4708 case TEMPLATE_PARM_INDEX:
4709 type = TREE_TYPE (expr);
4713 type = error_mark_node;
4717 type = is_bitfield_expr_with_lowered_type (expr);
4719 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4726 /* We can get here when the id-expression refers to an
4728 type = TREE_TYPE (expr);
4732 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4733 || TREE_CODE (expr) == SCOPE_REF);
4734 error ("argument to decltype must be an expression");
4735 return error_mark_node;
4740 /* Expressions of reference type are sometimes wrapped in
4741 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4742 representation, not part of the language, so we have to look
4744 if (TREE_CODE (expr) == INDIRECT_REF
4745 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4747 expr = TREE_OPERAND (expr, 0);
4749 if (TREE_CODE (expr) == CALL_EXPR)
4751 /* If e is a function call (5.2.2 [expr.call]) or an
4752 invocation of an overloaded operator (parentheses around e
4753 are ignored), decltype(e) is defined as the return type of
4755 tree fndecl = get_callee_fndecl (expr);
4756 if (fndecl && fndecl != error_mark_node)
4757 type = TREE_TYPE (TREE_TYPE (fndecl));
4760 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4761 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4762 || TREE_CODE (target_type) == POINTER_TYPE)
4763 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4764 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4765 type = TREE_TYPE (TREE_TYPE (target_type));
4767 sorry ("unable to determine the declared type of expression %<%E%>",
4773 type = is_bitfield_expr_with_lowered_type (expr);
4776 /* Bitfields are special, because their type encodes the
4777 number of bits they store. If the expression referenced a
4778 bitfield, TYPE now has the declared type of that
4780 type = cp_build_qualified_type (type,
4781 cp_type_quals (TREE_TYPE (expr)));
4783 if (real_lvalue_p (expr))
4784 type = build_reference_type (type);
4788 /* Otherwise, where T is the type of e, if e is an lvalue,
4789 decltype(e) is defined as T&, otherwise decltype(e) is
4791 type = TREE_TYPE (expr);
4792 if (type == error_mark_node)
4793 return error_mark_node;
4794 else if (expr == current_class_ptr)
4795 /* If the expression is just "this", we want the
4796 cv-unqualified pointer for the "this" type. */
4797 type = TYPE_MAIN_VARIANT (type);
4798 else if (real_lvalue_p (expr))
4800 if (TREE_CODE (type) != REFERENCE_TYPE)
4801 type = build_reference_type (type);
4804 type = non_reference (type);
4809 if (!type || type == unknown_type_node)
4811 error ("type of %qE is unknown", expr);
4812 return error_mark_node;
4818 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4819 __has_nothrow_copy, depending on assign_p. */
4822 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4829 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4832 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4834 else if (TYPE_HAS_INIT_REF (type))
4836 /* If construction of the copy constructor was postponed, create
4838 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4839 lazily_declare_fn (sfk_copy_constructor, type);
4840 fns = CLASSTYPE_CONSTRUCTORS (type);
4845 for (; fns; fns = OVL_NEXT (fns))
4847 tree fn = OVL_CURRENT (fns);
4851 if (copy_fn_p (fn) == 0)
4854 else if (copy_fn_p (fn) <= 0)
4857 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4864 /* Actually evaluates the trait. */
4867 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4869 enum tree_code type_code1;
4872 type_code1 = TREE_CODE (type1);
4876 case CPTK_HAS_NOTHROW_ASSIGN:
4877 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4878 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4879 || (CLASS_TYPE_P (type1)
4880 && classtype_has_nothrow_assign_or_copy_p (type1,
4883 case CPTK_HAS_TRIVIAL_ASSIGN:
4884 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4885 && (pod_type_p (type1)
4886 || (CLASS_TYPE_P (type1)
4887 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4889 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4890 type1 = strip_array_types (type1);
4891 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4892 || (CLASS_TYPE_P (type1)
4893 && (t = locate_ctor (type1, NULL))
4894 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4896 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4897 type1 = strip_array_types (type1);
4898 return (pod_type_p (type1)
4899 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4901 case CPTK_HAS_NOTHROW_COPY:
4902 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4903 || (CLASS_TYPE_P (type1)
4904 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4906 case CPTK_HAS_TRIVIAL_COPY:
4907 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4908 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4910 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4911 type1 = strip_array_types (type1);
4912 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4913 || (CLASS_TYPE_P (type1)
4914 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4916 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4917 return (CLASS_TYPE_P (type1)
4918 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4920 case CPTK_IS_ABSTRACT:
4921 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4923 case CPTK_IS_BASE_OF:
4924 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4925 && DERIVED_FROM_P (type1, type2));
4928 return (NON_UNION_CLASS_TYPE_P (type1));
4930 case CPTK_IS_CONVERTIBLE_TO:
4935 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4938 return (type_code1 == ENUMERAL_TYPE);
4941 return (pod_type_p (type1));
4943 case CPTK_IS_POLYMORPHIC:
4944 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4947 return (type_code1 == UNION_TYPE);
4955 /* Returns true if TYPE is a complete type, an array of unknown bound,
4956 or (possibly cv-qualified) void, returns false otherwise. */
4959 check_trait_type (tree type)
4961 if (COMPLETE_TYPE_P (type))
4964 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
4967 if (VOID_TYPE_P (type))
4973 /* Process a trait expression. */
4976 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4978 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4979 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4980 || kind == CPTK_HAS_NOTHROW_COPY
4981 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4982 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4983 || kind == CPTK_HAS_TRIVIAL_COPY
4984 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4985 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4986 || kind == CPTK_IS_ABSTRACT
4987 || kind == CPTK_IS_BASE_OF
4988 || kind == CPTK_IS_CLASS
4989 || kind == CPTK_IS_CONVERTIBLE_TO
4990 || kind == CPTK_IS_EMPTY
4991 || kind == CPTK_IS_ENUM
4992 || kind == CPTK_IS_POD
4993 || kind == CPTK_IS_POLYMORPHIC
4994 || kind == CPTK_IS_UNION);
4996 if (kind == CPTK_IS_CONVERTIBLE_TO)
4998 sorry ("__is_convertible_to");
4999 return error_mark_node;
5002 if (type1 == error_mark_node
5003 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5004 && type2 == error_mark_node))
5005 return error_mark_node;
5007 if (processing_template_decl)
5009 tree trait_expr = make_node (TRAIT_EXPR);
5010 TREE_TYPE (trait_expr) = boolean_type_node;
5011 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5012 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5013 TRAIT_EXPR_KIND (trait_expr) = kind;
5017 complete_type (type1);
5019 complete_type (type2);
5023 case CPTK_HAS_NOTHROW_ASSIGN:
5024 case CPTK_HAS_TRIVIAL_ASSIGN:
5025 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5026 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5027 case CPTK_HAS_NOTHROW_COPY:
5028 case CPTK_HAS_TRIVIAL_COPY:
5029 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5030 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5031 case CPTK_IS_ABSTRACT:
5034 case CPTK_IS_POLYMORPHIC:
5035 if (!check_trait_type (type1))
5037 error ("incomplete type %qT not allowed", type1);
5038 return error_mark_node;
5042 case CPTK_IS_BASE_OF:
5043 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5044 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5045 && !COMPLETE_TYPE_P (type2))
5047 error ("incomplete type %qT not allowed", type2);
5048 return error_mark_node;
5057 case CPTK_IS_CONVERTIBLE_TO:
5062 return (trait_expr_value (kind, type1, type2)
5063 ? boolean_true_node : boolean_false_node);
5066 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5067 which is ignored for C++. */
5070 set_float_const_decimal64 (void)
5075 clear_float_const_decimal64 (void)
5080 float_const_decimal64_p (void)
5085 #include "gt-cp-semantics.h"