1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008, 2009 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
34 #include "tree-inline.h"
35 #include "tree-mudflap.h"
44 #include "diagnostic.h"
46 #include "tree-iterator.h"
51 /* There routines provide a modular interface to perform many parsing
52 operations. They may therefore be used during actual parsing, or
53 during template instantiation, which may be regarded as a
54 degenerate form of parsing. */
56 static tree maybe_convert_cond (tree);
57 static tree finalize_nrv_r (tree *, int *, void *);
60 /* Deferred Access Checking Overview
61 ---------------------------------
63 Most C++ expressions and declarations require access checking
64 to be performed during parsing. However, in several cases,
65 this has to be treated differently.
67 For member declarations, access checking has to be deferred
68 until more information about the declaration is known. For
80 When we are parsing the function return type `A::X', we don't
81 really know if this is allowed until we parse the function name.
83 Furthermore, some contexts require that access checking is
84 never performed at all. These include class heads, and template
87 Typical use of access checking functions is described here:
89 1. When we enter a context that requires certain access checking
90 mode, the function `push_deferring_access_checks' is called with
91 DEFERRING argument specifying the desired mode. Access checking
92 may be performed immediately (dk_no_deferred), deferred
93 (dk_deferred), or not performed (dk_no_check).
95 2. When a declaration such as a type, or a variable, is encountered,
96 the function `perform_or_defer_access_check' is called. It
97 maintains a VEC of all deferred checks.
99 3. The global `current_class_type' or `current_function_decl' is then
100 setup by the parser. `enforce_access' relies on these information
103 4. Upon exiting the context mentioned in step 1,
104 `perform_deferred_access_checks' is called to check all declaration
105 stored in the VEC. `pop_deferring_access_checks' is then
106 called to restore the previous access checking mode.
108 In case of parsing error, we simply call `pop_deferring_access_checks'
109 without `perform_deferred_access_checks'. */
111 typedef struct 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)
948 /* Convert the condition to an integer or enumeration type. */
949 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
950 if (cond == NULL_TREE)
952 error ("switch quantity not an integer");
953 cond = error_mark_node;
955 orig_type = TREE_TYPE (cond);
956 if (cond != error_mark_node)
960 Integral promotions are performed. */
961 cond = perform_integral_promotions (cond);
962 cond = maybe_cleanup_point_expr (cond);
965 if (check_for_bare_parameter_packs (cond))
966 cond = error_mark_node;
967 else if (!processing_template_decl && warn_sequence_point)
968 verify_sequence_points (cond);
970 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
971 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
972 add_stmt (switch_stmt);
973 push_switch (switch_stmt);
974 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
977 /* Finish the body of a switch-statement, which may be given by
978 SWITCH_STMT. The COND to switch on is indicated. */
981 finish_switch_stmt (tree switch_stmt)
985 SWITCH_STMT_BODY (switch_stmt) =
986 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
990 scope = TREE_CHAIN (switch_stmt);
991 TREE_CHAIN (switch_stmt) = NULL;
992 add_stmt (do_poplevel (scope));
995 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
999 begin_try_block (void)
1001 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
1003 TRY_STMTS (r) = push_stmt_list ();
1007 /* Likewise, for a function-try-block. The block returned in
1008 *COMPOUND_STMT is an artificial outer scope, containing the
1009 function-try-block. */
1012 begin_function_try_block (tree *compound_stmt)
1015 /* This outer scope does not exist in the C++ standard, but we need
1016 a place to put __FUNCTION__ and similar variables. */
1017 *compound_stmt = begin_compound_stmt (0);
1018 r = begin_try_block ();
1019 FN_TRY_BLOCK_P (r) = 1;
1023 /* Finish a try-block, which may be given by TRY_BLOCK. */
1026 finish_try_block (tree try_block)
1028 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1029 TRY_HANDLERS (try_block) = push_stmt_list ();
1032 /* Finish the body of a cleanup try-block, which may be given by
1036 finish_cleanup_try_block (tree try_block)
1038 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1041 /* Finish an implicitly generated try-block, with a cleanup is given
1045 finish_cleanup (tree cleanup, tree try_block)
1047 TRY_HANDLERS (try_block) = cleanup;
1048 CLEANUP_P (try_block) = 1;
1051 /* Likewise, for a function-try-block. */
1054 finish_function_try_block (tree try_block)
1056 finish_try_block (try_block);
1057 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1058 the try block, but moving it inside. */
1059 in_function_try_handler = 1;
1062 /* Finish a handler-sequence for a try-block, which may be given by
1066 finish_handler_sequence (tree try_block)
1068 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1069 check_handlers (TRY_HANDLERS (try_block));
1072 /* Finish the handler-seq for a function-try-block, given by
1073 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1074 begin_function_try_block. */
1077 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1079 in_function_try_handler = 0;
1080 finish_handler_sequence (try_block);
1081 finish_compound_stmt (compound_stmt);
1084 /* Begin a handler. Returns a HANDLER if appropriate. */
1087 begin_handler (void)
1091 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1094 /* Create a binding level for the eh_info and the exception object
1096 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1101 /* Finish the handler-parameters for a handler, which may be given by
1102 HANDLER. DECL is the declaration for the catch parameter, or NULL
1103 if this is a `catch (...)' clause. */
1106 finish_handler_parms (tree decl, tree handler)
1108 tree type = NULL_TREE;
1109 if (processing_template_decl)
1113 decl = pushdecl (decl);
1114 decl = push_template_decl (decl);
1115 HANDLER_PARMS (handler) = decl;
1116 type = TREE_TYPE (decl);
1120 type = expand_start_catch_block (decl);
1121 HANDLER_TYPE (handler) = type;
1122 if (!processing_template_decl && type)
1123 mark_used (eh_type_info (type));
1126 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1127 the return value from the matching call to finish_handler_parms. */
1130 finish_handler (tree handler)
1132 if (!processing_template_decl)
1133 expand_end_catch_block ();
1134 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1137 /* Begin a compound statement. FLAGS contains some bits that control the
1138 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1139 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1140 block of a function. If BCS_TRY_BLOCK is set, this is the block
1141 created on behalf of a TRY statement. Returns a token to be passed to
1142 finish_compound_stmt. */
1145 begin_compound_stmt (unsigned int flags)
1149 if (flags & BCS_NO_SCOPE)
1151 r = push_stmt_list ();
1152 STATEMENT_LIST_NO_SCOPE (r) = 1;
1154 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1155 But, if it's a statement-expression with a scopeless block, there's
1156 nothing to keep, and we don't want to accidentally keep a block
1157 *inside* the scopeless block. */
1158 keep_next_level (false);
1161 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1163 /* When processing a template, we need to remember where the braces were,
1164 so that we can set up identical scopes when instantiating the template
1165 later. BIND_EXPR is a handy candidate for this.
1166 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1167 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1168 processing templates. */
1169 if (processing_template_decl)
1171 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1172 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1173 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1174 TREE_SIDE_EFFECTS (r) = 1;
1180 /* Finish a compound-statement, which is given by STMT. */
1183 finish_compound_stmt (tree stmt)
1185 if (TREE_CODE (stmt) == BIND_EXPR)
1186 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1187 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1188 stmt = pop_stmt_list (stmt);
1191 /* Destroy any ObjC "super" receivers that may have been
1193 objc_clear_super_receiver ();
1195 stmt = do_poplevel (stmt);
1198 /* ??? See c_end_compound_stmt wrt statement expressions. */
1203 /* Finish an asm-statement, whose components are a STRING, some
1204 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1205 whether the asm-statement should be considered volatile. */
1208 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1209 tree input_operands, tree clobbers)
1213 int ninputs = list_length (input_operands);
1214 int noutputs = list_length (output_operands);
1216 if (!processing_template_decl)
1218 const char *constraint;
1219 const char **oconstraints;
1220 bool allows_mem, allows_reg, is_inout;
1224 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1226 string = resolve_asm_operand_names (string, output_operands,
1229 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1231 operand = TREE_VALUE (t);
1233 /* ??? Really, this should not be here. Users should be using a
1234 proper lvalue, dammit. But there's a long history of using
1235 casts in the output operands. In cases like longlong.h, this
1236 becomes a primitive form of typechecking -- if the cast can be
1237 removed, then the output operand had a type of the proper width;
1238 otherwise we'll get an error. Gross, but ... */
1239 STRIP_NOPS (operand);
1241 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1242 operand = error_mark_node;
1244 if (operand != error_mark_node
1245 && (TREE_READONLY (operand)
1246 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1247 /* Functions are not modifiable, even though they are
1249 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1250 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1251 /* If it's an aggregate and any field is const, then it is
1252 effectively const. */
1253 || (CLASS_TYPE_P (TREE_TYPE (operand))
1254 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1255 readonly_error (operand, "assignment (via 'asm' output)");
1257 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1258 oconstraints[i] = constraint;
1260 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1261 &allows_mem, &allows_reg, &is_inout))
1263 /* If the operand is going to end up in memory,
1264 mark it addressable. */
1265 if (!allows_reg && !cxx_mark_addressable (operand))
1266 operand = error_mark_node;
1269 operand = error_mark_node;
1271 TREE_VALUE (t) = operand;
1274 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1276 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1277 operand = decay_conversion (TREE_VALUE (t));
1279 /* If the type of the operand hasn't been determined (e.g.,
1280 because it involves an overloaded function), then issue
1281 an error message. There's no context available to
1282 resolve the overloading. */
1283 if (TREE_TYPE (operand) == unknown_type_node)
1285 error ("type of asm operand %qE could not be determined",
1287 operand = error_mark_node;
1290 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1291 oconstraints, &allows_mem, &allows_reg))
1293 /* If the operand is going to end up in memory,
1294 mark it addressable. */
1295 if (!allows_reg && allows_mem)
1297 /* Strip the nops as we allow this case. FIXME, this really
1298 should be rejected or made deprecated. */
1299 STRIP_NOPS (operand);
1300 if (!cxx_mark_addressable (operand))
1301 operand = error_mark_node;
1305 operand = error_mark_node;
1307 TREE_VALUE (t) = operand;
1311 r = build_stmt (ASM_EXPR, string,
1312 output_operands, input_operands,
1314 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1315 r = maybe_cleanup_point_expr_void (r);
1316 return add_stmt (r);
1319 /* Finish a label with the indicated NAME. */
1322 finish_label_stmt (tree name)
1324 tree decl = define_label (input_location, name);
1326 if (decl == error_mark_node)
1327 return error_mark_node;
1329 return add_stmt (build_stmt (LABEL_EXPR, decl));
1332 /* Finish a series of declarations for local labels. G++ allows users
1333 to declare "local" labels, i.e., labels with scope. This extension
1334 is useful when writing code involving statement-expressions. */
1337 finish_label_decl (tree name)
1339 if (!at_function_scope_p ())
1341 error ("__label__ declarations are only allowed in function scopes");
1345 add_decl_expr (declare_local_label (name));
1348 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1351 finish_decl_cleanup (tree decl, tree cleanup)
1353 push_cleanup (decl, cleanup, false);
1356 /* If the current scope exits with an exception, run CLEANUP. */
1359 finish_eh_cleanup (tree cleanup)
1361 push_cleanup (NULL, cleanup, true);
1364 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1365 order they were written by the user. Each node is as for
1366 emit_mem_initializers. */
1369 finish_mem_initializers (tree mem_inits)
1371 /* Reorder the MEM_INITS so that they are in the order they appeared
1372 in the source program. */
1373 mem_inits = nreverse (mem_inits);
1375 if (processing_template_decl)
1379 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1381 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1382 check for bare parameter packs in the TREE_VALUE, because
1383 any parameter packs in the TREE_VALUE have already been
1384 bound as part of the TREE_PURPOSE. See
1385 make_pack_expansion for more information. */
1386 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1387 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1388 TREE_VALUE (mem) = error_mark_node;
1391 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1394 emit_mem_initializers (mem_inits);
1397 /* Finish a parenthesized expression EXPR. */
1400 finish_parenthesized_expr (tree expr)
1403 /* This inhibits warnings in c_common_truthvalue_conversion. */
1404 TREE_NO_WARNING (expr) = 1;
1406 if (TREE_CODE (expr) == OFFSET_REF)
1407 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1408 enclosed in parentheses. */
1409 PTRMEM_OK_P (expr) = 0;
1411 if (TREE_CODE (expr) == STRING_CST)
1412 PAREN_STRING_LITERAL_P (expr) = 1;
1417 /* Finish a reference to a non-static data member (DECL) that is not
1418 preceded by `.' or `->'. */
1421 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1423 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1425 if (!object && skip_evaluation)
1427 /* DR 613: Can use non-static data members without an associated
1428 object in sizeof/decltype/alignof. */
1429 tree scope = qualifying_scope;
1430 if (scope == NULL_TREE)
1431 scope = context_for_name_lookup (decl);
1432 object = maybe_dummy_object (scope, NULL);
1437 if (current_function_decl
1438 && DECL_STATIC_FUNCTION_P (current_function_decl))
1439 error ("invalid use of member %q+D in static member function", decl);
1441 error ("invalid use of non-static data member %q+D", decl);
1442 error ("from this location");
1444 return error_mark_node;
1446 if (current_class_ptr)
1447 TREE_USED (current_class_ptr) = 1;
1448 if (processing_template_decl && !qualifying_scope)
1450 tree type = TREE_TYPE (decl);
1452 if (TREE_CODE (type) == REFERENCE_TYPE)
1453 type = TREE_TYPE (type);
1456 /* Set the cv qualifiers. */
1457 int quals = (current_class_ref
1458 ? cp_type_quals (TREE_TYPE (current_class_ref))
1459 : TYPE_UNQUALIFIED);
1461 if (DECL_MUTABLE_P (decl))
1462 quals &= ~TYPE_QUAL_CONST;
1464 quals |= cp_type_quals (TREE_TYPE (decl));
1465 type = cp_build_qualified_type (type, quals);
1468 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1472 tree access_type = TREE_TYPE (object);
1473 tree lookup_context = context_for_name_lookup (decl);
1475 while (!DERIVED_FROM_P (lookup_context, access_type))
1477 access_type = TYPE_CONTEXT (access_type);
1478 while (access_type && DECL_P (access_type))
1479 access_type = DECL_CONTEXT (access_type);
1483 error ("object missing in reference to %q+D", decl);
1484 error ("from this location");
1485 return error_mark_node;
1489 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1490 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1492 if (processing_template_decl)
1493 return build_qualified_name (TREE_TYPE (decl),
1496 /*template_p=*/false);
1498 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1501 /* If the data member was named `C::M', convert `*this' to `C'
1503 if (qualifying_scope)
1505 tree binfo = NULL_TREE;
1506 object = build_scoped_ref (object, qualifying_scope,
1510 return build_class_member_access_expr (object, decl,
1511 /*access_path=*/NULL_TREE,
1512 /*preserve_reference=*/false,
1513 tf_warning_or_error);
1517 /* DECL was the declaration to which a qualified-id resolved. Issue
1518 an error message if it is not accessible. If OBJECT_TYPE is
1519 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1520 type of `*x', or `x', respectively. If the DECL was named as
1521 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1524 check_accessibility_of_qualified_id (tree decl,
1526 tree nested_name_specifier)
1529 tree qualifying_type = NULL_TREE;
1531 /* If we're not checking, return immediately. */
1532 if (deferred_access_no_check)
1535 /* Determine the SCOPE of DECL. */
1536 scope = context_for_name_lookup (decl);
1537 /* If the SCOPE is not a type, then DECL is not a member. */
1538 if (!TYPE_P (scope))
1540 /* Compute the scope through which DECL is being accessed. */
1542 /* OBJECT_TYPE might not be a class type; consider:
1544 class A { typedef int I; };
1548 In this case, we will have "A::I" as the DECL, but "I" as the
1550 && CLASS_TYPE_P (object_type)
1551 && DERIVED_FROM_P (scope, object_type))
1552 /* If we are processing a `->' or `.' expression, use the type of the
1554 qualifying_type = object_type;
1555 else if (nested_name_specifier)
1557 /* If the reference is to a non-static member of the
1558 current class, treat it as if it were referenced through
1560 if (DECL_NONSTATIC_MEMBER_P (decl)
1561 && current_class_ptr
1562 && DERIVED_FROM_P (scope, current_class_type))
1563 qualifying_type = current_class_type;
1564 /* Otherwise, use the type indicated by the
1565 nested-name-specifier. */
1567 qualifying_type = nested_name_specifier;
1570 /* Otherwise, the name must be from the current class or one of
1572 qualifying_type = currently_open_derived_class (scope);
1575 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1576 or similar in a default argument value. */
1577 && CLASS_TYPE_P (qualifying_type)
1578 && !dependent_type_p (qualifying_type))
1579 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1583 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1584 class named to the left of the "::" operator. DONE is true if this
1585 expression is a complete postfix-expression; it is false if this
1586 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1587 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1588 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1589 is true iff this qualified name appears as a template argument. */
1592 finish_qualified_id_expr (tree qualifying_class,
1597 bool template_arg_p)
1599 gcc_assert (TYPE_P (qualifying_class));
1601 if (error_operand_p (expr))
1602 return error_mark_node;
1604 if (DECL_P (expr) || BASELINK_P (expr))
1608 check_template_keyword (expr);
1610 /* If EXPR occurs as the operand of '&', use special handling that
1611 permits a pointer-to-member. */
1612 if (address_p && done)
1614 if (TREE_CODE (expr) == SCOPE_REF)
1615 expr = TREE_OPERAND (expr, 1);
1616 expr = build_offset_ref (qualifying_class, expr,
1617 /*address_p=*/true);
1621 /* Within the scope of a class, turn references to non-static
1622 members into expression of the form "this->...". */
1624 /* But, within a template argument, we do not want make the
1625 transformation, as there is no "this" pointer. */
1627 else if (TREE_CODE (expr) == FIELD_DECL)
1629 push_deferring_access_checks (dk_no_check);
1630 expr = finish_non_static_data_member (expr, current_class_ref,
1632 pop_deferring_access_checks ();
1634 else if (BASELINK_P (expr) && !processing_template_decl)
1638 /* See if any of the functions are non-static members. */
1639 fns = BASELINK_FUNCTIONS (expr);
1640 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1641 fns = TREE_OPERAND (fns, 0);
1642 /* If so, the expression may be relative to the current
1644 if (!shared_member_p (fns)
1645 && current_class_type
1646 && DERIVED_FROM_P (qualifying_class, current_class_type))
1647 expr = (build_class_member_access_expr
1648 (maybe_dummy_object (qualifying_class, NULL),
1650 BASELINK_ACCESS_BINFO (expr),
1651 /*preserve_reference=*/false,
1652 tf_warning_or_error));
1654 /* The expression is a qualified name whose address is not
1656 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1662 /* Begin a statement-expression. The value returned must be passed to
1663 finish_stmt_expr. */
1666 begin_stmt_expr (void)
1668 return push_stmt_list ();
1671 /* Process the final expression of a statement expression. EXPR can be
1672 NULL, if the final expression is empty. Return a STATEMENT_LIST
1673 containing all the statements in the statement-expression, or
1674 ERROR_MARK_NODE if there was an error. */
1677 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1679 if (error_operand_p (expr))
1681 /* The type of the statement-expression is the type of the last
1683 TREE_TYPE (stmt_expr) = error_mark_node;
1684 return error_mark_node;
1687 /* If the last statement does not have "void" type, then the value
1688 of the last statement is the value of the entire expression. */
1691 tree type = TREE_TYPE (expr);
1693 if (processing_template_decl)
1695 expr = build_stmt (EXPR_STMT, expr);
1696 expr = add_stmt (expr);
1697 /* Mark the last statement so that we can recognize it as such at
1698 template-instantiation time. */
1699 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1701 else if (VOID_TYPE_P (type))
1703 /* Just treat this like an ordinary statement. */
1704 expr = finish_expr_stmt (expr);
1708 /* It actually has a value we need to deal with. First, force it
1709 to be an rvalue so that we won't need to build up a copy
1710 constructor call later when we try to assign it to something. */
1711 expr = force_rvalue (expr);
1712 if (error_operand_p (expr))
1713 return error_mark_node;
1715 /* Update for array-to-pointer decay. */
1716 type = TREE_TYPE (expr);
1718 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1719 normal statement, but don't convert to void or actually add
1721 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1722 expr = maybe_cleanup_point_expr (expr);
1726 /* The type of the statement-expression is the type of the last
1728 TREE_TYPE (stmt_expr) = type;
1734 /* Finish a statement-expression. EXPR should be the value returned
1735 by the previous begin_stmt_expr. Returns an expression
1736 representing the statement-expression. */
1739 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1744 if (error_operand_p (stmt_expr))
1746 pop_stmt_list (stmt_expr);
1747 return error_mark_node;
1750 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1752 type = TREE_TYPE (stmt_expr);
1753 result = pop_stmt_list (stmt_expr);
1754 TREE_TYPE (result) = type;
1756 if (processing_template_decl)
1758 result = build_min (STMT_EXPR, type, result);
1759 TREE_SIDE_EFFECTS (result) = 1;
1760 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1762 else if (CLASS_TYPE_P (type))
1764 /* Wrap the statement-expression in a TARGET_EXPR so that the
1765 temporary object created by the final expression is destroyed at
1766 the end of the full-expression containing the
1767 statement-expression. */
1768 result = force_target_expr (type, result);
1774 /* Returns the expression which provides the value of STMT_EXPR. */
1777 stmt_expr_value_expr (tree stmt_expr)
1779 tree t = STMT_EXPR_STMT (stmt_expr);
1781 if (TREE_CODE (t) == BIND_EXPR)
1782 t = BIND_EXPR_BODY (t);
1784 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1785 t = STATEMENT_LIST_TAIL (t)->stmt;
1787 if (TREE_CODE (t) == EXPR_STMT)
1788 t = EXPR_STMT_EXPR (t);
1793 /* Perform Koenig lookup. FN is the postfix-expression representing
1794 the function (or functions) to call; ARGS are the arguments to the
1795 call. Returns the functions to be considered by overload
1799 perform_koenig_lookup (tree fn, tree args)
1801 tree identifier = NULL_TREE;
1802 tree functions = NULL_TREE;
1803 tree tmpl_args = NULL_TREE;
1804 bool template_id = false;
1806 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1808 /* Use a separate flag to handle null args. */
1810 tmpl_args = TREE_OPERAND (fn, 1);
1811 fn = TREE_OPERAND (fn, 0);
1814 /* Find the name of the overloaded function. */
1815 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1817 else if (is_overloaded_fn (fn))
1820 identifier = DECL_NAME (get_first_fn (functions));
1822 else if (DECL_P (fn))
1825 identifier = DECL_NAME (fn);
1828 /* A call to a namespace-scope function using an unqualified name.
1830 Do Koenig lookup -- unless any of the arguments are
1832 if (!any_type_dependent_arguments_p (args)
1833 && !any_dependent_template_arguments_p (tmpl_args))
1835 fn = lookup_arg_dependent (identifier, functions, args);
1837 /* The unqualified name could not be resolved. */
1838 fn = unqualified_fn_lookup_error (identifier);
1841 if (fn && template_id)
1842 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1847 /* Generate an expression for `FN (ARGS)'.
1849 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1850 as a virtual call, even if FN is virtual. (This flag is set when
1851 encountering an expression where the function name is explicitly
1852 qualified. For example a call to `X::f' never generates a virtual
1855 Returns code for the call. */
1858 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p,
1859 tsubst_flags_t complain)
1865 if (fn == error_mark_node || args == error_mark_node)
1866 return error_mark_node;
1868 /* ARGS should be a list of arguments. */
1869 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1870 gcc_assert (!TYPE_P (fn));
1875 if (processing_template_decl)
1877 if (type_dependent_expression_p (fn)
1878 || any_type_dependent_arguments_p (args))
1880 result = build_nt_call_list (fn, args);
1881 KOENIG_LOOKUP_P (result) = koenig_p;
1886 tree fndecl = OVL_CURRENT (fn);
1887 if (TREE_CODE (fndecl) != FUNCTION_DECL
1888 || !TREE_THIS_VOLATILE (fndecl))
1894 current_function_returns_abnormally = 1;
1898 if (!BASELINK_P (fn)
1899 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1900 && TREE_TYPE (fn) != unknown_type_node)
1901 fn = build_non_dependent_expr (fn);
1902 args = build_non_dependent_args (orig_args);
1905 if (is_overloaded_fn (fn))
1906 fn = baselink_for_fns (fn);
1909 if (BASELINK_P (fn))
1913 /* A call to a member function. From [over.call.func]:
1915 If the keyword this is in scope and refers to the class of
1916 that member function, or a derived class thereof, then the
1917 function call is transformed into a qualified function call
1918 using (*this) as the postfix-expression to the left of the
1919 . operator.... [Otherwise] a contrived object of type T
1920 becomes the implied object argument.
1922 This paragraph is unclear about this situation:
1924 struct A { void f(); };
1925 struct B : public A {};
1926 struct C : public A { void g() { B::f(); }};
1928 In particular, for `B::f', this paragraph does not make clear
1929 whether "the class of that member function" refers to `A' or
1930 to `B'. We believe it refers to `B'. */
1931 if (current_class_type
1932 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1934 && current_class_ref)
1935 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1939 tree representative_fn;
1941 representative_fn = BASELINK_FUNCTIONS (fn);
1942 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1943 representative_fn = TREE_OPERAND (representative_fn, 0);
1944 representative_fn = get_first_fn (representative_fn);
1945 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1948 if (processing_template_decl)
1950 if (type_dependent_expression_p (object))
1951 return build_nt_call_list (orig_fn, orig_args);
1952 object = build_non_dependent_expr (object);
1955 result = build_new_method_call (object, fn, args, NULL_TREE,
1957 ? LOOKUP_NONVIRTUAL : 0),
1961 else if (is_overloaded_fn (fn))
1963 /* If the function is an overloaded builtin, resolve it. */
1964 if (TREE_CODE (fn) == FUNCTION_DECL
1965 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1966 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1967 result = resolve_overloaded_builtin (fn, args);
1970 /* A call to a namespace-scope function. */
1971 result = build_new_function_call (fn, args, koenig_p, complain);
1973 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1976 error ("arguments to destructor are not allowed");
1977 /* Mark the pseudo-destructor call as having side-effects so
1978 that we do not issue warnings about its use. */
1979 result = build1 (NOP_EXPR,
1981 TREE_OPERAND (fn, 0));
1982 TREE_SIDE_EFFECTS (result) = 1;
1984 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1985 /* If the "function" is really an object of class type, it might
1986 have an overloaded `operator ()'. */
1987 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1988 /*overloaded_p=*/NULL, complain);
1991 /* A call where the function is unknown. */
1992 result = cp_build_function_call (fn, args, complain);
1994 if (processing_template_decl)
1996 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
1997 KOENIG_LOOKUP_P (result) = koenig_p;
2002 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2003 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2004 POSTDECREMENT_EXPR.) */
2007 finish_increment_expr (tree expr, enum tree_code code)
2009 return build_x_unary_op (code, expr, tf_warning_or_error);
2012 /* Finish a use of `this'. Returns an expression for `this'. */
2015 finish_this_expr (void)
2019 if (current_class_ptr)
2021 result = current_class_ptr;
2023 else if (current_function_decl
2024 && DECL_STATIC_FUNCTION_P (current_function_decl))
2026 error ("%<this%> is unavailable for static member functions");
2027 result = error_mark_node;
2031 if (current_function_decl)
2032 error ("invalid use of %<this%> in non-member function");
2034 error ("invalid use of %<this%> at top level");
2035 result = error_mark_node;
2041 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2042 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2043 the TYPE for the type given. If SCOPE is non-NULL, the expression
2044 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2047 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2049 if (object == error_mark_node || destructor == error_mark_node)
2050 return error_mark_node;
2052 gcc_assert (TYPE_P (destructor));
2054 if (!processing_template_decl)
2056 if (scope == error_mark_node)
2058 error ("invalid qualifying scope in pseudo-destructor name");
2059 return error_mark_node;
2061 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2063 error ("qualified type %qT does not match destructor name ~%qT",
2065 return error_mark_node;
2069 /* [expr.pseudo] says both:
2071 The type designated by the pseudo-destructor-name shall be
2072 the same as the object type.
2076 The cv-unqualified versions of the object type and of the
2077 type designated by the pseudo-destructor-name shall be the
2080 We implement the more generous second sentence, since that is
2081 what most other compilers do. */
2082 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2085 error ("%qE is not of type %qT", object, destructor);
2086 return error_mark_node;
2090 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2093 /* Finish an expression of the form CODE EXPR. */
2096 finish_unary_op_expr (enum tree_code code, tree expr)
2098 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2099 /* Inside a template, build_x_unary_op does not fold the
2100 expression. So check whether the result is folded before
2101 setting TREE_NEGATED_INT. */
2102 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2103 && TREE_CODE (result) == INTEGER_CST
2104 && !TYPE_UNSIGNED (TREE_TYPE (result))
2105 && INT_CST_LT (result, integer_zero_node))
2107 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2108 setting TREE_NEGATED_INT. */
2109 result = copy_node (result);
2110 TREE_NEGATED_INT (result) = 1;
2112 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2113 overflow_warning (result);
2118 /* Finish a compound-literal expression. TYPE is the type to which
2119 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2122 finish_compound_literal (tree type, tree compound_literal)
2124 if (type == error_mark_node)
2125 return error_mark_node;
2127 if (!TYPE_OBJ_P (type))
2129 error ("compound literal of non-object type %qT", type);
2130 return error_mark_node;
2133 if (processing_template_decl)
2135 TREE_TYPE (compound_literal) = type;
2136 /* Mark the expression as a compound literal. */
2137 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2138 return compound_literal;
2141 type = complete_type (type);
2143 if (TYPE_NON_AGGREGATE_CLASS (type))
2145 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2146 everywhere that deals with function arguments would be a pain, so
2147 just wrap it in a TREE_LIST. The parser set a flag so we know
2148 that it came from T{} rather than T({}). */
2149 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2150 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2151 return build_functional_cast (type, compound_literal, tf_error);
2154 if (TREE_CODE (type) == ARRAY_TYPE
2155 && check_array_initializer (NULL_TREE, type, compound_literal))
2156 return error_mark_node;
2157 compound_literal = reshape_init (type, compound_literal);
2158 if (TREE_CODE (type) == ARRAY_TYPE)
2159 cp_complete_array_type (&type, compound_literal, false);
2160 compound_literal = digest_init (type, compound_literal);
2161 if ((!at_function_scope_p () || cp_type_readonly (type))
2162 && initializer_constant_valid_p (compound_literal, type))
2164 tree decl = create_temporary_var (type);
2165 DECL_INITIAL (decl) = compound_literal;
2166 TREE_STATIC (decl) = 1;
2167 decl = pushdecl_top_level (decl);
2168 DECL_NAME (decl) = make_anon_name ();
2169 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2173 return get_target_expr (compound_literal);
2176 /* Return the declaration for the function-name variable indicated by
2180 finish_fname (tree id)
2184 decl = fname_decl (input_location, C_RID_CODE (id), id);
2185 if (processing_template_decl)
2186 decl = DECL_NAME (decl);
2190 /* Finish a translation unit. */
2193 finish_translation_unit (void)
2195 /* In case there were missing closebraces,
2196 get us back to the global binding level. */
2198 while (current_namespace != global_namespace)
2201 /* Do file scope __FUNCTION__ et al. */
2202 finish_fname_decls ();
2205 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2206 Returns the parameter. */
2209 finish_template_type_parm (tree aggr, tree identifier)
2211 if (aggr != class_type_node)
2213 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2214 aggr = class_type_node;
2217 return build_tree_list (aggr, identifier);
2220 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2221 Returns the parameter. */
2224 finish_template_template_parm (tree aggr, tree identifier)
2226 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2227 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2228 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2229 DECL_TEMPLATE_RESULT (tmpl) = decl;
2230 DECL_ARTIFICIAL (decl) = 1;
2231 end_template_decl ();
2233 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2235 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2236 /*is_primary=*/true, /*is_partial=*/false,
2239 return finish_template_type_parm (aggr, tmpl);
2242 /* ARGUMENT is the default-argument value for a template template
2243 parameter. If ARGUMENT is invalid, issue error messages and return
2244 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2247 check_template_template_default_arg (tree argument)
2249 if (TREE_CODE (argument) != TEMPLATE_DECL
2250 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2251 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2253 if (TREE_CODE (argument) == TYPE_DECL)
2254 error ("invalid use of type %qT as a default value for a template "
2255 "template-parameter", TREE_TYPE (argument));
2257 error ("invalid default argument for a template template parameter");
2258 return error_mark_node;
2264 /* Begin a class definition, as indicated by T. */
2267 begin_class_definition (tree t, tree attributes)
2269 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2270 return error_mark_node;
2272 if (processing_template_parmlist)
2274 error ("definition of %q#T inside template parameter list", t);
2275 return error_mark_node;
2277 /* A non-implicit typename comes from code like:
2279 template <typename T> struct A {
2280 template <typename U> struct A<T>::B ...
2282 This is erroneous. */
2283 else if (TREE_CODE (t) == TYPENAME_TYPE)
2285 error ("invalid definition of qualified type %qT", t);
2286 t = error_mark_node;
2289 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2291 t = make_class_type (RECORD_TYPE);
2292 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2295 /* Update the location of the decl. */
2296 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2298 if (TYPE_BEING_DEFINED (t))
2300 t = make_class_type (TREE_CODE (t));
2301 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2303 maybe_process_partial_specialization (t);
2305 TYPE_BEING_DEFINED (t) = 1;
2307 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2309 if (flag_pack_struct)
2312 TYPE_PACKED (t) = 1;
2313 /* Even though the type is being defined for the first time
2314 here, there might have been a forward declaration, so there
2315 might be cv-qualified variants of T. */
2316 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2317 TYPE_PACKED (v) = 1;
2319 /* Reset the interface data, at the earliest possible
2320 moment, as it might have been set via a class foo;
2322 if (! TYPE_ANONYMOUS_P (t))
2324 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2325 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2326 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2327 (t, finfo->interface_unknown);
2329 reset_specialization();
2331 /* Make a declaration for this class in its own scope. */
2332 build_self_reference ();
2337 /* Finish the member declaration given by DECL. */
2340 finish_member_declaration (tree decl)
2342 if (decl == error_mark_node || decl == NULL_TREE)
2345 if (decl == void_type_node)
2346 /* The COMPONENT was a friend, not a member, and so there's
2347 nothing for us to do. */
2350 /* We should see only one DECL at a time. */
2351 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2353 /* Set up access control for DECL. */
2355 = (current_access_specifier == access_private_node);
2356 TREE_PROTECTED (decl)
2357 = (current_access_specifier == access_protected_node);
2358 if (TREE_CODE (decl) == TEMPLATE_DECL)
2360 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2361 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2364 /* Mark the DECL as a member of the current class. */
2365 DECL_CONTEXT (decl) = current_class_type;
2367 /* Check for bare parameter packs in the member variable declaration. */
2368 if (TREE_CODE (decl) == FIELD_DECL)
2370 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2371 TREE_TYPE (decl) = error_mark_node;
2372 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2373 DECL_ATTRIBUTES (decl) = NULL_TREE;
2378 A C language linkage is ignored for the names of class members
2379 and the member function type of class member functions. */
2380 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2381 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2383 /* Put functions on the TYPE_METHODS list and everything else on the
2384 TYPE_FIELDS list. Note that these are built up in reverse order.
2385 We reverse them (to obtain declaration order) in finish_struct. */
2386 if (TREE_CODE (decl) == FUNCTION_DECL
2387 || DECL_FUNCTION_TEMPLATE_P (decl))
2389 /* We also need to add this function to the
2390 CLASSTYPE_METHOD_VEC. */
2391 if (add_method (current_class_type, decl, NULL_TREE))
2393 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2394 TYPE_METHODS (current_class_type) = decl;
2396 maybe_add_class_template_decl_list (current_class_type, decl,
2400 /* Enter the DECL into the scope of the class. */
2401 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2402 || pushdecl_class_level (decl))
2404 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2405 go at the beginning. The reason is that lookup_field_1
2406 searches the list in order, and we want a field name to
2407 override a type name so that the "struct stat hack" will
2408 work. In particular:
2410 struct S { enum E { }; int E } s;
2413 is valid. In addition, the FIELD_DECLs must be maintained in
2414 declaration order so that class layout works as expected.
2415 However, we don't need that order until class layout, so we
2416 save a little time by putting FIELD_DECLs on in reverse order
2417 here, and then reversing them in finish_struct_1. (We could
2418 also keep a pointer to the correct insertion points in the
2421 if (TREE_CODE (decl) == TYPE_DECL)
2422 TYPE_FIELDS (current_class_type)
2423 = chainon (TYPE_FIELDS (current_class_type), decl);
2426 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2427 TYPE_FIELDS (current_class_type) = decl;
2430 maybe_add_class_template_decl_list (current_class_type, decl,
2435 note_decl_for_pch (decl);
2438 /* DECL has been declared while we are building a PCH file. Perform
2439 actions that we might normally undertake lazily, but which can be
2440 performed now so that they do not have to be performed in
2441 translation units which include the PCH file. */
2444 note_decl_for_pch (tree decl)
2446 gcc_assert (pch_file);
2448 /* There's a good chance that we'll have to mangle names at some
2449 point, even if only for emission in debugging information. */
2450 if ((TREE_CODE (decl) == VAR_DECL
2451 || TREE_CODE (decl) == FUNCTION_DECL)
2452 && !processing_template_decl)
2456 /* Finish processing a complete template declaration. The PARMS are
2457 the template parameters. */
2460 finish_template_decl (tree parms)
2463 end_template_decl ();
2465 end_specialization ();
2468 /* Finish processing a template-id (which names a type) of the form
2469 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2470 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2471 the scope of template-id indicated. */
2474 finish_template_type (tree name, tree args, int entering_scope)
2478 decl = lookup_template_class (name, args,
2479 NULL_TREE, NULL_TREE, entering_scope,
2480 tf_warning_or_error | tf_user);
2481 if (decl != error_mark_node)
2482 decl = TYPE_STUB_DECL (decl);
2487 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2488 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2489 BASE_CLASS, or NULL_TREE if an error occurred. The
2490 ACCESS_SPECIFIER is one of
2491 access_{default,public,protected_private}_node. For a virtual base
2492 we set TREE_TYPE. */
2495 finish_base_specifier (tree base, tree access, bool virtual_p)
2499 if (base == error_mark_node)
2501 error ("invalid base-class specification");
2504 else if (! MAYBE_CLASS_TYPE_P (base))
2506 error ("%qT is not a class type", base);
2511 if (cp_type_quals (base) != 0)
2513 error ("base class %qT has cv qualifiers", base);
2514 base = TYPE_MAIN_VARIANT (base);
2516 result = build_tree_list (access, base);
2518 TREE_TYPE (result) = integer_type_node;
2524 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2525 what we found when we tried to do the lookup.
2526 LOCATION is the location of the NAME identifier;
2527 The location is used in the error message*/
2530 qualified_name_lookup_error (tree scope, tree name,
2531 tree decl, location_t location)
2533 if (scope == error_mark_node)
2534 ; /* We already complained. */
2535 else if (TYPE_P (scope))
2537 if (!COMPLETE_TYPE_P (scope))
2538 error ("%Hincomplete type %qT used in nested name specifier",
2540 else if (TREE_CODE (decl) == TREE_LIST)
2542 error ("%Hreference to %<%T::%D%> is ambiguous", &location, scope, name);
2543 print_candidates (decl);
2546 error ("%H%qD is not a member of %qT", &location, name, scope);
2548 else if (scope != global_namespace)
2549 error ("%H%qD is not a member of %qD", &location, name, scope);
2551 error ("%H%<::%D%> has not been declared", &location, name);
2554 /* If FNS is a member function, a set of member functions, or a
2555 template-id referring to one or more member functions, return a
2556 BASELINK for FNS, incorporating the current access context.
2557 Otherwise, return FNS unchanged. */
2560 baselink_for_fns (tree fns)
2565 if (BASELINK_P (fns)
2566 || error_operand_p (fns))
2570 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2571 fn = TREE_OPERAND (fn, 0);
2572 fn = get_first_fn (fn);
2573 if (!DECL_FUNCTION_MEMBER_P (fn))
2576 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2578 cl = DECL_CONTEXT (fn);
2579 cl = TYPE_BINFO (cl);
2580 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2583 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2584 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2585 if non-NULL, is the type or namespace used to explicitly qualify
2586 ID_EXPRESSION. DECL is the entity to which that name has been
2589 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2590 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2591 be set to true if this expression isn't permitted in a
2592 constant-expression, but it is otherwise not set by this function.
2593 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2594 constant-expression, but a non-constant expression is also
2597 DONE is true if this expression is a complete postfix-expression;
2598 it is false if this expression is followed by '->', '[', '(', etc.
2599 ADDRESS_P is true iff this expression is the operand of '&'.
2600 TEMPLATE_P is true iff the qualified-id was of the form
2601 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2602 appears as a template argument.
2604 If an error occurs, and it is the kind of error that might cause
2605 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2606 is the caller's responsibility to issue the message. *ERROR_MSG
2607 will be a string with static storage duration, so the caller need
2610 Return an expression for the entity, after issuing appropriate
2611 diagnostics. This function is also responsible for transforming a
2612 reference to a non-static member into a COMPONENT_REF that makes
2613 the use of "this" explicit.
2615 Upon return, *IDK will be filled in appropriately. */
2617 finish_id_expression (tree id_expression,
2621 bool integral_constant_expression_p,
2622 bool allow_non_integral_constant_expression_p,
2623 bool *non_integral_constant_expression_p,
2627 bool template_arg_p,
2628 const char **error_msg,
2629 location_t location)
2631 /* Initialize the output parameters. */
2632 *idk = CP_ID_KIND_NONE;
2635 if (id_expression == error_mark_node)
2636 return error_mark_node;
2637 /* If we have a template-id, then no further lookup is
2638 required. If the template-id was for a template-class, we
2639 will sometimes have a TYPE_DECL at this point. */
2640 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2641 || TREE_CODE (decl) == TYPE_DECL)
2643 /* Look up the name. */
2646 if (decl == error_mark_node)
2648 /* Name lookup failed. */
2651 || (!dependent_type_p (scope)
2652 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2653 && IDENTIFIER_TYPENAME_P (id_expression)
2654 && dependent_type_p (TREE_TYPE (id_expression))))))
2656 /* If the qualifying type is non-dependent (and the name
2657 does not name a conversion operator to a dependent
2658 type), issue an error. */
2659 qualified_name_lookup_error (scope, id_expression, decl, location);
2660 return error_mark_node;
2664 /* It may be resolved via Koenig lookup. */
2665 *idk = CP_ID_KIND_UNQUALIFIED;
2666 return id_expression;
2669 decl = id_expression;
2671 /* If DECL is a variable that would be out of scope under
2672 ANSI/ISO rules, but in scope in the ARM, name lookup
2673 will succeed. Issue a diagnostic here. */
2675 decl = check_for_out_of_scope_variable (decl);
2677 /* Remember that the name was used in the definition of
2678 the current class so that we can check later to see if
2679 the meaning would have been different after the class
2680 was entirely defined. */
2681 if (!scope && decl != error_mark_node)
2682 maybe_note_name_used_in_class (id_expression, decl);
2684 /* Disallow uses of local variables from containing functions. */
2685 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2687 tree context = decl_function_context (decl);
2688 if (context != NULL_TREE && context != current_function_decl
2689 && ! TREE_STATIC (decl))
2691 error (TREE_CODE (decl) == VAR_DECL
2692 ? "use of %<auto%> variable from containing function"
2693 : "use of parameter from containing function");
2694 error (" %q+#D declared here", decl);
2695 return error_mark_node;
2700 /* If we didn't find anything, or what we found was a type,
2701 then this wasn't really an id-expression. */
2702 if (TREE_CODE (decl) == TEMPLATE_DECL
2703 && !DECL_FUNCTION_TEMPLATE_P (decl))
2705 *error_msg = "missing template arguments";
2706 return error_mark_node;
2708 else if (TREE_CODE (decl) == TYPE_DECL
2709 || TREE_CODE (decl) == NAMESPACE_DECL)
2711 *error_msg = "expected primary-expression";
2712 return error_mark_node;
2715 /* If the name resolved to a template parameter, there is no
2716 need to look it up again later. */
2717 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2718 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2722 *idk = CP_ID_KIND_NONE;
2723 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2724 decl = TEMPLATE_PARM_DECL (decl);
2725 r = convert_from_reference (DECL_INITIAL (decl));
2727 if (integral_constant_expression_p
2728 && !dependent_type_p (TREE_TYPE (decl))
2729 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2731 if (!allow_non_integral_constant_expression_p)
2732 error ("template parameter %qD of type %qT is not allowed in "
2733 "an integral constant expression because it is not of "
2734 "integral or enumeration type", decl, TREE_TYPE (decl));
2735 *non_integral_constant_expression_p = true;
2739 /* Similarly, we resolve enumeration constants to their
2740 underlying values. */
2741 else if (TREE_CODE (decl) == CONST_DECL)
2743 *idk = CP_ID_KIND_NONE;
2744 if (!processing_template_decl)
2746 used_types_insert (TREE_TYPE (decl));
2747 return DECL_INITIAL (decl);
2755 /* If the declaration was explicitly qualified indicate
2756 that. The semantics of `A::f(3)' are different than
2757 `f(3)' if `f' is virtual. */
2759 ? CP_ID_KIND_QUALIFIED
2760 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2761 ? CP_ID_KIND_TEMPLATE_ID
2762 : CP_ID_KIND_UNQUALIFIED));
2767 An id-expression is type-dependent if it contains an
2768 identifier that was declared with a dependent type.
2770 The standard is not very specific about an id-expression that
2771 names a set of overloaded functions. What if some of them
2772 have dependent types and some of them do not? Presumably,
2773 such a name should be treated as a dependent name. */
2774 /* Assume the name is not dependent. */
2775 dependent_p = false;
2776 if (!processing_template_decl)
2777 /* No names are dependent outside a template. */
2779 /* A template-id where the name of the template was not resolved
2780 is definitely dependent. */
2781 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2782 && (TREE_CODE (TREE_OPERAND (decl, 0))
2783 == IDENTIFIER_NODE))
2785 /* For anything except an overloaded function, just check its
2787 else if (!is_overloaded_fn (decl))
2789 = dependent_type_p (TREE_TYPE (decl));
2790 /* For a set of overloaded functions, check each of the
2796 if (BASELINK_P (fns))
2797 fns = BASELINK_FUNCTIONS (fns);
2799 /* For a template-id, check to see if the template
2800 arguments are dependent. */
2801 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2803 tree args = TREE_OPERAND (fns, 1);
2804 dependent_p = any_dependent_template_arguments_p (args);
2805 /* The functions are those referred to by the
2807 fns = TREE_OPERAND (fns, 0);
2810 /* If there are no dependent template arguments, go through
2811 the overloaded functions. */
2812 while (fns && !dependent_p)
2814 tree fn = OVL_CURRENT (fns);
2816 /* Member functions of dependent classes are
2818 if (TREE_CODE (fn) == FUNCTION_DECL
2819 && type_dependent_expression_p (fn))
2821 else if (TREE_CODE (fn) == TEMPLATE_DECL
2822 && dependent_template_p (fn))
2825 fns = OVL_NEXT (fns);
2829 /* If the name was dependent on a template parameter, we will
2830 resolve the name at instantiation time. */
2833 /* Create a SCOPE_REF for qualified names, if the scope is
2839 if (address_p && done)
2840 decl = finish_qualified_id_expr (scope, decl,
2846 tree type = NULL_TREE;
2847 if (DECL_P (decl) && !dependent_scope_p (scope))
2848 type = TREE_TYPE (decl);
2849 decl = build_qualified_name (type,
2855 if (TREE_TYPE (decl))
2856 decl = convert_from_reference (decl);
2859 /* A TEMPLATE_ID already contains all the information we
2861 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2862 return id_expression;
2863 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2864 /* If we found a variable, then name lookup during the
2865 instantiation will always resolve to the same VAR_DECL
2866 (or an instantiation thereof). */
2867 if (TREE_CODE (decl) == VAR_DECL
2868 || TREE_CODE (decl) == PARM_DECL)
2869 return convert_from_reference (decl);
2870 /* The same is true for FIELD_DECL, but we also need to
2871 make sure that the syntax is correct. */
2872 else if (TREE_CODE (decl) == FIELD_DECL)
2874 /* Since SCOPE is NULL here, this is an unqualified name.
2875 Access checking has been performed during name lookup
2876 already. Turn off checking to avoid duplicate errors. */
2877 push_deferring_access_checks (dk_no_check);
2878 decl = finish_non_static_data_member
2879 (decl, current_class_ref,
2880 /*qualifying_scope=*/NULL_TREE);
2881 pop_deferring_access_checks ();
2884 return id_expression;
2887 /* Only certain kinds of names are allowed in constant
2888 expression. Enumerators and template parameters have already
2889 been handled above. */
2890 if (integral_constant_expression_p
2891 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2892 && ! builtin_valid_in_constant_expr_p (decl))
2894 if (!allow_non_integral_constant_expression_p)
2896 error ("%qD cannot appear in a constant-expression", decl);
2897 return error_mark_node;
2899 *non_integral_constant_expression_p = true;
2902 if (TREE_CODE (decl) == NAMESPACE_DECL)
2904 error ("use of namespace %qD as expression", decl);
2905 return error_mark_node;
2907 else if (DECL_CLASS_TEMPLATE_P (decl))
2909 error ("use of class template %qT as expression", decl);
2910 return error_mark_node;
2912 else if (TREE_CODE (decl) == TREE_LIST)
2914 /* Ambiguous reference to base members. */
2915 error ("request for member %qD is ambiguous in "
2916 "multiple inheritance lattice", id_expression);
2917 print_candidates (decl);
2918 return error_mark_node;
2921 /* Mark variable-like entities as used. Functions are similarly
2922 marked either below or after overload resolution. */
2923 if (TREE_CODE (decl) == VAR_DECL
2924 || TREE_CODE (decl) == PARM_DECL
2925 || TREE_CODE (decl) == RESULT_DECL)
2930 decl = (adjust_result_of_qualified_name_lookup
2931 (decl, scope, current_class_type));
2933 if (TREE_CODE (decl) == FUNCTION_DECL)
2936 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2937 decl = finish_qualified_id_expr (scope,
2945 tree r = convert_from_reference (decl);
2947 if (processing_template_decl && TYPE_P (scope))
2948 r = build_qualified_name (TREE_TYPE (r),
2954 else if (TREE_CODE (decl) == FIELD_DECL)
2956 /* Since SCOPE is NULL here, this is an unqualified name.
2957 Access checking has been performed during name lookup
2958 already. Turn off checking to avoid duplicate errors. */
2959 push_deferring_access_checks (dk_no_check);
2960 decl = finish_non_static_data_member (decl, current_class_ref,
2961 /*qualifying_scope=*/NULL_TREE);
2962 pop_deferring_access_checks ();
2964 else if (is_overloaded_fn (decl))
2969 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2970 first_fn = TREE_OPERAND (first_fn, 0);
2971 first_fn = get_first_fn (first_fn);
2972 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2973 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2975 if (!really_overloaded_fn (decl))
2976 mark_used (first_fn);
2979 && TREE_CODE (first_fn) == FUNCTION_DECL
2980 && DECL_FUNCTION_MEMBER_P (first_fn)
2981 && !shared_member_p (decl))
2983 /* A set of member functions. */
2984 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2985 return finish_class_member_access_expr (decl, id_expression,
2986 /*template_p=*/false,
2987 tf_warning_or_error);
2990 decl = baselink_for_fns (decl);
2994 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2995 && DECL_CLASS_SCOPE_P (decl))
2997 tree context = context_for_name_lookup (decl);
2998 if (context != current_class_type)
3000 tree path = currently_open_derived_class (context);
3001 perform_or_defer_access_check (TYPE_BINFO (path),
3006 decl = convert_from_reference (decl);
3010 if (TREE_DEPRECATED (decl))
3011 warn_deprecated_use (decl);
3016 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3017 use as a type-specifier. */
3020 finish_typeof (tree expr)
3024 if (type_dependent_expression_p (expr))
3026 type = cxx_make_type (TYPEOF_TYPE);
3027 TYPEOF_TYPE_EXPR (type) = expr;
3028 SET_TYPE_STRUCTURAL_EQUALITY (type);
3033 type = unlowered_expr_type (expr);
3035 if (!type || type == unknown_type_node)
3037 error ("type of %qE is unknown", expr);
3038 return error_mark_node;
3044 /* Perform C++-specific checks for __builtin_offsetof before calling
3048 finish_offsetof (tree expr)
3050 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3052 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3053 TREE_OPERAND (expr, 2));
3054 return error_mark_node;
3056 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3057 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3058 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3060 if (TREE_CODE (expr) == COMPONENT_REF
3061 || TREE_CODE (expr) == COMPOUND_EXPR)
3062 expr = TREE_OPERAND (expr, 1);
3063 error ("cannot apply %<offsetof%> to member function %qD", expr);
3064 return error_mark_node;
3066 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3067 expr = TREE_OPERAND (expr, 0);
3068 return fold_offsetof (expr, NULL_TREE);
3071 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3072 function is broken out from the above for the benefit of the tree-ssa
3076 simplify_aggr_init_expr (tree *tp)
3078 tree aggr_init_expr = *tp;
3080 /* Form an appropriate CALL_EXPR. */
3081 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3082 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3083 tree type = TREE_TYPE (slot);
3086 enum style_t { ctor, arg, pcc } style;
3088 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3090 #ifdef PCC_STATIC_STRUCT_RETURN
3096 gcc_assert (TREE_ADDRESSABLE (type));
3100 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3102 aggr_init_expr_nargs (aggr_init_expr),
3103 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3107 /* Replace the first argument to the ctor with the address of the
3109 cxx_mark_addressable (slot);
3110 CALL_EXPR_ARG (call_expr, 0) =
3111 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3113 else if (style == arg)
3115 /* Just mark it addressable here, and leave the rest to
3116 expand_call{,_inline}. */
3117 cxx_mark_addressable (slot);
3118 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3119 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3121 else if (style == pcc)
3123 /* If we're using the non-reentrant PCC calling convention, then we
3124 need to copy the returned value out of the static buffer into the
3126 push_deferring_access_checks (dk_no_check);
3127 call_expr = build_aggr_init (slot, call_expr,
3128 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3129 tf_warning_or_error);
3130 pop_deferring_access_checks ();
3131 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3134 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3136 tree init = build_zero_init (type, NULL_TREE,
3137 /*static_storage_p=*/false);
3138 init = build2 (INIT_EXPR, void_type_node, slot, init);
3139 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3146 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3149 emit_associated_thunks (tree fn)
3151 /* When we use vcall offsets, we emit thunks with the virtual
3152 functions to which they thunk. The whole point of vcall offsets
3153 is so that you can know statically the entire set of thunks that
3154 will ever be needed for a given virtual function, thereby
3155 enabling you to output all the thunks with the function itself. */
3156 if (DECL_VIRTUAL_P (fn))
3160 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3162 if (!THUNK_ALIAS (thunk))
3164 use_thunk (thunk, /*emit_p=*/1);
3165 if (DECL_RESULT_THUNK_P (thunk))
3169 for (probe = DECL_THUNKS (thunk);
3170 probe; probe = TREE_CHAIN (probe))
3171 use_thunk (probe, /*emit_p=*/1);
3175 gcc_assert (!DECL_THUNKS (thunk));
3180 /* Generate RTL for FN. */
3183 expand_or_defer_fn (tree fn)
3185 /* When the parser calls us after finishing the body of a template
3186 function, we don't really want to expand the body. */
3187 if (processing_template_decl)
3189 /* Normally, collection only occurs in rest_of_compilation. So,
3190 if we don't collect here, we never collect junk generated
3191 during the processing of templates until we hit a
3192 non-template function. It's not safe to do this inside a
3193 nested class, though, as the parser may have local state that
3194 is not a GC root. */
3195 if (!function_depth)
3200 gcc_assert (gimple_body (fn));
3202 /* If this is a constructor or destructor body, we have to clone
3204 if (maybe_clone_body (fn))
3206 /* We don't want to process FN again, so pretend we've written
3207 it out, even though we haven't. */
3208 TREE_ASM_WRITTEN (fn) = 1;
3212 /* We make a decision about linkage for these functions at the end
3213 of the compilation. Until that point, we do not want the back
3214 end to output them -- but we do want it to see the bodies of
3215 these functions so that it can inline them as appropriate. */
3216 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3218 if (DECL_INTERFACE_KNOWN (fn))
3219 /* We've already made a decision as to how this function will
3223 DECL_EXTERNAL (fn) = 1;
3224 DECL_NOT_REALLY_EXTERN (fn) = 1;
3225 note_vague_linkage_fn (fn);
3226 /* A non-template inline function with external linkage will
3227 always be COMDAT. As we must eventually determine the
3228 linkage of all functions, and as that causes writes to
3229 the data mapped in from the PCH file, it's advantageous
3230 to mark the functions at this point. */
3231 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3233 /* This function must have external linkage, as
3234 otherwise DECL_INTERFACE_KNOWN would have been
3236 gcc_assert (TREE_PUBLIC (fn));
3237 comdat_linkage (fn);
3238 DECL_INTERFACE_KNOWN (fn) = 1;
3242 import_export_decl (fn);
3244 /* If the user wants us to keep all inline functions, then mark
3245 this function as needed so that finish_file will make sure to
3247 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3251 /* There's no reason to do any of the work here if we're only doing
3252 semantic analysis; this code just generates RTL. */
3253 if (flag_syntax_only)
3258 /* Expand or defer, at the whim of the compilation unit manager. */
3259 cgraph_finalize_function (fn, function_depth > 1);
3271 /* Helper function for walk_tree, used by finalize_nrv below. */
3274 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3276 struct nrv_data *dp = (struct nrv_data *)data;
3279 /* No need to walk into types. There wouldn't be any need to walk into
3280 non-statements, except that we have to consider STMT_EXPRs. */
3283 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3284 but differs from using NULL_TREE in that it indicates that we care
3285 about the value of the RESULT_DECL. */
3286 else if (TREE_CODE (*tp) == RETURN_EXPR)
3287 TREE_OPERAND (*tp, 0) = dp->result;
3288 /* Change all cleanups for the NRV to only run when an exception is
3290 else if (TREE_CODE (*tp) == CLEANUP_STMT
3291 && CLEANUP_DECL (*tp) == dp->var)
3292 CLEANUP_EH_ONLY (*tp) = 1;
3293 /* Replace the DECL_EXPR for the NRV with an initialization of the
3294 RESULT_DECL, if needed. */
3295 else if (TREE_CODE (*tp) == DECL_EXPR
3296 && DECL_EXPR_DECL (*tp) == dp->var)
3299 if (DECL_INITIAL (dp->var)
3300 && DECL_INITIAL (dp->var) != error_mark_node)
3301 init = build2 (INIT_EXPR, void_type_node, dp->result,
3302 DECL_INITIAL (dp->var));
3304 init = build_empty_stmt ();
3305 DECL_INITIAL (dp->var) = NULL_TREE;
3306 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3309 /* And replace all uses of the NRV with the RESULT_DECL. */
3310 else if (*tp == dp->var)
3313 /* Avoid walking into the same tree more than once. Unfortunately, we
3314 can't just use walk_tree_without duplicates because it would only call
3315 us for the first occurrence of dp->var in the function body. */
3316 slot = htab_find_slot (dp->visited, *tp, INSERT);
3322 /* Keep iterating. */
3326 /* Called from finish_function to implement the named return value
3327 optimization by overriding all the RETURN_EXPRs and pertinent
3328 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3329 RESULT_DECL for the function. */
3332 finalize_nrv (tree *tp, tree var, tree result)
3334 struct nrv_data data;
3336 /* Copy debugging information from VAR to RESULT. */
3337 DECL_NAME (result) = DECL_NAME (var);
3338 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3339 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3340 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3341 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3342 /* Don't forget that we take its address. */
3343 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3346 data.result = result;
3347 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3348 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3349 htab_delete (data.visited);
3352 /* Return the declaration for the function called by CALL_EXPR T,
3353 TYPE is the class type of the clause decl. */
3356 omp_clause_info_fndecl (tree t, tree type)
3358 tree ret = get_callee_fndecl (t);
3363 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3364 t = CALL_EXPR_FN (t);
3366 if (TREE_CODE (t) == OBJ_TYPE_REF)
3368 t = cp_fold_obj_type_ref (t, type);
3369 if (TREE_CODE (t) == ADDR_EXPR
3370 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3371 return TREE_OPERAND (t, 0);
3377 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3380 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3381 bool need_copy_ctor, bool need_copy_assignment)
3383 int save_errorcount = errorcount;
3386 /* Always allocate 3 elements for simplicity. These are the
3387 function decls for the ctor, dtor, and assignment op.
3388 This layout is known to the three lang hooks,
3389 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3390 and cxx_omp_clause_assign_op. */
3391 info = make_tree_vec (3);
3392 CP_OMP_CLAUSE_INFO (c) = info;
3394 if (need_default_ctor
3395 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3397 if (need_default_ctor)
3401 t = build_int_cst (build_pointer_type (type), 0);
3402 t = build1 (INDIRECT_REF, type, t);
3403 t = build_tree_list (NULL, t);
3405 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3406 t, type, LOOKUP_NORMAL,
3407 tf_warning_or_error);
3409 if (targetm.cxx.cdtor_returns_this () || errorcount)
3410 /* Because constructors and destructors return this,
3411 the call will have been cast to "void". Remove the
3412 cast here. We would like to use STRIP_NOPS, but it
3413 wouldn't work here because TYPE_MODE (t) and
3414 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3415 They are VOIDmode and Pmode, respectively. */
3416 if (TREE_CODE (t) == NOP_EXPR)
3417 t = TREE_OPERAND (t, 0);
3419 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3422 if ((need_default_ctor || need_copy_ctor)
3423 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3425 t = build_int_cst (build_pointer_type (type), 0);
3426 t = build1 (INDIRECT_REF, type, t);
3427 t = build_special_member_call (t, complete_dtor_identifier,
3428 NULL, type, LOOKUP_NORMAL,
3429 tf_warning_or_error);
3431 if (targetm.cxx.cdtor_returns_this () || errorcount)
3432 /* Because constructors and destructors return this,
3433 the call will have been cast to "void". Remove the
3434 cast here. We would like to use STRIP_NOPS, but it
3435 wouldn't work here because TYPE_MODE (t) and
3436 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3437 They are VOIDmode and Pmode, respectively. */
3438 if (TREE_CODE (t) == NOP_EXPR)
3439 t = TREE_OPERAND (t, 0);
3441 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3444 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3446 t = build_int_cst (build_pointer_type (type), 0);
3447 t = build1 (INDIRECT_REF, type, t);
3448 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3449 build_tree_list (NULL, t),
3450 type, LOOKUP_NORMAL,
3451 tf_warning_or_error);
3453 /* We'll have called convert_from_reference on the call, which
3454 may well have added an indirect_ref. It's unneeded here,
3455 and in the way, so kill it. */
3456 if (TREE_CODE (t) == INDIRECT_REF)
3457 t = TREE_OPERAND (t, 0);
3459 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3462 return errorcount != save_errorcount;
3465 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3466 Remove any elements from the list that are invalid. */
3469 finish_omp_clauses (tree clauses)
3471 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3472 tree c, t, *pc = &clauses;
3475 bitmap_obstack_initialize (NULL);
3476 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3477 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3478 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3480 for (pc = &clauses, c = clauses; c ; c = *pc)
3482 bool remove = false;
3484 switch (OMP_CLAUSE_CODE (c))
3486 case OMP_CLAUSE_SHARED:
3488 goto check_dup_generic;
3489 case OMP_CLAUSE_PRIVATE:
3491 goto check_dup_generic;
3492 case OMP_CLAUSE_REDUCTION:
3494 goto check_dup_generic;
3495 case OMP_CLAUSE_COPYPRIVATE:
3496 name = "copyprivate";
3497 goto check_dup_generic;
3498 case OMP_CLAUSE_COPYIN:
3500 goto check_dup_generic;
3502 t = OMP_CLAUSE_DECL (c);
3503 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3505 if (processing_template_decl)
3508 error ("%qD is not a variable in clause %qs", t, name);
3510 error ("%qE is not a variable in clause %qs", t, name);
3513 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3514 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3515 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3517 error ("%qD appears more than once in data clauses", t);
3521 bitmap_set_bit (&generic_head, DECL_UID (t));
3524 case OMP_CLAUSE_FIRSTPRIVATE:
3525 t = OMP_CLAUSE_DECL (c);
3526 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3528 if (processing_template_decl)
3531 error ("%qD is not a variable in clause %<firstprivate%>", t);
3533 error ("%qE is not a variable in clause %<firstprivate%>", t);
3536 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3537 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3539 error ("%qD appears more than once in data clauses", t);
3543 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3546 case OMP_CLAUSE_LASTPRIVATE:
3547 t = OMP_CLAUSE_DECL (c);
3548 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3550 if (processing_template_decl)
3553 error ("%qD is not a variable in clause %<lastprivate%>", t);
3555 error ("%qE is not a variable in clause %<lastprivate%>", t);
3558 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3559 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3561 error ("%qD appears more than once in data clauses", t);
3565 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3569 t = OMP_CLAUSE_IF_EXPR (c);
3570 t = maybe_convert_cond (t);
3571 if (t == error_mark_node)
3573 OMP_CLAUSE_IF_EXPR (c) = t;
3576 case OMP_CLAUSE_NUM_THREADS:
3577 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3578 if (t == error_mark_node)
3580 else if (!type_dependent_expression_p (t)
3581 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3583 error ("num_threads expression must be integral");
3588 case OMP_CLAUSE_SCHEDULE:
3589 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3592 else if (t == error_mark_node)
3594 else if (!type_dependent_expression_p (t)
3595 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3597 error ("schedule chunk size expression must be integral");
3602 case OMP_CLAUSE_NOWAIT:
3603 case OMP_CLAUSE_ORDERED:
3604 case OMP_CLAUSE_DEFAULT:
3605 case OMP_CLAUSE_UNTIED:
3606 case OMP_CLAUSE_COLLAPSE:
3614 *pc = OMP_CLAUSE_CHAIN (c);
3616 pc = &OMP_CLAUSE_CHAIN (c);
3619 for (pc = &clauses, c = clauses; c ; c = *pc)
3621 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3622 bool remove = false;
3623 bool need_complete_non_reference = false;
3624 bool need_default_ctor = false;
3625 bool need_copy_ctor = false;
3626 bool need_copy_assignment = false;
3627 bool need_implicitly_determined = false;
3628 tree type, inner_type;
3632 case OMP_CLAUSE_SHARED:
3634 need_implicitly_determined = true;
3636 case OMP_CLAUSE_PRIVATE:
3638 need_complete_non_reference = true;
3639 need_default_ctor = true;
3640 need_implicitly_determined = true;
3642 case OMP_CLAUSE_FIRSTPRIVATE:
3643 name = "firstprivate";
3644 need_complete_non_reference = true;
3645 need_copy_ctor = true;
3646 need_implicitly_determined = true;
3648 case OMP_CLAUSE_LASTPRIVATE:
3649 name = "lastprivate";
3650 need_complete_non_reference = true;
3651 need_copy_assignment = true;
3652 need_implicitly_determined = true;
3654 case OMP_CLAUSE_REDUCTION:
3656 need_implicitly_determined = true;
3658 case OMP_CLAUSE_COPYPRIVATE:
3659 name = "copyprivate";
3660 need_copy_assignment = true;
3662 case OMP_CLAUSE_COPYIN:
3664 need_copy_assignment = true;
3667 pc = &OMP_CLAUSE_CHAIN (c);
3671 t = OMP_CLAUSE_DECL (c);
3672 if (processing_template_decl
3673 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3675 pc = &OMP_CLAUSE_CHAIN (c);
3681 case OMP_CLAUSE_LASTPRIVATE:
3682 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3683 need_default_ctor = true;
3686 case OMP_CLAUSE_REDUCTION:
3687 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3688 || POINTER_TYPE_P (TREE_TYPE (t)))
3690 error ("%qE has invalid type for %<reduction%>", t);
3693 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3695 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3703 error ("%qE has invalid type for %<reduction(%s)%>",
3704 t, operator_name_info[r_code].name);
3710 case OMP_CLAUSE_COPYIN:
3711 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3713 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3722 if (need_complete_non_reference)
3724 t = require_complete_type (t);
3725 if (t == error_mark_node)
3727 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3729 error ("%qE has reference type for %qs", t, name);
3733 if (need_implicitly_determined)
3735 const char *share_name = NULL;
3737 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3738 share_name = "threadprivate";
3739 else switch (cxx_omp_predetermined_sharing (t))
3741 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3743 case OMP_CLAUSE_DEFAULT_SHARED:
3744 share_name = "shared";
3746 case OMP_CLAUSE_DEFAULT_PRIVATE:
3747 share_name = "private";
3754 error ("%qE is predetermined %qs for %qs",
3755 t, share_name, name);
3760 /* We're interested in the base element, not arrays. */
3761 inner_type = type = TREE_TYPE (t);
3762 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3763 inner_type = TREE_TYPE (inner_type);
3765 /* Check for special function availability by building a call to one.
3766 Save the results, because later we won't be in the right context
3767 for making these queries. */
3768 if (CLASS_TYPE_P (inner_type)
3769 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3770 && !type_dependent_expression_p (t)
3771 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3772 need_copy_ctor, need_copy_assignment))
3776 *pc = OMP_CLAUSE_CHAIN (c);
3778 pc = &OMP_CLAUSE_CHAIN (c);
3781 bitmap_obstack_release (NULL);
3785 /* For all variables in the tree_list VARS, mark them as thread local. */
3788 finish_omp_threadprivate (tree vars)
3792 /* Mark every variable in VARS to be assigned thread local storage. */
3793 for (t = vars; t; t = TREE_CHAIN (t))
3795 tree v = TREE_PURPOSE (t);
3797 if (error_operand_p (v))
3799 else if (TREE_CODE (v) != VAR_DECL)
3800 error ("%<threadprivate%> %qD is not file, namespace "
3801 "or block scope variable", v);
3802 /* If V had already been marked threadprivate, it doesn't matter
3803 whether it had been used prior to this point. */
3804 else if (TREE_USED (v)
3805 && (DECL_LANG_SPECIFIC (v) == NULL
3806 || !CP_DECL_THREADPRIVATE_P (v)))
3807 error ("%qE declared %<threadprivate%> after first use", v);
3808 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3809 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3810 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3811 error ("%<threadprivate%> %qE has incomplete type", v);
3812 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3813 && CP_DECL_CONTEXT (v) != current_class_type)
3814 error ("%<threadprivate%> %qE directive not "
3815 "in %qT definition", v, CP_DECL_CONTEXT (v));
3818 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3819 if (DECL_LANG_SPECIFIC (v) == NULL)
3821 retrofit_lang_decl (v);
3823 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3824 after the allocation of the lang_decl structure. */
3825 if (DECL_DISCRIMINATOR_P (v))
3826 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3829 if (! DECL_THREAD_LOCAL_P (v))
3831 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3832 /* If rtl has been already set for this var, call
3833 make_decl_rtl once again, so that encode_section_info
3834 has a chance to look at the new decl flags. */
3835 if (DECL_RTL_SET_P (v))
3838 CP_DECL_THREADPRIVATE_P (v) = 1;
3843 /* Build an OpenMP structured block. */
3846 begin_omp_structured_block (void)
3848 return do_pushlevel (sk_omp);
3852 finish_omp_structured_block (tree block)
3854 return do_poplevel (block);
3857 /* Similarly, except force the retention of the BLOCK. */
3860 begin_omp_parallel (void)
3862 keep_next_level (true);
3863 return begin_omp_structured_block ();
3867 finish_omp_parallel (tree clauses, tree body)
3871 body = finish_omp_structured_block (body);
3873 stmt = make_node (OMP_PARALLEL);
3874 TREE_TYPE (stmt) = void_type_node;
3875 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3876 OMP_PARALLEL_BODY (stmt) = body;
3878 return add_stmt (stmt);
3882 begin_omp_task (void)
3884 keep_next_level (true);
3885 return begin_omp_structured_block ();
3889 finish_omp_task (tree clauses, tree body)
3893 body = finish_omp_structured_block (body);
3895 stmt = make_node (OMP_TASK);
3896 TREE_TYPE (stmt) = void_type_node;
3897 OMP_TASK_CLAUSES (stmt) = clauses;
3898 OMP_TASK_BODY (stmt) = body;
3900 return add_stmt (stmt);
3903 /* Helper function for finish_omp_for. Convert Ith random access iterator
3904 into integral iterator. Return FALSE if successful. */
3907 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3908 tree condv, tree incrv, tree *body,
3909 tree *pre_body, tree clauses)
3911 tree diff, iter_init, iter_incr = NULL, last;
3912 tree incr_var = NULL, orig_pre_body, orig_body, c;
3913 tree decl = TREE_VEC_ELT (declv, i);
3914 tree init = TREE_VEC_ELT (initv, i);
3915 tree cond = TREE_VEC_ELT (condv, i);
3916 tree incr = TREE_VEC_ELT (incrv, i);
3918 location_t elocus = locus;
3920 if (init && EXPR_HAS_LOCATION (init))
3921 elocus = EXPR_LOCATION (init);
3923 switch (TREE_CODE (cond))
3929 if (TREE_OPERAND (cond, 1) == iter)
3930 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
3931 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
3932 if (TREE_OPERAND (cond, 0) != iter)
3933 cond = error_mark_node;
3936 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3937 TREE_OPERAND (cond, 1), ERROR_MARK,
3938 NULL, tf_warning_or_error);
3939 if (error_operand_p (tem))
3944 cond = error_mark_node;
3947 if (cond == error_mark_node)
3949 error ("%Hinvalid controlling predicate", &elocus);
3952 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
3953 ERROR_MARK, iter, ERROR_MARK, NULL,
3954 tf_warning_or_error);
3955 if (error_operand_p (diff))
3957 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
3959 error ("%Hdifference between %qE and %qD does not have integer type",
3960 &elocus, TREE_OPERAND (cond, 1), iter);
3964 switch (TREE_CODE (incr))
3966 case PREINCREMENT_EXPR:
3967 case PREDECREMENT_EXPR:
3968 case POSTINCREMENT_EXPR:
3969 case POSTDECREMENT_EXPR:
3970 if (TREE_OPERAND (incr, 0) != iter)
3972 incr = error_mark_node;
3975 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
3976 tf_warning_or_error);
3977 if (error_operand_p (iter_incr))
3979 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
3980 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
3981 incr = integer_one_node;
3983 incr = integer_minus_one_node;
3986 if (TREE_OPERAND (incr, 0) != iter)
3987 incr = error_mark_node;
3988 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
3989 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
3991 tree rhs = TREE_OPERAND (incr, 1);
3992 if (TREE_OPERAND (rhs, 0) == iter)
3994 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
3996 incr = error_mark_node;
3999 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4000 TREE_OPERAND (rhs, 1),
4001 tf_warning_or_error);
4002 if (error_operand_p (iter_incr))
4004 incr = TREE_OPERAND (rhs, 1);
4005 incr = cp_convert (TREE_TYPE (diff), incr);
4006 if (TREE_CODE (rhs) == MINUS_EXPR)
4008 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4009 incr = fold_if_not_in_template (incr);
4011 if (TREE_CODE (incr) != INTEGER_CST
4012 && (TREE_CODE (incr) != NOP_EXPR
4013 || (TREE_CODE (TREE_OPERAND (incr, 0))
4018 else if (TREE_OPERAND (rhs, 1) == iter)
4020 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4021 || TREE_CODE (rhs) != PLUS_EXPR)
4022 incr = error_mark_node;
4025 iter_incr = build_x_binary_op (PLUS_EXPR,
4026 TREE_OPERAND (rhs, 0),
4029 tf_warning_or_error);
4030 if (error_operand_p (iter_incr))
4032 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4034 tf_warning_or_error);
4035 if (error_operand_p (iter_incr))
4037 incr = TREE_OPERAND (rhs, 0);
4042 incr = error_mark_node;
4045 incr = error_mark_node;
4048 incr = error_mark_node;
4052 if (incr == error_mark_node)
4054 error ("%Hinvalid increment expression", &elocus);
4058 incr = cp_convert (TREE_TYPE (diff), incr);
4059 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4060 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4061 && OMP_CLAUSE_DECL (c) == iter)
4064 decl = create_temporary_var (TREE_TYPE (diff));
4066 add_decl_expr (decl);
4067 last = create_temporary_var (TREE_TYPE (diff));
4069 add_decl_expr (last);
4070 if (c && iter_incr == NULL)
4072 incr_var = create_temporary_var (TREE_TYPE (diff));
4073 pushdecl (incr_var);
4074 add_decl_expr (incr_var);
4076 gcc_assert (stmts_are_full_exprs_p ());
4078 orig_pre_body = *pre_body;
4079 *pre_body = push_stmt_list ();
4081 add_stmt (orig_pre_body);
4083 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4084 tf_warning_or_error));
4085 init = build_int_cst (TREE_TYPE (diff), 0);
4086 if (c && iter_incr == NULL)
4088 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4089 incr, tf_warning_or_error));
4091 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4092 tf_warning_or_error);
4094 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4095 tf_warning_or_error));
4096 *pre_body = pop_stmt_list (*pre_body);
4098 cond = cp_build_binary_op (elocus,
4099 TREE_CODE (cond), decl, diff,
4100 tf_warning_or_error);
4101 incr = build_modify_expr (elocus, decl, PLUS_EXPR, incr);
4104 *body = push_stmt_list ();
4105 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4106 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4107 tf_warning_or_error);
4108 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4109 finish_expr_stmt (iter_init);
4110 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4111 tf_warning_or_error));
4112 add_stmt (orig_body);
4113 *body = pop_stmt_list (*body);
4117 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4118 finish_expr_stmt (iter_incr);
4119 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4120 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4123 TREE_VEC_ELT (declv, i) = decl;
4124 TREE_VEC_ELT (initv, i) = init;
4125 TREE_VEC_ELT (condv, i) = cond;
4126 TREE_VEC_ELT (incrv, i) = incr;
4131 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4132 are directly for their associated operands in the statement. DECL
4133 and INIT are a combo; if DECL is NULL then INIT ought to be a
4134 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4135 optional statements that need to go before the loop into its
4139 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4140 tree incrv, tree body, tree pre_body, tree clauses)
4142 tree omp_for = NULL, orig_incr = NULL;
4143 tree decl, init, cond, incr;
4147 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4148 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4149 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4150 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4152 decl = TREE_VEC_ELT (declv, i);
4153 init = TREE_VEC_ELT (initv, i);
4154 cond = TREE_VEC_ELT (condv, i);
4155 incr = TREE_VEC_ELT (incrv, i);
4161 switch (TREE_CODE (init))
4164 decl = TREE_OPERAND (init, 0);
4165 init = TREE_OPERAND (init, 1);
4168 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4170 decl = TREE_OPERAND (init, 0);
4171 init = TREE_OPERAND (init, 2);
4180 error ("%Hexpected iteration declaration or initialization",
4186 if (init && EXPR_HAS_LOCATION (init))
4187 elocus = EXPR_LOCATION (init);
4191 error ("%Hmissing controlling predicate", &elocus);
4197 error ("%Hmissing increment expression", &elocus);
4201 TREE_VEC_ELT (declv, i) = decl;
4202 TREE_VEC_ELT (initv, i) = init;
4205 if (dependent_omp_for_p (declv, initv, condv, incrv))
4209 stmt = make_node (OMP_FOR);
4211 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4213 /* This is really just a place-holder. We'll be decomposing this
4214 again and going through the cp_build_modify_expr path below when
4215 we instantiate the thing. */
4216 TREE_VEC_ELT (initv, i)
4217 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4218 TREE_VEC_ELT (initv, i));
4221 TREE_TYPE (stmt) = void_type_node;
4222 OMP_FOR_INIT (stmt) = initv;
4223 OMP_FOR_COND (stmt) = condv;
4224 OMP_FOR_INCR (stmt) = incrv;
4225 OMP_FOR_BODY (stmt) = body;
4226 OMP_FOR_PRE_BODY (stmt) = pre_body;
4227 OMP_FOR_CLAUSES (stmt) = clauses;
4229 SET_EXPR_LOCATION (stmt, locus);
4230 return add_stmt (stmt);
4233 if (processing_template_decl)
4234 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4236 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4238 decl = TREE_VEC_ELT (declv, i);
4239 init = TREE_VEC_ELT (initv, i);
4240 cond = TREE_VEC_ELT (condv, i);
4241 incr = TREE_VEC_ELT (incrv, i);
4243 TREE_VEC_ELT (orig_incr, i) = incr;
4246 if (init && EXPR_HAS_LOCATION (init))
4247 elocus = EXPR_LOCATION (init);
4251 error ("%Hexpected iteration declaration or initialization",
4256 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4259 TREE_VEC_ELT (orig_incr, i) = incr;
4260 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4261 TREE_CODE (TREE_OPERAND (incr, 1)),
4262 TREE_OPERAND (incr, 2),
4263 tf_warning_or_error);
4266 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4268 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4269 incrv, &body, &pre_body, clauses))
4274 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4275 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4277 error ("%Hinvalid type for iteration variable %qE", &elocus, decl);
4281 if (!processing_template_decl)
4283 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4284 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4287 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4289 && TREE_SIDE_EFFECTS (cond)
4290 && COMPARISON_CLASS_P (cond)
4291 && !processing_template_decl)
4293 tree t = TREE_OPERAND (cond, 0);
4294 if (TREE_SIDE_EFFECTS (t)
4296 && (TREE_CODE (t) != NOP_EXPR
4297 || TREE_OPERAND (t, 0) != decl))
4298 TREE_OPERAND (cond, 0)
4299 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4301 t = TREE_OPERAND (cond, 1);
4302 if (TREE_SIDE_EFFECTS (t)
4304 && (TREE_CODE (t) != NOP_EXPR
4305 || TREE_OPERAND (t, 0) != decl))
4306 TREE_OPERAND (cond, 1)
4307 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4309 if (decl == error_mark_node || init == error_mark_node)
4312 TREE_VEC_ELT (declv, i) = decl;
4313 TREE_VEC_ELT (initv, i) = init;
4314 TREE_VEC_ELT (condv, i) = cond;
4315 TREE_VEC_ELT (incrv, i) = incr;
4319 if (IS_EMPTY_STMT (pre_body))
4322 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4325 if (omp_for == NULL)
4328 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4330 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4331 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4333 if (TREE_CODE (incr) != MODIFY_EXPR)
4336 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4337 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4338 && !processing_template_decl)
4340 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4341 if (TREE_SIDE_EFFECTS (t)
4343 && (TREE_CODE (t) != NOP_EXPR
4344 || TREE_OPERAND (t, 0) != decl))
4345 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4346 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4348 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4349 if (TREE_SIDE_EFFECTS (t)
4351 && (TREE_CODE (t) != NOP_EXPR
4352 || TREE_OPERAND (t, 0) != decl))
4353 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4354 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4358 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4360 if (omp_for != NULL)
4361 OMP_FOR_CLAUSES (omp_for) = clauses;
4366 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4375 dependent_p = false;
4378 /* Even in a template, we can detect invalid uses of the atomic
4379 pragma if neither LHS nor RHS is type-dependent. */
4380 if (processing_template_decl)
4382 dependent_p = (type_dependent_expression_p (lhs)
4383 || type_dependent_expression_p (rhs));
4386 lhs = build_non_dependent_expr (lhs);
4387 rhs = build_non_dependent_expr (rhs);
4392 stmt = c_finish_omp_atomic (code, lhs, rhs);
4393 if (stmt == error_mark_node)
4396 if (processing_template_decl)
4397 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4398 build2 (code, void_type_node, orig_lhs, orig_rhs));
4403 finish_omp_barrier (void)
4405 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4406 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4407 finish_expr_stmt (stmt);
4411 finish_omp_flush (void)
4413 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4414 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4415 finish_expr_stmt (stmt);
4419 finish_omp_taskwait (void)
4421 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4422 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4423 finish_expr_stmt (stmt);
4427 init_cp_semantics (void)
4431 /* Build a STATIC_ASSERT for a static assertion with the condition
4432 CONDITION and the message text MESSAGE. LOCATION is the location
4433 of the static assertion in the source code. When MEMBER_P, this
4434 static assertion is a member of a class. */
4436 finish_static_assert (tree condition, tree message, location_t location,
4439 if (check_for_bare_parameter_packs (condition))
4440 condition = error_mark_node;
4442 if (type_dependent_expression_p (condition)
4443 || value_dependent_expression_p (condition))
4445 /* We're in a template; build a STATIC_ASSERT and put it in
4449 assertion = make_node (STATIC_ASSERT);
4450 STATIC_ASSERT_CONDITION (assertion) = condition;
4451 STATIC_ASSERT_MESSAGE (assertion) = message;
4452 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4455 maybe_add_class_template_decl_list (current_class_type,
4459 add_stmt (assertion);
4464 /* Fold the expression and convert it to a boolean value. */
4465 condition = fold_non_dependent_expr (condition);
4466 condition = cp_convert (boolean_type_node, condition);
4468 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4469 /* Do nothing; the condition is satisfied. */
4473 location_t saved_loc = input_location;
4475 input_location = location;
4476 if (TREE_CODE (condition) == INTEGER_CST
4477 && integer_zerop (condition))
4478 /* Report the error. */
4479 error ("static assertion failed: %E", message);
4480 else if (condition && condition != error_mark_node)
4481 error ("non-constant condition for static assertion");
4482 input_location = saved_loc;
4486 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4487 just return the type even though EXPR is a type-dependent expression.
4488 The ABI specifies which cases this applies to, which is a subset of the
4492 describable_type (tree expr)
4494 tree type = NULL_TREE;
4496 /* processing_template_decl isn't set when we're called from the mangling
4497 code, so bump it now. */
4498 ++processing_template_decl;
4499 if (! type_dependent_expression_p (expr)
4500 && ! type_unknown_p (expr))
4502 type = TREE_TYPE (expr);
4503 if (real_lvalue_p (expr))
4504 type = build_reference_type (type);
4506 --processing_template_decl;
4511 switch (TREE_CODE (expr))
4517 /* Named rvalue reference becomes lvalue. */
4518 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4523 case TEMPLATE_PARM_INDEX:
4525 case STATIC_CAST_EXPR:
4526 case REINTERPRET_CAST_EXPR:
4527 case CONST_CAST_EXPR:
4528 case DYNAMIC_CAST_EXPR:
4529 type = TREE_TYPE (expr);
4534 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4535 if (ptrtype && POINTER_TYPE_P (ptrtype))
4536 type = build_reference_type (TREE_TYPE (ptrtype));
4541 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4542 type = TREE_TYPE (expr);
4546 if (type && type_uses_auto (type))
4552 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4553 suitable for use as a type-specifier.
4555 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4556 id-expression or a class member access, FALSE when it was parsed as
4557 a full expression. */
4560 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4562 tree orig_expr = expr;
4563 tree type = NULL_TREE;
4565 if (!expr || error_operand_p (expr))
4566 return error_mark_node;
4569 || TREE_CODE (expr) == TYPE_DECL
4570 || (TREE_CODE (expr) == BIT_NOT_EXPR
4571 && TYPE_P (TREE_OPERAND (expr, 0))))
4573 error ("argument to decltype must be an expression");
4574 return error_mark_node;
4577 if (type_dependent_expression_p (expr))
4579 if (id_expression_or_member_access_p)
4581 switch (TREE_CODE (expr))
4588 case TEMPLATE_PARM_INDEX:
4589 type = TREE_TYPE (expr);
4597 if (type && !type_uses_auto (type))
4600 type = cxx_make_type (DECLTYPE_TYPE);
4601 DECLTYPE_TYPE_EXPR (type) = expr;
4602 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4603 = id_expression_or_member_access_p;
4604 SET_TYPE_STRUCTURAL_EQUALITY (type);
4609 /* The type denoted by decltype(e) is defined as follows: */
4611 if (id_expression_or_member_access_p)
4613 /* If e is an id-expression or a class member access (5.2.5
4614 [expr.ref]), decltype(e) is defined as the type of the entity
4615 named by e. If there is no such entity, or e names a set of
4616 overloaded functions, the program is ill-formed. */
4617 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4618 expr = lookup_name (expr);
4620 if (TREE_CODE (expr) == INDIRECT_REF)
4621 /* This can happen when the expression is, e.g., "a.b". Just
4622 look at the underlying operand. */
4623 expr = TREE_OPERAND (expr, 0);
4625 if (TREE_CODE (expr) == OFFSET_REF
4626 || TREE_CODE (expr) == MEMBER_REF)
4627 /* We're only interested in the field itself. If it is a
4628 BASELINK, we will need to see through it in the next
4630 expr = TREE_OPERAND (expr, 1);
4632 if (TREE_CODE (expr) == BASELINK)
4633 /* See through BASELINK nodes to the underlying functions. */
4634 expr = BASELINK_FUNCTIONS (expr);
4636 if (TREE_CODE (expr) == OVERLOAD)
4638 if (OVL_CHAIN (expr))
4640 error ("%qE refers to a set of overloaded functions", orig_expr);
4641 return error_mark_node;
4644 /* An overload set containing only one function: just look
4645 at that function. */
4646 expr = OVL_FUNCTION (expr);
4649 switch (TREE_CODE (expr))
4652 if (DECL_BIT_FIELD_TYPE (expr))
4654 type = DECL_BIT_FIELD_TYPE (expr);
4657 /* Fall through for fields that aren't bitfields. */
4664 case TEMPLATE_PARM_INDEX:
4665 type = TREE_TYPE (expr);
4669 type = error_mark_node;
4673 type = is_bitfield_expr_with_lowered_type (expr);
4675 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4682 /* We can get here when the id-expression refers to an
4684 type = TREE_TYPE (expr);
4688 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4689 || TREE_CODE (expr) == SCOPE_REF);
4690 error ("argument to decltype must be an expression");
4691 return error_mark_node;
4696 /* Expressions of reference type are sometimes wrapped in
4697 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4698 representation, not part of the language, so we have to look
4700 if (TREE_CODE (expr) == INDIRECT_REF
4701 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4703 expr = TREE_OPERAND (expr, 0);
4705 if (TREE_CODE (expr) == CALL_EXPR)
4707 /* If e is a function call (5.2.2 [expr.call]) or an
4708 invocation of an overloaded operator (parentheses around e
4709 are ignored), decltype(e) is defined as the return type of
4711 tree fndecl = get_callee_fndecl (expr);
4712 if (fndecl && fndecl != error_mark_node)
4713 type = TREE_TYPE (TREE_TYPE (fndecl));
4716 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4717 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4718 || TREE_CODE (target_type) == POINTER_TYPE)
4719 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4720 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4721 type = TREE_TYPE (TREE_TYPE (target_type));
4723 sorry ("unable to determine the declared type of expression %<%E%>",
4729 type = is_bitfield_expr_with_lowered_type (expr);
4732 /* Bitfields are special, because their type encodes the
4733 number of bits they store. If the expression referenced a
4734 bitfield, TYPE now has the declared type of that
4736 type = cp_build_qualified_type (type,
4737 cp_type_quals (TREE_TYPE (expr)));
4739 if (real_lvalue_p (expr))
4740 type = build_reference_type (type);
4744 /* Otherwise, where T is the type of e, if e is an lvalue,
4745 decltype(e) is defined as T&, otherwise decltype(e) is
4747 type = TREE_TYPE (expr);
4748 if (type == error_mark_node)
4749 return error_mark_node;
4750 else if (expr == current_class_ptr)
4751 /* If the expression is just "this", we want the
4752 cv-unqualified pointer for the "this" type. */
4753 type = TYPE_MAIN_VARIANT (type);
4754 else if (real_lvalue_p (expr))
4756 if (TREE_CODE (type) != REFERENCE_TYPE)
4757 type = build_reference_type (type);
4760 type = non_reference (type);
4765 if (!type || type == unknown_type_node)
4767 error ("type of %qE is unknown", expr);
4768 return error_mark_node;
4774 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4775 __has_nothrow_copy, depending on assign_p. */
4778 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4785 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4788 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4790 else if (TYPE_HAS_INIT_REF (type))
4792 /* If construction of the copy constructor was postponed, create
4794 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4795 lazily_declare_fn (sfk_copy_constructor, type);
4796 fns = CLASSTYPE_CONSTRUCTORS (type);
4801 for (; fns; fns = OVL_NEXT (fns))
4803 tree fn = OVL_CURRENT (fns);
4807 if (copy_fn_p (fn) == 0)
4810 else if (copy_fn_p (fn) <= 0)
4813 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4820 /* Actually evaluates the trait. */
4823 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4825 enum tree_code type_code1;
4828 type_code1 = TREE_CODE (type1);
4832 case CPTK_HAS_NOTHROW_ASSIGN:
4833 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4834 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4835 || (CLASS_TYPE_P (type1)
4836 && classtype_has_nothrow_assign_or_copy_p (type1,
4839 case CPTK_HAS_TRIVIAL_ASSIGN:
4840 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4841 && (pod_type_p (type1)
4842 || (CLASS_TYPE_P (type1)
4843 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4845 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4846 type1 = strip_array_types (type1);
4847 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4848 || (CLASS_TYPE_P (type1)
4849 && (t = locate_ctor (type1, NULL))
4850 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4852 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4853 type1 = strip_array_types (type1);
4854 return (pod_type_p (type1)
4855 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4857 case CPTK_HAS_NOTHROW_COPY:
4858 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4859 || (CLASS_TYPE_P (type1)
4860 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4862 case CPTK_HAS_TRIVIAL_COPY:
4863 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4864 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4866 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4867 type1 = strip_array_types (type1);
4868 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4869 || (CLASS_TYPE_P (type1)
4870 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4872 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4873 return (CLASS_TYPE_P (type1)
4874 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4876 case CPTK_IS_ABSTRACT:
4877 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4879 case CPTK_IS_BASE_OF:
4880 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4881 && DERIVED_FROM_P (type1, type2));
4884 return (NON_UNION_CLASS_TYPE_P (type1));
4886 case CPTK_IS_CONVERTIBLE_TO:
4891 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4894 return (type_code1 == ENUMERAL_TYPE);
4897 return (pod_type_p (type1));
4899 case CPTK_IS_POLYMORPHIC:
4900 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4903 return (type_code1 == UNION_TYPE);
4911 /* Returns true if TYPE is a complete type, an array of unknown bound,
4912 or (possibly cv-qualified) void, returns false otherwise. */
4915 check_trait_type (tree type)
4917 if (COMPLETE_TYPE_P (type))
4920 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
4923 if (VOID_TYPE_P (type))
4929 /* Process a trait expression. */
4932 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4934 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4935 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4936 || kind == CPTK_HAS_NOTHROW_COPY
4937 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4938 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4939 || kind == CPTK_HAS_TRIVIAL_COPY
4940 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4941 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4942 || kind == CPTK_IS_ABSTRACT
4943 || kind == CPTK_IS_BASE_OF
4944 || kind == CPTK_IS_CLASS
4945 || kind == CPTK_IS_CONVERTIBLE_TO
4946 || kind == CPTK_IS_EMPTY
4947 || kind == CPTK_IS_ENUM
4948 || kind == CPTK_IS_POD
4949 || kind == CPTK_IS_POLYMORPHIC
4950 || kind == CPTK_IS_UNION);
4952 if (kind == CPTK_IS_CONVERTIBLE_TO)
4954 sorry ("__is_convertible_to");
4955 return error_mark_node;
4958 if (type1 == error_mark_node
4959 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4960 && type2 == error_mark_node))
4961 return error_mark_node;
4963 if (processing_template_decl)
4965 tree trait_expr = make_node (TRAIT_EXPR);
4966 TREE_TYPE (trait_expr) = boolean_type_node;
4967 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4968 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4969 TRAIT_EXPR_KIND (trait_expr) = kind;
4973 complete_type (type1);
4975 complete_type (type2);
4979 case CPTK_HAS_NOTHROW_ASSIGN:
4980 case CPTK_HAS_TRIVIAL_ASSIGN:
4981 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4982 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4983 case CPTK_HAS_NOTHROW_COPY:
4984 case CPTK_HAS_TRIVIAL_COPY:
4985 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4986 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4987 case CPTK_IS_ABSTRACT:
4990 case CPTK_IS_POLYMORPHIC:
4991 if (!check_trait_type (type1))
4993 error ("incomplete type %qT not allowed", type1);
4994 return error_mark_node;
4998 case CPTK_IS_BASE_OF:
4999 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5000 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5001 && !COMPLETE_TYPE_P (type2))
5003 error ("incomplete type %qT not allowed", type2);
5004 return error_mark_node;
5013 case CPTK_IS_CONVERTIBLE_TO:
5018 return (trait_expr_value (kind, type1, type2)
5019 ? boolean_true_node : boolean_false_node);
5022 #include "gt-cp-semantics.h"