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
39 /* There routines provide a modular interface to perform many parsing
40 operations. They may therefore be used during actual parsing, or
41 during template instantiation, which may be regarded as a
42 degenerate form of parsing. Since the current g++ parser is
43 lacking in several respects, and will be reimplemented, we are
44 attempting to move most code that is not directly related to
45 parsing into this file; that will make implementing the new parser
46 much easier since it will be able to make use of these routines. */
48 static tree expand_cond PARAMS ((tree));
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));
53 /* Record the fact that STMT was the last statement added to the
56 #define SET_LAST_STMT(stmt) \
57 (current_stmt_tree->x_last_stmt = (stmt))
59 /* When parsing a template, LAST_TREE contains the last statement
60 parsed. These are chained together through the TREE_CHAIN field,
61 but often need to be re-organized since the parse is performed
62 bottom-up. This macro makes LAST_TREE the indicated SUBSTMT of
65 #define RECHAIN_STMTS(stmt, substmt) \
67 substmt = TREE_CHAIN (stmt); \
68 TREE_CHAIN (stmt) = NULL_TREE; \
69 SET_LAST_STMT (stmt); \
72 /* Finish processing the COND, the SUBSTMT condition for STMT. */
74 #define FINISH_COND(cond, stmt, substmt) \
76 if (last_tree != stmt) \
78 RECHAIN_STMTS (stmt, substmt); \
79 if (!processing_template_decl) \
81 cond = build_tree_list (substmt, cond); \
89 /* T is a statement. Add it to the statement-tree. */
95 /* Add T to the statement-tree. */
96 TREE_CHAIN (last_tree) = t;
99 /* When we expand a statement-tree, we must know whether or not the
100 statements are full-expresions. We record that fact here. */
101 if (building_stmt_tree ())
102 STMT_IS_FULL_EXPR_P (last_tree) = stmts_are_full_exprs_p;
105 /* COND is the condition-expression for an if, while, etc.,
106 statement. Convert it to a boolean value, if appropriate. */
109 maybe_convert_cond (cond)
112 /* Empty conditions remain empty. */
116 /* Wait until we instantiate templates before doing conversion. */
117 if (processing_template_decl)
120 /* Do the conversion. */
121 cond = convert_from_reference (cond);
122 return condition_conversion (cond);
125 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
128 finish_expr_stmt (expr)
131 if (expr != NULL_TREE)
133 if (building_stmt_tree ())
135 /* Do default conversion if safe and possibly important,
136 in case within ({...}). */
137 if (!processing_template_decl
138 && !stmts_are_full_exprs_p
139 && ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
141 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE))
142 expr = default_conversion (expr);
144 if (stmts_are_full_exprs_p)
145 expr = convert_to_void (expr, "statement");
147 if (!processing_template_decl)
148 expr = break_out_cleanups (expr);
150 add_tree (build_min_nt (EXPR_STMT, expr));
154 emit_line_note (input_filename, lineno);
156 if (stmts_are_full_exprs_p)
157 expand_start_target_temps ();
159 cplus_expand_expr_stmt (expr);
161 if (stmts_are_full_exprs_p)
162 expand_end_target_temps ();
168 /* This was an expression-statement, so we save the type of the
170 last_expr_type = expr ? TREE_TYPE (expr) : NULL_TREE;
173 /* Begin an if-statement. Returns a newly created IF_STMT if
183 if (building_stmt_tree ())
185 r = build_min_nt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
194 /* Process the COND of an if-statement, which may be given by
198 finish_if_stmt_cond (cond, if_stmt)
202 cond = maybe_convert_cond (cond);
204 if (building_stmt_tree ())
205 FINISH_COND (cond, if_stmt, IF_COND (if_stmt));
208 emit_line_note (input_filename, lineno);
209 expand_start_cond (cond, 0);
213 /* Finish the then-clause of an if-statement, which may be given by
217 finish_then_clause (if_stmt)
220 if (building_stmt_tree ())
222 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
223 SET_LAST_STMT (if_stmt);
230 /* Begin the else-clause of an if-statement. */
235 if (!building_stmt_tree ())
236 expand_start_else ();
239 /* Finish the else-clause of an if-statement, which may be given by
243 finish_else_clause (if_stmt)
246 if (building_stmt_tree ())
247 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
250 /* Finsh an if-statement. */
255 if (!building_stmt_tree ())
262 /* Begin a while-statement. Returns a newly created WHILE_STMT if
270 if (building_stmt_tree ())
272 r = build_min_nt (WHILE_STMT, NULL_TREE, NULL_TREE);
278 emit_line_note (input_filename, lineno);
279 expand_start_loop (1);
288 /* Process the COND of a while-statement, which may be given by
292 finish_while_stmt_cond (cond, while_stmt)
296 cond = maybe_convert_cond (cond);
298 if (building_stmt_tree ())
299 FINISH_COND (cond, while_stmt, WHILE_COND (while_stmt));
302 emit_line_note (input_filename, lineno);
303 expand_exit_loop_if_false (0, cond);
306 /* If COND wasn't a declaration, clear out the
307 block we made for it and start a new one here so the
308 optimization in expand_end_loop will work. */
309 if (getdecls () == NULL_TREE)
316 /* Finish a while-statement, which may be given by WHILE_STMT. */
319 finish_while_stmt (while_stmt)
324 if (building_stmt_tree ())
325 RECHAIN_STMTS (while_stmt, WHILE_BODY (while_stmt));
331 /* Begin a do-statement. Returns a newly created DO_STMT if
337 if (building_stmt_tree ())
339 tree r = build_min_nt (DO_STMT, NULL_TREE, NULL_TREE);
346 emit_line_note (input_filename, lineno);
347 expand_start_loop_continue_elsewhere (1);
352 /* Finish the body of a do-statement, which may be given by DO_STMT. */
355 finish_do_body (do_stmt)
358 if (building_stmt_tree ())
359 RECHAIN_STMTS (do_stmt, DO_BODY (do_stmt));
361 expand_loop_continue_here ();
364 /* Finish a do-statement, which may be given by DO_STMT, and whose
365 COND is as indicated. */
368 finish_do_stmt (cond, do_stmt)
372 cond = maybe_convert_cond (cond);
374 if (building_stmt_tree ())
375 DO_COND (do_stmt) = cond;
378 emit_line_note (input_filename, lineno);
379 expand_exit_loop_if_false (0, cond);
386 /* Finish a return-statement. The EXPRESSION returned, if any, is as
390 finish_return_stmt (expr)
393 if (doing_semantic_analysis_p () && !processing_template_decl)
394 expr = check_return_expr (expr);
396 if (doing_semantic_analysis_p () && !processing_template_decl)
398 if (DECL_CONSTRUCTOR_P (current_function_decl) && ctor_label)
400 /* Even returns without a value in a constructor must return
401 `this'. We accomplish this by sending all returns in a
402 constructor to the CTOR_LABEL; finish_function emits code to
403 return a value there. When we finally generate the real
404 return statement, CTOR_LABEL is no longer set, and we fall
405 through into the normal return-processing code below. */
406 finish_goto_stmt (ctor_label);
409 else if (DECL_DESTRUCTOR_P (current_function_decl))
411 /* Similarly, all destructors must run destructors for
412 base-classes before returning. So, all returns in a
413 destructor get sent to the DTOR_LABEL; finsh_function emits
414 code to return a value there. */
415 finish_goto_stmt (dtor_label);
420 if (building_stmt_tree ())
421 add_tree (build_min_nt (RETURN_STMT, expr));
424 emit_line_note (input_filename, lineno);
425 c_expand_return (expr);
431 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
438 if (building_stmt_tree ())
440 r = build_min_nt (FOR_STMT, NULL_TREE, NULL_TREE,
441 NULL_TREE, NULL_TREE);
447 if (flag_new_for_scope > 0)
450 note_level_for_for ();
456 /* Finish the for-init-statement of a for-statement, which may be
457 given by FOR_STMT. */
460 finish_for_init_stmt (for_stmt)
463 if (building_stmt_tree ())
465 if (last_tree != for_stmt)
466 RECHAIN_STMTS (for_stmt, FOR_INIT_STMT (for_stmt));
471 emit_line_note (input_filename, lineno);
472 expand_start_loop_continue_elsewhere (1);
478 /* Finish the COND of a for-statement, which may be given by
482 finish_for_cond (cond, for_stmt)
486 cond = maybe_convert_cond (cond);
488 if (building_stmt_tree ())
489 FINISH_COND (cond, for_stmt, FOR_COND (for_stmt));
492 emit_line_note (input_filename, lineno);
494 expand_exit_loop_if_false (0, cond);
497 /* If the cond wasn't a declaration, clear out the
498 block we made for it and start a new one here so the
499 optimization in expand_end_loop will work. */
500 if (getdecls () == NULL_TREE)
507 /* Finish the increment-EXPRESSION in a for-statement, which may be
508 given by FOR_STMT. */
511 finish_for_expr (expr, for_stmt)
515 if (building_stmt_tree ())
516 FOR_EXPR (for_stmt) = expr;
519 /* Finish the body of a for-statement, which may be given by
520 FOR_STMT. The increment-EXPR for the loop must be
524 finish_for_stmt (expr, for_stmt)
528 /* Pop the scope for the body of the loop. */
531 if (building_stmt_tree ())
532 RECHAIN_STMTS (for_stmt, FOR_BODY (for_stmt));
535 emit_line_note (input_filename, lineno);
536 expand_loop_continue_here ();
538 finish_expr_stmt (expr);
542 if (flag_new_for_scope > 0)
548 /* Finish a break-statement. */
553 emit_line_note (input_filename, lineno);
554 if (building_stmt_tree ())
555 add_tree (build_min_nt (BREAK_STMT));
556 else if ( ! expand_exit_something ())
557 cp_error ("break statement not within loop or switch");
560 /* Finish a continue-statement. */
563 finish_continue_stmt ()
565 emit_line_note (input_filename, lineno);
566 if (building_stmt_tree ())
567 add_tree (build_min_nt (CONTINUE_STMT));
568 else if (! expand_continue_loop (0))
569 cp_error ("continue statement not within a loop");
572 /* Begin a switch-statement. Returns a new SWITCH_STMT if
580 if (building_stmt_tree ())
582 r = build_min_nt (SWITCH_STMT, NULL_TREE, NULL_TREE);
593 /* Finish the cond of a switch-statement. */
596 finish_switch_cond (cond, switch_stmt)
600 if (building_stmt_tree ())
602 if (!processing_template_decl)
604 /* Convert the condition to an integer or enumeration type. */
605 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, 1);
606 if (cond == NULL_TREE)
608 error ("switch quantity not an integer");
609 cond = error_mark_node;
611 if (cond != error_mark_node)
616 cond = default_conversion (cond);
617 type = TREE_TYPE (cond);
618 idx = get_unwidened (cond, 0);
619 /* We can't strip a conversion from a signed type to an unsigned,
620 because if we did, int_fits_type_p would do the wrong thing
621 when checking case values for being in range,
622 and it's too hard to do the right thing. */
623 if (TREE_UNSIGNED (TREE_TYPE (cond))
624 == TREE_UNSIGNED (TREE_TYPE (idx)))
627 cond = fold (build1 (CLEANUP_POINT_EXPR, type, cond));
630 FINISH_COND (cond, switch_stmt, SWITCH_COND (switch_stmt));
632 else if (cond != error_mark_node)
634 emit_line_note (input_filename, lineno);
635 c_expand_start_case (cond);
638 /* The code is in error, but we don't want expand_end_case to
640 c_expand_start_case (boolean_false_node);
645 /* Finish the body of a switch-statement, which may be given by
646 SWITCH_STMT. The COND to switch on is indicated. */
649 finish_switch_stmt (cond, switch_stmt)
653 if (building_stmt_tree ())
654 RECHAIN_STMTS (switch_stmt, SWITCH_BODY (switch_stmt));
656 expand_end_case (cond);
662 /* Finish a case-label. */
665 finish_case_label (low_value, high_value)
669 if (building_stmt_tree ())
671 /* Add a representation for the case label to the statement
673 add_tree (build_min_nt (CASE_LABEL, low_value, high_value));
674 /* And warn about crossing initializations, etc. */
675 if (!processing_template_decl)
676 define_case_label ();
680 do_case (low_value, high_value);
683 /* Finish a goto-statement. */
686 finish_goto_stmt (destination)
689 if (TREE_CODE (destination) == IDENTIFIER_NODE)
690 destination = lookup_label (destination);
692 /* We warn about unused labels with -Wunused. That means we have to
693 mark the used labels as used. */
694 if (TREE_CODE (destination) == LABEL_DECL)
695 TREE_USED (destination) = 1;
697 if (building_stmt_tree ())
699 if (TREE_CODE (destination) != LABEL_DECL)
700 /* We don't inline calls to functions with computed gotos.
701 Those functions are typically up to some funny business,
702 and may be depending on the labels being at particular
703 addresses, or some such. */
704 DECL_UNINLINABLE (current_function_decl) = 1;
706 check_goto (destination);
708 add_tree (build_min_nt (GOTO_STMT, destination));
712 emit_line_note (input_filename, lineno);
714 if (TREE_CODE (destination) == LABEL_DECL)
716 label_rtx (destination);
717 expand_goto (destination);
720 expand_computed_goto (destination);
724 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
730 if (building_stmt_tree ())
732 tree r = build_min_nt (TRY_BLOCK, NULL_TREE,
739 emit_line_note (input_filename, lineno);
740 expand_start_try_stmts ();
745 /* Likewise, for a function-try-block. */
748 begin_function_try_block ()
750 if (building_stmt_tree ())
752 tree r = build_min_nt (TRY_BLOCK, NULL_TREE,
754 FN_TRY_BLOCK_P (r) = 1;
760 if (! current_function_parms_stored)
762 expand_start_early_try_stmts ();
767 /* Finish a try-block, which may be given by TRY_BLOCK. */
770 finish_try_block (try_block)
773 if (building_stmt_tree ())
774 RECHAIN_STMTS (try_block, TRY_STMTS (try_block));
776 expand_start_all_catch ();
779 /* Finish the body of a cleanup try-block, which may be given by
783 finish_cleanup_try_block (try_block)
786 if (building_stmt_tree ())
787 RECHAIN_STMTS (try_block, TRY_STMTS (try_block));
790 /* Finish an implicitly generated try-block, with a cleanup is given
794 finish_cleanup (cleanup, try_block)
798 if (building_stmt_tree ())
800 TRY_HANDLERS (try_block) = cleanup;
801 CLEANUP_P (try_block) = 1;
804 expand_eh_region_end (protect_with_terminate (cleanup));
807 /* Likewise, for a function-try-block. */
810 finish_function_try_block (try_block)
813 if (building_stmt_tree ())
815 if (TREE_CHAIN (try_block)
816 && TREE_CODE (TREE_CHAIN (try_block)) == CTOR_INITIALIZER)
818 /* Chain the compound statement after the CTOR_INITIALIZER. */
819 TREE_CHAIN (TREE_CHAIN (try_block)) = last_tree;
820 /* And make the CTOR_INITIALIZER the body of the try-block. */
821 RECHAIN_STMTS (try_block, TRY_STMTS (try_block));
824 RECHAIN_STMTS (try_block, TRY_STMTS (try_block));
828 end_protect_partials ();
829 expand_start_all_catch ();
832 in_function_try_handler = 1;
835 /* Finish a handler-sequence for a try-block, which may be given by
839 finish_handler_sequence (try_block)
842 if (building_stmt_tree ())
844 RECHAIN_STMTS (try_block, TRY_HANDLERS (try_block));
845 check_handlers (TRY_HANDLERS (try_block));
848 expand_end_all_catch ();
851 /* Likewise, for a function-try-block. */
854 finish_function_handler_sequence (try_block)
857 in_function_try_handler = 0;
859 if (building_stmt_tree ())
861 RECHAIN_STMTS (try_block, TRY_HANDLERS (try_block));
862 check_handlers (TRY_HANDLERS (try_block));
865 expand_end_all_catch ();
868 /* Begin a handler. Returns a HANDLER if appropriate. */
875 if (building_stmt_tree ())
877 r = build_min_nt (HANDLER, NULL_TREE, NULL_TREE);
888 /* Finish the handler-parameters for a handler, which may be given by
889 HANDLER. DECL is the declaration for the catch parameter, or NULL
890 if this is a `catch (...)' clause. */
893 finish_handler_parms (decl, handler)
897 tree blocks = NULL_TREE;
899 if (processing_template_decl)
903 decl = pushdecl (decl);
904 decl = push_template_decl (decl);
905 add_decl_stmt (decl);
906 RECHAIN_STMTS (handler, HANDLER_PARMS (handler));
909 else if (building_stmt_tree ())
910 blocks = expand_start_catch_block (decl);
913 TREE_TYPE (handler) = TREE_TYPE (decl);
918 /* Note the beginning of a handler for TYPE. This function is called
919 at the point to which control should be transferred when an
920 appropriately-typed exception is thrown. */
923 begin_catch_block (type)
926 if (building_stmt_tree ())
927 add_tree (build (START_CATCH_STMT, type));
929 start_catch_handler (type);
932 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
933 the return value from the matching call to finish_handler_parms. */
936 finish_handler (blocks, handler)
940 if (!processing_template_decl)
942 if (building_stmt_tree ())
943 expand_end_catch_block (blocks);
945 if (!building_stmt_tree ())
947 /* Fall to outside the try statement when done executing
948 handler and we fall off end of handler. This is jump
949 Lresume in the documentation. */
950 expand_goto (top_label_entry (&caught_return_label_stack));
951 end_catch_handler ();
957 if (building_stmt_tree ())
958 RECHAIN_STMTS (handler, HANDLER_BODY (handler));
961 /* Begin a compound-statement. If HAS_NO_SCOPE is non-zero, the
962 compound-statement does not define a scope. Returns a new
963 COMPOUND_STMT if appropriate. */
966 begin_compound_stmt (has_no_scope)
972 if (building_stmt_tree ())
974 r = build_min_nt (COMPOUND_STMT, NULL_TREE);
975 /* Mark that this block is for a try so that we can yell at
976 people trying to jump in. */
977 if (last_tree && TREE_CODE (last_tree) == TRY_BLOCK)
981 COMPOUND_STMT_NO_SCOPE (r) = 1;
986 last_expr_type = NULL_TREE;
992 note_level_for_eh ();
995 /* Normally, we try hard to keep the BLOCK for a
996 statement-expression. But, if it's a statement-expression with
997 a scopeless block, there's nothing to keep, and we don't want
998 to accidentally keep a block *inside* the scopeless block. */
1001 /* If this is the outermost block of the function, declare the
1002 variables __FUNCTION__, __PRETTY_FUNCTION__, and so forth. */
1004 && !current_function_name_declared
1007 current_function_name_declared = 1;
1008 declare_function_name ();
1015 /* Finish a compound-statement, which may be given by COMPOUND_STMT.
1016 If HAS_NO_SCOPE is non-zero, the compound statement does not define
1020 finish_compound_stmt (has_no_scope, compound_stmt)
1032 if (building_stmt_tree ())
1033 RECHAIN_STMTS (compound_stmt, COMPOUND_BODY (compound_stmt));
1035 /* When we call finish_stmt we will lose LAST_EXPR_TYPE. But, since
1036 the precise purpose of that variable is store the type of the
1037 last expression statement within the last compound statement, we
1038 preserve the value. */
1046 /* Finish an asm-statement, whose components are a CV_QUALIFIER, a
1047 STRING, some OUTPUT_OPERANDS, some INPUT_OPERANDS, and some
1051 finish_asm_stmt (cv_qualifier, string, output_operands,
1052 input_operands, clobbers)
1055 tree output_operands;
1056 tree input_operands;
1059 if (TREE_CHAIN (string))
1060 string = combine_strings (string);
1062 if (cv_qualifier != NULL_TREE
1063 && cv_qualifier != ridpointers[(int) RID_VOLATILE])
1065 cp_warning ("%s qualifier ignored on asm",
1066 IDENTIFIER_POINTER (cv_qualifier));
1067 cv_qualifier = NULL_TREE;
1070 if (building_stmt_tree ())
1072 tree r = build_min_nt (ASM_STMT, cv_qualifier, string,
1073 output_operands, input_operands,
1079 emit_line_note (input_filename, lineno);
1080 if (output_operands != NULL_TREE || input_operands != NULL_TREE
1081 || clobbers != NULL_TREE)
1085 for (t = input_operands; t; t = TREE_CHAIN (t))
1086 TREE_VALUE (t) = decay_conversion (TREE_VALUE (t));
1088 c_expand_asm_operands (string, output_operands,
1091 cv_qualifier != NULL_TREE,
1092 input_filename, lineno);
1095 expand_asm (string);
1101 /* Finish a label with the indicated NAME. */
1104 finish_label_stmt (name)
1107 tree decl = define_label (input_filename, lineno, name);
1109 if (building_stmt_tree ())
1110 add_tree (build_min_nt (LABEL_STMT, decl));
1112 expand_label (decl);
1115 /* Finish a series of declarations for local labels. G++ allows users
1116 to declare "local" labels, i.e., labels with scope. This extension
1117 is useful when writing code involving statement-expressions. */
1120 finish_label_decl (name)
1123 tree decl = declare_local_label (name);
1124 if (building_stmt_tree ())
1125 add_decl_stmt (decl);
1128 /* Create a declaration statement for the declaration given by the
1132 add_decl_stmt (decl)
1137 /* We need the type to last until instantiation time. */
1138 decl_stmt = build_min_nt (DECL_STMT, decl);
1139 add_tree (decl_stmt);
1142 /* We're in a constructor, and have just constructed a a subobject of
1143 *THIS. CLEANUP is code to run if an exception is thrown before the
1144 end of the current function is reached. */
1147 finish_subobject (cleanup)
1150 if (building_stmt_tree ())
1152 tree r = build_min_nt (SUBOBJECT, cleanup);
1156 add_partial_entry (cleanup);
1159 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1162 finish_decl_cleanup (decl, cleanup)
1166 if (building_stmt_tree ())
1167 add_tree (build_min_nt (CLEANUP_STMT, decl, cleanup));
1169 || (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node))
1170 expand_decl_cleanup (decl, cleanup);
1173 /* Bind a name and initialization to the return value of
1174 the current function. */
1177 finish_named_return_value (return_id, init)
1178 tree return_id, init;
1180 tree decl = DECL_RESULT (current_function_decl);
1183 /* Give this error as many times as there are occurrences,
1184 so that users can use Emacs compilation buffers to find
1185 and fix all such places. */
1186 pedwarn ("ISO C++ does not permit named return values");
1188 if (return_id != NULL_TREE)
1190 if (DECL_NAME (decl) == NULL_TREE)
1192 DECL_NAME (decl) = return_id;
1193 DECL_ASSEMBLER_NAME (decl) = return_id;
1197 cp_error ("return identifier `%D' already in place", return_id);
1202 /* Can't let this happen for constructors. */
1203 if (DECL_CONSTRUCTOR_P (current_function_decl))
1205 error ("can't redefine default return value for constructors");
1209 /* If we have a named return value, put that in our scope as well. */
1210 if (DECL_NAME (decl) != NULL_TREE)
1212 /* Let `cp_finish_decl' know that this initializer is ok. */
1213 DECL_INITIAL (decl) = init;
1214 if (doing_semantic_analysis_p ())
1217 if (building_stmt_tree ())
1218 add_tree (build_min_nt (RETURN_INIT, return_id, init));
1221 cp_finish_decl (decl, init, NULL_TREE, 0);
1222 store_return_init (decl);
1226 /* Don't use tree-inlining for functions with named return values.
1227 That doesn't work properly because we don't do any translation of
1228 the RETURN_INITs when they are copied. */
1229 DECL_UNINLINABLE (current_function_decl) = 1;
1232 /* Cache the value of this class's main virtual function table pointer
1233 in a register variable. This will save one indirection if a
1234 more than one virtual function call is made this function. */
1239 my_friendly_assert (doing_semantic_analysis_p (), 19990919);
1241 /* If we've already done this, there's no need to do it again. */
1245 if (DECL_CONSTRUCTOR_P (current_function_decl))
1247 if (processing_template_decl)
1248 add_tree (build_min_nt
1250 current_member_init_list, current_base_init_list));
1255 /* Mark the beginning of the constructor. */
1256 ctor_stmt = build_min_nt (CTOR_STMT);
1257 CTOR_BEGIN_P (ctor_stmt) = 1;
1258 add_tree (ctor_stmt);
1260 /* And actually initialize the base-classes and members. */
1264 else if (DECL_DESTRUCTOR_P (current_function_decl)
1265 && !processing_template_decl)
1271 /* If the dtor is empty, and we know there is not any possible
1272 way we could use any vtable entries, before they are possibly
1273 set by a base class dtor, we don't have to setup the vtables,
1274 as we know that any base class dtor will set up any vtables
1275 it needs. We avoid MI, because one base class dtor can do a
1276 virtual dispatch to an overridden function that would need to
1277 have a non-related vtable set up, we cannot avoid setting up
1278 vtables in that case. We could change this to see if there
1279 is just one vtable. */
1280 if_stmt = begin_if_stmt ();
1282 /* If it is not safe to avoid setting up the vtables, then
1283 someone will change the condition to be boolean_true_node.
1284 (Actually, for now, we do not have code to set the condition
1285 appropriately, so we just assume that we always need to
1286 initialize the vtables.) */
1287 finish_if_stmt_cond (boolean_true_node, if_stmt);
1288 current_vcalls_possible_p = &IF_COND (if_stmt);
1290 /* Don't declare __PRETTY_FUNCTION__ and friends here when we
1291 open the block for the if-body. */
1292 saved_cfnd = current_function_name_declared;
1293 current_function_name_declared = 1;
1294 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
1295 current_function_name_declared = saved_cfnd;
1297 /* Make all virtual function table pointers in non-virtual base
1298 classes point to CURRENT_CLASS_TYPE's virtual function
1300 initialize_vtbl_ptrs (current_class_ptr);
1302 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
1303 finish_then_clause (if_stmt);
1307 /* Always keep the BLOCK node associated with the outermost pair of
1308 curly braces of a function. These are needed for correct
1309 operation of dwarfout.c. */
1310 keep_next_level (1);
1312 /* The virtual function tables are set up now. */
1316 /* Add a scope-statement to the statement-tree. BEGIN_P indicates
1317 whether this statements opens or closes a scope. PARTIAL_P is true
1318 for a partial scope, i.e, the scope that begins after a label when
1319 an object that needs a cleanup is created. If BEGIN_P is nonzero,
1320 returns a new TREE_LIST representing the top of the SCOPE_STMT
1321 stack. The TREE_PURPOSE is the new SCOPE_STMT. If BEGIN_P is
1322 zero, returns a TREE_LIST whose TREE_VALUE is the new SCOPE_STMT,
1323 and whose TREE_PURPOSE is the matching SCOPE_STMT iwth
1324 SCOPE_BEGIN_P set. */
1327 add_scope_stmt (begin_p, partial_p)
1334 /* Build the statement. */
1335 ss = build_min_nt (SCOPE_STMT, NULL_TREE);
1336 SCOPE_BEGIN_P (ss) = begin_p;
1337 SCOPE_PARTIAL_P (ss) = partial_p;
1339 /* Keep the scope stack up to date. */
1342 current_scope_stmt_stack
1343 = tree_cons (ss, NULL_TREE, current_scope_stmt_stack);
1344 top = current_scope_stmt_stack;
1348 top = current_scope_stmt_stack;
1349 TREE_VALUE (top) = ss;
1350 current_scope_stmt_stack = TREE_CHAIN (top);
1353 /* Add the new statement to the statement-tree. */
1359 /* Begin a new scope. */
1364 if (!building_stmt_tree ())
1366 emit_line_note (input_filename, lineno);
1369 if (stmts_are_full_exprs_p)
1372 if (!building_stmt_tree ()
1373 && !cfun->x_whole_function_mode_p)
1374 my_friendly_abort (19991129);
1376 if (building_stmt_tree () && !processing_template_decl)
1377 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/0);
1381 /* Finish a scope. */
1386 tree block = NULL_TREE;
1388 if (stmts_are_full_exprs_p)
1392 if (building_stmt_tree () && !processing_template_decl)
1393 scope_stmts = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0);
1395 scope_stmts = NULL_TREE;
1397 block = poplevel (kept_level_p (), 1, 0);
1398 if (block && !processing_template_decl)
1400 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts)) = block;
1401 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts)) = block;
1408 /* Finish a parenthesized expression EXPR. */
1411 finish_parenthesized_expr (expr)
1414 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expr))))
1415 /* This inhibits warnings in truthvalue_conversion. */
1416 C_SET_EXP_ORIGINAL_CODE (expr, ERROR_MARK);
1421 /* Begin a statement-expression. The value returned must be passed to
1422 finish_stmt_expr. */
1427 /* If we're outside a function, we won't have a statement-tree to
1428 work with. But, if we see a statement-expression we need to
1430 if (! cfun && !last_tree)
1431 begin_stmt_tree (&scope_chain->x_saved_tree);
1433 keep_next_level (1);
1434 /* If we're building a statement tree, then the upcoming compound
1435 statement will be chained onto the tree structure, starting at
1436 last_tree. We return last_tree so that we can later unhook the
1437 compound statement. */
1438 return building_stmt_tree () ? last_tree : expand_start_stmt_expr();
1441 /* Finish a statement-expression. RTL_EXPR should be the value
1442 returned by the previous begin_stmt_expr; EXPR is the
1443 statement-expression. Returns an expression representing the
1444 statement-expression. */
1447 finish_stmt_expr (rtl_expr)
1452 if (!building_stmt_tree ())
1453 rtl_expr = expand_end_stmt_expr (rtl_expr);
1455 if (building_stmt_tree ())
1457 /* If the last thing in the statement-expression was not an
1458 expression-statement, then it has type `void'. */
1459 if (!last_expr_type)
1460 last_expr_type = void_type_node;
1461 result = build_min (STMT_EXPR, last_expr_type, last_tree);
1462 TREE_SIDE_EFFECTS (result) = 1;
1464 /* Remove the compound statement from the tree structure; it is
1465 now saved in the STMT_EXPR. */
1466 SET_LAST_STMT (rtl_expr);
1467 TREE_CHAIN (last_tree) = NULL_TREE;
1472 /* If we created a statement-tree for this statement-expression,
1475 && TREE_CHAIN (scope_chain->x_saved_tree) == NULL_TREE)
1476 finish_stmt_tree (&scope_chain->x_saved_tree);
1481 /* Finish a call to FN with ARGS. Returns a representation of the
1485 finish_call_expr (fn, args, koenig)
1494 if (TREE_CODE (fn) == BIT_NOT_EXPR)
1495 fn = build_x_unary_op (BIT_NOT_EXPR, TREE_OPERAND (fn, 0));
1496 else if (TREE_CODE (fn) != TEMPLATE_ID_EXPR)
1497 fn = do_identifier (fn, 2, args);
1499 result = build_x_function_call (fn, args, current_class_ref);
1501 if (TREE_CODE (result) == CALL_EXPR
1502 && (! TREE_TYPE (result)
1503 || TREE_CODE (TREE_TYPE (result)) != VOID_TYPE))
1504 result = require_complete_type (result);
1509 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1510 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1511 POSTDECREMENT_EXPR.) */
1514 finish_increment_expr (expr, code)
1516 enum tree_code code;
1518 /* If we get an OFFSET_REF, turn it into what it really means (e.g.,
1519 a COMPONENT_REF). This way if we've got, say, a reference to a
1520 static member that's being operated on, we don't end up trying to
1521 find a member operator for the class it's in. */
1523 if (TREE_CODE (expr) == OFFSET_REF)
1524 expr = resolve_offset_ref (expr);
1525 return build_x_unary_op (code, expr);
1528 /* Finish a use of `this'. Returns an expression for `this'. */
1535 if (current_class_ptr)
1537 #ifdef WARNING_ABOUT_CCD
1538 TREE_USED (current_class_ptr) = 1;
1540 result = current_class_ptr;
1542 else if (current_function_decl
1543 && DECL_STATIC_FUNCTION_P (current_function_decl))
1545 error ("`this' is unavailable for static member functions");
1546 result = error_mark_node;
1550 if (current_function_decl)
1551 error ("invalid use of `this' in non-member function");
1553 error ("invalid use of `this' at top level");
1554 result = error_mark_node;
1560 /* Finish a member function call using OBJECT and ARGS as arguments to
1561 FN. Returns an expression for the call. */
1564 finish_object_call_expr (fn, object, args)
1570 /* This is a future direction of this code, but because
1571 build_x_function_call cannot always undo what is done in
1572 build_component_ref entirely yet, we cannot do this. */
1574 tree real_fn = build_component_ref (object, fn, NULL_TREE, 1);
1575 return finish_call_expr (real_fn, args);
1577 if (DECL_DECLARES_TYPE_P (fn))
1579 if (processing_template_decl)
1580 /* This can happen on code like:
1583 template <class T> void f(T t) {
1587 We just grab the underlying IDENTIFIER. */
1588 fn = DECL_NAME (fn);
1591 cp_error ("calling type `%T' like a method", fn);
1592 return error_mark_node;
1596 return build_method_call (object, fn, args, NULL_TREE, LOOKUP_NORMAL);
1600 /* Finish a qualified member function call using OBJECT and ARGS as
1601 arguments to FN. Returns an expressino for the call. */
1604 finish_qualified_object_call_expr (fn, object, args)
1609 return build_scoped_method_call (object, TREE_OPERAND (fn, 0),
1610 TREE_OPERAND (fn, 1), args);
1613 /* Finish a pseudo-destructor call expression of OBJECT, with SCOPE
1614 being the scope, if any, of DESTRUCTOR. Returns an expression for
1618 finish_pseudo_destructor_call_expr (object, scope, destructor)
1623 if (processing_template_decl)
1624 return build_min_nt (PSEUDO_DTOR_EXPR, object, scope, destructor);
1626 if (scope && scope != destructor)
1627 cp_error ("destructor specifier `%T::~%T()' must have matching names",
1630 if ((scope == NULL_TREE || IDENTIFIER_GLOBAL_VALUE (destructor))
1631 && (TREE_CODE (TREE_TYPE (object)) !=
1632 TREE_CODE (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (destructor)))))
1633 cp_error ("`%E' is not of type `%T'", object, destructor);
1635 return cp_convert (void_type_node, object);
1638 /* Finish a call to a globally qualified member function FN using
1639 ARGS. Returns an expression for the call. */
1642 finish_qualified_call_expr (fn, args)
1646 if (processing_template_decl)
1647 return build_min_nt (CALL_EXPR, fn, args, NULL_TREE);
1649 return build_member_call (TREE_OPERAND (fn, 0),
1650 TREE_OPERAND (fn, 1),
1654 /* Finish an expression taking the address of LABEL. Returns an
1655 expression for the address. */
1658 finish_label_address_expr (label)
1663 label = lookup_label (label);
1664 if (label == NULL_TREE)
1665 result = null_pointer_node;
1668 TREE_USED (label) = 1;
1669 result = build1 (ADDR_EXPR, ptr_type_node, label);
1670 TREE_CONSTANT (result) = 1;
1671 /* This function cannot be inlined. All jumps to the addressed
1672 label should wind up at the same point. */
1673 DECL_UNINLINABLE (current_function_decl) = 1;
1679 /* Finish an expression of the form CODE EXPR. */
1682 finish_unary_op_expr (code, expr)
1683 enum tree_code code;
1686 tree result = build_x_unary_op (code, expr);
1687 /* Inside a template, build_x_unary_op does not fold the
1688 expression. So check whether the result is folded before
1689 setting TREE_NEGATED_INT. */
1690 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1691 && TREE_CODE (result) == INTEGER_CST
1692 && !TREE_UNSIGNED (TREE_TYPE (result))
1693 && INT_CST_LT (result, integer_zero_node))
1694 TREE_NEGATED_INT (result) = 1;
1695 overflow_warning (result);
1699 /* Finish an id-expression. */
1702 finish_id_expr (expr)
1705 if (TREE_CODE (expr) == IDENTIFIER_NODE)
1706 expr = do_identifier (expr, 1, NULL_TREE);
1711 static tree current_type_lookups;
1713 /* Perform deferred access control for types used in the type of a
1717 deferred_type_access_control ()
1719 tree lookup = type_lookups;
1721 if (lookup == error_mark_node)
1724 for (; lookup; lookup = TREE_CHAIN (lookup))
1725 enforce_access (TREE_PURPOSE (lookup), TREE_VALUE (lookup));
1729 decl_type_access_control (decl)
1734 if (type_lookups == error_mark_node)
1737 save_fn = current_function_decl;
1739 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
1740 current_function_decl = decl;
1742 deferred_type_access_control ();
1744 current_function_decl = save_fn;
1746 /* Now strip away the checks for the current declarator; they were
1747 added to type_lookups after typed_declspecs saved the copy that
1748 ended up in current_type_lookups. */
1749 type_lookups = current_type_lookups;
1753 save_type_access_control (lookups)
1756 current_type_lookups = lookups;
1759 /* Begin a function definition declared with DECL_SPECS and
1760 DECLARATOR. Returns non-zero if the function-declaration is
1764 begin_function_definition (decl_specs, declarator)
1771 split_specs_attrs (decl_specs, &specs, &attrs);
1772 if (!start_function (specs, declarator, attrs, SF_DEFAULT))
1775 deferred_type_access_control ();
1776 type_lookups = error_mark_node;
1778 reinit_parse_for_function ();
1779 /* The things we're about to see are not directly qualified by any
1780 template headers we've seen thus far. */
1781 reset_specialization ();
1786 /* Begin a constructor declarator of the form `SCOPE::NAME'. Returns
1790 begin_constructor_declarator (scope, name)
1794 tree result = build_parse_node (SCOPE_REF, scope, name);
1795 enter_scope_of (result);
1799 /* Finish an init-declarator. Returns a DECL. */
1802 finish_declarator (declarator, declspecs, attributes,
1803 prefix_attributes, initialized)
1807 tree prefix_attributes;
1810 return start_decl (declarator, declspecs, initialized, attributes,
1814 /* Finish a translation unit. */
1817 finish_translation_unit ()
1819 /* In case there were missing closebraces,
1820 get us back to the global binding level. */
1822 while (current_namespace != global_namespace)
1827 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
1828 Returns the parameter. */
1831 finish_template_type_parm (aggr, identifier)
1835 if (aggr != class_type_node)
1837 pedwarn ("template type parameters must use the keyword `class' or `typename'");
1838 aggr = class_type_node;
1841 return build_tree_list (aggr, identifier);
1844 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
1845 Returns the parameter. */
1848 finish_template_template_parm (aggr, identifier)
1852 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
1853 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
1854 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
1855 DECL_TEMPLATE_RESULT (tmpl) = decl;
1856 SET_DECL_ARTIFICIAL (decl);
1857 end_template_decl ();
1859 return finish_template_type_parm (aggr, tmpl);
1862 /* Finish a parameter list, indicated by PARMS. If ELLIPSIS is
1863 non-zero, the parameter list was terminated by a `...'. */
1866 finish_parmlist (parms, ellipsis)
1871 chainon (parms, void_list_node);
1872 /* We mark the PARMS as a parmlist so that declarator processing can
1873 disambiguate certain constructs. */
1874 if (parms != NULL_TREE)
1875 TREE_PARMLIST (parms) = 1;
1880 /* Begin a class definition, as indicated by T. */
1883 begin_class_definition (t)
1886 if (t == error_mark_node
1887 || ! IS_AGGR_TYPE (t))
1889 t = make_aggr_type (RECORD_TYPE);
1890 pushtag (make_anon_name (), t, 0);
1893 /* In a definition of a member class template, we will get here with an
1894 implicit typename, a TYPENAME_TYPE with a type. */
1895 if (TREE_CODE (t) == TYPENAME_TYPE)
1898 /* If we generated a partial instantiation of this type, but now
1899 we're seeing a real definition, we're actually looking at a
1900 partial specialization. Consider:
1902 template <class T, class U>
1908 template <class T, class U>
1911 typename X<Y<T, U> >::A a;
1914 template <class T, class U>
1919 We have to undo the effects of the previous partial
1921 if (PARTIAL_INSTANTIATION_P (t))
1925 /* Unfortunately, when we're not in pedantic mode, we
1926 attempt to actually fill in some of the fields of the
1927 partial instantiation, in order to support the implicit
1928 typename extension. Clear those fields now, in
1929 preparation for the definition here. The fields cleared
1930 here must match those set in instantiate_class_template.
1931 Look for a comment mentioning begin_class_definition
1933 TYPE_BINFO_BASETYPES (t) = NULL_TREE;
1934 TYPE_FIELDS (t) = NULL_TREE;
1935 TYPE_METHODS (t) = NULL_TREE;
1936 CLASSTYPE_TAGS (t) = NULL_TREE;
1937 TYPE_SIZE (t) = NULL_TREE;
1940 /* This isn't a partial instantiation any more. */
1941 PARTIAL_INSTANTIATION_P (t) = 0;
1943 /* If this type was already complete, and we see another definition,
1945 else if (COMPLETE_TYPE_P (t))
1946 duplicate_tag_error (t);
1948 /* Update the location of the decl. */
1949 DECL_SOURCE_FILE (TYPE_NAME (t)) = input_filename;
1950 DECL_SOURCE_LINE (TYPE_NAME (t)) = lineno;
1952 if (TYPE_BEING_DEFINED (t))
1954 t = make_aggr_type (TREE_CODE (t));
1955 pushtag (TYPE_IDENTIFIER (t), t, 0);
1957 maybe_process_partial_specialization (t);
1959 TYPE_BEING_DEFINED (t) = 1;
1960 TYPE_PACKED (t) = flag_pack_struct;
1961 /* Reset the interface data, at the earliest possible
1962 moment, as it might have been set via a class foo;
1965 tree name = TYPE_IDENTIFIER (t);
1967 if (! ANON_AGGRNAME_P (name))
1969 CLASSTYPE_INTERFACE_ONLY (t) = interface_only;
1970 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
1971 (t, interface_unknown);
1974 /* Only leave this bit clear if we know this
1975 class is part of an interface-only specification. */
1976 if (! CLASSTYPE_INTERFACE_KNOWN (t)
1977 || ! CLASSTYPE_INTERFACE_ONLY (t))
1978 CLASSTYPE_VTABLE_NEEDS_WRITING (t) = 1;
1980 reset_specialization();
1982 /* Make a declaration for this class in its own scope. */
1983 build_self_reference ();
1988 /* Finish the member declaration given by DECL. */
1991 finish_member_declaration (decl)
1994 if (decl == error_mark_node || decl == NULL_TREE)
1997 if (decl == void_type_node)
1998 /* The COMPONENT was a friend, not a member, and so there's
1999 nothing for us to do. */
2002 /* We should see only one DECL at a time. */
2003 my_friendly_assert (TREE_CHAIN (decl) == NULL_TREE, 0);
2005 /* Set up access control for DECL. */
2007 = (current_access_specifier == access_private_node);
2008 TREE_PROTECTED (decl)
2009 = (current_access_specifier == access_protected_node);
2010 if (TREE_CODE (decl) == TEMPLATE_DECL)
2012 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2013 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2016 /* Mark the DECL as a member of the current class. */
2017 DECL_CONTEXT (decl) = current_class_type;
2021 A C language linkage is ignored for the names of class members
2022 and the member function type of class member functions. */
2023 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2024 DECL_LANGUAGE (decl) = lang_cplusplus;
2026 /* Put functions on the TYPE_METHODS list and everything else on the
2027 TYPE_FIELDS list. Note that these are built up in reverse order.
2028 We reverse them (to obtain declaration order) in finish_struct. */
2029 if (TREE_CODE (decl) == FUNCTION_DECL
2030 || DECL_FUNCTION_TEMPLATE_P (decl))
2032 /* We also need to add this function to the
2033 CLASSTYPE_METHOD_VEC. */
2034 add_method (current_class_type, 0, decl);
2036 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2037 TYPE_METHODS (current_class_type) = decl;
2041 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2042 go at the beginning. The reason is that lookup_field_1
2043 searches the list in order, and we want a field name to
2044 override a type name so that the "struct stat hack" will
2045 work. In particular:
2047 struct S { enum E { }; int E } s;
2050 is legal. In addition, the FIELD_DECLs must be maintained in
2051 declaration order so that class layout works as expected.
2052 However, we don't need that order until class layout, so we
2053 save a little time by putting FIELD_DECLs on in reverse order
2054 here, and then reversing them in finish_struct_1. (We could
2055 also keep a pointer to the correct insertion points in the
2058 if (TREE_CODE (decl) == TYPE_DECL)
2059 TYPE_FIELDS (current_class_type)
2060 = chainon (TYPE_FIELDS (current_class_type), decl);
2063 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2064 TYPE_FIELDS (current_class_type) = decl;
2067 /* Enter the DECL into the scope of the class. */
2068 if (TREE_CODE (decl) != USING_DECL)
2069 pushdecl_class_level (decl);
2073 /* Finish a class definition T with the indicate ATTRIBUTES. If SEMI,
2074 the definition is immediately followed by a semicolon. Returns the
2078 finish_class_definition (t, attributes, semi, pop_scope_p)
2084 /* finish_struct nukes this anyway; if finish_exception does too,
2087 note_got_semicolon (t);
2089 /* If we got any attributes in class_head, xref_tag will stick them in
2090 TREE_TYPE of the type. Grab them now. */
2091 attributes = chainon (TREE_TYPE (t), attributes);
2092 TREE_TYPE (t) = NULL_TREE;
2094 if (TREE_CODE (t) == ENUMERAL_TYPE)
2098 t = finish_struct (t, attributes);
2100 note_got_semicolon (t);
2104 check_for_missing_semicolon (t);
2106 pop_scope (CP_DECL_CONTEXT (TYPE_MAIN_DECL (t)));
2107 if (current_scope () == current_function_decl)
2108 do_pending_defargs ();
2113 /* Finish processing the default argument expressions cached during
2114 the processing of a class definition. */
2117 begin_inline_definitions ()
2120 && current_scope () == current_function_decl)
2121 do_pending_inlines ();
2124 /* Finish processing the inline function definitions cached during the
2125 processing of a class definition. */
2128 finish_inline_definitions ()
2130 if (current_class_type == NULL_TREE)
2131 clear_inline_text_obstack ();
2134 /* Finish processing the declaration of a member class template
2135 TYPES whose template parameters are given by PARMS. */
2138 finish_member_class_template (types)
2143 /* If there are declared, but undefined, partial specializations
2144 mixed in with the typespecs they will not yet have passed through
2145 maybe_process_partial_specialization, so we do that here. */
2146 for (t = types; t != NULL_TREE; t = TREE_CHAIN (t))
2147 if (IS_AGGR_TYPE_CODE (TREE_CODE (TREE_VALUE (t))))
2148 maybe_process_partial_specialization (TREE_VALUE (t));
2150 note_list_got_semicolon (types);
2151 grok_x_components (types);
2152 if (TYPE_CONTEXT (TREE_VALUE (types)) != current_class_type)
2153 /* The component was in fact a friend declaration. We avoid
2154 finish_member_template_decl performing certain checks by
2158 finish_member_template_decl (types);
2160 /* As with other component type declarations, we do
2161 not store the new DECL on the list of
2166 /* Finish processsing a complete template declaration. The PARMS are
2167 the template parameters. */
2170 finish_template_decl (parms)
2174 end_template_decl ();
2176 end_specialization ();
2179 /* Finish processing a a template-id (which names a type) of the form
2180 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2181 template-id. If ENTERING_SCOPE is non-zero we are about to enter
2182 the scope of template-id indicated. */
2185 finish_template_type (name, args, entering_scope)
2192 decl = lookup_template_class (name, args,
2193 NULL_TREE, NULL_TREE, entering_scope);
2194 if (decl != error_mark_node)
2195 decl = TYPE_STUB_DECL (decl);
2200 /* SR is a SCOPE_REF node. Enter the scope of SR, whether it is a
2201 namespace scope or a class scope. */
2207 tree scope = TREE_OPERAND (sr, 0);
2209 if (TREE_CODE (scope) == NAMESPACE_DECL)
2211 push_decl_namespace (scope);
2212 TREE_COMPLEXITY (sr) = -1;
2214 else if (scope != current_class_type)
2216 if (TREE_CODE (scope) == TYPENAME_TYPE)
2218 /* In a declarator for a template class member, the scope will
2219 get here as an implicit typename, a TYPENAME_TYPE with a type. */
2220 scope = TREE_TYPE (scope);
2221 TREE_OPERAND (sr, 0) = scope;
2223 push_nested_class (scope, 3);
2224 TREE_COMPLEXITY (sr) = current_class_depth;
2228 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2229 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2230 BASE_CLASS, or NULL_TREE if an error occurred. The
2231 ACCESSS_SPECIFIER is one of
2232 access_{default,public,protected_private}[_virtual]_node.*/
2235 finish_base_specifier (access_specifier, base_class)
2236 tree access_specifier;
2242 if (base_class == NULL_TREE)
2244 error ("invalid base class");
2245 type = error_mark_node;
2248 type = TREE_TYPE (base_class);
2250 if (! is_aggr_type (type, 1))
2253 result = build_tree_list (access_specifier, type);
2258 /* Called when multiple declarators are processed. If that is not
2259 premitted in this context, an error is issued. */
2262 check_multiple_declarators ()
2266 In a template-declaration, explicit specialization, or explicit
2267 instantiation the init-declarator-list in the declaration shall
2268 contain at most one declarator.
2270 We don't just use PROCESSING_TEMPLATE_DECL for the first
2271 condition since that would disallow the perfectly legal code,
2272 like `template <class T> struct S { int i, j; };'. */
2273 tree scope = current_scope ();
2275 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
2276 /* It's OK to write `template <class T> void f() { int i, j;}'. */
2279 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
2280 || processing_explicit_instantiation
2281 || processing_specialization)
2282 cp_error ("multiple declarators in template declaration");
2286 finish_typeof (expr)
2289 if (processing_template_decl)
2293 t = make_aggr_type (TYPEOF_TYPE);
2294 TYPE_FIELDS (t) = expr;
2299 return TREE_TYPE (expr);
2302 /* Create an empty statement tree rooted at T. */
2308 /* We create a trivial EXPR_STMT so that last_tree is never NULL in
2309 what follows. We remove the extraneous statement in
2310 finish_stmt_tree. */
2311 *t = build_nt (EXPR_STMT, void_zero_node);
2313 last_expr_type = NULL_TREE;
2316 /* Finish the statement tree rooted at T. */
2319 finish_stmt_tree (t)
2324 /* Remove the fake extra statement added in begin_stmt_tree. */
2325 stmt = TREE_CHAIN (*t);
2327 SET_LAST_STMT (NULL_TREE);
2331 /* The line-number recorded in the outermost statement in a function
2332 is the line number of the end of the function. */
2333 STMT_LINENO (stmt) = lineno;
2334 STMT_LINENO_FOR_FN_P (stmt) = 1;
2338 /* We're about to expand T, a statement. Set up appropriate context
2339 for the substitution. */
2345 if (!STMT_LINENO_FOR_FN_P (t))
2346 lineno = STMT_LINENO (t);
2347 stmts_are_full_exprs_p = STMT_IS_FULL_EXPR_P (t);
2350 /* Some statements, like for-statements or if-statements, require a
2351 condition. This condition can be a declaration. If T is such a
2352 declaration it is processed, and an expression appropriate to use
2353 as the condition is returned. Otherwise, T itself is returned. */
2359 if (t && TREE_CODE (t) == TREE_LIST)
2361 expand_stmt (TREE_PURPOSE (t));
2362 return TREE_VALUE (t);
2368 /* Generate RTL for the statement T, and its substatements, and any
2369 other statements at its nesting level. */
2375 tree rval = NULL_TREE;
2377 while (t && t != error_mark_node)
2379 int saved_stmts_are_full_exprs_p;
2381 /* Assume we'll have nothing to return. */
2384 /* Set up context appropriately for handling this statement. */
2385 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p;
2388 switch (TREE_CODE (t))
2391 finish_return_stmt (RETURN_EXPR (t));
2395 finish_expr_stmt (EXPR_STMT_EXPR (t));
2402 emit_line_note (input_filename, lineno);
2403 decl = DECL_STMT_DECL (t);
2404 /* If this is a declaration for an automatic local
2405 variable, initialize it. Note that we might also see a
2406 declaration for a namespace-scope object (declared with
2407 `extern'). We don't have to handle the initialization
2408 of those objects here; they can only be declarations,
2409 rather than definitions. */
2410 if (TREE_CODE (decl) == VAR_DECL
2411 && !TREE_STATIC (decl)
2412 && !DECL_EXTERNAL (decl))
2414 /* Let the back-end know about this variable. */
2415 if (!ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
2416 emit_local_var (decl);
2418 expand_anon_union_decl (decl, NULL_TREE,
2419 DECL_ANON_UNION_ELEMS (decl));
2421 else if (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl))
2423 if (DECL_ARTIFICIAL (decl) && ! TREE_USED (decl))
2424 /* Do not emit unused decls. This is not just an
2425 optimization. We really do not want to emit
2426 __PRETTY_FUNCTION__ etc, if they're never used. */
2427 DECL_IGNORED_P (decl) = 1;
2429 make_rtl_for_local_static (decl);
2435 finish_decl_cleanup (CLEANUP_DECL (t), CLEANUP_EXPR (t));
2438 case START_CATCH_STMT:
2439 begin_catch_block (TREE_TYPE (t));
2443 if (CTOR_BEGIN_P (t))
2444 begin_protect_partials ();
2446 /* After this point, any exceptions will cause the
2447 destructor to be executed, so we no longer need to worry
2448 about destroying the various subobjects ourselves. */
2449 end_protect_partials ();
2457 expand_stmt (FOR_INIT_STMT (t));
2458 finish_for_init_stmt (NULL_TREE);
2459 finish_for_cond (expand_cond (FOR_COND (t)), NULL_TREE);
2461 finish_for_expr (tmp, NULL_TREE);
2462 expand_stmt (FOR_BODY (t));
2463 finish_for_stmt (tmp, NULL_TREE);
2469 begin_while_stmt ();
2470 finish_while_stmt_cond (expand_cond (WHILE_COND (t)), NULL_TREE);
2471 expand_stmt (WHILE_BODY (t));
2472 finish_while_stmt (NULL_TREE);
2479 expand_stmt (DO_BODY (t));
2480 finish_do_body (NULL_TREE);
2481 finish_do_stmt (DO_COND (t), NULL_TREE);
2487 finish_if_stmt_cond (expand_cond (IF_COND (t)), NULL_TREE);
2488 if (THEN_CLAUSE (t))
2490 expand_stmt (THEN_CLAUSE (t));
2491 finish_then_clause (NULL_TREE);
2493 if (ELSE_CLAUSE (t))
2495 begin_else_clause ();
2496 expand_stmt (ELSE_CLAUSE (t));
2497 finish_else_clause (NULL_TREE);
2503 begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t));
2504 expand_stmt (COMPOUND_BODY (t));
2505 rval = finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t),
2510 finish_break_stmt ();
2514 finish_continue_stmt ();
2521 begin_switch_stmt ();
2522 cond = expand_cond (SWITCH_COND (t));
2523 finish_switch_cond (cond, NULL_TREE);
2524 expand_stmt (SWITCH_BODY (t));
2525 finish_switch_stmt (cond, NULL_TREE);
2530 finish_case_label (CASE_LOW (t), CASE_HIGH (t));
2534 expand_label (LABEL_STMT_LABEL (t));
2538 finish_goto_stmt (GOTO_DESTINATION (t));
2542 finish_asm_stmt (ASM_CV_QUAL (t), ASM_STRING (t), ASM_OUTPUTS
2543 (t), ASM_INPUTS (t), ASM_CLOBBERS (t));
2549 expand_eh_region_start ();
2550 expand_stmt (TRY_STMTS (t));
2551 finish_cleanup_try_block (NULL_TREE);
2552 finish_cleanup (TRY_HANDLERS (t), NULL_TREE);
2556 if (FN_TRY_BLOCK_P (t))
2557 begin_function_try_block ();
2561 expand_stmt (TRY_STMTS (t));
2563 if (FN_TRY_BLOCK_P (t))
2565 finish_function_try_block (NULL_TREE);
2566 expand_stmt (TRY_HANDLERS (t));
2567 finish_function_handler_sequence (NULL_TREE);
2571 finish_try_block (NULL_TREE);
2572 expand_stmt (TRY_HANDLERS (t));
2573 finish_handler_sequence (NULL_TREE);
2580 expand_stmt (HANDLER_BODY (t));
2581 finish_handler (NULL_TREE, NULL_TREE);
2585 finish_subobject (SUBOBJECT_CLEANUP (t));
2589 if (!SCOPE_NO_CLEANUPS_P (t))
2591 if (SCOPE_BEGIN_P (t))
2592 expand_start_bindings_and_block (2 * SCOPE_NULLIFIED_P (t),
2593 SCOPE_STMT_BLOCK (t));
2594 else if (SCOPE_END_P (t))
2595 expand_end_bindings (NULL_TREE, !SCOPE_NULLIFIED_P (t), 0);
2597 else if (!SCOPE_NULLIFIED_P (t))
2599 rtx note = emit_note (NULL,
2601 ? NOTE_INSN_BLOCK_BEG
2602 : NOTE_INSN_BLOCK_END));
2603 NOTE_BLOCK (note) = SCOPE_STMT_BLOCK (t);
2609 /* Clear this out so that finish_named_return_value can set it
2611 DECL_NAME (DECL_RESULT (current_function_decl)) = NULL_TREE;
2612 finish_named_return_value (TREE_OPERAND (t, 0),
2613 TREE_OPERAND (t, 1));
2617 my_friendly_abort (19990810);
2621 /* Restore saved state. */
2622 stmts_are_full_exprs_p = saved_stmts_are_full_exprs_p;
2624 /* Go on to the next statement in this scope. */
2631 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2632 will equivalent CALL_EXPRs. */
2635 simplify_aggr_init_exprs_r (tp, walk_subtrees, data)
2637 int *walk_subtrees ATTRIBUTE_UNUSED;
2638 void *data ATTRIBUTE_UNUSED;
2640 tree aggr_init_expr;
2647 int copy_from_buffer_p;
2649 aggr_init_expr = *tp;
2650 /* We don't need to walk into types; there's nothing in a type that
2651 needs simplification. (And, furthermore, there are places we
2652 actively don't want to go. For example, we don't want to wander
2653 into the default arguments for a FUNCTION_DECL that appears in a
2655 if (TYPE_P (aggr_init_expr))
2660 /* Only AGGR_INIT_EXPRs are interesting. */
2661 else if (TREE_CODE (aggr_init_expr) != AGGR_INIT_EXPR)
2664 /* Form an appropriate CALL_EXPR. */
2665 fn = TREE_OPERAND (aggr_init_expr, 0);
2666 args = TREE_OPERAND (aggr_init_expr, 1);
2667 slot = TREE_OPERAND (aggr_init_expr, 2);
2668 type = TREE_TYPE (aggr_init_expr);
2670 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2672 /* Replace the first argument with the address of the third
2673 argument to the AGGR_INIT_EXPR. */
2674 call_type = build_pointer_type (type);
2675 mark_addressable (slot);
2676 args = tree_cons (NULL_TREE, build1 (ADDR_EXPR, call_type, slot),
2679 call_expr = build (CALL_EXPR, call_type, fn, args, NULL_TREE);
2680 TREE_SIDE_EFFECTS (call_expr) = 1;
2682 /* If we're using the non-reentrant PCC calling convention, then we
2683 need to copy the returned value out of the static buffer into the
2685 copy_from_buffer_p = 0;
2686 #ifdef PCC_STATIC_STRUCT_RETURN
2687 if (!AGGR_INIT_VIA_CTOR_P (aggr_init_expr) && aggregate_value_p (type))
2691 flag_access_control = 0;
2692 call_expr = build_aggr_init (slot, call_expr, LOOKUP_ONLYCONVERTING);
2693 flag_access_control = old_ac;
2694 copy_from_buffer_p = 1;
2698 /* If this AGGR_INIT_EXPR indicates the value returned by a
2699 function, then we want to use the value of the initialized
2700 location as the result. */
2701 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr) || copy_from_buffer_p)
2703 call_expr = build (COMPOUND_EXPR, type,
2705 TREE_SIDE_EFFECTS (call_expr) = 1;
2708 /* Replace the AGGR_INIT_EXPR with the CALL_EXPR. */
2709 TREE_CHAIN (call_expr) = TREE_CHAIN (aggr_init_expr);
2712 /* Keep iterating. */
2716 /* Generate RTL for FN. */
2723 const char *saved_input_filename;
2725 /* When the parser calls us after finishing the body of a template
2726 function, we don't really want to expand the body. When we're
2727 processing an in-class definition of an inline function,
2728 PROCESSING_TEMPLATE_DECL will no longer be set here, so we have
2729 to look at the function itself. */
2730 if (processing_template_decl
2731 || (DECL_LANG_SPECIFIC (fn)
2732 && DECL_TEMPLATE_INFO (fn)
2733 && uses_template_parms (DECL_TI_ARGS (fn))))
2735 /* Normally, collection only occurs in rest_of_compilation. So,
2736 if we don't collect here, we never collect junk generated
2737 during the processing of templates until we hit a
2738 non-template function. */
2743 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
2744 walk_tree (&DECL_SAVED_TREE (fn), simplify_aggr_init_exprs_r, NULL);
2746 /* If this is a constructor or destructor body, we have to clone it
2747 under the new ABI. */
2748 if (maybe_clone_body (fn))
2750 /* We don't want to process FN again, so pretend we've written
2751 it out, even though we haven't. */
2752 TREE_ASM_WRITTEN (fn) = 1;
2756 /* There's no reason to do any of the work here if we're only doing
2757 semantic analysis; this code just generates RTL. */
2758 if (flag_syntax_only)
2761 /* If possible, avoid generating RTL for this function. Instead,
2762 just record it as an inline function, and wait until end-of-file
2763 to decide whether to write it out or not. */
2764 if (/* We have to generate RTL if it's not an inline function. */
2765 (DECL_INLINE (fn) || DECL_COMDAT (fn))
2766 /* Or if we have to keep all inline functions anyhow. */
2767 && !flag_keep_inline_functions
2768 /* Or if we actually have a reference to the function. */
2769 && !DECL_NEEDED_P (fn)
2770 /* Or if this is a nested function. */
2771 && !decl_function_context (fn))
2773 /* Give the function RTL now so that we can assign it to a
2774 function pointer, etc. */
2775 make_function_rtl (fn);
2776 /* Set DECL_EXTERNAL so that assemble_external will be called as
2777 necessary. We'll clear it again in finish_file. */
2778 if (!DECL_EXTERNAL (fn))
2780 DECL_NOT_REALLY_EXTERN (fn) = 1;
2781 DECL_EXTERNAL (fn) = 1;
2783 /* Remember this function. In finish_file we'll decide if
2784 we actually need to write this function out. */
2786 /* Let the back-end know that this funtion exists. */
2787 note_deferral_of_defined_inline_function (fn);
2791 /* Optimize the body of the function before expanding it. */
2792 optimize_function (fn);
2794 /* Save the current file name and line number. When we expand the
2795 body of the function, we'll set LINENO and INPUT_FILENAME so that
2796 error-mesages come out in the right places. */
2797 saved_lineno = lineno;
2798 saved_input_filename = input_filename;
2799 lineno = DECL_SOURCE_LINE (fn);
2800 input_filename = DECL_SOURCE_FILE (fn);
2802 start_function (NULL_TREE, fn, NULL_TREE, SF_PRE_PARSED | SF_EXPAND);
2803 store_parm_decls ();
2804 current_function_is_thunk = DECL_THUNK_P (fn);
2806 /* We don't need to redeclare __FUNCTION__, __PRETTY_FUNCTION__, or
2807 any of the other magic variables we set up when starting a
2809 current_function_name_declared = 1;
2811 /* Expand the body. */
2812 expand_stmt (DECL_SAVED_TREE (fn));
2814 /* Statements should always be full-expressions at the outermost set
2815 of curly braces for a function. */
2816 my_friendly_assert (stmts_are_full_exprs_p, 19990831);
2818 /* The outermost statement for a function contains the line number
2819 recorded when we finished processing the function. */
2820 lineno = STMT_LINENO (DECL_SAVED_TREE (fn));
2822 /* Generate code for the function. */
2823 finish_function (0);
2825 /* If possible, obliterate the body of the function so that it can
2826 be garbage collected. */
2827 if (flag_dump_translation_unit)
2828 /* Keep the body; we're going to dump it. */
2830 else if (DECL_INLINE (fn) && flag_inline_trees)
2831 /* We might need the body of this function so that we can expand
2832 it inline somewhere else. */
2835 /* We don't need the body; blow it away. */
2836 DECL_SAVED_TREE (fn) = NULL_TREE;
2838 /* And restore the current source position. */
2839 lineno = saved_lineno;
2840 input_filename = saved_input_filename;