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
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"
34 #include "tree-inline.h"
35 #include "tree-mudflap.h"
44 #include "diagnostic.h"
46 #include "tree-iterator.h"
50 /* There routines provide a modular interface to perform many parsing
51 operations. They may therefore be used during actual parsing, or
52 during template instantiation, which may be regarded as a
53 degenerate form of parsing. Since the current g++ parser is
54 lacking in several respects, and will be reimplemented, we are
55 attempting to move most code that is not directly related to
56 parsing into this file; that will make implementing the new parser
57 much easier since it will be able to make use of these routines. */
59 static tree maybe_convert_cond (tree);
60 static tree simplify_aggr_init_exprs_r (tree *, int *, void *);
61 static void emit_associated_thunks (tree);
62 static tree finalize_nrv_r (tree *, int *, void *);
65 /* Deferred Access Checking Overview
66 ---------------------------------
68 Most C++ expressions and declarations require access checking
69 to be performed during parsing. However, in several cases,
70 this has to be treated differently.
72 For member declarations, access checking has to be deferred
73 until more information about the declaration is known. For
85 When we are parsing the function return type `A::X', we don't
86 really know if this is allowed until we parse the function name.
88 Furthermore, some contexts require that access checking is
89 never performed at all. These include class heads, and template
92 Typical use of access checking functions is described here:
94 1. When we enter a context that requires certain access checking
95 mode, the function `push_deferring_access_checks' is called with
96 DEFERRING argument specifying the desired mode. Access checking
97 may be performed immediately (dk_no_deferred), deferred
98 (dk_deferred), or not performed (dk_no_check).
100 2. When a declaration such as a type, or a variable, is encountered,
101 the function `perform_or_defer_access_check' is called. It
102 maintains a TREE_LIST of all deferred checks.
104 3. The global `current_class_type' or `current_function_decl' is then
105 setup by the parser. `enforce_access' relies on these information
108 4. Upon exiting the context mentioned in step 1,
109 `perform_deferred_access_checks' is called to check all declaration
110 stored in the TREE_LIST. `pop_deferring_access_checks' is then
111 called to restore the previous access checking mode.
113 In case of parsing error, we simply call `pop_deferring_access_checks'
114 without `perform_deferred_access_checks'. */
116 typedef struct deferred_access GTY(())
118 /* A TREE_LIST representing name-lookups for which we have deferred
119 checking access controls. We cannot check the accessibility of
120 names used in a decl-specifier-seq until we know what is being
121 declared because code like:
128 A::B* A::f() { return 0; }
130 is valid, even though `A::B' is not generally accessible.
132 The TREE_PURPOSE of each node is the scope used to qualify the
133 name being looked up; the TREE_VALUE is the DECL to which the
134 name was resolved. */
135 tree deferred_access_checks;
137 /* The current mode of access checks. */
138 enum deferring_kind deferring_access_checks_kind;
141 DEF_VEC_O (deferred_access);
143 /* Data for deferred access checking. */
144 static GTY(()) VEC (deferred_access) *deferred_access_stack;
145 static GTY(()) unsigned deferred_access_no_check;
147 /* Save the current deferred access states and start deferred
148 access checking iff DEFER_P is true. */
151 push_deferring_access_checks (deferring_kind deferring)
153 /* For context like template instantiation, access checking
154 disabling applies to all nested context. */
155 if (deferred_access_no_check || deferring == dk_no_check)
156 deferred_access_no_check++;
159 deferred_access *ptr;
161 ptr = VEC_safe_push (deferred_access, deferred_access_stack, NULL);
162 ptr->deferred_access_checks = NULL_TREE;
163 ptr->deferring_access_checks_kind = deferring;
167 /* Resume deferring access checks again after we stopped doing
171 resume_deferring_access_checks (void)
173 if (!deferred_access_no_check)
174 VEC_last (deferred_access, deferred_access_stack)
175 ->deferring_access_checks_kind = dk_deferred;
178 /* Stop deferring access checks. */
181 stop_deferring_access_checks (void)
183 if (!deferred_access_no_check)
184 VEC_last (deferred_access, deferred_access_stack)
185 ->deferring_access_checks_kind = dk_no_deferred;
188 /* Discard the current deferred access checks and restore the
192 pop_deferring_access_checks (void)
194 if (deferred_access_no_check)
195 deferred_access_no_check--;
197 VEC_pop (deferred_access, deferred_access_stack);
200 /* Returns a TREE_LIST representing the deferred checks.
201 The TREE_PURPOSE of each node is the type through which the
202 access occurred; the TREE_VALUE is the declaration named.
206 get_deferred_access_checks (void)
208 if (deferred_access_no_check)
211 return (VEC_last (deferred_access, deferred_access_stack)
212 ->deferred_access_checks);
215 /* Take current deferred checks and combine with the
216 previous states if we also defer checks previously.
217 Otherwise perform checks now. */
220 pop_to_parent_deferring_access_checks (void)
222 if (deferred_access_no_check)
223 deferred_access_no_check--;
227 deferred_access *ptr;
229 checks = (VEC_last (deferred_access, deferred_access_stack)
230 ->deferred_access_checks);
232 VEC_pop (deferred_access, deferred_access_stack);
233 ptr = VEC_last (deferred_access, deferred_access_stack);
234 if (ptr->deferring_access_checks_kind == dk_no_deferred)
237 for (; checks; checks = TREE_CHAIN (checks))
238 enforce_access (TREE_PURPOSE (checks),
239 TREE_VALUE (checks));
243 /* Merge with parent. */
245 tree original = ptr->deferred_access_checks;
247 for (; checks; checks = next)
251 next = TREE_CHAIN (checks);
253 for (probe = original; probe; probe = TREE_CHAIN (probe))
254 if (TREE_VALUE (probe) == TREE_VALUE (checks)
255 && TREE_PURPOSE (probe) == TREE_PURPOSE (checks))
257 /* Insert into parent's checks. */
258 TREE_CHAIN (checks) = ptr->deferred_access_checks;
259 ptr->deferred_access_checks = checks;
266 /* Perform the deferred access checks.
268 After performing the checks, we still have to keep the list
269 `deferred_access_stack->deferred_access_checks' since we may want
270 to check access for them again later in a different context.
277 A::X A::a, x; // No error for `A::a', error for `x'
279 We have to perform deferred access of `A::X', first with `A::a',
283 perform_deferred_access_checks (void)
287 for (deferred_check = (VEC_last (deferred_access, deferred_access_stack)
288 ->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 my_friendly_assert (TREE_CODE (binfo) == TREE_BINFO, 20030623);
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 (build1 (CLEANUP_POINT_EXPR, TREE_TYPE (expr), expr));
364 /* Create a declaration statement for the declaration given by the DECL. */
367 add_decl_expr (tree decl)
369 tree r = build_stmt (DECL_EXPR, decl);
370 if (DECL_INITIAL (decl))
371 r = maybe_cleanup_point_expr (r);
375 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
376 flag for this because "A union for which objects or pointers are
377 declared is not an anonymous union" [class.union]. */
380 anon_aggr_type_p (tree node)
382 return ANON_AGGR_TYPE_P (node);
385 /* Finish a scope. */
388 do_poplevel (tree stmt_list)
392 if (stmts_are_full_exprs_p ())
393 block = poplevel (kept_level_p (), 1, 0);
395 stmt_list = pop_stmt_list (stmt_list);
397 if (!processing_template_decl)
399 stmt_list = c_build_bind_expr (block, stmt_list);
400 /* ??? See c_end_compound_stmt re statement expressions. */
406 /* Begin a new scope. */
409 do_pushlevel (scope_kind sk)
411 tree ret = push_stmt_list ();
412 if (stmts_are_full_exprs_p ())
413 begin_scope (sk, NULL);
417 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
418 when the current scope is exited. EH_ONLY is true when this is not
419 meant to apply to normal control flow transfer. */
422 push_cleanup (tree decl, tree cleanup, bool eh_only)
424 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
425 CLEANUP_EH_ONLY (stmt) = eh_only;
427 CLEANUP_BODY (stmt) = push_stmt_list ();
430 /* Begin a conditional that might contain a declaration. When generating
431 normal code, we want the declaration to appear before the statement
432 containing the conditional. When generating template code, we want the
433 conditional to be rendered as the raw DECL_EXPR. */
436 begin_cond (tree *cond_p)
438 if (processing_template_decl)
439 *cond_p = push_stmt_list ();
442 /* Finish such a conditional. */
445 finish_cond (tree *cond_p, tree expr)
447 if (processing_template_decl)
449 tree cond = pop_stmt_list (*cond_p);
450 if (TREE_CODE (cond) == DECL_EXPR)
456 /* If *COND_P specifies a conditional with a declaration, transform the
459 for (; A x = 42;) { }
461 while (true) { A x = 42; if (!x) break; }
462 for (;;) { A x = 42; if (!x) break; }
463 The statement list for BODY will be empty if the conditional did
464 not declare anything. */
467 simplify_loop_decl_cond (tree *cond_p, tree body)
471 if (!TREE_SIDE_EFFECTS (body))
475 *cond_p = boolean_true_node;
477 if_stmt = begin_if_stmt ();
478 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
479 finish_if_stmt_cond (cond, if_stmt);
480 finish_break_stmt ();
481 finish_then_clause (if_stmt);
482 finish_if_stmt (if_stmt);
485 /* Finish a goto-statement. */
488 finish_goto_stmt (tree destination)
490 if (TREE_CODE (destination) == IDENTIFIER_NODE)
491 destination = lookup_label (destination);
493 /* We warn about unused labels with -Wunused. That means we have to
494 mark the used labels as used. */
495 if (TREE_CODE (destination) == LABEL_DECL)
496 TREE_USED (destination) = 1;
499 /* The DESTINATION is being used as an rvalue. */
500 if (!processing_template_decl)
501 destination = decay_conversion (destination);
502 /* We don't inline calls to functions with computed gotos.
503 Those functions are typically up to some funny business,
504 and may be depending on the labels being at particular
505 addresses, or some such. */
506 DECL_UNINLINABLE (current_function_decl) = 1;
509 check_goto (destination);
511 return add_stmt (build_stmt (GOTO_EXPR, destination));
514 /* COND is the condition-expression for an if, while, etc.,
515 statement. Convert it to a boolean value, if appropriate. */
518 maybe_convert_cond (tree cond)
520 /* Empty conditions remain empty. */
524 /* Wait until we instantiate templates before doing conversion. */
525 if (processing_template_decl)
528 /* Do the conversion. */
529 cond = convert_from_reference (cond);
530 return condition_conversion (cond);
533 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
536 finish_expr_stmt (tree expr)
540 if (expr != NULL_TREE)
542 if (!processing_template_decl)
544 if (warn_sequence_point)
545 verify_sequence_points (expr);
546 expr = convert_to_void (expr, "statement");
548 else if (!type_dependent_expression_p (expr))
549 convert_to_void (build_non_dependent_expr (expr), "statement");
551 /* Simplification of inner statement expressions, compound exprs,
552 etc can result in the us already having an EXPR_STMT. */
553 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
555 if (TREE_CODE (expr) != EXPR_STMT)
556 expr = build_stmt (EXPR_STMT, expr);
557 expr = maybe_cleanup_point_expr (expr);
569 /* Begin an if-statement. Returns a newly created IF_STMT if
576 scope = do_pushlevel (sk_block);
577 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
578 TREE_CHAIN (r) = scope;
579 begin_cond (&IF_COND (r));
583 /* Process the COND of an if-statement, which may be given by
587 finish_if_stmt_cond (tree cond, tree if_stmt)
589 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
591 THEN_CLAUSE (if_stmt) = push_stmt_list ();
594 /* Finish the then-clause of an if-statement, which may be given by
598 finish_then_clause (tree if_stmt)
600 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
604 /* Begin the else-clause of an if-statement. */
607 begin_else_clause (tree if_stmt)
609 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
612 /* Finish the else-clause of an if-statement, which may be given by
616 finish_else_clause (tree if_stmt)
618 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
621 /* Finish an if-statement. */
624 finish_if_stmt (tree if_stmt)
626 tree scope = TREE_CHAIN (if_stmt);
627 TREE_CHAIN (if_stmt) = NULL;
628 add_stmt (do_poplevel (scope));
632 /* Begin a while-statement. Returns a newly created WHILE_STMT if
636 begin_while_stmt (void)
639 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
641 WHILE_BODY (r) = do_pushlevel (sk_block);
642 begin_cond (&WHILE_COND (r));
646 /* Process the COND of a while-statement, which may be given by
650 finish_while_stmt_cond (tree cond, tree while_stmt)
652 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
653 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
656 /* Finish a while-statement, which may be given by WHILE_STMT. */
659 finish_while_stmt (tree while_stmt)
661 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
665 /* Begin a do-statement. Returns a newly created DO_STMT if
671 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
673 DO_BODY (r) = push_stmt_list ();
677 /* Finish the body of a do-statement, which may be given by DO_STMT. */
680 finish_do_body (tree do_stmt)
682 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
685 /* Finish a do-statement, which may be given by DO_STMT, and whose
686 COND is as indicated. */
689 finish_do_stmt (tree cond, tree do_stmt)
691 cond = maybe_convert_cond (cond);
692 DO_COND (do_stmt) = cond;
696 /* Finish a return-statement. The EXPRESSION returned, if any, is as
700 finish_return_stmt (tree expr)
704 expr = check_return_expr (expr);
705 if (!processing_template_decl)
707 if (DECL_DESTRUCTOR_P (current_function_decl)
708 || (DECL_CONSTRUCTOR_P (current_function_decl)
709 && targetm.cxx.cdtor_returns_this ()))
711 /* Similarly, all destructors must run destructors for
712 base-classes before returning. So, all returns in a
713 destructor get sent to the DTOR_LABEL; finish_function emits
714 code to return a value there. */
715 return finish_goto_stmt (cdtor_label);
719 r = build_stmt (RETURN_EXPR, expr);
720 r = maybe_cleanup_point_expr (r);
727 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
730 begin_for_stmt (void)
734 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
735 NULL_TREE, NULL_TREE);
737 if (flag_new_for_scope > 0)
738 TREE_CHAIN (r) = do_pushlevel (sk_for);
740 if (processing_template_decl)
741 FOR_INIT_STMT (r) = push_stmt_list ();
746 /* Finish the for-init-statement of a for-statement, which may be
747 given by FOR_STMT. */
750 finish_for_init_stmt (tree for_stmt)
752 if (processing_template_decl)
753 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
755 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
756 begin_cond (&FOR_COND (for_stmt));
759 /* Finish the COND of a for-statement, which may be given by
763 finish_for_cond (tree cond, tree for_stmt)
765 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
766 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
769 /* Finish the increment-EXPRESSION in a for-statement, which may be
770 given by FOR_STMT. */
773 finish_for_expr (tree expr, tree for_stmt)
777 /* If EXPR is an overloaded function, issue an error; there is no
778 context available to use to perform overload resolution. */
779 if (type_unknown_p (expr))
781 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
782 expr = error_mark_node;
784 expr = maybe_cleanup_point_expr (expr);
785 FOR_EXPR (for_stmt) = expr;
788 /* Finish the body of a for-statement, which may be given by
789 FOR_STMT. The increment-EXPR for the loop must be
793 finish_for_stmt (tree for_stmt)
795 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
797 /* Pop the scope for the body of the loop. */
798 if (flag_new_for_scope > 0)
800 tree scope = TREE_CHAIN (for_stmt);
801 TREE_CHAIN (for_stmt) = NULL;
802 add_stmt (do_poplevel (scope));
808 /* Finish a break-statement. */
811 finish_break_stmt (void)
813 return add_stmt (build_break_stmt ());
816 /* Finish a continue-statement. */
819 finish_continue_stmt (void)
821 return add_stmt (build_continue_stmt ());
824 /* Begin a switch-statement. Returns a new SWITCH_STMT if
828 begin_switch_stmt (void)
832 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
834 scope = do_pushlevel (sk_block);
835 TREE_CHAIN (r) = scope;
836 begin_cond (&SWITCH_COND (r));
841 /* Finish the cond of a switch-statement. */
844 finish_switch_cond (tree cond, tree switch_stmt)
846 tree orig_type = NULL;
847 if (!processing_template_decl)
851 /* Convert the condition to an integer or enumeration type. */
852 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
853 if (cond == NULL_TREE)
855 error ("switch quantity not an integer");
856 cond = error_mark_node;
858 orig_type = TREE_TYPE (cond);
859 if (cond != error_mark_node)
863 Integral promotions are performed. */
864 cond = perform_integral_promotions (cond);
865 cond = maybe_cleanup_point_expr (cond);
868 if (cond != error_mark_node)
870 index = get_unwidened (cond, NULL_TREE);
871 /* We can't strip a conversion from a signed type to an unsigned,
872 because if we did, int_fits_type_p would do the wrong thing
873 when checking case values for being in range,
874 and it's too hard to do the right thing. */
875 if (TYPE_UNSIGNED (TREE_TYPE (cond))
876 == TYPE_UNSIGNED (TREE_TYPE (index)))
880 finish_cond (&SWITCH_COND (switch_stmt), cond);
881 SWITCH_TYPE (switch_stmt) = orig_type;
882 add_stmt (switch_stmt);
883 push_switch (switch_stmt);
884 SWITCH_BODY (switch_stmt) = push_stmt_list ();
887 /* Finish the body of a switch-statement, which may be given by
888 SWITCH_STMT. The COND to switch on is indicated. */
891 finish_switch_stmt (tree switch_stmt)
895 SWITCH_BODY (switch_stmt) = pop_stmt_list (SWITCH_BODY (switch_stmt));
899 scope = TREE_CHAIN (switch_stmt);
900 TREE_CHAIN (switch_stmt) = NULL;
901 add_stmt (do_poplevel (scope));
904 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
908 begin_try_block (void)
910 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
912 TRY_STMTS (r) = push_stmt_list ();
916 /* Likewise, for a function-try-block. */
919 begin_function_try_block (void)
921 tree r = begin_try_block ();
922 FN_TRY_BLOCK_P (r) = 1;
926 /* Finish a try-block, which may be given by TRY_BLOCK. */
929 finish_try_block (tree try_block)
931 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
932 TRY_HANDLERS (try_block) = push_stmt_list ();
935 /* Finish the body of a cleanup try-block, which may be given by
939 finish_cleanup_try_block (tree try_block)
941 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
944 /* Finish an implicitly generated try-block, with a cleanup is given
948 finish_cleanup (tree cleanup, tree try_block)
950 TRY_HANDLERS (try_block) = cleanup;
951 CLEANUP_P (try_block) = 1;
954 /* Likewise, for a function-try-block. */
957 finish_function_try_block (tree try_block)
959 finish_try_block (try_block);
960 /* FIXME : something queer about CTOR_INITIALIZER somehow following
961 the try block, but moving it inside. */
962 in_function_try_handler = 1;
965 /* Finish a handler-sequence for a try-block, which may be given by
969 finish_handler_sequence (tree try_block)
971 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
972 check_handlers (TRY_HANDLERS (try_block));
975 /* Likewise, for a function-try-block. */
978 finish_function_handler_sequence (tree try_block)
980 in_function_try_handler = 0;
981 finish_handler_sequence (try_block);
984 /* Begin a handler. Returns a HANDLER if appropriate. */
991 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
994 /* Create a binding level for the eh_info and the exception object
996 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1001 /* Finish the handler-parameters for a handler, which may be given by
1002 HANDLER. DECL is the declaration for the catch parameter, or NULL
1003 if this is a `catch (...)' clause. */
1006 finish_handler_parms (tree decl, tree handler)
1008 tree type = NULL_TREE;
1009 if (processing_template_decl)
1013 decl = pushdecl (decl);
1014 decl = push_template_decl (decl);
1015 HANDLER_PARMS (handler) = decl;
1016 type = TREE_TYPE (decl);
1020 type = expand_start_catch_block (decl);
1022 HANDLER_TYPE (handler) = type;
1023 if (!processing_template_decl && type)
1024 mark_used (eh_type_info (type));
1027 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1028 the return value from the matching call to finish_handler_parms. */
1031 finish_handler (tree handler)
1033 if (!processing_template_decl)
1034 expand_end_catch_block ();
1035 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1038 /* Begin a compound statement. FLAGS contains some bits that control the
1039 behaviour and context. If BCS_NO_SCOPE is set, the compound statement
1040 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1041 block of a function. If BCS_TRY_BLOCK is set, this is the block
1042 created on behalf of a TRY statement. Returns a token to be passed to
1043 finish_compound_stmt. */
1046 begin_compound_stmt (unsigned int flags)
1050 if (flags & BCS_NO_SCOPE)
1052 r = push_stmt_list ();
1053 STATEMENT_LIST_NO_SCOPE (r) = 1;
1055 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1056 But, if it's a statement-expression with a scopeless block, there's
1057 nothing to keep, and we don't want to accidentally keep a block
1058 *inside* the scopeless block. */
1059 keep_next_level (false);
1062 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1064 /* When processing a template, we need to remember where the braces were,
1065 so that we can set up identical scopes when instantiating the template
1066 later. BIND_EXPR is a handy candidate for this.
1067 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1068 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1069 processing templates. */
1070 if (processing_template_decl)
1072 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1073 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1074 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1075 TREE_SIDE_EFFECTS (r) = 1;
1081 /* Finish a compound-statement, which is given by STMT. */
1084 finish_compound_stmt (tree stmt)
1086 if (TREE_CODE (stmt) == BIND_EXPR)
1087 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1088 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1089 stmt = pop_stmt_list (stmt);
1091 stmt = do_poplevel (stmt);
1093 /* ??? See c_end_compound_stmt wrt statement expressions. */
1098 /* Finish an asm-statement, whose components are a STRING, some
1099 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1100 whether the asm-statement should be considered volatile. */
1103 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1104 tree input_operands, tree clobbers)
1109 if (!processing_template_decl)
1115 for (t = input_operands; t; t = TREE_CHAIN (t))
1117 tree converted_operand
1118 = decay_conversion (TREE_VALUE (t));
1120 /* If the type of the operand hasn't been determined (e.g.,
1121 because it involves an overloaded function), then issue
1122 an error message. There's no context available to
1123 resolve the overloading. */
1124 if (TREE_TYPE (converted_operand) == unknown_type_node)
1126 error ("type of asm operand `%E' could not be determined",
1128 converted_operand = error_mark_node;
1130 TREE_VALUE (t) = converted_operand;
1133 ninputs = list_length (input_operands);
1134 noutputs = list_length (output_operands);
1136 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1141 const char *constraint;
1144 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1145 operand = TREE_VALUE (t);
1147 if (!parse_output_constraint (&constraint,
1148 i, ninputs, noutputs,
1153 /* By marking this operand as erroneous, we will not try
1154 to process this operand again in expand_asm_operands. */
1155 TREE_VALUE (t) = error_mark_node;
1159 /* If the operand is a DECL that is going to end up in
1160 memory, assume it is addressable. This is a bit more
1161 conservative than it would ideally be; the exact test is
1162 buried deep in expand_asm_operands and depends on the
1163 DECL_RTL for the OPERAND -- which we don't have at this
1165 if (!allows_reg && DECL_P (operand))
1166 cxx_mark_addressable (operand);
1170 r = build_stmt (ASM_EXPR, string,
1171 output_operands, input_operands,
1173 ASM_VOLATILE_P (r) = volatile_p;
1174 return add_stmt (r);
1177 /* Finish a label with the indicated NAME. */
1180 finish_label_stmt (tree name)
1182 tree decl = define_label (input_location, name);
1183 return add_stmt (build_stmt (LABEL_EXPR, decl));
1186 /* Finish a series of declarations for local labels. G++ allows users
1187 to declare "local" labels, i.e., labels with scope. This extension
1188 is useful when writing code involving statement-expressions. */
1191 finish_label_decl (tree name)
1193 tree decl = declare_local_label (name);
1194 add_decl_expr (decl);
1197 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1200 finish_decl_cleanup (tree decl, tree cleanup)
1202 push_cleanup (decl, cleanup, false);
1205 /* If the current scope exits with an exception, run CLEANUP. */
1208 finish_eh_cleanup (tree cleanup)
1210 push_cleanup (NULL, cleanup, true);
1213 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1214 order they were written by the user. Each node is as for
1215 emit_mem_initializers. */
1218 finish_mem_initializers (tree mem_inits)
1220 /* Reorder the MEM_INITS so that they are in the order they appeared
1221 in the source program. */
1222 mem_inits = nreverse (mem_inits);
1224 if (processing_template_decl)
1225 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1227 emit_mem_initializers (mem_inits);
1230 /* Finish a parenthesized expression EXPR. */
1233 finish_parenthesized_expr (tree expr)
1235 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expr))))
1236 /* This inhibits warnings in c_common_truthvalue_conversion. */
1237 TREE_NO_WARNING (expr) = 1;
1239 if (TREE_CODE (expr) == OFFSET_REF)
1240 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1241 enclosed in parentheses. */
1242 PTRMEM_OK_P (expr) = 0;
1246 /* Finish a reference to a non-static data member (DECL) that is not
1247 preceded by `.' or `->'. */
1250 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1252 my_friendly_assert (TREE_CODE (decl) == FIELD_DECL, 20020909);
1256 if (current_function_decl
1257 && DECL_STATIC_FUNCTION_P (current_function_decl))
1258 cp_error_at ("invalid use of member `%D' in static member function",
1261 cp_error_at ("invalid use of non-static data member `%D'", decl);
1262 error ("from this location");
1264 return error_mark_node;
1266 TREE_USED (current_class_ptr) = 1;
1267 if (processing_template_decl && !qualifying_scope)
1269 tree type = TREE_TYPE (decl);
1271 if (TREE_CODE (type) == REFERENCE_TYPE)
1272 type = TREE_TYPE (type);
1275 /* Set the cv qualifiers. */
1276 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1278 if (DECL_MUTABLE_P (decl))
1279 quals &= ~TYPE_QUAL_CONST;
1281 quals |= cp_type_quals (TREE_TYPE (decl));
1282 type = cp_build_qualified_type (type, quals);
1285 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1289 tree access_type = TREE_TYPE (object);
1290 tree lookup_context = context_for_name_lookup (decl);
1292 while (!DERIVED_FROM_P (lookup_context, access_type))
1294 access_type = TYPE_CONTEXT (access_type);
1295 while (access_type && DECL_P (access_type))
1296 access_type = DECL_CONTEXT (access_type);
1300 cp_error_at ("object missing in reference to `%D'", decl);
1301 error ("from this location");
1302 return error_mark_node;
1306 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1307 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1309 if (processing_template_decl)
1310 return build_min (SCOPE_REF, TREE_TYPE (decl),
1311 qualifying_scope, DECL_NAME (decl));
1313 perform_or_defer_access_check (TYPE_BINFO (access_type), decl);
1315 /* If the data member was named `C::M', convert `*this' to `C'
1317 if (qualifying_scope)
1319 tree binfo = NULL_TREE;
1320 object = build_scoped_ref (object, qualifying_scope,
1324 return build_class_member_access_expr (object, decl,
1325 /*access_path=*/NULL_TREE,
1326 /*preserve_reference=*/false);
1330 /* DECL was the declaration to which a qualified-id resolved. Issue
1331 an error message if it is not accessible. If OBJECT_TYPE is
1332 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1333 type of `*x', or `x', respectively. If the DECL was named as
1334 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1337 check_accessibility_of_qualified_id (tree decl,
1339 tree nested_name_specifier)
1342 tree qualifying_type = NULL_TREE;
1344 /* If we're not checking, return imediately. */
1345 if (deferred_access_no_check)
1348 /* Determine the SCOPE of DECL. */
1349 scope = context_for_name_lookup (decl);
1350 /* If the SCOPE is not a type, then DECL is not a member. */
1351 if (!TYPE_P (scope))
1353 /* Compute the scope through which DECL is being accessed. */
1355 /* OBJECT_TYPE might not be a class type; consider:
1357 class A { typedef int I; };
1361 In this case, we will have "A::I" as the DECL, but "I" as the
1363 && CLASS_TYPE_P (object_type)
1364 && DERIVED_FROM_P (scope, object_type))
1365 /* If we are processing a `->' or `.' expression, use the type of the
1367 qualifying_type = object_type;
1368 else if (nested_name_specifier)
1370 /* If the reference is to a non-static member of the
1371 current class, treat it as if it were referenced through
1373 if (DECL_NONSTATIC_MEMBER_P (decl)
1374 && current_class_ptr
1375 && DERIVED_FROM_P (scope, current_class_type))
1376 qualifying_type = current_class_type;
1377 /* Otherwise, use the type indicated by the
1378 nested-name-specifier. */
1380 qualifying_type = nested_name_specifier;
1383 /* Otherwise, the name must be from the current class or one of
1385 qualifying_type = currently_open_derived_class (scope);
1387 if (qualifying_type)
1388 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl);
1391 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1392 class named to the left of the "::" operator. DONE is true if this
1393 expression is a complete postfix-expression; it is false if this
1394 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1395 iff this expression is the operand of '&'. */
1398 finish_qualified_id_expr (tree qualifying_class, tree expr, bool done,
1401 if (error_operand_p (expr))
1402 return error_mark_node;
1404 /* If EXPR occurs as the operand of '&', use special handling that
1405 permits a pointer-to-member. */
1406 if (address_p && done)
1408 if (TREE_CODE (expr) == SCOPE_REF)
1409 expr = TREE_OPERAND (expr, 1);
1410 expr = build_offset_ref (qualifying_class, expr,
1411 /*address_p=*/true);
1415 if (TREE_CODE (expr) == FIELD_DECL)
1416 expr = finish_non_static_data_member (expr, current_class_ref,
1418 else if (BASELINK_P (expr) && !processing_template_decl)
1423 /* See if any of the functions are non-static members. */
1424 fns = BASELINK_FUNCTIONS (expr);
1425 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1426 fns = TREE_OPERAND (fns, 0);
1427 for (fn = fns; fn; fn = OVL_NEXT (fn))
1428 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
1430 /* If so, the expression may be relative to the current
1432 if (fn && current_class_type
1433 && DERIVED_FROM_P (qualifying_class, current_class_type))
1434 expr = (build_class_member_access_expr
1435 (maybe_dummy_object (qualifying_class, NULL),
1437 BASELINK_ACCESS_BINFO (expr),
1438 /*preserve_reference=*/false));
1440 /* The expression is a qualified name whose address is not
1442 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1448 /* Begin a statement-expression. The value returned must be passed to
1449 finish_stmt_expr. */
1452 begin_stmt_expr (void)
1454 return push_stmt_list ();
1457 /* Process the final expression of a statement expression. EXPR can be
1458 NULL, if the final expression is empty. Build up a TARGET_EXPR so
1459 that the result value can be safely returned to the enclosing
1463 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1465 tree result = NULL_TREE;
1469 if (!processing_template_decl && !VOID_TYPE_P (TREE_TYPE (expr)))
1471 tree type = TREE_TYPE (expr);
1473 if (TREE_CODE (type) == ARRAY_TYPE
1474 || TREE_CODE (type) == FUNCTION_TYPE)
1475 expr = decay_conversion (expr);
1477 expr = convert_from_reference (expr);
1478 expr = require_complete_type (expr);
1480 type = TREE_TYPE (expr);
1482 /* Build a TARGET_EXPR for this aggregate. finish_stmt_expr
1483 will then pull it apart so the lifetime of the target is
1484 within the scope of the expression containing this statement
1486 if (TREE_CODE (expr) == TARGET_EXPR)
1488 else if (!IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_INIT_REF (type))
1489 expr = build_target_expr_with_type (expr, type);
1492 /* Copy construct. */
1493 expr = build_special_member_call
1494 (NULL_TREE, complete_ctor_identifier,
1495 build_tree_list (NULL_TREE, expr),
1496 type, LOOKUP_NORMAL);
1497 expr = build_cplus_new (type, expr);
1498 my_friendly_assert (TREE_CODE (expr) == TARGET_EXPR, 20030729);
1502 if (expr != error_mark_node)
1504 result = build_stmt (EXPR_STMT, expr);
1505 EXPR_STMT_STMT_EXPR_RESULT (result) = 1;
1512 /* Remember the last expression so that finish_stmt_expr
1513 can pull it apart. */
1514 TREE_TYPE (stmt_expr) = result;
1519 /* Finish a statement-expression. EXPR should be the value returned
1520 by the previous begin_stmt_expr. Returns an expression
1521 representing the statement-expression. */
1524 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1526 tree result, result_stmt, type;
1527 tree *result_stmt_p = NULL;
1529 result_stmt = TREE_TYPE (stmt_expr);
1530 TREE_TYPE (stmt_expr) = void_type_node;
1531 result = pop_stmt_list (stmt_expr);
1533 if (!result_stmt || VOID_TYPE_P (result_stmt))
1534 type = void_type_node;
1537 /* We need to search the statement expression for the result_stmt,
1538 since we'll need to replace it entirely. */
1540 result_stmt_p = &result;
1544 if (t == result_stmt)
1547 switch (TREE_CODE (t))
1549 case STATEMENT_LIST:
1551 tree_stmt_iterator i = tsi_last (t);
1552 result_stmt_p = tsi_stmt_ptr (i);
1556 result_stmt_p = &BIND_EXPR_BODY (t);
1558 case TRY_FINALLY_EXPR:
1559 case TRY_CATCH_EXPR:
1561 result_stmt_p = &TREE_OPERAND (t, 0);
1567 type = TREE_TYPE (EXPR_STMT_EXPR (result_stmt));
1570 if (processing_template_decl)
1572 result = build_min (STMT_EXPR, type, result);
1573 TREE_SIDE_EFFECTS (result) = 1;
1574 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1576 else if (!VOID_TYPE_P (type))
1578 /* Pull out the TARGET_EXPR that is the final expression. Put
1579 the target's init_expr as the final expression and then put
1580 the statement expression itself as the target's init
1581 expr. Finally, return the target expression. */
1582 tree init, target_expr = EXPR_STMT_EXPR (result_stmt);
1583 my_friendly_assert (TREE_CODE (target_expr) == TARGET_EXPR, 20030729);
1585 /* The initializer will be void if the initialization is done by
1586 AGGR_INIT_EXPR; propagate that out to the statement-expression as
1588 init = TREE_OPERAND (target_expr, 1);
1589 type = TREE_TYPE (init);
1591 init = maybe_cleanup_point_expr (init);
1592 *result_stmt_p = init;
1594 if (VOID_TYPE_P (type))
1595 /* No frobbing needed. */;
1596 else if (TREE_CODE (result) == BIND_EXPR)
1598 /* The BIND_EXPR created in finish_compound_stmt is void; if we're
1599 returning a value directly, give it the appropriate type. */
1600 if (VOID_TYPE_P (TREE_TYPE (result)))
1601 TREE_TYPE (result) = type;
1602 else if (same_type_p (TREE_TYPE (result), type))
1607 else if (TREE_CODE (result) == STATEMENT_LIST)
1608 /* We need to wrap a STATEMENT_LIST in a BIND_EXPR so it can have a
1609 type other than void. FIXME why can't we just return a value
1610 from STATEMENT_LIST? */
1611 result = build3 (BIND_EXPR, type, NULL, result, NULL);
1613 TREE_OPERAND (target_expr, 1) = result;
1614 result = target_expr;
1620 /* Perform Koenig lookup. FN is the postfix-expression representing
1621 the function (or functions) to call; ARGS are the arguments to the
1622 call. Returns the functions to be considered by overload
1626 perform_koenig_lookup (tree fn, tree args)
1628 tree identifier = NULL_TREE;
1629 tree functions = NULL_TREE;
1631 /* Find the name of the overloaded function. */
1632 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1634 else if (is_overloaded_fn (fn))
1637 identifier = DECL_NAME (get_first_fn (functions));
1639 else if (DECL_P (fn))
1642 identifier = DECL_NAME (fn);
1645 /* A call to a namespace-scope function using an unqualified name.
1647 Do Koenig lookup -- unless any of the arguments are
1649 if (!any_type_dependent_arguments_p (args))
1651 fn = lookup_arg_dependent (identifier, functions, args);
1653 /* The unqualified name could not be resolved. */
1654 fn = unqualified_fn_lookup_error (identifier);
1662 /* Generate an expression for `FN (ARGS)'.
1664 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1665 as a virtual call, even if FN is virtual. (This flag is set when
1666 encountering an expression where the function name is explicitly
1667 qualified. For example a call to `X::f' never generates a virtual
1670 Returns code for the call. */
1673 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1679 if (fn == error_mark_node || args == error_mark_node)
1680 return error_mark_node;
1682 /* ARGS should be a list of arguments. */
1683 my_friendly_assert (!args || TREE_CODE (args) == TREE_LIST,
1689 if (processing_template_decl)
1691 if (type_dependent_expression_p (fn)
1692 || any_type_dependent_arguments_p (args))
1694 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1695 KOENIG_LOOKUP_P (result) = koenig_p;
1698 if (!BASELINK_P (fn)
1699 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1700 && TREE_TYPE (fn) != unknown_type_node)
1701 fn = build_non_dependent_expr (fn);
1702 args = build_non_dependent_args (orig_args);
1705 /* A reference to a member function will appear as an overloaded
1706 function (rather than a BASELINK) if an unqualified name was used
1708 if (!BASELINK_P (fn) && is_overloaded_fn (fn))
1712 if (TREE_CODE (f) == TEMPLATE_ID_EXPR)
1713 f = TREE_OPERAND (f, 0);
1714 f = get_first_fn (f);
1715 if (DECL_FUNCTION_MEMBER_P (f))
1717 tree type = currently_open_derived_class (DECL_CONTEXT (f));
1719 type = DECL_CONTEXT (f);
1720 fn = build_baselink (TYPE_BINFO (type),
1722 fn, /*optype=*/NULL_TREE);
1727 if (BASELINK_P (fn))
1731 /* A call to a member function. From [over.call.func]:
1733 If the keyword this is in scope and refers to the class of
1734 that member function, or a derived class thereof, then the
1735 function call is transformed into a qualified function call
1736 using (*this) as the postfix-expression to the left of the
1737 . operator.... [Otherwise] a contrived object of type T
1738 becomes the implied object argument.
1740 This paragraph is unclear about this situation:
1742 struct A { void f(); };
1743 struct B : public A {};
1744 struct C : public A { void g() { B::f(); }};
1746 In particular, for `B::f', this paragraph does not make clear
1747 whether "the class of that member function" refers to `A' or
1748 to `B'. We believe it refers to `B'. */
1749 if (current_class_type
1750 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1752 && current_class_ref)
1753 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1757 tree representative_fn;
1759 representative_fn = BASELINK_FUNCTIONS (fn);
1760 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1761 representative_fn = TREE_OPERAND (representative_fn, 0);
1762 representative_fn = get_first_fn (representative_fn);
1763 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1766 if (processing_template_decl)
1768 if (type_dependent_expression_p (object))
1769 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1770 object = build_non_dependent_expr (object);
1773 result = build_new_method_call (object, fn, args, NULL_TREE,
1775 ? LOOKUP_NONVIRTUAL : 0));
1777 else if (is_overloaded_fn (fn))
1778 /* A call to a namespace-scope function. */
1779 result = build_new_function_call (fn, args);
1780 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1783 error ("arguments to destructor are not allowed");
1784 /* Mark the pseudo-destructor call as having side-effects so
1785 that we do not issue warnings about its use. */
1786 result = build1 (NOP_EXPR,
1788 TREE_OPERAND (fn, 0));
1789 TREE_SIDE_EFFECTS (result) = 1;
1791 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1792 /* If the "function" is really an object of class type, it might
1793 have an overloaded `operator ()'. */
1794 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1795 /*overloaded_p=*/NULL);
1797 /* A call where the function is unknown. */
1798 result = build_function_call (fn, args);
1800 if (processing_template_decl)
1802 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1803 orig_args, NULL_TREE);
1804 KOENIG_LOOKUP_P (result) = koenig_p;
1809 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1810 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1811 POSTDECREMENT_EXPR.) */
1814 finish_increment_expr (tree expr, enum tree_code code)
1816 return build_x_unary_op (code, expr);
1819 /* Finish a use of `this'. Returns an expression for `this'. */
1822 finish_this_expr (void)
1826 if (current_class_ptr)
1828 result = current_class_ptr;
1830 else if (current_function_decl
1831 && DECL_STATIC_FUNCTION_P (current_function_decl))
1833 error ("`this' is unavailable for static member functions");
1834 result = error_mark_node;
1838 if (current_function_decl)
1839 error ("invalid use of `this' in non-member function");
1841 error ("invalid use of `this' at top level");
1842 result = error_mark_node;
1848 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1849 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1850 the TYPE for the type given. If SCOPE is non-NULL, the expression
1851 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1854 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1856 if (destructor == error_mark_node)
1857 return error_mark_node;
1859 my_friendly_assert (TYPE_P (destructor), 20010905);
1861 if (!processing_template_decl)
1863 if (scope == error_mark_node)
1865 error ("invalid qualifying scope in pseudo-destructor name");
1866 return error_mark_node;
1869 /* [expr.pseudo] says both:
1871 The type designated by the pseudo-destructor-name shall be
1872 the same as the object type.
1876 The cv-unqualified versions of the object type and of the
1877 type designated by the pseudo-destructor-name shall be the
1880 We implement the more generous second sentence, since that is
1881 what most other compilers do. */
1882 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1885 error ("`%E' is not of type `%T'", object, destructor);
1886 return error_mark_node;
1890 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1893 /* Finish an expression of the form CODE EXPR. */
1896 finish_unary_op_expr (enum tree_code code, tree expr)
1898 tree result = build_x_unary_op (code, expr);
1899 /* Inside a template, build_x_unary_op does not fold the
1900 expression. So check whether the result is folded before
1901 setting TREE_NEGATED_INT. */
1902 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1903 && TREE_CODE (result) == INTEGER_CST
1904 && !TYPE_UNSIGNED (TREE_TYPE (result))
1905 && INT_CST_LT (result, integer_zero_node))
1906 TREE_NEGATED_INT (result) = 1;
1907 overflow_warning (result);
1911 /* Finish a compound-literal expression. TYPE is the type to which
1912 the INITIALIZER_LIST is being cast. */
1915 finish_compound_literal (tree type, tree initializer_list)
1917 tree compound_literal;
1919 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
1920 compound_literal = build_constructor (NULL_TREE, initializer_list);
1921 /* Mark it as a compound-literal. */
1922 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
1923 if (processing_template_decl)
1924 TREE_TYPE (compound_literal) = type;
1927 /* Check the initialization. */
1928 compound_literal = digest_init (type, compound_literal, NULL);
1929 /* If the TYPE was an array type with an unknown bound, then we can
1930 figure out the dimension now. For example, something like:
1934 implies that the array has two elements. */
1935 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type))
1936 complete_array_type (type, compound_literal, 1);
1939 return compound_literal;
1942 /* Return the declaration for the function-name variable indicated by
1946 finish_fname (tree id)
1950 decl = fname_decl (C_RID_CODE (id), id);
1951 if (processing_template_decl)
1952 decl = DECL_NAME (decl);
1956 /* Finish a translation unit. */
1959 finish_translation_unit (void)
1961 /* In case there were missing closebraces,
1962 get us back to the global binding level. */
1964 while (current_namespace != global_namespace)
1967 /* Do file scope __FUNCTION__ et al. */
1968 finish_fname_decls ();
1971 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
1972 Returns the parameter. */
1975 finish_template_type_parm (tree aggr, tree identifier)
1977 if (aggr != class_type_node)
1979 pedwarn ("template type parameters must use the keyword `class' or `typename'");
1980 aggr = class_type_node;
1983 return build_tree_list (aggr, identifier);
1986 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
1987 Returns the parameter. */
1990 finish_template_template_parm (tree aggr, tree identifier)
1992 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
1993 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
1994 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
1995 DECL_TEMPLATE_RESULT (tmpl) = decl;
1996 DECL_ARTIFICIAL (decl) = 1;
1997 end_template_decl ();
1999 my_friendly_assert (DECL_TEMPLATE_PARMS (tmpl), 20010110);
2001 return finish_template_type_parm (aggr, tmpl);
2004 /* ARGUMENT is the default-argument value for a template template
2005 parameter. If ARGUMENT is invalid, issue error messages and return
2006 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2009 check_template_template_default_arg (tree argument)
2011 if (TREE_CODE (argument) != TEMPLATE_DECL
2012 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2013 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2015 if (TREE_CODE (argument) == TYPE_DECL)
2017 tree t = TREE_TYPE (argument);
2019 /* Try to emit a slightly smarter error message if we detect
2020 that the user is using a template instantiation. */
2021 if (CLASSTYPE_TEMPLATE_INFO (t)
2022 && CLASSTYPE_TEMPLATE_INSTANTIATION (t))
2023 error ("invalid use of type `%T' as a default value for a "
2024 "template template-parameter", t);
2026 error ("invalid use of `%D' as a default value for a template "
2027 "template-parameter", argument);
2030 error ("invalid default argument for a template template parameter");
2031 return error_mark_node;
2037 /* Begin a class definition, as indicated by T. */
2040 begin_class_definition (tree t)
2042 if (t == error_mark_node)
2043 return error_mark_node;
2045 if (processing_template_parmlist)
2047 error ("definition of `%#T' inside template parameter list", t);
2048 return error_mark_node;
2050 /* A non-implicit typename comes from code like:
2052 template <typename T> struct A {
2053 template <typename U> struct A<T>::B ...
2055 This is erroneous. */
2056 else if (TREE_CODE (t) == TYPENAME_TYPE)
2058 error ("invalid definition of qualified type `%T'", t);
2059 t = error_mark_node;
2062 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2064 t = make_aggr_type (RECORD_TYPE);
2065 pushtag (make_anon_name (), t, 0);
2068 /* If this type was already complete, and we see another definition,
2070 if (COMPLETE_TYPE_P (t))
2072 error ("redefinition of `%#T'", t);
2073 cp_error_at ("previous definition of `%#T'", t);
2074 return error_mark_node;
2077 /* Update the location of the decl. */
2078 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2080 if (TYPE_BEING_DEFINED (t))
2082 t = make_aggr_type (TREE_CODE (t));
2083 pushtag (TYPE_IDENTIFIER (t), t, 0);
2085 maybe_process_partial_specialization (t);
2087 TYPE_BEING_DEFINED (t) = 1;
2088 if (flag_pack_struct)
2091 TYPE_PACKED (t) = 1;
2092 /* Even though the type is being defined for the first time
2093 here, there might have been a forward declaration, so there
2094 might be cv-qualified variants of T. */
2095 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2096 TYPE_PACKED (v) = 1;
2098 /* Reset the interface data, at the earliest possible
2099 moment, as it might have been set via a class foo;
2101 if (! TYPE_ANONYMOUS_P (t))
2103 CLASSTYPE_INTERFACE_ONLY (t) = interface_only;
2104 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2105 (t, interface_unknown);
2107 reset_specialization();
2109 /* Make a declaration for this class in its own scope. */
2110 build_self_reference ();
2115 /* Finish the member declaration given by DECL. */
2118 finish_member_declaration (tree decl)
2120 if (decl == error_mark_node || decl == NULL_TREE)
2123 if (decl == void_type_node)
2124 /* The COMPONENT was a friend, not a member, and so there's
2125 nothing for us to do. */
2128 /* We should see only one DECL at a time. */
2129 my_friendly_assert (TREE_CHAIN (decl) == NULL_TREE, 0);
2131 /* Set up access control for DECL. */
2133 = (current_access_specifier == access_private_node);
2134 TREE_PROTECTED (decl)
2135 = (current_access_specifier == access_protected_node);
2136 if (TREE_CODE (decl) == TEMPLATE_DECL)
2138 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2139 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2142 /* Mark the DECL as a member of the current class. */
2143 DECL_CONTEXT (decl) = current_class_type;
2147 A C language linkage is ignored for the names of class members
2148 and the member function type of class member functions. */
2149 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2150 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2152 /* Put functions on the TYPE_METHODS list and everything else on the
2153 TYPE_FIELDS list. Note that these are built up in reverse order.
2154 We reverse them (to obtain declaration order) in finish_struct. */
2155 if (TREE_CODE (decl) == FUNCTION_DECL
2156 || DECL_FUNCTION_TEMPLATE_P (decl))
2158 /* We also need to add this function to the
2159 CLASSTYPE_METHOD_VEC. */
2160 add_method (current_class_type, decl);
2162 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2163 TYPE_METHODS (current_class_type) = decl;
2165 maybe_add_class_template_decl_list (current_class_type, decl,
2168 /* Enter the DECL into the scope of the class. */
2169 else if ((TREE_CODE (decl) == USING_DECL && TREE_TYPE (decl))
2170 || pushdecl_class_level (decl))
2172 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2173 go at the beginning. The reason is that lookup_field_1
2174 searches the list in order, and we want a field name to
2175 override a type name so that the "struct stat hack" will
2176 work. In particular:
2178 struct S { enum E { }; int E } s;
2181 is valid. In addition, the FIELD_DECLs must be maintained in
2182 declaration order so that class layout works as expected.
2183 However, we don't need that order until class layout, so we
2184 save a little time by putting FIELD_DECLs on in reverse order
2185 here, and then reversing them in finish_struct_1. (We could
2186 also keep a pointer to the correct insertion points in the
2189 if (TREE_CODE (decl) == TYPE_DECL)
2190 TYPE_FIELDS (current_class_type)
2191 = chainon (TYPE_FIELDS (current_class_type), decl);
2194 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2195 TYPE_FIELDS (current_class_type) = decl;
2198 maybe_add_class_template_decl_list (current_class_type, decl,
2203 /* Finish processing a complete template declaration. The PARMS are
2204 the template parameters. */
2207 finish_template_decl (tree parms)
2210 end_template_decl ();
2212 end_specialization ();
2215 /* Finish processing a template-id (which names a type) of the form
2216 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2217 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2218 the scope of template-id indicated. */
2221 finish_template_type (tree name, tree args, int entering_scope)
2225 decl = lookup_template_class (name, args,
2226 NULL_TREE, NULL_TREE, entering_scope,
2227 tf_error | tf_warning | tf_user);
2228 if (decl != error_mark_node)
2229 decl = TYPE_STUB_DECL (decl);
2234 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2235 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2236 BASE_CLASS, or NULL_TREE if an error occurred. The
2237 ACCESS_SPECIFIER is one of
2238 access_{default,public,protected_private}_node. For a virtual base
2239 we set TREE_TYPE. */
2242 finish_base_specifier (tree base, tree access, bool virtual_p)
2246 if (base == error_mark_node)
2248 error ("invalid base-class specification");
2251 else if (! is_aggr_type (base, 1))
2255 if (cp_type_quals (base) != 0)
2257 error ("base class `%T' has cv qualifiers", base);
2258 base = TYPE_MAIN_VARIANT (base);
2260 result = build_tree_list (access, base);
2262 TREE_TYPE (result) = integer_type_node;
2268 /* Called when multiple declarators are processed. If that is not
2269 permitted in this context, an error is issued. */
2272 check_multiple_declarators (void)
2276 In a template-declaration, explicit specialization, or explicit
2277 instantiation the init-declarator-list in the declaration shall
2278 contain at most one declarator.
2280 We don't just use PROCESSING_TEMPLATE_DECL for the first
2281 condition since that would disallow the perfectly valid code,
2282 like `template <class T> struct S { int i, j; };'. */
2283 if (at_function_scope_p ())
2284 /* It's OK to write `template <class T> void f() { int i, j;}'. */
2287 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
2288 || processing_explicit_instantiation
2289 || processing_specialization)
2290 error ("multiple declarators in template declaration");
2293 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2294 what we found when we tried to do the lookup. */
2297 qualified_name_lookup_error (tree scope, tree name, tree decl)
2301 if (!COMPLETE_TYPE_P (scope))
2302 error ("incomplete type `%T' used in nested name specifier", scope);
2303 else if (TREE_CODE (decl) == TREE_LIST)
2305 error ("reference to `%T::%D' is ambiguous", scope, name);
2306 print_candidates (decl);
2309 error ("`%D' is not a member of `%T'", name, scope);
2311 else if (scope != global_namespace)
2312 error ("`%D' is not a member of `%D'", name, scope);
2314 error ("`::%D' has not been declared", name);
2317 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2318 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2319 if non-NULL, is the type or namespace used to explicitly qualify
2320 ID_EXPRESSION. DECL is the entity to which that name has been
2323 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2324 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2325 be set to true if this expression isn't permitted in a
2326 constant-expression, but it is otherwise not set by this function.
2327 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2328 constant-expression, but a non-constant expression is also
2331 If an error occurs, and it is the kind of error that might cause
2332 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2333 is the caller's responsibility to issue the message. *ERROR_MSG
2334 will be a string with static storage duration, so the caller need
2337 Return an expression for the entity, after issuing appropriate
2338 diagnostics. This function is also responsible for transforming a
2339 reference to a non-static member into a COMPONENT_REF that makes
2340 the use of "this" explicit.
2342 Upon return, *IDK will be filled in appropriately. */
2345 finish_id_expression (tree id_expression,
2349 tree *qualifying_class,
2350 bool integral_constant_expression_p,
2351 bool allow_non_integral_constant_expression_p,
2352 bool *non_integral_constant_expression_p,
2353 const char **error_msg)
2355 /* Initialize the output parameters. */
2356 *idk = CP_ID_KIND_NONE;
2359 if (id_expression == error_mark_node)
2360 return error_mark_node;
2361 /* If we have a template-id, then no further lookup is
2362 required. If the template-id was for a template-class, we
2363 will sometimes have a TYPE_DECL at this point. */
2364 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2365 || TREE_CODE (decl) == TYPE_DECL)
2367 /* Look up the name. */
2370 if (decl == error_mark_node)
2372 /* Name lookup failed. */
2375 || (!dependent_type_p (scope)
2376 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2377 && IDENTIFIER_TYPENAME_P (id_expression)
2378 && dependent_type_p (TREE_TYPE (id_expression))))))
2380 /* If the qualifying type is non-dependent (and the name
2381 does not name a conversion operator to a dependent
2382 type), issue an error. */
2383 qualified_name_lookup_error (scope, id_expression, decl);
2384 return error_mark_node;
2388 /* It may be resolved via Koenig lookup. */
2389 *idk = CP_ID_KIND_UNQUALIFIED;
2390 return id_expression;
2393 decl = id_expression;
2395 /* If DECL is a variable that would be out of scope under
2396 ANSI/ISO rules, but in scope in the ARM, name lookup
2397 will succeed. Issue a diagnostic here. */
2399 decl = check_for_out_of_scope_variable (decl);
2401 /* Remember that the name was used in the definition of
2402 the current class so that we can check later to see if
2403 the meaning would have been different after the class
2404 was entirely defined. */
2405 if (!scope && decl != error_mark_node)
2406 maybe_note_name_used_in_class (id_expression, decl);
2409 /* If we didn't find anything, or what we found was a type,
2410 then this wasn't really an id-expression. */
2411 if (TREE_CODE (decl) == TEMPLATE_DECL
2412 && !DECL_FUNCTION_TEMPLATE_P (decl))
2414 *error_msg = "missing template arguments";
2415 return error_mark_node;
2417 else if (TREE_CODE (decl) == TYPE_DECL
2418 || TREE_CODE (decl) == NAMESPACE_DECL)
2420 *error_msg = "expected primary-expression";
2421 return error_mark_node;
2424 /* If the name resolved to a template parameter, there is no
2425 need to look it up again later. */
2426 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2427 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2429 *idk = CP_ID_KIND_NONE;
2430 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2431 decl = TEMPLATE_PARM_DECL (decl);
2432 if (integral_constant_expression_p
2433 && !dependent_type_p (TREE_TYPE (decl))
2434 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (decl)))
2436 if (!allow_non_integral_constant_expression_p)
2437 error ("template parameter `%D' of type `%T' is not allowed in "
2438 "an integral constant expression because it is not of "
2439 "integral or enumeration type", decl, TREE_TYPE (decl));
2440 *non_integral_constant_expression_p = true;
2442 return DECL_INITIAL (decl);
2444 /* Similarly, we resolve enumeration constants to their
2445 underlying values. */
2446 else if (TREE_CODE (decl) == CONST_DECL)
2448 *idk = CP_ID_KIND_NONE;
2449 if (!processing_template_decl)
2450 return DECL_INITIAL (decl);
2457 /* If the declaration was explicitly qualified indicate
2458 that. The semantics of `A::f(3)' are different than
2459 `f(3)' if `f' is virtual. */
2461 ? CP_ID_KIND_QUALIFIED
2462 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2463 ? CP_ID_KIND_TEMPLATE_ID
2464 : CP_ID_KIND_UNQUALIFIED));
2469 An id-expression is type-dependent if it contains an
2470 identifier that was declared with a dependent type.
2472 The standard is not very specific about an id-expression that
2473 names a set of overloaded functions. What if some of them
2474 have dependent types and some of them do not? Presumably,
2475 such a name should be treated as a dependent name. */
2476 /* Assume the name is not dependent. */
2477 dependent_p = false;
2478 if (!processing_template_decl)
2479 /* No names are dependent outside a template. */
2481 /* A template-id where the name of the template was not resolved
2482 is definitely dependent. */
2483 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2484 && (TREE_CODE (TREE_OPERAND (decl, 0))
2485 == IDENTIFIER_NODE))
2487 /* For anything except an overloaded function, just check its
2489 else if (!is_overloaded_fn (decl))
2491 = dependent_type_p (TREE_TYPE (decl));
2492 /* For a set of overloaded functions, check each of the
2498 if (BASELINK_P (fns))
2499 fns = BASELINK_FUNCTIONS (fns);
2501 /* For a template-id, check to see if the template
2502 arguments are dependent. */
2503 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2505 tree args = TREE_OPERAND (fns, 1);
2506 dependent_p = any_dependent_template_arguments_p (args);
2507 /* The functions are those referred to by the
2509 fns = TREE_OPERAND (fns, 0);
2512 /* If there are no dependent template arguments, go through
2513 the overloaded functions. */
2514 while (fns && !dependent_p)
2516 tree fn = OVL_CURRENT (fns);
2518 /* Member functions of dependent classes are
2520 if (TREE_CODE (fn) == FUNCTION_DECL
2521 && type_dependent_expression_p (fn))
2523 else if (TREE_CODE (fn) == TEMPLATE_DECL
2524 && dependent_template_p (fn))
2527 fns = OVL_NEXT (fns);
2531 /* If the name was dependent on a template parameter, we will
2532 resolve the name at instantiation time. */
2535 /* Create a SCOPE_REF for qualified names, if the scope is
2540 *qualifying_class = scope;
2541 /* Since this name was dependent, the expression isn't
2542 constant -- yet. No error is issued because it might
2543 be constant when things are instantiated. */
2544 if (integral_constant_expression_p)
2545 *non_integral_constant_expression_p = true;
2546 if (TYPE_P (scope) && dependent_type_p (scope))
2547 return build_nt (SCOPE_REF, scope, id_expression);
2548 else if (TYPE_P (scope) && DECL_P (decl))
2549 return build2 (SCOPE_REF, TREE_TYPE (decl), scope,
2554 /* A TEMPLATE_ID already contains all the information we
2556 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2557 return id_expression;
2558 /* Since this name was dependent, the expression isn't
2559 constant -- yet. No error is issued because it might be
2560 constant when things are instantiated. */
2561 if (integral_constant_expression_p)
2562 *non_integral_constant_expression_p = true;
2563 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2564 /* If we found a variable, then name lookup during the
2565 instantiation will always resolve to the same VAR_DECL
2566 (or an instantiation thereof). */
2567 if (TREE_CODE (decl) == VAR_DECL
2568 || TREE_CODE (decl) == PARM_DECL)
2570 return id_expression;
2573 /* Only certain kinds of names are allowed in constant
2574 expression. Enumerators and template parameters
2575 have already been handled above. */
2576 if (integral_constant_expression_p
2577 && !DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2579 if (!allow_non_integral_constant_expression_p)
2581 error ("`%D' cannot appear in a constant-expression", decl);
2582 return error_mark_node;
2584 *non_integral_constant_expression_p = true;
2587 if (TREE_CODE (decl) == NAMESPACE_DECL)
2589 error ("use of namespace `%D' as expression", decl);
2590 return error_mark_node;
2592 else if (DECL_CLASS_TEMPLATE_P (decl))
2594 error ("use of class template `%T' as expression", decl);
2595 return error_mark_node;
2597 else if (TREE_CODE (decl) == TREE_LIST)
2599 /* Ambiguous reference to base members. */
2600 error ("request for member `%D' is ambiguous in "
2601 "multiple inheritance lattice", id_expression);
2602 print_candidates (decl);
2603 return error_mark_node;
2606 /* Mark variable-like entities as used. Functions are similarly
2607 marked either below or after overload resolution. */
2608 if (TREE_CODE (decl) == VAR_DECL
2609 || TREE_CODE (decl) == PARM_DECL
2610 || TREE_CODE (decl) == RESULT_DECL)
2615 decl = (adjust_result_of_qualified_name_lookup
2616 (decl, scope, current_class_type));
2618 if (TREE_CODE (decl) == FUNCTION_DECL)
2621 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2622 *qualifying_class = scope;
2623 else if (!processing_template_decl)
2624 decl = convert_from_reference (decl);
2625 else if (TYPE_P (scope))
2626 decl = build2 (SCOPE_REF, TREE_TYPE (decl), scope, decl);
2628 else if (TREE_CODE (decl) == FIELD_DECL)
2629 decl = finish_non_static_data_member (decl, current_class_ref,
2630 /*qualifying_scope=*/NULL_TREE);
2631 else if (is_overloaded_fn (decl))
2633 tree first_fn = OVL_CURRENT (decl);
2635 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2636 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2638 if (!really_overloaded_fn (decl))
2639 mark_used (first_fn);
2641 if (TREE_CODE (first_fn) == FUNCTION_DECL
2642 && DECL_FUNCTION_MEMBER_P (first_fn))
2644 /* A set of member functions. */
2645 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2646 return finish_class_member_access_expr (decl, id_expression);
2651 if (TREE_CODE (decl) == VAR_DECL
2652 || TREE_CODE (decl) == PARM_DECL
2653 || TREE_CODE (decl) == RESULT_DECL)
2655 tree context = decl_function_context (decl);
2657 if (context != NULL_TREE && context != current_function_decl
2658 && ! TREE_STATIC (decl))
2660 error ("use of %s from containing function",
2661 (TREE_CODE (decl) == VAR_DECL
2662 ? "`auto' variable" : "parameter"));
2663 cp_error_at (" `%#D' declared here", decl);
2664 return error_mark_node;
2668 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2669 && DECL_CLASS_SCOPE_P (decl)
2670 && DECL_CONTEXT (decl) != current_class_type)
2674 path = currently_open_derived_class (DECL_CONTEXT (decl));
2675 perform_or_defer_access_check (TYPE_BINFO (path), decl);
2678 if (! processing_template_decl)
2679 decl = convert_from_reference (decl);
2682 /* Resolve references to variables of anonymous unions
2683 into COMPONENT_REFs. */
2684 if (TREE_CODE (decl) == ALIAS_DECL)
2685 decl = unshare_expr (DECL_INITIAL (decl));
2688 if (TREE_DEPRECATED (decl))
2689 warn_deprecated_use (decl);
2694 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2695 use as a type-specifier. */
2698 finish_typeof (tree expr)
2702 if (type_dependent_expression_p (expr))
2704 type = make_aggr_type (TYPEOF_TYPE);
2705 TYPEOF_TYPE_EXPR (type) = expr;
2710 type = TREE_TYPE (expr);
2712 if (!type || type == unknown_type_node)
2714 error ("type of `%E' is unknown", expr);
2715 return error_mark_node;
2721 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2722 with equivalent CALL_EXPRs. */
2725 simplify_aggr_init_exprs_r (tree* tp,
2727 void* data ATTRIBUTE_UNUSED)
2729 /* We don't need to walk into types; there's nothing in a type that
2730 needs simplification. (And, furthermore, there are places we
2731 actively don't want to go. For example, we don't want to wander
2732 into the default arguments for a FUNCTION_DECL that appears in a
2739 /* Only AGGR_INIT_EXPRs are interesting. */
2740 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2743 simplify_aggr_init_expr (tp);
2745 /* Keep iterating. */
2749 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2750 function is broken out from the above for the benefit of the tree-ssa
2754 simplify_aggr_init_expr (tree *tp)
2756 tree aggr_init_expr = *tp;
2758 /* Form an appropriate CALL_EXPR. */
2759 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2760 tree args = TREE_OPERAND (aggr_init_expr, 1);
2761 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2762 tree type = TREE_TYPE (slot);
2765 enum style_t { ctor, arg, pcc } style;
2767 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2769 #ifdef PCC_STATIC_STRUCT_RETURN
2773 else if (TREE_ADDRESSABLE (type))
2776 /* We shouldn't build an AGGR_INIT_EXPR if we don't need any special
2777 handling. See build_cplus_new. */
2780 if (style == ctor || style == arg)
2782 /* Pass the address of the slot. If this is a constructor, we
2783 replace the first argument; otherwise, we tack on a new one. */
2787 args = TREE_CHAIN (args);
2789 cxx_mark_addressable (slot);
2790 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2793 /* The return type might have different cv-quals from the slot. */
2794 tree fntype = TREE_TYPE (TREE_TYPE (fn));
2795 #ifdef ENABLE_CHECKING
2796 if (TREE_CODE (fntype) != FUNCTION_TYPE
2797 && TREE_CODE (fntype) != METHOD_TYPE)
2800 addr = convert (build_pointer_type (TREE_TYPE (fntype)), addr);
2803 args = tree_cons (NULL_TREE, addr, args);
2806 call_expr = build3 (CALL_EXPR,
2807 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
2808 fn, args, NULL_TREE);
2811 /* Tell the backend that we've added our return slot to the argument
2813 CALL_EXPR_HAS_RETURN_SLOT_ADDR (call_expr) = 1;
2814 else if (style == pcc)
2816 /* If we're using the non-reentrant PCC calling convention, then we
2817 need to copy the returned value out of the static buffer into the
2819 push_deferring_access_checks (dk_no_check);
2820 call_expr = build_aggr_init (slot, call_expr,
2821 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
2822 pop_deferring_access_checks ();
2828 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2831 emit_associated_thunks (tree fn)
2833 /* When we use vcall offsets, we emit thunks with the virtual
2834 functions to which they thunk. The whole point of vcall offsets
2835 is so that you can know statically the entire set of thunks that
2836 will ever be needed for a given virtual function, thereby
2837 enabling you to output all the thunks with the function itself. */
2838 if (DECL_VIRTUAL_P (fn))
2842 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
2844 if (!THUNK_ALIAS (thunk))
2846 use_thunk (thunk, /*emit_p=*/1);
2847 if (DECL_RESULT_THUNK_P (thunk))
2851 for (probe = DECL_THUNKS (thunk);
2852 probe; probe = TREE_CHAIN (probe))
2853 use_thunk (probe, /*emit_p=*/1);
2857 my_friendly_assert (!DECL_THUNKS (thunk), 20031023);
2862 /* Generate RTL for FN. */
2865 expand_body (tree fn)
2867 tree saved_function;
2869 /* Compute the appropriate object-file linkage for inline
2871 if (DECL_DECLARED_INLINE_P (fn))
2872 import_export_decl (fn);
2874 /* If FN is external, then there's no point in generating RTL for
2875 it. This situation can arise with an inline function under
2876 `-fexternal-templates'; we instantiate the function, even though
2877 we're not planning on emitting it, in case we get a chance to
2879 if (DECL_EXTERNAL (fn))
2882 /* ??? When is this needed? */
2883 saved_function = current_function_decl;
2885 /* Emit any thunks that should be emitted at the same time as FN. */
2886 emit_associated_thunks (fn);
2888 tree_rest_of_compilation (fn, function_depth > 1);
2890 current_function_decl = saved_function;
2892 extract_interface_info ();
2894 if (DECL_CLONED_FUNCTION_P (fn))
2896 /* If this is a clone, go through the other clones now and mark
2897 their parameters used. We have to do that here, as we don't
2898 know whether any particular clone will be expanded, and
2899 therefore cannot pick one arbitrarily. */
2902 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
2903 probe && DECL_CLONED_FUNCTION_P (probe);
2904 probe = TREE_CHAIN (probe))
2908 for (parms = DECL_ARGUMENTS (probe);
2909 parms; parms = TREE_CHAIN (parms))
2910 TREE_USED (parms) = 1;
2915 /* Generate RTL for FN. */
2918 expand_or_defer_fn (tree fn)
2920 /* When the parser calls us after finishing the body of a template
2921 function, we don't really want to expand the body. */
2922 if (processing_template_decl)
2924 /* Normally, collection only occurs in rest_of_compilation. So,
2925 if we don't collect here, we never collect junk generated
2926 during the processing of templates until we hit a
2927 non-template function. */
2932 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
2933 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
2934 simplify_aggr_init_exprs_r,
2937 /* If this is a constructor or destructor body, we have to clone
2939 if (maybe_clone_body (fn))
2941 /* We don't want to process FN again, so pretend we've written
2942 it out, even though we haven't. */
2943 TREE_ASM_WRITTEN (fn) = 1;
2947 /* If this function is marked with the constructor attribute, add it
2948 to the list of functions to be called along with constructors
2949 from static duration objects. */
2950 if (DECL_STATIC_CONSTRUCTOR (fn))
2951 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
2953 /* If this function is marked with the destructor attribute, add it
2954 to the list of functions to be called along with destructors from
2955 static duration objects. */
2956 if (DECL_STATIC_DESTRUCTOR (fn))
2957 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
2959 /* We make a decision about linkage for these functions at the end
2960 of the compilation. Until that point, we do not want the back
2961 end to output them -- but we do want it to see the bodies of
2962 these fucntions so that it can inline them as appropriate. */
2963 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
2967 DECL_EXTERNAL (fn) = 1;
2968 DECL_NOT_REALLY_EXTERN (fn) = 1;
2969 note_vague_linkage_fn (fn);
2972 import_export_decl (fn);
2975 /* There's no reason to do any of the work here if we're only doing
2976 semantic analysis; this code just generates RTL. */
2977 if (flag_syntax_only)
2982 /* Expand or defer, at the whim of the compilation unit manager. */
2983 cgraph_finalize_function (fn, function_depth > 1);
2995 /* Helper function for walk_tree, used by finalize_nrv below. */
2998 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3000 struct nrv_data *dp = (struct nrv_data *)data;
3003 /* No need to walk into types. There wouldn't be any need to walk into
3004 non-statements, except that we have to consider STMT_EXPRs. */
3007 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3008 but differs from using NULL_TREE in that it indicates that we care
3009 about the value of the RESULT_DECL. */
3010 else if (TREE_CODE (*tp) == RETURN_EXPR)
3011 TREE_OPERAND (*tp, 0) = dp->result;
3012 /* Change all cleanups for the NRV to only run when an exception is
3014 else if (TREE_CODE (*tp) == CLEANUP_STMT
3015 && CLEANUP_DECL (*tp) == dp->var)
3016 CLEANUP_EH_ONLY (*tp) = 1;
3017 /* Replace the DECL_EXPR for the NRV with an initialization of the
3018 RESULT_DECL, if needed. */
3019 else if (TREE_CODE (*tp) == DECL_EXPR
3020 && DECL_EXPR_DECL (*tp) == dp->var)
3023 if (DECL_INITIAL (dp->var)
3024 && DECL_INITIAL (dp->var) != error_mark_node)
3026 init = build2 (INIT_EXPR, void_type_node, dp->result,
3027 DECL_INITIAL (dp->var));
3028 DECL_INITIAL (dp->var) = error_mark_node;
3031 init = build_empty_stmt ();
3032 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3035 /* And replace all uses of the NRV with the RESULT_DECL. */
3036 else if (*tp == dp->var)
3039 /* Avoid walking into the same tree more than once. Unfortunately, we
3040 can't just use walk_tree_without duplicates because it would only call
3041 us for the first occurrence of dp->var in the function body. */
3042 slot = htab_find_slot (dp->visited, *tp, INSERT);
3048 /* Keep iterating. */
3052 /* Called from finish_function to implement the named return value
3053 optimization by overriding all the RETURN_EXPRs and pertinent
3054 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3055 RESULT_DECL for the function. */
3058 finalize_nrv (tree *tp, tree var, tree result)
3060 struct nrv_data data;
3062 /* Copy debugging information from VAR to RESULT. */
3063 DECL_NAME (result) = DECL_NAME (var);
3064 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3065 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3066 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3067 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3068 /* Don't forget that we take its address. */
3069 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3072 data.result = result;
3073 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3074 walk_tree (tp, finalize_nrv_r, &data, 0);
3075 htab_delete (data.visited);
3078 /* Perform initialization related to this module. */
3081 init_cp_semantics (void)
3085 #include "gt-cp-semantics.h"