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, 51 Franklin Street, Fifth Floor, Boston, MA
30 #include "coretypes.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
45 #include "diagnostic.h"
47 #include "tree-iterator.h"
51 /* There routines provide a modular interface to perform many parsing
52 operations. They may therefore be used during actual parsing, or
53 during template instantiation, which may be regarded as a
54 degenerate form of parsing. 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_O (deferred_access);
143 DEF_VEC_ALLOC_O (deferred_access,gc);
145 /* Data for deferred access checking. */
146 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
147 static GTY(()) unsigned deferred_access_no_check;
149 /* Save the current deferred access states and start deferred
150 access checking iff DEFER_P is true. */
153 push_deferring_access_checks (deferring_kind deferring)
155 /* For context like template instantiation, access checking
156 disabling applies to all nested context. */
157 if (deferred_access_no_check || deferring == dk_no_check)
158 deferred_access_no_check++;
161 deferred_access *ptr;
163 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
164 ptr->deferred_access_checks = NULL_TREE;
165 ptr->deferring_access_checks_kind = deferring;
169 /* Resume deferring access checks again after we stopped doing
173 resume_deferring_access_checks (void)
175 if (!deferred_access_no_check)
176 VEC_last (deferred_access, deferred_access_stack)
177 ->deferring_access_checks_kind = dk_deferred;
180 /* Stop deferring access checks. */
183 stop_deferring_access_checks (void)
185 if (!deferred_access_no_check)
186 VEC_last (deferred_access, deferred_access_stack)
187 ->deferring_access_checks_kind = dk_no_deferred;
190 /* Discard the current deferred access checks and restore the
194 pop_deferring_access_checks (void)
196 if (deferred_access_no_check)
197 deferred_access_no_check--;
199 VEC_pop (deferred_access, deferred_access_stack);
202 /* Returns a TREE_LIST representing the deferred checks.
203 The TREE_PURPOSE of each node is the type through which the
204 access occurred; the TREE_VALUE is the declaration named.
208 get_deferred_access_checks (void)
210 if (deferred_access_no_check)
213 return (VEC_last (deferred_access, deferred_access_stack)
214 ->deferred_access_checks);
217 /* Take current deferred checks and combine with the
218 previous states if we also defer checks previously.
219 Otherwise perform checks now. */
222 pop_to_parent_deferring_access_checks (void)
224 if (deferred_access_no_check)
225 deferred_access_no_check--;
229 deferred_access *ptr;
231 checks = (VEC_last (deferred_access, deferred_access_stack)
232 ->deferred_access_checks);
234 VEC_pop (deferred_access, deferred_access_stack);
235 ptr = VEC_last (deferred_access, deferred_access_stack);
236 if (ptr->deferring_access_checks_kind == dk_no_deferred)
239 for (; checks; checks = TREE_CHAIN (checks))
240 enforce_access (TREE_PURPOSE (checks),
241 TREE_VALUE (checks));
245 /* Merge with parent. */
247 tree original = ptr->deferred_access_checks;
249 for (; checks; checks = next)
253 next = TREE_CHAIN (checks);
255 for (probe = original; probe; probe = TREE_CHAIN (probe))
256 if (TREE_VALUE (probe) == TREE_VALUE (checks)
257 && TREE_PURPOSE (probe) == TREE_PURPOSE (checks))
259 /* Insert into parent's checks. */
260 TREE_CHAIN (checks) = ptr->deferred_access_checks;
261 ptr->deferred_access_checks = checks;
268 /* Perform the deferred access checks.
270 After performing the checks, we still have to keep the list
271 `deferred_access_stack->deferred_access_checks' since we may want
272 to check access for them again later in a different context.
279 A::X A::a, x; // No error for `A::a', error for `x'
281 We have to perform deferred access of `A::X', first with `A::a',
285 perform_deferred_access_checks (void)
289 for (deferred_check = get_deferred_access_checks ();
291 deferred_check = TREE_CHAIN (deferred_check))
293 enforce_access (TREE_PURPOSE (deferred_check),
294 TREE_VALUE (deferred_check));
297 /* Defer checking the accessibility of DECL, when looked up in
301 perform_or_defer_access_check (tree binfo, tree decl)
304 deferred_access *ptr;
306 /* Exit if we are in a context that no access checking is performed.
308 if (deferred_access_no_check)
311 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
313 ptr = VEC_last (deferred_access, deferred_access_stack);
315 /* If we are not supposed to defer access checks, just check now. */
316 if (ptr->deferring_access_checks_kind == dk_no_deferred)
318 enforce_access (binfo, decl);
322 /* See if we are already going to perform this check. */
323 for (check = ptr->deferred_access_checks;
325 check = TREE_CHAIN (check))
326 if (TREE_VALUE (check) == decl && TREE_PURPOSE (check) == binfo)
328 /* If not, record the check. */
329 ptr->deferred_access_checks
330 = tree_cons (binfo, decl, ptr->deferred_access_checks);
333 /* Returns nonzero if the current statement is a full expression,
334 i.e. temporaries created during that statement should be destroyed
335 at the end of the statement. */
338 stmts_are_full_exprs_p (void)
340 return current_stmt_tree ()->stmts_are_full_exprs_p;
343 /* T is a statement. Add it to the statement-tree. This is the C++
344 version. The C/ObjC frontends have a slightly different version of
350 enum tree_code code = TREE_CODE (t);
352 if (EXPR_P (t) && code != LABEL_EXPR)
354 if (!EXPR_HAS_LOCATION (t))
355 SET_EXPR_LOCATION (t, input_location);
357 /* When we expand a statement-tree, we must know whether or not the
358 statements are full-expressions. We record that fact here. */
359 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
362 /* Add T to the statement-tree. Non-side-effect statements need to be
363 recorded during statement expressions. */
364 append_to_statement_list_force (t, &cur_stmt_list);
369 /* Returns the stmt_tree (if any) to which statements are currently
370 being added. If there is no active statement-tree, NULL is
374 current_stmt_tree (void)
377 ? &cfun->language->base.x_stmt_tree
378 : &scope_chain->x_stmt_tree);
381 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
384 maybe_cleanup_point_expr (tree expr)
386 if (!processing_template_decl && stmts_are_full_exprs_p ())
387 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
391 /* Like maybe_cleanup_point_expr except have the type of the new expression be
392 void so we don't need to create a temporary variable to hold the inner
393 expression. The reason why we do this is because the original type might be
394 an aggregate and we cannot create a temporary variable for that type. */
397 maybe_cleanup_point_expr_void (tree expr)
399 if (!processing_template_decl && stmts_are_full_exprs_p ())
400 expr = fold_build_cleanup_point_expr (void_type_node, expr);
406 /* Create a declaration statement for the declaration given by the DECL. */
409 add_decl_expr (tree decl)
411 tree r = build_stmt (DECL_EXPR, decl);
412 if (DECL_INITIAL (decl)
413 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
414 r = maybe_cleanup_point_expr_void (r);
418 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
419 flag for this because "A union for which objects or pointers are
420 declared is not an anonymous union" [class.union]. */
423 anon_aggr_type_p (tree node)
425 return ANON_AGGR_TYPE_P (node);
428 /* Finish a scope. */
431 do_poplevel (tree stmt_list)
435 if (stmts_are_full_exprs_p ())
436 block = poplevel (kept_level_p (), 1, 0);
438 stmt_list = pop_stmt_list (stmt_list);
440 if (!processing_template_decl)
442 stmt_list = c_build_bind_expr (block, stmt_list);
443 /* ??? See c_end_compound_stmt re statement expressions. */
449 /* Begin a new scope. */
452 do_pushlevel (scope_kind sk)
454 tree ret = push_stmt_list ();
455 if (stmts_are_full_exprs_p ())
456 begin_scope (sk, NULL);
460 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
461 when the current scope is exited. EH_ONLY is true when this is not
462 meant to apply to normal control flow transfer. */
465 push_cleanup (tree decl, tree cleanup, bool eh_only)
467 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
468 CLEANUP_EH_ONLY (stmt) = eh_only;
470 CLEANUP_BODY (stmt) = push_stmt_list ();
473 /* Begin a conditional that might contain a declaration. When generating
474 normal code, we want the declaration to appear before the statement
475 containing the conditional. When generating template code, we want the
476 conditional to be rendered as the raw DECL_EXPR. */
479 begin_cond (tree *cond_p)
481 if (processing_template_decl)
482 *cond_p = push_stmt_list ();
485 /* Finish such a conditional. */
488 finish_cond (tree *cond_p, tree expr)
490 if (processing_template_decl)
492 tree cond = pop_stmt_list (*cond_p);
493 if (TREE_CODE (cond) == DECL_EXPR)
499 /* If *COND_P specifies a conditional with a declaration, transform the
502 for (; A x = 42;) { }
504 while (true) { A x = 42; if (!x) break; }
505 for (;;) { A x = 42; if (!x) break; }
506 The statement list for BODY will be empty if the conditional did
507 not declare anything. */
510 simplify_loop_decl_cond (tree *cond_p, tree body)
514 if (!TREE_SIDE_EFFECTS (body))
518 *cond_p = boolean_true_node;
520 if_stmt = begin_if_stmt ();
521 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
522 finish_if_stmt_cond (cond, if_stmt);
523 finish_break_stmt ();
524 finish_then_clause (if_stmt);
525 finish_if_stmt (if_stmt);
528 /* Finish a goto-statement. */
531 finish_goto_stmt (tree destination)
533 if (TREE_CODE (destination) == IDENTIFIER_NODE)
534 destination = lookup_label (destination);
536 /* We warn about unused labels with -Wunused. That means we have to
537 mark the used labels as used. */
538 if (TREE_CODE (destination) == LABEL_DECL)
539 TREE_USED (destination) = 1;
542 /* The DESTINATION is being used as an rvalue. */
543 if (!processing_template_decl)
544 destination = decay_conversion (destination);
545 /* We don't inline calls to functions with computed gotos.
546 Those functions are typically up to some funny business,
547 and may be depending on the labels being at particular
548 addresses, or some such. */
549 DECL_UNINLINABLE (current_function_decl) = 1;
552 check_goto (destination);
554 return add_stmt (build_stmt (GOTO_EXPR, destination));
557 /* COND is the condition-expression for an if, while, etc.,
558 statement. Convert it to a boolean value, if appropriate. */
561 maybe_convert_cond (tree cond)
563 /* Empty conditions remain empty. */
567 /* Wait until we instantiate templates before doing conversion. */
568 if (processing_template_decl)
571 /* Do the conversion. */
572 cond = convert_from_reference (cond);
573 return condition_conversion (cond);
576 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
579 finish_expr_stmt (tree expr)
583 if (expr != NULL_TREE)
585 if (!processing_template_decl)
587 if (warn_sequence_point)
588 verify_sequence_points (expr);
589 expr = convert_to_void (expr, "statement");
591 else if (!type_dependent_expression_p (expr))
592 convert_to_void (build_non_dependent_expr (expr), "statement");
594 /* Simplification of inner statement expressions, compound exprs,
595 etc can result in us already having an EXPR_STMT. */
596 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
598 if (TREE_CODE (expr) != EXPR_STMT)
599 expr = build_stmt (EXPR_STMT, expr);
600 expr = maybe_cleanup_point_expr_void (expr);
612 /* Begin an if-statement. Returns a newly created IF_STMT if
619 scope = do_pushlevel (sk_block);
620 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
621 TREE_CHAIN (r) = scope;
622 begin_cond (&IF_COND (r));
626 /* Process the COND of an if-statement, which may be given by
630 finish_if_stmt_cond (tree cond, tree if_stmt)
632 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
634 THEN_CLAUSE (if_stmt) = push_stmt_list ();
637 /* Finish the then-clause of an if-statement, which may be given by
641 finish_then_clause (tree if_stmt)
643 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
647 /* Begin the else-clause of an if-statement. */
650 begin_else_clause (tree if_stmt)
652 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
655 /* Finish the else-clause of an if-statement, which may be given by
659 finish_else_clause (tree if_stmt)
661 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
664 /* Finish an if-statement. */
667 finish_if_stmt (tree if_stmt)
669 tree scope = TREE_CHAIN (if_stmt);
670 TREE_CHAIN (if_stmt) = NULL;
671 add_stmt (do_poplevel (scope));
675 /* Begin a while-statement. Returns a newly created WHILE_STMT if
679 begin_while_stmt (void)
682 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
684 WHILE_BODY (r) = do_pushlevel (sk_block);
685 begin_cond (&WHILE_COND (r));
689 /* Process the COND of a while-statement, which may be given by
693 finish_while_stmt_cond (tree cond, tree while_stmt)
695 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
696 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
699 /* Finish a while-statement, which may be given by WHILE_STMT. */
702 finish_while_stmt (tree while_stmt)
704 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
708 /* Begin a do-statement. Returns a newly created DO_STMT if
714 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
716 DO_BODY (r) = push_stmt_list ();
720 /* Finish the body of a do-statement, which may be given by DO_STMT. */
723 finish_do_body (tree do_stmt)
725 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
728 /* Finish a do-statement, which may be given by DO_STMT, and whose
729 COND is as indicated. */
732 finish_do_stmt (tree cond, tree do_stmt)
734 cond = maybe_convert_cond (cond);
735 DO_COND (do_stmt) = cond;
739 /* Finish a return-statement. The EXPRESSION returned, if any, is as
743 finish_return_stmt (tree expr)
747 expr = check_return_expr (expr);
748 if (!processing_template_decl)
750 if (DECL_DESTRUCTOR_P (current_function_decl)
751 || (DECL_CONSTRUCTOR_P (current_function_decl)
752 && targetm.cxx.cdtor_returns_this ()))
754 /* Similarly, all destructors must run destructors for
755 base-classes before returning. So, all returns in a
756 destructor get sent to the DTOR_LABEL; finish_function emits
757 code to return a value there. */
758 return finish_goto_stmt (cdtor_label);
762 r = build_stmt (RETURN_EXPR, expr);
763 r = maybe_cleanup_point_expr_void (r);
770 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
773 begin_for_stmt (void)
777 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
778 NULL_TREE, NULL_TREE);
780 if (flag_new_for_scope > 0)
781 TREE_CHAIN (r) = do_pushlevel (sk_for);
783 if (processing_template_decl)
784 FOR_INIT_STMT (r) = push_stmt_list ();
789 /* Finish the for-init-statement of a for-statement, which may be
790 given by FOR_STMT. */
793 finish_for_init_stmt (tree for_stmt)
795 if (processing_template_decl)
796 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
798 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
799 begin_cond (&FOR_COND (for_stmt));
802 /* Finish the COND of a for-statement, which may be given by
806 finish_for_cond (tree cond, tree for_stmt)
808 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
809 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
812 /* Finish the increment-EXPRESSION in a for-statement, which may be
813 given by FOR_STMT. */
816 finish_for_expr (tree expr, tree for_stmt)
820 /* If EXPR is an overloaded function, issue an error; there is no
821 context available to use to perform overload resolution. */
822 if (type_unknown_p (expr))
824 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
825 expr = error_mark_node;
827 if (!processing_template_decl)
829 if (warn_sequence_point)
830 verify_sequence_points (expr);
831 expr = convert_to_void (expr, "3rd expression in for");
833 else if (!type_dependent_expression_p (expr))
834 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for");
835 expr = maybe_cleanup_point_expr_void (expr);
836 FOR_EXPR (for_stmt) = expr;
839 /* Finish the body of a for-statement, which may be given by
840 FOR_STMT. The increment-EXPR for the loop must be
844 finish_for_stmt (tree for_stmt)
846 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
848 /* Pop the scope for the body of the loop. */
849 if (flag_new_for_scope > 0)
851 tree scope = TREE_CHAIN (for_stmt);
852 TREE_CHAIN (for_stmt) = NULL;
853 add_stmt (do_poplevel (scope));
859 /* Finish a break-statement. */
862 finish_break_stmt (void)
864 return add_stmt (build_stmt (BREAK_STMT));
867 /* Finish a continue-statement. */
870 finish_continue_stmt (void)
872 return add_stmt (build_stmt (CONTINUE_STMT));
875 /* Begin a switch-statement. Returns a new SWITCH_STMT if
879 begin_switch_stmt (void)
883 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
885 scope = do_pushlevel (sk_block);
886 TREE_CHAIN (r) = scope;
887 begin_cond (&SWITCH_STMT_COND (r));
892 /* Finish the cond of a switch-statement. */
895 finish_switch_cond (tree cond, tree switch_stmt)
897 tree orig_type = NULL;
898 if (!processing_template_decl)
902 /* Convert the condition to an integer or enumeration type. */
903 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
904 if (cond == NULL_TREE)
906 error ("switch quantity not an integer");
907 cond = error_mark_node;
909 orig_type = TREE_TYPE (cond);
910 if (cond != error_mark_node)
914 Integral promotions are performed. */
915 cond = perform_integral_promotions (cond);
916 cond = maybe_cleanup_point_expr (cond);
919 if (cond != error_mark_node)
921 index = get_unwidened (cond, NULL_TREE);
922 /* We can't strip a conversion from a signed type to an unsigned,
923 because if we did, int_fits_type_p would do the wrong thing
924 when checking case values for being in range,
925 and it's too hard to do the right thing. */
926 if (TYPE_UNSIGNED (TREE_TYPE (cond))
927 == TYPE_UNSIGNED (TREE_TYPE (index)))
931 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
932 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
933 add_stmt (switch_stmt);
934 push_switch (switch_stmt);
935 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
938 /* Finish the body of a switch-statement, which may be given by
939 SWITCH_STMT. The COND to switch on is indicated. */
942 finish_switch_stmt (tree switch_stmt)
946 SWITCH_STMT_BODY (switch_stmt) =
947 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
951 scope = TREE_CHAIN (switch_stmt);
952 TREE_CHAIN (switch_stmt) = NULL;
953 add_stmt (do_poplevel (scope));
956 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
960 begin_try_block (void)
962 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
964 TRY_STMTS (r) = push_stmt_list ();
968 /* Likewise, for a function-try-block. */
971 begin_function_try_block (void)
973 tree r = begin_try_block ();
974 FN_TRY_BLOCK_P (r) = 1;
978 /* Finish a try-block, which may be given by TRY_BLOCK. */
981 finish_try_block (tree try_block)
983 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
984 TRY_HANDLERS (try_block) = push_stmt_list ();
987 /* Finish the body of a cleanup try-block, which may be given by
991 finish_cleanup_try_block (tree try_block)
993 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
996 /* Finish an implicitly generated try-block, with a cleanup is given
1000 finish_cleanup (tree cleanup, tree try_block)
1002 TRY_HANDLERS (try_block) = cleanup;
1003 CLEANUP_P (try_block) = 1;
1006 /* Likewise, for a function-try-block. */
1009 finish_function_try_block (tree try_block)
1011 finish_try_block (try_block);
1012 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1013 the try block, but moving it inside. */
1014 in_function_try_handler = 1;
1017 /* Finish a handler-sequence for a try-block, which may be given by
1021 finish_handler_sequence (tree try_block)
1023 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1024 check_handlers (TRY_HANDLERS (try_block));
1027 /* Likewise, for a function-try-block. */
1030 finish_function_handler_sequence (tree try_block)
1032 in_function_try_handler = 0;
1033 finish_handler_sequence (try_block);
1036 /* Begin a handler. Returns a HANDLER if appropriate. */
1039 begin_handler (void)
1043 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1046 /* Create a binding level for the eh_info and the exception object
1048 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1053 /* Finish the handler-parameters for a handler, which may be given by
1054 HANDLER. DECL is the declaration for the catch parameter, or NULL
1055 if this is a `catch (...)' clause. */
1058 finish_handler_parms (tree decl, tree handler)
1060 tree type = NULL_TREE;
1061 if (processing_template_decl)
1065 decl = pushdecl (decl);
1066 decl = push_template_decl (decl);
1067 HANDLER_PARMS (handler) = decl;
1068 type = TREE_TYPE (decl);
1072 type = expand_start_catch_block (decl);
1074 HANDLER_TYPE (handler) = type;
1075 if (!processing_template_decl && type)
1076 mark_used (eh_type_info (type));
1079 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1080 the return value from the matching call to finish_handler_parms. */
1083 finish_handler (tree handler)
1085 if (!processing_template_decl)
1086 expand_end_catch_block ();
1087 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1090 /* Begin a compound statement. FLAGS contains some bits that control the
1091 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1092 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1093 block of a function. If BCS_TRY_BLOCK is set, this is the block
1094 created on behalf of a TRY statement. Returns a token to be passed to
1095 finish_compound_stmt. */
1098 begin_compound_stmt (unsigned int flags)
1102 if (flags & BCS_NO_SCOPE)
1104 r = push_stmt_list ();
1105 STATEMENT_LIST_NO_SCOPE (r) = 1;
1107 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1108 But, if it's a statement-expression with a scopeless block, there's
1109 nothing to keep, and we don't want to accidentally keep a block
1110 *inside* the scopeless block. */
1111 keep_next_level (false);
1114 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1116 /* When processing a template, we need to remember where the braces were,
1117 so that we can set up identical scopes when instantiating the template
1118 later. BIND_EXPR is a handy candidate for this.
1119 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1120 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1121 processing templates. */
1122 if (processing_template_decl)
1124 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1125 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1126 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1127 TREE_SIDE_EFFECTS (r) = 1;
1133 /* Finish a compound-statement, which is given by STMT. */
1136 finish_compound_stmt (tree stmt)
1138 if (TREE_CODE (stmt) == BIND_EXPR)
1139 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1140 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1141 stmt = pop_stmt_list (stmt);
1144 /* Destroy any ObjC "super" receivers that may have been
1146 objc_clear_super_receiver ();
1148 stmt = do_poplevel (stmt);
1151 /* ??? See c_end_compound_stmt wrt statement expressions. */
1156 /* Finish an asm-statement, whose components are a STRING, some
1157 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1158 whether the asm-statement should be considered volatile. */
1161 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1162 tree input_operands, tree clobbers)
1167 if (!processing_template_decl)
1169 int ninputs, noutputs;
1170 const char *constraint;
1171 const char **oconstraints;
1172 bool allows_mem, allows_reg, is_inout;
1176 ninputs = list_length (input_operands);
1177 noutputs = list_length (output_operands);
1178 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1180 string = resolve_asm_operand_names (string, output_operands,
1183 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1185 operand = TREE_VALUE (t);
1187 /* ??? Really, this should not be here. Users should be using a
1188 proper lvalue, dammit. But there's a long history of using
1189 casts in the output operands. In cases like longlong.h, this
1190 becomes a primitive form of typechecking -- if the cast can be
1191 removed, then the output operand had a type of the proper width;
1192 otherwise we'll get an error. Gross, but ... */
1193 STRIP_NOPS (operand);
1195 if (!lvalue_or_else (operand, lv_asm))
1196 operand = error_mark_node;
1198 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1199 oconstraints[i] = constraint;
1201 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1202 &allows_mem, &allows_reg, &is_inout))
1204 /* If the operand is going to end up in memory,
1205 mark it addressable. */
1206 if (!allows_reg && !cxx_mark_addressable (operand))
1207 operand = error_mark_node;
1210 operand = error_mark_node;
1212 TREE_VALUE (t) = operand;
1215 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1217 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1218 operand = decay_conversion (TREE_VALUE (t));
1220 /* If the type of the operand hasn't been determined (e.g.,
1221 because it involves an overloaded function), then issue
1222 an error message. There's no context available to
1223 resolve the overloading. */
1224 if (TREE_TYPE (operand) == unknown_type_node)
1226 error ("type of asm operand %qE could not be determined",
1228 operand = error_mark_node;
1231 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1232 oconstraints, &allows_mem, &allows_reg))
1234 /* If the operand is going to end up in memory,
1235 mark it addressable. */
1236 if (!allows_reg && allows_mem)
1238 /* Strip the nops as we allow this case. FIXME, this really
1239 should be rejected or made deprecated. */
1240 STRIP_NOPS (operand);
1241 if (!cxx_mark_addressable (operand))
1242 operand = error_mark_node;
1246 operand = error_mark_node;
1248 TREE_VALUE (t) = operand;
1252 r = build_stmt (ASM_EXPR, string,
1253 output_operands, input_operands,
1255 ASM_VOLATILE_P (r) = volatile_p;
1256 r = maybe_cleanup_point_expr_void (r);
1257 return add_stmt (r);
1260 /* Finish a label with the indicated NAME. */
1263 finish_label_stmt (tree name)
1265 tree decl = define_label (input_location, name);
1266 return add_stmt (build_stmt (LABEL_EXPR, decl));
1269 /* Finish a series of declarations for local labels. G++ allows users
1270 to declare "local" labels, i.e., labels with scope. This extension
1271 is useful when writing code involving statement-expressions. */
1274 finish_label_decl (tree name)
1276 tree decl = declare_local_label (name);
1277 add_decl_expr (decl);
1280 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1283 finish_decl_cleanup (tree decl, tree cleanup)
1285 push_cleanup (decl, cleanup, false);
1288 /* If the current scope exits with an exception, run CLEANUP. */
1291 finish_eh_cleanup (tree cleanup)
1293 push_cleanup (NULL, cleanup, true);
1296 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1297 order they were written by the user. Each node is as for
1298 emit_mem_initializers. */
1301 finish_mem_initializers (tree mem_inits)
1303 /* Reorder the MEM_INITS so that they are in the order they appeared
1304 in the source program. */
1305 mem_inits = nreverse (mem_inits);
1307 if (processing_template_decl)
1308 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1310 emit_mem_initializers (mem_inits);
1313 /* Finish a parenthesized expression EXPR. */
1316 finish_parenthesized_expr (tree expr)
1319 /* This inhibits warnings in c_common_truthvalue_conversion. */
1320 TREE_NO_WARNING (expr) = 1;
1322 if (TREE_CODE (expr) == OFFSET_REF)
1323 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1324 enclosed in parentheses. */
1325 PTRMEM_OK_P (expr) = 0;
1327 if (TREE_CODE (expr) == STRING_CST)
1328 PAREN_STRING_LITERAL_P (expr) = 1;
1333 /* Finish a reference to a non-static data member (DECL) that is not
1334 preceded by `.' or `->'. */
1337 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1339 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1343 if (current_function_decl
1344 && DECL_STATIC_FUNCTION_P (current_function_decl))
1345 error ("invalid use of member %q+D in static member function", decl);
1347 error ("invalid use of non-static data member %q+D", decl);
1348 error ("from this location");
1350 return error_mark_node;
1352 TREE_USED (current_class_ptr) = 1;
1353 if (processing_template_decl && !qualifying_scope)
1355 tree type = TREE_TYPE (decl);
1357 if (TREE_CODE (type) == REFERENCE_TYPE)
1358 type = TREE_TYPE (type);
1361 /* Set the cv qualifiers. */
1362 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1364 if (DECL_MUTABLE_P (decl))
1365 quals &= ~TYPE_QUAL_CONST;
1367 quals |= cp_type_quals (TREE_TYPE (decl));
1368 type = cp_build_qualified_type (type, quals);
1371 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1375 tree access_type = TREE_TYPE (object);
1376 tree lookup_context = context_for_name_lookup (decl);
1378 while (!DERIVED_FROM_P (lookup_context, access_type))
1380 access_type = TYPE_CONTEXT (access_type);
1381 while (access_type && DECL_P (access_type))
1382 access_type = DECL_CONTEXT (access_type);
1386 error ("object missing in reference to %q+D", decl);
1387 error ("from this location");
1388 return error_mark_node;
1392 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1393 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1395 if (processing_template_decl)
1396 return build_min (SCOPE_REF, TREE_TYPE (decl),
1397 qualifying_scope, DECL_NAME (decl));
1399 perform_or_defer_access_check (TYPE_BINFO (access_type), decl);
1401 /* If the data member was named `C::M', convert `*this' to `C'
1403 if (qualifying_scope)
1405 tree binfo = NULL_TREE;
1406 object = build_scoped_ref (object, qualifying_scope,
1410 return build_class_member_access_expr (object, decl,
1411 /*access_path=*/NULL_TREE,
1412 /*preserve_reference=*/false);
1416 /* DECL was the declaration to which a qualified-id resolved. Issue
1417 an error message if it is not accessible. If OBJECT_TYPE is
1418 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1419 type of `*x', or `x', respectively. If the DECL was named as
1420 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1423 check_accessibility_of_qualified_id (tree decl,
1425 tree nested_name_specifier)
1428 tree qualifying_type = NULL_TREE;
1430 /* If we're not checking, return immediately. */
1431 if (deferred_access_no_check)
1434 /* Determine the SCOPE of DECL. */
1435 scope = context_for_name_lookup (decl);
1436 /* If the SCOPE is not a type, then DECL is not a member. */
1437 if (!TYPE_P (scope))
1439 /* Compute the scope through which DECL is being accessed. */
1441 /* OBJECT_TYPE might not be a class type; consider:
1443 class A { typedef int I; };
1447 In this case, we will have "A::I" as the DECL, but "I" as the
1449 && CLASS_TYPE_P (object_type)
1450 && DERIVED_FROM_P (scope, object_type))
1451 /* If we are processing a `->' or `.' expression, use the type of the
1453 qualifying_type = object_type;
1454 else if (nested_name_specifier)
1456 /* If the reference is to a non-static member of the
1457 current class, treat it as if it were referenced through
1459 if (DECL_NONSTATIC_MEMBER_P (decl)
1460 && current_class_ptr
1461 && DERIVED_FROM_P (scope, current_class_type))
1462 qualifying_type = current_class_type;
1463 /* Otherwise, use the type indicated by the
1464 nested-name-specifier. */
1466 qualifying_type = nested_name_specifier;
1469 /* Otherwise, the name must be from the current class or one of
1471 qualifying_type = currently_open_derived_class (scope);
1473 if (qualifying_type && IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type)))
1474 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1475 or similar in a default argument value. */
1476 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl);
1479 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1480 class named to the left of the "::" operator. DONE is true if this
1481 expression is a complete postfix-expression; it is false if this
1482 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1483 iff this expression is the operand of '&'. */
1486 finish_qualified_id_expr (tree qualifying_class, tree expr, bool done,
1489 if (error_operand_p (expr))
1490 return error_mark_node;
1492 /* If EXPR occurs as the operand of '&', use special handling that
1493 permits a pointer-to-member. */
1494 if (address_p && done)
1496 if (TREE_CODE (expr) == SCOPE_REF)
1497 expr = TREE_OPERAND (expr, 1);
1498 expr = build_offset_ref (qualifying_class, expr,
1499 /*address_p=*/true);
1503 if (TREE_CODE (expr) == FIELD_DECL)
1504 expr = finish_non_static_data_member (expr, current_class_ref,
1506 else if (BASELINK_P (expr) && !processing_template_decl)
1510 /* See if any of the functions are non-static members. */
1511 fns = BASELINK_FUNCTIONS (expr);
1512 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1513 fns = TREE_OPERAND (fns, 0);
1514 /* If so, the expression may be relative to the current
1516 if (!shared_member_p (fns)
1517 && current_class_type
1518 && DERIVED_FROM_P (qualifying_class, current_class_type))
1519 expr = (build_class_member_access_expr
1520 (maybe_dummy_object (qualifying_class, NULL),
1522 BASELINK_ACCESS_BINFO (expr),
1523 /*preserve_reference=*/false));
1525 /* The expression is a qualified name whose address is not
1527 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1533 /* Begin a statement-expression. The value returned must be passed to
1534 finish_stmt_expr. */
1537 begin_stmt_expr (void)
1539 return push_stmt_list ();
1542 /* Process the final expression of a statement expression. EXPR can be
1543 NULL, if the final expression is empty. Return a STATEMENT_LIST
1544 containing all the statements in the statement-expression, or
1545 ERROR_MARK_NODE if there was an error. */
1548 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1550 if (error_operand_p (expr))
1551 return error_mark_node;
1553 /* If the last statement does not have "void" type, then the value
1554 of the last statement is the value of the entire expression. */
1558 type = TREE_TYPE (expr);
1559 if (!dependent_type_p (type) && !VOID_TYPE_P (type))
1561 expr = decay_conversion (expr);
1562 if (error_operand_p (expr))
1563 return error_mark_node;
1564 type = TREE_TYPE (expr);
1566 /* The type of the statement-expression is the type of the last
1568 TREE_TYPE (stmt_expr) = type;
1569 /* We must take particular care if TYPE is a class type. In
1570 paticular if EXPR creates a temporary of class type, then it
1571 must be destroyed at the semicolon terminating the last
1572 statement -- but we must make a copy before that happens.
1574 This problem is solved by using a TARGET_EXPR to initialize a
1575 new temporary variable. The TARGET_EXPR itself is placed
1576 outside the statement-expression. However, the last
1577 statement in the statement-expression is transformed from
1578 EXPR to (approximately) T = EXPR, where T is the new
1579 temporary variable. Thus, the lifetime of the new temporary
1580 extends to the full-expression surrounding the
1581 statement-expression. */
1582 if (!processing_template_decl && !VOID_TYPE_P (type))
1585 if (CLASS_TYPE_P (type)
1586 && !TYPE_HAS_TRIVIAL_INIT_REF (type))
1588 target_expr = build_target_expr_with_type (expr, type);
1589 expr = TARGET_EXPR_INITIAL (target_expr);
1593 /* Normally, build_target_expr will not create a
1594 TARGET_EXPR for scalars. However, we need the
1595 temporary here, in order to solve the scoping
1596 problem described above. */
1597 target_expr = force_target_expr (type, expr);
1598 expr = TARGET_EXPR_INITIAL (target_expr);
1599 expr = build2 (INIT_EXPR,
1601 TARGET_EXPR_SLOT (target_expr),
1604 TARGET_EXPR_INITIAL (target_expr) = NULL_TREE;
1605 /* Save away the TARGET_EXPR in the TREE_TYPE field of the
1606 STATEMENT_EXPR. We will retrieve it in
1607 finish_stmt_expr. */
1608 TREE_TYPE (stmt_expr) = target_expr;
1612 /* Having modified EXPR to reflect the extra initialization, we now
1613 treat it just like an ordinary statement. */
1614 expr = finish_expr_stmt (expr);
1616 /* Mark the last statement so that we can recognize it as such at
1617 template-instantiation time. */
1618 if (expr && processing_template_decl)
1619 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1624 /* Finish a statement-expression. EXPR should be the value returned
1625 by the previous begin_stmt_expr. Returns an expression
1626 representing the statement-expression. */
1629 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1634 if (error_operand_p (stmt_expr))
1635 return error_mark_node;
1637 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1639 type = TREE_TYPE (stmt_expr);
1640 result = pop_stmt_list (stmt_expr);
1642 if (processing_template_decl)
1644 result = build_min (STMT_EXPR, type, result);
1645 TREE_SIDE_EFFECTS (result) = 1;
1646 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1648 else if (!TYPE_P (type))
1650 gcc_assert (TREE_CODE (type) == TARGET_EXPR);
1651 TARGET_EXPR_INITIAL (type) = result;
1652 TREE_TYPE (result) = void_type_node;
1659 /* Perform Koenig lookup. FN is the postfix-expression representing
1660 the function (or functions) to call; ARGS are the arguments to the
1661 call. Returns the functions to be considered by overload
1665 perform_koenig_lookup (tree fn, tree args)
1667 tree identifier = NULL_TREE;
1668 tree functions = NULL_TREE;
1670 /* Find the name of the overloaded function. */
1671 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1673 else if (is_overloaded_fn (fn))
1676 identifier = DECL_NAME (get_first_fn (functions));
1678 else if (DECL_P (fn))
1681 identifier = DECL_NAME (fn);
1684 /* A call to a namespace-scope function using an unqualified name.
1686 Do Koenig lookup -- unless any of the arguments are
1688 if (!any_type_dependent_arguments_p (args))
1690 fn = lookup_arg_dependent (identifier, functions, args);
1692 /* The unqualified name could not be resolved. */
1693 fn = unqualified_fn_lookup_error (identifier);
1699 /* Generate an expression for `FN (ARGS)'.
1701 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1702 as a virtual call, even if FN is virtual. (This flag is set when
1703 encountering an expression where the function name is explicitly
1704 qualified. For example a call to `X::f' never generates a virtual
1707 Returns code for the call. */
1710 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1716 if (fn == error_mark_node || args == error_mark_node)
1717 return error_mark_node;
1719 /* ARGS should be a list of arguments. */
1720 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1725 if (processing_template_decl)
1727 if (type_dependent_expression_p (fn)
1728 || any_type_dependent_arguments_p (args))
1730 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1731 KOENIG_LOOKUP_P (result) = koenig_p;
1734 if (!BASELINK_P (fn)
1735 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1736 && TREE_TYPE (fn) != unknown_type_node)
1737 fn = build_non_dependent_expr (fn);
1738 args = build_non_dependent_args (orig_args);
1741 /* A reference to a member function will appear as an overloaded
1742 function (rather than a BASELINK) if an unqualified name was used
1744 if (!BASELINK_P (fn) && is_overloaded_fn (fn))
1748 if (TREE_CODE (f) == TEMPLATE_ID_EXPR)
1749 f = TREE_OPERAND (f, 0);
1750 f = get_first_fn (f);
1751 if (DECL_FUNCTION_MEMBER_P (f))
1753 tree type = currently_open_derived_class (DECL_CONTEXT (f));
1755 type = DECL_CONTEXT (f);
1756 fn = build_baselink (TYPE_BINFO (type),
1758 fn, /*optype=*/NULL_TREE);
1763 if (BASELINK_P (fn))
1767 /* A call to a member function. From [over.call.func]:
1769 If the keyword this is in scope and refers to the class of
1770 that member function, or a derived class thereof, then the
1771 function call is transformed into a qualified function call
1772 using (*this) as the postfix-expression to the left of the
1773 . operator.... [Otherwise] a contrived object of type T
1774 becomes the implied object argument.
1776 This paragraph is unclear about this situation:
1778 struct A { void f(); };
1779 struct B : public A {};
1780 struct C : public A { void g() { B::f(); }};
1782 In particular, for `B::f', this paragraph does not make clear
1783 whether "the class of that member function" refers to `A' or
1784 to `B'. We believe it refers to `B'. */
1785 if (current_class_type
1786 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1788 && current_class_ref)
1789 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1793 tree representative_fn;
1795 representative_fn = BASELINK_FUNCTIONS (fn);
1796 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1797 representative_fn = TREE_OPERAND (representative_fn, 0);
1798 representative_fn = get_first_fn (representative_fn);
1799 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1802 if (processing_template_decl)
1804 if (type_dependent_expression_p (object))
1805 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1806 object = build_non_dependent_expr (object);
1809 result = build_new_method_call (object, fn, args, NULL_TREE,
1811 ? LOOKUP_NONVIRTUAL : 0));
1813 else if (is_overloaded_fn (fn))
1815 /* If the function is an overloaded builtin, resolve it. */
1816 if (TREE_CODE (fn) == FUNCTION_DECL
1817 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1818 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1819 result = resolve_overloaded_builtin (fn, args);
1822 /* A call to a namespace-scope function. */
1823 result = build_new_function_call (fn, args);
1825 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1828 error ("arguments to destructor are not allowed");
1829 /* Mark the pseudo-destructor call as having side-effects so
1830 that we do not issue warnings about its use. */
1831 result = build1 (NOP_EXPR,
1833 TREE_OPERAND (fn, 0));
1834 TREE_SIDE_EFFECTS (result) = 1;
1836 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1837 /* If the "function" is really an object of class type, it might
1838 have an overloaded `operator ()'. */
1839 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1840 /*overloaded_p=*/NULL);
1843 /* A call where the function is unknown. */
1844 result = build_function_call (fn, args);
1846 if (processing_template_decl)
1848 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1849 orig_args, NULL_TREE);
1850 KOENIG_LOOKUP_P (result) = koenig_p;
1855 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1856 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1857 POSTDECREMENT_EXPR.) */
1860 finish_increment_expr (tree expr, enum tree_code code)
1862 return build_x_unary_op (code, expr);
1865 /* Finish a use of `this'. Returns an expression for `this'. */
1868 finish_this_expr (void)
1872 if (current_class_ptr)
1874 result = current_class_ptr;
1876 else if (current_function_decl
1877 && DECL_STATIC_FUNCTION_P (current_function_decl))
1879 error ("%<this%> is unavailable for static member functions");
1880 result = error_mark_node;
1884 if (current_function_decl)
1885 error ("invalid use of %<this%> in non-member function");
1887 error ("invalid use of %<this%> at top level");
1888 result = error_mark_node;
1894 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1895 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1896 the TYPE for the type given. If SCOPE is non-NULL, the expression
1897 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1900 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1902 if (destructor == error_mark_node)
1903 return error_mark_node;
1905 gcc_assert (TYPE_P (destructor));
1907 if (!processing_template_decl)
1909 if (scope == error_mark_node)
1911 error ("invalid qualifying scope in pseudo-destructor name");
1912 return error_mark_node;
1915 /* [expr.pseudo] says both:
1917 The type designated by the pseudo-destructor-name shall be
1918 the same as the object type.
1922 The cv-unqualified versions of the object type and of the
1923 type designated by the pseudo-destructor-name shall be the
1926 We implement the more generous second sentence, since that is
1927 what most other compilers do. */
1928 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1931 error ("%qE is not of type %qT", object, destructor);
1932 return error_mark_node;
1936 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1939 /* Finish an expression of the form CODE EXPR. */
1942 finish_unary_op_expr (enum tree_code code, tree expr)
1944 tree result = build_x_unary_op (code, expr);
1945 /* Inside a template, build_x_unary_op does not fold the
1946 expression. So check whether the result is folded before
1947 setting TREE_NEGATED_INT. */
1948 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1949 && TREE_CODE (result) == INTEGER_CST
1950 && !TYPE_UNSIGNED (TREE_TYPE (result))
1951 && INT_CST_LT (result, integer_zero_node))
1953 /* RESULT may be a cached INTEGER_CST, so we must copy it before
1954 setting TREE_NEGATED_INT. */
1955 result = copy_node (result);
1956 TREE_NEGATED_INT (result) = 1;
1958 overflow_warning (result);
1962 /* Finish a compound-literal expression. TYPE is the type to which
1963 the INITIALIZER_LIST is being cast. */
1966 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
1968 tree compound_literal;
1970 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
1971 compound_literal = build_constructor (NULL_TREE, initializer_list);
1972 /* Mark it as a compound-literal. */
1973 if (processing_template_decl)
1974 TREE_TYPE (compound_literal) = type;
1977 /* Check the initialization. */
1978 compound_literal = digest_init (type, compound_literal);
1979 /* If the TYPE was an array type with an unknown bound, then we can
1980 figure out the dimension now. For example, something like:
1984 implies that the array has two elements. */
1985 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type))
1986 cp_complete_array_type (&TREE_TYPE (compound_literal),
1987 compound_literal, 1);
1990 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
1991 return compound_literal;
1994 /* Return the declaration for the function-name variable indicated by
1998 finish_fname (tree id)
2002 decl = fname_decl (C_RID_CODE (id), id);
2003 if (processing_template_decl)
2004 decl = DECL_NAME (decl);
2008 /* Finish a translation unit. */
2011 finish_translation_unit (void)
2013 /* In case there were missing closebraces,
2014 get us back to the global binding level. */
2016 while (current_namespace != global_namespace)
2019 /* Do file scope __FUNCTION__ et al. */
2020 finish_fname_decls ();
2023 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2024 Returns the parameter. */
2027 finish_template_type_parm (tree aggr, tree identifier)
2029 if (aggr != class_type_node)
2031 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2032 aggr = class_type_node;
2035 return build_tree_list (aggr, identifier);
2038 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2039 Returns the parameter. */
2042 finish_template_template_parm (tree aggr, tree identifier)
2044 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2045 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2046 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2047 DECL_TEMPLATE_RESULT (tmpl) = decl;
2048 DECL_ARTIFICIAL (decl) = 1;
2049 end_template_decl ();
2051 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2053 return finish_template_type_parm (aggr, tmpl);
2056 /* ARGUMENT is the default-argument value for a template template
2057 parameter. If ARGUMENT is invalid, issue error messages and return
2058 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2061 check_template_template_default_arg (tree argument)
2063 if (TREE_CODE (argument) != TEMPLATE_DECL
2064 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2065 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2067 if (TREE_CODE (argument) == TYPE_DECL)
2069 tree t = TREE_TYPE (argument);
2071 /* Try to emit a slightly smarter error message if we detect
2072 that the user is using a template instantiation. */
2073 if (CLASSTYPE_TEMPLATE_INFO (t)
2074 && CLASSTYPE_TEMPLATE_INSTANTIATION (t))
2075 error ("invalid use of type %qT as a default value for a "
2076 "template template-parameter", t);
2078 error ("invalid use of %qD as a default value for a template "
2079 "template-parameter", argument);
2082 error ("invalid default argument for a template template parameter");
2083 return error_mark_node;
2089 /* Begin a class definition, as indicated by T. */
2092 begin_class_definition (tree t)
2094 if (t == error_mark_node)
2095 return error_mark_node;
2097 if (processing_template_parmlist)
2099 error ("definition of %q#T inside template parameter list", t);
2100 return error_mark_node;
2102 /* A non-implicit typename comes from code like:
2104 template <typename T> struct A {
2105 template <typename U> struct A<T>::B ...
2107 This is erroneous. */
2108 else if (TREE_CODE (t) == TYPENAME_TYPE)
2110 error ("invalid definition of qualified type %qT", t);
2111 t = error_mark_node;
2114 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2116 t = make_aggr_type (RECORD_TYPE);
2117 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2120 /* Update the location of the decl. */
2121 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2123 if (TYPE_BEING_DEFINED (t))
2125 t = make_aggr_type (TREE_CODE (t));
2126 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2128 maybe_process_partial_specialization (t);
2130 TYPE_BEING_DEFINED (t) = 1;
2131 if (flag_pack_struct)
2134 TYPE_PACKED (t) = 1;
2135 /* Even though the type is being defined for the first time
2136 here, there might have been a forward declaration, so there
2137 might be cv-qualified variants of T. */
2138 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2139 TYPE_PACKED (v) = 1;
2141 /* Reset the interface data, at the earliest possible
2142 moment, as it might have been set via a class foo;
2144 if (! TYPE_ANONYMOUS_P (t))
2146 struct c_fileinfo *finfo = get_fileinfo (lbasename (input_filename));
2147 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2148 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2149 (t, finfo->interface_unknown);
2151 reset_specialization();
2153 /* Make a declaration for this class in its own scope. */
2154 build_self_reference ();
2159 /* Finish the member declaration given by DECL. */
2162 finish_member_declaration (tree decl)
2164 if (decl == error_mark_node || decl == NULL_TREE)
2167 if (decl == void_type_node)
2168 /* The COMPONENT was a friend, not a member, and so there's
2169 nothing for us to do. */
2172 /* We should see only one DECL at a time. */
2173 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2175 /* Set up access control for DECL. */
2177 = (current_access_specifier == access_private_node);
2178 TREE_PROTECTED (decl)
2179 = (current_access_specifier == access_protected_node);
2180 if (TREE_CODE (decl) == TEMPLATE_DECL)
2182 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2183 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2186 /* Mark the DECL as a member of the current class. */
2187 DECL_CONTEXT (decl) = current_class_type;
2191 A C language linkage is ignored for the names of class members
2192 and the member function type of class member functions. */
2193 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2194 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2196 /* Put functions on the TYPE_METHODS list and everything else on the
2197 TYPE_FIELDS list. Note that these are built up in reverse order.
2198 We reverse them (to obtain declaration order) in finish_struct. */
2199 if (TREE_CODE (decl) == FUNCTION_DECL
2200 || DECL_FUNCTION_TEMPLATE_P (decl))
2202 /* We also need to add this function to the
2203 CLASSTYPE_METHOD_VEC. */
2204 add_method (current_class_type, decl, NULL_TREE);
2206 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2207 TYPE_METHODS (current_class_type) = decl;
2209 maybe_add_class_template_decl_list (current_class_type, decl,
2212 /* Enter the DECL into the scope of the class. */
2213 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2214 || pushdecl_class_level (decl))
2216 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2217 go at the beginning. The reason is that lookup_field_1
2218 searches the list in order, and we want a field name to
2219 override a type name so that the "struct stat hack" will
2220 work. In particular:
2222 struct S { enum E { }; int E } s;
2225 is valid. In addition, the FIELD_DECLs must be maintained in
2226 declaration order so that class layout works as expected.
2227 However, we don't need that order until class layout, so we
2228 save a little time by putting FIELD_DECLs on in reverse order
2229 here, and then reversing them in finish_struct_1. (We could
2230 also keep a pointer to the correct insertion points in the
2233 if (TREE_CODE (decl) == TYPE_DECL)
2234 TYPE_FIELDS (current_class_type)
2235 = chainon (TYPE_FIELDS (current_class_type), decl);
2238 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2239 TYPE_FIELDS (current_class_type) = decl;
2242 maybe_add_class_template_decl_list (current_class_type, decl,
2247 note_decl_for_pch (decl);
2250 /* DECL has been declared while we are building a PCH file. Perform
2251 actions that we might normally undertake lazily, but which can be
2252 performed now so that they do not have to be performed in
2253 translation units which include the PCH file. */
2256 note_decl_for_pch (tree decl)
2258 gcc_assert (pch_file);
2260 /* A non-template inline function with external linkage will always
2261 be COMDAT. As we must eventually determine the linkage of all
2262 functions, and as that causes writes to the data mapped in from
2263 the PCH file, it's advantageous to mark the functions at this
2265 if (TREE_CODE (decl) == FUNCTION_DECL
2266 && TREE_PUBLIC (decl)
2267 && DECL_DECLARED_INLINE_P (decl)
2268 && !DECL_IMPLICIT_INSTANTIATION (decl))
2270 comdat_linkage (decl);
2271 DECL_INTERFACE_KNOWN (decl) = 1;
2274 /* There's a good chance that we'll have to mangle names at some
2275 point, even if only for emission in debugging information. */
2276 if (TREE_CODE (decl) == VAR_DECL
2277 || TREE_CODE (decl) == FUNCTION_DECL)
2281 /* Finish processing a complete template declaration. The PARMS are
2282 the template parameters. */
2285 finish_template_decl (tree parms)
2288 end_template_decl ();
2290 end_specialization ();
2293 /* Finish processing a template-id (which names a type) of the form
2294 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2295 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2296 the scope of template-id indicated. */
2299 finish_template_type (tree name, tree args, int entering_scope)
2303 decl = lookup_template_class (name, args,
2304 NULL_TREE, NULL_TREE, entering_scope,
2305 tf_error | tf_warning | tf_user);
2306 if (decl != error_mark_node)
2307 decl = TYPE_STUB_DECL (decl);
2312 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2313 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2314 BASE_CLASS, or NULL_TREE if an error occurred. The
2315 ACCESS_SPECIFIER is one of
2316 access_{default,public,protected_private}_node. For a virtual base
2317 we set TREE_TYPE. */
2320 finish_base_specifier (tree base, tree access, bool virtual_p)
2324 if (base == error_mark_node)
2326 error ("invalid base-class specification");
2329 else if (! is_aggr_type (base, 1))
2333 if (cp_type_quals (base) != 0)
2335 error ("base class %qT has cv qualifiers", base);
2336 base = TYPE_MAIN_VARIANT (base);
2338 result = build_tree_list (access, base);
2340 TREE_TYPE (result) = integer_type_node;
2346 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2347 what we found when we tried to do the lookup. */
2350 qualified_name_lookup_error (tree scope, tree name, tree decl)
2352 if (scope == error_mark_node)
2353 ; /* We already complained. */
2354 else if (TYPE_P (scope))
2356 if (!COMPLETE_TYPE_P (scope))
2357 error ("incomplete type %qT used in nested name specifier", scope);
2358 else if (TREE_CODE (decl) == TREE_LIST)
2360 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2361 print_candidates (decl);
2364 error ("%qD is not a member of %qT", name, scope);
2366 else if (scope != global_namespace)
2367 error ("%qD is not a member of %qD", name, scope);
2369 error ("%<::%D%> has not been declared", name);
2372 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2373 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2374 if non-NULL, is the type or namespace used to explicitly qualify
2375 ID_EXPRESSION. DECL is the entity to which that name has been
2378 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2379 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2380 be set to true if this expression isn't permitted in a
2381 constant-expression, but it is otherwise not set by this function.
2382 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2383 constant-expression, but a non-constant expression is also
2386 If an error occurs, and it is the kind of error that might cause
2387 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2388 is the caller's responsibility to issue the message. *ERROR_MSG
2389 will be a string with static storage duration, so the caller need
2392 Return an expression for the entity, after issuing appropriate
2393 diagnostics. This function is also responsible for transforming a
2394 reference to a non-static member into a COMPONENT_REF that makes
2395 the use of "this" explicit.
2397 Upon return, *IDK will be filled in appropriately. */
2400 finish_id_expression (tree id_expression,
2404 tree *qualifying_class,
2405 bool integral_constant_expression_p,
2406 bool allow_non_integral_constant_expression_p,
2407 bool *non_integral_constant_expression_p,
2408 const char **error_msg)
2410 /* Initialize the output parameters. */
2411 *idk = CP_ID_KIND_NONE;
2414 if (id_expression == error_mark_node)
2415 return error_mark_node;
2416 /* If we have a template-id, then no further lookup is
2417 required. If the template-id was for a template-class, we
2418 will sometimes have a TYPE_DECL at this point. */
2419 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2420 || TREE_CODE (decl) == TYPE_DECL)
2422 /* Look up the name. */
2425 if (decl == error_mark_node)
2427 /* Name lookup failed. */
2430 || (!dependent_type_p (scope)
2431 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2432 && IDENTIFIER_TYPENAME_P (id_expression)
2433 && dependent_type_p (TREE_TYPE (id_expression))))))
2435 /* If the qualifying type is non-dependent (and the name
2436 does not name a conversion operator to a dependent
2437 type), issue an error. */
2438 qualified_name_lookup_error (scope, id_expression, decl);
2439 return error_mark_node;
2443 /* It may be resolved via Koenig lookup. */
2444 *idk = CP_ID_KIND_UNQUALIFIED;
2445 return id_expression;
2448 decl = id_expression;
2450 /* If DECL is a variable that would be out of scope under
2451 ANSI/ISO rules, but in scope in the ARM, name lookup
2452 will succeed. Issue a diagnostic here. */
2454 decl = check_for_out_of_scope_variable (decl);
2456 /* Remember that the name was used in the definition of
2457 the current class so that we can check later to see if
2458 the meaning would have been different after the class
2459 was entirely defined. */
2460 if (!scope && decl != error_mark_node)
2461 maybe_note_name_used_in_class (id_expression, decl);
2464 /* If we didn't find anything, or what we found was a type,
2465 then this wasn't really an id-expression. */
2466 if (TREE_CODE (decl) == TEMPLATE_DECL
2467 && !DECL_FUNCTION_TEMPLATE_P (decl))
2469 *error_msg = "missing template arguments";
2470 return error_mark_node;
2472 else if (TREE_CODE (decl) == TYPE_DECL
2473 || TREE_CODE (decl) == NAMESPACE_DECL)
2475 *error_msg = "expected primary-expression";
2476 return error_mark_node;
2479 /* If the name resolved to a template parameter, there is no
2480 need to look it up again later. */
2481 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2482 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2486 *idk = CP_ID_KIND_NONE;
2487 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2488 decl = TEMPLATE_PARM_DECL (decl);
2489 r = convert_from_reference (DECL_INITIAL (decl));
2491 if (integral_constant_expression_p
2492 && !dependent_type_p (TREE_TYPE (decl))
2493 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2495 if (!allow_non_integral_constant_expression_p)
2496 error ("template parameter %qD of type %qT is not allowed in "
2497 "an integral constant expression because it is not of "
2498 "integral or enumeration type", decl, TREE_TYPE (decl));
2499 *non_integral_constant_expression_p = true;
2503 /* Similarly, we resolve enumeration constants to their
2504 underlying values. */
2505 else if (TREE_CODE (decl) == CONST_DECL)
2507 *idk = CP_ID_KIND_NONE;
2508 if (!processing_template_decl)
2509 return DECL_INITIAL (decl);
2516 /* If the declaration was explicitly qualified indicate
2517 that. The semantics of `A::f(3)' are different than
2518 `f(3)' if `f' is virtual. */
2520 ? CP_ID_KIND_QUALIFIED
2521 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2522 ? CP_ID_KIND_TEMPLATE_ID
2523 : CP_ID_KIND_UNQUALIFIED));
2528 An id-expression is type-dependent if it contains an
2529 identifier that was declared with a dependent type.
2531 The standard is not very specific about an id-expression that
2532 names a set of overloaded functions. What if some of them
2533 have dependent types and some of them do not? Presumably,
2534 such a name should be treated as a dependent name. */
2535 /* Assume the name is not dependent. */
2536 dependent_p = false;
2537 if (!processing_template_decl)
2538 /* No names are dependent outside a template. */
2540 /* A template-id where the name of the template was not resolved
2541 is definitely dependent. */
2542 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2543 && (TREE_CODE (TREE_OPERAND (decl, 0))
2544 == IDENTIFIER_NODE))
2546 /* For anything except an overloaded function, just check its
2548 else if (!is_overloaded_fn (decl))
2550 = dependent_type_p (TREE_TYPE (decl));
2551 /* For a set of overloaded functions, check each of the
2557 if (BASELINK_P (fns))
2558 fns = BASELINK_FUNCTIONS (fns);
2560 /* For a template-id, check to see if the template
2561 arguments are dependent. */
2562 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2564 tree args = TREE_OPERAND (fns, 1);
2565 dependent_p = any_dependent_template_arguments_p (args);
2566 /* The functions are those referred to by the
2568 fns = TREE_OPERAND (fns, 0);
2571 /* If there are no dependent template arguments, go through
2572 the overloaded functions. */
2573 while (fns && !dependent_p)
2575 tree fn = OVL_CURRENT (fns);
2577 /* Member functions of dependent classes are
2579 if (TREE_CODE (fn) == FUNCTION_DECL
2580 && type_dependent_expression_p (fn))
2582 else if (TREE_CODE (fn) == TEMPLATE_DECL
2583 && dependent_template_p (fn))
2586 fns = OVL_NEXT (fns);
2590 /* If the name was dependent on a template parameter, we will
2591 resolve the name at instantiation time. */
2594 /* Create a SCOPE_REF for qualified names, if the scope is
2599 *qualifying_class = scope;
2600 /* Since this name was dependent, the expression isn't
2601 constant -- yet. No error is issued because it might
2602 be constant when things are instantiated. */
2603 if (integral_constant_expression_p)
2604 *non_integral_constant_expression_p = true;
2605 if (TYPE_P (scope) && dependent_type_p (scope))
2606 return build_nt (SCOPE_REF, scope, id_expression);
2607 else if (TYPE_P (scope) && DECL_P (decl))
2608 return convert_from_reference
2609 (build2 (SCOPE_REF, TREE_TYPE (decl), scope, id_expression));
2611 return convert_from_reference (decl);
2613 /* A TEMPLATE_ID already contains all the information we
2615 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2616 return id_expression;
2617 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2618 /* If we found a variable, then name lookup during the
2619 instantiation will always resolve to the same VAR_DECL
2620 (or an instantiation thereof). */
2621 if (TREE_CODE (decl) == VAR_DECL
2622 || TREE_CODE (decl) == PARM_DECL)
2623 return convert_from_reference (decl);
2624 /* The same is true for FIELD_DECL, but we also need to
2625 make sure that the syntax is correct. */
2626 else if (TREE_CODE (decl) == FIELD_DECL)
2628 /* Since SCOPE is NULL here, this is an unqualified name.
2629 Access checking has been performed during name lookup
2630 already. Turn off checking to avoid duplicate errors. */
2631 push_deferring_access_checks (dk_no_check);
2632 decl = finish_non_static_data_member
2633 (decl, current_class_ref,
2634 /*qualifying_scope=*/NULL_TREE);
2635 pop_deferring_access_checks ();
2638 return id_expression;
2641 /* Only certain kinds of names are allowed in constant
2642 expression. Enumerators and template parameters have already
2643 been handled above. */
2644 if (integral_constant_expression_p
2645 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2646 && ! builtin_valid_in_constant_expr_p (decl))
2648 if (!allow_non_integral_constant_expression_p)
2650 error ("%qD cannot appear in a constant-expression", decl);
2651 return error_mark_node;
2653 *non_integral_constant_expression_p = true;
2656 if (TREE_CODE (decl) == NAMESPACE_DECL)
2658 error ("use of namespace %qD as expression", decl);
2659 return error_mark_node;
2661 else if (DECL_CLASS_TEMPLATE_P (decl))
2663 error ("use of class template %qT as expression", decl);
2664 return error_mark_node;
2666 else if (TREE_CODE (decl) == TREE_LIST)
2668 /* Ambiguous reference to base members. */
2669 error ("request for member %qD is ambiguous in "
2670 "multiple inheritance lattice", id_expression);
2671 print_candidates (decl);
2672 return error_mark_node;
2675 /* Mark variable-like entities as used. Functions are similarly
2676 marked either below or after overload resolution. */
2677 if (TREE_CODE (decl) == VAR_DECL
2678 || TREE_CODE (decl) == PARM_DECL
2679 || TREE_CODE (decl) == RESULT_DECL)
2684 decl = (adjust_result_of_qualified_name_lookup
2685 (decl, scope, current_class_type));
2687 if (TREE_CODE (decl) == FUNCTION_DECL)
2690 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2691 *qualifying_class = scope;
2694 tree r = convert_from_reference (decl);
2696 if (processing_template_decl
2698 r = build2 (SCOPE_REF, TREE_TYPE (r), scope, decl);
2702 else if (TREE_CODE (decl) == FIELD_DECL)
2704 /* Since SCOPE is NULL here, this is an unqualified name.
2705 Access checking has been performed during name lookup
2706 already. Turn off checking to avoid duplicate errors. */
2707 push_deferring_access_checks (dk_no_check);
2708 decl = finish_non_static_data_member (decl, current_class_ref,
2709 /*qualifying_scope=*/NULL_TREE);
2710 pop_deferring_access_checks ();
2712 else if (is_overloaded_fn (decl))
2714 tree first_fn = OVL_CURRENT (decl);
2716 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2717 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2719 if (!really_overloaded_fn (decl))
2720 mark_used (first_fn);
2722 if (TREE_CODE (first_fn) == FUNCTION_DECL
2723 && DECL_FUNCTION_MEMBER_P (first_fn)
2724 && !shared_member_p (decl))
2726 /* A set of member functions. */
2727 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2728 return finish_class_member_access_expr (decl, id_expression);
2733 if (TREE_CODE (decl) == VAR_DECL
2734 || TREE_CODE (decl) == PARM_DECL
2735 || TREE_CODE (decl) == RESULT_DECL)
2737 tree context = decl_function_context (decl);
2739 if (context != NULL_TREE && context != current_function_decl
2740 && ! TREE_STATIC (decl))
2742 error (TREE_CODE (decl) == VAR_DECL
2743 ? "use of %<auto%> variable from containing function"
2744 : "use of parameter from containing function");
2745 error (" %q+#D declared here", decl);
2746 return error_mark_node;
2750 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2751 && DECL_CLASS_SCOPE_P (decl)
2752 && DECL_CONTEXT (decl) != current_class_type)
2756 path = currently_open_derived_class (DECL_CONTEXT (decl));
2757 perform_or_defer_access_check (TYPE_BINFO (path), decl);
2760 decl = convert_from_reference (decl);
2763 /* Resolve references to variables of anonymous unions
2764 into COMPONENT_REFs. */
2765 if (TREE_CODE (decl) == ALIAS_DECL)
2766 decl = unshare_expr (DECL_INITIAL (decl));
2769 if (TREE_DEPRECATED (decl))
2770 warn_deprecated_use (decl);
2775 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2776 use as a type-specifier. */
2779 finish_typeof (tree expr)
2783 if (type_dependent_expression_p (expr))
2785 type = make_aggr_type (TYPEOF_TYPE);
2786 TYPEOF_TYPE_EXPR (type) = expr;
2791 type = TREE_TYPE (expr);
2793 if (!type || type == unknown_type_node)
2795 error ("type of %qE is unknown", expr);
2796 return error_mark_node;
2802 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2803 with equivalent CALL_EXPRs. */
2806 simplify_aggr_init_exprs_r (tree* tp,
2808 void* data ATTRIBUTE_UNUSED)
2810 /* We don't need to walk into types; there's nothing in a type that
2811 needs simplification. (And, furthermore, there are places we
2812 actively don't want to go. For example, we don't want to wander
2813 into the default arguments for a FUNCTION_DECL that appears in a
2820 /* Only AGGR_INIT_EXPRs are interesting. */
2821 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2824 simplify_aggr_init_expr (tp);
2826 /* Keep iterating. */
2830 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2831 function is broken out from the above for the benefit of the tree-ssa
2835 simplify_aggr_init_expr (tree *tp)
2837 tree aggr_init_expr = *tp;
2839 /* Form an appropriate CALL_EXPR. */
2840 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2841 tree args = TREE_OPERAND (aggr_init_expr, 1);
2842 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2843 tree type = TREE_TYPE (slot);
2846 enum style_t { ctor, arg, pcc } style;
2848 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2850 #ifdef PCC_STATIC_STRUCT_RETURN
2856 gcc_assert (TREE_ADDRESSABLE (type));
2862 /* Replace the first argument to the ctor with the address of the
2866 args = TREE_CHAIN (args);
2867 cxx_mark_addressable (slot);
2868 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2869 args = tree_cons (NULL_TREE, addr, args);
2872 call_expr = build3 (CALL_EXPR,
2873 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
2874 fn, args, NULL_TREE);
2878 /* Just mark it addressable here, and leave the rest to
2879 expand_call{,_inline}. */
2880 cxx_mark_addressable (slot);
2881 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
2882 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
2884 else if (style == pcc)
2886 /* If we're using the non-reentrant PCC calling convention, then we
2887 need to copy the returned value out of the static buffer into the
2889 push_deferring_access_checks (dk_no_check);
2890 call_expr = build_aggr_init (slot, call_expr,
2891 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
2892 pop_deferring_access_checks ();
2893 call_expr = build (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
2899 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2902 emit_associated_thunks (tree fn)
2904 /* When we use vcall offsets, we emit thunks with the virtual
2905 functions to which they thunk. The whole point of vcall offsets
2906 is so that you can know statically the entire set of thunks that
2907 will ever be needed for a given virtual function, thereby
2908 enabling you to output all the thunks with the function itself. */
2909 if (DECL_VIRTUAL_P (fn))
2913 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
2915 if (!THUNK_ALIAS (thunk))
2917 use_thunk (thunk, /*emit_p=*/1);
2918 if (DECL_RESULT_THUNK_P (thunk))
2922 for (probe = DECL_THUNKS (thunk);
2923 probe; probe = TREE_CHAIN (probe))
2924 use_thunk (probe, /*emit_p=*/1);
2928 gcc_assert (!DECL_THUNKS (thunk));
2933 /* Generate RTL for FN. */
2936 expand_body (tree fn)
2938 tree saved_function;
2940 /* Compute the appropriate object-file linkage for inline
2942 if (DECL_DECLARED_INLINE_P (fn))
2943 import_export_decl (fn);
2945 /* If FN is external, then there's no point in generating RTL for
2946 it. This situation can arise with an inline function under
2947 `-fexternal-templates'; we instantiate the function, even though
2948 we're not planning on emitting it, in case we get a chance to
2950 if (DECL_EXTERNAL (fn))
2953 /* ??? When is this needed? */
2954 saved_function = current_function_decl;
2956 /* Emit any thunks that should be emitted at the same time as FN. */
2957 emit_associated_thunks (fn);
2959 /* This function is only called from cgraph, or recursively from
2960 emit_associated_thunks. In neither case should we be currently
2961 generating trees for a function. */
2962 gcc_assert (function_depth == 0);
2964 tree_rest_of_compilation (fn);
2966 current_function_decl = saved_function;
2968 if (DECL_CLONED_FUNCTION_P (fn))
2970 /* If this is a clone, go through the other clones now and mark
2971 their parameters used. We have to do that here, as we don't
2972 know whether any particular clone will be expanded, and
2973 therefore cannot pick one arbitrarily. */
2976 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
2977 probe && DECL_CLONED_FUNCTION_P (probe);
2978 probe = TREE_CHAIN (probe))
2982 for (parms = DECL_ARGUMENTS (probe);
2983 parms; parms = TREE_CHAIN (parms))
2984 TREE_USED (parms) = 1;
2989 /* Generate RTL for FN. */
2992 expand_or_defer_fn (tree fn)
2994 /* When the parser calls us after finishing the body of a template
2995 function, we don't really want to expand the body. */
2996 if (processing_template_decl)
2998 /* Normally, collection only occurs in rest_of_compilation. So,
2999 if we don't collect here, we never collect junk generated
3000 during the processing of templates until we hit a
3001 non-template function. It's not safe to do this inside a
3002 nested class, though, as the parser may have local state that
3003 is not a GC root. */
3004 if (!function_depth)
3009 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3010 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3011 simplify_aggr_init_exprs_r,
3014 /* If this is a constructor or destructor body, we have to clone
3016 if (maybe_clone_body (fn))
3018 /* We don't want to process FN again, so pretend we've written
3019 it out, even though we haven't. */
3020 TREE_ASM_WRITTEN (fn) = 1;
3024 /* If this function is marked with the constructor attribute, add it
3025 to the list of functions to be called along with constructors
3026 from static duration objects. */
3027 if (DECL_STATIC_CONSTRUCTOR (fn))
3028 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
3030 /* If this function is marked with the destructor attribute, add it
3031 to the list of functions to be called along with destructors from
3032 static duration objects. */
3033 if (DECL_STATIC_DESTRUCTOR (fn))
3034 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
3036 /* We make a decision about linkage for these functions at the end
3037 of the compilation. Until that point, we do not want the back
3038 end to output them -- but we do want it to see the bodies of
3039 these functions so that it can inline them as appropriate. */
3040 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3044 DECL_EXTERNAL (fn) = 1;
3045 DECL_NOT_REALLY_EXTERN (fn) = 1;
3046 note_vague_linkage_fn (fn);
3049 import_export_decl (fn);
3051 /* If the user wants us to keep all inline functions, then mark
3052 this function as needed so that finish_file will make sure to
3054 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3058 /* There's no reason to do any of the work here if we're only doing
3059 semantic analysis; this code just generates RTL. */
3060 if (flag_syntax_only)
3065 /* Expand or defer, at the whim of the compilation unit manager. */
3066 cgraph_finalize_function (fn, function_depth > 1);
3078 /* Helper function for walk_tree, used by finalize_nrv below. */
3081 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3083 struct nrv_data *dp = (struct nrv_data *)data;
3086 /* No need to walk into types. There wouldn't be any need to walk into
3087 non-statements, except that we have to consider STMT_EXPRs. */
3090 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3091 but differs from using NULL_TREE in that it indicates that we care
3092 about the value of the RESULT_DECL. */
3093 else if (TREE_CODE (*tp) == RETURN_EXPR)
3094 TREE_OPERAND (*tp, 0) = dp->result;
3095 /* Change all cleanups for the NRV to only run when an exception is
3097 else if (TREE_CODE (*tp) == CLEANUP_STMT
3098 && CLEANUP_DECL (*tp) == dp->var)
3099 CLEANUP_EH_ONLY (*tp) = 1;
3100 /* Replace the DECL_EXPR for the NRV with an initialization of the
3101 RESULT_DECL, if needed. */
3102 else if (TREE_CODE (*tp) == DECL_EXPR
3103 && DECL_EXPR_DECL (*tp) == dp->var)
3106 if (DECL_INITIAL (dp->var)
3107 && DECL_INITIAL (dp->var) != error_mark_node)
3109 init = build2 (INIT_EXPR, void_type_node, dp->result,
3110 DECL_INITIAL (dp->var));
3111 DECL_INITIAL (dp->var) = error_mark_node;
3114 init = build_empty_stmt ();
3115 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3118 /* And replace all uses of the NRV with the RESULT_DECL. */
3119 else if (*tp == dp->var)
3122 /* Avoid walking into the same tree more than once. Unfortunately, we
3123 can't just use walk_tree_without duplicates because it would only call
3124 us for the first occurrence of dp->var in the function body. */
3125 slot = htab_find_slot (dp->visited, *tp, INSERT);
3131 /* Keep iterating. */
3135 /* Called from finish_function to implement the named return value
3136 optimization by overriding all the RETURN_EXPRs and pertinent
3137 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3138 RESULT_DECL for the function. */
3141 finalize_nrv (tree *tp, tree var, tree result)
3143 struct nrv_data data;
3145 /* Copy debugging information from VAR to RESULT. */
3146 DECL_NAME (result) = DECL_NAME (var);
3147 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3148 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3149 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3150 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3151 /* Don't forget that we take its address. */
3152 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3155 data.result = result;
3156 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3157 walk_tree (tp, finalize_nrv_r, &data, 0);
3158 htab_delete (data.visited);
3161 /* Perform initialization related to this module. */
3164 init_cp_semantics (void)
3168 #include "gt-cp-semantics.h"