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 (input_location, 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 (input_location, 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 (input_location, 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 (input_location, GOTO_EXPR, destination));
567 /* COND is the condition-expression for an if, while, etc.,
568 statement. Convert it to a boolean value, if appropriate.
569 In addition, verify sequence points if -Wsequence-point is enabled. */
572 maybe_convert_cond (tree cond)
574 /* Empty conditions remain empty. */
578 /* Wait until we instantiate templates before doing conversion. */
579 if (processing_template_decl)
582 if (warn_sequence_point)
583 verify_sequence_points (cond);
585 /* Do the conversion. */
586 cond = convert_from_reference (cond);
588 if (TREE_CODE (cond) == MODIFY_EXPR
589 && !TREE_NO_WARNING (cond)
592 warning (OPT_Wparentheses,
593 "suggest parentheses around assignment used as truth value");
594 TREE_NO_WARNING (cond) = 1;
597 return condition_conversion (cond);
600 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
603 finish_expr_stmt (tree expr)
607 if (expr != NULL_TREE)
609 if (!processing_template_decl)
611 if (warn_sequence_point)
612 verify_sequence_points (expr);
613 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 (input_location, 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 (input_location, 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 (input_location, 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 (input_location, 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 (input_location, 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 (input_location, 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 (input_location, BREAK_STMT));
914 /* Finish a continue-statement. */
917 finish_continue_stmt (void)
919 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
922 /* Begin a switch-statement. Returns a new SWITCH_STMT if
926 begin_switch_stmt (void)
930 r = build_stmt (input_location, 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 (input_location, 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 (input_location, 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, some CLOBBERS and some
1204 LABELS. Also note whether the asm-statement should be
1205 considered volatile. */
1208 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1209 tree input_operands, tree clobbers, tree labels)
1213 int ninputs = list_length (input_operands);
1214 int noutputs = list_length (output_operands);
1216 if (!processing_template_decl)
1218 const char *constraint;
1219 const char **oconstraints;
1220 bool allows_mem, allows_reg, is_inout;
1224 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1226 string = resolve_asm_operand_names (string, output_operands,
1227 input_operands, labels);
1229 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1231 operand = TREE_VALUE (t);
1233 /* ??? Really, this should not be here. Users should be using a
1234 proper lvalue, dammit. But there's a long history of using
1235 casts in the output operands. In cases like longlong.h, this
1236 becomes a primitive form of typechecking -- if the cast can be
1237 removed, then the output operand had a type of the proper width;
1238 otherwise we'll get an error. Gross, but ... */
1239 STRIP_NOPS (operand);
1241 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1242 operand = error_mark_node;
1244 if (operand != error_mark_node
1245 && (TREE_READONLY (operand)
1246 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1247 /* Functions are not modifiable, even though they are
1249 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1250 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1251 /* If it's an aggregate and any field is const, then it is
1252 effectively const. */
1253 || (CLASS_TYPE_P (TREE_TYPE (operand))
1254 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1255 readonly_error (operand, "assignment (via 'asm' output)");
1257 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1258 oconstraints[i] = constraint;
1260 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1261 &allows_mem, &allows_reg, &is_inout))
1263 /* If the operand is going to end up in memory,
1264 mark it addressable. */
1265 if (!allows_reg && !cxx_mark_addressable (operand))
1266 operand = error_mark_node;
1269 operand = error_mark_node;
1271 TREE_VALUE (t) = operand;
1274 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1276 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1277 operand = decay_conversion (TREE_VALUE (t));
1279 /* If the type of the operand hasn't been determined (e.g.,
1280 because it involves an overloaded function), then issue
1281 an error message. There's no context available to
1282 resolve the overloading. */
1283 if (TREE_TYPE (operand) == unknown_type_node)
1285 error ("type of asm operand %qE could not be determined",
1287 operand = error_mark_node;
1290 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1291 oconstraints, &allows_mem, &allows_reg))
1293 /* If the operand is going to end up in memory,
1294 mark it addressable. */
1295 if (!allows_reg && allows_mem)
1297 /* Strip the nops as we allow this case. FIXME, this really
1298 should be rejected or made deprecated. */
1299 STRIP_NOPS (operand);
1300 if (!cxx_mark_addressable (operand))
1301 operand = error_mark_node;
1305 operand = error_mark_node;
1307 TREE_VALUE (t) = operand;
1311 r = build_stmt (input_location, ASM_EXPR, string,
1312 output_operands, input_operands,
1314 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1315 r = maybe_cleanup_point_expr_void (r);
1316 return add_stmt (r);
1319 /* Finish a label with the indicated NAME. Returns the new label. */
1322 finish_label_stmt (tree name)
1324 tree decl = define_label (input_location, name);
1326 if (decl == error_mark_node)
1327 return error_mark_node;
1329 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1334 /* Finish a series of declarations for local labels. G++ allows users
1335 to declare "local" labels, i.e., labels with scope. This extension
1336 is useful when writing code involving statement-expressions. */
1339 finish_label_decl (tree name)
1341 if (!at_function_scope_p ())
1343 error ("__label__ declarations are only allowed in function scopes");
1347 add_decl_expr (declare_local_label (name));
1350 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1353 finish_decl_cleanup (tree decl, tree cleanup)
1355 push_cleanup (decl, cleanup, false);
1358 /* If the current scope exits with an exception, run CLEANUP. */
1361 finish_eh_cleanup (tree cleanup)
1363 push_cleanup (NULL, cleanup, true);
1366 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1367 order they were written by the user. Each node is as for
1368 emit_mem_initializers. */
1371 finish_mem_initializers (tree mem_inits)
1373 /* Reorder the MEM_INITS so that they are in the order they appeared
1374 in the source program. */
1375 mem_inits = nreverse (mem_inits);
1377 if (processing_template_decl)
1381 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1383 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1384 check for bare parameter packs in the TREE_VALUE, because
1385 any parameter packs in the TREE_VALUE have already been
1386 bound as part of the TREE_PURPOSE. See
1387 make_pack_expansion for more information. */
1388 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1389 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1390 TREE_VALUE (mem) = error_mark_node;
1393 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1396 emit_mem_initializers (mem_inits);
1399 /* Finish a parenthesized expression EXPR. */
1402 finish_parenthesized_expr (tree expr)
1405 /* This inhibits warnings in c_common_truthvalue_conversion. */
1406 TREE_NO_WARNING (expr) = 1;
1408 if (TREE_CODE (expr) == OFFSET_REF)
1409 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1410 enclosed in parentheses. */
1411 PTRMEM_OK_P (expr) = 0;
1413 if (TREE_CODE (expr) == STRING_CST)
1414 PAREN_STRING_LITERAL_P (expr) = 1;
1419 /* Finish a reference to a non-static data member (DECL) that is not
1420 preceded by `.' or `->'. */
1423 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1425 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1427 if (!object && cp_unevaluated_operand != 0)
1429 /* DR 613: Can use non-static data members without an associated
1430 object in sizeof/decltype/alignof. */
1431 tree scope = qualifying_scope;
1432 if (scope == NULL_TREE)
1433 scope = context_for_name_lookup (decl);
1434 object = maybe_dummy_object (scope, NULL);
1439 if (current_function_decl
1440 && DECL_STATIC_FUNCTION_P (current_function_decl))
1441 error ("invalid use of member %q+D in static member function", decl);
1443 error ("invalid use of non-static data member %q+D", decl);
1444 error ("from this location");
1446 return error_mark_node;
1448 if (current_class_ptr)
1449 TREE_USED (current_class_ptr) = 1;
1450 if (processing_template_decl && !qualifying_scope)
1452 tree type = TREE_TYPE (decl);
1454 if (TREE_CODE (type) == REFERENCE_TYPE)
1455 type = TREE_TYPE (type);
1458 /* Set the cv qualifiers. */
1459 int quals = (current_class_ref
1460 ? cp_type_quals (TREE_TYPE (current_class_ref))
1461 : TYPE_UNQUALIFIED);
1463 if (DECL_MUTABLE_P (decl))
1464 quals &= ~TYPE_QUAL_CONST;
1466 quals |= cp_type_quals (TREE_TYPE (decl));
1467 type = cp_build_qualified_type (type, quals);
1470 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1474 tree access_type = TREE_TYPE (object);
1475 tree lookup_context = context_for_name_lookup (decl);
1477 while (!DERIVED_FROM_P (lookup_context, access_type))
1479 access_type = TYPE_CONTEXT (access_type);
1480 while (access_type && DECL_P (access_type))
1481 access_type = DECL_CONTEXT (access_type);
1485 error ("object missing in reference to %q+D", decl);
1486 error ("from this location");
1487 return error_mark_node;
1491 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1492 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1494 if (processing_template_decl)
1495 return build_qualified_name (TREE_TYPE (decl),
1498 /*template_p=*/false);
1500 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1503 /* If the data member was named `C::M', convert `*this' to `C'
1505 if (qualifying_scope)
1507 tree binfo = NULL_TREE;
1508 object = build_scoped_ref (object, qualifying_scope,
1512 return build_class_member_access_expr (object, decl,
1513 /*access_path=*/NULL_TREE,
1514 /*preserve_reference=*/false,
1515 tf_warning_or_error);
1519 /* DECL was the declaration to which a qualified-id resolved. Issue
1520 an error message if it is not accessible. If OBJECT_TYPE is
1521 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1522 type of `*x', or `x', respectively. If the DECL was named as
1523 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1526 check_accessibility_of_qualified_id (tree decl,
1528 tree nested_name_specifier)
1531 tree qualifying_type = NULL_TREE;
1533 /* If we are parsing a template declaration and if decl is a typedef,
1534 add it to a list tied to the template.
1535 At template instantiation time, that list will be walked and
1536 access check performed. */
1537 if (is_typedef_decl (decl))
1539 /* This the scope through which type_decl is accessed.
1540 It will be useful information later to do access check for
1542 tree scope = nested_name_specifier
1543 ? nested_name_specifier
1544 : DECL_CONTEXT (decl);
1545 tree templ_info = NULL;
1546 tree cs = current_scope ();
1548 if (cs && (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL))
1549 templ_info = get_template_info (cs);
1552 && TI_TEMPLATE (templ_info)
1554 && CLASS_TYPE_P (scope)
1555 && !currently_open_class (scope))
1556 append_type_to_template_for_access_check (current_scope (), decl, scope);
1559 /* If we're not checking, return immediately. */
1560 if (deferred_access_no_check)
1563 /* Determine the SCOPE of DECL. */
1564 scope = context_for_name_lookup (decl);
1565 /* If the SCOPE is not a type, then DECL is not a member. */
1566 if (!TYPE_P (scope))
1568 /* Compute the scope through which DECL is being accessed. */
1570 /* OBJECT_TYPE might not be a class type; consider:
1572 class A { typedef int I; };
1576 In this case, we will have "A::I" as the DECL, but "I" as the
1578 && CLASS_TYPE_P (object_type)
1579 && DERIVED_FROM_P (scope, object_type))
1580 /* If we are processing a `->' or `.' expression, use the type of the
1582 qualifying_type = object_type;
1583 else if (nested_name_specifier)
1585 /* If the reference is to a non-static member of the
1586 current class, treat it as if it were referenced through
1588 if (DECL_NONSTATIC_MEMBER_P (decl)
1589 && current_class_ptr
1590 && DERIVED_FROM_P (scope, current_class_type))
1591 qualifying_type = current_class_type;
1592 /* Otherwise, use the type indicated by the
1593 nested-name-specifier. */
1595 qualifying_type = nested_name_specifier;
1598 /* Otherwise, the name must be from the current class or one of
1600 qualifying_type = currently_open_derived_class (scope);
1603 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1604 or similar in a default argument value. */
1605 && CLASS_TYPE_P (qualifying_type)
1606 && !dependent_type_p (qualifying_type))
1607 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1611 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1612 class named to the left of the "::" operator. DONE is true if this
1613 expression is a complete postfix-expression; it is false if this
1614 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1615 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1616 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1617 is true iff this qualified name appears as a template argument. */
1620 finish_qualified_id_expr (tree qualifying_class,
1625 bool template_arg_p)
1627 gcc_assert (TYPE_P (qualifying_class));
1629 if (error_operand_p (expr))
1630 return error_mark_node;
1632 if (DECL_P (expr) || BASELINK_P (expr))
1636 check_template_keyword (expr);
1638 /* If EXPR occurs as the operand of '&', use special handling that
1639 permits a pointer-to-member. */
1640 if (address_p && done)
1642 if (TREE_CODE (expr) == SCOPE_REF)
1643 expr = TREE_OPERAND (expr, 1);
1644 expr = build_offset_ref (qualifying_class, expr,
1645 /*address_p=*/true);
1649 /* Within the scope of a class, turn references to non-static
1650 members into expression of the form "this->...". */
1652 /* But, within a template argument, we do not want make the
1653 transformation, as there is no "this" pointer. */
1655 else if (TREE_CODE (expr) == FIELD_DECL)
1657 push_deferring_access_checks (dk_no_check);
1658 expr = finish_non_static_data_member (expr, current_class_ref,
1660 pop_deferring_access_checks ();
1662 else if (BASELINK_P (expr) && !processing_template_decl)
1666 /* See if any of the functions are non-static members. */
1667 fns = BASELINK_FUNCTIONS (expr);
1668 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1669 fns = TREE_OPERAND (fns, 0);
1670 /* If so, the expression may be relative to 'this'. */
1671 if (!shared_member_p (fns)
1672 && current_class_ref
1673 && DERIVED_FROM_P (qualifying_class, TREE_TYPE (current_class_ref)))
1674 expr = (build_class_member_access_expr
1675 (maybe_dummy_object (qualifying_class, NULL),
1677 BASELINK_ACCESS_BINFO (expr),
1678 /*preserve_reference=*/false,
1679 tf_warning_or_error));
1681 /* The expression is a qualified name whose address is not
1683 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1689 /* Begin a statement-expression. The value returned must be passed to
1690 finish_stmt_expr. */
1693 begin_stmt_expr (void)
1695 return push_stmt_list ();
1698 /* Process the final expression of a statement expression. EXPR can be
1699 NULL, if the final expression is empty. Return a STATEMENT_LIST
1700 containing all the statements in the statement-expression, or
1701 ERROR_MARK_NODE if there was an error. */
1704 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1706 if (error_operand_p (expr))
1708 /* The type of the statement-expression is the type of the last
1710 TREE_TYPE (stmt_expr) = error_mark_node;
1711 return error_mark_node;
1714 /* If the last statement does not have "void" type, then the value
1715 of the last statement is the value of the entire expression. */
1718 tree type = TREE_TYPE (expr);
1720 if (processing_template_decl)
1722 expr = build_stmt (input_location, EXPR_STMT, expr);
1723 expr = add_stmt (expr);
1724 /* Mark the last statement so that we can recognize it as such at
1725 template-instantiation time. */
1726 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1728 else if (VOID_TYPE_P (type))
1730 /* Just treat this like an ordinary statement. */
1731 expr = finish_expr_stmt (expr);
1735 /* It actually has a value we need to deal with. First, force it
1736 to be an rvalue so that we won't need to build up a copy
1737 constructor call later when we try to assign it to something. */
1738 expr = force_rvalue (expr);
1739 if (error_operand_p (expr))
1740 return error_mark_node;
1742 /* Update for array-to-pointer decay. */
1743 type = TREE_TYPE (expr);
1745 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1746 normal statement, but don't convert to void or actually add
1748 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1749 expr = maybe_cleanup_point_expr (expr);
1753 /* The type of the statement-expression is the type of the last
1755 TREE_TYPE (stmt_expr) = type;
1761 /* Finish a statement-expression. EXPR should be the value returned
1762 by the previous begin_stmt_expr. Returns an expression
1763 representing the statement-expression. */
1766 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1771 if (error_operand_p (stmt_expr))
1773 pop_stmt_list (stmt_expr);
1774 return error_mark_node;
1777 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1779 type = TREE_TYPE (stmt_expr);
1780 result = pop_stmt_list (stmt_expr);
1781 TREE_TYPE (result) = type;
1783 if (processing_template_decl)
1785 result = build_min (STMT_EXPR, type, result);
1786 TREE_SIDE_EFFECTS (result) = 1;
1787 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1789 else if (CLASS_TYPE_P (type))
1791 /* Wrap the statement-expression in a TARGET_EXPR so that the
1792 temporary object created by the final expression is destroyed at
1793 the end of the full-expression containing the
1794 statement-expression. */
1795 result = force_target_expr (type, result);
1801 /* Returns the expression which provides the value of STMT_EXPR. */
1804 stmt_expr_value_expr (tree stmt_expr)
1806 tree t = STMT_EXPR_STMT (stmt_expr);
1808 if (TREE_CODE (t) == BIND_EXPR)
1809 t = BIND_EXPR_BODY (t);
1811 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1812 t = STATEMENT_LIST_TAIL (t)->stmt;
1814 if (TREE_CODE (t) == EXPR_STMT)
1815 t = EXPR_STMT_EXPR (t);
1820 /* Perform Koenig lookup. FN is the postfix-expression representing
1821 the function (or functions) to call; ARGS are the arguments to the
1822 call. Returns the functions to be considered by overload
1826 perform_koenig_lookup (tree fn, VEC(tree,gc) *args)
1828 tree identifier = NULL_TREE;
1829 tree functions = NULL_TREE;
1830 tree tmpl_args = NULL_TREE;
1831 bool template_id = false;
1833 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1835 /* Use a separate flag to handle null args. */
1837 tmpl_args = TREE_OPERAND (fn, 1);
1838 fn = TREE_OPERAND (fn, 0);
1841 /* Find the name of the overloaded function. */
1842 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1844 else if (is_overloaded_fn (fn))
1847 identifier = DECL_NAME (get_first_fn (functions));
1849 else if (DECL_P (fn))
1852 identifier = DECL_NAME (fn);
1855 /* A call to a namespace-scope function using an unqualified name.
1857 Do Koenig lookup -- unless any of the arguments are
1859 if (!any_type_dependent_arguments_p (args)
1860 && !any_dependent_template_arguments_p (tmpl_args))
1862 fn = lookup_arg_dependent (identifier, functions, args);
1864 /* The unqualified name could not be resolved. */
1865 fn = unqualified_fn_lookup_error (identifier);
1868 if (fn && template_id)
1869 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1874 /* Generate an expression for `FN (ARGS)'. This may change the
1877 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1878 as a virtual call, even if FN is virtual. (This flag is set when
1879 encountering an expression where the function name is explicitly
1880 qualified. For example a call to `X::f' never generates a virtual
1883 Returns code for the call. */
1886 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1887 bool koenig_p, tsubst_flags_t complain)
1891 VEC(tree,gc) *orig_args = NULL;
1893 if (fn == error_mark_node)
1894 return error_mark_node;
1896 gcc_assert (!TYPE_P (fn));
1900 if (processing_template_decl)
1902 if (type_dependent_expression_p (fn)
1903 || any_type_dependent_arguments_p (*args))
1905 result = build_nt_call_vec (fn, *args);
1906 KOENIG_LOOKUP_P (result) = koenig_p;
1911 tree fndecl = OVL_CURRENT (fn);
1912 if (TREE_CODE (fndecl) != FUNCTION_DECL
1913 || !TREE_THIS_VOLATILE (fndecl))
1919 current_function_returns_abnormally = 1;
1923 orig_args = make_tree_vector_copy (*args);
1924 if (!BASELINK_P (fn)
1925 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1926 && TREE_TYPE (fn) != unknown_type_node)
1927 fn = build_non_dependent_expr (fn);
1928 make_args_non_dependent (*args);
1931 if (is_overloaded_fn (fn))
1932 fn = baselink_for_fns (fn);
1935 if (BASELINK_P (fn))
1939 /* A call to a member function. From [over.call.func]:
1941 If the keyword this is in scope and refers to the class of
1942 that member function, or a derived class thereof, then the
1943 function call is transformed into a qualified function call
1944 using (*this) as the postfix-expression to the left of the
1945 . operator.... [Otherwise] a contrived object of type T
1946 becomes the implied object argument.
1948 This paragraph is unclear about this situation:
1950 struct A { void f(); };
1951 struct B : public A {};
1952 struct C : public A { void g() { B::f(); }};
1954 In particular, for `B::f', this paragraph does not make clear
1955 whether "the class of that member function" refers to `A' or
1956 to `B'. We believe it refers to `B'. */
1957 if (current_class_type
1958 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1960 && current_class_ref)
1961 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1965 tree representative_fn;
1967 representative_fn = BASELINK_FUNCTIONS (fn);
1968 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1969 representative_fn = TREE_OPERAND (representative_fn, 0);
1970 representative_fn = get_first_fn (representative_fn);
1971 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1974 if (processing_template_decl)
1976 if (type_dependent_expression_p (object))
1978 tree ret = build_nt_call_vec (orig_fn, orig_args);
1979 release_tree_vector (orig_args);
1982 object = build_non_dependent_expr (object);
1985 result = build_new_method_call (object, fn, args, NULL_TREE,
1987 ? LOOKUP_NONVIRTUAL : 0),
1991 else if (is_overloaded_fn (fn))
1993 /* If the function is an overloaded builtin, resolve it. */
1994 if (TREE_CODE (fn) == FUNCTION_DECL
1995 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1996 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1997 result = resolve_overloaded_builtin (input_location, fn, *args);
2000 /* A call to a namespace-scope function. */
2001 result = build_new_function_call (fn, args, koenig_p, complain);
2003 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2005 if (!VEC_empty (tree, *args))
2006 error ("arguments to destructor are not allowed");
2007 /* Mark the pseudo-destructor call as having side-effects so
2008 that we do not issue warnings about its use. */
2009 result = build1 (NOP_EXPR,
2011 TREE_OPERAND (fn, 0));
2012 TREE_SIDE_EFFECTS (result) = 1;
2014 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2015 /* If the "function" is really an object of class type, it might
2016 have an overloaded `operator ()'. */
2017 result = build_op_call (fn, args, complain);
2020 /* A call where the function is unknown. */
2021 result = cp_build_function_call_vec (fn, args, complain);
2023 if (processing_template_decl)
2025 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2026 KOENIG_LOOKUP_P (result) = koenig_p;
2027 release_tree_vector (orig_args);
2033 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2034 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2035 POSTDECREMENT_EXPR.) */
2038 finish_increment_expr (tree expr, enum tree_code code)
2040 return build_x_unary_op (code, expr, tf_warning_or_error);
2043 /* Finish a use of `this'. Returns an expression for `this'. */
2046 finish_this_expr (void)
2050 if (current_class_ptr)
2052 result = current_class_ptr;
2054 else if (current_function_decl
2055 && DECL_STATIC_FUNCTION_P (current_function_decl))
2057 error ("%<this%> is unavailable for static member functions");
2058 result = error_mark_node;
2062 if (current_function_decl)
2063 error ("invalid use of %<this%> in non-member function");
2065 error ("invalid use of %<this%> at top level");
2066 result = error_mark_node;
2072 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2073 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2074 the TYPE for the type given. If SCOPE is non-NULL, the expression
2075 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2078 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2080 if (object == error_mark_node || destructor == error_mark_node)
2081 return error_mark_node;
2083 gcc_assert (TYPE_P (destructor));
2085 if (!processing_template_decl)
2087 if (scope == error_mark_node)
2089 error ("invalid qualifying scope in pseudo-destructor name");
2090 return error_mark_node;
2092 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2094 error ("qualified type %qT does not match destructor name ~%qT",
2096 return error_mark_node;
2100 /* [expr.pseudo] says both:
2102 The type designated by the pseudo-destructor-name shall be
2103 the same as the object type.
2107 The cv-unqualified versions of the object type and of the
2108 type designated by the pseudo-destructor-name shall be the
2111 We implement the more generous second sentence, since that is
2112 what most other compilers do. */
2113 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2116 error ("%qE is not of type %qT", object, destructor);
2117 return error_mark_node;
2121 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2124 /* Finish an expression of the form CODE EXPR. */
2127 finish_unary_op_expr (enum tree_code code, tree expr)
2129 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2130 /* Inside a template, build_x_unary_op does not fold the
2131 expression. So check whether the result is folded before
2132 setting TREE_NEGATED_INT. */
2133 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2134 && TREE_CODE (result) == INTEGER_CST
2135 && !TYPE_UNSIGNED (TREE_TYPE (result))
2136 && INT_CST_LT (result, integer_zero_node))
2138 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2139 setting TREE_NEGATED_INT. */
2140 result = copy_node (result);
2141 TREE_NEGATED_INT (result) = 1;
2143 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2144 overflow_warning (input_location, result);
2149 /* Finish a compound-literal expression. TYPE is the type to which
2150 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2153 finish_compound_literal (tree type, tree compound_literal)
2155 if (type == error_mark_node)
2156 return error_mark_node;
2158 if (!TYPE_OBJ_P (type))
2160 error ("compound literal of non-object type %qT", type);
2161 return error_mark_node;
2164 if (processing_template_decl)
2166 TREE_TYPE (compound_literal) = type;
2167 /* Mark the expression as a compound literal. */
2168 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2169 return compound_literal;
2172 type = complete_type (type);
2174 if (TYPE_NON_AGGREGATE_CLASS (type))
2176 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2177 everywhere that deals with function arguments would be a pain, so
2178 just wrap it in a TREE_LIST. The parser set a flag so we know
2179 that it came from T{} rather than T({}). */
2180 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2181 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2182 return build_functional_cast (type, compound_literal, tf_error);
2185 if (TREE_CODE (type) == ARRAY_TYPE
2186 && check_array_initializer (NULL_TREE, type, compound_literal))
2187 return error_mark_node;
2188 compound_literal = reshape_init (type, compound_literal);
2189 if (TREE_CODE (type) == ARRAY_TYPE)
2190 cp_complete_array_type (&type, compound_literal, false);
2191 compound_literal = digest_init (type, compound_literal);
2192 if ((!at_function_scope_p () || cp_type_readonly (type))
2193 && initializer_constant_valid_p (compound_literal, type))
2195 tree decl = create_temporary_var (type);
2196 DECL_INITIAL (decl) = compound_literal;
2197 TREE_STATIC (decl) = 1;
2198 decl = pushdecl_top_level (decl);
2199 DECL_NAME (decl) = make_anon_name ();
2200 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2204 return get_target_expr (compound_literal);
2207 /* Return the declaration for the function-name variable indicated by
2211 finish_fname (tree id)
2215 decl = fname_decl (input_location, C_RID_CODE (id), id);
2216 if (processing_template_decl)
2217 decl = DECL_NAME (decl);
2221 /* Finish a translation unit. */
2224 finish_translation_unit (void)
2226 /* In case there were missing closebraces,
2227 get us back to the global binding level. */
2229 while (current_namespace != global_namespace)
2232 /* Do file scope __FUNCTION__ et al. */
2233 finish_fname_decls ();
2236 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2237 Returns the parameter. */
2240 finish_template_type_parm (tree aggr, tree identifier)
2242 if (aggr != class_type_node)
2244 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2245 aggr = class_type_node;
2248 return build_tree_list (aggr, identifier);
2251 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2252 Returns the parameter. */
2255 finish_template_template_parm (tree aggr, tree identifier)
2257 tree decl = build_decl (input_location,
2258 TYPE_DECL, identifier, NULL_TREE);
2259 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2260 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2261 DECL_TEMPLATE_RESULT (tmpl) = decl;
2262 DECL_ARTIFICIAL (decl) = 1;
2263 end_template_decl ();
2265 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2267 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2268 /*is_primary=*/true, /*is_partial=*/false,
2271 return finish_template_type_parm (aggr, tmpl);
2274 /* ARGUMENT is the default-argument value for a template template
2275 parameter. If ARGUMENT is invalid, issue error messages and return
2276 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2279 check_template_template_default_arg (tree argument)
2281 if (TREE_CODE (argument) != TEMPLATE_DECL
2282 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2283 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2285 if (TREE_CODE (argument) == TYPE_DECL)
2286 error ("invalid use of type %qT as a default value for a template "
2287 "template-parameter", TREE_TYPE (argument));
2289 error ("invalid default argument for a template template parameter");
2290 return error_mark_node;
2296 /* Begin a class definition, as indicated by T. */
2299 begin_class_definition (tree t, tree attributes)
2301 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2302 return error_mark_node;
2304 if (processing_template_parmlist)
2306 error ("definition of %q#T inside template parameter list", t);
2307 return error_mark_node;
2309 /* A non-implicit typename comes from code like:
2311 template <typename T> struct A {
2312 template <typename U> struct A<T>::B ...
2314 This is erroneous. */
2315 else if (TREE_CODE (t) == TYPENAME_TYPE)
2317 error ("invalid definition of qualified type %qT", t);
2318 t = error_mark_node;
2321 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2323 t = make_class_type (RECORD_TYPE);
2324 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2327 /* Update the location of the decl. */
2328 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2330 if (TYPE_BEING_DEFINED (t))
2332 t = make_class_type (TREE_CODE (t));
2333 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2335 maybe_process_partial_specialization (t);
2337 TYPE_BEING_DEFINED (t) = 1;
2339 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2341 if (flag_pack_struct)
2344 TYPE_PACKED (t) = 1;
2345 /* Even though the type is being defined for the first time
2346 here, there might have been a forward declaration, so there
2347 might be cv-qualified variants of T. */
2348 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2349 TYPE_PACKED (v) = 1;
2351 /* Reset the interface data, at the earliest possible
2352 moment, as it might have been set via a class foo;
2354 if (! TYPE_ANONYMOUS_P (t))
2356 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2357 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2358 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2359 (t, finfo->interface_unknown);
2361 reset_specialization();
2363 /* Make a declaration for this class in its own scope. */
2364 build_self_reference ();
2369 /* Finish the member declaration given by DECL. */
2372 finish_member_declaration (tree decl)
2374 if (decl == error_mark_node || decl == NULL_TREE)
2377 if (decl == void_type_node)
2378 /* The COMPONENT was a friend, not a member, and so there's
2379 nothing for us to do. */
2382 /* We should see only one DECL at a time. */
2383 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2385 /* Set up access control for DECL. */
2387 = (current_access_specifier == access_private_node);
2388 TREE_PROTECTED (decl)
2389 = (current_access_specifier == access_protected_node);
2390 if (TREE_CODE (decl) == TEMPLATE_DECL)
2392 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2393 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2396 /* Mark the DECL as a member of the current class. */
2397 DECL_CONTEXT (decl) = current_class_type;
2399 /* Check for bare parameter packs in the member variable declaration. */
2400 if (TREE_CODE (decl) == FIELD_DECL)
2402 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2403 TREE_TYPE (decl) = error_mark_node;
2404 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2405 DECL_ATTRIBUTES (decl) = NULL_TREE;
2410 A C language linkage is ignored for the names of class members
2411 and the member function type of class member functions. */
2412 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2413 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2415 /* Put functions on the TYPE_METHODS list and everything else on the
2416 TYPE_FIELDS list. Note that these are built up in reverse order.
2417 We reverse them (to obtain declaration order) in finish_struct. */
2418 if (TREE_CODE (decl) == FUNCTION_DECL
2419 || DECL_FUNCTION_TEMPLATE_P (decl))
2421 /* We also need to add this function to the
2422 CLASSTYPE_METHOD_VEC. */
2423 if (add_method (current_class_type, decl, NULL_TREE))
2425 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2426 TYPE_METHODS (current_class_type) = decl;
2428 maybe_add_class_template_decl_list (current_class_type, decl,
2432 /* Enter the DECL into the scope of the class. */
2433 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2434 || pushdecl_class_level (decl))
2436 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2437 go at the beginning. The reason is that lookup_field_1
2438 searches the list in order, and we want a field name to
2439 override a type name so that the "struct stat hack" will
2440 work. In particular:
2442 struct S { enum E { }; int E } s;
2445 is valid. In addition, the FIELD_DECLs must be maintained in
2446 declaration order so that class layout works as expected.
2447 However, we don't need that order until class layout, so we
2448 save a little time by putting FIELD_DECLs on in reverse order
2449 here, and then reversing them in finish_struct_1. (We could
2450 also keep a pointer to the correct insertion points in the
2453 if (TREE_CODE (decl) == TYPE_DECL)
2454 TYPE_FIELDS (current_class_type)
2455 = chainon (TYPE_FIELDS (current_class_type), decl);
2458 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2459 TYPE_FIELDS (current_class_type) = decl;
2462 maybe_add_class_template_decl_list (current_class_type, decl,
2467 note_decl_for_pch (decl);
2470 /* DECL has been declared while we are building a PCH file. Perform
2471 actions that we might normally undertake lazily, but which can be
2472 performed now so that they do not have to be performed in
2473 translation units which include the PCH file. */
2476 note_decl_for_pch (tree decl)
2478 gcc_assert (pch_file);
2480 /* There's a good chance that we'll have to mangle names at some
2481 point, even if only for emission in debugging information. */
2482 if ((TREE_CODE (decl) == VAR_DECL
2483 || TREE_CODE (decl) == FUNCTION_DECL)
2484 && !processing_template_decl)
2488 /* Finish processing a complete template declaration. The PARMS are
2489 the template parameters. */
2492 finish_template_decl (tree parms)
2495 end_template_decl ();
2497 end_specialization ();
2500 /* Finish processing a template-id (which names a type) of the form
2501 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2502 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2503 the scope of template-id indicated. */
2506 finish_template_type (tree name, tree args, int entering_scope)
2510 decl = lookup_template_class (name, args,
2511 NULL_TREE, NULL_TREE, entering_scope,
2512 tf_warning_or_error | tf_user);
2513 if (decl != error_mark_node)
2514 decl = TYPE_STUB_DECL (decl);
2519 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2520 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2521 BASE_CLASS, or NULL_TREE if an error occurred. The
2522 ACCESS_SPECIFIER is one of
2523 access_{default,public,protected_private}_node. For a virtual base
2524 we set TREE_TYPE. */
2527 finish_base_specifier (tree base, tree access, bool virtual_p)
2531 if (base == error_mark_node)
2533 error ("invalid base-class specification");
2536 else if (! MAYBE_CLASS_TYPE_P (base))
2538 error ("%qT is not a class type", base);
2543 if (cp_type_quals (base) != 0)
2545 error ("base class %qT has cv qualifiers", base);
2546 base = TYPE_MAIN_VARIANT (base);
2548 result = build_tree_list (access, base);
2550 TREE_TYPE (result) = integer_type_node;
2556 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2557 what we found when we tried to do the lookup.
2558 LOCATION is the location of the NAME identifier;
2559 The location is used in the error message*/
2562 qualified_name_lookup_error (tree scope, tree name,
2563 tree decl, location_t location)
2565 if (scope == error_mark_node)
2566 ; /* We already complained. */
2567 else if (TYPE_P (scope))
2569 if (!COMPLETE_TYPE_P (scope))
2570 error_at (location, "incomplete type %qT used in nested name specifier",
2572 else if (TREE_CODE (decl) == TREE_LIST)
2574 error_at (location, "reference to %<%T::%D%> is ambiguous",
2576 print_candidates (decl);
2579 error_at (location, "%qD is not a member of %qT", name, scope);
2581 else if (scope != global_namespace)
2582 error_at (location, "%qD is not a member of %qD", name, scope);
2584 error_at (location, "%<::%D%> has not been declared", name);
2587 /* If FNS is a member function, a set of member functions, or a
2588 template-id referring to one or more member functions, return a
2589 BASELINK for FNS, incorporating the current access context.
2590 Otherwise, return FNS unchanged. */
2593 baselink_for_fns (tree fns)
2598 if (BASELINK_P (fns)
2599 || error_operand_p (fns))
2603 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2604 fn = TREE_OPERAND (fn, 0);
2605 fn = get_first_fn (fn);
2606 if (!DECL_FUNCTION_MEMBER_P (fn))
2609 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2611 cl = DECL_CONTEXT (fn);
2612 cl = TYPE_BINFO (cl);
2613 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2616 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2617 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2618 if non-NULL, is the type or namespace used to explicitly qualify
2619 ID_EXPRESSION. DECL is the entity to which that name has been
2622 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2623 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2624 be set to true if this expression isn't permitted in a
2625 constant-expression, but it is otherwise not set by this function.
2626 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2627 constant-expression, but a non-constant expression is also
2630 DONE is true if this expression is a complete postfix-expression;
2631 it is false if this expression is followed by '->', '[', '(', etc.
2632 ADDRESS_P is true iff this expression is the operand of '&'.
2633 TEMPLATE_P is true iff the qualified-id was of the form
2634 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2635 appears as a template argument.
2637 If an error occurs, and it is the kind of error that might cause
2638 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2639 is the caller's responsibility to issue the message. *ERROR_MSG
2640 will be a string with static storage duration, so the caller need
2643 Return an expression for the entity, after issuing appropriate
2644 diagnostics. This function is also responsible for transforming a
2645 reference to a non-static member into a COMPONENT_REF that makes
2646 the use of "this" explicit.
2648 Upon return, *IDK will be filled in appropriately. */
2650 finish_id_expression (tree id_expression,
2654 bool integral_constant_expression_p,
2655 bool allow_non_integral_constant_expression_p,
2656 bool *non_integral_constant_expression_p,
2660 bool template_arg_p,
2661 const char **error_msg,
2662 location_t location)
2664 /* Initialize the output parameters. */
2665 *idk = CP_ID_KIND_NONE;
2668 if (id_expression == error_mark_node)
2669 return error_mark_node;
2670 /* If we have a template-id, then no further lookup is
2671 required. If the template-id was for a template-class, we
2672 will sometimes have a TYPE_DECL at this point. */
2673 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2674 || TREE_CODE (decl) == TYPE_DECL)
2676 /* Look up the name. */
2679 if (decl == error_mark_node)
2681 /* Name lookup failed. */
2684 || (!dependent_type_p (scope)
2685 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2686 && IDENTIFIER_TYPENAME_P (id_expression)
2687 && dependent_type_p (TREE_TYPE (id_expression))))))
2689 /* If the qualifying type is non-dependent (and the name
2690 does not name a conversion operator to a dependent
2691 type), issue an error. */
2692 qualified_name_lookup_error (scope, id_expression, decl, location);
2693 return error_mark_node;
2697 /* It may be resolved via Koenig lookup. */
2698 *idk = CP_ID_KIND_UNQUALIFIED;
2699 return id_expression;
2702 decl = id_expression;
2704 /* If DECL is a variable that would be out of scope under
2705 ANSI/ISO rules, but in scope in the ARM, name lookup
2706 will succeed. Issue a diagnostic here. */
2708 decl = check_for_out_of_scope_variable (decl);
2710 /* Remember that the name was used in the definition of
2711 the current class so that we can check later to see if
2712 the meaning would have been different after the class
2713 was entirely defined. */
2714 if (!scope && decl != error_mark_node)
2715 maybe_note_name_used_in_class (id_expression, decl);
2717 /* Disallow uses of local variables from containing functions. */
2718 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2720 tree context = decl_function_context (decl);
2721 if (context != NULL_TREE && context != current_function_decl
2722 && ! TREE_STATIC (decl))
2724 error (TREE_CODE (decl) == VAR_DECL
2725 ? "use of %<auto%> variable from containing function"
2726 : "use of parameter from containing function");
2727 error (" %q+#D declared here", decl);
2728 return error_mark_node;
2733 /* If we didn't find anything, or what we found was a type,
2734 then this wasn't really an id-expression. */
2735 if (TREE_CODE (decl) == TEMPLATE_DECL
2736 && !DECL_FUNCTION_TEMPLATE_P (decl))
2738 *error_msg = "missing template arguments";
2739 return error_mark_node;
2741 else if (TREE_CODE (decl) == TYPE_DECL
2742 || TREE_CODE (decl) == NAMESPACE_DECL)
2744 *error_msg = "expected primary-expression";
2745 return error_mark_node;
2748 /* If the name resolved to a template parameter, there is no
2749 need to look it up again later. */
2750 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2751 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2755 *idk = CP_ID_KIND_NONE;
2756 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2757 decl = TEMPLATE_PARM_DECL (decl);
2758 r = convert_from_reference (DECL_INITIAL (decl));
2760 if (integral_constant_expression_p
2761 && !dependent_type_p (TREE_TYPE (decl))
2762 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2764 if (!allow_non_integral_constant_expression_p)
2765 error ("template parameter %qD of type %qT is not allowed in "
2766 "an integral constant expression because it is not of "
2767 "integral or enumeration type", decl, TREE_TYPE (decl));
2768 *non_integral_constant_expression_p = true;
2772 /* Similarly, we resolve enumeration constants to their
2773 underlying values. */
2774 else if (TREE_CODE (decl) == CONST_DECL)
2776 *idk = CP_ID_KIND_NONE;
2777 if (!processing_template_decl)
2779 used_types_insert (TREE_TYPE (decl));
2780 return DECL_INITIAL (decl);
2788 /* If the declaration was explicitly qualified indicate
2789 that. The semantics of `A::f(3)' are different than
2790 `f(3)' if `f' is virtual. */
2792 ? CP_ID_KIND_QUALIFIED
2793 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2794 ? CP_ID_KIND_TEMPLATE_ID
2795 : CP_ID_KIND_UNQUALIFIED));
2800 An id-expression is type-dependent if it contains an
2801 identifier that was declared with a dependent type.
2803 The standard is not very specific about an id-expression that
2804 names a set of overloaded functions. What if some of them
2805 have dependent types and some of them do not? Presumably,
2806 such a name should be treated as a dependent name. */
2807 /* Assume the name is not dependent. */
2808 dependent_p = false;
2809 if (!processing_template_decl)
2810 /* No names are dependent outside a template. */
2812 /* A template-id where the name of the template was not resolved
2813 is definitely dependent. */
2814 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2815 && (TREE_CODE (TREE_OPERAND (decl, 0))
2816 == IDENTIFIER_NODE))
2818 /* For anything except an overloaded function, just check its
2820 else if (!is_overloaded_fn (decl))
2822 = dependent_type_p (TREE_TYPE (decl));
2823 /* For a set of overloaded functions, check each of the
2829 if (BASELINK_P (fns))
2830 fns = BASELINK_FUNCTIONS (fns);
2832 /* For a template-id, check to see if the template
2833 arguments are dependent. */
2834 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2836 tree args = TREE_OPERAND (fns, 1);
2837 dependent_p = any_dependent_template_arguments_p (args);
2838 /* The functions are those referred to by the
2840 fns = TREE_OPERAND (fns, 0);
2843 /* If there are no dependent template arguments, go through
2844 the overloaded functions. */
2845 while (fns && !dependent_p)
2847 tree fn = OVL_CURRENT (fns);
2849 /* Member functions of dependent classes are
2851 if (TREE_CODE (fn) == FUNCTION_DECL
2852 && type_dependent_expression_p (fn))
2854 else if (TREE_CODE (fn) == TEMPLATE_DECL
2855 && dependent_template_p (fn))
2858 fns = OVL_NEXT (fns);
2862 /* If the name was dependent on a template parameter, we will
2863 resolve the name at instantiation time. */
2866 /* Create a SCOPE_REF for qualified names, if the scope is
2872 if (address_p && done)
2873 decl = finish_qualified_id_expr (scope, decl,
2879 tree type = NULL_TREE;
2880 if (DECL_P (decl) && !dependent_scope_p (scope))
2881 type = TREE_TYPE (decl);
2882 decl = build_qualified_name (type,
2888 if (TREE_TYPE (decl))
2889 decl = convert_from_reference (decl);
2892 /* A TEMPLATE_ID already contains all the information we
2894 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2895 return id_expression;
2896 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2897 /* If we found a variable, then name lookup during the
2898 instantiation will always resolve to the same VAR_DECL
2899 (or an instantiation thereof). */
2900 if (TREE_CODE (decl) == VAR_DECL
2901 || TREE_CODE (decl) == PARM_DECL)
2902 return convert_from_reference (decl);
2903 /* The same is true for FIELD_DECL, but we also need to
2904 make sure that the syntax is correct. */
2905 else if (TREE_CODE (decl) == FIELD_DECL)
2907 /* Since SCOPE is NULL here, this is an unqualified name.
2908 Access checking has been performed during name lookup
2909 already. Turn off checking to avoid duplicate errors. */
2910 push_deferring_access_checks (dk_no_check);
2911 decl = finish_non_static_data_member
2912 (decl, current_class_ref,
2913 /*qualifying_scope=*/NULL_TREE);
2914 pop_deferring_access_checks ();
2917 return id_expression;
2920 /* Only certain kinds of names are allowed in constant
2921 expression. Enumerators and template parameters have already
2922 been handled above. */
2923 if (integral_constant_expression_p
2924 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2925 && ! builtin_valid_in_constant_expr_p (decl))
2927 if (!allow_non_integral_constant_expression_p)
2929 error ("%qD cannot appear in a constant-expression", decl);
2930 return error_mark_node;
2932 *non_integral_constant_expression_p = true;
2935 if (TREE_CODE (decl) == NAMESPACE_DECL)
2937 error ("use of namespace %qD as expression", decl);
2938 return error_mark_node;
2940 else if (DECL_CLASS_TEMPLATE_P (decl))
2942 error ("use of class template %qT as expression", decl);
2943 return error_mark_node;
2945 else if (TREE_CODE (decl) == TREE_LIST)
2947 /* Ambiguous reference to base members. */
2948 error ("request for member %qD is ambiguous in "
2949 "multiple inheritance lattice", id_expression);
2950 print_candidates (decl);
2951 return error_mark_node;
2954 /* Mark variable-like entities as used. Functions are similarly
2955 marked either below or after overload resolution. */
2956 if (TREE_CODE (decl) == VAR_DECL
2957 || TREE_CODE (decl) == PARM_DECL
2958 || TREE_CODE (decl) == RESULT_DECL)
2963 decl = (adjust_result_of_qualified_name_lookup
2964 (decl, scope, current_class_type));
2966 if (TREE_CODE (decl) == FUNCTION_DECL)
2969 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2970 decl = finish_qualified_id_expr (scope,
2978 tree r = convert_from_reference (decl);
2980 if (processing_template_decl && TYPE_P (scope))
2981 r = build_qualified_name (TREE_TYPE (r),
2987 else if (TREE_CODE (decl) == FIELD_DECL)
2989 /* Since SCOPE is NULL here, this is an unqualified name.
2990 Access checking has been performed during name lookup
2991 already. Turn off checking to avoid duplicate errors. */
2992 push_deferring_access_checks (dk_no_check);
2993 decl = finish_non_static_data_member (decl, current_class_ref,
2994 /*qualifying_scope=*/NULL_TREE);
2995 pop_deferring_access_checks ();
2997 else if (is_overloaded_fn (decl))
3002 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
3003 first_fn = TREE_OPERAND (first_fn, 0);
3004 first_fn = get_first_fn (first_fn);
3005 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3006 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3008 if (!really_overloaded_fn (decl))
3009 mark_used (first_fn);
3012 && TREE_CODE (first_fn) == FUNCTION_DECL
3013 && DECL_FUNCTION_MEMBER_P (first_fn)
3014 && !shared_member_p (decl))
3016 /* A set of member functions. */
3017 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3018 return finish_class_member_access_expr (decl, id_expression,
3019 /*template_p=*/false,
3020 tf_warning_or_error);
3023 decl = baselink_for_fns (decl);
3027 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3028 && DECL_CLASS_SCOPE_P (decl))
3030 tree context = context_for_name_lookup (decl);
3031 if (context != current_class_type)
3033 tree path = currently_open_derived_class (context);
3034 perform_or_defer_access_check (TYPE_BINFO (path),
3039 decl = convert_from_reference (decl);
3043 if (TREE_DEPRECATED (decl))
3044 warn_deprecated_use (decl, NULL_TREE);
3049 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3050 use as a type-specifier. */
3053 finish_typeof (tree expr)
3057 if (type_dependent_expression_p (expr))
3059 type = cxx_make_type (TYPEOF_TYPE);
3060 TYPEOF_TYPE_EXPR (type) = expr;
3061 SET_TYPE_STRUCTURAL_EQUALITY (type);
3066 type = unlowered_expr_type (expr);
3068 if (!type || type == unknown_type_node)
3070 error ("type of %qE is unknown", expr);
3071 return error_mark_node;
3077 /* Perform C++-specific checks for __builtin_offsetof before calling
3081 finish_offsetof (tree expr)
3083 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3085 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3086 TREE_OPERAND (expr, 2));
3087 return error_mark_node;
3089 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3090 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3091 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3093 if (TREE_CODE (expr) == COMPONENT_REF
3094 || TREE_CODE (expr) == COMPOUND_EXPR)
3095 expr = TREE_OPERAND (expr, 1);
3096 error ("cannot apply %<offsetof%> to member function %qD", expr);
3097 return error_mark_node;
3099 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3100 expr = TREE_OPERAND (expr, 0);
3101 return fold_offsetof (expr, NULL_TREE);
3104 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3105 function is broken out from the above for the benefit of the tree-ssa
3109 simplify_aggr_init_expr (tree *tp)
3111 tree aggr_init_expr = *tp;
3113 /* Form an appropriate CALL_EXPR. */
3114 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3115 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3116 tree type = TREE_TYPE (slot);
3119 enum style_t { ctor, arg, pcc } style;
3121 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3123 #ifdef PCC_STATIC_STRUCT_RETURN
3129 gcc_assert (TREE_ADDRESSABLE (type));
3133 call_expr = build_call_array_loc (input_location,
3134 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3136 aggr_init_expr_nargs (aggr_init_expr),
3137 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3141 /* Replace the first argument to the ctor with the address of the
3143 cxx_mark_addressable (slot);
3144 CALL_EXPR_ARG (call_expr, 0) =
3145 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3147 else if (style == arg)
3149 /* Just mark it addressable here, and leave the rest to
3150 expand_call{,_inline}. */
3151 cxx_mark_addressable (slot);
3152 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3153 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3155 else if (style == pcc)
3157 /* If we're using the non-reentrant PCC calling convention, then we
3158 need to copy the returned value out of the static buffer into the
3160 push_deferring_access_checks (dk_no_check);
3161 call_expr = build_aggr_init (slot, call_expr,
3162 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3163 tf_warning_or_error);
3164 pop_deferring_access_checks ();
3165 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3168 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3170 tree init = build_zero_init (type, NULL_TREE,
3171 /*static_storage_p=*/false);
3172 init = build2 (INIT_EXPR, void_type_node, slot, init);
3173 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3180 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3183 emit_associated_thunks (tree fn)
3185 /* When we use vcall offsets, we emit thunks with the virtual
3186 functions to which they thunk. The whole point of vcall offsets
3187 is so that you can know statically the entire set of thunks that
3188 will ever be needed for a given virtual function, thereby
3189 enabling you to output all the thunks with the function itself. */
3190 if (DECL_VIRTUAL_P (fn)
3191 /* Do not emit thunks for extern template instantiations. */
3192 && ! DECL_REALLY_EXTERN (fn))
3196 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3198 if (!THUNK_ALIAS (thunk))
3200 use_thunk (thunk, /*emit_p=*/1);
3201 if (DECL_RESULT_THUNK_P (thunk))
3205 for (probe = DECL_THUNKS (thunk);
3206 probe; probe = TREE_CHAIN (probe))
3207 use_thunk (probe, /*emit_p=*/1);
3211 gcc_assert (!DECL_THUNKS (thunk));
3216 /* Generate RTL for FN. */
3219 expand_or_defer_fn (tree fn)
3221 /* When the parser calls us after finishing the body of a template
3222 function, we don't really want to expand the body. */
3223 if (processing_template_decl)
3225 /* Normally, collection only occurs in rest_of_compilation. So,
3226 if we don't collect here, we never collect junk generated
3227 during the processing of templates until we hit a
3228 non-template function. It's not safe to do this inside a
3229 nested class, though, as the parser may have local state that
3230 is not a GC root. */
3231 if (!function_depth)
3236 gcc_assert (DECL_SAVED_TREE (fn));
3238 /* If this is a constructor or destructor body, we have to clone
3240 if (maybe_clone_body (fn))
3242 /* We don't want to process FN again, so pretend we've written
3243 it out, even though we haven't. */
3244 TREE_ASM_WRITTEN (fn) = 1;
3245 DECL_SAVED_TREE (fn) = NULL_TREE;
3249 /* We make a decision about linkage for these functions at the end
3250 of the compilation. Until that point, we do not want the back
3251 end to output them -- but we do want it to see the bodies of
3252 these functions so that it can inline them as appropriate. */
3253 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3255 if (DECL_INTERFACE_KNOWN (fn))
3256 /* We've already made a decision as to how this function will
3260 DECL_EXTERNAL (fn) = 1;
3261 DECL_NOT_REALLY_EXTERN (fn) = 1;
3262 note_vague_linkage_fn (fn);
3263 /* A non-template inline function with external linkage will
3264 always be COMDAT. As we must eventually determine the
3265 linkage of all functions, and as that causes writes to
3266 the data mapped in from the PCH file, it's advantageous
3267 to mark the functions at this point. */
3268 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3270 /* This function must have external linkage, as
3271 otherwise DECL_INTERFACE_KNOWN would have been
3273 gcc_assert (TREE_PUBLIC (fn));
3274 comdat_linkage (fn);
3275 DECL_INTERFACE_KNOWN (fn) = 1;
3279 import_export_decl (fn);
3281 /* If the user wants us to keep all inline functions, then mark
3282 this function as needed so that finish_file will make sure to
3283 output it later. Similarly, all dllexport'd functions must
3284 be emitted; there may be callers in other DLLs. */
3285 if ((flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3286 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3290 /* There's no reason to do any of the work here if we're only doing
3291 semantic analysis; this code just generates RTL. */
3292 if (flag_syntax_only)
3297 /* Expand or defer, at the whim of the compilation unit manager. */
3298 cgraph_finalize_function (fn, function_depth > 1);
3310 /* Helper function for walk_tree, used by finalize_nrv below. */
3313 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3315 struct nrv_data *dp = (struct nrv_data *)data;
3318 /* No need to walk into types. There wouldn't be any need to walk into
3319 non-statements, except that we have to consider STMT_EXPRs. */
3322 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3323 but differs from using NULL_TREE in that it indicates that we care
3324 about the value of the RESULT_DECL. */
3325 else if (TREE_CODE (*tp) == RETURN_EXPR)
3326 TREE_OPERAND (*tp, 0) = dp->result;
3327 /* Change all cleanups for the NRV to only run when an exception is
3329 else if (TREE_CODE (*tp) == CLEANUP_STMT
3330 && CLEANUP_DECL (*tp) == dp->var)
3331 CLEANUP_EH_ONLY (*tp) = 1;
3332 /* Replace the DECL_EXPR for the NRV with an initialization of the
3333 RESULT_DECL, if needed. */
3334 else if (TREE_CODE (*tp) == DECL_EXPR
3335 && DECL_EXPR_DECL (*tp) == dp->var)
3338 if (DECL_INITIAL (dp->var)
3339 && DECL_INITIAL (dp->var) != error_mark_node)
3340 init = build2 (INIT_EXPR, void_type_node, dp->result,
3341 DECL_INITIAL (dp->var));
3343 init = build_empty_stmt (EXPR_LOCATION (*tp));
3344 DECL_INITIAL (dp->var) = NULL_TREE;
3345 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3348 /* And replace all uses of the NRV with the RESULT_DECL. */
3349 else if (*tp == dp->var)
3352 /* Avoid walking into the same tree more than once. Unfortunately, we
3353 can't just use walk_tree_without duplicates because it would only call
3354 us for the first occurrence of dp->var in the function body. */
3355 slot = htab_find_slot (dp->visited, *tp, INSERT);
3361 /* Keep iterating. */
3365 /* Called from finish_function to implement the named return value
3366 optimization by overriding all the RETURN_EXPRs and pertinent
3367 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3368 RESULT_DECL for the function. */
3371 finalize_nrv (tree *tp, tree var, tree result)
3373 struct nrv_data data;
3375 /* Copy debugging information from VAR to RESULT. */
3376 DECL_NAME (result) = DECL_NAME (var);
3377 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3378 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3379 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3380 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3381 /* Don't forget that we take its address. */
3382 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3385 data.result = result;
3386 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3387 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3388 htab_delete (data.visited);
3391 /* Return the declaration for the function called by CALL_EXPR T,
3392 TYPE is the class type of the clause decl. */
3395 omp_clause_info_fndecl (tree t, tree type)
3397 tree ret = get_callee_fndecl (t);
3402 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3403 t = CALL_EXPR_FN (t);
3405 if (TREE_CODE (t) == OBJ_TYPE_REF)
3407 t = cp_fold_obj_type_ref (t, type);
3408 if (TREE_CODE (t) == ADDR_EXPR
3409 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3410 return TREE_OPERAND (t, 0);
3416 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3419 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3420 bool need_copy_ctor, bool need_copy_assignment)
3422 int save_errorcount = errorcount;
3425 /* Always allocate 3 elements for simplicity. These are the
3426 function decls for the ctor, dtor, and assignment op.
3427 This layout is known to the three lang hooks,
3428 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3429 and cxx_omp_clause_assign_op. */
3430 info = make_tree_vec (3);
3431 CP_OMP_CLAUSE_INFO (c) = info;
3433 if (need_default_ctor
3434 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3438 if (need_default_ctor)
3442 t = build_int_cst (build_pointer_type (type), 0);
3443 t = build1 (INDIRECT_REF, type, t);
3444 vec = make_tree_vector_single (t);
3446 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3447 &vec, type, LOOKUP_NORMAL,
3448 tf_warning_or_error);
3451 release_tree_vector (vec);
3453 if (targetm.cxx.cdtor_returns_this () || errorcount)
3454 /* Because constructors and destructors return this,
3455 the call will have been cast to "void". Remove the
3456 cast here. We would like to use STRIP_NOPS, but it
3457 wouldn't work here because TYPE_MODE (t) and
3458 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3459 They are VOIDmode and Pmode, respectively. */
3460 if (TREE_CODE (t) == NOP_EXPR)
3461 t = TREE_OPERAND (t, 0);
3463 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3466 if ((need_default_ctor || need_copy_ctor)
3467 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3469 t = build_int_cst (build_pointer_type (type), 0);
3470 t = build1 (INDIRECT_REF, type, t);
3471 t = build_special_member_call (t, complete_dtor_identifier,
3472 NULL, type, LOOKUP_NORMAL,
3473 tf_warning_or_error);
3475 if (targetm.cxx.cdtor_returns_this () || errorcount)
3476 /* Because constructors and destructors return this,
3477 the call will have been cast to "void". Remove the
3478 cast here. We would like to use STRIP_NOPS, but it
3479 wouldn't work here because TYPE_MODE (t) and
3480 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3481 They are VOIDmode and Pmode, respectively. */
3482 if (TREE_CODE (t) == NOP_EXPR)
3483 t = TREE_OPERAND (t, 0);
3485 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3488 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3492 t = build_int_cst (build_pointer_type (type), 0);
3493 t = build1 (INDIRECT_REF, type, t);
3494 vec = make_tree_vector_single (t);
3495 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3496 &vec, type, LOOKUP_NORMAL,
3497 tf_warning_or_error);
3498 release_tree_vector (vec);
3500 /* We'll have called convert_from_reference on the call, which
3501 may well have added an indirect_ref. It's unneeded here,
3502 and in the way, so kill it. */
3503 if (TREE_CODE (t) == INDIRECT_REF)
3504 t = TREE_OPERAND (t, 0);
3506 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3509 return errorcount != save_errorcount;
3512 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3513 Remove any elements from the list that are invalid. */
3516 finish_omp_clauses (tree clauses)
3518 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3519 tree c, t, *pc = &clauses;
3522 bitmap_obstack_initialize (NULL);
3523 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3524 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3525 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3527 for (pc = &clauses, c = clauses; c ; c = *pc)
3529 bool remove = false;
3531 switch (OMP_CLAUSE_CODE (c))
3533 case OMP_CLAUSE_SHARED:
3535 goto check_dup_generic;
3536 case OMP_CLAUSE_PRIVATE:
3538 goto check_dup_generic;
3539 case OMP_CLAUSE_REDUCTION:
3541 goto check_dup_generic;
3542 case OMP_CLAUSE_COPYPRIVATE:
3543 name = "copyprivate";
3544 goto check_dup_generic;
3545 case OMP_CLAUSE_COPYIN:
3547 goto check_dup_generic;
3549 t = OMP_CLAUSE_DECL (c);
3550 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3552 if (processing_template_decl)
3555 error ("%qD is not a variable in clause %qs", t, name);
3557 error ("%qE is not a variable in clause %qs", t, name);
3560 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3561 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3562 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3564 error ("%qD appears more than once in data clauses", t);
3568 bitmap_set_bit (&generic_head, DECL_UID (t));
3571 case OMP_CLAUSE_FIRSTPRIVATE:
3572 t = OMP_CLAUSE_DECL (c);
3573 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3575 if (processing_template_decl)
3578 error ("%qD is not a variable in clause %<firstprivate%>", t);
3580 error ("%qE is not a variable in clause %<firstprivate%>", t);
3583 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3584 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3586 error ("%qD appears more than once in data clauses", t);
3590 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3593 case OMP_CLAUSE_LASTPRIVATE:
3594 t = OMP_CLAUSE_DECL (c);
3595 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3597 if (processing_template_decl)
3600 error ("%qD is not a variable in clause %<lastprivate%>", t);
3602 error ("%qE is not a variable in clause %<lastprivate%>", t);
3605 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3606 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3608 error ("%qD appears more than once in data clauses", t);
3612 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3616 t = OMP_CLAUSE_IF_EXPR (c);
3617 t = maybe_convert_cond (t);
3618 if (t == error_mark_node)
3620 OMP_CLAUSE_IF_EXPR (c) = t;
3623 case OMP_CLAUSE_NUM_THREADS:
3624 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3625 if (t == error_mark_node)
3627 else if (!type_dependent_expression_p (t)
3628 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3630 error ("num_threads expression must be integral");
3635 case OMP_CLAUSE_SCHEDULE:
3636 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3639 else if (t == error_mark_node)
3641 else if (!type_dependent_expression_p (t)
3642 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3644 error ("schedule chunk size expression must be integral");
3649 case OMP_CLAUSE_NOWAIT:
3650 case OMP_CLAUSE_ORDERED:
3651 case OMP_CLAUSE_DEFAULT:
3652 case OMP_CLAUSE_UNTIED:
3653 case OMP_CLAUSE_COLLAPSE:
3661 *pc = OMP_CLAUSE_CHAIN (c);
3663 pc = &OMP_CLAUSE_CHAIN (c);
3666 for (pc = &clauses, c = clauses; c ; c = *pc)
3668 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3669 bool remove = false;
3670 bool need_complete_non_reference = false;
3671 bool need_default_ctor = false;
3672 bool need_copy_ctor = false;
3673 bool need_copy_assignment = false;
3674 bool need_implicitly_determined = false;
3675 tree type, inner_type;
3679 case OMP_CLAUSE_SHARED:
3681 need_implicitly_determined = true;
3683 case OMP_CLAUSE_PRIVATE:
3685 need_complete_non_reference = true;
3686 need_default_ctor = true;
3687 need_implicitly_determined = true;
3689 case OMP_CLAUSE_FIRSTPRIVATE:
3690 name = "firstprivate";
3691 need_complete_non_reference = true;
3692 need_copy_ctor = true;
3693 need_implicitly_determined = true;
3695 case OMP_CLAUSE_LASTPRIVATE:
3696 name = "lastprivate";
3697 need_complete_non_reference = true;
3698 need_copy_assignment = true;
3699 need_implicitly_determined = true;
3701 case OMP_CLAUSE_REDUCTION:
3703 need_implicitly_determined = true;
3705 case OMP_CLAUSE_COPYPRIVATE:
3706 name = "copyprivate";
3707 need_copy_assignment = true;
3709 case OMP_CLAUSE_COPYIN:
3711 need_copy_assignment = true;
3714 pc = &OMP_CLAUSE_CHAIN (c);
3718 t = OMP_CLAUSE_DECL (c);
3719 if (processing_template_decl
3720 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3722 pc = &OMP_CLAUSE_CHAIN (c);
3728 case OMP_CLAUSE_LASTPRIVATE:
3729 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3730 need_default_ctor = true;
3733 case OMP_CLAUSE_REDUCTION:
3734 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3735 || POINTER_TYPE_P (TREE_TYPE (t)))
3737 error ("%qE has invalid type for %<reduction%>", t);
3740 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3742 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3750 error ("%qE has invalid type for %<reduction(%s)%>",
3751 t, operator_name_info[r_code].name);
3757 case OMP_CLAUSE_COPYIN:
3758 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3760 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3769 if (need_complete_non_reference)
3771 t = require_complete_type (t);
3772 if (t == error_mark_node)
3774 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3776 error ("%qE has reference type for %qs", t, name);
3780 if (need_implicitly_determined)
3782 const char *share_name = NULL;
3784 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3785 share_name = "threadprivate";
3786 else switch (cxx_omp_predetermined_sharing (t))
3788 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3790 case OMP_CLAUSE_DEFAULT_SHARED:
3791 share_name = "shared";
3793 case OMP_CLAUSE_DEFAULT_PRIVATE:
3794 share_name = "private";
3801 error ("%qE is predetermined %qs for %qs",
3802 t, share_name, name);
3807 /* We're interested in the base element, not arrays. */
3808 inner_type = type = TREE_TYPE (t);
3809 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3810 inner_type = TREE_TYPE (inner_type);
3812 /* Check for special function availability by building a call to one.
3813 Save the results, because later we won't be in the right context
3814 for making these queries. */
3815 if (CLASS_TYPE_P (inner_type)
3816 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3817 && !type_dependent_expression_p (t)
3818 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3819 need_copy_ctor, need_copy_assignment))
3823 *pc = OMP_CLAUSE_CHAIN (c);
3825 pc = &OMP_CLAUSE_CHAIN (c);
3828 bitmap_obstack_release (NULL);
3832 /* For all variables in the tree_list VARS, mark them as thread local. */
3835 finish_omp_threadprivate (tree vars)
3839 /* Mark every variable in VARS to be assigned thread local storage. */
3840 for (t = vars; t; t = TREE_CHAIN (t))
3842 tree v = TREE_PURPOSE (t);
3844 if (error_operand_p (v))
3846 else if (TREE_CODE (v) != VAR_DECL)
3847 error ("%<threadprivate%> %qD is not file, namespace "
3848 "or block scope variable", v);
3849 /* If V had already been marked threadprivate, it doesn't matter
3850 whether it had been used prior to this point. */
3851 else if (TREE_USED (v)
3852 && (DECL_LANG_SPECIFIC (v) == NULL
3853 || !CP_DECL_THREADPRIVATE_P (v)))
3854 error ("%qE declared %<threadprivate%> after first use", v);
3855 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3856 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3857 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3858 error ("%<threadprivate%> %qE has incomplete type", v);
3859 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3860 && CP_DECL_CONTEXT (v) != current_class_type)
3861 error ("%<threadprivate%> %qE directive not "
3862 "in %qT definition", v, CP_DECL_CONTEXT (v));
3865 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3866 if (DECL_LANG_SPECIFIC (v) == NULL)
3868 retrofit_lang_decl (v);
3870 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3871 after the allocation of the lang_decl structure. */
3872 if (DECL_DISCRIMINATOR_P (v))
3873 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
3876 if (! DECL_THREAD_LOCAL_P (v))
3878 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3879 /* If rtl has been already set for this var, call
3880 make_decl_rtl once again, so that encode_section_info
3881 has a chance to look at the new decl flags. */
3882 if (DECL_RTL_SET_P (v))
3885 CP_DECL_THREADPRIVATE_P (v) = 1;
3890 /* Build an OpenMP structured block. */
3893 begin_omp_structured_block (void)
3895 return do_pushlevel (sk_omp);
3899 finish_omp_structured_block (tree block)
3901 return do_poplevel (block);
3904 /* Similarly, except force the retention of the BLOCK. */
3907 begin_omp_parallel (void)
3909 keep_next_level (true);
3910 return begin_omp_structured_block ();
3914 finish_omp_parallel (tree clauses, tree body)
3918 body = finish_omp_structured_block (body);
3920 stmt = make_node (OMP_PARALLEL);
3921 TREE_TYPE (stmt) = void_type_node;
3922 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3923 OMP_PARALLEL_BODY (stmt) = body;
3925 return add_stmt (stmt);
3929 begin_omp_task (void)
3931 keep_next_level (true);
3932 return begin_omp_structured_block ();
3936 finish_omp_task (tree clauses, tree body)
3940 body = finish_omp_structured_block (body);
3942 stmt = make_node (OMP_TASK);
3943 TREE_TYPE (stmt) = void_type_node;
3944 OMP_TASK_CLAUSES (stmt) = clauses;
3945 OMP_TASK_BODY (stmt) = body;
3947 return add_stmt (stmt);
3950 /* Helper function for finish_omp_for. Convert Ith random access iterator
3951 into integral iterator. Return FALSE if successful. */
3954 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3955 tree condv, tree incrv, tree *body,
3956 tree *pre_body, tree clauses)
3958 tree diff, iter_init, iter_incr = NULL, last;
3959 tree incr_var = NULL, orig_pre_body, orig_body, c;
3960 tree decl = TREE_VEC_ELT (declv, i);
3961 tree init = TREE_VEC_ELT (initv, i);
3962 tree cond = TREE_VEC_ELT (condv, i);
3963 tree incr = TREE_VEC_ELT (incrv, i);
3965 location_t elocus = locus;
3967 if (init && EXPR_HAS_LOCATION (init))
3968 elocus = EXPR_LOCATION (init);
3970 switch (TREE_CODE (cond))
3976 if (TREE_OPERAND (cond, 1) == iter)
3977 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
3978 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
3979 if (TREE_OPERAND (cond, 0) != iter)
3980 cond = error_mark_node;
3983 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3984 TREE_OPERAND (cond, 1), ERROR_MARK,
3985 NULL, tf_warning_or_error);
3986 if (error_operand_p (tem))
3991 cond = error_mark_node;
3994 if (cond == error_mark_node)
3996 error_at (elocus, "invalid controlling predicate");
3999 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4000 ERROR_MARK, iter, ERROR_MARK, NULL,
4001 tf_warning_or_error);
4002 if (error_operand_p (diff))
4004 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4006 error_at (elocus, "difference between %qE and %qD does not have integer type",
4007 TREE_OPERAND (cond, 1), iter);
4011 switch (TREE_CODE (incr))
4013 case PREINCREMENT_EXPR:
4014 case PREDECREMENT_EXPR:
4015 case POSTINCREMENT_EXPR:
4016 case POSTDECREMENT_EXPR:
4017 if (TREE_OPERAND (incr, 0) != iter)
4019 incr = error_mark_node;
4022 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4023 tf_warning_or_error);
4024 if (error_operand_p (iter_incr))
4026 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4027 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4028 incr = integer_one_node;
4030 incr = integer_minus_one_node;
4033 if (TREE_OPERAND (incr, 0) != iter)
4034 incr = error_mark_node;
4035 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4036 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4038 tree rhs = TREE_OPERAND (incr, 1);
4039 if (TREE_OPERAND (rhs, 0) == iter)
4041 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4043 incr = error_mark_node;
4046 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4047 TREE_OPERAND (rhs, 1),
4048 tf_warning_or_error);
4049 if (error_operand_p (iter_incr))
4051 incr = TREE_OPERAND (rhs, 1);
4052 incr = cp_convert (TREE_TYPE (diff), incr);
4053 if (TREE_CODE (rhs) == MINUS_EXPR)
4055 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4056 incr = fold_if_not_in_template (incr);
4058 if (TREE_CODE (incr) != INTEGER_CST
4059 && (TREE_CODE (incr) != NOP_EXPR
4060 || (TREE_CODE (TREE_OPERAND (incr, 0))
4065 else if (TREE_OPERAND (rhs, 1) == iter)
4067 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4068 || TREE_CODE (rhs) != PLUS_EXPR)
4069 incr = error_mark_node;
4072 iter_incr = build_x_binary_op (PLUS_EXPR,
4073 TREE_OPERAND (rhs, 0),
4076 tf_warning_or_error);
4077 if (error_operand_p (iter_incr))
4079 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4081 tf_warning_or_error);
4082 if (error_operand_p (iter_incr))
4084 incr = TREE_OPERAND (rhs, 0);
4089 incr = error_mark_node;
4092 incr = error_mark_node;
4095 incr = error_mark_node;
4099 if (incr == error_mark_node)
4101 error_at (elocus, "invalid increment expression");
4105 incr = cp_convert (TREE_TYPE (diff), incr);
4106 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4107 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4108 && OMP_CLAUSE_DECL (c) == iter)
4111 decl = create_temporary_var (TREE_TYPE (diff));
4113 add_decl_expr (decl);
4114 last = create_temporary_var (TREE_TYPE (diff));
4116 add_decl_expr (last);
4117 if (c && iter_incr == NULL)
4119 incr_var = create_temporary_var (TREE_TYPE (diff));
4120 pushdecl (incr_var);
4121 add_decl_expr (incr_var);
4123 gcc_assert (stmts_are_full_exprs_p ());
4125 orig_pre_body = *pre_body;
4126 *pre_body = push_stmt_list ();
4128 add_stmt (orig_pre_body);
4130 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4131 tf_warning_or_error));
4132 init = build_int_cst (TREE_TYPE (diff), 0);
4133 if (c && iter_incr == NULL)
4135 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4136 incr, tf_warning_or_error));
4138 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4139 tf_warning_or_error);
4141 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4142 tf_warning_or_error));
4143 *pre_body = pop_stmt_list (*pre_body);
4145 cond = cp_build_binary_op (elocus,
4146 TREE_CODE (cond), decl, diff,
4147 tf_warning_or_error);
4148 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4149 elocus, incr, NULL_TREE);
4152 *body = push_stmt_list ();
4153 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4154 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4155 tf_warning_or_error);
4156 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4157 finish_expr_stmt (iter_init);
4158 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4159 tf_warning_or_error));
4160 add_stmt (orig_body);
4161 *body = pop_stmt_list (*body);
4165 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4166 finish_expr_stmt (iter_incr);
4167 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4168 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4171 TREE_VEC_ELT (declv, i) = decl;
4172 TREE_VEC_ELT (initv, i) = init;
4173 TREE_VEC_ELT (condv, i) = cond;
4174 TREE_VEC_ELT (incrv, i) = incr;
4179 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4180 are directly for their associated operands in the statement. DECL
4181 and INIT are a combo; if DECL is NULL then INIT ought to be a
4182 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4183 optional statements that need to go before the loop into its
4187 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4188 tree incrv, tree body, tree pre_body, tree clauses)
4190 tree omp_for = NULL, orig_incr = NULL;
4191 tree decl, init, cond, incr;
4195 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4196 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4197 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4198 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4200 decl = TREE_VEC_ELT (declv, i);
4201 init = TREE_VEC_ELT (initv, i);
4202 cond = TREE_VEC_ELT (condv, i);
4203 incr = TREE_VEC_ELT (incrv, i);
4209 switch (TREE_CODE (init))
4212 decl = TREE_OPERAND (init, 0);
4213 init = TREE_OPERAND (init, 1);
4216 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4218 decl = TREE_OPERAND (init, 0);
4219 init = TREE_OPERAND (init, 2);
4229 "expected iteration declaration or initialization");
4234 if (init && EXPR_HAS_LOCATION (init))
4235 elocus = EXPR_LOCATION (init);
4239 error_at (elocus, "missing controlling predicate");
4245 error_at (elocus, "missing increment expression");
4249 TREE_VEC_ELT (declv, i) = decl;
4250 TREE_VEC_ELT (initv, i) = init;
4253 if (dependent_omp_for_p (declv, initv, condv, incrv))
4257 stmt = make_node (OMP_FOR);
4259 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4261 /* This is really just a place-holder. We'll be decomposing this
4262 again and going through the cp_build_modify_expr path below when
4263 we instantiate the thing. */
4264 TREE_VEC_ELT (initv, i)
4265 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4266 TREE_VEC_ELT (initv, i));
4269 TREE_TYPE (stmt) = void_type_node;
4270 OMP_FOR_INIT (stmt) = initv;
4271 OMP_FOR_COND (stmt) = condv;
4272 OMP_FOR_INCR (stmt) = incrv;
4273 OMP_FOR_BODY (stmt) = body;
4274 OMP_FOR_PRE_BODY (stmt) = pre_body;
4275 OMP_FOR_CLAUSES (stmt) = clauses;
4277 SET_EXPR_LOCATION (stmt, locus);
4278 return add_stmt (stmt);
4281 if (processing_template_decl)
4282 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4284 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4286 decl = TREE_VEC_ELT (declv, i);
4287 init = TREE_VEC_ELT (initv, i);
4288 cond = TREE_VEC_ELT (condv, i);
4289 incr = TREE_VEC_ELT (incrv, i);
4291 TREE_VEC_ELT (orig_incr, i) = incr;
4294 if (init && EXPR_HAS_LOCATION (init))
4295 elocus = EXPR_LOCATION (init);
4299 error_at (elocus, "expected iteration declaration or initialization");
4303 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4306 TREE_VEC_ELT (orig_incr, i) = incr;
4307 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4308 TREE_CODE (TREE_OPERAND (incr, 1)),
4309 TREE_OPERAND (incr, 2),
4310 tf_warning_or_error);
4313 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4315 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4316 incrv, &body, &pre_body, clauses))
4321 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4322 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4324 error_at (elocus, "invalid type for iteration variable %qE", decl);
4328 if (!processing_template_decl)
4330 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4331 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4334 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4336 && TREE_SIDE_EFFECTS (cond)
4337 && COMPARISON_CLASS_P (cond)
4338 && !processing_template_decl)
4340 tree t = TREE_OPERAND (cond, 0);
4341 if (TREE_SIDE_EFFECTS (t)
4343 && (TREE_CODE (t) != NOP_EXPR
4344 || TREE_OPERAND (t, 0) != decl))
4345 TREE_OPERAND (cond, 0)
4346 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4348 t = TREE_OPERAND (cond, 1);
4349 if (TREE_SIDE_EFFECTS (t)
4351 && (TREE_CODE (t) != NOP_EXPR
4352 || TREE_OPERAND (t, 0) != decl))
4353 TREE_OPERAND (cond, 1)
4354 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4356 if (decl == error_mark_node || init == error_mark_node)
4359 TREE_VEC_ELT (declv, i) = decl;
4360 TREE_VEC_ELT (initv, i) = init;
4361 TREE_VEC_ELT (condv, i) = cond;
4362 TREE_VEC_ELT (incrv, i) = incr;
4366 if (IS_EMPTY_STMT (pre_body))
4369 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4372 if (omp_for == NULL)
4375 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4377 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4378 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4380 if (TREE_CODE (incr) != MODIFY_EXPR)
4383 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4384 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4385 && !processing_template_decl)
4387 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4388 if (TREE_SIDE_EFFECTS (t)
4390 && (TREE_CODE (t) != NOP_EXPR
4391 || TREE_OPERAND (t, 0) != decl))
4392 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4393 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4395 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4396 if (TREE_SIDE_EFFECTS (t)
4398 && (TREE_CODE (t) != NOP_EXPR
4399 || TREE_OPERAND (t, 0) != decl))
4400 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4401 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4405 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4407 if (omp_for != NULL)
4408 OMP_FOR_CLAUSES (omp_for) = clauses;
4413 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4422 dependent_p = false;
4425 /* Even in a template, we can detect invalid uses of the atomic
4426 pragma if neither LHS nor RHS is type-dependent. */
4427 if (processing_template_decl)
4429 dependent_p = (type_dependent_expression_p (lhs)
4430 || type_dependent_expression_p (rhs));
4433 lhs = build_non_dependent_expr (lhs);
4434 rhs = build_non_dependent_expr (rhs);
4439 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4440 if (stmt == error_mark_node)
4443 if (processing_template_decl)
4444 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4445 build2 (code, void_type_node, orig_lhs, orig_rhs));
4450 finish_omp_barrier (void)
4452 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4453 VEC(tree,gc) *vec = make_tree_vector ();
4454 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4455 release_tree_vector (vec);
4456 finish_expr_stmt (stmt);
4460 finish_omp_flush (void)
4462 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4463 VEC(tree,gc) *vec = make_tree_vector ();
4464 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4465 release_tree_vector (vec);
4466 finish_expr_stmt (stmt);
4470 finish_omp_taskwait (void)
4472 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4473 VEC(tree,gc) *vec = make_tree_vector ();
4474 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4475 release_tree_vector (vec);
4476 finish_expr_stmt (stmt);
4480 init_cp_semantics (void)
4484 /* Build a STATIC_ASSERT for a static assertion with the condition
4485 CONDITION and the message text MESSAGE. LOCATION is the location
4486 of the static assertion in the source code. When MEMBER_P, this
4487 static assertion is a member of a class. */
4489 finish_static_assert (tree condition, tree message, location_t location,
4492 if (check_for_bare_parameter_packs (condition))
4493 condition = error_mark_node;
4495 if (type_dependent_expression_p (condition)
4496 || value_dependent_expression_p (condition))
4498 /* We're in a template; build a STATIC_ASSERT and put it in
4502 assertion = make_node (STATIC_ASSERT);
4503 STATIC_ASSERT_CONDITION (assertion) = condition;
4504 STATIC_ASSERT_MESSAGE (assertion) = message;
4505 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4508 maybe_add_class_template_decl_list (current_class_type,
4512 add_stmt (assertion);
4517 /* Fold the expression and convert it to a boolean value. */
4518 condition = fold_non_dependent_expr (condition);
4519 condition = cp_convert (boolean_type_node, condition);
4521 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4522 /* Do nothing; the condition is satisfied. */
4526 location_t saved_loc = input_location;
4528 input_location = location;
4529 if (TREE_CODE (condition) == INTEGER_CST
4530 && integer_zerop (condition))
4531 /* Report the error. */
4532 error ("static assertion failed: %E", message);
4533 else if (condition && condition != error_mark_node)
4534 error ("non-constant condition for static assertion");
4535 input_location = saved_loc;
4539 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4540 just return the type even though EXPR is a type-dependent expression.
4541 The ABI specifies which cases this applies to, which is a subset of the
4545 describable_type (tree expr)
4547 tree type = NULL_TREE;
4549 if (! type_dependent_expression_p (expr)
4550 && ! type_unknown_p (expr))
4552 type = unlowered_expr_type (expr);
4553 if (real_lvalue_p (expr))
4554 type = build_reference_type (type);
4560 switch (TREE_CODE (expr))
4566 /* Named rvalue reference becomes lvalue. */
4567 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4572 case TEMPLATE_PARM_INDEX:
4574 case STATIC_CAST_EXPR:
4575 case REINTERPRET_CAST_EXPR:
4576 case CONST_CAST_EXPR:
4577 case DYNAMIC_CAST_EXPR:
4578 type = TREE_TYPE (expr);
4583 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4584 if (ptrtype && POINTER_TYPE_P (ptrtype))
4585 type = build_reference_type (TREE_TYPE (ptrtype));
4590 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4591 type = TREE_TYPE (expr);
4595 if (type && type_uses_auto (type))
4601 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4602 suitable for use as a type-specifier.
4604 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4605 id-expression or a class member access, FALSE when it was parsed as
4606 a full expression. */
4609 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4611 tree orig_expr = expr;
4612 tree type = NULL_TREE;
4614 if (!expr || error_operand_p (expr))
4615 return error_mark_node;
4618 || TREE_CODE (expr) == TYPE_DECL
4619 || (TREE_CODE (expr) == BIT_NOT_EXPR
4620 && TYPE_P (TREE_OPERAND (expr, 0))))
4622 error ("argument to decltype must be an expression");
4623 return error_mark_node;
4626 if (type_dependent_expression_p (expr))
4628 if (id_expression_or_member_access_p)
4630 switch (TREE_CODE (expr))
4637 case TEMPLATE_PARM_INDEX:
4638 type = TREE_TYPE (expr);
4646 if (type && !type_uses_auto (type))
4649 type = cxx_make_type (DECLTYPE_TYPE);
4650 DECLTYPE_TYPE_EXPR (type) = expr;
4651 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4652 = id_expression_or_member_access_p;
4653 SET_TYPE_STRUCTURAL_EQUALITY (type);
4658 /* The type denoted by decltype(e) is defined as follows: */
4660 if (id_expression_or_member_access_p)
4662 /* If e is an id-expression or a class member access (5.2.5
4663 [expr.ref]), decltype(e) is defined as the type of the entity
4664 named by e. If there is no such entity, or e names a set of
4665 overloaded functions, the program is ill-formed. */
4666 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4667 expr = lookup_name (expr);
4669 if (TREE_CODE (expr) == INDIRECT_REF)
4670 /* This can happen when the expression is, e.g., "a.b". Just
4671 look at the underlying operand. */
4672 expr = TREE_OPERAND (expr, 0);
4674 if (TREE_CODE (expr) == OFFSET_REF
4675 || TREE_CODE (expr) == MEMBER_REF)
4676 /* We're only interested in the field itself. If it is a
4677 BASELINK, we will need to see through it in the next
4679 expr = TREE_OPERAND (expr, 1);
4681 if (TREE_CODE (expr) == BASELINK)
4682 /* See through BASELINK nodes to the underlying functions. */
4683 expr = BASELINK_FUNCTIONS (expr);
4685 if (TREE_CODE (expr) == OVERLOAD)
4687 if (OVL_CHAIN (expr))
4689 error ("%qE refers to a set of overloaded functions", orig_expr);
4690 return error_mark_node;
4693 /* An overload set containing only one function: just look
4694 at that function. */
4695 expr = OVL_FUNCTION (expr);
4698 switch (TREE_CODE (expr))
4701 if (DECL_BIT_FIELD_TYPE (expr))
4703 type = DECL_BIT_FIELD_TYPE (expr);
4706 /* Fall through for fields that aren't bitfields. */
4713 case TEMPLATE_PARM_INDEX:
4714 type = TREE_TYPE (expr);
4718 type = error_mark_node;
4722 type = is_bitfield_expr_with_lowered_type (expr);
4724 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4731 /* We can get here when the id-expression refers to an
4733 type = TREE_TYPE (expr);
4737 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4738 || TREE_CODE (expr) == SCOPE_REF);
4739 error ("argument to decltype must be an expression");
4740 return error_mark_node;
4745 /* Expressions of reference type are sometimes wrapped in
4746 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4747 representation, not part of the language, so we have to look
4749 if (TREE_CODE (expr) == INDIRECT_REF
4750 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4752 expr = TREE_OPERAND (expr, 0);
4754 if (TREE_CODE (expr) == CALL_EXPR)
4756 /* If e is a function call (5.2.2 [expr.call]) or an
4757 invocation of an overloaded operator (parentheses around e
4758 are ignored), decltype(e) is defined as the return type of
4760 tree fndecl = get_callee_fndecl (expr);
4761 if (fndecl && fndecl != error_mark_node)
4762 type = TREE_TYPE (TREE_TYPE (fndecl));
4765 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4766 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4767 || TREE_CODE (target_type) == POINTER_TYPE)
4768 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4769 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4770 type = TREE_TYPE (TREE_TYPE (target_type));
4772 sorry ("unable to determine the declared type of expression %<%E%>",
4778 type = is_bitfield_expr_with_lowered_type (expr);
4781 /* Bitfields are special, because their type encodes the
4782 number of bits they store. If the expression referenced a
4783 bitfield, TYPE now has the declared type of that
4785 type = cp_build_qualified_type (type,
4786 cp_type_quals (TREE_TYPE (expr)));
4788 if (real_lvalue_p (expr))
4789 type = build_reference_type (type);
4793 /* Otherwise, where T is the type of e, if e is an lvalue,
4794 decltype(e) is defined as T&, otherwise decltype(e) is
4796 type = TREE_TYPE (expr);
4797 if (type == error_mark_node)
4798 return error_mark_node;
4799 else if (expr == current_class_ptr)
4800 /* If the expression is just "this", we want the
4801 cv-unqualified pointer for the "this" type. */
4802 type = TYPE_MAIN_VARIANT (type);
4803 else if (real_lvalue_p (expr))
4805 if (TREE_CODE (type) != REFERENCE_TYPE)
4806 type = build_reference_type (type);
4809 type = non_reference (type);
4814 if (!type || type == unknown_type_node)
4816 error ("type of %qE is unknown", expr);
4817 return error_mark_node;
4823 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4824 __has_nothrow_copy, depending on assign_p. */
4827 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4834 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4837 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4839 else if (TYPE_HAS_INIT_REF (type))
4841 /* If construction of the copy constructor was postponed, create
4843 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4844 lazily_declare_fn (sfk_copy_constructor, type);
4845 fns = CLASSTYPE_CONSTRUCTORS (type);
4850 for (; fns; fns = OVL_NEXT (fns))
4852 tree fn = OVL_CURRENT (fns);
4856 if (copy_fn_p (fn) == 0)
4859 else if (copy_fn_p (fn) <= 0)
4862 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4869 /* Actually evaluates the trait. */
4872 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4874 enum tree_code type_code1;
4877 type_code1 = TREE_CODE (type1);
4881 case CPTK_HAS_NOTHROW_ASSIGN:
4882 type1 = strip_array_types (type1);
4883 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4884 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4885 || (CLASS_TYPE_P (type1)
4886 && classtype_has_nothrow_assign_or_copy_p (type1,
4889 case CPTK_HAS_TRIVIAL_ASSIGN:
4890 /* ??? The standard seems to be missing the "or array of such a class
4891 type" wording for this trait. */
4892 type1 = strip_array_types (type1);
4893 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4894 && (trivial_type_p (type1)
4895 || (CLASS_TYPE_P (type1)
4896 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4898 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4899 type1 = strip_array_types (type1);
4900 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4901 || (CLASS_TYPE_P (type1)
4902 && (t = locate_ctor (type1, NULL))
4903 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4905 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4906 type1 = strip_array_types (type1);
4907 return (trivial_type_p (type1)
4908 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4910 case CPTK_HAS_NOTHROW_COPY:
4911 type1 = strip_array_types (type1);
4912 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4913 || (CLASS_TYPE_P (type1)
4914 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4916 case CPTK_HAS_TRIVIAL_COPY:
4917 /* ??? The standard seems to be missing the "or array of such a class
4918 type" wording for this trait. */
4919 type1 = strip_array_types (type1);
4920 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
4921 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4923 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4924 type1 = strip_array_types (type1);
4925 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
4926 || (CLASS_TYPE_P (type1)
4927 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4929 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4930 return (CLASS_TYPE_P (type1)
4931 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4933 case CPTK_IS_ABSTRACT:
4934 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4936 case CPTK_IS_BASE_OF:
4937 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4938 && DERIVED_FROM_P (type1, type2));
4941 return (NON_UNION_CLASS_TYPE_P (type1));
4943 case CPTK_IS_CONVERTIBLE_TO:
4948 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4951 return (type_code1 == ENUMERAL_TYPE);
4954 return (pod_type_p (type1));
4956 case CPTK_IS_POLYMORPHIC:
4957 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4959 case CPTK_IS_STD_LAYOUT:
4960 return (std_layout_type_p (type1));
4962 case CPTK_IS_TRIVIAL:
4963 return (trivial_type_p (type1));
4966 return (type_code1 == UNION_TYPE);
4974 /* Returns true if TYPE is a complete type, an array of unknown bound,
4975 or (possibly cv-qualified) void, returns false otherwise. */
4978 check_trait_type (tree type)
4980 if (COMPLETE_TYPE_P (type))
4983 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
4986 if (VOID_TYPE_P (type))
4992 /* Process a trait expression. */
4995 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4997 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4998 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4999 || kind == CPTK_HAS_NOTHROW_COPY
5000 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5001 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5002 || kind == CPTK_HAS_TRIVIAL_COPY
5003 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5004 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5005 || kind == CPTK_IS_ABSTRACT
5006 || kind == CPTK_IS_BASE_OF
5007 || kind == CPTK_IS_CLASS
5008 || kind == CPTK_IS_CONVERTIBLE_TO
5009 || kind == CPTK_IS_EMPTY
5010 || kind == CPTK_IS_ENUM
5011 || kind == CPTK_IS_POD
5012 || kind == CPTK_IS_POLYMORPHIC
5013 || kind == CPTK_IS_STD_LAYOUT
5014 || kind == CPTK_IS_TRIVIAL
5015 || kind == CPTK_IS_UNION);
5017 if (kind == CPTK_IS_CONVERTIBLE_TO)
5019 sorry ("__is_convertible_to");
5020 return error_mark_node;
5023 if (type1 == error_mark_node
5024 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5025 && type2 == error_mark_node))
5026 return error_mark_node;
5028 if (processing_template_decl)
5030 tree trait_expr = make_node (TRAIT_EXPR);
5031 TREE_TYPE (trait_expr) = boolean_type_node;
5032 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5033 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5034 TRAIT_EXPR_KIND (trait_expr) = kind;
5038 complete_type (type1);
5040 complete_type (type2);
5044 case CPTK_HAS_NOTHROW_ASSIGN:
5045 case CPTK_HAS_TRIVIAL_ASSIGN:
5046 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5047 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5048 case CPTK_HAS_NOTHROW_COPY:
5049 case CPTK_HAS_TRIVIAL_COPY:
5050 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5051 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5052 case CPTK_IS_ABSTRACT:
5055 case CPTK_IS_POLYMORPHIC:
5056 case CPTK_IS_STD_LAYOUT:
5057 case CPTK_IS_TRIVIAL:
5058 if (!check_trait_type (type1))
5060 error ("incomplete type %qT not allowed", type1);
5061 return error_mark_node;
5065 case CPTK_IS_BASE_OF:
5066 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5067 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5068 && !COMPLETE_TYPE_P (type2))
5070 error ("incomplete type %qT not allowed", type2);
5071 return error_mark_node;
5080 case CPTK_IS_CONVERTIBLE_TO:
5085 return (trait_expr_value (kind, type1, type2)
5086 ? boolean_true_node : boolean_false_node);
5089 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5090 which is ignored for C++. */
5093 set_float_const_decimal64 (void)
5098 clear_float_const_decimal64 (void)
5103 float_const_decimal64_p (void)
5108 #include "gt-cp-semantics.h"