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);
1470 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1471 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1473 else if (processing_template_decl)
1474 return build_qualified_name (TREE_TYPE (decl),
1477 /*template_p=*/false);
1480 tree access_type = TREE_TYPE (object);
1481 tree lookup_context = context_for_name_lookup (decl);
1483 while (!DERIVED_FROM_P (lookup_context, access_type))
1485 access_type = TYPE_CONTEXT (access_type);
1486 while (access_type && DECL_P (access_type))
1487 access_type = DECL_CONTEXT (access_type);
1491 error ("object missing in reference to %q+D", decl);
1492 error ("from this location");
1493 return error_mark_node;
1497 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1500 /* If the data member was named `C::M', convert `*this' to `C'
1502 if (qualifying_scope)
1504 tree binfo = NULL_TREE;
1505 object = build_scoped_ref (object, qualifying_scope,
1509 return build_class_member_access_expr (object, decl,
1510 /*access_path=*/NULL_TREE,
1511 /*preserve_reference=*/false,
1512 tf_warning_or_error);
1516 /* DECL was the declaration to which a qualified-id resolved. Issue
1517 an error message if it is not accessible. If OBJECT_TYPE is
1518 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1519 type of `*x', or `x', respectively. If the DECL was named as
1520 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1523 check_accessibility_of_qualified_id (tree decl,
1525 tree nested_name_specifier)
1528 tree qualifying_type = NULL_TREE;
1530 /* If we're not checking, return immediately. */
1531 if (deferred_access_no_check)
1534 /* Determine the SCOPE of DECL. */
1535 scope = context_for_name_lookup (decl);
1536 /* If the SCOPE is not a type, then DECL is not a member. */
1537 if (!TYPE_P (scope))
1539 /* Compute the scope through which DECL is being accessed. */
1541 /* OBJECT_TYPE might not be a class type; consider:
1543 class A { typedef int I; };
1547 In this case, we will have "A::I" as the DECL, but "I" as the
1549 && CLASS_TYPE_P (object_type)
1550 && DERIVED_FROM_P (scope, object_type))
1551 /* If we are processing a `->' or `.' expression, use the type of the
1553 qualifying_type = object_type;
1554 else if (nested_name_specifier)
1556 /* If the reference is to a non-static member of the
1557 current class, treat it as if it were referenced through
1559 if (DECL_NONSTATIC_MEMBER_P (decl)
1560 && current_class_ptr
1561 && DERIVED_FROM_P (scope, current_class_type))
1562 qualifying_type = current_class_type;
1563 /* Otherwise, use the type indicated by the
1564 nested-name-specifier. */
1566 qualifying_type = nested_name_specifier;
1569 /* Otherwise, the name must be from the current class or one of
1571 qualifying_type = currently_open_derived_class (scope);
1574 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1575 or similar in a default argument value. */
1576 && CLASS_TYPE_P (qualifying_type)
1577 && !dependent_type_p (qualifying_type))
1578 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1582 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1583 class named to the left of the "::" operator. DONE is true if this
1584 expression is a complete postfix-expression; it is false if this
1585 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1586 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1587 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1588 is true iff this qualified name appears as a template argument. */
1591 finish_qualified_id_expr (tree qualifying_class,
1596 bool template_arg_p)
1598 gcc_assert (TYPE_P (qualifying_class));
1600 if (error_operand_p (expr))
1601 return error_mark_node;
1603 if (DECL_P (expr) || BASELINK_P (expr))
1607 check_template_keyword (expr);
1609 /* If EXPR occurs as the operand of '&', use special handling that
1610 permits a pointer-to-member. */
1611 if (address_p && done)
1613 if (TREE_CODE (expr) == SCOPE_REF)
1614 expr = TREE_OPERAND (expr, 1);
1615 expr = build_offset_ref (qualifying_class, expr,
1616 /*address_p=*/true);
1620 /* Within the scope of a class, turn references to non-static
1621 members into expression of the form "this->...". */
1623 /* But, within a template argument, we do not want make the
1624 transformation, as there is no "this" pointer. */
1626 else if (TREE_CODE (expr) == FIELD_DECL)
1628 push_deferring_access_checks (dk_no_check);
1629 expr = finish_non_static_data_member (expr, current_class_ref,
1631 pop_deferring_access_checks ();
1633 else if (BASELINK_P (expr) && !processing_template_decl)
1637 /* See if any of the functions are non-static members. */
1638 fns = BASELINK_FUNCTIONS (expr);
1639 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1640 fns = TREE_OPERAND (fns, 0);
1641 /* If so, the expression may be relative to the current
1643 if (!shared_member_p (fns)
1644 && current_class_type
1645 && DERIVED_FROM_P (qualifying_class, current_class_type))
1646 expr = (build_class_member_access_expr
1647 (maybe_dummy_object (qualifying_class, NULL),
1649 BASELINK_ACCESS_BINFO (expr),
1650 /*preserve_reference=*/false,
1651 tf_warning_or_error));
1653 /* The expression is a qualified name whose address is not
1655 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1661 /* Begin a statement-expression. The value returned must be passed to
1662 finish_stmt_expr. */
1665 begin_stmt_expr (void)
1667 return push_stmt_list ();
1670 /* Process the final expression of a statement expression. EXPR can be
1671 NULL, if the final expression is empty. Return a STATEMENT_LIST
1672 containing all the statements in the statement-expression, or
1673 ERROR_MARK_NODE if there was an error. */
1676 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1678 if (error_operand_p (expr))
1680 /* The type of the statement-expression is the type of the last
1682 TREE_TYPE (stmt_expr) = error_mark_node;
1683 return error_mark_node;
1686 /* If the last statement does not have "void" type, then the value
1687 of the last statement is the value of the entire expression. */
1690 tree type = TREE_TYPE (expr);
1692 if (processing_template_decl)
1694 expr = build_stmt (EXPR_STMT, expr);
1695 expr = add_stmt (expr);
1696 /* Mark the last statement so that we can recognize it as such at
1697 template-instantiation time. */
1698 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1700 else if (VOID_TYPE_P (type))
1702 /* Just treat this like an ordinary statement. */
1703 expr = finish_expr_stmt (expr);
1707 /* It actually has a value we need to deal with. First, force it
1708 to be an rvalue so that we won't need to build up a copy
1709 constructor call later when we try to assign it to something. */
1710 expr = force_rvalue (expr);
1711 if (error_operand_p (expr))
1712 return error_mark_node;
1714 /* Update for array-to-pointer decay. */
1715 type = TREE_TYPE (expr);
1717 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1718 normal statement, but don't convert to void or actually add
1720 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1721 expr = maybe_cleanup_point_expr (expr);
1725 /* The type of the statement-expression is the type of the last
1727 TREE_TYPE (stmt_expr) = type;
1733 /* Finish a statement-expression. EXPR should be the value returned
1734 by the previous begin_stmt_expr. Returns an expression
1735 representing the statement-expression. */
1738 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1743 if (error_operand_p (stmt_expr))
1745 pop_stmt_list (stmt_expr);
1746 return error_mark_node;
1749 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1751 type = TREE_TYPE (stmt_expr);
1752 result = pop_stmt_list (stmt_expr);
1753 TREE_TYPE (result) = type;
1755 if (processing_template_decl)
1757 result = build_min (STMT_EXPR, type, result);
1758 TREE_SIDE_EFFECTS (result) = 1;
1759 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1761 else if (CLASS_TYPE_P (type))
1763 /* Wrap the statement-expression in a TARGET_EXPR so that the
1764 temporary object created by the final expression is destroyed at
1765 the end of the full-expression containing the
1766 statement-expression. */
1767 result = force_target_expr (type, result);
1773 /* Returns the expression which provides the value of STMT_EXPR. */
1776 stmt_expr_value_expr (tree stmt_expr)
1778 tree t = STMT_EXPR_STMT (stmt_expr);
1780 if (TREE_CODE (t) == BIND_EXPR)
1781 t = BIND_EXPR_BODY (t);
1783 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1784 t = STATEMENT_LIST_TAIL (t)->stmt;
1786 if (TREE_CODE (t) == EXPR_STMT)
1787 t = EXPR_STMT_EXPR (t);
1792 /* Perform Koenig lookup. FN is the postfix-expression representing
1793 the function (or functions) to call; ARGS are the arguments to the
1794 call. Returns the functions to be considered by overload
1798 perform_koenig_lookup (tree fn, tree args)
1800 tree identifier = NULL_TREE;
1801 tree functions = NULL_TREE;
1802 tree tmpl_args = NULL_TREE;
1803 bool template_id = false;
1805 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1807 /* Use a separate flag to handle null args. */
1809 tmpl_args = TREE_OPERAND (fn, 1);
1810 fn = TREE_OPERAND (fn, 0);
1813 /* Find the name of the overloaded function. */
1814 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1816 else if (is_overloaded_fn (fn))
1819 identifier = DECL_NAME (get_first_fn (functions));
1821 else if (DECL_P (fn))
1824 identifier = DECL_NAME (fn);
1827 /* A call to a namespace-scope function using an unqualified name.
1829 Do Koenig lookup -- unless any of the arguments are
1831 if (!any_type_dependent_arguments_p (args)
1832 && !any_dependent_template_arguments_p (tmpl_args))
1834 fn = lookup_arg_dependent (identifier, functions, args);
1836 /* The unqualified name could not be resolved. */
1837 fn = unqualified_fn_lookup_error (identifier);
1840 if (fn && template_id)
1841 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1846 /* Generate an expression for `FN (ARGS)'.
1848 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1849 as a virtual call, even if FN is virtual. (This flag is set when
1850 encountering an expression where the function name is explicitly
1851 qualified. For example a call to `X::f' never generates a virtual
1854 Returns code for the call. */
1857 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p,
1858 tsubst_flags_t complain)
1864 if (fn == error_mark_node || args == error_mark_node)
1865 return error_mark_node;
1867 /* ARGS should be a list of arguments. */
1868 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1869 gcc_assert (!TYPE_P (fn));
1874 if (processing_template_decl)
1876 if (type_dependent_expression_p (fn)
1877 || any_type_dependent_arguments_p (args))
1879 result = build_nt_call_list (fn, args);
1880 KOENIG_LOOKUP_P (result) = koenig_p;
1885 tree fndecl = OVL_CURRENT (fn);
1886 if (TREE_CODE (fndecl) != FUNCTION_DECL
1887 || !TREE_THIS_VOLATILE (fndecl))
1893 current_function_returns_abnormally = 1;
1897 if (!BASELINK_P (fn)
1898 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1899 && TREE_TYPE (fn) != unknown_type_node)
1900 fn = build_non_dependent_expr (fn);
1901 args = build_non_dependent_args (orig_args);
1904 if (is_overloaded_fn (fn))
1905 fn = baselink_for_fns (fn);
1908 if (BASELINK_P (fn))
1912 /* A call to a member function. From [over.call.func]:
1914 If the keyword this is in scope and refers to the class of
1915 that member function, or a derived class thereof, then the
1916 function call is transformed into a qualified function call
1917 using (*this) as the postfix-expression to the left of the
1918 . operator.... [Otherwise] a contrived object of type T
1919 becomes the implied object argument.
1921 This paragraph is unclear about this situation:
1923 struct A { void f(); };
1924 struct B : public A {};
1925 struct C : public A { void g() { B::f(); }};
1927 In particular, for `B::f', this paragraph does not make clear
1928 whether "the class of that member function" refers to `A' or
1929 to `B'. We believe it refers to `B'. */
1930 if (current_class_type
1931 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1933 && current_class_ref)
1934 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1938 tree representative_fn;
1940 representative_fn = BASELINK_FUNCTIONS (fn);
1941 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1942 representative_fn = TREE_OPERAND (representative_fn, 0);
1943 representative_fn = get_first_fn (representative_fn);
1944 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1947 if (processing_template_decl)
1949 if (type_dependent_expression_p (object))
1950 return build_nt_call_list (orig_fn, orig_args);
1951 object = build_non_dependent_expr (object);
1954 result = build_new_method_call (object, fn, args, NULL_TREE,
1956 ? LOOKUP_NONVIRTUAL : 0),
1960 else if (is_overloaded_fn (fn))
1962 /* If the function is an overloaded builtin, resolve it. */
1963 if (TREE_CODE (fn) == FUNCTION_DECL
1964 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1965 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1966 result = resolve_overloaded_builtin (fn, args);
1969 /* A call to a namespace-scope function. */
1970 result = build_new_function_call (fn, args, koenig_p, complain);
1972 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1975 error ("arguments to destructor are not allowed");
1976 /* Mark the pseudo-destructor call as having side-effects so
1977 that we do not issue warnings about its use. */
1978 result = build1 (NOP_EXPR,
1980 TREE_OPERAND (fn, 0));
1981 TREE_SIDE_EFFECTS (result) = 1;
1983 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1984 /* If the "function" is really an object of class type, it might
1985 have an overloaded `operator ()'. */
1986 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1987 /*overloaded_p=*/NULL, complain);
1990 /* A call where the function is unknown. */
1991 result = cp_build_function_call (fn, args, complain);
1993 if (processing_template_decl)
1995 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
1996 KOENIG_LOOKUP_P (result) = koenig_p;
2001 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2002 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2003 POSTDECREMENT_EXPR.) */
2006 finish_increment_expr (tree expr, enum tree_code code)
2008 return build_x_unary_op (code, expr, tf_warning_or_error);
2011 /* Finish a use of `this'. Returns an expression for `this'. */
2014 finish_this_expr (void)
2018 if (current_class_ptr)
2020 result = current_class_ptr;
2022 else if (current_function_decl
2023 && DECL_STATIC_FUNCTION_P (current_function_decl))
2025 error ("%<this%> is unavailable for static member functions");
2026 result = error_mark_node;
2030 if (current_function_decl)
2031 error ("invalid use of %<this%> in non-member function");
2033 error ("invalid use of %<this%> at top level");
2034 result = error_mark_node;
2040 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2041 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2042 the TYPE for the type given. If SCOPE is non-NULL, the expression
2043 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2046 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2048 if (object == error_mark_node || destructor == error_mark_node)
2049 return error_mark_node;
2051 gcc_assert (TYPE_P (destructor));
2053 if (!processing_template_decl)
2055 if (scope == error_mark_node)
2057 error ("invalid qualifying scope in pseudo-destructor name");
2058 return error_mark_node;
2060 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2062 error ("qualified type %qT does not match destructor name ~%qT",
2064 return error_mark_node;
2068 /* [expr.pseudo] says both:
2070 The type designated by the pseudo-destructor-name shall be
2071 the same as the object type.
2075 The cv-unqualified versions of the object type and of the
2076 type designated by the pseudo-destructor-name shall be the
2079 We implement the more generous second sentence, since that is
2080 what most other compilers do. */
2081 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2084 error ("%qE is not of type %qT", object, destructor);
2085 return error_mark_node;
2089 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2092 /* Finish an expression of the form CODE EXPR. */
2095 finish_unary_op_expr (enum tree_code code, tree expr)
2097 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2098 /* Inside a template, build_x_unary_op does not fold the
2099 expression. So check whether the result is folded before
2100 setting TREE_NEGATED_INT. */
2101 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2102 && TREE_CODE (result) == INTEGER_CST
2103 && !TYPE_UNSIGNED (TREE_TYPE (result))
2104 && INT_CST_LT (result, integer_zero_node))
2106 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2107 setting TREE_NEGATED_INT. */
2108 result = copy_node (result);
2109 TREE_NEGATED_INT (result) = 1;
2111 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2112 overflow_warning (result);
2117 /* Finish a compound-literal expression. TYPE is the type to which
2118 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2121 finish_compound_literal (tree type, tree compound_literal)
2123 if (type == error_mark_node)
2124 return error_mark_node;
2126 if (!TYPE_OBJ_P (type))
2128 error ("compound literal of non-object type %qT", type);
2129 return error_mark_node;
2132 if (processing_template_decl)
2134 TREE_TYPE (compound_literal) = type;
2135 /* Mark the expression as a compound literal. */
2136 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2137 return compound_literal;
2140 type = complete_type (type);
2142 if (TYPE_NON_AGGREGATE_CLASS (type))
2144 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2145 everywhere that deals with function arguments would be a pain, so
2146 just wrap it in a TREE_LIST. The parser set a flag so we know
2147 that it came from T{} rather than T({}). */
2148 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2149 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2150 return build_functional_cast (type, compound_literal, tf_error);
2153 if (TREE_CODE (type) == ARRAY_TYPE
2154 && check_array_initializer (NULL_TREE, type, compound_literal))
2155 return error_mark_node;
2156 compound_literal = reshape_init (type, compound_literal);
2157 if (TREE_CODE (type) == ARRAY_TYPE)
2158 cp_complete_array_type (&type, compound_literal, false);
2159 compound_literal = digest_init (type, compound_literal);
2160 if ((!at_function_scope_p () || cp_type_readonly (type))
2161 && initializer_constant_valid_p (compound_literal, type))
2163 tree decl = create_temporary_var (type);
2164 DECL_INITIAL (decl) = compound_literal;
2165 TREE_STATIC (decl) = 1;
2166 decl = pushdecl_top_level (decl);
2167 DECL_NAME (decl) = make_anon_name ();
2168 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2172 return get_target_expr (compound_literal);
2175 /* Return the declaration for the function-name variable indicated by
2179 finish_fname (tree id)
2183 decl = fname_decl (input_location, C_RID_CODE (id), id);
2184 if (processing_template_decl)
2185 decl = DECL_NAME (decl);
2189 /* Finish a translation unit. */
2192 finish_translation_unit (void)
2194 /* In case there were missing closebraces,
2195 get us back to the global binding level. */
2197 while (current_namespace != global_namespace)
2200 /* Do file scope __FUNCTION__ et al. */
2201 finish_fname_decls ();
2204 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2205 Returns the parameter. */
2208 finish_template_type_parm (tree aggr, tree identifier)
2210 if (aggr != class_type_node)
2212 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2213 aggr = class_type_node;
2216 return build_tree_list (aggr, identifier);
2219 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2220 Returns the parameter. */
2223 finish_template_template_parm (tree aggr, tree identifier)
2225 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2226 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2227 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2228 DECL_TEMPLATE_RESULT (tmpl) = decl;
2229 DECL_ARTIFICIAL (decl) = 1;
2230 end_template_decl ();
2232 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2234 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2235 /*is_primary=*/true, /*is_partial=*/false,
2238 return finish_template_type_parm (aggr, tmpl);
2241 /* ARGUMENT is the default-argument value for a template template
2242 parameter. If ARGUMENT is invalid, issue error messages and return
2243 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2246 check_template_template_default_arg (tree argument)
2248 if (TREE_CODE (argument) != TEMPLATE_DECL
2249 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2250 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2252 if (TREE_CODE (argument) == TYPE_DECL)
2253 error ("invalid use of type %qT as a default value for a template "
2254 "template-parameter", TREE_TYPE (argument));
2256 error ("invalid default argument for a template template parameter");
2257 return error_mark_node;
2263 /* Begin a class definition, as indicated by T. */
2266 begin_class_definition (tree t, tree attributes)
2268 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2269 return error_mark_node;
2271 if (processing_template_parmlist)
2273 error ("definition of %q#T inside template parameter list", t);
2274 return error_mark_node;
2276 /* A non-implicit typename comes from code like:
2278 template <typename T> struct A {
2279 template <typename U> struct A<T>::B ...
2281 This is erroneous. */
2282 else if (TREE_CODE (t) == TYPENAME_TYPE)
2284 error ("invalid definition of qualified type %qT", t);
2285 t = error_mark_node;
2288 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2290 t = make_class_type (RECORD_TYPE);
2291 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2294 /* Update the location of the decl. */
2295 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2297 if (TYPE_BEING_DEFINED (t))
2299 t = make_class_type (TREE_CODE (t));
2300 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2302 maybe_process_partial_specialization (t);
2304 TYPE_BEING_DEFINED (t) = 1;
2306 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2308 if (flag_pack_struct)
2311 TYPE_PACKED (t) = 1;
2312 /* Even though the type is being defined for the first time
2313 here, there might have been a forward declaration, so there
2314 might be cv-qualified variants of T. */
2315 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2316 TYPE_PACKED (v) = 1;
2318 /* Reset the interface data, at the earliest possible
2319 moment, as it might have been set via a class foo;
2321 if (! TYPE_ANONYMOUS_P (t))
2323 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2324 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2325 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2326 (t, finfo->interface_unknown);
2328 reset_specialization();
2330 /* Make a declaration for this class in its own scope. */
2331 build_self_reference ();
2336 /* Finish the member declaration given by DECL. */
2339 finish_member_declaration (tree decl)
2341 if (decl == error_mark_node || decl == NULL_TREE)
2344 if (decl == void_type_node)
2345 /* The COMPONENT was a friend, not a member, and so there's
2346 nothing for us to do. */
2349 /* We should see only one DECL at a time. */
2350 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2352 /* Set up access control for DECL. */
2354 = (current_access_specifier == access_private_node);
2355 TREE_PROTECTED (decl)
2356 = (current_access_specifier == access_protected_node);
2357 if (TREE_CODE (decl) == TEMPLATE_DECL)
2359 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2360 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2363 /* Mark the DECL as a member of the current class. */
2364 DECL_CONTEXT (decl) = current_class_type;
2366 /* Check for bare parameter packs in the member variable declaration. */
2367 if (TREE_CODE (decl) == FIELD_DECL)
2369 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2370 TREE_TYPE (decl) = error_mark_node;
2371 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2372 DECL_ATTRIBUTES (decl) = NULL_TREE;
2377 A C language linkage is ignored for the names of class members
2378 and the member function type of class member functions. */
2379 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2380 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2382 /* Put functions on the TYPE_METHODS list and everything else on the
2383 TYPE_FIELDS list. Note that these are built up in reverse order.
2384 We reverse them (to obtain declaration order) in finish_struct. */
2385 if (TREE_CODE (decl) == FUNCTION_DECL
2386 || DECL_FUNCTION_TEMPLATE_P (decl))
2388 /* We also need to add this function to the
2389 CLASSTYPE_METHOD_VEC. */
2390 if (add_method (current_class_type, decl, NULL_TREE))
2392 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2393 TYPE_METHODS (current_class_type) = decl;
2395 maybe_add_class_template_decl_list (current_class_type, decl,
2399 /* Enter the DECL into the scope of the class. */
2400 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2401 || pushdecl_class_level (decl))
2403 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2404 go at the beginning. The reason is that lookup_field_1
2405 searches the list in order, and we want a field name to
2406 override a type name so that the "struct stat hack" will
2407 work. In particular:
2409 struct S { enum E { }; int E } s;
2412 is valid. In addition, the FIELD_DECLs must be maintained in
2413 declaration order so that class layout works as expected.
2414 However, we don't need that order until class layout, so we
2415 save a little time by putting FIELD_DECLs on in reverse order
2416 here, and then reversing them in finish_struct_1. (We could
2417 also keep a pointer to the correct insertion points in the
2420 if (TREE_CODE (decl) == TYPE_DECL)
2421 TYPE_FIELDS (current_class_type)
2422 = chainon (TYPE_FIELDS (current_class_type), decl);
2425 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2426 TYPE_FIELDS (current_class_type) = decl;
2429 maybe_add_class_template_decl_list (current_class_type, decl,
2434 note_decl_for_pch (decl);
2437 /* DECL has been declared while we are building a PCH file. Perform
2438 actions that we might normally undertake lazily, but which can be
2439 performed now so that they do not have to be performed in
2440 translation units which include the PCH file. */
2443 note_decl_for_pch (tree decl)
2445 gcc_assert (pch_file);
2447 /* There's a good chance that we'll have to mangle names at some
2448 point, even if only for emission in debugging information. */
2449 if ((TREE_CODE (decl) == VAR_DECL
2450 || TREE_CODE (decl) == FUNCTION_DECL)
2451 && !processing_template_decl)
2455 /* Finish processing a complete template declaration. The PARMS are
2456 the template parameters. */
2459 finish_template_decl (tree parms)
2462 end_template_decl ();
2464 end_specialization ();
2467 /* Finish processing a template-id (which names a type) of the form
2468 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2469 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2470 the scope of template-id indicated. */
2473 finish_template_type (tree name, tree args, int entering_scope)
2477 decl = lookup_template_class (name, args,
2478 NULL_TREE, NULL_TREE, entering_scope,
2479 tf_warning_or_error | tf_user);
2480 if (decl != error_mark_node)
2481 decl = TYPE_STUB_DECL (decl);
2486 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2487 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2488 BASE_CLASS, or NULL_TREE if an error occurred. The
2489 ACCESS_SPECIFIER is one of
2490 access_{default,public,protected_private}_node. For a virtual base
2491 we set TREE_TYPE. */
2494 finish_base_specifier (tree base, tree access, bool virtual_p)
2498 if (base == error_mark_node)
2500 error ("invalid base-class specification");
2503 else if (! MAYBE_CLASS_TYPE_P (base))
2505 error ("%qT is not a class type", base);
2510 if (cp_type_quals (base) != 0)
2512 error ("base class %qT has cv qualifiers", base);
2513 base = TYPE_MAIN_VARIANT (base);
2515 result = build_tree_list (access, base);
2517 TREE_TYPE (result) = integer_type_node;
2523 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2524 what we found when we tried to do the lookup.
2525 LOCATION is the location of the NAME identifier;
2526 The location is used in the error message*/
2529 qualified_name_lookup_error (tree scope, tree name,
2530 tree decl, location_t location)
2532 if (scope == error_mark_node)
2533 ; /* We already complained. */
2534 else if (TYPE_P (scope))
2536 if (!COMPLETE_TYPE_P (scope))
2537 error ("%Hincomplete type %qT used in nested name specifier",
2539 else if (TREE_CODE (decl) == TREE_LIST)
2541 error ("%Hreference to %<%T::%D%> is ambiguous", &location, scope, name);
2542 print_candidates (decl);
2545 error ("%H%qD is not a member of %qT", &location, name, scope);
2547 else if (scope != global_namespace)
2548 error ("%H%qD is not a member of %qD", &location, name, scope);
2550 error ("%H%<::%D%> has not been declared", &location, name);
2553 /* If FNS is a member function, a set of member functions, or a
2554 template-id referring to one or more member functions, return a
2555 BASELINK for FNS, incorporating the current access context.
2556 Otherwise, return FNS unchanged. */
2559 baselink_for_fns (tree fns)
2564 if (BASELINK_P (fns)
2565 || error_operand_p (fns))
2569 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2570 fn = TREE_OPERAND (fn, 0);
2571 fn = get_first_fn (fn);
2572 if (!DECL_FUNCTION_MEMBER_P (fn))
2575 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2577 cl = DECL_CONTEXT (fn);
2578 cl = TYPE_BINFO (cl);
2579 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2582 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2583 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2584 if non-NULL, is the type or namespace used to explicitly qualify
2585 ID_EXPRESSION. DECL is the entity to which that name has been
2588 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2589 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2590 be set to true if this expression isn't permitted in a
2591 constant-expression, but it is otherwise not set by this function.
2592 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2593 constant-expression, but a non-constant expression is also
2596 DONE is true if this expression is a complete postfix-expression;
2597 it is false if this expression is followed by '->', '[', '(', etc.
2598 ADDRESS_P is true iff this expression is the operand of '&'.
2599 TEMPLATE_P is true iff the qualified-id was of the form
2600 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2601 appears as a template argument.
2603 If an error occurs, and it is the kind of error that might cause
2604 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2605 is the caller's responsibility to issue the message. *ERROR_MSG
2606 will be a string with static storage duration, so the caller need
2609 Return an expression for the entity, after issuing appropriate
2610 diagnostics. This function is also responsible for transforming a
2611 reference to a non-static member into a COMPONENT_REF that makes
2612 the use of "this" explicit.
2614 Upon return, *IDK will be filled in appropriately. */
2616 finish_id_expression (tree id_expression,
2620 bool integral_constant_expression_p,
2621 bool allow_non_integral_constant_expression_p,
2622 bool *non_integral_constant_expression_p,
2626 bool template_arg_p,
2627 const char **error_msg,
2628 location_t location)
2630 /* Initialize the output parameters. */
2631 *idk = CP_ID_KIND_NONE;
2634 if (id_expression == error_mark_node)
2635 return error_mark_node;
2636 /* If we have a template-id, then no further lookup is
2637 required. If the template-id was for a template-class, we
2638 will sometimes have a TYPE_DECL at this point. */
2639 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2640 || TREE_CODE (decl) == TYPE_DECL)
2642 /* Look up the name. */
2645 if (decl == error_mark_node)
2647 /* Name lookup failed. */
2650 || (!dependent_type_p (scope)
2651 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2652 && IDENTIFIER_TYPENAME_P (id_expression)
2653 && dependent_type_p (TREE_TYPE (id_expression))))))
2655 /* If the qualifying type is non-dependent (and the name
2656 does not name a conversion operator to a dependent
2657 type), issue an error. */
2658 qualified_name_lookup_error (scope, id_expression, decl, location);
2659 return error_mark_node;
2663 /* It may be resolved via Koenig lookup. */
2664 *idk = CP_ID_KIND_UNQUALIFIED;
2665 return id_expression;
2668 decl = id_expression;
2670 /* If DECL is a variable that would be out of scope under
2671 ANSI/ISO rules, but in scope in the ARM, name lookup
2672 will succeed. Issue a diagnostic here. */
2674 decl = check_for_out_of_scope_variable (decl);
2676 /* Remember that the name was used in the definition of
2677 the current class so that we can check later to see if
2678 the meaning would have been different after the class
2679 was entirely defined. */
2680 if (!scope && decl != error_mark_node)
2681 maybe_note_name_used_in_class (id_expression, decl);
2683 /* Disallow uses of local variables from containing functions. */
2684 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2686 tree context = decl_function_context (decl);
2687 if (context != NULL_TREE && context != current_function_decl
2688 && ! TREE_STATIC (decl))
2690 error (TREE_CODE (decl) == VAR_DECL
2691 ? "use of %<auto%> variable from containing function"
2692 : "use of parameter from containing function");
2693 error (" %q+#D declared here", decl);
2694 return error_mark_node;
2699 /* If we didn't find anything, or what we found was a type,
2700 then this wasn't really an id-expression. */
2701 if (TREE_CODE (decl) == TEMPLATE_DECL
2702 && !DECL_FUNCTION_TEMPLATE_P (decl))
2704 *error_msg = "missing template arguments";
2705 return error_mark_node;
2707 else if (TREE_CODE (decl) == TYPE_DECL
2708 || TREE_CODE (decl) == NAMESPACE_DECL)
2710 *error_msg = "expected primary-expression";
2711 return error_mark_node;
2714 /* If the name resolved to a template parameter, there is no
2715 need to look it up again later. */
2716 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2717 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2721 *idk = CP_ID_KIND_NONE;
2722 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2723 decl = TEMPLATE_PARM_DECL (decl);
2724 r = convert_from_reference (DECL_INITIAL (decl));
2726 if (integral_constant_expression_p
2727 && !dependent_type_p (TREE_TYPE (decl))
2728 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2730 if (!allow_non_integral_constant_expression_p)
2731 error ("template parameter %qD of type %qT is not allowed in "
2732 "an integral constant expression because it is not of "
2733 "integral or enumeration type", decl, TREE_TYPE (decl));
2734 *non_integral_constant_expression_p = true;
2738 /* Similarly, we resolve enumeration constants to their
2739 underlying values. */
2740 else if (TREE_CODE (decl) == CONST_DECL)
2742 *idk = CP_ID_KIND_NONE;
2743 if (!processing_template_decl)
2745 used_types_insert (TREE_TYPE (decl));
2746 return DECL_INITIAL (decl);
2754 /* If the declaration was explicitly qualified indicate
2755 that. The semantics of `A::f(3)' are different than
2756 `f(3)' if `f' is virtual. */
2758 ? CP_ID_KIND_QUALIFIED
2759 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2760 ? CP_ID_KIND_TEMPLATE_ID
2761 : CP_ID_KIND_UNQUALIFIED));
2766 An id-expression is type-dependent if it contains an
2767 identifier that was declared with a dependent type.
2769 The standard is not very specific about an id-expression that
2770 names a set of overloaded functions. What if some of them
2771 have dependent types and some of them do not? Presumably,
2772 such a name should be treated as a dependent name. */
2773 /* Assume the name is not dependent. */
2774 dependent_p = false;
2775 if (!processing_template_decl)
2776 /* No names are dependent outside a template. */
2778 /* A template-id where the name of the template was not resolved
2779 is definitely dependent. */
2780 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2781 && (TREE_CODE (TREE_OPERAND (decl, 0))
2782 == IDENTIFIER_NODE))
2784 /* For anything except an overloaded function, just check its
2786 else if (!is_overloaded_fn (decl))
2788 = dependent_type_p (TREE_TYPE (decl));
2789 /* For a set of overloaded functions, check each of the
2795 if (BASELINK_P (fns))
2796 fns = BASELINK_FUNCTIONS (fns);
2798 /* For a template-id, check to see if the template
2799 arguments are dependent. */
2800 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2802 tree args = TREE_OPERAND (fns, 1);
2803 dependent_p = any_dependent_template_arguments_p (args);
2804 /* The functions are those referred to by the
2806 fns = TREE_OPERAND (fns, 0);
2809 /* If there are no dependent template arguments, go through
2810 the overloaded functions. */
2811 while (fns && !dependent_p)
2813 tree fn = OVL_CURRENT (fns);
2815 /* Member functions of dependent classes are
2817 if (TREE_CODE (fn) == FUNCTION_DECL
2818 && type_dependent_expression_p (fn))
2820 else if (TREE_CODE (fn) == TEMPLATE_DECL
2821 && dependent_template_p (fn))
2824 fns = OVL_NEXT (fns);
2828 /* If the name was dependent on a template parameter, we will
2829 resolve the name at instantiation time. */
2832 /* Create a SCOPE_REF for qualified names, if the scope is
2838 if (address_p && done)
2839 decl = finish_qualified_id_expr (scope, decl,
2845 tree type = NULL_TREE;
2846 if (DECL_P (decl) && !dependent_scope_p (scope))
2847 type = TREE_TYPE (decl);
2848 decl = build_qualified_name (type,
2854 if (TREE_TYPE (decl))
2855 decl = convert_from_reference (decl);
2858 /* A TEMPLATE_ID already contains all the information we
2860 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2861 return id_expression;
2862 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2863 /* If we found a variable, then name lookup during the
2864 instantiation will always resolve to the same VAR_DECL
2865 (or an instantiation thereof). */
2866 if (TREE_CODE (decl) == VAR_DECL
2867 || TREE_CODE (decl) == PARM_DECL)
2868 return convert_from_reference (decl);
2869 /* The same is true for FIELD_DECL, but we also need to
2870 make sure that the syntax is correct. */
2871 else if (TREE_CODE (decl) == FIELD_DECL)
2873 /* Since SCOPE is NULL here, this is an unqualified name.
2874 Access checking has been performed during name lookup
2875 already. Turn off checking to avoid duplicate errors. */
2876 push_deferring_access_checks (dk_no_check);
2877 decl = finish_non_static_data_member
2878 (decl, current_class_ref,
2879 /*qualifying_scope=*/NULL_TREE);
2880 pop_deferring_access_checks ();
2883 return id_expression;
2886 /* Only certain kinds of names are allowed in constant
2887 expression. Enumerators and template parameters have already
2888 been handled above. */
2889 if (integral_constant_expression_p
2890 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2891 && ! builtin_valid_in_constant_expr_p (decl))
2893 if (!allow_non_integral_constant_expression_p)
2895 error ("%qD cannot appear in a constant-expression", decl);
2896 return error_mark_node;
2898 *non_integral_constant_expression_p = true;
2901 if (TREE_CODE (decl) == NAMESPACE_DECL)
2903 error ("use of namespace %qD as expression", decl);
2904 return error_mark_node;
2906 else if (DECL_CLASS_TEMPLATE_P (decl))
2908 error ("use of class template %qT as expression", decl);
2909 return error_mark_node;
2911 else if (TREE_CODE (decl) == TREE_LIST)
2913 /* Ambiguous reference to base members. */
2914 error ("request for member %qD is ambiguous in "
2915 "multiple inheritance lattice", id_expression);
2916 print_candidates (decl);
2917 return error_mark_node;
2920 /* Mark variable-like entities as used. Functions are similarly
2921 marked either below or after overload resolution. */
2922 if (TREE_CODE (decl) == VAR_DECL
2923 || TREE_CODE (decl) == PARM_DECL
2924 || TREE_CODE (decl) == RESULT_DECL)
2929 decl = (adjust_result_of_qualified_name_lookup
2930 (decl, scope, current_class_type));
2932 if (TREE_CODE (decl) == FUNCTION_DECL)
2935 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2936 decl = finish_qualified_id_expr (scope,
2944 tree r = convert_from_reference (decl);
2946 /* In a template, return a SCOPE_REF for most qualified-ids
2947 so that we can check access at instantiation time. But if
2948 we're looking at a member of the current instantiation, we
2949 know we have access and building up the SCOPE_REF confuses
2950 non-type template argument handling. */
2951 if (processing_template_decl && TYPE_P (scope)
2952 && !currently_open_class (scope))
2953 r = build_qualified_name (TREE_TYPE (r),
2959 else if (TREE_CODE (decl) == FIELD_DECL)
2961 /* Since SCOPE is NULL here, this is an unqualified name.
2962 Access checking has been performed during name lookup
2963 already. Turn off checking to avoid duplicate errors. */
2964 push_deferring_access_checks (dk_no_check);
2965 decl = finish_non_static_data_member (decl, current_class_ref,
2966 /*qualifying_scope=*/NULL_TREE);
2967 pop_deferring_access_checks ();
2969 else if (is_overloaded_fn (decl))
2974 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2975 first_fn = TREE_OPERAND (first_fn, 0);
2976 first_fn = get_first_fn (first_fn);
2977 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2978 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2980 if (!really_overloaded_fn (decl))
2981 mark_used (first_fn);
2984 && TREE_CODE (first_fn) == FUNCTION_DECL
2985 && DECL_FUNCTION_MEMBER_P (first_fn)
2986 && !shared_member_p (decl))
2988 /* A set of member functions. */
2989 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2990 return finish_class_member_access_expr (decl, id_expression,
2991 /*template_p=*/false,
2992 tf_warning_or_error);
2995 decl = baselink_for_fns (decl);
2999 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3000 && DECL_CLASS_SCOPE_P (decl))
3002 tree context = context_for_name_lookup (decl);
3003 if (context != current_class_type)
3005 tree path = currently_open_derived_class (context);
3006 perform_or_defer_access_check (TYPE_BINFO (path),
3011 decl = convert_from_reference (decl);
3015 if (TREE_DEPRECATED (decl))
3016 warn_deprecated_use (decl);
3021 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3022 use as a type-specifier. */
3025 finish_typeof (tree expr)
3029 if (type_dependent_expression_p (expr))
3031 type = cxx_make_type (TYPEOF_TYPE);
3032 TYPEOF_TYPE_EXPR (type) = expr;
3033 SET_TYPE_STRUCTURAL_EQUALITY (type);
3038 type = unlowered_expr_type (expr);
3040 if (!type || type == unknown_type_node)
3042 error ("type of %qE is unknown", expr);
3043 return error_mark_node;
3049 /* Perform C++-specific checks for __builtin_offsetof before calling
3053 finish_offsetof (tree expr)
3055 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3057 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3058 TREE_OPERAND (expr, 2));
3059 return error_mark_node;
3061 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3062 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3063 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3065 if (TREE_CODE (expr) == COMPONENT_REF
3066 || TREE_CODE (expr) == COMPOUND_EXPR)
3067 expr = TREE_OPERAND (expr, 1);
3068 error ("cannot apply %<offsetof%> to member function %qD", expr);
3069 return error_mark_node;
3071 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3072 expr = TREE_OPERAND (expr, 0);
3073 return fold_offsetof (expr, NULL_TREE);
3076 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3077 function is broken out from the above for the benefit of the tree-ssa
3081 simplify_aggr_init_expr (tree *tp)
3083 tree aggr_init_expr = *tp;
3085 /* Form an appropriate CALL_EXPR. */
3086 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3087 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3088 tree type = TREE_TYPE (slot);
3091 enum style_t { ctor, arg, pcc } style;
3093 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3095 #ifdef PCC_STATIC_STRUCT_RETURN
3101 gcc_assert (TREE_ADDRESSABLE (type));
3105 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3107 aggr_init_expr_nargs (aggr_init_expr),
3108 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3112 /* Replace the first argument to the ctor with the address of the
3114 cxx_mark_addressable (slot);
3115 CALL_EXPR_ARG (call_expr, 0) =
3116 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3118 else if (style == arg)
3120 /* Just mark it addressable here, and leave the rest to
3121 expand_call{,_inline}. */
3122 cxx_mark_addressable (slot);
3123 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3124 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3126 else if (style == pcc)
3128 /* If we're using the non-reentrant PCC calling convention, then we
3129 need to copy the returned value out of the static buffer into the
3131 push_deferring_access_checks (dk_no_check);
3132 call_expr = build_aggr_init (slot, call_expr,
3133 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3134 tf_warning_or_error);
3135 pop_deferring_access_checks ();
3136 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3139 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3141 tree init = build_zero_init (type, NULL_TREE,
3142 /*static_storage_p=*/false);
3143 init = build2 (INIT_EXPR, void_type_node, slot, init);
3144 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3151 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3154 emit_associated_thunks (tree fn)
3156 /* When we use vcall offsets, we emit thunks with the virtual
3157 functions to which they thunk. The whole point of vcall offsets
3158 is so that you can know statically the entire set of thunks that
3159 will ever be needed for a given virtual function, thereby
3160 enabling you to output all the thunks with the function itself. */
3161 if (DECL_VIRTUAL_P (fn))
3165 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3167 if (!THUNK_ALIAS (thunk))
3169 use_thunk (thunk, /*emit_p=*/1);
3170 if (DECL_RESULT_THUNK_P (thunk))
3174 for (probe = DECL_THUNKS (thunk);
3175 probe; probe = TREE_CHAIN (probe))
3176 use_thunk (probe, /*emit_p=*/1);
3180 gcc_assert (!DECL_THUNKS (thunk));
3185 /* Generate RTL for FN. */
3188 expand_or_defer_fn (tree fn)
3190 /* When the parser calls us after finishing the body of a template
3191 function, we don't really want to expand the body. */
3192 if (processing_template_decl)
3194 /* Normally, collection only occurs in rest_of_compilation. So,
3195 if we don't collect here, we never collect junk generated
3196 during the processing of templates until we hit a
3197 non-template function. It's not safe to do this inside a
3198 nested class, though, as the parser may have local state that
3199 is not a GC root. */
3200 if (!function_depth)
3205 gcc_assert (gimple_body (fn));
3207 /* If this is a constructor or destructor body, we have to clone
3209 if (maybe_clone_body (fn))
3211 /* We don't want to process FN again, so pretend we've written
3212 it out, even though we haven't. */
3213 TREE_ASM_WRITTEN (fn) = 1;
3217 /* We make a decision about linkage for these functions at the end
3218 of the compilation. Until that point, we do not want the back
3219 end to output them -- but we do want it to see the bodies of
3220 these functions so that it can inline them as appropriate. */
3221 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3223 if (DECL_INTERFACE_KNOWN (fn))
3224 /* We've already made a decision as to how this function will
3228 DECL_EXTERNAL (fn) = 1;
3229 DECL_NOT_REALLY_EXTERN (fn) = 1;
3230 note_vague_linkage_fn (fn);
3231 /* A non-template inline function with external linkage will
3232 always be COMDAT. As we must eventually determine the
3233 linkage of all functions, and as that causes writes to
3234 the data mapped in from the PCH file, it's advantageous
3235 to mark the functions at this point. */
3236 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3238 /* This function must have external linkage, as
3239 otherwise DECL_INTERFACE_KNOWN would have been
3241 gcc_assert (TREE_PUBLIC (fn));
3242 comdat_linkage (fn);
3243 DECL_INTERFACE_KNOWN (fn) = 1;
3247 import_export_decl (fn);
3249 /* If the user wants us to keep all inline functions, then mark
3250 this function as needed so that finish_file will make sure to
3252 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3256 /* There's no reason to do any of the work here if we're only doing
3257 semantic analysis; this code just generates RTL. */
3258 if (flag_syntax_only)
3263 /* Expand or defer, at the whim of the compilation unit manager. */
3264 cgraph_finalize_function (fn, function_depth > 1);
3276 /* Helper function for walk_tree, used by finalize_nrv below. */
3279 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3281 struct nrv_data *dp = (struct nrv_data *)data;
3284 /* No need to walk into types. There wouldn't be any need to walk into
3285 non-statements, except that we have to consider STMT_EXPRs. */
3288 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3289 but differs from using NULL_TREE in that it indicates that we care
3290 about the value of the RESULT_DECL. */
3291 else if (TREE_CODE (*tp) == RETURN_EXPR)
3292 TREE_OPERAND (*tp, 0) = dp->result;
3293 /* Change all cleanups for the NRV to only run when an exception is
3295 else if (TREE_CODE (*tp) == CLEANUP_STMT
3296 && CLEANUP_DECL (*tp) == dp->var)
3297 CLEANUP_EH_ONLY (*tp) = 1;
3298 /* Replace the DECL_EXPR for the NRV with an initialization of the
3299 RESULT_DECL, if needed. */
3300 else if (TREE_CODE (*tp) == DECL_EXPR
3301 && DECL_EXPR_DECL (*tp) == dp->var)
3304 if (DECL_INITIAL (dp->var)
3305 && DECL_INITIAL (dp->var) != error_mark_node)
3306 init = build2 (INIT_EXPR, void_type_node, dp->result,
3307 DECL_INITIAL (dp->var));
3309 init = build_empty_stmt ();
3310 DECL_INITIAL (dp->var) = NULL_TREE;
3311 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3314 /* And replace all uses of the NRV with the RESULT_DECL. */
3315 else if (*tp == dp->var)
3318 /* Avoid walking into the same tree more than once. Unfortunately, we
3319 can't just use walk_tree_without duplicates because it would only call
3320 us for the first occurrence of dp->var in the function body. */
3321 slot = htab_find_slot (dp->visited, *tp, INSERT);
3327 /* Keep iterating. */
3331 /* Called from finish_function to implement the named return value
3332 optimization by overriding all the RETURN_EXPRs and pertinent
3333 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3334 RESULT_DECL for the function. */
3337 finalize_nrv (tree *tp, tree var, tree result)
3339 struct nrv_data data;
3341 /* Copy debugging information from VAR to RESULT. */
3342 DECL_NAME (result) = DECL_NAME (var);
3343 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3344 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3345 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3346 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3347 /* Don't forget that we take its address. */
3348 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3351 data.result = result;
3352 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3353 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3354 htab_delete (data.visited);
3357 /* Return the declaration for the function called by CALL_EXPR T,
3358 TYPE is the class type of the clause decl. */
3361 omp_clause_info_fndecl (tree t, tree type)
3363 tree ret = get_callee_fndecl (t);
3368 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3369 t = CALL_EXPR_FN (t);
3371 if (TREE_CODE (t) == OBJ_TYPE_REF)
3373 t = cp_fold_obj_type_ref (t, type);
3374 if (TREE_CODE (t) == ADDR_EXPR
3375 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3376 return TREE_OPERAND (t, 0);
3382 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3385 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3386 bool need_copy_ctor, bool need_copy_assignment)
3388 int save_errorcount = errorcount;
3391 /* Always allocate 3 elements for simplicity. These are the
3392 function decls for the ctor, dtor, and assignment op.
3393 This layout is known to the three lang hooks,
3394 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3395 and cxx_omp_clause_assign_op. */
3396 info = make_tree_vec (3);
3397 CP_OMP_CLAUSE_INFO (c) = info;
3399 if (need_default_ctor
3400 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3402 if (need_default_ctor)
3406 t = build_int_cst (build_pointer_type (type), 0);
3407 t = build1 (INDIRECT_REF, type, t);
3408 t = build_tree_list (NULL, t);
3410 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3411 t, type, LOOKUP_NORMAL,
3412 tf_warning_or_error);
3414 if (targetm.cxx.cdtor_returns_this () || errorcount)
3415 /* Because constructors and destructors return this,
3416 the call will have been cast to "void". Remove the
3417 cast here. We would like to use STRIP_NOPS, but it
3418 wouldn't work here because TYPE_MODE (t) and
3419 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3420 They are VOIDmode and Pmode, respectively. */
3421 if (TREE_CODE (t) == NOP_EXPR)
3422 t = TREE_OPERAND (t, 0);
3424 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3427 if ((need_default_ctor || need_copy_ctor)
3428 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3430 t = build_int_cst (build_pointer_type (type), 0);
3431 t = build1 (INDIRECT_REF, type, t);
3432 t = build_special_member_call (t, complete_dtor_identifier,
3433 NULL, type, LOOKUP_NORMAL,
3434 tf_warning_or_error);
3436 if (targetm.cxx.cdtor_returns_this () || errorcount)
3437 /* Because constructors and destructors return this,
3438 the call will have been cast to "void". Remove the
3439 cast here. We would like to use STRIP_NOPS, but it
3440 wouldn't work here because TYPE_MODE (t) and
3441 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3442 They are VOIDmode and Pmode, respectively. */
3443 if (TREE_CODE (t) == NOP_EXPR)
3444 t = TREE_OPERAND (t, 0);
3446 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3449 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3451 t = build_int_cst (build_pointer_type (type), 0);
3452 t = build1 (INDIRECT_REF, type, t);
3453 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3454 build_tree_list (NULL, t),
3455 type, LOOKUP_NORMAL,
3456 tf_warning_or_error);
3458 /* We'll have called convert_from_reference on the call, which
3459 may well have added an indirect_ref. It's unneeded here,
3460 and in the way, so kill it. */
3461 if (TREE_CODE (t) == INDIRECT_REF)
3462 t = TREE_OPERAND (t, 0);
3464 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3467 return errorcount != save_errorcount;
3470 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3471 Remove any elements from the list that are invalid. */
3474 finish_omp_clauses (tree clauses)
3476 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3477 tree c, t, *pc = &clauses;
3480 bitmap_obstack_initialize (NULL);
3481 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3482 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3483 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3485 for (pc = &clauses, c = clauses; c ; c = *pc)
3487 bool remove = false;
3489 switch (OMP_CLAUSE_CODE (c))
3491 case OMP_CLAUSE_SHARED:
3493 goto check_dup_generic;
3494 case OMP_CLAUSE_PRIVATE:
3496 goto check_dup_generic;
3497 case OMP_CLAUSE_REDUCTION:
3499 goto check_dup_generic;
3500 case OMP_CLAUSE_COPYPRIVATE:
3501 name = "copyprivate";
3502 goto check_dup_generic;
3503 case OMP_CLAUSE_COPYIN:
3505 goto check_dup_generic;
3507 t = OMP_CLAUSE_DECL (c);
3508 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3510 if (processing_template_decl)
3513 error ("%qD is not a variable in clause %qs", t, name);
3515 error ("%qE is not a variable in clause %qs", t, name);
3518 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3519 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3520 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3522 error ("%qD appears more than once in data clauses", t);
3526 bitmap_set_bit (&generic_head, DECL_UID (t));
3529 case OMP_CLAUSE_FIRSTPRIVATE:
3530 t = OMP_CLAUSE_DECL (c);
3531 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3533 if (processing_template_decl)
3536 error ("%qD is not a variable in clause %<firstprivate%>", t);
3538 error ("%qE is not a variable in clause %<firstprivate%>", t);
3541 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3542 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3544 error ("%qD appears more than once in data clauses", t);
3548 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3551 case OMP_CLAUSE_LASTPRIVATE:
3552 t = OMP_CLAUSE_DECL (c);
3553 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3555 if (processing_template_decl)
3558 error ("%qD is not a variable in clause %<lastprivate%>", t);
3560 error ("%qE is not a variable in clause %<lastprivate%>", t);
3563 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3564 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3566 error ("%qD appears more than once in data clauses", t);
3570 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3574 t = OMP_CLAUSE_IF_EXPR (c);
3575 t = maybe_convert_cond (t);
3576 if (t == error_mark_node)
3578 OMP_CLAUSE_IF_EXPR (c) = t;
3581 case OMP_CLAUSE_NUM_THREADS:
3582 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3583 if (t == error_mark_node)
3585 else if (!type_dependent_expression_p (t)
3586 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3588 error ("num_threads expression must be integral");
3593 case OMP_CLAUSE_SCHEDULE:
3594 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3597 else if (t == error_mark_node)
3599 else if (!type_dependent_expression_p (t)
3600 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3602 error ("schedule chunk size expression must be integral");
3607 case OMP_CLAUSE_NOWAIT:
3608 case OMP_CLAUSE_ORDERED:
3609 case OMP_CLAUSE_DEFAULT:
3610 case OMP_CLAUSE_UNTIED:
3611 case OMP_CLAUSE_COLLAPSE:
3619 *pc = OMP_CLAUSE_CHAIN (c);
3621 pc = &OMP_CLAUSE_CHAIN (c);
3624 for (pc = &clauses, c = clauses; c ; c = *pc)
3626 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3627 bool remove = false;
3628 bool need_complete_non_reference = false;
3629 bool need_default_ctor = false;
3630 bool need_copy_ctor = false;
3631 bool need_copy_assignment = false;
3632 bool need_implicitly_determined = false;
3633 tree type, inner_type;
3637 case OMP_CLAUSE_SHARED:
3639 need_implicitly_determined = true;
3641 case OMP_CLAUSE_PRIVATE:
3643 need_complete_non_reference = true;
3644 need_default_ctor = true;
3645 need_implicitly_determined = true;
3647 case OMP_CLAUSE_FIRSTPRIVATE:
3648 name = "firstprivate";
3649 need_complete_non_reference = true;
3650 need_copy_ctor = true;
3651 need_implicitly_determined = true;
3653 case OMP_CLAUSE_LASTPRIVATE:
3654 name = "lastprivate";
3655 need_complete_non_reference = true;
3656 need_copy_assignment = true;
3657 need_implicitly_determined = true;
3659 case OMP_CLAUSE_REDUCTION:
3661 need_implicitly_determined = true;
3663 case OMP_CLAUSE_COPYPRIVATE:
3664 name = "copyprivate";
3665 need_copy_assignment = true;
3667 case OMP_CLAUSE_COPYIN:
3669 need_copy_assignment = true;
3672 pc = &OMP_CLAUSE_CHAIN (c);
3676 t = OMP_CLAUSE_DECL (c);
3677 if (processing_template_decl
3678 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3680 pc = &OMP_CLAUSE_CHAIN (c);
3686 case OMP_CLAUSE_LASTPRIVATE:
3687 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3688 need_default_ctor = true;
3691 case OMP_CLAUSE_REDUCTION:
3692 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3693 || POINTER_TYPE_P (TREE_TYPE (t)))
3695 error ("%qE has invalid type for %<reduction%>", t);
3698 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3700 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3708 error ("%qE has invalid type for %<reduction(%s)%>",
3709 t, operator_name_info[r_code].name);
3715 case OMP_CLAUSE_COPYIN:
3716 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3718 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3727 if (need_complete_non_reference)
3729 t = require_complete_type (t);
3730 if (t == error_mark_node)
3732 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3734 error ("%qE has reference type for %qs", t, name);
3738 if (need_implicitly_determined)
3740 const char *share_name = NULL;
3742 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3743 share_name = "threadprivate";
3744 else switch (cxx_omp_predetermined_sharing (t))
3746 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3748 case OMP_CLAUSE_DEFAULT_SHARED:
3749 share_name = "shared";
3751 case OMP_CLAUSE_DEFAULT_PRIVATE:
3752 share_name = "private";
3759 error ("%qE is predetermined %qs for %qs",
3760 t, share_name, name);
3765 /* We're interested in the base element, not arrays. */
3766 inner_type = type = TREE_TYPE (t);
3767 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3768 inner_type = TREE_TYPE (inner_type);
3770 /* Check for special function availability by building a call to one.
3771 Save the results, because later we won't be in the right context
3772 for making these queries. */
3773 if (CLASS_TYPE_P (inner_type)
3774 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3775 && !type_dependent_expression_p (t)
3776 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3777 need_copy_ctor, need_copy_assignment))
3781 *pc = OMP_CLAUSE_CHAIN (c);
3783 pc = &OMP_CLAUSE_CHAIN (c);
3786 bitmap_obstack_release (NULL);
3790 /* For all variables in the tree_list VARS, mark them as thread local. */
3793 finish_omp_threadprivate (tree vars)
3797 /* Mark every variable in VARS to be assigned thread local storage. */
3798 for (t = vars; t; t = TREE_CHAIN (t))
3800 tree v = TREE_PURPOSE (t);
3802 if (error_operand_p (v))
3804 else if (TREE_CODE (v) != VAR_DECL)
3805 error ("%<threadprivate%> %qD is not file, namespace "
3806 "or block scope variable", v);
3807 /* If V had already been marked threadprivate, it doesn't matter
3808 whether it had been used prior to this point. */
3809 else if (TREE_USED (v)
3810 && (DECL_LANG_SPECIFIC (v) == NULL
3811 || !CP_DECL_THREADPRIVATE_P (v)))
3812 error ("%qE declared %<threadprivate%> after first use", v);
3813 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3814 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3815 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3816 error ("%<threadprivate%> %qE has incomplete type", v);
3817 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3818 && CP_DECL_CONTEXT (v) != current_class_type)
3819 error ("%<threadprivate%> %qE directive not "
3820 "in %qT definition", v, CP_DECL_CONTEXT (v));
3823 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3824 if (DECL_LANG_SPECIFIC (v) == NULL)
3826 retrofit_lang_decl (v);
3828 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3829 after the allocation of the lang_decl structure. */
3830 if (DECL_DISCRIMINATOR_P (v))
3831 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3834 if (! DECL_THREAD_LOCAL_P (v))
3836 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3837 /* If rtl has been already set for this var, call
3838 make_decl_rtl once again, so that encode_section_info
3839 has a chance to look at the new decl flags. */
3840 if (DECL_RTL_SET_P (v))
3843 CP_DECL_THREADPRIVATE_P (v) = 1;
3848 /* Build an OpenMP structured block. */
3851 begin_omp_structured_block (void)
3853 return do_pushlevel (sk_omp);
3857 finish_omp_structured_block (tree block)
3859 return do_poplevel (block);
3862 /* Similarly, except force the retention of the BLOCK. */
3865 begin_omp_parallel (void)
3867 keep_next_level (true);
3868 return begin_omp_structured_block ();
3872 finish_omp_parallel (tree clauses, tree body)
3876 body = finish_omp_structured_block (body);
3878 stmt = make_node (OMP_PARALLEL);
3879 TREE_TYPE (stmt) = void_type_node;
3880 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3881 OMP_PARALLEL_BODY (stmt) = body;
3883 return add_stmt (stmt);
3887 begin_omp_task (void)
3889 keep_next_level (true);
3890 return begin_omp_structured_block ();
3894 finish_omp_task (tree clauses, tree body)
3898 body = finish_omp_structured_block (body);
3900 stmt = make_node (OMP_TASK);
3901 TREE_TYPE (stmt) = void_type_node;
3902 OMP_TASK_CLAUSES (stmt) = clauses;
3903 OMP_TASK_BODY (stmt) = body;
3905 return add_stmt (stmt);
3908 /* Helper function for finish_omp_for. Convert Ith random access iterator
3909 into integral iterator. Return FALSE if successful. */
3912 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3913 tree condv, tree incrv, tree *body,
3914 tree *pre_body, tree clauses)
3916 tree diff, iter_init, iter_incr = NULL, last;
3917 tree incr_var = NULL, orig_pre_body, orig_body, c;
3918 tree decl = TREE_VEC_ELT (declv, i);
3919 tree init = TREE_VEC_ELT (initv, i);
3920 tree cond = TREE_VEC_ELT (condv, i);
3921 tree incr = TREE_VEC_ELT (incrv, i);
3923 location_t elocus = locus;
3925 if (init && EXPR_HAS_LOCATION (init))
3926 elocus = EXPR_LOCATION (init);
3928 switch (TREE_CODE (cond))
3934 if (TREE_OPERAND (cond, 1) == iter)
3935 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
3936 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
3937 if (TREE_OPERAND (cond, 0) != iter)
3938 cond = error_mark_node;
3941 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3942 TREE_OPERAND (cond, 1), ERROR_MARK,
3943 NULL, tf_warning_or_error);
3944 if (error_operand_p (tem))
3949 cond = error_mark_node;
3952 if (cond == error_mark_node)
3954 error ("%Hinvalid controlling predicate", &elocus);
3957 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
3958 ERROR_MARK, iter, ERROR_MARK, NULL,
3959 tf_warning_or_error);
3960 if (error_operand_p (diff))
3962 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
3964 error ("%Hdifference between %qE and %qD does not have integer type",
3965 &elocus, TREE_OPERAND (cond, 1), iter);
3969 switch (TREE_CODE (incr))
3971 case PREINCREMENT_EXPR:
3972 case PREDECREMENT_EXPR:
3973 case POSTINCREMENT_EXPR:
3974 case POSTDECREMENT_EXPR:
3975 if (TREE_OPERAND (incr, 0) != iter)
3977 incr = error_mark_node;
3980 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
3981 tf_warning_or_error);
3982 if (error_operand_p (iter_incr))
3984 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
3985 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
3986 incr = integer_one_node;
3988 incr = integer_minus_one_node;
3991 if (TREE_OPERAND (incr, 0) != iter)
3992 incr = error_mark_node;
3993 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
3994 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
3996 tree rhs = TREE_OPERAND (incr, 1);
3997 if (TREE_OPERAND (rhs, 0) == iter)
3999 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4001 incr = error_mark_node;
4004 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4005 TREE_OPERAND (rhs, 1),
4006 tf_warning_or_error);
4007 if (error_operand_p (iter_incr))
4009 incr = TREE_OPERAND (rhs, 1);
4010 incr = cp_convert (TREE_TYPE (diff), incr);
4011 if (TREE_CODE (rhs) == MINUS_EXPR)
4013 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4014 incr = fold_if_not_in_template (incr);
4016 if (TREE_CODE (incr) != INTEGER_CST
4017 && (TREE_CODE (incr) != NOP_EXPR
4018 || (TREE_CODE (TREE_OPERAND (incr, 0))
4023 else if (TREE_OPERAND (rhs, 1) == iter)
4025 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4026 || TREE_CODE (rhs) != PLUS_EXPR)
4027 incr = error_mark_node;
4030 iter_incr = build_x_binary_op (PLUS_EXPR,
4031 TREE_OPERAND (rhs, 0),
4034 tf_warning_or_error);
4035 if (error_operand_p (iter_incr))
4037 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4039 tf_warning_or_error);
4040 if (error_operand_p (iter_incr))
4042 incr = TREE_OPERAND (rhs, 0);
4047 incr = error_mark_node;
4050 incr = error_mark_node;
4053 incr = error_mark_node;
4057 if (incr == error_mark_node)
4059 error ("%Hinvalid increment expression", &elocus);
4063 incr = cp_convert (TREE_TYPE (diff), incr);
4064 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4065 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4066 && OMP_CLAUSE_DECL (c) == iter)
4069 decl = create_temporary_var (TREE_TYPE (diff));
4071 add_decl_expr (decl);
4072 last = create_temporary_var (TREE_TYPE (diff));
4074 add_decl_expr (last);
4075 if (c && iter_incr == NULL)
4077 incr_var = create_temporary_var (TREE_TYPE (diff));
4078 pushdecl (incr_var);
4079 add_decl_expr (incr_var);
4081 gcc_assert (stmts_are_full_exprs_p ());
4083 orig_pre_body = *pre_body;
4084 *pre_body = push_stmt_list ();
4086 add_stmt (orig_pre_body);
4088 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4089 tf_warning_or_error));
4090 init = build_int_cst (TREE_TYPE (diff), 0);
4091 if (c && iter_incr == NULL)
4093 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4094 incr, tf_warning_or_error));
4096 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4097 tf_warning_or_error);
4099 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4100 tf_warning_or_error));
4101 *pre_body = pop_stmt_list (*pre_body);
4103 cond = cp_build_binary_op (elocus,
4104 TREE_CODE (cond), decl, diff,
4105 tf_warning_or_error);
4106 incr = build_modify_expr (elocus, decl, PLUS_EXPR, incr);
4109 *body = push_stmt_list ();
4110 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4111 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4112 tf_warning_or_error);
4113 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4114 finish_expr_stmt (iter_init);
4115 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4116 tf_warning_or_error));
4117 add_stmt (orig_body);
4118 *body = pop_stmt_list (*body);
4122 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4123 finish_expr_stmt (iter_incr);
4124 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4125 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4128 TREE_VEC_ELT (declv, i) = decl;
4129 TREE_VEC_ELT (initv, i) = init;
4130 TREE_VEC_ELT (condv, i) = cond;
4131 TREE_VEC_ELT (incrv, i) = incr;
4136 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4137 are directly for their associated operands in the statement. DECL
4138 and INIT are a combo; if DECL is NULL then INIT ought to be a
4139 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4140 optional statements that need to go before the loop into its
4144 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4145 tree incrv, tree body, tree pre_body, tree clauses)
4147 tree omp_for = NULL, orig_incr = NULL;
4148 tree decl, init, cond, incr;
4152 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4153 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4154 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4155 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4157 decl = TREE_VEC_ELT (declv, i);
4158 init = TREE_VEC_ELT (initv, i);
4159 cond = TREE_VEC_ELT (condv, i);
4160 incr = TREE_VEC_ELT (incrv, i);
4166 switch (TREE_CODE (init))
4169 decl = TREE_OPERAND (init, 0);
4170 init = TREE_OPERAND (init, 1);
4173 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4175 decl = TREE_OPERAND (init, 0);
4176 init = TREE_OPERAND (init, 2);
4185 error ("%Hexpected iteration declaration or initialization",
4191 if (init && EXPR_HAS_LOCATION (init))
4192 elocus = EXPR_LOCATION (init);
4196 error ("%Hmissing controlling predicate", &elocus);
4202 error ("%Hmissing increment expression", &elocus);
4206 TREE_VEC_ELT (declv, i) = decl;
4207 TREE_VEC_ELT (initv, i) = init;
4210 if (dependent_omp_for_p (declv, initv, condv, incrv))
4214 stmt = make_node (OMP_FOR);
4216 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4218 /* This is really just a place-holder. We'll be decomposing this
4219 again and going through the cp_build_modify_expr path below when
4220 we instantiate the thing. */
4221 TREE_VEC_ELT (initv, i)
4222 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4223 TREE_VEC_ELT (initv, i));
4226 TREE_TYPE (stmt) = void_type_node;
4227 OMP_FOR_INIT (stmt) = initv;
4228 OMP_FOR_COND (stmt) = condv;
4229 OMP_FOR_INCR (stmt) = incrv;
4230 OMP_FOR_BODY (stmt) = body;
4231 OMP_FOR_PRE_BODY (stmt) = pre_body;
4232 OMP_FOR_CLAUSES (stmt) = clauses;
4234 SET_EXPR_LOCATION (stmt, locus);
4235 return add_stmt (stmt);
4238 if (processing_template_decl)
4239 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4241 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4243 decl = TREE_VEC_ELT (declv, i);
4244 init = TREE_VEC_ELT (initv, i);
4245 cond = TREE_VEC_ELT (condv, i);
4246 incr = TREE_VEC_ELT (incrv, i);
4248 TREE_VEC_ELT (orig_incr, i) = incr;
4251 if (init && EXPR_HAS_LOCATION (init))
4252 elocus = EXPR_LOCATION (init);
4256 error ("%Hexpected iteration declaration or initialization",
4261 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4264 TREE_VEC_ELT (orig_incr, i) = incr;
4265 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4266 TREE_CODE (TREE_OPERAND (incr, 1)),
4267 TREE_OPERAND (incr, 2),
4268 tf_warning_or_error);
4271 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4273 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4274 incrv, &body, &pre_body, clauses))
4279 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4280 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4282 error ("%Hinvalid type for iteration variable %qE", &elocus, decl);
4286 if (!processing_template_decl)
4288 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4289 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4292 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4294 && TREE_SIDE_EFFECTS (cond)
4295 && COMPARISON_CLASS_P (cond)
4296 && !processing_template_decl)
4298 tree t = TREE_OPERAND (cond, 0);
4299 if (TREE_SIDE_EFFECTS (t)
4301 && (TREE_CODE (t) != NOP_EXPR
4302 || TREE_OPERAND (t, 0) != decl))
4303 TREE_OPERAND (cond, 0)
4304 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4306 t = TREE_OPERAND (cond, 1);
4307 if (TREE_SIDE_EFFECTS (t)
4309 && (TREE_CODE (t) != NOP_EXPR
4310 || TREE_OPERAND (t, 0) != decl))
4311 TREE_OPERAND (cond, 1)
4312 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4314 if (decl == error_mark_node || init == error_mark_node)
4317 TREE_VEC_ELT (declv, i) = decl;
4318 TREE_VEC_ELT (initv, i) = init;
4319 TREE_VEC_ELT (condv, i) = cond;
4320 TREE_VEC_ELT (incrv, i) = incr;
4324 if (IS_EMPTY_STMT (pre_body))
4327 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4330 if (omp_for == NULL)
4333 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4335 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4336 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4338 if (TREE_CODE (incr) != MODIFY_EXPR)
4341 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4342 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4343 && !processing_template_decl)
4345 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4346 if (TREE_SIDE_EFFECTS (t)
4348 && (TREE_CODE (t) != NOP_EXPR
4349 || TREE_OPERAND (t, 0) != decl))
4350 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4351 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4353 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4354 if (TREE_SIDE_EFFECTS (t)
4356 && (TREE_CODE (t) != NOP_EXPR
4357 || TREE_OPERAND (t, 0) != decl))
4358 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4359 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4363 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4365 if (omp_for != NULL)
4366 OMP_FOR_CLAUSES (omp_for) = clauses;
4371 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4380 dependent_p = false;
4383 /* Even in a template, we can detect invalid uses of the atomic
4384 pragma if neither LHS nor RHS is type-dependent. */
4385 if (processing_template_decl)
4387 dependent_p = (type_dependent_expression_p (lhs)
4388 || type_dependent_expression_p (rhs));
4391 lhs = build_non_dependent_expr (lhs);
4392 rhs = build_non_dependent_expr (rhs);
4397 stmt = c_finish_omp_atomic (code, lhs, rhs);
4398 if (stmt == error_mark_node)
4401 if (processing_template_decl)
4402 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4403 build2 (code, void_type_node, orig_lhs, orig_rhs));
4408 finish_omp_barrier (void)
4410 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4411 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4412 finish_expr_stmt (stmt);
4416 finish_omp_flush (void)
4418 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4419 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4420 finish_expr_stmt (stmt);
4424 finish_omp_taskwait (void)
4426 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4427 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4428 finish_expr_stmt (stmt);
4432 init_cp_semantics (void)
4436 /* Build a STATIC_ASSERT for a static assertion with the condition
4437 CONDITION and the message text MESSAGE. LOCATION is the location
4438 of the static assertion in the source code. When MEMBER_P, this
4439 static assertion is a member of a class. */
4441 finish_static_assert (tree condition, tree message, location_t location,
4444 if (check_for_bare_parameter_packs (condition))
4445 condition = error_mark_node;
4447 if (type_dependent_expression_p (condition)
4448 || value_dependent_expression_p (condition))
4450 /* We're in a template; build a STATIC_ASSERT and put it in
4454 assertion = make_node (STATIC_ASSERT);
4455 STATIC_ASSERT_CONDITION (assertion) = condition;
4456 STATIC_ASSERT_MESSAGE (assertion) = message;
4457 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4460 maybe_add_class_template_decl_list (current_class_type,
4464 add_stmt (assertion);
4469 /* Fold the expression and convert it to a boolean value. */
4470 condition = fold_non_dependent_expr (condition);
4471 condition = cp_convert (boolean_type_node, condition);
4473 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4474 /* Do nothing; the condition is satisfied. */
4478 location_t saved_loc = input_location;
4480 input_location = location;
4481 if (TREE_CODE (condition) == INTEGER_CST
4482 && integer_zerop (condition))
4483 /* Report the error. */
4484 error ("static assertion failed: %E", message);
4485 else if (condition && condition != error_mark_node)
4486 error ("non-constant condition for static assertion");
4487 input_location = saved_loc;
4491 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4492 just return the type even though EXPR is a type-dependent expression.
4493 The ABI specifies which cases this applies to, which is a subset of the
4497 describable_type (tree expr)
4499 tree type = NULL_TREE;
4501 /* processing_template_decl isn't set when we're called from the mangling
4502 code, so bump it now. */
4503 ++processing_template_decl;
4504 if (! type_dependent_expression_p (expr)
4505 && ! type_unknown_p (expr))
4507 type = TREE_TYPE (expr);
4508 if (real_lvalue_p (expr))
4509 type = build_reference_type (type);
4511 --processing_template_decl;
4516 switch (TREE_CODE (expr))
4522 /* Named rvalue reference becomes lvalue. */
4523 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4528 case TEMPLATE_PARM_INDEX:
4530 case STATIC_CAST_EXPR:
4531 case REINTERPRET_CAST_EXPR:
4532 case CONST_CAST_EXPR:
4533 case DYNAMIC_CAST_EXPR:
4534 type = TREE_TYPE (expr);
4539 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4540 if (ptrtype && POINTER_TYPE_P (ptrtype))
4541 type = build_reference_type (TREE_TYPE (ptrtype));
4546 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4547 type = TREE_TYPE (expr);
4551 if (type && type_uses_auto (type))
4557 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4558 suitable for use as a type-specifier.
4560 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4561 id-expression or a class member access, FALSE when it was parsed as
4562 a full expression. */
4565 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4567 tree orig_expr = expr;
4568 tree type = NULL_TREE;
4570 if (!expr || error_operand_p (expr))
4571 return error_mark_node;
4574 || TREE_CODE (expr) == TYPE_DECL
4575 || (TREE_CODE (expr) == BIT_NOT_EXPR
4576 && TYPE_P (TREE_OPERAND (expr, 0))))
4578 error ("argument to decltype must be an expression");
4579 return error_mark_node;
4582 if (type_dependent_expression_p (expr))
4584 if (id_expression_or_member_access_p)
4586 switch (TREE_CODE (expr))
4593 case TEMPLATE_PARM_INDEX:
4594 type = TREE_TYPE (expr);
4602 if (type && !type_uses_auto (type))
4605 type = cxx_make_type (DECLTYPE_TYPE);
4606 DECLTYPE_TYPE_EXPR (type) = expr;
4607 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4608 = id_expression_or_member_access_p;
4609 SET_TYPE_STRUCTURAL_EQUALITY (type);
4614 /* The type denoted by decltype(e) is defined as follows: */
4616 if (id_expression_or_member_access_p)
4618 /* If e is an id-expression or a class member access (5.2.5
4619 [expr.ref]), decltype(e) is defined as the type of the entity
4620 named by e. If there is no such entity, or e names a set of
4621 overloaded functions, the program is ill-formed. */
4622 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4623 expr = lookup_name (expr);
4625 if (TREE_CODE (expr) == INDIRECT_REF)
4626 /* This can happen when the expression is, e.g., "a.b". Just
4627 look at the underlying operand. */
4628 expr = TREE_OPERAND (expr, 0);
4630 if (TREE_CODE (expr) == OFFSET_REF
4631 || TREE_CODE (expr) == MEMBER_REF)
4632 /* We're only interested in the field itself. If it is a
4633 BASELINK, we will need to see through it in the next
4635 expr = TREE_OPERAND (expr, 1);
4637 if (TREE_CODE (expr) == BASELINK)
4638 /* See through BASELINK nodes to the underlying functions. */
4639 expr = BASELINK_FUNCTIONS (expr);
4641 if (TREE_CODE (expr) == OVERLOAD)
4643 if (OVL_CHAIN (expr))
4645 error ("%qE refers to a set of overloaded functions", orig_expr);
4646 return error_mark_node;
4649 /* An overload set containing only one function: just look
4650 at that function. */
4651 expr = OVL_FUNCTION (expr);
4654 switch (TREE_CODE (expr))
4657 if (DECL_BIT_FIELD_TYPE (expr))
4659 type = DECL_BIT_FIELD_TYPE (expr);
4662 /* Fall through for fields that aren't bitfields. */
4669 case TEMPLATE_PARM_INDEX:
4670 type = TREE_TYPE (expr);
4674 type = error_mark_node;
4678 type = is_bitfield_expr_with_lowered_type (expr);
4680 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4687 /* We can get here when the id-expression refers to an
4689 type = TREE_TYPE (expr);
4693 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4694 || TREE_CODE (expr) == SCOPE_REF);
4695 error ("argument to decltype must be an expression");
4696 return error_mark_node;
4701 /* Expressions of reference type are sometimes wrapped in
4702 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4703 representation, not part of the language, so we have to look
4705 if (TREE_CODE (expr) == INDIRECT_REF
4706 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4708 expr = TREE_OPERAND (expr, 0);
4710 if (TREE_CODE (expr) == CALL_EXPR)
4712 /* If e is a function call (5.2.2 [expr.call]) or an
4713 invocation of an overloaded operator (parentheses around e
4714 are ignored), decltype(e) is defined as the return type of
4716 tree fndecl = get_callee_fndecl (expr);
4717 if (fndecl && fndecl != error_mark_node)
4718 type = TREE_TYPE (TREE_TYPE (fndecl));
4721 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4722 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4723 || TREE_CODE (target_type) == POINTER_TYPE)
4724 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4725 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4726 type = TREE_TYPE (TREE_TYPE (target_type));
4728 sorry ("unable to determine the declared type of expression %<%E%>",
4734 type = is_bitfield_expr_with_lowered_type (expr);
4737 /* Bitfields are special, because their type encodes the
4738 number of bits they store. If the expression referenced a
4739 bitfield, TYPE now has the declared type of that
4741 type = cp_build_qualified_type (type,
4742 cp_type_quals (TREE_TYPE (expr)));
4744 if (real_lvalue_p (expr))
4745 type = build_reference_type (type);
4749 /* Otherwise, where T is the type of e, if e is an lvalue,
4750 decltype(e) is defined as T&, otherwise decltype(e) is
4752 type = TREE_TYPE (expr);
4753 if (type == error_mark_node)
4754 return error_mark_node;
4755 else if (expr == current_class_ptr)
4756 /* If the expression is just "this", we want the
4757 cv-unqualified pointer for the "this" type. */
4758 type = TYPE_MAIN_VARIANT (type);
4759 else if (real_lvalue_p (expr))
4761 if (TREE_CODE (type) != REFERENCE_TYPE)
4762 type = build_reference_type (type);
4765 type = non_reference (type);
4770 if (!type || type == unknown_type_node)
4772 error ("type of %qE is unknown", expr);
4773 return error_mark_node;
4779 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4780 __has_nothrow_copy, depending on assign_p. */
4783 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4790 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4793 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4795 else if (TYPE_HAS_INIT_REF (type))
4797 /* If construction of the copy constructor was postponed, create
4799 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4800 lazily_declare_fn (sfk_copy_constructor, type);
4801 fns = CLASSTYPE_CONSTRUCTORS (type);
4806 for (; fns; fns = OVL_NEXT (fns))
4808 tree fn = OVL_CURRENT (fns);
4812 if (copy_fn_p (fn) == 0)
4815 else if (copy_fn_p (fn) <= 0)
4818 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4825 /* Actually evaluates the trait. */
4828 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4830 enum tree_code type_code1;
4833 type_code1 = TREE_CODE (type1);
4837 case CPTK_HAS_NOTHROW_ASSIGN:
4838 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4839 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4840 || (CLASS_TYPE_P (type1)
4841 && classtype_has_nothrow_assign_or_copy_p (type1,
4844 case CPTK_HAS_TRIVIAL_ASSIGN:
4845 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4846 && (pod_type_p (type1)
4847 || (CLASS_TYPE_P (type1)
4848 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4850 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4851 type1 = strip_array_types (type1);
4852 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4853 || (CLASS_TYPE_P (type1)
4854 && (t = locate_ctor (type1, NULL))
4855 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4857 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4858 type1 = strip_array_types (type1);
4859 return (pod_type_p (type1)
4860 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4862 case CPTK_HAS_NOTHROW_COPY:
4863 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4864 || (CLASS_TYPE_P (type1)
4865 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4867 case CPTK_HAS_TRIVIAL_COPY:
4868 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4869 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4871 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4872 type1 = strip_array_types (type1);
4873 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4874 || (CLASS_TYPE_P (type1)
4875 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4877 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4878 return (CLASS_TYPE_P (type1)
4879 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4881 case CPTK_IS_ABSTRACT:
4882 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4884 case CPTK_IS_BASE_OF:
4885 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4886 && DERIVED_FROM_P (type1, type2));
4889 return (NON_UNION_CLASS_TYPE_P (type1));
4891 case CPTK_IS_CONVERTIBLE_TO:
4896 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4899 return (type_code1 == ENUMERAL_TYPE);
4902 return (pod_type_p (type1));
4904 case CPTK_IS_POLYMORPHIC:
4905 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4908 return (type_code1 == UNION_TYPE);
4916 /* Returns true if TYPE is a complete type, an array of unknown bound,
4917 or (possibly cv-qualified) void, returns false otherwise. */
4920 check_trait_type (tree type)
4922 if (COMPLETE_TYPE_P (type))
4925 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
4928 if (VOID_TYPE_P (type))
4934 /* Process a trait expression. */
4937 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4939 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4940 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4941 || kind == CPTK_HAS_NOTHROW_COPY
4942 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4943 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4944 || kind == CPTK_HAS_TRIVIAL_COPY
4945 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4946 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4947 || kind == CPTK_IS_ABSTRACT
4948 || kind == CPTK_IS_BASE_OF
4949 || kind == CPTK_IS_CLASS
4950 || kind == CPTK_IS_CONVERTIBLE_TO
4951 || kind == CPTK_IS_EMPTY
4952 || kind == CPTK_IS_ENUM
4953 || kind == CPTK_IS_POD
4954 || kind == CPTK_IS_POLYMORPHIC
4955 || kind == CPTK_IS_UNION);
4957 if (kind == CPTK_IS_CONVERTIBLE_TO)
4959 sorry ("__is_convertible_to");
4960 return error_mark_node;
4963 if (type1 == error_mark_node
4964 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4965 && type2 == error_mark_node))
4966 return error_mark_node;
4968 if (processing_template_decl)
4970 tree trait_expr = make_node (TRAIT_EXPR);
4971 TREE_TYPE (trait_expr) = boolean_type_node;
4972 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4973 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4974 TRAIT_EXPR_KIND (trait_expr) = kind;
4978 complete_type (type1);
4980 complete_type (type2);
4984 case CPTK_HAS_NOTHROW_ASSIGN:
4985 case CPTK_HAS_TRIVIAL_ASSIGN:
4986 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4987 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4988 case CPTK_HAS_NOTHROW_COPY:
4989 case CPTK_HAS_TRIVIAL_COPY:
4990 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4991 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4992 case CPTK_IS_ABSTRACT:
4995 case CPTK_IS_POLYMORPHIC:
4996 if (!check_trait_type (type1))
4998 error ("incomplete type %qT not allowed", type1);
4999 return error_mark_node;
5003 case CPTK_IS_BASE_OF:
5004 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5005 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5006 && !COMPLETE_TYPE_P (type2))
5008 error ("incomplete type %qT not allowed", type2);
5009 return error_mark_node;
5018 case CPTK_IS_CONVERTIBLE_TO:
5023 return (trait_expr_value (kind, type1, type2)
5024 ? boolean_true_node : boolean_false_node);
5027 #include "gt-cp-semantics.h"