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 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
40 /* There routines provide a modular interface to perform many parsing
41 operations. They may therefore be used during actual parsing, or
42 during template instantiation, which may be regarded as a
43 degenerate form of parsing. Since the current g++ parser is
44 lacking in several respects, and will be reimplemented, we are
45 attempting to move most code that is not directly related to
46 parsing into this file; that will make implementing the new parser
47 much easier since it will be able to make use of these routines. */
49 static tree maybe_convert_cond
PARAMS ((tree
));
50 static tree simplify_aggr_init_exprs_r
PARAMS ((tree
*, int *, void *));
51 static void deferred_type_access_control
PARAMS ((void));
52 static void emit_associated_thunks
PARAMS ((tree
));
53 static void genrtl_try_block
PARAMS ((tree
));
54 static void genrtl_handler
PARAMS ((tree
));
55 static void genrtl_catch_block
PARAMS ((tree
));
56 static void genrtl_ctor_stmt
PARAMS ((tree
));
57 static void genrtl_subobject
PARAMS ((tree
));
58 static void genrtl_named_return_value
PARAMS ((void));
59 static void cp_expand_stmt
PARAMS ((tree
));
60 static void genrtl_start_function
PARAMS ((tree
));
61 static void genrtl_finish_function
PARAMS ((tree
));
63 /* Finish processing the COND, the SUBSTMT condition for STMT. */
65 #define FINISH_COND(cond, stmt, substmt) \
67 if (last_tree != stmt) \
69 RECHAIN_STMTS (stmt, substmt); \
70 if (!processing_template_decl) \
72 cond = build_tree_list (substmt, cond); \
80 /* Returns non-zero if the current statement is a full expression,
81 i.e. temporaries created during that statement should be destroyed
82 at the end of the statement. */
85 stmts_are_full_exprs_p ()
87 return current_stmt_tree ()->stmts_are_full_exprs_p
;
90 /* Returns the stmt_tree (if any) to which statements are currently
91 being added. If there is no active statement-tree, NULL is
98 ? &cfun
->language
->x_stmt_tree
99 : &scope_chain
->x_stmt_tree
);
102 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
103 flag for this because "A union for which objects or pointers are
104 declared is not an anonymous union" [class.union]. */
107 anon_aggr_type_p (node
)
110 return (CLASS_TYPE_P (node
) && TYPE_LANG_SPECIFIC(node
)->anon_aggr
);
113 /* Finish a scope. */
118 tree block
= NULL_TREE
;
120 if (stmts_are_full_exprs_p ())
122 tree scope_stmts
= NULL_TREE
;
124 if (!processing_template_decl
)
125 scope_stmts
= add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0);
127 block
= poplevel (kept_level_p (), 1, 0);
128 if (block
&& !processing_template_decl
)
130 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
131 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
138 /* Begin a new scope. */
143 if (stmts_are_full_exprs_p ())
146 if (!processing_template_decl
)
147 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/0);
151 /* Finish a goto-statement. */
154 finish_goto_stmt (destination
)
157 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
158 destination
= lookup_label (destination
);
160 /* We warn about unused labels with -Wunused. That means we have to
161 mark the used labels as used. */
162 if (TREE_CODE (destination
) == LABEL_DECL
)
163 TREE_USED (destination
) = 1;
165 if (TREE_CODE (destination
) != LABEL_DECL
)
166 /* We don't inline calls to functions with computed gotos.
167 Those functions are typically up to some funny business,
168 and may be depending on the labels being at particular
169 addresses, or some such. */
170 DECL_UNINLINABLE (current_function_decl
) = 1;
172 check_goto (destination
);
174 return add_stmt (build_stmt (GOTO_STMT
, destination
));
177 /* COND is the condition-expression for an if, while, etc.,
178 statement. Convert it to a boolean value, if appropriate. */
181 maybe_convert_cond (cond
)
184 /* Empty conditions remain empty. */
188 /* Wait until we instantiate templates before doing conversion. */
189 if (processing_template_decl
)
192 /* Do the conversion. */
193 cond
= convert_from_reference (cond
);
194 return condition_conversion (cond
);
197 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
200 finish_expr_stmt (expr
)
205 if (expr
!= NULL_TREE
)
207 if (!processing_template_decl
208 && !(stmts_are_full_exprs_p ())
209 && ((TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
211 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
))
212 expr
= default_conversion (expr
);
214 if (stmts_are_full_exprs_p ())
215 expr
= convert_to_void (expr
, "statement");
217 r
= add_stmt (build_stmt (EXPR_STMT
, expr
));
222 /* This was an expression-statement, so we save the type of the
224 last_expr_type
= expr
? TREE_TYPE (expr
) : NULL_TREE
;
230 /* Begin an if-statement. Returns a newly created IF_STMT if
238 r
= build_stmt (IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
243 /* Process the COND of an if-statement, which may be given by
247 finish_if_stmt_cond (cond
, if_stmt
)
251 cond
= maybe_convert_cond (cond
);
252 FINISH_COND (cond
, if_stmt
, IF_COND (if_stmt
));
255 /* Finish the then-clause of an if-statement, which may be given by
259 finish_then_clause (if_stmt
)
262 RECHAIN_STMTS (if_stmt
, THEN_CLAUSE (if_stmt
));
267 /* Begin the else-clause of an if-statement. */
274 /* Finish the else-clause of an if-statement, which may be given by
278 finish_else_clause (if_stmt
)
281 RECHAIN_STMTS (if_stmt
, ELSE_CLAUSE (if_stmt
));
284 /* Finsh an if-statement. */
296 /* If COND wasn't a declaration, clear out the
297 block we made for it and start a new one here so the
298 optimization in expand_end_loop will work. */
299 if (getdecls () == NULL_TREE
)
306 /* Begin a while-statement. Returns a newly created WHILE_STMT if
313 r
= build_stmt (WHILE_STMT
, NULL_TREE
, NULL_TREE
);
319 /* Process the COND of a while-statement, which may be given by
323 finish_while_stmt_cond (cond
, while_stmt
)
327 cond
= maybe_convert_cond (cond
);
328 FINISH_COND (cond
, while_stmt
, WHILE_COND (while_stmt
));
332 /* Finish a while-statement, which may be given by WHILE_STMT. */
335 finish_while_stmt (while_stmt
)
339 RECHAIN_STMTS (while_stmt
, WHILE_BODY (while_stmt
));
343 /* Begin a do-statement. Returns a newly created DO_STMT if
349 tree r
= build_stmt (DO_STMT
, NULL_TREE
, NULL_TREE
);
354 /* Finish the body of a do-statement, which may be given by DO_STMT. */
357 finish_do_body (do_stmt
)
360 RECHAIN_STMTS (do_stmt
, DO_BODY (do_stmt
));
363 /* Finish a do-statement, which may be given by DO_STMT, and whose
364 COND is as indicated. */
367 finish_do_stmt (cond
, do_stmt
)
371 cond
= maybe_convert_cond (cond
);
372 DO_COND (do_stmt
) = cond
;
376 /* Finish a return-statement. The EXPRESSION returned, if any, is as
380 finish_return_stmt (expr
)
385 if (!processing_template_decl
)
386 expr
= check_return_expr (expr
);
387 if (!processing_template_decl
)
389 if (DECL_CONSTRUCTOR_P (current_function_decl
) && ctor_label
)
391 /* Even returns without a value in a constructor must return
392 `this'. We accomplish this by sending all returns in a
393 constructor to the CTOR_LABEL; finish_function emits code to
394 return a value there. When we finally generate the real
395 return statement, CTOR_LABEL is no longer set, and we fall
396 through into the normal return-processing code below. */
397 return finish_goto_stmt (ctor_label
);
399 else if (DECL_DESTRUCTOR_P (current_function_decl
))
401 /* Similarly, all destructors must run destructors for
402 base-classes before returning. So, all returns in a
403 destructor get sent to the DTOR_LABEL; finsh_function emits
404 code to return a value there. */
405 return finish_goto_stmt (dtor_label
);
408 r
= add_stmt (build_stmt (RETURN_STMT
, expr
));
414 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
421 r
= build_stmt (FOR_STMT
, NULL_TREE
, NULL_TREE
,
422 NULL_TREE
, NULL_TREE
);
423 NEW_FOR_SCOPE_P (r
) = flag_new_for_scope
> 0;
425 if (NEW_FOR_SCOPE_P (r
))
428 note_level_for_for ();
434 /* Finish the for-init-statement of a for-statement, which may be
435 given by FOR_STMT. */
438 finish_for_init_stmt (for_stmt
)
441 if (last_tree
!= for_stmt
)
442 RECHAIN_STMTS (for_stmt
, FOR_INIT_STMT (for_stmt
));
446 /* Finish the COND of a for-statement, which may be given by
450 finish_for_cond (cond
, for_stmt
)
454 cond
= maybe_convert_cond (cond
);
455 FINISH_COND (cond
, for_stmt
, FOR_COND (for_stmt
));
459 /* Finish the increment-EXPRESSION in a for-statement, which may be
460 given by FOR_STMT. */
463 finish_for_expr (expr
, for_stmt
)
467 FOR_EXPR (for_stmt
) = expr
;
470 /* Finish the body of a for-statement, which may be given by
471 FOR_STMT. The increment-EXPR for the loop must be
475 finish_for_stmt (for_stmt
)
478 /* Pop the scope for the body of the loop. */
480 RECHAIN_STMTS (for_stmt
, FOR_BODY (for_stmt
));
481 if (NEW_FOR_SCOPE_P (for_stmt
))
486 /* Finish a break-statement. */
491 return add_stmt (build_break_stmt ());
494 /* Finish a continue-statement. */
497 finish_continue_stmt ()
499 return add_stmt (build_continue_stmt ());
502 /* Begin a switch-statement. Returns a new SWITCH_STMT if
509 r
= build_stmt (SWITCH_STMT
, NULL_TREE
, NULL_TREE
);
515 /* Finish the cond of a switch-statement. */
518 finish_switch_cond (cond
, switch_stmt
)
522 if (!processing_template_decl
)
527 /* Convert the condition to an integer or enumeration type. */
528 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, 1);
529 if (cond
== NULL_TREE
)
531 error ("switch quantity not an integer");
532 cond
= error_mark_node
;
534 if (cond
!= error_mark_node
)
536 cond
= default_conversion (cond
);
537 cond
= fold (build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (cond
), cond
));
540 type
= TREE_TYPE (cond
);
541 index
= get_unwidened (cond
, NULL_TREE
);
542 /* We can't strip a conversion from a signed type to an unsigned,
543 because if we did, int_fits_type_p would do the wrong thing
544 when checking case values for being in range,
545 and it's too hard to do the right thing. */
546 if (TREE_UNSIGNED (TREE_TYPE (cond
))
547 == TREE_UNSIGNED (TREE_TYPE (index
)))
550 FINISH_COND (cond
, switch_stmt
, SWITCH_COND (switch_stmt
));
551 push_switch (switch_stmt
);
554 /* Finish the body of a switch-statement, which may be given by
555 SWITCH_STMT. The COND to switch on is indicated. */
558 finish_switch_stmt (switch_stmt
)
561 RECHAIN_STMTS (switch_stmt
, SWITCH_BODY (switch_stmt
));
567 /* Generate the RTL for T, which is a TRY_BLOCK. */
575 expand_eh_region_start ();
576 expand_stmt (TRY_STMTS (t
));
577 expand_eh_region_end (protect_with_terminate (TRY_HANDLERS (t
)));
581 if (!FN_TRY_BLOCK_P (t
))
582 emit_line_note (input_filename
, lineno
);
583 expand_start_try_stmts ();
585 expand_stmt (TRY_STMTS (t
));
587 if (FN_TRY_BLOCK_P (t
))
589 end_protect_partials ();
590 expand_start_all_catch ();
591 in_function_try_handler
= 1;
592 expand_stmt (TRY_HANDLERS (t
));
593 in_function_try_handler
= 0;
594 expand_end_all_catch ();
598 expand_start_all_catch ();
599 expand_stmt (TRY_HANDLERS (t
));
600 expand_end_all_catch ();
605 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
611 tree r
= build_stmt (TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
616 /* Likewise, for a function-try-block. */
619 begin_function_try_block ()
621 tree r
= build_stmt (TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
622 FN_TRY_BLOCK_P (r
) = 1;
627 /* Finish a try-block, which may be given by TRY_BLOCK. */
630 finish_try_block (try_block
)
633 RECHAIN_STMTS (try_block
, TRY_STMTS (try_block
));
636 /* Finish the body of a cleanup try-block, which may be given by
640 finish_cleanup_try_block (try_block
)
643 RECHAIN_STMTS (try_block
, TRY_STMTS (try_block
));
646 /* Finish an implicitly generated try-block, with a cleanup is given
650 finish_cleanup (cleanup
, try_block
)
654 TRY_HANDLERS (try_block
) = cleanup
;
655 CLEANUP_P (try_block
) = 1;
658 /* Likewise, for a function-try-block. */
661 finish_function_try_block (try_block
)
664 if (TREE_CHAIN (try_block
)
665 && TREE_CODE (TREE_CHAIN (try_block
)) == CTOR_INITIALIZER
)
667 /* Chain the compound statement after the CTOR_INITIALIZER. */
668 TREE_CHAIN (TREE_CHAIN (try_block
)) = last_tree
;
669 /* And make the CTOR_INITIALIZER the body of the try-block. */
670 RECHAIN_STMTS (try_block
, TRY_STMTS (try_block
));
673 RECHAIN_STMTS (try_block
, TRY_STMTS (try_block
));
674 in_function_try_handler
= 1;
677 /* Finish a handler-sequence for a try-block, which may be given by
681 finish_handler_sequence (try_block
)
684 RECHAIN_STMTS (try_block
, TRY_HANDLERS (try_block
));
685 check_handlers (TRY_HANDLERS (try_block
));
688 /* Likewise, for a function-try-block. */
691 finish_function_handler_sequence (try_block
)
694 in_function_try_handler
= 0;
695 RECHAIN_STMTS (try_block
, TRY_HANDLERS (try_block
));
696 check_handlers (TRY_HANDLERS (try_block
));
699 /* Generate the RTL for T, which is a HANDLER. */
705 genrtl_do_pushlevel ();
706 expand_stmt (HANDLER_BODY (t
));
707 if (!processing_template_decl
)
709 /* Fall to outside the try statement when done executing
710 handler and we fall off end of handler. This is jump
711 Lresume in the documentation. */
712 expand_goto (top_label_entry (&caught_return_label_stack
));
713 end_catch_handler ();
717 /* Begin a handler. Returns a HANDLER if appropriate. */
723 r
= build_stmt (HANDLER
, NULL_TREE
, NULL_TREE
);
729 /* Finish the handler-parameters for a handler, which may be given by
730 HANDLER. DECL is the declaration for the catch parameter, or NULL
731 if this is a `catch (...)' clause. */
734 finish_handler_parms (decl
, handler
)
738 tree blocks
= NULL_TREE
;
740 if (processing_template_decl
)
744 decl
= pushdecl (decl
);
745 decl
= push_template_decl (decl
);
746 add_decl_stmt (decl
);
747 RECHAIN_STMTS (handler
, HANDLER_PARMS (handler
));
751 blocks
= expand_start_catch_block (decl
);
754 TREE_TYPE (handler
) = TREE_TYPE (decl
);
759 /* Generate the RTL for a CATCH_BLOCK. */
762 genrtl_catch_block (type
)
765 start_catch_handler (type
);
768 /* Note the beginning of a handler for TYPE. This function is called
769 at the point to which control should be transferred when an
770 appropriately-typed exception is thrown. */
773 begin_catch_block (type
)
776 add_stmt (build (START_CATCH_STMT
, type
));
779 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
780 the return value from the matching call to finish_handler_parms. */
783 finish_handler (blocks
, handler
)
787 if (!processing_template_decl
)
788 expand_end_catch_block (blocks
);
790 RECHAIN_STMTS (handler
, HANDLER_BODY (handler
));
793 /* Generate the RTL for T, which is a CTOR_STMT. */
799 if (CTOR_BEGIN_P (t
))
800 begin_protect_partials ();
802 /* After this point, any exceptions will cause the
803 destructor to be executed, so we no longer need to worry
804 about destroying the various subobjects ourselves. */
805 end_protect_partials ();
808 /* Begin a compound-statement. If HAS_NO_SCOPE is non-zero, the
809 compound-statement does not define a scope. Returns a new
810 COMPOUND_STMT if appropriate. */
813 begin_compound_stmt (has_no_scope
)
819 r
= build_stmt (COMPOUND_STMT
, NULL_TREE
);
821 if (last_tree
&& TREE_CODE (last_tree
) == TRY_BLOCK
)
826 COMPOUND_STMT_NO_SCOPE (r
) = 1;
828 last_expr_type
= NULL_TREE
;
834 note_level_for_eh ();
837 /* Normally, we try hard to keep the BLOCK for a
838 statement-expression. But, if it's a statement-expression with
839 a scopeless block, there's nothing to keep, and we don't want
840 to accidentally keep a block *inside* the scopeless block. */
843 /* If this is the outermost block of the function, declare the
844 variables __FUNCTION__, __PRETTY_FUNCTION__, and so forth. */
846 && !function_name_declared_p
849 function_name_declared_p
= 1;
850 declare_function_name ();
856 /* Finish a compound-statement, which may be given by COMPOUND_STMT.
857 If HAS_NO_SCOPE is non-zero, the compound statement does not define
861 finish_compound_stmt (has_no_scope
, compound_stmt
)
873 RECHAIN_STMTS (compound_stmt
, COMPOUND_BODY (compound_stmt
));
875 /* When we call finish_stmt we will lose LAST_EXPR_TYPE. But, since
876 the precise purpose of that variable is store the type of the
877 last expression statement within the last compound statement, we
878 preserve the value. */
886 /* Finish an asm-statement, whose components are a CV_QUALIFIER, a
887 STRING, some OUTPUT_OPERANDS, some INPUT_OPERANDS, and some
891 finish_asm_stmt (cv_qualifier
, string
, output_operands
,
892 input_operands
, clobbers
)
895 tree output_operands
;
902 if (TREE_CHAIN (string
))
903 string
= combine_strings (string
);
905 if (cv_qualifier
!= NULL_TREE
906 && cv_qualifier
!= ridpointers
[(int) RID_VOLATILE
])
908 cp_warning ("%s qualifier ignored on asm",
909 IDENTIFIER_POINTER (cv_qualifier
));
910 cv_qualifier
= NULL_TREE
;
913 if (!processing_template_decl
)
914 for (t
= input_operands
; t
; t
= TREE_CHAIN (t
))
915 TREE_VALUE (t
) = decay_conversion (TREE_VALUE (t
));
917 r
= build_stmt (ASM_STMT
, cv_qualifier
, string
,
918 output_operands
, input_operands
,
923 /* Finish a label with the indicated NAME. */
926 finish_label_stmt (name
)
929 tree decl
= define_label (input_filename
, lineno
, name
);
930 add_stmt (build_stmt (LABEL_STMT
, decl
));
933 /* Finish a series of declarations for local labels. G++ allows users
934 to declare "local" labels, i.e., labels with scope. This extension
935 is useful when writing code involving statement-expressions. */
938 finish_label_decl (name
)
941 tree decl
= declare_local_label (name
);
942 add_decl_stmt (decl
);
945 /* Generate the RTL for a SUBOBJECT. */
948 genrtl_subobject (cleanup
)
951 add_partial_entry (cleanup
);
954 /* We're in a constructor, and have just constructed a a subobject of
955 *THIS. CLEANUP is code to run if an exception is thrown before the
956 end of the current function is reached. */
959 finish_subobject (cleanup
)
962 tree r
= build_stmt (SUBOBJECT
, cleanup
);
966 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
969 finish_decl_cleanup (decl
, cleanup
)
973 add_stmt (build_stmt (CLEANUP_STMT
, decl
, cleanup
));
976 /* Generate the RTL for a RETURN_INIT. */
979 genrtl_named_return_value ()
981 tree decl
= DECL_RESULT (current_function_decl
);
983 /* If this named return value comes in a register, put it in a
985 if (DECL_REGISTER (decl
))
987 /* Note that the mode of the old DECL_RTL may be wider than the
988 mode of DECL_RESULT, depending on the calling conventions for
989 the processor. For example, on the Alpha, a 32-bit integer
990 is returned in a DImode register -- the DECL_RESULT has
991 SImode but the DECL_RTL for the DECL_RESULT has DImode. So,
992 here, we use the mode the back-end has already assigned for
994 DECL_RTL (decl
) = gen_reg_rtx (GET_MODE (DECL_RTL (decl
)));
995 if (TREE_ADDRESSABLE (decl
))
996 put_var_into_stack (decl
);
999 emit_local_var (decl
);
1002 /* Bind a name and initialization to the return value of
1003 the current function. */
1006 finish_named_return_value (return_id
, init
)
1007 tree return_id
, init
;
1009 tree decl
= DECL_RESULT (current_function_decl
);
1011 /* Give this error as many times as there are occurrences, so that
1012 users can use Emacs compilation buffers to find and fix all such
1015 pedwarn ("ISO C++ does not permit named return values");
1016 cp_deprecated ("the named return value extension");
1018 if (return_id
!= NULL_TREE
)
1020 if (DECL_NAME (decl
) == NULL_TREE
)
1022 DECL_NAME (decl
) = return_id
;
1023 DECL_ASSEMBLER_NAME (decl
) = return_id
;
1027 cp_error ("return identifier `%D' already in place", return_id
);
1032 /* Can't let this happen for constructors. */
1033 if (DECL_CONSTRUCTOR_P (current_function_decl
))
1035 error ("can't redefine default return value for constructors");
1039 /* If we have a named return value, put that in our scope as well. */
1040 if (DECL_NAME (decl
) != NULL_TREE
)
1042 /* Let `cp_finish_decl' know that this initializer is ok. */
1043 DECL_INITIAL (decl
) = init
;
1044 if (doing_semantic_analysis_p ())
1046 if (!processing_template_decl
)
1048 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
1049 add_stmt (build_stmt (RETURN_INIT
, NULL_TREE
, NULL_TREE
));
1052 add_stmt (build_stmt (RETURN_INIT
, return_id
, init
));
1055 /* Don't use tree-inlining for functions with named return values.
1056 That doesn't work properly because we don't do any translation of
1057 the RETURN_INITs when they are copied. */
1058 DECL_UNINLINABLE (current_function_decl
) = 1;
1061 /* The INIT_LIST is a list of mem-initializers, in the order they were
1062 written by the user. The TREE_VALUE of each node is a list of
1063 initializers for a particular subobject. The TREE_PURPOSE is a
1064 FIELD_DECL is the initializer is for a non-static data member, and
1065 a class type if the initializer is for a base class. */
1068 finish_mem_initializers (init_list
)
1071 tree member_init_list
;
1072 tree base_init_list
;
1073 tree last_base_warned_about
;
1077 member_init_list
= NULL_TREE
;
1078 base_init_list
= NULL_TREE
;
1079 last_base_warned_about
= NULL_TREE
;
1081 for (init
= init_list
; init
; init
= next
)
1083 next
= TREE_CHAIN (init
);
1084 if (TREE_CODE (TREE_PURPOSE (init
)) == FIELD_DECL
)
1086 TREE_CHAIN (init
) = member_init_list
;
1087 member_init_list
= init
;
1089 /* We're running through the initializers from right to left
1090 as we process them here. So, if we see a data member
1091 initializer after we see a base initializer, that
1092 actually means that the base initializer preceeded the
1093 data member initializer. */
1094 if (warn_reorder
&& last_base_warned_about
!= base_init_list
)
1098 for (base
= base_init_list
;
1099 base
!= last_base_warned_about
;
1100 base
= TREE_CHAIN (base
))
1102 cp_warning ("base initializer for `%T'",
1103 TREE_PURPOSE (base
));
1104 warning (" will be re-ordered to precede member initializations");
1107 last_base_warned_about
= base_init_list
;
1112 TREE_CHAIN (init
) = base_init_list
;
1113 base_init_list
= init
;
1117 setup_vtbl_ptr (member_init_list
, base_init_list
);
1120 /* Cache the value of this class's main virtual function table pointer
1121 in a register variable. This will save one indirection if a
1122 more than one virtual function call is made this function. */
1125 setup_vtbl_ptr (member_init_list
, base_init_list
)
1126 tree member_init_list
;
1127 tree base_init_list
;
1129 my_friendly_assert (doing_semantic_analysis_p (), 19990919);
1131 /* If we've already done this, there's no need to do it again. */
1135 if (DECL_CONSTRUCTOR_P (current_function_decl
))
1137 if (processing_template_decl
)
1138 add_stmt (build_min_nt
1140 member_init_list
, base_init_list
));
1145 /* Mark the beginning of the constructor. */
1146 ctor_stmt
= build_stmt (CTOR_STMT
);
1147 CTOR_BEGIN_P (ctor_stmt
) = 1;
1148 add_stmt (ctor_stmt
);
1150 /* And actually initialize the base-classes and members. */
1151 emit_base_init (member_init_list
, base_init_list
);
1154 else if (DECL_DESTRUCTOR_P (current_function_decl
)
1155 && !processing_template_decl
)
1161 /* If the dtor is empty, and we know there is not any possible
1162 way we could use any vtable entries, before they are possibly
1163 set by a base class dtor, we don't have to setup the vtables,
1164 as we know that any base class dtor will set up any vtables
1165 it needs. We avoid MI, because one base class dtor can do a
1166 virtual dispatch to an overridden function that would need to
1167 have a non-related vtable set up, we cannot avoid setting up
1168 vtables in that case. We could change this to see if there
1169 is just one vtable. */
1170 if_stmt
= begin_if_stmt ();
1172 /* If it is not safe to avoid setting up the vtables, then
1173 someone will change the condition to be boolean_true_node.
1174 (Actually, for now, we do not have code to set the condition
1175 appropriately, so we just assume that we always need to
1176 initialize the vtables.) */
1177 finish_if_stmt_cond (boolean_true_node
, if_stmt
);
1178 current_vcalls_possible_p
= &IF_COND (if_stmt
);
1180 /* Don't declare __PRETTY_FUNCTION__ and friends here when we
1181 open the block for the if-body. */
1182 saved_cfnd
= function_name_declared_p
;
1183 function_name_declared_p
= 1;
1184 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
1185 function_name_declared_p
= saved_cfnd
;
1187 /* Make all virtual function table pointers in non-virtual base
1188 classes point to CURRENT_CLASS_TYPE's virtual function
1190 initialize_vtbl_ptrs (current_class_ptr
);
1192 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
1193 finish_then_clause (if_stmt
);
1197 /* Always keep the BLOCK node associated with the outermost pair of
1198 curly braces of a function. These are needed for correct
1199 operation of dwarfout.c. */
1200 keep_next_level (1);
1202 /* The virtual function tables are set up now. */
1206 /* Returns the stack of SCOPE_STMTs for the current function. */
1209 current_scope_stmt_stack ()
1211 return &cfun
->language
->x_scope_stmt_stack
;
1214 /* Finish a parenthesized expression EXPR. */
1217 finish_parenthesized_expr (expr
)
1220 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expr
))))
1221 /* This inhibits warnings in truthvalue_conversion. */
1222 C_SET_EXP_ORIGINAL_CODE (expr
, ERROR_MARK
);
1224 if (TREE_CODE (expr
) == OFFSET_REF
)
1225 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1226 enclosed in parentheses. */
1227 PTRMEM_OK_P (expr
) = 0;
1231 /* Begin a statement-expression. The value returned must be passed to
1232 finish_stmt_expr. */
1237 /* If we're outside a function, we won't have a statement-tree to
1238 work with. But, if we see a statement-expression we need to
1240 if (! cfun
&& !last_tree
)
1241 begin_stmt_tree (&scope_chain
->x_saved_tree
);
1243 keep_next_level (1);
1244 /* If we're building a statement tree, then the upcoming compound
1245 statement will be chained onto the tree structure, starting at
1246 last_tree. We return last_tree so that we can later unhook the
1247 compound statement. */
1251 /* Used when beginning a statement-expression outside function scope.
1252 For example, when handling a file-scope initializer, we use this
1256 begin_global_stmt_expr ()
1258 if (! cfun
&& !last_tree
)
1259 begin_stmt_tree (&scope_chain
->x_saved_tree
);
1261 keep_next_level (1);
1263 return (last_tree
!= NULL_TREE
) ? last_tree
: expand_start_stmt_expr();
1266 /* Finish the STMT_EXPR last begun with begin_global_stmt_expr. */
1269 finish_global_stmt_expr (stmt_expr
)
1272 stmt_expr
= expand_end_stmt_expr (stmt_expr
);
1275 && TREE_CHAIN (scope_chain
->x_saved_tree
) == NULL_TREE
)
1276 finish_stmt_tree (&scope_chain
->x_saved_tree
);
1281 /* Finish a statement-expression. RTL_EXPR should be the value
1282 returned by the previous begin_stmt_expr; EXPR is the
1283 statement-expression. Returns an expression representing the
1284 statement-expression. */
1287 finish_stmt_expr (rtl_expr
)
1292 /* If the last thing in the statement-expression was not an
1293 expression-statement, then it has type `void'. */
1294 if (!last_expr_type
)
1295 last_expr_type
= void_type_node
;
1296 result
= build_min (STMT_EXPR
, last_expr_type
, last_tree
);
1297 TREE_SIDE_EFFECTS (result
) = 1;
1299 /* Remove the compound statement from the tree structure; it is
1300 now saved in the STMT_EXPR. */
1301 last_tree
= rtl_expr
;
1302 TREE_CHAIN (last_tree
) = NULL_TREE
;
1304 /* If we created a statement-tree for this statement-expression,
1307 && TREE_CHAIN (scope_chain
->x_saved_tree
) == NULL_TREE
)
1308 finish_stmt_tree (&scope_chain
->x_saved_tree
);
1313 /* Finish a call to FN with ARGS. Returns a representation of the
1317 finish_call_expr (fn
, args
, koenig
)
1326 if (TREE_CODE (fn
) == BIT_NOT_EXPR
)
1327 fn
= build_x_unary_op (BIT_NOT_EXPR
, TREE_OPERAND (fn
, 0));
1328 else if (TREE_CODE (fn
) != TEMPLATE_ID_EXPR
)
1329 fn
= do_identifier (fn
, 2, args
);
1331 result
= build_x_function_call (fn
, args
, current_class_ref
);
1333 if (TREE_CODE (result
) == CALL_EXPR
1334 && (! TREE_TYPE (result
)
1335 || TREE_CODE (TREE_TYPE (result
)) != VOID_TYPE
))
1336 result
= require_complete_type (result
);
1341 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1342 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1343 POSTDECREMENT_EXPR.) */
1346 finish_increment_expr (expr
, code
)
1348 enum tree_code code
;
1350 /* If we get an OFFSET_REF, turn it into what it really means (e.g.,
1351 a COMPONENT_REF). This way if we've got, say, a reference to a
1352 static member that's being operated on, we don't end up trying to
1353 find a member operator for the class it's in. */
1355 if (TREE_CODE (expr
) == OFFSET_REF
)
1356 expr
= resolve_offset_ref (expr
);
1357 return build_x_unary_op (code
, expr
);
1360 /* Finish a use of `this'. Returns an expression for `this'. */
1367 if (current_class_ptr
)
1369 #ifdef WARNING_ABOUT_CCD
1370 TREE_USED (current_class_ptr
) = 1;
1372 result
= current_class_ptr
;
1374 else if (current_function_decl
1375 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1377 error ("`this' is unavailable for static member functions");
1378 result
= error_mark_node
;
1382 if (current_function_decl
)
1383 error ("invalid use of `this' in non-member function");
1385 error ("invalid use of `this' at top level");
1386 result
= error_mark_node
;
1392 /* Finish a member function call using OBJECT and ARGS as arguments to
1393 FN. Returns an expression for the call. */
1396 finish_object_call_expr (fn
, object
, args
)
1402 /* This is a future direction of this code, but because
1403 build_x_function_call cannot always undo what is done in
1404 build_component_ref entirely yet, we cannot do this. */
1406 tree real_fn
= build_component_ref (object
, fn
, NULL_TREE
, 1);
1407 return finish_call_expr (real_fn
, args
);
1409 if (DECL_DECLARES_TYPE_P (fn
))
1411 if (processing_template_decl
)
1412 /* This can happen on code like:
1415 template <class T> void f(T t) {
1419 We just grab the underlying IDENTIFIER. */
1420 fn
= DECL_NAME (fn
);
1423 cp_error ("calling type `%T' like a method", fn
);
1424 return error_mark_node
;
1428 return build_method_call (object
, fn
, args
, NULL_TREE
, LOOKUP_NORMAL
);
1432 /* Finish a qualified member function call using OBJECT and ARGS as
1433 arguments to FN. Returns an expression for the call. */
1436 finish_qualified_object_call_expr (fn
, object
, args
)
1441 return build_scoped_method_call (object
, TREE_OPERAND (fn
, 0),
1442 TREE_OPERAND (fn
, 1), args
);
1445 /* Finish a pseudo-destructor call expression of OBJECT, with SCOPE
1446 being the scope, if any, of DESTRUCTOR. Returns an expression for
1450 finish_pseudo_destructor_call_expr (object
, scope
, destructor
)
1455 if (processing_template_decl
)
1456 return build_min_nt (PSEUDO_DTOR_EXPR
, object
, scope
, destructor
);
1458 if (scope
&& scope
!= destructor
)
1459 cp_error ("destructor specifier `%T::~%T()' must have matching names",
1462 if ((scope
== NULL_TREE
|| IDENTIFIER_GLOBAL_VALUE (destructor
))
1463 && (TREE_CODE (TREE_TYPE (object
)) !=
1464 TREE_CODE (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (destructor
)))))
1465 cp_error ("`%E' is not of type `%T'", object
, destructor
);
1467 return cp_convert (void_type_node
, object
);
1470 /* Finish a call to a globally qualified member function FN using
1471 ARGS. Returns an expression for the call. */
1474 finish_qualified_call_expr (fn
, args
)
1478 if (processing_template_decl
)
1479 return build_min_nt (CALL_EXPR
, fn
, args
, NULL_TREE
);
1481 return build_member_call (TREE_OPERAND (fn
, 0),
1482 TREE_OPERAND (fn
, 1),
1486 /* Finish an expression taking the address of LABEL. Returns an
1487 expression for the address. */
1490 finish_label_address_expr (label
)
1495 label
= lookup_label (label
);
1496 if (label
== NULL_TREE
)
1497 result
= null_pointer_node
;
1500 TREE_USED (label
) = 1;
1501 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
1502 TREE_CONSTANT (result
) = 1;
1503 /* This function cannot be inlined. All jumps to the addressed
1504 label should wind up at the same point. */
1505 DECL_UNINLINABLE (current_function_decl
) = 1;
1511 /* Finish an expression of the form CODE EXPR. */
1514 finish_unary_op_expr (code
, expr
)
1515 enum tree_code code
;
1518 tree result
= build_x_unary_op (code
, expr
);
1519 /* Inside a template, build_x_unary_op does not fold the
1520 expression. So check whether the result is folded before
1521 setting TREE_NEGATED_INT. */
1522 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
1523 && TREE_CODE (result
) == INTEGER_CST
1524 && !TREE_UNSIGNED (TREE_TYPE (result
))
1525 && INT_CST_LT (result
, integer_zero_node
))
1526 TREE_NEGATED_INT (result
) = 1;
1527 overflow_warning (result
);
1531 /* Finish an id-expression. */
1534 finish_id_expr (expr
)
1537 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
1538 expr
= do_identifier (expr
, 1, NULL_TREE
);
1540 if (TREE_TYPE (expr
) == error_mark_node
)
1541 expr
= error_mark_node
;
1545 static tree current_type_lookups
;
1547 /* Perform deferred access control for types used in the type of a
1551 deferred_type_access_control ()
1553 tree lookup
= type_lookups
;
1555 if (lookup
== error_mark_node
)
1558 for (; lookup
; lookup
= TREE_CHAIN (lookup
))
1559 enforce_access (TREE_PURPOSE (lookup
), TREE_VALUE (lookup
));
1563 decl_type_access_control (decl
)
1568 if (type_lookups
== error_mark_node
)
1571 save_fn
= current_function_decl
;
1573 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
1574 current_function_decl
= decl
;
1576 deferred_type_access_control ();
1578 current_function_decl
= save_fn
;
1580 /* Now strip away the checks for the current declarator; they were
1581 added to type_lookups after typed_declspecs saved the copy that
1582 ended up in current_type_lookups. */
1583 type_lookups
= current_type_lookups
;
1587 save_type_access_control (lookups
)
1590 current_type_lookups
= lookups
;
1593 /* Begin a function definition declared with DECL_SPECS and
1594 DECLARATOR. Returns non-zero if the function-declaration is
1598 begin_function_definition (decl_specs
, declarator
)
1605 split_specs_attrs (decl_specs
, &specs
, &attrs
);
1606 if (!start_function (specs
, declarator
, attrs
, SF_DEFAULT
))
1609 deferred_type_access_control ();
1610 type_lookups
= error_mark_node
;
1612 /* The things we're about to see are not directly qualified by any
1613 template headers we've seen thus far. */
1614 reset_specialization ();
1619 /* Begin a constructor declarator of the form `SCOPE::NAME'. Returns
1623 begin_constructor_declarator (scope
, name
)
1627 tree result
= build_parse_node (SCOPE_REF
, scope
, name
);
1628 enter_scope_of (result
);
1632 /* Finish an init-declarator. Returns a DECL. */
1635 finish_declarator (declarator
, declspecs
, attributes
,
1636 prefix_attributes
, initialized
)
1640 tree prefix_attributes
;
1643 return start_decl (declarator
, declspecs
, initialized
, attributes
,
1647 /* Finish a translation unit. */
1650 finish_translation_unit ()
1652 /* In case there were missing closebraces,
1653 get us back to the global binding level. */
1655 while (current_namespace
!= global_namespace
)
1660 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
1661 Returns the parameter. */
1664 finish_template_type_parm (aggr
, identifier
)
1668 if (aggr
!= class_type_node
)
1670 pedwarn ("template type parameters must use the keyword `class' or `typename'");
1671 aggr
= class_type_node
;
1674 return build_tree_list (aggr
, identifier
);
1677 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
1678 Returns the parameter. */
1681 finish_template_template_parm (aggr
, identifier
)
1685 tree decl
= build_decl (TYPE_DECL
, identifier
, NULL_TREE
);
1686 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
1687 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
1688 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
1689 DECL_ARTIFICIAL (decl
) = 1;
1690 end_template_decl ();
1692 return finish_template_type_parm (aggr
, tmpl
);
1695 /* Finish a parameter list, indicated by PARMS. If ELLIPSIS is
1696 non-zero, the parameter list was terminated by a `...'. */
1699 finish_parmlist (parms
, ellipsis
)
1705 /* We mark the PARMS as a parmlist so that declarator processing can
1706 disambiguate certain constructs. */
1707 TREE_PARMLIST (parms
) = 1;
1708 /* We do not append void_list_node here, but leave it to grokparms
1710 PARMLIST_ELLIPSIS_P (parms
) = ellipsis
;
1715 /* Begin a class definition, as indicated by T. */
1718 begin_class_definition (t
)
1721 if (t
== error_mark_node
1722 || ! IS_AGGR_TYPE (t
))
1724 t
= make_aggr_type (RECORD_TYPE
);
1725 pushtag (make_anon_name (), t
, 0);
1728 /* In a definition of a member class template, we will get here with an
1729 implicit typename, a TYPENAME_TYPE with a type. */
1730 if (TREE_CODE (t
) == TYPENAME_TYPE
)
1733 /* If we generated a partial instantiation of this type, but now
1734 we're seeing a real definition, we're actually looking at a
1735 partial specialization. Consider:
1737 template <class T, class U>
1743 template <class T, class U>
1746 typename X<Y<T, U> >::A a;
1749 template <class T, class U>
1754 We have to undo the effects of the previous partial
1756 if (PARTIAL_INSTANTIATION_P (t
))
1760 /* Unfortunately, when we're not in pedantic mode, we
1761 attempt to actually fill in some of the fields of the
1762 partial instantiation, in order to support the implicit
1763 typename extension. Clear those fields now, in
1764 preparation for the definition here. The fields cleared
1765 here must match those set in instantiate_class_template.
1766 Look for a comment mentioning begin_class_definition
1768 TYPE_BINFO_BASETYPES (t
) = NULL_TREE
;
1769 TYPE_FIELDS (t
) = NULL_TREE
;
1770 TYPE_METHODS (t
) = NULL_TREE
;
1771 CLASSTYPE_TAGS (t
) = NULL_TREE
;
1772 CLASSTYPE_VBASECLASSES (t
) = NULL_TREE
;
1773 TYPE_SIZE (t
) = NULL_TREE
;
1776 /* This isn't a partial instantiation any more. */
1777 PARTIAL_INSTANTIATION_P (t
) = 0;
1779 /* If this type was already complete, and we see another definition,
1781 else if (COMPLETE_TYPE_P (t
))
1782 duplicate_tag_error (t
);
1784 /* Update the location of the decl. */
1785 DECL_SOURCE_FILE (TYPE_NAME (t
)) = input_filename
;
1786 DECL_SOURCE_LINE (TYPE_NAME (t
)) = lineno
;
1788 if (TYPE_BEING_DEFINED (t
))
1790 t
= make_aggr_type (TREE_CODE (t
));
1791 pushtag (TYPE_IDENTIFIER (t
), t
, 0);
1793 maybe_process_partial_specialization (t
);
1795 TYPE_BEING_DEFINED (t
) = 1;
1796 TYPE_PACKED (t
) = flag_pack_struct
;
1797 /* Reset the interface data, at the earliest possible
1798 moment, as it might have been set via a class foo;
1801 tree name
= TYPE_IDENTIFIER (t
);
1803 if (! ANON_AGGRNAME_P (name
))
1805 CLASSTYPE_INTERFACE_ONLY (t
) = interface_only
;
1806 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
1807 (t
, interface_unknown
);
1810 /* Only leave this bit clear if we know this
1811 class is part of an interface-only specification. */
1812 if (! CLASSTYPE_INTERFACE_KNOWN (t
)
1813 || ! CLASSTYPE_INTERFACE_ONLY (t
))
1814 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = 1;
1816 reset_specialization();
1818 /* Make a declaration for this class in its own scope. */
1819 build_self_reference ();
1824 /* Finish the member declaration given by DECL. */
1827 finish_member_declaration (decl
)
1830 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
1833 if (decl
== void_type_node
)
1834 /* The COMPONENT was a friend, not a member, and so there's
1835 nothing for us to do. */
1838 /* We should see only one DECL at a time. */
1839 my_friendly_assert (TREE_CHAIN (decl
) == NULL_TREE
, 0);
1841 /* Set up access control for DECL. */
1843 = (current_access_specifier
== access_private_node
);
1844 TREE_PROTECTED (decl
)
1845 = (current_access_specifier
== access_protected_node
);
1846 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
1848 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
1849 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
1852 /* Mark the DECL as a member of the current class. */
1853 DECL_CONTEXT (decl
) = current_class_type
;
1857 A C language linkage is ignored for the names of class members
1858 and the member function type of class member functions. */
1859 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
1860 DECL_LANGUAGE (decl
) = lang_cplusplus
;
1862 /* Put functions on the TYPE_METHODS list and everything else on the
1863 TYPE_FIELDS list. Note that these are built up in reverse order.
1864 We reverse them (to obtain declaration order) in finish_struct. */
1865 if (TREE_CODE (decl
) == FUNCTION_DECL
1866 || DECL_FUNCTION_TEMPLATE_P (decl
))
1868 /* We also need to add this function to the
1869 CLASSTYPE_METHOD_VEC. */
1870 add_method (current_class_type
, decl
, /*error_p=*/0);
1872 TREE_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
1873 TYPE_METHODS (current_class_type
) = decl
;
1877 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
1878 go at the beginning. The reason is that lookup_field_1
1879 searches the list in order, and we want a field name to
1880 override a type name so that the "struct stat hack" will
1881 work. In particular:
1883 struct S { enum E { }; int E } s;
1886 is legal. In addition, the FIELD_DECLs must be maintained in
1887 declaration order so that class layout works as expected.
1888 However, we don't need that order until class layout, so we
1889 save a little time by putting FIELD_DECLs on in reverse order
1890 here, and then reversing them in finish_struct_1. (We could
1891 also keep a pointer to the correct insertion points in the
1894 if (TREE_CODE (decl
) == TYPE_DECL
)
1895 TYPE_FIELDS (current_class_type
)
1896 = chainon (TYPE_FIELDS (current_class_type
), decl
);
1899 TREE_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
1900 TYPE_FIELDS (current_class_type
) = decl
;
1903 /* Enter the DECL into the scope of the class. */
1904 if (TREE_CODE (decl
) != USING_DECL
)
1905 pushdecl_class_level (decl
);
1909 /* Finish a class definition T with the indicate ATTRIBUTES. If SEMI,
1910 the definition is immediately followed by a semicolon. Returns the
1914 finish_class_definition (t
, attributes
, semi
, pop_scope_p
)
1920 /* finish_struct nukes this anyway; if finish_exception does too,
1923 note_got_semicolon (t
);
1925 /* If we got any attributes in class_head, xref_tag will stick them in
1926 TREE_TYPE of the type. Grab them now. */
1927 attributes
= chainon (TREE_TYPE (t
), attributes
);
1928 TREE_TYPE (t
) = NULL_TREE
;
1930 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
1934 t
= finish_struct (t
, attributes
);
1936 note_got_semicolon (t
);
1940 check_for_missing_semicolon (t
);
1942 pop_scope (CP_DECL_CONTEXT (TYPE_MAIN_DECL (t
)));
1943 if (current_scope () == current_function_decl
)
1944 do_pending_defargs ();
1949 /* Finish processing the default argument expressions cached during
1950 the processing of a class definition. */
1953 begin_inline_definitions ()
1955 if (current_scope () == current_function_decl
)
1956 do_pending_inlines ();
1959 /* Finish processing the inline function definitions cached during the
1960 processing of a class definition. */
1963 finish_inline_definitions ()
1965 if (current_class_type
== NULL_TREE
)
1966 clear_inline_text_obstack ();
1969 /* Finish processing the declaration of a member class template
1970 TYPES whose template parameters are given by PARMS. */
1973 finish_member_class_template (types
)
1978 /* If there are declared, but undefined, partial specializations
1979 mixed in with the typespecs they will not yet have passed through
1980 maybe_process_partial_specialization, so we do that here. */
1981 for (t
= types
; t
!= NULL_TREE
; t
= TREE_CHAIN (t
))
1982 if (IS_AGGR_TYPE_CODE (TREE_CODE (TREE_VALUE (t
))))
1983 maybe_process_partial_specialization (TREE_VALUE (t
));
1985 note_list_got_semicolon (types
);
1986 grok_x_components (types
);
1987 if (TYPE_CONTEXT (TREE_VALUE (types
)) != current_class_type
)
1988 /* The component was in fact a friend declaration. We avoid
1989 finish_member_template_decl performing certain checks by
1993 finish_member_template_decl (types
);
1995 /* As with other component type declarations, we do
1996 not store the new DECL on the list of
2001 /* Finish processsing a complete template declaration. The PARMS are
2002 the template parameters. */
2005 finish_template_decl (parms
)
2009 end_template_decl ();
2011 end_specialization ();
2014 /* Finish processing a template-id (which names a type) of the form
2015 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2016 template-id. If ENTERING_SCOPE is non-zero we are about to enter
2017 the scope of template-id indicated. */
2020 finish_template_type (name
, args
, entering_scope
)
2027 decl
= lookup_template_class (name
, args
,
2028 NULL_TREE
, NULL_TREE
, entering_scope
);
2029 if (decl
!= error_mark_node
)
2030 decl
= TYPE_STUB_DECL (decl
);
2035 /* SR is a SCOPE_REF node. Enter the scope of SR, whether it is a
2036 namespace scope or a class scope. */
2042 tree scope
= TREE_OPERAND (sr
, 0);
2044 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2046 push_decl_namespace (scope
);
2047 TREE_COMPLEXITY (sr
) = -1;
2049 else if (scope
!= current_class_type
)
2051 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
2053 /* In a declarator for a template class member, the scope will
2054 get here as an implicit typename, a TYPENAME_TYPE with a type. */
2055 scope
= TREE_TYPE (scope
);
2056 TREE_OPERAND (sr
, 0) = scope
;
2058 push_nested_class (scope
, 3);
2059 TREE_COMPLEXITY (sr
) = current_class_depth
;
2063 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2064 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2065 BASE_CLASS, or NULL_TREE if an error occurred. The
2066 ACCESSS_SPECIFIER is one of
2067 access_{default,public,protected_private}[_virtual]_node.*/
2070 finish_base_specifier (access_specifier
, base_class
)
2071 tree access_specifier
;
2076 if (! is_aggr_type (base_class
, 1))
2080 if (CP_TYPE_QUALS (base_class
) != 0)
2082 cp_error ("base class `%T' has cv qualifiers", base_class
);
2083 base_class
= TYPE_MAIN_VARIANT (base_class
);
2085 result
= build_tree_list (access_specifier
, base_class
);
2091 /* Called when multiple declarators are processed. If that is not
2092 premitted in this context, an error is issued. */
2095 check_multiple_declarators ()
2099 In a template-declaration, explicit specialization, or explicit
2100 instantiation the init-declarator-list in the declaration shall
2101 contain at most one declarator.
2103 We don't just use PROCESSING_TEMPLATE_DECL for the first
2104 condition since that would disallow the perfectly legal code,
2105 like `template <class T> struct S { int i, j; };'. */
2106 tree scope
= current_scope ();
2108 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
2109 /* It's OK to write `template <class T> void f() { int i, j;}'. */
2112 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
2113 || processing_explicit_instantiation
2114 || processing_specialization
)
2115 cp_error ("multiple declarators in template declaration");
2119 finish_typeof (expr
)
2122 if (processing_template_decl
)
2126 t
= make_aggr_type (TYPEOF_TYPE
);
2127 TYPE_FIELDS (t
) = expr
;
2132 return TREE_TYPE (expr
);
2135 /* Generate RTL for the statement T, and its substatements, and any
2136 other statements at its nesting level. */
2142 switch (TREE_CODE (t
))
2145 genrtl_decl_cleanup (CLEANUP_DECL (t
), CLEANUP_EXPR (t
));
2148 case START_CATCH_STMT
:
2149 genrtl_catch_block (TREE_TYPE (t
));
2153 genrtl_ctor_stmt (t
);
2157 genrtl_try_block (t
);
2165 genrtl_subobject (SUBOBJECT_CLEANUP (t
));
2169 genrtl_named_return_value ();
2173 my_friendly_abort (19990810);
2178 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2179 will equivalent CALL_EXPRs. */
2182 simplify_aggr_init_exprs_r (tp
, walk_subtrees
, data
)
2184 int *walk_subtrees ATTRIBUTE_UNUSED
;
2185 void *data ATTRIBUTE_UNUSED
;
2187 tree aggr_init_expr
;
2194 int copy_from_buffer_p
;
2196 aggr_init_expr
= *tp
;
2197 /* We don't need to walk into types; there's nothing in a type that
2198 needs simplification. (And, furthermore, there are places we
2199 actively don't want to go. For example, we don't want to wander
2200 into the default arguments for a FUNCTION_DECL that appears in a
2202 if (TYPE_P (aggr_init_expr
))
2207 /* Only AGGR_INIT_EXPRs are interesting. */
2208 else if (TREE_CODE (aggr_init_expr
) != AGGR_INIT_EXPR
)
2211 /* Form an appropriate CALL_EXPR. */
2212 fn
= TREE_OPERAND (aggr_init_expr
, 0);
2213 args
= TREE_OPERAND (aggr_init_expr
, 1);
2214 slot
= TREE_OPERAND (aggr_init_expr
, 2);
2215 type
= TREE_TYPE (aggr_init_expr
);
2217 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
2219 /* Replace the first argument with the address of the third
2220 argument to the AGGR_INIT_EXPR. */
2221 call_type
= build_pointer_type (type
);
2222 mark_addressable (slot
);
2223 args
= tree_cons (NULL_TREE
, build1 (ADDR_EXPR
, call_type
, slot
),
2226 call_expr
= build (CALL_EXPR
, call_type
, fn
, args
, NULL_TREE
);
2227 TREE_SIDE_EFFECTS (call_expr
) = 1;
2229 /* If we're using the non-reentrant PCC calling convention, then we
2230 need to copy the returned value out of the static buffer into the
2232 copy_from_buffer_p
= 0;
2233 #ifdef PCC_STATIC_STRUCT_RETURN
2234 if (!AGGR_INIT_VIA_CTOR_P (aggr_init_expr
) && aggregate_value_p (type
))
2238 flag_access_control
= 0;
2239 call_expr
= build_aggr_init (slot
, call_expr
, LOOKUP_ONLYCONVERTING
);
2240 flag_access_control
= old_ac
;
2241 copy_from_buffer_p
= 1;
2245 /* If this AGGR_INIT_EXPR indicates the value returned by a
2246 function, then we want to use the value of the initialized
2247 location as the result. */
2248 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
) || copy_from_buffer_p
)
2250 call_expr
= build (COMPOUND_EXPR
, type
,
2252 TREE_SIDE_EFFECTS (call_expr
) = 1;
2255 /* Replace the AGGR_INIT_EXPR with the CALL_EXPR. */
2256 TREE_CHAIN (call_expr
) = TREE_CHAIN (aggr_init_expr
);
2259 /* Keep iterating. */
2263 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2266 emit_associated_thunks (fn
)
2269 /* When we use vcall offsets, we emit thunks with the virtual
2270 functions to which they thunk. The whole point of vcall offsets
2271 is so that you can know statically the entire set of thunks that
2272 will ever be needed for a given virtual function, thereby
2273 enabling you to output all the thunks with the function itself. */
2274 if (vcall_offsets_in_vtable_p () && DECL_VIRTUAL_P (fn
))
2279 for (binfo
= TYPE_BINFO (DECL_CONTEXT (fn
));
2281 binfo
= TREE_CHAIN (binfo
))
2282 for (v
= BINFO_VIRTUALS (binfo
); v
; v
= TREE_CHAIN (v
))
2284 && (!integer_zerop (BV_DELTA (v
))
2285 || BV_VCALL_INDEX (v
)))
2290 if (BV_USE_VCALL_INDEX_P (v
))
2292 vcall_index
= BV_VCALL_INDEX (v
);
2293 my_friendly_assert (vcall_index
!= NULL_TREE
, 20000621);
2296 vcall_index
= NULL_TREE
;
2298 thunk
= make_thunk (build1 (ADDR_EXPR
,
2299 vfunc_ptr_type_node
,
2303 /*generate_with_vtable_p=*/0);
2304 use_thunk (thunk
, /*emit_p=*/1);
2309 /* Generate RTL for FN. */
2316 const char *saved_input_filename
;
2318 /* When the parser calls us after finishing the body of a template
2319 function, we don't really want to expand the body. When we're
2320 processing an in-class definition of an inline function,
2321 PROCESSING_TEMPLATE_DECL will no longer be set here, so we have
2322 to look at the function itself. */
2323 if (processing_template_decl
2324 || (DECL_LANG_SPECIFIC (fn
)
2325 && DECL_TEMPLATE_INFO (fn
)
2326 && uses_template_parms (DECL_TI_ARGS (fn
))))
2328 /* Normally, collection only occurs in rest_of_compilation. So,
2329 if we don't collect here, we never collect junk generated
2330 during the processing of templates until we hit a
2331 non-template function. */
2336 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
2337 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn
),
2338 simplify_aggr_init_exprs_r
,
2341 /* If this is a constructor or destructor body, we have to clone it
2342 under the new ABI. */
2343 if (maybe_clone_body (fn
))
2345 /* We don't want to process FN again, so pretend we've written
2346 it out, even though we haven't. */
2347 TREE_ASM_WRITTEN (fn
) = 1;
2351 /* There's no reason to do any of the work here if we're only doing
2352 semantic analysis; this code just generates RTL. */
2353 if (flag_syntax_only
)
2356 /* If possible, avoid generating RTL for this function. Instead,
2357 just record it as an inline function, and wait until end-of-file
2358 to decide whether to write it out or not. */
2359 if (/* We have to generate RTL if it's not an inline function. */
2360 (DECL_INLINE (fn
) || DECL_COMDAT (fn
))
2361 /* Or if we have to keep all inline functions anyhow. */
2362 && !flag_keep_inline_functions
2363 /* Or if we actually have a reference to the function. */
2364 && !DECL_NEEDED_P (fn
)
2365 /* Or if this is a nested function. */
2366 && !decl_function_context (fn
))
2368 /* Give the function RTL now so that we can assign it to a
2369 function pointer, etc. */
2370 make_function_rtl (fn
);
2371 /* Set DECL_EXTERNAL so that assemble_external will be called as
2372 necessary. We'll clear it again in finish_file. */
2373 if (!DECL_EXTERNAL (fn
))
2375 DECL_NOT_REALLY_EXTERN (fn
) = 1;
2376 DECL_EXTERNAL (fn
) = 1;
2378 /* Remember this function. In finish_file we'll decide if
2379 we actually need to write this function out. */
2381 /* Let the back-end know that this funtion exists. */
2382 note_deferral_of_defined_inline_function (fn
);
2386 /* Emit any thunks that should be emitted at the same time as FN. */
2387 emit_associated_thunks (fn
);
2389 timevar_push (TV_INTEGRATION
);
2391 /* Optimize the body of the function before expanding it. */
2392 optimize_function (fn
);
2394 timevar_pop (TV_INTEGRATION
);
2395 timevar_push (TV_EXPAND
);
2397 /* Save the current file name and line number. When we expand the
2398 body of the function, we'll set LINENO and INPUT_FILENAME so that
2399 error-mesages come out in the right places. */
2400 saved_lineno
= lineno
;
2401 saved_input_filename
= input_filename
;
2402 lineno
= DECL_SOURCE_LINE (fn
);
2403 input_filename
= DECL_SOURCE_FILE (fn
);
2405 genrtl_start_function (fn
);
2406 current_function_is_thunk
= DECL_THUNK_P (fn
);
2408 /* We don't need to redeclare __FUNCTION__, __PRETTY_FUNCTION__, or
2409 any of the other magic variables we set up when starting a
2411 function_name_declared_p
= 1;
2413 /* Expand the body. */
2414 expand_stmt (DECL_SAVED_TREE (fn
));
2416 /* Statements should always be full-expressions at the outermost set
2417 of curly braces for a function. */
2418 my_friendly_assert (stmts_are_full_exprs_p (), 19990831);
2420 /* The outermost statement for a function contains the line number
2421 recorded when we finished processing the function. */
2422 lineno
= STMT_LINENO (DECL_SAVED_TREE (fn
));
2424 /* Generate code for the function. */
2425 genrtl_finish_function (fn
);
2427 /* If possible, obliterate the body of the function so that it can
2428 be garbage collected. */
2429 if (flag_dump_translation_unit
)
2430 /* Keep the body; we're going to dump it. */
2432 else if (DECL_INLINE (fn
) && flag_inline_trees
)
2433 /* We might need the body of this function so that we can expand
2434 it inline somewhere else. */
2437 /* We don't need the body; blow it away. */
2438 DECL_SAVED_TREE (fn
) = NULL_TREE
;
2440 /* And restore the current source position. */
2441 lineno
= saved_lineno
;
2442 input_filename
= saved_input_filename
;
2443 extract_interface_info ();
2445 timevar_pop (TV_EXPAND
);
2448 /* Start generating the RTL for FN. */
2451 genrtl_start_function (fn
)
2456 /* Tell everybody what function we're processing. */
2457 current_function_decl
= fn
;
2458 /* Get the RTL machinery going for this function. */
2459 init_function_start (fn
, DECL_SOURCE_FILE (fn
), DECL_SOURCE_LINE (fn
));
2460 /* Let everybody know that we're expanding this function, not doing
2461 semantic analysis. */
2464 /* Even though we're inside a function body, we still don't want to
2465 call expand_expr to calculate the size of a variable-sized array.
2466 We haven't necessarily assigned RTL to all variables yet, so it's
2467 not safe to try to expand expressions involving them. */
2468 immediate_size_expand
= 0;
2469 cfun
->x_dont_save_pending_sizes_p
= 1;
2471 /* Let the user know we're compiling this function. */
2472 announce_function (fn
);
2474 /* Initialize the per-function data. */
2475 my_friendly_assert (!DECL_PENDING_INLINE_P (fn
), 20000911);
2476 if (DECL_SAVED_FUNCTION_DATA (fn
))
2478 /* If we already parsed this function, and we're just expanding it
2479 now, restore saved state. */
2480 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (fn
);
2482 /* This function is being processed in whole-function mode; we
2483 already did semantic analysis. */
2484 cfun
->x_whole_function_mode_p
= 1;
2486 /* If we decided that we didn't want to inline this function,
2487 make sure the back-end knows that. */
2488 if (!current_function_cannot_inline
)
2489 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
2491 /* We don't need the saved data anymore. */
2492 free (DECL_SAVED_FUNCTION_DATA (fn
));
2493 DECL_SAVED_FUNCTION_DATA (fn
) = NULL
;
2496 /* Tell the cross-reference machinery that we're defining this
2498 GNU_xref_function (fn
, DECL_ARGUMENTS (fn
));
2500 /* Keep track of how many functions we're presently expanding. */
2503 /* Create a binding level for the parameters. */
2504 expand_start_bindings (2);
2505 /* Clear out any previously saved instructions for this function, in
2506 case it was defined more than once. */
2507 DECL_SAVED_INSNS (fn
) = NULL
;
2508 /* Go through the PARM_DECLs for this function to see if any need
2510 for (parm
= DECL_ARGUMENTS (fn
); parm
; parm
= TREE_CHAIN (parm
))
2511 if (TREE_TYPE (parm
) != error_mark_node
2512 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (parm
)))
2514 expand_function_start (fn
, /*parms_have_cleanups=*/1);
2518 expand_function_start (fn
, /*parms_have_cleanups=*/0);
2519 /* If this function is `main'. */
2520 if (DECL_MAIN_P (fn
))
2521 expand_main_function ();
2522 /* Create a binding contour which can be used to catch
2523 cleanup-generated temporaries. */
2524 expand_start_bindings (2);
2527 /* Finish generating the RTL for FN. */
2530 genrtl_finish_function (fn
)
2533 tree no_return_label
= NULL_TREE
;
2536 if (write_symbols
!= NO_DEBUG
)
2538 /* Keep this code around in case we later want to control debug info
2539 based on whether a type is "used". (jason 1999-11-11) */
2541 tree ttype
= target_type (fntype
);
2544 if (IS_AGGR_TYPE (ttype
))
2545 /* Let debugger know it should output info for this type. */
2546 note_debug_info_needed (ttype
);
2548 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
2550 ttype
= target_type (TREE_TYPE (parmdecl
));
2551 if (IS_AGGR_TYPE (ttype
))
2552 /* Let debugger know it should output info for this type. */
2553 note_debug_info_needed (ttype
);
2558 /* Clean house because we will need to reorder insns here. */
2559 do_pending_stack_adjust ();
2561 if (!dtor_label
&& !DECL_CONSTRUCTOR_P (fn
)
2562 && return_label
!= NULL_RTX
2563 && current_function_return_value
== NULL_TREE
2564 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
2565 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
2567 if (flag_exceptions
)
2568 expand_exception_blocks ();
2570 /* If this function is supposed to return a value, ensure that
2571 we do not fall into the cleanups by mistake. The end of our
2572 function will look like this:
2574 user code (may have return stmt somewhere)
2575 goto no_return_label
2580 NOTE_INSN_FUNCTION_END
2584 If the user omits a return stmt in the USER CODE section, we
2585 will have a control path which reaches NOTE_INSN_FUNCTION_END.
2586 Otherwise, we won't. */
2587 if (no_return_label
)
2589 DECL_CONTEXT (no_return_label
) = fn
;
2590 DECL_INITIAL (no_return_label
) = error_mark_node
;
2591 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
2592 DECL_SOURCE_LINE (no_return_label
) = lineno
;
2593 expand_goto (no_return_label
);
2598 /* Remove the binding contour which is used to catch
2599 cleanup-generated temporaries. */
2600 expand_end_bindings (0, 0, 0);
2603 /* Emit label at beginning of cleanup code for parameters. */
2604 emit_label (cleanup_label
);
2607 /* Finish building code that will trigger warnings if users forget
2608 to make their functions return values. */
2609 emit_jump (return_label
);
2610 if (no_return_label
)
2612 /* We don't need to call `expand_*_return' here because we don't
2613 need any cleanups here--this path of code is only for error
2614 checking purposes. */
2615 expand_label (no_return_label
);
2618 /* We hard-wired immediate_size_expand to zero in start_function.
2619 Expand_function_end will decrement this variable. So, we set the
2620 variable to one here, so that after the decrement it will remain
2622 immediate_size_expand
= 1;
2624 /* Generate rtl for function exit. */
2625 expand_function_end (input_filename
, lineno
, 1);
2627 /* If this is a nested function (like a template instantiation that
2628 we're compiling in the midst of compiling something else), push a
2629 new GC context. That will keep local variables on the stack from
2630 being collected while we're doing the compilation of this
2632 if (function_depth
> 1)
2633 ggc_push_context ();
2635 /* Run the optimizers and output the assembler code for this
2637 rest_of_compilation (fn
);
2639 /* Undo the call to ggc_push_context above. */
2640 if (function_depth
> 1)
2643 if (DECL_SAVED_INSNS (fn
) && ! TREE_ASM_WRITTEN (fn
))
2645 /* Set DECL_EXTERNAL so that assemble_external will be called as
2646 necessary. We'll clear it again in finish_file. */
2647 if (! DECL_EXTERNAL (fn
))
2648 DECL_NOT_REALLY_EXTERN (fn
) = 1;
2649 DECL_EXTERNAL (fn
) = 1;
2654 /* Keep this code around in case we later want to control debug info
2655 based on whether a type is "used". (jason 1999-11-11) */
2657 if (ctype
&& TREE_ASM_WRITTEN (fn
))
2658 note_debug_info_needed (ctype
);
2661 /* If this function is marked with the constructor attribute, add it
2662 to the list of functions to be called along with constructors
2663 from static duration objects. */
2664 if (DECL_STATIC_CONSTRUCTOR (fn
))
2665 static_ctors
= tree_cons (NULL_TREE
, fn
, static_ctors
);
2667 /* If this function is marked with the destructor attribute, add it
2668 to the list of functions to be called along with destructors from
2669 static duration objects. */
2670 if (DECL_STATIC_DESTRUCTOR (fn
))
2671 static_dtors
= tree_cons (NULL_TREE
, fn
, static_dtors
);
2675 if (!DECL_SAVED_INSNS (fn
)
2676 && !(flag_inline_trees
&& DECL_INLINE (fn
)))
2680 /* Stop pointing to the local nodes about to be freed. */
2681 /* But DECL_INITIAL must remain nonzero so we know this
2682 was an actual function definition. */
2683 DECL_INITIAL (fn
) = error_mark_node
;
2684 for (t
= DECL_ARGUMENTS (fn
); t
; t
= TREE_CHAIN (t
))
2685 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
2688 /* Let the error reporting routines know that we're outside a
2689 function. For a nested function, this value is used in
2690 pop_cp_function_context and then reset via pop_function_context. */
2691 current_function_decl
= NULL_TREE
;
2694 /* Perform initialization related to this module. */
2697 init_cp_semantics ()
2699 lang_expand_stmt
= cp_expand_stmt
;