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 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 deferred_access GTY(())
113 /* A VEC representing name-lookups for which we have deferred
114 checking access controls. We cannot check the accessibility of
115 names used in a decl-specifier-seq until we know what is being
116 declared because code like:
123 A::B* A::f() { return 0; }
125 is valid, even though `A::B' is not generally accessible. */
126 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
128 /* The current mode of access checks. */
129 enum deferring_kind deferring_access_checks_kind;
132 DEF_VEC_O (deferred_access);
133 DEF_VEC_ALLOC_O (deferred_access,gc);
135 /* Data for deferred access checking. */
136 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
137 static GTY(()) unsigned deferred_access_no_check;
139 /* Save the current deferred access states and start deferred
140 access checking iff DEFER_P is true. */
143 push_deferring_access_checks (deferring_kind deferring)
145 /* For context like template instantiation, access checking
146 disabling applies to all nested context. */
147 if (deferred_access_no_check || deferring == dk_no_check)
148 deferred_access_no_check++;
151 deferred_access *ptr;
153 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
154 ptr->deferred_access_checks = NULL;
155 ptr->deferring_access_checks_kind = deferring;
159 /* Resume deferring access checks again after we stopped doing
163 resume_deferring_access_checks (void)
165 if (!deferred_access_no_check)
166 VEC_last (deferred_access, deferred_access_stack)
167 ->deferring_access_checks_kind = dk_deferred;
170 /* Stop deferring access checks. */
173 stop_deferring_access_checks (void)
175 if (!deferred_access_no_check)
176 VEC_last (deferred_access, deferred_access_stack)
177 ->deferring_access_checks_kind = dk_no_deferred;
180 /* Discard the current deferred access checks and restore the
184 pop_deferring_access_checks (void)
186 if (deferred_access_no_check)
187 deferred_access_no_check--;
189 VEC_pop (deferred_access, deferred_access_stack);
192 /* Returns a TREE_LIST representing the deferred checks.
193 The TREE_PURPOSE of each node is the type through which the
194 access occurred; the TREE_VALUE is the declaration named.
197 VEC (deferred_access_check,gc)*
198 get_deferred_access_checks (void)
200 if (deferred_access_no_check)
203 return (VEC_last (deferred_access, deferred_access_stack)
204 ->deferred_access_checks);
207 /* Take current deferred checks and combine with the
208 previous states if we also defer checks previously.
209 Otherwise perform checks now. */
212 pop_to_parent_deferring_access_checks (void)
214 if (deferred_access_no_check)
215 deferred_access_no_check--;
218 VEC (deferred_access_check,gc) *checks;
219 deferred_access *ptr;
221 checks = (VEC_last (deferred_access, deferred_access_stack)
222 ->deferred_access_checks);
224 VEC_pop (deferred_access, deferred_access_stack);
225 ptr = VEC_last (deferred_access, deferred_access_stack);
226 if (ptr->deferring_access_checks_kind == dk_no_deferred)
229 perform_access_checks (checks);
233 /* Merge with parent. */
235 deferred_access_check *chk, *probe;
238 VEC_iterate (deferred_access_check, checks, i, chk) ;
242 VEC_iterate (deferred_access_check,
243 ptr->deferred_access_checks, j, probe) ;
246 if (probe->binfo == chk->binfo &&
247 probe->decl == chk->decl &&
248 probe->diag_decl == chk->diag_decl)
251 /* Insert into parent's checks. */
252 VEC_safe_push (deferred_access_check, gc,
253 ptr->deferred_access_checks, chk);
260 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
261 is the BINFO indicating the qualifying scope used to access the
262 DECL node stored in the TREE_VALUE of the node. */
265 perform_access_checks (VEC (deferred_access_check,gc)* checks)
268 deferred_access_check *chk;
273 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
274 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
277 /* Perform the deferred access checks.
279 After performing the checks, we still have to keep the list
280 `deferred_access_stack->deferred_access_checks' since we may want
281 to check access for them again later in a different context.
288 A::X A::a, x; // No error for `A::a', error for `x'
290 We have to perform deferred access of `A::X', first with `A::a',
294 perform_deferred_access_checks (void)
296 perform_access_checks (get_deferred_access_checks ());
299 /* Defer checking the accessibility of DECL, when looked up in
300 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
303 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
306 deferred_access *ptr;
307 deferred_access_check *chk;
308 deferred_access_check *new_access;
311 /* Exit if we are in a context that no access checking is performed.
313 if (deferred_access_no_check)
316 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
318 ptr = VEC_last (deferred_access, deferred_access_stack);
320 /* If we are not supposed to defer access checks, just check now. */
321 if (ptr->deferring_access_checks_kind == dk_no_deferred)
323 enforce_access (binfo, decl, diag_decl);
327 /* See if we are already going to perform this check. */
329 VEC_iterate (deferred_access_check,
330 ptr->deferred_access_checks, i, chk) ;
333 if (chk->decl == decl && chk->binfo == binfo &&
334 chk->diag_decl == diag_decl)
339 /* If not, record the check. */
341 VEC_safe_push (deferred_access_check, gc,
342 ptr->deferred_access_checks, 0);
343 new_access->binfo = binfo;
344 new_access->decl = decl;
345 new_access->diag_decl = diag_decl;
348 /* Returns nonzero if the current statement is a full expression,
349 i.e. temporaries created during that statement should be destroyed
350 at the end of the statement. */
353 stmts_are_full_exprs_p (void)
355 return current_stmt_tree ()->stmts_are_full_exprs_p;
358 /* T is a statement. Add it to the statement-tree. This is the C++
359 version. The C/ObjC frontends have a slightly different version of
365 enum tree_code code = TREE_CODE (t);
367 if (EXPR_P (t) && code != LABEL_EXPR)
369 if (!EXPR_HAS_LOCATION (t))
370 SET_EXPR_LOCATION (t, input_location);
372 /* When we expand a statement-tree, we must know whether or not the
373 statements are full-expressions. We record that fact here. */
374 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
377 /* Add T to the statement-tree. Non-side-effect statements need to be
378 recorded during statement expressions. */
379 append_to_statement_list_force (t, &cur_stmt_list);
384 /* Returns the stmt_tree to which statements are currently being added. */
387 current_stmt_tree (void)
390 ? &cfun->language->base.x_stmt_tree
391 : &scope_chain->x_stmt_tree);
394 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
397 maybe_cleanup_point_expr (tree expr)
399 if (!processing_template_decl && stmts_are_full_exprs_p ())
400 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
404 /* Like maybe_cleanup_point_expr except have the type of the new expression be
405 void so we don't need to create a temporary variable to hold the inner
406 expression. The reason why we do this is because the original type might be
407 an aggregate and we cannot create a temporary variable for that type. */
410 maybe_cleanup_point_expr_void (tree expr)
412 if (!processing_template_decl && stmts_are_full_exprs_p ())
413 expr = fold_build_cleanup_point_expr (void_type_node, expr);
419 /* Create a declaration statement for the declaration given by the DECL. */
422 add_decl_expr (tree decl)
424 tree r = build_stmt (DECL_EXPR, decl);
425 if (DECL_INITIAL (decl)
426 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
427 r = maybe_cleanup_point_expr_void (r);
431 /* Finish a scope. */
434 do_poplevel (tree stmt_list)
438 if (stmts_are_full_exprs_p ())
439 block = poplevel (kept_level_p (), 1, 0);
441 stmt_list = pop_stmt_list (stmt_list);
443 if (!processing_template_decl)
445 stmt_list = c_build_bind_expr (block, stmt_list);
446 /* ??? See c_end_compound_stmt re statement expressions. */
452 /* Begin a new scope. */
455 do_pushlevel (scope_kind sk)
457 tree ret = push_stmt_list ();
458 if (stmts_are_full_exprs_p ())
459 begin_scope (sk, NULL);
463 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
464 when the current scope is exited. EH_ONLY is true when this is not
465 meant to apply to normal control flow transfer. */
468 push_cleanup (tree decl, tree cleanup, bool eh_only)
470 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
471 CLEANUP_EH_ONLY (stmt) = eh_only;
473 CLEANUP_BODY (stmt) = push_stmt_list ();
476 /* Begin a conditional that might contain a declaration. When generating
477 normal code, we want the declaration to appear before the statement
478 containing the conditional. When generating template code, we want the
479 conditional to be rendered as the raw DECL_EXPR. */
482 begin_cond (tree *cond_p)
484 if (processing_template_decl)
485 *cond_p = push_stmt_list ();
488 /* Finish such a conditional. */
491 finish_cond (tree *cond_p, tree expr)
493 if (processing_template_decl)
495 tree cond = pop_stmt_list (*cond_p);
496 if (TREE_CODE (cond) == DECL_EXPR)
499 if (check_for_bare_parameter_packs (expr))
500 *cond_p = error_mark_node;
505 /* If *COND_P specifies a conditional with a declaration, transform the
508 for (; A x = 42;) { }
510 while (true) { A x = 42; if (!x) break; }
511 for (;;) { A x = 42; if (!x) break; }
512 The statement list for BODY will be empty if the conditional did
513 not declare anything. */
516 simplify_loop_decl_cond (tree *cond_p, tree body)
520 if (!TREE_SIDE_EFFECTS (body))
524 *cond_p = boolean_true_node;
526 if_stmt = begin_if_stmt ();
527 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
528 finish_if_stmt_cond (cond, if_stmt);
529 finish_break_stmt ();
530 finish_then_clause (if_stmt);
531 finish_if_stmt (if_stmt);
534 /* Finish a goto-statement. */
537 finish_goto_stmt (tree destination)
539 if (TREE_CODE (destination) == IDENTIFIER_NODE)
540 destination = lookup_label (destination);
542 /* We warn about unused labels with -Wunused. That means we have to
543 mark the used labels as used. */
544 if (TREE_CODE (destination) == LABEL_DECL)
545 TREE_USED (destination) = 1;
548 /* The DESTINATION is being used as an rvalue. */
549 if (!processing_template_decl)
551 destination = decay_conversion (destination);
552 destination = cp_convert (ptr_type_node, destination);
553 if (error_operand_p (destination))
556 /* We don't inline calls to functions with computed gotos.
557 Those functions are typically up to some funny business,
558 and may be depending on the labels being at particular
559 addresses, or some such. */
560 DECL_UNINLINABLE (current_function_decl) = 1;
563 check_goto (destination);
565 return add_stmt (build_stmt (GOTO_EXPR, destination));
568 /* COND is the condition-expression for an if, while, etc.,
569 statement. Convert it to a boolean value, if appropriate.
570 In addition, verify sequence points if -Wsequence-point is enabled. */
573 maybe_convert_cond (tree cond)
575 /* Empty conditions remain empty. */
579 /* Wait until we instantiate templates before doing conversion. */
580 if (processing_template_decl)
583 if (warn_sequence_point)
584 verify_sequence_points (cond);
586 /* Do the conversion. */
587 cond = convert_from_reference (cond);
589 if (TREE_CODE (cond) == MODIFY_EXPR
590 && !TREE_NO_WARNING (cond)
593 warning (OPT_Wparentheses,
594 "suggest parentheses around assignment used as truth value");
595 TREE_NO_WARNING (cond) = 1;
598 return condition_conversion (cond);
601 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
604 finish_expr_stmt (tree expr)
608 if (expr != NULL_TREE)
610 if (!processing_template_decl)
612 if (warn_sequence_point)
613 verify_sequence_points (expr);
614 expr = convert_to_void (expr, "statement", tf_warning_or_error);
616 else if (!type_dependent_expression_p (expr))
617 convert_to_void (build_non_dependent_expr (expr), "statement",
618 tf_warning_or_error);
620 if (check_for_bare_parameter_packs (expr))
621 expr = error_mark_node;
623 /* Simplification of inner statement expressions, compound exprs,
624 etc can result in us already having an EXPR_STMT. */
625 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
627 if (TREE_CODE (expr) != EXPR_STMT)
628 expr = build_stmt (EXPR_STMT, expr);
629 expr = maybe_cleanup_point_expr_void (expr);
641 /* Begin an if-statement. Returns a newly created IF_STMT if
648 scope = do_pushlevel (sk_block);
649 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
650 TREE_CHAIN (r) = scope;
651 begin_cond (&IF_COND (r));
655 /* Process the COND of an if-statement, which may be given by
659 finish_if_stmt_cond (tree cond, tree if_stmt)
661 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
663 THEN_CLAUSE (if_stmt) = push_stmt_list ();
666 /* Finish the then-clause of an if-statement, which may be given by
670 finish_then_clause (tree if_stmt)
672 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
676 /* Begin the else-clause of an if-statement. */
679 begin_else_clause (tree if_stmt)
681 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
684 /* Finish the else-clause of an if-statement, which may be given by
688 finish_else_clause (tree if_stmt)
690 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
693 /* Finish an if-statement. */
696 finish_if_stmt (tree if_stmt)
698 tree scope = TREE_CHAIN (if_stmt);
699 TREE_CHAIN (if_stmt) = NULL;
700 add_stmt (do_poplevel (scope));
704 /* Begin a while-statement. Returns a newly created WHILE_STMT if
708 begin_while_stmt (void)
711 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
713 WHILE_BODY (r) = do_pushlevel (sk_block);
714 begin_cond (&WHILE_COND (r));
718 /* Process the COND of a while-statement, which may be given by
722 finish_while_stmt_cond (tree cond, tree while_stmt)
724 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
725 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
728 /* Finish a while-statement, which may be given by WHILE_STMT. */
731 finish_while_stmt (tree while_stmt)
733 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
737 /* Begin a do-statement. Returns a newly created DO_STMT if
743 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
745 DO_BODY (r) = push_stmt_list ();
749 /* Finish the body of a do-statement, which may be given by DO_STMT. */
752 finish_do_body (tree do_stmt)
754 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
756 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
757 body = STATEMENT_LIST_TAIL (body)->stmt;
759 if (IS_EMPTY_STMT (body))
760 warning (OPT_Wempty_body,
761 "suggest explicit braces around empty body in %<do%> statement");
764 /* Finish a do-statement, which may be given by DO_STMT, and whose
765 COND is as indicated. */
768 finish_do_stmt (tree cond, tree do_stmt)
770 cond = maybe_convert_cond (cond);
771 DO_COND (do_stmt) = cond;
775 /* Finish a return-statement. The EXPRESSION returned, if any, is as
779 finish_return_stmt (tree expr)
784 expr = check_return_expr (expr, &no_warning);
786 if (flag_openmp && !check_omp_return ())
787 return error_mark_node;
788 if (!processing_template_decl)
790 if (warn_sequence_point)
791 verify_sequence_points (expr);
793 if (DECL_DESTRUCTOR_P (current_function_decl)
794 || (DECL_CONSTRUCTOR_P (current_function_decl)
795 && targetm.cxx.cdtor_returns_this ()))
797 /* Similarly, all destructors must run destructors for
798 base-classes before returning. So, all returns in a
799 destructor get sent to the DTOR_LABEL; finish_function emits
800 code to return a value there. */
801 return finish_goto_stmt (cdtor_label);
805 r = build_stmt (RETURN_EXPR, expr);
806 TREE_NO_WARNING (r) |= no_warning;
807 r = maybe_cleanup_point_expr_void (r);
814 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
817 begin_for_stmt (void)
821 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
822 NULL_TREE, NULL_TREE);
824 if (flag_new_for_scope > 0)
825 TREE_CHAIN (r) = do_pushlevel (sk_for);
827 if (processing_template_decl)
828 FOR_INIT_STMT (r) = push_stmt_list ();
833 /* Finish the for-init-statement of a for-statement, which may be
834 given by FOR_STMT. */
837 finish_for_init_stmt (tree for_stmt)
839 if (processing_template_decl)
840 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
842 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
843 begin_cond (&FOR_COND (for_stmt));
846 /* Finish the COND of a for-statement, which may be given by
850 finish_for_cond (tree cond, tree for_stmt)
852 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
853 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
856 /* Finish the increment-EXPRESSION in a for-statement, which may be
857 given by FOR_STMT. */
860 finish_for_expr (tree expr, tree for_stmt)
864 /* If EXPR is an overloaded function, issue an error; there is no
865 context available to use to perform overload resolution. */
866 if (type_unknown_p (expr))
868 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
869 expr = error_mark_node;
871 if (!processing_template_decl)
873 if (warn_sequence_point)
874 verify_sequence_points (expr);
875 expr = convert_to_void (expr, "3rd expression in for",
876 tf_warning_or_error);
878 else if (!type_dependent_expression_p (expr))
879 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for",
880 tf_warning_or_error);
881 expr = maybe_cleanup_point_expr_void (expr);
882 if (check_for_bare_parameter_packs (expr))
883 expr = error_mark_node;
884 FOR_EXPR (for_stmt) = expr;
887 /* Finish the body of a for-statement, which may be given by
888 FOR_STMT. The increment-EXPR for the loop must be
892 finish_for_stmt (tree for_stmt)
894 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
896 /* Pop the scope for the body of the loop. */
897 if (flag_new_for_scope > 0)
899 tree scope = TREE_CHAIN (for_stmt);
900 TREE_CHAIN (for_stmt) = NULL;
901 add_stmt (do_poplevel (scope));
907 /* Finish a break-statement. */
910 finish_break_stmt (void)
912 return add_stmt (build_stmt (BREAK_STMT));
915 /* Finish a continue-statement. */
918 finish_continue_stmt (void)
920 return add_stmt (build_stmt (CONTINUE_STMT));
923 /* Begin a switch-statement. Returns a new SWITCH_STMT if
927 begin_switch_stmt (void)
931 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
933 scope = do_pushlevel (sk_block);
934 TREE_CHAIN (r) = scope;
935 begin_cond (&SWITCH_STMT_COND (r));
940 /* Finish the cond of a switch-statement. */
943 finish_switch_cond (tree cond, tree switch_stmt)
945 tree orig_type = NULL;
946 if (!processing_template_decl)
950 /* Convert the condition to an integer or enumeration type. */
951 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
952 if (cond == NULL_TREE)
954 error ("switch quantity not an integer");
955 cond = error_mark_node;
957 orig_type = TREE_TYPE (cond);
958 if (cond != error_mark_node)
962 Integral promotions are performed. */
963 cond = perform_integral_promotions (cond);
964 cond = maybe_cleanup_point_expr (cond);
967 if (cond != error_mark_node)
969 index = get_unwidened (cond, NULL_TREE);
970 /* We can't strip a conversion from a signed type to an unsigned,
971 because if we did, int_fits_type_p would do the wrong thing
972 when checking case values for being in range,
973 and it's too hard to do the right thing. */
974 if (TYPE_UNSIGNED (TREE_TYPE (cond))
975 == TYPE_UNSIGNED (TREE_TYPE (index)))
979 if (check_for_bare_parameter_packs (cond))
980 cond = error_mark_node;
981 else if (!processing_template_decl && warn_sequence_point)
982 verify_sequence_points (cond);
984 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
985 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
986 add_stmt (switch_stmt);
987 push_switch (switch_stmt);
988 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
991 /* Finish the body of a switch-statement, which may be given by
992 SWITCH_STMT. The COND to switch on is indicated. */
995 finish_switch_stmt (tree switch_stmt)
999 SWITCH_STMT_BODY (switch_stmt) =
1000 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1004 scope = TREE_CHAIN (switch_stmt);
1005 TREE_CHAIN (switch_stmt) = NULL;
1006 add_stmt (do_poplevel (scope));
1009 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1013 begin_try_block (void)
1015 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
1017 TRY_STMTS (r) = push_stmt_list ();
1021 /* Likewise, for a function-try-block. The block returned in
1022 *COMPOUND_STMT is an artificial outer scope, containing the
1023 function-try-block. */
1026 begin_function_try_block (tree *compound_stmt)
1029 /* This outer scope does not exist in the C++ standard, but we need
1030 a place to put __FUNCTION__ and similar variables. */
1031 *compound_stmt = begin_compound_stmt (0);
1032 r = begin_try_block ();
1033 FN_TRY_BLOCK_P (r) = 1;
1037 /* Finish a try-block, which may be given by TRY_BLOCK. */
1040 finish_try_block (tree try_block)
1042 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1043 TRY_HANDLERS (try_block) = push_stmt_list ();
1046 /* Finish the body of a cleanup try-block, which may be given by
1050 finish_cleanup_try_block (tree try_block)
1052 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1055 /* Finish an implicitly generated try-block, with a cleanup is given
1059 finish_cleanup (tree cleanup, tree try_block)
1061 TRY_HANDLERS (try_block) = cleanup;
1062 CLEANUP_P (try_block) = 1;
1065 /* Likewise, for a function-try-block. */
1068 finish_function_try_block (tree try_block)
1070 finish_try_block (try_block);
1071 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1072 the try block, but moving it inside. */
1073 in_function_try_handler = 1;
1076 /* Finish a handler-sequence for a try-block, which may be given by
1080 finish_handler_sequence (tree try_block)
1082 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1083 check_handlers (TRY_HANDLERS (try_block));
1086 /* Finish the handler-seq for a function-try-block, given by
1087 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1088 begin_function_try_block. */
1091 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1093 in_function_try_handler = 0;
1094 finish_handler_sequence (try_block);
1095 finish_compound_stmt (compound_stmt);
1098 /* Begin a handler. Returns a HANDLER if appropriate. */
1101 begin_handler (void)
1105 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1108 /* Create a binding level for the eh_info and the exception object
1110 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1115 /* Finish the handler-parameters for a handler, which may be given by
1116 HANDLER. DECL is the declaration for the catch parameter, or NULL
1117 if this is a `catch (...)' clause. */
1120 finish_handler_parms (tree decl, tree handler)
1122 tree type = NULL_TREE;
1123 if (processing_template_decl)
1127 decl = pushdecl (decl);
1128 decl = push_template_decl (decl);
1129 HANDLER_PARMS (handler) = decl;
1130 type = TREE_TYPE (decl);
1134 type = expand_start_catch_block (decl);
1135 HANDLER_TYPE (handler) = type;
1136 if (!processing_template_decl && type)
1137 mark_used (eh_type_info (type));
1140 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1141 the return value from the matching call to finish_handler_parms. */
1144 finish_handler (tree handler)
1146 if (!processing_template_decl)
1147 expand_end_catch_block ();
1148 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1151 /* Begin a compound statement. FLAGS contains some bits that control the
1152 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1153 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1154 block of a function. If BCS_TRY_BLOCK is set, this is the block
1155 created on behalf of a TRY statement. Returns a token to be passed to
1156 finish_compound_stmt. */
1159 begin_compound_stmt (unsigned int flags)
1163 if (flags & BCS_NO_SCOPE)
1165 r = push_stmt_list ();
1166 STATEMENT_LIST_NO_SCOPE (r) = 1;
1168 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1169 But, if it's a statement-expression with a scopeless block, there's
1170 nothing to keep, and we don't want to accidentally keep a block
1171 *inside* the scopeless block. */
1172 keep_next_level (false);
1175 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1177 /* When processing a template, we need to remember where the braces were,
1178 so that we can set up identical scopes when instantiating the template
1179 later. BIND_EXPR is a handy candidate for this.
1180 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1181 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1182 processing templates. */
1183 if (processing_template_decl)
1185 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1186 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1187 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1188 TREE_SIDE_EFFECTS (r) = 1;
1194 /* Finish a compound-statement, which is given by STMT. */
1197 finish_compound_stmt (tree stmt)
1199 if (TREE_CODE (stmt) == BIND_EXPR)
1200 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1201 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1202 stmt = pop_stmt_list (stmt);
1205 /* Destroy any ObjC "super" receivers that may have been
1207 objc_clear_super_receiver ();
1209 stmt = do_poplevel (stmt);
1212 /* ??? See c_end_compound_stmt wrt statement expressions. */
1217 /* Finish an asm-statement, whose components are a STRING, some
1218 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1219 whether the asm-statement should be considered volatile. */
1222 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1223 tree input_operands, tree clobbers)
1227 int ninputs = list_length (input_operands);
1228 int noutputs = list_length (output_operands);
1230 if (!processing_template_decl)
1232 const char *constraint;
1233 const char **oconstraints;
1234 bool allows_mem, allows_reg, is_inout;
1238 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1240 string = resolve_asm_operand_names (string, output_operands,
1243 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1245 operand = TREE_VALUE (t);
1247 /* ??? Really, this should not be here. Users should be using a
1248 proper lvalue, dammit. But there's a long history of using
1249 casts in the output operands. In cases like longlong.h, this
1250 becomes a primitive form of typechecking -- if the cast can be
1251 removed, then the output operand had a type of the proper width;
1252 otherwise we'll get an error. Gross, but ... */
1253 STRIP_NOPS (operand);
1255 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1256 operand = error_mark_node;
1258 if (operand != error_mark_node
1259 && (TREE_READONLY (operand)
1260 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1261 /* Functions are not modifiable, even though they are
1263 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1264 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1265 /* If it's an aggregate and any field is const, then it is
1266 effectively const. */
1267 || (CLASS_TYPE_P (TREE_TYPE (operand))
1268 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1269 readonly_error (operand, "assignment (via 'asm' output)");
1271 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1272 oconstraints[i] = constraint;
1274 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1275 &allows_mem, &allows_reg, &is_inout))
1277 /* If the operand is going to end up in memory,
1278 mark it addressable. */
1279 if (!allows_reg && !cxx_mark_addressable (operand))
1280 operand = error_mark_node;
1283 operand = error_mark_node;
1285 TREE_VALUE (t) = operand;
1288 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1290 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1291 operand = decay_conversion (TREE_VALUE (t));
1293 /* If the type of the operand hasn't been determined (e.g.,
1294 because it involves an overloaded function), then issue
1295 an error message. There's no context available to
1296 resolve the overloading. */
1297 if (TREE_TYPE (operand) == unknown_type_node)
1299 error ("type of asm operand %qE could not be determined",
1301 operand = error_mark_node;
1304 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1305 oconstraints, &allows_mem, &allows_reg))
1307 /* If the operand is going to end up in memory,
1308 mark it addressable. */
1309 if (!allows_reg && allows_mem)
1311 /* Strip the nops as we allow this case. FIXME, this really
1312 should be rejected or made deprecated. */
1313 STRIP_NOPS (operand);
1314 if (!cxx_mark_addressable (operand))
1315 operand = error_mark_node;
1319 operand = error_mark_node;
1321 TREE_VALUE (t) = operand;
1325 r = build_stmt (ASM_EXPR, string,
1326 output_operands, input_operands,
1328 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1329 r = maybe_cleanup_point_expr_void (r);
1330 return add_stmt (r);
1333 /* Finish a label with the indicated NAME. */
1336 finish_label_stmt (tree name)
1338 tree decl = define_label (input_location, name);
1340 if (decl == error_mark_node)
1341 return error_mark_node;
1343 return add_stmt (build_stmt (LABEL_EXPR, decl));
1346 /* Finish a series of declarations for local labels. G++ allows users
1347 to declare "local" labels, i.e., labels with scope. This extension
1348 is useful when writing code involving statement-expressions. */
1351 finish_label_decl (tree name)
1353 if (!at_function_scope_p ())
1355 error ("__label__ declarations are only allowed in function scopes");
1359 add_decl_expr (declare_local_label (name));
1362 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1365 finish_decl_cleanup (tree decl, tree cleanup)
1367 push_cleanup (decl, cleanup, false);
1370 /* If the current scope exits with an exception, run CLEANUP. */
1373 finish_eh_cleanup (tree cleanup)
1375 push_cleanup (NULL, cleanup, true);
1378 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1379 order they were written by the user. Each node is as for
1380 emit_mem_initializers. */
1383 finish_mem_initializers (tree mem_inits)
1385 /* Reorder the MEM_INITS so that they are in the order they appeared
1386 in the source program. */
1387 mem_inits = nreverse (mem_inits);
1389 if (processing_template_decl)
1393 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1395 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1396 check for bare parameter packs in the TREE_VALUE, because
1397 any parameter packs in the TREE_VALUE have already been
1398 bound as part of the TREE_PURPOSE. See
1399 make_pack_expansion for more information. */
1400 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1401 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1402 TREE_VALUE (mem) = error_mark_node;
1405 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1408 emit_mem_initializers (mem_inits);
1411 /* Finish a parenthesized expression EXPR. */
1414 finish_parenthesized_expr (tree expr)
1417 /* This inhibits warnings in c_common_truthvalue_conversion. */
1418 TREE_NO_WARNING (expr) = 1;
1420 if (TREE_CODE (expr) == OFFSET_REF)
1421 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1422 enclosed in parentheses. */
1423 PTRMEM_OK_P (expr) = 0;
1425 if (TREE_CODE (expr) == STRING_CST)
1426 PAREN_STRING_LITERAL_P (expr) = 1;
1431 /* Finish a reference to a non-static data member (DECL) that is not
1432 preceded by `.' or `->'. */
1435 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1437 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1441 if (current_function_decl
1442 && DECL_STATIC_FUNCTION_P (current_function_decl))
1443 error ("invalid use of member %q+D in static member function", decl);
1445 error ("invalid use of non-static data member %q+D", decl);
1446 error ("from this location");
1448 return error_mark_node;
1450 TREE_USED (current_class_ptr) = 1;
1451 if (processing_template_decl && !qualifying_scope)
1453 tree type = TREE_TYPE (decl);
1455 if (TREE_CODE (type) == REFERENCE_TYPE)
1456 type = TREE_TYPE (type);
1459 /* Set the cv qualifiers. */
1460 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1462 if (DECL_MUTABLE_P (decl))
1463 quals &= ~TYPE_QUAL_CONST;
1465 quals |= cp_type_quals (TREE_TYPE (decl));
1466 type = cp_build_qualified_type (type, quals);
1469 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1473 tree access_type = TREE_TYPE (object);
1474 tree lookup_context = context_for_name_lookup (decl);
1476 while (!DERIVED_FROM_P (lookup_context, access_type))
1478 access_type = TYPE_CONTEXT (access_type);
1479 while (access_type && DECL_P (access_type))
1480 access_type = DECL_CONTEXT (access_type);
1484 error ("object missing in reference to %q+D", decl);
1485 error ("from this location");
1486 return error_mark_node;
1490 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1491 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1493 if (processing_template_decl)
1494 return build_qualified_name (TREE_TYPE (decl),
1497 /*template_p=*/false);
1499 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1502 /* If the data member was named `C::M', convert `*this' to `C'
1504 if (qualifying_scope)
1506 tree binfo = NULL_TREE;
1507 object = build_scoped_ref (object, qualifying_scope,
1511 return build_class_member_access_expr (object, decl,
1512 /*access_path=*/NULL_TREE,
1513 /*preserve_reference=*/false,
1514 tf_warning_or_error);
1518 /* DECL was the declaration to which a qualified-id resolved. Issue
1519 an error message if it is not accessible. If OBJECT_TYPE is
1520 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1521 type of `*x', or `x', respectively. If the DECL was named as
1522 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1525 check_accessibility_of_qualified_id (tree decl,
1527 tree nested_name_specifier)
1530 tree qualifying_type = NULL_TREE;
1532 /* If we are parsing a template declaration and if decl is a typedef,
1533 add it to a list tied to the template.
1534 At template instantiation time, that list will be walked and
1535 access check performed. */
1536 if (is_typedef_decl (decl))
1538 /* This the scope through which type_decl is accessed.
1539 It will be useful information later to do access check for
1541 tree scope = nested_name_specifier ? nested_name_specifier : 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 the current
1669 if (!shared_member_p (fns)
1670 && current_class_type
1671 && DERIVED_FROM_P (qualifying_class, current_class_type))
1672 expr = (build_class_member_access_expr
1673 (maybe_dummy_object (qualifying_class, NULL),
1675 BASELINK_ACCESS_BINFO (expr),
1676 /*preserve_reference=*/false,
1677 tf_warning_or_error));
1679 /* The expression is a qualified name whose address is not
1681 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1687 /* Begin a statement-expression. The value returned must be passed to
1688 finish_stmt_expr. */
1691 begin_stmt_expr (void)
1693 return push_stmt_list ();
1696 /* Process the final expression of a statement expression. EXPR can be
1697 NULL, if the final expression is empty. Return a STATEMENT_LIST
1698 containing all the statements in the statement-expression, or
1699 ERROR_MARK_NODE if there was an error. */
1702 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1704 if (error_operand_p (expr))
1706 /* The type of the statement-expression is the type of the last
1708 TREE_TYPE (stmt_expr) = error_mark_node;
1709 return error_mark_node;
1712 /* If the last statement does not have "void" type, then the value
1713 of the last statement is the value of the entire expression. */
1716 tree type = TREE_TYPE (expr);
1718 if (processing_template_decl)
1720 expr = build_stmt (EXPR_STMT, expr);
1721 expr = add_stmt (expr);
1722 /* Mark the last statement so that we can recognize it as such at
1723 template-instantiation time. */
1724 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1726 else if (VOID_TYPE_P (type))
1728 /* Just treat this like an ordinary statement. */
1729 expr = finish_expr_stmt (expr);
1733 /* It actually has a value we need to deal with. First, force it
1734 to be an rvalue so that we won't need to build up a copy
1735 constructor call later when we try to assign it to something. */
1736 expr = force_rvalue (expr);
1737 if (error_operand_p (expr))
1738 return error_mark_node;
1740 /* Update for array-to-pointer decay. */
1741 type = TREE_TYPE (expr);
1743 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1744 normal statement, but don't convert to void or actually add
1746 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1747 expr = maybe_cleanup_point_expr (expr);
1751 /* The type of the statement-expression is the type of the last
1753 TREE_TYPE (stmt_expr) = type;
1759 /* Finish a statement-expression. EXPR should be the value returned
1760 by the previous begin_stmt_expr. Returns an expression
1761 representing the statement-expression. */
1764 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1769 if (error_operand_p (stmt_expr))
1771 pop_stmt_list (stmt_expr);
1772 return error_mark_node;
1775 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1777 type = TREE_TYPE (stmt_expr);
1778 result = pop_stmt_list (stmt_expr);
1779 TREE_TYPE (result) = type;
1781 if (processing_template_decl)
1783 result = build_min (STMT_EXPR, type, result);
1784 TREE_SIDE_EFFECTS (result) = 1;
1785 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1787 else if (CLASS_TYPE_P (type))
1789 /* Wrap the statement-expression in a TARGET_EXPR so that the
1790 temporary object created by the final expression is destroyed at
1791 the end of the full-expression containing the
1792 statement-expression. */
1793 result = force_target_expr (type, result);
1799 /* Returns the expression which provides the value of STMT_EXPR. */
1802 stmt_expr_value_expr (tree stmt_expr)
1804 tree t = STMT_EXPR_STMT (stmt_expr);
1806 if (TREE_CODE (t) == BIND_EXPR)
1807 t = BIND_EXPR_BODY (t);
1809 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1810 t = STATEMENT_LIST_TAIL (t)->stmt;
1812 if (TREE_CODE (t) == EXPR_STMT)
1813 t = EXPR_STMT_EXPR (t);
1818 /* Perform Koenig lookup. FN is the postfix-expression representing
1819 the function (or functions) to call; ARGS are the arguments to the
1820 call. Returns the functions to be considered by overload
1824 perform_koenig_lookup (tree fn, tree args)
1826 tree identifier = NULL_TREE;
1827 tree functions = NULL_TREE;
1829 /* Find the name of the overloaded function. */
1830 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1832 else if (is_overloaded_fn (fn))
1835 identifier = DECL_NAME (get_first_fn (functions));
1837 else if (DECL_P (fn))
1840 identifier = DECL_NAME (fn);
1843 /* A call to a namespace-scope function using an unqualified name.
1845 Do Koenig lookup -- unless any of the arguments are
1847 if (!any_type_dependent_arguments_p (args))
1849 fn = lookup_arg_dependent (identifier, functions, args);
1851 /* The unqualified name could not be resolved. */
1852 fn = unqualified_fn_lookup_error (identifier);
1858 /* Generate an expression for `FN (ARGS)'.
1860 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1861 as a virtual call, even if FN is virtual. (This flag is set when
1862 encountering an expression where the function name is explicitly
1863 qualified. For example a call to `X::f' never generates a virtual
1866 Returns code for the call. */
1869 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p,
1870 tsubst_flags_t complain)
1876 if (fn == error_mark_node || args == error_mark_node)
1877 return error_mark_node;
1879 /* ARGS should be a list of arguments. */
1880 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1881 gcc_assert (!TYPE_P (fn));
1886 if (processing_template_decl)
1888 if (type_dependent_expression_p (fn)
1889 || any_type_dependent_arguments_p (args))
1891 result = build_nt_call_list (fn, args);
1892 KOENIG_LOOKUP_P (result) = koenig_p;
1897 tree fndecl = OVL_CURRENT (fn);
1898 if (TREE_CODE (fndecl) != FUNCTION_DECL
1899 || !TREE_THIS_VOLATILE (fndecl))
1905 current_function_returns_abnormally = 1;
1909 if (!BASELINK_P (fn)
1910 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1911 && TREE_TYPE (fn) != unknown_type_node)
1912 fn = build_non_dependent_expr (fn);
1913 args = build_non_dependent_args (orig_args);
1916 if (is_overloaded_fn (fn))
1917 fn = baselink_for_fns (fn);
1920 if (BASELINK_P (fn))
1924 /* A call to a member function. From [over.call.func]:
1926 If the keyword this is in scope and refers to the class of
1927 that member function, or a derived class thereof, then the
1928 function call is transformed into a qualified function call
1929 using (*this) as the postfix-expression to the left of the
1930 . operator.... [Otherwise] a contrived object of type T
1931 becomes the implied object argument.
1933 This paragraph is unclear about this situation:
1935 struct A { void f(); };
1936 struct B : public A {};
1937 struct C : public A { void g() { B::f(); }};
1939 In particular, for `B::f', this paragraph does not make clear
1940 whether "the class of that member function" refers to `A' or
1941 to `B'. We believe it refers to `B'. */
1942 if (current_class_type
1943 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1945 && current_class_ref)
1946 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1950 tree representative_fn;
1952 representative_fn = BASELINK_FUNCTIONS (fn);
1953 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1954 representative_fn = TREE_OPERAND (representative_fn, 0);
1955 representative_fn = get_first_fn (representative_fn);
1956 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1959 if (processing_template_decl)
1961 if (type_dependent_expression_p (object))
1962 return build_nt_call_list (orig_fn, orig_args);
1963 object = build_non_dependent_expr (object);
1966 result = build_new_method_call (object, fn, args, NULL_TREE,
1968 ? LOOKUP_NONVIRTUAL : 0),
1972 else if (is_overloaded_fn (fn))
1974 /* If the function is an overloaded builtin, resolve it. */
1975 if (TREE_CODE (fn) == FUNCTION_DECL
1976 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1977 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1978 result = resolve_overloaded_builtin (fn, args);
1981 /* A call to a namespace-scope function. */
1982 result = build_new_function_call (fn, args, koenig_p, complain);
1984 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1987 error ("arguments to destructor are not allowed");
1988 /* Mark the pseudo-destructor call as having side-effects so
1989 that we do not issue warnings about its use. */
1990 result = build1 (NOP_EXPR,
1992 TREE_OPERAND (fn, 0));
1993 TREE_SIDE_EFFECTS (result) = 1;
1995 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1996 /* If the "function" is really an object of class type, it might
1997 have an overloaded `operator ()'. */
1998 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1999 /*overloaded_p=*/NULL, complain);
2002 /* A call where the function is unknown. */
2003 result = cp_build_function_call (fn, args, complain);
2005 if (processing_template_decl)
2007 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
2008 /* Don't repeat arg-dependent lookup at instantiation time if this call
2009 is not type-dependent. */
2010 KOENIG_LOOKUP_P (result) = 0;
2015 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2016 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2017 POSTDECREMENT_EXPR.) */
2020 finish_increment_expr (tree expr, enum tree_code code)
2022 return build_x_unary_op (code, expr, tf_warning_or_error);
2025 /* Finish a use of `this'. Returns an expression for `this'. */
2028 finish_this_expr (void)
2032 if (current_class_ptr)
2034 result = current_class_ptr;
2036 else if (current_function_decl
2037 && DECL_STATIC_FUNCTION_P (current_function_decl))
2039 error ("%<this%> is unavailable for static member functions");
2040 result = error_mark_node;
2044 if (current_function_decl)
2045 error ("invalid use of %<this%> in non-member function");
2047 error ("invalid use of %<this%> at top level");
2048 result = error_mark_node;
2054 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2055 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2056 the TYPE for the type given. If SCOPE is non-NULL, the expression
2057 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2060 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2062 if (object == error_mark_node || destructor == error_mark_node)
2063 return error_mark_node;
2065 gcc_assert (TYPE_P (destructor));
2067 if (!processing_template_decl)
2069 if (scope == error_mark_node)
2071 error ("invalid qualifying scope in pseudo-destructor name");
2072 return error_mark_node;
2074 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2076 error ("qualified type %qT does not match destructor name ~%qT",
2078 return error_mark_node;
2082 /* [expr.pseudo] says both:
2084 The type designated by the pseudo-destructor-name shall be
2085 the same as the object type.
2089 The cv-unqualified versions of the object type and of the
2090 type designated by the pseudo-destructor-name shall be the
2093 We implement the more generous second sentence, since that is
2094 what most other compilers do. */
2095 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2098 error ("%qE is not of type %qT", object, destructor);
2099 return error_mark_node;
2103 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2106 /* Finish an expression of the form CODE EXPR. */
2109 finish_unary_op_expr (enum tree_code code, tree expr)
2111 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2112 /* Inside a template, build_x_unary_op does not fold the
2113 expression. So check whether the result is folded before
2114 setting TREE_NEGATED_INT. */
2115 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2116 && TREE_CODE (result) == INTEGER_CST
2117 && !TYPE_UNSIGNED (TREE_TYPE (result))
2118 && INT_CST_LT (result, integer_zero_node))
2120 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2121 setting TREE_NEGATED_INT. */
2122 result = copy_node (result);
2123 TREE_NEGATED_INT (result) = 1;
2125 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2126 overflow_warning (result);
2131 /* Finish a compound-literal expression. TYPE is the type to which
2132 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2135 finish_compound_literal (tree type, tree compound_literal)
2137 if (type == error_mark_node)
2138 return error_mark_node;
2140 if (!TYPE_OBJ_P (type))
2142 error ("compound literal of non-object type %qT", type);
2143 return error_mark_node;
2146 if (processing_template_decl)
2148 TREE_TYPE (compound_literal) = type;
2149 /* Mark the expression as a compound literal. */
2150 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2151 return compound_literal;
2154 type = complete_type (type);
2156 if (TYPE_NON_AGGREGATE_CLASS (type))
2158 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2159 everywhere that deals with function arguments would be a pain, so
2160 just wrap it in a TREE_LIST. The parser set a flag so we know
2161 that it came from T{} rather than T({}). */
2162 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2163 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2164 return build_functional_cast (type, compound_literal, tf_error);
2167 if (TREE_CODE (type) == ARRAY_TYPE
2168 && check_array_initializer (NULL_TREE, type, compound_literal))
2169 return error_mark_node;
2170 compound_literal = reshape_init (type, compound_literal);
2171 if (TREE_CODE (type) == ARRAY_TYPE)
2172 cp_complete_array_type (&type, compound_literal, false);
2173 compound_literal = digest_init (type, compound_literal);
2174 if ((!at_function_scope_p () || cp_type_readonly (type))
2175 && initializer_constant_valid_p (compound_literal, type))
2177 tree decl = create_temporary_var (type);
2178 DECL_INITIAL (decl) = compound_literal;
2179 TREE_STATIC (decl) = 1;
2180 decl = pushdecl_top_level (decl);
2181 DECL_NAME (decl) = make_anon_name ();
2182 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2186 return get_target_expr (compound_literal);
2189 /* Return the declaration for the function-name variable indicated by
2193 finish_fname (tree id)
2197 decl = fname_decl (input_location, C_RID_CODE (id), id);
2198 if (processing_template_decl)
2199 decl = DECL_NAME (decl);
2203 /* Finish a translation unit. */
2206 finish_translation_unit (void)
2208 /* In case there were missing closebraces,
2209 get us back to the global binding level. */
2211 while (current_namespace != global_namespace)
2214 /* Do file scope __FUNCTION__ et al. */
2215 finish_fname_decls ();
2218 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2219 Returns the parameter. */
2222 finish_template_type_parm (tree aggr, tree identifier)
2224 if (aggr != class_type_node)
2226 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2227 aggr = class_type_node;
2230 return build_tree_list (aggr, identifier);
2233 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2234 Returns the parameter. */
2237 finish_template_template_parm (tree aggr, tree identifier)
2239 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2240 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2241 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2242 DECL_TEMPLATE_RESULT (tmpl) = decl;
2243 DECL_ARTIFICIAL (decl) = 1;
2244 end_template_decl ();
2246 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2248 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2249 /*is_primary=*/true, /*is_partial=*/false,
2252 return finish_template_type_parm (aggr, tmpl);
2255 /* ARGUMENT is the default-argument value for a template template
2256 parameter. If ARGUMENT is invalid, issue error messages and return
2257 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2260 check_template_template_default_arg (tree argument)
2262 if (TREE_CODE (argument) != TEMPLATE_DECL
2263 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2264 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2266 if (TREE_CODE (argument) == TYPE_DECL)
2267 error ("invalid use of type %qT as a default value for a template "
2268 "template-parameter", TREE_TYPE (argument));
2270 error ("invalid default argument for a template template parameter");
2271 return error_mark_node;
2277 /* Begin a class definition, as indicated by T. */
2280 begin_class_definition (tree t, tree attributes)
2282 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2283 return error_mark_node;
2285 if (processing_template_parmlist)
2287 error ("definition of %q#T inside template parameter list", t);
2288 return error_mark_node;
2290 /* A non-implicit typename comes from code like:
2292 template <typename T> struct A {
2293 template <typename U> struct A<T>::B ...
2295 This is erroneous. */
2296 else if (TREE_CODE (t) == TYPENAME_TYPE)
2298 error ("invalid definition of qualified type %qT", t);
2299 t = error_mark_node;
2302 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2304 t = make_class_type (RECORD_TYPE);
2305 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2308 /* Update the location of the decl. */
2309 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2311 if (TYPE_BEING_DEFINED (t))
2313 t = make_class_type (TREE_CODE (t));
2314 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2316 maybe_process_partial_specialization (t);
2318 TYPE_BEING_DEFINED (t) = 1;
2320 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2322 if (flag_pack_struct)
2325 TYPE_PACKED (t) = 1;
2326 /* Even though the type is being defined for the first time
2327 here, there might have been a forward declaration, so there
2328 might be cv-qualified variants of T. */
2329 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2330 TYPE_PACKED (v) = 1;
2332 /* Reset the interface data, at the earliest possible
2333 moment, as it might have been set via a class foo;
2335 if (! TYPE_ANONYMOUS_P (t))
2337 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2338 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2339 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2340 (t, finfo->interface_unknown);
2342 reset_specialization();
2344 /* Make a declaration for this class in its own scope. */
2345 build_self_reference ();
2350 /* Finish the member declaration given by DECL. */
2353 finish_member_declaration (tree decl)
2355 if (decl == error_mark_node || decl == NULL_TREE)
2358 if (decl == void_type_node)
2359 /* The COMPONENT was a friend, not a member, and so there's
2360 nothing for us to do. */
2363 /* We should see only one DECL at a time. */
2364 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2366 /* Set up access control for DECL. */
2368 = (current_access_specifier == access_private_node);
2369 TREE_PROTECTED (decl)
2370 = (current_access_specifier == access_protected_node);
2371 if (TREE_CODE (decl) == TEMPLATE_DECL)
2373 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2374 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2377 /* Mark the DECL as a member of the current class. */
2378 DECL_CONTEXT (decl) = current_class_type;
2380 /* Check for bare parameter packs in the member variable declaration. */
2381 if (TREE_CODE (decl) == FIELD_DECL)
2383 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2384 TREE_TYPE (decl) = error_mark_node;
2385 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2386 DECL_ATTRIBUTES (decl) = NULL_TREE;
2391 A C language linkage is ignored for the names of class members
2392 and the member function type of class member functions. */
2393 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2394 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2396 /* Put functions on the TYPE_METHODS list and everything else on the
2397 TYPE_FIELDS list. Note that these are built up in reverse order.
2398 We reverse them (to obtain declaration order) in finish_struct. */
2399 if (TREE_CODE (decl) == FUNCTION_DECL
2400 || DECL_FUNCTION_TEMPLATE_P (decl))
2402 /* We also need to add this function to the
2403 CLASSTYPE_METHOD_VEC. */
2404 if (add_method (current_class_type, decl, NULL_TREE))
2406 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2407 TYPE_METHODS (current_class_type) = decl;
2409 maybe_add_class_template_decl_list (current_class_type, decl,
2413 /* Enter the DECL into the scope of the class. */
2414 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2415 || pushdecl_class_level (decl))
2417 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2418 go at the beginning. The reason is that lookup_field_1
2419 searches the list in order, and we want a field name to
2420 override a type name so that the "struct stat hack" will
2421 work. In particular:
2423 struct S { enum E { }; int E } s;
2426 is valid. In addition, the FIELD_DECLs must be maintained in
2427 declaration order so that class layout works as expected.
2428 However, we don't need that order until class layout, so we
2429 save a little time by putting FIELD_DECLs on in reverse order
2430 here, and then reversing them in finish_struct_1. (We could
2431 also keep a pointer to the correct insertion points in the
2434 if (TREE_CODE (decl) == TYPE_DECL)
2435 TYPE_FIELDS (current_class_type)
2436 = chainon (TYPE_FIELDS (current_class_type), decl);
2439 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2440 TYPE_FIELDS (current_class_type) = decl;
2443 maybe_add_class_template_decl_list (current_class_type, decl,
2448 note_decl_for_pch (decl);
2451 /* DECL has been declared while we are building a PCH file. Perform
2452 actions that we might normally undertake lazily, but which can be
2453 performed now so that they do not have to be performed in
2454 translation units which include the PCH file. */
2457 note_decl_for_pch (tree decl)
2459 gcc_assert (pch_file);
2461 /* There's a good chance that we'll have to mangle names at some
2462 point, even if only for emission in debugging information. */
2463 if ((TREE_CODE (decl) == VAR_DECL
2464 || TREE_CODE (decl) == FUNCTION_DECL)
2465 && !processing_template_decl)
2469 /* Finish processing a complete template declaration. The PARMS are
2470 the template parameters. */
2473 finish_template_decl (tree parms)
2476 end_template_decl ();
2478 end_specialization ();
2481 /* Finish processing a template-id (which names a type) of the form
2482 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2483 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2484 the scope of template-id indicated. */
2487 finish_template_type (tree name, tree args, int entering_scope)
2491 decl = lookup_template_class (name, args,
2492 NULL_TREE, NULL_TREE, entering_scope,
2493 tf_warning_or_error | tf_user);
2494 if (decl != error_mark_node)
2495 decl = TYPE_STUB_DECL (decl);
2500 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2501 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2502 BASE_CLASS, or NULL_TREE if an error occurred. The
2503 ACCESS_SPECIFIER is one of
2504 access_{default,public,protected_private}_node. For a virtual base
2505 we set TREE_TYPE. */
2508 finish_base_specifier (tree base, tree access, bool virtual_p)
2512 if (base == error_mark_node)
2514 error ("invalid base-class specification");
2517 else if (! MAYBE_CLASS_TYPE_P (base))
2519 error ("%qT is not a class type", base);
2524 if (cp_type_quals (base) != 0)
2526 error ("base class %qT has cv qualifiers", base);
2527 base = TYPE_MAIN_VARIANT (base);
2529 result = build_tree_list (access, base);
2531 TREE_TYPE (result) = integer_type_node;
2537 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2538 what we found when we tried to do the lookup.
2539 LOCATION is the location of the NAME identifier;
2540 The location is used in the error message*/
2543 qualified_name_lookup_error (tree scope, tree name,
2544 tree decl, location_t location)
2546 if (scope == error_mark_node)
2547 ; /* We already complained. */
2548 else if (TYPE_P (scope))
2550 if (!COMPLETE_TYPE_P (scope))
2551 error ("%Hincomplete type %qT used in nested name specifier",
2553 else if (TREE_CODE (decl) == TREE_LIST)
2555 error ("%Hreference to %<%T::%D%> is ambiguous", &location, scope, name);
2556 print_candidates (decl);
2559 error ("%H%qD is not a member of %qT", &location, name, scope);
2561 else if (scope != global_namespace)
2562 error ("%H%qD is not a member of %qD", &location, name, scope);
2564 error ("%H%<::%D%> has not been declared", &location, name);
2567 /* If FNS is a member function, a set of member functions, or a
2568 template-id referring to one or more member functions, return a
2569 BASELINK for FNS, incorporating the current access context.
2570 Otherwise, return FNS unchanged. */
2573 baselink_for_fns (tree fns)
2578 if (BASELINK_P (fns)
2579 || error_operand_p (fns))
2583 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2584 fn = TREE_OPERAND (fn, 0);
2585 fn = get_first_fn (fn);
2586 if (!DECL_FUNCTION_MEMBER_P (fn))
2589 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2591 cl = DECL_CONTEXT (fn);
2592 cl = TYPE_BINFO (cl);
2593 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2596 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2597 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2598 if non-NULL, is the type or namespace used to explicitly qualify
2599 ID_EXPRESSION. DECL is the entity to which that name has been
2602 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2603 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2604 be set to true if this expression isn't permitted in a
2605 constant-expression, but it is otherwise not set by this function.
2606 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2607 constant-expression, but a non-constant expression is also
2610 DONE is true if this expression is a complete postfix-expression;
2611 it is false if this expression is followed by '->', '[', '(', etc.
2612 ADDRESS_P is true iff this expression is the operand of '&'.
2613 TEMPLATE_P is true iff the qualified-id was of the form
2614 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2615 appears as a template argument.
2617 If an error occurs, and it is the kind of error that might cause
2618 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2619 is the caller's responsibility to issue the message. *ERROR_MSG
2620 will be a string with static storage duration, so the caller need
2623 Return an expression for the entity, after issuing appropriate
2624 diagnostics. This function is also responsible for transforming a
2625 reference to a non-static member into a COMPONENT_REF that makes
2626 the use of "this" explicit.
2628 Upon return, *IDK will be filled in appropriately. */
2630 finish_id_expression (tree id_expression,
2634 bool integral_constant_expression_p,
2635 bool allow_non_integral_constant_expression_p,
2636 bool *non_integral_constant_expression_p,
2640 bool template_arg_p,
2641 const char **error_msg,
2642 location_t location)
2644 /* Initialize the output parameters. */
2645 *idk = CP_ID_KIND_NONE;
2648 if (id_expression == error_mark_node)
2649 return error_mark_node;
2650 /* If we have a template-id, then no further lookup is
2651 required. If the template-id was for a template-class, we
2652 will sometimes have a TYPE_DECL at this point. */
2653 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2654 || TREE_CODE (decl) == TYPE_DECL)
2656 /* Look up the name. */
2659 if (decl == error_mark_node)
2661 /* Name lookup failed. */
2664 || (!dependent_type_p (scope)
2665 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2666 && IDENTIFIER_TYPENAME_P (id_expression)
2667 && dependent_type_p (TREE_TYPE (id_expression))))))
2669 /* If the qualifying type is non-dependent (and the name
2670 does not name a conversion operator to a dependent
2671 type), issue an error. */
2672 qualified_name_lookup_error (scope, id_expression, decl, location);
2673 return error_mark_node;
2677 /* It may be resolved via Koenig lookup. */
2678 *idk = CP_ID_KIND_UNQUALIFIED;
2679 return id_expression;
2682 decl = id_expression;
2684 /* If DECL is a variable that would be out of scope under
2685 ANSI/ISO rules, but in scope in the ARM, name lookup
2686 will succeed. Issue a diagnostic here. */
2688 decl = check_for_out_of_scope_variable (decl);
2690 /* Remember that the name was used in the definition of
2691 the current class so that we can check later to see if
2692 the meaning would have been different after the class
2693 was entirely defined. */
2694 if (!scope && decl != error_mark_node)
2695 maybe_note_name_used_in_class (id_expression, decl);
2697 /* Disallow uses of local variables from containing functions. */
2698 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2700 tree context = decl_function_context (decl);
2701 if (context != NULL_TREE && context != current_function_decl
2702 && ! TREE_STATIC (decl))
2704 error (TREE_CODE (decl) == VAR_DECL
2705 ? "use of %<auto%> variable from containing function"
2706 : "use of parameter from containing function");
2707 error (" %q+#D declared here", decl);
2708 return error_mark_node;
2713 /* If we didn't find anything, or what we found was a type,
2714 then this wasn't really an id-expression. */
2715 if (TREE_CODE (decl) == TEMPLATE_DECL
2716 && !DECL_FUNCTION_TEMPLATE_P (decl))
2718 *error_msg = "missing template arguments";
2719 return error_mark_node;
2721 else if (TREE_CODE (decl) == TYPE_DECL
2722 || TREE_CODE (decl) == NAMESPACE_DECL)
2724 *error_msg = "expected primary-expression";
2725 return error_mark_node;
2728 /* If the name resolved to a template parameter, there is no
2729 need to look it up again later. */
2730 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2731 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2735 *idk = CP_ID_KIND_NONE;
2736 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2737 decl = TEMPLATE_PARM_DECL (decl);
2738 r = convert_from_reference (DECL_INITIAL (decl));
2740 if (integral_constant_expression_p
2741 && !dependent_type_p (TREE_TYPE (decl))
2742 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2744 if (!allow_non_integral_constant_expression_p)
2745 error ("template parameter %qD of type %qT is not allowed in "
2746 "an integral constant expression because it is not of "
2747 "integral or enumeration type", decl, TREE_TYPE (decl));
2748 *non_integral_constant_expression_p = true;
2752 /* Similarly, we resolve enumeration constants to their
2753 underlying values. */
2754 else if (TREE_CODE (decl) == CONST_DECL)
2756 *idk = CP_ID_KIND_NONE;
2757 if (!processing_template_decl)
2759 used_types_insert (TREE_TYPE (decl));
2760 return DECL_INITIAL (decl);
2768 /* If the declaration was explicitly qualified indicate
2769 that. The semantics of `A::f(3)' are different than
2770 `f(3)' if `f' is virtual. */
2772 ? CP_ID_KIND_QUALIFIED
2773 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2774 ? CP_ID_KIND_TEMPLATE_ID
2775 : CP_ID_KIND_UNQUALIFIED));
2780 An id-expression is type-dependent if it contains an
2781 identifier that was declared with a dependent type.
2783 The standard is not very specific about an id-expression that
2784 names a set of overloaded functions. What if some of them
2785 have dependent types and some of them do not? Presumably,
2786 such a name should be treated as a dependent name. */
2787 /* Assume the name is not dependent. */
2788 dependent_p = false;
2789 if (!processing_template_decl)
2790 /* No names are dependent outside a template. */
2792 /* A template-id where the name of the template was not resolved
2793 is definitely dependent. */
2794 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2795 && (TREE_CODE (TREE_OPERAND (decl, 0))
2796 == IDENTIFIER_NODE))
2798 /* For anything except an overloaded function, just check its
2800 else if (!is_overloaded_fn (decl))
2802 = dependent_type_p (TREE_TYPE (decl));
2803 /* For a set of overloaded functions, check each of the
2809 if (BASELINK_P (fns))
2810 fns = BASELINK_FUNCTIONS (fns);
2812 /* For a template-id, check to see if the template
2813 arguments are dependent. */
2814 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2816 tree args = TREE_OPERAND (fns, 1);
2817 dependent_p = any_dependent_template_arguments_p (args);
2818 /* The functions are those referred to by the
2820 fns = TREE_OPERAND (fns, 0);
2823 /* If there are no dependent template arguments, go through
2824 the overloaded functions. */
2825 while (fns && !dependent_p)
2827 tree fn = OVL_CURRENT (fns);
2829 /* Member functions of dependent classes are
2831 if (TREE_CODE (fn) == FUNCTION_DECL
2832 && type_dependent_expression_p (fn))
2834 else if (TREE_CODE (fn) == TEMPLATE_DECL
2835 && dependent_template_p (fn))
2838 fns = OVL_NEXT (fns);
2842 /* If the name was dependent on a template parameter, we will
2843 resolve the name at instantiation time. */
2846 /* Create a SCOPE_REF for qualified names, if the scope is
2850 /* Since this name was dependent, the expression isn't
2851 constant -- yet. No error is issued because it might
2852 be constant when things are instantiated. */
2853 if (integral_constant_expression_p)
2854 *non_integral_constant_expression_p = true;
2857 if (address_p && done)
2858 decl = finish_qualified_id_expr (scope, decl,
2862 else if (dependent_type_p (scope))
2863 decl = build_qualified_name (/*type=*/NULL_TREE,
2867 else if (DECL_P (decl))
2868 decl = build_qualified_name (TREE_TYPE (decl),
2873 if (TREE_TYPE (decl))
2874 decl = convert_from_reference (decl);
2877 /* A TEMPLATE_ID already contains all the information we
2879 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2880 return id_expression;
2881 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2882 /* If we found a variable, then name lookup during the
2883 instantiation will always resolve to the same VAR_DECL
2884 (or an instantiation thereof). */
2885 if (TREE_CODE (decl) == VAR_DECL
2886 || TREE_CODE (decl) == PARM_DECL)
2887 return convert_from_reference (decl);
2888 /* The same is true for FIELD_DECL, but we also need to
2889 make sure that the syntax is correct. */
2890 else if (TREE_CODE (decl) == FIELD_DECL)
2892 /* Since SCOPE is NULL here, this is an unqualified name.
2893 Access checking has been performed during name lookup
2894 already. Turn off checking to avoid duplicate errors. */
2895 push_deferring_access_checks (dk_no_check);
2896 decl = finish_non_static_data_member
2897 (decl, current_class_ref,
2898 /*qualifying_scope=*/NULL_TREE);
2899 pop_deferring_access_checks ();
2902 return id_expression;
2905 /* Only certain kinds of names are allowed in constant
2906 expression. Enumerators and template parameters have already
2907 been handled above. */
2908 if (integral_constant_expression_p
2909 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2910 && ! builtin_valid_in_constant_expr_p (decl))
2912 if (!allow_non_integral_constant_expression_p)
2914 error ("%qD cannot appear in a constant-expression", decl);
2915 return error_mark_node;
2917 *non_integral_constant_expression_p = true;
2920 if (TREE_CODE (decl) == NAMESPACE_DECL)
2922 error ("use of namespace %qD as expression", decl);
2923 return error_mark_node;
2925 else if (DECL_CLASS_TEMPLATE_P (decl))
2927 error ("use of class template %qT as expression", decl);
2928 return error_mark_node;
2930 else if (TREE_CODE (decl) == TREE_LIST)
2932 /* Ambiguous reference to base members. */
2933 error ("request for member %qD is ambiguous in "
2934 "multiple inheritance lattice", id_expression);
2935 print_candidates (decl);
2936 return error_mark_node;
2939 /* Mark variable-like entities as used. Functions are similarly
2940 marked either below or after overload resolution. */
2941 if (TREE_CODE (decl) == VAR_DECL
2942 || TREE_CODE (decl) == PARM_DECL
2943 || TREE_CODE (decl) == RESULT_DECL)
2948 decl = (adjust_result_of_qualified_name_lookup
2949 (decl, scope, current_class_type));
2951 if (TREE_CODE (decl) == FUNCTION_DECL)
2954 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2955 decl = finish_qualified_id_expr (scope,
2963 tree r = convert_from_reference (decl);
2965 if (processing_template_decl && TYPE_P (scope))
2966 r = build_qualified_name (TREE_TYPE (r),
2972 else if (TREE_CODE (decl) == FIELD_DECL)
2974 /* Since SCOPE is NULL here, this is an unqualified name.
2975 Access checking has been performed during name lookup
2976 already. Turn off checking to avoid duplicate errors. */
2977 push_deferring_access_checks (dk_no_check);
2978 decl = finish_non_static_data_member (decl, current_class_ref,
2979 /*qualifying_scope=*/NULL_TREE);
2980 pop_deferring_access_checks ();
2982 else if (is_overloaded_fn (decl))
2987 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2988 first_fn = TREE_OPERAND (first_fn, 0);
2989 first_fn = get_first_fn (first_fn);
2990 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2991 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2993 if (!really_overloaded_fn (decl))
2994 mark_used (first_fn);
2997 && TREE_CODE (first_fn) == FUNCTION_DECL
2998 && DECL_FUNCTION_MEMBER_P (first_fn)
2999 && !shared_member_p (decl))
3001 /* A set of member functions. */
3002 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3003 return finish_class_member_access_expr (decl, id_expression,
3004 /*template_p=*/false,
3005 tf_warning_or_error);
3008 decl = baselink_for_fns (decl);
3012 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3013 && DECL_CLASS_SCOPE_P (decl))
3015 tree context = context_for_name_lookup (decl);
3016 if (context != current_class_type)
3018 tree path = currently_open_derived_class (context);
3019 perform_or_defer_access_check (TYPE_BINFO (path),
3024 decl = convert_from_reference (decl);
3028 if (TREE_DEPRECATED (decl))
3029 warn_deprecated_use (decl);
3034 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3035 use as a type-specifier. */
3038 finish_typeof (tree expr)
3042 if (type_dependent_expression_p (expr))
3044 type = cxx_make_type (TYPEOF_TYPE);
3045 TYPEOF_TYPE_EXPR (type) = expr;
3046 SET_TYPE_STRUCTURAL_EQUALITY (type);
3051 type = unlowered_expr_type (expr);
3053 if (!type || type == unknown_type_node)
3055 error ("type of %qE is unknown", expr);
3056 return error_mark_node;
3062 /* Perform C++-specific checks for __builtin_offsetof before calling
3066 finish_offsetof (tree expr)
3068 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3070 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3071 TREE_OPERAND (expr, 2));
3072 return error_mark_node;
3074 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3075 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3076 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3078 if (TREE_CODE (expr) == COMPONENT_REF
3079 || TREE_CODE (expr) == COMPOUND_EXPR)
3080 expr = TREE_OPERAND (expr, 1);
3081 error ("cannot apply %<offsetof%> to member function %qD", expr);
3082 return error_mark_node;
3084 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3085 expr = TREE_OPERAND (expr, 0);
3086 return fold_offsetof (expr, NULL_TREE);
3089 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3090 function is broken out from the above for the benefit of the tree-ssa
3094 simplify_aggr_init_expr (tree *tp)
3096 tree aggr_init_expr = *tp;
3098 /* Form an appropriate CALL_EXPR. */
3099 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3100 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3101 tree type = TREE_TYPE (slot);
3104 enum style_t { ctor, arg, pcc } style;
3106 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3108 #ifdef PCC_STATIC_STRUCT_RETURN
3114 gcc_assert (TREE_ADDRESSABLE (type));
3118 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3120 aggr_init_expr_nargs (aggr_init_expr),
3121 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3125 /* Replace the first argument to the ctor with the address of the
3127 cxx_mark_addressable (slot);
3128 CALL_EXPR_ARG (call_expr, 0) =
3129 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3131 else if (style == arg)
3133 /* Just mark it addressable here, and leave the rest to
3134 expand_call{,_inline}. */
3135 cxx_mark_addressable (slot);
3136 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3137 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3139 else if (style == pcc)
3141 /* If we're using the non-reentrant PCC calling convention, then we
3142 need to copy the returned value out of the static buffer into the
3144 push_deferring_access_checks (dk_no_check);
3145 call_expr = build_aggr_init (slot, call_expr,
3146 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3147 tf_warning_or_error);
3148 pop_deferring_access_checks ();
3149 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3155 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3158 emit_associated_thunks (tree fn)
3160 /* When we use vcall offsets, we emit thunks with the virtual
3161 functions to which they thunk. The whole point of vcall offsets
3162 is so that you can know statically the entire set of thunks that
3163 will ever be needed for a given virtual function, thereby
3164 enabling you to output all the thunks with the function itself. */
3165 if (DECL_VIRTUAL_P (fn))
3169 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3171 if (!THUNK_ALIAS (thunk))
3173 use_thunk (thunk, /*emit_p=*/1);
3174 if (DECL_RESULT_THUNK_P (thunk))
3178 for (probe = DECL_THUNKS (thunk);
3179 probe; probe = TREE_CHAIN (probe))
3180 use_thunk (probe, /*emit_p=*/1);
3184 gcc_assert (!DECL_THUNKS (thunk));
3189 /* Generate RTL for FN. */
3192 expand_or_defer_fn (tree fn)
3194 /* When the parser calls us after finishing the body of a template
3195 function, we don't really want to expand the body. */
3196 if (processing_template_decl)
3198 /* Normally, collection only occurs in rest_of_compilation. So,
3199 if we don't collect here, we never collect junk generated
3200 during the processing of templates until we hit a
3201 non-template function. It's not safe to do this inside a
3202 nested class, though, as the parser may have local state that
3203 is not a GC root. */
3204 if (!function_depth)
3209 gcc_assert (gimple_body (fn));
3211 /* If this is a constructor or destructor body, we have to clone
3213 if (maybe_clone_body (fn))
3215 /* We don't want to process FN again, so pretend we've written
3216 it out, even though we haven't. */
3217 TREE_ASM_WRITTEN (fn) = 1;
3221 /* We make a decision about linkage for these functions at the end
3222 of the compilation. Until that point, we do not want the back
3223 end to output them -- but we do want it to see the bodies of
3224 these functions so that it can inline them as appropriate. */
3225 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3227 if (DECL_INTERFACE_KNOWN (fn))
3228 /* We've already made a decision as to how this function will
3232 DECL_EXTERNAL (fn) = 1;
3233 DECL_NOT_REALLY_EXTERN (fn) = 1;
3234 note_vague_linkage_fn (fn);
3235 /* A non-template inline function with external linkage will
3236 always be COMDAT. As we must eventually determine the
3237 linkage of all functions, and as that causes writes to
3238 the data mapped in from the PCH file, it's advantageous
3239 to mark the functions at this point. */
3240 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3242 /* This function must have external linkage, as
3243 otherwise DECL_INTERFACE_KNOWN would have been
3245 gcc_assert (TREE_PUBLIC (fn));
3246 comdat_linkage (fn);
3247 DECL_INTERFACE_KNOWN (fn) = 1;
3251 import_export_decl (fn);
3253 /* If the user wants us to keep all inline functions, then mark
3254 this function as needed so that finish_file will make sure to
3256 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3260 /* There's no reason to do any of the work here if we're only doing
3261 semantic analysis; this code just generates RTL. */
3262 if (flag_syntax_only)
3267 /* Expand or defer, at the whim of the compilation unit manager. */
3268 cgraph_finalize_function (fn, function_depth > 1);
3280 /* Helper function for walk_tree, used by finalize_nrv below. */
3283 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3285 struct nrv_data *dp = (struct nrv_data *)data;
3288 /* No need to walk into types. There wouldn't be any need to walk into
3289 non-statements, except that we have to consider STMT_EXPRs. */
3292 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3293 but differs from using NULL_TREE in that it indicates that we care
3294 about the value of the RESULT_DECL. */
3295 else if (TREE_CODE (*tp) == RETURN_EXPR)
3296 TREE_OPERAND (*tp, 0) = dp->result;
3297 /* Change all cleanups for the NRV to only run when an exception is
3299 else if (TREE_CODE (*tp) == CLEANUP_STMT
3300 && CLEANUP_DECL (*tp) == dp->var)
3301 CLEANUP_EH_ONLY (*tp) = 1;
3302 /* Replace the DECL_EXPR for the NRV with an initialization of the
3303 RESULT_DECL, if needed. */
3304 else if (TREE_CODE (*tp) == DECL_EXPR
3305 && DECL_EXPR_DECL (*tp) == dp->var)
3308 if (DECL_INITIAL (dp->var)
3309 && DECL_INITIAL (dp->var) != error_mark_node)
3310 init = build2 (INIT_EXPR, void_type_node, dp->result,
3311 DECL_INITIAL (dp->var));
3313 init = build_empty_stmt ();
3314 DECL_INITIAL (dp->var) = NULL_TREE;
3315 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3318 /* And replace all uses of the NRV with the RESULT_DECL. */
3319 else if (*tp == dp->var)
3322 /* Avoid walking into the same tree more than once. Unfortunately, we
3323 can't just use walk_tree_without duplicates because it would only call
3324 us for the first occurrence of dp->var in the function body. */
3325 slot = htab_find_slot (dp->visited, *tp, INSERT);
3331 /* Keep iterating. */
3335 /* Called from finish_function to implement the named return value
3336 optimization by overriding all the RETURN_EXPRs and pertinent
3337 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3338 RESULT_DECL for the function. */
3341 finalize_nrv (tree *tp, tree var, tree result)
3343 struct nrv_data data;
3345 /* Copy debugging information from VAR to RESULT. */
3346 DECL_NAME (result) = DECL_NAME (var);
3347 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3348 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3349 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3350 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3351 /* Don't forget that we take its address. */
3352 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3355 data.result = result;
3356 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3357 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3358 htab_delete (data.visited);
3361 /* Return the declaration for the function called by CALL_EXPR T,
3362 TYPE is the class type of the clause decl. */
3365 omp_clause_info_fndecl (tree t, tree type)
3367 tree ret = get_callee_fndecl (t);
3372 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3373 t = CALL_EXPR_FN (t);
3375 if (TREE_CODE (t) == OBJ_TYPE_REF)
3377 t = cp_fold_obj_type_ref (t, type);
3378 if (TREE_CODE (t) == ADDR_EXPR
3379 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3380 return TREE_OPERAND (t, 0);
3386 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3389 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3390 bool need_copy_ctor, bool need_copy_assignment)
3392 int save_errorcount = errorcount;
3395 /* Always allocate 3 elements for simplicity. These are the
3396 function decls for the ctor, dtor, and assignment op.
3397 This layout is known to the three lang hooks,
3398 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3399 and cxx_omp_clause_assign_op. */
3400 info = make_tree_vec (3);
3401 CP_OMP_CLAUSE_INFO (c) = info;
3403 if (need_default_ctor
3404 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3406 if (need_default_ctor)
3410 t = build_int_cst (build_pointer_type (type), 0);
3411 t = build1 (INDIRECT_REF, type, t);
3412 t = build_tree_list (NULL, t);
3414 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3415 t, type, LOOKUP_NORMAL,
3416 tf_warning_or_error);
3418 if (targetm.cxx.cdtor_returns_this () || errorcount)
3419 /* Because constructors and destructors return this,
3420 the call will have been cast to "void". Remove the
3421 cast here. We would like to use STRIP_NOPS, but it
3422 wouldn't work here because TYPE_MODE (t) and
3423 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3424 They are VOIDmode and Pmode, respectively. */
3425 if (TREE_CODE (t) == NOP_EXPR)
3426 t = TREE_OPERAND (t, 0);
3428 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3431 if ((need_default_ctor || need_copy_ctor)
3432 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3434 t = build_int_cst (build_pointer_type (type), 0);
3435 t = build1 (INDIRECT_REF, type, t);
3436 t = build_special_member_call (t, complete_dtor_identifier,
3437 NULL, type, LOOKUP_NORMAL,
3438 tf_warning_or_error);
3440 if (targetm.cxx.cdtor_returns_this () || errorcount)
3441 /* Because constructors and destructors return this,
3442 the call will have been cast to "void". Remove the
3443 cast here. We would like to use STRIP_NOPS, but it
3444 wouldn't work here because TYPE_MODE (t) and
3445 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3446 They are VOIDmode and Pmode, respectively. */
3447 if (TREE_CODE (t) == NOP_EXPR)
3448 t = TREE_OPERAND (t, 0);
3450 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3453 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3455 t = build_int_cst (build_pointer_type (type), 0);
3456 t = build1 (INDIRECT_REF, type, t);
3457 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3458 build_tree_list (NULL, t),
3459 type, LOOKUP_NORMAL,
3460 tf_warning_or_error);
3462 /* We'll have called convert_from_reference on the call, which
3463 may well have added an indirect_ref. It's unneeded here,
3464 and in the way, so kill it. */
3465 if (TREE_CODE (t) == INDIRECT_REF)
3466 t = TREE_OPERAND (t, 0);
3468 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3471 return errorcount != save_errorcount;
3474 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3475 Remove any elements from the list that are invalid. */
3478 finish_omp_clauses (tree clauses)
3480 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3481 tree c, t, *pc = &clauses;
3484 bitmap_obstack_initialize (NULL);
3485 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3486 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3487 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3489 for (pc = &clauses, c = clauses; c ; c = *pc)
3491 bool remove = false;
3493 switch (OMP_CLAUSE_CODE (c))
3495 case OMP_CLAUSE_SHARED:
3497 goto check_dup_generic;
3498 case OMP_CLAUSE_PRIVATE:
3500 goto check_dup_generic;
3501 case OMP_CLAUSE_REDUCTION:
3503 goto check_dup_generic;
3504 case OMP_CLAUSE_COPYPRIVATE:
3505 name = "copyprivate";
3506 goto check_dup_generic;
3507 case OMP_CLAUSE_COPYIN:
3509 goto check_dup_generic;
3511 t = OMP_CLAUSE_DECL (c);
3512 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3514 if (processing_template_decl)
3517 error ("%qD is not a variable in clause %qs", t, name);
3519 error ("%qE is not a variable in clause %qs", t, name);
3522 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3523 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3524 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3526 error ("%qD appears more than once in data clauses", t);
3530 bitmap_set_bit (&generic_head, DECL_UID (t));
3533 case OMP_CLAUSE_FIRSTPRIVATE:
3534 t = OMP_CLAUSE_DECL (c);
3535 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3537 if (processing_template_decl)
3540 error ("%qD is not a variable in clause %<firstprivate%>", t);
3542 error ("%qE is not a variable in clause %<firstprivate%>", t);
3545 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3546 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3548 error ("%qD appears more than once in data clauses", t);
3552 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3555 case OMP_CLAUSE_LASTPRIVATE:
3556 t = OMP_CLAUSE_DECL (c);
3557 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3559 if (processing_template_decl)
3562 error ("%qD is not a variable in clause %<lastprivate%>", t);
3564 error ("%qE is not a variable in clause %<lastprivate%>", t);
3567 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3568 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3570 error ("%qD appears more than once in data clauses", t);
3574 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3578 t = OMP_CLAUSE_IF_EXPR (c);
3579 t = maybe_convert_cond (t);
3580 if (t == error_mark_node)
3582 OMP_CLAUSE_IF_EXPR (c) = t;
3585 case OMP_CLAUSE_NUM_THREADS:
3586 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3587 if (t == error_mark_node)
3589 else if (!type_dependent_expression_p (t)
3590 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3592 error ("num_threads expression must be integral");
3597 case OMP_CLAUSE_SCHEDULE:
3598 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3601 else if (t == error_mark_node)
3603 else if (!type_dependent_expression_p (t)
3604 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3606 error ("schedule chunk size expression must be integral");
3611 case OMP_CLAUSE_NOWAIT:
3612 case OMP_CLAUSE_ORDERED:
3613 case OMP_CLAUSE_DEFAULT:
3614 case OMP_CLAUSE_UNTIED:
3615 case OMP_CLAUSE_COLLAPSE:
3623 *pc = OMP_CLAUSE_CHAIN (c);
3625 pc = &OMP_CLAUSE_CHAIN (c);
3628 for (pc = &clauses, c = clauses; c ; c = *pc)
3630 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3631 bool remove = false;
3632 bool need_complete_non_reference = false;
3633 bool need_default_ctor = false;
3634 bool need_copy_ctor = false;
3635 bool need_copy_assignment = false;
3636 bool need_implicitly_determined = false;
3637 tree type, inner_type;
3641 case OMP_CLAUSE_SHARED:
3643 need_implicitly_determined = true;
3645 case OMP_CLAUSE_PRIVATE:
3647 need_complete_non_reference = true;
3648 need_default_ctor = true;
3649 need_implicitly_determined = true;
3651 case OMP_CLAUSE_FIRSTPRIVATE:
3652 name = "firstprivate";
3653 need_complete_non_reference = true;
3654 need_copy_ctor = true;
3655 need_implicitly_determined = true;
3657 case OMP_CLAUSE_LASTPRIVATE:
3658 name = "lastprivate";
3659 need_complete_non_reference = true;
3660 need_copy_assignment = true;
3661 need_implicitly_determined = true;
3663 case OMP_CLAUSE_REDUCTION:
3665 need_implicitly_determined = true;
3667 case OMP_CLAUSE_COPYPRIVATE:
3668 name = "copyprivate";
3669 need_copy_assignment = true;
3671 case OMP_CLAUSE_COPYIN:
3673 need_copy_assignment = true;
3676 pc = &OMP_CLAUSE_CHAIN (c);
3680 t = OMP_CLAUSE_DECL (c);
3681 if (processing_template_decl
3682 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3684 pc = &OMP_CLAUSE_CHAIN (c);
3690 case OMP_CLAUSE_LASTPRIVATE:
3691 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3692 need_default_ctor = true;
3695 case OMP_CLAUSE_REDUCTION:
3696 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3697 || POINTER_TYPE_P (TREE_TYPE (t)))
3699 error ("%qE has invalid type for %<reduction%>", t);
3702 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3704 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3712 error ("%qE has invalid type for %<reduction(%s)%>",
3713 t, operator_name_info[r_code].name);
3719 case OMP_CLAUSE_COPYIN:
3720 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3722 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3731 if (need_complete_non_reference)
3733 t = require_complete_type (t);
3734 if (t == error_mark_node)
3736 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3738 error ("%qE has reference type for %qs", t, name);
3742 if (need_implicitly_determined)
3744 const char *share_name = NULL;
3746 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3747 share_name = "threadprivate";
3748 else switch (cxx_omp_predetermined_sharing (t))
3750 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3752 case OMP_CLAUSE_DEFAULT_SHARED:
3753 share_name = "shared";
3755 case OMP_CLAUSE_DEFAULT_PRIVATE:
3756 share_name = "private";
3763 error ("%qE is predetermined %qs for %qs",
3764 t, share_name, name);
3769 /* We're interested in the base element, not arrays. */
3770 inner_type = type = TREE_TYPE (t);
3771 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3772 inner_type = TREE_TYPE (inner_type);
3774 /* Check for special function availability by building a call to one.
3775 Save the results, because later we won't be in the right context
3776 for making these queries. */
3777 if (CLASS_TYPE_P (inner_type)
3778 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3779 && !type_dependent_expression_p (t)
3780 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3781 need_copy_ctor, need_copy_assignment))
3785 *pc = OMP_CLAUSE_CHAIN (c);
3787 pc = &OMP_CLAUSE_CHAIN (c);
3790 bitmap_obstack_release (NULL);
3794 /* For all variables in the tree_list VARS, mark them as thread local. */
3797 finish_omp_threadprivate (tree vars)
3801 /* Mark every variable in VARS to be assigned thread local storage. */
3802 for (t = vars; t; t = TREE_CHAIN (t))
3804 tree v = TREE_PURPOSE (t);
3806 if (error_operand_p (v))
3808 else if (TREE_CODE (v) != VAR_DECL)
3809 error ("%<threadprivate%> %qD is not file, namespace "
3810 "or block scope variable", v);
3811 /* If V had already been marked threadprivate, it doesn't matter
3812 whether it had been used prior to this point. */
3813 else if (TREE_USED (v)
3814 && (DECL_LANG_SPECIFIC (v) == NULL
3815 || !CP_DECL_THREADPRIVATE_P (v)))
3816 error ("%qE declared %<threadprivate%> after first use", v);
3817 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3818 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3819 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3820 error ("%<threadprivate%> %qE has incomplete type", v);
3821 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3822 && CP_DECL_CONTEXT (v) != current_class_type)
3823 error ("%<threadprivate%> %qE directive not "
3824 "in %qT definition", v, CP_DECL_CONTEXT (v));
3827 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3828 if (DECL_LANG_SPECIFIC (v) == NULL)
3830 retrofit_lang_decl (v);
3832 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3833 after the allocation of the lang_decl structure. */
3834 if (DECL_DISCRIMINATOR_P (v))
3835 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3838 if (! DECL_THREAD_LOCAL_P (v))
3840 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3841 /* If rtl has been already set for this var, call
3842 make_decl_rtl once again, so that encode_section_info
3843 has a chance to look at the new decl flags. */
3844 if (DECL_RTL_SET_P (v))
3847 CP_DECL_THREADPRIVATE_P (v) = 1;
3852 /* Build an OpenMP structured block. */
3855 begin_omp_structured_block (void)
3857 return do_pushlevel (sk_omp);
3861 finish_omp_structured_block (tree block)
3863 return do_poplevel (block);
3866 /* Similarly, except force the retention of the BLOCK. */
3869 begin_omp_parallel (void)
3871 keep_next_level (true);
3872 return begin_omp_structured_block ();
3876 finish_omp_parallel (tree clauses, tree body)
3880 body = finish_omp_structured_block (body);
3882 stmt = make_node (OMP_PARALLEL);
3883 TREE_TYPE (stmt) = void_type_node;
3884 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3885 OMP_PARALLEL_BODY (stmt) = body;
3887 return add_stmt (stmt);
3891 begin_omp_task (void)
3893 keep_next_level (true);
3894 return begin_omp_structured_block ();
3898 finish_omp_task (tree clauses, tree body)
3902 body = finish_omp_structured_block (body);
3904 stmt = make_node (OMP_TASK);
3905 TREE_TYPE (stmt) = void_type_node;
3906 OMP_TASK_CLAUSES (stmt) = clauses;
3907 OMP_TASK_BODY (stmt) = body;
3909 return add_stmt (stmt);
3912 /* Helper function for finish_omp_for. Convert Ith random access iterator
3913 into integral iterator. Return FALSE if successful. */
3916 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3917 tree condv, tree incrv, tree *body,
3918 tree *pre_body, tree clauses)
3920 tree diff, iter_init, iter_incr = NULL, last;
3921 tree incr_var = NULL, orig_pre_body, orig_body, c;
3922 tree decl = TREE_VEC_ELT (declv, i);
3923 tree init = TREE_VEC_ELT (initv, i);
3924 tree cond = TREE_VEC_ELT (condv, i);
3925 tree incr = TREE_VEC_ELT (incrv, i);
3927 location_t elocus = locus;
3929 if (init && EXPR_HAS_LOCATION (init))
3930 elocus = EXPR_LOCATION (init);
3932 switch (TREE_CODE (cond))
3938 if (TREE_OPERAND (cond, 0) != iter)
3939 cond = error_mark_node;
3942 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3943 TREE_OPERAND (cond, 1), ERROR_MARK,
3944 NULL, tf_warning_or_error);
3945 if (error_operand_p (tem))
3950 cond = error_mark_node;
3953 if (cond == error_mark_node)
3955 error ("%Hinvalid controlling predicate", &elocus);
3958 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
3959 ERROR_MARK, iter, ERROR_MARK, NULL,
3960 tf_warning_or_error);
3961 if (error_operand_p (diff))
3963 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
3965 error ("%Hdifference between %qE and %qD does not have integer type",
3966 &elocus, TREE_OPERAND (cond, 1), iter);
3970 switch (TREE_CODE (incr))
3972 case PREINCREMENT_EXPR:
3973 case PREDECREMENT_EXPR:
3974 case POSTINCREMENT_EXPR:
3975 case POSTDECREMENT_EXPR:
3976 if (TREE_OPERAND (incr, 0) != iter)
3978 incr = error_mark_node;
3981 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
3982 tf_warning_or_error);
3983 if (error_operand_p (iter_incr))
3985 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
3986 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
3987 incr = integer_one_node;
3989 incr = integer_minus_one_node;
3992 if (TREE_OPERAND (incr, 0) != iter)
3993 incr = error_mark_node;
3994 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
3995 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
3997 tree rhs = TREE_OPERAND (incr, 1);
3998 if (TREE_OPERAND (rhs, 0) == iter)
4000 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4002 incr = error_mark_node;
4005 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4006 TREE_OPERAND (rhs, 1),
4007 tf_warning_or_error);
4008 if (error_operand_p (iter_incr))
4010 incr = TREE_OPERAND (rhs, 1);
4011 incr = cp_convert (TREE_TYPE (diff), incr);
4012 if (TREE_CODE (rhs) == MINUS_EXPR)
4014 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4015 incr = fold_if_not_in_template (incr);
4017 if (TREE_CODE (incr) != INTEGER_CST
4018 && (TREE_CODE (incr) != NOP_EXPR
4019 || (TREE_CODE (TREE_OPERAND (incr, 0))
4024 else if (TREE_OPERAND (rhs, 1) == iter)
4026 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4027 || TREE_CODE (rhs) != PLUS_EXPR)
4028 incr = error_mark_node;
4031 iter_incr = build_x_binary_op (PLUS_EXPR,
4032 TREE_OPERAND (rhs, 0),
4035 tf_warning_or_error);
4036 if (error_operand_p (iter_incr))
4038 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4040 tf_warning_or_error);
4041 if (error_operand_p (iter_incr))
4043 incr = TREE_OPERAND (rhs, 0);
4048 incr = error_mark_node;
4051 incr = error_mark_node;
4054 incr = error_mark_node;
4058 if (incr == error_mark_node)
4060 error ("%Hinvalid increment expression", &elocus);
4064 incr = cp_convert (TREE_TYPE (diff), incr);
4065 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4066 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4067 && OMP_CLAUSE_DECL (c) == iter)
4070 decl = create_temporary_var (TREE_TYPE (diff));
4072 add_decl_expr (decl);
4073 last = create_temporary_var (TREE_TYPE (diff));
4075 add_decl_expr (last);
4076 if (c && iter_incr == NULL)
4078 incr_var = create_temporary_var (TREE_TYPE (diff));
4079 pushdecl (incr_var);
4080 add_decl_expr (incr_var);
4082 gcc_assert (stmts_are_full_exprs_p ());
4084 orig_pre_body = *pre_body;
4085 *pre_body = push_stmt_list ();
4087 add_stmt (orig_pre_body);
4089 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4090 tf_warning_or_error));
4091 init = build_int_cst (TREE_TYPE (diff), 0);
4092 if (c && iter_incr == NULL)
4094 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4095 incr, tf_warning_or_error));
4097 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4098 tf_warning_or_error);
4100 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4101 tf_warning_or_error));
4102 *pre_body = pop_stmt_list (*pre_body);
4104 cond = cp_build_binary_op (elocus,
4105 TREE_CODE (cond), decl, diff,
4106 tf_warning_or_error);
4107 incr = build_modify_expr (elocus, decl, PLUS_EXPR, incr);
4110 *body = push_stmt_list ();
4111 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4112 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4113 tf_warning_or_error);
4114 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4115 finish_expr_stmt (iter_init);
4116 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4117 tf_warning_or_error));
4118 add_stmt (orig_body);
4119 *body = pop_stmt_list (*body);
4123 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4124 finish_expr_stmt (iter_incr);
4125 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4126 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4129 TREE_VEC_ELT (declv, i) = decl;
4130 TREE_VEC_ELT (initv, i) = init;
4131 TREE_VEC_ELT (condv, i) = cond;
4132 TREE_VEC_ELT (incrv, i) = incr;
4137 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4138 are directly for their associated operands in the statement. DECL
4139 and INIT are a combo; if DECL is NULL then INIT ought to be a
4140 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4141 optional statements that need to go before the loop into its
4145 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4146 tree incrv, tree body, tree pre_body, tree clauses)
4148 tree omp_for = NULL, orig_incr = NULL;
4149 tree decl, init, cond, incr;
4153 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4154 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4155 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4156 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4158 decl = TREE_VEC_ELT (declv, i);
4159 init = TREE_VEC_ELT (initv, i);
4160 cond = TREE_VEC_ELT (condv, i);
4161 incr = TREE_VEC_ELT (incrv, i);
4167 switch (TREE_CODE (init))
4170 decl = TREE_OPERAND (init, 0);
4171 init = TREE_OPERAND (init, 1);
4174 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4176 decl = TREE_OPERAND (init, 0);
4177 init = TREE_OPERAND (init, 2);
4186 error ("%Hexpected iteration declaration or initialization",
4192 if (init && EXPR_HAS_LOCATION (init))
4193 elocus = EXPR_LOCATION (init);
4197 error ("%Hmissing controlling predicate", &elocus);
4203 error ("%Hmissing increment expression", &elocus);
4207 TREE_VEC_ELT (declv, i) = decl;
4208 TREE_VEC_ELT (initv, i) = init;
4211 if (dependent_omp_for_p (declv, initv, condv, incrv))
4215 stmt = make_node (OMP_FOR);
4217 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4219 /* This is really just a place-holder. We'll be decomposing this
4220 again and going through the cp_build_modify_expr path below when
4221 we instantiate the thing. */
4222 TREE_VEC_ELT (initv, i)
4223 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4224 TREE_VEC_ELT (initv, i));
4227 TREE_TYPE (stmt) = void_type_node;
4228 OMP_FOR_INIT (stmt) = initv;
4229 OMP_FOR_COND (stmt) = condv;
4230 OMP_FOR_INCR (stmt) = incrv;
4231 OMP_FOR_BODY (stmt) = body;
4232 OMP_FOR_PRE_BODY (stmt) = pre_body;
4233 OMP_FOR_CLAUSES (stmt) = clauses;
4235 SET_EXPR_LOCATION (stmt, locus);
4236 return add_stmt (stmt);
4239 if (processing_template_decl)
4240 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4242 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4244 decl = TREE_VEC_ELT (declv, i);
4245 init = TREE_VEC_ELT (initv, i);
4246 cond = TREE_VEC_ELT (condv, i);
4247 incr = TREE_VEC_ELT (incrv, i);
4249 TREE_VEC_ELT (orig_incr, i) = incr;
4252 if (init && EXPR_HAS_LOCATION (init))
4253 elocus = EXPR_LOCATION (init);
4257 error ("%Hexpected iteration declaration or initialization",
4262 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4265 TREE_VEC_ELT (orig_incr, i) = incr;
4266 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4267 TREE_CODE (TREE_OPERAND (incr, 1)),
4268 TREE_OPERAND (incr, 2),
4269 tf_warning_or_error);
4272 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4274 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4275 incrv, &body, &pre_body, clauses))
4280 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4281 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4283 error ("%Hinvalid type for iteration variable %qE", &elocus, decl);
4287 if (!processing_template_decl)
4289 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4290 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4293 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4295 && TREE_SIDE_EFFECTS (cond)
4296 && COMPARISON_CLASS_P (cond)
4297 && !processing_template_decl)
4299 tree t = TREE_OPERAND (cond, 0);
4300 if (TREE_SIDE_EFFECTS (t)
4302 && (TREE_CODE (t) != NOP_EXPR
4303 || TREE_OPERAND (t, 0) != decl))
4304 TREE_OPERAND (cond, 0)
4305 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4307 t = TREE_OPERAND (cond, 1);
4308 if (TREE_SIDE_EFFECTS (t)
4310 && (TREE_CODE (t) != NOP_EXPR
4311 || TREE_OPERAND (t, 0) != decl))
4312 TREE_OPERAND (cond, 1)
4313 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4315 if (decl == error_mark_node || init == error_mark_node)
4318 TREE_VEC_ELT (declv, i) = decl;
4319 TREE_VEC_ELT (initv, i) = init;
4320 TREE_VEC_ELT (condv, i) = cond;
4321 TREE_VEC_ELT (incrv, i) = incr;
4325 if (IS_EMPTY_STMT (pre_body))
4328 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4331 if (omp_for == NULL)
4334 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4336 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4337 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4339 if (TREE_CODE (incr) != MODIFY_EXPR)
4342 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4343 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4344 && !processing_template_decl)
4346 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4347 if (TREE_SIDE_EFFECTS (t)
4349 && (TREE_CODE (t) != NOP_EXPR
4350 || TREE_OPERAND (t, 0) != decl))
4351 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4352 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4354 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4355 if (TREE_SIDE_EFFECTS (t)
4357 && (TREE_CODE (t) != NOP_EXPR
4358 || TREE_OPERAND (t, 0) != decl))
4359 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4360 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4364 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4366 if (omp_for != NULL)
4367 OMP_FOR_CLAUSES (omp_for) = clauses;
4372 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4381 dependent_p = false;
4384 /* Even in a template, we can detect invalid uses of the atomic
4385 pragma if neither LHS nor RHS is type-dependent. */
4386 if (processing_template_decl)
4388 dependent_p = (type_dependent_expression_p (lhs)
4389 || type_dependent_expression_p (rhs));
4392 lhs = build_non_dependent_expr (lhs);
4393 rhs = build_non_dependent_expr (rhs);
4398 stmt = c_finish_omp_atomic (code, lhs, rhs);
4399 if (stmt == error_mark_node)
4402 if (processing_template_decl)
4403 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4404 build2 (code, void_type_node, orig_lhs, orig_rhs));
4409 finish_omp_barrier (void)
4411 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4412 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4413 finish_expr_stmt (stmt);
4417 finish_omp_flush (void)
4419 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4420 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4421 finish_expr_stmt (stmt);
4425 finish_omp_taskwait (void)
4427 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4428 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4429 finish_expr_stmt (stmt);
4433 init_cp_semantics (void)
4437 /* Build a STATIC_ASSERT for a static assertion with the condition
4438 CONDITION and the message text MESSAGE. LOCATION is the location
4439 of the static assertion in the source code. When MEMBER_P, this
4440 static assertion is a member of a class. */
4442 finish_static_assert (tree condition, tree message, location_t location,
4445 if (check_for_bare_parameter_packs (condition))
4446 condition = error_mark_node;
4448 if (type_dependent_expression_p (condition)
4449 || value_dependent_expression_p (condition))
4451 /* We're in a template; build a STATIC_ASSERT and put it in
4455 assertion = make_node (STATIC_ASSERT);
4456 STATIC_ASSERT_CONDITION (assertion) = condition;
4457 STATIC_ASSERT_MESSAGE (assertion) = message;
4458 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4461 maybe_add_class_template_decl_list (current_class_type,
4465 add_stmt (assertion);
4470 /* Fold the expression and convert it to a boolean value. */
4471 condition = fold_non_dependent_expr (condition);
4472 condition = cp_convert (boolean_type_node, condition);
4474 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4475 /* Do nothing; the condition is satisfied. */
4479 location_t saved_loc = input_location;
4481 input_location = location;
4482 if (TREE_CODE (condition) == INTEGER_CST
4483 && integer_zerop (condition))
4484 /* Report the error. */
4485 error ("static assertion failed: %E", message);
4486 else if (condition && condition != error_mark_node)
4487 error ("non-constant condition for static assertion");
4488 input_location = saved_loc;
4492 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4493 just return the type even though EXPR is a type-dependent expression.
4494 The ABI specifies which cases this applies to, which is a subset of the
4498 describable_type (tree expr)
4500 tree type = NULL_TREE;
4502 /* processing_template_decl isn't set when we're called from the mangling
4503 code, so bump it now. */
4504 ++processing_template_decl;
4505 if (! type_dependent_expression_p (expr)
4506 && ! type_unknown_p (expr))
4508 type = TREE_TYPE (expr);
4509 if (real_lvalue_p (expr))
4510 type = build_reference_type (type);
4512 --processing_template_decl;
4517 switch (TREE_CODE (expr))
4523 /* Named rvalue reference becomes lvalue. */
4524 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4529 case TEMPLATE_PARM_INDEX:
4531 case STATIC_CAST_EXPR:
4532 case REINTERPRET_CAST_EXPR:
4533 case CONST_CAST_EXPR:
4534 case DYNAMIC_CAST_EXPR:
4535 type = TREE_TYPE (expr);
4540 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4541 if (ptrtype && POINTER_TYPE_P (ptrtype))
4542 type = build_reference_type (TREE_TYPE (ptrtype));
4547 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4548 type = TREE_TYPE (expr);
4552 if (type && type_uses_auto (type))
4558 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4559 suitable for use as a type-specifier.
4561 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4562 id-expression or a class member access, FALSE when it was parsed as
4563 a full expression. */
4566 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4568 tree orig_expr = expr;
4569 tree type = NULL_TREE;
4571 if (!expr || error_operand_p (expr))
4572 return error_mark_node;
4575 || TREE_CODE (expr) == TYPE_DECL
4576 || (TREE_CODE (expr) == BIT_NOT_EXPR
4577 && TYPE_P (TREE_OPERAND (expr, 0))))
4579 error ("argument to decltype must be an expression");
4580 return error_mark_node;
4583 if (type_dependent_expression_p (expr))
4585 if (id_expression_or_member_access_p)
4587 switch (TREE_CODE (expr))
4594 case TEMPLATE_PARM_INDEX:
4595 type = TREE_TYPE (expr);
4603 type = describable_type (expr);
4605 if (type && !type_uses_auto (type))
4608 type = cxx_make_type (DECLTYPE_TYPE);
4609 DECLTYPE_TYPE_EXPR (type) = expr;
4610 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4611 = id_expression_or_member_access_p;
4612 SET_TYPE_STRUCTURAL_EQUALITY (type);
4617 /* The type denoted by decltype(e) is defined as follows: */
4619 if (id_expression_or_member_access_p)
4621 /* If e is an id-expression or a class member access (5.2.5
4622 [expr.ref]), decltype(e) is defined as the type of the entity
4623 named by e. If there is no such entity, or e names a set of
4624 overloaded functions, the program is ill-formed. */
4625 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4626 expr = lookup_name (expr);
4628 if (TREE_CODE (expr) == INDIRECT_REF)
4629 /* This can happen when the expression is, e.g., "a.b". Just
4630 look at the underlying operand. */
4631 expr = TREE_OPERAND (expr, 0);
4633 if (TREE_CODE (expr) == OFFSET_REF
4634 || TREE_CODE (expr) == MEMBER_REF)
4635 /* We're only interested in the field itself. If it is a
4636 BASELINK, we will need to see through it in the next
4638 expr = TREE_OPERAND (expr, 1);
4640 if (TREE_CODE (expr) == BASELINK)
4641 /* See through BASELINK nodes to the underlying functions. */
4642 expr = BASELINK_FUNCTIONS (expr);
4644 if (TREE_CODE (expr) == OVERLOAD)
4646 if (OVL_CHAIN (expr))
4648 error ("%qE refers to a set of overloaded functions", orig_expr);
4649 return error_mark_node;
4652 /* An overload set containing only one function: just look
4653 at that function. */
4654 expr = OVL_FUNCTION (expr);
4657 switch (TREE_CODE (expr))
4660 if (DECL_BIT_FIELD_TYPE (expr))
4662 type = DECL_BIT_FIELD_TYPE (expr);
4665 /* Fall through for fields that aren't bitfields. */
4672 case TEMPLATE_PARM_INDEX:
4673 type = TREE_TYPE (expr);
4677 type = error_mark_node;
4681 type = is_bitfield_expr_with_lowered_type (expr);
4683 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4690 /* We can get here when the id-expression refers to an
4692 type = TREE_TYPE (expr);
4696 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4697 || TREE_CODE (expr) == SCOPE_REF);
4698 error ("argument to decltype must be an expression");
4699 return error_mark_node;
4704 /* Expressions of reference type are sometimes wrapped in
4705 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4706 representation, not part of the language, so we have to look
4708 if (TREE_CODE (expr) == INDIRECT_REF
4709 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4711 expr = TREE_OPERAND (expr, 0);
4713 if (TREE_CODE (expr) == CALL_EXPR)
4715 /* If e is a function call (5.2.2 [expr.call]) or an
4716 invocation of an overloaded operator (parentheses around e
4717 are ignored), decltype(e) is defined as the return type of
4719 tree fndecl = get_callee_fndecl (expr);
4720 if (fndecl && fndecl != error_mark_node)
4721 type = TREE_TYPE (TREE_TYPE (fndecl));
4724 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4725 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4726 || TREE_CODE (target_type) == POINTER_TYPE)
4727 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4728 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4729 type = TREE_TYPE (TREE_TYPE (target_type));
4731 sorry ("unable to determine the declared type of expression %<%E%>",
4737 type = is_bitfield_expr_with_lowered_type (expr);
4740 /* Bitfields are special, because their type encodes the
4741 number of bits they store. If the expression referenced a
4742 bitfield, TYPE now has the declared type of that
4744 type = cp_build_qualified_type (type,
4745 cp_type_quals (TREE_TYPE (expr)));
4747 if (real_lvalue_p (expr))
4748 type = build_reference_type (type);
4752 /* Otherwise, where T is the type of e, if e is an lvalue,
4753 decltype(e) is defined as T&, otherwise decltype(e) is
4755 type = TREE_TYPE (expr);
4756 if (type == error_mark_node)
4757 return error_mark_node;
4758 else if (expr == current_class_ptr)
4759 /* If the expression is just "this", we want the
4760 cv-unqualified pointer for the "this" type. */
4761 type = TYPE_MAIN_VARIANT (type);
4762 else if (real_lvalue_p (expr))
4764 if (TREE_CODE (type) != REFERENCE_TYPE)
4765 type = build_reference_type (type);
4768 type = non_reference (type);
4773 if (!type || type == unknown_type_node)
4775 error ("type of %qE is unknown", expr);
4776 return error_mark_node;
4782 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4783 __has_nothrow_copy, depending on assign_p. */
4786 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4793 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4796 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4798 else if (TYPE_HAS_INIT_REF (type))
4800 /* If construction of the copy constructor was postponed, create
4802 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4803 lazily_declare_fn (sfk_copy_constructor, type);
4804 fns = CLASSTYPE_CONSTRUCTORS (type);
4809 for (; fns; fns = OVL_NEXT (fns))
4811 tree fn = OVL_CURRENT (fns);
4815 if (copy_fn_p (fn) == 0)
4818 else if (copy_fn_p (fn) <= 0)
4821 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4828 /* Actually evaluates the trait. */
4831 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4833 enum tree_code type_code1;
4836 type_code1 = TREE_CODE (type1);
4840 case CPTK_HAS_NOTHROW_ASSIGN:
4841 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4842 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4843 || (CLASS_TYPE_P (type1)
4844 && classtype_has_nothrow_assign_or_copy_p (type1,
4847 case CPTK_HAS_TRIVIAL_ASSIGN:
4848 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4849 && (pod_type_p (type1)
4850 || (CLASS_TYPE_P (type1)
4851 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4853 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4854 type1 = strip_array_types (type1);
4855 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4856 || (CLASS_TYPE_P (type1)
4857 && (t = locate_ctor (type1, NULL))
4858 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4860 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4861 type1 = strip_array_types (type1);
4862 return (pod_type_p (type1)
4863 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4865 case CPTK_HAS_NOTHROW_COPY:
4866 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4867 || (CLASS_TYPE_P (type1)
4868 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4870 case CPTK_HAS_TRIVIAL_COPY:
4871 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4872 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4874 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4875 type1 = strip_array_types (type1);
4876 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4877 || (CLASS_TYPE_P (type1)
4878 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4880 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4881 return (CLASS_TYPE_P (type1)
4882 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4884 case CPTK_IS_ABSTRACT:
4885 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4887 case CPTK_IS_BASE_OF:
4888 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4889 && DERIVED_FROM_P (type1, type2));
4892 return (NON_UNION_CLASS_TYPE_P (type1));
4894 case CPTK_IS_CONVERTIBLE_TO:
4899 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4902 return (type_code1 == ENUMERAL_TYPE);
4905 return (pod_type_p (type1));
4907 case CPTK_IS_POLYMORPHIC:
4908 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4911 return (type_code1 == UNION_TYPE);
4919 /* Process a trait expression. */
4922 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4924 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4925 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4926 || kind == CPTK_HAS_NOTHROW_COPY
4927 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4928 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4929 || kind == CPTK_HAS_TRIVIAL_COPY
4930 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4931 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4932 || kind == CPTK_IS_ABSTRACT
4933 || kind == CPTK_IS_BASE_OF
4934 || kind == CPTK_IS_CLASS
4935 || kind == CPTK_IS_CONVERTIBLE_TO
4936 || kind == CPTK_IS_EMPTY
4937 || kind == CPTK_IS_ENUM
4938 || kind == CPTK_IS_POD
4939 || kind == CPTK_IS_POLYMORPHIC
4940 || kind == CPTK_IS_UNION);
4942 if (kind == CPTK_IS_CONVERTIBLE_TO)
4944 sorry ("__is_convertible_to");
4945 return error_mark_node;
4948 if (type1 == error_mark_node
4949 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4950 && type2 == error_mark_node))
4951 return error_mark_node;
4953 if (processing_template_decl)
4955 tree trait_expr = make_node (TRAIT_EXPR);
4956 TREE_TYPE (trait_expr) = boolean_type_node;
4957 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4958 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4959 TRAIT_EXPR_KIND (trait_expr) = kind;
4963 complete_type (type1);
4965 complete_type (type2);
4967 /* The only required diagnostic. */
4968 if (kind == CPTK_IS_BASE_OF
4969 && NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4970 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
4971 && !COMPLETE_TYPE_P (type2))
4973 error ("incomplete type %qT not allowed", type2);
4974 return error_mark_node;
4977 return (trait_expr_value (kind, type1, type2)
4978 ? boolean_true_node : boolean_false_node);
4981 #include "gt-cp-semantics.h"