1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008, 2009 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
34 #include "tree-inline.h"
35 #include "tree-mudflap.h"
44 #include "diagnostic.h"
46 #include "tree-iterator.h"
51 /* There routines provide a modular interface to perform many parsing
52 operations. They may therefore be used during actual parsing, or
53 during template instantiation, which may be regarded as a
54 degenerate form of parsing. */
56 static tree maybe_convert_cond (tree);
57 static tree finalize_nrv_r (tree *, int *, void *);
60 /* Deferred Access Checking Overview
61 ---------------------------------
63 Most C++ expressions and declarations require access checking
64 to be performed during parsing. However, in several cases,
65 this has to be treated differently.
67 For member declarations, access checking has to be deferred
68 until more information about the declaration is known. For
80 When we are parsing the function return type `A::X', we don't
81 really know if this is allowed until we parse the function name.
83 Furthermore, some contexts require that access checking is
84 never performed at all. These include class heads, and template
87 Typical use of access checking functions is described here:
89 1. When we enter a context that requires certain access checking
90 mode, the function `push_deferring_access_checks' is called with
91 DEFERRING argument specifying the desired mode. Access checking
92 may be performed immediately (dk_no_deferred), deferred
93 (dk_deferred), or not performed (dk_no_check).
95 2. When a declaration such as a type, or a variable, is encountered,
96 the function `perform_or_defer_access_check' is called. It
97 maintains a VEC of all deferred checks.
99 3. The global `current_class_type' or `current_function_decl' is then
100 setup by the parser. `enforce_access' relies on these information
103 4. Upon exiting the context mentioned in step 1,
104 `perform_deferred_access_checks' is called to check all declaration
105 stored in the VEC. `pop_deferring_access_checks' is then
106 called to restore the previous access checking mode.
108 In case of parsing error, we simply call `pop_deferring_access_checks'
109 without `perform_deferred_access_checks'. */
111 typedef struct GTY(()) deferred_access {
112 /* A VEC representing name-lookups for which we have deferred
113 checking access controls. We cannot check the accessibility of
114 names used in a decl-specifier-seq until we know what is being
115 declared because code like:
122 A::B* A::f() { return 0; }
124 is valid, even though `A::B' is not generally accessible. */
125 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
127 /* The current mode of access checks. */
128 enum deferring_kind deferring_access_checks_kind;
131 DEF_VEC_O (deferred_access);
132 DEF_VEC_ALLOC_O (deferred_access,gc);
134 /* Data for deferred access checking. */
135 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
136 static GTY(()) unsigned deferred_access_no_check;
138 /* Save the current deferred access states and start deferred
139 access checking iff DEFER_P is true. */
142 push_deferring_access_checks (deferring_kind deferring)
144 /* For context like template instantiation, access checking
145 disabling applies to all nested context. */
146 if (deferred_access_no_check || deferring == dk_no_check)
147 deferred_access_no_check++;
150 deferred_access *ptr;
152 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
153 ptr->deferred_access_checks = NULL;
154 ptr->deferring_access_checks_kind = deferring;
158 /* Resume deferring access checks again after we stopped doing
162 resume_deferring_access_checks (void)
164 if (!deferred_access_no_check)
165 VEC_last (deferred_access, deferred_access_stack)
166 ->deferring_access_checks_kind = dk_deferred;
169 /* Stop deferring access checks. */
172 stop_deferring_access_checks (void)
174 if (!deferred_access_no_check)
175 VEC_last (deferred_access, deferred_access_stack)
176 ->deferring_access_checks_kind = dk_no_deferred;
179 /* Discard the current deferred access checks and restore the
183 pop_deferring_access_checks (void)
185 if (deferred_access_no_check)
186 deferred_access_no_check--;
188 VEC_pop (deferred_access, deferred_access_stack);
191 /* Returns a TREE_LIST representing the deferred checks.
192 The TREE_PURPOSE of each node is the type through which the
193 access occurred; the TREE_VALUE is the declaration named.
196 VEC (deferred_access_check,gc)*
197 get_deferred_access_checks (void)
199 if (deferred_access_no_check)
202 return (VEC_last (deferred_access, deferred_access_stack)
203 ->deferred_access_checks);
206 /* Take current deferred checks and combine with the
207 previous states if we also defer checks previously.
208 Otherwise perform checks now. */
211 pop_to_parent_deferring_access_checks (void)
213 if (deferred_access_no_check)
214 deferred_access_no_check--;
217 VEC (deferred_access_check,gc) *checks;
218 deferred_access *ptr;
220 checks = (VEC_last (deferred_access, deferred_access_stack)
221 ->deferred_access_checks);
223 VEC_pop (deferred_access, deferred_access_stack);
224 ptr = VEC_last (deferred_access, deferred_access_stack);
225 if (ptr->deferring_access_checks_kind == dk_no_deferred)
228 perform_access_checks (checks);
232 /* Merge with parent. */
234 deferred_access_check *chk, *probe;
237 VEC_iterate (deferred_access_check, checks, i, chk) ;
241 VEC_iterate (deferred_access_check,
242 ptr->deferred_access_checks, j, probe) ;
245 if (probe->binfo == chk->binfo &&
246 probe->decl == chk->decl &&
247 probe->diag_decl == chk->diag_decl)
250 /* Insert into parent's checks. */
251 VEC_safe_push (deferred_access_check, gc,
252 ptr->deferred_access_checks, chk);
259 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
260 is the BINFO indicating the qualifying scope used to access the
261 DECL node stored in the TREE_VALUE of the node. */
264 perform_access_checks (VEC (deferred_access_check,gc)* checks)
267 deferred_access_check *chk;
272 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
273 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
276 /* Perform the deferred access checks.
278 After performing the checks, we still have to keep the list
279 `deferred_access_stack->deferred_access_checks' since we may want
280 to check access for them again later in a different context.
287 A::X A::a, x; // No error for `A::a', error for `x'
289 We have to perform deferred access of `A::X', first with `A::a',
293 perform_deferred_access_checks (void)
295 perform_access_checks (get_deferred_access_checks ());
298 /* Defer checking the accessibility of DECL, when looked up in
299 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
302 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
305 deferred_access *ptr;
306 deferred_access_check *chk;
307 deferred_access_check *new_access;
310 /* Exit if we are in a context that no access checking is performed.
312 if (deferred_access_no_check)
315 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
317 ptr = VEC_last (deferred_access, deferred_access_stack);
319 /* If we are not supposed to defer access checks, just check now. */
320 if (ptr->deferring_access_checks_kind == dk_no_deferred)
322 enforce_access (binfo, decl, diag_decl);
326 /* See if we are already going to perform this check. */
328 VEC_iterate (deferred_access_check,
329 ptr->deferred_access_checks, i, chk) ;
332 if (chk->decl == decl && chk->binfo == binfo &&
333 chk->diag_decl == diag_decl)
338 /* If not, record the check. */
340 VEC_safe_push (deferred_access_check, gc,
341 ptr->deferred_access_checks, 0);
342 new_access->binfo = binfo;
343 new_access->decl = decl;
344 new_access->diag_decl = diag_decl;
347 /* Returns nonzero if the current statement is a full expression,
348 i.e. temporaries created during that statement should be destroyed
349 at the end of the statement. */
352 stmts_are_full_exprs_p (void)
354 return current_stmt_tree ()->stmts_are_full_exprs_p;
357 /* T is a statement. Add it to the statement-tree. This is the C++
358 version. The C/ObjC frontends have a slightly different version of
364 enum tree_code code = TREE_CODE (t);
366 if (EXPR_P (t) && code != LABEL_EXPR)
368 if (!EXPR_HAS_LOCATION (t))
369 SET_EXPR_LOCATION (t, input_location);
371 /* When we expand a statement-tree, we must know whether or not the
372 statements are full-expressions. We record that fact here. */
373 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
376 /* Add T to the statement-tree. Non-side-effect statements need to be
377 recorded during statement expressions. */
378 append_to_statement_list_force (t, &cur_stmt_list);
383 /* Returns the stmt_tree to which statements are currently being added. */
386 current_stmt_tree (void)
389 ? &cfun->language->base.x_stmt_tree
390 : &scope_chain->x_stmt_tree);
393 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
396 maybe_cleanup_point_expr (tree expr)
398 if (!processing_template_decl && stmts_are_full_exprs_p ())
399 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
403 /* Like maybe_cleanup_point_expr except have the type of the new expression be
404 void so we don't need to create a temporary variable to hold the inner
405 expression. The reason why we do this is because the original type might be
406 an aggregate and we cannot create a temporary variable for that type. */
409 maybe_cleanup_point_expr_void (tree expr)
411 if (!processing_template_decl && stmts_are_full_exprs_p ())
412 expr = fold_build_cleanup_point_expr (void_type_node, expr);
418 /* Create a declaration statement for the declaration given by the DECL. */
421 add_decl_expr (tree decl)
423 tree r = build_stmt (DECL_EXPR, decl);
424 if (DECL_INITIAL (decl)
425 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
426 r = maybe_cleanup_point_expr_void (r);
430 /* Finish a scope. */
433 do_poplevel (tree stmt_list)
437 if (stmts_are_full_exprs_p ())
438 block = poplevel (kept_level_p (), 1, 0);
440 stmt_list = pop_stmt_list (stmt_list);
442 if (!processing_template_decl)
444 stmt_list = c_build_bind_expr (block, stmt_list);
445 /* ??? See c_end_compound_stmt re statement expressions. */
451 /* Begin a new scope. */
454 do_pushlevel (scope_kind sk)
456 tree ret = push_stmt_list ();
457 if (stmts_are_full_exprs_p ())
458 begin_scope (sk, NULL);
462 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
463 when the current scope is exited. EH_ONLY is true when this is not
464 meant to apply to normal control flow transfer. */
467 push_cleanup (tree decl, tree cleanup, bool eh_only)
469 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
470 CLEANUP_EH_ONLY (stmt) = eh_only;
472 CLEANUP_BODY (stmt) = push_stmt_list ();
475 /* Begin a conditional that might contain a declaration. When generating
476 normal code, we want the declaration to appear before the statement
477 containing the conditional. When generating template code, we want the
478 conditional to be rendered as the raw DECL_EXPR. */
481 begin_cond (tree *cond_p)
483 if (processing_template_decl)
484 *cond_p = push_stmt_list ();
487 /* Finish such a conditional. */
490 finish_cond (tree *cond_p, tree expr)
492 if (processing_template_decl)
494 tree cond = pop_stmt_list (*cond_p);
495 if (TREE_CODE (cond) == DECL_EXPR)
498 if (check_for_bare_parameter_packs (expr))
499 *cond_p = error_mark_node;
504 /* If *COND_P specifies a conditional with a declaration, transform the
507 for (; A x = 42;) { }
509 while (true) { A x = 42; if (!x) break; }
510 for (;;) { A x = 42; if (!x) break; }
511 The statement list for BODY will be empty if the conditional did
512 not declare anything. */
515 simplify_loop_decl_cond (tree *cond_p, tree body)
519 if (!TREE_SIDE_EFFECTS (body))
523 *cond_p = boolean_true_node;
525 if_stmt = begin_if_stmt ();
526 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
527 finish_if_stmt_cond (cond, if_stmt);
528 finish_break_stmt ();
529 finish_then_clause (if_stmt);
530 finish_if_stmt (if_stmt);
533 /* Finish a goto-statement. */
536 finish_goto_stmt (tree destination)
538 if (TREE_CODE (destination) == IDENTIFIER_NODE)
539 destination = lookup_label (destination);
541 /* We warn about unused labels with -Wunused. That means we have to
542 mark the used labels as used. */
543 if (TREE_CODE (destination) == LABEL_DECL)
544 TREE_USED (destination) = 1;
547 /* The DESTINATION is being used as an rvalue. */
548 if (!processing_template_decl)
550 destination = decay_conversion (destination);
551 destination = cp_convert (ptr_type_node, destination);
552 if (error_operand_p (destination))
555 /* We don't inline calls to functions with computed gotos.
556 Those functions are typically up to some funny business,
557 and may be depending on the labels being at particular
558 addresses, or some such. */
559 DECL_UNINLINABLE (current_function_decl) = 1;
562 check_goto (destination);
564 return add_stmt (build_stmt (GOTO_EXPR, destination));
567 /* COND is the condition-expression for an if, while, etc.,
568 statement. Convert it to a boolean value, if appropriate.
569 In addition, verify sequence points if -Wsequence-point is enabled. */
572 maybe_convert_cond (tree cond)
574 /* Empty conditions remain empty. */
578 /* Wait until we instantiate templates before doing conversion. */
579 if (processing_template_decl)
582 if (warn_sequence_point)
583 verify_sequence_points (cond);
585 /* Do the conversion. */
586 cond = convert_from_reference (cond);
588 if (TREE_CODE (cond) == MODIFY_EXPR
589 && !TREE_NO_WARNING (cond)
592 warning (OPT_Wparentheses,
593 "suggest parentheses around assignment used as truth value");
594 TREE_NO_WARNING (cond) = 1;
597 return condition_conversion (cond);
600 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
603 finish_expr_stmt (tree expr)
607 if (expr != NULL_TREE)
609 if (!processing_template_decl)
611 if (warn_sequence_point)
612 verify_sequence_points (expr);
613 expr = convert_to_void (expr, "statement", tf_warning_or_error);
615 else if (!type_dependent_expression_p (expr))
616 convert_to_void (build_non_dependent_expr (expr), "statement",
617 tf_warning_or_error);
619 if (check_for_bare_parameter_packs (expr))
620 expr = error_mark_node;
622 /* Simplification of inner statement expressions, compound exprs,
623 etc can result in us already having an EXPR_STMT. */
624 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
626 if (TREE_CODE (expr) != EXPR_STMT)
627 expr = build_stmt (EXPR_STMT, expr);
628 expr = maybe_cleanup_point_expr_void (expr);
640 /* Begin an if-statement. Returns a newly created IF_STMT if
647 scope = do_pushlevel (sk_block);
648 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
649 TREE_CHAIN (r) = scope;
650 begin_cond (&IF_COND (r));
654 /* Process the COND of an if-statement, which may be given by
658 finish_if_stmt_cond (tree cond, tree if_stmt)
660 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
662 THEN_CLAUSE (if_stmt) = push_stmt_list ();
665 /* Finish the then-clause of an if-statement, which may be given by
669 finish_then_clause (tree if_stmt)
671 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
675 /* Begin the else-clause of an if-statement. */
678 begin_else_clause (tree if_stmt)
680 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
683 /* Finish the else-clause of an if-statement, which may be given by
687 finish_else_clause (tree if_stmt)
689 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
692 /* Finish an if-statement. */
695 finish_if_stmt (tree if_stmt)
697 tree scope = TREE_CHAIN (if_stmt);
698 TREE_CHAIN (if_stmt) = NULL;
699 add_stmt (do_poplevel (scope));
703 /* Begin a while-statement. Returns a newly created WHILE_STMT if
707 begin_while_stmt (void)
710 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
712 WHILE_BODY (r) = do_pushlevel (sk_block);
713 begin_cond (&WHILE_COND (r));
717 /* Process the COND of a while-statement, which may be given by
721 finish_while_stmt_cond (tree cond, tree while_stmt)
723 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
724 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
727 /* Finish a while-statement, which may be given by WHILE_STMT. */
730 finish_while_stmt (tree while_stmt)
732 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
736 /* Begin a do-statement. Returns a newly created DO_STMT if
742 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
744 DO_BODY (r) = push_stmt_list ();
748 /* Finish the body of a do-statement, which may be given by DO_STMT. */
751 finish_do_body (tree do_stmt)
753 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
755 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
756 body = STATEMENT_LIST_TAIL (body)->stmt;
758 if (IS_EMPTY_STMT (body))
759 warning (OPT_Wempty_body,
760 "suggest explicit braces around empty body in %<do%> statement");
763 /* Finish a do-statement, which may be given by DO_STMT, and whose
764 COND is as indicated. */
767 finish_do_stmt (tree cond, tree do_stmt)
769 cond = maybe_convert_cond (cond);
770 DO_COND (do_stmt) = cond;
774 /* Finish a return-statement. The EXPRESSION returned, if any, is as
778 finish_return_stmt (tree expr)
783 expr = check_return_expr (expr, &no_warning);
785 if (flag_openmp && !check_omp_return ())
786 return error_mark_node;
787 if (!processing_template_decl)
789 if (warn_sequence_point)
790 verify_sequence_points (expr);
792 if (DECL_DESTRUCTOR_P (current_function_decl)
793 || (DECL_CONSTRUCTOR_P (current_function_decl)
794 && targetm.cxx.cdtor_returns_this ()))
796 /* Similarly, all destructors must run destructors for
797 base-classes before returning. So, all returns in a
798 destructor get sent to the DTOR_LABEL; finish_function emits
799 code to return a value there. */
800 return finish_goto_stmt (cdtor_label);
804 r = build_stmt (RETURN_EXPR, expr);
805 TREE_NO_WARNING (r) |= no_warning;
806 r = maybe_cleanup_point_expr_void (r);
813 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
816 begin_for_stmt (void)
820 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
821 NULL_TREE, NULL_TREE);
823 if (flag_new_for_scope > 0)
824 TREE_CHAIN (r) = do_pushlevel (sk_for);
826 if (processing_template_decl)
827 FOR_INIT_STMT (r) = push_stmt_list ();
832 /* Finish the for-init-statement of a for-statement, which may be
833 given by FOR_STMT. */
836 finish_for_init_stmt (tree for_stmt)
838 if (processing_template_decl)
839 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
841 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
842 begin_cond (&FOR_COND (for_stmt));
845 /* Finish the COND of a for-statement, which may be given by
849 finish_for_cond (tree cond, tree for_stmt)
851 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
852 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
855 /* Finish the increment-EXPRESSION in a for-statement, which may be
856 given by FOR_STMT. */
859 finish_for_expr (tree expr, tree for_stmt)
863 /* If EXPR is an overloaded function, issue an error; there is no
864 context available to use to perform overload resolution. */
865 if (type_unknown_p (expr))
867 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
868 expr = error_mark_node;
870 if (!processing_template_decl)
872 if (warn_sequence_point)
873 verify_sequence_points (expr);
874 expr = convert_to_void (expr, "3rd expression in for",
875 tf_warning_or_error);
877 else if (!type_dependent_expression_p (expr))
878 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for",
879 tf_warning_or_error);
880 expr = maybe_cleanup_point_expr_void (expr);
881 if (check_for_bare_parameter_packs (expr))
882 expr = error_mark_node;
883 FOR_EXPR (for_stmt) = expr;
886 /* Finish the body of a for-statement, which may be given by
887 FOR_STMT. The increment-EXPR for the loop must be
891 finish_for_stmt (tree for_stmt)
893 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
895 /* Pop the scope for the body of the loop. */
896 if (flag_new_for_scope > 0)
898 tree scope = TREE_CHAIN (for_stmt);
899 TREE_CHAIN (for_stmt) = NULL;
900 add_stmt (do_poplevel (scope));
906 /* Finish a break-statement. */
909 finish_break_stmt (void)
911 return add_stmt (build_stmt (BREAK_STMT));
914 /* Finish a continue-statement. */
917 finish_continue_stmt (void)
919 return add_stmt (build_stmt (CONTINUE_STMT));
922 /* Begin a switch-statement. Returns a new SWITCH_STMT if
926 begin_switch_stmt (void)
930 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
932 scope = do_pushlevel (sk_block);
933 TREE_CHAIN (r) = scope;
934 begin_cond (&SWITCH_STMT_COND (r));
939 /* Finish the cond of a switch-statement. */
942 finish_switch_cond (tree cond, tree switch_stmt)
944 tree orig_type = NULL;
945 if (!processing_template_decl)
947 /* Convert the condition to an integer or enumeration type. */
948 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
949 if (cond == NULL_TREE)
951 error ("switch quantity not an integer");
952 cond = error_mark_node;
954 orig_type = TREE_TYPE (cond);
955 if (cond != error_mark_node)
959 Integral promotions are performed. */
960 cond = perform_integral_promotions (cond);
961 cond = maybe_cleanup_point_expr (cond);
964 if (check_for_bare_parameter_packs (cond))
965 cond = error_mark_node;
966 else if (!processing_template_decl && warn_sequence_point)
967 verify_sequence_points (cond);
969 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
970 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
971 add_stmt (switch_stmt);
972 push_switch (switch_stmt);
973 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
976 /* Finish the body of a switch-statement, which may be given by
977 SWITCH_STMT. The COND to switch on is indicated. */
980 finish_switch_stmt (tree switch_stmt)
984 SWITCH_STMT_BODY (switch_stmt) =
985 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
989 scope = TREE_CHAIN (switch_stmt);
990 TREE_CHAIN (switch_stmt) = NULL;
991 add_stmt (do_poplevel (scope));
994 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
998 begin_try_block (void)
1000 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
1002 TRY_STMTS (r) = push_stmt_list ();
1006 /* Likewise, for a function-try-block. The block returned in
1007 *COMPOUND_STMT is an artificial outer scope, containing the
1008 function-try-block. */
1011 begin_function_try_block (tree *compound_stmt)
1014 /* This outer scope does not exist in the C++ standard, but we need
1015 a place to put __FUNCTION__ and similar variables. */
1016 *compound_stmt = begin_compound_stmt (0);
1017 r = begin_try_block ();
1018 FN_TRY_BLOCK_P (r) = 1;
1022 /* Finish a try-block, which may be given by TRY_BLOCK. */
1025 finish_try_block (tree try_block)
1027 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1028 TRY_HANDLERS (try_block) = push_stmt_list ();
1031 /* Finish the body of a cleanup try-block, which may be given by
1035 finish_cleanup_try_block (tree try_block)
1037 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1040 /* Finish an implicitly generated try-block, with a cleanup is given
1044 finish_cleanup (tree cleanup, tree try_block)
1046 TRY_HANDLERS (try_block) = cleanup;
1047 CLEANUP_P (try_block) = 1;
1050 /* Likewise, for a function-try-block. */
1053 finish_function_try_block (tree try_block)
1055 finish_try_block (try_block);
1056 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1057 the try block, but moving it inside. */
1058 in_function_try_handler = 1;
1061 /* Finish a handler-sequence for a try-block, which may be given by
1065 finish_handler_sequence (tree try_block)
1067 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1068 check_handlers (TRY_HANDLERS (try_block));
1071 /* Finish the handler-seq for a function-try-block, given by
1072 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1073 begin_function_try_block. */
1076 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1078 in_function_try_handler = 0;
1079 finish_handler_sequence (try_block);
1080 finish_compound_stmt (compound_stmt);
1083 /* Begin a handler. Returns a HANDLER if appropriate. */
1086 begin_handler (void)
1090 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1093 /* Create a binding level for the eh_info and the exception object
1095 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1100 /* Finish the handler-parameters for a handler, which may be given by
1101 HANDLER. DECL is the declaration for the catch parameter, or NULL
1102 if this is a `catch (...)' clause. */
1105 finish_handler_parms (tree decl, tree handler)
1107 tree type = NULL_TREE;
1108 if (processing_template_decl)
1112 decl = pushdecl (decl);
1113 decl = push_template_decl (decl);
1114 HANDLER_PARMS (handler) = decl;
1115 type = TREE_TYPE (decl);
1119 type = expand_start_catch_block (decl);
1120 HANDLER_TYPE (handler) = type;
1121 if (!processing_template_decl && type)
1122 mark_used (eh_type_info (type));
1125 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1126 the return value from the matching call to finish_handler_parms. */
1129 finish_handler (tree handler)
1131 if (!processing_template_decl)
1132 expand_end_catch_block ();
1133 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1136 /* Begin a compound statement. FLAGS contains some bits that control the
1137 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1138 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1139 block of a function. If BCS_TRY_BLOCK is set, this is the block
1140 created on behalf of a TRY statement. Returns a token to be passed to
1141 finish_compound_stmt. */
1144 begin_compound_stmt (unsigned int flags)
1148 if (flags & BCS_NO_SCOPE)
1150 r = push_stmt_list ();
1151 STATEMENT_LIST_NO_SCOPE (r) = 1;
1153 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1154 But, if it's a statement-expression with a scopeless block, there's
1155 nothing to keep, and we don't want to accidentally keep a block
1156 *inside* the scopeless block. */
1157 keep_next_level (false);
1160 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1162 /* When processing a template, we need to remember where the braces were,
1163 so that we can set up identical scopes when instantiating the template
1164 later. BIND_EXPR is a handy candidate for this.
1165 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1166 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1167 processing templates. */
1168 if (processing_template_decl)
1170 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1171 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1172 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1173 TREE_SIDE_EFFECTS (r) = 1;
1179 /* Finish a compound-statement, which is given by STMT. */
1182 finish_compound_stmt (tree stmt)
1184 if (TREE_CODE (stmt) == BIND_EXPR)
1185 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1186 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1187 stmt = pop_stmt_list (stmt);
1190 /* Destroy any ObjC "super" receivers that may have been
1192 objc_clear_super_receiver ();
1194 stmt = do_poplevel (stmt);
1197 /* ??? See c_end_compound_stmt wrt statement expressions. */
1202 /* Finish an asm-statement, whose components are a STRING, some
1203 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1204 whether the asm-statement should be considered volatile. */
1207 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1208 tree input_operands, tree clobbers)
1212 int ninputs = list_length (input_operands);
1213 int noutputs = list_length (output_operands);
1215 if (!processing_template_decl)
1217 const char *constraint;
1218 const char **oconstraints;
1219 bool allows_mem, allows_reg, is_inout;
1223 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1225 string = resolve_asm_operand_names (string, output_operands,
1228 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1230 operand = TREE_VALUE (t);
1232 /* ??? Really, this should not be here. Users should be using a
1233 proper lvalue, dammit. But there's a long history of using
1234 casts in the output operands. In cases like longlong.h, this
1235 becomes a primitive form of typechecking -- if the cast can be
1236 removed, then the output operand had a type of the proper width;
1237 otherwise we'll get an error. Gross, but ... */
1238 STRIP_NOPS (operand);
1240 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1241 operand = error_mark_node;
1243 if (operand != error_mark_node
1244 && (TREE_READONLY (operand)
1245 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1246 /* Functions are not modifiable, even though they are
1248 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1249 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1250 /* If it's an aggregate and any field is const, then it is
1251 effectively const. */
1252 || (CLASS_TYPE_P (TREE_TYPE (operand))
1253 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1254 readonly_error (operand, "assignment (via 'asm' output)");
1256 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1257 oconstraints[i] = constraint;
1259 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1260 &allows_mem, &allows_reg, &is_inout))
1262 /* If the operand is going to end up in memory,
1263 mark it addressable. */
1264 if (!allows_reg && !cxx_mark_addressable (operand))
1265 operand = error_mark_node;
1268 operand = error_mark_node;
1270 TREE_VALUE (t) = operand;
1273 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1275 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1276 operand = decay_conversion (TREE_VALUE (t));
1278 /* If the type of the operand hasn't been determined (e.g.,
1279 because it involves an overloaded function), then issue
1280 an error message. There's no context available to
1281 resolve the overloading. */
1282 if (TREE_TYPE (operand) == unknown_type_node)
1284 error ("type of asm operand %qE could not be determined",
1286 operand = error_mark_node;
1289 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1290 oconstraints, &allows_mem, &allows_reg))
1292 /* If the operand is going to end up in memory,
1293 mark it addressable. */
1294 if (!allows_reg && allows_mem)
1296 /* Strip the nops as we allow this case. FIXME, this really
1297 should be rejected or made deprecated. */
1298 STRIP_NOPS (operand);
1299 if (!cxx_mark_addressable (operand))
1300 operand = error_mark_node;
1304 operand = error_mark_node;
1306 TREE_VALUE (t) = operand;
1310 r = build_stmt (ASM_EXPR, string,
1311 output_operands, input_operands,
1313 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1314 r = maybe_cleanup_point_expr_void (r);
1315 return add_stmt (r);
1318 /* Finish a label with the indicated NAME. */
1321 finish_label_stmt (tree name)
1323 tree decl = define_label (input_location, name);
1325 if (decl == error_mark_node)
1326 return error_mark_node;
1328 return add_stmt (build_stmt (LABEL_EXPR, decl));
1331 /* Finish a series of declarations for local labels. G++ allows users
1332 to declare "local" labels, i.e., labels with scope. This extension
1333 is useful when writing code involving statement-expressions. */
1336 finish_label_decl (tree name)
1338 if (!at_function_scope_p ())
1340 error ("__label__ declarations are only allowed in function scopes");
1344 add_decl_expr (declare_local_label (name));
1347 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1350 finish_decl_cleanup (tree decl, tree cleanup)
1352 push_cleanup (decl, cleanup, false);
1355 /* If the current scope exits with an exception, run CLEANUP. */
1358 finish_eh_cleanup (tree cleanup)
1360 push_cleanup (NULL, cleanup, true);
1363 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1364 order they were written by the user. Each node is as for
1365 emit_mem_initializers. */
1368 finish_mem_initializers (tree mem_inits)
1370 /* Reorder the MEM_INITS so that they are in the order they appeared
1371 in the source program. */
1372 mem_inits = nreverse (mem_inits);
1374 if (processing_template_decl)
1378 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1380 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1381 check for bare parameter packs in the TREE_VALUE, because
1382 any parameter packs in the TREE_VALUE have already been
1383 bound as part of the TREE_PURPOSE. See
1384 make_pack_expansion for more information. */
1385 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1386 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1387 TREE_VALUE (mem) = error_mark_node;
1390 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1393 emit_mem_initializers (mem_inits);
1396 /* Finish a parenthesized expression EXPR. */
1399 finish_parenthesized_expr (tree expr)
1402 /* This inhibits warnings in c_common_truthvalue_conversion. */
1403 TREE_NO_WARNING (expr) = 1;
1405 if (TREE_CODE (expr) == OFFSET_REF)
1406 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1407 enclosed in parentheses. */
1408 PTRMEM_OK_P (expr) = 0;
1410 if (TREE_CODE (expr) == STRING_CST)
1411 PAREN_STRING_LITERAL_P (expr) = 1;
1416 /* Finish a reference to a non-static data member (DECL) that is not
1417 preceded by `.' or `->'. */
1420 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1422 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1424 if (!object && skip_evaluation)
1426 /* DR 613: Can use non-static data members without an associated
1427 object in sizeof/decltype/alignof. */
1428 tree scope = qualifying_scope;
1429 if (scope == NULL_TREE)
1430 scope = context_for_name_lookup (decl);
1431 object = maybe_dummy_object (scope, NULL);
1436 if (current_function_decl
1437 && DECL_STATIC_FUNCTION_P (current_function_decl))
1438 error ("invalid use of member %q+D in static member function", decl);
1440 error ("invalid use of non-static data member %q+D", decl);
1441 error ("from this location");
1443 return error_mark_node;
1445 if (current_class_ptr)
1446 TREE_USED (current_class_ptr) = 1;
1447 if (processing_template_decl && !qualifying_scope)
1449 tree type = TREE_TYPE (decl);
1451 if (TREE_CODE (type) == REFERENCE_TYPE)
1452 type = TREE_TYPE (type);
1455 /* Set the cv qualifiers. */
1456 int quals = (current_class_ref
1457 ? cp_type_quals (TREE_TYPE (current_class_ref))
1458 : TYPE_UNQUALIFIED);
1460 if (DECL_MUTABLE_P (decl))
1461 quals &= ~TYPE_QUAL_CONST;
1463 quals |= cp_type_quals (TREE_TYPE (decl));
1464 type = cp_build_qualified_type (type, quals);
1467 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1471 tree access_type = TREE_TYPE (object);
1472 tree lookup_context = context_for_name_lookup (decl);
1474 while (!DERIVED_FROM_P (lookup_context, access_type))
1476 access_type = TYPE_CONTEXT (access_type);
1477 while (access_type && DECL_P (access_type))
1478 access_type = DECL_CONTEXT (access_type);
1482 error ("object missing in reference to %q+D", decl);
1483 error ("from this location");
1484 return error_mark_node;
1488 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1489 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1491 if (processing_template_decl)
1492 return build_qualified_name (TREE_TYPE (decl),
1495 /*template_p=*/false);
1497 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1500 /* If the data member was named `C::M', convert `*this' to `C'
1502 if (qualifying_scope)
1504 tree binfo = NULL_TREE;
1505 object = build_scoped_ref (object, qualifying_scope,
1509 return build_class_member_access_expr (object, decl,
1510 /*access_path=*/NULL_TREE,
1511 /*preserve_reference=*/false,
1512 tf_warning_or_error);
1516 /* DECL was the declaration to which a qualified-id resolved. Issue
1517 an error message if it is not accessible. If OBJECT_TYPE is
1518 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1519 type of `*x', or `x', respectively. If the DECL was named as
1520 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1523 check_accessibility_of_qualified_id (tree decl,
1525 tree nested_name_specifier)
1528 tree qualifying_type = NULL_TREE;
1530 /* If we are parsing a template declaration and if decl is a typedef,
1531 add it to a list tied to the template.
1532 At template instantiation time, that list will be walked and
1533 access check performed. */
1534 if (is_typedef_decl (decl))
1536 /* This the scope through which type_decl is accessed.
1537 It will be useful information later to do access check for
1539 tree scope = nested_name_specifier
1540 ? nested_name_specifier
1541 : DECL_CONTEXT (decl);
1542 tree templ_info = NULL;
1543 tree cs = current_scope ();
1545 if (cs && (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL))
1546 templ_info = get_template_info (cs);
1549 && TI_TEMPLATE (templ_info)
1551 && CLASS_TYPE_P (scope)
1552 && !currently_open_class (scope))
1553 append_type_to_template_for_access_check (current_scope (), decl, scope);
1556 /* If we're not checking, return immediately. */
1557 if (deferred_access_no_check)
1560 /* Determine the SCOPE of DECL. */
1561 scope = context_for_name_lookup (decl);
1562 /* If the SCOPE is not a type, then DECL is not a member. */
1563 if (!TYPE_P (scope))
1565 /* Compute the scope through which DECL is being accessed. */
1567 /* OBJECT_TYPE might not be a class type; consider:
1569 class A { typedef int I; };
1573 In this case, we will have "A::I" as the DECL, but "I" as the
1575 && CLASS_TYPE_P (object_type)
1576 && DERIVED_FROM_P (scope, object_type))
1577 /* If we are processing a `->' or `.' expression, use the type of the
1579 qualifying_type = object_type;
1580 else if (nested_name_specifier)
1582 /* If the reference is to a non-static member of the
1583 current class, treat it as if it were referenced through
1585 if (DECL_NONSTATIC_MEMBER_P (decl)
1586 && current_class_ptr
1587 && DERIVED_FROM_P (scope, current_class_type))
1588 qualifying_type = current_class_type;
1589 /* Otherwise, use the type indicated by the
1590 nested-name-specifier. */
1592 qualifying_type = nested_name_specifier;
1595 /* Otherwise, the name must be from the current class or one of
1597 qualifying_type = currently_open_derived_class (scope);
1600 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1601 or similar in a default argument value. */
1602 && CLASS_TYPE_P (qualifying_type)
1603 && !dependent_type_p (qualifying_type))
1604 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1608 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1609 class named to the left of the "::" operator. DONE is true if this
1610 expression is a complete postfix-expression; it is false if this
1611 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1612 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1613 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1614 is true iff this qualified name appears as a template argument. */
1617 finish_qualified_id_expr (tree qualifying_class,
1622 bool template_arg_p)
1624 gcc_assert (TYPE_P (qualifying_class));
1626 if (error_operand_p (expr))
1627 return error_mark_node;
1629 if (DECL_P (expr) || BASELINK_P (expr))
1633 check_template_keyword (expr);
1635 /* If EXPR occurs as the operand of '&', use special handling that
1636 permits a pointer-to-member. */
1637 if (address_p && done)
1639 if (TREE_CODE (expr) == SCOPE_REF)
1640 expr = TREE_OPERAND (expr, 1);
1641 expr = build_offset_ref (qualifying_class, expr,
1642 /*address_p=*/true);
1646 /* Within the scope of a class, turn references to non-static
1647 members into expression of the form "this->...". */
1649 /* But, within a template argument, we do not want make the
1650 transformation, as there is no "this" pointer. */
1652 else if (TREE_CODE (expr) == FIELD_DECL)
1654 push_deferring_access_checks (dk_no_check);
1655 expr = finish_non_static_data_member (expr, current_class_ref,
1657 pop_deferring_access_checks ();
1659 else if (BASELINK_P (expr) && !processing_template_decl)
1663 /* See if any of the functions are non-static members. */
1664 fns = BASELINK_FUNCTIONS (expr);
1665 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1666 fns = TREE_OPERAND (fns, 0);
1667 /* If so, the expression may be relative to 'this'. */
1668 if (!shared_member_p (fns)
1669 && current_class_ref
1670 && DERIVED_FROM_P (qualifying_class, TREE_TYPE (current_class_ref)))
1671 expr = (build_class_member_access_expr
1672 (maybe_dummy_object (qualifying_class, NULL),
1674 BASELINK_ACCESS_BINFO (expr),
1675 /*preserve_reference=*/false,
1676 tf_warning_or_error));
1678 /* The expression is a qualified name whose address is not
1680 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1686 /* Begin a statement-expression. The value returned must be passed to
1687 finish_stmt_expr. */
1690 begin_stmt_expr (void)
1692 return push_stmt_list ();
1695 /* Process the final expression of a statement expression. EXPR can be
1696 NULL, if the final expression is empty. Return a STATEMENT_LIST
1697 containing all the statements in the statement-expression, or
1698 ERROR_MARK_NODE if there was an error. */
1701 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1703 if (error_operand_p (expr))
1705 /* The type of the statement-expression is the type of the last
1707 TREE_TYPE (stmt_expr) = error_mark_node;
1708 return error_mark_node;
1711 /* If the last statement does not have "void" type, then the value
1712 of the last statement is the value of the entire expression. */
1715 tree type = TREE_TYPE (expr);
1717 if (processing_template_decl)
1719 expr = build_stmt (EXPR_STMT, expr);
1720 expr = add_stmt (expr);
1721 /* Mark the last statement so that we can recognize it as such at
1722 template-instantiation time. */
1723 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1725 else if (VOID_TYPE_P (type))
1727 /* Just treat this like an ordinary statement. */
1728 expr = finish_expr_stmt (expr);
1732 /* It actually has a value we need to deal with. First, force it
1733 to be an rvalue so that we won't need to build up a copy
1734 constructor call later when we try to assign it to something. */
1735 expr = force_rvalue (expr);
1736 if (error_operand_p (expr))
1737 return error_mark_node;
1739 /* Update for array-to-pointer decay. */
1740 type = TREE_TYPE (expr);
1742 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1743 normal statement, but don't convert to void or actually add
1745 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1746 expr = maybe_cleanup_point_expr (expr);
1750 /* The type of the statement-expression is the type of the last
1752 TREE_TYPE (stmt_expr) = type;
1758 /* Finish a statement-expression. EXPR should be the value returned
1759 by the previous begin_stmt_expr. Returns an expression
1760 representing the statement-expression. */
1763 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1768 if (error_operand_p (stmt_expr))
1770 pop_stmt_list (stmt_expr);
1771 return error_mark_node;
1774 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1776 type = TREE_TYPE (stmt_expr);
1777 result = pop_stmt_list (stmt_expr);
1778 TREE_TYPE (result) = type;
1780 if (processing_template_decl)
1782 result = build_min (STMT_EXPR, type, result);
1783 TREE_SIDE_EFFECTS (result) = 1;
1784 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1786 else if (CLASS_TYPE_P (type))
1788 /* Wrap the statement-expression in a TARGET_EXPR so that the
1789 temporary object created by the final expression is destroyed at
1790 the end of the full-expression containing the
1791 statement-expression. */
1792 result = force_target_expr (type, result);
1798 /* Returns the expression which provides the value of STMT_EXPR. */
1801 stmt_expr_value_expr (tree stmt_expr)
1803 tree t = STMT_EXPR_STMT (stmt_expr);
1805 if (TREE_CODE (t) == BIND_EXPR)
1806 t = BIND_EXPR_BODY (t);
1808 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1809 t = STATEMENT_LIST_TAIL (t)->stmt;
1811 if (TREE_CODE (t) == EXPR_STMT)
1812 t = EXPR_STMT_EXPR (t);
1817 /* Perform Koenig lookup. FN is the postfix-expression representing
1818 the function (or functions) to call; ARGS are the arguments to the
1819 call. Returns the functions to be considered by overload
1823 perform_koenig_lookup (tree fn, tree args)
1825 tree identifier = NULL_TREE;
1826 tree functions = NULL_TREE;
1827 tree tmpl_args = NULL_TREE;
1829 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1831 tmpl_args = TREE_OPERAND (fn, 1);
1832 fn = TREE_OPERAND (fn, 0);
1835 /* Find the name of the overloaded function. */
1836 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1838 else if (is_overloaded_fn (fn))
1841 identifier = DECL_NAME (get_first_fn (functions));
1843 else if (DECL_P (fn))
1846 identifier = DECL_NAME (fn);
1849 /* A call to a namespace-scope function using an unqualified name.
1851 Do Koenig lookup -- unless any of the arguments are
1853 if (!any_type_dependent_arguments_p (args)
1854 && !any_dependent_template_arguments_p (tmpl_args))
1856 fn = lookup_arg_dependent (identifier, functions, args);
1858 /* The unqualified name could not be resolved. */
1859 fn = unqualified_fn_lookup_error (identifier);
1862 if (fn && tmpl_args)
1863 fn = build_nt (TEMPLATE_ID_EXPR, fn, tmpl_args);
1868 /* Generate an expression for `FN (ARGS)'.
1870 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1871 as a virtual call, even if FN is virtual. (This flag is set when
1872 encountering an expression where the function name is explicitly
1873 qualified. For example a call to `X::f' never generates a virtual
1876 Returns code for the call. */
1879 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p,
1880 tsubst_flags_t complain)
1886 if (fn == error_mark_node || args == error_mark_node)
1887 return error_mark_node;
1889 /* ARGS should be a list of arguments. */
1890 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1891 gcc_assert (!TYPE_P (fn));
1896 if (processing_template_decl)
1898 if (type_dependent_expression_p (fn)
1899 || any_type_dependent_arguments_p (args))
1901 result = build_nt_call_list (fn, args);
1902 KOENIG_LOOKUP_P (result) = koenig_p;
1907 tree fndecl = OVL_CURRENT (fn);
1908 if (TREE_CODE (fndecl) != FUNCTION_DECL
1909 || !TREE_THIS_VOLATILE (fndecl))
1915 current_function_returns_abnormally = 1;
1919 if (!BASELINK_P (fn)
1920 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1921 && TREE_TYPE (fn) != unknown_type_node)
1922 fn = build_non_dependent_expr (fn);
1923 args = build_non_dependent_args (orig_args);
1926 if (is_overloaded_fn (fn))
1927 fn = baselink_for_fns (fn);
1930 if (BASELINK_P (fn))
1934 /* A call to a member function. From [over.call.func]:
1936 If the keyword this is in scope and refers to the class of
1937 that member function, or a derived class thereof, then the
1938 function call is transformed into a qualified function call
1939 using (*this) as the postfix-expression to the left of the
1940 . operator.... [Otherwise] a contrived object of type T
1941 becomes the implied object argument.
1943 This paragraph is unclear about this situation:
1945 struct A { void f(); };
1946 struct B : public A {};
1947 struct C : public A { void g() { B::f(); }};
1949 In particular, for `B::f', this paragraph does not make clear
1950 whether "the class of that member function" refers to `A' or
1951 to `B'. We believe it refers to `B'. */
1952 if (current_class_type
1953 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1955 && current_class_ref)
1956 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1960 tree representative_fn;
1962 representative_fn = BASELINK_FUNCTIONS (fn);
1963 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1964 representative_fn = TREE_OPERAND (representative_fn, 0);
1965 representative_fn = get_first_fn (representative_fn);
1966 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1969 if (processing_template_decl)
1971 if (type_dependent_expression_p (object))
1972 return build_nt_call_list (orig_fn, orig_args);
1973 object = build_non_dependent_expr (object);
1976 result = build_new_method_call (object, fn, args, NULL_TREE,
1978 ? LOOKUP_NONVIRTUAL : 0),
1982 else if (is_overloaded_fn (fn))
1984 /* If the function is an overloaded builtin, resolve it. */
1985 if (TREE_CODE (fn) == FUNCTION_DECL
1986 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1987 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1989 VEC(tree,gc)* vec = VEC_alloc (tree, gc, list_length (args));
1992 for (p = args; p != NULL_TREE; p = TREE_CHAIN (p))
1993 VEC_quick_push (tree, vec, TREE_VALUE (p));
1994 result = resolve_overloaded_builtin (fn, vec);
1995 VEC_free (tree, gc, vec);
1999 /* A call to a namespace-scope function. */
2000 result = build_new_function_call (fn, args, koenig_p, complain);
2002 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2005 error ("arguments to destructor are not allowed");
2006 /* Mark the pseudo-destructor call as having side-effects so
2007 that we do not issue warnings about its use. */
2008 result = build1 (NOP_EXPR,
2010 TREE_OPERAND (fn, 0));
2011 TREE_SIDE_EFFECTS (result) = 1;
2013 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2014 /* If the "function" is really an object of class type, it might
2015 have an overloaded `operator ()'. */
2016 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
2017 /*overloaded_p=*/NULL, complain);
2020 /* A call where the function is unknown. */
2021 result = cp_build_function_call (fn, args, complain);
2023 if (processing_template_decl)
2025 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
2026 KOENIG_LOOKUP_P (result) = koenig_p;
2031 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2032 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2033 POSTDECREMENT_EXPR.) */
2036 finish_increment_expr (tree expr, enum tree_code code)
2038 return build_x_unary_op (code, expr, tf_warning_or_error);
2041 /* Finish a use of `this'. Returns an expression for `this'. */
2044 finish_this_expr (void)
2048 if (current_class_ptr)
2050 result = current_class_ptr;
2052 else if (current_function_decl
2053 && DECL_STATIC_FUNCTION_P (current_function_decl))
2055 error ("%<this%> is unavailable for static member functions");
2056 result = error_mark_node;
2060 if (current_function_decl)
2061 error ("invalid use of %<this%> in non-member function");
2063 error ("invalid use of %<this%> at top level");
2064 result = error_mark_node;
2070 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2071 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2072 the TYPE for the type given. If SCOPE is non-NULL, the expression
2073 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2076 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2078 if (object == error_mark_node || destructor == error_mark_node)
2079 return error_mark_node;
2081 gcc_assert (TYPE_P (destructor));
2083 if (!processing_template_decl)
2085 if (scope == error_mark_node)
2087 error ("invalid qualifying scope in pseudo-destructor name");
2088 return error_mark_node;
2090 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2092 error ("qualified type %qT does not match destructor name ~%qT",
2094 return error_mark_node;
2098 /* [expr.pseudo] says both:
2100 The type designated by the pseudo-destructor-name shall be
2101 the same as the object type.
2105 The cv-unqualified versions of the object type and of the
2106 type designated by the pseudo-destructor-name shall be the
2109 We implement the more generous second sentence, since that is
2110 what most other compilers do. */
2111 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2114 error ("%qE is not of type %qT", object, destructor);
2115 return error_mark_node;
2119 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2122 /* Finish an expression of the form CODE EXPR. */
2125 finish_unary_op_expr (enum tree_code code, tree expr)
2127 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2128 /* Inside a template, build_x_unary_op does not fold the
2129 expression. So check whether the result is folded before
2130 setting TREE_NEGATED_INT. */
2131 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2132 && TREE_CODE (result) == INTEGER_CST
2133 && !TYPE_UNSIGNED (TREE_TYPE (result))
2134 && INT_CST_LT (result, integer_zero_node))
2136 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2137 setting TREE_NEGATED_INT. */
2138 result = copy_node (result);
2139 TREE_NEGATED_INT (result) = 1;
2141 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2142 overflow_warning (result);
2147 /* Finish a compound-literal expression. TYPE is the type to which
2148 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2151 finish_compound_literal (tree type, tree compound_literal)
2153 if (type == error_mark_node)
2154 return error_mark_node;
2156 if (!TYPE_OBJ_P (type))
2158 error ("compound literal of non-object type %qT", type);
2159 return error_mark_node;
2162 if (processing_template_decl)
2164 TREE_TYPE (compound_literal) = type;
2165 /* Mark the expression as a compound literal. */
2166 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2167 return compound_literal;
2170 type = complete_type (type);
2172 if (TYPE_NON_AGGREGATE_CLASS (type))
2174 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2175 everywhere that deals with function arguments would be a pain, so
2176 just wrap it in a TREE_LIST. The parser set a flag so we know
2177 that it came from T{} rather than T({}). */
2178 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2179 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2180 return build_functional_cast (type, compound_literal, tf_error);
2183 if (TREE_CODE (type) == ARRAY_TYPE
2184 && check_array_initializer (NULL_TREE, type, compound_literal))
2185 return error_mark_node;
2186 compound_literal = reshape_init (type, compound_literal);
2187 if (TREE_CODE (type) == ARRAY_TYPE)
2188 cp_complete_array_type (&type, compound_literal, false);
2189 compound_literal = digest_init (type, compound_literal);
2190 if ((!at_function_scope_p () || cp_type_readonly (type))
2191 && initializer_constant_valid_p (compound_literal, type))
2193 tree decl = create_temporary_var (type);
2194 DECL_INITIAL (decl) = compound_literal;
2195 TREE_STATIC (decl) = 1;
2196 decl = pushdecl_top_level (decl);
2197 DECL_NAME (decl) = make_anon_name ();
2198 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2202 return get_target_expr (compound_literal);
2205 /* Return the declaration for the function-name variable indicated by
2209 finish_fname (tree id)
2213 decl = fname_decl (input_location, C_RID_CODE (id), id);
2214 if (processing_template_decl)
2215 decl = DECL_NAME (decl);
2219 /* Finish a translation unit. */
2222 finish_translation_unit (void)
2224 /* In case there were missing closebraces,
2225 get us back to the global binding level. */
2227 while (current_namespace != global_namespace)
2230 /* Do file scope __FUNCTION__ et al. */
2231 finish_fname_decls ();
2234 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2235 Returns the parameter. */
2238 finish_template_type_parm (tree aggr, tree identifier)
2240 if (aggr != class_type_node)
2242 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2243 aggr = class_type_node;
2246 return build_tree_list (aggr, identifier);
2249 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2250 Returns the parameter. */
2253 finish_template_template_parm (tree aggr, tree identifier)
2255 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2256 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2257 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2258 DECL_TEMPLATE_RESULT (tmpl) = decl;
2259 DECL_ARTIFICIAL (decl) = 1;
2260 end_template_decl ();
2262 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2264 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2265 /*is_primary=*/true, /*is_partial=*/false,
2268 return finish_template_type_parm (aggr, tmpl);
2271 /* ARGUMENT is the default-argument value for a template template
2272 parameter. If ARGUMENT is invalid, issue error messages and return
2273 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2276 check_template_template_default_arg (tree argument)
2278 if (TREE_CODE (argument) != TEMPLATE_DECL
2279 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2280 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2282 if (TREE_CODE (argument) == TYPE_DECL)
2283 error ("invalid use of type %qT as a default value for a template "
2284 "template-parameter", TREE_TYPE (argument));
2286 error ("invalid default argument for a template template parameter");
2287 return error_mark_node;
2293 /* Begin a class definition, as indicated by T. */
2296 begin_class_definition (tree t, tree attributes)
2298 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2299 return error_mark_node;
2301 if (processing_template_parmlist)
2303 error ("definition of %q#T inside template parameter list", t);
2304 return error_mark_node;
2306 /* A non-implicit typename comes from code like:
2308 template <typename T> struct A {
2309 template <typename U> struct A<T>::B ...
2311 This is erroneous. */
2312 else if (TREE_CODE (t) == TYPENAME_TYPE)
2314 error ("invalid definition of qualified type %qT", t);
2315 t = error_mark_node;
2318 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2320 t = make_class_type (RECORD_TYPE);
2321 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2324 /* Update the location of the decl. */
2325 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2327 if (TYPE_BEING_DEFINED (t))
2329 t = make_class_type (TREE_CODE (t));
2330 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2332 maybe_process_partial_specialization (t);
2334 TYPE_BEING_DEFINED (t) = 1;
2336 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2338 if (flag_pack_struct)
2341 TYPE_PACKED (t) = 1;
2342 /* Even though the type is being defined for the first time
2343 here, there might have been a forward declaration, so there
2344 might be cv-qualified variants of T. */
2345 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2346 TYPE_PACKED (v) = 1;
2348 /* Reset the interface data, at the earliest possible
2349 moment, as it might have been set via a class foo;
2351 if (! TYPE_ANONYMOUS_P (t))
2353 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2354 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2355 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2356 (t, finfo->interface_unknown);
2358 reset_specialization();
2360 /* Make a declaration for this class in its own scope. */
2361 build_self_reference ();
2366 /* Finish the member declaration given by DECL. */
2369 finish_member_declaration (tree decl)
2371 if (decl == error_mark_node || decl == NULL_TREE)
2374 if (decl == void_type_node)
2375 /* The COMPONENT was a friend, not a member, and so there's
2376 nothing for us to do. */
2379 /* We should see only one DECL at a time. */
2380 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2382 /* Set up access control for DECL. */
2384 = (current_access_specifier == access_private_node);
2385 TREE_PROTECTED (decl)
2386 = (current_access_specifier == access_protected_node);
2387 if (TREE_CODE (decl) == TEMPLATE_DECL)
2389 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2390 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2393 /* Mark the DECL as a member of the current class. */
2394 DECL_CONTEXT (decl) = current_class_type;
2396 /* Check for bare parameter packs in the member variable declaration. */
2397 if (TREE_CODE (decl) == FIELD_DECL)
2399 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2400 TREE_TYPE (decl) = error_mark_node;
2401 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2402 DECL_ATTRIBUTES (decl) = NULL_TREE;
2407 A C language linkage is ignored for the names of class members
2408 and the member function type of class member functions. */
2409 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2410 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2412 /* Put functions on the TYPE_METHODS list and everything else on the
2413 TYPE_FIELDS list. Note that these are built up in reverse order.
2414 We reverse them (to obtain declaration order) in finish_struct. */
2415 if (TREE_CODE (decl) == FUNCTION_DECL
2416 || DECL_FUNCTION_TEMPLATE_P (decl))
2418 /* We also need to add this function to the
2419 CLASSTYPE_METHOD_VEC. */
2420 if (add_method (current_class_type, decl, NULL_TREE))
2422 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2423 TYPE_METHODS (current_class_type) = decl;
2425 maybe_add_class_template_decl_list (current_class_type, decl,
2429 /* Enter the DECL into the scope of the class. */
2430 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2431 || pushdecl_class_level (decl))
2433 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2434 go at the beginning. The reason is that lookup_field_1
2435 searches the list in order, and we want a field name to
2436 override a type name so that the "struct stat hack" will
2437 work. In particular:
2439 struct S { enum E { }; int E } s;
2442 is valid. In addition, the FIELD_DECLs must be maintained in
2443 declaration order so that class layout works as expected.
2444 However, we don't need that order until class layout, so we
2445 save a little time by putting FIELD_DECLs on in reverse order
2446 here, and then reversing them in finish_struct_1. (We could
2447 also keep a pointer to the correct insertion points in the
2450 if (TREE_CODE (decl) == TYPE_DECL)
2451 TYPE_FIELDS (current_class_type)
2452 = chainon (TYPE_FIELDS (current_class_type), decl);
2455 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2456 TYPE_FIELDS (current_class_type) = decl;
2459 maybe_add_class_template_decl_list (current_class_type, decl,
2464 note_decl_for_pch (decl);
2467 /* DECL has been declared while we are building a PCH file. Perform
2468 actions that we might normally undertake lazily, but which can be
2469 performed now so that they do not have to be performed in
2470 translation units which include the PCH file. */
2473 note_decl_for_pch (tree decl)
2475 gcc_assert (pch_file);
2477 /* There's a good chance that we'll have to mangle names at some
2478 point, even if only for emission in debugging information. */
2479 if ((TREE_CODE (decl) == VAR_DECL
2480 || TREE_CODE (decl) == FUNCTION_DECL)
2481 && !processing_template_decl)
2485 /* Finish processing a complete template declaration. The PARMS are
2486 the template parameters. */
2489 finish_template_decl (tree parms)
2492 end_template_decl ();
2494 end_specialization ();
2497 /* Finish processing a template-id (which names a type) of the form
2498 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2499 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2500 the scope of template-id indicated. */
2503 finish_template_type (tree name, tree args, int entering_scope)
2507 decl = lookup_template_class (name, args,
2508 NULL_TREE, NULL_TREE, entering_scope,
2509 tf_warning_or_error | tf_user);
2510 if (decl != error_mark_node)
2511 decl = TYPE_STUB_DECL (decl);
2516 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2517 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2518 BASE_CLASS, or NULL_TREE if an error occurred. The
2519 ACCESS_SPECIFIER is one of
2520 access_{default,public,protected_private}_node. For a virtual base
2521 we set TREE_TYPE. */
2524 finish_base_specifier (tree base, tree access, bool virtual_p)
2528 if (base == error_mark_node)
2530 error ("invalid base-class specification");
2533 else if (! MAYBE_CLASS_TYPE_P (base))
2535 error ("%qT is not a class type", base);
2540 if (cp_type_quals (base) != 0)
2542 error ("base class %qT has cv qualifiers", base);
2543 base = TYPE_MAIN_VARIANT (base);
2545 result = build_tree_list (access, base);
2547 TREE_TYPE (result) = integer_type_node;
2553 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2554 what we found when we tried to do the lookup.
2555 LOCATION is the location of the NAME identifier;
2556 The location is used in the error message*/
2559 qualified_name_lookup_error (tree scope, tree name,
2560 tree decl, location_t location)
2562 if (scope == error_mark_node)
2563 ; /* We already complained. */
2564 else if (TYPE_P (scope))
2566 if (!COMPLETE_TYPE_P (scope))
2567 error ("%Hincomplete type %qT used in nested name specifier",
2569 else if (TREE_CODE (decl) == TREE_LIST)
2571 error ("%Hreference to %<%T::%D%> is ambiguous", &location, scope, name);
2572 print_candidates (decl);
2575 error ("%H%qD is not a member of %qT", &location, name, scope);
2577 else if (scope != global_namespace)
2578 error ("%H%qD is not a member of %qD", &location, name, scope);
2580 error ("%H%<::%D%> has not been declared", &location, name);
2583 /* If FNS is a member function, a set of member functions, or a
2584 template-id referring to one or more member functions, return a
2585 BASELINK for FNS, incorporating the current access context.
2586 Otherwise, return FNS unchanged. */
2589 baselink_for_fns (tree fns)
2594 if (BASELINK_P (fns)
2595 || error_operand_p (fns))
2599 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2600 fn = TREE_OPERAND (fn, 0);
2601 fn = get_first_fn (fn);
2602 if (!DECL_FUNCTION_MEMBER_P (fn))
2605 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2607 cl = DECL_CONTEXT (fn);
2608 cl = TYPE_BINFO (cl);
2609 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2612 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2613 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2614 if non-NULL, is the type or namespace used to explicitly qualify
2615 ID_EXPRESSION. DECL is the entity to which that name has been
2618 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2619 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2620 be set to true if this expression isn't permitted in a
2621 constant-expression, but it is otherwise not set by this function.
2622 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2623 constant-expression, but a non-constant expression is also
2626 DONE is true if this expression is a complete postfix-expression;
2627 it is false if this expression is followed by '->', '[', '(', etc.
2628 ADDRESS_P is true iff this expression is the operand of '&'.
2629 TEMPLATE_P is true iff the qualified-id was of the form
2630 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2631 appears as a template argument.
2633 If an error occurs, and it is the kind of error that might cause
2634 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2635 is the caller's responsibility to issue the message. *ERROR_MSG
2636 will be a string with static storage duration, so the caller need
2639 Return an expression for the entity, after issuing appropriate
2640 diagnostics. This function is also responsible for transforming a
2641 reference to a non-static member into a COMPONENT_REF that makes
2642 the use of "this" explicit.
2644 Upon return, *IDK will be filled in appropriately. */
2646 finish_id_expression (tree id_expression,
2650 bool integral_constant_expression_p,
2651 bool allow_non_integral_constant_expression_p,
2652 bool *non_integral_constant_expression_p,
2656 bool template_arg_p,
2657 const char **error_msg,
2658 location_t location)
2660 /* Initialize the output parameters. */
2661 *idk = CP_ID_KIND_NONE;
2664 if (id_expression == error_mark_node)
2665 return error_mark_node;
2666 /* If we have a template-id, then no further lookup is
2667 required. If the template-id was for a template-class, we
2668 will sometimes have a TYPE_DECL at this point. */
2669 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2670 || TREE_CODE (decl) == TYPE_DECL)
2672 /* Look up the name. */
2675 if (decl == error_mark_node)
2677 /* Name lookup failed. */
2680 || (!dependent_type_p (scope)
2681 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2682 && IDENTIFIER_TYPENAME_P (id_expression)
2683 && dependent_type_p (TREE_TYPE (id_expression))))))
2685 /* If the qualifying type is non-dependent (and the name
2686 does not name a conversion operator to a dependent
2687 type), issue an error. */
2688 qualified_name_lookup_error (scope, id_expression, decl, location);
2689 return error_mark_node;
2693 /* It may be resolved via Koenig lookup. */
2694 *idk = CP_ID_KIND_UNQUALIFIED;
2695 return id_expression;
2698 decl = id_expression;
2700 /* If DECL is a variable that would be out of scope under
2701 ANSI/ISO rules, but in scope in the ARM, name lookup
2702 will succeed. Issue a diagnostic here. */
2704 decl = check_for_out_of_scope_variable (decl);
2706 /* Remember that the name was used in the definition of
2707 the current class so that we can check later to see if
2708 the meaning would have been different after the class
2709 was entirely defined. */
2710 if (!scope && decl != error_mark_node)
2711 maybe_note_name_used_in_class (id_expression, decl);
2713 /* Disallow uses of local variables from containing functions. */
2714 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2716 tree context = decl_function_context (decl);
2717 if (context != NULL_TREE && context != current_function_decl
2718 && ! TREE_STATIC (decl))
2720 error (TREE_CODE (decl) == VAR_DECL
2721 ? "use of %<auto%> variable from containing function"
2722 : "use of parameter from containing function");
2723 error (" %q+#D declared here", decl);
2724 return error_mark_node;
2729 /* If we didn't find anything, or what we found was a type,
2730 then this wasn't really an id-expression. */
2731 if (TREE_CODE (decl) == TEMPLATE_DECL
2732 && !DECL_FUNCTION_TEMPLATE_P (decl))
2734 *error_msg = "missing template arguments";
2735 return error_mark_node;
2737 else if (TREE_CODE (decl) == TYPE_DECL
2738 || TREE_CODE (decl) == NAMESPACE_DECL)
2740 *error_msg = "expected primary-expression";
2741 return error_mark_node;
2744 /* If the name resolved to a template parameter, there is no
2745 need to look it up again later. */
2746 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2747 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2751 *idk = CP_ID_KIND_NONE;
2752 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2753 decl = TEMPLATE_PARM_DECL (decl);
2754 r = convert_from_reference (DECL_INITIAL (decl));
2756 if (integral_constant_expression_p
2757 && !dependent_type_p (TREE_TYPE (decl))
2758 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2760 if (!allow_non_integral_constant_expression_p)
2761 error ("template parameter %qD of type %qT is not allowed in "
2762 "an integral constant expression because it is not of "
2763 "integral or enumeration type", decl, TREE_TYPE (decl));
2764 *non_integral_constant_expression_p = true;
2768 /* Similarly, we resolve enumeration constants to their
2769 underlying values. */
2770 else if (TREE_CODE (decl) == CONST_DECL)
2772 *idk = CP_ID_KIND_NONE;
2773 if (!processing_template_decl)
2775 used_types_insert (TREE_TYPE (decl));
2776 return DECL_INITIAL (decl);
2784 /* If the declaration was explicitly qualified indicate
2785 that. The semantics of `A::f(3)' are different than
2786 `f(3)' if `f' is virtual. */
2788 ? CP_ID_KIND_QUALIFIED
2789 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2790 ? CP_ID_KIND_TEMPLATE_ID
2791 : CP_ID_KIND_UNQUALIFIED));
2796 An id-expression is type-dependent if it contains an
2797 identifier that was declared with a dependent type.
2799 The standard is not very specific about an id-expression that
2800 names a set of overloaded functions. What if some of them
2801 have dependent types and some of them do not? Presumably,
2802 such a name should be treated as a dependent name. */
2803 /* Assume the name is not dependent. */
2804 dependent_p = false;
2805 if (!processing_template_decl)
2806 /* No names are dependent outside a template. */
2808 /* A template-id where the name of the template was not resolved
2809 is definitely dependent. */
2810 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2811 && (TREE_CODE (TREE_OPERAND (decl, 0))
2812 == IDENTIFIER_NODE))
2814 /* For anything except an overloaded function, just check its
2816 else if (!is_overloaded_fn (decl))
2818 = dependent_type_p (TREE_TYPE (decl));
2819 /* For a set of overloaded functions, check each of the
2825 if (BASELINK_P (fns))
2826 fns = BASELINK_FUNCTIONS (fns);
2828 /* For a template-id, check to see if the template
2829 arguments are dependent. */
2830 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2832 tree args = TREE_OPERAND (fns, 1);
2833 dependent_p = any_dependent_template_arguments_p (args);
2834 /* The functions are those referred to by the
2836 fns = TREE_OPERAND (fns, 0);
2839 /* If there are no dependent template arguments, go through
2840 the overloaded functions. */
2841 while (fns && !dependent_p)
2843 tree fn = OVL_CURRENT (fns);
2845 /* Member functions of dependent classes are
2847 if (TREE_CODE (fn) == FUNCTION_DECL
2848 && type_dependent_expression_p (fn))
2850 else if (TREE_CODE (fn) == TEMPLATE_DECL
2851 && dependent_template_p (fn))
2854 fns = OVL_NEXT (fns);
2858 /* If the name was dependent on a template parameter, we will
2859 resolve the name at instantiation time. */
2862 /* Create a SCOPE_REF for qualified names, if the scope is
2868 if (address_p && done)
2869 decl = finish_qualified_id_expr (scope, decl,
2875 tree type = NULL_TREE;
2876 if (DECL_P (decl) && !dependent_scope_p (scope))
2877 type = TREE_TYPE (decl);
2878 decl = build_qualified_name (type,
2884 if (TREE_TYPE (decl))
2885 decl = convert_from_reference (decl);
2888 /* A TEMPLATE_ID already contains all the information we
2890 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2891 return id_expression;
2892 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2893 /* If we found a variable, then name lookup during the
2894 instantiation will always resolve to the same VAR_DECL
2895 (or an instantiation thereof). */
2896 if (TREE_CODE (decl) == VAR_DECL
2897 || TREE_CODE (decl) == PARM_DECL)
2898 return convert_from_reference (decl);
2899 /* The same is true for FIELD_DECL, but we also need to
2900 make sure that the syntax is correct. */
2901 else if (TREE_CODE (decl) == FIELD_DECL)
2903 /* Since SCOPE is NULL here, this is an unqualified name.
2904 Access checking has been performed during name lookup
2905 already. Turn off checking to avoid duplicate errors. */
2906 push_deferring_access_checks (dk_no_check);
2907 decl = finish_non_static_data_member
2908 (decl, current_class_ref,
2909 /*qualifying_scope=*/NULL_TREE);
2910 pop_deferring_access_checks ();
2913 return id_expression;
2916 /* Only certain kinds of names are allowed in constant
2917 expression. Enumerators and template parameters have already
2918 been handled above. */
2919 if (integral_constant_expression_p
2920 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2921 && ! builtin_valid_in_constant_expr_p (decl))
2923 if (!allow_non_integral_constant_expression_p)
2925 error ("%qD cannot appear in a constant-expression", decl);
2926 return error_mark_node;
2928 *non_integral_constant_expression_p = true;
2931 if (TREE_CODE (decl) == NAMESPACE_DECL)
2933 error ("use of namespace %qD as expression", decl);
2934 return error_mark_node;
2936 else if (DECL_CLASS_TEMPLATE_P (decl))
2938 error ("use of class template %qT as expression", decl);
2939 return error_mark_node;
2941 else if (TREE_CODE (decl) == TREE_LIST)
2943 /* Ambiguous reference to base members. */
2944 error ("request for member %qD is ambiguous in "
2945 "multiple inheritance lattice", id_expression);
2946 print_candidates (decl);
2947 return error_mark_node;
2950 /* Mark variable-like entities as used. Functions are similarly
2951 marked either below or after overload resolution. */
2952 if (TREE_CODE (decl) == VAR_DECL
2953 || TREE_CODE (decl) == PARM_DECL
2954 || TREE_CODE (decl) == RESULT_DECL)
2959 decl = (adjust_result_of_qualified_name_lookup
2960 (decl, scope, current_class_type));
2962 if (TREE_CODE (decl) == FUNCTION_DECL)
2965 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2966 decl = finish_qualified_id_expr (scope,
2974 tree r = convert_from_reference (decl);
2976 if (processing_template_decl && TYPE_P (scope))
2977 r = build_qualified_name (TREE_TYPE (r),
2983 else if (TREE_CODE (decl) == FIELD_DECL)
2985 /* Since SCOPE is NULL here, this is an unqualified name.
2986 Access checking has been performed during name lookup
2987 already. Turn off checking to avoid duplicate errors. */
2988 push_deferring_access_checks (dk_no_check);
2989 decl = finish_non_static_data_member (decl, current_class_ref,
2990 /*qualifying_scope=*/NULL_TREE);
2991 pop_deferring_access_checks ();
2993 else if (is_overloaded_fn (decl))
2998 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2999 first_fn = TREE_OPERAND (first_fn, 0);
3000 first_fn = get_first_fn (first_fn);
3001 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3002 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3004 if (!really_overloaded_fn (decl))
3005 mark_used (first_fn);
3008 && TREE_CODE (first_fn) == FUNCTION_DECL
3009 && DECL_FUNCTION_MEMBER_P (first_fn)
3010 && !shared_member_p (decl))
3012 /* A set of member functions. */
3013 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3014 return finish_class_member_access_expr (decl, id_expression,
3015 /*template_p=*/false,
3016 tf_warning_or_error);
3019 decl = baselink_for_fns (decl);
3023 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3024 && DECL_CLASS_SCOPE_P (decl))
3026 tree context = context_for_name_lookup (decl);
3027 if (context != current_class_type)
3029 tree path = currently_open_derived_class (context);
3030 perform_or_defer_access_check (TYPE_BINFO (path),
3035 decl = convert_from_reference (decl);
3039 if (TREE_DEPRECATED (decl))
3040 warn_deprecated_use (decl, NULL_TREE);
3045 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3046 use as a type-specifier. */
3049 finish_typeof (tree expr)
3053 if (type_dependent_expression_p (expr))
3055 type = cxx_make_type (TYPEOF_TYPE);
3056 TYPEOF_TYPE_EXPR (type) = expr;
3057 SET_TYPE_STRUCTURAL_EQUALITY (type);
3062 type = unlowered_expr_type (expr);
3064 if (!type || type == unknown_type_node)
3066 error ("type of %qE is unknown", expr);
3067 return error_mark_node;
3073 /* Perform C++-specific checks for __builtin_offsetof before calling
3077 finish_offsetof (tree expr)
3079 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3081 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3082 TREE_OPERAND (expr, 2));
3083 return error_mark_node;
3085 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3086 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3087 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3089 if (TREE_CODE (expr) == COMPONENT_REF
3090 || TREE_CODE (expr) == COMPOUND_EXPR)
3091 expr = TREE_OPERAND (expr, 1);
3092 error ("cannot apply %<offsetof%> to member function %qD", expr);
3093 return error_mark_node;
3095 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3096 expr = TREE_OPERAND (expr, 0);
3097 return fold_offsetof (expr, NULL_TREE);
3100 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3101 function is broken out from the above for the benefit of the tree-ssa
3105 simplify_aggr_init_expr (tree *tp)
3107 tree aggr_init_expr = *tp;
3109 /* Form an appropriate CALL_EXPR. */
3110 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3111 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3112 tree type = TREE_TYPE (slot);
3115 enum style_t { ctor, arg, pcc } style;
3117 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3119 #ifdef PCC_STATIC_STRUCT_RETURN
3125 gcc_assert (TREE_ADDRESSABLE (type));
3129 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3131 aggr_init_expr_nargs (aggr_init_expr),
3132 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3136 /* Replace the first argument to the ctor with the address of the
3138 cxx_mark_addressable (slot);
3139 CALL_EXPR_ARG (call_expr, 0) =
3140 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3142 else if (style == arg)
3144 /* Just mark it addressable here, and leave the rest to
3145 expand_call{,_inline}. */
3146 cxx_mark_addressable (slot);
3147 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3148 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3150 else if (style == pcc)
3152 /* If we're using the non-reentrant PCC calling convention, then we
3153 need to copy the returned value out of the static buffer into the
3155 push_deferring_access_checks (dk_no_check);
3156 call_expr = build_aggr_init (slot, call_expr,
3157 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3158 tf_warning_or_error);
3159 pop_deferring_access_checks ();
3160 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3163 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3165 tree init = build_zero_init (type, NULL_TREE,
3166 /*static_storage_p=*/false);
3167 init = build2 (INIT_EXPR, void_type_node, slot, init);
3168 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3175 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3178 emit_associated_thunks (tree fn)
3180 /* When we use vcall offsets, we emit thunks with the virtual
3181 functions to which they thunk. The whole point of vcall offsets
3182 is so that you can know statically the entire set of thunks that
3183 will ever be needed for a given virtual function, thereby
3184 enabling you to output all the thunks with the function itself. */
3185 if (DECL_VIRTUAL_P (fn))
3189 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3191 if (!THUNK_ALIAS (thunk))
3193 use_thunk (thunk, /*emit_p=*/1);
3194 if (DECL_RESULT_THUNK_P (thunk))
3198 for (probe = DECL_THUNKS (thunk);
3199 probe; probe = TREE_CHAIN (probe))
3200 use_thunk (probe, /*emit_p=*/1);
3204 gcc_assert (!DECL_THUNKS (thunk));
3209 /* Generate RTL for FN. */
3212 expand_or_defer_fn (tree fn)
3214 /* When the parser calls us after finishing the body of a template
3215 function, we don't really want to expand the body. */
3216 if (processing_template_decl)
3218 /* Normally, collection only occurs in rest_of_compilation. So,
3219 if we don't collect here, we never collect junk generated
3220 during the processing of templates until we hit a
3221 non-template function. It's not safe to do this inside a
3222 nested class, though, as the parser may have local state that
3223 is not a GC root. */
3224 if (!function_depth)
3229 gcc_assert (gimple_body (fn));
3231 /* If this is a constructor or destructor body, we have to clone
3233 if (maybe_clone_body (fn))
3235 /* We don't want to process FN again, so pretend we've written
3236 it out, even though we haven't. */
3237 TREE_ASM_WRITTEN (fn) = 1;
3241 /* We make a decision about linkage for these functions at the end
3242 of the compilation. Until that point, we do not want the back
3243 end to output them -- but we do want it to see the bodies of
3244 these functions so that it can inline them as appropriate. */
3245 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3247 if (DECL_INTERFACE_KNOWN (fn))
3248 /* We've already made a decision as to how this function will
3252 DECL_EXTERNAL (fn) = 1;
3253 DECL_NOT_REALLY_EXTERN (fn) = 1;
3254 note_vague_linkage_fn (fn);
3255 /* A non-template inline function with external linkage will
3256 always be COMDAT. As we must eventually determine the
3257 linkage of all functions, and as that causes writes to
3258 the data mapped in from the PCH file, it's advantageous
3259 to mark the functions at this point. */
3260 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3262 /* This function must have external linkage, as
3263 otherwise DECL_INTERFACE_KNOWN would have been
3265 gcc_assert (TREE_PUBLIC (fn));
3266 comdat_linkage (fn);
3267 DECL_INTERFACE_KNOWN (fn) = 1;
3271 import_export_decl (fn);
3273 /* If the user wants us to keep all inline functions, then mark
3274 this function as needed so that finish_file will make sure to
3276 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3280 /* There's no reason to do any of the work here if we're only doing
3281 semantic analysis; this code just generates RTL. */
3282 if (flag_syntax_only)
3287 /* Expand or defer, at the whim of the compilation unit manager. */
3288 cgraph_finalize_function (fn, function_depth > 1);
3300 /* Helper function for walk_tree, used by finalize_nrv below. */
3303 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3305 struct nrv_data *dp = (struct nrv_data *)data;
3308 /* No need to walk into types. There wouldn't be any need to walk into
3309 non-statements, except that we have to consider STMT_EXPRs. */
3312 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3313 but differs from using NULL_TREE in that it indicates that we care
3314 about the value of the RESULT_DECL. */
3315 else if (TREE_CODE (*tp) == RETURN_EXPR)
3316 TREE_OPERAND (*tp, 0) = dp->result;
3317 /* Change all cleanups for the NRV to only run when an exception is
3319 else if (TREE_CODE (*tp) == CLEANUP_STMT
3320 && CLEANUP_DECL (*tp) == dp->var)
3321 CLEANUP_EH_ONLY (*tp) = 1;
3322 /* Replace the DECL_EXPR for the NRV with an initialization of the
3323 RESULT_DECL, if needed. */
3324 else if (TREE_CODE (*tp) == DECL_EXPR
3325 && DECL_EXPR_DECL (*tp) == dp->var)
3328 if (DECL_INITIAL (dp->var)
3329 && DECL_INITIAL (dp->var) != error_mark_node)
3330 init = build2 (INIT_EXPR, void_type_node, dp->result,
3331 DECL_INITIAL (dp->var));
3333 init = build_empty_stmt ();
3334 DECL_INITIAL (dp->var) = NULL_TREE;
3335 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3338 /* And replace all uses of the NRV with the RESULT_DECL. */
3339 else if (*tp == dp->var)
3342 /* Avoid walking into the same tree more than once. Unfortunately, we
3343 can't just use walk_tree_without duplicates because it would only call
3344 us for the first occurrence of dp->var in the function body. */
3345 slot = htab_find_slot (dp->visited, *tp, INSERT);
3351 /* Keep iterating. */
3355 /* Called from finish_function to implement the named return value
3356 optimization by overriding all the RETURN_EXPRs and pertinent
3357 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3358 RESULT_DECL for the function. */
3361 finalize_nrv (tree *tp, tree var, tree result)
3363 struct nrv_data data;
3365 /* Copy debugging information from VAR to RESULT. */
3366 DECL_NAME (result) = DECL_NAME (var);
3367 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3368 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3369 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3370 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3371 /* Don't forget that we take its address. */
3372 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3375 data.result = result;
3376 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3377 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3378 htab_delete (data.visited);
3381 /* Return the declaration for the function called by CALL_EXPR T,
3382 TYPE is the class type of the clause decl. */
3385 omp_clause_info_fndecl (tree t, tree type)
3387 tree ret = get_callee_fndecl (t);
3392 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3393 t = CALL_EXPR_FN (t);
3395 if (TREE_CODE (t) == OBJ_TYPE_REF)
3397 t = cp_fold_obj_type_ref (t, type);
3398 if (TREE_CODE (t) == ADDR_EXPR
3399 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3400 return TREE_OPERAND (t, 0);
3406 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3409 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3410 bool need_copy_ctor, bool need_copy_assignment)
3412 int save_errorcount = errorcount;
3415 /* Always allocate 3 elements for simplicity. These are the
3416 function decls for the ctor, dtor, and assignment op.
3417 This layout is known to the three lang hooks,
3418 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3419 and cxx_omp_clause_assign_op. */
3420 info = make_tree_vec (3);
3421 CP_OMP_CLAUSE_INFO (c) = info;
3423 if (need_default_ctor
3424 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3426 if (need_default_ctor)
3430 t = build_int_cst (build_pointer_type (type), 0);
3431 t = build1 (INDIRECT_REF, type, t);
3432 t = build_tree_list (NULL, t);
3434 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3435 t, type, LOOKUP_NORMAL,
3436 tf_warning_or_error);
3438 if (targetm.cxx.cdtor_returns_this () || errorcount)
3439 /* Because constructors and destructors return this,
3440 the call will have been cast to "void". Remove the
3441 cast here. We would like to use STRIP_NOPS, but it
3442 wouldn't work here because TYPE_MODE (t) and
3443 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3444 They are VOIDmode and Pmode, respectively. */
3445 if (TREE_CODE (t) == NOP_EXPR)
3446 t = TREE_OPERAND (t, 0);
3448 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3451 if ((need_default_ctor || need_copy_ctor)
3452 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3454 t = build_int_cst (build_pointer_type (type), 0);
3455 t = build1 (INDIRECT_REF, type, t);
3456 t = build_special_member_call (t, complete_dtor_identifier,
3457 NULL, type, LOOKUP_NORMAL,
3458 tf_warning_or_error);
3460 if (targetm.cxx.cdtor_returns_this () || errorcount)
3461 /* Because constructors and destructors return this,
3462 the call will have been cast to "void". Remove the
3463 cast here. We would like to use STRIP_NOPS, but it
3464 wouldn't work here because TYPE_MODE (t) and
3465 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3466 They are VOIDmode and Pmode, respectively. */
3467 if (TREE_CODE (t) == NOP_EXPR)
3468 t = TREE_OPERAND (t, 0);
3470 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3473 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3475 t = build_int_cst (build_pointer_type (type), 0);
3476 t = build1 (INDIRECT_REF, type, t);
3477 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3478 build_tree_list (NULL, t),
3479 type, LOOKUP_NORMAL,
3480 tf_warning_or_error);
3482 /* We'll have called convert_from_reference on the call, which
3483 may well have added an indirect_ref. It's unneeded here,
3484 and in the way, so kill it. */
3485 if (TREE_CODE (t) == INDIRECT_REF)
3486 t = TREE_OPERAND (t, 0);
3488 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3491 return errorcount != save_errorcount;
3494 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3495 Remove any elements from the list that are invalid. */
3498 finish_omp_clauses (tree clauses)
3500 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3501 tree c, t, *pc = &clauses;
3504 bitmap_obstack_initialize (NULL);
3505 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3506 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3507 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3509 for (pc = &clauses, c = clauses; c ; c = *pc)
3511 bool remove = false;
3513 switch (OMP_CLAUSE_CODE (c))
3515 case OMP_CLAUSE_SHARED:
3517 goto check_dup_generic;
3518 case OMP_CLAUSE_PRIVATE:
3520 goto check_dup_generic;
3521 case OMP_CLAUSE_REDUCTION:
3523 goto check_dup_generic;
3524 case OMP_CLAUSE_COPYPRIVATE:
3525 name = "copyprivate";
3526 goto check_dup_generic;
3527 case OMP_CLAUSE_COPYIN:
3529 goto check_dup_generic;
3531 t = OMP_CLAUSE_DECL (c);
3532 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3534 if (processing_template_decl)
3537 error ("%qD is not a variable in clause %qs", t, name);
3539 error ("%qE is not a variable in clause %qs", t, name);
3542 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3543 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3544 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3546 error ("%qD appears more than once in data clauses", t);
3550 bitmap_set_bit (&generic_head, DECL_UID (t));
3553 case OMP_CLAUSE_FIRSTPRIVATE:
3554 t = OMP_CLAUSE_DECL (c);
3555 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3557 if (processing_template_decl)
3560 error ("%qD is not a variable in clause %<firstprivate%>", t);
3562 error ("%qE is not a variable in clause %<firstprivate%>", t);
3565 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3566 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3568 error ("%qD appears more than once in data clauses", t);
3572 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3575 case OMP_CLAUSE_LASTPRIVATE:
3576 t = OMP_CLAUSE_DECL (c);
3577 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3579 if (processing_template_decl)
3582 error ("%qD is not a variable in clause %<lastprivate%>", t);
3584 error ("%qE is not a variable in clause %<lastprivate%>", t);
3587 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3588 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3590 error ("%qD appears more than once in data clauses", t);
3594 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3598 t = OMP_CLAUSE_IF_EXPR (c);
3599 t = maybe_convert_cond (t);
3600 if (t == error_mark_node)
3602 OMP_CLAUSE_IF_EXPR (c) = t;
3605 case OMP_CLAUSE_NUM_THREADS:
3606 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3607 if (t == error_mark_node)
3609 else if (!type_dependent_expression_p (t)
3610 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3612 error ("num_threads expression must be integral");
3617 case OMP_CLAUSE_SCHEDULE:
3618 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3621 else if (t == error_mark_node)
3623 else if (!type_dependent_expression_p (t)
3624 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3626 error ("schedule chunk size expression must be integral");
3631 case OMP_CLAUSE_NOWAIT:
3632 case OMP_CLAUSE_ORDERED:
3633 case OMP_CLAUSE_DEFAULT:
3634 case OMP_CLAUSE_UNTIED:
3635 case OMP_CLAUSE_COLLAPSE:
3643 *pc = OMP_CLAUSE_CHAIN (c);
3645 pc = &OMP_CLAUSE_CHAIN (c);
3648 for (pc = &clauses, c = clauses; c ; c = *pc)
3650 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3651 bool remove = false;
3652 bool need_complete_non_reference = false;
3653 bool need_default_ctor = false;
3654 bool need_copy_ctor = false;
3655 bool need_copy_assignment = false;
3656 bool need_implicitly_determined = false;
3657 tree type, inner_type;
3661 case OMP_CLAUSE_SHARED:
3663 need_implicitly_determined = true;
3665 case OMP_CLAUSE_PRIVATE:
3667 need_complete_non_reference = true;
3668 need_default_ctor = true;
3669 need_implicitly_determined = true;
3671 case OMP_CLAUSE_FIRSTPRIVATE:
3672 name = "firstprivate";
3673 need_complete_non_reference = true;
3674 need_copy_ctor = true;
3675 need_implicitly_determined = true;
3677 case OMP_CLAUSE_LASTPRIVATE:
3678 name = "lastprivate";
3679 need_complete_non_reference = true;
3680 need_copy_assignment = true;
3681 need_implicitly_determined = true;
3683 case OMP_CLAUSE_REDUCTION:
3685 need_implicitly_determined = true;
3687 case OMP_CLAUSE_COPYPRIVATE:
3688 name = "copyprivate";
3689 need_copy_assignment = true;
3691 case OMP_CLAUSE_COPYIN:
3693 need_copy_assignment = true;
3696 pc = &OMP_CLAUSE_CHAIN (c);
3700 t = OMP_CLAUSE_DECL (c);
3701 if (processing_template_decl
3702 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3704 pc = &OMP_CLAUSE_CHAIN (c);
3710 case OMP_CLAUSE_LASTPRIVATE:
3711 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3712 need_default_ctor = true;
3715 case OMP_CLAUSE_REDUCTION:
3716 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3717 || POINTER_TYPE_P (TREE_TYPE (t)))
3719 error ("%qE has invalid type for %<reduction%>", t);
3722 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3724 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3732 error ("%qE has invalid type for %<reduction(%s)%>",
3733 t, operator_name_info[r_code].name);
3739 case OMP_CLAUSE_COPYIN:
3740 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3742 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3751 if (need_complete_non_reference)
3753 t = require_complete_type (t);
3754 if (t == error_mark_node)
3756 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3758 error ("%qE has reference type for %qs", t, name);
3762 if (need_implicitly_determined)
3764 const char *share_name = NULL;
3766 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3767 share_name = "threadprivate";
3768 else switch (cxx_omp_predetermined_sharing (t))
3770 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3772 case OMP_CLAUSE_DEFAULT_SHARED:
3773 share_name = "shared";
3775 case OMP_CLAUSE_DEFAULT_PRIVATE:
3776 share_name = "private";
3783 error ("%qE is predetermined %qs for %qs",
3784 t, share_name, name);
3789 /* We're interested in the base element, not arrays. */
3790 inner_type = type = TREE_TYPE (t);
3791 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3792 inner_type = TREE_TYPE (inner_type);
3794 /* Check for special function availability by building a call to one.
3795 Save the results, because later we won't be in the right context
3796 for making these queries. */
3797 if (CLASS_TYPE_P (inner_type)
3798 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3799 && !type_dependent_expression_p (t)
3800 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3801 need_copy_ctor, need_copy_assignment))
3805 *pc = OMP_CLAUSE_CHAIN (c);
3807 pc = &OMP_CLAUSE_CHAIN (c);
3810 bitmap_obstack_release (NULL);
3814 /* For all variables in the tree_list VARS, mark them as thread local. */
3817 finish_omp_threadprivate (tree vars)
3821 /* Mark every variable in VARS to be assigned thread local storage. */
3822 for (t = vars; t; t = TREE_CHAIN (t))
3824 tree v = TREE_PURPOSE (t);
3826 if (error_operand_p (v))
3828 else if (TREE_CODE (v) != VAR_DECL)
3829 error ("%<threadprivate%> %qD is not file, namespace "
3830 "or block scope variable", v);
3831 /* If V had already been marked threadprivate, it doesn't matter
3832 whether it had been used prior to this point. */
3833 else if (TREE_USED (v)
3834 && (DECL_LANG_SPECIFIC (v) == NULL
3835 || !CP_DECL_THREADPRIVATE_P (v)))
3836 error ("%qE declared %<threadprivate%> after first use", v);
3837 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3838 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3839 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3840 error ("%<threadprivate%> %qE has incomplete type", v);
3841 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3842 && CP_DECL_CONTEXT (v) != current_class_type)
3843 error ("%<threadprivate%> %qE directive not "
3844 "in %qT definition", v, CP_DECL_CONTEXT (v));
3847 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3848 if (DECL_LANG_SPECIFIC (v) == NULL)
3850 retrofit_lang_decl (v);
3852 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3853 after the allocation of the lang_decl structure. */
3854 if (DECL_DISCRIMINATOR_P (v))
3855 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3858 if (! DECL_THREAD_LOCAL_P (v))
3860 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3861 /* If rtl has been already set for this var, call
3862 make_decl_rtl once again, so that encode_section_info
3863 has a chance to look at the new decl flags. */
3864 if (DECL_RTL_SET_P (v))
3867 CP_DECL_THREADPRIVATE_P (v) = 1;
3872 /* Build an OpenMP structured block. */
3875 begin_omp_structured_block (void)
3877 return do_pushlevel (sk_omp);
3881 finish_omp_structured_block (tree block)
3883 return do_poplevel (block);
3886 /* Similarly, except force the retention of the BLOCK. */
3889 begin_omp_parallel (void)
3891 keep_next_level (true);
3892 return begin_omp_structured_block ();
3896 finish_omp_parallel (tree clauses, tree body)
3900 body = finish_omp_structured_block (body);
3902 stmt = make_node (OMP_PARALLEL);
3903 TREE_TYPE (stmt) = void_type_node;
3904 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3905 OMP_PARALLEL_BODY (stmt) = body;
3907 return add_stmt (stmt);
3911 begin_omp_task (void)
3913 keep_next_level (true);
3914 return begin_omp_structured_block ();
3918 finish_omp_task (tree clauses, tree body)
3922 body = finish_omp_structured_block (body);
3924 stmt = make_node (OMP_TASK);
3925 TREE_TYPE (stmt) = void_type_node;
3926 OMP_TASK_CLAUSES (stmt) = clauses;
3927 OMP_TASK_BODY (stmt) = body;
3929 return add_stmt (stmt);
3932 /* Helper function for finish_omp_for. Convert Ith random access iterator
3933 into integral iterator. Return FALSE if successful. */
3936 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3937 tree condv, tree incrv, tree *body,
3938 tree *pre_body, tree clauses)
3940 tree diff, iter_init, iter_incr = NULL, last;
3941 tree incr_var = NULL, orig_pre_body, orig_body, c;
3942 tree decl = TREE_VEC_ELT (declv, i);
3943 tree init = TREE_VEC_ELT (initv, i);
3944 tree cond = TREE_VEC_ELT (condv, i);
3945 tree incr = TREE_VEC_ELT (incrv, i);
3947 location_t elocus = locus;
3949 if (init && EXPR_HAS_LOCATION (init))
3950 elocus = EXPR_LOCATION (init);
3952 switch (TREE_CODE (cond))
3958 if (TREE_OPERAND (cond, 1) == iter)
3959 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
3960 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
3961 if (TREE_OPERAND (cond, 0) != iter)
3962 cond = error_mark_node;
3965 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3966 TREE_OPERAND (cond, 1), ERROR_MARK,
3967 NULL, tf_warning_or_error);
3968 if (error_operand_p (tem))
3973 cond = error_mark_node;
3976 if (cond == error_mark_node)
3978 error ("%Hinvalid controlling predicate", &elocus);
3981 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
3982 ERROR_MARK, iter, ERROR_MARK, NULL,
3983 tf_warning_or_error);
3984 if (error_operand_p (diff))
3986 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
3988 error ("%Hdifference between %qE and %qD does not have integer type",
3989 &elocus, TREE_OPERAND (cond, 1), iter);
3993 switch (TREE_CODE (incr))
3995 case PREINCREMENT_EXPR:
3996 case PREDECREMENT_EXPR:
3997 case POSTINCREMENT_EXPR:
3998 case POSTDECREMENT_EXPR:
3999 if (TREE_OPERAND (incr, 0) != iter)
4001 incr = error_mark_node;
4004 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4005 tf_warning_or_error);
4006 if (error_operand_p (iter_incr))
4008 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4009 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4010 incr = integer_one_node;
4012 incr = integer_minus_one_node;
4015 if (TREE_OPERAND (incr, 0) != iter)
4016 incr = error_mark_node;
4017 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4018 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4020 tree rhs = TREE_OPERAND (incr, 1);
4021 if (TREE_OPERAND (rhs, 0) == iter)
4023 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4025 incr = error_mark_node;
4028 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4029 TREE_OPERAND (rhs, 1),
4030 tf_warning_or_error);
4031 if (error_operand_p (iter_incr))
4033 incr = TREE_OPERAND (rhs, 1);
4034 incr = cp_convert (TREE_TYPE (diff), incr);
4035 if (TREE_CODE (rhs) == MINUS_EXPR)
4037 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4038 incr = fold_if_not_in_template (incr);
4040 if (TREE_CODE (incr) != INTEGER_CST
4041 && (TREE_CODE (incr) != NOP_EXPR
4042 || (TREE_CODE (TREE_OPERAND (incr, 0))
4047 else if (TREE_OPERAND (rhs, 1) == iter)
4049 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4050 || TREE_CODE (rhs) != PLUS_EXPR)
4051 incr = error_mark_node;
4054 iter_incr = build_x_binary_op (PLUS_EXPR,
4055 TREE_OPERAND (rhs, 0),
4058 tf_warning_or_error);
4059 if (error_operand_p (iter_incr))
4061 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4063 tf_warning_or_error);
4064 if (error_operand_p (iter_incr))
4066 incr = TREE_OPERAND (rhs, 0);
4071 incr = error_mark_node;
4074 incr = error_mark_node;
4077 incr = error_mark_node;
4081 if (incr == error_mark_node)
4083 error ("%Hinvalid increment expression", &elocus);
4087 incr = cp_convert (TREE_TYPE (diff), incr);
4088 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4089 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4090 && OMP_CLAUSE_DECL (c) == iter)
4093 decl = create_temporary_var (TREE_TYPE (diff));
4095 add_decl_expr (decl);
4096 last = create_temporary_var (TREE_TYPE (diff));
4098 add_decl_expr (last);
4099 if (c && iter_incr == NULL)
4101 incr_var = create_temporary_var (TREE_TYPE (diff));
4102 pushdecl (incr_var);
4103 add_decl_expr (incr_var);
4105 gcc_assert (stmts_are_full_exprs_p ());
4107 orig_pre_body = *pre_body;
4108 *pre_body = push_stmt_list ();
4110 add_stmt (orig_pre_body);
4112 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4113 tf_warning_or_error));
4114 init = build_int_cst (TREE_TYPE (diff), 0);
4115 if (c && iter_incr == NULL)
4117 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4118 incr, tf_warning_or_error));
4120 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4121 tf_warning_or_error);
4123 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4124 tf_warning_or_error));
4125 *pre_body = pop_stmt_list (*pre_body);
4127 cond = cp_build_binary_op (elocus,
4128 TREE_CODE (cond), decl, diff,
4129 tf_warning_or_error);
4130 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4134 *body = push_stmt_list ();
4135 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4136 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4137 tf_warning_or_error);
4138 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4139 finish_expr_stmt (iter_init);
4140 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4141 tf_warning_or_error));
4142 add_stmt (orig_body);
4143 *body = pop_stmt_list (*body);
4147 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4148 finish_expr_stmt (iter_incr);
4149 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4150 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4153 TREE_VEC_ELT (declv, i) = decl;
4154 TREE_VEC_ELT (initv, i) = init;
4155 TREE_VEC_ELT (condv, i) = cond;
4156 TREE_VEC_ELT (incrv, i) = incr;
4161 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4162 are directly for their associated operands in the statement. DECL
4163 and INIT are a combo; if DECL is NULL then INIT ought to be a
4164 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4165 optional statements that need to go before the loop into its
4169 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4170 tree incrv, tree body, tree pre_body, tree clauses)
4172 tree omp_for = NULL, orig_incr = NULL;
4173 tree decl, init, cond, incr;
4177 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4178 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4179 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4180 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4182 decl = TREE_VEC_ELT (declv, i);
4183 init = TREE_VEC_ELT (initv, i);
4184 cond = TREE_VEC_ELT (condv, i);
4185 incr = TREE_VEC_ELT (incrv, i);
4191 switch (TREE_CODE (init))
4194 decl = TREE_OPERAND (init, 0);
4195 init = TREE_OPERAND (init, 1);
4198 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4200 decl = TREE_OPERAND (init, 0);
4201 init = TREE_OPERAND (init, 2);
4210 error ("%Hexpected iteration declaration or initialization",
4216 if (init && EXPR_HAS_LOCATION (init))
4217 elocus = EXPR_LOCATION (init);
4221 error ("%Hmissing controlling predicate", &elocus);
4227 error ("%Hmissing increment expression", &elocus);
4231 TREE_VEC_ELT (declv, i) = decl;
4232 TREE_VEC_ELT (initv, i) = init;
4235 if (dependent_omp_for_p (declv, initv, condv, incrv))
4239 stmt = make_node (OMP_FOR);
4241 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4243 /* This is really just a place-holder. We'll be decomposing this
4244 again and going through the cp_build_modify_expr path below when
4245 we instantiate the thing. */
4246 TREE_VEC_ELT (initv, i)
4247 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4248 TREE_VEC_ELT (initv, i));
4251 TREE_TYPE (stmt) = void_type_node;
4252 OMP_FOR_INIT (stmt) = initv;
4253 OMP_FOR_COND (stmt) = condv;
4254 OMP_FOR_INCR (stmt) = incrv;
4255 OMP_FOR_BODY (stmt) = body;
4256 OMP_FOR_PRE_BODY (stmt) = pre_body;
4257 OMP_FOR_CLAUSES (stmt) = clauses;
4259 SET_EXPR_LOCATION (stmt, locus);
4260 return add_stmt (stmt);
4263 if (processing_template_decl)
4264 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4266 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4268 decl = TREE_VEC_ELT (declv, i);
4269 init = TREE_VEC_ELT (initv, i);
4270 cond = TREE_VEC_ELT (condv, i);
4271 incr = TREE_VEC_ELT (incrv, i);
4273 TREE_VEC_ELT (orig_incr, i) = incr;
4276 if (init && EXPR_HAS_LOCATION (init))
4277 elocus = EXPR_LOCATION (init);
4281 error ("%Hexpected iteration declaration or initialization",
4286 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4289 TREE_VEC_ELT (orig_incr, i) = incr;
4290 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4291 TREE_CODE (TREE_OPERAND (incr, 1)),
4292 TREE_OPERAND (incr, 2),
4293 tf_warning_or_error);
4296 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4298 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4299 incrv, &body, &pre_body, clauses))
4304 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4305 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4307 error ("%Hinvalid type for iteration variable %qE", &elocus, decl);
4311 if (!processing_template_decl)
4313 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4314 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4317 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4319 && TREE_SIDE_EFFECTS (cond)
4320 && COMPARISON_CLASS_P (cond)
4321 && !processing_template_decl)
4323 tree t = TREE_OPERAND (cond, 0);
4324 if (TREE_SIDE_EFFECTS (t)
4326 && (TREE_CODE (t) != NOP_EXPR
4327 || TREE_OPERAND (t, 0) != decl))
4328 TREE_OPERAND (cond, 0)
4329 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4331 t = TREE_OPERAND (cond, 1);
4332 if (TREE_SIDE_EFFECTS (t)
4334 && (TREE_CODE (t) != NOP_EXPR
4335 || TREE_OPERAND (t, 0) != decl))
4336 TREE_OPERAND (cond, 1)
4337 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4339 if (decl == error_mark_node || init == error_mark_node)
4342 TREE_VEC_ELT (declv, i) = decl;
4343 TREE_VEC_ELT (initv, i) = init;
4344 TREE_VEC_ELT (condv, i) = cond;
4345 TREE_VEC_ELT (incrv, i) = incr;
4349 if (IS_EMPTY_STMT (pre_body))
4352 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4355 if (omp_for == NULL)
4358 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4360 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4361 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4363 if (TREE_CODE (incr) != MODIFY_EXPR)
4366 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4367 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4368 && !processing_template_decl)
4370 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4371 if (TREE_SIDE_EFFECTS (t)
4373 && (TREE_CODE (t) != NOP_EXPR
4374 || TREE_OPERAND (t, 0) != decl))
4375 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4376 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4378 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4379 if (TREE_SIDE_EFFECTS (t)
4381 && (TREE_CODE (t) != NOP_EXPR
4382 || TREE_OPERAND (t, 0) != decl))
4383 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4384 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4388 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4390 if (omp_for != NULL)
4391 OMP_FOR_CLAUSES (omp_for) = clauses;
4396 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4405 dependent_p = false;
4408 /* Even in a template, we can detect invalid uses of the atomic
4409 pragma if neither LHS nor RHS is type-dependent. */
4410 if (processing_template_decl)
4412 dependent_p = (type_dependent_expression_p (lhs)
4413 || type_dependent_expression_p (rhs));
4416 lhs = build_non_dependent_expr (lhs);
4417 rhs = build_non_dependent_expr (rhs);
4422 stmt = c_finish_omp_atomic (code, lhs, rhs);
4423 if (stmt == error_mark_node)
4426 if (processing_template_decl)
4427 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4428 build2 (code, void_type_node, orig_lhs, orig_rhs));
4433 finish_omp_barrier (void)
4435 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4436 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4437 finish_expr_stmt (stmt);
4441 finish_omp_flush (void)
4443 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4444 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4445 finish_expr_stmt (stmt);
4449 finish_omp_taskwait (void)
4451 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4452 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4453 finish_expr_stmt (stmt);
4457 init_cp_semantics (void)
4461 /* Build a STATIC_ASSERT for a static assertion with the condition
4462 CONDITION and the message text MESSAGE. LOCATION is the location
4463 of the static assertion in the source code. When MEMBER_P, this
4464 static assertion is a member of a class. */
4466 finish_static_assert (tree condition, tree message, location_t location,
4469 if (check_for_bare_parameter_packs (condition))
4470 condition = error_mark_node;
4472 if (type_dependent_expression_p (condition)
4473 || value_dependent_expression_p (condition))
4475 /* We're in a template; build a STATIC_ASSERT and put it in
4479 assertion = make_node (STATIC_ASSERT);
4480 STATIC_ASSERT_CONDITION (assertion) = condition;
4481 STATIC_ASSERT_MESSAGE (assertion) = message;
4482 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4485 maybe_add_class_template_decl_list (current_class_type,
4489 add_stmt (assertion);
4494 /* Fold the expression and convert it to a boolean value. */
4495 condition = fold_non_dependent_expr (condition);
4496 condition = cp_convert (boolean_type_node, condition);
4498 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4499 /* Do nothing; the condition is satisfied. */
4503 location_t saved_loc = input_location;
4505 input_location = location;
4506 if (TREE_CODE (condition) == INTEGER_CST
4507 && integer_zerop (condition))
4508 /* Report the error. */
4509 error ("static assertion failed: %E", message);
4510 else if (condition && condition != error_mark_node)
4511 error ("non-constant condition for static assertion");
4512 input_location = saved_loc;
4516 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4517 just return the type even though EXPR is a type-dependent expression.
4518 The ABI specifies which cases this applies to, which is a subset of the
4522 describable_type (tree expr)
4524 tree type = NULL_TREE;
4526 /* processing_template_decl isn't set when we're called from the mangling
4527 code, so bump it now. */
4528 ++processing_template_decl;
4529 if (! type_dependent_expression_p (expr)
4530 && ! type_unknown_p (expr))
4532 type = TREE_TYPE (expr);
4533 if (real_lvalue_p (expr))
4534 type = build_reference_type (type);
4536 --processing_template_decl;
4541 switch (TREE_CODE (expr))
4547 /* Named rvalue reference becomes lvalue. */
4548 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4553 case TEMPLATE_PARM_INDEX:
4555 case STATIC_CAST_EXPR:
4556 case REINTERPRET_CAST_EXPR:
4557 case CONST_CAST_EXPR:
4558 case DYNAMIC_CAST_EXPR:
4559 type = TREE_TYPE (expr);
4564 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4565 if (ptrtype && POINTER_TYPE_P (ptrtype))
4566 type = build_reference_type (TREE_TYPE (ptrtype));
4571 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4572 type = TREE_TYPE (expr);
4576 if (type && type_uses_auto (type))
4582 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4583 suitable for use as a type-specifier.
4585 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4586 id-expression or a class member access, FALSE when it was parsed as
4587 a full expression. */
4590 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4592 tree orig_expr = expr;
4593 tree type = NULL_TREE;
4595 if (!expr || error_operand_p (expr))
4596 return error_mark_node;
4599 || TREE_CODE (expr) == TYPE_DECL
4600 || (TREE_CODE (expr) == BIT_NOT_EXPR
4601 && TYPE_P (TREE_OPERAND (expr, 0))))
4603 error ("argument to decltype must be an expression");
4604 return error_mark_node;
4607 if (type_dependent_expression_p (expr))
4609 if (id_expression_or_member_access_p)
4611 switch (TREE_CODE (expr))
4618 case TEMPLATE_PARM_INDEX:
4619 type = TREE_TYPE (expr);
4627 if (type && !type_uses_auto (type))
4630 type = cxx_make_type (DECLTYPE_TYPE);
4631 DECLTYPE_TYPE_EXPR (type) = expr;
4632 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4633 = id_expression_or_member_access_p;
4634 SET_TYPE_STRUCTURAL_EQUALITY (type);
4639 /* The type denoted by decltype(e) is defined as follows: */
4641 if (id_expression_or_member_access_p)
4643 /* If e is an id-expression or a class member access (5.2.5
4644 [expr.ref]), decltype(e) is defined as the type of the entity
4645 named by e. If there is no such entity, or e names a set of
4646 overloaded functions, the program is ill-formed. */
4647 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4648 expr = lookup_name (expr);
4650 if (TREE_CODE (expr) == INDIRECT_REF)
4651 /* This can happen when the expression is, e.g., "a.b". Just
4652 look at the underlying operand. */
4653 expr = TREE_OPERAND (expr, 0);
4655 if (TREE_CODE (expr) == OFFSET_REF
4656 || TREE_CODE (expr) == MEMBER_REF)
4657 /* We're only interested in the field itself. If it is a
4658 BASELINK, we will need to see through it in the next
4660 expr = TREE_OPERAND (expr, 1);
4662 if (TREE_CODE (expr) == BASELINK)
4663 /* See through BASELINK nodes to the underlying functions. */
4664 expr = BASELINK_FUNCTIONS (expr);
4666 if (TREE_CODE (expr) == OVERLOAD)
4668 if (OVL_CHAIN (expr))
4670 error ("%qE refers to a set of overloaded functions", orig_expr);
4671 return error_mark_node;
4674 /* An overload set containing only one function: just look
4675 at that function. */
4676 expr = OVL_FUNCTION (expr);
4679 switch (TREE_CODE (expr))
4682 if (DECL_BIT_FIELD_TYPE (expr))
4684 type = DECL_BIT_FIELD_TYPE (expr);
4687 /* Fall through for fields that aren't bitfields. */
4694 case TEMPLATE_PARM_INDEX:
4695 type = TREE_TYPE (expr);
4699 type = error_mark_node;
4703 type = is_bitfield_expr_with_lowered_type (expr);
4705 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4712 /* We can get here when the id-expression refers to an
4714 type = TREE_TYPE (expr);
4718 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4719 || TREE_CODE (expr) == SCOPE_REF);
4720 error ("argument to decltype must be an expression");
4721 return error_mark_node;
4726 /* Expressions of reference type are sometimes wrapped in
4727 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4728 representation, not part of the language, so we have to look
4730 if (TREE_CODE (expr) == INDIRECT_REF
4731 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4733 expr = TREE_OPERAND (expr, 0);
4735 if (TREE_CODE (expr) == CALL_EXPR)
4737 /* If e is a function call (5.2.2 [expr.call]) or an
4738 invocation of an overloaded operator (parentheses around e
4739 are ignored), decltype(e) is defined as the return type of
4741 tree fndecl = get_callee_fndecl (expr);
4742 if (fndecl && fndecl != error_mark_node)
4743 type = TREE_TYPE (TREE_TYPE (fndecl));
4746 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4747 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4748 || TREE_CODE (target_type) == POINTER_TYPE)
4749 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4750 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4751 type = TREE_TYPE (TREE_TYPE (target_type));
4753 sorry ("unable to determine the declared type of expression %<%E%>",
4759 type = is_bitfield_expr_with_lowered_type (expr);
4762 /* Bitfields are special, because their type encodes the
4763 number of bits they store. If the expression referenced a
4764 bitfield, TYPE now has the declared type of that
4766 type = cp_build_qualified_type (type,
4767 cp_type_quals (TREE_TYPE (expr)));
4769 if (real_lvalue_p (expr))
4770 type = build_reference_type (type);
4774 /* Otherwise, where T is the type of e, if e is an lvalue,
4775 decltype(e) is defined as T&, otherwise decltype(e) is
4777 type = TREE_TYPE (expr);
4778 if (type == error_mark_node)
4779 return error_mark_node;
4780 else if (expr == current_class_ptr)
4781 /* If the expression is just "this", we want the
4782 cv-unqualified pointer for the "this" type. */
4783 type = TYPE_MAIN_VARIANT (type);
4784 else if (real_lvalue_p (expr))
4786 if (TREE_CODE (type) != REFERENCE_TYPE)
4787 type = build_reference_type (type);
4790 type = non_reference (type);
4795 if (!type || type == unknown_type_node)
4797 error ("type of %qE is unknown", expr);
4798 return error_mark_node;
4804 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4805 __has_nothrow_copy, depending on assign_p. */
4808 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4815 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4818 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4820 else if (TYPE_HAS_INIT_REF (type))
4822 /* If construction of the copy constructor was postponed, create
4824 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4825 lazily_declare_fn (sfk_copy_constructor, type);
4826 fns = CLASSTYPE_CONSTRUCTORS (type);
4831 for (; fns; fns = OVL_NEXT (fns))
4833 tree fn = OVL_CURRENT (fns);
4837 if (copy_fn_p (fn) == 0)
4840 else if (copy_fn_p (fn) <= 0)
4843 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4850 /* Actually evaluates the trait. */
4853 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4855 enum tree_code type_code1;
4858 type_code1 = TREE_CODE (type1);
4862 case CPTK_HAS_NOTHROW_ASSIGN:
4863 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4864 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4865 || (CLASS_TYPE_P (type1)
4866 && classtype_has_nothrow_assign_or_copy_p (type1,
4869 case CPTK_HAS_TRIVIAL_ASSIGN:
4870 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4871 && (pod_type_p (type1)
4872 || (CLASS_TYPE_P (type1)
4873 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4875 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4876 type1 = strip_array_types (type1);
4877 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4878 || (CLASS_TYPE_P (type1)
4879 && (t = locate_ctor (type1, NULL))
4880 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4882 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4883 type1 = strip_array_types (type1);
4884 return (pod_type_p (type1)
4885 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4887 case CPTK_HAS_NOTHROW_COPY:
4888 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4889 || (CLASS_TYPE_P (type1)
4890 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4892 case CPTK_HAS_TRIVIAL_COPY:
4893 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4894 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4896 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4897 type1 = strip_array_types (type1);
4898 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4899 || (CLASS_TYPE_P (type1)
4900 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4902 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4903 return (CLASS_TYPE_P (type1)
4904 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4906 case CPTK_IS_ABSTRACT:
4907 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4909 case CPTK_IS_BASE_OF:
4910 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4911 && DERIVED_FROM_P (type1, type2));
4914 return (NON_UNION_CLASS_TYPE_P (type1));
4916 case CPTK_IS_CONVERTIBLE_TO:
4921 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4924 return (type_code1 == ENUMERAL_TYPE);
4927 return (pod_type_p (type1));
4929 case CPTK_IS_POLYMORPHIC:
4930 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4933 return (type_code1 == UNION_TYPE);
4941 /* Returns true if TYPE is a complete type, an array of unknown bound,
4942 or (possibly cv-qualified) void, returns false otherwise. */
4945 check_trait_type (tree type)
4947 if (COMPLETE_TYPE_P (type))
4950 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
4953 if (VOID_TYPE_P (type))
4959 /* Process a trait expression. */
4962 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4964 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4965 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4966 || kind == CPTK_HAS_NOTHROW_COPY
4967 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4968 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4969 || kind == CPTK_HAS_TRIVIAL_COPY
4970 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4971 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4972 || kind == CPTK_IS_ABSTRACT
4973 || kind == CPTK_IS_BASE_OF
4974 || kind == CPTK_IS_CLASS
4975 || kind == CPTK_IS_CONVERTIBLE_TO
4976 || kind == CPTK_IS_EMPTY
4977 || kind == CPTK_IS_ENUM
4978 || kind == CPTK_IS_POD
4979 || kind == CPTK_IS_POLYMORPHIC
4980 || kind == CPTK_IS_UNION);
4982 if (kind == CPTK_IS_CONVERTIBLE_TO)
4984 sorry ("__is_convertible_to");
4985 return error_mark_node;
4988 if (type1 == error_mark_node
4989 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4990 && type2 == error_mark_node))
4991 return error_mark_node;
4993 if (processing_template_decl)
4995 tree trait_expr = make_node (TRAIT_EXPR);
4996 TREE_TYPE (trait_expr) = boolean_type_node;
4997 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4998 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4999 TRAIT_EXPR_KIND (trait_expr) = kind;
5003 complete_type (type1);
5005 complete_type (type2);
5009 case CPTK_HAS_NOTHROW_ASSIGN:
5010 case CPTK_HAS_TRIVIAL_ASSIGN:
5011 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5012 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5013 case CPTK_HAS_NOTHROW_COPY:
5014 case CPTK_HAS_TRIVIAL_COPY:
5015 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5016 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5017 case CPTK_IS_ABSTRACT:
5020 case CPTK_IS_POLYMORPHIC:
5021 if (!check_trait_type (type1))
5023 error ("incomplete type %qT not allowed", type1);
5024 return error_mark_node;
5028 case CPTK_IS_BASE_OF:
5029 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5030 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5031 && !COMPLETE_TYPE_P (type2))
5033 error ("incomplete type %qT not allowed", type2);
5034 return error_mark_node;
5043 case CPTK_IS_CONVERTIBLE_TO:
5048 return (trait_expr_value (kind, type1, type2)
5049 ? boolean_true_node : boolean_false_node);
5052 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5053 which is ignored for C++. */
5056 set_float_const_decimal64 (void)
5061 clear_float_const_decimal64 (void)
5066 float_const_decimal64_p (void)
5071 #include "gt-cp-semantics.h"