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
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, 59 Temple Place - Suite 330, 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. Since the current g++ parser is
55 lacking in several respects, and will be reimplemented, we are
56 attempting to move most code that is not directly related to
57 parsing into this file; that will make implementing the new parser
58 much easier since it will be able to make use of these routines. */
60 static tree maybe_convert_cond (tree);
61 static tree simplify_aggr_init_exprs_r (tree *, int *, void *);
62 static void emit_associated_thunks (tree);
63 static tree finalize_nrv_r (tree *, int *, void *);
66 /* Deferred Access Checking Overview
67 ---------------------------------
69 Most C++ expressions and declarations require access checking
70 to be performed during parsing. However, in several cases,
71 this has to be treated differently.
73 For member declarations, access checking has to be deferred
74 until more information about the declaration is known. For
86 When we are parsing the function return type `A::X', we don't
87 really know if this is allowed until we parse the function name.
89 Furthermore, some contexts require that access checking is
90 never performed at all. These include class heads, and template
93 Typical use of access checking functions is described here:
95 1. When we enter a context that requires certain access checking
96 mode, the function `push_deferring_access_checks' is called with
97 DEFERRING argument specifying the desired mode. Access checking
98 may be performed immediately (dk_no_deferred), deferred
99 (dk_deferred), or not performed (dk_no_check).
101 2. When a declaration such as a type, or a variable, is encountered,
102 the function `perform_or_defer_access_check' is called. It
103 maintains a TREE_LIST of all deferred checks.
105 3. The global `current_class_type' or `current_function_decl' is then
106 setup by the parser. `enforce_access' relies on these information
109 4. Upon exiting the context mentioned in step 1,
110 `perform_deferred_access_checks' is called to check all declaration
111 stored in the TREE_LIST. `pop_deferring_access_checks' is then
112 called to restore the previous access checking mode.
114 In case of parsing error, we simply call `pop_deferring_access_checks'
115 without `perform_deferred_access_checks'. */
117 typedef struct deferred_access GTY(())
119 /* A TREE_LIST representing name-lookups for which we have deferred
120 checking access controls. We cannot check the accessibility of
121 names used in a decl-specifier-seq until we know what is being
122 declared because code like:
129 A::B* A::f() { return 0; }
131 is valid, even though `A::B' is not generally accessible.
133 The TREE_PURPOSE of each node is the scope used to qualify the
134 name being looked up; the TREE_VALUE is the DECL to which the
135 name was resolved. */
136 tree deferred_access_checks;
138 /* The current mode of access checks. */
139 enum deferring_kind deferring_access_checks_kind;
142 DEF_VEC_GC_O (deferred_access);
144 /* Data for deferred access checking. */
145 static GTY(()) VEC (deferred_access) *deferred_access_stack;
146 static GTY(()) unsigned deferred_access_no_check;
148 /* Save the current deferred access states and start deferred
149 access checking iff DEFER_P is true. */
152 push_deferring_access_checks (deferring_kind deferring)
154 /* For context like template instantiation, access checking
155 disabling applies to all nested context. */
156 if (deferred_access_no_check || deferring == dk_no_check)
157 deferred_access_no_check++;
160 deferred_access *ptr;
162 ptr = VEC_safe_push (deferred_access, deferred_access_stack, NULL);
163 ptr->deferred_access_checks = NULL_TREE;
164 ptr->deferring_access_checks_kind = deferring;
168 /* Resume deferring access checks again after we stopped doing
172 resume_deferring_access_checks (void)
174 if (!deferred_access_no_check)
175 VEC_last (deferred_access, deferred_access_stack)
176 ->deferring_access_checks_kind = dk_deferred;
179 /* Stop deferring access checks. */
182 stop_deferring_access_checks (void)
184 if (!deferred_access_no_check)
185 VEC_last (deferred_access, deferred_access_stack)
186 ->deferring_access_checks_kind = dk_no_deferred;
189 /* Discard the current deferred access checks and restore the
193 pop_deferring_access_checks (void)
195 if (deferred_access_no_check)
196 deferred_access_no_check--;
198 VEC_pop (deferred_access, deferred_access_stack);
201 /* Returns a TREE_LIST representing the deferred checks.
202 The TREE_PURPOSE of each node is the type through which the
203 access occurred; the TREE_VALUE is the declaration named.
207 get_deferred_access_checks (void)
209 if (deferred_access_no_check)
212 return (VEC_last (deferred_access, deferred_access_stack)
213 ->deferred_access_checks);
216 /* Take current deferred checks and combine with the
217 previous states if we also defer checks previously.
218 Otherwise perform checks now. */
221 pop_to_parent_deferring_access_checks (void)
223 if (deferred_access_no_check)
224 deferred_access_no_check--;
228 deferred_access *ptr;
230 checks = (VEC_last (deferred_access, deferred_access_stack)
231 ->deferred_access_checks);
233 VEC_pop (deferred_access, deferred_access_stack);
234 ptr = VEC_last (deferred_access, deferred_access_stack);
235 if (ptr->deferring_access_checks_kind == dk_no_deferred)
238 for (; checks; checks = TREE_CHAIN (checks))
239 enforce_access (TREE_PURPOSE (checks),
240 TREE_VALUE (checks));
244 /* Merge with parent. */
246 tree original = ptr->deferred_access_checks;
248 for (; checks; checks = next)
252 next = TREE_CHAIN (checks);
254 for (probe = original; probe; probe = TREE_CHAIN (probe))
255 if (TREE_VALUE (probe) == TREE_VALUE (checks)
256 && TREE_PURPOSE (probe) == TREE_PURPOSE (checks))
258 /* Insert into parent's checks. */
259 TREE_CHAIN (checks) = ptr->deferred_access_checks;
260 ptr->deferred_access_checks = checks;
267 /* Perform the deferred access checks.
269 After performing the checks, we still have to keep the list
270 `deferred_access_stack->deferred_access_checks' since we may want
271 to check access for them again later in a different context.
278 A::X A::a, x; // No error for `A::a', error for `x'
280 We have to perform deferred access of `A::X', first with `A::a',
284 perform_deferred_access_checks (void)
288 for (deferred_check = get_deferred_access_checks ();
290 deferred_check = TREE_CHAIN (deferred_check))
292 enforce_access (TREE_PURPOSE (deferred_check),
293 TREE_VALUE (deferred_check));
296 /* Defer checking the accessibility of DECL, when looked up in
300 perform_or_defer_access_check (tree binfo, tree decl)
303 deferred_access *ptr;
305 /* Exit if we are in a context that no access checking is performed.
307 if (deferred_access_no_check)
310 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
312 ptr = VEC_last (deferred_access, deferred_access_stack);
314 /* If we are not supposed to defer access checks, just check now. */
315 if (ptr->deferring_access_checks_kind == dk_no_deferred)
317 enforce_access (binfo, decl);
321 /* See if we are already going to perform this check. */
322 for (check = ptr->deferred_access_checks;
324 check = TREE_CHAIN (check))
325 if (TREE_VALUE (check) == decl && TREE_PURPOSE (check) == binfo)
327 /* If not, record the check. */
328 ptr->deferred_access_checks
329 = tree_cons (binfo, decl, ptr->deferred_access_checks);
332 /* Returns nonzero if the current statement is a full expression,
333 i.e. temporaries created during that statement should be destroyed
334 at the end of the statement. */
337 stmts_are_full_exprs_p (void)
339 return current_stmt_tree ()->stmts_are_full_exprs_p;
342 /* Returns the stmt_tree (if any) to which statements are currently
343 being added. If there is no active statement-tree, NULL is
347 current_stmt_tree (void)
350 ? &cfun->language->base.x_stmt_tree
351 : &scope_chain->x_stmt_tree);
354 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
357 maybe_cleanup_point_expr (tree expr)
359 if (!processing_template_decl && stmts_are_full_exprs_p ())
360 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
364 /* Like maybe_cleanup_point_expr except have the type of the new expression be
365 void so we don't need to create a temporary variable to hold the inner
366 expression. The reason why we do this is because the original type might be
367 an aggregate and we cannot create a temporary variable for that type. */
370 maybe_cleanup_point_expr_void (tree expr)
372 if (!processing_template_decl && stmts_are_full_exprs_p ())
373 expr = fold_build_cleanup_point_expr (void_type_node, expr);
379 /* Create a declaration statement for the declaration given by the DECL. */
382 add_decl_expr (tree decl)
384 tree r = build_stmt (DECL_EXPR, decl);
385 if (DECL_INITIAL (decl)
386 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
387 r = maybe_cleanup_point_expr_void (r);
391 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
392 flag for this because "A union for which objects or pointers are
393 declared is not an anonymous union" [class.union]. */
396 anon_aggr_type_p (tree node)
398 return ANON_AGGR_TYPE_P (node);
401 /* Finish a scope. */
404 do_poplevel (tree stmt_list)
408 if (stmts_are_full_exprs_p ())
409 block = poplevel (kept_level_p (), 1, 0);
411 stmt_list = pop_stmt_list (stmt_list);
413 if (!processing_template_decl)
415 stmt_list = c_build_bind_expr (block, stmt_list);
416 /* ??? See c_end_compound_stmt re statement expressions. */
422 /* Begin a new scope. */
425 do_pushlevel (scope_kind sk)
427 tree ret = push_stmt_list ();
428 if (stmts_are_full_exprs_p ())
429 begin_scope (sk, NULL);
433 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
434 when the current scope is exited. EH_ONLY is true when this is not
435 meant to apply to normal control flow transfer. */
438 push_cleanup (tree decl, tree cleanup, bool eh_only)
440 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
441 CLEANUP_EH_ONLY (stmt) = eh_only;
443 CLEANUP_BODY (stmt) = push_stmt_list ();
446 /* Begin a conditional that might contain a declaration. When generating
447 normal code, we want the declaration to appear before the statement
448 containing the conditional. When generating template code, we want the
449 conditional to be rendered as the raw DECL_EXPR. */
452 begin_cond (tree *cond_p)
454 if (processing_template_decl)
455 *cond_p = push_stmt_list ();
458 /* Finish such a conditional. */
461 finish_cond (tree *cond_p, tree expr)
463 if (processing_template_decl)
465 tree cond = pop_stmt_list (*cond_p);
466 if (TREE_CODE (cond) == DECL_EXPR)
472 /* If *COND_P specifies a conditional with a declaration, transform the
475 for (; A x = 42;) { }
477 while (true) { A x = 42; if (!x) break; }
478 for (;;) { A x = 42; if (!x) break; }
479 The statement list for BODY will be empty if the conditional did
480 not declare anything. */
483 simplify_loop_decl_cond (tree *cond_p, tree body)
487 if (!TREE_SIDE_EFFECTS (body))
491 *cond_p = boolean_true_node;
493 if_stmt = begin_if_stmt ();
494 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
495 finish_if_stmt_cond (cond, if_stmt);
496 finish_break_stmt ();
497 finish_then_clause (if_stmt);
498 finish_if_stmt (if_stmt);
501 /* Finish a goto-statement. */
504 finish_goto_stmt (tree destination)
506 if (TREE_CODE (destination) == IDENTIFIER_NODE)
507 destination = lookup_label (destination);
509 /* We warn about unused labels with -Wunused. That means we have to
510 mark the used labels as used. */
511 if (TREE_CODE (destination) == LABEL_DECL)
512 TREE_USED (destination) = 1;
515 /* The DESTINATION is being used as an rvalue. */
516 if (!processing_template_decl)
517 destination = decay_conversion (destination);
518 /* We don't inline calls to functions with computed gotos.
519 Those functions are typically up to some funny business,
520 and may be depending on the labels being at particular
521 addresses, or some such. */
522 DECL_UNINLINABLE (current_function_decl) = 1;
525 check_goto (destination);
527 return add_stmt (build_stmt (GOTO_EXPR, destination));
530 /* COND is the condition-expression for an if, while, etc.,
531 statement. Convert it to a boolean value, if appropriate. */
534 maybe_convert_cond (tree cond)
536 /* Empty conditions remain empty. */
540 /* Wait until we instantiate templates before doing conversion. */
541 if (processing_template_decl)
544 /* Do the conversion. */
545 cond = convert_from_reference (cond);
546 return condition_conversion (cond);
549 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
552 finish_expr_stmt (tree expr)
556 if (expr != NULL_TREE)
558 if (!processing_template_decl)
560 if (warn_sequence_point)
561 verify_sequence_points (expr);
562 expr = convert_to_void (expr, "statement");
564 else if (!type_dependent_expression_p (expr))
565 convert_to_void (build_non_dependent_expr (expr), "statement");
567 /* Simplification of inner statement expressions, compound exprs,
568 etc can result in us already having an EXPR_STMT. */
569 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
571 if (TREE_CODE (expr) != EXPR_STMT)
572 expr = build_stmt (EXPR_STMT, expr);
573 expr = maybe_cleanup_point_expr_void (expr);
585 /* Begin an if-statement. Returns a newly created IF_STMT if
592 scope = do_pushlevel (sk_block);
593 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
594 TREE_CHAIN (r) = scope;
595 begin_cond (&IF_COND (r));
599 /* Process the COND of an if-statement, which may be given by
603 finish_if_stmt_cond (tree cond, tree if_stmt)
605 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
607 THEN_CLAUSE (if_stmt) = push_stmt_list ();
610 /* Finish the then-clause of an if-statement, which may be given by
614 finish_then_clause (tree if_stmt)
616 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
620 /* Begin the else-clause of an if-statement. */
623 begin_else_clause (tree if_stmt)
625 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
628 /* Finish the else-clause of an if-statement, which may be given by
632 finish_else_clause (tree if_stmt)
634 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
637 /* Finish an if-statement. */
640 finish_if_stmt (tree if_stmt)
642 tree scope = TREE_CHAIN (if_stmt);
643 TREE_CHAIN (if_stmt) = NULL;
644 add_stmt (do_poplevel (scope));
648 /* Begin a while-statement. Returns a newly created WHILE_STMT if
652 begin_while_stmt (void)
655 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
657 WHILE_BODY (r) = do_pushlevel (sk_block);
658 begin_cond (&WHILE_COND (r));
662 /* Process the COND of a while-statement, which may be given by
666 finish_while_stmt_cond (tree cond, tree while_stmt)
668 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
669 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
672 /* Finish a while-statement, which may be given by WHILE_STMT. */
675 finish_while_stmt (tree while_stmt)
677 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
681 /* Begin a do-statement. Returns a newly created DO_STMT if
687 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
689 DO_BODY (r) = push_stmt_list ();
693 /* Finish the body of a do-statement, which may be given by DO_STMT. */
696 finish_do_body (tree do_stmt)
698 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
701 /* Finish a do-statement, which may be given by DO_STMT, and whose
702 COND is as indicated. */
705 finish_do_stmt (tree cond, tree do_stmt)
707 cond = maybe_convert_cond (cond);
708 DO_COND (do_stmt) = cond;
712 /* Finish a return-statement. The EXPRESSION returned, if any, is as
716 finish_return_stmt (tree expr)
720 expr = check_return_expr (expr);
721 if (!processing_template_decl)
723 if (DECL_DESTRUCTOR_P (current_function_decl)
724 || (DECL_CONSTRUCTOR_P (current_function_decl)
725 && targetm.cxx.cdtor_returns_this ()))
727 /* Similarly, all destructors must run destructors for
728 base-classes before returning. So, all returns in a
729 destructor get sent to the DTOR_LABEL; finish_function emits
730 code to return a value there. */
731 return finish_goto_stmt (cdtor_label);
735 r = build_stmt (RETURN_EXPR, expr);
736 r = maybe_cleanup_point_expr_void (r);
743 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
746 begin_for_stmt (void)
750 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
751 NULL_TREE, NULL_TREE);
753 if (flag_new_for_scope > 0)
754 TREE_CHAIN (r) = do_pushlevel (sk_for);
756 if (processing_template_decl)
757 FOR_INIT_STMT (r) = push_stmt_list ();
762 /* Finish the for-init-statement of a for-statement, which may be
763 given by FOR_STMT. */
766 finish_for_init_stmt (tree for_stmt)
768 if (processing_template_decl)
769 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
771 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
772 begin_cond (&FOR_COND (for_stmt));
775 /* Finish the COND of a for-statement, which may be given by
779 finish_for_cond (tree cond, tree for_stmt)
781 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
782 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
785 /* Finish the increment-EXPRESSION in a for-statement, which may be
786 given by FOR_STMT. */
789 finish_for_expr (tree expr, tree for_stmt)
793 /* If EXPR is an overloaded function, issue an error; there is no
794 context available to use to perform overload resolution. */
795 if (type_unknown_p (expr))
797 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
798 expr = error_mark_node;
800 if (!processing_template_decl)
802 if (warn_sequence_point)
803 verify_sequence_points (expr);
804 expr = convert_to_void (expr, "3rd expression in for");
806 else if (!type_dependent_expression_p (expr))
807 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for");
808 expr = maybe_cleanup_point_expr_void (expr);
809 FOR_EXPR (for_stmt) = expr;
812 /* Finish the body of a for-statement, which may be given by
813 FOR_STMT. The increment-EXPR for the loop must be
817 finish_for_stmt (tree for_stmt)
819 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
821 /* Pop the scope for the body of the loop. */
822 if (flag_new_for_scope > 0)
824 tree scope = TREE_CHAIN (for_stmt);
825 TREE_CHAIN (for_stmt) = NULL;
826 add_stmt (do_poplevel (scope));
832 /* Finish a break-statement. */
835 finish_break_stmt (void)
837 return add_stmt (build_break_stmt ());
840 /* Finish a continue-statement. */
843 finish_continue_stmt (void)
845 return add_stmt (build_continue_stmt ());
848 /* Begin a switch-statement. Returns a new SWITCH_STMT if
852 begin_switch_stmt (void)
856 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
858 scope = do_pushlevel (sk_block);
859 TREE_CHAIN (r) = scope;
860 begin_cond (&SWITCH_STMT_COND (r));
865 /* Finish the cond of a switch-statement. */
868 finish_switch_cond (tree cond, tree switch_stmt)
870 tree orig_type = NULL;
871 if (!processing_template_decl)
875 /* Convert the condition to an integer or enumeration type. */
876 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
877 if (cond == NULL_TREE)
879 error ("switch quantity not an integer");
880 cond = error_mark_node;
882 orig_type = TREE_TYPE (cond);
883 if (cond != error_mark_node)
887 Integral promotions are performed. */
888 cond = perform_integral_promotions (cond);
889 cond = maybe_cleanup_point_expr (cond);
892 if (cond != error_mark_node)
894 index = get_unwidened (cond, NULL_TREE);
895 /* We can't strip a conversion from a signed type to an unsigned,
896 because if we did, int_fits_type_p would do the wrong thing
897 when checking case values for being in range,
898 and it's too hard to do the right thing. */
899 if (TYPE_UNSIGNED (TREE_TYPE (cond))
900 == TYPE_UNSIGNED (TREE_TYPE (index)))
904 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
905 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
906 add_stmt (switch_stmt);
907 push_switch (switch_stmt);
908 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
911 /* Finish the body of a switch-statement, which may be given by
912 SWITCH_STMT. The COND to switch on is indicated. */
915 finish_switch_stmt (tree switch_stmt)
919 SWITCH_STMT_BODY (switch_stmt) =
920 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
924 scope = TREE_CHAIN (switch_stmt);
925 TREE_CHAIN (switch_stmt) = NULL;
926 add_stmt (do_poplevel (scope));
929 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
933 begin_try_block (void)
935 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
937 TRY_STMTS (r) = push_stmt_list ();
941 /* Likewise, for a function-try-block. */
944 begin_function_try_block (void)
946 tree r = begin_try_block ();
947 FN_TRY_BLOCK_P (r) = 1;
951 /* Finish a try-block, which may be given by TRY_BLOCK. */
954 finish_try_block (tree try_block)
956 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
957 TRY_HANDLERS (try_block) = push_stmt_list ();
960 /* Finish the body of a cleanup try-block, which may be given by
964 finish_cleanup_try_block (tree try_block)
966 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
969 /* Finish an implicitly generated try-block, with a cleanup is given
973 finish_cleanup (tree cleanup, tree try_block)
975 TRY_HANDLERS (try_block) = cleanup;
976 CLEANUP_P (try_block) = 1;
979 /* Likewise, for a function-try-block. */
982 finish_function_try_block (tree try_block)
984 finish_try_block (try_block);
985 /* FIXME : something queer about CTOR_INITIALIZER somehow following
986 the try block, but moving it inside. */
987 in_function_try_handler = 1;
990 /* Finish a handler-sequence for a try-block, which may be given by
994 finish_handler_sequence (tree try_block)
996 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
997 check_handlers (TRY_HANDLERS (try_block));
1000 /* Likewise, for a function-try-block. */
1003 finish_function_handler_sequence (tree try_block)
1005 in_function_try_handler = 0;
1006 finish_handler_sequence (try_block);
1009 /* Begin a handler. Returns a HANDLER if appropriate. */
1012 begin_handler (void)
1016 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1019 /* Create a binding level for the eh_info and the exception object
1021 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1026 /* Finish the handler-parameters for a handler, which may be given by
1027 HANDLER. DECL is the declaration for the catch parameter, or NULL
1028 if this is a `catch (...)' clause. */
1031 finish_handler_parms (tree decl, tree handler)
1033 tree type = NULL_TREE;
1034 if (processing_template_decl)
1038 decl = pushdecl (decl);
1039 decl = push_template_decl (decl);
1040 HANDLER_PARMS (handler) = decl;
1041 type = TREE_TYPE (decl);
1045 type = expand_start_catch_block (decl);
1047 HANDLER_TYPE (handler) = type;
1048 if (!processing_template_decl && type)
1049 mark_used (eh_type_info (type));
1052 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1053 the return value from the matching call to finish_handler_parms. */
1056 finish_handler (tree handler)
1058 if (!processing_template_decl)
1059 expand_end_catch_block ();
1060 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1063 /* Begin a compound statement. FLAGS contains some bits that control the
1064 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1065 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1066 block of a function. If BCS_TRY_BLOCK is set, this is the block
1067 created on behalf of a TRY statement. Returns a token to be passed to
1068 finish_compound_stmt. */
1071 begin_compound_stmt (unsigned int flags)
1075 if (flags & BCS_NO_SCOPE)
1077 r = push_stmt_list ();
1078 STATEMENT_LIST_NO_SCOPE (r) = 1;
1080 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1081 But, if it's a statement-expression with a scopeless block, there's
1082 nothing to keep, and we don't want to accidentally keep a block
1083 *inside* the scopeless block. */
1084 keep_next_level (false);
1087 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1089 /* When processing a template, we need to remember where the braces were,
1090 so that we can set up identical scopes when instantiating the template
1091 later. BIND_EXPR is a handy candidate for this.
1092 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1093 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1094 processing templates. */
1095 if (processing_template_decl)
1097 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1098 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1099 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1100 TREE_SIDE_EFFECTS (r) = 1;
1106 /* Finish a compound-statement, which is given by STMT. */
1109 finish_compound_stmt (tree stmt)
1111 if (TREE_CODE (stmt) == BIND_EXPR)
1112 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1113 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1114 stmt = pop_stmt_list (stmt);
1117 /* Destroy any ObjC "super" receivers that may have been
1119 objc_clear_super_receiver ();
1121 stmt = do_poplevel (stmt);
1124 /* ??? See c_end_compound_stmt wrt statement expressions. */
1129 /* Finish an asm-statement, whose components are a STRING, some
1130 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1131 whether the asm-statement should be considered volatile. */
1134 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1135 tree input_operands, tree clobbers)
1140 if (!processing_template_decl)
1142 int ninputs, noutputs;
1143 const char *constraint;
1144 const char **oconstraints;
1145 bool allows_mem, allows_reg, is_inout;
1149 ninputs = list_length (input_operands);
1150 noutputs = list_length (output_operands);
1151 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1153 string = resolve_asm_operand_names (string, output_operands,
1156 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1158 operand = TREE_VALUE (t);
1160 /* ??? Really, this should not be here. Users should be using a
1161 proper lvalue, dammit. But there's a long history of using
1162 casts in the output operands. In cases like longlong.h, this
1163 becomes a primitive form of typechecking -- if the cast can be
1164 removed, then the output operand had a type of the proper width;
1165 otherwise we'll get an error. Gross, but ... */
1166 STRIP_NOPS (operand);
1168 if (!lvalue_or_else (operand, lv_asm))
1169 operand = error_mark_node;
1171 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1172 oconstraints[i] = constraint;
1174 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1175 &allows_mem, &allows_reg, &is_inout))
1177 /* If the operand is going to end up in memory,
1178 mark it addressable. */
1179 if (!allows_reg && !cxx_mark_addressable (operand))
1180 operand = error_mark_node;
1183 operand = error_mark_node;
1185 TREE_VALUE (t) = operand;
1188 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1190 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1191 operand = decay_conversion (TREE_VALUE (t));
1193 /* If the type of the operand hasn't been determined (e.g.,
1194 because it involves an overloaded function), then issue
1195 an error message. There's no context available to
1196 resolve the overloading. */
1197 if (TREE_TYPE (operand) == unknown_type_node)
1199 error ("type of asm operand %qE could not be determined",
1201 operand = error_mark_node;
1204 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1205 oconstraints, &allows_mem, &allows_reg))
1207 /* If the operand is going to end up in memory,
1208 mark it addressable. */
1209 if (!allows_reg && allows_mem)
1211 /* Strip the nops as we allow this case. FIXME, this really
1212 should be rejected or made deprecated. */
1213 STRIP_NOPS (operand);
1214 if (!cxx_mark_addressable (operand))
1215 operand = error_mark_node;
1219 operand = error_mark_node;
1221 TREE_VALUE (t) = operand;
1225 r = build_stmt (ASM_EXPR, string,
1226 output_operands, input_operands,
1228 ASM_VOLATILE_P (r) = volatile_p;
1229 r = maybe_cleanup_point_expr_void (r);
1230 return add_stmt (r);
1233 /* Finish a label with the indicated NAME. */
1236 finish_label_stmt (tree name)
1238 tree decl = define_label (input_location, name);
1239 return add_stmt (build_stmt (LABEL_EXPR, decl));
1242 /* Finish a series of declarations for local labels. G++ allows users
1243 to declare "local" labels, i.e., labels with scope. This extension
1244 is useful when writing code involving statement-expressions. */
1247 finish_label_decl (tree name)
1249 tree decl = declare_local_label (name);
1250 add_decl_expr (decl);
1253 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1256 finish_decl_cleanup (tree decl, tree cleanup)
1258 push_cleanup (decl, cleanup, false);
1261 /* If the current scope exits with an exception, run CLEANUP. */
1264 finish_eh_cleanup (tree cleanup)
1266 push_cleanup (NULL, cleanup, true);
1269 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1270 order they were written by the user. Each node is as for
1271 emit_mem_initializers. */
1274 finish_mem_initializers (tree mem_inits)
1276 /* Reorder the MEM_INITS so that they are in the order they appeared
1277 in the source program. */
1278 mem_inits = nreverse (mem_inits);
1280 if (processing_template_decl)
1281 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1283 emit_mem_initializers (mem_inits);
1286 /* Finish a parenthesized expression EXPR. */
1289 finish_parenthesized_expr (tree expr)
1292 /* This inhibits warnings in c_common_truthvalue_conversion. */
1293 TREE_NO_WARNING (expr) = 1;
1295 if (TREE_CODE (expr) == OFFSET_REF)
1296 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1297 enclosed in parentheses. */
1298 PTRMEM_OK_P (expr) = 0;
1300 if (TREE_CODE (expr) == STRING_CST)
1301 PAREN_STRING_LITERAL_P (expr) = 1;
1306 /* Finish a reference to a non-static data member (DECL) that is not
1307 preceded by `.' or `->'. */
1310 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1312 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1316 if (current_function_decl
1317 && DECL_STATIC_FUNCTION_P (current_function_decl))
1318 cp_error_at ("invalid use of member %qD in static member function",
1321 cp_error_at ("invalid use of non-static data member %qD", decl);
1322 error ("from this location");
1324 return error_mark_node;
1326 TREE_USED (current_class_ptr) = 1;
1327 if (processing_template_decl && !qualifying_scope)
1329 tree type = TREE_TYPE (decl);
1331 if (TREE_CODE (type) == REFERENCE_TYPE)
1332 type = TREE_TYPE (type);
1335 /* Set the cv qualifiers. */
1336 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1338 if (DECL_MUTABLE_P (decl))
1339 quals &= ~TYPE_QUAL_CONST;
1341 quals |= cp_type_quals (TREE_TYPE (decl));
1342 type = cp_build_qualified_type (type, quals);
1345 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1349 tree access_type = TREE_TYPE (object);
1350 tree lookup_context = context_for_name_lookup (decl);
1352 while (!DERIVED_FROM_P (lookup_context, access_type))
1354 access_type = TYPE_CONTEXT (access_type);
1355 while (access_type && DECL_P (access_type))
1356 access_type = DECL_CONTEXT (access_type);
1360 cp_error_at ("object missing in reference to %qD", decl);
1361 error ("from this location");
1362 return error_mark_node;
1366 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1367 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1369 if (processing_template_decl)
1370 return build_min (SCOPE_REF, TREE_TYPE (decl),
1371 qualifying_scope, DECL_NAME (decl));
1373 perform_or_defer_access_check (TYPE_BINFO (access_type), decl);
1375 /* If the data member was named `C::M', convert `*this' to `C'
1377 if (qualifying_scope)
1379 tree binfo = NULL_TREE;
1380 object = build_scoped_ref (object, qualifying_scope,
1384 return build_class_member_access_expr (object, decl,
1385 /*access_path=*/NULL_TREE,
1386 /*preserve_reference=*/false);
1390 /* DECL was the declaration to which a qualified-id resolved. Issue
1391 an error message if it is not accessible. If OBJECT_TYPE is
1392 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1393 type of `*x', or `x', respectively. If the DECL was named as
1394 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1397 check_accessibility_of_qualified_id (tree decl,
1399 tree nested_name_specifier)
1402 tree qualifying_type = NULL_TREE;
1404 /* If we're not checking, return immediately. */
1405 if (deferred_access_no_check)
1408 /* Determine the SCOPE of DECL. */
1409 scope = context_for_name_lookup (decl);
1410 /* If the SCOPE is not a type, then DECL is not a member. */
1411 if (!TYPE_P (scope))
1413 /* Compute the scope through which DECL is being accessed. */
1415 /* OBJECT_TYPE might not be a class type; consider:
1417 class A { typedef int I; };
1421 In this case, we will have "A::I" as the DECL, but "I" as the
1423 && CLASS_TYPE_P (object_type)
1424 && DERIVED_FROM_P (scope, object_type))
1425 /* If we are processing a `->' or `.' expression, use the type of the
1427 qualifying_type = object_type;
1428 else if (nested_name_specifier)
1430 /* If the reference is to a non-static member of the
1431 current class, treat it as if it were referenced through
1433 if (DECL_NONSTATIC_MEMBER_P (decl)
1434 && current_class_ptr
1435 && DERIVED_FROM_P (scope, current_class_type))
1436 qualifying_type = current_class_type;
1437 /* Otherwise, use the type indicated by the
1438 nested-name-specifier. */
1440 qualifying_type = nested_name_specifier;
1443 /* Otherwise, the name must be from the current class or one of
1445 qualifying_type = currently_open_derived_class (scope);
1447 if (qualifying_type && IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type)))
1448 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1449 or similar in a default argument value. */
1450 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl);
1453 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1454 class named to the left of the "::" operator. DONE is true if this
1455 expression is a complete postfix-expression; it is false if this
1456 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1457 iff this expression is the operand of '&'. */
1460 finish_qualified_id_expr (tree qualifying_class, tree expr, bool done,
1463 if (error_operand_p (expr))
1464 return error_mark_node;
1466 /* If EXPR occurs as the operand of '&', use special handling that
1467 permits a pointer-to-member. */
1468 if (address_p && done)
1470 if (TREE_CODE (expr) == SCOPE_REF)
1471 expr = TREE_OPERAND (expr, 1);
1472 expr = build_offset_ref (qualifying_class, expr,
1473 /*address_p=*/true);
1477 if (TREE_CODE (expr) == FIELD_DECL)
1478 expr = finish_non_static_data_member (expr, current_class_ref,
1480 else if (BASELINK_P (expr) && !processing_template_decl)
1484 /* See if any of the functions are non-static members. */
1485 fns = BASELINK_FUNCTIONS (expr);
1486 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1487 fns = TREE_OPERAND (fns, 0);
1488 /* If so, the expression may be relative to the current
1490 if (!shared_member_p (fns)
1491 && current_class_type
1492 && DERIVED_FROM_P (qualifying_class, current_class_type))
1493 expr = (build_class_member_access_expr
1494 (maybe_dummy_object (qualifying_class, NULL),
1496 BASELINK_ACCESS_BINFO (expr),
1497 /*preserve_reference=*/false));
1499 /* The expression is a qualified name whose address is not
1501 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1507 /* Begin a statement-expression. The value returned must be passed to
1508 finish_stmt_expr. */
1511 begin_stmt_expr (void)
1513 return push_stmt_list ();
1516 /* Process the final expression of a statement expression. EXPR can be
1517 NULL, if the final expression is empty. Build up a TARGET_EXPR so
1518 that the result value can be safely returned to the enclosing
1522 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1524 tree result = NULL_TREE;
1528 if (!processing_template_decl && !VOID_TYPE_P (TREE_TYPE (expr)))
1530 tree type = TREE_TYPE (expr);
1532 if (TREE_CODE (type) == ARRAY_TYPE
1533 || TREE_CODE (type) == FUNCTION_TYPE)
1534 expr = decay_conversion (expr);
1536 expr = require_complete_type (expr);
1538 type = TREE_TYPE (expr);
1540 /* Build a TARGET_EXPR for this aggregate. finish_stmt_expr
1541 will then pull it apart so the lifetime of the target is
1542 within the scope of the expression containing this statement
1544 if (TREE_CODE (expr) == TARGET_EXPR)
1546 else if (!IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_INIT_REF (type))
1547 expr = build_target_expr_with_type (expr, type);
1550 /* Copy construct. */
1551 expr = build_special_member_call
1552 (NULL_TREE, complete_ctor_identifier,
1553 build_tree_list (NULL_TREE, expr),
1554 type, LOOKUP_NORMAL);
1555 expr = build_cplus_new (type, expr);
1556 gcc_assert (TREE_CODE (expr) == TARGET_EXPR);
1560 if (expr != error_mark_node)
1562 result = build_stmt (EXPR_STMT, expr);
1563 EXPR_STMT_STMT_EXPR_RESULT (result) = 1;
1570 /* Remember the last expression so that finish_stmt_expr
1571 can pull it apart. */
1572 TREE_TYPE (stmt_expr) = result;
1577 /* Finish a statement-expression. EXPR should be the value returned
1578 by the previous begin_stmt_expr. Returns an expression
1579 representing the statement-expression. */
1582 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1584 tree result, result_stmt, type;
1585 tree *result_stmt_p = NULL;
1587 result_stmt = TREE_TYPE (stmt_expr);
1588 TREE_TYPE (stmt_expr) = void_type_node;
1589 result = pop_stmt_list (stmt_expr);
1591 if (!result_stmt || VOID_TYPE_P (result_stmt))
1592 type = void_type_node;
1595 /* We need to search the statement expression for the result_stmt,
1596 since we'll need to replace it entirely. */
1598 result_stmt_p = &result;
1602 if (t == result_stmt)
1605 switch (TREE_CODE (t))
1607 case STATEMENT_LIST:
1609 tree_stmt_iterator i = tsi_last (t);
1610 result_stmt_p = tsi_stmt_ptr (i);
1614 result_stmt_p = &BIND_EXPR_BODY (t);
1616 case TRY_FINALLY_EXPR:
1617 case TRY_CATCH_EXPR:
1619 result_stmt_p = &TREE_OPERAND (t, 0);
1625 type = TREE_TYPE (EXPR_STMT_EXPR (result_stmt));
1628 if (processing_template_decl)
1630 result = build_min (STMT_EXPR, type, result);
1631 TREE_SIDE_EFFECTS (result) = 1;
1632 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1634 else if (!VOID_TYPE_P (type))
1636 /* Pull out the TARGET_EXPR that is the final expression. Put
1637 the target's init_expr as the final expression and then put
1638 the statement expression itself as the target's init
1639 expr. Finally, return the target expression. */
1640 tree init, target_expr = EXPR_STMT_EXPR (result_stmt);
1641 gcc_assert (TREE_CODE (target_expr) == TARGET_EXPR);
1643 /* The initializer will be void if the initialization is done by
1644 AGGR_INIT_EXPR; propagate that out to the statement-expression as
1646 init = TREE_OPERAND (target_expr, 1);
1647 type = TREE_TYPE (init);
1649 init = maybe_cleanup_point_expr (init);
1650 *result_stmt_p = init;
1652 if (VOID_TYPE_P (type))
1653 /* No frobbing needed. */;
1654 else if (TREE_CODE (result) == BIND_EXPR)
1656 /* The BIND_EXPR created in finish_compound_stmt is void; if we're
1657 returning a value directly, give it the appropriate type. */
1658 if (VOID_TYPE_P (TREE_TYPE (result)))
1659 TREE_TYPE (result) = type;
1661 gcc_assert (same_type_p (TREE_TYPE (result), type));
1663 else if (TREE_CODE (result) == STATEMENT_LIST)
1664 /* We need to wrap a STATEMENT_LIST in a BIND_EXPR so it can have a
1665 type other than void. FIXME why can't we just return a value
1666 from STATEMENT_LIST? */
1667 result = build3 (BIND_EXPR, type, NULL, result, NULL);
1669 TREE_OPERAND (target_expr, 1) = result;
1670 result = target_expr;
1676 /* Perform Koenig lookup. FN is the postfix-expression representing
1677 the function (or functions) to call; ARGS are the arguments to the
1678 call. Returns the functions to be considered by overload
1682 perform_koenig_lookup (tree fn, tree args)
1684 tree identifier = NULL_TREE;
1685 tree functions = NULL_TREE;
1687 /* Find the name of the overloaded function. */
1688 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1690 else if (is_overloaded_fn (fn))
1693 identifier = DECL_NAME (get_first_fn (functions));
1695 else if (DECL_P (fn))
1698 identifier = DECL_NAME (fn);
1701 /* A call to a namespace-scope function using an unqualified name.
1703 Do Koenig lookup -- unless any of the arguments are
1705 if (!any_type_dependent_arguments_p (args))
1707 fn = lookup_arg_dependent (identifier, functions, args);
1709 /* The unqualified name could not be resolved. */
1710 fn = unqualified_fn_lookup_error (identifier);
1718 /* Generate an expression for `FN (ARGS)'.
1720 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1721 as a virtual call, even if FN is virtual. (This flag is set when
1722 encountering an expression where the function name is explicitly
1723 qualified. For example a call to `X::f' never generates a virtual
1726 Returns code for the call. */
1729 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1735 if (fn == error_mark_node || args == error_mark_node)
1736 return error_mark_node;
1738 /* ARGS should be a list of arguments. */
1739 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1744 if (processing_template_decl)
1746 if (type_dependent_expression_p (fn)
1747 || any_type_dependent_arguments_p (args))
1749 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1750 KOENIG_LOOKUP_P (result) = koenig_p;
1753 if (!BASELINK_P (fn)
1754 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1755 && TREE_TYPE (fn) != unknown_type_node)
1756 fn = build_non_dependent_expr (fn);
1757 args = build_non_dependent_args (orig_args);
1760 /* A reference to a member function will appear as an overloaded
1761 function (rather than a BASELINK) if an unqualified name was used
1763 if (!BASELINK_P (fn) && is_overloaded_fn (fn))
1767 if (TREE_CODE (f) == TEMPLATE_ID_EXPR)
1768 f = TREE_OPERAND (f, 0);
1769 f = get_first_fn (f);
1770 if (DECL_FUNCTION_MEMBER_P (f))
1772 tree type = currently_open_derived_class (DECL_CONTEXT (f));
1774 type = DECL_CONTEXT (f);
1775 fn = build_baselink (TYPE_BINFO (type),
1777 fn, /*optype=*/NULL_TREE);
1782 if (BASELINK_P (fn))
1786 /* A call to a member function. From [over.call.func]:
1788 If the keyword this is in scope and refers to the class of
1789 that member function, or a derived class thereof, then the
1790 function call is transformed into a qualified function call
1791 using (*this) as the postfix-expression to the left of the
1792 . operator.... [Otherwise] a contrived object of type T
1793 becomes the implied object argument.
1795 This paragraph is unclear about this situation:
1797 struct A { void f(); };
1798 struct B : public A {};
1799 struct C : public A { void g() { B::f(); }};
1801 In particular, for `B::f', this paragraph does not make clear
1802 whether "the class of that member function" refers to `A' or
1803 to `B'. We believe it refers to `B'. */
1804 if (current_class_type
1805 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1807 && current_class_ref)
1808 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1812 tree representative_fn;
1814 representative_fn = BASELINK_FUNCTIONS (fn);
1815 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1816 representative_fn = TREE_OPERAND (representative_fn, 0);
1817 representative_fn = get_first_fn (representative_fn);
1818 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1821 if (processing_template_decl)
1823 if (type_dependent_expression_p (object))
1824 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1825 object = build_non_dependent_expr (object);
1828 result = build_new_method_call (object, fn, args, NULL_TREE,
1830 ? LOOKUP_NONVIRTUAL : 0));
1832 else if (is_overloaded_fn (fn))
1833 /* A call to a namespace-scope function. */
1834 result = build_new_function_call (fn, args);
1835 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1838 error ("arguments to destructor are not allowed");
1839 /* Mark the pseudo-destructor call as having side-effects so
1840 that we do not issue warnings about its use. */
1841 result = build1 (NOP_EXPR,
1843 TREE_OPERAND (fn, 0));
1844 TREE_SIDE_EFFECTS (result) = 1;
1846 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1847 /* If the "function" is really an object of class type, it might
1848 have an overloaded `operator ()'. */
1849 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1850 /*overloaded_p=*/NULL);
1852 /* A call where the function is unknown. */
1853 result = build_function_call (fn, args);
1855 if (processing_template_decl)
1857 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1858 orig_args, NULL_TREE);
1859 KOENIG_LOOKUP_P (result) = koenig_p;
1864 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1865 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1866 POSTDECREMENT_EXPR.) */
1869 finish_increment_expr (tree expr, enum tree_code code)
1871 return build_x_unary_op (code, expr);
1874 /* Finish a use of `this'. Returns an expression for `this'. */
1877 finish_this_expr (void)
1881 if (current_class_ptr)
1883 result = current_class_ptr;
1885 else if (current_function_decl
1886 && DECL_STATIC_FUNCTION_P (current_function_decl))
1888 error ("%<this%> is unavailable for static member functions");
1889 result = error_mark_node;
1893 if (current_function_decl)
1894 error ("invalid use of %<this%> in non-member function");
1896 error ("invalid use of %<this%> at top level");
1897 result = error_mark_node;
1903 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1904 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1905 the TYPE for the type given. If SCOPE is non-NULL, the expression
1906 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1909 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1911 if (destructor == error_mark_node)
1912 return error_mark_node;
1914 gcc_assert (TYPE_P (destructor));
1916 if (!processing_template_decl)
1918 if (scope == error_mark_node)
1920 error ("invalid qualifying scope in pseudo-destructor name");
1921 return error_mark_node;
1924 /* [expr.pseudo] says both:
1926 The type designated by the pseudo-destructor-name shall be
1927 the same as the object type.
1931 The cv-unqualified versions of the object type and of the
1932 type designated by the pseudo-destructor-name shall be the
1935 We implement the more generous second sentence, since that is
1936 what most other compilers do. */
1937 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1940 error ("%qE is not of type %qT", object, destructor);
1941 return error_mark_node;
1945 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1948 /* Finish an expression of the form CODE EXPR. */
1951 finish_unary_op_expr (enum tree_code code, tree expr)
1953 tree result = build_x_unary_op (code, expr);
1954 /* Inside a template, build_x_unary_op does not fold the
1955 expression. So check whether the result is folded before
1956 setting TREE_NEGATED_INT. */
1957 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1958 && TREE_CODE (result) == INTEGER_CST
1959 && !TYPE_UNSIGNED (TREE_TYPE (result))
1960 && INT_CST_LT (result, integer_zero_node))
1962 /* RESULT may be a cached INTEGER_CST, so we must copy it before
1963 setting TREE_NEGATED_INT. */
1964 result = copy_node (result);
1965 TREE_NEGATED_INT (result) = 1;
1967 overflow_warning (result);
1971 /* Finish a compound-literal expression. TYPE is the type to which
1972 the INITIALIZER_LIST is being cast. */
1975 finish_compound_literal (tree type, tree initializer_list)
1977 tree compound_literal;
1979 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
1980 compound_literal = build_constructor (NULL_TREE, initializer_list);
1981 /* Mark it as a compound-literal. */
1982 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
1983 if (processing_template_decl)
1984 TREE_TYPE (compound_literal) = type;
1987 /* Check the initialization. */
1988 compound_literal = digest_init (type, compound_literal, NULL);
1989 /* If the TYPE was an array type with an unknown bound, then we can
1990 figure out the dimension now. For example, something like:
1994 implies that the array has two elements. */
1995 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type))
1996 complete_array_type (type, compound_literal, 1);
1999 return compound_literal;
2002 /* Return the declaration for the function-name variable indicated by
2006 finish_fname (tree id)
2010 decl = fname_decl (C_RID_CODE (id), id);
2011 if (processing_template_decl)
2012 decl = DECL_NAME (decl);
2016 /* Finish a translation unit. */
2019 finish_translation_unit (void)
2021 /* In case there were missing closebraces,
2022 get us back to the global binding level. */
2024 while (current_namespace != global_namespace)
2027 /* Do file scope __FUNCTION__ et al. */
2028 finish_fname_decls ();
2031 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2032 Returns the parameter. */
2035 finish_template_type_parm (tree aggr, tree identifier)
2037 if (aggr != class_type_node)
2039 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2040 aggr = class_type_node;
2043 return build_tree_list (aggr, identifier);
2046 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2047 Returns the parameter. */
2050 finish_template_template_parm (tree aggr, tree identifier)
2052 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2053 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2054 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2055 DECL_TEMPLATE_RESULT (tmpl) = decl;
2056 DECL_ARTIFICIAL (decl) = 1;
2057 end_template_decl ();
2059 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2061 return finish_template_type_parm (aggr, tmpl);
2064 /* ARGUMENT is the default-argument value for a template template
2065 parameter. If ARGUMENT is invalid, issue error messages and return
2066 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2069 check_template_template_default_arg (tree argument)
2071 if (TREE_CODE (argument) != TEMPLATE_DECL
2072 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2073 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2075 if (TREE_CODE (argument) == TYPE_DECL)
2077 tree t = TREE_TYPE (argument);
2079 /* Try to emit a slightly smarter error message if we detect
2080 that the user is using a template instantiation. */
2081 if (CLASSTYPE_TEMPLATE_INFO (t)
2082 && CLASSTYPE_TEMPLATE_INSTANTIATION (t))
2083 error ("invalid use of type %qT as a default value for a "
2084 "template template-parameter", t);
2086 error ("invalid use of %qD as a default value for a template "
2087 "template-parameter", argument);
2090 error ("invalid default argument for a template template parameter");
2091 return error_mark_node;
2097 /* Begin a class definition, as indicated by T. */
2100 begin_class_definition (tree t)
2102 if (t == error_mark_node)
2103 return error_mark_node;
2105 if (processing_template_parmlist)
2107 error ("definition of %q#T inside template parameter list", t);
2108 return error_mark_node;
2110 /* A non-implicit typename comes from code like:
2112 template <typename T> struct A {
2113 template <typename U> struct A<T>::B ...
2115 This is erroneous. */
2116 else if (TREE_CODE (t) == TYPENAME_TYPE)
2118 error ("invalid definition of qualified type %qT", t);
2119 t = error_mark_node;
2122 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2124 t = make_aggr_type (RECORD_TYPE);
2125 pushtag (make_anon_name (), t, 0);
2128 /* If this type was already complete, and we see another definition,
2130 if (COMPLETE_TYPE_P (t))
2132 error ("redefinition of %q#T", t);
2133 cp_error_at ("previous definition of %q#T", t);
2134 return error_mark_node;
2137 /* Update the location of the decl. */
2138 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2140 if (TYPE_BEING_DEFINED (t))
2142 t = make_aggr_type (TREE_CODE (t));
2143 pushtag (TYPE_IDENTIFIER (t), t, 0);
2145 maybe_process_partial_specialization (t);
2147 TYPE_BEING_DEFINED (t) = 1;
2148 if (flag_pack_struct)
2151 TYPE_PACKED (t) = 1;
2152 /* Even though the type is being defined for the first time
2153 here, there might have been a forward declaration, so there
2154 might be cv-qualified variants of T. */
2155 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2156 TYPE_PACKED (v) = 1;
2158 /* Reset the interface data, at the earliest possible
2159 moment, as it might have been set via a class foo;
2161 if (! TYPE_ANONYMOUS_P (t))
2163 struct c_fileinfo *finfo = get_fileinfo (lbasename (input_filename));
2164 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2165 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2166 (t, finfo->interface_unknown);
2168 reset_specialization();
2170 /* Make a declaration for this class in its own scope. */
2171 build_self_reference ();
2176 /* Finish the member declaration given by DECL. */
2179 finish_member_declaration (tree decl)
2181 if (decl == error_mark_node || decl == NULL_TREE)
2184 if (decl == void_type_node)
2185 /* The COMPONENT was a friend, not a member, and so there's
2186 nothing for us to do. */
2189 /* We should see only one DECL at a time. */
2190 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2192 /* Set up access control for DECL. */
2194 = (current_access_specifier == access_private_node);
2195 TREE_PROTECTED (decl)
2196 = (current_access_specifier == access_protected_node);
2197 if (TREE_CODE (decl) == TEMPLATE_DECL)
2199 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2200 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2203 /* Mark the DECL as a member of the current class. */
2204 DECL_CONTEXT (decl) = current_class_type;
2208 A C language linkage is ignored for the names of class members
2209 and the member function type of class member functions. */
2210 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2211 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2213 /* Put functions on the TYPE_METHODS list and everything else on the
2214 TYPE_FIELDS list. Note that these are built up in reverse order.
2215 We reverse them (to obtain declaration order) in finish_struct. */
2216 if (TREE_CODE (decl) == FUNCTION_DECL
2217 || DECL_FUNCTION_TEMPLATE_P (decl))
2219 /* We also need to add this function to the
2220 CLASSTYPE_METHOD_VEC. */
2221 add_method (current_class_type, decl);
2223 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2224 TYPE_METHODS (current_class_type) = decl;
2226 maybe_add_class_template_decl_list (current_class_type, decl,
2229 /* Enter the DECL into the scope of the class. */
2230 else if ((TREE_CODE (decl) == USING_DECL && TREE_TYPE (decl))
2231 || pushdecl_class_level (decl))
2233 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2234 go at the beginning. The reason is that lookup_field_1
2235 searches the list in order, and we want a field name to
2236 override a type name so that the "struct stat hack" will
2237 work. In particular:
2239 struct S { enum E { }; int E } s;
2242 is valid. In addition, the FIELD_DECLs must be maintained in
2243 declaration order so that class layout works as expected.
2244 However, we don't need that order until class layout, so we
2245 save a little time by putting FIELD_DECLs on in reverse order
2246 here, and then reversing them in finish_struct_1. (We could
2247 also keep a pointer to the correct insertion points in the
2250 if (TREE_CODE (decl) == TYPE_DECL)
2251 TYPE_FIELDS (current_class_type)
2252 = chainon (TYPE_FIELDS (current_class_type), decl);
2255 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2256 TYPE_FIELDS (current_class_type) = decl;
2259 maybe_add_class_template_decl_list (current_class_type, decl,
2264 note_decl_for_pch (decl);
2267 /* DECL has been declared while we are building a PCH file. Perform
2268 actions that we might normally undertake lazily, but which can be
2269 performed now so that they do not have to be performed in
2270 translation units which include the PCH file. */
2273 note_decl_for_pch (tree decl)
2275 gcc_assert (pch_file);
2277 /* A non-template inline function with external linkage will always
2278 be COMDAT. As we must eventually determine the linkage of all
2279 functions, and as that causes writes to the data mapped in from
2280 the PCH file, it's advantageous to mark the functions at this
2282 if (TREE_CODE (decl) == FUNCTION_DECL
2283 && TREE_PUBLIC (decl)
2284 && DECL_DECLARED_INLINE_P (decl)
2285 && !DECL_IMPLICIT_INSTANTIATION (decl))
2287 comdat_linkage (decl);
2288 DECL_INTERFACE_KNOWN (decl) = 1;
2291 /* There's a good chance that we'll have to mangle names at some
2292 point, even if only for emission in debugging information. */
2293 if (TREE_CODE (decl) == VAR_DECL
2294 || TREE_CODE (decl) == FUNCTION_DECL)
2298 /* Finish processing a complete template declaration. The PARMS are
2299 the template parameters. */
2302 finish_template_decl (tree parms)
2305 end_template_decl ();
2307 end_specialization ();
2310 /* Finish processing a template-id (which names a type) of the form
2311 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2312 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2313 the scope of template-id indicated. */
2316 finish_template_type (tree name, tree args, int entering_scope)
2320 decl = lookup_template_class (name, args,
2321 NULL_TREE, NULL_TREE, entering_scope,
2322 tf_error | tf_warning | tf_user);
2323 if (decl != error_mark_node)
2324 decl = TYPE_STUB_DECL (decl);
2329 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2330 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2331 BASE_CLASS, or NULL_TREE if an error occurred. The
2332 ACCESS_SPECIFIER is one of
2333 access_{default,public,protected_private}_node. For a virtual base
2334 we set TREE_TYPE. */
2337 finish_base_specifier (tree base, tree access, bool virtual_p)
2341 if (base == error_mark_node)
2343 error ("invalid base-class specification");
2346 else if (! is_aggr_type (base, 1))
2350 if (cp_type_quals (base) != 0)
2352 error ("base class %qT has cv qualifiers", base);
2353 base = TYPE_MAIN_VARIANT (base);
2355 result = build_tree_list (access, base);
2357 TREE_TYPE (result) = integer_type_node;
2363 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2364 what we found when we tried to do the lookup. */
2367 qualified_name_lookup_error (tree scope, tree name, tree decl)
2371 if (!COMPLETE_TYPE_P (scope))
2372 error ("incomplete type %qT used in nested name specifier", scope);
2373 else if (TREE_CODE (decl) == TREE_LIST)
2375 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2376 print_candidates (decl);
2379 error ("%qD is not a member of %qT", name, scope);
2381 else if (scope != global_namespace)
2382 error ("%qD is not a member of %qD", name, scope);
2384 error ("%<::%D%> has not been declared", name);
2387 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2388 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2389 if non-NULL, is the type or namespace used to explicitly qualify
2390 ID_EXPRESSION. DECL is the entity to which that name has been
2393 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2394 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2395 be set to true if this expression isn't permitted in a
2396 constant-expression, but it is otherwise not set by this function.
2397 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2398 constant-expression, but a non-constant expression is also
2401 If an error occurs, and it is the kind of error that might cause
2402 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2403 is the caller's responsibility to issue the message. *ERROR_MSG
2404 will be a string with static storage duration, so the caller need
2407 Return an expression for the entity, after issuing appropriate
2408 diagnostics. This function is also responsible for transforming a
2409 reference to a non-static member into a COMPONENT_REF that makes
2410 the use of "this" explicit.
2412 Upon return, *IDK will be filled in appropriately. */
2415 finish_id_expression (tree id_expression,
2419 tree *qualifying_class,
2420 bool integral_constant_expression_p,
2421 bool allow_non_integral_constant_expression_p,
2422 bool *non_integral_constant_expression_p,
2423 const char **error_msg)
2425 /* Initialize the output parameters. */
2426 *idk = CP_ID_KIND_NONE;
2429 if (id_expression == error_mark_node)
2430 return error_mark_node;
2431 /* If we have a template-id, then no further lookup is
2432 required. If the template-id was for a template-class, we
2433 will sometimes have a TYPE_DECL at this point. */
2434 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2435 || TREE_CODE (decl) == TYPE_DECL)
2437 /* Look up the name. */
2440 if (decl == error_mark_node)
2442 /* Name lookup failed. */
2445 || (!dependent_type_p (scope)
2446 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2447 && IDENTIFIER_TYPENAME_P (id_expression)
2448 && dependent_type_p (TREE_TYPE (id_expression))))))
2450 /* If the qualifying type is non-dependent (and the name
2451 does not name a conversion operator to a dependent
2452 type), issue an error. */
2453 qualified_name_lookup_error (scope, id_expression, decl);
2454 return error_mark_node;
2458 /* It may be resolved via Koenig lookup. */
2459 *idk = CP_ID_KIND_UNQUALIFIED;
2460 return id_expression;
2463 decl = id_expression;
2465 /* If DECL is a variable that would be out of scope under
2466 ANSI/ISO rules, but in scope in the ARM, name lookup
2467 will succeed. Issue a diagnostic here. */
2469 decl = check_for_out_of_scope_variable (decl);
2471 /* Remember that the name was used in the definition of
2472 the current class so that we can check later to see if
2473 the meaning would have been different after the class
2474 was entirely defined. */
2475 if (!scope && decl != error_mark_node)
2476 maybe_note_name_used_in_class (id_expression, decl);
2479 /* If we didn't find anything, or what we found was a type,
2480 then this wasn't really an id-expression. */
2481 if (TREE_CODE (decl) == TEMPLATE_DECL
2482 && !DECL_FUNCTION_TEMPLATE_P (decl))
2484 *error_msg = "missing template arguments";
2485 return error_mark_node;
2487 else if (TREE_CODE (decl) == TYPE_DECL
2488 || TREE_CODE (decl) == NAMESPACE_DECL)
2490 *error_msg = "expected primary-expression";
2491 return error_mark_node;
2494 /* If the name resolved to a template parameter, there is no
2495 need to look it up again later. */
2496 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2497 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2501 *idk = CP_ID_KIND_NONE;
2502 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2503 decl = TEMPLATE_PARM_DECL (decl);
2504 r = convert_from_reference (DECL_INITIAL (decl));
2506 if (integral_constant_expression_p
2507 && !dependent_type_p (TREE_TYPE (decl))
2508 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2510 if (!allow_non_integral_constant_expression_p)
2511 error ("template parameter %qD of type %qT is not allowed in "
2512 "an integral constant expression because it is not of "
2513 "integral or enumeration type", decl, TREE_TYPE (decl));
2514 *non_integral_constant_expression_p = true;
2518 /* Similarly, we resolve enumeration constants to their
2519 underlying values. */
2520 else if (TREE_CODE (decl) == CONST_DECL)
2522 *idk = CP_ID_KIND_NONE;
2523 if (!processing_template_decl)
2524 return DECL_INITIAL (decl);
2531 /* If the declaration was explicitly qualified indicate
2532 that. The semantics of `A::f(3)' are different than
2533 `f(3)' if `f' is virtual. */
2535 ? CP_ID_KIND_QUALIFIED
2536 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2537 ? CP_ID_KIND_TEMPLATE_ID
2538 : CP_ID_KIND_UNQUALIFIED));
2543 An id-expression is type-dependent if it contains an
2544 identifier that was declared with a dependent type.
2546 The standard is not very specific about an id-expression that
2547 names a set of overloaded functions. What if some of them
2548 have dependent types and some of them do not? Presumably,
2549 such a name should be treated as a dependent name. */
2550 /* Assume the name is not dependent. */
2551 dependent_p = false;
2552 if (!processing_template_decl)
2553 /* No names are dependent outside a template. */
2555 /* A template-id where the name of the template was not resolved
2556 is definitely dependent. */
2557 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2558 && (TREE_CODE (TREE_OPERAND (decl, 0))
2559 == IDENTIFIER_NODE))
2561 /* For anything except an overloaded function, just check its
2563 else if (!is_overloaded_fn (decl))
2565 = dependent_type_p (TREE_TYPE (decl));
2566 /* For a set of overloaded functions, check each of the
2572 if (BASELINK_P (fns))
2573 fns = BASELINK_FUNCTIONS (fns);
2575 /* For a template-id, check to see if the template
2576 arguments are dependent. */
2577 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2579 tree args = TREE_OPERAND (fns, 1);
2580 dependent_p = any_dependent_template_arguments_p (args);
2581 /* The functions are those referred to by the
2583 fns = TREE_OPERAND (fns, 0);
2586 /* If there are no dependent template arguments, go through
2587 the overloaded functions. */
2588 while (fns && !dependent_p)
2590 tree fn = OVL_CURRENT (fns);
2592 /* Member functions of dependent classes are
2594 if (TREE_CODE (fn) == FUNCTION_DECL
2595 && type_dependent_expression_p (fn))
2597 else if (TREE_CODE (fn) == TEMPLATE_DECL
2598 && dependent_template_p (fn))
2601 fns = OVL_NEXT (fns);
2605 /* If the name was dependent on a template parameter, we will
2606 resolve the name at instantiation time. */
2609 /* Create a SCOPE_REF for qualified names, if the scope is
2614 *qualifying_class = scope;
2615 /* Since this name was dependent, the expression isn't
2616 constant -- yet. No error is issued because it might
2617 be constant when things are instantiated. */
2618 if (integral_constant_expression_p)
2619 *non_integral_constant_expression_p = true;
2620 if (TYPE_P (scope) && dependent_type_p (scope))
2621 return build_nt (SCOPE_REF, scope, id_expression);
2622 else if (TYPE_P (scope) && DECL_P (decl))
2623 return convert_from_reference
2624 (build2 (SCOPE_REF, TREE_TYPE (decl), scope, id_expression));
2626 return convert_from_reference (decl);
2628 /* A TEMPLATE_ID already contains all the information we
2630 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2631 return id_expression;
2632 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2633 /* If we found a variable, then name lookup during the
2634 instantiation will always resolve to the same VAR_DECL
2635 (or an instantiation thereof). */
2636 if (TREE_CODE (decl) == VAR_DECL
2637 || TREE_CODE (decl) == PARM_DECL)
2638 return convert_from_reference (decl);
2639 /* The same is true for FIELD_DECL, but we also need to
2640 make sure that the syntax is correct. */
2641 else if (TREE_CODE (decl) == FIELD_DECL)
2643 /* Since SCOPE is NULL here, this is an unqualified name.
2644 Access checking has been performed during name lookup
2645 already. Turn off checking to avoid duplicate errors. */
2646 push_deferring_access_checks (dk_no_check);
2647 decl = finish_non_static_data_member
2648 (decl, current_class_ref,
2649 /*qualifying_scope=*/NULL_TREE);
2650 pop_deferring_access_checks ();
2653 return id_expression;
2656 /* Only certain kinds of names are allowed in constant
2657 expression. Enumerators and template parameters have already
2658 been handled above. */
2659 if (integral_constant_expression_p
2660 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2661 && ! builtin_valid_in_constant_expr_p (decl))
2663 if (!allow_non_integral_constant_expression_p)
2665 error ("%qD cannot appear in a constant-expression", decl);
2666 return error_mark_node;
2668 *non_integral_constant_expression_p = true;
2671 if (TREE_CODE (decl) == NAMESPACE_DECL)
2673 error ("use of namespace %qD as expression", decl);
2674 return error_mark_node;
2676 else if (DECL_CLASS_TEMPLATE_P (decl))
2678 error ("use of class template %qT as expression", decl);
2679 return error_mark_node;
2681 else if (TREE_CODE (decl) == TREE_LIST)
2683 /* Ambiguous reference to base members. */
2684 error ("request for member %qD is ambiguous in "
2685 "multiple inheritance lattice", id_expression);
2686 print_candidates (decl);
2687 return error_mark_node;
2690 /* Mark variable-like entities as used. Functions are similarly
2691 marked either below or after overload resolution. */
2692 if (TREE_CODE (decl) == VAR_DECL
2693 || TREE_CODE (decl) == PARM_DECL
2694 || TREE_CODE (decl) == RESULT_DECL)
2699 decl = (adjust_result_of_qualified_name_lookup
2700 (decl, scope, current_class_type));
2702 if (TREE_CODE (decl) == FUNCTION_DECL)
2705 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2706 *qualifying_class = scope;
2709 tree r = convert_from_reference (decl);
2711 if (processing_template_decl
2713 r = build2 (SCOPE_REF, TREE_TYPE (r), scope, decl);
2717 else if (TREE_CODE (decl) == FIELD_DECL)
2719 /* Since SCOPE is NULL here, this is an unqualified name.
2720 Access checking has been performed during name lookup
2721 already. Turn off checking to avoid duplicate errors. */
2722 push_deferring_access_checks (dk_no_check);
2723 decl = finish_non_static_data_member (decl, current_class_ref,
2724 /*qualifying_scope=*/NULL_TREE);
2725 pop_deferring_access_checks ();
2727 else if (is_overloaded_fn (decl))
2729 tree first_fn = OVL_CURRENT (decl);
2731 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2732 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2734 if (!really_overloaded_fn (decl))
2735 mark_used (first_fn);
2737 if (TREE_CODE (first_fn) == FUNCTION_DECL
2738 && DECL_FUNCTION_MEMBER_P (first_fn)
2739 && !shared_member_p (decl))
2741 /* A set of member functions. */
2742 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2743 return finish_class_member_access_expr (decl, id_expression);
2748 if (TREE_CODE (decl) == VAR_DECL
2749 || TREE_CODE (decl) == PARM_DECL
2750 || TREE_CODE (decl) == RESULT_DECL)
2752 tree context = decl_function_context (decl);
2754 if (context != NULL_TREE && context != current_function_decl
2755 && ! TREE_STATIC (decl))
2757 error ("use of %s from containing function",
2758 (TREE_CODE (decl) == VAR_DECL
2759 ? "%<auto%> variable" : "parameter"));
2760 cp_error_at (" %q#D declared here", decl);
2761 return error_mark_node;
2765 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2766 && DECL_CLASS_SCOPE_P (decl)
2767 && DECL_CONTEXT (decl) != current_class_type)
2771 path = currently_open_derived_class (DECL_CONTEXT (decl));
2772 perform_or_defer_access_check (TYPE_BINFO (path), decl);
2775 decl = convert_from_reference (decl);
2778 /* Resolve references to variables of anonymous unions
2779 into COMPONENT_REFs. */
2780 if (TREE_CODE (decl) == ALIAS_DECL)
2781 decl = unshare_expr (DECL_INITIAL (decl));
2784 if (TREE_DEPRECATED (decl))
2785 warn_deprecated_use (decl);
2790 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2791 use as a type-specifier. */
2794 finish_typeof (tree expr)
2798 if (type_dependent_expression_p (expr))
2800 type = make_aggr_type (TYPEOF_TYPE);
2801 TYPEOF_TYPE_EXPR (type) = expr;
2806 type = TREE_TYPE (expr);
2808 if (!type || type == unknown_type_node)
2810 error ("type of %qE is unknown", expr);
2811 return error_mark_node;
2817 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2818 with equivalent CALL_EXPRs. */
2821 simplify_aggr_init_exprs_r (tree* tp,
2823 void* data ATTRIBUTE_UNUSED)
2825 /* We don't need to walk into types; there's nothing in a type that
2826 needs simplification. (And, furthermore, there are places we
2827 actively don't want to go. For example, we don't want to wander
2828 into the default arguments for a FUNCTION_DECL that appears in a
2835 /* Only AGGR_INIT_EXPRs are interesting. */
2836 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2839 simplify_aggr_init_expr (tp);
2841 /* Keep iterating. */
2845 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2846 function is broken out from the above for the benefit of the tree-ssa
2850 simplify_aggr_init_expr (tree *tp)
2852 tree aggr_init_expr = *tp;
2854 /* Form an appropriate CALL_EXPR. */
2855 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2856 tree args = TREE_OPERAND (aggr_init_expr, 1);
2857 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2858 tree type = TREE_TYPE (slot);
2861 enum style_t { ctor, arg, pcc } style;
2863 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2865 #ifdef PCC_STATIC_STRUCT_RETURN
2871 gcc_assert (TREE_ADDRESSABLE (type));
2875 if (style == ctor || style == arg)
2877 /* Pass the address of the slot. If this is a constructor, we
2878 replace the first argument; otherwise, we tack on a new one. */
2882 args = TREE_CHAIN (args);
2884 cxx_mark_addressable (slot);
2885 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2888 /* The return type might have different cv-quals from the slot. */
2889 tree fntype = TREE_TYPE (TREE_TYPE (fn));
2891 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
2892 || TREE_CODE (fntype) == METHOD_TYPE);
2893 addr = convert (build_pointer_type (TREE_TYPE (fntype)), addr);
2896 args = tree_cons (NULL_TREE, addr, args);
2899 call_expr = build3 (CALL_EXPR,
2900 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
2901 fn, args, NULL_TREE);
2904 /* Tell the backend that we've added our return slot to the argument
2906 CALL_EXPR_HAS_RETURN_SLOT_ADDR (call_expr) = 1;
2907 else if (style == pcc)
2909 /* If we're using the non-reentrant PCC calling convention, then we
2910 need to copy the returned value out of the static buffer into the
2912 push_deferring_access_checks (dk_no_check);
2913 call_expr = build_aggr_init (slot, call_expr,
2914 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
2915 pop_deferring_access_checks ();
2921 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2924 emit_associated_thunks (tree fn)
2926 /* When we use vcall offsets, we emit thunks with the virtual
2927 functions to which they thunk. The whole point of vcall offsets
2928 is so that you can know statically the entire set of thunks that
2929 will ever be needed for a given virtual function, thereby
2930 enabling you to output all the thunks with the function itself. */
2931 if (DECL_VIRTUAL_P (fn))
2935 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
2937 if (!THUNK_ALIAS (thunk))
2939 use_thunk (thunk, /*emit_p=*/1);
2940 if (DECL_RESULT_THUNK_P (thunk))
2944 for (probe = DECL_THUNKS (thunk);
2945 probe; probe = TREE_CHAIN (probe))
2946 use_thunk (probe, /*emit_p=*/1);
2950 gcc_assert (!DECL_THUNKS (thunk));
2955 /* Generate RTL for FN. */
2958 expand_body (tree fn)
2960 tree saved_function;
2962 /* Compute the appropriate object-file linkage for inline
2964 if (DECL_DECLARED_INLINE_P (fn))
2965 import_export_decl (fn);
2967 /* If FN is external, then there's no point in generating RTL for
2968 it. This situation can arise with an inline function under
2969 `-fexternal-templates'; we instantiate the function, even though
2970 we're not planning on emitting it, in case we get a chance to
2972 if (DECL_EXTERNAL (fn))
2975 /* ??? When is this needed? */
2976 saved_function = current_function_decl;
2978 /* Emit any thunks that should be emitted at the same time as FN. */
2979 emit_associated_thunks (fn);
2981 /* This function is only called from cgraph, or recursively from
2982 emit_associated_thunks. In neither case should we be currently
2983 generating trees for a function. */
2984 gcc_assert (function_depth == 0);
2986 tree_rest_of_compilation (fn);
2988 current_function_decl = saved_function;
2990 if (DECL_CLONED_FUNCTION_P (fn))
2992 /* If this is a clone, go through the other clones now and mark
2993 their parameters used. We have to do that here, as we don't
2994 know whether any particular clone will be expanded, and
2995 therefore cannot pick one arbitrarily. */
2998 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
2999 probe && DECL_CLONED_FUNCTION_P (probe);
3000 probe = TREE_CHAIN (probe))
3004 for (parms = DECL_ARGUMENTS (probe);
3005 parms; parms = TREE_CHAIN (parms))
3006 TREE_USED (parms) = 1;
3011 /* Generate RTL for FN. */
3014 expand_or_defer_fn (tree fn)
3016 /* When the parser calls us after finishing the body of a template
3017 function, we don't really want to expand the body. */
3018 if (processing_template_decl)
3020 /* Normally, collection only occurs in rest_of_compilation. So,
3021 if we don't collect here, we never collect junk generated
3022 during the processing of templates until we hit a
3023 non-template function. */
3028 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3029 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3030 simplify_aggr_init_exprs_r,
3033 /* If this is a constructor or destructor body, we have to clone
3035 if (maybe_clone_body (fn))
3037 /* We don't want to process FN again, so pretend we've written
3038 it out, even though we haven't. */
3039 TREE_ASM_WRITTEN (fn) = 1;
3043 /* If this function is marked with the constructor attribute, add it
3044 to the list of functions to be called along with constructors
3045 from static duration objects. */
3046 if (DECL_STATIC_CONSTRUCTOR (fn))
3047 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
3049 /* If this function is marked with the destructor attribute, add it
3050 to the list of functions to be called along with destructors from
3051 static duration objects. */
3052 if (DECL_STATIC_DESTRUCTOR (fn))
3053 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
3055 /* We make a decision about linkage for these functions at the end
3056 of the compilation. Until that point, we do not want the back
3057 end to output them -- but we do want it to see the bodies of
3058 these functions so that it can inline them as appropriate. */
3059 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3063 DECL_EXTERNAL (fn) = 1;
3064 DECL_NOT_REALLY_EXTERN (fn) = 1;
3065 note_vague_linkage_fn (fn);
3068 import_export_decl (fn);
3070 /* If the user wants us to keep all inline functions, then mark
3071 this function as needed so that finish_file will make sure to
3073 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3077 /* There's no reason to do any of the work here if we're only doing
3078 semantic analysis; this code just generates RTL. */
3079 if (flag_syntax_only)
3084 /* Expand or defer, at the whim of the compilation unit manager. */
3085 cgraph_finalize_function (fn, function_depth > 1);
3097 /* Helper function for walk_tree, used by finalize_nrv below. */
3100 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3102 struct nrv_data *dp = (struct nrv_data *)data;
3105 /* No need to walk into types. There wouldn't be any need to walk into
3106 non-statements, except that we have to consider STMT_EXPRs. */
3109 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3110 but differs from using NULL_TREE in that it indicates that we care
3111 about the value of the RESULT_DECL. */
3112 else if (TREE_CODE (*tp) == RETURN_EXPR)
3113 TREE_OPERAND (*tp, 0) = dp->result;
3114 /* Change all cleanups for the NRV to only run when an exception is
3116 else if (TREE_CODE (*tp) == CLEANUP_STMT
3117 && CLEANUP_DECL (*tp) == dp->var)
3118 CLEANUP_EH_ONLY (*tp) = 1;
3119 /* Replace the DECL_EXPR for the NRV with an initialization of the
3120 RESULT_DECL, if needed. */
3121 else if (TREE_CODE (*tp) == DECL_EXPR
3122 && DECL_EXPR_DECL (*tp) == dp->var)
3125 if (DECL_INITIAL (dp->var)
3126 && DECL_INITIAL (dp->var) != error_mark_node)
3128 init = build2 (INIT_EXPR, void_type_node, dp->result,
3129 DECL_INITIAL (dp->var));
3130 DECL_INITIAL (dp->var) = error_mark_node;
3133 init = build_empty_stmt ();
3134 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3137 /* And replace all uses of the NRV with the RESULT_DECL. */
3138 else if (*tp == dp->var)
3141 /* Avoid walking into the same tree more than once. Unfortunately, we
3142 can't just use walk_tree_without duplicates because it would only call
3143 us for the first occurrence of dp->var in the function body. */
3144 slot = htab_find_slot (dp->visited, *tp, INSERT);
3150 /* Keep iterating. */
3154 /* Called from finish_function to implement the named return value
3155 optimization by overriding all the RETURN_EXPRs and pertinent
3156 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3157 RESULT_DECL for the function. */
3160 finalize_nrv (tree *tp, tree var, tree result)
3162 struct nrv_data data;
3164 /* Copy debugging information from VAR to RESULT. */
3165 DECL_NAME (result) = DECL_NAME (var);
3166 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3167 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3168 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3169 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3170 /* Don't forget that we take its address. */
3171 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3174 data.result = result;
3175 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3176 walk_tree (tp, finalize_nrv_r, &data, 0);
3177 htab_delete (data.visited);
3180 /* Perform initialization related to this module. */
3183 init_cp_semantics (void)
3187 #include "gt-cp-semantics.h"