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 Free Software Foundation, Inc.
7 Written by Mark Mitchell (mmitchell@usa.net) based on code found
8 formerly in parse.y and pt.c.
10 This file is part of GNU CC.
12 GNU CC is free software; you can redistribute it and/or modify it
13 under the terms of the GNU General Public License as published by
14 the Free Software Foundation; either version 2, or (at your option)
17 GNU CC is distributed in the hope that it will be useful, but
18 WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 General Public License for more details.
22 You should have received a copy of the GNU General Public License
23 along with GNU CC; see the file COPYING. If not, write to the Free
24 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
42 /* There routines provide a modular interface to perform many parsing
43 operations. They may therefore be used during actual parsing, or
44 during template instantiation, which may be regarded as a
45 degenerate form of parsing. Since the current g++ parser is
46 lacking in several respects, and will be reimplemented, we are
47 attempting to move most code that is not directly related to
48 parsing into this file; that will make implementing the new parser
49 much easier since it will be able to make use of these routines. */
51 static tree maybe_convert_cond
PARAMS ((tree
));
52 static tree simplify_aggr_init_exprs_r
PARAMS ((tree
*, int *, void *));
53 static void deferred_type_access_control
PARAMS ((void));
54 static void emit_associated_thunks
PARAMS ((tree
));
55 static void genrtl_try_block
PARAMS ((tree
));
56 static void genrtl_eh_spec_block
PARAMS ((tree
));
57 static void genrtl_handler
PARAMS ((tree
));
58 static void genrtl_ctor_stmt
PARAMS ((tree
));
59 static void genrtl_subobject
PARAMS ((tree
));
60 static void genrtl_named_return_value
PARAMS ((void));
61 static void cp_expand_stmt
PARAMS ((tree
));
62 static void genrtl_start_function
PARAMS ((tree
));
63 static void genrtl_finish_function
PARAMS ((tree
));
64 static tree clear_decl_rtl
PARAMS ((tree
*, int *, void *));
66 /* Finish processing the COND, the SUBSTMT condition for STMT. */
68 #define FINISH_COND(cond, stmt, substmt) \
70 if (last_tree != stmt) \
72 RECHAIN_STMTS (stmt, substmt); \
73 if (!processing_template_decl) \
75 cond = build_tree_list (substmt, cond); \
83 /* Returns non-zero if the current statement is a full expression,
84 i.e. temporaries created during that statement should be destroyed
85 at the end of the statement. */
88 stmts_are_full_exprs_p ()
90 return current_stmt_tree ()->stmts_are_full_exprs_p
;
93 /* Returns the stmt_tree (if any) to which statements are currently
94 being added. If there is no active statement-tree, NULL is
101 ? &cfun
->language
->x_stmt_tree
102 : &scope_chain
->x_stmt_tree
);
105 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
106 flag for this because "A union for which objects or pointers are
107 declared is not an anonymous union" [class.union]. */
110 anon_aggr_type_p (node
)
113 return (CLASS_TYPE_P (node
) && TYPE_LANG_SPECIFIC(node
)->anon_aggr
);
116 /* Finish a scope. */
121 tree block
= NULL_TREE
;
123 if (stmts_are_full_exprs_p ())
125 tree scope_stmts
= NULL_TREE
;
127 if (!processing_template_decl
)
128 scope_stmts
= add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0);
130 block
= poplevel (kept_level_p (), 1, 0);
131 if (block
&& !processing_template_decl
)
133 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
134 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
141 /* Begin a new scope. */
146 if (stmts_are_full_exprs_p ())
149 if (!processing_template_decl
)
150 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/0);
154 /* Finish a goto-statement. */
157 finish_goto_stmt (destination
)
160 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
161 destination
= lookup_label (destination
);
163 /* We warn about unused labels with -Wunused. That means we have to
164 mark the used labels as used. */
165 if (TREE_CODE (destination
) == LABEL_DECL
)
166 TREE_USED (destination
) = 1;
168 if (TREE_CODE (destination
) != LABEL_DECL
)
169 /* We don't inline calls to functions with computed gotos.
170 Those functions are typically up to some funny business,
171 and may be depending on the labels being at particular
172 addresses, or some such. */
173 DECL_UNINLINABLE (current_function_decl
) = 1;
175 check_goto (destination
);
177 return add_stmt (build_stmt (GOTO_STMT
, destination
));
180 /* COND is the condition-expression for an if, while, etc.,
181 statement. Convert it to a boolean value, if appropriate. */
184 maybe_convert_cond (cond
)
187 /* Empty conditions remain empty. */
191 /* Wait until we instantiate templates before doing conversion. */
192 if (processing_template_decl
)
195 /* Do the conversion. */
196 cond
= convert_from_reference (cond
);
197 return condition_conversion (cond
);
200 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
203 finish_expr_stmt (expr
)
208 if (expr
!= NULL_TREE
)
210 if (!processing_template_decl
211 && !(stmts_are_full_exprs_p ())
212 && ((TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
214 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
))
215 expr
= default_conversion (expr
);
217 if (stmts_are_full_exprs_p ())
218 expr
= convert_to_void (expr
, "statement");
220 r
= add_stmt (build_stmt (EXPR_STMT
, expr
));
225 /* This was an expression-statement, so we save the type of the
227 last_expr_type
= expr
? TREE_TYPE (expr
) : NULL_TREE
;
233 /* Begin an if-statement. Returns a newly created IF_STMT if
241 r
= build_stmt (IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
246 /* Process the COND of an if-statement, which may be given by
250 finish_if_stmt_cond (cond
, if_stmt
)
254 cond
= maybe_convert_cond (cond
);
255 FINISH_COND (cond
, if_stmt
, IF_COND (if_stmt
));
258 /* Finish the then-clause of an if-statement, which may be given by
262 finish_then_clause (if_stmt
)
265 RECHAIN_STMTS (if_stmt
, THEN_CLAUSE (if_stmt
));
270 /* Begin the else-clause of an if-statement. */
277 /* Finish the else-clause of an if-statement, which may be given by
281 finish_else_clause (if_stmt
)
284 RECHAIN_STMTS (if_stmt
, ELSE_CLAUSE (if_stmt
));
287 /* Finish an if-statement. */
299 /* If COND wasn't a declaration, clear out the
300 block we made for it and start a new one here so the
301 optimization in expand_end_loop will work. */
302 if (getdecls () == NULL_TREE
)
309 /* Begin a while-statement. Returns a newly created WHILE_STMT if
316 r
= build_stmt (WHILE_STMT
, NULL_TREE
, NULL_TREE
);
322 /* Process the COND of a while-statement, which may be given by
326 finish_while_stmt_cond (cond
, while_stmt
)
330 cond
= maybe_convert_cond (cond
);
331 FINISH_COND (cond
, while_stmt
, WHILE_COND (while_stmt
));
335 /* Finish a while-statement, which may be given by WHILE_STMT. */
338 finish_while_stmt (while_stmt
)
342 RECHAIN_STMTS (while_stmt
, WHILE_BODY (while_stmt
));
346 /* Begin a do-statement. Returns a newly created DO_STMT if
352 tree r
= build_stmt (DO_STMT
, NULL_TREE
, NULL_TREE
);
357 /* Finish the body of a do-statement, which may be given by DO_STMT. */
360 finish_do_body (do_stmt
)
363 RECHAIN_STMTS (do_stmt
, DO_BODY (do_stmt
));
366 /* Finish a do-statement, which may be given by DO_STMT, and whose
367 COND is as indicated. */
370 finish_do_stmt (cond
, do_stmt
)
374 cond
= maybe_convert_cond (cond
);
375 DO_COND (do_stmt
) = cond
;
379 /* Finish a return-statement. The EXPRESSION returned, if any, is as
383 finish_return_stmt (expr
)
388 if (!processing_template_decl
)
389 expr
= check_return_expr (expr
);
390 if (!processing_template_decl
)
392 if (DECL_CONSTRUCTOR_P (current_function_decl
) && ctor_label
)
394 /* Even returns without a value in a constructor must return
395 `this'. We accomplish this by sending all returns in a
396 constructor to the CTOR_LABEL; finish_function emits code to
397 return a value there. When we finally generate the real
398 return statement, CTOR_LABEL is no longer set, and we fall
399 through into the normal return-processing code below. */
400 return finish_goto_stmt (ctor_label
);
402 else if (DECL_DESTRUCTOR_P (current_function_decl
))
404 /* Similarly, all destructors must run destructors for
405 base-classes before returning. So, all returns in a
406 destructor get sent to the DTOR_LABEL; finish_function emits
407 code to return a value there. */
408 return finish_goto_stmt (dtor_label
);
411 r
= add_stmt (build_stmt (RETURN_STMT
, expr
));
417 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
424 r
= build_stmt (FOR_STMT
, NULL_TREE
, NULL_TREE
,
425 NULL_TREE
, NULL_TREE
);
426 NEW_FOR_SCOPE_P (r
) = flag_new_for_scope
> 0;
428 if (NEW_FOR_SCOPE_P (r
))
431 note_level_for_for ();
437 /* Finish the for-init-statement of a for-statement, which may be
438 given by FOR_STMT. */
441 finish_for_init_stmt (for_stmt
)
444 if (last_tree
!= for_stmt
)
445 RECHAIN_STMTS (for_stmt
, FOR_INIT_STMT (for_stmt
));
449 /* Finish the COND of a for-statement, which may be given by
453 finish_for_cond (cond
, for_stmt
)
457 cond
= maybe_convert_cond (cond
);
458 FINISH_COND (cond
, for_stmt
, FOR_COND (for_stmt
));
462 /* Finish the increment-EXPRESSION in a for-statement, which may be
463 given by FOR_STMT. */
466 finish_for_expr (expr
, for_stmt
)
470 FOR_EXPR (for_stmt
) = expr
;
473 /* Finish the body of a for-statement, which may be given by
474 FOR_STMT. The increment-EXPR for the loop must be
478 finish_for_stmt (for_stmt
)
481 /* Pop the scope for the body of the loop. */
483 RECHAIN_STMTS (for_stmt
, FOR_BODY (for_stmt
));
484 if (NEW_FOR_SCOPE_P (for_stmt
))
489 /* Finish a break-statement. */
494 return add_stmt (build_break_stmt ());
497 /* Finish a continue-statement. */
500 finish_continue_stmt ()
502 return add_stmt (build_continue_stmt ());
505 /* Begin a switch-statement. Returns a new SWITCH_STMT if
512 r
= build_stmt (SWITCH_STMT
, NULL_TREE
, NULL_TREE
);
518 /* Finish the cond of a switch-statement. */
521 finish_switch_cond (cond
, switch_stmt
)
525 if (!processing_template_decl
)
530 /* Convert the condition to an integer or enumeration type. */
531 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, 1);
532 if (cond
== NULL_TREE
)
534 error ("switch quantity not an integer");
535 cond
= error_mark_node
;
537 if (cond
!= error_mark_node
)
539 cond
= default_conversion (cond
);
540 cond
= fold (build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (cond
), cond
));
543 type
= TREE_TYPE (cond
);
544 index
= get_unwidened (cond
, NULL_TREE
);
545 /* We can't strip a conversion from a signed type to an unsigned,
546 because if we did, int_fits_type_p would do the wrong thing
547 when checking case values for being in range,
548 and it's too hard to do the right thing. */
549 if (TREE_UNSIGNED (TREE_TYPE (cond
))
550 == TREE_UNSIGNED (TREE_TYPE (index
)))
553 FINISH_COND (cond
, switch_stmt
, SWITCH_COND (switch_stmt
));
554 push_switch (switch_stmt
);
557 /* Finish the body of a switch-statement, which may be given by
558 SWITCH_STMT. The COND to switch on is indicated. */
561 finish_switch_stmt (switch_stmt
)
564 RECHAIN_STMTS (switch_stmt
, SWITCH_BODY (switch_stmt
));
570 /* Generate the RTL for T, which is a TRY_BLOCK. */
578 expand_eh_region_start ();
579 expand_stmt (TRY_STMTS (t
));
580 expand_eh_region_end_cleanup (TRY_HANDLERS (t
));
584 if (!FN_TRY_BLOCK_P (t
))
585 emit_line_note (input_filename
, lineno
);
587 expand_eh_region_start ();
588 expand_stmt (TRY_STMTS (t
));
590 if (FN_TRY_BLOCK_P (t
))
592 end_protect_partials ();
593 expand_start_all_catch ();
594 in_function_try_handler
= 1;
595 expand_stmt (TRY_HANDLERS (t
));
596 in_function_try_handler
= 0;
597 expand_end_all_catch ();
601 expand_start_all_catch ();
602 expand_stmt (TRY_HANDLERS (t
));
603 expand_end_all_catch ();
608 /* Generate the RTL for T, which is an EH_SPEC_BLOCK. */
611 genrtl_eh_spec_block (t
)
614 expand_eh_region_start ();
615 expand_stmt (EH_SPEC_STMTS (t
));
616 expand_eh_region_end_allowed (EH_SPEC_RAISES (t
),
617 build_call (call_unexpected_node
,
618 tree_cons (NULL_TREE
,
623 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
629 tree r
= build_stmt (TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
634 /* Likewise, for a function-try-block. */
637 begin_function_try_block ()
639 tree r
= build_stmt (TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
640 FN_TRY_BLOCK_P (r
) = 1;
645 /* Finish a try-block, which may be given by TRY_BLOCK. */
648 finish_try_block (try_block
)
651 RECHAIN_STMTS (try_block
, TRY_STMTS (try_block
));
654 /* Finish the body of a cleanup try-block, which may be given by
658 finish_cleanup_try_block (try_block
)
661 RECHAIN_STMTS (try_block
, TRY_STMTS (try_block
));
664 /* Finish an implicitly generated try-block, with a cleanup is given
668 finish_cleanup (cleanup
, try_block
)
672 TRY_HANDLERS (try_block
) = cleanup
;
673 CLEANUP_P (try_block
) = 1;
676 /* Likewise, for a function-try-block. */
679 finish_function_try_block (try_block
)
682 if (TREE_CHAIN (try_block
)
683 && TREE_CODE (TREE_CHAIN (try_block
)) == CTOR_INITIALIZER
)
685 /* Chain the compound statement after the CTOR_INITIALIZER. */
686 TREE_CHAIN (TREE_CHAIN (try_block
)) = last_tree
;
687 /* And make the CTOR_INITIALIZER the body of the try-block. */
688 RECHAIN_STMTS (try_block
, TRY_STMTS (try_block
));
691 RECHAIN_STMTS (try_block
, TRY_STMTS (try_block
));
692 in_function_try_handler
= 1;
695 /* Finish a handler-sequence for a try-block, which may be given by
699 finish_handler_sequence (try_block
)
702 RECHAIN_STMTS (try_block
, TRY_HANDLERS (try_block
));
703 check_handlers (TRY_HANDLERS (try_block
));
706 /* Likewise, for a function-try-block. */
709 finish_function_handler_sequence (try_block
)
712 in_function_try_handler
= 0;
713 RECHAIN_STMTS (try_block
, TRY_HANDLERS (try_block
));
714 check_handlers (TRY_HANDLERS (try_block
));
717 /* Generate the RTL for T, which is a HANDLER. */
723 genrtl_do_pushlevel ();
724 if (!processing_template_decl
)
725 expand_start_catch (HANDLER_TYPE (t
));
726 expand_stmt (HANDLER_BODY (t
));
727 if (!processing_template_decl
)
731 /* Begin a handler. Returns a HANDLER if appropriate. */
737 r
= build_stmt (HANDLER
, NULL_TREE
, NULL_TREE
);
739 /* Create a binding level for the eh_info and the exception object
742 note_level_for_catch ();
746 /* Finish the handler-parameters for a handler, which may be given by
747 HANDLER. DECL is the declaration for the catch parameter, or NULL
748 if this is a `catch (...)' clause. */
751 finish_handler_parms (decl
, handler
)
755 tree type
= NULL_TREE
;
756 if (processing_template_decl
)
760 decl
= pushdecl (decl
);
761 decl
= push_template_decl (decl
);
762 add_decl_stmt (decl
);
763 RECHAIN_STMTS (handler
, HANDLER_PARMS (handler
));
764 type
= TREE_TYPE (decl
);
768 type
= expand_start_catch_block (decl
);
770 HANDLER_TYPE (handler
) = type
;
773 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
774 the return value from the matching call to finish_handler_parms. */
777 finish_handler (handler
)
780 if (!processing_template_decl
)
781 expand_end_catch_block ();
783 RECHAIN_STMTS (handler
, HANDLER_BODY (handler
));
786 /* Generate the RTL for T, which is a CTOR_STMT. */
792 if (CTOR_BEGIN_P (t
))
793 begin_protect_partials ();
795 /* After this point, any exceptions will cause the
796 destructor to be executed, so we no longer need to worry
797 about destroying the various subobjects ourselves. */
798 end_protect_partials ();
801 /* Begin a compound-statement. If HAS_NO_SCOPE is non-zero, the
802 compound-statement does not define a scope. Returns a new
803 COMPOUND_STMT if appropriate. */
806 begin_compound_stmt (has_no_scope
)
812 r
= build_stmt (COMPOUND_STMT
, NULL_TREE
);
814 if (last_tree
&& TREE_CODE (last_tree
) == TRY_BLOCK
)
819 COMPOUND_STMT_NO_SCOPE (r
) = 1;
821 last_expr_type
= NULL_TREE
;
827 note_level_for_try ();
830 /* Normally, we try hard to keep the BLOCK for a
831 statement-expression. But, if it's a statement-expression with
832 a scopeless block, there's nothing to keep, and we don't want
833 to accidentally keep a block *inside* the scopeless block. */
839 /* Finish a compound-statement, which may be given by COMPOUND_STMT.
840 If HAS_NO_SCOPE is non-zero, the compound statement does not define
844 finish_compound_stmt (has_no_scope
, compound_stmt
)
856 RECHAIN_STMTS (compound_stmt
, COMPOUND_BODY (compound_stmt
));
858 /* When we call finish_stmt we will lose LAST_EXPR_TYPE. But, since
859 the precise purpose of that variable is store the type of the
860 last expression statement within the last compound statement, we
861 preserve the value. */
869 /* Finish an asm-statement, whose components are a CV_QUALIFIER, a
870 STRING, some OUTPUT_OPERANDS, some INPUT_OPERANDS, and some
874 finish_asm_stmt (cv_qualifier
, string
, output_operands
,
875 input_operands
, clobbers
)
878 tree output_operands
;
885 if (TREE_CHAIN (string
))
886 string
= combine_strings (string
);
888 if (cv_qualifier
!= NULL_TREE
889 && cv_qualifier
!= ridpointers
[(int) RID_VOLATILE
])
891 cp_warning ("%s qualifier ignored on asm",
892 IDENTIFIER_POINTER (cv_qualifier
));
893 cv_qualifier
= NULL_TREE
;
896 if (!processing_template_decl
)
902 for (t
= input_operands
; t
; t
= TREE_CHAIN (t
))
904 tree converted_operand
905 = decay_conversion (TREE_VALUE (t
));
907 /* If the type of the operand hasn't been determined (e.g.,
908 because it involves an overloaded function), then issue
909 an error message. There's no context available to
910 resolve the overloading. */
911 if (TREE_TYPE (converted_operand
) == unknown_type_node
)
913 cp_error ("type of asm operand `%E' could not be determined",
915 converted_operand
= error_mark_node
;
917 TREE_VALUE (t
) = converted_operand
;
920 ninputs
= list_length (input_operands
);
921 noutputs
= list_length (output_operands
);
923 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
928 const char *constraint
;
931 constraint
= TREE_STRING_POINTER (TREE_PURPOSE (t
));
932 operand
= TREE_VALUE (output_operands
);
934 if (!parse_output_constraint (&constraint
,
935 i
, ninputs
, noutputs
,
940 /* By marking the type as erroneous, we will not try to
941 process this operand again in expand_asm_operands. */
942 TREE_TYPE (operand
) = error_mark_node
;
946 /* If the operand is a DECL that is going to end up in
947 memory, assume it is addressable. This is a bit more
948 conservative than it would ideally be; the exact test is
949 buried deep in expand_asm_operands and depends on the
950 DECL_RTL for the OPERAND -- which we don't have at this
952 if (!allows_reg
&& DECL_P (operand
))
953 mark_addressable (operand
);
957 r
= build_stmt (ASM_STMT
, cv_qualifier
, string
,
958 output_operands
, input_operands
,
963 /* Finish a label with the indicated NAME. */
966 finish_label_stmt (name
)
969 tree decl
= define_label (input_filename
, lineno
, name
);
970 add_stmt (build_stmt (LABEL_STMT
, decl
));
973 /* Finish a series of declarations for local labels. G++ allows users
974 to declare "local" labels, i.e., labels with scope. This extension
975 is useful when writing code involving statement-expressions. */
978 finish_label_decl (name
)
981 tree decl
= declare_local_label (name
);
982 add_decl_stmt (decl
);
985 /* Generate the RTL for a SUBOBJECT. */
988 genrtl_subobject (cleanup
)
991 add_partial_entry (cleanup
);
994 /* We're in a constructor, and have just constructed a a subobject of
995 *THIS. CLEANUP is code to run if an exception is thrown before the
996 end of the current function is reached. */
999 finish_subobject (cleanup
)
1002 tree r
= build_stmt (SUBOBJECT
, cleanup
);
1006 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1009 finish_decl_cleanup (decl
, cleanup
)
1013 add_stmt (build_stmt (CLEANUP_STMT
, decl
, cleanup
));
1016 /* Generate the RTL for a RETURN_INIT. */
1019 genrtl_named_return_value ()
1021 tree decl
= DECL_RESULT (current_function_decl
);
1023 /* If this named return value comes in a register, put it in a
1025 if (DECL_REGISTER (decl
))
1027 /* Note that the mode of the old DECL_RTL may be wider than the
1028 mode of DECL_RESULT, depending on the calling conventions for
1029 the processor. For example, on the Alpha, a 32-bit integer
1030 is returned in a DImode register -- the DECL_RESULT has
1031 SImode but the DECL_RTL for the DECL_RESULT has DImode. So,
1032 here, we use the mode the back-end has already assigned for
1033 the return value. */
1034 SET_DECL_RTL (decl
, gen_reg_rtx (GET_MODE (DECL_RTL (decl
))));
1035 if (TREE_ADDRESSABLE (decl
))
1036 put_var_into_stack (decl
);
1039 emit_local_var (decl
);
1042 /* Bind a name and initialization to the return value of
1043 the current function. */
1046 finish_named_return_value (return_id
, init
)
1047 tree return_id
, init
;
1049 tree decl
= DECL_RESULT (current_function_decl
);
1051 /* Give this error as many times as there are occurrences, so that
1052 users can use Emacs compilation buffers to find and fix all such
1055 pedwarn ("ISO C++ does not permit named return values");
1056 cp_deprecated ("the named return value extension");
1058 if (return_id
!= NULL_TREE
)
1060 if (DECL_NAME (decl
) == NULL_TREE
)
1061 DECL_NAME (decl
) = return_id
;
1064 cp_error ("return identifier `%D' already in place", return_id
);
1069 /* Can't let this happen for constructors. */
1070 if (DECL_CONSTRUCTOR_P (current_function_decl
))
1072 error ("can't redefine default return value for constructors");
1076 /* If we have a named return value, put that in our scope as well. */
1077 if (DECL_NAME (decl
) != NULL_TREE
)
1079 /* Let `cp_finish_decl' know that this initializer is ok. */
1080 DECL_INITIAL (decl
) = init
;
1081 if (doing_semantic_analysis_p ())
1083 if (!processing_template_decl
)
1085 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
1086 add_stmt (build_stmt (RETURN_INIT
, NULL_TREE
, NULL_TREE
));
1089 add_stmt (build_stmt (RETURN_INIT
, return_id
, init
));
1092 /* Don't use tree-inlining for functions with named return values.
1093 That doesn't work properly because we don't do any translation of
1094 the RETURN_INITs when they are copied. */
1095 DECL_UNINLINABLE (current_function_decl
) = 1;
1098 /* The INIT_LIST is a list of mem-initializers, in the order they were
1099 written by the user. The TREE_VALUE of each node is a list of
1100 initializers for a particular subobject. The TREE_PURPOSE is a
1101 FIELD_DECL is the initializer is for a non-static data member, and
1102 a class type if the initializer is for a base class. */
1105 finish_mem_initializers (init_list
)
1108 tree member_init_list
;
1109 tree base_init_list
;
1110 tree last_base_warned_about
;
1114 member_init_list
= NULL_TREE
;
1115 base_init_list
= NULL_TREE
;
1116 last_base_warned_about
= NULL_TREE
;
1118 for (init
= init_list
; init
; init
= next
)
1120 next
= TREE_CHAIN (init
);
1121 if (TREE_CODE (TREE_PURPOSE (init
)) == FIELD_DECL
)
1123 TREE_CHAIN (init
) = member_init_list
;
1124 member_init_list
= init
;
1126 /* We're running through the initializers from right to left
1127 as we process them here. So, if we see a data member
1128 initializer after we see a base initializer, that
1129 actually means that the base initializer preceeded the
1130 data member initializer. */
1131 if (warn_reorder
&& last_base_warned_about
!= base_init_list
)
1135 for (base
= base_init_list
;
1136 base
!= last_base_warned_about
;
1137 base
= TREE_CHAIN (base
))
1139 cp_warning ("base initializer for `%T'",
1140 TREE_PURPOSE (base
));
1141 warning (" will be re-ordered to precede member initializations");
1144 last_base_warned_about
= base_init_list
;
1149 TREE_CHAIN (init
) = base_init_list
;
1150 base_init_list
= init
;
1154 setup_vtbl_ptr (member_init_list
, base_init_list
);
1157 /* Cache the value of this class's main virtual function table pointer
1158 in a register variable. This will save one indirection if a
1159 more than one virtual function call is made this function. */
1162 setup_vtbl_ptr (member_init_list
, base_init_list
)
1163 tree member_init_list
;
1164 tree base_init_list
;
1166 my_friendly_assert (doing_semantic_analysis_p (), 19990919);
1168 /* If we've already done this, there's no need to do it again. */
1172 if (DECL_CONSTRUCTOR_P (current_function_decl
))
1174 if (processing_template_decl
)
1175 add_stmt (build_min_nt
1177 member_init_list
, base_init_list
));
1182 /* Mark the beginning of the constructor. */
1183 ctor_stmt
= build_stmt (CTOR_STMT
);
1184 CTOR_BEGIN_P (ctor_stmt
) = 1;
1185 add_stmt (ctor_stmt
);
1187 /* And actually initialize the base-classes and members. */
1188 emit_base_init (member_init_list
, base_init_list
);
1191 else if (DECL_DESTRUCTOR_P (current_function_decl
)
1192 && !processing_template_decl
)
1197 /* If the dtor is empty, and we know there is not any possible
1198 way we could use any vtable entries, before they are possibly
1199 set by a base class dtor, we don't have to setup the vtables,
1200 as we know that any base class dtor will set up any vtables
1201 it needs. We avoid MI, because one base class dtor can do a
1202 virtual dispatch to an overridden function that would need to
1203 have a non-related vtable set up, we cannot avoid setting up
1204 vtables in that case. We could change this to see if there
1205 is just one vtable. */
1206 if_stmt
= begin_if_stmt ();
1208 /* If it is not safe to avoid setting up the vtables, then
1209 someone will change the condition to be boolean_true_node.
1210 (Actually, for now, we do not have code to set the condition
1211 appropriately, so we just assume that we always need to
1212 initialize the vtables.) */
1213 finish_if_stmt_cond (boolean_true_node
, if_stmt
);
1214 current_vcalls_possible_p
= &IF_COND (if_stmt
);
1216 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
1218 /* Make all virtual function table pointers in non-virtual base
1219 classes point to CURRENT_CLASS_TYPE's virtual function
1221 initialize_vtbl_ptrs (current_class_ptr
);
1223 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
1224 finish_then_clause (if_stmt
);
1228 /* Always keep the BLOCK node associated with the outermost pair of
1229 curly braces of a function. These are needed for correct
1230 operation of dwarfout.c. */
1231 keep_next_level (1);
1233 /* The virtual function tables are set up now. */
1237 /* Returns the stack of SCOPE_STMTs for the current function. */
1240 current_scope_stmt_stack ()
1242 return &cfun
->language
->x_scope_stmt_stack
;
1245 /* Finish a parenthesized expression EXPR. */
1248 finish_parenthesized_expr (expr
)
1251 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expr
))))
1252 /* This inhibits warnings in truthvalue_conversion. */
1253 C_SET_EXP_ORIGINAL_CODE (expr
, ERROR_MARK
);
1255 if (TREE_CODE (expr
) == OFFSET_REF
)
1256 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1257 enclosed in parentheses. */
1258 PTRMEM_OK_P (expr
) = 0;
1262 /* Begin a statement-expression. The value returned must be passed to
1263 finish_stmt_expr. */
1268 /* If we're outside a function, we won't have a statement-tree to
1269 work with. But, if we see a statement-expression we need to
1271 if (! cfun
&& !last_tree
)
1272 begin_stmt_tree (&scope_chain
->x_saved_tree
);
1274 keep_next_level (1);
1275 /* If we're building a statement tree, then the upcoming compound
1276 statement will be chained onto the tree structure, starting at
1277 last_tree. We return last_tree so that we can later unhook the
1278 compound statement. */
1282 /* Used when beginning a statement-expression outside function scope.
1283 For example, when handling a file-scope initializer, we use this
1287 begin_global_stmt_expr ()
1289 if (! cfun
&& !last_tree
)
1290 begin_stmt_tree (&scope_chain
->x_saved_tree
);
1292 keep_next_level (1);
1294 return (last_tree
!= NULL_TREE
) ? last_tree
: expand_start_stmt_expr();
1297 /* Finish the STMT_EXPR last begun with begin_global_stmt_expr. */
1300 finish_global_stmt_expr (stmt_expr
)
1303 stmt_expr
= expand_end_stmt_expr (stmt_expr
);
1306 && TREE_CHAIN (scope_chain
->x_saved_tree
) == NULL_TREE
)
1307 finish_stmt_tree (&scope_chain
->x_saved_tree
);
1312 /* Finish a statement-expression. RTL_EXPR should be the value
1313 returned by the previous begin_stmt_expr; EXPR is the
1314 statement-expression. Returns an expression representing the
1315 statement-expression. */
1318 finish_stmt_expr (rtl_expr
)
1323 /* If the last thing in the statement-expression was not an
1324 expression-statement, then it has type `void'. */
1325 if (!last_expr_type
)
1326 last_expr_type
= void_type_node
;
1327 result
= build_min (STMT_EXPR
, last_expr_type
, last_tree
);
1328 TREE_SIDE_EFFECTS (result
) = 1;
1330 /* Remove the compound statement from the tree structure; it is
1331 now saved in the STMT_EXPR. */
1332 last_tree
= rtl_expr
;
1333 TREE_CHAIN (last_tree
) = NULL_TREE
;
1335 /* If we created a statement-tree for this statement-expression,
1338 && TREE_CHAIN (scope_chain
->x_saved_tree
) == NULL_TREE
)
1339 finish_stmt_tree (&scope_chain
->x_saved_tree
);
1344 /* Finish a call to FN with ARGS. Returns a representation of the
1348 finish_call_expr (fn
, args
, koenig
)
1357 if (TREE_CODE (fn
) == BIT_NOT_EXPR
)
1358 fn
= build_x_unary_op (BIT_NOT_EXPR
, TREE_OPERAND (fn
, 0));
1359 else if (TREE_CODE (fn
) != TEMPLATE_ID_EXPR
)
1360 fn
= do_identifier (fn
, 2, args
);
1362 result
= build_x_function_call (fn
, args
, current_class_ref
);
1364 if (TREE_CODE (result
) == CALL_EXPR
1365 && (! TREE_TYPE (result
)
1366 || TREE_CODE (TREE_TYPE (result
)) != VOID_TYPE
))
1367 result
= require_complete_type (result
);
1372 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1373 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1374 POSTDECREMENT_EXPR.) */
1377 finish_increment_expr (expr
, code
)
1379 enum tree_code code
;
1381 /* If we get an OFFSET_REF, turn it into what it really means (e.g.,
1382 a COMPONENT_REF). This way if we've got, say, a reference to a
1383 static member that's being operated on, we don't end up trying to
1384 find a member operator for the class it's in. */
1386 if (TREE_CODE (expr
) == OFFSET_REF
)
1387 expr
= resolve_offset_ref (expr
);
1388 return build_x_unary_op (code
, expr
);
1391 /* Finish a use of `this'. Returns an expression for `this'. */
1398 if (current_class_ptr
)
1400 result
= current_class_ptr
;
1402 else if (current_function_decl
1403 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1405 error ("`this' is unavailable for static member functions");
1406 result
= error_mark_node
;
1410 if (current_function_decl
)
1411 error ("invalid use of `this' in non-member function");
1413 error ("invalid use of `this' at top level");
1414 result
= error_mark_node
;
1420 /* Finish a member function call using OBJECT and ARGS as arguments to
1421 FN. Returns an expression for the call. */
1424 finish_object_call_expr (fn
, object
, args
)
1430 /* This is a future direction of this code, but because
1431 build_x_function_call cannot always undo what is done in
1432 build_component_ref entirely yet, we cannot do this. */
1434 tree real_fn
= build_component_ref (object
, fn
, NULL_TREE
, 1);
1435 return finish_call_expr (real_fn
, args
);
1437 if (DECL_DECLARES_TYPE_P (fn
))
1439 if (processing_template_decl
)
1440 /* This can happen on code like:
1443 template <class T> void f(T t) {
1447 We just grab the underlying IDENTIFIER. */
1448 fn
= DECL_NAME (fn
);
1451 cp_error ("calling type `%T' like a method", fn
);
1452 return error_mark_node
;
1456 return build_method_call (object
, fn
, args
, NULL_TREE
, LOOKUP_NORMAL
);
1460 /* Finish a qualified member function call using OBJECT and ARGS as
1461 arguments to FN. Returns an expression for the call. */
1464 finish_qualified_object_call_expr (fn
, object
, args
)
1469 return build_scoped_method_call (object
, TREE_OPERAND (fn
, 0),
1470 TREE_OPERAND (fn
, 1), args
);
1473 /* Finish a pseudo-destructor call expression of OBJECT, with SCOPE
1474 being the scope, if any, of DESTRUCTOR. Returns an expression for
1478 finish_pseudo_destructor_call_expr (object
, scope
, destructor
)
1483 if (processing_template_decl
)
1484 return build_min_nt (PSEUDO_DTOR_EXPR
, object
, scope
, destructor
);
1486 if (scope
&& scope
!= destructor
)
1487 cp_error ("destructor specifier `%T::~%T()' must have matching names",
1490 if ((scope
== NULL_TREE
|| IDENTIFIER_GLOBAL_VALUE (destructor
))
1491 && (TREE_CODE (TREE_TYPE (object
)) !=
1492 TREE_CODE (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (destructor
)))))
1493 cp_error ("`%E' is not of type `%T'", object
, destructor
);
1495 return cp_convert (void_type_node
, object
);
1498 /* Finish a call to a globally qualified member function FN using
1499 ARGS. Returns an expression for the call. */
1502 finish_qualified_call_expr (fn
, args
)
1506 if (processing_template_decl
)
1507 return build_min_nt (CALL_EXPR
, fn
, args
, NULL_TREE
);
1509 return build_member_call (TREE_OPERAND (fn
, 0),
1510 TREE_OPERAND (fn
, 1),
1514 /* Finish an expression of the form CODE EXPR. */
1517 finish_unary_op_expr (code
, expr
)
1518 enum tree_code code
;
1521 tree result
= build_x_unary_op (code
, expr
);
1522 /* Inside a template, build_x_unary_op does not fold the
1523 expression. So check whether the result is folded before
1524 setting TREE_NEGATED_INT. */
1525 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
1526 && TREE_CODE (result
) == INTEGER_CST
1527 && !TREE_UNSIGNED (TREE_TYPE (result
))
1528 && INT_CST_LT (result
, integer_zero_node
))
1529 TREE_NEGATED_INT (result
) = 1;
1530 overflow_warning (result
);
1534 /* Finish an id-expression. */
1537 finish_id_expr (expr
)
1540 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
1541 expr
= do_identifier (expr
, 1, NULL_TREE
);
1543 if (TREE_TYPE (expr
) == error_mark_node
)
1544 expr
= error_mark_node
;
1548 static tree current_type_lookups
;
1550 /* Perform deferred access control for types used in the type of a
1554 deferred_type_access_control ()
1556 tree lookup
= type_lookups
;
1558 if (lookup
== error_mark_node
)
1561 for (; lookup
; lookup
= TREE_CHAIN (lookup
))
1562 enforce_access (TREE_PURPOSE (lookup
), TREE_VALUE (lookup
));
1566 decl_type_access_control (decl
)
1571 if (type_lookups
== error_mark_node
)
1574 save_fn
= current_function_decl
;
1576 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
1577 current_function_decl
= decl
;
1579 deferred_type_access_control ();
1581 current_function_decl
= save_fn
;
1583 /* Now strip away the checks for the current declarator; they were
1584 added to type_lookups after typed_declspecs saved the copy that
1585 ended up in current_type_lookups. */
1586 type_lookups
= current_type_lookups
;
1588 current_type_lookups
= NULL_TREE
;
1591 /* Record the lookups, if we're doing deferred access control. */
1594 save_type_access_control (lookups
)
1597 if (type_lookups
!= error_mark_node
)
1599 my_friendly_assert (!current_type_lookups
, 20010301);
1600 current_type_lookups
= lookups
;
1603 my_friendly_assert (!lookups
|| lookups
== error_mark_node
, 20010301);
1606 /* Set things up so that the next deferred access control will succeed.
1607 This is needed for friend declarations see grokdeclarator for details. */
1610 skip_type_access_control ()
1612 type_lookups
= NULL_TREE
;
1615 /* Reset the deferred access control. */
1618 reset_type_access_control ()
1620 type_lookups
= NULL_TREE
;
1621 current_type_lookups
= NULL_TREE
;
1624 /* Begin a function definition declared with DECL_SPECS and
1625 DECLARATOR. Returns non-zero if the function-declaration is
1629 begin_function_definition (decl_specs
, declarator
)
1636 split_specs_attrs (decl_specs
, &specs
, &attrs
);
1637 if (!start_function (specs
, declarator
, attrs
, SF_DEFAULT
))
1640 deferred_type_access_control ();
1641 type_lookups
= error_mark_node
;
1643 /* The things we're about to see are not directly qualified by any
1644 template headers we've seen thus far. */
1645 reset_specialization ();
1650 /* Begin a constructor declarator of the form `SCOPE::NAME'. Returns
1654 begin_constructor_declarator (scope
, name
)
1658 tree result
= build_nt (SCOPE_REF
, scope
, name
);
1659 enter_scope_of (result
);
1663 /* Finish an init-declarator. Returns a DECL. */
1666 finish_declarator (declarator
, declspecs
, attributes
,
1667 prefix_attributes
, initialized
)
1671 tree prefix_attributes
;
1674 return start_decl (declarator
, declspecs
, initialized
, attributes
,
1678 /* Finish a translation unit. */
1681 finish_translation_unit ()
1683 /* In case there were missing closebraces,
1684 get us back to the global binding level. */
1686 while (current_namespace
!= global_namespace
)
1689 /* Do file scope __FUNCTION__ et al. */
1690 finish_fname_decls ();
1695 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
1696 Returns the parameter. */
1699 finish_template_type_parm (aggr
, identifier
)
1703 if (aggr
!= class_type_node
)
1705 pedwarn ("template type parameters must use the keyword `class' or `typename'");
1706 aggr
= class_type_node
;
1709 return build_tree_list (aggr
, identifier
);
1712 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
1713 Returns the parameter. */
1716 finish_template_template_parm (aggr
, identifier
)
1720 tree decl
= build_decl (TYPE_DECL
, identifier
, NULL_TREE
);
1721 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
1722 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
1723 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
1724 DECL_ARTIFICIAL (decl
) = 1;
1725 end_template_decl ();
1727 my_friendly_assert (DECL_TEMPLATE_PARMS (tmpl
), 20010110);
1729 return finish_template_type_parm (aggr
, tmpl
);
1732 /* Finish a parameter list, indicated by PARMS. If ELLIPSIS is
1733 non-zero, the parameter list was terminated by a `...'. */
1736 finish_parmlist (parms
, ellipsis
)
1742 /* We mark the PARMS as a parmlist so that declarator processing can
1743 disambiguate certain constructs. */
1744 TREE_PARMLIST (parms
) = 1;
1745 /* We do not append void_list_node here, but leave it to grokparms
1747 PARMLIST_ELLIPSIS_P (parms
) = ellipsis
;
1752 /* Begin a class definition, as indicated by T. */
1755 begin_class_definition (t
)
1758 /* Check the bases are accessible. */
1759 decl_type_access_control (TYPE_NAME (t
));
1760 reset_type_access_control ();
1762 if (processing_template_parmlist
)
1764 cp_error ("definition of `%#T' inside template parameter list", t
);
1765 return error_mark_node
;
1768 /* In a definition of a member class template, we will get here with
1769 an implicit typename. */
1770 if (IMPLICIT_TYPENAME_P (t
))
1772 /* A non-implicit typename comes from code like:
1774 template <typename T> struct A {
1775 template <typename U> struct A<T>::B ...
1777 This is erroneous. */
1778 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
1780 cp_error ("invalid definition of qualified type `%T'", t
);
1781 t
= error_mark_node
;
1784 if (t
== error_mark_node
|| ! IS_AGGR_TYPE (t
))
1786 t
= make_aggr_type (RECORD_TYPE
);
1787 pushtag (make_anon_name (), t
, 0);
1790 /* If we generated a partial instantiation of this type, but now
1791 we're seeing a real definition, we're actually looking at a
1792 partial specialization. Consider:
1794 template <class T, class U>
1800 template <class T, class U>
1803 typename X<Y<T, U> >::A a;
1806 template <class T, class U>
1811 We have to undo the effects of the previous partial
1813 if (PARTIAL_INSTANTIATION_P (t
))
1817 /* Unfortunately, when we're not in pedantic mode, we
1818 attempt to actually fill in some of the fields of the
1819 partial instantiation, in order to support the implicit
1820 typename extension. Clear those fields now, in
1821 preparation for the definition here. The fields cleared
1822 here must match those set in instantiate_class_template.
1823 Look for a comment mentioning begin_class_definition
1825 TYPE_BINFO_BASETYPES (t
) = NULL_TREE
;
1826 TYPE_FIELDS (t
) = NULL_TREE
;
1827 TYPE_METHODS (t
) = NULL_TREE
;
1828 CLASSTYPE_TAGS (t
) = NULL_TREE
;
1829 CLASSTYPE_VBASECLASSES (t
) = NULL_TREE
;
1830 TYPE_SIZE (t
) = NULL_TREE
;
1833 /* This isn't a partial instantiation any more. */
1834 PARTIAL_INSTANTIATION_P (t
) = 0;
1836 /* If this type was already complete, and we see another definition,
1838 else if (COMPLETE_TYPE_P (t
))
1839 duplicate_tag_error (t
);
1841 /* Update the location of the decl. */
1842 DECL_SOURCE_FILE (TYPE_NAME (t
)) = input_filename
;
1843 DECL_SOURCE_LINE (TYPE_NAME (t
)) = lineno
;
1845 if (TYPE_BEING_DEFINED (t
))
1847 t
= make_aggr_type (TREE_CODE (t
));
1848 pushtag (TYPE_IDENTIFIER (t
), t
, 0);
1850 maybe_process_partial_specialization (t
);
1852 TYPE_BEING_DEFINED (t
) = 1;
1853 TYPE_PACKED (t
) = flag_pack_struct
;
1854 /* Reset the interface data, at the earliest possible
1855 moment, as it might have been set via a class foo;
1857 if (! TYPE_ANONYMOUS_P (t
))
1859 CLASSTYPE_INTERFACE_ONLY (t
) = interface_only
;
1860 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
1861 (t
, interface_unknown
);
1863 reset_specialization();
1865 /* Make a declaration for this class in its own scope. */
1866 build_self_reference ();
1871 /* Finish the member declaration given by DECL. */
1874 finish_member_declaration (decl
)
1877 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
1880 if (decl
== void_type_node
)
1881 /* The COMPONENT was a friend, not a member, and so there's
1882 nothing for us to do. */
1885 /* We should see only one DECL at a time. */
1886 my_friendly_assert (TREE_CHAIN (decl
) == NULL_TREE
, 0);
1888 /* Set up access control for DECL. */
1890 = (current_access_specifier
== access_private_node
);
1891 TREE_PROTECTED (decl
)
1892 = (current_access_specifier
== access_protected_node
);
1893 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
1895 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
1896 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
1899 /* Mark the DECL as a member of the current class. */
1900 DECL_CONTEXT (decl
) = current_class_type
;
1904 A C language linkage is ignored for the names of class members
1905 and the member function type of class member functions. */
1906 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
1907 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
1909 /* Put functions on the TYPE_METHODS list and everything else on the
1910 TYPE_FIELDS list. Note that these are built up in reverse order.
1911 We reverse them (to obtain declaration order) in finish_struct. */
1912 if (TREE_CODE (decl
) == FUNCTION_DECL
1913 || DECL_FUNCTION_TEMPLATE_P (decl
))
1915 /* We also need to add this function to the
1916 CLASSTYPE_METHOD_VEC. */
1917 add_method (current_class_type
, decl
, /*error_p=*/0);
1919 TREE_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
1920 TYPE_METHODS (current_class_type
) = decl
;
1924 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
1925 go at the beginning. The reason is that lookup_field_1
1926 searches the list in order, and we want a field name to
1927 override a type name so that the "struct stat hack" will
1928 work. In particular:
1930 struct S { enum E { }; int E } s;
1933 is legal. In addition, the FIELD_DECLs must be maintained in
1934 declaration order so that class layout works as expected.
1935 However, we don't need that order until class layout, so we
1936 save a little time by putting FIELD_DECLs on in reverse order
1937 here, and then reversing them in finish_struct_1. (We could
1938 also keep a pointer to the correct insertion points in the
1941 if (TREE_CODE (decl
) == TYPE_DECL
)
1942 TYPE_FIELDS (current_class_type
)
1943 = chainon (TYPE_FIELDS (current_class_type
), decl
);
1946 TREE_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
1947 TYPE_FIELDS (current_class_type
) = decl
;
1950 /* Enter the DECL into the scope of the class. */
1951 if (TREE_CODE (decl
) != USING_DECL
)
1952 pushdecl_class_level (decl
);
1956 /* Finish a class definition T with the indicate ATTRIBUTES. If SEMI,
1957 the definition is immediately followed by a semicolon. Returns the
1961 finish_class_definition (t
, attributes
, semi
, pop_scope_p
)
1967 /* finish_struct nukes this anyway; if finish_exception does too,
1970 note_got_semicolon (t
);
1972 /* If we got any attributes in class_head, xref_tag will stick them in
1973 TREE_TYPE of the type. Grab them now. */
1974 attributes
= chainon (TREE_TYPE (t
), attributes
);
1975 TREE_TYPE (t
) = NULL_TREE
;
1977 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
1981 t
= finish_struct (t
, attributes
);
1983 note_got_semicolon (t
);
1987 check_for_missing_semicolon (t
);
1989 pop_scope (CP_DECL_CONTEXT (TYPE_MAIN_DECL (t
)));
1990 if (current_function_decl
)
1991 type_lookups
= error_mark_node
;
1992 if (current_scope () == current_function_decl
)
1993 do_pending_defargs ();
1998 /* Finish processing the default argument expressions cached during
1999 the processing of a class definition. */
2002 begin_inline_definitions ()
2004 if (current_scope () == current_function_decl
)
2005 do_pending_inlines ();
2008 /* Finish processing the inline function definitions cached during the
2009 processing of a class definition. */
2012 finish_inline_definitions ()
2014 if (current_class_type
== NULL_TREE
)
2015 clear_inline_text_obstack ();
2018 /* Finish processing the declaration of a member class template
2019 TYPES whose template parameters are given by PARMS. */
2022 finish_member_class_template (types
)
2027 /* If there are declared, but undefined, partial specializations
2028 mixed in with the typespecs they will not yet have passed through
2029 maybe_process_partial_specialization, so we do that here. */
2030 for (t
= types
; t
!= NULL_TREE
; t
= TREE_CHAIN (t
))
2031 if (IS_AGGR_TYPE_CODE (TREE_CODE (TREE_VALUE (t
))))
2032 maybe_process_partial_specialization (TREE_VALUE (t
));
2034 note_list_got_semicolon (types
);
2035 grok_x_components (types
);
2036 if (TYPE_CONTEXT (TREE_VALUE (types
)) != current_class_type
)
2037 /* The component was in fact a friend declaration. We avoid
2038 finish_member_template_decl performing certain checks by
2042 finish_member_template_decl (types
);
2044 /* As with other component type declarations, we do
2045 not store the new DECL on the list of
2050 /* Finish processsing a complete template declaration. The PARMS are
2051 the template parameters. */
2054 finish_template_decl (parms
)
2058 end_template_decl ();
2060 end_specialization ();
2063 /* Finish processing a template-id (which names a type) of the form
2064 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2065 template-id. If ENTERING_SCOPE is non-zero we are about to enter
2066 the scope of template-id indicated. */
2069 finish_template_type (name
, args
, entering_scope
)
2076 decl
= lookup_template_class (name
, args
,
2077 NULL_TREE
, NULL_TREE
,
2078 entering_scope
, /*complain=*/1);
2079 if (decl
!= error_mark_node
)
2080 decl
= TYPE_STUB_DECL (decl
);
2085 /* SR is a SCOPE_REF node. Enter the scope of SR, whether it is a
2086 namespace scope or a class scope. */
2092 tree scope
= TREE_OPERAND (sr
, 0);
2094 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2096 push_decl_namespace (scope
);
2097 TREE_COMPLEXITY (sr
) = -1;
2099 else if (scope
!= current_class_type
)
2101 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
2103 /* In a declarator for a template class member, the scope will
2104 get here as an implicit typename, a TYPENAME_TYPE with a type. */
2105 scope
= TREE_TYPE (scope
);
2106 TREE_OPERAND (sr
, 0) = scope
;
2108 push_nested_class (scope
, 3);
2109 TREE_COMPLEXITY (sr
) = current_class_depth
;
2113 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2114 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2115 BASE_CLASS, or NULL_TREE if an error occurred. The
2116 ACCESSS_SPECIFIER is one of
2117 access_{default,public,protected_private}[_virtual]_node.*/
2120 finish_base_specifier (access_specifier
, base_class
)
2121 tree access_specifier
;
2126 if (! is_aggr_type (base_class
, 1))
2130 if (CP_TYPE_QUALS (base_class
) != 0)
2132 cp_error ("base class `%T' has cv qualifiers", base_class
);
2133 base_class
= TYPE_MAIN_VARIANT (base_class
);
2135 result
= build_tree_list (access_specifier
, base_class
);
2141 /* Called when multiple declarators are processed. If that is not
2142 premitted in this context, an error is issued. */
2145 check_multiple_declarators ()
2149 In a template-declaration, explicit specialization, or explicit
2150 instantiation the init-declarator-list in the declaration shall
2151 contain at most one declarator.
2153 We don't just use PROCESSING_TEMPLATE_DECL for the first
2154 condition since that would disallow the perfectly legal code,
2155 like `template <class T> struct S { int i, j; };'. */
2156 tree scope
= current_scope ();
2158 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
2159 /* It's OK to write `template <class T> void f() { int i, j;}'. */
2162 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
2163 || processing_explicit_instantiation
2164 || processing_specialization
)
2165 cp_error ("multiple declarators in template declaration");
2169 finish_typeof (expr
)
2172 if (processing_template_decl
)
2176 t
= make_aggr_type (TYPEOF_TYPE
);
2177 TYPE_FIELDS (t
) = expr
;
2182 if (TREE_CODE (expr
) == OFFSET_REF
)
2183 expr
= resolve_offset_ref (expr
);
2185 return TREE_TYPE (expr
);
2188 /* Generate RTL for the statement T, and its substatements, and any
2189 other statements at its nesting level. */
2195 switch (TREE_CODE (t
))
2198 genrtl_decl_cleanup (CLEANUP_DECL (t
), CLEANUP_EXPR (t
));
2202 genrtl_ctor_stmt (t
);
2206 genrtl_try_block (t
);
2210 genrtl_eh_spec_block (t
);
2218 genrtl_subobject (SUBOBJECT_CLEANUP (t
));
2222 genrtl_named_return_value ();
2229 my_friendly_abort (19990810);
2234 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2235 will equivalent CALL_EXPRs. */
2238 simplify_aggr_init_exprs_r (tp
, walk_subtrees
, data
)
2240 int *walk_subtrees ATTRIBUTE_UNUSED
;
2241 void *data ATTRIBUTE_UNUSED
;
2243 tree aggr_init_expr
;
2249 int copy_from_buffer_p
;
2251 aggr_init_expr
= *tp
;
2252 /* We don't need to walk into types; there's nothing in a type that
2253 needs simplification. (And, furthermore, there are places we
2254 actively don't want to go. For example, we don't want to wander
2255 into the default arguments for a FUNCTION_DECL that appears in a
2257 if (TYPE_P (aggr_init_expr
))
2262 /* Only AGGR_INIT_EXPRs are interesting. */
2263 else if (TREE_CODE (aggr_init_expr
) != AGGR_INIT_EXPR
)
2266 /* Form an appropriate CALL_EXPR. */
2267 fn
= TREE_OPERAND (aggr_init_expr
, 0);
2268 args
= TREE_OPERAND (aggr_init_expr
, 1);
2269 slot
= TREE_OPERAND (aggr_init_expr
, 2);
2270 type
= TREE_TYPE (aggr_init_expr
);
2271 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
2273 /* Replace the first argument with the address of the third
2274 argument to the AGGR_INIT_EXPR. */
2275 mark_addressable (slot
);
2276 args
= tree_cons (NULL_TREE
,
2278 build_pointer_type (TREE_TYPE (slot
)),
2282 call_expr
= build (CALL_EXPR
,
2283 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
2284 fn
, args
, NULL_TREE
);
2285 TREE_SIDE_EFFECTS (call_expr
) = 1;
2287 /* If we're using the non-reentrant PCC calling convention, then we
2288 need to copy the returned value out of the static buffer into the
2290 copy_from_buffer_p
= 0;
2291 #ifdef PCC_STATIC_STRUCT_RETURN
2292 if (!AGGR_INIT_VIA_CTOR_P (aggr_init_expr
) && aggregate_value_p (type
))
2294 int old_ac
= flag_access_control
;
2296 flag_access_control
= 0;
2297 call_expr
= build_aggr_init (slot
, call_expr
, LOOKUP_ONLYCONVERTING
);
2298 flag_access_control
= old_ac
;
2299 copy_from_buffer_p
= 1;
2303 /* If this AGGR_INIT_EXPR indicates the value returned by a
2304 function, then we want to use the value of the initialized
2305 location as the result. */
2306 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
) || copy_from_buffer_p
)
2308 call_expr
= build (COMPOUND_EXPR
, type
,
2310 TREE_SIDE_EFFECTS (call_expr
) = 1;
2313 /* Replace the AGGR_INIT_EXPR with the CALL_EXPR. */
2314 TREE_CHAIN (call_expr
) = TREE_CHAIN (aggr_init_expr
);
2317 /* Keep iterating. */
2321 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2324 emit_associated_thunks (fn
)
2327 /* When we use vcall offsets, we emit thunks with the virtual
2328 functions to which they thunk. The whole point of vcall offsets
2329 is so that you can know statically the entire set of thunks that
2330 will ever be needed for a given virtual function, thereby
2331 enabling you to output all the thunks with the function itself. */
2332 if (DECL_VIRTUAL_P (fn
))
2337 for (binfo
= TYPE_BINFO (DECL_CONTEXT (fn
));
2339 binfo
= TREE_CHAIN (binfo
))
2340 for (v
= BINFO_VIRTUALS (binfo
); v
; v
= TREE_CHAIN (v
))
2342 && (!integer_zerop (BV_DELTA (v
))
2343 || BV_USE_VCALL_INDEX_P (v
)))
2348 if (BV_USE_VCALL_INDEX_P (v
))
2350 vcall_index
= BV_VCALL_INDEX (v
);
2351 my_friendly_assert (vcall_index
!= NULL_TREE
, 20000621);
2354 vcall_index
= NULL_TREE
;
2356 thunk
= make_thunk (build1 (ADDR_EXPR
,
2357 vfunc_ptr_type_node
,
2361 use_thunk (thunk
, /*emit_p=*/1);
2366 /* Generate RTL for FN. */
2373 const char *saved_input_filename
;
2375 /* When the parser calls us after finishing the body of a template
2376 function, we don't really want to expand the body. When we're
2377 processing an in-class definition of an inline function,
2378 PROCESSING_TEMPLATE_DECL will no longer be set here, so we have
2379 to look at the function itself. */
2380 if (processing_template_decl
2381 || (DECL_LANG_SPECIFIC (fn
)
2382 && DECL_TEMPLATE_INFO (fn
)
2383 && uses_template_parms (DECL_TI_ARGS (fn
))))
2385 /* Normally, collection only occurs in rest_of_compilation. So,
2386 if we don't collect here, we never collect junk generated
2387 during the processing of templates until we hit a
2388 non-template function. */
2393 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
2394 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn
),
2395 simplify_aggr_init_exprs_r
,
2398 /* If this is a constructor or destructor body, we have to clone
2400 if (maybe_clone_body (fn
))
2402 /* We don't want to process FN again, so pretend we've written
2403 it out, even though we haven't. */
2404 TREE_ASM_WRITTEN (fn
) = 1;
2408 /* There's no reason to do any of the work here if we're only doing
2409 semantic analysis; this code just generates RTL. */
2410 if (flag_syntax_only
)
2413 /* If possible, avoid generating RTL for this function. Instead,
2414 just record it as an inline function, and wait until end-of-file
2415 to decide whether to write it out or not. */
2416 if (/* We have to generate RTL if it's not an inline function. */
2417 (DECL_INLINE (fn
) || DECL_COMDAT (fn
))
2418 /* Or if we have to keep all inline functions anyhow. */
2419 && !flag_keep_inline_functions
2420 /* Or if we actually have a reference to the function. */
2421 && !DECL_NEEDED_P (fn
)
2422 /* Or if this is a nested function. */
2423 && !decl_function_context (fn
))
2425 /* Set DECL_EXTERNAL so that assemble_external will be called as
2426 necessary. We'll clear it again in finish_file. */
2427 if (!DECL_EXTERNAL (fn
))
2429 DECL_NOT_REALLY_EXTERN (fn
) = 1;
2430 DECL_EXTERNAL (fn
) = 1;
2432 /* Remember this function. In finish_file we'll decide if
2433 we actually need to write this function out. */
2435 /* Let the back-end know that this funtion exists. */
2436 (*debug_hooks
->deferred_inline_function
) (fn
);
2440 /* Compute the appropriate object-file linkage for inline
2442 if (DECL_DECLARED_INLINE_P (fn
))
2443 import_export_decl (fn
);
2445 /* Emit any thunks that should be emitted at the same time as FN. */
2446 emit_associated_thunks (fn
);
2448 timevar_push (TV_INTEGRATION
);
2450 /* Optimize the body of the function before expanding it. */
2451 optimize_function (fn
);
2453 timevar_pop (TV_INTEGRATION
);
2454 timevar_push (TV_EXPAND
);
2456 /* Save the current file name and line number. When we expand the
2457 body of the function, we'll set LINENO and INPUT_FILENAME so that
2458 error-mesages come out in the right places. */
2459 saved_lineno
= lineno
;
2460 saved_input_filename
= input_filename
;
2461 lineno
= DECL_SOURCE_LINE (fn
);
2462 input_filename
= DECL_SOURCE_FILE (fn
);
2464 genrtl_start_function (fn
);
2465 current_function_is_thunk
= DECL_THUNK_P (fn
);
2467 /* Expand the body. */
2468 expand_stmt (DECL_SAVED_TREE (fn
));
2470 /* Statements should always be full-expressions at the outermost set
2471 of curly braces for a function. */
2472 my_friendly_assert (stmts_are_full_exprs_p (), 19990831);
2474 /* The outermost statement for a function contains the line number
2475 recorded when we finished processing the function. */
2476 lineno
= STMT_LINENO (DECL_SAVED_TREE (fn
));
2478 /* Generate code for the function. */
2479 genrtl_finish_function (fn
);
2481 /* If possible, obliterate the body of the function so that it can
2482 be garbage collected. */
2483 if (dump_enabled_p (TDI_all
))
2484 /* Keep the body; we're going to dump it. */
2486 else if (DECL_INLINE (fn
) && flag_inline_trees
)
2487 /* We might need the body of this function so that we can expand
2488 it inline somewhere else. */
2491 /* We don't need the body; blow it away. */
2492 DECL_SAVED_TREE (fn
) = NULL_TREE
;
2494 /* And restore the current source position. */
2495 lineno
= saved_lineno
;
2496 input_filename
= saved_input_filename
;
2497 extract_interface_info ();
2499 timevar_pop (TV_EXPAND
);
2502 /* Helper function for walk_tree, used by finish_function to override all
2503 the RETURN_STMTs and pertinent CLEANUP_STMTs for the named return
2504 value optimization. */
2507 nullify_returns_r (tp
, walk_subtrees
, data
)
2512 tree nrv
= (tree
) data
;
2514 /* No need to walk into types. There wouldn't be any need to walk into
2515 non-statements, except that we have to consider STMT_EXPRs. */
2518 else if (TREE_CODE (*tp
) == RETURN_STMT
)
2519 RETURN_EXPR (*tp
) = NULL_TREE
;
2520 else if (TREE_CODE (*tp
) == CLEANUP_STMT
2521 && CLEANUP_DECL (*tp
) == nrv
)
2522 CLEANUP_EXPR (*tp
) = NULL_TREE
;
2524 /* Keep iterating. */
2528 /* Start generating the RTL for FN. */
2531 genrtl_start_function (fn
)
2536 /* Tell everybody what function we're processing. */
2537 current_function_decl
= fn
;
2538 /* Get the RTL machinery going for this function. */
2539 init_function_start (fn
, DECL_SOURCE_FILE (fn
), DECL_SOURCE_LINE (fn
));
2540 /* Let everybody know that we're expanding this function, not doing
2541 semantic analysis. */
2544 /* Even though we're inside a function body, we still don't want to
2545 call expand_expr to calculate the size of a variable-sized array.
2546 We haven't necessarily assigned RTL to all variables yet, so it's
2547 not safe to try to expand expressions involving them. */
2548 immediate_size_expand
= 0;
2549 cfun
->x_dont_save_pending_sizes_p
= 1;
2551 /* Let the user know we're compiling this function. */
2552 announce_function (fn
);
2554 /* Initialize the per-function data. */
2555 my_friendly_assert (!DECL_PENDING_INLINE_P (fn
), 20000911);
2556 if (DECL_SAVED_FUNCTION_DATA (fn
))
2558 /* If we already parsed this function, and we're just expanding it
2559 now, restore saved state. */
2560 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (fn
);
2562 /* This function is being processed in whole-function mode; we
2563 already did semantic analysis. */
2564 cfun
->x_whole_function_mode_p
= 1;
2566 /* If we decided that we didn't want to inline this function,
2567 make sure the back-end knows that. */
2568 if (!current_function_cannot_inline
)
2569 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
2571 /* We don't need the saved data anymore. */
2572 free (DECL_SAVED_FUNCTION_DATA (fn
));
2573 DECL_SAVED_FUNCTION_DATA (fn
) = NULL
;
2576 /* Tell the cross-reference machinery that we're defining this
2578 GNU_xref_function (fn
, DECL_ARGUMENTS (fn
));
2580 /* Keep track of how many functions we're presently expanding. */
2583 /* Create a binding level for the parameters. */
2584 expand_start_bindings (2);
2585 /* Clear out any previously saved instructions for this function, in
2586 case it was defined more than once. */
2587 DECL_SAVED_INSNS (fn
) = NULL
;
2588 /* Go through the PARM_DECLs for this function to see if any need
2590 for (parm
= DECL_ARGUMENTS (fn
); parm
; parm
= TREE_CHAIN (parm
))
2591 if (TREE_TYPE (parm
) != error_mark_node
2592 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (parm
)))
2594 expand_function_start (fn
, /*parms_have_cleanups=*/1);
2598 expand_function_start (fn
, /*parms_have_cleanups=*/0);
2599 /* If this function is `main'. */
2600 if (DECL_MAIN_P (fn
))
2601 expand_main_function ();
2602 /* Create a binding contour which can be used to catch
2603 cleanup-generated temporaries. */
2604 expand_start_bindings (2);
2606 /* Give our named return value the same RTL as our RESULT_DECL. */
2607 if (current_function_return_value
)
2608 COPY_DECL_RTL (DECL_RESULT (fn
), current_function_return_value
);
2611 /* Finish generating the RTL for FN. */
2614 genrtl_finish_function (fn
)
2617 tree no_return_label
= NULL_TREE
;
2620 if (write_symbols
!= NO_DEBUG
)
2622 /* Keep this code around in case we later want to control debug info
2623 based on whether a type is "used". (jason 1999-11-11) */
2625 tree ttype
= target_type (fntype
);
2628 if (IS_AGGR_TYPE (ttype
))
2629 /* Let debugger know it should output info for this type. */
2630 note_debug_info_needed (ttype
);
2632 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
2634 ttype
= target_type (TREE_TYPE (parmdecl
));
2635 if (IS_AGGR_TYPE (ttype
))
2636 /* Let debugger know it should output info for this type. */
2637 note_debug_info_needed (ttype
);
2642 /* Clean house because we will need to reorder insns here. */
2643 do_pending_stack_adjust ();
2645 if (!dtor_label
&& !DECL_CONSTRUCTOR_P (fn
)
2646 && return_label
!= NULL_RTX
2647 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
2648 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
2650 /* If this function is supposed to return a value, ensure that
2651 we do not fall into the cleanups by mistake. The end of our
2652 function will look like this:
2654 user code (may have return stmt somewhere)
2655 goto no_return_label
2660 NOTE_INSN_FUNCTION_END
2664 If the user omits a return stmt in the USER CODE section, we
2665 will have a control path which reaches NOTE_INSN_FUNCTION_END.
2666 Otherwise, we won't. */
2667 if (no_return_label
)
2669 DECL_CONTEXT (no_return_label
) = fn
;
2670 DECL_INITIAL (no_return_label
) = error_mark_node
;
2671 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
2672 DECL_SOURCE_LINE (no_return_label
) = lineno
;
2673 expand_goto (no_return_label
);
2678 /* Remove the binding contour which is used to catch
2679 cleanup-generated temporaries. */
2680 expand_end_bindings (0, 0, 0);
2683 /* Emit label at beginning of cleanup code for parameters. */
2684 emit_label (cleanup_label
);
2687 /* Finish building code that will trigger warnings if users forget
2688 to make their functions return values. */
2690 emit_jump (return_label
);
2691 if (no_return_label
)
2693 /* We don't need to call `expand_*_return' here because we don't
2694 need any cleanups here--this path of code is only for error
2695 checking purposes. */
2696 expand_label (no_return_label
);
2699 /* We hard-wired immediate_size_expand to zero in start_function.
2700 Expand_function_end will decrement this variable. So, we set the
2701 variable to one here, so that after the decrement it will remain
2703 immediate_size_expand
= 1;
2705 /* Generate rtl for function exit. */
2706 expand_function_end (input_filename
, lineno
, 1);
2708 /* If this is a nested function (like a template instantiation that
2709 we're compiling in the midst of compiling something else), push a
2710 new GC context. That will keep local variables on the stack from
2711 being collected while we're doing the compilation of this
2713 if (function_depth
> 1)
2714 ggc_push_context ();
2716 /* There's no need to defer outputting this function any more; we
2717 know we want to output it. */
2718 DECL_DEFER_OUTPUT (fn
) = 0;
2720 /* Run the optimizers and output the assembler code for this
2722 rest_of_compilation (fn
);
2724 /* Undo the call to ggc_push_context above. */
2725 if (function_depth
> 1)
2728 if (DECL_SAVED_INSNS (fn
) && ! TREE_ASM_WRITTEN (fn
))
2730 /* Set DECL_EXTERNAL so that assemble_external will be called as
2731 necessary. We'll clear it again in finish_file. */
2732 if (! DECL_EXTERNAL (fn
))
2733 DECL_NOT_REALLY_EXTERN (fn
) = 1;
2734 DECL_EXTERNAL (fn
) = 1;
2739 /* Keep this code around in case we later want to control debug info
2740 based on whether a type is "used". (jason 1999-11-11) */
2742 if (ctype
&& TREE_ASM_WRITTEN (fn
))
2743 note_debug_info_needed (ctype
);
2746 /* If this function is marked with the constructor attribute, add it
2747 to the list of functions to be called along with constructors
2748 from static duration objects. */
2749 if (DECL_STATIC_CONSTRUCTOR (fn
))
2750 static_ctors
= tree_cons (NULL_TREE
, fn
, static_ctors
);
2752 /* If this function is marked with the destructor attribute, add it
2753 to the list of functions to be called along with destructors from
2754 static duration objects. */
2755 if (DECL_STATIC_DESTRUCTOR (fn
))
2756 static_dtors
= tree_cons (NULL_TREE
, fn
, static_dtors
);
2760 /* If we don't need the RTL for this function anymore, stop pointing
2761 to it. That's especially important for LABEL_DECLs, since you
2762 can reach all the instructions in the function from the
2763 CODE_LABEL stored in the DECL_RTL for the LABEL_DECL. */
2764 if (!DECL_SAVED_INSNS (fn
))
2768 /* Walk the BLOCK-tree, clearing DECL_RTL for LABEL_DECLs and
2769 non-static local variables. */
2770 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn
),
2774 /* Clear out the RTL for the arguments. */
2775 for (t
= DECL_ARGUMENTS (fn
); t
; t
= TREE_CHAIN (t
))
2777 SET_DECL_RTL (t
, NULL_RTX
);
2778 DECL_INCOMING_RTL (t
) = NULL_RTX
;
2781 if (!(flag_inline_trees
&& DECL_INLINE (fn
)))
2782 /* DECL_INITIAL must remain nonzero so we know this was an
2783 actual function definition. */
2784 DECL_INITIAL (fn
) = error_mark_node
;
2787 /* Let the error reporting routines know that we're outside a
2788 function. For a nested function, this value is used in
2789 pop_cp_function_context and then reset via pop_function_context. */
2790 current_function_decl
= NULL_TREE
;
2793 /* Clear out the DECL_RTL for the non-static variables in BLOCK and
2797 clear_decl_rtl (tp
, walk_subtrees
, data
)
2799 int *walk_subtrees ATTRIBUTE_UNUSED
;
2800 void *data ATTRIBUTE_UNUSED
;
2802 if (nonstatic_local_decl_p (*tp
))
2803 SET_DECL_RTL (*tp
, NULL_RTX
);
2808 /* Perform initialization related to this module. */
2811 init_cp_semantics ()
2813 lang_expand_stmt
= cp_expand_stmt
;