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;
1805 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1807 tmpl_args = TREE_OPERAND (fn, 1);
1808 fn = TREE_OPERAND (fn, 0);
1811 /* Find the name of the overloaded function. */
1812 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1814 else if (is_overloaded_fn (fn))
1817 identifier = DECL_NAME (get_first_fn (functions));
1819 else if (DECL_P (fn))
1822 identifier = DECL_NAME (fn);
1825 /* A call to a namespace-scope function using an unqualified name.
1827 Do Koenig lookup -- unless any of the arguments are
1829 if (!any_type_dependent_arguments_p (args)
1830 && !any_dependent_template_arguments_p (tmpl_args))
1832 fn = lookup_arg_dependent (identifier, functions, args);
1834 /* The unqualified name could not be resolved. */
1835 fn = unqualified_fn_lookup_error (identifier);
1838 if (fn && tmpl_args)
1839 fn = build_nt (TEMPLATE_ID_EXPR, fn, tmpl_args);
1844 /* Generate an expression for `FN (ARGS)'.
1846 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1847 as a virtual call, even if FN is virtual. (This flag is set when
1848 encountering an expression where the function name is explicitly
1849 qualified. For example a call to `X::f' never generates a virtual
1852 Returns code for the call. */
1855 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p,
1856 tsubst_flags_t complain)
1862 if (fn == error_mark_node || args == error_mark_node)
1863 return error_mark_node;
1865 /* ARGS should be a list of arguments. */
1866 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1867 gcc_assert (!TYPE_P (fn));
1872 if (processing_template_decl)
1874 if (type_dependent_expression_p (fn)
1875 || any_type_dependent_arguments_p (args))
1877 result = build_nt_call_list (fn, args);
1878 KOENIG_LOOKUP_P (result) = koenig_p;
1883 tree fndecl = OVL_CURRENT (fn);
1884 if (TREE_CODE (fndecl) != FUNCTION_DECL
1885 || !TREE_THIS_VOLATILE (fndecl))
1891 current_function_returns_abnormally = 1;
1895 if (!BASELINK_P (fn)
1896 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1897 && TREE_TYPE (fn) != unknown_type_node)
1898 fn = build_non_dependent_expr (fn);
1899 args = build_non_dependent_args (orig_args);
1902 if (is_overloaded_fn (fn))
1903 fn = baselink_for_fns (fn);
1906 if (BASELINK_P (fn))
1910 /* A call to a member function. From [over.call.func]:
1912 If the keyword this is in scope and refers to the class of
1913 that member function, or a derived class thereof, then the
1914 function call is transformed into a qualified function call
1915 using (*this) as the postfix-expression to the left of the
1916 . operator.... [Otherwise] a contrived object of type T
1917 becomes the implied object argument.
1919 This paragraph is unclear about this situation:
1921 struct A { void f(); };
1922 struct B : public A {};
1923 struct C : public A { void g() { B::f(); }};
1925 In particular, for `B::f', this paragraph does not make clear
1926 whether "the class of that member function" refers to `A' or
1927 to `B'. We believe it refers to `B'. */
1928 if (current_class_type
1929 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1931 && current_class_ref)
1932 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1936 tree representative_fn;
1938 representative_fn = BASELINK_FUNCTIONS (fn);
1939 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1940 representative_fn = TREE_OPERAND (representative_fn, 0);
1941 representative_fn = get_first_fn (representative_fn);
1942 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1945 if (processing_template_decl)
1947 if (type_dependent_expression_p (object))
1948 return build_nt_call_list (orig_fn, orig_args);
1949 object = build_non_dependent_expr (object);
1952 result = build_new_method_call (object, fn, args, NULL_TREE,
1954 ? LOOKUP_NONVIRTUAL : 0),
1958 else if (is_overloaded_fn (fn))
1960 /* If the function is an overloaded builtin, resolve it. */
1961 if (TREE_CODE (fn) == FUNCTION_DECL
1962 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1963 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1964 result = resolve_overloaded_builtin (fn, args);
1967 /* A call to a namespace-scope function. */
1968 result = build_new_function_call (fn, args, koenig_p, complain);
1970 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1973 error ("arguments to destructor are not allowed");
1974 /* Mark the pseudo-destructor call as having side-effects so
1975 that we do not issue warnings about its use. */
1976 result = build1 (NOP_EXPR,
1978 TREE_OPERAND (fn, 0));
1979 TREE_SIDE_EFFECTS (result) = 1;
1981 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1982 /* If the "function" is really an object of class type, it might
1983 have an overloaded `operator ()'. */
1984 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1985 /*overloaded_p=*/NULL, complain);
1988 /* A call where the function is unknown. */
1989 result = cp_build_function_call (fn, args, complain);
1991 if (processing_template_decl)
1993 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
1994 KOENIG_LOOKUP_P (result) = koenig_p;
1999 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2000 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2001 POSTDECREMENT_EXPR.) */
2004 finish_increment_expr (tree expr, enum tree_code code)
2006 return build_x_unary_op (code, expr, tf_warning_or_error);
2009 /* Finish a use of `this'. Returns an expression for `this'. */
2012 finish_this_expr (void)
2016 if (current_class_ptr)
2018 result = current_class_ptr;
2020 else if (current_function_decl
2021 && DECL_STATIC_FUNCTION_P (current_function_decl))
2023 error ("%<this%> is unavailable for static member functions");
2024 result = error_mark_node;
2028 if (current_function_decl)
2029 error ("invalid use of %<this%> in non-member function");
2031 error ("invalid use of %<this%> at top level");
2032 result = error_mark_node;
2038 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2039 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2040 the TYPE for the type given. If SCOPE is non-NULL, the expression
2041 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2044 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2046 if (object == error_mark_node || destructor == error_mark_node)
2047 return error_mark_node;
2049 gcc_assert (TYPE_P (destructor));
2051 if (!processing_template_decl)
2053 if (scope == error_mark_node)
2055 error ("invalid qualifying scope in pseudo-destructor name");
2056 return error_mark_node;
2058 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2060 error ("qualified type %qT does not match destructor name ~%qT",
2062 return error_mark_node;
2066 /* [expr.pseudo] says both:
2068 The type designated by the pseudo-destructor-name shall be
2069 the same as the object type.
2073 The cv-unqualified versions of the object type and of the
2074 type designated by the pseudo-destructor-name shall be the
2077 We implement the more generous second sentence, since that is
2078 what most other compilers do. */
2079 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2082 error ("%qE is not of type %qT", object, destructor);
2083 return error_mark_node;
2087 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2090 /* Finish an expression of the form CODE EXPR. */
2093 finish_unary_op_expr (enum tree_code code, tree expr)
2095 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2096 /* Inside a template, build_x_unary_op does not fold the
2097 expression. So check whether the result is folded before
2098 setting TREE_NEGATED_INT. */
2099 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2100 && TREE_CODE (result) == INTEGER_CST
2101 && !TYPE_UNSIGNED (TREE_TYPE (result))
2102 && INT_CST_LT (result, integer_zero_node))
2104 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2105 setting TREE_NEGATED_INT. */
2106 result = copy_node (result);
2107 TREE_NEGATED_INT (result) = 1;
2109 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2110 overflow_warning (result);
2115 /* Finish a compound-literal expression. TYPE is the type to which
2116 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2119 finish_compound_literal (tree type, tree compound_literal)
2121 if (type == error_mark_node)
2122 return error_mark_node;
2124 if (!TYPE_OBJ_P (type))
2126 error ("compound literal of non-object type %qT", type);
2127 return error_mark_node;
2130 if (processing_template_decl)
2132 TREE_TYPE (compound_literal) = type;
2133 /* Mark the expression as a compound literal. */
2134 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2135 return compound_literal;
2138 type = complete_type (type);
2140 if (TYPE_NON_AGGREGATE_CLASS (type))
2142 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2143 everywhere that deals with function arguments would be a pain, so
2144 just wrap it in a TREE_LIST. The parser set a flag so we know
2145 that it came from T{} rather than T({}). */
2146 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2147 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2148 return build_functional_cast (type, compound_literal, tf_error);
2151 if (TREE_CODE (type) == ARRAY_TYPE
2152 && check_array_initializer (NULL_TREE, type, compound_literal))
2153 return error_mark_node;
2154 compound_literal = reshape_init (type, compound_literal);
2155 if (TREE_CODE (type) == ARRAY_TYPE)
2156 cp_complete_array_type (&type, compound_literal, false);
2157 compound_literal = digest_init (type, compound_literal);
2158 if ((!at_function_scope_p () || cp_type_readonly (type))
2159 && initializer_constant_valid_p (compound_literal, type))
2161 tree decl = create_temporary_var (type);
2162 DECL_INITIAL (decl) = compound_literal;
2163 TREE_STATIC (decl) = 1;
2164 decl = pushdecl_top_level (decl);
2165 DECL_NAME (decl) = make_anon_name ();
2166 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2170 return get_target_expr (compound_literal);
2173 /* Return the declaration for the function-name variable indicated by
2177 finish_fname (tree id)
2181 decl = fname_decl (input_location, C_RID_CODE (id), id);
2182 if (processing_template_decl)
2183 decl = DECL_NAME (decl);
2187 /* Finish a translation unit. */
2190 finish_translation_unit (void)
2192 /* In case there were missing closebraces,
2193 get us back to the global binding level. */
2195 while (current_namespace != global_namespace)
2198 /* Do file scope __FUNCTION__ et al. */
2199 finish_fname_decls ();
2202 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2203 Returns the parameter. */
2206 finish_template_type_parm (tree aggr, tree identifier)
2208 if (aggr != class_type_node)
2210 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2211 aggr = class_type_node;
2214 return build_tree_list (aggr, identifier);
2217 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2218 Returns the parameter. */
2221 finish_template_template_parm (tree aggr, tree identifier)
2223 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2224 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2225 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2226 DECL_TEMPLATE_RESULT (tmpl) = decl;
2227 DECL_ARTIFICIAL (decl) = 1;
2228 end_template_decl ();
2230 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2232 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2233 /*is_primary=*/true, /*is_partial=*/false,
2236 return finish_template_type_parm (aggr, tmpl);
2239 /* ARGUMENT is the default-argument value for a template template
2240 parameter. If ARGUMENT is invalid, issue error messages and return
2241 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2244 check_template_template_default_arg (tree argument)
2246 if (TREE_CODE (argument) != TEMPLATE_DECL
2247 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2248 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2250 if (TREE_CODE (argument) == TYPE_DECL)
2251 error ("invalid use of type %qT as a default value for a template "
2252 "template-parameter", TREE_TYPE (argument));
2254 error ("invalid default argument for a template template parameter");
2255 return error_mark_node;
2261 /* Begin a class definition, as indicated by T. */
2264 begin_class_definition (tree t, tree attributes)
2266 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2267 return error_mark_node;
2269 if (processing_template_parmlist)
2271 error ("definition of %q#T inside template parameter list", t);
2272 return error_mark_node;
2274 /* A non-implicit typename comes from code like:
2276 template <typename T> struct A {
2277 template <typename U> struct A<T>::B ...
2279 This is erroneous. */
2280 else if (TREE_CODE (t) == TYPENAME_TYPE)
2282 error ("invalid definition of qualified type %qT", t);
2283 t = error_mark_node;
2286 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2288 t = make_class_type (RECORD_TYPE);
2289 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2292 /* Update the location of the decl. */
2293 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2295 if (TYPE_BEING_DEFINED (t))
2297 t = make_class_type (TREE_CODE (t));
2298 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2300 maybe_process_partial_specialization (t);
2302 TYPE_BEING_DEFINED (t) = 1;
2304 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2306 if (flag_pack_struct)
2309 TYPE_PACKED (t) = 1;
2310 /* Even though the type is being defined for the first time
2311 here, there might have been a forward declaration, so there
2312 might be cv-qualified variants of T. */
2313 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2314 TYPE_PACKED (v) = 1;
2316 /* Reset the interface data, at the earliest possible
2317 moment, as it might have been set via a class foo;
2319 if (! TYPE_ANONYMOUS_P (t))
2321 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2322 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2323 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2324 (t, finfo->interface_unknown);
2326 reset_specialization();
2328 /* Make a declaration for this class in its own scope. */
2329 build_self_reference ();
2334 /* Finish the member declaration given by DECL. */
2337 finish_member_declaration (tree decl)
2339 if (decl == error_mark_node || decl == NULL_TREE)
2342 if (decl == void_type_node)
2343 /* The COMPONENT was a friend, not a member, and so there's
2344 nothing for us to do. */
2347 /* We should see only one DECL at a time. */
2348 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2350 /* Set up access control for DECL. */
2352 = (current_access_specifier == access_private_node);
2353 TREE_PROTECTED (decl)
2354 = (current_access_specifier == access_protected_node);
2355 if (TREE_CODE (decl) == TEMPLATE_DECL)
2357 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2358 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2361 /* Mark the DECL as a member of the current class. */
2362 DECL_CONTEXT (decl) = current_class_type;
2364 /* Check for bare parameter packs in the member variable declaration. */
2365 if (TREE_CODE (decl) == FIELD_DECL)
2367 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2368 TREE_TYPE (decl) = error_mark_node;
2369 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2370 DECL_ATTRIBUTES (decl) = NULL_TREE;
2375 A C language linkage is ignored for the names of class members
2376 and the member function type of class member functions. */
2377 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2378 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2380 /* Put functions on the TYPE_METHODS list and everything else on the
2381 TYPE_FIELDS list. Note that these are built up in reverse order.
2382 We reverse them (to obtain declaration order) in finish_struct. */
2383 if (TREE_CODE (decl) == FUNCTION_DECL
2384 || DECL_FUNCTION_TEMPLATE_P (decl))
2386 /* We also need to add this function to the
2387 CLASSTYPE_METHOD_VEC. */
2388 if (add_method (current_class_type, decl, NULL_TREE))
2390 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2391 TYPE_METHODS (current_class_type) = decl;
2393 maybe_add_class_template_decl_list (current_class_type, decl,
2397 /* Enter the DECL into the scope of the class. */
2398 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2399 || pushdecl_class_level (decl))
2401 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2402 go at the beginning. The reason is that lookup_field_1
2403 searches the list in order, and we want a field name to
2404 override a type name so that the "struct stat hack" will
2405 work. In particular:
2407 struct S { enum E { }; int E } s;
2410 is valid. In addition, the FIELD_DECLs must be maintained in
2411 declaration order so that class layout works as expected.
2412 However, we don't need that order until class layout, so we
2413 save a little time by putting FIELD_DECLs on in reverse order
2414 here, and then reversing them in finish_struct_1. (We could
2415 also keep a pointer to the correct insertion points in the
2418 if (TREE_CODE (decl) == TYPE_DECL)
2419 TYPE_FIELDS (current_class_type)
2420 = chainon (TYPE_FIELDS (current_class_type), decl);
2423 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2424 TYPE_FIELDS (current_class_type) = decl;
2427 maybe_add_class_template_decl_list (current_class_type, decl,
2432 note_decl_for_pch (decl);
2435 /* DECL has been declared while we are building a PCH file. Perform
2436 actions that we might normally undertake lazily, but which can be
2437 performed now so that they do not have to be performed in
2438 translation units which include the PCH file. */
2441 note_decl_for_pch (tree decl)
2443 gcc_assert (pch_file);
2445 /* There's a good chance that we'll have to mangle names at some
2446 point, even if only for emission in debugging information. */
2447 if ((TREE_CODE (decl) == VAR_DECL
2448 || TREE_CODE (decl) == FUNCTION_DECL)
2449 && !processing_template_decl)
2453 /* Finish processing a complete template declaration. The PARMS are
2454 the template parameters. */
2457 finish_template_decl (tree parms)
2460 end_template_decl ();
2462 end_specialization ();
2465 /* Finish processing a template-id (which names a type) of the form
2466 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2467 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2468 the scope of template-id indicated. */
2471 finish_template_type (tree name, tree args, int entering_scope)
2475 decl = lookup_template_class (name, args,
2476 NULL_TREE, NULL_TREE, entering_scope,
2477 tf_warning_or_error | tf_user);
2478 if (decl != error_mark_node)
2479 decl = TYPE_STUB_DECL (decl);
2484 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2485 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2486 BASE_CLASS, or NULL_TREE if an error occurred. The
2487 ACCESS_SPECIFIER is one of
2488 access_{default,public,protected_private}_node. For a virtual base
2489 we set TREE_TYPE. */
2492 finish_base_specifier (tree base, tree access, bool virtual_p)
2496 if (base == error_mark_node)
2498 error ("invalid base-class specification");
2501 else if (! MAYBE_CLASS_TYPE_P (base))
2503 error ("%qT is not a class type", base);
2508 if (cp_type_quals (base) != 0)
2510 error ("base class %qT has cv qualifiers", base);
2511 base = TYPE_MAIN_VARIANT (base);
2513 result = build_tree_list (access, base);
2515 TREE_TYPE (result) = integer_type_node;
2521 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2522 what we found when we tried to do the lookup.
2523 LOCATION is the location of the NAME identifier;
2524 The location is used in the error message*/
2527 qualified_name_lookup_error (tree scope, tree name,
2528 tree decl, location_t location)
2530 if (scope == error_mark_node)
2531 ; /* We already complained. */
2532 else if (TYPE_P (scope))
2534 if (!COMPLETE_TYPE_P (scope))
2535 error ("%Hincomplete type %qT used in nested name specifier",
2537 else if (TREE_CODE (decl) == TREE_LIST)
2539 error ("%Hreference to %<%T::%D%> is ambiguous", &location, scope, name);
2540 print_candidates (decl);
2543 error ("%H%qD is not a member of %qT", &location, name, scope);
2545 else if (scope != global_namespace)
2546 error ("%H%qD is not a member of %qD", &location, name, scope);
2548 error ("%H%<::%D%> has not been declared", &location, name);
2551 /* If FNS is a member function, a set of member functions, or a
2552 template-id referring to one or more member functions, return a
2553 BASELINK for FNS, incorporating the current access context.
2554 Otherwise, return FNS unchanged. */
2557 baselink_for_fns (tree fns)
2562 if (BASELINK_P (fns)
2563 || error_operand_p (fns))
2567 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2568 fn = TREE_OPERAND (fn, 0);
2569 fn = get_first_fn (fn);
2570 if (!DECL_FUNCTION_MEMBER_P (fn))
2573 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2575 cl = DECL_CONTEXT (fn);
2576 cl = TYPE_BINFO (cl);
2577 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2580 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2581 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2582 if non-NULL, is the type or namespace used to explicitly qualify
2583 ID_EXPRESSION. DECL is the entity to which that name has been
2586 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2587 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2588 be set to true if this expression isn't permitted in a
2589 constant-expression, but it is otherwise not set by this function.
2590 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2591 constant-expression, but a non-constant expression is also
2594 DONE is true if this expression is a complete postfix-expression;
2595 it is false if this expression is followed by '->', '[', '(', etc.
2596 ADDRESS_P is true iff this expression is the operand of '&'.
2597 TEMPLATE_P is true iff the qualified-id was of the form
2598 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2599 appears as a template argument.
2601 If an error occurs, and it is the kind of error that might cause
2602 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2603 is the caller's responsibility to issue the message. *ERROR_MSG
2604 will be a string with static storage duration, so the caller need
2607 Return an expression for the entity, after issuing appropriate
2608 diagnostics. This function is also responsible for transforming a
2609 reference to a non-static member into a COMPONENT_REF that makes
2610 the use of "this" explicit.
2612 Upon return, *IDK will be filled in appropriately. */
2614 finish_id_expression (tree id_expression,
2618 bool integral_constant_expression_p,
2619 bool allow_non_integral_constant_expression_p,
2620 bool *non_integral_constant_expression_p,
2624 bool template_arg_p,
2625 const char **error_msg,
2626 location_t location)
2628 /* Initialize the output parameters. */
2629 *idk = CP_ID_KIND_NONE;
2632 if (id_expression == error_mark_node)
2633 return error_mark_node;
2634 /* If we have a template-id, then no further lookup is
2635 required. If the template-id was for a template-class, we
2636 will sometimes have a TYPE_DECL at this point. */
2637 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2638 || TREE_CODE (decl) == TYPE_DECL)
2640 /* Look up the name. */
2643 if (decl == error_mark_node)
2645 /* Name lookup failed. */
2648 || (!dependent_type_p (scope)
2649 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2650 && IDENTIFIER_TYPENAME_P (id_expression)
2651 && dependent_type_p (TREE_TYPE (id_expression))))))
2653 /* If the qualifying type is non-dependent (and the name
2654 does not name a conversion operator to a dependent
2655 type), issue an error. */
2656 qualified_name_lookup_error (scope, id_expression, decl, location);
2657 return error_mark_node;
2661 /* It may be resolved via Koenig lookup. */
2662 *idk = CP_ID_KIND_UNQUALIFIED;
2663 return id_expression;
2666 decl = id_expression;
2668 /* If DECL is a variable that would be out of scope under
2669 ANSI/ISO rules, but in scope in the ARM, name lookup
2670 will succeed. Issue a diagnostic here. */
2672 decl = check_for_out_of_scope_variable (decl);
2674 /* Remember that the name was used in the definition of
2675 the current class so that we can check later to see if
2676 the meaning would have been different after the class
2677 was entirely defined. */
2678 if (!scope && decl != error_mark_node)
2679 maybe_note_name_used_in_class (id_expression, decl);
2681 /* Disallow uses of local variables from containing functions. */
2682 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2684 tree context = decl_function_context (decl);
2685 if (context != NULL_TREE && context != current_function_decl
2686 && ! TREE_STATIC (decl))
2688 error (TREE_CODE (decl) == VAR_DECL
2689 ? "use of %<auto%> variable from containing function"
2690 : "use of parameter from containing function");
2691 error (" %q+#D declared here", decl);
2692 return error_mark_node;
2697 /* If we didn't find anything, or what we found was a type,
2698 then this wasn't really an id-expression. */
2699 if (TREE_CODE (decl) == TEMPLATE_DECL
2700 && !DECL_FUNCTION_TEMPLATE_P (decl))
2702 *error_msg = "missing template arguments";
2703 return error_mark_node;
2705 else if (TREE_CODE (decl) == TYPE_DECL
2706 || TREE_CODE (decl) == NAMESPACE_DECL)
2708 *error_msg = "expected primary-expression";
2709 return error_mark_node;
2712 /* If the name resolved to a template parameter, there is no
2713 need to look it up again later. */
2714 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2715 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2719 *idk = CP_ID_KIND_NONE;
2720 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2721 decl = TEMPLATE_PARM_DECL (decl);
2722 r = convert_from_reference (DECL_INITIAL (decl));
2724 if (integral_constant_expression_p
2725 && !dependent_type_p (TREE_TYPE (decl))
2726 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2728 if (!allow_non_integral_constant_expression_p)
2729 error ("template parameter %qD of type %qT is not allowed in "
2730 "an integral constant expression because it is not of "
2731 "integral or enumeration type", decl, TREE_TYPE (decl));
2732 *non_integral_constant_expression_p = true;
2736 /* Similarly, we resolve enumeration constants to their
2737 underlying values. */
2738 else if (TREE_CODE (decl) == CONST_DECL)
2740 *idk = CP_ID_KIND_NONE;
2741 if (!processing_template_decl)
2743 used_types_insert (TREE_TYPE (decl));
2744 return DECL_INITIAL (decl);
2752 /* If the declaration was explicitly qualified indicate
2753 that. The semantics of `A::f(3)' are different than
2754 `f(3)' if `f' is virtual. */
2756 ? CP_ID_KIND_QUALIFIED
2757 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2758 ? CP_ID_KIND_TEMPLATE_ID
2759 : CP_ID_KIND_UNQUALIFIED));
2764 An id-expression is type-dependent if it contains an
2765 identifier that was declared with a dependent type.
2767 The standard is not very specific about an id-expression that
2768 names a set of overloaded functions. What if some of them
2769 have dependent types and some of them do not? Presumably,
2770 such a name should be treated as a dependent name. */
2771 /* Assume the name is not dependent. */
2772 dependent_p = false;
2773 if (!processing_template_decl)
2774 /* No names are dependent outside a template. */
2776 /* A template-id where the name of the template was not resolved
2777 is definitely dependent. */
2778 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2779 && (TREE_CODE (TREE_OPERAND (decl, 0))
2780 == IDENTIFIER_NODE))
2782 /* For anything except an overloaded function, just check its
2784 else if (!is_overloaded_fn (decl))
2786 = dependent_type_p (TREE_TYPE (decl));
2787 /* For a set of overloaded functions, check each of the
2793 if (BASELINK_P (fns))
2794 fns = BASELINK_FUNCTIONS (fns);
2796 /* For a template-id, check to see if the template
2797 arguments are dependent. */
2798 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2800 tree args = TREE_OPERAND (fns, 1);
2801 dependent_p = any_dependent_template_arguments_p (args);
2802 /* The functions are those referred to by the
2804 fns = TREE_OPERAND (fns, 0);
2807 /* If there are no dependent template arguments, go through
2808 the overloaded functions. */
2809 while (fns && !dependent_p)
2811 tree fn = OVL_CURRENT (fns);
2813 /* Member functions of dependent classes are
2815 if (TREE_CODE (fn) == FUNCTION_DECL
2816 && type_dependent_expression_p (fn))
2818 else if (TREE_CODE (fn) == TEMPLATE_DECL
2819 && dependent_template_p (fn))
2822 fns = OVL_NEXT (fns);
2826 /* If the name was dependent on a template parameter, we will
2827 resolve the name at instantiation time. */
2830 /* Create a SCOPE_REF for qualified names, if the scope is
2834 /* Since this name was dependent, the expression isn't
2835 constant -- yet. No error is issued because it might
2836 be constant when things are instantiated. */
2837 if (integral_constant_expression_p)
2838 *non_integral_constant_expression_p = true;
2841 if (address_p && done)
2842 decl = finish_qualified_id_expr (scope, decl,
2846 else if (dependent_type_p (scope))
2847 decl = build_qualified_name (/*type=*/NULL_TREE,
2851 else if (DECL_P (decl))
2852 decl = build_qualified_name (TREE_TYPE (decl),
2857 if (TREE_TYPE (decl))
2858 decl = convert_from_reference (decl);
2861 /* A TEMPLATE_ID already contains all the information we
2863 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2864 return id_expression;
2865 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2866 /* If we found a variable, then name lookup during the
2867 instantiation will always resolve to the same VAR_DECL
2868 (or an instantiation thereof). */
2869 if (TREE_CODE (decl) == VAR_DECL
2870 || TREE_CODE (decl) == PARM_DECL)
2871 return convert_from_reference (decl);
2872 /* The same is true for FIELD_DECL, but we also need to
2873 make sure that the syntax is correct. */
2874 else if (TREE_CODE (decl) == FIELD_DECL)
2876 /* Since SCOPE is NULL here, this is an unqualified name.
2877 Access checking has been performed during name lookup
2878 already. Turn off checking to avoid duplicate errors. */
2879 push_deferring_access_checks (dk_no_check);
2880 decl = finish_non_static_data_member
2881 (decl, current_class_ref,
2882 /*qualifying_scope=*/NULL_TREE);
2883 pop_deferring_access_checks ();
2886 return id_expression;
2889 /* Only certain kinds of names are allowed in constant
2890 expression. Enumerators and template parameters have already
2891 been handled above. */
2892 if (integral_constant_expression_p
2893 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2894 && ! builtin_valid_in_constant_expr_p (decl))
2896 if (!allow_non_integral_constant_expression_p)
2898 error ("%qD cannot appear in a constant-expression", decl);
2899 return error_mark_node;
2901 *non_integral_constant_expression_p = true;
2904 if (TREE_CODE (decl) == NAMESPACE_DECL)
2906 error ("use of namespace %qD as expression", decl);
2907 return error_mark_node;
2909 else if (DECL_CLASS_TEMPLATE_P (decl))
2911 error ("use of class template %qT as expression", decl);
2912 return error_mark_node;
2914 else if (TREE_CODE (decl) == TREE_LIST)
2916 /* Ambiguous reference to base members. */
2917 error ("request for member %qD is ambiguous in "
2918 "multiple inheritance lattice", id_expression);
2919 print_candidates (decl);
2920 return error_mark_node;
2923 /* Mark variable-like entities as used. Functions are similarly
2924 marked either below or after overload resolution. */
2925 if (TREE_CODE (decl) == VAR_DECL
2926 || TREE_CODE (decl) == PARM_DECL
2927 || TREE_CODE (decl) == RESULT_DECL)
2932 decl = (adjust_result_of_qualified_name_lookup
2933 (decl, scope, current_class_type));
2935 if (TREE_CODE (decl) == FUNCTION_DECL)
2938 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2939 decl = finish_qualified_id_expr (scope,
2947 tree r = convert_from_reference (decl);
2949 if (processing_template_decl && TYPE_P (scope))
2950 r = build_qualified_name (TREE_TYPE (r),
2956 else if (TREE_CODE (decl) == FIELD_DECL)
2958 /* Since SCOPE is NULL here, this is an unqualified name.
2959 Access checking has been performed during name lookup
2960 already. Turn off checking to avoid duplicate errors. */
2961 push_deferring_access_checks (dk_no_check);
2962 decl = finish_non_static_data_member (decl, current_class_ref,
2963 /*qualifying_scope=*/NULL_TREE);
2964 pop_deferring_access_checks ();
2966 else if (is_overloaded_fn (decl))
2971 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2972 first_fn = TREE_OPERAND (first_fn, 0);
2973 first_fn = get_first_fn (first_fn);
2974 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2975 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2977 if (!really_overloaded_fn (decl))
2978 mark_used (first_fn);
2981 && TREE_CODE (first_fn) == FUNCTION_DECL
2982 && DECL_FUNCTION_MEMBER_P (first_fn)
2983 && !shared_member_p (decl))
2985 /* A set of member functions. */
2986 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2987 return finish_class_member_access_expr (decl, id_expression,
2988 /*template_p=*/false,
2989 tf_warning_or_error);
2992 decl = baselink_for_fns (decl);
2996 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2997 && DECL_CLASS_SCOPE_P (decl))
2999 tree context = context_for_name_lookup (decl);
3000 if (context != current_class_type)
3002 tree path = currently_open_derived_class (context);
3003 perform_or_defer_access_check (TYPE_BINFO (path),
3008 decl = convert_from_reference (decl);
3012 if (TREE_DEPRECATED (decl))
3013 warn_deprecated_use (decl);
3018 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3019 use as a type-specifier. */
3022 finish_typeof (tree expr)
3026 if (type_dependent_expression_p (expr))
3028 type = cxx_make_type (TYPEOF_TYPE);
3029 TYPEOF_TYPE_EXPR (type) = expr;
3030 SET_TYPE_STRUCTURAL_EQUALITY (type);
3035 type = unlowered_expr_type (expr);
3037 if (!type || type == unknown_type_node)
3039 error ("type of %qE is unknown", expr);
3040 return error_mark_node;
3046 /* Perform C++-specific checks for __builtin_offsetof before calling
3050 finish_offsetof (tree expr)
3052 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3054 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3055 TREE_OPERAND (expr, 2));
3056 return error_mark_node;
3058 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3059 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3060 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3062 if (TREE_CODE (expr) == COMPONENT_REF
3063 || TREE_CODE (expr) == COMPOUND_EXPR)
3064 expr = TREE_OPERAND (expr, 1);
3065 error ("cannot apply %<offsetof%> to member function %qD", expr);
3066 return error_mark_node;
3068 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3069 expr = TREE_OPERAND (expr, 0);
3070 return fold_offsetof (expr, NULL_TREE);
3073 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3074 function is broken out from the above for the benefit of the tree-ssa
3078 simplify_aggr_init_expr (tree *tp)
3080 tree aggr_init_expr = *tp;
3082 /* Form an appropriate CALL_EXPR. */
3083 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3084 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3085 tree type = TREE_TYPE (slot);
3088 enum style_t { ctor, arg, pcc } style;
3090 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3092 #ifdef PCC_STATIC_STRUCT_RETURN
3098 gcc_assert (TREE_ADDRESSABLE (type));
3102 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3104 aggr_init_expr_nargs (aggr_init_expr),
3105 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3109 /* Replace the first argument to the ctor with the address of the
3111 cxx_mark_addressable (slot);
3112 CALL_EXPR_ARG (call_expr, 0) =
3113 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3115 else if (style == arg)
3117 /* Just mark it addressable here, and leave the rest to
3118 expand_call{,_inline}. */
3119 cxx_mark_addressable (slot);
3120 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3121 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3123 else if (style == pcc)
3125 /* If we're using the non-reentrant PCC calling convention, then we
3126 need to copy the returned value out of the static buffer into the
3128 push_deferring_access_checks (dk_no_check);
3129 call_expr = build_aggr_init (slot, call_expr,
3130 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3131 tf_warning_or_error);
3132 pop_deferring_access_checks ();
3133 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3136 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3138 tree init = build_zero_init (type, NULL_TREE,
3139 /*static_storage_p=*/false);
3140 init = build2 (INIT_EXPR, void_type_node, slot, init);
3141 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3148 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3151 emit_associated_thunks (tree fn)
3153 /* When we use vcall offsets, we emit thunks with the virtual
3154 functions to which they thunk. The whole point of vcall offsets
3155 is so that you can know statically the entire set of thunks that
3156 will ever be needed for a given virtual function, thereby
3157 enabling you to output all the thunks with the function itself. */
3158 if (DECL_VIRTUAL_P (fn))
3162 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3164 if (!THUNK_ALIAS (thunk))
3166 use_thunk (thunk, /*emit_p=*/1);
3167 if (DECL_RESULT_THUNK_P (thunk))
3171 for (probe = DECL_THUNKS (thunk);
3172 probe; probe = TREE_CHAIN (probe))
3173 use_thunk (probe, /*emit_p=*/1);
3177 gcc_assert (!DECL_THUNKS (thunk));
3182 /* Generate RTL for FN. */
3185 expand_or_defer_fn (tree fn)
3187 /* When the parser calls us after finishing the body of a template
3188 function, we don't really want to expand the body. */
3189 if (processing_template_decl)
3191 /* Normally, collection only occurs in rest_of_compilation. So,
3192 if we don't collect here, we never collect junk generated
3193 during the processing of templates until we hit a
3194 non-template function. It's not safe to do this inside a
3195 nested class, though, as the parser may have local state that
3196 is not a GC root. */
3197 if (!function_depth)
3202 gcc_assert (gimple_body (fn));
3204 /* If this is a constructor or destructor body, we have to clone
3206 if (maybe_clone_body (fn))
3208 /* We don't want to process FN again, so pretend we've written
3209 it out, even though we haven't. */
3210 TREE_ASM_WRITTEN (fn) = 1;
3214 /* We make a decision about linkage for these functions at the end
3215 of the compilation. Until that point, we do not want the back
3216 end to output them -- but we do want it to see the bodies of
3217 these functions so that it can inline them as appropriate. */
3218 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3220 if (DECL_INTERFACE_KNOWN (fn))
3221 /* We've already made a decision as to how this function will
3225 DECL_EXTERNAL (fn) = 1;
3226 DECL_NOT_REALLY_EXTERN (fn) = 1;
3227 note_vague_linkage_fn (fn);
3228 /* A non-template inline function with external linkage will
3229 always be COMDAT. As we must eventually determine the
3230 linkage of all functions, and as that causes writes to
3231 the data mapped in from the PCH file, it's advantageous
3232 to mark the functions at this point. */
3233 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3235 /* This function must have external linkage, as
3236 otherwise DECL_INTERFACE_KNOWN would have been
3238 gcc_assert (TREE_PUBLIC (fn));
3239 comdat_linkage (fn);
3240 DECL_INTERFACE_KNOWN (fn) = 1;
3244 import_export_decl (fn);
3246 /* If the user wants us to keep all inline functions, then mark
3247 this function as needed so that finish_file will make sure to
3249 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3253 /* There's no reason to do any of the work here if we're only doing
3254 semantic analysis; this code just generates RTL. */
3255 if (flag_syntax_only)
3260 /* Expand or defer, at the whim of the compilation unit manager. */
3261 cgraph_finalize_function (fn, function_depth > 1);
3273 /* Helper function for walk_tree, used by finalize_nrv below. */
3276 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3278 struct nrv_data *dp = (struct nrv_data *)data;
3281 /* No need to walk into types. There wouldn't be any need to walk into
3282 non-statements, except that we have to consider STMT_EXPRs. */
3285 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3286 but differs from using NULL_TREE in that it indicates that we care
3287 about the value of the RESULT_DECL. */
3288 else if (TREE_CODE (*tp) == RETURN_EXPR)
3289 TREE_OPERAND (*tp, 0) = dp->result;
3290 /* Change all cleanups for the NRV to only run when an exception is
3292 else if (TREE_CODE (*tp) == CLEANUP_STMT
3293 && CLEANUP_DECL (*tp) == dp->var)
3294 CLEANUP_EH_ONLY (*tp) = 1;
3295 /* Replace the DECL_EXPR for the NRV with an initialization of the
3296 RESULT_DECL, if needed. */
3297 else if (TREE_CODE (*tp) == DECL_EXPR
3298 && DECL_EXPR_DECL (*tp) == dp->var)
3301 if (DECL_INITIAL (dp->var)
3302 && DECL_INITIAL (dp->var) != error_mark_node)
3303 init = build2 (INIT_EXPR, void_type_node, dp->result,
3304 DECL_INITIAL (dp->var));
3306 init = build_empty_stmt ();
3307 DECL_INITIAL (dp->var) = NULL_TREE;
3308 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3311 /* And replace all uses of the NRV with the RESULT_DECL. */
3312 else if (*tp == dp->var)
3315 /* Avoid walking into the same tree more than once. Unfortunately, we
3316 can't just use walk_tree_without duplicates because it would only call
3317 us for the first occurrence of dp->var in the function body. */
3318 slot = htab_find_slot (dp->visited, *tp, INSERT);
3324 /* Keep iterating. */
3328 /* Called from finish_function to implement the named return value
3329 optimization by overriding all the RETURN_EXPRs and pertinent
3330 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3331 RESULT_DECL for the function. */
3334 finalize_nrv (tree *tp, tree var, tree result)
3336 struct nrv_data data;
3338 /* Copy debugging information from VAR to RESULT. */
3339 DECL_NAME (result) = DECL_NAME (var);
3340 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3341 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3342 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3343 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3344 /* Don't forget that we take its address. */
3345 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3348 data.result = result;
3349 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3350 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3351 htab_delete (data.visited);
3354 /* Return the declaration for the function called by CALL_EXPR T,
3355 TYPE is the class type of the clause decl. */
3358 omp_clause_info_fndecl (tree t, tree type)
3360 tree ret = get_callee_fndecl (t);
3365 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3366 t = CALL_EXPR_FN (t);
3368 if (TREE_CODE (t) == OBJ_TYPE_REF)
3370 t = cp_fold_obj_type_ref (t, type);
3371 if (TREE_CODE (t) == ADDR_EXPR
3372 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3373 return TREE_OPERAND (t, 0);
3379 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3382 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3383 bool need_copy_ctor, bool need_copy_assignment)
3385 int save_errorcount = errorcount;
3388 /* Always allocate 3 elements for simplicity. These are the
3389 function decls for the ctor, dtor, and assignment op.
3390 This layout is known to the three lang hooks,
3391 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3392 and cxx_omp_clause_assign_op. */
3393 info = make_tree_vec (3);
3394 CP_OMP_CLAUSE_INFO (c) = info;
3396 if (need_default_ctor
3397 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3399 if (need_default_ctor)
3403 t = build_int_cst (build_pointer_type (type), 0);
3404 t = build1 (INDIRECT_REF, type, t);
3405 t = build_tree_list (NULL, t);
3407 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3408 t, type, LOOKUP_NORMAL,
3409 tf_warning_or_error);
3411 if (targetm.cxx.cdtor_returns_this () || errorcount)
3412 /* Because constructors and destructors return this,
3413 the call will have been cast to "void". Remove the
3414 cast here. We would like to use STRIP_NOPS, but it
3415 wouldn't work here because TYPE_MODE (t) and
3416 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3417 They are VOIDmode and Pmode, respectively. */
3418 if (TREE_CODE (t) == NOP_EXPR)
3419 t = TREE_OPERAND (t, 0);
3421 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3424 if ((need_default_ctor || need_copy_ctor)
3425 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3427 t = build_int_cst (build_pointer_type (type), 0);
3428 t = build1 (INDIRECT_REF, type, t);
3429 t = build_special_member_call (t, complete_dtor_identifier,
3430 NULL, type, LOOKUP_NORMAL,
3431 tf_warning_or_error);
3433 if (targetm.cxx.cdtor_returns_this () || errorcount)
3434 /* Because constructors and destructors return this,
3435 the call will have been cast to "void". Remove the
3436 cast here. We would like to use STRIP_NOPS, but it
3437 wouldn't work here because TYPE_MODE (t) and
3438 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3439 They are VOIDmode and Pmode, respectively. */
3440 if (TREE_CODE (t) == NOP_EXPR)
3441 t = TREE_OPERAND (t, 0);
3443 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3446 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3448 t = build_int_cst (build_pointer_type (type), 0);
3449 t = build1 (INDIRECT_REF, type, t);
3450 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3451 build_tree_list (NULL, t),
3452 type, LOOKUP_NORMAL,
3453 tf_warning_or_error);
3455 /* We'll have called convert_from_reference on the call, which
3456 may well have added an indirect_ref. It's unneeded here,
3457 and in the way, so kill it. */
3458 if (TREE_CODE (t) == INDIRECT_REF)
3459 t = TREE_OPERAND (t, 0);
3461 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3464 return errorcount != save_errorcount;
3467 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3468 Remove any elements from the list that are invalid. */
3471 finish_omp_clauses (tree clauses)
3473 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3474 tree c, t, *pc = &clauses;
3477 bitmap_obstack_initialize (NULL);
3478 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3479 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3480 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3482 for (pc = &clauses, c = clauses; c ; c = *pc)
3484 bool remove = false;
3486 switch (OMP_CLAUSE_CODE (c))
3488 case OMP_CLAUSE_SHARED:
3490 goto check_dup_generic;
3491 case OMP_CLAUSE_PRIVATE:
3493 goto check_dup_generic;
3494 case OMP_CLAUSE_REDUCTION:
3496 goto check_dup_generic;
3497 case OMP_CLAUSE_COPYPRIVATE:
3498 name = "copyprivate";
3499 goto check_dup_generic;
3500 case OMP_CLAUSE_COPYIN:
3502 goto check_dup_generic;
3504 t = OMP_CLAUSE_DECL (c);
3505 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3507 if (processing_template_decl)
3510 error ("%qD is not a variable in clause %qs", t, name);
3512 error ("%qE is not a variable in clause %qs", t, name);
3515 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3516 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3517 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3519 error ("%qD appears more than once in data clauses", t);
3523 bitmap_set_bit (&generic_head, DECL_UID (t));
3526 case OMP_CLAUSE_FIRSTPRIVATE:
3527 t = OMP_CLAUSE_DECL (c);
3528 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3530 if (processing_template_decl)
3533 error ("%qD is not a variable in clause %<firstprivate%>", t);
3535 error ("%qE is not a variable in clause %<firstprivate%>", t);
3538 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3539 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3541 error ("%qD appears more than once in data clauses", t);
3545 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3548 case OMP_CLAUSE_LASTPRIVATE:
3549 t = OMP_CLAUSE_DECL (c);
3550 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3552 if (processing_template_decl)
3555 error ("%qD is not a variable in clause %<lastprivate%>", t);
3557 error ("%qE is not a variable in clause %<lastprivate%>", t);
3560 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3561 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3563 error ("%qD appears more than once in data clauses", t);
3567 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3571 t = OMP_CLAUSE_IF_EXPR (c);
3572 t = maybe_convert_cond (t);
3573 if (t == error_mark_node)
3575 OMP_CLAUSE_IF_EXPR (c) = t;
3578 case OMP_CLAUSE_NUM_THREADS:
3579 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3580 if (t == error_mark_node)
3582 else if (!type_dependent_expression_p (t)
3583 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3585 error ("num_threads expression must be integral");
3590 case OMP_CLAUSE_SCHEDULE:
3591 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3594 else if (t == error_mark_node)
3596 else if (!type_dependent_expression_p (t)
3597 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3599 error ("schedule chunk size expression must be integral");
3604 case OMP_CLAUSE_NOWAIT:
3605 case OMP_CLAUSE_ORDERED:
3606 case OMP_CLAUSE_DEFAULT:
3607 case OMP_CLAUSE_UNTIED:
3608 case OMP_CLAUSE_COLLAPSE:
3616 *pc = OMP_CLAUSE_CHAIN (c);
3618 pc = &OMP_CLAUSE_CHAIN (c);
3621 for (pc = &clauses, c = clauses; c ; c = *pc)
3623 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3624 bool remove = false;
3625 bool need_complete_non_reference = false;
3626 bool need_default_ctor = false;
3627 bool need_copy_ctor = false;
3628 bool need_copy_assignment = false;
3629 bool need_implicitly_determined = false;
3630 tree type, inner_type;
3634 case OMP_CLAUSE_SHARED:
3636 need_implicitly_determined = true;
3638 case OMP_CLAUSE_PRIVATE:
3640 need_complete_non_reference = true;
3641 need_default_ctor = true;
3642 need_implicitly_determined = true;
3644 case OMP_CLAUSE_FIRSTPRIVATE:
3645 name = "firstprivate";
3646 need_complete_non_reference = true;
3647 need_copy_ctor = true;
3648 need_implicitly_determined = true;
3650 case OMP_CLAUSE_LASTPRIVATE:
3651 name = "lastprivate";
3652 need_complete_non_reference = true;
3653 need_copy_assignment = true;
3654 need_implicitly_determined = true;
3656 case OMP_CLAUSE_REDUCTION:
3658 need_implicitly_determined = true;
3660 case OMP_CLAUSE_COPYPRIVATE:
3661 name = "copyprivate";
3662 need_copy_assignment = true;
3664 case OMP_CLAUSE_COPYIN:
3666 need_copy_assignment = true;
3669 pc = &OMP_CLAUSE_CHAIN (c);
3673 t = OMP_CLAUSE_DECL (c);
3674 if (processing_template_decl
3675 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3677 pc = &OMP_CLAUSE_CHAIN (c);
3683 case OMP_CLAUSE_LASTPRIVATE:
3684 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3685 need_default_ctor = true;
3688 case OMP_CLAUSE_REDUCTION:
3689 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3690 || POINTER_TYPE_P (TREE_TYPE (t)))
3692 error ("%qE has invalid type for %<reduction%>", t);
3695 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3697 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3705 error ("%qE has invalid type for %<reduction(%s)%>",
3706 t, operator_name_info[r_code].name);
3712 case OMP_CLAUSE_COPYIN:
3713 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3715 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3724 if (need_complete_non_reference)
3726 t = require_complete_type (t);
3727 if (t == error_mark_node)
3729 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3731 error ("%qE has reference type for %qs", t, name);
3735 if (need_implicitly_determined)
3737 const char *share_name = NULL;
3739 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3740 share_name = "threadprivate";
3741 else switch (cxx_omp_predetermined_sharing (t))
3743 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3745 case OMP_CLAUSE_DEFAULT_SHARED:
3746 share_name = "shared";
3748 case OMP_CLAUSE_DEFAULT_PRIVATE:
3749 share_name = "private";
3756 error ("%qE is predetermined %qs for %qs",
3757 t, share_name, name);
3762 /* We're interested in the base element, not arrays. */
3763 inner_type = type = TREE_TYPE (t);
3764 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3765 inner_type = TREE_TYPE (inner_type);
3767 /* Check for special function availability by building a call to one.
3768 Save the results, because later we won't be in the right context
3769 for making these queries. */
3770 if (CLASS_TYPE_P (inner_type)
3771 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3772 && !type_dependent_expression_p (t)
3773 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3774 need_copy_ctor, need_copy_assignment))
3778 *pc = OMP_CLAUSE_CHAIN (c);
3780 pc = &OMP_CLAUSE_CHAIN (c);
3783 bitmap_obstack_release (NULL);
3787 /* For all variables in the tree_list VARS, mark them as thread local. */
3790 finish_omp_threadprivate (tree vars)
3794 /* Mark every variable in VARS to be assigned thread local storage. */
3795 for (t = vars; t; t = TREE_CHAIN (t))
3797 tree v = TREE_PURPOSE (t);
3799 if (error_operand_p (v))
3801 else if (TREE_CODE (v) != VAR_DECL)
3802 error ("%<threadprivate%> %qD is not file, namespace "
3803 "or block scope variable", v);
3804 /* If V had already been marked threadprivate, it doesn't matter
3805 whether it had been used prior to this point. */
3806 else if (TREE_USED (v)
3807 && (DECL_LANG_SPECIFIC (v) == NULL
3808 || !CP_DECL_THREADPRIVATE_P (v)))
3809 error ("%qE declared %<threadprivate%> after first use", v);
3810 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3811 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3812 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3813 error ("%<threadprivate%> %qE has incomplete type", v);
3814 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3815 && CP_DECL_CONTEXT (v) != current_class_type)
3816 error ("%<threadprivate%> %qE directive not "
3817 "in %qT definition", v, CP_DECL_CONTEXT (v));
3820 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3821 if (DECL_LANG_SPECIFIC (v) == NULL)
3823 retrofit_lang_decl (v);
3825 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3826 after the allocation of the lang_decl structure. */
3827 if (DECL_DISCRIMINATOR_P (v))
3828 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3831 if (! DECL_THREAD_LOCAL_P (v))
3833 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3834 /* If rtl has been already set for this var, call
3835 make_decl_rtl once again, so that encode_section_info
3836 has a chance to look at the new decl flags. */
3837 if (DECL_RTL_SET_P (v))
3840 CP_DECL_THREADPRIVATE_P (v) = 1;
3845 /* Build an OpenMP structured block. */
3848 begin_omp_structured_block (void)
3850 return do_pushlevel (sk_omp);
3854 finish_omp_structured_block (tree block)
3856 return do_poplevel (block);
3859 /* Similarly, except force the retention of the BLOCK. */
3862 begin_omp_parallel (void)
3864 keep_next_level (true);
3865 return begin_omp_structured_block ();
3869 finish_omp_parallel (tree clauses, tree body)
3873 body = finish_omp_structured_block (body);
3875 stmt = make_node (OMP_PARALLEL);
3876 TREE_TYPE (stmt) = void_type_node;
3877 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3878 OMP_PARALLEL_BODY (stmt) = body;
3880 return add_stmt (stmt);
3884 begin_omp_task (void)
3886 keep_next_level (true);
3887 return begin_omp_structured_block ();
3891 finish_omp_task (tree clauses, tree body)
3895 body = finish_omp_structured_block (body);
3897 stmt = make_node (OMP_TASK);
3898 TREE_TYPE (stmt) = void_type_node;
3899 OMP_TASK_CLAUSES (stmt) = clauses;
3900 OMP_TASK_BODY (stmt) = body;
3902 return add_stmt (stmt);
3905 /* Helper function for finish_omp_for. Convert Ith random access iterator
3906 into integral iterator. Return FALSE if successful. */
3909 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3910 tree condv, tree incrv, tree *body,
3911 tree *pre_body, tree clauses)
3913 tree diff, iter_init, iter_incr = NULL, last;
3914 tree incr_var = NULL, orig_pre_body, orig_body, c;
3915 tree decl = TREE_VEC_ELT (declv, i);
3916 tree init = TREE_VEC_ELT (initv, i);
3917 tree cond = TREE_VEC_ELT (condv, i);
3918 tree incr = TREE_VEC_ELT (incrv, i);
3920 location_t elocus = locus;
3922 if (init && EXPR_HAS_LOCATION (init))
3923 elocus = EXPR_LOCATION (init);
3925 switch (TREE_CODE (cond))
3931 if (TREE_OPERAND (cond, 1) == iter)
3932 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
3933 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
3934 if (TREE_OPERAND (cond, 0) != iter)
3935 cond = error_mark_node;
3938 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3939 TREE_OPERAND (cond, 1), ERROR_MARK,
3940 NULL, tf_warning_or_error);
3941 if (error_operand_p (tem))
3946 cond = error_mark_node;
3949 if (cond == error_mark_node)
3951 error ("%Hinvalid controlling predicate", &elocus);
3954 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
3955 ERROR_MARK, iter, ERROR_MARK, NULL,
3956 tf_warning_or_error);
3957 if (error_operand_p (diff))
3959 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
3961 error ("%Hdifference between %qE and %qD does not have integer type",
3962 &elocus, TREE_OPERAND (cond, 1), iter);
3966 switch (TREE_CODE (incr))
3968 case PREINCREMENT_EXPR:
3969 case PREDECREMENT_EXPR:
3970 case POSTINCREMENT_EXPR:
3971 case POSTDECREMENT_EXPR:
3972 if (TREE_OPERAND (incr, 0) != iter)
3974 incr = error_mark_node;
3977 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
3978 tf_warning_or_error);
3979 if (error_operand_p (iter_incr))
3981 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
3982 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
3983 incr = integer_one_node;
3985 incr = integer_minus_one_node;
3988 if (TREE_OPERAND (incr, 0) != iter)
3989 incr = error_mark_node;
3990 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
3991 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
3993 tree rhs = TREE_OPERAND (incr, 1);
3994 if (TREE_OPERAND (rhs, 0) == iter)
3996 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
3998 incr = error_mark_node;
4001 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4002 TREE_OPERAND (rhs, 1),
4003 tf_warning_or_error);
4004 if (error_operand_p (iter_incr))
4006 incr = TREE_OPERAND (rhs, 1);
4007 incr = cp_convert (TREE_TYPE (diff), incr);
4008 if (TREE_CODE (rhs) == MINUS_EXPR)
4010 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4011 incr = fold_if_not_in_template (incr);
4013 if (TREE_CODE (incr) != INTEGER_CST
4014 && (TREE_CODE (incr) != NOP_EXPR
4015 || (TREE_CODE (TREE_OPERAND (incr, 0))
4020 else if (TREE_OPERAND (rhs, 1) == iter)
4022 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4023 || TREE_CODE (rhs) != PLUS_EXPR)
4024 incr = error_mark_node;
4027 iter_incr = build_x_binary_op (PLUS_EXPR,
4028 TREE_OPERAND (rhs, 0),
4031 tf_warning_or_error);
4032 if (error_operand_p (iter_incr))
4034 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4036 tf_warning_or_error);
4037 if (error_operand_p (iter_incr))
4039 incr = TREE_OPERAND (rhs, 0);
4044 incr = error_mark_node;
4047 incr = error_mark_node;
4050 incr = error_mark_node;
4054 if (incr == error_mark_node)
4056 error ("%Hinvalid increment expression", &elocus);
4060 incr = cp_convert (TREE_TYPE (diff), incr);
4061 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4062 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4063 && OMP_CLAUSE_DECL (c) == iter)
4066 decl = create_temporary_var (TREE_TYPE (diff));
4068 add_decl_expr (decl);
4069 last = create_temporary_var (TREE_TYPE (diff));
4071 add_decl_expr (last);
4072 if (c && iter_incr == NULL)
4074 incr_var = create_temporary_var (TREE_TYPE (diff));
4075 pushdecl (incr_var);
4076 add_decl_expr (incr_var);
4078 gcc_assert (stmts_are_full_exprs_p ());
4080 orig_pre_body = *pre_body;
4081 *pre_body = push_stmt_list ();
4083 add_stmt (orig_pre_body);
4085 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4086 tf_warning_or_error));
4087 init = build_int_cst (TREE_TYPE (diff), 0);
4088 if (c && iter_incr == NULL)
4090 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4091 incr, tf_warning_or_error));
4093 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4094 tf_warning_or_error);
4096 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4097 tf_warning_or_error));
4098 *pre_body = pop_stmt_list (*pre_body);
4100 cond = cp_build_binary_op (elocus,
4101 TREE_CODE (cond), decl, diff,
4102 tf_warning_or_error);
4103 incr = build_modify_expr (elocus, decl, PLUS_EXPR, incr);
4106 *body = push_stmt_list ();
4107 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4108 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4109 tf_warning_or_error);
4110 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4111 finish_expr_stmt (iter_init);
4112 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4113 tf_warning_or_error));
4114 add_stmt (orig_body);
4115 *body = pop_stmt_list (*body);
4119 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4120 finish_expr_stmt (iter_incr);
4121 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4122 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4125 TREE_VEC_ELT (declv, i) = decl;
4126 TREE_VEC_ELT (initv, i) = init;
4127 TREE_VEC_ELT (condv, i) = cond;
4128 TREE_VEC_ELT (incrv, i) = incr;
4133 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4134 are directly for their associated operands in the statement. DECL
4135 and INIT are a combo; if DECL is NULL then INIT ought to be a
4136 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4137 optional statements that need to go before the loop into its
4141 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4142 tree incrv, tree body, tree pre_body, tree clauses)
4144 tree omp_for = NULL, orig_incr = NULL;
4145 tree decl, init, cond, incr;
4149 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4150 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4151 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4152 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4154 decl = TREE_VEC_ELT (declv, i);
4155 init = TREE_VEC_ELT (initv, i);
4156 cond = TREE_VEC_ELT (condv, i);
4157 incr = TREE_VEC_ELT (incrv, i);
4163 switch (TREE_CODE (init))
4166 decl = TREE_OPERAND (init, 0);
4167 init = TREE_OPERAND (init, 1);
4170 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4172 decl = TREE_OPERAND (init, 0);
4173 init = TREE_OPERAND (init, 2);
4182 error ("%Hexpected iteration declaration or initialization",
4188 if (init && EXPR_HAS_LOCATION (init))
4189 elocus = EXPR_LOCATION (init);
4193 error ("%Hmissing controlling predicate", &elocus);
4199 error ("%Hmissing increment expression", &elocus);
4203 TREE_VEC_ELT (declv, i) = decl;
4204 TREE_VEC_ELT (initv, i) = init;
4207 if (dependent_omp_for_p (declv, initv, condv, incrv))
4211 stmt = make_node (OMP_FOR);
4213 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4215 /* This is really just a place-holder. We'll be decomposing this
4216 again and going through the cp_build_modify_expr path below when
4217 we instantiate the thing. */
4218 TREE_VEC_ELT (initv, i)
4219 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4220 TREE_VEC_ELT (initv, i));
4223 TREE_TYPE (stmt) = void_type_node;
4224 OMP_FOR_INIT (stmt) = initv;
4225 OMP_FOR_COND (stmt) = condv;
4226 OMP_FOR_INCR (stmt) = incrv;
4227 OMP_FOR_BODY (stmt) = body;
4228 OMP_FOR_PRE_BODY (stmt) = pre_body;
4229 OMP_FOR_CLAUSES (stmt) = clauses;
4231 SET_EXPR_LOCATION (stmt, locus);
4232 return add_stmt (stmt);
4235 if (processing_template_decl)
4236 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4238 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4240 decl = TREE_VEC_ELT (declv, i);
4241 init = TREE_VEC_ELT (initv, i);
4242 cond = TREE_VEC_ELT (condv, i);
4243 incr = TREE_VEC_ELT (incrv, i);
4245 TREE_VEC_ELT (orig_incr, i) = incr;
4248 if (init && EXPR_HAS_LOCATION (init))
4249 elocus = EXPR_LOCATION (init);
4253 error ("%Hexpected iteration declaration or initialization",
4258 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4261 TREE_VEC_ELT (orig_incr, i) = incr;
4262 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4263 TREE_CODE (TREE_OPERAND (incr, 1)),
4264 TREE_OPERAND (incr, 2),
4265 tf_warning_or_error);
4268 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4270 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4271 incrv, &body, &pre_body, clauses))
4276 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4277 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4279 error ("%Hinvalid type for iteration variable %qE", &elocus, decl);
4283 if (!processing_template_decl)
4285 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4286 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4289 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4291 && TREE_SIDE_EFFECTS (cond)
4292 && COMPARISON_CLASS_P (cond)
4293 && !processing_template_decl)
4295 tree t = TREE_OPERAND (cond, 0);
4296 if (TREE_SIDE_EFFECTS (t)
4298 && (TREE_CODE (t) != NOP_EXPR
4299 || TREE_OPERAND (t, 0) != decl))
4300 TREE_OPERAND (cond, 0)
4301 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4303 t = TREE_OPERAND (cond, 1);
4304 if (TREE_SIDE_EFFECTS (t)
4306 && (TREE_CODE (t) != NOP_EXPR
4307 || TREE_OPERAND (t, 0) != decl))
4308 TREE_OPERAND (cond, 1)
4309 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4311 if (decl == error_mark_node || init == error_mark_node)
4314 TREE_VEC_ELT (declv, i) = decl;
4315 TREE_VEC_ELT (initv, i) = init;
4316 TREE_VEC_ELT (condv, i) = cond;
4317 TREE_VEC_ELT (incrv, i) = incr;
4321 if (IS_EMPTY_STMT (pre_body))
4324 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4327 if (omp_for == NULL)
4330 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4332 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4333 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4335 if (TREE_CODE (incr) != MODIFY_EXPR)
4338 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4339 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4340 && !processing_template_decl)
4342 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4343 if (TREE_SIDE_EFFECTS (t)
4345 && (TREE_CODE (t) != NOP_EXPR
4346 || TREE_OPERAND (t, 0) != decl))
4347 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4348 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4350 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4351 if (TREE_SIDE_EFFECTS (t)
4353 && (TREE_CODE (t) != NOP_EXPR
4354 || TREE_OPERAND (t, 0) != decl))
4355 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4356 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4360 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4362 if (omp_for != NULL)
4363 OMP_FOR_CLAUSES (omp_for) = clauses;
4368 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4377 dependent_p = false;
4380 /* Even in a template, we can detect invalid uses of the atomic
4381 pragma if neither LHS nor RHS is type-dependent. */
4382 if (processing_template_decl)
4384 dependent_p = (type_dependent_expression_p (lhs)
4385 || type_dependent_expression_p (rhs));
4388 lhs = build_non_dependent_expr (lhs);
4389 rhs = build_non_dependent_expr (rhs);
4394 stmt = c_finish_omp_atomic (code, lhs, rhs);
4395 if (stmt == error_mark_node)
4398 if (processing_template_decl)
4399 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4400 build2 (code, void_type_node, orig_lhs, orig_rhs));
4405 finish_omp_barrier (void)
4407 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4408 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4409 finish_expr_stmt (stmt);
4413 finish_omp_flush (void)
4415 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4416 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4417 finish_expr_stmt (stmt);
4421 finish_omp_taskwait (void)
4423 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4424 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4425 finish_expr_stmt (stmt);
4429 init_cp_semantics (void)
4433 /* Build a STATIC_ASSERT for a static assertion with the condition
4434 CONDITION and the message text MESSAGE. LOCATION is the location
4435 of the static assertion in the source code. When MEMBER_P, this
4436 static assertion is a member of a class. */
4438 finish_static_assert (tree condition, tree message, location_t location,
4441 if (check_for_bare_parameter_packs (condition))
4442 condition = error_mark_node;
4444 if (type_dependent_expression_p (condition)
4445 || value_dependent_expression_p (condition))
4447 /* We're in a template; build a STATIC_ASSERT and put it in
4451 assertion = make_node (STATIC_ASSERT);
4452 STATIC_ASSERT_CONDITION (assertion) = condition;
4453 STATIC_ASSERT_MESSAGE (assertion) = message;
4454 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4457 maybe_add_class_template_decl_list (current_class_type,
4461 add_stmt (assertion);
4466 /* Fold the expression and convert it to a boolean value. */
4467 condition = fold_non_dependent_expr (condition);
4468 condition = cp_convert (boolean_type_node, condition);
4470 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4471 /* Do nothing; the condition is satisfied. */
4475 location_t saved_loc = input_location;
4477 input_location = location;
4478 if (TREE_CODE (condition) == INTEGER_CST
4479 && integer_zerop (condition))
4480 /* Report the error. */
4481 error ("static assertion failed: %E", message);
4482 else if (condition && condition != error_mark_node)
4483 error ("non-constant condition for static assertion");
4484 input_location = saved_loc;
4488 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4489 just return the type even though EXPR is a type-dependent expression.
4490 The ABI specifies which cases this applies to, which is a subset of the
4494 describable_type (tree expr)
4496 tree type = NULL_TREE;
4498 /* processing_template_decl isn't set when we're called from the mangling
4499 code, so bump it now. */
4500 ++processing_template_decl;
4501 if (! type_dependent_expression_p (expr)
4502 && ! type_unknown_p (expr))
4504 type = TREE_TYPE (expr);
4505 if (real_lvalue_p (expr))
4506 type = build_reference_type (type);
4508 --processing_template_decl;
4513 switch (TREE_CODE (expr))
4519 /* Named rvalue reference becomes lvalue. */
4520 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4525 case TEMPLATE_PARM_INDEX:
4527 case STATIC_CAST_EXPR:
4528 case REINTERPRET_CAST_EXPR:
4529 case CONST_CAST_EXPR:
4530 case DYNAMIC_CAST_EXPR:
4531 type = TREE_TYPE (expr);
4536 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4537 if (ptrtype && POINTER_TYPE_P (ptrtype))
4538 type = build_reference_type (TREE_TYPE (ptrtype));
4543 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4544 type = TREE_TYPE (expr);
4548 if (type && type_uses_auto (type))
4554 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4555 suitable for use as a type-specifier.
4557 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4558 id-expression or a class member access, FALSE when it was parsed as
4559 a full expression. */
4562 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4564 tree orig_expr = expr;
4565 tree type = NULL_TREE;
4567 if (!expr || error_operand_p (expr))
4568 return error_mark_node;
4571 || TREE_CODE (expr) == TYPE_DECL
4572 || (TREE_CODE (expr) == BIT_NOT_EXPR
4573 && TYPE_P (TREE_OPERAND (expr, 0))))
4575 error ("argument to decltype must be an expression");
4576 return error_mark_node;
4579 if (type_dependent_expression_p (expr))
4581 if (id_expression_or_member_access_p)
4583 switch (TREE_CODE (expr))
4590 case TEMPLATE_PARM_INDEX:
4591 type = TREE_TYPE (expr);
4599 if (type && !type_uses_auto (type))
4602 type = cxx_make_type (DECLTYPE_TYPE);
4603 DECLTYPE_TYPE_EXPR (type) = expr;
4604 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4605 = id_expression_or_member_access_p;
4606 SET_TYPE_STRUCTURAL_EQUALITY (type);
4611 /* The type denoted by decltype(e) is defined as follows: */
4613 if (id_expression_or_member_access_p)
4615 /* If e is an id-expression or a class member access (5.2.5
4616 [expr.ref]), decltype(e) is defined as the type of the entity
4617 named by e. If there is no such entity, or e names a set of
4618 overloaded functions, the program is ill-formed. */
4619 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4620 expr = lookup_name (expr);
4622 if (TREE_CODE (expr) == INDIRECT_REF)
4623 /* This can happen when the expression is, e.g., "a.b". Just
4624 look at the underlying operand. */
4625 expr = TREE_OPERAND (expr, 0);
4627 if (TREE_CODE (expr) == OFFSET_REF
4628 || TREE_CODE (expr) == MEMBER_REF)
4629 /* We're only interested in the field itself. If it is a
4630 BASELINK, we will need to see through it in the next
4632 expr = TREE_OPERAND (expr, 1);
4634 if (TREE_CODE (expr) == BASELINK)
4635 /* See through BASELINK nodes to the underlying functions. */
4636 expr = BASELINK_FUNCTIONS (expr);
4638 if (TREE_CODE (expr) == OVERLOAD)
4640 if (OVL_CHAIN (expr))
4642 error ("%qE refers to a set of overloaded functions", orig_expr);
4643 return error_mark_node;
4646 /* An overload set containing only one function: just look
4647 at that function. */
4648 expr = OVL_FUNCTION (expr);
4651 switch (TREE_CODE (expr))
4654 if (DECL_BIT_FIELD_TYPE (expr))
4656 type = DECL_BIT_FIELD_TYPE (expr);
4659 /* Fall through for fields that aren't bitfields. */
4666 case TEMPLATE_PARM_INDEX:
4667 type = TREE_TYPE (expr);
4671 type = error_mark_node;
4675 type = is_bitfield_expr_with_lowered_type (expr);
4677 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4684 /* We can get here when the id-expression refers to an
4686 type = TREE_TYPE (expr);
4690 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4691 || TREE_CODE (expr) == SCOPE_REF);
4692 error ("argument to decltype must be an expression");
4693 return error_mark_node;
4698 /* Expressions of reference type are sometimes wrapped in
4699 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4700 representation, not part of the language, so we have to look
4702 if (TREE_CODE (expr) == INDIRECT_REF
4703 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4705 expr = TREE_OPERAND (expr, 0);
4707 if (TREE_CODE (expr) == CALL_EXPR)
4709 /* If e is a function call (5.2.2 [expr.call]) or an
4710 invocation of an overloaded operator (parentheses around e
4711 are ignored), decltype(e) is defined as the return type of
4713 tree fndecl = get_callee_fndecl (expr);
4714 if (fndecl && fndecl != error_mark_node)
4715 type = TREE_TYPE (TREE_TYPE (fndecl));
4718 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4719 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4720 || TREE_CODE (target_type) == POINTER_TYPE)
4721 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4722 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4723 type = TREE_TYPE (TREE_TYPE (target_type));
4725 sorry ("unable to determine the declared type of expression %<%E%>",
4731 type = is_bitfield_expr_with_lowered_type (expr);
4734 /* Bitfields are special, because their type encodes the
4735 number of bits they store. If the expression referenced a
4736 bitfield, TYPE now has the declared type of that
4738 type = cp_build_qualified_type (type,
4739 cp_type_quals (TREE_TYPE (expr)));
4741 if (real_lvalue_p (expr))
4742 type = build_reference_type (type);
4746 /* Otherwise, where T is the type of e, if e is an lvalue,
4747 decltype(e) is defined as T&, otherwise decltype(e) is
4749 type = TREE_TYPE (expr);
4750 if (type == error_mark_node)
4751 return error_mark_node;
4752 else if (expr == current_class_ptr)
4753 /* If the expression is just "this", we want the
4754 cv-unqualified pointer for the "this" type. */
4755 type = TYPE_MAIN_VARIANT (type);
4756 else if (real_lvalue_p (expr))
4758 if (TREE_CODE (type) != REFERENCE_TYPE)
4759 type = build_reference_type (type);
4762 type = non_reference (type);
4767 if (!type || type == unknown_type_node)
4769 error ("type of %qE is unknown", expr);
4770 return error_mark_node;
4776 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4777 __has_nothrow_copy, depending on assign_p. */
4780 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4787 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4790 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4792 else if (TYPE_HAS_INIT_REF (type))
4794 /* If construction of the copy constructor was postponed, create
4796 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4797 lazily_declare_fn (sfk_copy_constructor, type);
4798 fns = CLASSTYPE_CONSTRUCTORS (type);
4803 for (; fns; fns = OVL_NEXT (fns))
4805 tree fn = OVL_CURRENT (fns);
4809 if (copy_fn_p (fn) == 0)
4812 else if (copy_fn_p (fn) <= 0)
4815 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4822 /* Actually evaluates the trait. */
4825 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4827 enum tree_code type_code1;
4830 type_code1 = TREE_CODE (type1);
4834 case CPTK_HAS_NOTHROW_ASSIGN:
4835 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4836 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4837 || (CLASS_TYPE_P (type1)
4838 && classtype_has_nothrow_assign_or_copy_p (type1,
4841 case CPTK_HAS_TRIVIAL_ASSIGN:
4842 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4843 && (pod_type_p (type1)
4844 || (CLASS_TYPE_P (type1)
4845 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4847 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4848 type1 = strip_array_types (type1);
4849 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4850 || (CLASS_TYPE_P (type1)
4851 && (t = locate_ctor (type1, NULL))
4852 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4854 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4855 type1 = strip_array_types (type1);
4856 return (pod_type_p (type1)
4857 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4859 case CPTK_HAS_NOTHROW_COPY:
4860 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4861 || (CLASS_TYPE_P (type1)
4862 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4864 case CPTK_HAS_TRIVIAL_COPY:
4865 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4866 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4868 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4869 type1 = strip_array_types (type1);
4870 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4871 || (CLASS_TYPE_P (type1)
4872 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4874 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4875 return (CLASS_TYPE_P (type1)
4876 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4878 case CPTK_IS_ABSTRACT:
4879 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4881 case CPTK_IS_BASE_OF:
4882 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4883 && DERIVED_FROM_P (type1, type2));
4886 return (NON_UNION_CLASS_TYPE_P (type1));
4888 case CPTK_IS_CONVERTIBLE_TO:
4893 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4896 return (type_code1 == ENUMERAL_TYPE);
4899 return (pod_type_p (type1));
4901 case CPTK_IS_POLYMORPHIC:
4902 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4905 return (type_code1 == UNION_TYPE);
4913 /* Returns true if TYPE is a complete type, an array of unknown bound,
4914 or (possibly cv-qualified) void, returns false otherwise. */
4917 check_trait_type (tree type)
4919 if (COMPLETE_TYPE_P (type))
4922 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
4925 if (VOID_TYPE_P (type))
4931 /* Process a trait expression. */
4934 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4936 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4937 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4938 || kind == CPTK_HAS_NOTHROW_COPY
4939 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4940 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4941 || kind == CPTK_HAS_TRIVIAL_COPY
4942 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4943 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4944 || kind == CPTK_IS_ABSTRACT
4945 || kind == CPTK_IS_BASE_OF
4946 || kind == CPTK_IS_CLASS
4947 || kind == CPTK_IS_CONVERTIBLE_TO
4948 || kind == CPTK_IS_EMPTY
4949 || kind == CPTK_IS_ENUM
4950 || kind == CPTK_IS_POD
4951 || kind == CPTK_IS_POLYMORPHIC
4952 || kind == CPTK_IS_UNION);
4954 if (kind == CPTK_IS_CONVERTIBLE_TO)
4956 sorry ("__is_convertible_to");
4957 return error_mark_node;
4960 if (type1 == error_mark_node
4961 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4962 && type2 == error_mark_node))
4963 return error_mark_node;
4965 if (processing_template_decl)
4967 tree trait_expr = make_node (TRAIT_EXPR);
4968 TREE_TYPE (trait_expr) = boolean_type_node;
4969 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4970 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4971 TRAIT_EXPR_KIND (trait_expr) = kind;
4975 complete_type (type1);
4977 complete_type (type2);
4981 case CPTK_HAS_NOTHROW_ASSIGN:
4982 case CPTK_HAS_TRIVIAL_ASSIGN:
4983 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4984 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4985 case CPTK_HAS_NOTHROW_COPY:
4986 case CPTK_HAS_TRIVIAL_COPY:
4987 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4988 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4989 case CPTK_IS_ABSTRACT:
4992 case CPTK_IS_POLYMORPHIC:
4993 if (!check_trait_type (type1))
4995 error ("incomplete type %qT not allowed", type1);
4996 return error_mark_node;
5000 case CPTK_IS_BASE_OF:
5001 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5002 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5003 && !COMPLETE_TYPE_P (type2))
5005 error ("incomplete type %qT not allowed", type2);
5006 return error_mark_node;
5015 case CPTK_IS_CONVERTIBLE_TO:
5020 return (trait_expr_value (kind, type1, type2)
5021 ? boolean_true_node : boolean_false_node);
5024 #include "gt-cp-semantics.h"