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 are parsing a template declaration and if decl is a typedef,
1532 add it to a list tied to the template.
1533 At template instantiation time, that list will be walked and
1534 access check performed. */
1535 if (is_typedef_decl (decl))
1537 /* This the scope through which type_decl is accessed.
1538 It will be useful information later to do access check for
1540 tree scope = nested_name_specifier
1541 ? nested_name_specifier
1542 : DECL_CONTEXT (decl);
1543 tree templ_info = NULL;
1544 tree cs = current_scope ();
1546 if (cs && (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL))
1547 templ_info = get_template_info (cs);
1550 && TI_TEMPLATE (templ_info)
1552 && CLASS_TYPE_P (scope)
1553 && !currently_open_class (scope))
1554 append_type_to_template_for_access_check (current_scope (), decl, scope);
1557 /* If we're not checking, return immediately. */
1558 if (deferred_access_no_check)
1561 /* Determine the SCOPE of DECL. */
1562 scope = context_for_name_lookup (decl);
1563 /* If the SCOPE is not a type, then DECL is not a member. */
1564 if (!TYPE_P (scope))
1566 /* Compute the scope through which DECL is being accessed. */
1568 /* OBJECT_TYPE might not be a class type; consider:
1570 class A { typedef int I; };
1574 In this case, we will have "A::I" as the DECL, but "I" as the
1576 && CLASS_TYPE_P (object_type)
1577 && DERIVED_FROM_P (scope, object_type))
1578 /* If we are processing a `->' or `.' expression, use the type of the
1580 qualifying_type = object_type;
1581 else if (nested_name_specifier)
1583 /* If the reference is to a non-static member of the
1584 current class, treat it as if it were referenced through
1586 if (DECL_NONSTATIC_MEMBER_P (decl)
1587 && current_class_ptr
1588 && DERIVED_FROM_P (scope, current_class_type))
1589 qualifying_type = current_class_type;
1590 /* Otherwise, use the type indicated by the
1591 nested-name-specifier. */
1593 qualifying_type = nested_name_specifier;
1596 /* Otherwise, the name must be from the current class or one of
1598 qualifying_type = currently_open_derived_class (scope);
1601 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1602 or similar in a default argument value. */
1603 && CLASS_TYPE_P (qualifying_type)
1604 && !dependent_type_p (qualifying_type))
1605 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1609 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1610 class named to the left of the "::" operator. DONE is true if this
1611 expression is a complete postfix-expression; it is false if this
1612 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1613 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1614 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1615 is true iff this qualified name appears as a template argument. */
1618 finish_qualified_id_expr (tree qualifying_class,
1623 bool template_arg_p)
1625 gcc_assert (TYPE_P (qualifying_class));
1627 if (error_operand_p (expr))
1628 return error_mark_node;
1630 if (DECL_P (expr) || BASELINK_P (expr))
1634 check_template_keyword (expr);
1636 /* If EXPR occurs as the operand of '&', use special handling that
1637 permits a pointer-to-member. */
1638 if (address_p && done)
1640 if (TREE_CODE (expr) == SCOPE_REF)
1641 expr = TREE_OPERAND (expr, 1);
1642 expr = build_offset_ref (qualifying_class, expr,
1643 /*address_p=*/true);
1647 /* Within the scope of a class, turn references to non-static
1648 members into expression of the form "this->...". */
1650 /* But, within a template argument, we do not want make the
1651 transformation, as there is no "this" pointer. */
1653 else if (TREE_CODE (expr) == FIELD_DECL)
1655 push_deferring_access_checks (dk_no_check);
1656 expr = finish_non_static_data_member (expr, current_class_ref,
1658 pop_deferring_access_checks ();
1660 else if (BASELINK_P (expr) && !processing_template_decl)
1664 /* See if any of the functions are non-static members. */
1665 fns = BASELINK_FUNCTIONS (expr);
1666 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1667 fns = TREE_OPERAND (fns, 0);
1668 /* If so, the expression may be relative to the current
1670 if (!shared_member_p (fns)
1671 && current_class_type
1672 && DERIVED_FROM_P (qualifying_class, current_class_type))
1673 expr = (build_class_member_access_expr
1674 (maybe_dummy_object (qualifying_class, NULL),
1676 BASELINK_ACCESS_BINFO (expr),
1677 /*preserve_reference=*/false,
1678 tf_warning_or_error));
1680 /* The expression is a qualified name whose address is not
1682 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1688 /* Begin a statement-expression. The value returned must be passed to
1689 finish_stmt_expr. */
1692 begin_stmt_expr (void)
1694 return push_stmt_list ();
1697 /* Process the final expression of a statement expression. EXPR can be
1698 NULL, if the final expression is empty. Return a STATEMENT_LIST
1699 containing all the statements in the statement-expression, or
1700 ERROR_MARK_NODE if there was an error. */
1703 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1705 if (error_operand_p (expr))
1707 /* The type of the statement-expression is the type of the last
1709 TREE_TYPE (stmt_expr) = error_mark_node;
1710 return error_mark_node;
1713 /* If the last statement does not have "void" type, then the value
1714 of the last statement is the value of the entire expression. */
1717 tree type = TREE_TYPE (expr);
1719 if (processing_template_decl)
1721 expr = build_stmt (EXPR_STMT, expr);
1722 expr = add_stmt (expr);
1723 /* Mark the last statement so that we can recognize it as such at
1724 template-instantiation time. */
1725 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1727 else if (VOID_TYPE_P (type))
1729 /* Just treat this like an ordinary statement. */
1730 expr = finish_expr_stmt (expr);
1734 /* It actually has a value we need to deal with. First, force it
1735 to be an rvalue so that we won't need to build up a copy
1736 constructor call later when we try to assign it to something. */
1737 expr = force_rvalue (expr);
1738 if (error_operand_p (expr))
1739 return error_mark_node;
1741 /* Update for array-to-pointer decay. */
1742 type = TREE_TYPE (expr);
1744 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1745 normal statement, but don't convert to void or actually add
1747 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1748 expr = maybe_cleanup_point_expr (expr);
1752 /* The type of the statement-expression is the type of the last
1754 TREE_TYPE (stmt_expr) = type;
1760 /* Finish a statement-expression. EXPR should be the value returned
1761 by the previous begin_stmt_expr. Returns an expression
1762 representing the statement-expression. */
1765 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1770 if (error_operand_p (stmt_expr))
1772 pop_stmt_list (stmt_expr);
1773 return error_mark_node;
1776 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1778 type = TREE_TYPE (stmt_expr);
1779 result = pop_stmt_list (stmt_expr);
1780 TREE_TYPE (result) = type;
1782 if (processing_template_decl)
1784 result = build_min (STMT_EXPR, type, result);
1785 TREE_SIDE_EFFECTS (result) = 1;
1786 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1788 else if (CLASS_TYPE_P (type))
1790 /* Wrap the statement-expression in a TARGET_EXPR so that the
1791 temporary object created by the final expression is destroyed at
1792 the end of the full-expression containing the
1793 statement-expression. */
1794 result = force_target_expr (type, result);
1800 /* Returns the expression which provides the value of STMT_EXPR. */
1803 stmt_expr_value_expr (tree stmt_expr)
1805 tree t = STMT_EXPR_STMT (stmt_expr);
1807 if (TREE_CODE (t) == BIND_EXPR)
1808 t = BIND_EXPR_BODY (t);
1810 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1811 t = STATEMENT_LIST_TAIL (t)->stmt;
1813 if (TREE_CODE (t) == EXPR_STMT)
1814 t = EXPR_STMT_EXPR (t);
1819 /* Perform Koenig lookup. FN is the postfix-expression representing
1820 the function (or functions) to call; ARGS are the arguments to the
1821 call. Returns the functions to be considered by overload
1825 perform_koenig_lookup (tree fn, tree args)
1827 tree identifier = NULL_TREE;
1828 tree functions = NULL_TREE;
1829 tree tmpl_args = NULL_TREE;
1831 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1833 tmpl_args = TREE_OPERAND (fn, 1);
1834 fn = TREE_OPERAND (fn, 0);
1837 /* Find the name of the overloaded function. */
1838 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1840 else if (is_overloaded_fn (fn))
1843 identifier = DECL_NAME (get_first_fn (functions));
1845 else if (DECL_P (fn))
1848 identifier = DECL_NAME (fn);
1851 /* A call to a namespace-scope function using an unqualified name.
1853 Do Koenig lookup -- unless any of the arguments are
1855 if (!any_type_dependent_arguments_p (args)
1856 && !any_dependent_template_arguments_p (tmpl_args))
1858 fn = lookup_arg_dependent (identifier, functions, args);
1860 /* The unqualified name could not be resolved. */
1861 fn = unqualified_fn_lookup_error (identifier);
1864 if (fn && tmpl_args)
1865 fn = build_nt (TEMPLATE_ID_EXPR, fn, tmpl_args);
1870 /* Generate an expression for `FN (ARGS)'.
1872 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1873 as a virtual call, even if FN is virtual. (This flag is set when
1874 encountering an expression where the function name is explicitly
1875 qualified. For example a call to `X::f' never generates a virtual
1878 Returns code for the call. */
1881 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p,
1882 tsubst_flags_t complain)
1888 if (fn == error_mark_node || args == error_mark_node)
1889 return error_mark_node;
1891 /* ARGS should be a list of arguments. */
1892 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1893 gcc_assert (!TYPE_P (fn));
1898 if (processing_template_decl)
1900 if (type_dependent_expression_p (fn)
1901 || any_type_dependent_arguments_p (args))
1903 result = build_nt_call_list (fn, args);
1904 KOENIG_LOOKUP_P (result) = koenig_p;
1909 tree fndecl = OVL_CURRENT (fn);
1910 if (TREE_CODE (fndecl) != FUNCTION_DECL
1911 || !TREE_THIS_VOLATILE (fndecl))
1917 current_function_returns_abnormally = 1;
1921 if (!BASELINK_P (fn)
1922 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1923 && TREE_TYPE (fn) != unknown_type_node)
1924 fn = build_non_dependent_expr (fn);
1925 args = build_non_dependent_args (orig_args);
1928 if (is_overloaded_fn (fn))
1929 fn = baselink_for_fns (fn);
1932 if (BASELINK_P (fn))
1936 /* A call to a member function. From [over.call.func]:
1938 If the keyword this is in scope and refers to the class of
1939 that member function, or a derived class thereof, then the
1940 function call is transformed into a qualified function call
1941 using (*this) as the postfix-expression to the left of the
1942 . operator.... [Otherwise] a contrived object of type T
1943 becomes the implied object argument.
1945 This paragraph is unclear about this situation:
1947 struct A { void f(); };
1948 struct B : public A {};
1949 struct C : public A { void g() { B::f(); }};
1951 In particular, for `B::f', this paragraph does not make clear
1952 whether "the class of that member function" refers to `A' or
1953 to `B'. We believe it refers to `B'. */
1954 if (current_class_type
1955 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1957 && current_class_ref)
1958 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1962 tree representative_fn;
1964 representative_fn = BASELINK_FUNCTIONS (fn);
1965 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1966 representative_fn = TREE_OPERAND (representative_fn, 0);
1967 representative_fn = get_first_fn (representative_fn);
1968 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1971 if (processing_template_decl)
1973 if (type_dependent_expression_p (object))
1974 return build_nt_call_list (orig_fn, orig_args);
1975 object = build_non_dependent_expr (object);
1978 result = build_new_method_call (object, fn, args, NULL_TREE,
1980 ? LOOKUP_NONVIRTUAL : 0),
1984 else if (is_overloaded_fn (fn))
1986 /* If the function is an overloaded builtin, resolve it. */
1987 if (TREE_CODE (fn) == FUNCTION_DECL
1988 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1989 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1990 result = resolve_overloaded_builtin (fn, args);
1993 /* A call to a namespace-scope function. */
1994 result = build_new_function_call (fn, args, koenig_p, complain);
1996 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1999 error ("arguments to destructor are not allowed");
2000 /* Mark the pseudo-destructor call as having side-effects so
2001 that we do not issue warnings about its use. */
2002 result = build1 (NOP_EXPR,
2004 TREE_OPERAND (fn, 0));
2005 TREE_SIDE_EFFECTS (result) = 1;
2007 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2008 /* If the "function" is really an object of class type, it might
2009 have an overloaded `operator ()'. */
2010 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
2011 /*overloaded_p=*/NULL, complain);
2014 /* A call where the function is unknown. */
2015 result = cp_build_function_call (fn, args, complain);
2017 if (processing_template_decl)
2019 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
2020 KOENIG_LOOKUP_P (result) = koenig_p;
2025 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2026 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2027 POSTDECREMENT_EXPR.) */
2030 finish_increment_expr (tree expr, enum tree_code code)
2032 return build_x_unary_op (code, expr, tf_warning_or_error);
2035 /* Finish a use of `this'. Returns an expression for `this'. */
2038 finish_this_expr (void)
2042 if (current_class_ptr)
2044 result = current_class_ptr;
2046 else if (current_function_decl
2047 && DECL_STATIC_FUNCTION_P (current_function_decl))
2049 error ("%<this%> is unavailable for static member functions");
2050 result = error_mark_node;
2054 if (current_function_decl)
2055 error ("invalid use of %<this%> in non-member function");
2057 error ("invalid use of %<this%> at top level");
2058 result = error_mark_node;
2064 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2065 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2066 the TYPE for the type given. If SCOPE is non-NULL, the expression
2067 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2070 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2072 if (object == error_mark_node || destructor == error_mark_node)
2073 return error_mark_node;
2075 gcc_assert (TYPE_P (destructor));
2077 if (!processing_template_decl)
2079 if (scope == error_mark_node)
2081 error ("invalid qualifying scope in pseudo-destructor name");
2082 return error_mark_node;
2084 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2086 error ("qualified type %qT does not match destructor name ~%qT",
2088 return error_mark_node;
2092 /* [expr.pseudo] says both:
2094 The type designated by the pseudo-destructor-name shall be
2095 the same as the object type.
2099 The cv-unqualified versions of the object type and of the
2100 type designated by the pseudo-destructor-name shall be the
2103 We implement the more generous second sentence, since that is
2104 what most other compilers do. */
2105 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2108 error ("%qE is not of type %qT", object, destructor);
2109 return error_mark_node;
2113 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2116 /* Finish an expression of the form CODE EXPR. */
2119 finish_unary_op_expr (enum tree_code code, tree expr)
2121 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2122 /* Inside a template, build_x_unary_op does not fold the
2123 expression. So check whether the result is folded before
2124 setting TREE_NEGATED_INT. */
2125 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2126 && TREE_CODE (result) == INTEGER_CST
2127 && !TYPE_UNSIGNED (TREE_TYPE (result))
2128 && INT_CST_LT (result, integer_zero_node))
2130 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2131 setting TREE_NEGATED_INT. */
2132 result = copy_node (result);
2133 TREE_NEGATED_INT (result) = 1;
2135 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2136 overflow_warning (result);
2141 /* Finish a compound-literal expression. TYPE is the type to which
2142 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2145 finish_compound_literal (tree type, tree compound_literal)
2147 if (type == error_mark_node)
2148 return error_mark_node;
2150 if (!TYPE_OBJ_P (type))
2152 error ("compound literal of non-object type %qT", type);
2153 return error_mark_node;
2156 if (processing_template_decl)
2158 TREE_TYPE (compound_literal) = type;
2159 /* Mark the expression as a compound literal. */
2160 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2161 return compound_literal;
2164 type = complete_type (type);
2166 if (TYPE_NON_AGGREGATE_CLASS (type))
2168 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2169 everywhere that deals with function arguments would be a pain, so
2170 just wrap it in a TREE_LIST. The parser set a flag so we know
2171 that it came from T{} rather than T({}). */
2172 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2173 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2174 return build_functional_cast (type, compound_literal, tf_error);
2177 if (TREE_CODE (type) == ARRAY_TYPE
2178 && check_array_initializer (NULL_TREE, type, compound_literal))
2179 return error_mark_node;
2180 compound_literal = reshape_init (type, compound_literal);
2181 if (TREE_CODE (type) == ARRAY_TYPE)
2182 cp_complete_array_type (&type, compound_literal, false);
2183 compound_literal = digest_init (type, compound_literal);
2184 if ((!at_function_scope_p () || cp_type_readonly (type))
2185 && initializer_constant_valid_p (compound_literal, type))
2187 tree decl = create_temporary_var (type);
2188 DECL_INITIAL (decl) = compound_literal;
2189 TREE_STATIC (decl) = 1;
2190 decl = pushdecl_top_level (decl);
2191 DECL_NAME (decl) = make_anon_name ();
2192 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2196 return get_target_expr (compound_literal);
2199 /* Return the declaration for the function-name variable indicated by
2203 finish_fname (tree id)
2207 decl = fname_decl (input_location, C_RID_CODE (id), id);
2208 if (processing_template_decl)
2209 decl = DECL_NAME (decl);
2213 /* Finish a translation unit. */
2216 finish_translation_unit (void)
2218 /* In case there were missing closebraces,
2219 get us back to the global binding level. */
2221 while (current_namespace != global_namespace)
2224 /* Do file scope __FUNCTION__ et al. */
2225 finish_fname_decls ();
2228 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2229 Returns the parameter. */
2232 finish_template_type_parm (tree aggr, tree identifier)
2234 if (aggr != class_type_node)
2236 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2237 aggr = class_type_node;
2240 return build_tree_list (aggr, identifier);
2243 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2244 Returns the parameter. */
2247 finish_template_template_parm (tree aggr, tree identifier)
2249 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2250 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2251 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2252 DECL_TEMPLATE_RESULT (tmpl) = decl;
2253 DECL_ARTIFICIAL (decl) = 1;
2254 end_template_decl ();
2256 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2258 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2259 /*is_primary=*/true, /*is_partial=*/false,
2262 return finish_template_type_parm (aggr, tmpl);
2265 /* ARGUMENT is the default-argument value for a template template
2266 parameter. If ARGUMENT is invalid, issue error messages and return
2267 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2270 check_template_template_default_arg (tree argument)
2272 if (TREE_CODE (argument) != TEMPLATE_DECL
2273 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2274 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2276 if (TREE_CODE (argument) == TYPE_DECL)
2277 error ("invalid use of type %qT as a default value for a template "
2278 "template-parameter", TREE_TYPE (argument));
2280 error ("invalid default argument for a template template parameter");
2281 return error_mark_node;
2287 /* Begin a class definition, as indicated by T. */
2290 begin_class_definition (tree t, tree attributes)
2292 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2293 return error_mark_node;
2295 if (processing_template_parmlist)
2297 error ("definition of %q#T inside template parameter list", t);
2298 return error_mark_node;
2300 /* A non-implicit typename comes from code like:
2302 template <typename T> struct A {
2303 template <typename U> struct A<T>::B ...
2305 This is erroneous. */
2306 else if (TREE_CODE (t) == TYPENAME_TYPE)
2308 error ("invalid definition of qualified type %qT", t);
2309 t = error_mark_node;
2312 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2314 t = make_class_type (RECORD_TYPE);
2315 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2318 /* Update the location of the decl. */
2319 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2321 if (TYPE_BEING_DEFINED (t))
2323 t = make_class_type (TREE_CODE (t));
2324 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2326 maybe_process_partial_specialization (t);
2328 TYPE_BEING_DEFINED (t) = 1;
2330 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2332 if (flag_pack_struct)
2335 TYPE_PACKED (t) = 1;
2336 /* Even though the type is being defined for the first time
2337 here, there might have been a forward declaration, so there
2338 might be cv-qualified variants of T. */
2339 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2340 TYPE_PACKED (v) = 1;
2342 /* Reset the interface data, at the earliest possible
2343 moment, as it might have been set via a class foo;
2345 if (! TYPE_ANONYMOUS_P (t))
2347 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2348 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2349 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2350 (t, finfo->interface_unknown);
2352 reset_specialization();
2354 /* Make a declaration for this class in its own scope. */
2355 build_self_reference ();
2360 /* Finish the member declaration given by DECL. */
2363 finish_member_declaration (tree decl)
2365 if (decl == error_mark_node || decl == NULL_TREE)
2368 if (decl == void_type_node)
2369 /* The COMPONENT was a friend, not a member, and so there's
2370 nothing for us to do. */
2373 /* We should see only one DECL at a time. */
2374 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2376 /* Set up access control for DECL. */
2378 = (current_access_specifier == access_private_node);
2379 TREE_PROTECTED (decl)
2380 = (current_access_specifier == access_protected_node);
2381 if (TREE_CODE (decl) == TEMPLATE_DECL)
2383 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2384 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2387 /* Mark the DECL as a member of the current class. */
2388 DECL_CONTEXT (decl) = current_class_type;
2390 /* Check for bare parameter packs in the member variable declaration. */
2391 if (TREE_CODE (decl) == FIELD_DECL)
2393 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2394 TREE_TYPE (decl) = error_mark_node;
2395 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2396 DECL_ATTRIBUTES (decl) = NULL_TREE;
2401 A C language linkage is ignored for the names of class members
2402 and the member function type of class member functions. */
2403 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2404 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2406 /* Put functions on the TYPE_METHODS list and everything else on the
2407 TYPE_FIELDS list. Note that these are built up in reverse order.
2408 We reverse them (to obtain declaration order) in finish_struct. */
2409 if (TREE_CODE (decl) == FUNCTION_DECL
2410 || DECL_FUNCTION_TEMPLATE_P (decl))
2412 /* We also need to add this function to the
2413 CLASSTYPE_METHOD_VEC. */
2414 if (add_method (current_class_type, decl, NULL_TREE))
2416 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2417 TYPE_METHODS (current_class_type) = decl;
2419 maybe_add_class_template_decl_list (current_class_type, decl,
2423 /* Enter the DECL into the scope of the class. */
2424 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2425 || pushdecl_class_level (decl))
2427 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2428 go at the beginning. The reason is that lookup_field_1
2429 searches the list in order, and we want a field name to
2430 override a type name so that the "struct stat hack" will
2431 work. In particular:
2433 struct S { enum E { }; int E } s;
2436 is valid. In addition, the FIELD_DECLs must be maintained in
2437 declaration order so that class layout works as expected.
2438 However, we don't need that order until class layout, so we
2439 save a little time by putting FIELD_DECLs on in reverse order
2440 here, and then reversing them in finish_struct_1. (We could
2441 also keep a pointer to the correct insertion points in the
2444 if (TREE_CODE (decl) == TYPE_DECL)
2445 TYPE_FIELDS (current_class_type)
2446 = chainon (TYPE_FIELDS (current_class_type), decl);
2449 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2450 TYPE_FIELDS (current_class_type) = decl;
2453 maybe_add_class_template_decl_list (current_class_type, decl,
2458 note_decl_for_pch (decl);
2461 /* DECL has been declared while we are building a PCH file. Perform
2462 actions that we might normally undertake lazily, but which can be
2463 performed now so that they do not have to be performed in
2464 translation units which include the PCH file. */
2467 note_decl_for_pch (tree decl)
2469 gcc_assert (pch_file);
2471 /* There's a good chance that we'll have to mangle names at some
2472 point, even if only for emission in debugging information. */
2473 if ((TREE_CODE (decl) == VAR_DECL
2474 || TREE_CODE (decl) == FUNCTION_DECL)
2475 && !processing_template_decl)
2479 /* Finish processing a complete template declaration. The PARMS are
2480 the template parameters. */
2483 finish_template_decl (tree parms)
2486 end_template_decl ();
2488 end_specialization ();
2491 /* Finish processing a template-id (which names a type) of the form
2492 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2493 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2494 the scope of template-id indicated. */
2497 finish_template_type (tree name, tree args, int entering_scope)
2501 decl = lookup_template_class (name, args,
2502 NULL_TREE, NULL_TREE, entering_scope,
2503 tf_warning_or_error | tf_user);
2504 if (decl != error_mark_node)
2505 decl = TYPE_STUB_DECL (decl);
2510 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2511 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2512 BASE_CLASS, or NULL_TREE if an error occurred. The
2513 ACCESS_SPECIFIER is one of
2514 access_{default,public,protected_private}_node. For a virtual base
2515 we set TREE_TYPE. */
2518 finish_base_specifier (tree base, tree access, bool virtual_p)
2522 if (base == error_mark_node)
2524 error ("invalid base-class specification");
2527 else if (! MAYBE_CLASS_TYPE_P (base))
2529 error ("%qT is not a class type", base);
2534 if (cp_type_quals (base) != 0)
2536 error ("base class %qT has cv qualifiers", base);
2537 base = TYPE_MAIN_VARIANT (base);
2539 result = build_tree_list (access, base);
2541 TREE_TYPE (result) = integer_type_node;
2547 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2548 what we found when we tried to do the lookup.
2549 LOCATION is the location of the NAME identifier;
2550 The location is used in the error message*/
2553 qualified_name_lookup_error (tree scope, tree name,
2554 tree decl, location_t location)
2556 if (scope == error_mark_node)
2557 ; /* We already complained. */
2558 else if (TYPE_P (scope))
2560 if (!COMPLETE_TYPE_P (scope))
2561 error ("%Hincomplete type %qT used in nested name specifier",
2563 else if (TREE_CODE (decl) == TREE_LIST)
2565 error ("%Hreference to %<%T::%D%> is ambiguous", &location, scope, name);
2566 print_candidates (decl);
2569 error ("%H%qD is not a member of %qT", &location, name, scope);
2571 else if (scope != global_namespace)
2572 error ("%H%qD is not a member of %qD", &location, name, scope);
2574 error ("%H%<::%D%> has not been declared", &location, name);
2577 /* If FNS is a member function, a set of member functions, or a
2578 template-id referring to one or more member functions, return a
2579 BASELINK for FNS, incorporating the current access context.
2580 Otherwise, return FNS unchanged. */
2583 baselink_for_fns (tree fns)
2588 if (BASELINK_P (fns)
2589 || error_operand_p (fns))
2593 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2594 fn = TREE_OPERAND (fn, 0);
2595 fn = get_first_fn (fn);
2596 if (!DECL_FUNCTION_MEMBER_P (fn))
2599 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2601 cl = DECL_CONTEXT (fn);
2602 cl = TYPE_BINFO (cl);
2603 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2606 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2607 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2608 if non-NULL, is the type or namespace used to explicitly qualify
2609 ID_EXPRESSION. DECL is the entity to which that name has been
2612 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2613 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2614 be set to true if this expression isn't permitted in a
2615 constant-expression, but it is otherwise not set by this function.
2616 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2617 constant-expression, but a non-constant expression is also
2620 DONE is true if this expression is a complete postfix-expression;
2621 it is false if this expression is followed by '->', '[', '(', etc.
2622 ADDRESS_P is true iff this expression is the operand of '&'.
2623 TEMPLATE_P is true iff the qualified-id was of the form
2624 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2625 appears as a template argument.
2627 If an error occurs, and it is the kind of error that might cause
2628 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2629 is the caller's responsibility to issue the message. *ERROR_MSG
2630 will be a string with static storage duration, so the caller need
2633 Return an expression for the entity, after issuing appropriate
2634 diagnostics. This function is also responsible for transforming a
2635 reference to a non-static member into a COMPONENT_REF that makes
2636 the use of "this" explicit.
2638 Upon return, *IDK will be filled in appropriately. */
2640 finish_id_expression (tree id_expression,
2644 bool integral_constant_expression_p,
2645 bool allow_non_integral_constant_expression_p,
2646 bool *non_integral_constant_expression_p,
2650 bool template_arg_p,
2651 const char **error_msg,
2652 location_t location)
2654 /* Initialize the output parameters. */
2655 *idk = CP_ID_KIND_NONE;
2658 if (id_expression == error_mark_node)
2659 return error_mark_node;
2660 /* If we have a template-id, then no further lookup is
2661 required. If the template-id was for a template-class, we
2662 will sometimes have a TYPE_DECL at this point. */
2663 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2664 || TREE_CODE (decl) == TYPE_DECL)
2666 /* Look up the name. */
2669 if (decl == error_mark_node)
2671 /* Name lookup failed. */
2674 || (!dependent_type_p (scope)
2675 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2676 && IDENTIFIER_TYPENAME_P (id_expression)
2677 && dependent_type_p (TREE_TYPE (id_expression))))))
2679 /* If the qualifying type is non-dependent (and the name
2680 does not name a conversion operator to a dependent
2681 type), issue an error. */
2682 qualified_name_lookup_error (scope, id_expression, decl, location);
2683 return error_mark_node;
2687 /* It may be resolved via Koenig lookup. */
2688 *idk = CP_ID_KIND_UNQUALIFIED;
2689 return id_expression;
2692 decl = id_expression;
2694 /* If DECL is a variable that would be out of scope under
2695 ANSI/ISO rules, but in scope in the ARM, name lookup
2696 will succeed. Issue a diagnostic here. */
2698 decl = check_for_out_of_scope_variable (decl);
2700 /* Remember that the name was used in the definition of
2701 the current class so that we can check later to see if
2702 the meaning would have been different after the class
2703 was entirely defined. */
2704 if (!scope && decl != error_mark_node)
2705 maybe_note_name_used_in_class (id_expression, decl);
2707 /* Disallow uses of local variables from containing functions. */
2708 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2710 tree context = decl_function_context (decl);
2711 if (context != NULL_TREE && context != current_function_decl
2712 && ! TREE_STATIC (decl))
2714 error (TREE_CODE (decl) == VAR_DECL
2715 ? "use of %<auto%> variable from containing function"
2716 : "use of parameter from containing function");
2717 error (" %q+#D declared here", decl);
2718 return error_mark_node;
2723 /* If we didn't find anything, or what we found was a type,
2724 then this wasn't really an id-expression. */
2725 if (TREE_CODE (decl) == TEMPLATE_DECL
2726 && !DECL_FUNCTION_TEMPLATE_P (decl))
2728 *error_msg = "missing template arguments";
2729 return error_mark_node;
2731 else if (TREE_CODE (decl) == TYPE_DECL
2732 || TREE_CODE (decl) == NAMESPACE_DECL)
2734 *error_msg = "expected primary-expression";
2735 return error_mark_node;
2738 /* If the name resolved to a template parameter, there is no
2739 need to look it up again later. */
2740 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2741 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2745 *idk = CP_ID_KIND_NONE;
2746 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2747 decl = TEMPLATE_PARM_DECL (decl);
2748 r = convert_from_reference (DECL_INITIAL (decl));
2750 if (integral_constant_expression_p
2751 && !dependent_type_p (TREE_TYPE (decl))
2752 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2754 if (!allow_non_integral_constant_expression_p)
2755 error ("template parameter %qD of type %qT is not allowed in "
2756 "an integral constant expression because it is not of "
2757 "integral or enumeration type", decl, TREE_TYPE (decl));
2758 *non_integral_constant_expression_p = true;
2762 /* Similarly, we resolve enumeration constants to their
2763 underlying values. */
2764 else if (TREE_CODE (decl) == CONST_DECL)
2766 *idk = CP_ID_KIND_NONE;
2767 if (!processing_template_decl)
2769 used_types_insert (TREE_TYPE (decl));
2770 return DECL_INITIAL (decl);
2778 /* If the declaration was explicitly qualified indicate
2779 that. The semantics of `A::f(3)' are different than
2780 `f(3)' if `f' is virtual. */
2782 ? CP_ID_KIND_QUALIFIED
2783 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2784 ? CP_ID_KIND_TEMPLATE_ID
2785 : CP_ID_KIND_UNQUALIFIED));
2790 An id-expression is type-dependent if it contains an
2791 identifier that was declared with a dependent type.
2793 The standard is not very specific about an id-expression that
2794 names a set of overloaded functions. What if some of them
2795 have dependent types and some of them do not? Presumably,
2796 such a name should be treated as a dependent name. */
2797 /* Assume the name is not dependent. */
2798 dependent_p = false;
2799 if (!processing_template_decl)
2800 /* No names are dependent outside a template. */
2802 /* A template-id where the name of the template was not resolved
2803 is definitely dependent. */
2804 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2805 && (TREE_CODE (TREE_OPERAND (decl, 0))
2806 == IDENTIFIER_NODE))
2808 /* For anything except an overloaded function, just check its
2810 else if (!is_overloaded_fn (decl))
2812 = dependent_type_p (TREE_TYPE (decl));
2813 /* For a set of overloaded functions, check each of the
2819 if (BASELINK_P (fns))
2820 fns = BASELINK_FUNCTIONS (fns);
2822 /* For a template-id, check to see if the template
2823 arguments are dependent. */
2824 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2826 tree args = TREE_OPERAND (fns, 1);
2827 dependent_p = any_dependent_template_arguments_p (args);
2828 /* The functions are those referred to by the
2830 fns = TREE_OPERAND (fns, 0);
2833 /* If there are no dependent template arguments, go through
2834 the overloaded functions. */
2835 while (fns && !dependent_p)
2837 tree fn = OVL_CURRENT (fns);
2839 /* Member functions of dependent classes are
2841 if (TREE_CODE (fn) == FUNCTION_DECL
2842 && type_dependent_expression_p (fn))
2844 else if (TREE_CODE (fn) == TEMPLATE_DECL
2845 && dependent_template_p (fn))
2848 fns = OVL_NEXT (fns);
2852 /* If the name was dependent on a template parameter, we will
2853 resolve the name at instantiation time. */
2856 /* Create a SCOPE_REF for qualified names, if the scope is
2862 if (address_p && done)
2863 decl = finish_qualified_id_expr (scope, decl,
2867 else if (dependent_scope_p (scope))
2868 decl = build_qualified_name (/*type=*/NULL_TREE,
2872 else if (DECL_P (decl))
2873 decl = build_qualified_name (TREE_TYPE (decl),
2878 if (TREE_TYPE (decl))
2879 decl = convert_from_reference (decl);
2882 /* A TEMPLATE_ID already contains all the information we
2884 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2885 return id_expression;
2886 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2887 /* If we found a variable, then name lookup during the
2888 instantiation will always resolve to the same VAR_DECL
2889 (or an instantiation thereof). */
2890 if (TREE_CODE (decl) == VAR_DECL
2891 || TREE_CODE (decl) == PARM_DECL)
2892 return convert_from_reference (decl);
2893 /* The same is true for FIELD_DECL, but we also need to
2894 make sure that the syntax is correct. */
2895 else if (TREE_CODE (decl) == FIELD_DECL)
2897 /* Since SCOPE is NULL here, this is an unqualified name.
2898 Access checking has been performed during name lookup
2899 already. Turn off checking to avoid duplicate errors. */
2900 push_deferring_access_checks (dk_no_check);
2901 decl = finish_non_static_data_member
2902 (decl, current_class_ref,
2903 /*qualifying_scope=*/NULL_TREE);
2904 pop_deferring_access_checks ();
2907 return id_expression;
2910 /* Only certain kinds of names are allowed in constant
2911 expression. Enumerators and template parameters have already
2912 been handled above. */
2913 if (integral_constant_expression_p
2914 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2915 && ! builtin_valid_in_constant_expr_p (decl))
2917 if (!allow_non_integral_constant_expression_p)
2919 error ("%qD cannot appear in a constant-expression", decl);
2920 return error_mark_node;
2922 *non_integral_constant_expression_p = true;
2925 if (TREE_CODE (decl) == NAMESPACE_DECL)
2927 error ("use of namespace %qD as expression", decl);
2928 return error_mark_node;
2930 else if (DECL_CLASS_TEMPLATE_P (decl))
2932 error ("use of class template %qT as expression", decl);
2933 return error_mark_node;
2935 else if (TREE_CODE (decl) == TREE_LIST)
2937 /* Ambiguous reference to base members. */
2938 error ("request for member %qD is ambiguous in "
2939 "multiple inheritance lattice", id_expression);
2940 print_candidates (decl);
2941 return error_mark_node;
2944 /* Mark variable-like entities as used. Functions are similarly
2945 marked either below or after overload resolution. */
2946 if (TREE_CODE (decl) == VAR_DECL
2947 || TREE_CODE (decl) == PARM_DECL
2948 || TREE_CODE (decl) == RESULT_DECL)
2953 decl = (adjust_result_of_qualified_name_lookup
2954 (decl, scope, current_class_type));
2956 if (TREE_CODE (decl) == FUNCTION_DECL)
2959 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2960 decl = finish_qualified_id_expr (scope,
2968 tree r = convert_from_reference (decl);
2970 if (processing_template_decl && TYPE_P (scope))
2971 r = build_qualified_name (TREE_TYPE (r),
2977 else if (TREE_CODE (decl) == FIELD_DECL)
2979 /* Since SCOPE is NULL here, this is an unqualified name.
2980 Access checking has been performed during name lookup
2981 already. Turn off checking to avoid duplicate errors. */
2982 push_deferring_access_checks (dk_no_check);
2983 decl = finish_non_static_data_member (decl, current_class_ref,
2984 /*qualifying_scope=*/NULL_TREE);
2985 pop_deferring_access_checks ();
2987 else if (is_overloaded_fn (decl))
2992 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2993 first_fn = TREE_OPERAND (first_fn, 0);
2994 first_fn = get_first_fn (first_fn);
2995 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2996 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2998 if (!really_overloaded_fn (decl))
2999 mark_used (first_fn);
3002 && TREE_CODE (first_fn) == FUNCTION_DECL
3003 && DECL_FUNCTION_MEMBER_P (first_fn)
3004 && !shared_member_p (decl))
3006 /* A set of member functions. */
3007 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3008 return finish_class_member_access_expr (decl, id_expression,
3009 /*template_p=*/false,
3010 tf_warning_or_error);
3013 decl = baselink_for_fns (decl);
3017 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3018 && DECL_CLASS_SCOPE_P (decl))
3020 tree context = context_for_name_lookup (decl);
3021 if (context != current_class_type)
3023 tree path = currently_open_derived_class (context);
3024 perform_or_defer_access_check (TYPE_BINFO (path),
3029 decl = convert_from_reference (decl);
3033 if (TREE_DEPRECATED (decl))
3034 warn_deprecated_use (decl);
3039 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3040 use as a type-specifier. */
3043 finish_typeof (tree expr)
3047 if (type_dependent_expression_p (expr))
3049 type = cxx_make_type (TYPEOF_TYPE);
3050 TYPEOF_TYPE_EXPR (type) = expr;
3051 SET_TYPE_STRUCTURAL_EQUALITY (type);
3056 type = unlowered_expr_type (expr);
3058 if (!type || type == unknown_type_node)
3060 error ("type of %qE is unknown", expr);
3061 return error_mark_node;
3067 /* Perform C++-specific checks for __builtin_offsetof before calling
3071 finish_offsetof (tree expr)
3073 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3075 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3076 TREE_OPERAND (expr, 2));
3077 return error_mark_node;
3079 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3080 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3081 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3083 if (TREE_CODE (expr) == COMPONENT_REF
3084 || TREE_CODE (expr) == COMPOUND_EXPR)
3085 expr = TREE_OPERAND (expr, 1);
3086 error ("cannot apply %<offsetof%> to member function %qD", expr);
3087 return error_mark_node;
3089 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3090 expr = TREE_OPERAND (expr, 0);
3091 return fold_offsetof (expr, NULL_TREE);
3094 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3095 function is broken out from the above for the benefit of the tree-ssa
3099 simplify_aggr_init_expr (tree *tp)
3101 tree aggr_init_expr = *tp;
3103 /* Form an appropriate CALL_EXPR. */
3104 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3105 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3106 tree type = TREE_TYPE (slot);
3109 enum style_t { ctor, arg, pcc } style;
3111 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3113 #ifdef PCC_STATIC_STRUCT_RETURN
3119 gcc_assert (TREE_ADDRESSABLE (type));
3123 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3125 aggr_init_expr_nargs (aggr_init_expr),
3126 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3130 /* Replace the first argument to the ctor with the address of the
3132 cxx_mark_addressable (slot);
3133 CALL_EXPR_ARG (call_expr, 0) =
3134 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3136 else if (style == arg)
3138 /* Just mark it addressable here, and leave the rest to
3139 expand_call{,_inline}. */
3140 cxx_mark_addressable (slot);
3141 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3142 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3144 else if (style == pcc)
3146 /* If we're using the non-reentrant PCC calling convention, then we
3147 need to copy the returned value out of the static buffer into the
3149 push_deferring_access_checks (dk_no_check);
3150 call_expr = build_aggr_init (slot, call_expr,
3151 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3152 tf_warning_or_error);
3153 pop_deferring_access_checks ();
3154 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3157 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3159 tree init = build_zero_init (type, NULL_TREE,
3160 /*static_storage_p=*/false);
3161 init = build2 (INIT_EXPR, void_type_node, slot, init);
3162 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3169 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3172 emit_associated_thunks (tree fn)
3174 /* When we use vcall offsets, we emit thunks with the virtual
3175 functions to which they thunk. The whole point of vcall offsets
3176 is so that you can know statically the entire set of thunks that
3177 will ever be needed for a given virtual function, thereby
3178 enabling you to output all the thunks with the function itself. */
3179 if (DECL_VIRTUAL_P (fn))
3183 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3185 if (!THUNK_ALIAS (thunk))
3187 use_thunk (thunk, /*emit_p=*/1);
3188 if (DECL_RESULT_THUNK_P (thunk))
3192 for (probe = DECL_THUNKS (thunk);
3193 probe; probe = TREE_CHAIN (probe))
3194 use_thunk (probe, /*emit_p=*/1);
3198 gcc_assert (!DECL_THUNKS (thunk));
3203 /* Generate RTL for FN. */
3206 expand_or_defer_fn (tree fn)
3208 /* When the parser calls us after finishing the body of a template
3209 function, we don't really want to expand the body. */
3210 if (processing_template_decl)
3212 /* Normally, collection only occurs in rest_of_compilation. So,
3213 if we don't collect here, we never collect junk generated
3214 during the processing of templates until we hit a
3215 non-template function. It's not safe to do this inside a
3216 nested class, though, as the parser may have local state that
3217 is not a GC root. */
3218 if (!function_depth)
3223 gcc_assert (gimple_body (fn));
3225 /* If this is a constructor or destructor body, we have to clone
3227 if (maybe_clone_body (fn))
3229 /* We don't want to process FN again, so pretend we've written
3230 it out, even though we haven't. */
3231 TREE_ASM_WRITTEN (fn) = 1;
3235 /* We make a decision about linkage for these functions at the end
3236 of the compilation. Until that point, we do not want the back
3237 end to output them -- but we do want it to see the bodies of
3238 these functions so that it can inline them as appropriate. */
3239 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3241 if (DECL_INTERFACE_KNOWN (fn))
3242 /* We've already made a decision as to how this function will
3246 DECL_EXTERNAL (fn) = 1;
3247 DECL_NOT_REALLY_EXTERN (fn) = 1;
3248 note_vague_linkage_fn (fn);
3249 /* A non-template inline function with external linkage will
3250 always be COMDAT. As we must eventually determine the
3251 linkage of all functions, and as that causes writes to
3252 the data mapped in from the PCH file, it's advantageous
3253 to mark the functions at this point. */
3254 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3256 /* This function must have external linkage, as
3257 otherwise DECL_INTERFACE_KNOWN would have been
3259 gcc_assert (TREE_PUBLIC (fn));
3260 comdat_linkage (fn);
3261 DECL_INTERFACE_KNOWN (fn) = 1;
3265 import_export_decl (fn);
3267 /* If the user wants us to keep all inline functions, then mark
3268 this function as needed so that finish_file will make sure to
3270 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3274 /* There's no reason to do any of the work here if we're only doing
3275 semantic analysis; this code just generates RTL. */
3276 if (flag_syntax_only)
3281 /* Expand or defer, at the whim of the compilation unit manager. */
3282 cgraph_finalize_function (fn, function_depth > 1);
3294 /* Helper function for walk_tree, used by finalize_nrv below. */
3297 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3299 struct nrv_data *dp = (struct nrv_data *)data;
3302 /* No need to walk into types. There wouldn't be any need to walk into
3303 non-statements, except that we have to consider STMT_EXPRs. */
3306 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3307 but differs from using NULL_TREE in that it indicates that we care
3308 about the value of the RESULT_DECL. */
3309 else if (TREE_CODE (*tp) == RETURN_EXPR)
3310 TREE_OPERAND (*tp, 0) = dp->result;
3311 /* Change all cleanups for the NRV to only run when an exception is
3313 else if (TREE_CODE (*tp) == CLEANUP_STMT
3314 && CLEANUP_DECL (*tp) == dp->var)
3315 CLEANUP_EH_ONLY (*tp) = 1;
3316 /* Replace the DECL_EXPR for the NRV with an initialization of the
3317 RESULT_DECL, if needed. */
3318 else if (TREE_CODE (*tp) == DECL_EXPR
3319 && DECL_EXPR_DECL (*tp) == dp->var)
3322 if (DECL_INITIAL (dp->var)
3323 && DECL_INITIAL (dp->var) != error_mark_node)
3324 init = build2 (INIT_EXPR, void_type_node, dp->result,
3325 DECL_INITIAL (dp->var));
3327 init = build_empty_stmt ();
3328 DECL_INITIAL (dp->var) = NULL_TREE;
3329 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3332 /* And replace all uses of the NRV with the RESULT_DECL. */
3333 else if (*tp == dp->var)
3336 /* Avoid walking into the same tree more than once. Unfortunately, we
3337 can't just use walk_tree_without duplicates because it would only call
3338 us for the first occurrence of dp->var in the function body. */
3339 slot = htab_find_slot (dp->visited, *tp, INSERT);
3345 /* Keep iterating. */
3349 /* Called from finish_function to implement the named return value
3350 optimization by overriding all the RETURN_EXPRs and pertinent
3351 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3352 RESULT_DECL for the function. */
3355 finalize_nrv (tree *tp, tree var, tree result)
3357 struct nrv_data data;
3359 /* Copy debugging information from VAR to RESULT. */
3360 DECL_NAME (result) = DECL_NAME (var);
3361 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3362 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3363 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3364 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3365 /* Don't forget that we take its address. */
3366 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3369 data.result = result;
3370 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3371 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3372 htab_delete (data.visited);
3375 /* Return the declaration for the function called by CALL_EXPR T,
3376 TYPE is the class type of the clause decl. */
3379 omp_clause_info_fndecl (tree t, tree type)
3381 tree ret = get_callee_fndecl (t);
3386 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3387 t = CALL_EXPR_FN (t);
3389 if (TREE_CODE (t) == OBJ_TYPE_REF)
3391 t = cp_fold_obj_type_ref (t, type);
3392 if (TREE_CODE (t) == ADDR_EXPR
3393 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3394 return TREE_OPERAND (t, 0);
3400 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3403 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3404 bool need_copy_ctor, bool need_copy_assignment)
3406 int save_errorcount = errorcount;
3409 /* Always allocate 3 elements for simplicity. These are the
3410 function decls for the ctor, dtor, and assignment op.
3411 This layout is known to the three lang hooks,
3412 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3413 and cxx_omp_clause_assign_op. */
3414 info = make_tree_vec (3);
3415 CP_OMP_CLAUSE_INFO (c) = info;
3417 if (need_default_ctor
3418 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3420 if (need_default_ctor)
3424 t = build_int_cst (build_pointer_type (type), 0);
3425 t = build1 (INDIRECT_REF, type, t);
3426 t = build_tree_list (NULL, t);
3428 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3429 t, type, LOOKUP_NORMAL,
3430 tf_warning_or_error);
3432 if (targetm.cxx.cdtor_returns_this () || errorcount)
3433 /* Because constructors and destructors return this,
3434 the call will have been cast to "void". Remove the
3435 cast here. We would like to use STRIP_NOPS, but it
3436 wouldn't work here because TYPE_MODE (t) and
3437 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3438 They are VOIDmode and Pmode, respectively. */
3439 if (TREE_CODE (t) == NOP_EXPR)
3440 t = TREE_OPERAND (t, 0);
3442 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3445 if ((need_default_ctor || need_copy_ctor)
3446 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (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, complete_dtor_identifier,
3451 NULL, type, LOOKUP_NORMAL,
3452 tf_warning_or_error);
3454 if (targetm.cxx.cdtor_returns_this () || errorcount)
3455 /* Because constructors and destructors return this,
3456 the call will have been cast to "void". Remove the
3457 cast here. We would like to use STRIP_NOPS, but it
3458 wouldn't work here because TYPE_MODE (t) and
3459 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3460 They are VOIDmode and Pmode, respectively. */
3461 if (TREE_CODE (t) == NOP_EXPR)
3462 t = TREE_OPERAND (t, 0);
3464 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3467 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3469 t = build_int_cst (build_pointer_type (type), 0);
3470 t = build1 (INDIRECT_REF, type, t);
3471 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3472 build_tree_list (NULL, t),
3473 type, LOOKUP_NORMAL,
3474 tf_warning_or_error);
3476 /* We'll have called convert_from_reference on the call, which
3477 may well have added an indirect_ref. It's unneeded here,
3478 and in the way, so kill it. */
3479 if (TREE_CODE (t) == INDIRECT_REF)
3480 t = TREE_OPERAND (t, 0);
3482 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3485 return errorcount != save_errorcount;
3488 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3489 Remove any elements from the list that are invalid. */
3492 finish_omp_clauses (tree clauses)
3494 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3495 tree c, t, *pc = &clauses;
3498 bitmap_obstack_initialize (NULL);
3499 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3500 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3501 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3503 for (pc = &clauses, c = clauses; c ; c = *pc)
3505 bool remove = false;
3507 switch (OMP_CLAUSE_CODE (c))
3509 case OMP_CLAUSE_SHARED:
3511 goto check_dup_generic;
3512 case OMP_CLAUSE_PRIVATE:
3514 goto check_dup_generic;
3515 case OMP_CLAUSE_REDUCTION:
3517 goto check_dup_generic;
3518 case OMP_CLAUSE_COPYPRIVATE:
3519 name = "copyprivate";
3520 goto check_dup_generic;
3521 case OMP_CLAUSE_COPYIN:
3523 goto check_dup_generic;
3525 t = OMP_CLAUSE_DECL (c);
3526 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3528 if (processing_template_decl)
3531 error ("%qD is not a variable in clause %qs", t, name);
3533 error ("%qE is not a variable in clause %qs", t, name);
3536 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3537 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3538 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3540 error ("%qD appears more than once in data clauses", t);
3544 bitmap_set_bit (&generic_head, DECL_UID (t));
3547 case OMP_CLAUSE_FIRSTPRIVATE:
3548 t = OMP_CLAUSE_DECL (c);
3549 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3551 if (processing_template_decl)
3554 error ("%qD is not a variable in clause %<firstprivate%>", t);
3556 error ("%qE is not a variable in clause %<firstprivate%>", t);
3559 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3560 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3562 error ("%qD appears more than once in data clauses", t);
3566 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3569 case OMP_CLAUSE_LASTPRIVATE:
3570 t = OMP_CLAUSE_DECL (c);
3571 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3573 if (processing_template_decl)
3576 error ("%qD is not a variable in clause %<lastprivate%>", t);
3578 error ("%qE is not a variable in clause %<lastprivate%>", t);
3581 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3582 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3584 error ("%qD appears more than once in data clauses", t);
3588 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3592 t = OMP_CLAUSE_IF_EXPR (c);
3593 t = maybe_convert_cond (t);
3594 if (t == error_mark_node)
3596 OMP_CLAUSE_IF_EXPR (c) = t;
3599 case OMP_CLAUSE_NUM_THREADS:
3600 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3601 if (t == error_mark_node)
3603 else if (!type_dependent_expression_p (t)
3604 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3606 error ("num_threads expression must be integral");
3611 case OMP_CLAUSE_SCHEDULE:
3612 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3615 else if (t == error_mark_node)
3617 else if (!type_dependent_expression_p (t)
3618 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3620 error ("schedule chunk size expression must be integral");
3625 case OMP_CLAUSE_NOWAIT:
3626 case OMP_CLAUSE_ORDERED:
3627 case OMP_CLAUSE_DEFAULT:
3628 case OMP_CLAUSE_UNTIED:
3629 case OMP_CLAUSE_COLLAPSE:
3637 *pc = OMP_CLAUSE_CHAIN (c);
3639 pc = &OMP_CLAUSE_CHAIN (c);
3642 for (pc = &clauses, c = clauses; c ; c = *pc)
3644 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3645 bool remove = false;
3646 bool need_complete_non_reference = false;
3647 bool need_default_ctor = false;
3648 bool need_copy_ctor = false;
3649 bool need_copy_assignment = false;
3650 bool need_implicitly_determined = false;
3651 tree type, inner_type;
3655 case OMP_CLAUSE_SHARED:
3657 need_implicitly_determined = true;
3659 case OMP_CLAUSE_PRIVATE:
3661 need_complete_non_reference = true;
3662 need_default_ctor = true;
3663 need_implicitly_determined = true;
3665 case OMP_CLAUSE_FIRSTPRIVATE:
3666 name = "firstprivate";
3667 need_complete_non_reference = true;
3668 need_copy_ctor = true;
3669 need_implicitly_determined = true;
3671 case OMP_CLAUSE_LASTPRIVATE:
3672 name = "lastprivate";
3673 need_complete_non_reference = true;
3674 need_copy_assignment = true;
3675 need_implicitly_determined = true;
3677 case OMP_CLAUSE_REDUCTION:
3679 need_implicitly_determined = true;
3681 case OMP_CLAUSE_COPYPRIVATE:
3682 name = "copyprivate";
3683 need_copy_assignment = true;
3685 case OMP_CLAUSE_COPYIN:
3687 need_copy_assignment = true;
3690 pc = &OMP_CLAUSE_CHAIN (c);
3694 t = OMP_CLAUSE_DECL (c);
3695 if (processing_template_decl
3696 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3698 pc = &OMP_CLAUSE_CHAIN (c);
3704 case OMP_CLAUSE_LASTPRIVATE:
3705 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3706 need_default_ctor = true;
3709 case OMP_CLAUSE_REDUCTION:
3710 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3711 || POINTER_TYPE_P (TREE_TYPE (t)))
3713 error ("%qE has invalid type for %<reduction%>", t);
3716 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3718 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3726 error ("%qE has invalid type for %<reduction(%s)%>",
3727 t, operator_name_info[r_code].name);
3733 case OMP_CLAUSE_COPYIN:
3734 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3736 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3745 if (need_complete_non_reference)
3747 t = require_complete_type (t);
3748 if (t == error_mark_node)
3750 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3752 error ("%qE has reference type for %qs", t, name);
3756 if (need_implicitly_determined)
3758 const char *share_name = NULL;
3760 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3761 share_name = "threadprivate";
3762 else switch (cxx_omp_predetermined_sharing (t))
3764 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3766 case OMP_CLAUSE_DEFAULT_SHARED:
3767 share_name = "shared";
3769 case OMP_CLAUSE_DEFAULT_PRIVATE:
3770 share_name = "private";
3777 error ("%qE is predetermined %qs for %qs",
3778 t, share_name, name);
3783 /* We're interested in the base element, not arrays. */
3784 inner_type = type = TREE_TYPE (t);
3785 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3786 inner_type = TREE_TYPE (inner_type);
3788 /* Check for special function availability by building a call to one.
3789 Save the results, because later we won't be in the right context
3790 for making these queries. */
3791 if (CLASS_TYPE_P (inner_type)
3792 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3793 && !type_dependent_expression_p (t)
3794 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3795 need_copy_ctor, need_copy_assignment))
3799 *pc = OMP_CLAUSE_CHAIN (c);
3801 pc = &OMP_CLAUSE_CHAIN (c);
3804 bitmap_obstack_release (NULL);
3808 /* For all variables in the tree_list VARS, mark them as thread local. */
3811 finish_omp_threadprivate (tree vars)
3815 /* Mark every variable in VARS to be assigned thread local storage. */
3816 for (t = vars; t; t = TREE_CHAIN (t))
3818 tree v = TREE_PURPOSE (t);
3820 if (error_operand_p (v))
3822 else if (TREE_CODE (v) != VAR_DECL)
3823 error ("%<threadprivate%> %qD is not file, namespace "
3824 "or block scope variable", v);
3825 /* If V had already been marked threadprivate, it doesn't matter
3826 whether it had been used prior to this point. */
3827 else if (TREE_USED (v)
3828 && (DECL_LANG_SPECIFIC (v) == NULL
3829 || !CP_DECL_THREADPRIVATE_P (v)))
3830 error ("%qE declared %<threadprivate%> after first use", v);
3831 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3832 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3833 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3834 error ("%<threadprivate%> %qE has incomplete type", v);
3835 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3836 && CP_DECL_CONTEXT (v) != current_class_type)
3837 error ("%<threadprivate%> %qE directive not "
3838 "in %qT definition", v, CP_DECL_CONTEXT (v));
3841 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3842 if (DECL_LANG_SPECIFIC (v) == NULL)
3844 retrofit_lang_decl (v);
3846 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3847 after the allocation of the lang_decl structure. */
3848 if (DECL_DISCRIMINATOR_P (v))
3849 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3852 if (! DECL_THREAD_LOCAL_P (v))
3854 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3855 /* If rtl has been already set for this var, call
3856 make_decl_rtl once again, so that encode_section_info
3857 has a chance to look at the new decl flags. */
3858 if (DECL_RTL_SET_P (v))
3861 CP_DECL_THREADPRIVATE_P (v) = 1;
3866 /* Build an OpenMP structured block. */
3869 begin_omp_structured_block (void)
3871 return do_pushlevel (sk_omp);
3875 finish_omp_structured_block (tree block)
3877 return do_poplevel (block);
3880 /* Similarly, except force the retention of the BLOCK. */
3883 begin_omp_parallel (void)
3885 keep_next_level (true);
3886 return begin_omp_structured_block ();
3890 finish_omp_parallel (tree clauses, tree body)
3894 body = finish_omp_structured_block (body);
3896 stmt = make_node (OMP_PARALLEL);
3897 TREE_TYPE (stmt) = void_type_node;
3898 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3899 OMP_PARALLEL_BODY (stmt) = body;
3901 return add_stmt (stmt);
3905 begin_omp_task (void)
3907 keep_next_level (true);
3908 return begin_omp_structured_block ();
3912 finish_omp_task (tree clauses, tree body)
3916 body = finish_omp_structured_block (body);
3918 stmt = make_node (OMP_TASK);
3919 TREE_TYPE (stmt) = void_type_node;
3920 OMP_TASK_CLAUSES (stmt) = clauses;
3921 OMP_TASK_BODY (stmt) = body;
3923 return add_stmt (stmt);
3926 /* Helper function for finish_omp_for. Convert Ith random access iterator
3927 into integral iterator. Return FALSE if successful. */
3930 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3931 tree condv, tree incrv, tree *body,
3932 tree *pre_body, tree clauses)
3934 tree diff, iter_init, iter_incr = NULL, last;
3935 tree incr_var = NULL, orig_pre_body, orig_body, c;
3936 tree decl = TREE_VEC_ELT (declv, i);
3937 tree init = TREE_VEC_ELT (initv, i);
3938 tree cond = TREE_VEC_ELT (condv, i);
3939 tree incr = TREE_VEC_ELT (incrv, i);
3941 location_t elocus = locus;
3943 if (init && EXPR_HAS_LOCATION (init))
3944 elocus = EXPR_LOCATION (init);
3946 switch (TREE_CODE (cond))
3952 if (TREE_OPERAND (cond, 1) == iter)
3953 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
3954 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
3955 if (TREE_OPERAND (cond, 0) != iter)
3956 cond = error_mark_node;
3959 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3960 TREE_OPERAND (cond, 1), ERROR_MARK,
3961 NULL, tf_warning_or_error);
3962 if (error_operand_p (tem))
3967 cond = error_mark_node;
3970 if (cond == error_mark_node)
3972 error ("%Hinvalid controlling predicate", &elocus);
3975 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
3976 ERROR_MARK, iter, ERROR_MARK, NULL,
3977 tf_warning_or_error);
3978 if (error_operand_p (diff))
3980 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
3982 error ("%Hdifference between %qE and %qD does not have integer type",
3983 &elocus, TREE_OPERAND (cond, 1), iter);
3987 switch (TREE_CODE (incr))
3989 case PREINCREMENT_EXPR:
3990 case PREDECREMENT_EXPR:
3991 case POSTINCREMENT_EXPR:
3992 case POSTDECREMENT_EXPR:
3993 if (TREE_OPERAND (incr, 0) != iter)
3995 incr = error_mark_node;
3998 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
3999 tf_warning_or_error);
4000 if (error_operand_p (iter_incr))
4002 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4003 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4004 incr = integer_one_node;
4006 incr = integer_minus_one_node;
4009 if (TREE_OPERAND (incr, 0) != iter)
4010 incr = error_mark_node;
4011 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4012 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4014 tree rhs = TREE_OPERAND (incr, 1);
4015 if (TREE_OPERAND (rhs, 0) == iter)
4017 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4019 incr = error_mark_node;
4022 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4023 TREE_OPERAND (rhs, 1),
4024 tf_warning_or_error);
4025 if (error_operand_p (iter_incr))
4027 incr = TREE_OPERAND (rhs, 1);
4028 incr = cp_convert (TREE_TYPE (diff), incr);
4029 if (TREE_CODE (rhs) == MINUS_EXPR)
4031 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4032 incr = fold_if_not_in_template (incr);
4034 if (TREE_CODE (incr) != INTEGER_CST
4035 && (TREE_CODE (incr) != NOP_EXPR
4036 || (TREE_CODE (TREE_OPERAND (incr, 0))
4041 else if (TREE_OPERAND (rhs, 1) == iter)
4043 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4044 || TREE_CODE (rhs) != PLUS_EXPR)
4045 incr = error_mark_node;
4048 iter_incr = build_x_binary_op (PLUS_EXPR,
4049 TREE_OPERAND (rhs, 0),
4052 tf_warning_or_error);
4053 if (error_operand_p (iter_incr))
4055 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4057 tf_warning_or_error);
4058 if (error_operand_p (iter_incr))
4060 incr = TREE_OPERAND (rhs, 0);
4065 incr = error_mark_node;
4068 incr = error_mark_node;
4071 incr = error_mark_node;
4075 if (incr == error_mark_node)
4077 error ("%Hinvalid increment expression", &elocus);
4081 incr = cp_convert (TREE_TYPE (diff), incr);
4082 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4083 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4084 && OMP_CLAUSE_DECL (c) == iter)
4087 decl = create_temporary_var (TREE_TYPE (diff));
4089 add_decl_expr (decl);
4090 last = create_temporary_var (TREE_TYPE (diff));
4092 add_decl_expr (last);
4093 if (c && iter_incr == NULL)
4095 incr_var = create_temporary_var (TREE_TYPE (diff));
4096 pushdecl (incr_var);
4097 add_decl_expr (incr_var);
4099 gcc_assert (stmts_are_full_exprs_p ());
4101 orig_pre_body = *pre_body;
4102 *pre_body = push_stmt_list ();
4104 add_stmt (orig_pre_body);
4106 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4107 tf_warning_or_error));
4108 init = build_int_cst (TREE_TYPE (diff), 0);
4109 if (c && iter_incr == NULL)
4111 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4112 incr, tf_warning_or_error));
4114 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4115 tf_warning_or_error);
4117 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4118 tf_warning_or_error));
4119 *pre_body = pop_stmt_list (*pre_body);
4121 cond = cp_build_binary_op (elocus,
4122 TREE_CODE (cond), decl, diff,
4123 tf_warning_or_error);
4124 incr = build_modify_expr (elocus, decl, PLUS_EXPR, incr);
4127 *body = push_stmt_list ();
4128 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4129 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4130 tf_warning_or_error);
4131 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4132 finish_expr_stmt (iter_init);
4133 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4134 tf_warning_or_error));
4135 add_stmt (orig_body);
4136 *body = pop_stmt_list (*body);
4140 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4141 finish_expr_stmt (iter_incr);
4142 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4143 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4146 TREE_VEC_ELT (declv, i) = decl;
4147 TREE_VEC_ELT (initv, i) = init;
4148 TREE_VEC_ELT (condv, i) = cond;
4149 TREE_VEC_ELT (incrv, i) = incr;
4154 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4155 are directly for their associated operands in the statement. DECL
4156 and INIT are a combo; if DECL is NULL then INIT ought to be a
4157 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4158 optional statements that need to go before the loop into its
4162 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4163 tree incrv, tree body, tree pre_body, tree clauses)
4165 tree omp_for = NULL, orig_incr = NULL;
4166 tree decl, init, cond, incr;
4170 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4171 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4172 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4173 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4175 decl = TREE_VEC_ELT (declv, i);
4176 init = TREE_VEC_ELT (initv, i);
4177 cond = TREE_VEC_ELT (condv, i);
4178 incr = TREE_VEC_ELT (incrv, i);
4184 switch (TREE_CODE (init))
4187 decl = TREE_OPERAND (init, 0);
4188 init = TREE_OPERAND (init, 1);
4191 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4193 decl = TREE_OPERAND (init, 0);
4194 init = TREE_OPERAND (init, 2);
4203 error ("%Hexpected iteration declaration or initialization",
4209 if (init && EXPR_HAS_LOCATION (init))
4210 elocus = EXPR_LOCATION (init);
4214 error ("%Hmissing controlling predicate", &elocus);
4220 error ("%Hmissing increment expression", &elocus);
4224 TREE_VEC_ELT (declv, i) = decl;
4225 TREE_VEC_ELT (initv, i) = init;
4228 if (dependent_omp_for_p (declv, initv, condv, incrv))
4232 stmt = make_node (OMP_FOR);
4234 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4236 /* This is really just a place-holder. We'll be decomposing this
4237 again and going through the cp_build_modify_expr path below when
4238 we instantiate the thing. */
4239 TREE_VEC_ELT (initv, i)
4240 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4241 TREE_VEC_ELT (initv, i));
4244 TREE_TYPE (stmt) = void_type_node;
4245 OMP_FOR_INIT (stmt) = initv;
4246 OMP_FOR_COND (stmt) = condv;
4247 OMP_FOR_INCR (stmt) = incrv;
4248 OMP_FOR_BODY (stmt) = body;
4249 OMP_FOR_PRE_BODY (stmt) = pre_body;
4250 OMP_FOR_CLAUSES (stmt) = clauses;
4252 SET_EXPR_LOCATION (stmt, locus);
4253 return add_stmt (stmt);
4256 if (processing_template_decl)
4257 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4259 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4261 decl = TREE_VEC_ELT (declv, i);
4262 init = TREE_VEC_ELT (initv, i);
4263 cond = TREE_VEC_ELT (condv, i);
4264 incr = TREE_VEC_ELT (incrv, i);
4266 TREE_VEC_ELT (orig_incr, i) = incr;
4269 if (init && EXPR_HAS_LOCATION (init))
4270 elocus = EXPR_LOCATION (init);
4274 error ("%Hexpected iteration declaration or initialization",
4279 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4282 TREE_VEC_ELT (orig_incr, i) = incr;
4283 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4284 TREE_CODE (TREE_OPERAND (incr, 1)),
4285 TREE_OPERAND (incr, 2),
4286 tf_warning_or_error);
4289 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4291 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4292 incrv, &body, &pre_body, clauses))
4297 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4298 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4300 error ("%Hinvalid type for iteration variable %qE", &elocus, decl);
4304 if (!processing_template_decl)
4306 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4307 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4310 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4312 && TREE_SIDE_EFFECTS (cond)
4313 && COMPARISON_CLASS_P (cond)
4314 && !processing_template_decl)
4316 tree t = TREE_OPERAND (cond, 0);
4317 if (TREE_SIDE_EFFECTS (t)
4319 && (TREE_CODE (t) != NOP_EXPR
4320 || TREE_OPERAND (t, 0) != decl))
4321 TREE_OPERAND (cond, 0)
4322 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4324 t = TREE_OPERAND (cond, 1);
4325 if (TREE_SIDE_EFFECTS (t)
4327 && (TREE_CODE (t) != NOP_EXPR
4328 || TREE_OPERAND (t, 0) != decl))
4329 TREE_OPERAND (cond, 1)
4330 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4332 if (decl == error_mark_node || init == error_mark_node)
4335 TREE_VEC_ELT (declv, i) = decl;
4336 TREE_VEC_ELT (initv, i) = init;
4337 TREE_VEC_ELT (condv, i) = cond;
4338 TREE_VEC_ELT (incrv, i) = incr;
4342 if (IS_EMPTY_STMT (pre_body))
4345 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4348 if (omp_for == NULL)
4351 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4353 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4354 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4356 if (TREE_CODE (incr) != MODIFY_EXPR)
4359 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4360 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4361 && !processing_template_decl)
4363 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4364 if (TREE_SIDE_EFFECTS (t)
4366 && (TREE_CODE (t) != NOP_EXPR
4367 || TREE_OPERAND (t, 0) != decl))
4368 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4369 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4371 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4372 if (TREE_SIDE_EFFECTS (t)
4374 && (TREE_CODE (t) != NOP_EXPR
4375 || TREE_OPERAND (t, 0) != decl))
4376 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4377 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4381 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4383 if (omp_for != NULL)
4384 OMP_FOR_CLAUSES (omp_for) = clauses;
4389 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4398 dependent_p = false;
4401 /* Even in a template, we can detect invalid uses of the atomic
4402 pragma if neither LHS nor RHS is type-dependent. */
4403 if (processing_template_decl)
4405 dependent_p = (type_dependent_expression_p (lhs)
4406 || type_dependent_expression_p (rhs));
4409 lhs = build_non_dependent_expr (lhs);
4410 rhs = build_non_dependent_expr (rhs);
4415 stmt = c_finish_omp_atomic (code, lhs, rhs);
4416 if (stmt == error_mark_node)
4419 if (processing_template_decl)
4420 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4421 build2 (code, void_type_node, orig_lhs, orig_rhs));
4426 finish_omp_barrier (void)
4428 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4429 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4430 finish_expr_stmt (stmt);
4434 finish_omp_flush (void)
4436 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4437 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4438 finish_expr_stmt (stmt);
4442 finish_omp_taskwait (void)
4444 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4445 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4446 finish_expr_stmt (stmt);
4450 init_cp_semantics (void)
4454 /* Build a STATIC_ASSERT for a static assertion with the condition
4455 CONDITION and the message text MESSAGE. LOCATION is the location
4456 of the static assertion in the source code. When MEMBER_P, this
4457 static assertion is a member of a class. */
4459 finish_static_assert (tree condition, tree message, location_t location,
4462 if (check_for_bare_parameter_packs (condition))
4463 condition = error_mark_node;
4465 if (type_dependent_expression_p (condition)
4466 || value_dependent_expression_p (condition))
4468 /* We're in a template; build a STATIC_ASSERT and put it in
4472 assertion = make_node (STATIC_ASSERT);
4473 STATIC_ASSERT_CONDITION (assertion) = condition;
4474 STATIC_ASSERT_MESSAGE (assertion) = message;
4475 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4478 maybe_add_class_template_decl_list (current_class_type,
4482 add_stmt (assertion);
4487 /* Fold the expression and convert it to a boolean value. */
4488 condition = fold_non_dependent_expr (condition);
4489 condition = cp_convert (boolean_type_node, condition);
4491 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4492 /* Do nothing; the condition is satisfied. */
4496 location_t saved_loc = input_location;
4498 input_location = location;
4499 if (TREE_CODE (condition) == INTEGER_CST
4500 && integer_zerop (condition))
4501 /* Report the error. */
4502 error ("static assertion failed: %E", message);
4503 else if (condition && condition != error_mark_node)
4504 error ("non-constant condition for static assertion");
4505 input_location = saved_loc;
4509 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4510 just return the type even though EXPR is a type-dependent expression.
4511 The ABI specifies which cases this applies to, which is a subset of the
4515 describable_type (tree expr)
4517 tree type = NULL_TREE;
4519 /* processing_template_decl isn't set when we're called from the mangling
4520 code, so bump it now. */
4521 ++processing_template_decl;
4522 if (! type_dependent_expression_p (expr)
4523 && ! type_unknown_p (expr))
4525 type = TREE_TYPE (expr);
4526 if (real_lvalue_p (expr))
4527 type = build_reference_type (type);
4529 --processing_template_decl;
4534 switch (TREE_CODE (expr))
4540 /* Named rvalue reference becomes lvalue. */
4541 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4546 case TEMPLATE_PARM_INDEX:
4548 case STATIC_CAST_EXPR:
4549 case REINTERPRET_CAST_EXPR:
4550 case CONST_CAST_EXPR:
4551 case DYNAMIC_CAST_EXPR:
4552 type = TREE_TYPE (expr);
4557 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4558 if (ptrtype && POINTER_TYPE_P (ptrtype))
4559 type = build_reference_type (TREE_TYPE (ptrtype));
4564 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4565 type = TREE_TYPE (expr);
4569 if (type && type_uses_auto (type))
4575 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4576 suitable for use as a type-specifier.
4578 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4579 id-expression or a class member access, FALSE when it was parsed as
4580 a full expression. */
4583 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4585 tree orig_expr = expr;
4586 tree type = NULL_TREE;
4588 if (!expr || error_operand_p (expr))
4589 return error_mark_node;
4592 || TREE_CODE (expr) == TYPE_DECL
4593 || (TREE_CODE (expr) == BIT_NOT_EXPR
4594 && TYPE_P (TREE_OPERAND (expr, 0))))
4596 error ("argument to decltype must be an expression");
4597 return error_mark_node;
4600 if (type_dependent_expression_p (expr))
4602 if (id_expression_or_member_access_p)
4604 switch (TREE_CODE (expr))
4611 case TEMPLATE_PARM_INDEX:
4612 type = TREE_TYPE (expr);
4620 if (type && !type_uses_auto (type))
4623 type = cxx_make_type (DECLTYPE_TYPE);
4624 DECLTYPE_TYPE_EXPR (type) = expr;
4625 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4626 = id_expression_or_member_access_p;
4627 SET_TYPE_STRUCTURAL_EQUALITY (type);
4632 /* The type denoted by decltype(e) is defined as follows: */
4634 if (id_expression_or_member_access_p)
4636 /* If e is an id-expression or a class member access (5.2.5
4637 [expr.ref]), decltype(e) is defined as the type of the entity
4638 named by e. If there is no such entity, or e names a set of
4639 overloaded functions, the program is ill-formed. */
4640 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4641 expr = lookup_name (expr);
4643 if (TREE_CODE (expr) == INDIRECT_REF)
4644 /* This can happen when the expression is, e.g., "a.b". Just
4645 look at the underlying operand. */
4646 expr = TREE_OPERAND (expr, 0);
4648 if (TREE_CODE (expr) == OFFSET_REF
4649 || TREE_CODE (expr) == MEMBER_REF)
4650 /* We're only interested in the field itself. If it is a
4651 BASELINK, we will need to see through it in the next
4653 expr = TREE_OPERAND (expr, 1);
4655 if (TREE_CODE (expr) == BASELINK)
4656 /* See through BASELINK nodes to the underlying functions. */
4657 expr = BASELINK_FUNCTIONS (expr);
4659 if (TREE_CODE (expr) == OVERLOAD)
4661 if (OVL_CHAIN (expr))
4663 error ("%qE refers to a set of overloaded functions", orig_expr);
4664 return error_mark_node;
4667 /* An overload set containing only one function: just look
4668 at that function. */
4669 expr = OVL_FUNCTION (expr);
4672 switch (TREE_CODE (expr))
4675 if (DECL_BIT_FIELD_TYPE (expr))
4677 type = DECL_BIT_FIELD_TYPE (expr);
4680 /* Fall through for fields that aren't bitfields. */
4687 case TEMPLATE_PARM_INDEX:
4688 type = TREE_TYPE (expr);
4692 type = error_mark_node;
4696 type = is_bitfield_expr_with_lowered_type (expr);
4698 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4705 /* We can get here when the id-expression refers to an
4707 type = TREE_TYPE (expr);
4711 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4712 || TREE_CODE (expr) == SCOPE_REF);
4713 error ("argument to decltype must be an expression");
4714 return error_mark_node;
4719 /* Expressions of reference type are sometimes wrapped in
4720 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4721 representation, not part of the language, so we have to look
4723 if (TREE_CODE (expr) == INDIRECT_REF
4724 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4726 expr = TREE_OPERAND (expr, 0);
4728 if (TREE_CODE (expr) == CALL_EXPR)
4730 /* If e is a function call (5.2.2 [expr.call]) or an
4731 invocation of an overloaded operator (parentheses around e
4732 are ignored), decltype(e) is defined as the return type of
4734 tree fndecl = get_callee_fndecl (expr);
4735 if (fndecl && fndecl != error_mark_node)
4736 type = TREE_TYPE (TREE_TYPE (fndecl));
4739 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4740 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4741 || TREE_CODE (target_type) == POINTER_TYPE)
4742 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4743 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4744 type = TREE_TYPE (TREE_TYPE (target_type));
4746 sorry ("unable to determine the declared type of expression %<%E%>",
4752 type = is_bitfield_expr_with_lowered_type (expr);
4755 /* Bitfields are special, because their type encodes the
4756 number of bits they store. If the expression referenced a
4757 bitfield, TYPE now has the declared type of that
4759 type = cp_build_qualified_type (type,
4760 cp_type_quals (TREE_TYPE (expr)));
4762 if (real_lvalue_p (expr))
4763 type = build_reference_type (type);
4767 /* Otherwise, where T is the type of e, if e is an lvalue,
4768 decltype(e) is defined as T&, otherwise decltype(e) is
4770 type = TREE_TYPE (expr);
4771 if (type == error_mark_node)
4772 return error_mark_node;
4773 else if (expr == current_class_ptr)
4774 /* If the expression is just "this", we want the
4775 cv-unqualified pointer for the "this" type. */
4776 type = TYPE_MAIN_VARIANT (type);
4777 else if (real_lvalue_p (expr))
4779 if (TREE_CODE (type) != REFERENCE_TYPE)
4780 type = build_reference_type (type);
4783 type = non_reference (type);
4788 if (!type || type == unknown_type_node)
4790 error ("type of %qE is unknown", expr);
4791 return error_mark_node;
4797 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4798 __has_nothrow_copy, depending on assign_p. */
4801 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4808 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4811 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4813 else if (TYPE_HAS_INIT_REF (type))
4815 /* If construction of the copy constructor was postponed, create
4817 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4818 lazily_declare_fn (sfk_copy_constructor, type);
4819 fns = CLASSTYPE_CONSTRUCTORS (type);
4824 for (; fns; fns = OVL_NEXT (fns))
4826 tree fn = OVL_CURRENT (fns);
4830 if (copy_fn_p (fn) == 0)
4833 else if (copy_fn_p (fn) <= 0)
4836 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4843 /* Actually evaluates the trait. */
4846 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4848 enum tree_code type_code1;
4851 type_code1 = TREE_CODE (type1);
4855 case CPTK_HAS_NOTHROW_ASSIGN:
4856 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4857 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4858 || (CLASS_TYPE_P (type1)
4859 && classtype_has_nothrow_assign_or_copy_p (type1,
4862 case CPTK_HAS_TRIVIAL_ASSIGN:
4863 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4864 && (pod_type_p (type1)
4865 || (CLASS_TYPE_P (type1)
4866 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4868 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4869 type1 = strip_array_types (type1);
4870 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4871 || (CLASS_TYPE_P (type1)
4872 && (t = locate_ctor (type1, NULL))
4873 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4875 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4876 type1 = strip_array_types (type1);
4877 return (pod_type_p (type1)
4878 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4880 case CPTK_HAS_NOTHROW_COPY:
4881 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4882 || (CLASS_TYPE_P (type1)
4883 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4885 case CPTK_HAS_TRIVIAL_COPY:
4886 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4887 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4889 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4890 type1 = strip_array_types (type1);
4891 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4892 || (CLASS_TYPE_P (type1)
4893 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4895 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4896 return (CLASS_TYPE_P (type1)
4897 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4899 case CPTK_IS_ABSTRACT:
4900 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4902 case CPTK_IS_BASE_OF:
4903 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4904 && DERIVED_FROM_P (type1, type2));
4907 return (NON_UNION_CLASS_TYPE_P (type1));
4909 case CPTK_IS_CONVERTIBLE_TO:
4914 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4917 return (type_code1 == ENUMERAL_TYPE);
4920 return (pod_type_p (type1));
4922 case CPTK_IS_POLYMORPHIC:
4923 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4926 return (type_code1 == UNION_TYPE);
4934 /* Returns true if TYPE is a complete type, an array of unknown bound,
4935 or (possibly cv-qualified) void, returns false otherwise. */
4938 check_trait_type (tree type)
4940 if (COMPLETE_TYPE_P (type))
4943 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
4946 if (VOID_TYPE_P (type))
4952 /* Process a trait expression. */
4955 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4957 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4958 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4959 || kind == CPTK_HAS_NOTHROW_COPY
4960 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4961 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4962 || kind == CPTK_HAS_TRIVIAL_COPY
4963 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4964 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4965 || kind == CPTK_IS_ABSTRACT
4966 || kind == CPTK_IS_BASE_OF
4967 || kind == CPTK_IS_CLASS
4968 || kind == CPTK_IS_CONVERTIBLE_TO
4969 || kind == CPTK_IS_EMPTY
4970 || kind == CPTK_IS_ENUM
4971 || kind == CPTK_IS_POD
4972 || kind == CPTK_IS_POLYMORPHIC
4973 || kind == CPTK_IS_UNION);
4975 if (kind == CPTK_IS_CONVERTIBLE_TO)
4977 sorry ("__is_convertible_to");
4978 return error_mark_node;
4981 if (type1 == error_mark_node
4982 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4983 && type2 == error_mark_node))
4984 return error_mark_node;
4986 if (processing_template_decl)
4988 tree trait_expr = make_node (TRAIT_EXPR);
4989 TREE_TYPE (trait_expr) = boolean_type_node;
4990 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4991 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4992 TRAIT_EXPR_KIND (trait_expr) = kind;
4996 complete_type (type1);
4998 complete_type (type2);
5002 case CPTK_HAS_NOTHROW_ASSIGN:
5003 case CPTK_HAS_TRIVIAL_ASSIGN:
5004 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5005 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5006 case CPTK_HAS_NOTHROW_COPY:
5007 case CPTK_HAS_TRIVIAL_COPY:
5008 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5009 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5010 case CPTK_IS_ABSTRACT:
5013 case CPTK_IS_POLYMORPHIC:
5014 if (!check_trait_type (type1))
5016 error ("incomplete type %qT not allowed", type1);
5017 return error_mark_node;
5021 case CPTK_IS_BASE_OF:
5022 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5023 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5024 && !COMPLETE_TYPE_P (type2))
5026 error ("incomplete type %qT not allowed", type2);
5027 return error_mark_node;
5036 case CPTK_IS_CONVERTIBLE_TO:
5041 return (trait_expr_value (kind, type1, type2)
5042 ? boolean_true_node : boolean_false_node);
5045 #include "gt-cp-semantics.h"