1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
34 #include "tree-inline.h"
35 #include "tree-mudflap.h"
44 #include "diagnostic.h"
46 #include "tree-iterator.h"
50 /* There routines provide a modular interface to perform many parsing
51 operations. They may therefore be used during actual parsing, or
52 during template instantiation, which may be regarded as a
53 degenerate form of parsing. */
55 static tree maybe_convert_cond (tree);
56 static tree simplify_aggr_init_exprs_r (tree *, int *, void *);
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 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
432 flag for this because "A union for which objects or pointers are
433 declared is not an anonymous union" [class.union]. */
436 anon_aggr_type_p (const_tree node)
438 return ANON_AGGR_TYPE_P (node);
441 /* Finish a scope. */
444 do_poplevel (tree stmt_list)
448 if (stmts_are_full_exprs_p ())
449 block = poplevel (kept_level_p (), 1, 0);
451 stmt_list = pop_stmt_list (stmt_list);
453 if (!processing_template_decl)
455 stmt_list = c_build_bind_expr (block, stmt_list);
456 /* ??? See c_end_compound_stmt re statement expressions. */
462 /* Begin a new scope. */
465 do_pushlevel (scope_kind sk)
467 tree ret = push_stmt_list ();
468 if (stmts_are_full_exprs_p ())
469 begin_scope (sk, NULL);
473 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
474 when the current scope is exited. EH_ONLY is true when this is not
475 meant to apply to normal control flow transfer. */
478 push_cleanup (tree decl, tree cleanup, bool eh_only)
480 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
481 CLEANUP_EH_ONLY (stmt) = eh_only;
483 CLEANUP_BODY (stmt) = push_stmt_list ();
486 /* Begin a conditional that might contain a declaration. When generating
487 normal code, we want the declaration to appear before the statement
488 containing the conditional. When generating template code, we want the
489 conditional to be rendered as the raw DECL_EXPR. */
492 begin_cond (tree *cond_p)
494 if (processing_template_decl)
495 *cond_p = push_stmt_list ();
498 /* Finish such a conditional. */
501 finish_cond (tree *cond_p, tree expr)
503 if (processing_template_decl)
505 tree cond = pop_stmt_list (*cond_p);
506 if (TREE_CODE (cond) == DECL_EXPR)
509 if (check_for_bare_parameter_packs (expr))
510 *cond_p = error_mark_node;
515 /* If *COND_P specifies a conditional with a declaration, transform the
518 for (; A x = 42;) { }
520 while (true) { A x = 42; if (!x) break; }
521 for (;;) { A x = 42; if (!x) break; }
522 The statement list for BODY will be empty if the conditional did
523 not declare anything. */
526 simplify_loop_decl_cond (tree *cond_p, tree body)
530 if (!TREE_SIDE_EFFECTS (body))
534 *cond_p = boolean_true_node;
536 if_stmt = begin_if_stmt ();
537 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
538 finish_if_stmt_cond (cond, if_stmt);
539 finish_break_stmt ();
540 finish_then_clause (if_stmt);
541 finish_if_stmt (if_stmt);
544 /* Finish a goto-statement. */
547 finish_goto_stmt (tree destination)
549 if (TREE_CODE (destination) == IDENTIFIER_NODE)
550 destination = lookup_label (destination);
552 /* We warn about unused labels with -Wunused. That means we have to
553 mark the used labels as used. */
554 if (TREE_CODE (destination) == LABEL_DECL)
555 TREE_USED (destination) = 1;
558 /* The DESTINATION is being used as an rvalue. */
559 if (!processing_template_decl)
560 destination = decay_conversion (destination);
561 /* We don't inline calls to functions with computed gotos.
562 Those functions are typically up to some funny business,
563 and may be depending on the labels being at particular
564 addresses, or some such. */
565 DECL_UNINLINABLE (current_function_decl) = 1;
568 check_goto (destination);
570 return add_stmt (build_stmt (GOTO_EXPR, destination));
573 /* COND is the condition-expression for an if, while, etc.,
574 statement. Convert it to a boolean value, if appropriate. */
577 maybe_convert_cond (tree cond)
579 /* Empty conditions remain empty. */
583 /* Wait until we instantiate templates before doing conversion. */
584 if (processing_template_decl)
587 /* Do the conversion. */
588 cond = convert_from_reference (cond);
590 if (TREE_CODE (cond) == MODIFY_EXPR
591 && !TREE_NO_WARNING (cond)
594 warning (OPT_Wparentheses,
595 "suggest parentheses around assignment used as truth value");
596 TREE_NO_WARNING (cond) = 1;
599 return condition_conversion (cond);
602 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
605 finish_expr_stmt (tree expr)
609 if (expr != NULL_TREE)
611 if (!processing_template_decl)
613 if (warn_sequence_point)
614 verify_sequence_points (expr);
615 expr = convert_to_void (expr, "statement", tf_warning_or_error);
617 else if (!type_dependent_expression_p (expr))
618 convert_to_void (build_non_dependent_expr (expr), "statement",
619 tf_warning_or_error);
621 if (check_for_bare_parameter_packs (expr))
622 expr = error_mark_node;
624 /* Simplification of inner statement expressions, compound exprs,
625 etc can result in us already having an EXPR_STMT. */
626 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
628 if (TREE_CODE (expr) != EXPR_STMT)
629 expr = build_stmt (EXPR_STMT, expr);
630 expr = maybe_cleanup_point_expr_void (expr);
642 /* Begin an if-statement. Returns a newly created IF_STMT if
649 scope = do_pushlevel (sk_block);
650 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
651 TREE_CHAIN (r) = scope;
652 begin_cond (&IF_COND (r));
656 /* Process the COND of an if-statement, which may be given by
660 finish_if_stmt_cond (tree cond, tree if_stmt)
662 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
664 THEN_CLAUSE (if_stmt) = push_stmt_list ();
667 /* Finish the then-clause of an if-statement, which may be given by
671 finish_then_clause (tree if_stmt)
673 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
677 /* Begin the else-clause of an if-statement. */
680 begin_else_clause (tree if_stmt)
682 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
685 /* Finish the else-clause of an if-statement, which may be given by
689 finish_else_clause (tree if_stmt)
691 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
694 /* Finish an if-statement. */
697 finish_if_stmt (tree if_stmt)
699 tree scope = TREE_CHAIN (if_stmt);
700 TREE_CHAIN (if_stmt) = NULL;
701 add_stmt (do_poplevel (scope));
703 empty_if_body_warning (THEN_CLAUSE (if_stmt), ELSE_CLAUSE (if_stmt));
706 /* Begin a while-statement. Returns a newly created WHILE_STMT if
710 begin_while_stmt (void)
713 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
715 WHILE_BODY (r) = do_pushlevel (sk_block);
716 begin_cond (&WHILE_COND (r));
720 /* Process the COND of a while-statement, which may be given by
724 finish_while_stmt_cond (tree cond, tree while_stmt)
726 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
727 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
730 /* Finish a while-statement, which may be given by WHILE_STMT. */
733 finish_while_stmt (tree while_stmt)
735 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
739 /* Begin a do-statement. Returns a newly created DO_STMT if
745 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
747 DO_BODY (r) = push_stmt_list ();
751 /* Finish the body of a do-statement, which may be given by DO_STMT. */
754 finish_do_body (tree do_stmt)
756 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
758 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
759 body = STATEMENT_LIST_TAIL (body)->stmt;
761 if (IS_EMPTY_STMT (body))
762 warning (OPT_Wempty_body,
763 "suggest explicit braces around empty body in %<do%> statement");
766 /* Finish a do-statement, which may be given by DO_STMT, and whose
767 COND is as indicated. */
770 finish_do_stmt (tree cond, tree do_stmt)
772 cond = maybe_convert_cond (cond);
773 DO_COND (do_stmt) = cond;
777 /* Finish a return-statement. The EXPRESSION returned, if any, is as
781 finish_return_stmt (tree expr)
786 expr = check_return_expr (expr, &no_warning);
788 if (flag_openmp && !check_omp_return ())
789 return error_mark_node;
790 if (!processing_template_decl)
792 if (DECL_DESTRUCTOR_P (current_function_decl)
793 || (DECL_CONSTRUCTOR_P (current_function_decl)
794 && targetm.cxx.cdtor_returns_this ()))
796 /* Similarly, all destructors must run destructors for
797 base-classes before returning. So, all returns in a
798 destructor get sent to the DTOR_LABEL; finish_function emits
799 code to return a value there. */
800 return finish_goto_stmt (cdtor_label);
804 r = build_stmt (RETURN_EXPR, expr);
805 TREE_NO_WARNING (r) |= no_warning;
806 r = maybe_cleanup_point_expr_void (r);
813 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
816 begin_for_stmt (void)
820 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
821 NULL_TREE, NULL_TREE);
823 if (flag_new_for_scope > 0)
824 TREE_CHAIN (r) = do_pushlevel (sk_for);
826 if (processing_template_decl)
827 FOR_INIT_STMT (r) = push_stmt_list ();
832 /* Finish the for-init-statement of a for-statement, which may be
833 given by FOR_STMT. */
836 finish_for_init_stmt (tree for_stmt)
838 if (processing_template_decl)
839 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
841 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
842 begin_cond (&FOR_COND (for_stmt));
845 /* Finish the COND of a for-statement, which may be given by
849 finish_for_cond (tree cond, tree for_stmt)
851 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
852 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
855 /* Finish the increment-EXPRESSION in a for-statement, which may be
856 given by FOR_STMT. */
859 finish_for_expr (tree expr, tree for_stmt)
863 /* If EXPR is an overloaded function, issue an error; there is no
864 context available to use to perform overload resolution. */
865 if (type_unknown_p (expr))
867 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
868 expr = error_mark_node;
870 if (!processing_template_decl)
872 if (warn_sequence_point)
873 verify_sequence_points (expr);
874 expr = convert_to_void (expr, "3rd expression in for",
875 tf_warning_or_error);
877 else if (!type_dependent_expression_p (expr))
878 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for",
879 tf_warning_or_error);
880 expr = maybe_cleanup_point_expr_void (expr);
881 if (check_for_bare_parameter_packs (expr))
882 expr = error_mark_node;
883 FOR_EXPR (for_stmt) = expr;
886 /* Finish the body of a for-statement, which may be given by
887 FOR_STMT. The increment-EXPR for the loop must be
891 finish_for_stmt (tree for_stmt)
893 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
895 /* Pop the scope for the body of the loop. */
896 if (flag_new_for_scope > 0)
898 tree scope = TREE_CHAIN (for_stmt);
899 TREE_CHAIN (for_stmt) = NULL;
900 add_stmt (do_poplevel (scope));
906 /* Finish a break-statement. */
909 finish_break_stmt (void)
911 return add_stmt (build_stmt (BREAK_STMT));
914 /* Finish a continue-statement. */
917 finish_continue_stmt (void)
919 return add_stmt (build_stmt (CONTINUE_STMT));
922 /* Begin a switch-statement. Returns a new SWITCH_STMT if
926 begin_switch_stmt (void)
930 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
932 scope = do_pushlevel (sk_block);
933 TREE_CHAIN (r) = scope;
934 begin_cond (&SWITCH_STMT_COND (r));
939 /* Finish the cond of a switch-statement. */
942 finish_switch_cond (tree cond, tree switch_stmt)
944 tree orig_type = NULL;
945 if (!processing_template_decl)
949 /* Convert the condition to an integer or enumeration type. */
950 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
951 if (cond == NULL_TREE)
953 error ("switch quantity not an integer");
954 cond = error_mark_node;
956 orig_type = TREE_TYPE (cond);
957 if (cond != error_mark_node)
961 Integral promotions are performed. */
962 cond = perform_integral_promotions (cond);
963 cond = maybe_cleanup_point_expr (cond);
966 if (cond != error_mark_node)
968 index = get_unwidened (cond, NULL_TREE);
969 /* We can't strip a conversion from a signed type to an unsigned,
970 because if we did, int_fits_type_p would do the wrong thing
971 when checking case values for being in range,
972 and it's too hard to do the right thing. */
973 if (TYPE_UNSIGNED (TREE_TYPE (cond))
974 == TYPE_UNSIGNED (TREE_TYPE (index)))
978 if (check_for_bare_parameter_packs (cond))
979 cond = error_mark_node;
980 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
981 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
982 add_stmt (switch_stmt);
983 push_switch (switch_stmt);
984 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
987 /* Finish the body of a switch-statement, which may be given by
988 SWITCH_STMT. The COND to switch on is indicated. */
991 finish_switch_stmt (tree switch_stmt)
995 SWITCH_STMT_BODY (switch_stmt) =
996 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1000 scope = TREE_CHAIN (switch_stmt);
1001 TREE_CHAIN (switch_stmt) = NULL;
1002 add_stmt (do_poplevel (scope));
1005 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1009 begin_try_block (void)
1011 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
1013 TRY_STMTS (r) = push_stmt_list ();
1017 /* Likewise, for a function-try-block. The block returned in
1018 *COMPOUND_STMT is an artificial outer scope, containing the
1019 function-try-block. */
1022 begin_function_try_block (tree *compound_stmt)
1025 /* This outer scope does not exist in the C++ standard, but we need
1026 a place to put __FUNCTION__ and similar variables. */
1027 *compound_stmt = begin_compound_stmt (0);
1028 r = begin_try_block ();
1029 FN_TRY_BLOCK_P (r) = 1;
1033 /* Finish a try-block, which may be given by TRY_BLOCK. */
1036 finish_try_block (tree try_block)
1038 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1039 TRY_HANDLERS (try_block) = push_stmt_list ();
1042 /* Finish the body of a cleanup try-block, which may be given by
1046 finish_cleanup_try_block (tree try_block)
1048 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1051 /* Finish an implicitly generated try-block, with a cleanup is given
1055 finish_cleanup (tree cleanup, tree try_block)
1057 TRY_HANDLERS (try_block) = cleanup;
1058 CLEANUP_P (try_block) = 1;
1061 /* Likewise, for a function-try-block. */
1064 finish_function_try_block (tree try_block)
1066 finish_try_block (try_block);
1067 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1068 the try block, but moving it inside. */
1069 in_function_try_handler = 1;
1072 /* Finish a handler-sequence for a try-block, which may be given by
1076 finish_handler_sequence (tree try_block)
1078 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1079 check_handlers (TRY_HANDLERS (try_block));
1082 /* Finish the handler-seq for a function-try-block, given by
1083 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1084 begin_function_try_block. */
1087 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1089 in_function_try_handler = 0;
1090 finish_handler_sequence (try_block);
1091 finish_compound_stmt (compound_stmt);
1094 /* Begin a handler. Returns a HANDLER if appropriate. */
1097 begin_handler (void)
1101 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1104 /* Create a binding level for the eh_info and the exception object
1106 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1111 /* Finish the handler-parameters for a handler, which may be given by
1112 HANDLER. DECL is the declaration for the catch parameter, or NULL
1113 if this is a `catch (...)' clause. */
1116 finish_handler_parms (tree decl, tree handler)
1118 tree type = NULL_TREE;
1119 if (processing_template_decl)
1123 decl = pushdecl (decl);
1124 decl = push_template_decl (decl);
1125 HANDLER_PARMS (handler) = decl;
1126 type = TREE_TYPE (decl);
1130 type = expand_start_catch_block (decl);
1131 HANDLER_TYPE (handler) = type;
1132 if (!processing_template_decl && type)
1133 mark_used (eh_type_info (type));
1136 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1137 the return value from the matching call to finish_handler_parms. */
1140 finish_handler (tree handler)
1142 if (!processing_template_decl)
1143 expand_end_catch_block ();
1144 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1147 /* Begin a compound statement. FLAGS contains some bits that control the
1148 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1149 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1150 block of a function. If BCS_TRY_BLOCK is set, this is the block
1151 created on behalf of a TRY statement. Returns a token to be passed to
1152 finish_compound_stmt. */
1155 begin_compound_stmt (unsigned int flags)
1159 if (flags & BCS_NO_SCOPE)
1161 r = push_stmt_list ();
1162 STATEMENT_LIST_NO_SCOPE (r) = 1;
1164 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1165 But, if it's a statement-expression with a scopeless block, there's
1166 nothing to keep, and we don't want to accidentally keep a block
1167 *inside* the scopeless block. */
1168 keep_next_level (false);
1171 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1173 /* When processing a template, we need to remember where the braces were,
1174 so that we can set up identical scopes when instantiating the template
1175 later. BIND_EXPR is a handy candidate for this.
1176 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1177 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1178 processing templates. */
1179 if (processing_template_decl)
1181 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1182 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1183 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1184 TREE_SIDE_EFFECTS (r) = 1;
1190 /* Finish a compound-statement, which is given by STMT. */
1193 finish_compound_stmt (tree stmt)
1195 if (TREE_CODE (stmt) == BIND_EXPR)
1196 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1197 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1198 stmt = pop_stmt_list (stmt);
1201 /* Destroy any ObjC "super" receivers that may have been
1203 objc_clear_super_receiver ();
1205 stmt = do_poplevel (stmt);
1208 /* ??? See c_end_compound_stmt wrt statement expressions. */
1213 /* Finish an asm-statement, whose components are a STRING, some
1214 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1215 whether the asm-statement should be considered volatile. */
1218 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1219 tree input_operands, tree clobbers)
1223 int ninputs = list_length (input_operands);
1224 int noutputs = list_length (output_operands);
1226 if (!processing_template_decl)
1228 const char *constraint;
1229 const char **oconstraints;
1230 bool allows_mem, allows_reg, is_inout;
1234 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1236 string = resolve_asm_operand_names (string, output_operands,
1239 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1241 operand = TREE_VALUE (t);
1243 /* ??? Really, this should not be here. Users should be using a
1244 proper lvalue, dammit. But there's a long history of using
1245 casts in the output operands. In cases like longlong.h, this
1246 becomes a primitive form of typechecking -- if the cast can be
1247 removed, then the output operand had a type of the proper width;
1248 otherwise we'll get an error. Gross, but ... */
1249 STRIP_NOPS (operand);
1251 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1252 operand = error_mark_node;
1254 if (operand != error_mark_node
1255 && (TREE_READONLY (operand)
1256 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1257 /* Functions are not modifiable, even though they are
1259 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1260 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1261 /* If it's an aggregate and any field is const, then it is
1262 effectively const. */
1263 || (CLASS_TYPE_P (TREE_TYPE (operand))
1264 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1265 readonly_error (operand, "assignment (via 'asm' output)");
1267 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1268 oconstraints[i] = constraint;
1270 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1271 &allows_mem, &allows_reg, &is_inout))
1273 /* If the operand is going to end up in memory,
1274 mark it addressable. */
1275 if (!allows_reg && !cxx_mark_addressable (operand))
1276 operand = error_mark_node;
1279 operand = error_mark_node;
1281 TREE_VALUE (t) = operand;
1284 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1286 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1287 operand = decay_conversion (TREE_VALUE (t));
1289 /* If the type of the operand hasn't been determined (e.g.,
1290 because it involves an overloaded function), then issue
1291 an error message. There's no context available to
1292 resolve the overloading. */
1293 if (TREE_TYPE (operand) == unknown_type_node)
1295 error ("type of asm operand %qE could not be determined",
1297 operand = error_mark_node;
1300 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1301 oconstraints, &allows_mem, &allows_reg))
1303 /* If the operand is going to end up in memory,
1304 mark it addressable. */
1305 if (!allows_reg && allows_mem)
1307 /* Strip the nops as we allow this case. FIXME, this really
1308 should be rejected or made deprecated. */
1309 STRIP_NOPS (operand);
1310 if (!cxx_mark_addressable (operand))
1311 operand = error_mark_node;
1315 operand = error_mark_node;
1317 TREE_VALUE (t) = operand;
1321 r = build_stmt (ASM_EXPR, string,
1322 output_operands, input_operands,
1324 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1325 r = maybe_cleanup_point_expr_void (r);
1326 return add_stmt (r);
1329 /* Finish a label with the indicated NAME. */
1332 finish_label_stmt (tree name)
1334 tree decl = define_label (input_location, name);
1336 if (decl == error_mark_node)
1337 return error_mark_node;
1339 return add_stmt (build_stmt (LABEL_EXPR, decl));
1342 /* Finish a series of declarations for local labels. G++ allows users
1343 to declare "local" labels, i.e., labels with scope. This extension
1344 is useful when writing code involving statement-expressions. */
1347 finish_label_decl (tree name)
1349 if (!at_function_scope_p ())
1351 error ("__label__ declarations are only allowed in function scopes");
1355 add_decl_expr (declare_local_label (name));
1358 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1361 finish_decl_cleanup (tree decl, tree cleanup)
1363 push_cleanup (decl, cleanup, false);
1366 /* If the current scope exits with an exception, run CLEANUP. */
1369 finish_eh_cleanup (tree cleanup)
1371 push_cleanup (NULL, cleanup, true);
1374 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1375 order they were written by the user. Each node is as for
1376 emit_mem_initializers. */
1379 finish_mem_initializers (tree mem_inits)
1381 /* Reorder the MEM_INITS so that they are in the order they appeared
1382 in the source program. */
1383 mem_inits = nreverse (mem_inits);
1385 if (processing_template_decl)
1389 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1391 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1392 check for bare parameter packs in the TREE_VALUE, because
1393 any parameter packs in the TREE_VALUE have already been
1394 bound as part of the TREE_PURPOSE. See
1395 make_pack_expansion for more information. */
1396 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1397 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1398 TREE_VALUE (mem) = error_mark_node;
1401 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1404 emit_mem_initializers (mem_inits);
1407 /* Finish a parenthesized expression EXPR. */
1410 finish_parenthesized_expr (tree expr)
1413 /* This inhibits warnings in c_common_truthvalue_conversion. */
1414 TREE_NO_WARNING (expr) = 1;
1416 if (TREE_CODE (expr) == OFFSET_REF)
1417 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1418 enclosed in parentheses. */
1419 PTRMEM_OK_P (expr) = 0;
1421 if (TREE_CODE (expr) == STRING_CST)
1422 PAREN_STRING_LITERAL_P (expr) = 1;
1427 /* Finish a reference to a non-static data member (DECL) that is not
1428 preceded by `.' or `->'. */
1431 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1433 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
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 TREE_USED (current_class_ptr) = 1;
1447 if (processing_template_decl && !qualifying_scope)
1449 tree type = TREE_TYPE (decl);
1451 if (TREE_CODE (type) == REFERENCE_TYPE)
1452 type = TREE_TYPE (type);
1455 /* Set the cv qualifiers. */
1456 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1458 if (DECL_MUTABLE_P (decl))
1459 quals &= ~TYPE_QUAL_CONST;
1461 quals |= cp_type_quals (TREE_TYPE (decl));
1462 type = cp_build_qualified_type (type, quals);
1465 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1469 tree access_type = TREE_TYPE (object);
1470 tree lookup_context = context_for_name_lookup (decl);
1472 while (!DERIVED_FROM_P (lookup_context, access_type))
1474 access_type = TYPE_CONTEXT (access_type);
1475 while (access_type && DECL_P (access_type))
1476 access_type = DECL_CONTEXT (access_type);
1480 error ("object missing in reference to %q+D", decl);
1481 error ("from this location");
1482 return error_mark_node;
1486 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1487 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1489 if (processing_template_decl)
1490 return build_qualified_name (TREE_TYPE (decl),
1493 /*template_p=*/false);
1495 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1498 /* If the data member was named `C::M', convert `*this' to `C'
1500 if (qualifying_scope)
1502 tree binfo = NULL_TREE;
1503 object = build_scoped_ref (object, qualifying_scope,
1507 return build_class_member_access_expr (object, decl,
1508 /*access_path=*/NULL_TREE,
1509 /*preserve_reference=*/false,
1510 tf_warning_or_error);
1514 /* DECL was the declaration to which a qualified-id resolved. Issue
1515 an error message if it is not accessible. If OBJECT_TYPE is
1516 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1517 type of `*x', or `x', respectively. If the DECL was named as
1518 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1521 check_accessibility_of_qualified_id (tree decl,
1523 tree nested_name_specifier)
1526 tree qualifying_type = NULL_TREE;
1528 /* If we're not checking, return immediately. */
1529 if (deferred_access_no_check)
1532 /* Determine the SCOPE of DECL. */
1533 scope = context_for_name_lookup (decl);
1534 /* If the SCOPE is not a type, then DECL is not a member. */
1535 if (!TYPE_P (scope))
1537 /* Compute the scope through which DECL is being accessed. */
1539 /* OBJECT_TYPE might not be a class type; consider:
1541 class A { typedef int I; };
1545 In this case, we will have "A::I" as the DECL, but "I" as the
1547 && CLASS_TYPE_P (object_type)
1548 && DERIVED_FROM_P (scope, object_type))
1549 /* If we are processing a `->' or `.' expression, use the type of the
1551 qualifying_type = object_type;
1552 else if (nested_name_specifier)
1554 /* If the reference is to a non-static member of the
1555 current class, treat it as if it were referenced through
1557 if (DECL_NONSTATIC_MEMBER_P (decl)
1558 && current_class_ptr
1559 && DERIVED_FROM_P (scope, current_class_type))
1560 qualifying_type = current_class_type;
1561 /* Otherwise, use the type indicated by the
1562 nested-name-specifier. */
1564 qualifying_type = nested_name_specifier;
1567 /* Otherwise, the name must be from the current class or one of
1569 qualifying_type = currently_open_derived_class (scope);
1572 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1573 or similar in a default argument value. */
1574 && CLASS_TYPE_P (qualifying_type)
1575 && !dependent_type_p (qualifying_type))
1576 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1580 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1581 class named to the left of the "::" operator. DONE is true if this
1582 expression is a complete postfix-expression; it is false if this
1583 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1584 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1585 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1586 is true iff this qualified name appears as a template argument. */
1589 finish_qualified_id_expr (tree qualifying_class,
1594 bool template_arg_p)
1596 gcc_assert (TYPE_P (qualifying_class));
1598 if (error_operand_p (expr))
1599 return error_mark_node;
1601 if (DECL_P (expr) || BASELINK_P (expr))
1605 check_template_keyword (expr);
1607 /* If EXPR occurs as the operand of '&', use special handling that
1608 permits a pointer-to-member. */
1609 if (address_p && done)
1611 if (TREE_CODE (expr) == SCOPE_REF)
1612 expr = TREE_OPERAND (expr, 1);
1613 expr = build_offset_ref (qualifying_class, expr,
1614 /*address_p=*/true);
1618 /* Within the scope of a class, turn references to non-static
1619 members into expression of the form "this->...". */
1621 /* But, within a template argument, we do not want make the
1622 transformation, as there is no "this" pointer. */
1624 else if (TREE_CODE (expr) == FIELD_DECL)
1626 push_deferring_access_checks (dk_no_check);
1627 expr = finish_non_static_data_member (expr, current_class_ref,
1629 pop_deferring_access_checks ();
1631 else if (BASELINK_P (expr) && !processing_template_decl)
1635 /* See if any of the functions are non-static members. */
1636 fns = BASELINK_FUNCTIONS (expr);
1637 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1638 fns = TREE_OPERAND (fns, 0);
1639 /* If so, the expression may be relative to the current
1641 if (!shared_member_p (fns)
1642 && current_class_type
1643 && DERIVED_FROM_P (qualifying_class, current_class_type))
1644 expr = (build_class_member_access_expr
1645 (maybe_dummy_object (qualifying_class, NULL),
1647 BASELINK_ACCESS_BINFO (expr),
1648 /*preserve_reference=*/false,
1649 tf_warning_or_error));
1651 /* The expression is a qualified name whose address is not
1653 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1659 /* Begin a statement-expression. The value returned must be passed to
1660 finish_stmt_expr. */
1663 begin_stmt_expr (void)
1665 return push_stmt_list ();
1668 /* Process the final expression of a statement expression. EXPR can be
1669 NULL, if the final expression is empty. Return a STATEMENT_LIST
1670 containing all the statements in the statement-expression, or
1671 ERROR_MARK_NODE if there was an error. */
1674 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1676 if (error_operand_p (expr))
1678 /* The type of the statement-expression is the type of the last
1680 TREE_TYPE (stmt_expr) = error_mark_node;
1681 return error_mark_node;
1684 /* If the last statement does not have "void" type, then the value
1685 of the last statement is the value of the entire expression. */
1688 tree type = TREE_TYPE (expr);
1690 if (processing_template_decl)
1692 expr = build_stmt (EXPR_STMT, expr);
1693 expr = add_stmt (expr);
1694 /* Mark the last statement so that we can recognize it as such at
1695 template-instantiation time. */
1696 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1698 else if (VOID_TYPE_P (type))
1700 /* Just treat this like an ordinary statement. */
1701 expr = finish_expr_stmt (expr);
1705 /* It actually has a value we need to deal with. First, force it
1706 to be an rvalue so that we won't need to build up a copy
1707 constructor call later when we try to assign it to something. */
1708 expr = force_rvalue (expr);
1709 if (error_operand_p (expr))
1710 return error_mark_node;
1712 /* Update for array-to-pointer decay. */
1713 type = TREE_TYPE (expr);
1715 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1716 normal statement, but don't convert to void or actually add
1718 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1719 expr = maybe_cleanup_point_expr (expr);
1723 /* The type of the statement-expression is the type of the last
1725 TREE_TYPE (stmt_expr) = type;
1731 /* Finish a statement-expression. EXPR should be the value returned
1732 by the previous begin_stmt_expr. Returns an expression
1733 representing the statement-expression. */
1736 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1741 if (error_operand_p (stmt_expr))
1743 pop_stmt_list (stmt_expr);
1744 return error_mark_node;
1747 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1749 type = TREE_TYPE (stmt_expr);
1750 result = pop_stmt_list (stmt_expr);
1751 TREE_TYPE (result) = type;
1753 if (processing_template_decl)
1755 result = build_min (STMT_EXPR, type, result);
1756 TREE_SIDE_EFFECTS (result) = 1;
1757 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1759 else if (CLASS_TYPE_P (type))
1761 /* Wrap the statement-expression in a TARGET_EXPR so that the
1762 temporary object created by the final expression is destroyed at
1763 the end of the full-expression containing the
1764 statement-expression. */
1765 result = force_target_expr (type, result);
1771 /* Returns the expression which provides the value of STMT_EXPR. */
1774 stmt_expr_value_expr (tree stmt_expr)
1776 tree t = STMT_EXPR_STMT (stmt_expr);
1778 if (TREE_CODE (t) == BIND_EXPR)
1779 t = BIND_EXPR_BODY (t);
1781 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1782 t = STATEMENT_LIST_TAIL (t)->stmt;
1784 if (TREE_CODE (t) == EXPR_STMT)
1785 t = EXPR_STMT_EXPR (t);
1790 /* Perform Koenig lookup. FN is the postfix-expression representing
1791 the function (or functions) to call; ARGS are the arguments to the
1792 call. Returns the functions to be considered by overload
1796 perform_koenig_lookup (tree fn, tree args)
1798 tree identifier = NULL_TREE;
1799 tree functions = NULL_TREE;
1801 /* Find the name of the overloaded function. */
1802 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1804 else if (is_overloaded_fn (fn))
1807 identifier = DECL_NAME (get_first_fn (functions));
1809 else if (DECL_P (fn))
1812 identifier = DECL_NAME (fn);
1815 /* A call to a namespace-scope function using an unqualified name.
1817 Do Koenig lookup -- unless any of the arguments are
1819 if (!any_type_dependent_arguments_p (args))
1821 fn = lookup_arg_dependent (identifier, functions, args);
1823 /* The unqualified name could not be resolved. */
1824 fn = unqualified_fn_lookup_error (identifier);
1830 /* Generate an expression for `FN (ARGS)'.
1832 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1833 as a virtual call, even if FN is virtual. (This flag is set when
1834 encountering an expression where the function name is explicitly
1835 qualified. For example a call to `X::f' never generates a virtual
1838 Returns code for the call. */
1841 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p,
1842 tsubst_flags_t complain)
1848 if (fn == error_mark_node || args == error_mark_node)
1849 return error_mark_node;
1851 /* ARGS should be a list of arguments. */
1852 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1853 gcc_assert (!TYPE_P (fn));
1858 if (processing_template_decl)
1860 if (type_dependent_expression_p (fn)
1861 || any_type_dependent_arguments_p (args))
1863 result = build_nt_call_list (fn, args);
1864 KOENIG_LOOKUP_P (result) = koenig_p;
1869 tree fndecl = OVL_CURRENT (fn);
1870 if (TREE_CODE (fndecl) != FUNCTION_DECL
1871 || !TREE_THIS_VOLATILE (fndecl))
1877 current_function_returns_abnormally = 1;
1881 if (!BASELINK_P (fn)
1882 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1883 && TREE_TYPE (fn) != unknown_type_node)
1884 fn = build_non_dependent_expr (fn);
1885 args = build_non_dependent_args (orig_args);
1888 if (is_overloaded_fn (fn))
1889 fn = baselink_for_fns (fn);
1892 if (BASELINK_P (fn))
1896 /* A call to a member function. From [over.call.func]:
1898 If the keyword this is in scope and refers to the class of
1899 that member function, or a derived class thereof, then the
1900 function call is transformed into a qualified function call
1901 using (*this) as the postfix-expression to the left of the
1902 . operator.... [Otherwise] a contrived object of type T
1903 becomes the implied object argument.
1905 This paragraph is unclear about this situation:
1907 struct A { void f(); };
1908 struct B : public A {};
1909 struct C : public A { void g() { B::f(); }};
1911 In particular, for `B::f', this paragraph does not make clear
1912 whether "the class of that member function" refers to `A' or
1913 to `B'. We believe it refers to `B'. */
1914 if (current_class_type
1915 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1917 && current_class_ref)
1918 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1922 tree representative_fn;
1924 representative_fn = BASELINK_FUNCTIONS (fn);
1925 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1926 representative_fn = TREE_OPERAND (representative_fn, 0);
1927 representative_fn = get_first_fn (representative_fn);
1928 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1931 if (processing_template_decl)
1933 if (type_dependent_expression_p (object))
1934 return build_nt_call_list (orig_fn, orig_args);
1935 object = build_non_dependent_expr (object);
1938 result = build_new_method_call (object, fn, args, NULL_TREE,
1940 ? LOOKUP_NONVIRTUAL : 0),
1944 else if (is_overloaded_fn (fn))
1946 /* If the function is an overloaded builtin, resolve it. */
1947 if (TREE_CODE (fn) == FUNCTION_DECL
1948 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1949 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1950 result = resolve_overloaded_builtin (fn, args);
1953 /* A call to a namespace-scope function. */
1954 result = build_new_function_call (fn, args, koenig_p, complain);
1956 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1959 error ("arguments to destructor are not allowed");
1960 /* Mark the pseudo-destructor call as having side-effects so
1961 that we do not issue warnings about its use. */
1962 result = build1 (NOP_EXPR,
1964 TREE_OPERAND (fn, 0));
1965 TREE_SIDE_EFFECTS (result) = 1;
1967 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1968 /* If the "function" is really an object of class type, it might
1969 have an overloaded `operator ()'. */
1970 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1971 /*overloaded_p=*/NULL, complain);
1974 /* A call where the function is unknown. */
1975 result = cp_build_function_call (fn, args, complain);
1977 if (processing_template_decl)
1979 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
1980 KOENIG_LOOKUP_P (result) = koenig_p;
1985 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1986 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1987 POSTDECREMENT_EXPR.) */
1990 finish_increment_expr (tree expr, enum tree_code code)
1992 return build_x_unary_op (code, expr, tf_warning_or_error);
1995 /* Finish a use of `this'. Returns an expression for `this'. */
1998 finish_this_expr (void)
2002 if (current_class_ptr)
2004 result = current_class_ptr;
2006 else if (current_function_decl
2007 && DECL_STATIC_FUNCTION_P (current_function_decl))
2009 error ("%<this%> is unavailable for static member functions");
2010 result = error_mark_node;
2014 if (current_function_decl)
2015 error ("invalid use of %<this%> in non-member function");
2017 error ("invalid use of %<this%> at top level");
2018 result = error_mark_node;
2024 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2025 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2026 the TYPE for the type given. If SCOPE is non-NULL, the expression
2027 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2030 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2032 if (object == error_mark_node || destructor == error_mark_node)
2033 return error_mark_node;
2035 gcc_assert (TYPE_P (destructor));
2037 if (!processing_template_decl)
2039 if (scope == error_mark_node)
2041 error ("invalid qualifying scope in pseudo-destructor name");
2042 return error_mark_node;
2044 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2046 error ("qualified type %qT does not match destructor name ~%qT",
2048 return error_mark_node;
2052 /* [expr.pseudo] says both:
2054 The type designated by the pseudo-destructor-name shall be
2055 the same as the object type.
2059 The cv-unqualified versions of the object type and of the
2060 type designated by the pseudo-destructor-name shall be the
2063 We implement the more generous second sentence, since that is
2064 what most other compilers do. */
2065 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2068 error ("%qE is not of type %qT", object, destructor);
2069 return error_mark_node;
2073 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2076 /* Finish an expression of the form CODE EXPR. */
2079 finish_unary_op_expr (enum tree_code code, tree expr)
2081 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2082 /* Inside a template, build_x_unary_op does not fold the
2083 expression. So check whether the result is folded before
2084 setting TREE_NEGATED_INT. */
2085 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2086 && TREE_CODE (result) == INTEGER_CST
2087 && !TYPE_UNSIGNED (TREE_TYPE (result))
2088 && INT_CST_LT (result, integer_zero_node))
2090 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2091 setting TREE_NEGATED_INT. */
2092 result = copy_node (result);
2093 TREE_NEGATED_INT (result) = 1;
2095 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2096 overflow_warning (result);
2101 /* Finish a compound-literal expression. TYPE is the type to which
2102 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2105 finish_compound_literal (tree type, tree compound_literal)
2107 if (!TYPE_OBJ_P (type))
2109 error ("compound literal of non-object type %qT", type);
2110 return error_mark_node;
2113 if (processing_template_decl)
2115 TREE_TYPE (compound_literal) = type;
2116 /* Mark the expression as a compound literal. */
2117 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2118 return compound_literal;
2121 type = complete_type (type);
2123 if (TYPE_NON_AGGREGATE_CLASS (type))
2125 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2126 everywhere that deals with function arguments would be a pain, so
2127 just wrap it in a TREE_LIST. The parser set a flag so we know
2128 that it came from T{} rather than T({}). */
2129 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2130 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2131 return build_functional_cast (type, compound_literal, tf_error);
2134 if (TREE_CODE (type) == ARRAY_TYPE
2135 && check_array_initializer (NULL_TREE, type, compound_literal))
2136 return error_mark_node;
2137 compound_literal = reshape_init (type, compound_literal);
2138 if (TREE_CODE (type) == ARRAY_TYPE)
2139 cp_complete_array_type (&type, compound_literal, false);
2140 compound_literal = digest_init (type, compound_literal);
2141 if ((!at_function_scope_p () || cp_type_readonly (type))
2142 && initializer_constant_valid_p (compound_literal, type))
2144 tree decl = create_temporary_var (type);
2145 DECL_INITIAL (decl) = compound_literal;
2146 TREE_STATIC (decl) = 1;
2147 decl = pushdecl_top_level (decl);
2148 DECL_NAME (decl) = make_anon_name ();
2149 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2153 return get_target_expr (compound_literal);
2156 /* Return the declaration for the function-name variable indicated by
2160 finish_fname (tree id)
2164 decl = fname_decl (C_RID_CODE (id), id);
2165 if (processing_template_decl)
2166 decl = DECL_NAME (decl);
2170 /* Finish a translation unit. */
2173 finish_translation_unit (void)
2175 /* In case there were missing closebraces,
2176 get us back to the global binding level. */
2178 while (current_namespace != global_namespace)
2181 /* Do file scope __FUNCTION__ et al. */
2182 finish_fname_decls ();
2185 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2186 Returns the parameter. */
2189 finish_template_type_parm (tree aggr, tree identifier)
2191 if (aggr != class_type_node)
2193 permerror ("template type parameters must use the keyword %<class%> or %<typename%>");
2194 aggr = class_type_node;
2197 return build_tree_list (aggr, identifier);
2200 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2201 Returns the parameter. */
2204 finish_template_template_parm (tree aggr, tree identifier)
2206 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2207 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2208 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2209 DECL_TEMPLATE_RESULT (tmpl) = decl;
2210 DECL_ARTIFICIAL (decl) = 1;
2211 end_template_decl ();
2213 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2215 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2216 /*is_primary=*/true, /*is_partial=*/false,
2219 return finish_template_type_parm (aggr, tmpl);
2222 /* ARGUMENT is the default-argument value for a template template
2223 parameter. If ARGUMENT is invalid, issue error messages and return
2224 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2227 check_template_template_default_arg (tree argument)
2229 if (TREE_CODE (argument) != TEMPLATE_DECL
2230 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2231 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2233 if (TREE_CODE (argument) == TYPE_DECL)
2234 error ("invalid use of type %qT as a default value for a template "
2235 "template-parameter", TREE_TYPE (argument));
2237 error ("invalid default argument for a template template parameter");
2238 return error_mark_node;
2244 /* Begin a class definition, as indicated by T. */
2247 begin_class_definition (tree t, tree attributes)
2249 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2250 return error_mark_node;
2252 if (processing_template_parmlist)
2254 error ("definition of %q#T inside template parameter list", t);
2255 return error_mark_node;
2257 /* A non-implicit typename comes from code like:
2259 template <typename T> struct A {
2260 template <typename U> struct A<T>::B ...
2262 This is erroneous. */
2263 else if (TREE_CODE (t) == TYPENAME_TYPE)
2265 error ("invalid definition of qualified type %qT", t);
2266 t = error_mark_node;
2269 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2271 t = make_class_type (RECORD_TYPE);
2272 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2275 /* Update the location of the decl. */
2276 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2278 if (TYPE_BEING_DEFINED (t))
2280 t = make_class_type (TREE_CODE (t));
2281 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2283 maybe_process_partial_specialization (t);
2285 TYPE_BEING_DEFINED (t) = 1;
2287 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2289 if (flag_pack_struct)
2292 TYPE_PACKED (t) = 1;
2293 /* Even though the type is being defined for the first time
2294 here, there might have been a forward declaration, so there
2295 might be cv-qualified variants of T. */
2296 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2297 TYPE_PACKED (v) = 1;
2299 /* Reset the interface data, at the earliest possible
2300 moment, as it might have been set via a class foo;
2302 if (! TYPE_ANONYMOUS_P (t))
2304 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2305 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2306 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2307 (t, finfo->interface_unknown);
2309 reset_specialization();
2311 /* Make a declaration for this class in its own scope. */
2312 build_self_reference ();
2317 /* Finish the member declaration given by DECL. */
2320 finish_member_declaration (tree decl)
2322 if (decl == error_mark_node || decl == NULL_TREE)
2325 if (decl == void_type_node)
2326 /* The COMPONENT was a friend, not a member, and so there's
2327 nothing for us to do. */
2330 /* We should see only one DECL at a time. */
2331 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2333 /* Set up access control for DECL. */
2335 = (current_access_specifier == access_private_node);
2336 TREE_PROTECTED (decl)
2337 = (current_access_specifier == access_protected_node);
2338 if (TREE_CODE (decl) == TEMPLATE_DECL)
2340 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2341 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2344 /* Mark the DECL as a member of the current class. */
2345 DECL_CONTEXT (decl) = current_class_type;
2347 /* Check for bare parameter packs in the member variable declaration. */
2348 if (TREE_CODE (decl) == FIELD_DECL)
2350 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2351 TREE_TYPE (decl) = error_mark_node;
2352 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2353 DECL_ATTRIBUTES (decl) = NULL_TREE;
2358 A C language linkage is ignored for the names of class members
2359 and the member function type of class member functions. */
2360 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2361 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2363 /* Put functions on the TYPE_METHODS list and everything else on the
2364 TYPE_FIELDS list. Note that these are built up in reverse order.
2365 We reverse them (to obtain declaration order) in finish_struct. */
2366 if (TREE_CODE (decl) == FUNCTION_DECL
2367 || DECL_FUNCTION_TEMPLATE_P (decl))
2369 /* We also need to add this function to the
2370 CLASSTYPE_METHOD_VEC. */
2371 if (add_method (current_class_type, decl, NULL_TREE))
2373 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2374 TYPE_METHODS (current_class_type) = decl;
2376 maybe_add_class_template_decl_list (current_class_type, decl,
2380 /* Enter the DECL into the scope of the class. */
2381 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2382 || pushdecl_class_level (decl))
2384 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2385 go at the beginning. The reason is that lookup_field_1
2386 searches the list in order, and we want a field name to
2387 override a type name so that the "struct stat hack" will
2388 work. In particular:
2390 struct S { enum E { }; int E } s;
2393 is valid. In addition, the FIELD_DECLs must be maintained in
2394 declaration order so that class layout works as expected.
2395 However, we don't need that order until class layout, so we
2396 save a little time by putting FIELD_DECLs on in reverse order
2397 here, and then reversing them in finish_struct_1. (We could
2398 also keep a pointer to the correct insertion points in the
2401 if (TREE_CODE (decl) == TYPE_DECL)
2402 TYPE_FIELDS (current_class_type)
2403 = chainon (TYPE_FIELDS (current_class_type), decl);
2406 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2407 TYPE_FIELDS (current_class_type) = decl;
2410 maybe_add_class_template_decl_list (current_class_type, decl,
2415 note_decl_for_pch (decl);
2418 /* DECL has been declared while we are building a PCH file. Perform
2419 actions that we might normally undertake lazily, but which can be
2420 performed now so that they do not have to be performed in
2421 translation units which include the PCH file. */
2424 note_decl_for_pch (tree decl)
2426 gcc_assert (pch_file);
2428 /* There's a good chance that we'll have to mangle names at some
2429 point, even if only for emission in debugging information. */
2430 if ((TREE_CODE (decl) == VAR_DECL
2431 || TREE_CODE (decl) == FUNCTION_DECL)
2432 && !processing_template_decl)
2436 /* Finish processing a complete template declaration. The PARMS are
2437 the template parameters. */
2440 finish_template_decl (tree parms)
2443 end_template_decl ();
2445 end_specialization ();
2448 /* Finish processing a template-id (which names a type) of the form
2449 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2450 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2451 the scope of template-id indicated. */
2454 finish_template_type (tree name, tree args, int entering_scope)
2458 decl = lookup_template_class (name, args,
2459 NULL_TREE, NULL_TREE, entering_scope,
2460 tf_warning_or_error | tf_user);
2461 if (decl != error_mark_node)
2462 decl = TYPE_STUB_DECL (decl);
2467 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2468 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2469 BASE_CLASS, or NULL_TREE if an error occurred. The
2470 ACCESS_SPECIFIER is one of
2471 access_{default,public,protected_private}_node. For a virtual base
2472 we set TREE_TYPE. */
2475 finish_base_specifier (tree base, tree access, bool virtual_p)
2479 if (base == error_mark_node)
2481 error ("invalid base-class specification");
2484 else if (! MAYBE_CLASS_TYPE_P (base))
2486 error ("%qT is not a class type", base);
2491 if (cp_type_quals (base) != 0)
2493 error ("base class %qT has cv qualifiers", base);
2494 base = TYPE_MAIN_VARIANT (base);
2496 result = build_tree_list (access, base);
2498 TREE_TYPE (result) = integer_type_node;
2504 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2505 what we found when we tried to do the lookup.
2506 LOCATION is the location of the NAME identifier;
2507 The location is used in the error message*/
2510 qualified_name_lookup_error (tree scope, tree name,
2511 tree decl, location_t location)
2513 if (scope == error_mark_node)
2514 ; /* We already complained. */
2515 else if (TYPE_P (scope))
2517 if (!COMPLETE_TYPE_P (scope))
2518 error ("%Hincomplete type %qT used in nested name specifier",
2520 else if (TREE_CODE (decl) == TREE_LIST)
2522 error ("%Hreference to %<%T::%D%> is ambiguous", &location, scope, name);
2523 print_candidates (decl);
2526 error ("%H%qD is not a member of %qT", &location, name, scope);
2528 else if (scope != global_namespace)
2529 error ("%H%qD is not a member of %qD", &location, name, scope);
2531 error ("%H%<::%D%> has not been declared", &location, name);
2534 /* If FNS is a member function, a set of member functions, or a
2535 template-id referring to one or more member functions, return a
2536 BASELINK for FNS, incorporating the current access context.
2537 Otherwise, return FNS unchanged. */
2540 baselink_for_fns (tree fns)
2545 if (BASELINK_P (fns)
2546 || error_operand_p (fns))
2550 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2551 fn = TREE_OPERAND (fn, 0);
2552 fn = get_first_fn (fn);
2553 if (!DECL_FUNCTION_MEMBER_P (fn))
2556 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2558 cl = DECL_CONTEXT (fn);
2559 cl = TYPE_BINFO (cl);
2560 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2563 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2564 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2565 if non-NULL, is the type or namespace used to explicitly qualify
2566 ID_EXPRESSION. DECL is the entity to which that name has been
2569 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2570 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2571 be set to true if this expression isn't permitted in a
2572 constant-expression, but it is otherwise not set by this function.
2573 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2574 constant-expression, but a non-constant expression is also
2577 DONE is true if this expression is a complete postfix-expression;
2578 it is false if this expression is followed by '->', '[', '(', etc.
2579 ADDRESS_P is true iff this expression is the operand of '&'.
2580 TEMPLATE_P is true iff the qualified-id was of the form
2581 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2582 appears as a template argument.
2584 If an error occurs, and it is the kind of error that might cause
2585 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2586 is the caller's responsibility to issue the message. *ERROR_MSG
2587 will be a string with static storage duration, so the caller need
2590 Return an expression for the entity, after issuing appropriate
2591 diagnostics. This function is also responsible for transforming a
2592 reference to a non-static member into a COMPONENT_REF that makes
2593 the use of "this" explicit.
2595 Upon return, *IDK will be filled in appropriately. */
2597 finish_id_expression (tree id_expression,
2601 bool integral_constant_expression_p,
2602 bool allow_non_integral_constant_expression_p,
2603 bool *non_integral_constant_expression_p,
2607 bool template_arg_p,
2608 const char **error_msg,
2609 location_t location)
2611 /* Initialize the output parameters. */
2612 *idk = CP_ID_KIND_NONE;
2615 if (id_expression == error_mark_node)
2616 return error_mark_node;
2617 /* If we have a template-id, then no further lookup is
2618 required. If the template-id was for a template-class, we
2619 will sometimes have a TYPE_DECL at this point. */
2620 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2621 || TREE_CODE (decl) == TYPE_DECL)
2623 /* Look up the name. */
2626 if (decl == error_mark_node)
2628 /* Name lookup failed. */
2631 || (!dependent_type_p (scope)
2632 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2633 && IDENTIFIER_TYPENAME_P (id_expression)
2634 && dependent_type_p (TREE_TYPE (id_expression))))))
2636 /* If the qualifying type is non-dependent (and the name
2637 does not name a conversion operator to a dependent
2638 type), issue an error. */
2639 qualified_name_lookup_error (scope, id_expression, decl, location);
2640 return error_mark_node;
2644 /* It may be resolved via Koenig lookup. */
2645 *idk = CP_ID_KIND_UNQUALIFIED;
2646 return id_expression;
2649 decl = id_expression;
2651 /* If DECL is a variable that would be out of scope under
2652 ANSI/ISO rules, but in scope in the ARM, name lookup
2653 will succeed. Issue a diagnostic here. */
2655 decl = check_for_out_of_scope_variable (decl);
2657 /* Remember that the name was used in the definition of
2658 the current class so that we can check later to see if
2659 the meaning would have been different after the class
2660 was entirely defined. */
2661 if (!scope && decl != error_mark_node)
2662 maybe_note_name_used_in_class (id_expression, decl);
2664 /* Disallow uses of local variables from containing functions. */
2665 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2667 tree context = decl_function_context (decl);
2668 if (context != NULL_TREE && context != current_function_decl
2669 && ! TREE_STATIC (decl))
2671 error (TREE_CODE (decl) == VAR_DECL
2672 ? "use of %<auto%> variable from containing function"
2673 : "use of parameter from containing function");
2674 error (" %q+#D declared here", decl);
2675 return error_mark_node;
2680 /* If we didn't find anything, or what we found was a type,
2681 then this wasn't really an id-expression. */
2682 if (TREE_CODE (decl) == TEMPLATE_DECL
2683 && !DECL_FUNCTION_TEMPLATE_P (decl))
2685 *error_msg = "missing template arguments";
2686 return error_mark_node;
2688 else if (TREE_CODE (decl) == TYPE_DECL
2689 || TREE_CODE (decl) == NAMESPACE_DECL)
2691 *error_msg = "expected primary-expression";
2692 return error_mark_node;
2695 /* If the name resolved to a template parameter, there is no
2696 need to look it up again later. */
2697 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2698 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2702 *idk = CP_ID_KIND_NONE;
2703 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2704 decl = TEMPLATE_PARM_DECL (decl);
2705 r = convert_from_reference (DECL_INITIAL (decl));
2707 if (integral_constant_expression_p
2708 && !dependent_type_p (TREE_TYPE (decl))
2709 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2711 if (!allow_non_integral_constant_expression_p)
2712 error ("template parameter %qD of type %qT is not allowed in "
2713 "an integral constant expression because it is not of "
2714 "integral or enumeration type", decl, TREE_TYPE (decl));
2715 *non_integral_constant_expression_p = true;
2719 /* Similarly, we resolve enumeration constants to their
2720 underlying values. */
2721 else if (TREE_CODE (decl) == CONST_DECL)
2723 *idk = CP_ID_KIND_NONE;
2724 if (!processing_template_decl)
2726 used_types_insert (TREE_TYPE (decl));
2727 return DECL_INITIAL (decl);
2735 /* If the declaration was explicitly qualified indicate
2736 that. The semantics of `A::f(3)' are different than
2737 `f(3)' if `f' is virtual. */
2739 ? CP_ID_KIND_QUALIFIED
2740 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2741 ? CP_ID_KIND_TEMPLATE_ID
2742 : CP_ID_KIND_UNQUALIFIED));
2747 An id-expression is type-dependent if it contains an
2748 identifier that was declared with a dependent type.
2750 The standard is not very specific about an id-expression that
2751 names a set of overloaded functions. What if some of them
2752 have dependent types and some of them do not? Presumably,
2753 such a name should be treated as a dependent name. */
2754 /* Assume the name is not dependent. */
2755 dependent_p = false;
2756 if (!processing_template_decl)
2757 /* No names are dependent outside a template. */
2759 /* A template-id where the name of the template was not resolved
2760 is definitely dependent. */
2761 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2762 && (TREE_CODE (TREE_OPERAND (decl, 0))
2763 == IDENTIFIER_NODE))
2765 /* For anything except an overloaded function, just check its
2767 else if (!is_overloaded_fn (decl))
2769 = dependent_type_p (TREE_TYPE (decl));
2770 /* For a set of overloaded functions, check each of the
2776 if (BASELINK_P (fns))
2777 fns = BASELINK_FUNCTIONS (fns);
2779 /* For a template-id, check to see if the template
2780 arguments are dependent. */
2781 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2783 tree args = TREE_OPERAND (fns, 1);
2784 dependent_p = any_dependent_template_arguments_p (args);
2785 /* The functions are those referred to by the
2787 fns = TREE_OPERAND (fns, 0);
2790 /* If there are no dependent template arguments, go through
2791 the overloaded functions. */
2792 while (fns && !dependent_p)
2794 tree fn = OVL_CURRENT (fns);
2796 /* Member functions of dependent classes are
2798 if (TREE_CODE (fn) == FUNCTION_DECL
2799 && type_dependent_expression_p (fn))
2801 else if (TREE_CODE (fn) == TEMPLATE_DECL
2802 && dependent_template_p (fn))
2805 fns = OVL_NEXT (fns);
2809 /* If the name was dependent on a template parameter, we will
2810 resolve the name at instantiation time. */
2813 /* Create a SCOPE_REF for qualified names, if the scope is
2817 /* Since this name was dependent, the expression isn't
2818 constant -- yet. No error is issued because it might
2819 be constant when things are instantiated. */
2820 if (integral_constant_expression_p)
2821 *non_integral_constant_expression_p = true;
2824 if (address_p && done)
2825 decl = finish_qualified_id_expr (scope, decl,
2829 else if (dependent_type_p (scope))
2830 decl = build_qualified_name (/*type=*/NULL_TREE,
2834 else if (DECL_P (decl))
2835 decl = build_qualified_name (TREE_TYPE (decl),
2840 if (TREE_TYPE (decl))
2841 decl = convert_from_reference (decl);
2844 /* A TEMPLATE_ID already contains all the information we
2846 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2847 return id_expression;
2848 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2849 /* If we found a variable, then name lookup during the
2850 instantiation will always resolve to the same VAR_DECL
2851 (or an instantiation thereof). */
2852 if (TREE_CODE (decl) == VAR_DECL
2853 || TREE_CODE (decl) == PARM_DECL)
2854 return convert_from_reference (decl);
2855 /* The same is true for FIELD_DECL, but we also need to
2856 make sure that the syntax is correct. */
2857 else if (TREE_CODE (decl) == FIELD_DECL)
2859 /* Since SCOPE is NULL here, this is an unqualified name.
2860 Access checking has been performed during name lookup
2861 already. Turn off checking to avoid duplicate errors. */
2862 push_deferring_access_checks (dk_no_check);
2863 decl = finish_non_static_data_member
2864 (decl, current_class_ref,
2865 /*qualifying_scope=*/NULL_TREE);
2866 pop_deferring_access_checks ();
2869 return id_expression;
2872 /* Only certain kinds of names are allowed in constant
2873 expression. Enumerators and template parameters have already
2874 been handled above. */
2875 if (integral_constant_expression_p
2876 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2877 && ! builtin_valid_in_constant_expr_p (decl))
2879 if (!allow_non_integral_constant_expression_p)
2881 error ("%qD cannot appear in a constant-expression", decl);
2882 return error_mark_node;
2884 *non_integral_constant_expression_p = true;
2887 if (TREE_CODE (decl) == NAMESPACE_DECL)
2889 error ("use of namespace %qD as expression", decl);
2890 return error_mark_node;
2892 else if (DECL_CLASS_TEMPLATE_P (decl))
2894 error ("use of class template %qT as expression", decl);
2895 return error_mark_node;
2897 else if (TREE_CODE (decl) == TREE_LIST)
2899 /* Ambiguous reference to base members. */
2900 error ("request for member %qD is ambiguous in "
2901 "multiple inheritance lattice", id_expression);
2902 print_candidates (decl);
2903 return error_mark_node;
2906 /* Mark variable-like entities as used. Functions are similarly
2907 marked either below or after overload resolution. */
2908 if (TREE_CODE (decl) == VAR_DECL
2909 || TREE_CODE (decl) == PARM_DECL
2910 || TREE_CODE (decl) == RESULT_DECL)
2915 decl = (adjust_result_of_qualified_name_lookup
2916 (decl, scope, current_class_type));
2918 if (TREE_CODE (decl) == FUNCTION_DECL)
2921 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2922 decl = finish_qualified_id_expr (scope,
2930 tree r = convert_from_reference (decl);
2932 if (processing_template_decl && TYPE_P (scope))
2933 r = build_qualified_name (TREE_TYPE (r),
2939 else if (TREE_CODE (decl) == FIELD_DECL)
2941 /* Since SCOPE is NULL here, this is an unqualified name.
2942 Access checking has been performed during name lookup
2943 already. Turn off checking to avoid duplicate errors. */
2944 push_deferring_access_checks (dk_no_check);
2945 decl = finish_non_static_data_member (decl, current_class_ref,
2946 /*qualifying_scope=*/NULL_TREE);
2947 pop_deferring_access_checks ();
2949 else if (is_overloaded_fn (decl))
2954 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2955 first_fn = TREE_OPERAND (first_fn, 0);
2956 first_fn = get_first_fn (first_fn);
2957 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2958 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2960 if (!really_overloaded_fn (decl))
2961 mark_used (first_fn);
2964 && TREE_CODE (first_fn) == FUNCTION_DECL
2965 && DECL_FUNCTION_MEMBER_P (first_fn)
2966 && !shared_member_p (decl))
2968 /* A set of member functions. */
2969 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2970 return finish_class_member_access_expr (decl, id_expression,
2971 /*template_p=*/false,
2972 tf_warning_or_error);
2975 decl = baselink_for_fns (decl);
2979 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2980 && DECL_CLASS_SCOPE_P (decl))
2982 tree context = context_for_name_lookup (decl);
2983 if (context != current_class_type)
2985 tree path = currently_open_derived_class (context);
2986 perform_or_defer_access_check (TYPE_BINFO (path),
2991 decl = convert_from_reference (decl);
2995 if (TREE_DEPRECATED (decl))
2996 warn_deprecated_use (decl);
3001 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3002 use as a type-specifier. */
3005 finish_typeof (tree expr)
3009 if (type_dependent_expression_p (expr))
3011 type = cxx_make_type (TYPEOF_TYPE);
3012 TYPEOF_TYPE_EXPR (type) = expr;
3013 SET_TYPE_STRUCTURAL_EQUALITY (type);
3018 type = unlowered_expr_type (expr);
3020 if (!type || type == unknown_type_node)
3022 error ("type of %qE is unknown", expr);
3023 return error_mark_node;
3029 /* Perform C++-specific checks for __builtin_offsetof before calling
3033 finish_offsetof (tree expr)
3035 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3037 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3038 TREE_OPERAND (expr, 2));
3039 return error_mark_node;
3041 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3042 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3043 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3045 if (TREE_CODE (expr) == COMPONENT_REF
3046 || TREE_CODE (expr) == COMPOUND_EXPR)
3047 expr = TREE_OPERAND (expr, 1);
3048 error ("cannot apply %<offsetof%> to member function %qD", expr);
3049 return error_mark_node;
3051 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3052 expr = TREE_OPERAND (expr, 0);
3053 return fold_offsetof (expr, NULL_TREE);
3056 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
3057 with equivalent CALL_EXPRs. */
3060 simplify_aggr_init_exprs_r (tree* tp,
3062 void* data ATTRIBUTE_UNUSED)
3064 /* We don't need to walk into types; there's nothing in a type that
3065 needs simplification. (And, furthermore, there are places we
3066 actively don't want to go. For example, we don't want to wander
3067 into the default arguments for a FUNCTION_DECL that appears in a
3074 /* Only AGGR_INIT_EXPRs are interesting. */
3075 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
3078 simplify_aggr_init_expr (tp);
3080 /* Keep iterating. */
3084 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3085 function is broken out from the above for the benefit of the tree-ssa
3089 simplify_aggr_init_expr (tree *tp)
3091 tree aggr_init_expr = *tp;
3093 /* Form an appropriate CALL_EXPR. */
3094 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3095 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3096 tree type = TREE_TYPE (slot);
3099 enum style_t { ctor, arg, pcc } style;
3101 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3103 #ifdef PCC_STATIC_STRUCT_RETURN
3109 gcc_assert (TREE_ADDRESSABLE (type));
3113 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3115 aggr_init_expr_nargs (aggr_init_expr),
3116 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3120 /* Replace the first argument to the ctor with the address of the
3122 cxx_mark_addressable (slot);
3123 CALL_EXPR_ARG (call_expr, 0) =
3124 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3126 else if (style == arg)
3128 /* Just mark it addressable here, and leave the rest to
3129 expand_call{,_inline}. */
3130 cxx_mark_addressable (slot);
3131 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3132 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3134 else if (style == pcc)
3136 /* If we're using the non-reentrant PCC calling convention, then we
3137 need to copy the returned value out of the static buffer into the
3139 push_deferring_access_checks (dk_no_check);
3140 call_expr = build_aggr_init (slot, call_expr,
3141 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3142 tf_warning_or_error);
3143 pop_deferring_access_checks ();
3144 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3150 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3153 emit_associated_thunks (tree fn)
3155 /* When we use vcall offsets, we emit thunks with the virtual
3156 functions to which they thunk. The whole point of vcall offsets
3157 is so that you can know statically the entire set of thunks that
3158 will ever be needed for a given virtual function, thereby
3159 enabling you to output all the thunks with the function itself. */
3160 if (DECL_VIRTUAL_P (fn))
3164 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3166 if (!THUNK_ALIAS (thunk))
3168 use_thunk (thunk, /*emit_p=*/1);
3169 if (DECL_RESULT_THUNK_P (thunk))
3173 for (probe = DECL_THUNKS (thunk);
3174 probe; probe = TREE_CHAIN (probe))
3175 use_thunk (probe, /*emit_p=*/1);
3179 gcc_assert (!DECL_THUNKS (thunk));
3184 /* Generate RTL for FN. */
3187 expand_or_defer_fn (tree fn)
3189 /* When the parser calls us after finishing the body of a template
3190 function, we don't really want to expand the body. */
3191 if (processing_template_decl)
3193 /* Normally, collection only occurs in rest_of_compilation. So,
3194 if we don't collect here, we never collect junk generated
3195 during the processing of templates until we hit a
3196 non-template function. It's not safe to do this inside a
3197 nested class, though, as the parser may have local state that
3198 is not a GC root. */
3199 if (!function_depth)
3204 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3205 cp_walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3206 simplify_aggr_init_exprs_r,
3209 /* If this is a constructor or destructor body, we have to clone
3211 if (maybe_clone_body (fn))
3213 /* We don't want to process FN again, so pretend we've written
3214 it out, even though we haven't. */
3215 TREE_ASM_WRITTEN (fn) = 1;
3219 /* We make a decision about linkage for these functions at the end
3220 of the compilation. Until that point, we do not want the back
3221 end to output them -- but we do want it to see the bodies of
3222 these functions so that it can inline them as appropriate. */
3223 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3225 if (DECL_INTERFACE_KNOWN (fn))
3226 /* We've already made a decision as to how this function will
3230 DECL_EXTERNAL (fn) = 1;
3231 DECL_NOT_REALLY_EXTERN (fn) = 1;
3232 note_vague_linkage_fn (fn);
3233 /* A non-template inline function with external linkage will
3234 always be COMDAT. As we must eventually determine the
3235 linkage of all functions, and as that causes writes to
3236 the data mapped in from the PCH file, it's advantageous
3237 to mark the functions at this point. */
3238 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3240 /* This function must have external linkage, as
3241 otherwise DECL_INTERFACE_KNOWN would have been
3243 gcc_assert (TREE_PUBLIC (fn));
3244 comdat_linkage (fn);
3245 DECL_INTERFACE_KNOWN (fn) = 1;
3249 import_export_decl (fn);
3251 /* If the user wants us to keep all inline functions, then mark
3252 this function as needed so that finish_file will make sure to
3254 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3258 /* There's no reason to do any of the work here if we're only doing
3259 semantic analysis; this code just generates RTL. */
3260 if (flag_syntax_only)
3265 /* Expand or defer, at the whim of the compilation unit manager. */
3266 cgraph_finalize_function (fn, function_depth > 1);
3278 /* Helper function for walk_tree, used by finalize_nrv below. */
3281 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3283 struct nrv_data *dp = (struct nrv_data *)data;
3286 /* No need to walk into types. There wouldn't be any need to walk into
3287 non-statements, except that we have to consider STMT_EXPRs. */
3290 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3291 but differs from using NULL_TREE in that it indicates that we care
3292 about the value of the RESULT_DECL. */
3293 else if (TREE_CODE (*tp) == RETURN_EXPR)
3294 TREE_OPERAND (*tp, 0) = dp->result;
3295 /* Change all cleanups for the NRV to only run when an exception is
3297 else if (TREE_CODE (*tp) == CLEANUP_STMT
3298 && CLEANUP_DECL (*tp) == dp->var)
3299 CLEANUP_EH_ONLY (*tp) = 1;
3300 /* Replace the DECL_EXPR for the NRV with an initialization of the
3301 RESULT_DECL, if needed. */
3302 else if (TREE_CODE (*tp) == DECL_EXPR
3303 && DECL_EXPR_DECL (*tp) == dp->var)
3306 if (DECL_INITIAL (dp->var)
3307 && DECL_INITIAL (dp->var) != error_mark_node)
3309 init = build2 (INIT_EXPR, void_type_node, dp->result,
3310 DECL_INITIAL (dp->var));
3311 DECL_INITIAL (dp->var) = error_mark_node;
3314 init = build_empty_stmt ();
3315 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3318 /* And replace all uses of the NRV with the RESULT_DECL. */
3319 else if (*tp == dp->var)
3322 /* Avoid walking into the same tree more than once. Unfortunately, we
3323 can't just use walk_tree_without duplicates because it would only call
3324 us for the first occurrence of dp->var in the function body. */
3325 slot = htab_find_slot (dp->visited, *tp, INSERT);
3331 /* Keep iterating. */
3335 /* Called from finish_function to implement the named return value
3336 optimization by overriding all the RETURN_EXPRs and pertinent
3337 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3338 RESULT_DECL for the function. */
3341 finalize_nrv (tree *tp, tree var, tree result)
3343 struct nrv_data data;
3345 /* Copy debugging information from VAR to RESULT. */
3346 DECL_NAME (result) = DECL_NAME (var);
3347 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3348 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3349 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3350 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3351 /* Don't forget that we take its address. */
3352 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3355 data.result = result;
3356 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3357 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3358 htab_delete (data.visited);
3361 /* Return the declaration for the function called by CALL_EXPR T,
3362 TYPE is the class type of the clause decl. */
3365 omp_clause_info_fndecl (tree t, tree type)
3367 tree ret = get_callee_fndecl (t);
3372 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3373 t = CALL_EXPR_FN (t);
3375 if (TREE_CODE (t) == OBJ_TYPE_REF)
3377 t = cp_fold_obj_type_ref (t, type);
3378 if (TREE_CODE (t) == ADDR_EXPR
3379 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3380 return TREE_OPERAND (t, 0);
3386 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3389 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3390 bool need_copy_ctor, bool need_copy_assignment)
3392 int save_errorcount = errorcount;
3395 /* Always allocate 3 elements for simplicity. These are the
3396 function decls for the ctor, dtor, and assignment op.
3397 This layout is known to the three lang hooks,
3398 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3399 and cxx_omp_clause_assign_op. */
3400 info = make_tree_vec (3);
3401 CP_OMP_CLAUSE_INFO (c) = info;
3403 if (need_default_ctor
3404 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3406 if (need_default_ctor)
3410 t = build_int_cst (build_pointer_type (type), 0);
3411 t = build1 (INDIRECT_REF, type, t);
3412 t = build_tree_list (NULL, t);
3414 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3415 t, type, LOOKUP_NORMAL,
3416 tf_warning_or_error);
3418 if (targetm.cxx.cdtor_returns_this () || errorcount)
3419 /* Because constructors and destructors return this,
3420 the call will have been cast to "void". Remove the
3421 cast here. We would like to use STRIP_NOPS, but it
3422 wouldn't work here because TYPE_MODE (t) and
3423 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3424 They are VOIDmode and Pmode, respectively. */
3425 if (TREE_CODE (t) == NOP_EXPR)
3426 t = TREE_OPERAND (t, 0);
3428 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3431 if ((need_default_ctor || need_copy_ctor)
3432 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3434 t = build_int_cst (build_pointer_type (type), 0);
3435 t = build1 (INDIRECT_REF, type, t);
3436 t = build_special_member_call (t, complete_dtor_identifier,
3437 NULL, type, LOOKUP_NORMAL,
3438 tf_warning_or_error);
3440 if (targetm.cxx.cdtor_returns_this () || errorcount)
3441 /* Because constructors and destructors return this,
3442 the call will have been cast to "void". Remove the
3443 cast here. We would like to use STRIP_NOPS, but it
3444 wouldn't work here because TYPE_MODE (t) and
3445 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3446 They are VOIDmode and Pmode, respectively. */
3447 if (TREE_CODE (t) == NOP_EXPR)
3448 t = TREE_OPERAND (t, 0);
3450 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3453 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3455 t = build_int_cst (build_pointer_type (type), 0);
3456 t = build1 (INDIRECT_REF, type, t);
3457 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3458 build_tree_list (NULL, t),
3459 type, LOOKUP_NORMAL,
3460 tf_warning_or_error);
3462 /* We'll have called convert_from_reference on the call, which
3463 may well have added an indirect_ref. It's unneeded here,
3464 and in the way, so kill it. */
3465 if (TREE_CODE (t) == INDIRECT_REF)
3466 t = TREE_OPERAND (t, 0);
3468 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3471 return errorcount != save_errorcount;
3474 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3475 Remove any elements from the list that are invalid. */
3478 finish_omp_clauses (tree clauses)
3480 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3481 tree c, t, *pc = &clauses;
3484 bitmap_obstack_initialize (NULL);
3485 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3486 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3487 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3489 for (pc = &clauses, c = clauses; c ; c = *pc)
3491 bool remove = false;
3493 switch (OMP_CLAUSE_CODE (c))
3495 case OMP_CLAUSE_SHARED:
3497 goto check_dup_generic;
3498 case OMP_CLAUSE_PRIVATE:
3500 goto check_dup_generic;
3501 case OMP_CLAUSE_REDUCTION:
3503 goto check_dup_generic;
3504 case OMP_CLAUSE_COPYPRIVATE:
3505 name = "copyprivate";
3506 goto check_dup_generic;
3507 case OMP_CLAUSE_COPYIN:
3509 goto check_dup_generic;
3511 t = OMP_CLAUSE_DECL (c);
3512 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3514 if (processing_template_decl)
3517 error ("%qD is not a variable in clause %qs", t, name);
3519 error ("%qE is not a variable in clause %qs", t, name);
3522 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3523 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3524 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3526 error ("%qD appears more than once in data clauses", t);
3530 bitmap_set_bit (&generic_head, DECL_UID (t));
3533 case OMP_CLAUSE_FIRSTPRIVATE:
3534 t = OMP_CLAUSE_DECL (c);
3535 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3537 if (processing_template_decl)
3540 error ("%qD is not a variable in clause %<firstprivate%>", t);
3542 error ("%qE is not a variable in clause %<firstprivate%>", t);
3545 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3546 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3548 error ("%qD appears more than once in data clauses", t);
3552 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3555 case OMP_CLAUSE_LASTPRIVATE:
3556 t = OMP_CLAUSE_DECL (c);
3557 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3559 if (processing_template_decl)
3562 error ("%qD is not a variable in clause %<lastprivate%>", t);
3564 error ("%qE is not a variable in clause %<lastprivate%>", t);
3567 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3568 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3570 error ("%qD appears more than once in data clauses", t);
3574 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3578 t = OMP_CLAUSE_IF_EXPR (c);
3579 t = maybe_convert_cond (t);
3580 if (t == error_mark_node)
3582 OMP_CLAUSE_IF_EXPR (c) = t;
3585 case OMP_CLAUSE_NUM_THREADS:
3586 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3587 if (t == error_mark_node)
3589 else if (!type_dependent_expression_p (t)
3590 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3592 error ("num_threads expression must be integral");
3597 case OMP_CLAUSE_SCHEDULE:
3598 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3601 else if (t == error_mark_node)
3603 else if (!type_dependent_expression_p (t)
3604 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3606 error ("schedule chunk size expression must be integral");
3611 case OMP_CLAUSE_NOWAIT:
3612 case OMP_CLAUSE_ORDERED:
3613 case OMP_CLAUSE_DEFAULT:
3614 case OMP_CLAUSE_UNTIED:
3615 case OMP_CLAUSE_COLLAPSE:
3623 *pc = OMP_CLAUSE_CHAIN (c);
3625 pc = &OMP_CLAUSE_CHAIN (c);
3628 for (pc = &clauses, c = clauses; c ; c = *pc)
3630 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3631 bool remove = false;
3632 bool need_complete_non_reference = false;
3633 bool need_default_ctor = false;
3634 bool need_copy_ctor = false;
3635 bool need_copy_assignment = false;
3636 bool need_implicitly_determined = false;
3637 tree type, inner_type;
3641 case OMP_CLAUSE_SHARED:
3643 need_implicitly_determined = true;
3645 case OMP_CLAUSE_PRIVATE:
3647 need_complete_non_reference = true;
3648 need_default_ctor = true;
3649 need_implicitly_determined = true;
3651 case OMP_CLAUSE_FIRSTPRIVATE:
3652 name = "firstprivate";
3653 need_complete_non_reference = true;
3654 need_copy_ctor = true;
3655 need_implicitly_determined = true;
3657 case OMP_CLAUSE_LASTPRIVATE:
3658 name = "lastprivate";
3659 need_complete_non_reference = true;
3660 need_copy_assignment = true;
3661 need_implicitly_determined = true;
3663 case OMP_CLAUSE_REDUCTION:
3665 need_implicitly_determined = true;
3667 case OMP_CLAUSE_COPYPRIVATE:
3668 name = "copyprivate";
3669 need_copy_assignment = true;
3671 case OMP_CLAUSE_COPYIN:
3673 need_copy_assignment = true;
3676 pc = &OMP_CLAUSE_CHAIN (c);
3680 t = OMP_CLAUSE_DECL (c);
3681 if (processing_template_decl
3682 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3684 pc = &OMP_CLAUSE_CHAIN (c);
3690 case OMP_CLAUSE_LASTPRIVATE:
3691 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3692 need_default_ctor = true;
3695 case OMP_CLAUSE_REDUCTION:
3696 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3697 || POINTER_TYPE_P (TREE_TYPE (t)))
3699 error ("%qE has invalid type for %<reduction%>", t);
3702 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3704 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3712 error ("%qE has invalid type for %<reduction(%s)%>",
3713 t, operator_name_info[r_code].name);
3719 case OMP_CLAUSE_COPYIN:
3720 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3722 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3731 if (need_complete_non_reference)
3733 t = require_complete_type (t);
3734 if (t == error_mark_node)
3736 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3738 error ("%qE has reference type for %qs", t, name);
3742 if (need_implicitly_determined)
3744 const char *share_name = NULL;
3746 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3747 share_name = "threadprivate";
3748 else switch (cxx_omp_predetermined_sharing (t))
3750 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3752 case OMP_CLAUSE_DEFAULT_SHARED:
3753 share_name = "shared";
3755 case OMP_CLAUSE_DEFAULT_PRIVATE:
3756 share_name = "private";
3763 error ("%qE is predetermined %qs for %qs",
3764 t, share_name, name);
3769 /* We're interested in the base element, not arrays. */
3770 inner_type = type = TREE_TYPE (t);
3771 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3772 inner_type = TREE_TYPE (inner_type);
3774 /* Check for special function availability by building a call to one.
3775 Save the results, because later we won't be in the right context
3776 for making these queries. */
3777 if (CLASS_TYPE_P (inner_type)
3778 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3779 && !type_dependent_expression_p (t)
3780 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3781 need_copy_ctor, need_copy_assignment))
3785 *pc = OMP_CLAUSE_CHAIN (c);
3787 pc = &OMP_CLAUSE_CHAIN (c);
3790 bitmap_obstack_release (NULL);
3794 /* For all variables in the tree_list VARS, mark them as thread local. */
3797 finish_omp_threadprivate (tree vars)
3801 /* Mark every variable in VARS to be assigned thread local storage. */
3802 for (t = vars; t; t = TREE_CHAIN (t))
3804 tree v = TREE_PURPOSE (t);
3806 if (error_operand_p (v))
3808 else if (TREE_CODE (v) != VAR_DECL)
3809 error ("%<threadprivate%> %qD is not file, namespace "
3810 "or block scope variable", v);
3811 /* If V had already been marked threadprivate, it doesn't matter
3812 whether it had been used prior to this point. */
3813 else if (TREE_USED (v)
3814 && (DECL_LANG_SPECIFIC (v) == NULL
3815 || !CP_DECL_THREADPRIVATE_P (v)))
3816 error ("%qE declared %<threadprivate%> after first use", v);
3817 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3818 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3819 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3820 error ("%<threadprivate%> %qE has incomplete type", v);
3821 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3822 && CP_DECL_CONTEXT (v) != current_class_type)
3823 error ("%<threadprivate%> %qE directive not "
3824 "in %qT definition", v, CP_DECL_CONTEXT (v));
3827 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3828 if (DECL_LANG_SPECIFIC (v) == NULL)
3830 retrofit_lang_decl (v);
3832 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3833 after the allocation of the lang_decl structure. */
3834 if (DECL_DISCRIMINATOR_P (v))
3835 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3838 if (! DECL_THREAD_LOCAL_P (v))
3840 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3841 /* If rtl has been already set for this var, call
3842 make_decl_rtl once again, so that encode_section_info
3843 has a chance to look at the new decl flags. */
3844 if (DECL_RTL_SET_P (v))
3847 CP_DECL_THREADPRIVATE_P (v) = 1;
3852 /* Build an OpenMP structured block. */
3855 begin_omp_structured_block (void)
3857 return do_pushlevel (sk_omp);
3861 finish_omp_structured_block (tree block)
3863 return do_poplevel (block);
3866 /* Similarly, except force the retention of the BLOCK. */
3869 begin_omp_parallel (void)
3871 keep_next_level (true);
3872 return begin_omp_structured_block ();
3876 finish_omp_parallel (tree clauses, tree body)
3880 body = finish_omp_structured_block (body);
3882 stmt = make_node (OMP_PARALLEL);
3883 TREE_TYPE (stmt) = void_type_node;
3884 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3885 OMP_PARALLEL_BODY (stmt) = body;
3887 return add_stmt (stmt);
3891 begin_omp_task (void)
3893 keep_next_level (true);
3894 return begin_omp_structured_block ();
3898 finish_omp_task (tree clauses, tree body)
3902 body = finish_omp_structured_block (body);
3904 stmt = make_node (OMP_TASK);
3905 TREE_TYPE (stmt) = void_type_node;
3906 OMP_TASK_CLAUSES (stmt) = clauses;
3907 OMP_TASK_BODY (stmt) = body;
3909 return add_stmt (stmt);
3912 /* Helper function for finish_omp_for. Convert Ith random access iterator
3913 into integral iterator. Return FALSE if successful. */
3916 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3917 tree condv, tree incrv, tree *body,
3918 tree *pre_body, tree clauses)
3920 tree diff, iter_init, iter_incr = NULL, last;
3921 tree incr_var = NULL, orig_pre_body, orig_body, c;
3922 tree decl = TREE_VEC_ELT (declv, i);
3923 tree init = TREE_VEC_ELT (initv, i);
3924 tree cond = TREE_VEC_ELT (condv, i);
3925 tree incr = TREE_VEC_ELT (incrv, i);
3927 location_t elocus = locus;
3929 if (init && EXPR_HAS_LOCATION (init))
3930 elocus = EXPR_LOCATION (init);
3932 switch (TREE_CODE (cond))
3938 if (TREE_OPERAND (cond, 0) != iter)
3939 cond = error_mark_node;
3942 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3943 TREE_OPERAND (cond, 1), ERROR_MARK,
3944 NULL, tf_warning_or_error);
3945 if (error_operand_p (tem))
3950 cond = error_mark_node;
3953 if (cond == error_mark_node)
3955 error ("%Hinvalid controlling predicate", &elocus);
3958 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
3959 ERROR_MARK, iter, ERROR_MARK, NULL,
3960 tf_warning_or_error);
3961 if (error_operand_p (diff))
3963 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
3965 error ("%Hdifference between %qE and %qD does not have integer type",
3966 &elocus, TREE_OPERAND (cond, 1), iter);
3970 switch (TREE_CODE (incr))
3972 case PREINCREMENT_EXPR:
3973 case PREDECREMENT_EXPR:
3974 case POSTINCREMENT_EXPR:
3975 case POSTDECREMENT_EXPR:
3976 if (TREE_OPERAND (incr, 0) != iter)
3978 incr = error_mark_node;
3981 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
3982 tf_warning_or_error);
3983 if (error_operand_p (iter_incr))
3985 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
3986 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
3987 incr = integer_one_node;
3989 incr = integer_minus_one_node;
3992 if (TREE_OPERAND (incr, 0) != iter)
3993 incr = error_mark_node;
3994 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
3995 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
3997 tree rhs = TREE_OPERAND (incr, 1);
3998 if (TREE_OPERAND (rhs, 0) == iter)
4000 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4002 incr = error_mark_node;
4005 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4006 TREE_OPERAND (rhs, 1),
4007 tf_warning_or_error);
4008 if (error_operand_p (iter_incr))
4010 incr = TREE_OPERAND (rhs, 1);
4011 incr = cp_convert (TREE_TYPE (diff), incr);
4012 if (TREE_CODE (rhs) == MINUS_EXPR)
4014 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4015 incr = fold_if_not_in_template (incr);
4017 if (TREE_CODE (incr) != INTEGER_CST
4018 && (TREE_CODE (incr) != NOP_EXPR
4019 || (TREE_CODE (TREE_OPERAND (incr, 0))
4024 else if (TREE_OPERAND (rhs, 1) == iter)
4026 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4027 || TREE_CODE (rhs) != PLUS_EXPR)
4028 incr = error_mark_node;
4031 iter_incr = build_x_binary_op (PLUS_EXPR,
4032 TREE_OPERAND (rhs, 0),
4035 tf_warning_or_error);
4036 if (error_operand_p (iter_incr))
4038 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4040 tf_warning_or_error);
4041 if (error_operand_p (iter_incr))
4043 incr = TREE_OPERAND (rhs, 0);
4048 incr = error_mark_node;
4051 incr = error_mark_node;
4054 incr = error_mark_node;
4058 if (incr == error_mark_node)
4060 error ("%Hinvalid increment expression", &elocus);
4064 incr = cp_convert (TREE_TYPE (diff), incr);
4065 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4066 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4067 && OMP_CLAUSE_DECL (c) == iter)
4070 decl = create_temporary_var (TREE_TYPE (diff));
4072 add_decl_expr (decl);
4073 last = create_temporary_var (TREE_TYPE (diff));
4075 add_decl_expr (last);
4076 if (c && iter_incr == NULL)
4078 incr_var = create_temporary_var (TREE_TYPE (diff));
4079 pushdecl (incr_var);
4080 add_decl_expr (incr_var);
4082 gcc_assert (stmts_are_full_exprs_p ());
4084 orig_pre_body = *pre_body;
4085 *pre_body = push_stmt_list ();
4087 add_stmt (orig_pre_body);
4089 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4090 tf_warning_or_error));
4091 init = build_int_cst (TREE_TYPE (diff), 0);
4092 if (c && iter_incr == NULL)
4094 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4095 incr, tf_warning_or_error));
4097 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4098 tf_warning_or_error);
4100 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4101 tf_warning_or_error));
4102 *pre_body = pop_stmt_list (*pre_body);
4104 cond = cp_build_binary_op (TREE_CODE (cond), decl, diff,
4105 tf_warning_or_error);
4106 incr = build_modify_expr (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)
4287 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4288 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4289 if (cond && TREE_SIDE_EFFECTS (cond) && COMPARISON_CLASS_P (cond))
4291 int n = TREE_SIDE_EFFECTS (TREE_OPERAND (cond, 1)) != 0;
4292 tree t = TREE_OPERAND (cond, n);
4294 if (!processing_template_decl)
4295 TREE_OPERAND (cond, n)
4296 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4298 if (decl == error_mark_node || init == error_mark_node)
4301 TREE_VEC_ELT (declv, i) = decl;
4302 TREE_VEC_ELT (initv, i) = init;
4303 TREE_VEC_ELT (condv, i) = cond;
4304 TREE_VEC_ELT (incrv, i) = incr;
4308 if (IS_EMPTY_STMT (pre_body))
4311 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4314 if (omp_for == NULL)
4317 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4319 tree incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4321 if (TREE_CODE (incr) != MODIFY_EXPR)
4324 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4325 && BINARY_CLASS_P (TREE_OPERAND (incr, 1)))
4327 tree t = TREE_OPERAND (incr, 1);
4328 int n = TREE_SIDE_EFFECTS (TREE_OPERAND (t, 1)) != 0;
4330 if (!processing_template_decl)
4332 = fold_build_cleanup_point_expr (TREE_TYPE (TREE_OPERAND (t, n)),
4333 TREE_OPERAND (t, n));
4337 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4339 if (omp_for != NULL)
4340 OMP_FOR_CLAUSES (omp_for) = clauses;
4345 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4354 dependent_p = false;
4357 /* Even in a template, we can detect invalid uses of the atomic
4358 pragma if neither LHS nor RHS is type-dependent. */
4359 if (processing_template_decl)
4361 dependent_p = (type_dependent_expression_p (lhs)
4362 || type_dependent_expression_p (rhs));
4365 lhs = build_non_dependent_expr (lhs);
4366 rhs = build_non_dependent_expr (rhs);
4371 stmt = c_finish_omp_atomic (code, lhs, rhs);
4372 if (stmt == error_mark_node)
4375 if (processing_template_decl)
4376 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4377 build2 (code, void_type_node, orig_lhs, orig_rhs));
4382 finish_omp_barrier (void)
4384 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4385 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4386 finish_expr_stmt (stmt);
4390 finish_omp_flush (void)
4392 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4393 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4394 finish_expr_stmt (stmt);
4398 finish_omp_taskwait (void)
4400 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4401 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4402 finish_expr_stmt (stmt);
4406 init_cp_semantics (void)
4410 /* Build a STATIC_ASSERT for a static assertion with the condition
4411 CONDITION and the message text MESSAGE. LOCATION is the location
4412 of the static assertion in the source code. When MEMBER_P, this
4413 static assertion is a member of a class. */
4415 finish_static_assert (tree condition, tree message, location_t location,
4418 if (check_for_bare_parameter_packs (condition))
4419 condition = error_mark_node;
4421 if (type_dependent_expression_p (condition)
4422 || value_dependent_expression_p (condition))
4424 /* We're in a template; build a STATIC_ASSERT and put it in
4428 assertion = make_node (STATIC_ASSERT);
4429 STATIC_ASSERT_CONDITION (assertion) = condition;
4430 STATIC_ASSERT_MESSAGE (assertion) = message;
4431 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4434 maybe_add_class_template_decl_list (current_class_type,
4438 add_stmt (assertion);
4443 /* Fold the expression and convert it to a boolean value. */
4444 condition = fold_non_dependent_expr (condition);
4445 condition = cp_convert (boolean_type_node, condition);
4447 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4448 /* Do nothing; the condition is satisfied. */
4452 location_t saved_loc = input_location;
4454 input_location = location;
4455 if (TREE_CODE (condition) == INTEGER_CST
4456 && integer_zerop (condition))
4457 /* Report the error. */
4458 error ("static assertion failed: %E", message);
4459 else if (condition && condition != error_mark_node)
4460 error ("non-constant condition for static assertion");
4461 input_location = saved_loc;
4465 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4466 suitable for use as a type-specifier.
4468 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4469 id-expression or a class member access, FALSE when it was parsed as
4470 a full expression. */
4472 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4474 tree orig_expr = expr;
4477 if (!expr || error_operand_p (expr))
4478 return error_mark_node;
4481 || TREE_CODE (expr) == TYPE_DECL
4482 || (TREE_CODE (expr) == BIT_NOT_EXPR
4483 && TYPE_P (TREE_OPERAND (expr, 0))))
4485 error ("argument to decltype must be an expression");
4486 return error_mark_node;
4489 if (type_dependent_expression_p (expr))
4491 type = cxx_make_type (DECLTYPE_TYPE);
4492 DECLTYPE_TYPE_EXPR (type) = expr;
4493 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4494 = id_expression_or_member_access_p;
4495 SET_TYPE_STRUCTURAL_EQUALITY (type);
4500 /* The type denoted by decltype(e) is defined as follows: */
4502 if (id_expression_or_member_access_p)
4504 /* If e is an id-expression or a class member access (5.2.5
4505 [expr.ref]), decltype(e) is defined as the type of the entity
4506 named by e. If there is no such entity, or e names a set of
4507 overloaded functions, the program is ill-formed. */
4508 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4509 expr = lookup_name (expr);
4511 if (TREE_CODE (expr) == INDIRECT_REF)
4512 /* This can happen when the expression is, e.g., "a.b". Just
4513 look at the underlying operand. */
4514 expr = TREE_OPERAND (expr, 0);
4516 if (TREE_CODE (expr) == OFFSET_REF
4517 || TREE_CODE (expr) == MEMBER_REF)
4518 /* We're only interested in the field itself. If it is a
4519 BASELINK, we will need to see through it in the next
4521 expr = TREE_OPERAND (expr, 1);
4523 if (TREE_CODE (expr) == BASELINK)
4524 /* See through BASELINK nodes to the underlying functions. */
4525 expr = BASELINK_FUNCTIONS (expr);
4527 if (TREE_CODE (expr) == OVERLOAD)
4529 if (OVL_CHAIN (expr))
4531 error ("%qE refers to a set of overloaded functions", orig_expr);
4532 return error_mark_node;
4535 /* An overload set containing only one function: just look
4536 at that function. */
4537 expr = OVL_FUNCTION (expr);
4540 switch (TREE_CODE (expr))
4543 if (DECL_BIT_FIELD_TYPE (expr))
4545 type = DECL_BIT_FIELD_TYPE (expr);
4548 /* Fall through for fields that aren't bitfields. */
4555 type = TREE_TYPE (expr);
4559 type = error_mark_node;
4563 type = is_bitfield_expr_with_lowered_type (expr);
4565 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4572 /* We can get here when the id-expression refers to an
4574 type = TREE_TYPE (expr);
4578 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4579 || TREE_CODE (expr) == SCOPE_REF);
4580 error ("argument to decltype must be an expression");
4581 return error_mark_node;
4588 /* Expressions of reference type are sometimes wrapped in
4589 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4590 representation, not part of the language, so we have to look
4592 if (TREE_CODE (expr) == INDIRECT_REF
4593 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4595 expr = TREE_OPERAND (expr, 0);
4597 if (TREE_CODE (expr) == CALL_EXPR
4598 && (fndecl = get_callee_fndecl (expr))
4599 && (fndecl != error_mark_node))
4600 /* If e is a function call (5.2.2 [expr.call]) or an
4601 invocation of an overloaded operator (parentheses around e
4602 are ignored), decltype(e) is defined as the return type of
4604 type = TREE_TYPE (TREE_TYPE (fndecl));
4607 type = is_bitfield_expr_with_lowered_type (expr);
4610 /* Bitfields are special, because their type encodes the
4611 number of bits they store. If the expression referenced a
4612 bitfield, TYPE now has the declared type of that
4614 type = cp_build_qualified_type (type,
4615 cp_type_quals (TREE_TYPE (expr)));
4617 if (real_lvalue_p (expr))
4618 type = build_reference_type (type);
4622 /* Otherwise, where T is the type of e, if e is an lvalue,
4623 decltype(e) is defined as T&, otherwise decltype(e) is
4625 type = TREE_TYPE (expr);
4626 if (type == error_mark_node)
4627 return error_mark_node;
4628 else if (expr == current_class_ptr)
4629 /* If the expression is just "this", we want the
4630 cv-unqualified pointer for the "this" type. */
4631 type = TYPE_MAIN_VARIANT (type);
4632 else if (real_lvalue_p (expr))
4634 if (TREE_CODE (type) != REFERENCE_TYPE)
4635 type = build_reference_type (type);
4638 type = non_reference (type);
4643 if (!type || type == unknown_type_node)
4645 error ("type of %qE is unknown", expr);
4646 return error_mark_node;
4652 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4653 __has_nothrow_copy, depending on assign_p. */
4656 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4663 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4666 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4668 else if (TYPE_HAS_INIT_REF (type))
4670 /* If construction of the copy constructor was postponed, create
4672 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4673 lazily_declare_fn (sfk_copy_constructor, type);
4674 fns = CLASSTYPE_CONSTRUCTORS (type);
4679 for (; fns; fns = OVL_NEXT (fns))
4680 if (!TREE_NOTHROW (OVL_CURRENT (fns)))
4686 /* Actually evaluates the trait. */
4689 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4691 enum tree_code type_code1;
4694 type_code1 = TREE_CODE (type1);
4698 case CPTK_HAS_NOTHROW_ASSIGN:
4699 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4700 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4701 || (CLASS_TYPE_P (type1)
4702 && classtype_has_nothrow_assign_or_copy_p (type1,
4705 case CPTK_HAS_TRIVIAL_ASSIGN:
4706 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4707 && (pod_type_p (type1)
4708 || (CLASS_TYPE_P (type1)
4709 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4711 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4712 type1 = strip_array_types (type1);
4713 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4714 || (CLASS_TYPE_P (type1)
4715 && (t = locate_ctor (type1, NULL)) && TREE_NOTHROW (t)));
4717 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4718 type1 = strip_array_types (type1);
4719 return (pod_type_p (type1)
4720 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4722 case CPTK_HAS_NOTHROW_COPY:
4723 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4724 || (CLASS_TYPE_P (type1)
4725 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4727 case CPTK_HAS_TRIVIAL_COPY:
4728 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4729 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4731 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4732 type1 = strip_array_types (type1);
4733 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4734 || (CLASS_TYPE_P (type1)
4735 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4737 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4738 return (CLASS_TYPE_P (type1)
4739 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4741 case CPTK_IS_ABSTRACT:
4742 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4744 case CPTK_IS_BASE_OF:
4745 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4746 && DERIVED_FROM_P (type1, type2));
4749 return (NON_UNION_CLASS_TYPE_P (type1));
4751 case CPTK_IS_CONVERTIBLE_TO:
4756 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4759 return (type_code1 == ENUMERAL_TYPE);
4762 return (pod_type_p (type1));
4764 case CPTK_IS_POLYMORPHIC:
4765 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4768 return (type_code1 == UNION_TYPE);
4776 /* Process a trait expression. */
4779 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4781 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4782 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4783 || kind == CPTK_HAS_NOTHROW_COPY
4784 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4785 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4786 || kind == CPTK_HAS_TRIVIAL_COPY
4787 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4788 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4789 || kind == CPTK_IS_ABSTRACT
4790 || kind == CPTK_IS_BASE_OF
4791 || kind == CPTK_IS_CLASS
4792 || kind == CPTK_IS_CONVERTIBLE_TO
4793 || kind == CPTK_IS_EMPTY
4794 || kind == CPTK_IS_ENUM
4795 || kind == CPTK_IS_POD
4796 || kind == CPTK_IS_POLYMORPHIC
4797 || kind == CPTK_IS_UNION);
4799 if (kind == CPTK_IS_CONVERTIBLE_TO)
4801 sorry ("__is_convertible_to");
4802 return error_mark_node;
4805 if (type1 == error_mark_node
4806 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4807 && type2 == error_mark_node))
4808 return error_mark_node;
4810 if (processing_template_decl)
4812 tree trait_expr = make_node (TRAIT_EXPR);
4813 TREE_TYPE (trait_expr) = boolean_type_node;
4814 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4815 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4816 TRAIT_EXPR_KIND (trait_expr) = kind;
4820 complete_type (type1);
4822 complete_type (type2);
4824 /* The only required diagnostic. */
4825 if (kind == CPTK_IS_BASE_OF
4826 && NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4827 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
4828 && !COMPLETE_TYPE_P (type2))
4830 error ("incomplete type %qT not allowed", type2);
4831 return error_mark_node;
4834 return (trait_expr_value (kind, type1, type2)
4835 ? boolean_true_node : boolean_false_node);
4838 #include "gt-cp-semantics.h"