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're not checking, return immediately. */
1533 if (deferred_access_no_check)
1536 /* Determine the SCOPE of DECL. */
1537 scope = context_for_name_lookup (decl);
1538 /* If the SCOPE is not a type, then DECL is not a member. */
1539 if (!TYPE_P (scope))
1541 /* Compute the scope through which DECL is being accessed. */
1543 /* OBJECT_TYPE might not be a class type; consider:
1545 class A { typedef int I; };
1549 In this case, we will have "A::I" as the DECL, but "I" as the
1551 && CLASS_TYPE_P (object_type)
1552 && DERIVED_FROM_P (scope, object_type))
1553 /* If we are processing a `->' or `.' expression, use the type of the
1555 qualifying_type = object_type;
1556 else if (nested_name_specifier)
1558 /* If the reference is to a non-static member of the
1559 current class, treat it as if it were referenced through
1561 if (DECL_NONSTATIC_MEMBER_P (decl)
1562 && current_class_ptr
1563 && DERIVED_FROM_P (scope, current_class_type))
1564 qualifying_type = current_class_type;
1565 /* Otherwise, use the type indicated by the
1566 nested-name-specifier. */
1568 qualifying_type = nested_name_specifier;
1571 /* Otherwise, the name must be from the current class or one of
1573 qualifying_type = currently_open_derived_class (scope);
1576 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1577 or similar in a default argument value. */
1578 && CLASS_TYPE_P (qualifying_type)
1579 && !dependent_type_p (qualifying_type))
1580 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1584 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1585 class named to the left of the "::" operator. DONE is true if this
1586 expression is a complete postfix-expression; it is false if this
1587 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1588 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1589 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1590 is true iff this qualified name appears as a template argument. */
1593 finish_qualified_id_expr (tree qualifying_class,
1598 bool template_arg_p)
1600 gcc_assert (TYPE_P (qualifying_class));
1602 if (error_operand_p (expr))
1603 return error_mark_node;
1605 if (DECL_P (expr) || BASELINK_P (expr))
1609 check_template_keyword (expr);
1611 /* If EXPR occurs as the operand of '&', use special handling that
1612 permits a pointer-to-member. */
1613 if (address_p && done)
1615 if (TREE_CODE (expr) == SCOPE_REF)
1616 expr = TREE_OPERAND (expr, 1);
1617 expr = build_offset_ref (qualifying_class, expr,
1618 /*address_p=*/true);
1622 /* Within the scope of a class, turn references to non-static
1623 members into expression of the form "this->...". */
1625 /* But, within a template argument, we do not want make the
1626 transformation, as there is no "this" pointer. */
1628 else if (TREE_CODE (expr) == FIELD_DECL)
1630 push_deferring_access_checks (dk_no_check);
1631 expr = finish_non_static_data_member (expr, current_class_ref,
1633 pop_deferring_access_checks ();
1635 else if (BASELINK_P (expr) && !processing_template_decl)
1639 /* See if any of the functions are non-static members. */
1640 fns = BASELINK_FUNCTIONS (expr);
1641 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1642 fns = TREE_OPERAND (fns, 0);
1643 /* If so, the expression may be relative to the current
1645 if (!shared_member_p (fns)
1646 && current_class_type
1647 && DERIVED_FROM_P (qualifying_class, current_class_type))
1648 expr = (build_class_member_access_expr
1649 (maybe_dummy_object (qualifying_class, NULL),
1651 BASELINK_ACCESS_BINFO (expr),
1652 /*preserve_reference=*/false,
1653 tf_warning_or_error));
1655 /* The expression is a qualified name whose address is not
1657 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1663 /* Begin a statement-expression. The value returned must be passed to
1664 finish_stmt_expr. */
1667 begin_stmt_expr (void)
1669 return push_stmt_list ();
1672 /* Process the final expression of a statement expression. EXPR can be
1673 NULL, if the final expression is empty. Return a STATEMENT_LIST
1674 containing all the statements in the statement-expression, or
1675 ERROR_MARK_NODE if there was an error. */
1678 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1680 if (error_operand_p (expr))
1682 /* The type of the statement-expression is the type of the last
1684 TREE_TYPE (stmt_expr) = error_mark_node;
1685 return error_mark_node;
1688 /* If the last statement does not have "void" type, then the value
1689 of the last statement is the value of the entire expression. */
1692 tree type = TREE_TYPE (expr);
1694 if (processing_template_decl)
1696 expr = build_stmt (EXPR_STMT, expr);
1697 expr = add_stmt (expr);
1698 /* Mark the last statement so that we can recognize it as such at
1699 template-instantiation time. */
1700 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1702 else if (VOID_TYPE_P (type))
1704 /* Just treat this like an ordinary statement. */
1705 expr = finish_expr_stmt (expr);
1709 /* It actually has a value we need to deal with. First, force it
1710 to be an rvalue so that we won't need to build up a copy
1711 constructor call later when we try to assign it to something. */
1712 expr = force_rvalue (expr);
1713 if (error_operand_p (expr))
1714 return error_mark_node;
1716 /* Update for array-to-pointer decay. */
1717 type = TREE_TYPE (expr);
1719 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1720 normal statement, but don't convert to void or actually add
1722 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1723 expr = maybe_cleanup_point_expr (expr);
1727 /* The type of the statement-expression is the type of the last
1729 TREE_TYPE (stmt_expr) = type;
1735 /* Finish a statement-expression. EXPR should be the value returned
1736 by the previous begin_stmt_expr. Returns an expression
1737 representing the statement-expression. */
1740 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1745 if (error_operand_p (stmt_expr))
1747 pop_stmt_list (stmt_expr);
1748 return error_mark_node;
1751 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1753 type = TREE_TYPE (stmt_expr);
1754 result = pop_stmt_list (stmt_expr);
1755 TREE_TYPE (result) = type;
1757 if (processing_template_decl)
1759 result = build_min (STMT_EXPR, type, result);
1760 TREE_SIDE_EFFECTS (result) = 1;
1761 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1763 else if (CLASS_TYPE_P (type))
1765 /* Wrap the statement-expression in a TARGET_EXPR so that the
1766 temporary object created by the final expression is destroyed at
1767 the end of the full-expression containing the
1768 statement-expression. */
1769 result = force_target_expr (type, result);
1775 /* Returns the expression which provides the value of STMT_EXPR. */
1778 stmt_expr_value_expr (tree stmt_expr)
1780 tree t = STMT_EXPR_STMT (stmt_expr);
1782 if (TREE_CODE (t) == BIND_EXPR)
1783 t = BIND_EXPR_BODY (t);
1785 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1786 t = STATEMENT_LIST_TAIL (t)->stmt;
1788 if (TREE_CODE (t) == EXPR_STMT)
1789 t = EXPR_STMT_EXPR (t);
1794 /* Perform Koenig lookup. FN is the postfix-expression representing
1795 the function (or functions) to call; ARGS are the arguments to the
1796 call. Returns the functions to be considered by overload
1800 perform_koenig_lookup (tree fn, tree args)
1802 tree identifier = NULL_TREE;
1803 tree functions = NULL_TREE;
1805 /* Find the name of the overloaded function. */
1806 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1808 else if (is_overloaded_fn (fn))
1811 identifier = DECL_NAME (get_first_fn (functions));
1813 else if (DECL_P (fn))
1816 identifier = DECL_NAME (fn);
1819 /* A call to a namespace-scope function using an unqualified name.
1821 Do Koenig lookup -- unless any of the arguments are
1823 if (!any_type_dependent_arguments_p (args))
1825 fn = lookup_arg_dependent (identifier, functions, args);
1827 /* The unqualified name could not be resolved. */
1828 fn = unqualified_fn_lookup_error (identifier);
1834 /* Generate an expression for `FN (ARGS)'.
1836 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1837 as a virtual call, even if FN is virtual. (This flag is set when
1838 encountering an expression where the function name is explicitly
1839 qualified. For example a call to `X::f' never generates a virtual
1842 Returns code for the call. */
1845 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p,
1846 tsubst_flags_t complain)
1852 if (fn == error_mark_node || args == error_mark_node)
1853 return error_mark_node;
1855 /* ARGS should be a list of arguments. */
1856 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1857 gcc_assert (!TYPE_P (fn));
1862 if (processing_template_decl)
1864 if (type_dependent_expression_p (fn)
1865 || any_type_dependent_arguments_p (args))
1867 result = build_nt_call_list (fn, args);
1868 KOENIG_LOOKUP_P (result) = koenig_p;
1873 tree fndecl = OVL_CURRENT (fn);
1874 if (TREE_CODE (fndecl) != FUNCTION_DECL
1875 || !TREE_THIS_VOLATILE (fndecl))
1881 current_function_returns_abnormally = 1;
1885 if (!BASELINK_P (fn)
1886 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1887 && TREE_TYPE (fn) != unknown_type_node)
1888 fn = build_non_dependent_expr (fn);
1889 args = build_non_dependent_args (orig_args);
1892 if (is_overloaded_fn (fn))
1893 fn = baselink_for_fns (fn);
1896 if (BASELINK_P (fn))
1900 /* A call to a member function. From [over.call.func]:
1902 If the keyword this is in scope and refers to the class of
1903 that member function, or a derived class thereof, then the
1904 function call is transformed into a qualified function call
1905 using (*this) as the postfix-expression to the left of the
1906 . operator.... [Otherwise] a contrived object of type T
1907 becomes the implied object argument.
1909 This paragraph is unclear about this situation:
1911 struct A { void f(); };
1912 struct B : public A {};
1913 struct C : public A { void g() { B::f(); }};
1915 In particular, for `B::f', this paragraph does not make clear
1916 whether "the class of that member function" refers to `A' or
1917 to `B'. We believe it refers to `B'. */
1918 if (current_class_type
1919 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1921 && current_class_ref)
1922 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1926 tree representative_fn;
1928 representative_fn = BASELINK_FUNCTIONS (fn);
1929 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1930 representative_fn = TREE_OPERAND (representative_fn, 0);
1931 representative_fn = get_first_fn (representative_fn);
1932 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1935 if (processing_template_decl)
1937 if (type_dependent_expression_p (object))
1938 return build_nt_call_list (orig_fn, orig_args);
1939 object = build_non_dependent_expr (object);
1942 result = build_new_method_call (object, fn, args, NULL_TREE,
1944 ? LOOKUP_NONVIRTUAL : 0),
1948 else if (is_overloaded_fn (fn))
1950 /* If the function is an overloaded builtin, resolve it. */
1951 if (TREE_CODE (fn) == FUNCTION_DECL
1952 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1953 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1954 result = resolve_overloaded_builtin (fn, args);
1957 /* A call to a namespace-scope function. */
1958 result = build_new_function_call (fn, args, koenig_p, complain);
1960 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1963 error ("arguments to destructor are not allowed");
1964 /* Mark the pseudo-destructor call as having side-effects so
1965 that we do not issue warnings about its use. */
1966 result = build1 (NOP_EXPR,
1968 TREE_OPERAND (fn, 0));
1969 TREE_SIDE_EFFECTS (result) = 1;
1971 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1972 /* If the "function" is really an object of class type, it might
1973 have an overloaded `operator ()'. */
1974 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1975 /*overloaded_p=*/NULL, complain);
1978 /* A call where the function is unknown. */
1979 result = cp_build_function_call (fn, args, complain);
1981 if (processing_template_decl)
1983 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
1984 /* Don't repeat arg-dependent lookup at instantiation time if this call
1985 is not type-dependent. */
1986 KOENIG_LOOKUP_P (result) = 0;
1991 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1992 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1993 POSTDECREMENT_EXPR.) */
1996 finish_increment_expr (tree expr, enum tree_code code)
1998 return build_x_unary_op (code, expr, tf_warning_or_error);
2001 /* Finish a use of `this'. Returns an expression for `this'. */
2004 finish_this_expr (void)
2008 if (current_class_ptr)
2010 result = current_class_ptr;
2012 else if (current_function_decl
2013 && DECL_STATIC_FUNCTION_P (current_function_decl))
2015 error ("%<this%> is unavailable for static member functions");
2016 result = error_mark_node;
2020 if (current_function_decl)
2021 error ("invalid use of %<this%> in non-member function");
2023 error ("invalid use of %<this%> at top level");
2024 result = error_mark_node;
2030 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2031 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2032 the TYPE for the type given. If SCOPE is non-NULL, the expression
2033 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2036 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2038 if (object == error_mark_node || destructor == error_mark_node)
2039 return error_mark_node;
2041 gcc_assert (TYPE_P (destructor));
2043 if (!processing_template_decl)
2045 if (scope == error_mark_node)
2047 error ("invalid qualifying scope in pseudo-destructor name");
2048 return error_mark_node;
2050 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2052 error ("qualified type %qT does not match destructor name ~%qT",
2054 return error_mark_node;
2058 /* [expr.pseudo] says both:
2060 The type designated by the pseudo-destructor-name shall be
2061 the same as the object type.
2065 The cv-unqualified versions of the object type and of the
2066 type designated by the pseudo-destructor-name shall be the
2069 We implement the more generous second sentence, since that is
2070 what most other compilers do. */
2071 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2074 error ("%qE is not of type %qT", object, destructor);
2075 return error_mark_node;
2079 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2082 /* Finish an expression of the form CODE EXPR. */
2085 finish_unary_op_expr (enum tree_code code, tree expr)
2087 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2088 /* Inside a template, build_x_unary_op does not fold the
2089 expression. So check whether the result is folded before
2090 setting TREE_NEGATED_INT. */
2091 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2092 && TREE_CODE (result) == INTEGER_CST
2093 && !TYPE_UNSIGNED (TREE_TYPE (result))
2094 && INT_CST_LT (result, integer_zero_node))
2096 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2097 setting TREE_NEGATED_INT. */
2098 result = copy_node (result);
2099 TREE_NEGATED_INT (result) = 1;
2101 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2102 overflow_warning (result);
2107 /* Finish a compound-literal expression. TYPE is the type to which
2108 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2111 finish_compound_literal (tree type, tree compound_literal)
2113 if (type == error_mark_node)
2114 return error_mark_node;
2116 if (!TYPE_OBJ_P (type))
2118 error ("compound literal of non-object type %qT", type);
2119 return error_mark_node;
2122 if (processing_template_decl)
2124 TREE_TYPE (compound_literal) = type;
2125 /* Mark the expression as a compound literal. */
2126 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2127 return compound_literal;
2130 type = complete_type (type);
2132 if (TYPE_NON_AGGREGATE_CLASS (type))
2134 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2135 everywhere that deals with function arguments would be a pain, so
2136 just wrap it in a TREE_LIST. The parser set a flag so we know
2137 that it came from T{} rather than T({}). */
2138 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2139 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2140 return build_functional_cast (type, compound_literal, tf_error);
2143 if (TREE_CODE (type) == ARRAY_TYPE
2144 && check_array_initializer (NULL_TREE, type, compound_literal))
2145 return error_mark_node;
2146 compound_literal = reshape_init (type, compound_literal);
2147 if (TREE_CODE (type) == ARRAY_TYPE)
2148 cp_complete_array_type (&type, compound_literal, false);
2149 compound_literal = digest_init (type, compound_literal);
2150 if ((!at_function_scope_p () || cp_type_readonly (type))
2151 && initializer_constant_valid_p (compound_literal, type))
2153 tree decl = create_temporary_var (type);
2154 DECL_INITIAL (decl) = compound_literal;
2155 TREE_STATIC (decl) = 1;
2156 decl = pushdecl_top_level (decl);
2157 DECL_NAME (decl) = make_anon_name ();
2158 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2162 return get_target_expr (compound_literal);
2165 /* Return the declaration for the function-name variable indicated by
2169 finish_fname (tree id)
2173 decl = fname_decl (input_location, C_RID_CODE (id), id);
2174 if (processing_template_decl)
2175 decl = DECL_NAME (decl);
2179 /* Finish a translation unit. */
2182 finish_translation_unit (void)
2184 /* In case there were missing closebraces,
2185 get us back to the global binding level. */
2187 while (current_namespace != global_namespace)
2190 /* Do file scope __FUNCTION__ et al. */
2191 finish_fname_decls ();
2194 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2195 Returns the parameter. */
2198 finish_template_type_parm (tree aggr, tree identifier)
2200 if (aggr != class_type_node)
2202 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2203 aggr = class_type_node;
2206 return build_tree_list (aggr, identifier);
2209 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2210 Returns the parameter. */
2213 finish_template_template_parm (tree aggr, tree identifier)
2215 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2216 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2217 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2218 DECL_TEMPLATE_RESULT (tmpl) = decl;
2219 DECL_ARTIFICIAL (decl) = 1;
2220 end_template_decl ();
2222 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2224 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2225 /*is_primary=*/true, /*is_partial=*/false,
2228 return finish_template_type_parm (aggr, tmpl);
2231 /* ARGUMENT is the default-argument value for a template template
2232 parameter. If ARGUMENT is invalid, issue error messages and return
2233 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2236 check_template_template_default_arg (tree argument)
2238 if (TREE_CODE (argument) != TEMPLATE_DECL
2239 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2240 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2242 if (TREE_CODE (argument) == TYPE_DECL)
2243 error ("invalid use of type %qT as a default value for a template "
2244 "template-parameter", TREE_TYPE (argument));
2246 error ("invalid default argument for a template template parameter");
2247 return error_mark_node;
2253 /* Begin a class definition, as indicated by T. */
2256 begin_class_definition (tree t, tree attributes)
2258 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2259 return error_mark_node;
2261 if (processing_template_parmlist)
2263 error ("definition of %q#T inside template parameter list", t);
2264 return error_mark_node;
2266 /* A non-implicit typename comes from code like:
2268 template <typename T> struct A {
2269 template <typename U> struct A<T>::B ...
2271 This is erroneous. */
2272 else if (TREE_CODE (t) == TYPENAME_TYPE)
2274 error ("invalid definition of qualified type %qT", t);
2275 t = error_mark_node;
2278 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2280 t = make_class_type (RECORD_TYPE);
2281 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2284 /* Update the location of the decl. */
2285 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2287 if (TYPE_BEING_DEFINED (t))
2289 t = make_class_type (TREE_CODE (t));
2290 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2292 maybe_process_partial_specialization (t);
2294 TYPE_BEING_DEFINED (t) = 1;
2296 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2298 if (flag_pack_struct)
2301 TYPE_PACKED (t) = 1;
2302 /* Even though the type is being defined for the first time
2303 here, there might have been a forward declaration, so there
2304 might be cv-qualified variants of T. */
2305 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2306 TYPE_PACKED (v) = 1;
2308 /* Reset the interface data, at the earliest possible
2309 moment, as it might have been set via a class foo;
2311 if (! TYPE_ANONYMOUS_P (t))
2313 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2314 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2315 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2316 (t, finfo->interface_unknown);
2318 reset_specialization();
2320 /* Make a declaration for this class in its own scope. */
2321 build_self_reference ();
2326 /* Finish the member declaration given by DECL. */
2329 finish_member_declaration (tree decl)
2331 if (decl == error_mark_node || decl == NULL_TREE)
2334 if (decl == void_type_node)
2335 /* The COMPONENT was a friend, not a member, and so there's
2336 nothing for us to do. */
2339 /* We should see only one DECL at a time. */
2340 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2342 /* Set up access control for DECL. */
2344 = (current_access_specifier == access_private_node);
2345 TREE_PROTECTED (decl)
2346 = (current_access_specifier == access_protected_node);
2347 if (TREE_CODE (decl) == TEMPLATE_DECL)
2349 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2350 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2353 /* Mark the DECL as a member of the current class. */
2354 DECL_CONTEXT (decl) = current_class_type;
2356 /* Check for bare parameter packs in the member variable declaration. */
2357 if (TREE_CODE (decl) == FIELD_DECL)
2359 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2360 TREE_TYPE (decl) = error_mark_node;
2361 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2362 DECL_ATTRIBUTES (decl) = NULL_TREE;
2367 A C language linkage is ignored for the names of class members
2368 and the member function type of class member functions. */
2369 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2370 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2372 /* Put functions on the TYPE_METHODS list and everything else on the
2373 TYPE_FIELDS list. Note that these are built up in reverse order.
2374 We reverse them (to obtain declaration order) in finish_struct. */
2375 if (TREE_CODE (decl) == FUNCTION_DECL
2376 || DECL_FUNCTION_TEMPLATE_P (decl))
2378 /* We also need to add this function to the
2379 CLASSTYPE_METHOD_VEC. */
2380 if (add_method (current_class_type, decl, NULL_TREE))
2382 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2383 TYPE_METHODS (current_class_type) = decl;
2385 maybe_add_class_template_decl_list (current_class_type, decl,
2389 /* Enter the DECL into the scope of the class. */
2390 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2391 || pushdecl_class_level (decl))
2393 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2394 go at the beginning. The reason is that lookup_field_1
2395 searches the list in order, and we want a field name to
2396 override a type name so that the "struct stat hack" will
2397 work. In particular:
2399 struct S { enum E { }; int E } s;
2402 is valid. In addition, the FIELD_DECLs must be maintained in
2403 declaration order so that class layout works as expected.
2404 However, we don't need that order until class layout, so we
2405 save a little time by putting FIELD_DECLs on in reverse order
2406 here, and then reversing them in finish_struct_1. (We could
2407 also keep a pointer to the correct insertion points in the
2410 if (TREE_CODE (decl) == TYPE_DECL)
2411 TYPE_FIELDS (current_class_type)
2412 = chainon (TYPE_FIELDS (current_class_type), decl);
2415 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2416 TYPE_FIELDS (current_class_type) = decl;
2419 maybe_add_class_template_decl_list (current_class_type, decl,
2424 note_decl_for_pch (decl);
2427 /* DECL has been declared while we are building a PCH file. Perform
2428 actions that we might normally undertake lazily, but which can be
2429 performed now so that they do not have to be performed in
2430 translation units which include the PCH file. */
2433 note_decl_for_pch (tree decl)
2435 gcc_assert (pch_file);
2437 /* There's a good chance that we'll have to mangle names at some
2438 point, even if only for emission in debugging information. */
2439 if ((TREE_CODE (decl) == VAR_DECL
2440 || TREE_CODE (decl) == FUNCTION_DECL)
2441 && !processing_template_decl)
2445 /* Finish processing a complete template declaration. The PARMS are
2446 the template parameters. */
2449 finish_template_decl (tree parms)
2452 end_template_decl ();
2454 end_specialization ();
2457 /* Finish processing a template-id (which names a type) of the form
2458 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2459 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2460 the scope of template-id indicated. */
2463 finish_template_type (tree name, tree args, int entering_scope)
2467 decl = lookup_template_class (name, args,
2468 NULL_TREE, NULL_TREE, entering_scope,
2469 tf_warning_or_error | tf_user);
2470 if (decl != error_mark_node)
2471 decl = TYPE_STUB_DECL (decl);
2476 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2477 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2478 BASE_CLASS, or NULL_TREE if an error occurred. The
2479 ACCESS_SPECIFIER is one of
2480 access_{default,public,protected_private}_node. For a virtual base
2481 we set TREE_TYPE. */
2484 finish_base_specifier (tree base, tree access, bool virtual_p)
2488 if (base == error_mark_node)
2490 error ("invalid base-class specification");
2493 else if (! MAYBE_CLASS_TYPE_P (base))
2495 error ("%qT is not a class type", base);
2500 if (cp_type_quals (base) != 0)
2502 error ("base class %qT has cv qualifiers", base);
2503 base = TYPE_MAIN_VARIANT (base);
2505 result = build_tree_list (access, base);
2507 TREE_TYPE (result) = integer_type_node;
2513 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2514 what we found when we tried to do the lookup.
2515 LOCATION is the location of the NAME identifier;
2516 The location is used in the error message*/
2519 qualified_name_lookup_error (tree scope, tree name,
2520 tree decl, location_t location)
2522 if (scope == error_mark_node)
2523 ; /* We already complained. */
2524 else if (TYPE_P (scope))
2526 if (!COMPLETE_TYPE_P (scope))
2527 error ("%Hincomplete type %qT used in nested name specifier",
2529 else if (TREE_CODE (decl) == TREE_LIST)
2531 error ("%Hreference to %<%T::%D%> is ambiguous", &location, scope, name);
2532 print_candidates (decl);
2535 error ("%H%qD is not a member of %qT", &location, name, scope);
2537 else if (scope != global_namespace)
2538 error ("%H%qD is not a member of %qD", &location, name, scope);
2540 error ("%H%<::%D%> has not been declared", &location, name);
2543 /* If FNS is a member function, a set of member functions, or a
2544 template-id referring to one or more member functions, return a
2545 BASELINK for FNS, incorporating the current access context.
2546 Otherwise, return FNS unchanged. */
2549 baselink_for_fns (tree fns)
2554 if (BASELINK_P (fns)
2555 || error_operand_p (fns))
2559 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2560 fn = TREE_OPERAND (fn, 0);
2561 fn = get_first_fn (fn);
2562 if (!DECL_FUNCTION_MEMBER_P (fn))
2565 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2567 cl = DECL_CONTEXT (fn);
2568 cl = TYPE_BINFO (cl);
2569 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2572 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2573 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2574 if non-NULL, is the type or namespace used to explicitly qualify
2575 ID_EXPRESSION. DECL is the entity to which that name has been
2578 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2579 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2580 be set to true if this expression isn't permitted in a
2581 constant-expression, but it is otherwise not set by this function.
2582 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2583 constant-expression, but a non-constant expression is also
2586 DONE is true if this expression is a complete postfix-expression;
2587 it is false if this expression is followed by '->', '[', '(', etc.
2588 ADDRESS_P is true iff this expression is the operand of '&'.
2589 TEMPLATE_P is true iff the qualified-id was of the form
2590 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2591 appears as a template argument.
2593 If an error occurs, and it is the kind of error that might cause
2594 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2595 is the caller's responsibility to issue the message. *ERROR_MSG
2596 will be a string with static storage duration, so the caller need
2599 Return an expression for the entity, after issuing appropriate
2600 diagnostics. This function is also responsible for transforming a
2601 reference to a non-static member into a COMPONENT_REF that makes
2602 the use of "this" explicit.
2604 Upon return, *IDK will be filled in appropriately. */
2606 finish_id_expression (tree id_expression,
2610 bool integral_constant_expression_p,
2611 bool allow_non_integral_constant_expression_p,
2612 bool *non_integral_constant_expression_p,
2616 bool template_arg_p,
2617 const char **error_msg,
2618 location_t location)
2620 /* Initialize the output parameters. */
2621 *idk = CP_ID_KIND_NONE;
2624 if (id_expression == error_mark_node)
2625 return error_mark_node;
2626 /* If we have a template-id, then no further lookup is
2627 required. If the template-id was for a template-class, we
2628 will sometimes have a TYPE_DECL at this point. */
2629 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2630 || TREE_CODE (decl) == TYPE_DECL)
2632 /* Look up the name. */
2635 if (decl == error_mark_node)
2637 /* Name lookup failed. */
2640 || (!dependent_type_p (scope)
2641 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2642 && IDENTIFIER_TYPENAME_P (id_expression)
2643 && dependent_type_p (TREE_TYPE (id_expression))))))
2645 /* If the qualifying type is non-dependent (and the name
2646 does not name a conversion operator to a dependent
2647 type), issue an error. */
2648 qualified_name_lookup_error (scope, id_expression, decl, location);
2649 return error_mark_node;
2653 /* It may be resolved via Koenig lookup. */
2654 *idk = CP_ID_KIND_UNQUALIFIED;
2655 return id_expression;
2658 decl = id_expression;
2660 /* If DECL is a variable that would be out of scope under
2661 ANSI/ISO rules, but in scope in the ARM, name lookup
2662 will succeed. Issue a diagnostic here. */
2664 decl = check_for_out_of_scope_variable (decl);
2666 /* Remember that the name was used in the definition of
2667 the current class so that we can check later to see if
2668 the meaning would have been different after the class
2669 was entirely defined. */
2670 if (!scope && decl != error_mark_node)
2671 maybe_note_name_used_in_class (id_expression, decl);
2673 /* Disallow uses of local variables from containing functions. */
2674 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2676 tree context = decl_function_context (decl);
2677 if (context != NULL_TREE && context != current_function_decl
2678 && ! TREE_STATIC (decl))
2680 error (TREE_CODE (decl) == VAR_DECL
2681 ? "use of %<auto%> variable from containing function"
2682 : "use of parameter from containing function");
2683 error (" %q+#D declared here", decl);
2684 return error_mark_node;
2689 /* If we didn't find anything, or what we found was a type,
2690 then this wasn't really an id-expression. */
2691 if (TREE_CODE (decl) == TEMPLATE_DECL
2692 && !DECL_FUNCTION_TEMPLATE_P (decl))
2694 *error_msg = "missing template arguments";
2695 return error_mark_node;
2697 else if (TREE_CODE (decl) == TYPE_DECL
2698 || TREE_CODE (decl) == NAMESPACE_DECL)
2700 *error_msg = "expected primary-expression";
2701 return error_mark_node;
2704 /* If the name resolved to a template parameter, there is no
2705 need to look it up again later. */
2706 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2707 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2711 *idk = CP_ID_KIND_NONE;
2712 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2713 decl = TEMPLATE_PARM_DECL (decl);
2714 r = convert_from_reference (DECL_INITIAL (decl));
2716 if (integral_constant_expression_p
2717 && !dependent_type_p (TREE_TYPE (decl))
2718 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2720 if (!allow_non_integral_constant_expression_p)
2721 error ("template parameter %qD of type %qT is not allowed in "
2722 "an integral constant expression because it is not of "
2723 "integral or enumeration type", decl, TREE_TYPE (decl));
2724 *non_integral_constant_expression_p = true;
2728 /* Similarly, we resolve enumeration constants to their
2729 underlying values. */
2730 else if (TREE_CODE (decl) == CONST_DECL)
2732 *idk = CP_ID_KIND_NONE;
2733 if (!processing_template_decl)
2735 used_types_insert (TREE_TYPE (decl));
2736 return DECL_INITIAL (decl);
2744 /* If the declaration was explicitly qualified indicate
2745 that. The semantics of `A::f(3)' are different than
2746 `f(3)' if `f' is virtual. */
2748 ? CP_ID_KIND_QUALIFIED
2749 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2750 ? CP_ID_KIND_TEMPLATE_ID
2751 : CP_ID_KIND_UNQUALIFIED));
2756 An id-expression is type-dependent if it contains an
2757 identifier that was declared with a dependent type.
2759 The standard is not very specific about an id-expression that
2760 names a set of overloaded functions. What if some of them
2761 have dependent types and some of them do not? Presumably,
2762 such a name should be treated as a dependent name. */
2763 /* Assume the name is not dependent. */
2764 dependent_p = false;
2765 if (!processing_template_decl)
2766 /* No names are dependent outside a template. */
2768 /* A template-id where the name of the template was not resolved
2769 is definitely dependent. */
2770 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2771 && (TREE_CODE (TREE_OPERAND (decl, 0))
2772 == IDENTIFIER_NODE))
2774 /* For anything except an overloaded function, just check its
2776 else if (!is_overloaded_fn (decl))
2778 = dependent_type_p (TREE_TYPE (decl));
2779 /* For a set of overloaded functions, check each of the
2785 if (BASELINK_P (fns))
2786 fns = BASELINK_FUNCTIONS (fns);
2788 /* For a template-id, check to see if the template
2789 arguments are dependent. */
2790 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2792 tree args = TREE_OPERAND (fns, 1);
2793 dependent_p = any_dependent_template_arguments_p (args);
2794 /* The functions are those referred to by the
2796 fns = TREE_OPERAND (fns, 0);
2799 /* If there are no dependent template arguments, go through
2800 the overloaded functions. */
2801 while (fns && !dependent_p)
2803 tree fn = OVL_CURRENT (fns);
2805 /* Member functions of dependent classes are
2807 if (TREE_CODE (fn) == FUNCTION_DECL
2808 && type_dependent_expression_p (fn))
2810 else if (TREE_CODE (fn) == TEMPLATE_DECL
2811 && dependent_template_p (fn))
2814 fns = OVL_NEXT (fns);
2818 /* If the name was dependent on a template parameter, we will
2819 resolve the name at instantiation time. */
2822 /* Create a SCOPE_REF for qualified names, if the scope is
2826 /* Since this name was dependent, the expression isn't
2827 constant -- yet. No error is issued because it might
2828 be constant when things are instantiated. */
2829 if (integral_constant_expression_p)
2830 *non_integral_constant_expression_p = true;
2833 if (address_p && done)
2834 decl = finish_qualified_id_expr (scope, decl,
2838 else if (dependent_type_p (scope))
2839 decl = build_qualified_name (/*type=*/NULL_TREE,
2843 else if (DECL_P (decl))
2844 decl = build_qualified_name (TREE_TYPE (decl),
2849 if (TREE_TYPE (decl))
2850 decl = convert_from_reference (decl);
2853 /* A TEMPLATE_ID already contains all the information we
2855 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2856 return id_expression;
2857 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2858 /* If we found a variable, then name lookup during the
2859 instantiation will always resolve to the same VAR_DECL
2860 (or an instantiation thereof). */
2861 if (TREE_CODE (decl) == VAR_DECL
2862 || TREE_CODE (decl) == PARM_DECL)
2863 return convert_from_reference (decl);
2864 /* The same is true for FIELD_DECL, but we also need to
2865 make sure that the syntax is correct. */
2866 else if (TREE_CODE (decl) == FIELD_DECL)
2868 /* Since SCOPE is NULL here, this is an unqualified name.
2869 Access checking has been performed during name lookup
2870 already. Turn off checking to avoid duplicate errors. */
2871 push_deferring_access_checks (dk_no_check);
2872 decl = finish_non_static_data_member
2873 (decl, current_class_ref,
2874 /*qualifying_scope=*/NULL_TREE);
2875 pop_deferring_access_checks ();
2878 return id_expression;
2881 /* Only certain kinds of names are allowed in constant
2882 expression. Enumerators and template parameters have already
2883 been handled above. */
2884 if (integral_constant_expression_p
2885 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2886 && ! builtin_valid_in_constant_expr_p (decl))
2888 if (!allow_non_integral_constant_expression_p)
2890 error ("%qD cannot appear in a constant-expression", decl);
2891 return error_mark_node;
2893 *non_integral_constant_expression_p = true;
2896 if (TREE_CODE (decl) == NAMESPACE_DECL)
2898 error ("use of namespace %qD as expression", decl);
2899 return error_mark_node;
2901 else if (DECL_CLASS_TEMPLATE_P (decl))
2903 error ("use of class template %qT as expression", decl);
2904 return error_mark_node;
2906 else if (TREE_CODE (decl) == TREE_LIST)
2908 /* Ambiguous reference to base members. */
2909 error ("request for member %qD is ambiguous in "
2910 "multiple inheritance lattice", id_expression);
2911 print_candidates (decl);
2912 return error_mark_node;
2915 /* Mark variable-like entities as used. Functions are similarly
2916 marked either below or after overload resolution. */
2917 if (TREE_CODE (decl) == VAR_DECL
2918 || TREE_CODE (decl) == PARM_DECL
2919 || TREE_CODE (decl) == RESULT_DECL)
2924 decl = (adjust_result_of_qualified_name_lookup
2925 (decl, scope, current_class_type));
2927 if (TREE_CODE (decl) == FUNCTION_DECL)
2930 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2931 decl = finish_qualified_id_expr (scope,
2939 tree r = convert_from_reference (decl);
2941 if (processing_template_decl && TYPE_P (scope))
2942 r = build_qualified_name (TREE_TYPE (r),
2948 else if (TREE_CODE (decl) == FIELD_DECL)
2950 /* Since SCOPE is NULL here, this is an unqualified name.
2951 Access checking has been performed during name lookup
2952 already. Turn off checking to avoid duplicate errors. */
2953 push_deferring_access_checks (dk_no_check);
2954 decl = finish_non_static_data_member (decl, current_class_ref,
2955 /*qualifying_scope=*/NULL_TREE);
2956 pop_deferring_access_checks ();
2958 else if (is_overloaded_fn (decl))
2963 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2964 first_fn = TREE_OPERAND (first_fn, 0);
2965 first_fn = get_first_fn (first_fn);
2966 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2967 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2969 if (!really_overloaded_fn (decl))
2970 mark_used (first_fn);
2973 && TREE_CODE (first_fn) == FUNCTION_DECL
2974 && DECL_FUNCTION_MEMBER_P (first_fn)
2975 && !shared_member_p (decl))
2977 /* A set of member functions. */
2978 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2979 return finish_class_member_access_expr (decl, id_expression,
2980 /*template_p=*/false,
2981 tf_warning_or_error);
2984 decl = baselink_for_fns (decl);
2988 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2989 && DECL_CLASS_SCOPE_P (decl))
2991 tree context = context_for_name_lookup (decl);
2992 if (context != current_class_type)
2994 tree path = currently_open_derived_class (context);
2995 perform_or_defer_access_check (TYPE_BINFO (path),
3000 decl = convert_from_reference (decl);
3004 if (TREE_DEPRECATED (decl))
3005 warn_deprecated_use (decl);
3010 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3011 use as a type-specifier. */
3014 finish_typeof (tree expr)
3018 if (type_dependent_expression_p (expr))
3020 type = cxx_make_type (TYPEOF_TYPE);
3021 TYPEOF_TYPE_EXPR (type) = expr;
3022 SET_TYPE_STRUCTURAL_EQUALITY (type);
3027 type = unlowered_expr_type (expr);
3029 if (!type || type == unknown_type_node)
3031 error ("type of %qE is unknown", expr);
3032 return error_mark_node;
3038 /* Perform C++-specific checks for __builtin_offsetof before calling
3042 finish_offsetof (tree expr)
3044 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3046 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3047 TREE_OPERAND (expr, 2));
3048 return error_mark_node;
3050 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3051 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3052 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3054 if (TREE_CODE (expr) == COMPONENT_REF
3055 || TREE_CODE (expr) == COMPOUND_EXPR)
3056 expr = TREE_OPERAND (expr, 1);
3057 error ("cannot apply %<offsetof%> to member function %qD", expr);
3058 return error_mark_node;
3060 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3061 expr = TREE_OPERAND (expr, 0);
3062 return fold_offsetof (expr, NULL_TREE);
3065 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3066 function is broken out from the above for the benefit of the tree-ssa
3070 simplify_aggr_init_expr (tree *tp)
3072 tree aggr_init_expr = *tp;
3074 /* Form an appropriate CALL_EXPR. */
3075 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3076 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3077 tree type = TREE_TYPE (slot);
3080 enum style_t { ctor, arg, pcc } style;
3082 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3084 #ifdef PCC_STATIC_STRUCT_RETURN
3090 gcc_assert (TREE_ADDRESSABLE (type));
3094 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3096 aggr_init_expr_nargs (aggr_init_expr),
3097 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3101 /* Replace the first argument to the ctor with the address of the
3103 cxx_mark_addressable (slot);
3104 CALL_EXPR_ARG (call_expr, 0) =
3105 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3107 else if (style == arg)
3109 /* Just mark it addressable here, and leave the rest to
3110 expand_call{,_inline}. */
3111 cxx_mark_addressable (slot);
3112 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3113 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3115 else if (style == pcc)
3117 /* If we're using the non-reentrant PCC calling convention, then we
3118 need to copy the returned value out of the static buffer into the
3120 push_deferring_access_checks (dk_no_check);
3121 call_expr = build_aggr_init (slot, call_expr,
3122 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3123 tf_warning_or_error);
3124 pop_deferring_access_checks ();
3125 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3128 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3130 tree init = build_zero_init (type, NULL_TREE,
3131 /*static_storage_p=*/false);
3132 init = build2 (INIT_EXPR, void_type_node, slot, init);
3133 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3140 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3143 emit_associated_thunks (tree fn)
3145 /* When we use vcall offsets, we emit thunks with the virtual
3146 functions to which they thunk. The whole point of vcall offsets
3147 is so that you can know statically the entire set of thunks that
3148 will ever be needed for a given virtual function, thereby
3149 enabling you to output all the thunks with the function itself. */
3150 if (DECL_VIRTUAL_P (fn))
3154 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3156 if (!THUNK_ALIAS (thunk))
3158 use_thunk (thunk, /*emit_p=*/1);
3159 if (DECL_RESULT_THUNK_P (thunk))
3163 for (probe = DECL_THUNKS (thunk);
3164 probe; probe = TREE_CHAIN (probe))
3165 use_thunk (probe, /*emit_p=*/1);
3169 gcc_assert (!DECL_THUNKS (thunk));
3174 /* Generate RTL for FN. */
3177 expand_or_defer_fn (tree fn)
3179 /* When the parser calls us after finishing the body of a template
3180 function, we don't really want to expand the body. */
3181 if (processing_template_decl)
3183 /* Normally, collection only occurs in rest_of_compilation. So,
3184 if we don't collect here, we never collect junk generated
3185 during the processing of templates until we hit a
3186 non-template function. It's not safe to do this inside a
3187 nested class, though, as the parser may have local state that
3188 is not a GC root. */
3189 if (!function_depth)
3194 gcc_assert (gimple_body (fn));
3196 /* If this is a constructor or destructor body, we have to clone
3198 if (maybe_clone_body (fn))
3200 /* We don't want to process FN again, so pretend we've written
3201 it out, even though we haven't. */
3202 TREE_ASM_WRITTEN (fn) = 1;
3206 /* We make a decision about linkage for these functions at the end
3207 of the compilation. Until that point, we do not want the back
3208 end to output them -- but we do want it to see the bodies of
3209 these functions so that it can inline them as appropriate. */
3210 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3212 if (DECL_INTERFACE_KNOWN (fn))
3213 /* We've already made a decision as to how this function will
3217 DECL_EXTERNAL (fn) = 1;
3218 DECL_NOT_REALLY_EXTERN (fn) = 1;
3219 note_vague_linkage_fn (fn);
3220 /* A non-template inline function with external linkage will
3221 always be COMDAT. As we must eventually determine the
3222 linkage of all functions, and as that causes writes to
3223 the data mapped in from the PCH file, it's advantageous
3224 to mark the functions at this point. */
3225 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3227 /* This function must have external linkage, as
3228 otherwise DECL_INTERFACE_KNOWN would have been
3230 gcc_assert (TREE_PUBLIC (fn));
3231 comdat_linkage (fn);
3232 DECL_INTERFACE_KNOWN (fn) = 1;
3236 import_export_decl (fn);
3238 /* If the user wants us to keep all inline functions, then mark
3239 this function as needed so that finish_file will make sure to
3241 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3245 /* There's no reason to do any of the work here if we're only doing
3246 semantic analysis; this code just generates RTL. */
3247 if (flag_syntax_only)
3252 /* Expand or defer, at the whim of the compilation unit manager. */
3253 cgraph_finalize_function (fn, function_depth > 1);
3265 /* Helper function for walk_tree, used by finalize_nrv below. */
3268 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3270 struct nrv_data *dp = (struct nrv_data *)data;
3273 /* No need to walk into types. There wouldn't be any need to walk into
3274 non-statements, except that we have to consider STMT_EXPRs. */
3277 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3278 but differs from using NULL_TREE in that it indicates that we care
3279 about the value of the RESULT_DECL. */
3280 else if (TREE_CODE (*tp) == RETURN_EXPR)
3281 TREE_OPERAND (*tp, 0) = dp->result;
3282 /* Change all cleanups for the NRV to only run when an exception is
3284 else if (TREE_CODE (*tp) == CLEANUP_STMT
3285 && CLEANUP_DECL (*tp) == dp->var)
3286 CLEANUP_EH_ONLY (*tp) = 1;
3287 /* Replace the DECL_EXPR for the NRV with an initialization of the
3288 RESULT_DECL, if needed. */
3289 else if (TREE_CODE (*tp) == DECL_EXPR
3290 && DECL_EXPR_DECL (*tp) == dp->var)
3293 if (DECL_INITIAL (dp->var)
3294 && DECL_INITIAL (dp->var) != error_mark_node)
3295 init = build2 (INIT_EXPR, void_type_node, dp->result,
3296 DECL_INITIAL (dp->var));
3298 init = build_empty_stmt ();
3299 DECL_INITIAL (dp->var) = NULL_TREE;
3300 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3303 /* And replace all uses of the NRV with the RESULT_DECL. */
3304 else if (*tp == dp->var)
3307 /* Avoid walking into the same tree more than once. Unfortunately, we
3308 can't just use walk_tree_without duplicates because it would only call
3309 us for the first occurrence of dp->var in the function body. */
3310 slot = htab_find_slot (dp->visited, *tp, INSERT);
3316 /* Keep iterating. */
3320 /* Called from finish_function to implement the named return value
3321 optimization by overriding all the RETURN_EXPRs and pertinent
3322 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3323 RESULT_DECL for the function. */
3326 finalize_nrv (tree *tp, tree var, tree result)
3328 struct nrv_data data;
3330 /* Copy debugging information from VAR to RESULT. */
3331 DECL_NAME (result) = DECL_NAME (var);
3332 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3333 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3334 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3335 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3336 /* Don't forget that we take its address. */
3337 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3340 data.result = result;
3341 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3342 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3343 htab_delete (data.visited);
3346 /* Return the declaration for the function called by CALL_EXPR T,
3347 TYPE is the class type of the clause decl. */
3350 omp_clause_info_fndecl (tree t, tree type)
3352 tree ret = get_callee_fndecl (t);
3357 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3358 t = CALL_EXPR_FN (t);
3360 if (TREE_CODE (t) == OBJ_TYPE_REF)
3362 t = cp_fold_obj_type_ref (t, type);
3363 if (TREE_CODE (t) == ADDR_EXPR
3364 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3365 return TREE_OPERAND (t, 0);
3371 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3374 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3375 bool need_copy_ctor, bool need_copy_assignment)
3377 int save_errorcount = errorcount;
3380 /* Always allocate 3 elements for simplicity. These are the
3381 function decls for the ctor, dtor, and assignment op.
3382 This layout is known to the three lang hooks,
3383 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3384 and cxx_omp_clause_assign_op. */
3385 info = make_tree_vec (3);
3386 CP_OMP_CLAUSE_INFO (c) = info;
3388 if (need_default_ctor
3389 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3391 if (need_default_ctor)
3395 t = build_int_cst (build_pointer_type (type), 0);
3396 t = build1 (INDIRECT_REF, type, t);
3397 t = build_tree_list (NULL, t);
3399 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3400 t, type, LOOKUP_NORMAL,
3401 tf_warning_or_error);
3403 if (targetm.cxx.cdtor_returns_this () || errorcount)
3404 /* Because constructors and destructors return this,
3405 the call will have been cast to "void". Remove the
3406 cast here. We would like to use STRIP_NOPS, but it
3407 wouldn't work here because TYPE_MODE (t) and
3408 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3409 They are VOIDmode and Pmode, respectively. */
3410 if (TREE_CODE (t) == NOP_EXPR)
3411 t = TREE_OPERAND (t, 0);
3413 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3416 if ((need_default_ctor || need_copy_ctor)
3417 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3419 t = build_int_cst (build_pointer_type (type), 0);
3420 t = build1 (INDIRECT_REF, type, t);
3421 t = build_special_member_call (t, complete_dtor_identifier,
3422 NULL, type, LOOKUP_NORMAL,
3423 tf_warning_or_error);
3425 if (targetm.cxx.cdtor_returns_this () || errorcount)
3426 /* Because constructors and destructors return this,
3427 the call will have been cast to "void". Remove the
3428 cast here. We would like to use STRIP_NOPS, but it
3429 wouldn't work here because TYPE_MODE (t) and
3430 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3431 They are VOIDmode and Pmode, respectively. */
3432 if (TREE_CODE (t) == NOP_EXPR)
3433 t = TREE_OPERAND (t, 0);
3435 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3438 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3440 t = build_int_cst (build_pointer_type (type), 0);
3441 t = build1 (INDIRECT_REF, type, t);
3442 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3443 build_tree_list (NULL, t),
3444 type, LOOKUP_NORMAL,
3445 tf_warning_or_error);
3447 /* We'll have called convert_from_reference on the call, which
3448 may well have added an indirect_ref. It's unneeded here,
3449 and in the way, so kill it. */
3450 if (TREE_CODE (t) == INDIRECT_REF)
3451 t = TREE_OPERAND (t, 0);
3453 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3456 return errorcount != save_errorcount;
3459 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3460 Remove any elements from the list that are invalid. */
3463 finish_omp_clauses (tree clauses)
3465 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3466 tree c, t, *pc = &clauses;
3469 bitmap_obstack_initialize (NULL);
3470 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3471 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3472 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3474 for (pc = &clauses, c = clauses; c ; c = *pc)
3476 bool remove = false;
3478 switch (OMP_CLAUSE_CODE (c))
3480 case OMP_CLAUSE_SHARED:
3482 goto check_dup_generic;
3483 case OMP_CLAUSE_PRIVATE:
3485 goto check_dup_generic;
3486 case OMP_CLAUSE_REDUCTION:
3488 goto check_dup_generic;
3489 case OMP_CLAUSE_COPYPRIVATE:
3490 name = "copyprivate";
3491 goto check_dup_generic;
3492 case OMP_CLAUSE_COPYIN:
3494 goto check_dup_generic;
3496 t = OMP_CLAUSE_DECL (c);
3497 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3499 if (processing_template_decl)
3502 error ("%qD is not a variable in clause %qs", t, name);
3504 error ("%qE is not a variable in clause %qs", t, name);
3507 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3508 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3509 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3511 error ("%qD appears more than once in data clauses", t);
3515 bitmap_set_bit (&generic_head, DECL_UID (t));
3518 case OMP_CLAUSE_FIRSTPRIVATE:
3519 t = OMP_CLAUSE_DECL (c);
3520 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3522 if (processing_template_decl)
3525 error ("%qD is not a variable in clause %<firstprivate%>", t);
3527 error ("%qE is not a variable in clause %<firstprivate%>", t);
3530 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3531 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3533 error ("%qD appears more than once in data clauses", t);
3537 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3540 case OMP_CLAUSE_LASTPRIVATE:
3541 t = OMP_CLAUSE_DECL (c);
3542 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3544 if (processing_template_decl)
3547 error ("%qD is not a variable in clause %<lastprivate%>", t);
3549 error ("%qE is not a variable in clause %<lastprivate%>", t);
3552 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3553 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3555 error ("%qD appears more than once in data clauses", t);
3559 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3563 t = OMP_CLAUSE_IF_EXPR (c);
3564 t = maybe_convert_cond (t);
3565 if (t == error_mark_node)
3567 OMP_CLAUSE_IF_EXPR (c) = t;
3570 case OMP_CLAUSE_NUM_THREADS:
3571 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3572 if (t == error_mark_node)
3574 else if (!type_dependent_expression_p (t)
3575 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3577 error ("num_threads expression must be integral");
3582 case OMP_CLAUSE_SCHEDULE:
3583 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3586 else if (t == error_mark_node)
3588 else if (!type_dependent_expression_p (t)
3589 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3591 error ("schedule chunk size expression must be integral");
3596 case OMP_CLAUSE_NOWAIT:
3597 case OMP_CLAUSE_ORDERED:
3598 case OMP_CLAUSE_DEFAULT:
3599 case OMP_CLAUSE_UNTIED:
3600 case OMP_CLAUSE_COLLAPSE:
3608 *pc = OMP_CLAUSE_CHAIN (c);
3610 pc = &OMP_CLAUSE_CHAIN (c);
3613 for (pc = &clauses, c = clauses; c ; c = *pc)
3615 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3616 bool remove = false;
3617 bool need_complete_non_reference = false;
3618 bool need_default_ctor = false;
3619 bool need_copy_ctor = false;
3620 bool need_copy_assignment = false;
3621 bool need_implicitly_determined = false;
3622 tree type, inner_type;
3626 case OMP_CLAUSE_SHARED:
3628 need_implicitly_determined = true;
3630 case OMP_CLAUSE_PRIVATE:
3632 need_complete_non_reference = true;
3633 need_default_ctor = true;
3634 need_implicitly_determined = true;
3636 case OMP_CLAUSE_FIRSTPRIVATE:
3637 name = "firstprivate";
3638 need_complete_non_reference = true;
3639 need_copy_ctor = true;
3640 need_implicitly_determined = true;
3642 case OMP_CLAUSE_LASTPRIVATE:
3643 name = "lastprivate";
3644 need_complete_non_reference = true;
3645 need_copy_assignment = true;
3646 need_implicitly_determined = true;
3648 case OMP_CLAUSE_REDUCTION:
3650 need_implicitly_determined = true;
3652 case OMP_CLAUSE_COPYPRIVATE:
3653 name = "copyprivate";
3654 need_copy_assignment = true;
3656 case OMP_CLAUSE_COPYIN:
3658 need_copy_assignment = true;
3661 pc = &OMP_CLAUSE_CHAIN (c);
3665 t = OMP_CLAUSE_DECL (c);
3666 if (processing_template_decl
3667 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3669 pc = &OMP_CLAUSE_CHAIN (c);
3675 case OMP_CLAUSE_LASTPRIVATE:
3676 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3677 need_default_ctor = true;
3680 case OMP_CLAUSE_REDUCTION:
3681 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3682 || POINTER_TYPE_P (TREE_TYPE (t)))
3684 error ("%qE has invalid type for %<reduction%>", t);
3687 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3689 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3697 error ("%qE has invalid type for %<reduction(%s)%>",
3698 t, operator_name_info[r_code].name);
3704 case OMP_CLAUSE_COPYIN:
3705 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3707 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3716 if (need_complete_non_reference)
3718 t = require_complete_type (t);
3719 if (t == error_mark_node)
3721 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3723 error ("%qE has reference type for %qs", t, name);
3727 if (need_implicitly_determined)
3729 const char *share_name = NULL;
3731 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3732 share_name = "threadprivate";
3733 else switch (cxx_omp_predetermined_sharing (t))
3735 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3737 case OMP_CLAUSE_DEFAULT_SHARED:
3738 share_name = "shared";
3740 case OMP_CLAUSE_DEFAULT_PRIVATE:
3741 share_name = "private";
3748 error ("%qE is predetermined %qs for %qs",
3749 t, share_name, name);
3754 /* We're interested in the base element, not arrays. */
3755 inner_type = type = TREE_TYPE (t);
3756 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3757 inner_type = TREE_TYPE (inner_type);
3759 /* Check for special function availability by building a call to one.
3760 Save the results, because later we won't be in the right context
3761 for making these queries. */
3762 if (CLASS_TYPE_P (inner_type)
3763 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3764 && !type_dependent_expression_p (t)
3765 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3766 need_copy_ctor, need_copy_assignment))
3770 *pc = OMP_CLAUSE_CHAIN (c);
3772 pc = &OMP_CLAUSE_CHAIN (c);
3775 bitmap_obstack_release (NULL);
3779 /* For all variables in the tree_list VARS, mark them as thread local. */
3782 finish_omp_threadprivate (tree vars)
3786 /* Mark every variable in VARS to be assigned thread local storage. */
3787 for (t = vars; t; t = TREE_CHAIN (t))
3789 tree v = TREE_PURPOSE (t);
3791 if (error_operand_p (v))
3793 else if (TREE_CODE (v) != VAR_DECL)
3794 error ("%<threadprivate%> %qD is not file, namespace "
3795 "or block scope variable", v);
3796 /* If V had already been marked threadprivate, it doesn't matter
3797 whether it had been used prior to this point. */
3798 else if (TREE_USED (v)
3799 && (DECL_LANG_SPECIFIC (v) == NULL
3800 || !CP_DECL_THREADPRIVATE_P (v)))
3801 error ("%qE declared %<threadprivate%> after first use", v);
3802 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3803 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3804 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3805 error ("%<threadprivate%> %qE has incomplete type", v);
3806 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3807 && CP_DECL_CONTEXT (v) != current_class_type)
3808 error ("%<threadprivate%> %qE directive not "
3809 "in %qT definition", v, CP_DECL_CONTEXT (v));
3812 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3813 if (DECL_LANG_SPECIFIC (v) == NULL)
3815 retrofit_lang_decl (v);
3817 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3818 after the allocation of the lang_decl structure. */
3819 if (DECL_DISCRIMINATOR_P (v))
3820 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3823 if (! DECL_THREAD_LOCAL_P (v))
3825 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3826 /* If rtl has been already set for this var, call
3827 make_decl_rtl once again, so that encode_section_info
3828 has a chance to look at the new decl flags. */
3829 if (DECL_RTL_SET_P (v))
3832 CP_DECL_THREADPRIVATE_P (v) = 1;
3837 /* Build an OpenMP structured block. */
3840 begin_omp_structured_block (void)
3842 return do_pushlevel (sk_omp);
3846 finish_omp_structured_block (tree block)
3848 return do_poplevel (block);
3851 /* Similarly, except force the retention of the BLOCK. */
3854 begin_omp_parallel (void)
3856 keep_next_level (true);
3857 return begin_omp_structured_block ();
3861 finish_omp_parallel (tree clauses, tree body)
3865 body = finish_omp_structured_block (body);
3867 stmt = make_node (OMP_PARALLEL);
3868 TREE_TYPE (stmt) = void_type_node;
3869 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3870 OMP_PARALLEL_BODY (stmt) = body;
3872 return add_stmt (stmt);
3876 begin_omp_task (void)
3878 keep_next_level (true);
3879 return begin_omp_structured_block ();
3883 finish_omp_task (tree clauses, tree body)
3887 body = finish_omp_structured_block (body);
3889 stmt = make_node (OMP_TASK);
3890 TREE_TYPE (stmt) = void_type_node;
3891 OMP_TASK_CLAUSES (stmt) = clauses;
3892 OMP_TASK_BODY (stmt) = body;
3894 return add_stmt (stmt);
3897 /* Helper function for finish_omp_for. Convert Ith random access iterator
3898 into integral iterator. Return FALSE if successful. */
3901 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3902 tree condv, tree incrv, tree *body,
3903 tree *pre_body, tree clauses)
3905 tree diff, iter_init, iter_incr = NULL, last;
3906 tree incr_var = NULL, orig_pre_body, orig_body, c;
3907 tree decl = TREE_VEC_ELT (declv, i);
3908 tree init = TREE_VEC_ELT (initv, i);
3909 tree cond = TREE_VEC_ELT (condv, i);
3910 tree incr = TREE_VEC_ELT (incrv, i);
3912 location_t elocus = locus;
3914 if (init && EXPR_HAS_LOCATION (init))
3915 elocus = EXPR_LOCATION (init);
3917 switch (TREE_CODE (cond))
3923 if (TREE_OPERAND (cond, 0) != iter)
3924 cond = error_mark_node;
3927 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3928 TREE_OPERAND (cond, 1), ERROR_MARK,
3929 NULL, tf_warning_or_error);
3930 if (error_operand_p (tem))
3935 cond = error_mark_node;
3938 if (cond == error_mark_node)
3940 error ("%Hinvalid controlling predicate", &elocus);
3943 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
3944 ERROR_MARK, iter, ERROR_MARK, NULL,
3945 tf_warning_or_error);
3946 if (error_operand_p (diff))
3948 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
3950 error ("%Hdifference between %qE and %qD does not have integer type",
3951 &elocus, TREE_OPERAND (cond, 1), iter);
3955 switch (TREE_CODE (incr))
3957 case PREINCREMENT_EXPR:
3958 case PREDECREMENT_EXPR:
3959 case POSTINCREMENT_EXPR:
3960 case POSTDECREMENT_EXPR:
3961 if (TREE_OPERAND (incr, 0) != iter)
3963 incr = error_mark_node;
3966 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
3967 tf_warning_or_error);
3968 if (error_operand_p (iter_incr))
3970 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
3971 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
3972 incr = integer_one_node;
3974 incr = integer_minus_one_node;
3977 if (TREE_OPERAND (incr, 0) != iter)
3978 incr = error_mark_node;
3979 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
3980 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
3982 tree rhs = TREE_OPERAND (incr, 1);
3983 if (TREE_OPERAND (rhs, 0) == iter)
3985 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
3987 incr = error_mark_node;
3990 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
3991 TREE_OPERAND (rhs, 1),
3992 tf_warning_or_error);
3993 if (error_operand_p (iter_incr))
3995 incr = TREE_OPERAND (rhs, 1);
3996 incr = cp_convert (TREE_TYPE (diff), incr);
3997 if (TREE_CODE (rhs) == MINUS_EXPR)
3999 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4000 incr = fold_if_not_in_template (incr);
4002 if (TREE_CODE (incr) != INTEGER_CST
4003 && (TREE_CODE (incr) != NOP_EXPR
4004 || (TREE_CODE (TREE_OPERAND (incr, 0))
4009 else if (TREE_OPERAND (rhs, 1) == iter)
4011 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4012 || TREE_CODE (rhs) != PLUS_EXPR)
4013 incr = error_mark_node;
4016 iter_incr = build_x_binary_op (PLUS_EXPR,
4017 TREE_OPERAND (rhs, 0),
4020 tf_warning_or_error);
4021 if (error_operand_p (iter_incr))
4023 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4025 tf_warning_or_error);
4026 if (error_operand_p (iter_incr))
4028 incr = TREE_OPERAND (rhs, 0);
4033 incr = error_mark_node;
4036 incr = error_mark_node;
4039 incr = error_mark_node;
4043 if (incr == error_mark_node)
4045 error ("%Hinvalid increment expression", &elocus);
4049 incr = cp_convert (TREE_TYPE (diff), incr);
4050 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4051 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4052 && OMP_CLAUSE_DECL (c) == iter)
4055 decl = create_temporary_var (TREE_TYPE (diff));
4057 add_decl_expr (decl);
4058 last = create_temporary_var (TREE_TYPE (diff));
4060 add_decl_expr (last);
4061 if (c && iter_incr == NULL)
4063 incr_var = create_temporary_var (TREE_TYPE (diff));
4064 pushdecl (incr_var);
4065 add_decl_expr (incr_var);
4067 gcc_assert (stmts_are_full_exprs_p ());
4069 orig_pre_body = *pre_body;
4070 *pre_body = push_stmt_list ();
4072 add_stmt (orig_pre_body);
4074 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4075 tf_warning_or_error));
4076 init = build_int_cst (TREE_TYPE (diff), 0);
4077 if (c && iter_incr == NULL)
4079 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4080 incr, tf_warning_or_error));
4082 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4083 tf_warning_or_error);
4085 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4086 tf_warning_or_error));
4087 *pre_body = pop_stmt_list (*pre_body);
4089 cond = cp_build_binary_op (elocus,
4090 TREE_CODE (cond), decl, diff,
4091 tf_warning_or_error);
4092 incr = build_modify_expr (elocus, decl, PLUS_EXPR, incr);
4095 *body = push_stmt_list ();
4096 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4097 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4098 tf_warning_or_error);
4099 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4100 finish_expr_stmt (iter_init);
4101 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4102 tf_warning_or_error));
4103 add_stmt (orig_body);
4104 *body = pop_stmt_list (*body);
4108 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4109 finish_expr_stmt (iter_incr);
4110 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4111 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4114 TREE_VEC_ELT (declv, i) = decl;
4115 TREE_VEC_ELT (initv, i) = init;
4116 TREE_VEC_ELT (condv, i) = cond;
4117 TREE_VEC_ELT (incrv, i) = incr;
4122 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4123 are directly for their associated operands in the statement. DECL
4124 and INIT are a combo; if DECL is NULL then INIT ought to be a
4125 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4126 optional statements that need to go before the loop into its
4130 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4131 tree incrv, tree body, tree pre_body, tree clauses)
4133 tree omp_for = NULL, orig_incr = NULL;
4134 tree decl, init, cond, incr;
4138 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4139 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4140 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4141 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4143 decl = TREE_VEC_ELT (declv, i);
4144 init = TREE_VEC_ELT (initv, i);
4145 cond = TREE_VEC_ELT (condv, i);
4146 incr = TREE_VEC_ELT (incrv, i);
4152 switch (TREE_CODE (init))
4155 decl = TREE_OPERAND (init, 0);
4156 init = TREE_OPERAND (init, 1);
4159 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4161 decl = TREE_OPERAND (init, 0);
4162 init = TREE_OPERAND (init, 2);
4171 error ("%Hexpected iteration declaration or initialization",
4177 if (init && EXPR_HAS_LOCATION (init))
4178 elocus = EXPR_LOCATION (init);
4182 error ("%Hmissing controlling predicate", &elocus);
4188 error ("%Hmissing increment expression", &elocus);
4192 TREE_VEC_ELT (declv, i) = decl;
4193 TREE_VEC_ELT (initv, i) = init;
4196 if (dependent_omp_for_p (declv, initv, condv, incrv))
4200 stmt = make_node (OMP_FOR);
4202 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4204 /* This is really just a place-holder. We'll be decomposing this
4205 again and going through the cp_build_modify_expr path below when
4206 we instantiate the thing. */
4207 TREE_VEC_ELT (initv, i)
4208 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4209 TREE_VEC_ELT (initv, i));
4212 TREE_TYPE (stmt) = void_type_node;
4213 OMP_FOR_INIT (stmt) = initv;
4214 OMP_FOR_COND (stmt) = condv;
4215 OMP_FOR_INCR (stmt) = incrv;
4216 OMP_FOR_BODY (stmt) = body;
4217 OMP_FOR_PRE_BODY (stmt) = pre_body;
4218 OMP_FOR_CLAUSES (stmt) = clauses;
4220 SET_EXPR_LOCATION (stmt, locus);
4221 return add_stmt (stmt);
4224 if (processing_template_decl)
4225 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4227 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4229 decl = TREE_VEC_ELT (declv, i);
4230 init = TREE_VEC_ELT (initv, i);
4231 cond = TREE_VEC_ELT (condv, i);
4232 incr = TREE_VEC_ELT (incrv, i);
4234 TREE_VEC_ELT (orig_incr, i) = incr;
4237 if (init && EXPR_HAS_LOCATION (init))
4238 elocus = EXPR_LOCATION (init);
4242 error ("%Hexpected iteration declaration or initialization",
4247 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4250 TREE_VEC_ELT (orig_incr, i) = incr;
4251 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4252 TREE_CODE (TREE_OPERAND (incr, 1)),
4253 TREE_OPERAND (incr, 2),
4254 tf_warning_or_error);
4257 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4259 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4260 incrv, &body, &pre_body, clauses))
4265 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4266 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4268 error ("%Hinvalid type for iteration variable %qE", &elocus, decl);
4272 if (!processing_template_decl)
4274 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4275 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4278 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4280 && TREE_SIDE_EFFECTS (cond)
4281 && COMPARISON_CLASS_P (cond)
4282 && !processing_template_decl)
4284 tree t = TREE_OPERAND (cond, 0);
4285 if (TREE_SIDE_EFFECTS (t)
4287 && (TREE_CODE (t) != NOP_EXPR
4288 || TREE_OPERAND (t, 0) != decl))
4289 TREE_OPERAND (cond, 0)
4290 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4292 t = TREE_OPERAND (cond, 1);
4293 if (TREE_SIDE_EFFECTS (t)
4295 && (TREE_CODE (t) != NOP_EXPR
4296 || TREE_OPERAND (t, 0) != decl))
4297 TREE_OPERAND (cond, 1)
4298 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4300 if (decl == error_mark_node || init == error_mark_node)
4303 TREE_VEC_ELT (declv, i) = decl;
4304 TREE_VEC_ELT (initv, i) = init;
4305 TREE_VEC_ELT (condv, i) = cond;
4306 TREE_VEC_ELT (incrv, i) = incr;
4310 if (IS_EMPTY_STMT (pre_body))
4313 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4316 if (omp_for == NULL)
4319 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4321 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4322 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4324 if (TREE_CODE (incr) != MODIFY_EXPR)
4327 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4328 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4329 && !processing_template_decl)
4331 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4332 if (TREE_SIDE_EFFECTS (t)
4334 && (TREE_CODE (t) != NOP_EXPR
4335 || TREE_OPERAND (t, 0) != decl))
4336 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4337 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4339 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4340 if (TREE_SIDE_EFFECTS (t)
4342 && (TREE_CODE (t) != NOP_EXPR
4343 || TREE_OPERAND (t, 0) != decl))
4344 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4345 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4349 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4351 if (omp_for != NULL)
4352 OMP_FOR_CLAUSES (omp_for) = clauses;
4357 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4366 dependent_p = false;
4369 /* Even in a template, we can detect invalid uses of the atomic
4370 pragma if neither LHS nor RHS is type-dependent. */
4371 if (processing_template_decl)
4373 dependent_p = (type_dependent_expression_p (lhs)
4374 || type_dependent_expression_p (rhs));
4377 lhs = build_non_dependent_expr (lhs);
4378 rhs = build_non_dependent_expr (rhs);
4383 stmt = c_finish_omp_atomic (code, lhs, rhs);
4384 if (stmt == error_mark_node)
4387 if (processing_template_decl)
4388 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4389 build2 (code, void_type_node, orig_lhs, orig_rhs));
4394 finish_omp_barrier (void)
4396 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4397 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4398 finish_expr_stmt (stmt);
4402 finish_omp_flush (void)
4404 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4405 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4406 finish_expr_stmt (stmt);
4410 finish_omp_taskwait (void)
4412 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4413 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4414 finish_expr_stmt (stmt);
4418 init_cp_semantics (void)
4422 /* Build a STATIC_ASSERT for a static assertion with the condition
4423 CONDITION and the message text MESSAGE. LOCATION is the location
4424 of the static assertion in the source code. When MEMBER_P, this
4425 static assertion is a member of a class. */
4427 finish_static_assert (tree condition, tree message, location_t location,
4430 if (check_for_bare_parameter_packs (condition))
4431 condition = error_mark_node;
4433 if (type_dependent_expression_p (condition)
4434 || value_dependent_expression_p (condition))
4436 /* We're in a template; build a STATIC_ASSERT and put it in
4440 assertion = make_node (STATIC_ASSERT);
4441 STATIC_ASSERT_CONDITION (assertion) = condition;
4442 STATIC_ASSERT_MESSAGE (assertion) = message;
4443 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4446 maybe_add_class_template_decl_list (current_class_type,
4450 add_stmt (assertion);
4455 /* Fold the expression and convert it to a boolean value. */
4456 condition = fold_non_dependent_expr (condition);
4457 condition = cp_convert (boolean_type_node, condition);
4459 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4460 /* Do nothing; the condition is satisfied. */
4464 location_t saved_loc = input_location;
4466 input_location = location;
4467 if (TREE_CODE (condition) == INTEGER_CST
4468 && integer_zerop (condition))
4469 /* Report the error. */
4470 error ("static assertion failed: %E", message);
4471 else if (condition && condition != error_mark_node)
4472 error ("non-constant condition for static assertion");
4473 input_location = saved_loc;
4477 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4478 just return the type even though EXPR is a type-dependent expression.
4479 The ABI specifies which cases this applies to, which is a subset of the
4483 describable_type (tree expr)
4485 tree type = NULL_TREE;
4487 /* processing_template_decl isn't set when we're called from the mangling
4488 code, so bump it now. */
4489 ++processing_template_decl;
4490 if (! type_dependent_expression_p (expr)
4491 && ! type_unknown_p (expr))
4493 type = TREE_TYPE (expr);
4494 if (real_lvalue_p (expr))
4495 type = build_reference_type (type);
4497 --processing_template_decl;
4502 switch (TREE_CODE (expr))
4508 /* Named rvalue reference becomes lvalue. */
4509 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4514 case TEMPLATE_PARM_INDEX:
4516 case STATIC_CAST_EXPR:
4517 case REINTERPRET_CAST_EXPR:
4518 case CONST_CAST_EXPR:
4519 case DYNAMIC_CAST_EXPR:
4520 type = TREE_TYPE (expr);
4525 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4526 if (ptrtype && POINTER_TYPE_P (ptrtype))
4527 type = build_reference_type (TREE_TYPE (ptrtype));
4532 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4533 type = TREE_TYPE (expr);
4537 if (type && type_uses_auto (type))
4543 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4544 suitable for use as a type-specifier.
4546 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4547 id-expression or a class member access, FALSE when it was parsed as
4548 a full expression. */
4551 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4553 tree orig_expr = expr;
4554 tree type = NULL_TREE;
4556 if (!expr || error_operand_p (expr))
4557 return error_mark_node;
4560 || TREE_CODE (expr) == TYPE_DECL
4561 || (TREE_CODE (expr) == BIT_NOT_EXPR
4562 && TYPE_P (TREE_OPERAND (expr, 0))))
4564 error ("argument to decltype must be an expression");
4565 return error_mark_node;
4568 if (type_dependent_expression_p (expr))
4570 if (id_expression_or_member_access_p)
4572 switch (TREE_CODE (expr))
4579 case TEMPLATE_PARM_INDEX:
4580 type = TREE_TYPE (expr);
4588 type = describable_type (expr);
4590 if (type && !type_uses_auto (type))
4593 type = cxx_make_type (DECLTYPE_TYPE);
4594 DECLTYPE_TYPE_EXPR (type) = expr;
4595 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4596 = id_expression_or_member_access_p;
4597 SET_TYPE_STRUCTURAL_EQUALITY (type);
4602 /* The type denoted by decltype(e) is defined as follows: */
4604 if (id_expression_or_member_access_p)
4606 /* If e is an id-expression or a class member access (5.2.5
4607 [expr.ref]), decltype(e) is defined as the type of the entity
4608 named by e. If there is no such entity, or e names a set of
4609 overloaded functions, the program is ill-formed. */
4610 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4611 expr = lookup_name (expr);
4613 if (TREE_CODE (expr) == INDIRECT_REF)
4614 /* This can happen when the expression is, e.g., "a.b". Just
4615 look at the underlying operand. */
4616 expr = TREE_OPERAND (expr, 0);
4618 if (TREE_CODE (expr) == OFFSET_REF
4619 || TREE_CODE (expr) == MEMBER_REF)
4620 /* We're only interested in the field itself. If it is a
4621 BASELINK, we will need to see through it in the next
4623 expr = TREE_OPERAND (expr, 1);
4625 if (TREE_CODE (expr) == BASELINK)
4626 /* See through BASELINK nodes to the underlying functions. */
4627 expr = BASELINK_FUNCTIONS (expr);
4629 if (TREE_CODE (expr) == OVERLOAD)
4631 if (OVL_CHAIN (expr))
4633 error ("%qE refers to a set of overloaded functions", orig_expr);
4634 return error_mark_node;
4637 /* An overload set containing only one function: just look
4638 at that function. */
4639 expr = OVL_FUNCTION (expr);
4642 switch (TREE_CODE (expr))
4645 if (DECL_BIT_FIELD_TYPE (expr))
4647 type = DECL_BIT_FIELD_TYPE (expr);
4650 /* Fall through for fields that aren't bitfields. */
4657 case TEMPLATE_PARM_INDEX:
4658 type = TREE_TYPE (expr);
4662 type = error_mark_node;
4666 type = is_bitfield_expr_with_lowered_type (expr);
4668 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4675 /* We can get here when the id-expression refers to an
4677 type = TREE_TYPE (expr);
4681 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4682 || TREE_CODE (expr) == SCOPE_REF);
4683 error ("argument to decltype must be an expression");
4684 return error_mark_node;
4689 /* Expressions of reference type are sometimes wrapped in
4690 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4691 representation, not part of the language, so we have to look
4693 if (TREE_CODE (expr) == INDIRECT_REF
4694 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4696 expr = TREE_OPERAND (expr, 0);
4698 if (TREE_CODE (expr) == CALL_EXPR)
4700 /* If e is a function call (5.2.2 [expr.call]) or an
4701 invocation of an overloaded operator (parentheses around e
4702 are ignored), decltype(e) is defined as the return type of
4704 tree fndecl = get_callee_fndecl (expr);
4705 if (fndecl && fndecl != error_mark_node)
4706 type = TREE_TYPE (TREE_TYPE (fndecl));
4709 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4710 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4711 || TREE_CODE (target_type) == POINTER_TYPE)
4712 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4713 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4714 type = TREE_TYPE (TREE_TYPE (target_type));
4716 sorry ("unable to determine the declared type of expression %<%E%>",
4722 type = is_bitfield_expr_with_lowered_type (expr);
4725 /* Bitfields are special, because their type encodes the
4726 number of bits they store. If the expression referenced a
4727 bitfield, TYPE now has the declared type of that
4729 type = cp_build_qualified_type (type,
4730 cp_type_quals (TREE_TYPE (expr)));
4732 if (real_lvalue_p (expr))
4733 type = build_reference_type (type);
4737 /* Otherwise, where T is the type of e, if e is an lvalue,
4738 decltype(e) is defined as T&, otherwise decltype(e) is
4740 type = TREE_TYPE (expr);
4741 if (type == error_mark_node)
4742 return error_mark_node;
4743 else if (expr == current_class_ptr)
4744 /* If the expression is just "this", we want the
4745 cv-unqualified pointer for the "this" type. */
4746 type = TYPE_MAIN_VARIANT (type);
4747 else if (real_lvalue_p (expr))
4749 if (TREE_CODE (type) != REFERENCE_TYPE)
4750 type = build_reference_type (type);
4753 type = non_reference (type);
4758 if (!type || type == unknown_type_node)
4760 error ("type of %qE is unknown", expr);
4761 return error_mark_node;
4767 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4768 __has_nothrow_copy, depending on assign_p. */
4771 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4778 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4781 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4783 else if (TYPE_HAS_INIT_REF (type))
4785 /* If construction of the copy constructor was postponed, create
4787 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4788 lazily_declare_fn (sfk_copy_constructor, type);
4789 fns = CLASSTYPE_CONSTRUCTORS (type);
4794 for (; fns; fns = OVL_NEXT (fns))
4796 tree fn = OVL_CURRENT (fns);
4800 if (copy_fn_p (fn) == 0)
4803 else if (copy_fn_p (fn) <= 0)
4806 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4813 /* Actually evaluates the trait. */
4816 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4818 enum tree_code type_code1;
4821 type_code1 = TREE_CODE (type1);
4825 case CPTK_HAS_NOTHROW_ASSIGN:
4826 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4827 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4828 || (CLASS_TYPE_P (type1)
4829 && classtype_has_nothrow_assign_or_copy_p (type1,
4832 case CPTK_HAS_TRIVIAL_ASSIGN:
4833 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4834 && (pod_type_p (type1)
4835 || (CLASS_TYPE_P (type1)
4836 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4838 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4839 type1 = strip_array_types (type1);
4840 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4841 || (CLASS_TYPE_P (type1)
4842 && (t = locate_ctor (type1, NULL))
4843 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4845 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4846 type1 = strip_array_types (type1);
4847 return (pod_type_p (type1)
4848 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4850 case CPTK_HAS_NOTHROW_COPY:
4851 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4852 || (CLASS_TYPE_P (type1)
4853 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4855 case CPTK_HAS_TRIVIAL_COPY:
4856 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4857 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4859 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4860 type1 = strip_array_types (type1);
4861 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4862 || (CLASS_TYPE_P (type1)
4863 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4865 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4866 return (CLASS_TYPE_P (type1)
4867 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4869 case CPTK_IS_ABSTRACT:
4870 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4872 case CPTK_IS_BASE_OF:
4873 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4874 && DERIVED_FROM_P (type1, type2));
4877 return (NON_UNION_CLASS_TYPE_P (type1));
4879 case CPTK_IS_CONVERTIBLE_TO:
4884 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4887 return (type_code1 == ENUMERAL_TYPE);
4890 return (pod_type_p (type1));
4892 case CPTK_IS_POLYMORPHIC:
4893 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4896 return (type_code1 == UNION_TYPE);
4904 /* Process a trait expression. */
4907 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4909 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4910 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4911 || kind == CPTK_HAS_NOTHROW_COPY
4912 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4913 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4914 || kind == CPTK_HAS_TRIVIAL_COPY
4915 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4916 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4917 || kind == CPTK_IS_ABSTRACT
4918 || kind == CPTK_IS_BASE_OF
4919 || kind == CPTK_IS_CLASS
4920 || kind == CPTK_IS_CONVERTIBLE_TO
4921 || kind == CPTK_IS_EMPTY
4922 || kind == CPTK_IS_ENUM
4923 || kind == CPTK_IS_POD
4924 || kind == CPTK_IS_POLYMORPHIC
4925 || kind == CPTK_IS_UNION);
4927 if (kind == CPTK_IS_CONVERTIBLE_TO)
4929 sorry ("__is_convertible_to");
4930 return error_mark_node;
4933 if (type1 == error_mark_node
4934 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4935 && type2 == error_mark_node))
4936 return error_mark_node;
4938 if (processing_template_decl)
4940 tree trait_expr = make_node (TRAIT_EXPR);
4941 TREE_TYPE (trait_expr) = boolean_type_node;
4942 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4943 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4944 TRAIT_EXPR_KIND (trait_expr) = kind;
4948 complete_type (type1);
4950 complete_type (type2);
4952 /* The only required diagnostic. */
4953 if (kind == CPTK_IS_BASE_OF
4954 && NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4955 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
4956 && !COMPLETE_TYPE_P (type2))
4958 error ("incomplete type %qT not allowed", type2);
4959 return error_mark_node;
4962 return (trait_expr_value (kind, type1, type2)
4963 ? boolean_true_node : boolean_false_node);
4966 #include "gt-cp-semantics.h"