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 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 2, 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 COPYING. If not, write to the Free
25 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
30 #include "coretypes.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
45 #include "diagnostic.h"
47 #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 void emit_associated_thunks (tree);
59 static tree finalize_nrv_r (tree *, int *, void *);
62 /* Deferred Access Checking Overview
63 ---------------------------------
65 Most C++ expressions and declarations require access checking
66 to be performed during parsing. However, in several cases,
67 this has to be treated differently.
69 For member declarations, access checking has to be deferred
70 until more information about the declaration is known. For
82 When we are parsing the function return type `A::X', we don't
83 really know if this is allowed until we parse the function name.
85 Furthermore, some contexts require that access checking is
86 never performed at all. These include class heads, and template
89 Typical use of access checking functions is described here:
91 1. When we enter a context that requires certain access checking
92 mode, the function `push_deferring_access_checks' is called with
93 DEFERRING argument specifying the desired mode. Access checking
94 may be performed immediately (dk_no_deferred), deferred
95 (dk_deferred), or not performed (dk_no_check).
97 2. When a declaration such as a type, or a variable, is encountered,
98 the function `perform_or_defer_access_check' is called. It
99 maintains a VEC of all deferred checks.
101 3. The global `current_class_type' or `current_function_decl' is then
102 setup by the parser. `enforce_access' relies on these information
105 4. Upon exiting the context mentioned in step 1,
106 `perform_deferred_access_checks' is called to check all declaration
107 stored in the VEC. `pop_deferring_access_checks' is then
108 called to restore the previous access checking mode.
110 In case of parsing error, we simply call `pop_deferring_access_checks'
111 without `perform_deferred_access_checks'. */
113 typedef struct deferred_access GTY(())
115 /* A VEC representing name-lookups for which we have deferred
116 checking access controls. We cannot check the accessibility of
117 names used in a decl-specifier-seq until we know what is being
118 declared because code like:
125 A::B* A::f() { return 0; }
127 is valid, even though `A::B' is not generally accessible. */
128 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
130 /* The current mode of access checks. */
131 enum deferring_kind deferring_access_checks_kind;
134 DEF_VEC_O (deferred_access);
135 DEF_VEC_ALLOC_O (deferred_access,gc);
137 /* Data for deferred access checking. */
138 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
139 static GTY(()) unsigned deferred_access_no_check;
141 /* Save the current deferred access states and start deferred
142 access checking iff DEFER_P is true. */
145 push_deferring_access_checks (deferring_kind deferring)
147 /* For context like template instantiation, access checking
148 disabling applies to all nested context. */
149 if (deferred_access_no_check || deferring == dk_no_check)
150 deferred_access_no_check++;
153 deferred_access *ptr;
155 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
156 ptr->deferred_access_checks = NULL;
157 ptr->deferring_access_checks_kind = deferring;
161 /* Resume deferring access checks again after we stopped doing
165 resume_deferring_access_checks (void)
167 if (!deferred_access_no_check)
168 VEC_last (deferred_access, deferred_access_stack)
169 ->deferring_access_checks_kind = dk_deferred;
172 /* Stop deferring access checks. */
175 stop_deferring_access_checks (void)
177 if (!deferred_access_no_check)
178 VEC_last (deferred_access, deferred_access_stack)
179 ->deferring_access_checks_kind = dk_no_deferred;
182 /* Discard the current deferred access checks and restore the
186 pop_deferring_access_checks (void)
188 if (deferred_access_no_check)
189 deferred_access_no_check--;
191 VEC_pop (deferred_access, deferred_access_stack);
194 /* Returns a TREE_LIST representing the deferred checks.
195 The TREE_PURPOSE of each node is the type through which the
196 access occurred; the TREE_VALUE is the declaration named.
199 VEC (deferred_access_check,gc)*
200 get_deferred_access_checks (void)
202 if (deferred_access_no_check)
205 return (VEC_last (deferred_access, deferred_access_stack)
206 ->deferred_access_checks);
209 /* Take current deferred checks and combine with the
210 previous states if we also defer checks previously.
211 Otherwise perform checks now. */
214 pop_to_parent_deferring_access_checks (void)
216 if (deferred_access_no_check)
217 deferred_access_no_check--;
220 VEC (deferred_access_check,gc) *checks;
221 deferred_access *ptr;
223 checks = (VEC_last (deferred_access, deferred_access_stack)
224 ->deferred_access_checks);
226 VEC_pop (deferred_access, deferred_access_stack);
227 ptr = VEC_last (deferred_access, deferred_access_stack);
228 if (ptr->deferring_access_checks_kind == dk_no_deferred)
231 perform_access_checks (checks);
235 /* Merge with parent. */
237 deferred_access_check *chk, *probe;
240 VEC_iterate (deferred_access_check, checks, i, chk) ;
244 VEC_iterate (deferred_access_check,
245 ptr->deferred_access_checks, j, probe) ;
248 if (probe->binfo == chk->binfo &&
249 probe->decl == chk->decl &&
250 probe->diag_decl == chk->diag_decl)
253 /* Insert into parent's checks. */
254 VEC_safe_push (deferred_access_check, gc,
255 ptr->deferred_access_checks, chk);
262 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
263 is the BINFO indicating the qualifying scope used to access the
264 DECL node stored in the TREE_VALUE of the node. */
267 perform_access_checks (VEC (deferred_access_check,gc)* checks)
270 deferred_access_check *chk;
275 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
276 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
279 /* Perform the deferred access checks.
281 After performing the checks, we still have to keep the list
282 `deferred_access_stack->deferred_access_checks' since we may want
283 to check access for them again later in a different context.
290 A::X A::a, x; // No error for `A::a', error for `x'
292 We have to perform deferred access of `A::X', first with `A::a',
296 perform_deferred_access_checks (void)
298 perform_access_checks (get_deferred_access_checks ());
301 /* Defer checking the accessibility of DECL, when looked up in
302 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
305 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
308 deferred_access *ptr;
309 deferred_access_check *chk;
310 deferred_access_check *new_access;
313 /* Exit if we are in a context that no access checking is performed.
315 if (deferred_access_no_check)
318 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
320 ptr = VEC_last (deferred_access, deferred_access_stack);
322 /* If we are not supposed to defer access checks, just check now. */
323 if (ptr->deferring_access_checks_kind == dk_no_deferred)
325 enforce_access (binfo, decl, diag_decl);
329 /* See if we are already going to perform this check. */
331 VEC_iterate (deferred_access_check,
332 ptr->deferred_access_checks, i, chk) ;
335 if (chk->decl == decl && chk->binfo == binfo &&
336 chk->diag_decl == diag_decl)
341 /* If not, record the check. */
343 VEC_safe_push (deferred_access_check, gc,
344 ptr->deferred_access_checks, 0);
345 new_access->binfo = binfo;
346 new_access->decl = decl;
347 new_access->diag_decl = diag_decl;
350 /* Returns nonzero if the current statement is a full expression,
351 i.e. temporaries created during that statement should be destroyed
352 at the end of the statement. */
355 stmts_are_full_exprs_p (void)
357 return current_stmt_tree ()->stmts_are_full_exprs_p;
360 /* T is a statement. Add it to the statement-tree. This is the C++
361 version. The C/ObjC frontends have a slightly different version of
367 enum tree_code code = TREE_CODE (t);
369 if (EXPR_P (t) && code != LABEL_EXPR)
371 if (!EXPR_HAS_LOCATION (t))
372 SET_EXPR_LOCATION (t, input_location);
374 /* When we expand a statement-tree, we must know whether or not the
375 statements are full-expressions. We record that fact here. */
376 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
379 /* Add T to the statement-tree. Non-side-effect statements need to be
380 recorded during statement expressions. */
381 append_to_statement_list_force (t, &cur_stmt_list);
386 /* Returns the stmt_tree (if any) to which statements are currently
387 being added. If there is no active statement-tree, NULL is
391 current_stmt_tree (void)
394 ? &cfun->language->base.x_stmt_tree
395 : &scope_chain->x_stmt_tree);
398 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
401 maybe_cleanup_point_expr (tree expr)
403 if (!processing_template_decl && stmts_are_full_exprs_p ())
404 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
408 /* Like maybe_cleanup_point_expr except have the type of the new expression be
409 void so we don't need to create a temporary variable to hold the inner
410 expression. The reason why we do this is because the original type might be
411 an aggregate and we cannot create a temporary variable for that type. */
414 maybe_cleanup_point_expr_void (tree expr)
416 if (!processing_template_decl && stmts_are_full_exprs_p ())
417 expr = fold_build_cleanup_point_expr (void_type_node, expr);
423 /* Create a declaration statement for the declaration given by the DECL. */
426 add_decl_expr (tree decl)
428 tree r = build_stmt (DECL_EXPR, decl);
429 if (DECL_INITIAL (decl)
430 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
431 r = maybe_cleanup_point_expr_void (r);
435 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
436 flag for this because "A union for which objects or pointers are
437 declared is not an anonymous union" [class.union]. */
440 anon_aggr_type_p (tree node)
442 return ANON_AGGR_TYPE_P (node);
445 /* Finish a scope. */
448 do_poplevel (tree stmt_list)
452 if (stmts_are_full_exprs_p ())
453 block = poplevel (kept_level_p (), 1, 0);
455 stmt_list = pop_stmt_list (stmt_list);
457 if (!processing_template_decl)
459 stmt_list = c_build_bind_expr (block, stmt_list);
460 /* ??? See c_end_compound_stmt re statement expressions. */
466 /* Begin a new scope. */
469 do_pushlevel (scope_kind sk)
471 tree ret = push_stmt_list ();
472 if (stmts_are_full_exprs_p ())
473 begin_scope (sk, NULL);
477 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
478 when the current scope is exited. EH_ONLY is true when this is not
479 meant to apply to normal control flow transfer. */
482 push_cleanup (tree decl, tree cleanup, bool eh_only)
484 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
485 CLEANUP_EH_ONLY (stmt) = eh_only;
487 CLEANUP_BODY (stmt) = push_stmt_list ();
490 /* Begin a conditional that might contain a declaration. When generating
491 normal code, we want the declaration to appear before the statement
492 containing the conditional. When generating template code, we want the
493 conditional to be rendered as the raw DECL_EXPR. */
496 begin_cond (tree *cond_p)
498 if (processing_template_decl)
499 *cond_p = push_stmt_list ();
502 /* Finish such a conditional. */
505 finish_cond (tree *cond_p, tree expr)
507 if (processing_template_decl)
509 tree cond = pop_stmt_list (*cond_p);
510 if (TREE_CODE (cond) == DECL_EXPR)
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 = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
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. */
578 maybe_convert_cond (tree cond)
580 /* Empty conditions remain empty. */
584 /* Wait until we instantiate templates before doing conversion. */
585 if (processing_template_decl)
588 /* Do the conversion. */
589 cond = convert_from_reference (cond);
591 if (TREE_CODE (cond) == MODIFY_EXPR
592 && !TREE_NO_WARNING (cond)
595 warning (OPT_Wparentheses,
596 "suggest parentheses around assignment used as truth value");
597 TREE_NO_WARNING (cond) = 1;
600 return condition_conversion (cond);
603 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
606 finish_expr_stmt (tree expr)
610 if (expr != NULL_TREE)
612 if (!processing_template_decl)
614 if (warn_sequence_point)
615 verify_sequence_points (expr);
616 expr = convert_to_void (expr, "statement");
618 else if (!type_dependent_expression_p (expr))
619 convert_to_void (build_non_dependent_expr (expr), "statement");
621 /* Simplification of inner statement expressions, compound exprs,
622 etc can result in us already having an EXPR_STMT. */
623 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
625 if (TREE_CODE (expr) != EXPR_STMT)
626 expr = build_stmt (EXPR_STMT, expr);
627 expr = maybe_cleanup_point_expr_void (expr);
639 /* Begin an if-statement. Returns a newly created IF_STMT if
646 scope = do_pushlevel (sk_block);
647 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
648 TREE_CHAIN (r) = scope;
649 begin_cond (&IF_COND (r));
653 /* Process the COND of an if-statement, which may be given by
657 finish_if_stmt_cond (tree cond, tree if_stmt)
659 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
661 THEN_CLAUSE (if_stmt) = push_stmt_list ();
664 /* Finish the then-clause of an if-statement, which may be given by
668 finish_then_clause (tree if_stmt)
670 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
674 /* Begin the else-clause of an if-statement. */
677 begin_else_clause (tree if_stmt)
679 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
682 /* Finish the else-clause of an if-statement, which may be given by
686 finish_else_clause (tree if_stmt)
688 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
691 /* Finish an if-statement. */
694 finish_if_stmt (tree if_stmt)
696 tree scope = TREE_CHAIN (if_stmt);
697 TREE_CHAIN (if_stmt) = NULL;
698 add_stmt (do_poplevel (scope));
700 empty_body_warning (THEN_CLAUSE (if_stmt), ELSE_CLAUSE (if_stmt));
703 /* Begin a while-statement. Returns a newly created WHILE_STMT if
707 begin_while_stmt (void)
710 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
712 WHILE_BODY (r) = do_pushlevel (sk_block);
713 begin_cond (&WHILE_COND (r));
717 /* Process the COND of a while-statement, which may be given by
721 finish_while_stmt_cond (tree cond, tree while_stmt)
723 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
724 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
727 /* Finish a while-statement, which may be given by WHILE_STMT. */
730 finish_while_stmt (tree while_stmt)
732 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
736 /* Begin a do-statement. Returns a newly created DO_STMT if
742 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
744 DO_BODY (r) = push_stmt_list ();
748 /* Finish the body of a do-statement, which may be given by DO_STMT. */
751 finish_do_body (tree do_stmt)
753 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
756 /* Finish a do-statement, which may be given by DO_STMT, and whose
757 COND is as indicated. */
760 finish_do_stmt (tree cond, tree do_stmt)
762 cond = maybe_convert_cond (cond);
763 DO_COND (do_stmt) = cond;
767 /* Finish a return-statement. The EXPRESSION returned, if any, is as
771 finish_return_stmt (tree expr)
776 expr = check_return_expr (expr, &no_warning);
778 if (flag_openmp && !check_omp_return ())
779 return error_mark_node;
780 if (!processing_template_decl)
782 if (DECL_DESTRUCTOR_P (current_function_decl)
783 || (DECL_CONSTRUCTOR_P (current_function_decl)
784 && targetm.cxx.cdtor_returns_this ()))
786 /* Similarly, all destructors must run destructors for
787 base-classes before returning. So, all returns in a
788 destructor get sent to the DTOR_LABEL; finish_function emits
789 code to return a value there. */
790 return finish_goto_stmt (cdtor_label);
794 r = build_stmt (RETURN_EXPR, expr);
795 TREE_NO_WARNING (r) |= no_warning;
796 r = maybe_cleanup_point_expr_void (r);
803 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
806 begin_for_stmt (void)
810 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
811 NULL_TREE, NULL_TREE);
813 if (flag_new_for_scope > 0)
814 TREE_CHAIN (r) = do_pushlevel (sk_for);
816 if (processing_template_decl)
817 FOR_INIT_STMT (r) = push_stmt_list ();
822 /* Finish the for-init-statement of a for-statement, which may be
823 given by FOR_STMT. */
826 finish_for_init_stmt (tree for_stmt)
828 if (processing_template_decl)
829 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
831 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
832 begin_cond (&FOR_COND (for_stmt));
835 /* Finish the COND of a for-statement, which may be given by
839 finish_for_cond (tree cond, tree for_stmt)
841 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
842 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
845 /* Finish the increment-EXPRESSION in a for-statement, which may be
846 given by FOR_STMT. */
849 finish_for_expr (tree expr, tree for_stmt)
853 /* If EXPR is an overloaded function, issue an error; there is no
854 context available to use to perform overload resolution. */
855 if (type_unknown_p (expr))
857 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
858 expr = error_mark_node;
860 if (!processing_template_decl)
862 if (warn_sequence_point)
863 verify_sequence_points (expr);
864 expr = convert_to_void (expr, "3rd expression in for");
866 else if (!type_dependent_expression_p (expr))
867 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for");
868 expr = maybe_cleanup_point_expr_void (expr);
869 FOR_EXPR (for_stmt) = expr;
872 /* Finish the body of a for-statement, which may be given by
873 FOR_STMT. The increment-EXPR for the loop must be
877 finish_for_stmt (tree for_stmt)
879 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
881 /* Pop the scope for the body of the loop. */
882 if (flag_new_for_scope > 0)
884 tree scope = TREE_CHAIN (for_stmt);
885 TREE_CHAIN (for_stmt) = NULL;
886 add_stmt (do_poplevel (scope));
892 /* Finish a break-statement. */
895 finish_break_stmt (void)
897 return add_stmt (build_stmt (BREAK_STMT));
900 /* Finish a continue-statement. */
903 finish_continue_stmt (void)
905 return add_stmt (build_stmt (CONTINUE_STMT));
908 /* Begin a switch-statement. Returns a new SWITCH_STMT if
912 begin_switch_stmt (void)
916 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
918 scope = do_pushlevel (sk_block);
919 TREE_CHAIN (r) = scope;
920 begin_cond (&SWITCH_STMT_COND (r));
925 /* Finish the cond of a switch-statement. */
928 finish_switch_cond (tree cond, tree switch_stmt)
930 tree orig_type = NULL;
931 if (!processing_template_decl)
935 /* Convert the condition to an integer or enumeration type. */
936 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
937 if (cond == NULL_TREE)
939 error ("switch quantity not an integer");
940 cond = error_mark_node;
942 orig_type = TREE_TYPE (cond);
943 if (cond != error_mark_node)
947 Integral promotions are performed. */
948 cond = perform_integral_promotions (cond);
949 cond = maybe_cleanup_point_expr (cond);
952 if (cond != error_mark_node)
954 index = get_unwidened (cond, NULL_TREE);
955 /* We can't strip a conversion from a signed type to an unsigned,
956 because if we did, int_fits_type_p would do the wrong thing
957 when checking case values for being in range,
958 and it's too hard to do the right thing. */
959 if (TYPE_UNSIGNED (TREE_TYPE (cond))
960 == TYPE_UNSIGNED (TREE_TYPE (index)))
964 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
965 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
966 add_stmt (switch_stmt);
967 push_switch (switch_stmt);
968 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
971 /* Finish the body of a switch-statement, which may be given by
972 SWITCH_STMT. The COND to switch on is indicated. */
975 finish_switch_stmt (tree switch_stmt)
979 SWITCH_STMT_BODY (switch_stmt) =
980 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
984 scope = TREE_CHAIN (switch_stmt);
985 TREE_CHAIN (switch_stmt) = NULL;
986 add_stmt (do_poplevel (scope));
989 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
993 begin_try_block (void)
995 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
997 TRY_STMTS (r) = push_stmt_list ();
1001 /* Likewise, for a function-try-block. The block returned in
1002 *COMPOUND_STMT is an artificial outer scope, containing the
1003 function-try-block. */
1006 begin_function_try_block (tree *compound_stmt)
1009 /* This outer scope does not exist in the C++ standard, but we need
1010 a place to put __FUNCTION__ and similar variables. */
1011 *compound_stmt = begin_compound_stmt (0);
1012 r = begin_try_block ();
1013 FN_TRY_BLOCK_P (r) = 1;
1017 /* Finish a try-block, which may be given by TRY_BLOCK. */
1020 finish_try_block (tree try_block)
1022 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1023 TRY_HANDLERS (try_block) = push_stmt_list ();
1026 /* Finish the body of a cleanup try-block, which may be given by
1030 finish_cleanup_try_block (tree try_block)
1032 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1035 /* Finish an implicitly generated try-block, with a cleanup is given
1039 finish_cleanup (tree cleanup, tree try_block)
1041 TRY_HANDLERS (try_block) = cleanup;
1042 CLEANUP_P (try_block) = 1;
1045 /* Likewise, for a function-try-block. */
1048 finish_function_try_block (tree try_block)
1050 finish_try_block (try_block);
1051 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1052 the try block, but moving it inside. */
1053 in_function_try_handler = 1;
1056 /* Finish a handler-sequence for a try-block, which may be given by
1060 finish_handler_sequence (tree try_block)
1062 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1063 check_handlers (TRY_HANDLERS (try_block));
1066 /* Finish the handler-seq for a function-try-block, given by
1067 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1068 begin_function_try_block. */
1071 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1073 in_function_try_handler = 0;
1074 finish_handler_sequence (try_block);
1075 finish_compound_stmt (compound_stmt);
1078 /* Begin a handler. Returns a HANDLER if appropriate. */
1081 begin_handler (void)
1085 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1088 /* Create a binding level for the eh_info and the exception object
1090 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1095 /* Finish the handler-parameters for a handler, which may be given by
1096 HANDLER. DECL is the declaration for the catch parameter, or NULL
1097 if this is a `catch (...)' clause. */
1100 finish_handler_parms (tree decl, tree handler)
1102 tree type = NULL_TREE;
1103 if (processing_template_decl)
1107 decl = pushdecl (decl);
1108 decl = push_template_decl (decl);
1109 HANDLER_PARMS (handler) = decl;
1110 type = TREE_TYPE (decl);
1114 type = expand_start_catch_block (decl);
1115 HANDLER_TYPE (handler) = type;
1116 if (!processing_template_decl && type)
1117 mark_used (eh_type_info (type));
1120 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1121 the return value from the matching call to finish_handler_parms. */
1124 finish_handler (tree handler)
1126 if (!processing_template_decl)
1127 expand_end_catch_block ();
1128 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1131 /* Begin a compound statement. FLAGS contains some bits that control the
1132 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1133 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1134 block of a function. If BCS_TRY_BLOCK is set, this is the block
1135 created on behalf of a TRY statement. Returns a token to be passed to
1136 finish_compound_stmt. */
1139 begin_compound_stmt (unsigned int flags)
1143 if (flags & BCS_NO_SCOPE)
1145 r = push_stmt_list ();
1146 STATEMENT_LIST_NO_SCOPE (r) = 1;
1148 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1149 But, if it's a statement-expression with a scopeless block, there's
1150 nothing to keep, and we don't want to accidentally keep a block
1151 *inside* the scopeless block. */
1152 keep_next_level (false);
1155 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1157 /* When processing a template, we need to remember where the braces were,
1158 so that we can set up identical scopes when instantiating the template
1159 later. BIND_EXPR is a handy candidate for this.
1160 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1161 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1162 processing templates. */
1163 if (processing_template_decl)
1165 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1166 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1167 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1168 TREE_SIDE_EFFECTS (r) = 1;
1174 /* Finish a compound-statement, which is given by STMT. */
1177 finish_compound_stmt (tree stmt)
1179 if (TREE_CODE (stmt) == BIND_EXPR)
1180 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1181 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1182 stmt = pop_stmt_list (stmt);
1185 /* Destroy any ObjC "super" receivers that may have been
1187 objc_clear_super_receiver ();
1189 stmt = do_poplevel (stmt);
1192 /* ??? See c_end_compound_stmt wrt statement expressions. */
1197 /* Finish an asm-statement, whose components are a STRING, some
1198 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1199 whether the asm-statement should be considered volatile. */
1202 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1203 tree input_operands, tree clobbers)
1207 int ninputs = list_length (input_operands);
1208 int noutputs = list_length (output_operands);
1210 if (!processing_template_decl)
1212 const char *constraint;
1213 const char **oconstraints;
1214 bool allows_mem, allows_reg, is_inout;
1218 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1220 string = resolve_asm_operand_names (string, output_operands,
1223 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1225 operand = TREE_VALUE (t);
1227 /* ??? Really, this should not be here. Users should be using a
1228 proper lvalue, dammit. But there's a long history of using
1229 casts in the output operands. In cases like longlong.h, this
1230 becomes a primitive form of typechecking -- if the cast can be
1231 removed, then the output operand had a type of the proper width;
1232 otherwise we'll get an error. Gross, but ... */
1233 STRIP_NOPS (operand);
1235 if (!lvalue_or_else (operand, lv_asm))
1236 operand = error_mark_node;
1238 if (operand != error_mark_node
1239 && (TREE_READONLY (operand)
1240 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1241 /* Functions are not modifiable, even though they are
1243 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1244 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1245 /* If it's an aggregate and any field is const, then it is
1246 effectively const. */
1247 || (CLASS_TYPE_P (TREE_TYPE (operand))
1248 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1249 readonly_error (operand, "assignment (via 'asm' output)", 0);
1251 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1252 oconstraints[i] = constraint;
1254 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1255 &allows_mem, &allows_reg, &is_inout))
1257 /* If the operand is going to end up in memory,
1258 mark it addressable. */
1259 if (!allows_reg && !cxx_mark_addressable (operand))
1260 operand = error_mark_node;
1263 operand = error_mark_node;
1265 TREE_VALUE (t) = operand;
1268 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1270 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1271 operand = decay_conversion (TREE_VALUE (t));
1273 /* If the type of the operand hasn't been determined (e.g.,
1274 because it involves an overloaded function), then issue
1275 an error message. There's no context available to
1276 resolve the overloading. */
1277 if (TREE_TYPE (operand) == unknown_type_node)
1279 error ("type of asm operand %qE could not be determined",
1281 operand = error_mark_node;
1284 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1285 oconstraints, &allows_mem, &allows_reg))
1287 /* If the operand is going to end up in memory,
1288 mark it addressable. */
1289 if (!allows_reg && allows_mem)
1291 /* Strip the nops as we allow this case. FIXME, this really
1292 should be rejected or made deprecated. */
1293 STRIP_NOPS (operand);
1294 if (!cxx_mark_addressable (operand))
1295 operand = error_mark_node;
1299 operand = error_mark_node;
1301 TREE_VALUE (t) = operand;
1305 r = build_stmt (ASM_EXPR, string,
1306 output_operands, input_operands,
1308 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1309 r = maybe_cleanup_point_expr_void (r);
1310 return add_stmt (r);
1313 /* Finish a label with the indicated NAME. */
1316 finish_label_stmt (tree name)
1318 tree decl = define_label (input_location, name);
1320 if (decl == error_mark_node)
1321 return error_mark_node;
1323 return add_stmt (build_stmt (LABEL_EXPR, decl));
1326 /* Finish a series of declarations for local labels. G++ allows users
1327 to declare "local" labels, i.e., labels with scope. This extension
1328 is useful when writing code involving statement-expressions. */
1331 finish_label_decl (tree name)
1333 tree decl = declare_local_label (name);
1334 add_decl_expr (decl);
1337 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1340 finish_decl_cleanup (tree decl, tree cleanup)
1342 push_cleanup (decl, cleanup, false);
1345 /* If the current scope exits with an exception, run CLEANUP. */
1348 finish_eh_cleanup (tree cleanup)
1350 push_cleanup (NULL, cleanup, true);
1353 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1354 order they were written by the user. Each node is as for
1355 emit_mem_initializers. */
1358 finish_mem_initializers (tree mem_inits)
1360 /* Reorder the MEM_INITS so that they are in the order they appeared
1361 in the source program. */
1362 mem_inits = nreverse (mem_inits);
1364 if (processing_template_decl)
1365 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1367 emit_mem_initializers (mem_inits);
1370 /* Finish a parenthesized expression EXPR. */
1373 finish_parenthesized_expr (tree expr)
1376 /* This inhibits warnings in c_common_truthvalue_conversion. */
1377 TREE_NO_WARNING (expr) = 1;
1379 if (TREE_CODE (expr) == OFFSET_REF)
1380 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1381 enclosed in parentheses. */
1382 PTRMEM_OK_P (expr) = 0;
1384 if (TREE_CODE (expr) == STRING_CST)
1385 PAREN_STRING_LITERAL_P (expr) = 1;
1390 /* Finish a reference to a non-static data member (DECL) that is not
1391 preceded by `.' or `->'. */
1394 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1396 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1400 if (current_function_decl
1401 && DECL_STATIC_FUNCTION_P (current_function_decl))
1402 error ("invalid use of member %q+D in static member function", decl);
1404 error ("invalid use of non-static data member %q+D", decl);
1405 error ("from this location");
1407 return error_mark_node;
1409 TREE_USED (current_class_ptr) = 1;
1410 if (processing_template_decl && !qualifying_scope)
1412 tree type = TREE_TYPE (decl);
1414 if (TREE_CODE (type) == REFERENCE_TYPE)
1415 type = TREE_TYPE (type);
1418 /* Set the cv qualifiers. */
1419 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1421 if (DECL_MUTABLE_P (decl))
1422 quals &= ~TYPE_QUAL_CONST;
1424 quals |= cp_type_quals (TREE_TYPE (decl));
1425 type = cp_build_qualified_type (type, quals);
1428 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1432 tree access_type = TREE_TYPE (object);
1433 tree lookup_context = context_for_name_lookup (decl);
1435 while (!DERIVED_FROM_P (lookup_context, access_type))
1437 access_type = TYPE_CONTEXT (access_type);
1438 while (access_type && DECL_P (access_type))
1439 access_type = DECL_CONTEXT (access_type);
1443 error ("object missing in reference to %q+D", decl);
1444 error ("from this location");
1445 return error_mark_node;
1449 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1450 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1452 if (processing_template_decl)
1453 return build_qualified_name (TREE_TYPE (decl),
1456 /*template_p=*/false);
1458 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1461 /* If the data member was named `C::M', convert `*this' to `C'
1463 if (qualifying_scope)
1465 tree binfo = NULL_TREE;
1466 object = build_scoped_ref (object, qualifying_scope,
1470 return build_class_member_access_expr (object, decl,
1471 /*access_path=*/NULL_TREE,
1472 /*preserve_reference=*/false);
1476 /* DECL was the declaration to which a qualified-id resolved. Issue
1477 an error message if it is not accessible. If OBJECT_TYPE is
1478 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1479 type of `*x', or `x', respectively. If the DECL was named as
1480 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1483 check_accessibility_of_qualified_id (tree decl,
1485 tree nested_name_specifier)
1488 tree qualifying_type = NULL_TREE;
1490 /* If we're not checking, return immediately. */
1491 if (deferred_access_no_check)
1494 /* Determine the SCOPE of DECL. */
1495 scope = context_for_name_lookup (decl);
1496 /* If the SCOPE is not a type, then DECL is not a member. */
1497 if (!TYPE_P (scope))
1499 /* Compute the scope through which DECL is being accessed. */
1501 /* OBJECT_TYPE might not be a class type; consider:
1503 class A { typedef int I; };
1507 In this case, we will have "A::I" as the DECL, but "I" as the
1509 && CLASS_TYPE_P (object_type)
1510 && DERIVED_FROM_P (scope, object_type))
1511 /* If we are processing a `->' or `.' expression, use the type of the
1513 qualifying_type = object_type;
1514 else if (nested_name_specifier)
1516 /* If the reference is to a non-static member of the
1517 current class, treat it as if it were referenced through
1519 if (DECL_NONSTATIC_MEMBER_P (decl)
1520 && current_class_ptr
1521 && DERIVED_FROM_P (scope, current_class_type))
1522 qualifying_type = current_class_type;
1523 /* Otherwise, use the type indicated by the
1524 nested-name-specifier. */
1526 qualifying_type = nested_name_specifier;
1529 /* Otherwise, the name must be from the current class or one of
1531 qualifying_type = currently_open_derived_class (scope);
1534 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1535 or similar in a default argument value. */
1536 && CLASS_TYPE_P (qualifying_type)
1537 && !dependent_type_p (qualifying_type))
1538 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1542 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1543 class named to the left of the "::" operator. DONE is true if this
1544 expression is a complete postfix-expression; it is false if this
1545 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1546 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1547 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1548 is true iff this qualified name appears as a template argument. */
1551 finish_qualified_id_expr (tree qualifying_class,
1556 bool template_arg_p)
1558 gcc_assert (TYPE_P (qualifying_class));
1560 if (error_operand_p (expr))
1561 return error_mark_node;
1563 if (DECL_P (expr) || BASELINK_P (expr))
1567 check_template_keyword (expr);
1569 /* If EXPR occurs as the operand of '&', use special handling that
1570 permits a pointer-to-member. */
1571 if (address_p && done)
1573 if (TREE_CODE (expr) == SCOPE_REF)
1574 expr = TREE_OPERAND (expr, 1);
1575 expr = build_offset_ref (qualifying_class, expr,
1576 /*address_p=*/true);
1580 /* Within the scope of a class, turn references to non-static
1581 members into expression of the form "this->...". */
1583 /* But, within a template argument, we do not want make the
1584 transformation, as there is no "this" pointer. */
1586 else if (TREE_CODE (expr) == FIELD_DECL)
1587 expr = finish_non_static_data_member (expr, current_class_ref,
1589 else if (BASELINK_P (expr) && !processing_template_decl)
1593 /* See if any of the functions are non-static members. */
1594 fns = BASELINK_FUNCTIONS (expr);
1595 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1596 fns = TREE_OPERAND (fns, 0);
1597 /* If so, the expression may be relative to the current
1599 if (!shared_member_p (fns)
1600 && current_class_type
1601 && DERIVED_FROM_P (qualifying_class, current_class_type))
1602 expr = (build_class_member_access_expr
1603 (maybe_dummy_object (qualifying_class, NULL),
1605 BASELINK_ACCESS_BINFO (expr),
1606 /*preserve_reference=*/false));
1608 /* The expression is a qualified name whose address is not
1610 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1616 /* Begin a statement-expression. The value returned must be passed to
1617 finish_stmt_expr. */
1620 begin_stmt_expr (void)
1622 return push_stmt_list ();
1625 /* Process the final expression of a statement expression. EXPR can be
1626 NULL, if the final expression is empty. Return a STATEMENT_LIST
1627 containing all the statements in the statement-expression, or
1628 ERROR_MARK_NODE if there was an error. */
1631 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1633 if (error_operand_p (expr))
1634 return error_mark_node;
1636 /* If the last statement does not have "void" type, then the value
1637 of the last statement is the value of the entire expression. */
1640 tree type = TREE_TYPE (expr);
1642 if (processing_template_decl)
1644 expr = build_stmt (EXPR_STMT, expr);
1645 expr = add_stmt (expr);
1646 /* Mark the last statement so that we can recognize it as such at
1647 template-instantiation time. */
1648 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1650 else if (VOID_TYPE_P (type))
1652 /* Just treat this like an ordinary statement. */
1653 expr = finish_expr_stmt (expr);
1657 /* It actually has a value we need to deal with. First, force it
1658 to be an rvalue so that we won't need to build up a copy
1659 constructor call later when we try to assign it to something. */
1660 expr = force_rvalue (expr);
1661 if (error_operand_p (expr))
1662 return error_mark_node;
1664 /* Update for array-to-pointer decay. */
1665 type = TREE_TYPE (expr);
1667 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1668 normal statement, but don't convert to void or actually add
1670 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1671 expr = maybe_cleanup_point_expr (expr);
1675 /* The type of the statement-expression is the type of the last
1677 TREE_TYPE (stmt_expr) = type;
1683 /* Finish a statement-expression. EXPR should be the value returned
1684 by the previous begin_stmt_expr. Returns an expression
1685 representing the statement-expression. */
1688 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1693 if (error_operand_p (stmt_expr))
1694 return error_mark_node;
1696 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1698 type = TREE_TYPE (stmt_expr);
1699 result = pop_stmt_list (stmt_expr);
1700 TREE_TYPE (result) = type;
1702 if (processing_template_decl)
1704 result = build_min (STMT_EXPR, type, result);
1705 TREE_SIDE_EFFECTS (result) = 1;
1706 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1708 else if (CLASS_TYPE_P (type))
1710 /* Wrap the statement-expression in a TARGET_EXPR so that the
1711 temporary object created by the final expression is destroyed at
1712 the end of the full-expression containing the
1713 statement-expression. */
1714 result = force_target_expr (type, result);
1720 /* Perform Koenig lookup. FN is the postfix-expression representing
1721 the function (or functions) to call; ARGS are the arguments to the
1722 call. Returns the functions to be considered by overload
1726 perform_koenig_lookup (tree fn, tree args)
1728 tree identifier = NULL_TREE;
1729 tree functions = NULL_TREE;
1731 /* Find the name of the overloaded function. */
1732 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1734 else if (is_overloaded_fn (fn))
1737 identifier = DECL_NAME (get_first_fn (functions));
1739 else if (DECL_P (fn))
1742 identifier = DECL_NAME (fn);
1745 /* A call to a namespace-scope function using an unqualified name.
1747 Do Koenig lookup -- unless any of the arguments are
1749 if (!any_type_dependent_arguments_p (args))
1751 fn = lookup_arg_dependent (identifier, functions, args);
1753 /* The unqualified name could not be resolved. */
1754 fn = unqualified_fn_lookup_error (identifier);
1760 /* Generate an expression for `FN (ARGS)'.
1762 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1763 as a virtual call, even if FN is virtual. (This flag is set when
1764 encountering an expression where the function name is explicitly
1765 qualified. For example a call to `X::f' never generates a virtual
1768 Returns code for the call. */
1771 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1777 if (fn == error_mark_node || args == error_mark_node)
1778 return error_mark_node;
1780 /* ARGS should be a list of arguments. */
1781 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1782 gcc_assert (!TYPE_P (fn));
1787 if (processing_template_decl)
1789 if (type_dependent_expression_p (fn)
1790 || any_type_dependent_arguments_p (args))
1792 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1793 KOENIG_LOOKUP_P (result) = koenig_p;
1796 if (!BASELINK_P (fn)
1797 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1798 && TREE_TYPE (fn) != unknown_type_node)
1799 fn = build_non_dependent_expr (fn);
1800 args = build_non_dependent_args (orig_args);
1803 if (is_overloaded_fn (fn))
1804 fn = baselink_for_fns (fn);
1807 if (BASELINK_P (fn))
1811 /* A call to a member function. From [over.call.func]:
1813 If the keyword this is in scope and refers to the class of
1814 that member function, or a derived class thereof, then the
1815 function call is transformed into a qualified function call
1816 using (*this) as the postfix-expression to the left of the
1817 . operator.... [Otherwise] a contrived object of type T
1818 becomes the implied object argument.
1820 This paragraph is unclear about this situation:
1822 struct A { void f(); };
1823 struct B : public A {};
1824 struct C : public A { void g() { B::f(); }};
1826 In particular, for `B::f', this paragraph does not make clear
1827 whether "the class of that member function" refers to `A' or
1828 to `B'. We believe it refers to `B'. */
1829 if (current_class_type
1830 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1832 && current_class_ref)
1833 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1837 tree representative_fn;
1839 representative_fn = BASELINK_FUNCTIONS (fn);
1840 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1841 representative_fn = TREE_OPERAND (representative_fn, 0);
1842 representative_fn = get_first_fn (representative_fn);
1843 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1846 if (processing_template_decl)
1848 if (type_dependent_expression_p (object))
1849 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1850 object = build_non_dependent_expr (object);
1853 result = build_new_method_call (object, fn, args, NULL_TREE,
1855 ? LOOKUP_NONVIRTUAL : 0),
1858 else if (is_overloaded_fn (fn))
1860 /* If the function is an overloaded builtin, resolve it. */
1861 if (TREE_CODE (fn) == FUNCTION_DECL
1862 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1863 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1864 result = resolve_overloaded_builtin (fn, args);
1867 /* A call to a namespace-scope function. */
1868 result = build_new_function_call (fn, args, koenig_p);
1870 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1873 error ("arguments to destructor are not allowed");
1874 /* Mark the pseudo-destructor call as having side-effects so
1875 that we do not issue warnings about its use. */
1876 result = build1 (NOP_EXPR,
1878 TREE_OPERAND (fn, 0));
1879 TREE_SIDE_EFFECTS (result) = 1;
1881 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1882 /* If the "function" is really an object of class type, it might
1883 have an overloaded `operator ()'. */
1884 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1885 /*overloaded_p=*/NULL);
1888 /* A call where the function is unknown. */
1889 result = build_function_call (fn, args);
1891 if (processing_template_decl)
1893 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1894 orig_args, NULL_TREE);
1895 KOENIG_LOOKUP_P (result) = koenig_p;
1900 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1901 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1902 POSTDECREMENT_EXPR.) */
1905 finish_increment_expr (tree expr, enum tree_code code)
1907 return build_x_unary_op (code, expr);
1910 /* Finish a use of `this'. Returns an expression for `this'. */
1913 finish_this_expr (void)
1917 if (current_class_ptr)
1919 result = current_class_ptr;
1921 else if (current_function_decl
1922 && DECL_STATIC_FUNCTION_P (current_function_decl))
1924 error ("%<this%> is unavailable for static member functions");
1925 result = error_mark_node;
1929 if (current_function_decl)
1930 error ("invalid use of %<this%> in non-member function");
1932 error ("invalid use of %<this%> at top level");
1933 result = error_mark_node;
1939 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1940 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1941 the TYPE for the type given. If SCOPE is non-NULL, the expression
1942 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1945 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1947 if (destructor == error_mark_node)
1948 return error_mark_node;
1950 gcc_assert (TYPE_P (destructor));
1952 if (!processing_template_decl)
1954 if (scope == error_mark_node)
1956 error ("invalid qualifying scope in pseudo-destructor name");
1957 return error_mark_node;
1960 /* [expr.pseudo] says both:
1962 The type designated by the pseudo-destructor-name shall be
1963 the same as the object type.
1967 The cv-unqualified versions of the object type and of the
1968 type designated by the pseudo-destructor-name shall be the
1971 We implement the more generous second sentence, since that is
1972 what most other compilers do. */
1973 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1976 error ("%qE is not of type %qT", object, destructor);
1977 return error_mark_node;
1981 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1984 /* Finish an expression of the form CODE EXPR. */
1987 finish_unary_op_expr (enum tree_code code, tree expr)
1989 tree result = build_x_unary_op (code, expr);
1990 /* Inside a template, build_x_unary_op does not fold the
1991 expression. So check whether the result is folded before
1992 setting TREE_NEGATED_INT. */
1993 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1994 && TREE_CODE (result) == INTEGER_CST
1995 && !TYPE_UNSIGNED (TREE_TYPE (result))
1996 && INT_CST_LT (result, integer_zero_node))
1998 /* RESULT may be a cached INTEGER_CST, so we must copy it before
1999 setting TREE_NEGATED_INT. */
2000 result = copy_node (result);
2001 TREE_NEGATED_INT (result) = 1;
2003 overflow_warning (result);
2007 /* Finish a compound-literal expression. TYPE is the type to which
2008 the INITIALIZER_LIST is being cast. */
2011 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
2014 tree compound_literal;
2016 if (!TYPE_OBJ_P (type))
2018 error ("compound literal of non-object type %qT", type);
2019 return error_mark_node;
2022 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2023 compound_literal = build_constructor (NULL_TREE, initializer_list);
2024 if (processing_template_decl)
2026 TREE_TYPE (compound_literal) = type;
2027 /* Mark the expression as a compound literal. */
2028 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2029 return compound_literal;
2032 /* Create a temporary variable to represent the compound literal. */
2033 var = create_temporary_var (type);
2034 if (!current_function_decl)
2036 /* If this compound-literal appears outside of a function, then
2037 the corresponding variable has static storage duration, just
2038 like the variable in whose initializer it appears. */
2039 TREE_STATIC (var) = 1;
2040 /* The variable has internal linkage, since there is no need to
2041 reference it from another translation unit. */
2042 TREE_PUBLIC (var) = 0;
2043 /* It must have a name, so that the name mangler can mangle it. */
2044 DECL_NAME (var) = make_anon_name ();
2046 /* We must call pushdecl, since the gimplifier complains if the
2047 variable has not been declared via a BIND_EXPR. */
2049 /* Initialize the variable as we would any other variable with a
2050 brace-enclosed initializer. */
2051 cp_finish_decl (var, compound_literal,
2052 /*init_const_expr_p=*/false,
2053 /*asmspec_tree=*/NULL_TREE,
2054 LOOKUP_ONLYCONVERTING);
2058 /* Return the declaration for the function-name variable indicated by
2062 finish_fname (tree id)
2066 decl = fname_decl (C_RID_CODE (id), id);
2067 if (processing_template_decl)
2068 decl = DECL_NAME (decl);
2072 /* Finish a translation unit. */
2075 finish_translation_unit (void)
2077 /* In case there were missing closebraces,
2078 get us back to the global binding level. */
2080 while (current_namespace != global_namespace)
2083 /* Do file scope __FUNCTION__ et al. */
2084 finish_fname_decls ();
2087 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2088 Returns the parameter. */
2091 finish_template_type_parm (tree aggr, tree identifier)
2093 if (aggr != class_type_node)
2095 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2096 aggr = class_type_node;
2099 return build_tree_list (aggr, identifier);
2102 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2103 Returns the parameter. */
2106 finish_template_template_parm (tree aggr, tree identifier)
2108 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2109 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2110 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2111 DECL_TEMPLATE_RESULT (tmpl) = decl;
2112 DECL_ARTIFICIAL (decl) = 1;
2113 end_template_decl ();
2115 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2117 return finish_template_type_parm (aggr, tmpl);
2120 /* ARGUMENT is the default-argument value for a template template
2121 parameter. If ARGUMENT is invalid, issue error messages and return
2122 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2125 check_template_template_default_arg (tree argument)
2127 if (TREE_CODE (argument) != TEMPLATE_DECL
2128 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2129 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2131 if (TREE_CODE (argument) == TYPE_DECL)
2132 error ("invalid use of type %qT as a default value for a template "
2133 "template-parameter", TREE_TYPE (argument));
2135 error ("invalid default argument for a template template parameter");
2136 return error_mark_node;
2142 /* Begin a class definition, as indicated by T. */
2145 begin_class_definition (tree t, tree attributes)
2147 if (t == error_mark_node)
2148 return error_mark_node;
2150 if (processing_template_parmlist)
2152 error ("definition of %q#T inside template parameter list", t);
2153 return error_mark_node;
2155 /* A non-implicit typename comes from code like:
2157 template <typename T> struct A {
2158 template <typename U> struct A<T>::B ...
2160 This is erroneous. */
2161 else if (TREE_CODE (t) == TYPENAME_TYPE)
2163 error ("invalid definition of qualified type %qT", t);
2164 t = error_mark_node;
2167 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2169 t = make_aggr_type (RECORD_TYPE);
2170 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2173 /* Update the location of the decl. */
2174 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2176 if (TYPE_BEING_DEFINED (t))
2178 t = make_aggr_type (TREE_CODE (t));
2179 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2181 maybe_process_partial_specialization (t);
2183 TYPE_BEING_DEFINED (t) = 1;
2185 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2187 if (flag_pack_struct)
2190 TYPE_PACKED (t) = 1;
2191 /* Even though the type is being defined for the first time
2192 here, there might have been a forward declaration, so there
2193 might be cv-qualified variants of T. */
2194 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2195 TYPE_PACKED (v) = 1;
2197 /* Reset the interface data, at the earliest possible
2198 moment, as it might have been set via a class foo;
2200 if (! TYPE_ANONYMOUS_P (t))
2202 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2203 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2204 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2205 (t, finfo->interface_unknown);
2207 reset_specialization();
2209 /* Make a declaration for this class in its own scope. */
2210 build_self_reference ();
2215 /* Finish the member declaration given by DECL. */
2218 finish_member_declaration (tree decl)
2220 if (decl == error_mark_node || decl == NULL_TREE)
2223 if (decl == void_type_node)
2224 /* The COMPONENT was a friend, not a member, and so there's
2225 nothing for us to do. */
2228 /* We should see only one DECL at a time. */
2229 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2231 /* Set up access control for DECL. */
2233 = (current_access_specifier == access_private_node);
2234 TREE_PROTECTED (decl)
2235 = (current_access_specifier == access_protected_node);
2236 if (TREE_CODE (decl) == TEMPLATE_DECL)
2238 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2239 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2242 /* Mark the DECL as a member of the current class. */
2243 DECL_CONTEXT (decl) = current_class_type;
2247 A C language linkage is ignored for the names of class members
2248 and the member function type of class member functions. */
2249 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2250 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2252 /* Put functions on the TYPE_METHODS list and everything else on the
2253 TYPE_FIELDS list. Note that these are built up in reverse order.
2254 We reverse them (to obtain declaration order) in finish_struct. */
2255 if (TREE_CODE (decl) == FUNCTION_DECL
2256 || DECL_FUNCTION_TEMPLATE_P (decl))
2258 /* We also need to add this function to the
2259 CLASSTYPE_METHOD_VEC. */
2260 if (add_method (current_class_type, decl, NULL_TREE))
2262 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2263 TYPE_METHODS (current_class_type) = decl;
2265 maybe_add_class_template_decl_list (current_class_type, decl,
2269 /* Enter the DECL into the scope of the class. */
2270 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2271 || pushdecl_class_level (decl))
2273 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2274 go at the beginning. The reason is that lookup_field_1
2275 searches the list in order, and we want a field name to
2276 override a type name so that the "struct stat hack" will
2277 work. In particular:
2279 struct S { enum E { }; int E } s;
2282 is valid. In addition, the FIELD_DECLs must be maintained in
2283 declaration order so that class layout works as expected.
2284 However, we don't need that order until class layout, so we
2285 save a little time by putting FIELD_DECLs on in reverse order
2286 here, and then reversing them in finish_struct_1. (We could
2287 also keep a pointer to the correct insertion points in the
2290 if (TREE_CODE (decl) == TYPE_DECL)
2291 TYPE_FIELDS (current_class_type)
2292 = chainon (TYPE_FIELDS (current_class_type), decl);
2295 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2296 TYPE_FIELDS (current_class_type) = decl;
2299 maybe_add_class_template_decl_list (current_class_type, decl,
2304 note_decl_for_pch (decl);
2307 /* DECL has been declared while we are building a PCH file. Perform
2308 actions that we might normally undertake lazily, but which can be
2309 performed now so that they do not have to be performed in
2310 translation units which include the PCH file. */
2313 note_decl_for_pch (tree decl)
2315 gcc_assert (pch_file);
2317 /* There's a good chance that we'll have to mangle names at some
2318 point, even if only for emission in debugging information. */
2319 if ((TREE_CODE (decl) == VAR_DECL
2320 || TREE_CODE (decl) == FUNCTION_DECL)
2321 && !processing_template_decl)
2325 /* Finish processing a complete template declaration. The PARMS are
2326 the template parameters. */
2329 finish_template_decl (tree parms)
2332 end_template_decl ();
2334 end_specialization ();
2337 /* Finish processing a template-id (which names a type) of the form
2338 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2339 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2340 the scope of template-id indicated. */
2343 finish_template_type (tree name, tree args, int entering_scope)
2347 decl = lookup_template_class (name, args,
2348 NULL_TREE, NULL_TREE, entering_scope,
2349 tf_warning_or_error | tf_user);
2350 if (decl != error_mark_node)
2351 decl = TYPE_STUB_DECL (decl);
2356 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2357 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2358 BASE_CLASS, or NULL_TREE if an error occurred. The
2359 ACCESS_SPECIFIER is one of
2360 access_{default,public,protected_private}_node. For a virtual base
2361 we set TREE_TYPE. */
2364 finish_base_specifier (tree base, tree access, bool virtual_p)
2368 if (base == error_mark_node)
2370 error ("invalid base-class specification");
2373 else if (! is_aggr_type (base, 1))
2377 if (cp_type_quals (base) != 0)
2379 error ("base class %qT has cv qualifiers", base);
2380 base = TYPE_MAIN_VARIANT (base);
2382 result = build_tree_list (access, base);
2384 TREE_TYPE (result) = integer_type_node;
2390 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2391 what we found when we tried to do the lookup. */
2394 qualified_name_lookup_error (tree scope, tree name, tree decl)
2396 if (scope == error_mark_node)
2397 ; /* We already complained. */
2398 else if (TYPE_P (scope))
2400 if (!COMPLETE_TYPE_P (scope))
2401 error ("incomplete type %qT used in nested name specifier", scope);
2402 else if (TREE_CODE (decl) == TREE_LIST)
2404 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2405 print_candidates (decl);
2408 error ("%qD is not a member of %qT", name, scope);
2410 else if (scope != global_namespace)
2411 error ("%qD is not a member of %qD", name, scope);
2413 error ("%<::%D%> has not been declared", name);
2416 /* If FNS is a member function, a set of member functions, or a
2417 template-id referring to one or more member functions, return a
2418 BASELINK for FNS, incorporating the current access context.
2419 Otherwise, return FNS unchanged. */
2422 baselink_for_fns (tree fns)
2427 if (BASELINK_P (fns)
2428 || error_operand_p (fns))
2432 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2433 fn = TREE_OPERAND (fn, 0);
2434 fn = get_first_fn (fn);
2435 if (!DECL_FUNCTION_MEMBER_P (fn))
2438 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2440 cl = DECL_CONTEXT (fn);
2441 cl = TYPE_BINFO (cl);
2442 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2445 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2446 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2447 if non-NULL, is the type or namespace used to explicitly qualify
2448 ID_EXPRESSION. DECL is the entity to which that name has been
2451 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2452 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2453 be set to true if this expression isn't permitted in a
2454 constant-expression, but it is otherwise not set by this function.
2455 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2456 constant-expression, but a non-constant expression is also
2459 DONE is true if this expression is a complete postfix-expression;
2460 it is false if this expression is followed by '->', '[', '(', etc.
2461 ADDRESS_P is true iff this expression is the operand of '&'.
2462 TEMPLATE_P is true iff the qualified-id was of the form
2463 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2464 appears as a template argument.
2466 If an error occurs, and it is the kind of error that might cause
2467 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2468 is the caller's responsibility to issue the message. *ERROR_MSG
2469 will be a string with static storage duration, so the caller need
2472 Return an expression for the entity, after issuing appropriate
2473 diagnostics. This function is also responsible for transforming a
2474 reference to a non-static member into a COMPONENT_REF that makes
2475 the use of "this" explicit.
2477 Upon return, *IDK will be filled in appropriately. */
2480 finish_id_expression (tree id_expression,
2484 bool integral_constant_expression_p,
2485 bool allow_non_integral_constant_expression_p,
2486 bool *non_integral_constant_expression_p,
2490 bool template_arg_p,
2491 const char **error_msg)
2493 /* Initialize the output parameters. */
2494 *idk = CP_ID_KIND_NONE;
2497 if (id_expression == error_mark_node)
2498 return error_mark_node;
2499 /* If we have a template-id, then no further lookup is
2500 required. If the template-id was for a template-class, we
2501 will sometimes have a TYPE_DECL at this point. */
2502 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2503 || TREE_CODE (decl) == TYPE_DECL)
2505 /* Look up the name. */
2508 if (decl == error_mark_node)
2510 /* Name lookup failed. */
2513 || (!dependent_type_p (scope)
2514 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2515 && IDENTIFIER_TYPENAME_P (id_expression)
2516 && dependent_type_p (TREE_TYPE (id_expression))))))
2518 /* If the qualifying type is non-dependent (and the name
2519 does not name a conversion operator to a dependent
2520 type), issue an error. */
2521 qualified_name_lookup_error (scope, id_expression, decl);
2522 return error_mark_node;
2526 /* It may be resolved via Koenig lookup. */
2527 *idk = CP_ID_KIND_UNQUALIFIED;
2528 return id_expression;
2531 decl = id_expression;
2533 /* If DECL is a variable that would be out of scope under
2534 ANSI/ISO rules, but in scope in the ARM, name lookup
2535 will succeed. Issue a diagnostic here. */
2537 decl = check_for_out_of_scope_variable (decl);
2539 /* Remember that the name was used in the definition of
2540 the current class so that we can check later to see if
2541 the meaning would have been different after the class
2542 was entirely defined. */
2543 if (!scope && decl != error_mark_node)
2544 maybe_note_name_used_in_class (id_expression, decl);
2546 /* Disallow uses of local variables from containing functions. */
2547 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2549 tree context = decl_function_context (decl);
2550 if (context != NULL_TREE && context != current_function_decl
2551 && ! TREE_STATIC (decl))
2553 error (TREE_CODE (decl) == VAR_DECL
2554 ? "use of %<auto%> variable from containing function"
2555 : "use of parameter from containing function");
2556 error (" %q+#D declared here", decl);
2557 return error_mark_node;
2562 /* If we didn't find anything, or what we found was a type,
2563 then this wasn't really an id-expression. */
2564 if (TREE_CODE (decl) == TEMPLATE_DECL
2565 && !DECL_FUNCTION_TEMPLATE_P (decl))
2567 *error_msg = "missing template arguments";
2568 return error_mark_node;
2570 else if (TREE_CODE (decl) == TYPE_DECL
2571 || TREE_CODE (decl) == NAMESPACE_DECL)
2573 *error_msg = "expected primary-expression";
2574 return error_mark_node;
2577 /* If the name resolved to a template parameter, there is no
2578 need to look it up again later. */
2579 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2580 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2584 *idk = CP_ID_KIND_NONE;
2585 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2586 decl = TEMPLATE_PARM_DECL (decl);
2587 r = convert_from_reference (DECL_INITIAL (decl));
2589 if (integral_constant_expression_p
2590 && !dependent_type_p (TREE_TYPE (decl))
2591 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2593 if (!allow_non_integral_constant_expression_p)
2594 error ("template parameter %qD of type %qT is not allowed in "
2595 "an integral constant expression because it is not of "
2596 "integral or enumeration type", decl, TREE_TYPE (decl));
2597 *non_integral_constant_expression_p = true;
2601 /* Similarly, we resolve enumeration constants to their
2602 underlying values. */
2603 else if (TREE_CODE (decl) == CONST_DECL)
2605 *idk = CP_ID_KIND_NONE;
2606 if (!processing_template_decl)
2608 used_types_insert (TREE_TYPE (decl));
2609 return DECL_INITIAL (decl);
2617 /* If the declaration was explicitly qualified indicate
2618 that. The semantics of `A::f(3)' are different than
2619 `f(3)' if `f' is virtual. */
2621 ? CP_ID_KIND_QUALIFIED
2622 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2623 ? CP_ID_KIND_TEMPLATE_ID
2624 : CP_ID_KIND_UNQUALIFIED));
2629 An id-expression is type-dependent if it contains an
2630 identifier that was declared with a dependent type.
2632 The standard is not very specific about an id-expression that
2633 names a set of overloaded functions. What if some of them
2634 have dependent types and some of them do not? Presumably,
2635 such a name should be treated as a dependent name. */
2636 /* Assume the name is not dependent. */
2637 dependent_p = false;
2638 if (!processing_template_decl)
2639 /* No names are dependent outside a template. */
2641 /* A template-id where the name of the template was not resolved
2642 is definitely dependent. */
2643 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2644 && (TREE_CODE (TREE_OPERAND (decl, 0))
2645 == IDENTIFIER_NODE))
2647 /* For anything except an overloaded function, just check its
2649 else if (!is_overloaded_fn (decl))
2651 = dependent_type_p (TREE_TYPE (decl));
2652 /* For a set of overloaded functions, check each of the
2658 if (BASELINK_P (fns))
2659 fns = BASELINK_FUNCTIONS (fns);
2661 /* For a template-id, check to see if the template
2662 arguments are dependent. */
2663 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2665 tree args = TREE_OPERAND (fns, 1);
2666 dependent_p = any_dependent_template_arguments_p (args);
2667 /* The functions are those referred to by the
2669 fns = TREE_OPERAND (fns, 0);
2672 /* If there are no dependent template arguments, go through
2673 the overloaded functions. */
2674 while (fns && !dependent_p)
2676 tree fn = OVL_CURRENT (fns);
2678 /* Member functions of dependent classes are
2680 if (TREE_CODE (fn) == FUNCTION_DECL
2681 && type_dependent_expression_p (fn))
2683 else if (TREE_CODE (fn) == TEMPLATE_DECL
2684 && dependent_template_p (fn))
2687 fns = OVL_NEXT (fns);
2691 /* If the name was dependent on a template parameter, we will
2692 resolve the name at instantiation time. */
2695 /* Create a SCOPE_REF for qualified names, if the scope is
2699 /* Since this name was dependent, the expression isn't
2700 constant -- yet. No error is issued because it might
2701 be constant when things are instantiated. */
2702 if (integral_constant_expression_p)
2703 *non_integral_constant_expression_p = true;
2706 if (address_p && done)
2707 decl = finish_qualified_id_expr (scope, decl,
2711 else if (dependent_type_p (scope))
2712 decl = build_qualified_name (/*type=*/NULL_TREE,
2716 else if (DECL_P (decl))
2717 decl = build_qualified_name (TREE_TYPE (decl),
2722 if (TREE_TYPE (decl))
2723 decl = convert_from_reference (decl);
2726 /* A TEMPLATE_ID already contains all the information we
2728 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2729 return id_expression;
2730 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2731 /* If we found a variable, then name lookup during the
2732 instantiation will always resolve to the same VAR_DECL
2733 (or an instantiation thereof). */
2734 if (TREE_CODE (decl) == VAR_DECL
2735 || TREE_CODE (decl) == PARM_DECL)
2736 return convert_from_reference (decl);
2737 /* The same is true for FIELD_DECL, but we also need to
2738 make sure that the syntax is correct. */
2739 else if (TREE_CODE (decl) == FIELD_DECL)
2741 /* Since SCOPE is NULL here, this is an unqualified name.
2742 Access checking has been performed during name lookup
2743 already. Turn off checking to avoid duplicate errors. */
2744 push_deferring_access_checks (dk_no_check);
2745 decl = finish_non_static_data_member
2746 (decl, current_class_ref,
2747 /*qualifying_scope=*/NULL_TREE);
2748 pop_deferring_access_checks ();
2751 return id_expression;
2754 /* Only certain kinds of names are allowed in constant
2755 expression. Enumerators and template parameters have already
2756 been handled above. */
2757 if (integral_constant_expression_p
2758 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2759 && ! builtin_valid_in_constant_expr_p (decl))
2761 if (!allow_non_integral_constant_expression_p)
2763 error ("%qD cannot appear in a constant-expression", decl);
2764 return error_mark_node;
2766 *non_integral_constant_expression_p = true;
2769 if (TREE_CODE (decl) == NAMESPACE_DECL)
2771 error ("use of namespace %qD as expression", decl);
2772 return error_mark_node;
2774 else if (DECL_CLASS_TEMPLATE_P (decl))
2776 error ("use of class template %qT as expression", decl);
2777 return error_mark_node;
2779 else if (TREE_CODE (decl) == TREE_LIST)
2781 /* Ambiguous reference to base members. */
2782 error ("request for member %qD is ambiguous in "
2783 "multiple inheritance lattice", id_expression);
2784 print_candidates (decl);
2785 return error_mark_node;
2788 /* Mark variable-like entities as used. Functions are similarly
2789 marked either below or after overload resolution. */
2790 if (TREE_CODE (decl) == VAR_DECL
2791 || TREE_CODE (decl) == PARM_DECL
2792 || TREE_CODE (decl) == RESULT_DECL)
2797 decl = (adjust_result_of_qualified_name_lookup
2798 (decl, scope, current_class_type));
2800 if (TREE_CODE (decl) == FUNCTION_DECL)
2803 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2804 decl = finish_qualified_id_expr (scope,
2812 tree r = convert_from_reference (decl);
2814 if (processing_template_decl && TYPE_P (scope))
2815 r = build_qualified_name (TREE_TYPE (r),
2821 else if (TREE_CODE (decl) == FIELD_DECL)
2823 /* Since SCOPE is NULL here, this is an unqualified name.
2824 Access checking has been performed during name lookup
2825 already. Turn off checking to avoid duplicate errors. */
2826 push_deferring_access_checks (dk_no_check);
2827 decl = finish_non_static_data_member (decl, current_class_ref,
2828 /*qualifying_scope=*/NULL_TREE);
2829 pop_deferring_access_checks ();
2831 else if (is_overloaded_fn (decl))
2836 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2837 first_fn = TREE_OPERAND (first_fn, 0);
2838 first_fn = get_first_fn (first_fn);
2839 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2840 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2842 if (!really_overloaded_fn (decl))
2843 mark_used (first_fn);
2846 && TREE_CODE (first_fn) == FUNCTION_DECL
2847 && DECL_FUNCTION_MEMBER_P (first_fn)
2848 && !shared_member_p (decl))
2850 /* A set of member functions. */
2851 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2852 return finish_class_member_access_expr (decl, id_expression,
2853 /*template_p=*/false);
2856 decl = baselink_for_fns (decl);
2860 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2861 && DECL_CLASS_SCOPE_P (decl)
2862 && DECL_CONTEXT (decl) != current_class_type)
2866 path = currently_open_derived_class (DECL_CONTEXT (decl));
2867 perform_or_defer_access_check (TYPE_BINFO (path), decl, decl);
2870 decl = convert_from_reference (decl);
2874 if (TREE_DEPRECATED (decl))
2875 warn_deprecated_use (decl);
2880 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2881 use as a type-specifier. */
2884 finish_typeof (tree expr)
2888 if (type_dependent_expression_p (expr))
2890 type = make_aggr_type (TYPEOF_TYPE);
2891 TYPEOF_TYPE_EXPR (type) = expr;
2896 type = TREE_TYPE (expr);
2898 if (!type || type == unknown_type_node)
2900 error ("type of %qE is unknown", expr);
2901 return error_mark_node;
2907 /* Perform C++-specific checks for __builtin_offsetof before calling
2911 finish_offsetof (tree expr)
2913 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
2915 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
2916 TREE_OPERAND (expr, 2));
2917 return error_mark_node;
2919 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
2920 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
2921 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
2923 if (TREE_CODE (expr) == COMPONENT_REF)
2924 expr = TREE_OPERAND (expr, 1);
2925 error ("cannot apply %<offsetof%> to member function %qD", expr);
2926 return error_mark_node;
2928 return fold_offsetof (expr, NULL_TREE);
2931 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2932 with equivalent CALL_EXPRs. */
2935 simplify_aggr_init_exprs_r (tree* tp,
2937 void* data ATTRIBUTE_UNUSED)
2939 /* We don't need to walk into types; there's nothing in a type that
2940 needs simplification. (And, furthermore, there are places we
2941 actively don't want to go. For example, we don't want to wander
2942 into the default arguments for a FUNCTION_DECL that appears in a
2949 /* Only AGGR_INIT_EXPRs are interesting. */
2950 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2953 simplify_aggr_init_expr (tp);
2955 /* Keep iterating. */
2959 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2960 function is broken out from the above for the benefit of the tree-ssa
2964 simplify_aggr_init_expr (tree *tp)
2966 tree aggr_init_expr = *tp;
2968 /* Form an appropriate CALL_EXPR. */
2969 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2970 tree args = TREE_OPERAND (aggr_init_expr, 1);
2971 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2972 tree type = TREE_TYPE (slot);
2975 enum style_t { ctor, arg, pcc } style;
2977 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2979 #ifdef PCC_STATIC_STRUCT_RETURN
2985 gcc_assert (TREE_ADDRESSABLE (type));
2991 /* Replace the first argument to the ctor with the address of the
2995 args = TREE_CHAIN (args);
2996 cxx_mark_addressable (slot);
2997 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2998 args = tree_cons (NULL_TREE, addr, args);
3001 call_expr = build3 (CALL_EXPR,
3002 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3003 fn, args, NULL_TREE);
3007 /* Just mark it addressable here, and leave the rest to
3008 expand_call{,_inline}. */
3009 cxx_mark_addressable (slot);
3010 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3011 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3013 else if (style == pcc)
3015 /* If we're using the non-reentrant PCC calling convention, then we
3016 need to copy the returned value out of the static buffer into the
3018 push_deferring_access_checks (dk_no_check);
3019 call_expr = build_aggr_init (slot, call_expr,
3020 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
3021 pop_deferring_access_checks ();
3022 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3028 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3031 emit_associated_thunks (tree fn)
3033 /* When we use vcall offsets, we emit thunks with the virtual
3034 functions to which they thunk. The whole point of vcall offsets
3035 is so that you can know statically the entire set of thunks that
3036 will ever be needed for a given virtual function, thereby
3037 enabling you to output all the thunks with the function itself. */
3038 if (DECL_VIRTUAL_P (fn))
3042 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3044 if (!THUNK_ALIAS (thunk))
3046 use_thunk (thunk, /*emit_p=*/1);
3047 if (DECL_RESULT_THUNK_P (thunk))
3051 for (probe = DECL_THUNKS (thunk);
3052 probe; probe = TREE_CHAIN (probe))
3053 use_thunk (probe, /*emit_p=*/1);
3057 gcc_assert (!DECL_THUNKS (thunk));
3062 /* Generate RTL for FN. */
3065 expand_body (tree fn)
3067 tree saved_function;
3069 /* Compute the appropriate object-file linkage for inline
3071 if (DECL_DECLARED_INLINE_P (fn))
3072 import_export_decl (fn);
3074 /* If FN is external, then there's no point in generating RTL for
3075 it. This situation can arise with an inline function under
3076 `-fexternal-templates'; we instantiate the function, even though
3077 we're not planning on emitting it, in case we get a chance to
3079 if (DECL_EXTERNAL (fn))
3082 /* ??? When is this needed? */
3083 saved_function = current_function_decl;
3085 /* Emit any thunks that should be emitted at the same time as FN. */
3086 emit_associated_thunks (fn);
3088 /* This function is only called from cgraph, or recursively from
3089 emit_associated_thunks. In neither case should we be currently
3090 generating trees for a function. */
3091 gcc_assert (function_depth == 0);
3093 tree_rest_of_compilation (fn);
3095 current_function_decl = saved_function;
3097 if (DECL_CLONED_FUNCTION_P (fn))
3099 /* If this is a clone, go through the other clones now and mark
3100 their parameters used. We have to do that here, as we don't
3101 know whether any particular clone will be expanded, and
3102 therefore cannot pick one arbitrarily. */
3105 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
3106 probe && DECL_CLONED_FUNCTION_P (probe);
3107 probe = TREE_CHAIN (probe))
3111 for (parms = DECL_ARGUMENTS (probe);
3112 parms; parms = TREE_CHAIN (parms))
3113 TREE_USED (parms) = 1;
3118 /* Generate RTL for FN. */
3121 expand_or_defer_fn (tree fn)
3123 /* When the parser calls us after finishing the body of a template
3124 function, we don't really want to expand the body. */
3125 if (processing_template_decl)
3127 /* Normally, collection only occurs in rest_of_compilation. So,
3128 if we don't collect here, we never collect junk generated
3129 during the processing of templates until we hit a
3130 non-template function. It's not safe to do this inside a
3131 nested class, though, as the parser may have local state that
3132 is not a GC root. */
3133 if (!function_depth)
3138 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3139 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3140 simplify_aggr_init_exprs_r,
3143 /* If this is a constructor or destructor body, we have to clone
3145 if (maybe_clone_body (fn))
3147 /* We don't want to process FN again, so pretend we've written
3148 it out, even though we haven't. */
3149 TREE_ASM_WRITTEN (fn) = 1;
3153 /* If this function is marked with the constructor attribute, add it
3154 to the list of functions to be called along with constructors
3155 from static duration objects. */
3156 if (DECL_STATIC_CONSTRUCTOR (fn))
3157 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
3159 /* If this function is marked with the destructor attribute, add it
3160 to the list of functions to be called along with destructors from
3161 static duration objects. */
3162 if (DECL_STATIC_DESTRUCTOR (fn))
3163 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
3165 /* We make a decision about linkage for these functions at the end
3166 of the compilation. Until that point, we do not want the back
3167 end to output them -- but we do want it to see the bodies of
3168 these functions so that it can inline them as appropriate. */
3169 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3171 if (DECL_INTERFACE_KNOWN (fn))
3172 /* We've already made a decision as to how this function will
3176 DECL_EXTERNAL (fn) = 1;
3177 DECL_NOT_REALLY_EXTERN (fn) = 1;
3178 note_vague_linkage_fn (fn);
3179 /* A non-template inline function with external linkage will
3180 always be COMDAT. As we must eventually determine the
3181 linkage of all functions, and as that causes writes to
3182 the data mapped in from the PCH file, it's advantageous
3183 to mark the functions at this point. */
3184 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3186 /* This function must have external linkage, as
3187 otherwise DECL_INTERFACE_KNOWN would have been
3189 gcc_assert (TREE_PUBLIC (fn));
3190 comdat_linkage (fn);
3191 DECL_INTERFACE_KNOWN (fn) = 1;
3195 import_export_decl (fn);
3197 /* If the user wants us to keep all inline functions, then mark
3198 this function as needed so that finish_file will make sure to
3200 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3204 /* There's no reason to do any of the work here if we're only doing
3205 semantic analysis; this code just generates RTL. */
3206 if (flag_syntax_only)
3211 /* Expand or defer, at the whim of the compilation unit manager. */
3212 cgraph_finalize_function (fn, function_depth > 1);
3224 /* Helper function for walk_tree, used by finalize_nrv below. */
3227 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3229 struct nrv_data *dp = (struct nrv_data *)data;
3232 /* No need to walk into types. There wouldn't be any need to walk into
3233 non-statements, except that we have to consider STMT_EXPRs. */
3236 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3237 but differs from using NULL_TREE in that it indicates that we care
3238 about the value of the RESULT_DECL. */
3239 else if (TREE_CODE (*tp) == RETURN_EXPR)
3240 TREE_OPERAND (*tp, 0) = dp->result;
3241 /* Change all cleanups for the NRV to only run when an exception is
3243 else if (TREE_CODE (*tp) == CLEANUP_STMT
3244 && CLEANUP_DECL (*tp) == dp->var)
3245 CLEANUP_EH_ONLY (*tp) = 1;
3246 /* Replace the DECL_EXPR for the NRV with an initialization of the
3247 RESULT_DECL, if needed. */
3248 else if (TREE_CODE (*tp) == DECL_EXPR
3249 && DECL_EXPR_DECL (*tp) == dp->var)
3252 if (DECL_INITIAL (dp->var)
3253 && DECL_INITIAL (dp->var) != error_mark_node)
3255 init = build2 (INIT_EXPR, void_type_node, dp->result,
3256 DECL_INITIAL (dp->var));
3257 DECL_INITIAL (dp->var) = error_mark_node;
3260 init = build_empty_stmt ();
3261 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3264 /* And replace all uses of the NRV with the RESULT_DECL. */
3265 else if (*tp == dp->var)
3268 /* Avoid walking into the same tree more than once. Unfortunately, we
3269 can't just use walk_tree_without duplicates because it would only call
3270 us for the first occurrence of dp->var in the function body. */
3271 slot = htab_find_slot (dp->visited, *tp, INSERT);
3277 /* Keep iterating. */
3281 /* Called from finish_function to implement the named return value
3282 optimization by overriding all the RETURN_EXPRs and pertinent
3283 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3284 RESULT_DECL for the function. */
3287 finalize_nrv (tree *tp, tree var, tree result)
3289 struct nrv_data data;
3291 /* Copy debugging information from VAR to RESULT. */
3292 DECL_NAME (result) = DECL_NAME (var);
3293 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3294 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3295 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3296 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3297 /* Don't forget that we take its address. */
3298 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3301 data.result = result;
3302 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3303 walk_tree (tp, finalize_nrv_r, &data, 0);
3304 htab_delete (data.visited);
3307 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3308 Remove any elements from the list that are invalid. */
3311 finish_omp_clauses (tree clauses)
3313 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3314 tree c, t, *pc = &clauses;
3317 bitmap_obstack_initialize (NULL);
3318 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3319 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3320 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3322 for (pc = &clauses, c = clauses; c ; c = *pc)
3324 bool remove = false;
3326 switch (OMP_CLAUSE_CODE (c))
3328 case OMP_CLAUSE_SHARED:
3330 goto check_dup_generic;
3331 case OMP_CLAUSE_PRIVATE:
3333 goto check_dup_generic;
3334 case OMP_CLAUSE_REDUCTION:
3336 goto check_dup_generic;
3337 case OMP_CLAUSE_COPYPRIVATE:
3338 name = "copyprivate";
3339 goto check_dup_generic;
3340 case OMP_CLAUSE_COPYIN:
3342 goto check_dup_generic;
3344 t = OMP_CLAUSE_DECL (c);
3345 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3347 if (processing_template_decl)
3349 error ("%qE is not a variable in clause %qs", t, name);
3352 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3353 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3354 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3356 error ("%qE appears more than once in data clauses", t);
3360 bitmap_set_bit (&generic_head, DECL_UID (t));
3363 case OMP_CLAUSE_FIRSTPRIVATE:
3364 t = OMP_CLAUSE_DECL (c);
3365 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3367 if (processing_template_decl)
3369 error ("%qE is not a variable in clause %<firstprivate%>", t);
3372 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3373 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3375 error ("%qE appears more than once in data clauses", t);
3379 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3382 case OMP_CLAUSE_LASTPRIVATE:
3383 t = OMP_CLAUSE_DECL (c);
3384 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3386 if (processing_template_decl)
3388 error ("%qE is not a variable in clause %<lastprivate%>", t);
3391 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3392 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3394 error ("%qE appears more than once in data clauses", t);
3398 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3402 t = OMP_CLAUSE_IF_EXPR (c);
3403 t = maybe_convert_cond (t);
3404 if (t == error_mark_node)
3406 OMP_CLAUSE_IF_EXPR (c) = t;
3409 case OMP_CLAUSE_NUM_THREADS:
3410 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3411 if (t == error_mark_node)
3413 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3414 && !type_dependent_expression_p (t))
3416 error ("num_threads expression must be integral");
3421 case OMP_CLAUSE_SCHEDULE:
3422 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3425 else if (t == error_mark_node)
3427 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3428 && !type_dependent_expression_p (t))
3430 error ("schedule chunk size expression must be integral");
3435 case OMP_CLAUSE_NOWAIT:
3436 case OMP_CLAUSE_ORDERED:
3437 case OMP_CLAUSE_DEFAULT:
3445 *pc = OMP_CLAUSE_CHAIN (c);
3447 pc = &OMP_CLAUSE_CHAIN (c);
3450 for (pc = &clauses, c = clauses; c ; c = *pc)
3452 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3453 bool remove = false;
3454 bool need_complete_non_reference = false;
3455 bool need_default_ctor = false;
3456 bool need_copy_ctor = false;
3457 bool need_copy_assignment = false;
3458 bool need_implicitly_determined = false;
3459 tree type, inner_type;
3463 case OMP_CLAUSE_SHARED:
3465 need_implicitly_determined = true;
3467 case OMP_CLAUSE_PRIVATE:
3469 need_complete_non_reference = true;
3470 need_default_ctor = true;
3471 need_implicitly_determined = true;
3473 case OMP_CLAUSE_FIRSTPRIVATE:
3474 name = "firstprivate";
3475 need_complete_non_reference = true;
3476 need_copy_ctor = true;
3477 need_implicitly_determined = true;
3479 case OMP_CLAUSE_LASTPRIVATE:
3480 name = "lastprivate";
3481 need_complete_non_reference = true;
3482 need_copy_assignment = true;
3483 need_implicitly_determined = true;
3485 case OMP_CLAUSE_REDUCTION:
3487 need_implicitly_determined = true;
3489 case OMP_CLAUSE_COPYPRIVATE:
3490 name = "copyprivate";
3491 need_copy_assignment = true;
3493 case OMP_CLAUSE_COPYIN:
3495 need_copy_assignment = true;
3498 pc = &OMP_CLAUSE_CHAIN (c);
3502 t = OMP_CLAUSE_DECL (c);
3503 if (processing_template_decl
3504 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3506 pc = &OMP_CLAUSE_CHAIN (c);
3512 case OMP_CLAUSE_LASTPRIVATE:
3513 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3514 need_default_ctor = true;
3517 case OMP_CLAUSE_REDUCTION:
3518 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3519 || POINTER_TYPE_P (TREE_TYPE (t)))
3521 error ("%qE has invalid type for %<reduction%>", t);
3524 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3526 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3534 error ("%qE has invalid type for %<reduction(%s)%>",
3535 t, operator_name_info[r_code].name);
3541 case OMP_CLAUSE_COPYIN:
3542 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3544 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3553 if (need_complete_non_reference)
3555 t = require_complete_type (t);
3556 if (t == error_mark_node)
3558 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3560 error ("%qE has reference type for %qs", t, name);
3564 if (need_implicitly_determined)
3566 const char *share_name = NULL;
3568 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3569 share_name = "threadprivate";
3570 else switch (cxx_omp_predetermined_sharing (t))
3572 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3574 case OMP_CLAUSE_DEFAULT_SHARED:
3575 share_name = "shared";
3577 case OMP_CLAUSE_DEFAULT_PRIVATE:
3578 share_name = "private";
3585 error ("%qE is predetermined %qs for %qs",
3586 t, share_name, name);
3591 /* We're interested in the base element, not arrays. */
3592 inner_type = type = TREE_TYPE (t);
3593 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3594 inner_type = TREE_TYPE (inner_type);
3596 /* Check for special function availability by building a call to one.
3597 Save the results, because later we won't be in the right context
3598 for making these queries. */
3599 if (CLASS_TYPE_P (inner_type)
3600 && (need_default_ctor || need_copy_ctor || need_copy_assignment))
3602 int save_errorcount = errorcount;
3605 /* Always allocate 3 elements for simplicity. These are the
3606 function decls for the ctor, dtor, and assignment op.
3607 This layout is known to the three lang hooks,
3608 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3609 and cxx_omp_clause_assign_op. */
3610 info = make_tree_vec (3);
3611 CP_OMP_CLAUSE_INFO (c) = info;
3613 if (need_default_ctor
3615 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type)))
3617 if (need_default_ctor)
3621 t = build_int_cst (build_pointer_type (inner_type), 0);
3622 t = build1 (INDIRECT_REF, inner_type, t);
3623 t = build_tree_list (NULL, t);
3625 t = build_special_member_call (NULL_TREE,
3626 complete_ctor_identifier,
3627 t, inner_type, LOOKUP_NORMAL);
3628 t = get_callee_fndecl (t);
3629 TREE_VEC_ELT (info, 0) = t;
3632 if ((need_default_ctor || need_copy_ctor)
3633 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type))
3635 t = build_int_cst (build_pointer_type (inner_type), 0);
3636 t = build1 (INDIRECT_REF, inner_type, t);
3637 t = build_special_member_call (t, complete_dtor_identifier,
3638 NULL, inner_type, LOOKUP_NORMAL);
3639 t = get_callee_fndecl (t);
3640 TREE_VEC_ELT (info, 1) = t;
3643 if (need_copy_assignment
3644 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type))
3646 t = build_int_cst (build_pointer_type (inner_type), 0);
3647 t = build1 (INDIRECT_REF, inner_type, t);
3648 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3649 build_tree_list (NULL, t),
3650 inner_type, LOOKUP_NORMAL);
3652 /* We'll have called convert_from_reference on the call, which
3653 may well have added an indirect_ref. It's unneeded here,
3654 and in the way, so kill it. */
3655 if (TREE_CODE (t) == INDIRECT_REF)
3656 t = TREE_OPERAND (t, 0);
3658 t = get_callee_fndecl (t);
3659 TREE_VEC_ELT (info, 2) = t;
3662 if (errorcount != save_errorcount)
3667 *pc = OMP_CLAUSE_CHAIN (c);
3669 pc = &OMP_CLAUSE_CHAIN (c);
3672 bitmap_obstack_release (NULL);
3676 /* For all variables in the tree_list VARS, mark them as thread local. */
3679 finish_omp_threadprivate (tree vars)
3683 /* Mark every variable in VARS to be assigned thread local storage. */
3684 for (t = vars; t; t = TREE_CHAIN (t))
3686 tree v = TREE_PURPOSE (t);
3688 /* If V had already been marked threadprivate, it doesn't matter
3689 whether it had been used prior to this point. */
3691 && (DECL_LANG_SPECIFIC (v) == NULL
3692 || !CP_DECL_THREADPRIVATE_P (v)))
3693 error ("%qE declared %<threadprivate%> after first use", v);
3694 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3695 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3696 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3697 error ("%<threadprivate%> %qE has incomplete type", v);
3698 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)))
3699 error ("%<threadprivate%> %qE is not file, namespace "
3700 "or block scope variable", v);
3703 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3704 if (DECL_LANG_SPECIFIC (v) == NULL)
3706 retrofit_lang_decl (v);
3708 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3709 after the allocation of the lang_decl structure. */
3710 if (DECL_DISCRIMINATOR_P (v))
3711 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3714 if (! DECL_THREAD_LOCAL_P (v))
3716 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3717 /* If rtl has been already set for this var, call
3718 make_decl_rtl once again, so that encode_section_info
3719 has a chance to look at the new decl flags. */
3720 if (DECL_RTL_SET_P (v))
3723 CP_DECL_THREADPRIVATE_P (v) = 1;
3728 /* Build an OpenMP structured block. */
3731 begin_omp_structured_block (void)
3733 return do_pushlevel (sk_omp);
3737 finish_omp_structured_block (tree block)
3739 return do_poplevel (block);
3742 /* Similarly, except force the retention of the BLOCK. */
3745 begin_omp_parallel (void)
3747 keep_next_level (true);
3748 return begin_omp_structured_block ();
3752 finish_omp_parallel (tree clauses, tree body)
3756 body = finish_omp_structured_block (body);
3758 stmt = make_node (OMP_PARALLEL);
3759 TREE_TYPE (stmt) = void_type_node;
3760 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3761 OMP_PARALLEL_BODY (stmt) = body;
3763 return add_stmt (stmt);
3766 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3767 are directly for their associated operands in the statement. DECL
3768 and INIT are a combo; if DECL is NULL then INIT ought to be a
3769 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3770 optional statements that need to go before the loop into its
3774 finish_omp_for (location_t locus, tree decl, tree init, tree cond,
3775 tree incr, tree body, tree pre_body)
3780 switch (TREE_CODE (init))
3783 decl = TREE_OPERAND (init, 0);
3784 init = TREE_OPERAND (init, 1);
3787 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
3789 decl = TREE_OPERAND (init, 0);
3790 init = TREE_OPERAND (init, 2);
3799 error ("expected iteration declaration or initialization");
3804 if (type_dependent_expression_p (decl)
3805 || type_dependent_expression_p (init)
3806 || (cond && type_dependent_expression_p (cond))
3807 || (incr && type_dependent_expression_p (incr)))
3813 error ("%Hmissing controlling predicate", &locus);
3819 error ("%Hmissing increment expression", &locus);
3823 stmt = make_node (OMP_FOR);
3825 /* This is really just a place-holder. We'll be decomposing this
3826 again and going through the build_modify_expr path below when
3827 we instantiate the thing. */
3828 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
3830 TREE_TYPE (stmt) = void_type_node;
3831 OMP_FOR_INIT (stmt) = init;
3832 OMP_FOR_COND (stmt) = cond;
3833 OMP_FOR_INCR (stmt) = incr;
3834 OMP_FOR_BODY (stmt) = body;
3835 OMP_FOR_PRE_BODY (stmt) = pre_body;
3837 SET_EXPR_LOCATION (stmt, locus);
3838 return add_stmt (stmt);
3843 error ("expected iteration declaration or initialization");
3847 if (pre_body == NULL || IS_EMPTY_STMT (pre_body))
3849 else if (! processing_template_decl)
3851 add_stmt (pre_body);
3854 init = build_modify_expr (decl, NOP_EXPR, init);
3855 return c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body);
3859 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
3868 dependent_p = false;
3871 /* Even in a template, we can detect invalid uses of the atomic
3872 pragma if neither LHS nor RHS is type-dependent. */
3873 if (processing_template_decl)
3875 dependent_p = (type_dependent_expression_p (lhs)
3876 || type_dependent_expression_p (rhs));
3879 lhs = build_non_dependent_expr (lhs);
3880 rhs = build_non_dependent_expr (rhs);
3885 stmt = c_finish_omp_atomic (code, lhs, rhs);
3886 if (stmt == error_mark_node)
3889 if (processing_template_decl)
3891 stmt = build2 (OMP_ATOMIC, void_type_node, orig_lhs, orig_rhs);
3892 OMP_ATOMIC_DEPENDENT_P (stmt) = 1;
3893 OMP_ATOMIC_CODE (stmt) = code;
3899 finish_omp_barrier (void)
3901 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
3902 tree stmt = finish_call_expr (fn, NULL, false, false);
3903 finish_expr_stmt (stmt);
3907 finish_omp_flush (void)
3909 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
3910 tree stmt = finish_call_expr (fn, NULL, false, false);
3911 finish_expr_stmt (stmt);
3914 /* True if OpenMP sharing attribute of DECL is predetermined. */
3916 enum omp_clause_default_kind
3917 cxx_omp_predetermined_sharing (tree decl)
3919 enum omp_clause_default_kind kind;
3921 kind = c_omp_predetermined_sharing (decl);
3922 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
3925 /* Static data members are predetermined as shared. */
3926 if (TREE_STATIC (decl))
3928 tree ctx = CP_DECL_CONTEXT (decl);
3929 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx))
3930 return OMP_CLAUSE_DEFAULT_SHARED;
3933 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
3937 init_cp_semantics (void)
3941 /* Build a STATIC_ASSERT for a static assertion with the condition
3942 CONDITION and the message text MESSAGE. LOCATION is the location
3943 of the static assertion in the source code. When MEMBER_P, this
3944 static assertion is a member of a class. */
3946 finish_static_assert (tree condition, tree message, location_t location,
3949 if (type_dependent_expression_p (condition)
3950 || value_dependent_expression_p (condition))
3952 /* We're in a template; build a STATIC_ASSERT and put it in
3956 assertion = make_node (STATIC_ASSERT);
3957 STATIC_ASSERT_CONDITION (assertion) = condition;
3958 STATIC_ASSERT_MESSAGE (assertion) = message;
3959 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
3962 maybe_add_class_template_decl_list (current_class_type,
3966 add_stmt (assertion);
3971 /* Fold the expression and convert it to a boolean value. */
3972 condition = fold_non_dependent_expr (condition);
3973 condition = cp_convert (boolean_type_node, condition);
3975 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
3976 /* Do nothing; the condition is satisfied. */
3980 location_t saved_loc = input_location;
3982 input_location = location;
3983 if (TREE_CODE (condition) == INTEGER_CST
3984 && integer_zerop (condition))
3985 /* Report the error. */
3986 error ("static assertion failed: %E", message);
3987 else if (condition && condition != error_mark_node)
3988 error ("non-constant condition for static assertion");
3989 input_location = saved_loc;
3993 #include "gt-cp-semantics.h"