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"
51 /* There routines provide a modular interface to perform many parsing
52 operations. They may therefore be used during actual parsing, or
53 during template instantiation, which may be regarded as a
54 degenerate form of parsing. */
56 static tree maybe_convert_cond (tree);
57 static tree simplify_aggr_init_exprs_r (tree *, int *, void *);
58 static tree finalize_nrv_r (tree *, int *, void *);
61 /* Deferred Access Checking Overview
62 ---------------------------------
64 Most C++ expressions and declarations require access checking
65 to be performed during parsing. However, in several cases,
66 this has to be treated differently.
68 For member declarations, access checking has to be deferred
69 until more information about the declaration is known. For
81 When we are parsing the function return type `A::X', we don't
82 really know if this is allowed until we parse the function name.
84 Furthermore, some contexts require that access checking is
85 never performed at all. These include class heads, and template
88 Typical use of access checking functions is described here:
90 1. When we enter a context that requires certain access checking
91 mode, the function `push_deferring_access_checks' is called with
92 DEFERRING argument specifying the desired mode. Access checking
93 may be performed immediately (dk_no_deferred), deferred
94 (dk_deferred), or not performed (dk_no_check).
96 2. When a declaration such as a type, or a variable, is encountered,
97 the function `perform_or_defer_access_check' is called. It
98 maintains a VEC of all deferred checks.
100 3. The global `current_class_type' or `current_function_decl' is then
101 setup by the parser. `enforce_access' relies on these information
104 4. Upon exiting the context mentioned in step 1,
105 `perform_deferred_access_checks' is called to check all declaration
106 stored in the VEC. `pop_deferring_access_checks' is then
107 called to restore the previous access checking mode.
109 In case of parsing error, we simply call `pop_deferring_access_checks'
110 without `perform_deferred_access_checks'. */
112 typedef struct deferred_access GTY(())
114 /* A VEC representing name-lookups for which we have deferred
115 checking access controls. We cannot check the accessibility of
116 names used in a decl-specifier-seq until we know what is being
117 declared because code like:
124 A::B* A::f() { return 0; }
126 is valid, even though `A::B' is not generally accessible. */
127 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
129 /* The current mode of access checks. */
130 enum deferring_kind deferring_access_checks_kind;
133 DEF_VEC_O (deferred_access);
134 DEF_VEC_ALLOC_O (deferred_access,gc);
136 /* Data for deferred access checking. */
137 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
138 static GTY(()) unsigned deferred_access_no_check;
140 /* Save the current deferred access states and start deferred
141 access checking iff DEFER_P is true. */
144 push_deferring_access_checks (deferring_kind deferring)
146 /* For context like template instantiation, access checking
147 disabling applies to all nested context. */
148 if (deferred_access_no_check || deferring == dk_no_check)
149 deferred_access_no_check++;
152 deferred_access *ptr;
154 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
155 ptr->deferred_access_checks = NULL;
156 ptr->deferring_access_checks_kind = deferring;
160 /* Resume deferring access checks again after we stopped doing
164 resume_deferring_access_checks (void)
166 if (!deferred_access_no_check)
167 VEC_last (deferred_access, deferred_access_stack)
168 ->deferring_access_checks_kind = dk_deferred;
171 /* Stop deferring access checks. */
174 stop_deferring_access_checks (void)
176 if (!deferred_access_no_check)
177 VEC_last (deferred_access, deferred_access_stack)
178 ->deferring_access_checks_kind = dk_no_deferred;
181 /* Discard the current deferred access checks and restore the
185 pop_deferring_access_checks (void)
187 if (deferred_access_no_check)
188 deferred_access_no_check--;
190 VEC_pop (deferred_access, deferred_access_stack);
193 /* Returns a TREE_LIST representing the deferred checks.
194 The TREE_PURPOSE of each node is the type through which the
195 access occurred; the TREE_VALUE is the declaration named.
198 VEC (deferred_access_check,gc)*
199 get_deferred_access_checks (void)
201 if (deferred_access_no_check)
204 return (VEC_last (deferred_access, deferred_access_stack)
205 ->deferred_access_checks);
208 /* Take current deferred checks and combine with the
209 previous states if we also defer checks previously.
210 Otherwise perform checks now. */
213 pop_to_parent_deferring_access_checks (void)
215 if (deferred_access_no_check)
216 deferred_access_no_check--;
219 VEC (deferred_access_check,gc) *checks;
220 deferred_access *ptr;
222 checks = (VEC_last (deferred_access, deferred_access_stack)
223 ->deferred_access_checks);
225 VEC_pop (deferred_access, deferred_access_stack);
226 ptr = VEC_last (deferred_access, deferred_access_stack);
227 if (ptr->deferring_access_checks_kind == dk_no_deferred)
230 perform_access_checks (checks);
234 /* Merge with parent. */
236 deferred_access_check *chk, *probe;
239 VEC_iterate (deferred_access_check, checks, i, chk) ;
243 VEC_iterate (deferred_access_check,
244 ptr->deferred_access_checks, j, probe) ;
247 if (probe->binfo == chk->binfo &&
248 probe->decl == chk->decl &&
249 probe->diag_decl == chk->diag_decl)
252 /* Insert into parent's checks. */
253 VEC_safe_push (deferred_access_check, gc,
254 ptr->deferred_access_checks, chk);
261 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
262 is the BINFO indicating the qualifying scope used to access the
263 DECL node stored in the TREE_VALUE of the node. */
266 perform_access_checks (VEC (deferred_access_check,gc)* checks)
269 deferred_access_check *chk;
274 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
275 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
278 /* Perform the deferred access checks.
280 After performing the checks, we still have to keep the list
281 `deferred_access_stack->deferred_access_checks' since we may want
282 to check access for them again later in a different context.
289 A::X A::a, x; // No error for `A::a', error for `x'
291 We have to perform deferred access of `A::X', first with `A::a',
295 perform_deferred_access_checks (void)
297 perform_access_checks (get_deferred_access_checks ());
300 /* Defer checking the accessibility of DECL, when looked up in
301 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
304 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
307 deferred_access *ptr;
308 deferred_access_check *chk;
309 deferred_access_check *new_access;
312 /* Exit if we are in a context that no access checking is performed.
314 if (deferred_access_no_check)
317 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
319 ptr = VEC_last (deferred_access, deferred_access_stack);
321 /* If we are not supposed to defer access checks, just check now. */
322 if (ptr->deferring_access_checks_kind == dk_no_deferred)
324 enforce_access (binfo, decl, diag_decl);
328 /* See if we are already going to perform this check. */
330 VEC_iterate (deferred_access_check,
331 ptr->deferred_access_checks, i, chk) ;
334 if (chk->decl == decl && chk->binfo == binfo &&
335 chk->diag_decl == diag_decl)
340 /* If not, record the check. */
342 VEC_safe_push (deferred_access_check, gc,
343 ptr->deferred_access_checks, 0);
344 new_access->binfo = binfo;
345 new_access->decl = decl;
346 new_access->diag_decl = diag_decl;
349 /* Returns nonzero if the current statement is a full expression,
350 i.e. temporaries created during that statement should be destroyed
351 at the end of the statement. */
354 stmts_are_full_exprs_p (void)
356 return current_stmt_tree ()->stmts_are_full_exprs_p;
359 /* T is a statement. Add it to the statement-tree. This is the C++
360 version. The C/ObjC frontends have a slightly different version of
366 enum tree_code code = TREE_CODE (t);
368 if (EXPR_P (t) && code != LABEL_EXPR)
370 if (!EXPR_HAS_LOCATION (t))
371 SET_EXPR_LOCATION (t, input_location);
373 /* When we expand a statement-tree, we must know whether or not the
374 statements are full-expressions. We record that fact here. */
375 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
378 /* Add T to the statement-tree. Non-side-effect statements need to be
379 recorded during statement expressions. */
380 append_to_statement_list_force (t, &cur_stmt_list);
385 /* Returns the stmt_tree to which statements are currently being added. */
388 current_stmt_tree (void)
391 ? &cfun->language->base.x_stmt_tree
392 : &scope_chain->x_stmt_tree);
395 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
398 maybe_cleanup_point_expr (tree expr)
400 if (!processing_template_decl && stmts_are_full_exprs_p ())
401 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
405 /* Like maybe_cleanup_point_expr except have the type of the new expression be
406 void so we don't need to create a temporary variable to hold the inner
407 expression. The reason why we do this is because the original type might be
408 an aggregate and we cannot create a temporary variable for that type. */
411 maybe_cleanup_point_expr_void (tree expr)
413 if (!processing_template_decl && stmts_are_full_exprs_p ())
414 expr = fold_build_cleanup_point_expr (void_type_node, expr);
420 /* Create a declaration statement for the declaration given by the DECL. */
423 add_decl_expr (tree decl)
425 tree r = build_stmt (DECL_EXPR, decl);
426 if (DECL_INITIAL (decl)
427 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
428 r = maybe_cleanup_point_expr_void (r);
432 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
433 flag for this because "A union for which objects or pointers are
434 declared is not an anonymous union" [class.union]. */
437 anon_aggr_type_p (const_tree node)
439 return ANON_AGGR_TYPE_P (node);
442 /* Finish a scope. */
445 do_poplevel (tree stmt_list)
449 if (stmts_are_full_exprs_p ())
450 block = poplevel (kept_level_p (), 1, 0);
452 stmt_list = pop_stmt_list (stmt_list);
454 if (!processing_template_decl)
456 stmt_list = c_build_bind_expr (block, stmt_list);
457 /* ??? See c_end_compound_stmt re statement expressions. */
463 /* Begin a new scope. */
466 do_pushlevel (scope_kind sk)
468 tree ret = push_stmt_list ();
469 if (stmts_are_full_exprs_p ())
470 begin_scope (sk, NULL);
474 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
475 when the current scope is exited. EH_ONLY is true when this is not
476 meant to apply to normal control flow transfer. */
479 push_cleanup (tree decl, tree cleanup, bool eh_only)
481 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
482 CLEANUP_EH_ONLY (stmt) = eh_only;
484 CLEANUP_BODY (stmt) = push_stmt_list ();
487 /* Begin a conditional that might contain a declaration. When generating
488 normal code, we want the declaration to appear before the statement
489 containing the conditional. When generating template code, we want the
490 conditional to be rendered as the raw DECL_EXPR. */
493 begin_cond (tree *cond_p)
495 if (processing_template_decl)
496 *cond_p = push_stmt_list ();
499 /* Finish such a conditional. */
502 finish_cond (tree *cond_p, tree expr)
504 if (processing_template_decl)
506 tree cond = pop_stmt_list (*cond_p);
507 if (TREE_CODE (cond) == DECL_EXPR)
510 if (check_for_bare_parameter_packs (expr))
511 *cond_p = error_mark_node;
516 /* If *COND_P specifies a conditional with a declaration, transform the
519 for (; A x = 42;) { }
521 while (true) { A x = 42; if (!x) break; }
522 for (;;) { A x = 42; if (!x) break; }
523 The statement list for BODY will be empty if the conditional did
524 not declare anything. */
527 simplify_loop_decl_cond (tree *cond_p, tree body)
531 if (!TREE_SIDE_EFFECTS (body))
535 *cond_p = boolean_true_node;
537 if_stmt = begin_if_stmt ();
538 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
539 finish_if_stmt_cond (cond, if_stmt);
540 finish_break_stmt ();
541 finish_then_clause (if_stmt);
542 finish_if_stmt (if_stmt);
545 /* Finish a goto-statement. */
548 finish_goto_stmt (tree destination)
550 if (TREE_CODE (destination) == IDENTIFIER_NODE)
551 destination = lookup_label (destination);
553 /* We warn about unused labels with -Wunused. That means we have to
554 mark the used labels as used. */
555 if (TREE_CODE (destination) == LABEL_DECL)
556 TREE_USED (destination) = 1;
559 /* The DESTINATION is being used as an rvalue. */
560 if (!processing_template_decl)
561 destination = decay_conversion (destination);
562 /* We don't inline calls to functions with computed gotos.
563 Those functions are typically up to some funny business,
564 and may be depending on the labels being at particular
565 addresses, or some such. */
566 DECL_UNINLINABLE (current_function_decl) = 1;
569 check_goto (destination);
571 return add_stmt (build_stmt (GOTO_EXPR, destination));
574 /* COND is the condition-expression for an if, while, etc.,
575 statement. Convert it to a boolean value, if appropriate.
576 In addition, verify sequence points if -Wsequence-point is enabled. */
579 maybe_convert_cond (tree cond)
581 /* Empty conditions remain empty. */
585 /* Wait until we instantiate templates before doing conversion. */
586 if (processing_template_decl)
589 if (warn_sequence_point)
590 verify_sequence_points (cond);
592 /* Do the conversion. */
593 cond = convert_from_reference (cond);
595 if (TREE_CODE (cond) == MODIFY_EXPR
596 && !TREE_NO_WARNING (cond)
599 warning (OPT_Wparentheses,
600 "suggest parentheses around assignment used as truth value");
601 TREE_NO_WARNING (cond) = 1;
604 return condition_conversion (cond);
607 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
610 finish_expr_stmt (tree expr)
614 if (expr != NULL_TREE)
616 if (!processing_template_decl)
618 if (warn_sequence_point)
619 verify_sequence_points (expr);
620 expr = convert_to_void (expr, "statement", tf_warning_or_error);
622 else if (!type_dependent_expression_p (expr))
623 convert_to_void (build_non_dependent_expr (expr), "statement",
624 tf_warning_or_error);
626 if (check_for_bare_parameter_packs (expr))
627 expr = error_mark_node;
629 /* Simplification of inner statement expressions, compound exprs,
630 etc can result in us already having an EXPR_STMT. */
631 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
633 if (TREE_CODE (expr) != EXPR_STMT)
634 expr = build_stmt (EXPR_STMT, expr);
635 expr = maybe_cleanup_point_expr_void (expr);
647 /* Begin an if-statement. Returns a newly created IF_STMT if
654 scope = do_pushlevel (sk_block);
655 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
656 TREE_CHAIN (r) = scope;
657 begin_cond (&IF_COND (r));
661 /* Process the COND of an if-statement, which may be given by
665 finish_if_stmt_cond (tree cond, tree if_stmt)
667 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
669 THEN_CLAUSE (if_stmt) = push_stmt_list ();
672 /* Finish the then-clause of an if-statement, which may be given by
676 finish_then_clause (tree if_stmt)
678 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
682 /* Begin the else-clause of an if-statement. */
685 begin_else_clause (tree if_stmt)
687 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
690 /* Finish the else-clause of an if-statement, which may be given by
694 finish_else_clause (tree if_stmt)
696 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
699 /* Finish an if-statement. */
702 finish_if_stmt (tree if_stmt)
704 tree scope = TREE_CHAIN (if_stmt);
705 TREE_CHAIN (if_stmt) = NULL;
706 add_stmt (do_poplevel (scope));
708 empty_if_body_warning (THEN_CLAUSE (if_stmt), ELSE_CLAUSE (if_stmt));
711 /* Begin a while-statement. Returns a newly created WHILE_STMT if
715 begin_while_stmt (void)
718 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
720 WHILE_BODY (r) = do_pushlevel (sk_block);
721 begin_cond (&WHILE_COND (r));
725 /* Process the COND of a while-statement, which may be given by
729 finish_while_stmt_cond (tree cond, tree while_stmt)
731 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
732 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
735 /* Finish a while-statement, which may be given by WHILE_STMT. */
738 finish_while_stmt (tree while_stmt)
740 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
744 /* Begin a do-statement. Returns a newly created DO_STMT if
750 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
752 DO_BODY (r) = push_stmt_list ();
756 /* Finish the body of a do-statement, which may be given by DO_STMT. */
759 finish_do_body (tree do_stmt)
761 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
763 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
764 body = STATEMENT_LIST_TAIL (body)->stmt;
766 if (IS_EMPTY_STMT (body))
767 warning (OPT_Wempty_body,
768 "suggest explicit braces around empty body in %<do%> statement");
771 /* Finish a do-statement, which may be given by DO_STMT, and whose
772 COND is as indicated. */
775 finish_do_stmt (tree cond, tree do_stmt)
777 cond = maybe_convert_cond (cond);
778 DO_COND (do_stmt) = cond;
782 /* Finish a return-statement. The EXPRESSION returned, if any, is as
786 finish_return_stmt (tree expr)
791 expr = check_return_expr (expr, &no_warning);
793 if (flag_openmp && !check_omp_return ())
794 return error_mark_node;
795 if (!processing_template_decl)
797 if (warn_sequence_point)
798 verify_sequence_points (expr);
800 if (DECL_DESTRUCTOR_P (current_function_decl)
801 || (DECL_CONSTRUCTOR_P (current_function_decl)
802 && targetm.cxx.cdtor_returns_this ()))
804 /* Similarly, all destructors must run destructors for
805 base-classes before returning. So, all returns in a
806 destructor get sent to the DTOR_LABEL; finish_function emits
807 code to return a value there. */
808 return finish_goto_stmt (cdtor_label);
812 r = build_stmt (RETURN_EXPR, expr);
813 TREE_NO_WARNING (r) |= no_warning;
814 r = maybe_cleanup_point_expr_void (r);
821 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
824 begin_for_stmt (void)
828 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
829 NULL_TREE, NULL_TREE);
831 if (flag_new_for_scope > 0)
832 TREE_CHAIN (r) = do_pushlevel (sk_for);
834 if (processing_template_decl)
835 FOR_INIT_STMT (r) = push_stmt_list ();
840 /* Finish the for-init-statement of a for-statement, which may be
841 given by FOR_STMT. */
844 finish_for_init_stmt (tree for_stmt)
846 if (processing_template_decl)
847 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
849 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
850 begin_cond (&FOR_COND (for_stmt));
853 /* Finish the COND of a for-statement, which may be given by
857 finish_for_cond (tree cond, tree for_stmt)
859 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
860 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
863 /* Finish the increment-EXPRESSION in a for-statement, which may be
864 given by FOR_STMT. */
867 finish_for_expr (tree expr, tree for_stmt)
871 /* If EXPR is an overloaded function, issue an error; there is no
872 context available to use to perform overload resolution. */
873 if (type_unknown_p (expr))
875 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
876 expr = error_mark_node;
878 if (!processing_template_decl)
880 if (warn_sequence_point)
881 verify_sequence_points (expr);
882 expr = convert_to_void (expr, "3rd expression in for",
883 tf_warning_or_error);
885 else if (!type_dependent_expression_p (expr))
886 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for",
887 tf_warning_or_error);
888 expr = maybe_cleanup_point_expr_void (expr);
889 if (check_for_bare_parameter_packs (expr))
890 expr = error_mark_node;
891 FOR_EXPR (for_stmt) = expr;
894 /* Finish the body of a for-statement, which may be given by
895 FOR_STMT. The increment-EXPR for the loop must be
899 finish_for_stmt (tree for_stmt)
901 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
903 /* Pop the scope for the body of the loop. */
904 if (flag_new_for_scope > 0)
906 tree scope = TREE_CHAIN (for_stmt);
907 TREE_CHAIN (for_stmt) = NULL;
908 add_stmt (do_poplevel (scope));
914 /* Finish a break-statement. */
917 finish_break_stmt (void)
919 return add_stmt (build_stmt (BREAK_STMT));
922 /* Finish a continue-statement. */
925 finish_continue_stmt (void)
927 return add_stmt (build_stmt (CONTINUE_STMT));
930 /* Begin a switch-statement. Returns a new SWITCH_STMT if
934 begin_switch_stmt (void)
938 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
940 scope = do_pushlevel (sk_block);
941 TREE_CHAIN (r) = scope;
942 begin_cond (&SWITCH_STMT_COND (r));
947 /* Finish the cond of a switch-statement. */
950 finish_switch_cond (tree cond, tree switch_stmt)
952 tree orig_type = NULL;
953 if (!processing_template_decl)
957 /* Convert the condition to an integer or enumeration type. */
958 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
959 if (cond == NULL_TREE)
961 error ("switch quantity not an integer");
962 cond = error_mark_node;
964 orig_type = TREE_TYPE (cond);
965 if (cond != error_mark_node)
969 Integral promotions are performed. */
970 cond = perform_integral_promotions (cond);
971 cond = maybe_cleanup_point_expr (cond);
974 if (cond != error_mark_node)
976 index = get_unwidened (cond, NULL_TREE);
977 /* We can't strip a conversion from a signed type to an unsigned,
978 because if we did, int_fits_type_p would do the wrong thing
979 when checking case values for being in range,
980 and it's too hard to do the right thing. */
981 if (TYPE_UNSIGNED (TREE_TYPE (cond))
982 == TYPE_UNSIGNED (TREE_TYPE (index)))
986 if (check_for_bare_parameter_packs (cond))
987 cond = error_mark_node;
988 else if (!processing_template_decl && warn_sequence_point)
989 verify_sequence_points (cond);
991 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
992 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
993 add_stmt (switch_stmt);
994 push_switch (switch_stmt);
995 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
998 /* Finish the body of a switch-statement, which may be given by
999 SWITCH_STMT. The COND to switch on is indicated. */
1002 finish_switch_stmt (tree switch_stmt)
1006 SWITCH_STMT_BODY (switch_stmt) =
1007 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1011 scope = TREE_CHAIN (switch_stmt);
1012 TREE_CHAIN (switch_stmt) = NULL;
1013 add_stmt (do_poplevel (scope));
1016 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1020 begin_try_block (void)
1022 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
1024 TRY_STMTS (r) = push_stmt_list ();
1028 /* Likewise, for a function-try-block. The block returned in
1029 *COMPOUND_STMT is an artificial outer scope, containing the
1030 function-try-block. */
1033 begin_function_try_block (tree *compound_stmt)
1036 /* This outer scope does not exist in the C++ standard, but we need
1037 a place to put __FUNCTION__ and similar variables. */
1038 *compound_stmt = begin_compound_stmt (0);
1039 r = begin_try_block ();
1040 FN_TRY_BLOCK_P (r) = 1;
1044 /* Finish a try-block, which may be given by TRY_BLOCK. */
1047 finish_try_block (tree try_block)
1049 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1050 TRY_HANDLERS (try_block) = push_stmt_list ();
1053 /* Finish the body of a cleanup try-block, which may be given by
1057 finish_cleanup_try_block (tree try_block)
1059 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1062 /* Finish an implicitly generated try-block, with a cleanup is given
1066 finish_cleanup (tree cleanup, tree try_block)
1068 TRY_HANDLERS (try_block) = cleanup;
1069 CLEANUP_P (try_block) = 1;
1072 /* Likewise, for a function-try-block. */
1075 finish_function_try_block (tree try_block)
1077 finish_try_block (try_block);
1078 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1079 the try block, but moving it inside. */
1080 in_function_try_handler = 1;
1083 /* Finish a handler-sequence for a try-block, which may be given by
1087 finish_handler_sequence (tree try_block)
1089 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1090 check_handlers (TRY_HANDLERS (try_block));
1093 /* Finish the handler-seq for a function-try-block, given by
1094 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1095 begin_function_try_block. */
1098 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1100 in_function_try_handler = 0;
1101 finish_handler_sequence (try_block);
1102 finish_compound_stmt (compound_stmt);
1105 /* Begin a handler. Returns a HANDLER if appropriate. */
1108 begin_handler (void)
1112 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1115 /* Create a binding level for the eh_info and the exception object
1117 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1122 /* Finish the handler-parameters for a handler, which may be given by
1123 HANDLER. DECL is the declaration for the catch parameter, or NULL
1124 if this is a `catch (...)' clause. */
1127 finish_handler_parms (tree decl, tree handler)
1129 tree type = NULL_TREE;
1130 if (processing_template_decl)
1134 decl = pushdecl (decl);
1135 decl = push_template_decl (decl);
1136 HANDLER_PARMS (handler) = decl;
1137 type = TREE_TYPE (decl);
1141 type = expand_start_catch_block (decl);
1142 HANDLER_TYPE (handler) = type;
1143 if (!processing_template_decl && type)
1144 mark_used (eh_type_info (type));
1147 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1148 the return value from the matching call to finish_handler_parms. */
1151 finish_handler (tree handler)
1153 if (!processing_template_decl)
1154 expand_end_catch_block ();
1155 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1158 /* Begin a compound statement. FLAGS contains some bits that control the
1159 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1160 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1161 block of a function. If BCS_TRY_BLOCK is set, this is the block
1162 created on behalf of a TRY statement. Returns a token to be passed to
1163 finish_compound_stmt. */
1166 begin_compound_stmt (unsigned int flags)
1170 if (flags & BCS_NO_SCOPE)
1172 r = push_stmt_list ();
1173 STATEMENT_LIST_NO_SCOPE (r) = 1;
1175 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1176 But, if it's a statement-expression with a scopeless block, there's
1177 nothing to keep, and we don't want to accidentally keep a block
1178 *inside* the scopeless block. */
1179 keep_next_level (false);
1182 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1184 /* When processing a template, we need to remember where the braces were,
1185 so that we can set up identical scopes when instantiating the template
1186 later. BIND_EXPR is a handy candidate for this.
1187 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1188 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1189 processing templates. */
1190 if (processing_template_decl)
1192 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1193 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1194 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1195 TREE_SIDE_EFFECTS (r) = 1;
1201 /* Finish a compound-statement, which is given by STMT. */
1204 finish_compound_stmt (tree stmt)
1206 if (TREE_CODE (stmt) == BIND_EXPR)
1207 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1208 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1209 stmt = pop_stmt_list (stmt);
1212 /* Destroy any ObjC "super" receivers that may have been
1214 objc_clear_super_receiver ();
1216 stmt = do_poplevel (stmt);
1219 /* ??? See c_end_compound_stmt wrt statement expressions. */
1224 /* Finish an asm-statement, whose components are a STRING, some
1225 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1226 whether the asm-statement should be considered volatile. */
1229 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1230 tree input_operands, tree clobbers)
1234 int ninputs = list_length (input_operands);
1235 int noutputs = list_length (output_operands);
1237 if (!processing_template_decl)
1239 const char *constraint;
1240 const char **oconstraints;
1241 bool allows_mem, allows_reg, is_inout;
1245 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1247 string = resolve_asm_operand_names (string, output_operands,
1250 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1252 operand = TREE_VALUE (t);
1254 /* ??? Really, this should not be here. Users should be using a
1255 proper lvalue, dammit. But there's a long history of using
1256 casts in the output operands. In cases like longlong.h, this
1257 becomes a primitive form of typechecking -- if the cast can be
1258 removed, then the output operand had a type of the proper width;
1259 otherwise we'll get an error. Gross, but ... */
1260 STRIP_NOPS (operand);
1262 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1263 operand = error_mark_node;
1265 if (operand != error_mark_node
1266 && (TREE_READONLY (operand)
1267 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1268 /* Functions are not modifiable, even though they are
1270 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1271 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1272 /* If it's an aggregate and any field is const, then it is
1273 effectively const. */
1274 || (CLASS_TYPE_P (TREE_TYPE (operand))
1275 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1276 readonly_error (operand, "assignment (via 'asm' output)");
1278 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1279 oconstraints[i] = constraint;
1281 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1282 &allows_mem, &allows_reg, &is_inout))
1284 /* If the operand is going to end up in memory,
1285 mark it addressable. */
1286 if (!allows_reg && !cxx_mark_addressable (operand))
1287 operand = error_mark_node;
1290 operand = error_mark_node;
1292 TREE_VALUE (t) = operand;
1295 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1297 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1298 operand = decay_conversion (TREE_VALUE (t));
1300 /* If the type of the operand hasn't been determined (e.g.,
1301 because it involves an overloaded function), then issue
1302 an error message. There's no context available to
1303 resolve the overloading. */
1304 if (TREE_TYPE (operand) == unknown_type_node)
1306 error ("type of asm operand %qE could not be determined",
1308 operand = error_mark_node;
1311 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1312 oconstraints, &allows_mem, &allows_reg))
1314 /* If the operand is going to end up in memory,
1315 mark it addressable. */
1316 if (!allows_reg && allows_mem)
1318 /* Strip the nops as we allow this case. FIXME, this really
1319 should be rejected or made deprecated. */
1320 STRIP_NOPS (operand);
1321 if (!cxx_mark_addressable (operand))
1322 operand = error_mark_node;
1326 operand = error_mark_node;
1328 TREE_VALUE (t) = operand;
1332 r = build_stmt (ASM_EXPR, string,
1333 output_operands, input_operands,
1335 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1336 r = maybe_cleanup_point_expr_void (r);
1337 return add_stmt (r);
1340 /* Finish a label with the indicated NAME. */
1343 finish_label_stmt (tree name)
1345 tree decl = define_label (input_location, name);
1347 if (decl == error_mark_node)
1348 return error_mark_node;
1350 return add_stmt (build_stmt (LABEL_EXPR, decl));
1353 /* Finish a series of declarations for local labels. G++ allows users
1354 to declare "local" labels, i.e., labels with scope. This extension
1355 is useful when writing code involving statement-expressions. */
1358 finish_label_decl (tree name)
1360 if (!at_function_scope_p ())
1362 error ("__label__ declarations are only allowed in function scopes");
1366 add_decl_expr (declare_local_label (name));
1369 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1372 finish_decl_cleanup (tree decl, tree cleanup)
1374 push_cleanup (decl, cleanup, false);
1377 /* If the current scope exits with an exception, run CLEANUP. */
1380 finish_eh_cleanup (tree cleanup)
1382 push_cleanup (NULL, cleanup, true);
1385 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1386 order they were written by the user. Each node is as for
1387 emit_mem_initializers. */
1390 finish_mem_initializers (tree mem_inits)
1392 /* Reorder the MEM_INITS so that they are in the order they appeared
1393 in the source program. */
1394 mem_inits = nreverse (mem_inits);
1396 if (processing_template_decl)
1400 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1402 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1403 check for bare parameter packs in the TREE_VALUE, because
1404 any parameter packs in the TREE_VALUE have already been
1405 bound as part of the TREE_PURPOSE. See
1406 make_pack_expansion for more information. */
1407 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1408 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1409 TREE_VALUE (mem) = error_mark_node;
1412 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1415 emit_mem_initializers (mem_inits);
1418 /* Finish a parenthesized expression EXPR. */
1421 finish_parenthesized_expr (tree expr)
1424 /* This inhibits warnings in c_common_truthvalue_conversion. */
1425 TREE_NO_WARNING (expr) = 1;
1427 if (TREE_CODE (expr) == OFFSET_REF)
1428 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1429 enclosed in parentheses. */
1430 PTRMEM_OK_P (expr) = 0;
1432 if (TREE_CODE (expr) == STRING_CST)
1433 PAREN_STRING_LITERAL_P (expr) = 1;
1438 /* Finish a reference to a non-static data member (DECL) that is not
1439 preceded by `.' or `->'. */
1442 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1444 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1448 if (current_function_decl
1449 && DECL_STATIC_FUNCTION_P (current_function_decl))
1450 error ("invalid use of member %q+D in static member function", decl);
1452 error ("invalid use of non-static data member %q+D", decl);
1453 error ("from this location");
1455 return error_mark_node;
1457 TREE_USED (current_class_ptr) = 1;
1458 if (processing_template_decl && !qualifying_scope)
1460 tree type = TREE_TYPE (decl);
1462 if (TREE_CODE (type) == REFERENCE_TYPE)
1463 type = TREE_TYPE (type);
1466 /* Set the cv qualifiers. */
1467 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1469 if (DECL_MUTABLE_P (decl))
1470 quals &= ~TYPE_QUAL_CONST;
1472 quals |= cp_type_quals (TREE_TYPE (decl));
1473 type = cp_build_qualified_type (type, quals);
1476 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1480 tree access_type = TREE_TYPE (object);
1481 tree lookup_context = context_for_name_lookup (decl);
1483 while (!DERIVED_FROM_P (lookup_context, access_type))
1485 access_type = TYPE_CONTEXT (access_type);
1486 while (access_type && DECL_P (access_type))
1487 access_type = DECL_CONTEXT (access_type);
1491 error ("object missing in reference to %q+D", decl);
1492 error ("from this location");
1493 return error_mark_node;
1497 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1498 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1500 if (processing_template_decl)
1501 return build_qualified_name (TREE_TYPE (decl),
1504 /*template_p=*/false);
1506 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1509 /* If the data member was named `C::M', convert `*this' to `C'
1511 if (qualifying_scope)
1513 tree binfo = NULL_TREE;
1514 object = build_scoped_ref (object, qualifying_scope,
1518 return build_class_member_access_expr (object, decl,
1519 /*access_path=*/NULL_TREE,
1520 /*preserve_reference=*/false,
1521 tf_warning_or_error);
1525 /* DECL was the declaration to which a qualified-id resolved. Issue
1526 an error message if it is not accessible. If OBJECT_TYPE is
1527 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1528 type of `*x', or `x', respectively. If the DECL was named as
1529 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1532 check_accessibility_of_qualified_id (tree decl,
1534 tree nested_name_specifier)
1537 tree qualifying_type = NULL_TREE;
1539 /* If we're not checking, return immediately. */
1540 if (deferred_access_no_check)
1543 /* Determine the SCOPE of DECL. */
1544 scope = context_for_name_lookup (decl);
1545 /* If the SCOPE is not a type, then DECL is not a member. */
1546 if (!TYPE_P (scope))
1548 /* Compute the scope through which DECL is being accessed. */
1550 /* OBJECT_TYPE might not be a class type; consider:
1552 class A { typedef int I; };
1556 In this case, we will have "A::I" as the DECL, but "I" as the
1558 && CLASS_TYPE_P (object_type)
1559 && DERIVED_FROM_P (scope, object_type))
1560 /* If we are processing a `->' or `.' expression, use the type of the
1562 qualifying_type = object_type;
1563 else if (nested_name_specifier)
1565 /* If the reference is to a non-static member of the
1566 current class, treat it as if it were referenced through
1568 if (DECL_NONSTATIC_MEMBER_P (decl)
1569 && current_class_ptr
1570 && DERIVED_FROM_P (scope, current_class_type))
1571 qualifying_type = current_class_type;
1572 /* Otherwise, use the type indicated by the
1573 nested-name-specifier. */
1575 qualifying_type = nested_name_specifier;
1578 /* Otherwise, the name must be from the current class or one of
1580 qualifying_type = currently_open_derived_class (scope);
1583 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1584 or similar in a default argument value. */
1585 && CLASS_TYPE_P (qualifying_type)
1586 && !dependent_type_p (qualifying_type))
1587 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1591 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1592 class named to the left of the "::" operator. DONE is true if this
1593 expression is a complete postfix-expression; it is false if this
1594 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1595 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1596 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1597 is true iff this qualified name appears as a template argument. */
1600 finish_qualified_id_expr (tree qualifying_class,
1605 bool template_arg_p)
1607 gcc_assert (TYPE_P (qualifying_class));
1609 if (error_operand_p (expr))
1610 return error_mark_node;
1612 if (DECL_P (expr) || BASELINK_P (expr))
1616 check_template_keyword (expr);
1618 /* If EXPR occurs as the operand of '&', use special handling that
1619 permits a pointer-to-member. */
1620 if (address_p && done)
1622 if (TREE_CODE (expr) == SCOPE_REF)
1623 expr = TREE_OPERAND (expr, 1);
1624 expr = build_offset_ref (qualifying_class, expr,
1625 /*address_p=*/true);
1629 /* Within the scope of a class, turn references to non-static
1630 members into expression of the form "this->...". */
1632 /* But, within a template argument, we do not want make the
1633 transformation, as there is no "this" pointer. */
1635 else if (TREE_CODE (expr) == FIELD_DECL)
1637 push_deferring_access_checks (dk_no_check);
1638 expr = finish_non_static_data_member (expr, current_class_ref,
1640 pop_deferring_access_checks ();
1642 else if (BASELINK_P (expr) && !processing_template_decl)
1646 /* See if any of the functions are non-static members. */
1647 fns = BASELINK_FUNCTIONS (expr);
1648 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1649 fns = TREE_OPERAND (fns, 0);
1650 /* If so, the expression may be relative to the current
1652 if (!shared_member_p (fns)
1653 && current_class_type
1654 && DERIVED_FROM_P (qualifying_class, current_class_type))
1655 expr = (build_class_member_access_expr
1656 (maybe_dummy_object (qualifying_class, NULL),
1658 BASELINK_ACCESS_BINFO (expr),
1659 /*preserve_reference=*/false,
1660 tf_warning_or_error));
1662 /* The expression is a qualified name whose address is not
1664 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1670 /* Begin a statement-expression. The value returned must be passed to
1671 finish_stmt_expr. */
1674 begin_stmt_expr (void)
1676 return push_stmt_list ();
1679 /* Process the final expression of a statement expression. EXPR can be
1680 NULL, if the final expression is empty. Return a STATEMENT_LIST
1681 containing all the statements in the statement-expression, or
1682 ERROR_MARK_NODE if there was an error. */
1685 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1687 if (error_operand_p (expr))
1689 /* The type of the statement-expression is the type of the last
1691 TREE_TYPE (stmt_expr) = error_mark_node;
1692 return error_mark_node;
1695 /* If the last statement does not have "void" type, then the value
1696 of the last statement is the value of the entire expression. */
1699 tree type = TREE_TYPE (expr);
1701 if (processing_template_decl)
1703 expr = build_stmt (EXPR_STMT, expr);
1704 expr = add_stmt (expr);
1705 /* Mark the last statement so that we can recognize it as such at
1706 template-instantiation time. */
1707 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1709 else if (VOID_TYPE_P (type))
1711 /* Just treat this like an ordinary statement. */
1712 expr = finish_expr_stmt (expr);
1716 /* It actually has a value we need to deal with. First, force it
1717 to be an rvalue so that we won't need to build up a copy
1718 constructor call later when we try to assign it to something. */
1719 expr = force_rvalue (expr);
1720 if (error_operand_p (expr))
1721 return error_mark_node;
1723 /* Update for array-to-pointer decay. */
1724 type = TREE_TYPE (expr);
1726 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1727 normal statement, but don't convert to void or actually add
1729 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1730 expr = maybe_cleanup_point_expr (expr);
1734 /* The type of the statement-expression is the type of the last
1736 TREE_TYPE (stmt_expr) = type;
1742 /* Finish a statement-expression. EXPR should be the value returned
1743 by the previous begin_stmt_expr. Returns an expression
1744 representing the statement-expression. */
1747 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1752 if (error_operand_p (stmt_expr))
1754 pop_stmt_list (stmt_expr);
1755 return error_mark_node;
1758 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1760 type = TREE_TYPE (stmt_expr);
1761 result = pop_stmt_list (stmt_expr);
1762 TREE_TYPE (result) = type;
1764 if (processing_template_decl)
1766 result = build_min (STMT_EXPR, type, result);
1767 TREE_SIDE_EFFECTS (result) = 1;
1768 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1770 else if (CLASS_TYPE_P (type))
1772 /* Wrap the statement-expression in a TARGET_EXPR so that the
1773 temporary object created by the final expression is destroyed at
1774 the end of the full-expression containing the
1775 statement-expression. */
1776 result = force_target_expr (type, result);
1782 /* Returns the expression which provides the value of STMT_EXPR. */
1785 stmt_expr_value_expr (tree stmt_expr)
1787 tree t = STMT_EXPR_STMT (stmt_expr);
1789 if (TREE_CODE (t) == BIND_EXPR)
1790 t = BIND_EXPR_BODY (t);
1792 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1793 t = STATEMENT_LIST_TAIL (t)->stmt;
1795 if (TREE_CODE (t) == EXPR_STMT)
1796 t = EXPR_STMT_EXPR (t);
1801 /* Perform Koenig lookup. FN is the postfix-expression representing
1802 the function (or functions) to call; ARGS are the arguments to the
1803 call. Returns the functions to be considered by overload
1807 perform_koenig_lookup (tree fn, tree args)
1809 tree identifier = NULL_TREE;
1810 tree functions = NULL_TREE;
1812 /* Find the name of the overloaded function. */
1813 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1815 else if (is_overloaded_fn (fn))
1818 identifier = DECL_NAME (get_first_fn (functions));
1820 else if (DECL_P (fn))
1823 identifier = DECL_NAME (fn);
1826 /* A call to a namespace-scope function using an unqualified name.
1828 Do Koenig lookup -- unless any of the arguments are
1830 if (!any_type_dependent_arguments_p (args))
1832 fn = lookup_arg_dependent (identifier, functions, args);
1834 /* The unqualified name could not be resolved. */
1835 fn = unqualified_fn_lookup_error (identifier);
1841 /* Generate an expression for `FN (ARGS)'.
1843 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1844 as a virtual call, even if FN is virtual. (This flag is set when
1845 encountering an expression where the function name is explicitly
1846 qualified. For example a call to `X::f' never generates a virtual
1849 Returns code for the call. */
1852 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p,
1853 tsubst_flags_t complain)
1859 if (fn == error_mark_node || args == error_mark_node)
1860 return error_mark_node;
1862 /* ARGS should be a list of arguments. */
1863 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1864 gcc_assert (!TYPE_P (fn));
1869 if (processing_template_decl)
1871 if (type_dependent_expression_p (fn)
1872 || any_type_dependent_arguments_p (args))
1874 result = build_nt_call_list (fn, args);
1875 KOENIG_LOOKUP_P (result) = koenig_p;
1880 tree fndecl = OVL_CURRENT (fn);
1881 if (TREE_CODE (fndecl) != FUNCTION_DECL
1882 || !TREE_THIS_VOLATILE (fndecl))
1888 current_function_returns_abnormally = 1;
1892 if (!BASELINK_P (fn)
1893 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1894 && TREE_TYPE (fn) != unknown_type_node)
1895 fn = build_non_dependent_expr (fn);
1896 args = build_non_dependent_args (orig_args);
1899 if (is_overloaded_fn (fn))
1900 fn = baselink_for_fns (fn);
1903 if (BASELINK_P (fn))
1907 /* A call to a member function. From [over.call.func]:
1909 If the keyword this is in scope and refers to the class of
1910 that member function, or a derived class thereof, then the
1911 function call is transformed into a qualified function call
1912 using (*this) as the postfix-expression to the left of the
1913 . operator.... [Otherwise] a contrived object of type T
1914 becomes the implied object argument.
1916 This paragraph is unclear about this situation:
1918 struct A { void f(); };
1919 struct B : public A {};
1920 struct C : public A { void g() { B::f(); }};
1922 In particular, for `B::f', this paragraph does not make clear
1923 whether "the class of that member function" refers to `A' or
1924 to `B'. We believe it refers to `B'. */
1925 if (current_class_type
1926 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1928 && current_class_ref)
1929 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1933 tree representative_fn;
1935 representative_fn = BASELINK_FUNCTIONS (fn);
1936 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1937 representative_fn = TREE_OPERAND (representative_fn, 0);
1938 representative_fn = get_first_fn (representative_fn);
1939 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1942 if (processing_template_decl)
1944 if (type_dependent_expression_p (object))
1945 return build_nt_call_list (orig_fn, orig_args);
1946 object = build_non_dependent_expr (object);
1949 result = build_new_method_call (object, fn, args, NULL_TREE,
1951 ? LOOKUP_NONVIRTUAL : 0),
1955 else if (is_overloaded_fn (fn))
1957 /* If the function is an overloaded builtin, resolve it. */
1958 if (TREE_CODE (fn) == FUNCTION_DECL
1959 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1960 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1961 result = resolve_overloaded_builtin (fn, args);
1964 /* A call to a namespace-scope function. */
1965 result = build_new_function_call (fn, args, koenig_p, complain);
1967 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1970 error ("arguments to destructor are not allowed");
1971 /* Mark the pseudo-destructor call as having side-effects so
1972 that we do not issue warnings about its use. */
1973 result = build1 (NOP_EXPR,
1975 TREE_OPERAND (fn, 0));
1976 TREE_SIDE_EFFECTS (result) = 1;
1978 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1979 /* If the "function" is really an object of class type, it might
1980 have an overloaded `operator ()'. */
1981 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1982 /*overloaded_p=*/NULL, complain);
1985 /* A call where the function is unknown. */
1986 result = cp_build_function_call (fn, args, complain);
1988 if (processing_template_decl)
1990 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
1991 KOENIG_LOOKUP_P (result) = koenig_p;
1996 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1997 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1998 POSTDECREMENT_EXPR.) */
2001 finish_increment_expr (tree expr, enum tree_code code)
2003 return build_x_unary_op (code, expr, tf_warning_or_error);
2006 /* Finish a use of `this'. Returns an expression for `this'. */
2009 finish_this_expr (void)
2013 if (current_class_ptr)
2015 result = current_class_ptr;
2017 else if (current_function_decl
2018 && DECL_STATIC_FUNCTION_P (current_function_decl))
2020 error ("%<this%> is unavailable for static member functions");
2021 result = error_mark_node;
2025 if (current_function_decl)
2026 error ("invalid use of %<this%> in non-member function");
2028 error ("invalid use of %<this%> at top level");
2029 result = error_mark_node;
2035 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2036 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2037 the TYPE for the type given. If SCOPE is non-NULL, the expression
2038 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2041 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2043 if (object == error_mark_node || destructor == error_mark_node)
2044 return error_mark_node;
2046 gcc_assert (TYPE_P (destructor));
2048 if (!processing_template_decl)
2050 if (scope == error_mark_node)
2052 error ("invalid qualifying scope in pseudo-destructor name");
2053 return error_mark_node;
2055 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2057 error ("qualified type %qT does not match destructor name ~%qT",
2059 return error_mark_node;
2063 /* [expr.pseudo] says both:
2065 The type designated by the pseudo-destructor-name shall be
2066 the same as the object type.
2070 The cv-unqualified versions of the object type and of the
2071 type designated by the pseudo-destructor-name shall be the
2074 We implement the more generous second sentence, since that is
2075 what most other compilers do. */
2076 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2079 error ("%qE is not of type %qT", object, destructor);
2080 return error_mark_node;
2084 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2087 /* Finish an expression of the form CODE EXPR. */
2090 finish_unary_op_expr (enum tree_code code, tree expr)
2092 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2093 /* Inside a template, build_x_unary_op does not fold the
2094 expression. So check whether the result is folded before
2095 setting TREE_NEGATED_INT. */
2096 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2097 && TREE_CODE (result) == INTEGER_CST
2098 && !TYPE_UNSIGNED (TREE_TYPE (result))
2099 && INT_CST_LT (result, integer_zero_node))
2101 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2102 setting TREE_NEGATED_INT. */
2103 result = copy_node (result);
2104 TREE_NEGATED_INT (result) = 1;
2106 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2107 overflow_warning (result);
2112 /* Finish a compound-literal expression. TYPE is the type to which
2113 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2116 finish_compound_literal (tree type, tree compound_literal)
2118 if (!TYPE_OBJ_P (type))
2120 error ("compound literal of non-object type %qT", type);
2121 return error_mark_node;
2124 if (processing_template_decl)
2126 TREE_TYPE (compound_literal) = type;
2127 /* Mark the expression as a compound literal. */
2128 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2129 return compound_literal;
2132 type = complete_type (type);
2134 if (TYPE_NON_AGGREGATE_CLASS (type))
2136 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2137 everywhere that deals with function arguments would be a pain, so
2138 just wrap it in a TREE_LIST. The parser set a flag so we know
2139 that it came from T{} rather than T({}). */
2140 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2141 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2142 return build_functional_cast (type, compound_literal, tf_error);
2145 if (TREE_CODE (type) == ARRAY_TYPE
2146 && check_array_initializer (NULL_TREE, type, compound_literal))
2147 return error_mark_node;
2148 compound_literal = reshape_init (type, compound_literal);
2149 if (TREE_CODE (type) == ARRAY_TYPE)
2150 cp_complete_array_type (&type, compound_literal, false);
2151 compound_literal = digest_init (type, compound_literal);
2152 if ((!at_function_scope_p () || cp_type_readonly (type))
2153 && initializer_constant_valid_p (compound_literal, type))
2155 tree decl = create_temporary_var (type);
2156 DECL_INITIAL (decl) = compound_literal;
2157 TREE_STATIC (decl) = 1;
2158 decl = pushdecl_top_level (decl);
2159 DECL_NAME (decl) = make_anon_name ();
2160 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2164 return get_target_expr (compound_literal);
2167 /* Return the declaration for the function-name variable indicated by
2171 finish_fname (tree id)
2175 decl = fname_decl (C_RID_CODE (id), id);
2176 if (processing_template_decl)
2177 decl = DECL_NAME (decl);
2181 /* Finish a translation unit. */
2184 finish_translation_unit (void)
2186 /* In case there were missing closebraces,
2187 get us back to the global binding level. */
2189 while (current_namespace != global_namespace)
2192 /* Do file scope __FUNCTION__ et al. */
2193 finish_fname_decls ();
2196 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2197 Returns the parameter. */
2200 finish_template_type_parm (tree aggr, tree identifier)
2202 if (aggr != class_type_node)
2204 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2205 aggr = class_type_node;
2208 return build_tree_list (aggr, identifier);
2211 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2212 Returns the parameter. */
2215 finish_template_template_parm (tree aggr, tree identifier)
2217 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2218 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2219 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2220 DECL_TEMPLATE_RESULT (tmpl) = decl;
2221 DECL_ARTIFICIAL (decl) = 1;
2222 end_template_decl ();
2224 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2226 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2227 /*is_primary=*/true, /*is_partial=*/false,
2230 return finish_template_type_parm (aggr, tmpl);
2233 /* ARGUMENT is the default-argument value for a template template
2234 parameter. If ARGUMENT is invalid, issue error messages and return
2235 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2238 check_template_template_default_arg (tree argument)
2240 if (TREE_CODE (argument) != TEMPLATE_DECL
2241 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2242 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2244 if (TREE_CODE (argument) == TYPE_DECL)
2245 error ("invalid use of type %qT as a default value for a template "
2246 "template-parameter", TREE_TYPE (argument));
2248 error ("invalid default argument for a template template parameter");
2249 return error_mark_node;
2255 /* Begin a class definition, as indicated by T. */
2258 begin_class_definition (tree t, tree attributes)
2260 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2261 return error_mark_node;
2263 if (processing_template_parmlist)
2265 error ("definition of %q#T inside template parameter list", t);
2266 return error_mark_node;
2268 /* A non-implicit typename comes from code like:
2270 template <typename T> struct A {
2271 template <typename U> struct A<T>::B ...
2273 This is erroneous. */
2274 else if (TREE_CODE (t) == TYPENAME_TYPE)
2276 error ("invalid definition of qualified type %qT", t);
2277 t = error_mark_node;
2280 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2282 t = make_class_type (RECORD_TYPE);
2283 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2286 /* Update the location of the decl. */
2287 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2289 if (TYPE_BEING_DEFINED (t))
2291 t = make_class_type (TREE_CODE (t));
2292 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2294 maybe_process_partial_specialization (t);
2296 TYPE_BEING_DEFINED (t) = 1;
2298 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2300 if (flag_pack_struct)
2303 TYPE_PACKED (t) = 1;
2304 /* Even though the type is being defined for the first time
2305 here, there might have been a forward declaration, so there
2306 might be cv-qualified variants of T. */
2307 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2308 TYPE_PACKED (v) = 1;
2310 /* Reset the interface data, at the earliest possible
2311 moment, as it might have been set via a class foo;
2313 if (! TYPE_ANONYMOUS_P (t))
2315 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2316 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2317 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2318 (t, finfo->interface_unknown);
2320 reset_specialization();
2322 /* Make a declaration for this class in its own scope. */
2323 build_self_reference ();
2328 /* Finish the member declaration given by DECL. */
2331 finish_member_declaration (tree decl)
2333 if (decl == error_mark_node || decl == NULL_TREE)
2336 if (decl == void_type_node)
2337 /* The COMPONENT was a friend, not a member, and so there's
2338 nothing for us to do. */
2341 /* We should see only one DECL at a time. */
2342 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2344 /* Set up access control for DECL. */
2346 = (current_access_specifier == access_private_node);
2347 TREE_PROTECTED (decl)
2348 = (current_access_specifier == access_protected_node);
2349 if (TREE_CODE (decl) == TEMPLATE_DECL)
2351 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2352 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2355 /* Mark the DECL as a member of the current class. */
2356 DECL_CONTEXT (decl) = current_class_type;
2358 /* Check for bare parameter packs in the member variable declaration. */
2359 if (TREE_CODE (decl) == FIELD_DECL)
2361 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2362 TREE_TYPE (decl) = error_mark_node;
2363 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2364 DECL_ATTRIBUTES (decl) = NULL_TREE;
2369 A C language linkage is ignored for the names of class members
2370 and the member function type of class member functions. */
2371 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2372 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2374 /* Put functions on the TYPE_METHODS list and everything else on the
2375 TYPE_FIELDS list. Note that these are built up in reverse order.
2376 We reverse them (to obtain declaration order) in finish_struct. */
2377 if (TREE_CODE (decl) == FUNCTION_DECL
2378 || DECL_FUNCTION_TEMPLATE_P (decl))
2380 /* We also need to add this function to the
2381 CLASSTYPE_METHOD_VEC. */
2382 if (add_method (current_class_type, decl, NULL_TREE))
2384 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2385 TYPE_METHODS (current_class_type) = decl;
2387 maybe_add_class_template_decl_list (current_class_type, decl,
2391 /* Enter the DECL into the scope of the class. */
2392 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2393 || pushdecl_class_level (decl))
2395 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2396 go at the beginning. The reason is that lookup_field_1
2397 searches the list in order, and we want a field name to
2398 override a type name so that the "struct stat hack" will
2399 work. In particular:
2401 struct S { enum E { }; int E } s;
2404 is valid. In addition, the FIELD_DECLs must be maintained in
2405 declaration order so that class layout works as expected.
2406 However, we don't need that order until class layout, so we
2407 save a little time by putting FIELD_DECLs on in reverse order
2408 here, and then reversing them in finish_struct_1. (We could
2409 also keep a pointer to the correct insertion points in the
2412 if (TREE_CODE (decl) == TYPE_DECL)
2413 TYPE_FIELDS (current_class_type)
2414 = chainon (TYPE_FIELDS (current_class_type), decl);
2417 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2418 TYPE_FIELDS (current_class_type) = decl;
2421 maybe_add_class_template_decl_list (current_class_type, decl,
2426 note_decl_for_pch (decl);
2429 /* DECL has been declared while we are building a PCH file. Perform
2430 actions that we might normally undertake lazily, but which can be
2431 performed now so that they do not have to be performed in
2432 translation units which include the PCH file. */
2435 note_decl_for_pch (tree decl)
2437 gcc_assert (pch_file);
2439 /* There's a good chance that we'll have to mangle names at some
2440 point, even if only for emission in debugging information. */
2441 if ((TREE_CODE (decl) == VAR_DECL
2442 || TREE_CODE (decl) == FUNCTION_DECL)
2443 && !processing_template_decl)
2447 /* Finish processing a complete template declaration. The PARMS are
2448 the template parameters. */
2451 finish_template_decl (tree parms)
2454 end_template_decl ();
2456 end_specialization ();
2459 /* Finish processing a template-id (which names a type) of the form
2460 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2461 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2462 the scope of template-id indicated. */
2465 finish_template_type (tree name, tree args, int entering_scope)
2469 decl = lookup_template_class (name, args,
2470 NULL_TREE, NULL_TREE, entering_scope,
2471 tf_warning_or_error | tf_user);
2472 if (decl != error_mark_node)
2473 decl = TYPE_STUB_DECL (decl);
2478 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2479 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2480 BASE_CLASS, or NULL_TREE if an error occurred. The
2481 ACCESS_SPECIFIER is one of
2482 access_{default,public,protected_private}_node. For a virtual base
2483 we set TREE_TYPE. */
2486 finish_base_specifier (tree base, tree access, bool virtual_p)
2490 if (base == error_mark_node)
2492 error ("invalid base-class specification");
2495 else if (! MAYBE_CLASS_TYPE_P (base))
2497 error ("%qT is not a class type", base);
2502 if (cp_type_quals (base) != 0)
2504 error ("base class %qT has cv qualifiers", base);
2505 base = TYPE_MAIN_VARIANT (base);
2507 result = build_tree_list (access, base);
2509 TREE_TYPE (result) = integer_type_node;
2515 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2516 what we found when we tried to do the lookup.
2517 LOCATION is the location of the NAME identifier;
2518 The location is used in the error message*/
2521 qualified_name_lookup_error (tree scope, tree name,
2522 tree decl, location_t location)
2524 if (scope == error_mark_node)
2525 ; /* We already complained. */
2526 else if (TYPE_P (scope))
2528 if (!COMPLETE_TYPE_P (scope))
2529 error ("%Hincomplete type %qT used in nested name specifier",
2531 else if (TREE_CODE (decl) == TREE_LIST)
2533 error ("%Hreference to %<%T::%D%> is ambiguous", &location, scope, name);
2534 print_candidates (decl);
2537 error ("%H%qD is not a member of %qT", &location, name, scope);
2539 else if (scope != global_namespace)
2540 error ("%H%qD is not a member of %qD", &location, name, scope);
2542 error ("%H%<::%D%> has not been declared", &location, name);
2545 /* If FNS is a member function, a set of member functions, or a
2546 template-id referring to one or more member functions, return a
2547 BASELINK for FNS, incorporating the current access context.
2548 Otherwise, return FNS unchanged. */
2551 baselink_for_fns (tree fns)
2556 if (BASELINK_P (fns)
2557 || error_operand_p (fns))
2561 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2562 fn = TREE_OPERAND (fn, 0);
2563 fn = get_first_fn (fn);
2564 if (!DECL_FUNCTION_MEMBER_P (fn))
2567 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2569 cl = DECL_CONTEXT (fn);
2570 cl = TYPE_BINFO (cl);
2571 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2574 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2575 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2576 if non-NULL, is the type or namespace used to explicitly qualify
2577 ID_EXPRESSION. DECL is the entity to which that name has been
2580 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2581 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2582 be set to true if this expression isn't permitted in a
2583 constant-expression, but it is otherwise not set by this function.
2584 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2585 constant-expression, but a non-constant expression is also
2588 DONE is true if this expression is a complete postfix-expression;
2589 it is false if this expression is followed by '->', '[', '(', etc.
2590 ADDRESS_P is true iff this expression is the operand of '&'.
2591 TEMPLATE_P is true iff the qualified-id was of the form
2592 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2593 appears as a template argument.
2595 If an error occurs, and it is the kind of error that might cause
2596 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2597 is the caller's responsibility to issue the message. *ERROR_MSG
2598 will be a string with static storage duration, so the caller need
2601 Return an expression for the entity, after issuing appropriate
2602 diagnostics. This function is also responsible for transforming a
2603 reference to a non-static member into a COMPONENT_REF that makes
2604 the use of "this" explicit.
2606 Upon return, *IDK will be filled in appropriately. */
2608 finish_id_expression (tree id_expression,
2612 bool integral_constant_expression_p,
2613 bool allow_non_integral_constant_expression_p,
2614 bool *non_integral_constant_expression_p,
2618 bool template_arg_p,
2619 const char **error_msg,
2620 location_t location)
2622 /* Initialize the output parameters. */
2623 *idk = CP_ID_KIND_NONE;
2626 if (id_expression == error_mark_node)
2627 return error_mark_node;
2628 /* If we have a template-id, then no further lookup is
2629 required. If the template-id was for a template-class, we
2630 will sometimes have a TYPE_DECL at this point. */
2631 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2632 || TREE_CODE (decl) == TYPE_DECL)
2634 /* Look up the name. */
2637 if (decl == error_mark_node)
2639 /* Name lookup failed. */
2642 || (!dependent_type_p (scope)
2643 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2644 && IDENTIFIER_TYPENAME_P (id_expression)
2645 && dependent_type_p (TREE_TYPE (id_expression))))))
2647 /* If the qualifying type is non-dependent (and the name
2648 does not name a conversion operator to a dependent
2649 type), issue an error. */
2650 qualified_name_lookup_error (scope, id_expression, decl, location);
2651 return error_mark_node;
2655 /* It may be resolved via Koenig lookup. */
2656 *idk = CP_ID_KIND_UNQUALIFIED;
2657 return id_expression;
2660 decl = id_expression;
2662 /* If DECL is a variable that would be out of scope under
2663 ANSI/ISO rules, but in scope in the ARM, name lookup
2664 will succeed. Issue a diagnostic here. */
2666 decl = check_for_out_of_scope_variable (decl);
2668 /* Remember that the name was used in the definition of
2669 the current class so that we can check later to see if
2670 the meaning would have been different after the class
2671 was entirely defined. */
2672 if (!scope && decl != error_mark_node)
2673 maybe_note_name_used_in_class (id_expression, decl);
2675 /* Disallow uses of local variables from containing functions. */
2676 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2678 tree context = decl_function_context (decl);
2679 if (context != NULL_TREE && context != current_function_decl
2680 && ! TREE_STATIC (decl))
2682 error (TREE_CODE (decl) == VAR_DECL
2683 ? "use of %<auto%> variable from containing function"
2684 : "use of parameter from containing function");
2685 error (" %q+#D declared here", decl);
2686 return error_mark_node;
2691 /* If we didn't find anything, or what we found was a type,
2692 then this wasn't really an id-expression. */
2693 if (TREE_CODE (decl) == TEMPLATE_DECL
2694 && !DECL_FUNCTION_TEMPLATE_P (decl))
2696 *error_msg = "missing template arguments";
2697 return error_mark_node;
2699 else if (TREE_CODE (decl) == TYPE_DECL
2700 || TREE_CODE (decl) == NAMESPACE_DECL)
2702 *error_msg = "expected primary-expression";
2703 return error_mark_node;
2706 /* If the name resolved to a template parameter, there is no
2707 need to look it up again later. */
2708 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2709 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2713 *idk = CP_ID_KIND_NONE;
2714 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2715 decl = TEMPLATE_PARM_DECL (decl);
2716 r = convert_from_reference (DECL_INITIAL (decl));
2718 if (integral_constant_expression_p
2719 && !dependent_type_p (TREE_TYPE (decl))
2720 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2722 if (!allow_non_integral_constant_expression_p)
2723 error ("template parameter %qD of type %qT is not allowed in "
2724 "an integral constant expression because it is not of "
2725 "integral or enumeration type", decl, TREE_TYPE (decl));
2726 *non_integral_constant_expression_p = true;
2730 /* Similarly, we resolve enumeration constants to their
2731 underlying values. */
2732 else if (TREE_CODE (decl) == CONST_DECL)
2734 *idk = CP_ID_KIND_NONE;
2735 if (!processing_template_decl)
2737 used_types_insert (TREE_TYPE (decl));
2738 return DECL_INITIAL (decl);
2746 /* If the declaration was explicitly qualified indicate
2747 that. The semantics of `A::f(3)' are different than
2748 `f(3)' if `f' is virtual. */
2750 ? CP_ID_KIND_QUALIFIED
2751 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2752 ? CP_ID_KIND_TEMPLATE_ID
2753 : CP_ID_KIND_UNQUALIFIED));
2758 An id-expression is type-dependent if it contains an
2759 identifier that was declared with a dependent type.
2761 The standard is not very specific about an id-expression that
2762 names a set of overloaded functions. What if some of them
2763 have dependent types and some of them do not? Presumably,
2764 such a name should be treated as a dependent name. */
2765 /* Assume the name is not dependent. */
2766 dependent_p = false;
2767 if (!processing_template_decl)
2768 /* No names are dependent outside a template. */
2770 /* A template-id where the name of the template was not resolved
2771 is definitely dependent. */
2772 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2773 && (TREE_CODE (TREE_OPERAND (decl, 0))
2774 == IDENTIFIER_NODE))
2776 /* For anything except an overloaded function, just check its
2778 else if (!is_overloaded_fn (decl))
2780 = dependent_type_p (TREE_TYPE (decl));
2781 /* For a set of overloaded functions, check each of the
2787 if (BASELINK_P (fns))
2788 fns = BASELINK_FUNCTIONS (fns);
2790 /* For a template-id, check to see if the template
2791 arguments are dependent. */
2792 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2794 tree args = TREE_OPERAND (fns, 1);
2795 dependent_p = any_dependent_template_arguments_p (args);
2796 /* The functions are those referred to by the
2798 fns = TREE_OPERAND (fns, 0);
2801 /* If there are no dependent template arguments, go through
2802 the overloaded functions. */
2803 while (fns && !dependent_p)
2805 tree fn = OVL_CURRENT (fns);
2807 /* Member functions of dependent classes are
2809 if (TREE_CODE (fn) == FUNCTION_DECL
2810 && type_dependent_expression_p (fn))
2812 else if (TREE_CODE (fn) == TEMPLATE_DECL
2813 && dependent_template_p (fn))
2816 fns = OVL_NEXT (fns);
2820 /* If the name was dependent on a template parameter, we will
2821 resolve the name at instantiation time. */
2824 /* Create a SCOPE_REF for qualified names, if the scope is
2828 /* Since this name was dependent, the expression isn't
2829 constant -- yet. No error is issued because it might
2830 be constant when things are instantiated. */
2831 if (integral_constant_expression_p)
2832 *non_integral_constant_expression_p = true;
2835 if (address_p && done)
2836 decl = finish_qualified_id_expr (scope, decl,
2840 else if (dependent_type_p (scope))
2841 decl = build_qualified_name (/*type=*/NULL_TREE,
2845 else if (DECL_P (decl))
2846 decl = build_qualified_name (TREE_TYPE (decl),
2851 if (TREE_TYPE (decl))
2852 decl = convert_from_reference (decl);
2855 /* A TEMPLATE_ID already contains all the information we
2857 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2858 return id_expression;
2859 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2860 /* If we found a variable, then name lookup during the
2861 instantiation will always resolve to the same VAR_DECL
2862 (or an instantiation thereof). */
2863 if (TREE_CODE (decl) == VAR_DECL
2864 || TREE_CODE (decl) == PARM_DECL)
2865 return convert_from_reference (decl);
2866 /* The same is true for FIELD_DECL, but we also need to
2867 make sure that the syntax is correct. */
2868 else if (TREE_CODE (decl) == FIELD_DECL)
2870 /* Since SCOPE is NULL here, this is an unqualified name.
2871 Access checking has been performed during name lookup
2872 already. Turn off checking to avoid duplicate errors. */
2873 push_deferring_access_checks (dk_no_check);
2874 decl = finish_non_static_data_member
2875 (decl, current_class_ref,
2876 /*qualifying_scope=*/NULL_TREE);
2877 pop_deferring_access_checks ();
2880 return id_expression;
2883 /* Only certain kinds of names are allowed in constant
2884 expression. Enumerators and template parameters have already
2885 been handled above. */
2886 if (integral_constant_expression_p
2887 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2888 && ! builtin_valid_in_constant_expr_p (decl))
2890 if (!allow_non_integral_constant_expression_p)
2892 error ("%qD cannot appear in a constant-expression", decl);
2893 return error_mark_node;
2895 *non_integral_constant_expression_p = true;
2898 if (TREE_CODE (decl) == NAMESPACE_DECL)
2900 error ("use of namespace %qD as expression", decl);
2901 return error_mark_node;
2903 else if (DECL_CLASS_TEMPLATE_P (decl))
2905 error ("use of class template %qT as expression", decl);
2906 return error_mark_node;
2908 else if (TREE_CODE (decl) == TREE_LIST)
2910 /* Ambiguous reference to base members. */
2911 error ("request for member %qD is ambiguous in "
2912 "multiple inheritance lattice", id_expression);
2913 print_candidates (decl);
2914 return error_mark_node;
2917 /* Mark variable-like entities as used. Functions are similarly
2918 marked either below or after overload resolution. */
2919 if (TREE_CODE (decl) == VAR_DECL
2920 || TREE_CODE (decl) == PARM_DECL
2921 || TREE_CODE (decl) == RESULT_DECL)
2926 decl = (adjust_result_of_qualified_name_lookup
2927 (decl, scope, current_class_type));
2929 if (TREE_CODE (decl) == FUNCTION_DECL)
2932 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2933 decl = finish_qualified_id_expr (scope,
2941 tree r = convert_from_reference (decl);
2943 if (processing_template_decl && TYPE_P (scope))
2944 r = build_qualified_name (TREE_TYPE (r),
2950 else if (TREE_CODE (decl) == FIELD_DECL)
2952 /* Since SCOPE is NULL here, this is an unqualified name.
2953 Access checking has been performed during name lookup
2954 already. Turn off checking to avoid duplicate errors. */
2955 push_deferring_access_checks (dk_no_check);
2956 decl = finish_non_static_data_member (decl, current_class_ref,
2957 /*qualifying_scope=*/NULL_TREE);
2958 pop_deferring_access_checks ();
2960 else if (is_overloaded_fn (decl))
2965 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2966 first_fn = TREE_OPERAND (first_fn, 0);
2967 first_fn = get_first_fn (first_fn);
2968 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2969 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2971 if (!really_overloaded_fn (decl))
2972 mark_used (first_fn);
2975 && TREE_CODE (first_fn) == FUNCTION_DECL
2976 && DECL_FUNCTION_MEMBER_P (first_fn)
2977 && !shared_member_p (decl))
2979 /* A set of member functions. */
2980 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2981 return finish_class_member_access_expr (decl, id_expression,
2982 /*template_p=*/false,
2983 tf_warning_or_error);
2986 decl = baselink_for_fns (decl);
2990 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2991 && DECL_CLASS_SCOPE_P (decl))
2993 tree context = context_for_name_lookup (decl);
2994 if (context != current_class_type)
2996 tree path = currently_open_derived_class (context);
2997 perform_or_defer_access_check (TYPE_BINFO (path),
3002 decl = convert_from_reference (decl);
3006 if (TREE_DEPRECATED (decl))
3007 warn_deprecated_use (decl);
3012 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3013 use as a type-specifier. */
3016 finish_typeof (tree expr)
3020 if (type_dependent_expression_p (expr))
3022 type = cxx_make_type (TYPEOF_TYPE);
3023 TYPEOF_TYPE_EXPR (type) = expr;
3024 SET_TYPE_STRUCTURAL_EQUALITY (type);
3029 type = unlowered_expr_type (expr);
3031 if (!type || type == unknown_type_node)
3033 error ("type of %qE is unknown", expr);
3034 return error_mark_node;
3040 /* Perform C++-specific checks for __builtin_offsetof before calling
3044 finish_offsetof (tree expr)
3046 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3048 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3049 TREE_OPERAND (expr, 2));
3050 return error_mark_node;
3052 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3053 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3054 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3056 if (TREE_CODE (expr) == COMPONENT_REF
3057 || TREE_CODE (expr) == COMPOUND_EXPR)
3058 expr = TREE_OPERAND (expr, 1);
3059 error ("cannot apply %<offsetof%> to member function %qD", expr);
3060 return error_mark_node;
3062 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3063 expr = TREE_OPERAND (expr, 0);
3064 return fold_offsetof (expr, NULL_TREE);
3067 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
3068 with equivalent CALL_EXPRs. */
3071 simplify_aggr_init_exprs_r (tree* tp,
3073 void* data ATTRIBUTE_UNUSED)
3075 /* We don't need to walk into types; there's nothing in a type that
3076 needs simplification. (And, furthermore, there are places we
3077 actively don't want to go. For example, we don't want to wander
3078 into the default arguments for a FUNCTION_DECL that appears in a
3085 /* Only AGGR_INIT_EXPRs are interesting. */
3086 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
3089 simplify_aggr_init_expr (tp);
3091 /* Keep iterating. */
3095 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3096 function is broken out from the above for the benefit of the tree-ssa
3100 simplify_aggr_init_expr (tree *tp)
3102 tree aggr_init_expr = *tp;
3104 /* Form an appropriate CALL_EXPR. */
3105 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3106 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3107 tree type = TREE_TYPE (slot);
3110 enum style_t { ctor, arg, pcc } style;
3112 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3114 #ifdef PCC_STATIC_STRUCT_RETURN
3120 gcc_assert (TREE_ADDRESSABLE (type));
3124 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3126 aggr_init_expr_nargs (aggr_init_expr),
3127 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3131 /* Replace the first argument to the ctor with the address of the
3133 cxx_mark_addressable (slot);
3134 CALL_EXPR_ARG (call_expr, 0) =
3135 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3137 else if (style == arg)
3139 /* Just mark it addressable here, and leave the rest to
3140 expand_call{,_inline}. */
3141 cxx_mark_addressable (slot);
3142 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3143 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3145 else if (style == pcc)
3147 /* If we're using the non-reentrant PCC calling convention, then we
3148 need to copy the returned value out of the static buffer into the
3150 push_deferring_access_checks (dk_no_check);
3151 call_expr = build_aggr_init (slot, call_expr,
3152 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3153 tf_warning_or_error);
3154 pop_deferring_access_checks ();
3155 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3161 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3164 emit_associated_thunks (tree fn)
3166 /* When we use vcall offsets, we emit thunks with the virtual
3167 functions to which they thunk. The whole point of vcall offsets
3168 is so that you can know statically the entire set of thunks that
3169 will ever be needed for a given virtual function, thereby
3170 enabling you to output all the thunks with the function itself. */
3171 if (DECL_VIRTUAL_P (fn))
3175 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3177 if (!THUNK_ALIAS (thunk))
3179 use_thunk (thunk, /*emit_p=*/1);
3180 if (DECL_RESULT_THUNK_P (thunk))
3184 for (probe = DECL_THUNKS (thunk);
3185 probe; probe = TREE_CHAIN (probe))
3186 use_thunk (probe, /*emit_p=*/1);
3190 gcc_assert (!DECL_THUNKS (thunk));
3195 /* Generate RTL for FN. */
3198 expand_or_defer_fn (tree fn)
3200 /* When the parser calls us after finishing the body of a template
3201 function, we don't really want to expand the body. */
3202 if (processing_template_decl)
3204 /* Normally, collection only occurs in rest_of_compilation. So,
3205 if we don't collect here, we never collect junk generated
3206 during the processing of templates until we hit a
3207 non-template function. It's not safe to do this inside a
3208 nested class, though, as the parser may have local state that
3209 is not a GC root. */
3210 if (!function_depth)
3215 gcc_assert (gimple_body (fn));
3217 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3218 cp_walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3219 simplify_aggr_init_exprs_r,
3222 /* If this is a constructor or destructor body, we have to clone
3224 if (maybe_clone_body (fn))
3226 /* We don't want to process FN again, so pretend we've written
3227 it out, even though we haven't. */
3228 TREE_ASM_WRITTEN (fn) = 1;
3232 /* We make a decision about linkage for these functions at the end
3233 of the compilation. Until that point, we do not want the back
3234 end to output them -- but we do want it to see the bodies of
3235 these functions so that it can inline them as appropriate. */
3236 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3238 if (DECL_INTERFACE_KNOWN (fn))
3239 /* We've already made a decision as to how this function will
3243 DECL_EXTERNAL (fn) = 1;
3244 DECL_NOT_REALLY_EXTERN (fn) = 1;
3245 note_vague_linkage_fn (fn);
3246 /* A non-template inline function with external linkage will
3247 always be COMDAT. As we must eventually determine the
3248 linkage of all functions, and as that causes writes to
3249 the data mapped in from the PCH file, it's advantageous
3250 to mark the functions at this point. */
3251 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3253 /* This function must have external linkage, as
3254 otherwise DECL_INTERFACE_KNOWN would have been
3256 gcc_assert (TREE_PUBLIC (fn));
3257 comdat_linkage (fn);
3258 DECL_INTERFACE_KNOWN (fn) = 1;
3262 import_export_decl (fn);
3264 /* If the user wants us to keep all inline functions, then mark
3265 this function as needed so that finish_file will make sure to
3267 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3271 /* There's no reason to do any of the work here if we're only doing
3272 semantic analysis; this code just generates RTL. */
3273 if (flag_syntax_only)
3278 /* Expand or defer, at the whim of the compilation unit manager. */
3279 cgraph_finalize_function (fn, function_depth > 1);
3291 /* Helper function for walk_tree, used by finalize_nrv below. */
3294 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3296 struct nrv_data *dp = (struct nrv_data *)data;
3299 /* No need to walk into types. There wouldn't be any need to walk into
3300 non-statements, except that we have to consider STMT_EXPRs. */
3303 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3304 but differs from using NULL_TREE in that it indicates that we care
3305 about the value of the RESULT_DECL. */
3306 else if (TREE_CODE (*tp) == RETURN_EXPR)
3307 TREE_OPERAND (*tp, 0) = dp->result;
3308 /* Change all cleanups for the NRV to only run when an exception is
3310 else if (TREE_CODE (*tp) == CLEANUP_STMT
3311 && CLEANUP_DECL (*tp) == dp->var)
3312 CLEANUP_EH_ONLY (*tp) = 1;
3313 /* Replace the DECL_EXPR for the NRV with an initialization of the
3314 RESULT_DECL, if needed. */
3315 else if (TREE_CODE (*tp) == DECL_EXPR
3316 && DECL_EXPR_DECL (*tp) == dp->var)
3319 if (DECL_INITIAL (dp->var)
3320 && DECL_INITIAL (dp->var) != error_mark_node)
3322 init = build2 (INIT_EXPR, void_type_node, dp->result,
3323 DECL_INITIAL (dp->var));
3324 DECL_INITIAL (dp->var) = error_mark_node;
3327 init = build_empty_stmt ();
3328 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3331 /* And replace all uses of the NRV with the RESULT_DECL. */
3332 else if (*tp == dp->var)
3335 /* Avoid walking into the same tree more than once. Unfortunately, we
3336 can't just use walk_tree_without duplicates because it would only call
3337 us for the first occurrence of dp->var in the function body. */
3338 slot = htab_find_slot (dp->visited, *tp, INSERT);
3344 /* Keep iterating. */
3348 /* Called from finish_function to implement the named return value
3349 optimization by overriding all the RETURN_EXPRs and pertinent
3350 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3351 RESULT_DECL for the function. */
3354 finalize_nrv (tree *tp, tree var, tree result)
3356 struct nrv_data data;
3358 /* Copy debugging information from VAR to RESULT. */
3359 DECL_NAME (result) = DECL_NAME (var);
3360 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3361 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3362 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3363 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3364 /* Don't forget that we take its address. */
3365 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3368 data.result = result;
3369 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3370 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3371 htab_delete (data.visited);
3374 /* Return the declaration for the function called by CALL_EXPR T,
3375 TYPE is the class type of the clause decl. */
3378 omp_clause_info_fndecl (tree t, tree type)
3380 tree ret = get_callee_fndecl (t);
3385 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3386 t = CALL_EXPR_FN (t);
3388 if (TREE_CODE (t) == OBJ_TYPE_REF)
3390 t = cp_fold_obj_type_ref (t, type);
3391 if (TREE_CODE (t) == ADDR_EXPR
3392 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3393 return TREE_OPERAND (t, 0);
3399 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3402 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3403 bool need_copy_ctor, bool need_copy_assignment)
3405 int save_errorcount = errorcount;
3408 /* Always allocate 3 elements for simplicity. These are the
3409 function decls for the ctor, dtor, and assignment op.
3410 This layout is known to the three lang hooks,
3411 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3412 and cxx_omp_clause_assign_op. */
3413 info = make_tree_vec (3);
3414 CP_OMP_CLAUSE_INFO (c) = info;
3416 if (need_default_ctor
3417 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3419 if (need_default_ctor)
3423 t = build_int_cst (build_pointer_type (type), 0);
3424 t = build1 (INDIRECT_REF, type, t);
3425 t = build_tree_list (NULL, t);
3427 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3428 t, type, LOOKUP_NORMAL,
3429 tf_warning_or_error);
3431 if (targetm.cxx.cdtor_returns_this () || errorcount)
3432 /* Because constructors and destructors return this,
3433 the call will have been cast to "void". Remove the
3434 cast here. We would like to use STRIP_NOPS, but it
3435 wouldn't work here because TYPE_MODE (t) and
3436 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3437 They are VOIDmode and Pmode, respectively. */
3438 if (TREE_CODE (t) == NOP_EXPR)
3439 t = TREE_OPERAND (t, 0);
3441 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3444 if ((need_default_ctor || need_copy_ctor)
3445 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3447 t = build_int_cst (build_pointer_type (type), 0);
3448 t = build1 (INDIRECT_REF, type, t);
3449 t = build_special_member_call (t, complete_dtor_identifier,
3450 NULL, type, LOOKUP_NORMAL,
3451 tf_warning_or_error);
3453 if (targetm.cxx.cdtor_returns_this () || errorcount)
3454 /* Because constructors and destructors return this,
3455 the call will have been cast to "void". Remove the
3456 cast here. We would like to use STRIP_NOPS, but it
3457 wouldn't work here because TYPE_MODE (t) and
3458 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3459 They are VOIDmode and Pmode, respectively. */
3460 if (TREE_CODE (t) == NOP_EXPR)
3461 t = TREE_OPERAND (t, 0);
3463 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3466 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3468 t = build_int_cst (build_pointer_type (type), 0);
3469 t = build1 (INDIRECT_REF, type, t);
3470 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3471 build_tree_list (NULL, t),
3472 type, LOOKUP_NORMAL,
3473 tf_warning_or_error);
3475 /* We'll have called convert_from_reference on the call, which
3476 may well have added an indirect_ref. It's unneeded here,
3477 and in the way, so kill it. */
3478 if (TREE_CODE (t) == INDIRECT_REF)
3479 t = TREE_OPERAND (t, 0);
3481 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3484 return errorcount != save_errorcount;
3487 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3488 Remove any elements from the list that are invalid. */
3491 finish_omp_clauses (tree clauses)
3493 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3494 tree c, t, *pc = &clauses;
3497 bitmap_obstack_initialize (NULL);
3498 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3499 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3500 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3502 for (pc = &clauses, c = clauses; c ; c = *pc)
3504 bool remove = false;
3506 switch (OMP_CLAUSE_CODE (c))
3508 case OMP_CLAUSE_SHARED:
3510 goto check_dup_generic;
3511 case OMP_CLAUSE_PRIVATE:
3513 goto check_dup_generic;
3514 case OMP_CLAUSE_REDUCTION:
3516 goto check_dup_generic;
3517 case OMP_CLAUSE_COPYPRIVATE:
3518 name = "copyprivate";
3519 goto check_dup_generic;
3520 case OMP_CLAUSE_COPYIN:
3522 goto check_dup_generic;
3524 t = OMP_CLAUSE_DECL (c);
3525 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3527 if (processing_template_decl)
3530 error ("%qD is not a variable in clause %qs", t, name);
3532 error ("%qE is not a variable in clause %qs", t, name);
3535 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3536 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3537 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3539 error ("%qD appears more than once in data clauses", t);
3543 bitmap_set_bit (&generic_head, DECL_UID (t));
3546 case OMP_CLAUSE_FIRSTPRIVATE:
3547 t = OMP_CLAUSE_DECL (c);
3548 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3550 if (processing_template_decl)
3553 error ("%qD is not a variable in clause %<firstprivate%>", t);
3555 error ("%qE is not a variable in clause %<firstprivate%>", t);
3558 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3559 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3561 error ("%qD appears more than once in data clauses", t);
3565 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3568 case OMP_CLAUSE_LASTPRIVATE:
3569 t = OMP_CLAUSE_DECL (c);
3570 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3572 if (processing_template_decl)
3575 error ("%qD is not a variable in clause %<lastprivate%>", t);
3577 error ("%qE is not a variable in clause %<lastprivate%>", t);
3580 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3581 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3583 error ("%qD appears more than once in data clauses", t);
3587 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3591 t = OMP_CLAUSE_IF_EXPR (c);
3592 t = maybe_convert_cond (t);
3593 if (t == error_mark_node)
3595 OMP_CLAUSE_IF_EXPR (c) = t;
3598 case OMP_CLAUSE_NUM_THREADS:
3599 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3600 if (t == error_mark_node)
3602 else if (!type_dependent_expression_p (t)
3603 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3605 error ("num_threads expression must be integral");
3610 case OMP_CLAUSE_SCHEDULE:
3611 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3614 else if (t == error_mark_node)
3616 else if (!type_dependent_expression_p (t)
3617 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3619 error ("schedule chunk size expression must be integral");
3624 case OMP_CLAUSE_NOWAIT:
3625 case OMP_CLAUSE_ORDERED:
3626 case OMP_CLAUSE_DEFAULT:
3627 case OMP_CLAUSE_UNTIED:
3628 case OMP_CLAUSE_COLLAPSE:
3636 *pc = OMP_CLAUSE_CHAIN (c);
3638 pc = &OMP_CLAUSE_CHAIN (c);
3641 for (pc = &clauses, c = clauses; c ; c = *pc)
3643 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3644 bool remove = false;
3645 bool need_complete_non_reference = false;
3646 bool need_default_ctor = false;
3647 bool need_copy_ctor = false;
3648 bool need_copy_assignment = false;
3649 bool need_implicitly_determined = false;
3650 tree type, inner_type;
3654 case OMP_CLAUSE_SHARED:
3656 need_implicitly_determined = true;
3658 case OMP_CLAUSE_PRIVATE:
3660 need_complete_non_reference = true;
3661 need_default_ctor = true;
3662 need_implicitly_determined = true;
3664 case OMP_CLAUSE_FIRSTPRIVATE:
3665 name = "firstprivate";
3666 need_complete_non_reference = true;
3667 need_copy_ctor = true;
3668 need_implicitly_determined = true;
3670 case OMP_CLAUSE_LASTPRIVATE:
3671 name = "lastprivate";
3672 need_complete_non_reference = true;
3673 need_copy_assignment = true;
3674 need_implicitly_determined = true;
3676 case OMP_CLAUSE_REDUCTION:
3678 need_implicitly_determined = true;
3680 case OMP_CLAUSE_COPYPRIVATE:
3681 name = "copyprivate";
3682 need_copy_assignment = true;
3684 case OMP_CLAUSE_COPYIN:
3686 need_copy_assignment = true;
3689 pc = &OMP_CLAUSE_CHAIN (c);
3693 t = OMP_CLAUSE_DECL (c);
3694 if (processing_template_decl
3695 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3697 pc = &OMP_CLAUSE_CHAIN (c);
3703 case OMP_CLAUSE_LASTPRIVATE:
3704 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3705 need_default_ctor = true;
3708 case OMP_CLAUSE_REDUCTION:
3709 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3710 || POINTER_TYPE_P (TREE_TYPE (t)))
3712 error ("%qE has invalid type for %<reduction%>", t);
3715 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3717 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3725 error ("%qE has invalid type for %<reduction(%s)%>",
3726 t, operator_name_info[r_code].name);
3732 case OMP_CLAUSE_COPYIN:
3733 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3735 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3744 if (need_complete_non_reference)
3746 t = require_complete_type (t);
3747 if (t == error_mark_node)
3749 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3751 error ("%qE has reference type for %qs", t, name);
3755 if (need_implicitly_determined)
3757 const char *share_name = NULL;
3759 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3760 share_name = "threadprivate";
3761 else switch (cxx_omp_predetermined_sharing (t))
3763 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3765 case OMP_CLAUSE_DEFAULT_SHARED:
3766 share_name = "shared";
3768 case OMP_CLAUSE_DEFAULT_PRIVATE:
3769 share_name = "private";
3776 error ("%qE is predetermined %qs for %qs",
3777 t, share_name, name);
3782 /* We're interested in the base element, not arrays. */
3783 inner_type = type = TREE_TYPE (t);
3784 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3785 inner_type = TREE_TYPE (inner_type);
3787 /* Check for special function availability by building a call to one.
3788 Save the results, because later we won't be in the right context
3789 for making these queries. */
3790 if (CLASS_TYPE_P (inner_type)
3791 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3792 && !type_dependent_expression_p (t)
3793 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3794 need_copy_ctor, need_copy_assignment))
3798 *pc = OMP_CLAUSE_CHAIN (c);
3800 pc = &OMP_CLAUSE_CHAIN (c);
3803 bitmap_obstack_release (NULL);
3807 /* For all variables in the tree_list VARS, mark them as thread local. */
3810 finish_omp_threadprivate (tree vars)
3814 /* Mark every variable in VARS to be assigned thread local storage. */
3815 for (t = vars; t; t = TREE_CHAIN (t))
3817 tree v = TREE_PURPOSE (t);
3819 if (error_operand_p (v))
3821 else if (TREE_CODE (v) != VAR_DECL)
3822 error ("%<threadprivate%> %qD is not file, namespace "
3823 "or block scope variable", v);
3824 /* If V had already been marked threadprivate, it doesn't matter
3825 whether it had been used prior to this point. */
3826 else if (TREE_USED (v)
3827 && (DECL_LANG_SPECIFIC (v) == NULL
3828 || !CP_DECL_THREADPRIVATE_P (v)))
3829 error ("%qE declared %<threadprivate%> after first use", v);
3830 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3831 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3832 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3833 error ("%<threadprivate%> %qE has incomplete type", v);
3834 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3835 && CP_DECL_CONTEXT (v) != current_class_type)
3836 error ("%<threadprivate%> %qE directive not "
3837 "in %qT definition", v, CP_DECL_CONTEXT (v));
3840 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3841 if (DECL_LANG_SPECIFIC (v) == NULL)
3843 retrofit_lang_decl (v);
3845 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3846 after the allocation of the lang_decl structure. */
3847 if (DECL_DISCRIMINATOR_P (v))
3848 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3851 if (! DECL_THREAD_LOCAL_P (v))
3853 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3854 /* If rtl has been already set for this var, call
3855 make_decl_rtl once again, so that encode_section_info
3856 has a chance to look at the new decl flags. */
3857 if (DECL_RTL_SET_P (v))
3860 CP_DECL_THREADPRIVATE_P (v) = 1;
3865 /* Build an OpenMP structured block. */
3868 begin_omp_structured_block (void)
3870 return do_pushlevel (sk_omp);
3874 finish_omp_structured_block (tree block)
3876 return do_poplevel (block);
3879 /* Similarly, except force the retention of the BLOCK. */
3882 begin_omp_parallel (void)
3884 keep_next_level (true);
3885 return begin_omp_structured_block ();
3889 finish_omp_parallel (tree clauses, tree body)
3893 body = finish_omp_structured_block (body);
3895 stmt = make_node (OMP_PARALLEL);
3896 TREE_TYPE (stmt) = void_type_node;
3897 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3898 OMP_PARALLEL_BODY (stmt) = body;
3900 return add_stmt (stmt);
3904 begin_omp_task (void)
3906 keep_next_level (true);
3907 return begin_omp_structured_block ();
3911 finish_omp_task (tree clauses, tree body)
3915 body = finish_omp_structured_block (body);
3917 stmt = make_node (OMP_TASK);
3918 TREE_TYPE (stmt) = void_type_node;
3919 OMP_TASK_CLAUSES (stmt) = clauses;
3920 OMP_TASK_BODY (stmt) = body;
3922 return add_stmt (stmt);
3925 /* Helper function for finish_omp_for. Convert Ith random access iterator
3926 into integral iterator. Return FALSE if successful. */
3929 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
3930 tree condv, tree incrv, tree *body,
3931 tree *pre_body, tree clauses)
3933 tree diff, iter_init, iter_incr = NULL, last;
3934 tree incr_var = NULL, orig_pre_body, orig_body, c;
3935 tree decl = TREE_VEC_ELT (declv, i);
3936 tree init = TREE_VEC_ELT (initv, i);
3937 tree cond = TREE_VEC_ELT (condv, i);
3938 tree incr = TREE_VEC_ELT (incrv, i);
3940 location_t elocus = locus;
3942 if (init && EXPR_HAS_LOCATION (init))
3943 elocus = EXPR_LOCATION (init);
3945 switch (TREE_CODE (cond))
3951 if (TREE_OPERAND (cond, 0) != iter)
3952 cond = error_mark_node;
3955 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
3956 TREE_OPERAND (cond, 1), ERROR_MARK,
3957 NULL, tf_warning_or_error);
3958 if (error_operand_p (tem))
3963 cond = error_mark_node;
3966 if (cond == error_mark_node)
3968 error ("%Hinvalid controlling predicate", &elocus);
3971 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
3972 ERROR_MARK, iter, ERROR_MARK, NULL,
3973 tf_warning_or_error);
3974 if (error_operand_p (diff))
3976 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
3978 error ("%Hdifference between %qE and %qD does not have integer type",
3979 &elocus, TREE_OPERAND (cond, 1), iter);
3983 switch (TREE_CODE (incr))
3985 case PREINCREMENT_EXPR:
3986 case PREDECREMENT_EXPR:
3987 case POSTINCREMENT_EXPR:
3988 case POSTDECREMENT_EXPR:
3989 if (TREE_OPERAND (incr, 0) != iter)
3991 incr = error_mark_node;
3994 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
3995 tf_warning_or_error);
3996 if (error_operand_p (iter_incr))
3998 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
3999 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4000 incr = integer_one_node;
4002 incr = integer_minus_one_node;
4005 if (TREE_OPERAND (incr, 0) != iter)
4006 incr = error_mark_node;
4007 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4008 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4010 tree rhs = TREE_OPERAND (incr, 1);
4011 if (TREE_OPERAND (rhs, 0) == iter)
4013 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4015 incr = error_mark_node;
4018 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4019 TREE_OPERAND (rhs, 1),
4020 tf_warning_or_error);
4021 if (error_operand_p (iter_incr))
4023 incr = TREE_OPERAND (rhs, 1);
4024 incr = cp_convert (TREE_TYPE (diff), incr);
4025 if (TREE_CODE (rhs) == MINUS_EXPR)
4027 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4028 incr = fold_if_not_in_template (incr);
4030 if (TREE_CODE (incr) != INTEGER_CST
4031 && (TREE_CODE (incr) != NOP_EXPR
4032 || (TREE_CODE (TREE_OPERAND (incr, 0))
4037 else if (TREE_OPERAND (rhs, 1) == iter)
4039 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4040 || TREE_CODE (rhs) != PLUS_EXPR)
4041 incr = error_mark_node;
4044 iter_incr = build_x_binary_op (PLUS_EXPR,
4045 TREE_OPERAND (rhs, 0),
4048 tf_warning_or_error);
4049 if (error_operand_p (iter_incr))
4051 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4053 tf_warning_or_error);
4054 if (error_operand_p (iter_incr))
4056 incr = TREE_OPERAND (rhs, 0);
4061 incr = error_mark_node;
4064 incr = error_mark_node;
4067 incr = error_mark_node;
4071 if (incr == error_mark_node)
4073 error ("%Hinvalid increment expression", &elocus);
4077 incr = cp_convert (TREE_TYPE (diff), incr);
4078 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4079 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4080 && OMP_CLAUSE_DECL (c) == iter)
4083 decl = create_temporary_var (TREE_TYPE (diff));
4085 add_decl_expr (decl);
4086 last = create_temporary_var (TREE_TYPE (diff));
4088 add_decl_expr (last);
4089 if (c && iter_incr == NULL)
4091 incr_var = create_temporary_var (TREE_TYPE (diff));
4092 pushdecl (incr_var);
4093 add_decl_expr (incr_var);
4095 gcc_assert (stmts_are_full_exprs_p ());
4097 orig_pre_body = *pre_body;
4098 *pre_body = push_stmt_list ();
4100 add_stmt (orig_pre_body);
4102 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4103 tf_warning_or_error));
4104 init = build_int_cst (TREE_TYPE (diff), 0);
4105 if (c && iter_incr == NULL)
4107 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4108 incr, tf_warning_or_error));
4110 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4111 tf_warning_or_error);
4113 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4114 tf_warning_or_error));
4115 *pre_body = pop_stmt_list (*pre_body);
4117 cond = cp_build_binary_op (TREE_CODE (cond), decl, diff,
4118 tf_warning_or_error);
4119 incr = build_modify_expr (decl, PLUS_EXPR, incr);
4122 *body = push_stmt_list ();
4123 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4124 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4125 tf_warning_or_error);
4126 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4127 finish_expr_stmt (iter_init);
4128 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4129 tf_warning_or_error));
4130 add_stmt (orig_body);
4131 *body = pop_stmt_list (*body);
4135 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4136 finish_expr_stmt (iter_incr);
4137 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4138 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4141 TREE_VEC_ELT (declv, i) = decl;
4142 TREE_VEC_ELT (initv, i) = init;
4143 TREE_VEC_ELT (condv, i) = cond;
4144 TREE_VEC_ELT (incrv, i) = incr;
4149 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4150 are directly for their associated operands in the statement. DECL
4151 and INIT are a combo; if DECL is NULL then INIT ought to be a
4152 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4153 optional statements that need to go before the loop into its
4157 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4158 tree incrv, tree body, tree pre_body, tree clauses)
4160 tree omp_for = NULL, orig_incr = NULL;
4161 tree decl, init, cond, incr;
4165 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4166 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4167 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4168 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4170 decl = TREE_VEC_ELT (declv, i);
4171 init = TREE_VEC_ELT (initv, i);
4172 cond = TREE_VEC_ELT (condv, i);
4173 incr = TREE_VEC_ELT (incrv, i);
4179 switch (TREE_CODE (init))
4182 decl = TREE_OPERAND (init, 0);
4183 init = TREE_OPERAND (init, 1);
4186 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4188 decl = TREE_OPERAND (init, 0);
4189 init = TREE_OPERAND (init, 2);
4198 error ("%Hexpected iteration declaration or initialization",
4204 if (init && EXPR_HAS_LOCATION (init))
4205 elocus = EXPR_LOCATION (init);
4209 error ("%Hmissing controlling predicate", &elocus);
4215 error ("%Hmissing increment expression", &elocus);
4219 TREE_VEC_ELT (declv, i) = decl;
4220 TREE_VEC_ELT (initv, i) = init;
4223 if (dependent_omp_for_p (declv, initv, condv, incrv))
4227 stmt = make_node (OMP_FOR);
4229 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4231 /* This is really just a place-holder. We'll be decomposing this
4232 again and going through the cp_build_modify_expr path below when
4233 we instantiate the thing. */
4234 TREE_VEC_ELT (initv, i)
4235 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4236 TREE_VEC_ELT (initv, i));
4239 TREE_TYPE (stmt) = void_type_node;
4240 OMP_FOR_INIT (stmt) = initv;
4241 OMP_FOR_COND (stmt) = condv;
4242 OMP_FOR_INCR (stmt) = incrv;
4243 OMP_FOR_BODY (stmt) = body;
4244 OMP_FOR_PRE_BODY (stmt) = pre_body;
4245 OMP_FOR_CLAUSES (stmt) = clauses;
4247 SET_EXPR_LOCATION (stmt, locus);
4248 return add_stmt (stmt);
4251 if (processing_template_decl)
4252 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4254 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4256 decl = TREE_VEC_ELT (declv, i);
4257 init = TREE_VEC_ELT (initv, i);
4258 cond = TREE_VEC_ELT (condv, i);
4259 incr = TREE_VEC_ELT (incrv, i);
4261 TREE_VEC_ELT (orig_incr, i) = incr;
4264 if (init && EXPR_HAS_LOCATION (init))
4265 elocus = EXPR_LOCATION (init);
4269 error ("%Hexpected iteration declaration or initialization",
4274 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4277 TREE_VEC_ELT (orig_incr, i) = incr;
4278 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4279 TREE_CODE (TREE_OPERAND (incr, 1)),
4280 TREE_OPERAND (incr, 2),
4281 tf_warning_or_error);
4284 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4286 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4287 incrv, &body, &pre_body, clauses))
4292 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4293 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4295 error ("%Hinvalid type for iteration variable %qE", &elocus, decl);
4299 if (!processing_template_decl)
4300 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4301 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4302 if (cond && TREE_SIDE_EFFECTS (cond) && COMPARISON_CLASS_P (cond))
4304 int n = TREE_SIDE_EFFECTS (TREE_OPERAND (cond, 1)) != 0;
4305 tree t = TREE_OPERAND (cond, n);
4307 if (!processing_template_decl)
4308 TREE_OPERAND (cond, n)
4309 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4311 if (decl == error_mark_node || init == error_mark_node)
4314 TREE_VEC_ELT (declv, i) = decl;
4315 TREE_VEC_ELT (initv, i) = init;
4316 TREE_VEC_ELT (condv, i) = cond;
4317 TREE_VEC_ELT (incrv, i) = incr;
4321 if (IS_EMPTY_STMT (pre_body))
4324 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4327 if (omp_for == NULL)
4330 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4332 tree incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4334 if (TREE_CODE (incr) != MODIFY_EXPR)
4337 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4338 && BINARY_CLASS_P (TREE_OPERAND (incr, 1)))
4340 tree t = TREE_OPERAND (incr, 1);
4341 int n = TREE_SIDE_EFFECTS (TREE_OPERAND (t, 1)) != 0;
4343 if (!processing_template_decl)
4345 = fold_build_cleanup_point_expr (TREE_TYPE (TREE_OPERAND (t, n)),
4346 TREE_OPERAND (t, n));
4350 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4352 if (omp_for != NULL)
4353 OMP_FOR_CLAUSES (omp_for) = clauses;
4358 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4367 dependent_p = false;
4370 /* Even in a template, we can detect invalid uses of the atomic
4371 pragma if neither LHS nor RHS is type-dependent. */
4372 if (processing_template_decl)
4374 dependent_p = (type_dependent_expression_p (lhs)
4375 || type_dependent_expression_p (rhs));
4378 lhs = build_non_dependent_expr (lhs);
4379 rhs = build_non_dependent_expr (rhs);
4384 stmt = c_finish_omp_atomic (code, lhs, rhs);
4385 if (stmt == error_mark_node)
4388 if (processing_template_decl)
4389 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4390 build2 (code, void_type_node, orig_lhs, orig_rhs));
4395 finish_omp_barrier (void)
4397 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4398 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4399 finish_expr_stmt (stmt);
4403 finish_omp_flush (void)
4405 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4406 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4407 finish_expr_stmt (stmt);
4411 finish_omp_taskwait (void)
4413 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4414 tree stmt = finish_call_expr (fn, NULL, false, false, tf_warning_or_error);
4415 finish_expr_stmt (stmt);
4419 init_cp_semantics (void)
4423 /* Build a STATIC_ASSERT for a static assertion with the condition
4424 CONDITION and the message text MESSAGE. LOCATION is the location
4425 of the static assertion in the source code. When MEMBER_P, this
4426 static assertion is a member of a class. */
4428 finish_static_assert (tree condition, tree message, location_t location,
4431 if (check_for_bare_parameter_packs (condition))
4432 condition = error_mark_node;
4434 if (type_dependent_expression_p (condition)
4435 || value_dependent_expression_p (condition))
4437 /* We're in a template; build a STATIC_ASSERT and put it in
4441 assertion = make_node (STATIC_ASSERT);
4442 STATIC_ASSERT_CONDITION (assertion) = condition;
4443 STATIC_ASSERT_MESSAGE (assertion) = message;
4444 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4447 maybe_add_class_template_decl_list (current_class_type,
4451 add_stmt (assertion);
4456 /* Fold the expression and convert it to a boolean value. */
4457 condition = fold_non_dependent_expr (condition);
4458 condition = cp_convert (boolean_type_node, condition);
4460 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4461 /* Do nothing; the condition is satisfied. */
4465 location_t saved_loc = input_location;
4467 input_location = location;
4468 if (TREE_CODE (condition) == INTEGER_CST
4469 && integer_zerop (condition))
4470 /* Report the error. */
4471 error ("static assertion failed: %E", message);
4472 else if (condition && condition != error_mark_node)
4473 error ("non-constant condition for static assertion");
4474 input_location = saved_loc;
4478 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4479 suitable for use as a type-specifier.
4481 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4482 id-expression or a class member access, FALSE when it was parsed as
4483 a full expression. */
4485 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4487 tree orig_expr = expr;
4488 tree type = NULL_TREE;
4490 if (!expr || error_operand_p (expr))
4491 return error_mark_node;
4494 || TREE_CODE (expr) == TYPE_DECL
4495 || (TREE_CODE (expr) == BIT_NOT_EXPR
4496 && TYPE_P (TREE_OPERAND (expr, 0))))
4498 error ("argument to decltype must be an expression");
4499 return error_mark_node;
4502 if (type_dependent_expression_p (expr))
4504 type = cxx_make_type (DECLTYPE_TYPE);
4505 DECLTYPE_TYPE_EXPR (type) = expr;
4506 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4507 = id_expression_or_member_access_p;
4508 SET_TYPE_STRUCTURAL_EQUALITY (type);
4513 /* The type denoted by decltype(e) is defined as follows: */
4515 if (id_expression_or_member_access_p)
4517 /* If e is an id-expression or a class member access (5.2.5
4518 [expr.ref]), decltype(e) is defined as the type of the entity
4519 named by e. If there is no such entity, or e names a set of
4520 overloaded functions, the program is ill-formed. */
4521 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4522 expr = lookup_name (expr);
4524 if (TREE_CODE (expr) == INDIRECT_REF)
4525 /* This can happen when the expression is, e.g., "a.b". Just
4526 look at the underlying operand. */
4527 expr = TREE_OPERAND (expr, 0);
4529 if (TREE_CODE (expr) == OFFSET_REF
4530 || TREE_CODE (expr) == MEMBER_REF)
4531 /* We're only interested in the field itself. If it is a
4532 BASELINK, we will need to see through it in the next
4534 expr = TREE_OPERAND (expr, 1);
4536 if (TREE_CODE (expr) == BASELINK)
4537 /* See through BASELINK nodes to the underlying functions. */
4538 expr = BASELINK_FUNCTIONS (expr);
4540 if (TREE_CODE (expr) == OVERLOAD)
4542 if (OVL_CHAIN (expr))
4544 error ("%qE refers to a set of overloaded functions", orig_expr);
4545 return error_mark_node;
4548 /* An overload set containing only one function: just look
4549 at that function. */
4550 expr = OVL_FUNCTION (expr);
4553 switch (TREE_CODE (expr))
4556 if (DECL_BIT_FIELD_TYPE (expr))
4558 type = DECL_BIT_FIELD_TYPE (expr);
4561 /* Fall through for fields that aren't bitfields. */
4568 type = TREE_TYPE (expr);
4572 type = error_mark_node;
4576 type = is_bitfield_expr_with_lowered_type (expr);
4578 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4585 /* We can get here when the id-expression refers to an
4587 type = TREE_TYPE (expr);
4591 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4592 || TREE_CODE (expr) == SCOPE_REF);
4593 error ("argument to decltype must be an expression");
4594 return error_mark_node;
4599 /* Expressions of reference type are sometimes wrapped in
4600 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4601 representation, not part of the language, so we have to look
4603 if (TREE_CODE (expr) == INDIRECT_REF
4604 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4606 expr = TREE_OPERAND (expr, 0);
4608 if (TREE_CODE (expr) == CALL_EXPR)
4610 /* If e is a function call (5.2.2 [expr.call]) or an
4611 invocation of an overloaded operator (parentheses around e
4612 are ignored), decltype(e) is defined as the return type of
4614 tree fndecl = get_callee_fndecl (expr);
4615 if (fndecl && fndecl != error_mark_node)
4616 type = TREE_TYPE (TREE_TYPE (fndecl));
4619 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4620 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4621 || TREE_CODE (target_type) == POINTER_TYPE)
4622 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4623 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4624 type = TREE_TYPE (TREE_TYPE (target_type));
4626 sorry ("unable to determine the declared type of expression %<%E%>",
4632 type = is_bitfield_expr_with_lowered_type (expr);
4635 /* Bitfields are special, because their type encodes the
4636 number of bits they store. If the expression referenced a
4637 bitfield, TYPE now has the declared type of that
4639 type = cp_build_qualified_type (type,
4640 cp_type_quals (TREE_TYPE (expr)));
4642 if (real_lvalue_p (expr))
4643 type = build_reference_type (type);
4647 /* Otherwise, where T is the type of e, if e is an lvalue,
4648 decltype(e) is defined as T&, otherwise decltype(e) is
4650 type = TREE_TYPE (expr);
4651 if (type == error_mark_node)
4652 return error_mark_node;
4653 else if (expr == current_class_ptr)
4654 /* If the expression is just "this", we want the
4655 cv-unqualified pointer for the "this" type. */
4656 type = TYPE_MAIN_VARIANT (type);
4657 else if (real_lvalue_p (expr))
4659 if (TREE_CODE (type) != REFERENCE_TYPE)
4660 type = build_reference_type (type);
4663 type = non_reference (type);
4668 if (!type || type == unknown_type_node)
4670 error ("type of %qE is unknown", expr);
4671 return error_mark_node;
4677 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4678 __has_nothrow_copy, depending on assign_p. */
4681 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4688 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4691 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4693 else if (TYPE_HAS_INIT_REF (type))
4695 /* If construction of the copy constructor was postponed, create
4697 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4698 lazily_declare_fn (sfk_copy_constructor, type);
4699 fns = CLASSTYPE_CONSTRUCTORS (type);
4704 for (; fns; fns = OVL_NEXT (fns))
4706 tree fn = OVL_CURRENT (fns);
4710 if (copy_fn_p (fn) == 0)
4713 else if (copy_fn_p (fn) <= 0)
4716 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4723 /* Actually evaluates the trait. */
4726 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4728 enum tree_code type_code1;
4731 type_code1 = TREE_CODE (type1);
4735 case CPTK_HAS_NOTHROW_ASSIGN:
4736 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4737 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4738 || (CLASS_TYPE_P (type1)
4739 && classtype_has_nothrow_assign_or_copy_p (type1,
4742 case CPTK_HAS_TRIVIAL_ASSIGN:
4743 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4744 && (pod_type_p (type1)
4745 || (CLASS_TYPE_P (type1)
4746 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4748 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4749 type1 = strip_array_types (type1);
4750 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4751 || (CLASS_TYPE_P (type1)
4752 && (t = locate_ctor (type1, NULL))
4753 && TYPE_NOTHROW_P (TREE_TYPE (t))));
4755 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4756 type1 = strip_array_types (type1);
4757 return (pod_type_p (type1)
4758 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4760 case CPTK_HAS_NOTHROW_COPY:
4761 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4762 || (CLASS_TYPE_P (type1)
4763 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4765 case CPTK_HAS_TRIVIAL_COPY:
4766 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4767 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4769 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4770 type1 = strip_array_types (type1);
4771 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4772 || (CLASS_TYPE_P (type1)
4773 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4775 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4776 return (CLASS_TYPE_P (type1)
4777 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4779 case CPTK_IS_ABSTRACT:
4780 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4782 case CPTK_IS_BASE_OF:
4783 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4784 && DERIVED_FROM_P (type1, type2));
4787 return (NON_UNION_CLASS_TYPE_P (type1));
4789 case CPTK_IS_CONVERTIBLE_TO:
4794 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4797 return (type_code1 == ENUMERAL_TYPE);
4800 return (pod_type_p (type1));
4802 case CPTK_IS_POLYMORPHIC:
4803 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4806 return (type_code1 == UNION_TYPE);
4814 /* Process a trait expression. */
4817 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4819 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4820 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4821 || kind == CPTK_HAS_NOTHROW_COPY
4822 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4823 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4824 || kind == CPTK_HAS_TRIVIAL_COPY
4825 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4826 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4827 || kind == CPTK_IS_ABSTRACT
4828 || kind == CPTK_IS_BASE_OF
4829 || kind == CPTK_IS_CLASS
4830 || kind == CPTK_IS_CONVERTIBLE_TO
4831 || kind == CPTK_IS_EMPTY
4832 || kind == CPTK_IS_ENUM
4833 || kind == CPTK_IS_POD
4834 || kind == CPTK_IS_POLYMORPHIC
4835 || kind == CPTK_IS_UNION);
4837 if (kind == CPTK_IS_CONVERTIBLE_TO)
4839 sorry ("__is_convertible_to");
4840 return error_mark_node;
4843 if (type1 == error_mark_node
4844 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4845 && type2 == error_mark_node))
4846 return error_mark_node;
4848 if (processing_template_decl)
4850 tree trait_expr = make_node (TRAIT_EXPR);
4851 TREE_TYPE (trait_expr) = boolean_type_node;
4852 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4853 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4854 TRAIT_EXPR_KIND (trait_expr) = kind;
4858 complete_type (type1);
4860 complete_type (type2);
4862 /* The only required diagnostic. */
4863 if (kind == CPTK_IS_BASE_OF
4864 && NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4865 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
4866 && !COMPLETE_TYPE_P (type2))
4868 error ("incomplete type %qT not allowed", type2);
4869 return error_mark_node;
4872 return (trait_expr_value (kind, type1, type2)
4873 ? boolean_true_node : boolean_false_node);
4876 #include "gt-cp-semantics.h"