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 add_tree (build_min_nt (GOTO_STMT, destination));
710 emit_line_note (input_filename, lineno);
712 if (TREE_CODE (destination) == LABEL_DECL)
714 label_rtx (destination);
715 expand_goto (destination);
718 expand_computed_goto (destination);
722 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
728 if (building_stmt_tree ())
730 tree r = build_min_nt (TRY_BLOCK, NULL_TREE,
737 emit_line_note (input_filename, lineno);
738 expand_start_try_stmts ();
743 /* Likewise, for a function-try-block. */
746 begin_function_try_block ()
748 if (building_stmt_tree ())
750 tree r = build_min_nt (TRY_BLOCK, NULL_TREE,
752 FN_TRY_BLOCK_P (r) = 1;
758 if (! current_function_parms_stored)
760 expand_start_early_try_stmts ();
765 /* Finish a try-block, which may be given by TRY_BLOCK. */
768 finish_try_block (try_block)
771 if (building_stmt_tree ())
772 RECHAIN_STMTS (try_block, TRY_STMTS (try_block));
774 expand_start_all_catch ();
777 /* Finish the body of a cleanup try-block, which may be given by
781 finish_cleanup_try_block (try_block)
784 if (building_stmt_tree ())
785 RECHAIN_STMTS (try_block, TRY_STMTS (try_block));
788 /* Finish an implicitly generated try-block, with a cleanup is given
792 finish_cleanup (cleanup, try_block)
796 if (building_stmt_tree ())
798 TRY_HANDLERS (try_block) = cleanup;
799 CLEANUP_P (try_block) = 1;
802 expand_eh_region_end (protect_with_terminate (cleanup));
805 /* Likewise, for a function-try-block. */
808 finish_function_try_block (try_block)
811 if (building_stmt_tree ())
813 if (TREE_CHAIN (try_block)
814 && TREE_CODE (TREE_CHAIN (try_block)) == CTOR_INITIALIZER)
816 /* Chain the compound statement after the CTOR_INITIALIZER. */
817 TREE_CHAIN (TREE_CHAIN (try_block)) = last_tree;
818 /* And make the CTOR_INITIALIZER the body of the try-block. */
819 RECHAIN_STMTS (try_block, TRY_STMTS (try_block));
822 RECHAIN_STMTS (try_block, TRY_STMTS (try_block));
826 end_protect_partials ();
827 expand_start_all_catch ();
830 in_function_try_handler = 1;
833 /* Finish a handler-sequence for a try-block, which may be given by
837 finish_handler_sequence (try_block)
840 if (building_stmt_tree ())
842 RECHAIN_STMTS (try_block, TRY_HANDLERS (try_block));
843 check_handlers (TRY_HANDLERS (try_block));
846 expand_end_all_catch ();
849 /* Likewise, for a function-try-block. */
852 finish_function_handler_sequence (try_block)
855 in_function_try_handler = 0;
857 if (building_stmt_tree ())
859 RECHAIN_STMTS (try_block, TRY_HANDLERS (try_block));
860 check_handlers (TRY_HANDLERS (try_block));
863 expand_end_all_catch ();
866 /* Begin a handler. Returns a HANDLER if appropriate. */
873 if (building_stmt_tree ())
875 r = build_min_nt (HANDLER, NULL_TREE, NULL_TREE);
886 /* Finish the handler-parameters for a handler, which may be given by
887 HANDLER. DECL is the declaration for the catch parameter, or NULL
888 if this is a `catch (...)' clause. */
891 finish_handler_parms (decl, handler)
895 tree blocks = NULL_TREE;
897 if (processing_template_decl)
901 decl = pushdecl (decl);
902 decl = push_template_decl (decl);
903 add_decl_stmt (decl);
904 RECHAIN_STMTS (handler, HANDLER_PARMS (handler));
907 else if (building_stmt_tree ())
908 blocks = expand_start_catch_block (decl);
911 TREE_TYPE (handler) = TREE_TYPE (decl);
916 /* Note the beginning of a handler for TYPE. This function is called
917 at the point to which control should be transferred when an
918 appropriately-typed exception is thrown. */
921 begin_catch_block (type)
924 if (building_stmt_tree ())
925 add_tree (build (START_CATCH_STMT, type));
927 start_catch_handler (type);
930 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
931 the return value from the matching call to finish_handler_parms. */
934 finish_handler (blocks, handler)
938 if (!processing_template_decl)
940 if (building_stmt_tree ())
941 expand_end_catch_block (blocks);
943 if (!building_stmt_tree ())
945 /* Fall to outside the try statement when done executing
946 handler and we fall off end of handler. This is jump
947 Lresume in the documentation. */
948 expand_goto (top_label_entry (&caught_return_label_stack));
949 end_catch_handler ();
955 if (building_stmt_tree ())
956 RECHAIN_STMTS (handler, HANDLER_BODY (handler));
959 /* Begin a compound-statement. If HAS_NO_SCOPE is non-zero, the
960 compound-statement does not define a scope. Returns a new
961 COMPOUND_STMT if appropriate. */
964 begin_compound_stmt (has_no_scope)
969 if (building_stmt_tree ())
971 r = build_min_nt (COMPOUND_STMT, NULL_TREE);
974 COMPOUND_STMT_NO_SCOPE (r) = 1;
979 last_expr_type = NULL_TREE;
984 /* Normally, we try hard to keep the BLOCK for a
985 statement-expression. But, if it's a statement-expression with
986 a scopeless block, there's nothing to keep, and we don't want
987 to accidentally keep a block *inside* the scopeless block. */
990 /* If this is the outermost block of the function, declare the
991 variables __FUNCTION__, __PRETTY_FUNCTION__, and so forth. */
993 && !current_function_name_declared
996 current_function_name_declared = 1;
997 declare_function_name ();
1004 /* Finish a compound-statement, which may be given by COMPOUND_STMT.
1005 If HAS_NO_SCOPE is non-zero, the compound statement does not define
1009 finish_compound_stmt (has_no_scope, compound_stmt)
1021 if (building_stmt_tree ())
1022 RECHAIN_STMTS (compound_stmt, COMPOUND_BODY (compound_stmt));
1024 /* When we call finish_stmt we will lose LAST_EXPR_TYPE. But, since
1025 the precise purpose of that variable is store the type of the
1026 last expression statement within the last compound statement, we
1027 preserve the value. */
1035 /* Finish an asm-statement, whose components are a CV_QUALIFIER, a
1036 STRING, some OUTPUT_OPERANDS, some INPUT_OPERANDS, and some
1040 finish_asm_stmt (cv_qualifier, string, output_operands,
1041 input_operands, clobbers)
1044 tree output_operands;
1045 tree input_operands;
1048 if (TREE_CHAIN (string))
1049 string = combine_strings (string);
1051 if (cv_qualifier != NULL_TREE
1052 && cv_qualifier != ridpointers[(int) RID_VOLATILE])
1054 cp_warning ("%s qualifier ignored on asm",
1055 IDENTIFIER_POINTER (cv_qualifier));
1056 cv_qualifier = NULL_TREE;
1059 if (building_stmt_tree ())
1061 tree r = build_min_nt (ASM_STMT, cv_qualifier, string,
1062 output_operands, input_operands,
1068 emit_line_note (input_filename, lineno);
1069 if (output_operands != NULL_TREE || input_operands != NULL_TREE
1070 || clobbers != NULL_TREE)
1074 for (t = input_operands; t; t = TREE_CHAIN (t))
1075 TREE_VALUE (t) = decay_conversion (TREE_VALUE (t));
1077 c_expand_asm_operands (string, output_operands,
1080 cv_qualifier != NULL_TREE,
1081 input_filename, lineno);
1084 expand_asm (string);
1090 /* Finish a label with the indicated NAME. */
1093 finish_label_stmt (name)
1096 tree decl = define_label (input_filename, lineno, name);
1098 if (building_stmt_tree ())
1099 add_tree (build_min_nt (LABEL_STMT, decl));
1101 expand_label (decl);
1104 /* Finish a series of declarations for local labels. G++ allows users
1105 to declare "local" labels, i.e., labels with scope. This extension
1106 is useful when writing code involving statement-expressions. */
1109 finish_label_decl (name)
1112 tree decl = declare_local_label (name);
1113 if (building_stmt_tree ())
1114 add_decl_stmt (decl);
1117 /* Create a declaration statement for the declaration given by the
1121 add_decl_stmt (decl)
1126 /* We need the type to last until instantiation time. */
1127 decl_stmt = build_min_nt (DECL_STMT, decl);
1128 add_tree (decl_stmt);
1131 /* We're in a constructor, and have just constructed a a subobject of
1132 *THIS. CLEANUP is code to run if an exception is thrown before the
1133 end of the current function is reached. */
1136 finish_subobject (cleanup)
1139 if (building_stmt_tree ())
1141 tree r = build_min_nt (SUBOBJECT, cleanup);
1145 add_partial_entry (cleanup);
1148 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1151 finish_decl_cleanup (decl, cleanup)
1155 if (building_stmt_tree ())
1156 add_tree (build_min_nt (CLEANUP_STMT, decl, cleanup));
1158 || (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node))
1159 expand_decl_cleanup (decl, cleanup);
1162 /* Bind a name and initialization to the return value of
1163 the current function. */
1166 finish_named_return_value (return_id, init)
1167 tree return_id, init;
1169 tree decl = DECL_RESULT (current_function_decl);
1172 /* Give this error as many times as there are occurrences,
1173 so that users can use Emacs compilation buffers to find
1174 and fix all such places. */
1175 pedwarn ("ISO C++ does not permit named return values");
1177 if (return_id != NULL_TREE)
1179 if (DECL_NAME (decl) == NULL_TREE)
1181 DECL_NAME (decl) = return_id;
1182 DECL_ASSEMBLER_NAME (decl) = return_id;
1186 cp_error ("return identifier `%D' already in place", return_id);
1191 /* Can't let this happen for constructors. */
1192 if (DECL_CONSTRUCTOR_P (current_function_decl))
1194 error ("can't redefine default return value for constructors");
1198 /* If we have a named return value, put that in our scope as well. */
1199 if (DECL_NAME (decl) != NULL_TREE)
1201 /* Let `cp_finish_decl' know that this initializer is ok. */
1202 DECL_INITIAL (decl) = init;
1203 if (doing_semantic_analysis_p ())
1206 if (building_stmt_tree ())
1207 add_tree (build_min_nt (RETURN_INIT, return_id, init));
1210 cp_finish_decl (decl, init, NULL_TREE, 0);
1211 store_return_init (decl);
1215 /* Don't use tree-inlining for functions with named return values.
1216 That doesn't work properly because we don't do any translation of
1217 the RETURN_INITs when they are copied. */
1218 DECL_UNINLINABLE (current_function_decl) = 1;
1221 /* Cache the value of this class's main virtual function table pointer
1222 in a register variable. This will save one indirection if a
1223 more than one virtual function call is made this function. */
1228 my_friendly_assert (doing_semantic_analysis_p (), 19990919);
1230 /* If we've already done this, there's no need to do it again. */
1234 if (DECL_CONSTRUCTOR_P (current_function_decl))
1236 if (processing_template_decl)
1237 add_tree (build_min_nt
1239 current_member_init_list, current_base_init_list));
1244 /* Mark the beginning of the constructor. */
1245 ctor_stmt = build_min_nt (CTOR_STMT);
1246 CTOR_BEGIN_P (ctor_stmt) = 1;
1247 add_tree (ctor_stmt);
1249 /* And actually initialize the base-classes and members. */
1253 else if (DECL_DESTRUCTOR_P (current_function_decl)
1254 && !processing_template_decl)
1260 /* If the dtor is empty, and we know there is not any possible
1261 way we could use any vtable entries, before they are possibly
1262 set by a base class dtor, we don't have to setup the vtables,
1263 as we know that any base class dtor will set up any vtables
1264 it needs. We avoid MI, because one base class dtor can do a
1265 virtual dispatch to an overridden function that would need to
1266 have a non-related vtable set up, we cannot avoid setting up
1267 vtables in that case. We could change this to see if there
1268 is just one vtable. */
1269 if_stmt = begin_if_stmt ();
1271 /* If it is not safe to avoid setting up the vtables, then
1272 someone will change the condition to be boolean_true_node.
1273 (Actually, for now, we do not have code to set the condition
1274 appropriately, so we just assume that we always need to
1275 initialize the vtables.) */
1276 finish_if_stmt_cond (boolean_true_node, if_stmt);
1277 current_vcalls_possible_p = &IF_COND (if_stmt);
1279 /* Don't declare __PRETTY_FUNCTION__ and friends here when we
1280 open the block for the if-body. */
1281 saved_cfnd = current_function_name_declared;
1282 current_function_name_declared = 1;
1283 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
1284 current_function_name_declared = saved_cfnd;
1286 /* Make all virtual function table pointers in non-virtual base
1287 classes point to CURRENT_CLASS_TYPE's virtual function
1289 initialize_vtbl_ptrs (current_class_ptr);
1291 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
1292 finish_then_clause (if_stmt);
1296 /* Always keep the BLOCK node associated with the outermost pair of
1297 curly braces of a function. These are needed for correct
1298 operation of dwarfout.c. */
1299 keep_next_level (1);
1301 /* The virtual function tables are set up now. */
1305 /* Add a scope-statement to the statement-tree. BEGIN_P indicates
1306 whether this statements opens or closes a scope. PARTIAL_P is true
1307 for a partial scope, i.e, the scope that begins after a label when
1308 an object that needs a cleanup is created. If BEGIN_P is nonzero,
1309 returns a new TREE_LIST representing the top of the SCOPE_STMT
1310 stack. The TREE_PURPOSE is the new SCOPE_STMT. If BEGIN_P is
1311 zero, returns a TREE_LIST whose TREE_VALUE is the new SCOPE_STMT,
1312 and whose TREE_PURPOSE is the matching SCOPE_STMT iwth
1313 SCOPE_BEGIN_P set. */
1316 add_scope_stmt (begin_p, partial_p)
1323 /* Build the statement. */
1324 ss = build_min_nt (SCOPE_STMT, NULL_TREE);
1325 SCOPE_BEGIN_P (ss) = begin_p;
1326 SCOPE_PARTIAL_P (ss) = partial_p;
1328 /* Keep the scope stack up to date. */
1331 current_scope_stmt_stack
1332 = tree_cons (ss, NULL_TREE, current_scope_stmt_stack);
1333 top = current_scope_stmt_stack;
1337 top = current_scope_stmt_stack;
1338 TREE_VALUE (top) = ss;
1339 current_scope_stmt_stack = TREE_CHAIN (top);
1342 /* Add the new statement to the statement-tree. */
1348 /* Begin a new scope. */
1353 if (!building_stmt_tree ())
1355 emit_line_note (input_filename, lineno);
1358 if (stmts_are_full_exprs_p)
1361 if (!building_stmt_tree ()
1362 && !cfun->x_whole_function_mode_p)
1363 my_friendly_abort (19991129);
1365 if (building_stmt_tree () && !processing_template_decl)
1366 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/0);
1370 /* Finish a scope. */
1375 tree block = NULL_TREE;
1377 if (stmts_are_full_exprs_p)
1381 if (building_stmt_tree () && !processing_template_decl)
1382 scope_stmts = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0);
1384 scope_stmts = NULL_TREE;
1386 block = poplevel (kept_level_p (), 1, 0);
1387 if (block && !processing_template_decl)
1389 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts)) = block;
1390 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts)) = block;
1397 /* Finish a parenthesized expression EXPR. */
1400 finish_parenthesized_expr (expr)
1403 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expr))))
1404 /* This inhibits warnings in truthvalue_conversion. */
1405 C_SET_EXP_ORIGINAL_CODE (expr, ERROR_MARK);
1410 /* Begin a statement-expression. The value returned must be passed to
1411 finish_stmt_expr. */
1416 /* If we're outside a function, we won't have a statement-tree to
1417 work with. But, if we see a statement-expression we need to
1419 if (! cfun && !last_tree)
1420 begin_stmt_tree (&scope_chain->x_saved_tree);
1422 keep_next_level (1);
1423 /* If we're building a statement tree, then the upcoming compound
1424 statement will be chained onto the tree structure, starting at
1425 last_tree. We return last_tree so that we can later unhook the
1426 compound statement. */
1427 return building_stmt_tree () ? last_tree : expand_start_stmt_expr();
1430 /* Finish a statement-expression. RTL_EXPR should be the value
1431 returned by the previous begin_stmt_expr; EXPR is the
1432 statement-expression. Returns an expression representing the
1433 statement-expression. */
1436 finish_stmt_expr (rtl_expr)
1441 if (!building_stmt_tree ())
1442 rtl_expr = expand_end_stmt_expr (rtl_expr);
1444 if (building_stmt_tree ())
1446 /* If the last thing in the statement-expression was not an
1447 expression-statement, then it has type `void'. */
1448 if (!last_expr_type)
1449 last_expr_type = void_type_node;
1450 result = build_min (STMT_EXPR, last_expr_type, last_tree);
1451 TREE_SIDE_EFFECTS (result) = 1;
1453 /* Remove the compound statement from the tree structure; it is
1454 now saved in the STMT_EXPR. */
1455 SET_LAST_STMT (rtl_expr);
1456 TREE_CHAIN (last_tree) = NULL_TREE;
1461 /* If we created a statement-tree for this statement-expression,
1464 && TREE_CHAIN (scope_chain->x_saved_tree) == NULL_TREE)
1465 finish_stmt_tree (&scope_chain->x_saved_tree);
1470 /* Finish a call to FN with ARGS. Returns a representation of the
1474 finish_call_expr (fn, args, koenig)
1483 if (TREE_CODE (fn) == BIT_NOT_EXPR)
1484 fn = build_x_unary_op (BIT_NOT_EXPR, TREE_OPERAND (fn, 0));
1485 else if (TREE_CODE (fn) != TEMPLATE_ID_EXPR)
1486 fn = do_identifier (fn, 2, args);
1488 result = build_x_function_call (fn, args, current_class_ref);
1490 if (TREE_CODE (result) == CALL_EXPR
1491 && (! TREE_TYPE (result)
1492 || TREE_CODE (TREE_TYPE (result)) != VOID_TYPE))
1493 result = require_complete_type (result);
1498 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1499 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1500 POSTDECREMENT_EXPR.) */
1503 finish_increment_expr (expr, code)
1505 enum tree_code code;
1507 /* If we get an OFFSET_REF, turn it into what it really means (e.g.,
1508 a COMPONENT_REF). This way if we've got, say, a reference to a
1509 static member that's being operated on, we don't end up trying to
1510 find a member operator for the class it's in. */
1512 if (TREE_CODE (expr) == OFFSET_REF)
1513 expr = resolve_offset_ref (expr);
1514 return build_x_unary_op (code, expr);
1517 /* Finish a use of `this'. Returns an expression for `this'. */
1524 if (current_class_ptr)
1526 #ifdef WARNING_ABOUT_CCD
1527 TREE_USED (current_class_ptr) = 1;
1529 result = current_class_ptr;
1531 else if (current_function_decl
1532 && DECL_STATIC_FUNCTION_P (current_function_decl))
1534 error ("`this' is unavailable for static member functions");
1535 result = error_mark_node;
1539 if (current_function_decl)
1540 error ("invalid use of `this' in non-member function");
1542 error ("invalid use of `this' at top level");
1543 result = error_mark_node;
1549 /* Finish a member function call using OBJECT and ARGS as arguments to
1550 FN. Returns an expression for the call. */
1553 finish_object_call_expr (fn, object, args)
1559 /* This is a future direction of this code, but because
1560 build_x_function_call cannot always undo what is done in
1561 build_component_ref entirely yet, we cannot do this. */
1563 tree real_fn = build_component_ref (object, fn, NULL_TREE, 1);
1564 return finish_call_expr (real_fn, args);
1566 if (DECL_DECLARES_TYPE_P (fn))
1568 if (processing_template_decl)
1569 /* This can happen on code like:
1572 template <class T> void f(T t) {
1576 We just grab the underlying IDENTIFIER. */
1577 fn = DECL_NAME (fn);
1580 cp_error ("calling type `%T' like a method", fn);
1581 return error_mark_node;
1585 return build_method_call (object, fn, args, NULL_TREE, LOOKUP_NORMAL);
1589 /* Finish a qualified member function call using OBJECT and ARGS as
1590 arguments to FN. Returns an expressino for the call. */
1593 finish_qualified_object_call_expr (fn, object, args)
1598 return build_scoped_method_call (object, TREE_OPERAND (fn, 0),
1599 TREE_OPERAND (fn, 1), args);
1602 /* Finish a pseudo-destructor call expression of OBJECT, with SCOPE
1603 being the scope, if any, of DESTRUCTOR. Returns an expression for
1607 finish_pseudo_destructor_call_expr (object, scope, destructor)
1612 if (processing_template_decl)
1613 return build_min_nt (PSEUDO_DTOR_EXPR, object, scope, destructor);
1615 if (scope && scope != destructor)
1616 cp_error ("destructor specifier `%T::~%T()' must have matching names",
1619 if ((scope == NULL_TREE || IDENTIFIER_GLOBAL_VALUE (destructor))
1620 && (TREE_CODE (TREE_TYPE (object)) !=
1621 TREE_CODE (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (destructor)))))
1622 cp_error ("`%E' is not of type `%T'", object, destructor);
1624 return cp_convert (void_type_node, object);
1627 /* Finish a call to a globally qualified member function FN using
1628 ARGS. Returns an expression for the call. */
1631 finish_qualified_call_expr (fn, args)
1635 if (processing_template_decl)
1636 return build_min_nt (CALL_EXPR, fn, args, NULL_TREE);
1638 return build_member_call (TREE_OPERAND (fn, 0),
1639 TREE_OPERAND (fn, 1),
1643 /* Finish an expression taking the address of LABEL. Returns an
1644 expression for the address. */
1647 finish_label_address_expr (label)
1652 label = lookup_label (label);
1653 if (label == NULL_TREE)
1654 result = null_pointer_node;
1657 TREE_USED (label) = 1;
1658 result = build1 (ADDR_EXPR, ptr_type_node, label);
1659 TREE_CONSTANT (result) = 1;
1660 /* This function cannot be inlined. All jumps to the addressed
1661 label should wind up at the same point. */
1662 DECL_UNINLINABLE (current_function_decl) = 1;
1668 /* Finish an expression of the form CODE EXPR. */
1671 finish_unary_op_expr (code, expr)
1672 enum tree_code code;
1675 tree result = build_x_unary_op (code, expr);
1676 /* Inside a template, build_x_unary_op does not fold the
1677 expression. So check whether the result is folded before
1678 setting TREE_NEGATED_INT. */
1679 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1680 && TREE_CODE (result) == INTEGER_CST
1681 && !TREE_UNSIGNED (TREE_TYPE (result))
1682 && INT_CST_LT (result, integer_zero_node))
1683 TREE_NEGATED_INT (result) = 1;
1684 overflow_warning (result);
1688 /* Finish an id-expression. */
1691 finish_id_expr (expr)
1694 if (TREE_CODE (expr) == IDENTIFIER_NODE)
1695 expr = do_identifier (expr, 1, NULL_TREE);
1700 static tree current_type_lookups;
1702 /* Perform deferred access control for types used in the type of a
1706 deferred_type_access_control ()
1708 tree lookup = type_lookups;
1710 if (lookup == error_mark_node)
1713 for (; lookup; lookup = TREE_CHAIN (lookup))
1714 enforce_access (TREE_PURPOSE (lookup), TREE_VALUE (lookup));
1718 decl_type_access_control (decl)
1723 if (type_lookups == error_mark_node)
1726 save_fn = current_function_decl;
1728 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
1729 current_function_decl = decl;
1731 deferred_type_access_control ();
1733 current_function_decl = save_fn;
1735 /* Now strip away the checks for the current declarator; they were
1736 added to type_lookups after typed_declspecs saved the copy that
1737 ended up in current_type_lookups. */
1738 type_lookups = current_type_lookups;
1742 save_type_access_control (lookups)
1745 current_type_lookups = lookups;
1748 /* Begin a function definition declared with DECL_SPECS and
1749 DECLARATOR. Returns non-zero if the function-declaration is
1753 begin_function_definition (decl_specs, declarator)
1760 split_specs_attrs (decl_specs, &specs, &attrs);
1761 if (!start_function (specs, declarator, attrs, SF_DEFAULT))
1764 deferred_type_access_control ();
1765 type_lookups = error_mark_node;
1767 reinit_parse_for_function ();
1768 /* The things we're about to see are not directly qualified by any
1769 template headers we've seen thus far. */
1770 reset_specialization ();
1775 /* Begin a constructor declarator of the form `SCOPE::NAME'. Returns
1779 begin_constructor_declarator (scope, name)
1783 tree result = build_parse_node (SCOPE_REF, scope, name);
1784 enter_scope_of (result);
1788 /* Finish an init-declarator. Returns a DECL. */
1791 finish_declarator (declarator, declspecs, attributes,
1792 prefix_attributes, initialized)
1796 tree prefix_attributes;
1799 return start_decl (declarator, declspecs, initialized, attributes,
1803 /* Finish a translation unit. */
1806 finish_translation_unit ()
1808 /* In case there were missing closebraces,
1809 get us back to the global binding level. */
1811 while (current_namespace != global_namespace)
1816 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
1817 Returns the parameter. */
1820 finish_template_type_parm (aggr, identifier)
1824 if (aggr != class_type_node)
1826 pedwarn ("template type parameters must use the keyword `class' or `typename'");
1827 aggr = class_type_node;
1830 return build_tree_list (aggr, identifier);
1833 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
1834 Returns the parameter. */
1837 finish_template_template_parm (aggr, identifier)
1841 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
1842 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
1843 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
1844 DECL_TEMPLATE_RESULT (tmpl) = decl;
1845 SET_DECL_ARTIFICIAL (decl);
1846 end_template_decl ();
1848 return finish_template_type_parm (aggr, tmpl);
1851 /* Finish a parameter list, indicated by PARMS. If ELLIPSIS is
1852 non-zero, the parameter list was terminated by a `...'. */
1855 finish_parmlist (parms, ellipsis)
1860 chainon (parms, void_list_node);
1861 /* We mark the PARMS as a parmlist so that declarator processing can
1862 disambiguate certain constructs. */
1863 if (parms != NULL_TREE)
1864 TREE_PARMLIST (parms) = 1;
1869 /* Begin a class definition, as indicated by T. */
1872 begin_class_definition (t)
1875 if (t == error_mark_node
1876 || ! IS_AGGR_TYPE (t))
1878 t = make_aggr_type (RECORD_TYPE);
1879 pushtag (make_anon_name (), t, 0);
1882 /* In a definition of a member class template, we will get here with an
1883 implicit typename, a TYPENAME_TYPE with a type. */
1884 if (TREE_CODE (t) == TYPENAME_TYPE)
1887 /* If we generated a partial instantiation of this type, but now
1888 we're seeing a real definition, we're actually looking at a
1889 partial specialization. Consider:
1891 template <class T, class U>
1897 template <class T, class U>
1900 typename X<Y<T, U> >::A a;
1903 template <class T, class U>
1908 We have to undo the effects of the previous partial
1910 if (PARTIAL_INSTANTIATION_P (t))
1914 /* Unfortunately, when we're not in pedantic mode, we
1915 attempt to actually fill in some of the fields of the
1916 partial instantiation, in order to support the implicit
1917 typename extension. Clear those fields now, in
1918 preparation for the definition here. The fields cleared
1919 here must match those set in instantiate_class_template.
1920 Look for a comment mentioning begin_class_definition
1922 TYPE_BINFO_BASETYPES (t) = NULL_TREE;
1923 TYPE_FIELDS (t) = NULL_TREE;
1924 TYPE_METHODS (t) = NULL_TREE;
1925 CLASSTYPE_TAGS (t) = NULL_TREE;
1926 TYPE_SIZE (t) = NULL_TREE;
1929 /* This isn't a partial instantiation any more. */
1930 PARTIAL_INSTANTIATION_P (t) = 0;
1932 /* If this type was already complete, and we see another definition,
1934 else if (COMPLETE_TYPE_P (t))
1935 duplicate_tag_error (t);
1937 /* Update the location of the decl. */
1938 DECL_SOURCE_FILE (TYPE_NAME (t)) = input_filename;
1939 DECL_SOURCE_LINE (TYPE_NAME (t)) = lineno;
1941 if (TYPE_BEING_DEFINED (t))
1943 t = make_aggr_type (TREE_CODE (t));
1944 pushtag (TYPE_IDENTIFIER (t), t, 0);
1946 maybe_process_partial_specialization (t);
1948 TYPE_BEING_DEFINED (t) = 1;
1949 TYPE_PACKED (t) = flag_pack_struct;
1950 /* Reset the interface data, at the earliest possible
1951 moment, as it might have been set via a class foo;
1954 tree name = TYPE_IDENTIFIER (t);
1956 if (! ANON_AGGRNAME_P (name))
1958 CLASSTYPE_INTERFACE_ONLY (t) = interface_only;
1959 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
1960 (t, interface_unknown);
1963 /* Only leave this bit clear if we know this
1964 class is part of an interface-only specification. */
1965 if (! CLASSTYPE_INTERFACE_KNOWN (t)
1966 || ! CLASSTYPE_INTERFACE_ONLY (t))
1967 CLASSTYPE_VTABLE_NEEDS_WRITING (t) = 1;
1969 reset_specialization();
1971 /* Make a declaration for this class in its own scope. */
1972 build_self_reference ();
1977 /* Finish the member declaration given by DECL. */
1980 finish_member_declaration (decl)
1983 if (decl == error_mark_node || decl == NULL_TREE)
1986 if (decl == void_type_node)
1987 /* The COMPONENT was a friend, not a member, and so there's
1988 nothing for us to do. */
1991 /* We should see only one DECL at a time. */
1992 my_friendly_assert (TREE_CHAIN (decl) == NULL_TREE, 0);
1994 /* Set up access control for DECL. */
1996 = (current_access_specifier == access_private_node);
1997 TREE_PROTECTED (decl)
1998 = (current_access_specifier == access_protected_node);
1999 if (TREE_CODE (decl) == TEMPLATE_DECL)
2001 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2002 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2005 /* Mark the DECL as a member of the current class. */
2006 DECL_CONTEXT (decl) = current_class_type;
2010 A C language linkage is ignored for the names of class members
2011 and the member function type of class member functions. */
2012 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2013 DECL_LANGUAGE (decl) = lang_cplusplus;
2015 /* Put functions on the TYPE_METHODS list and everything else on the
2016 TYPE_FIELDS list. Note that these are built up in reverse order.
2017 We reverse them (to obtain declaration order) in finish_struct. */
2018 if (TREE_CODE (decl) == FUNCTION_DECL
2019 || DECL_FUNCTION_TEMPLATE_P (decl))
2021 /* We also need to add this function to the
2022 CLASSTYPE_METHOD_VEC. */
2023 add_method (current_class_type, 0, decl);
2025 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2026 TYPE_METHODS (current_class_type) = decl;
2030 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2031 go at the beginning. The reason is that lookup_field_1
2032 searches the list in order, and we want a field name to
2033 override a type name so that the "struct stat hack" will
2034 work. In particular:
2036 struct S { enum E { }; int E } s;
2039 is legal. In addition, the FIELD_DECLs must be maintained in
2040 declaration order so that class layout works as expected.
2041 However, we don't need that order until class layout, so we
2042 save a little time by putting FIELD_DECLs on in reverse order
2043 here, and then reversing them in finish_struct_1. (We could
2044 also keep a pointer to the correct insertion points in the
2047 if (TREE_CODE (decl) == TYPE_DECL)
2048 TYPE_FIELDS (current_class_type)
2049 = chainon (TYPE_FIELDS (current_class_type), decl);
2052 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2053 TYPE_FIELDS (current_class_type) = decl;
2056 /* Enter the DECL into the scope of the class. */
2057 if (TREE_CODE (decl) != USING_DECL)
2058 pushdecl_class_level (decl);
2062 /* Finish a class definition T with the indicate ATTRIBUTES. If SEMI,
2063 the definition is immediately followed by a semicolon. Returns the
2067 finish_class_definition (t, attributes, semi, pop_scope_p)
2073 /* finish_struct nukes this anyway; if finish_exception does too,
2076 note_got_semicolon (t);
2078 /* If we got any attributes in class_head, xref_tag will stick them in
2079 TREE_TYPE of the type. Grab them now. */
2080 attributes = chainon (TREE_TYPE (t), attributes);
2081 TREE_TYPE (t) = NULL_TREE;
2083 if (TREE_CODE (t) == ENUMERAL_TYPE)
2087 t = finish_struct (t, attributes);
2089 note_got_semicolon (t);
2093 check_for_missing_semicolon (t);
2095 pop_scope (CP_DECL_CONTEXT (TYPE_MAIN_DECL (t)));
2096 if (current_scope () == current_function_decl)
2097 do_pending_defargs ();
2102 /* Finish processing the default argument expressions cached during
2103 the processing of a class definition. */
2106 begin_inline_definitions ()
2109 && current_scope () == current_function_decl)
2110 do_pending_inlines ();
2113 /* Finish processing the inline function definitions cached during the
2114 processing of a class definition. */
2117 finish_inline_definitions ()
2119 if (current_class_type == NULL_TREE)
2120 clear_inline_text_obstack ();
2123 /* Finish processing the declaration of a member class template
2124 TYPES whose template parameters are given by PARMS. */
2127 finish_member_class_template (types)
2132 /* If there are declared, but undefined, partial specializations
2133 mixed in with the typespecs they will not yet have passed through
2134 maybe_process_partial_specialization, so we do that here. */
2135 for (t = types; t != NULL_TREE; t = TREE_CHAIN (t))
2136 if (IS_AGGR_TYPE_CODE (TREE_CODE (TREE_VALUE (t))))
2137 maybe_process_partial_specialization (TREE_VALUE (t));
2139 note_list_got_semicolon (types);
2140 grok_x_components (types);
2141 if (TYPE_CONTEXT (TREE_VALUE (types)) != current_class_type)
2142 /* The component was in fact a friend declaration. We avoid
2143 finish_member_template_decl performing certain checks by
2147 finish_member_template_decl (types);
2149 /* As with other component type declarations, we do
2150 not store the new DECL on the list of
2155 /* Finish processsing a complete template declaration. The PARMS are
2156 the template parameters. */
2159 finish_template_decl (parms)
2163 end_template_decl ();
2165 end_specialization ();
2168 /* Finish processing a a template-id (which names a type) of the form
2169 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2170 template-id. If ENTERING_SCOPE is non-zero we are about to enter
2171 the scope of template-id indicated. */
2174 finish_template_type (name, args, entering_scope)
2181 decl = lookup_template_class (name, args,
2182 NULL_TREE, NULL_TREE, entering_scope);
2183 if (decl != error_mark_node)
2184 decl = TYPE_STUB_DECL (decl);
2189 /* SR is a SCOPE_REF node. Enter the scope of SR, whether it is a
2190 namespace scope or a class scope. */
2196 tree scope = TREE_OPERAND (sr, 0);
2198 if (TREE_CODE (scope) == NAMESPACE_DECL)
2200 push_decl_namespace (scope);
2201 TREE_COMPLEXITY (sr) = -1;
2203 else if (scope != current_class_type)
2205 if (TREE_CODE (scope) == TYPENAME_TYPE)
2207 /* In a declarator for a template class member, the scope will
2208 get here as an implicit typename, a TYPENAME_TYPE with a type. */
2209 scope = TREE_TYPE (scope);
2210 TREE_OPERAND (sr, 0) = scope;
2212 push_nested_class (scope, 3);
2213 TREE_COMPLEXITY (sr) = current_class_depth;
2217 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2218 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2219 BASE_CLASS, or NULL_TREE if an error occurred. The
2220 ACCESSS_SPECIFIER is one of
2221 access_{default,public,protected_private}[_virtual]_node.*/
2224 finish_base_specifier (access_specifier, base_class)
2225 tree access_specifier;
2231 if (base_class == NULL_TREE)
2233 error ("invalid base class");
2234 type = error_mark_node;
2237 type = TREE_TYPE (base_class);
2239 if (! is_aggr_type (type, 1))
2242 result = build_tree_list (access_specifier, type);
2247 /* Called when multiple declarators are processed. If that is not
2248 premitted in this context, an error is issued. */
2251 check_multiple_declarators ()
2255 In a template-declaration, explicit specialization, or explicit
2256 instantiation the init-declarator-list in the declaration shall
2257 contain at most one declarator.
2259 We don't just use PROCESSING_TEMPLATE_DECL for the first
2260 condition since that would disallow the perfectly legal code,
2261 like `template <class T> struct S { int i, j; };'. */
2262 tree scope = current_scope ();
2264 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
2265 /* It's OK to write `template <class T> void f() { int i, j;}'. */
2268 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
2269 || processing_explicit_instantiation
2270 || processing_specialization)
2271 cp_error ("multiple declarators in template declaration");
2275 finish_typeof (expr)
2278 if (processing_template_decl)
2282 t = make_aggr_type (TYPEOF_TYPE);
2283 TYPE_FIELDS (t) = expr;
2288 return TREE_TYPE (expr);
2291 /* Create an empty statement tree rooted at T. */
2297 /* We create a trivial EXPR_STMT so that last_tree is never NULL in
2298 what follows. We remove the extraneous statement in
2299 finish_stmt_tree. */
2300 *t = build_nt (EXPR_STMT, void_zero_node);
2302 last_expr_type = NULL_TREE;
2305 /* Finish the statement tree rooted at T. */
2308 finish_stmt_tree (t)
2313 /* Remove the fake extra statement added in begin_stmt_tree. */
2314 stmt = TREE_CHAIN (*t);
2316 SET_LAST_STMT (NULL_TREE);
2320 /* The line-number recorded in the outermost statement in a function
2321 is the line number of the end of the function. */
2322 STMT_LINENO (stmt) = lineno;
2323 STMT_LINENO_FOR_FN_P (stmt) = 1;
2327 /* We're about to expand T, a statement. Set up appropriate context
2328 for the substitution. */
2334 if (!STMT_LINENO_FOR_FN_P (t))
2335 lineno = STMT_LINENO (t);
2336 stmts_are_full_exprs_p = STMT_IS_FULL_EXPR_P (t);
2339 /* Some statements, like for-statements or if-statements, require a
2340 condition. This condition can be a declaration. If T is such a
2341 declaration it is processed, and an expression appropriate to use
2342 as the condition is returned. Otherwise, T itself is returned. */
2348 if (t && TREE_CODE (t) == TREE_LIST)
2350 expand_stmt (TREE_PURPOSE (t));
2351 return TREE_VALUE (t);
2357 /* Generate RTL for the statement T, and its substatements, and any
2358 other statements at its nesting level. */
2364 tree rval = NULL_TREE;
2366 while (t && t != error_mark_node)
2368 int saved_stmts_are_full_exprs_p;
2370 /* Assume we'll have nothing to return. */
2373 /* Set up context appropriately for handling this statement. */
2374 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p;
2377 switch (TREE_CODE (t))
2380 finish_return_stmt (RETURN_EXPR (t));
2384 finish_expr_stmt (EXPR_STMT_EXPR (t));
2391 emit_line_note (input_filename, lineno);
2392 decl = DECL_STMT_DECL (t);
2393 /* If this is a declaration for an automatic local
2394 variable, initialize it. Note that we might also see a
2395 declaration for a namespace-scope object (declared with
2396 `extern'). We don't have to handle the initialization
2397 of those objects here; they can only be declarations,
2398 rather than definitions. */
2399 if (TREE_CODE (decl) == VAR_DECL
2400 && !TREE_STATIC (decl)
2401 && !DECL_EXTERNAL (decl))
2403 /* Let the back-end know about this variable. */
2404 if (!ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
2405 emit_local_var (decl);
2407 expand_anon_union_decl (decl, NULL_TREE,
2408 DECL_ANON_UNION_ELEMS (decl));
2410 else if (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl))
2412 if (DECL_ARTIFICIAL (decl) && ! TREE_USED (decl))
2413 /* Do not emit unused decls. This is not just an
2414 optimization. We really do not want to emit
2415 __PRETTY_FUNCTION__ etc, if they're never used. */
2416 DECL_IGNORED_P (decl) = 1;
2418 make_rtl_for_local_static (decl);
2424 finish_decl_cleanup (CLEANUP_DECL (t), CLEANUP_EXPR (t));
2427 case START_CATCH_STMT:
2428 begin_catch_block (TREE_TYPE (t));
2432 if (CTOR_BEGIN_P (t))
2433 begin_protect_partials ();
2435 /* After this point, any exceptions will cause the
2436 destructor to be executed, so we no longer need to worry
2437 about destroying the various subobjects ourselves. */
2438 end_protect_partials ();
2446 expand_stmt (FOR_INIT_STMT (t));
2447 finish_for_init_stmt (NULL_TREE);
2448 finish_for_cond (expand_cond (FOR_COND (t)), NULL_TREE);
2450 finish_for_expr (tmp, NULL_TREE);
2451 expand_stmt (FOR_BODY (t));
2452 finish_for_stmt (tmp, NULL_TREE);
2458 begin_while_stmt ();
2459 finish_while_stmt_cond (expand_cond (WHILE_COND (t)), NULL_TREE);
2460 expand_stmt (WHILE_BODY (t));
2461 finish_while_stmt (NULL_TREE);
2468 expand_stmt (DO_BODY (t));
2469 finish_do_body (NULL_TREE);
2470 finish_do_stmt (DO_COND (t), NULL_TREE);
2476 finish_if_stmt_cond (expand_cond (IF_COND (t)), NULL_TREE);
2477 if (THEN_CLAUSE (t))
2479 expand_stmt (THEN_CLAUSE (t));
2480 finish_then_clause (NULL_TREE);
2482 if (ELSE_CLAUSE (t))
2484 begin_else_clause ();
2485 expand_stmt (ELSE_CLAUSE (t));
2486 finish_else_clause (NULL_TREE);
2492 begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t));
2493 expand_stmt (COMPOUND_BODY (t));
2494 rval = finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t),
2499 finish_break_stmt ();
2503 finish_continue_stmt ();
2510 begin_switch_stmt ();
2511 cond = expand_cond (SWITCH_COND (t));
2512 finish_switch_cond (cond, NULL_TREE);
2513 expand_stmt (SWITCH_BODY (t));
2514 finish_switch_stmt (cond, NULL_TREE);
2519 finish_case_label (CASE_LOW (t), CASE_HIGH (t));
2523 expand_label (LABEL_STMT_LABEL (t));
2527 finish_goto_stmt (GOTO_DESTINATION (t));
2531 finish_asm_stmt (ASM_CV_QUAL (t), ASM_STRING (t), ASM_OUTPUTS
2532 (t), ASM_INPUTS (t), ASM_CLOBBERS (t));
2538 expand_eh_region_start ();
2539 expand_stmt (TRY_STMTS (t));
2540 finish_cleanup_try_block (NULL_TREE);
2541 finish_cleanup (TRY_HANDLERS (t), NULL_TREE);
2545 if (FN_TRY_BLOCK_P (t))
2546 begin_function_try_block ();
2550 expand_stmt (TRY_STMTS (t));
2552 if (FN_TRY_BLOCK_P (t))
2554 finish_function_try_block (NULL_TREE);
2555 expand_stmt (TRY_HANDLERS (t));
2556 finish_function_handler_sequence (NULL_TREE);
2560 finish_try_block (NULL_TREE);
2561 expand_stmt (TRY_HANDLERS (t));
2562 finish_handler_sequence (NULL_TREE);
2569 expand_stmt (HANDLER_BODY (t));
2570 finish_handler (NULL_TREE, NULL_TREE);
2574 finish_subobject (SUBOBJECT_CLEANUP (t));
2578 if (!SCOPE_NO_CLEANUPS_P (t))
2580 if (SCOPE_BEGIN_P (t))
2581 expand_start_bindings_and_block (2 * SCOPE_NULLIFIED_P (t),
2582 SCOPE_STMT_BLOCK (t));
2583 else if (SCOPE_END_P (t))
2584 expand_end_bindings (NULL_TREE, !SCOPE_NULLIFIED_P (t),
2585 SCOPE_PARTIAL_P (t));
2587 else if (!SCOPE_NULLIFIED_P (t))
2589 rtx note = emit_note (NULL,
2591 ? NOTE_INSN_BLOCK_BEG
2592 : NOTE_INSN_BLOCK_END));
2593 NOTE_BLOCK (note) = SCOPE_STMT_BLOCK (t);
2599 /* Clear this out so that finish_named_return_value can set it
2601 DECL_NAME (DECL_RESULT (current_function_decl)) = NULL_TREE;
2602 finish_named_return_value (TREE_OPERAND (t, 0),
2603 TREE_OPERAND (t, 1));
2607 my_friendly_abort (19990810);
2611 /* Restore saved state. */
2612 stmts_are_full_exprs_p = saved_stmts_are_full_exprs_p;
2614 /* Go on to the next statement in this scope. */
2621 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2622 will equivalent CALL_EXPRs. */
2625 simplify_aggr_init_exprs_r (tp, walk_subtrees, data)
2627 int *walk_subtrees ATTRIBUTE_UNUSED;
2628 void *data ATTRIBUTE_UNUSED;
2630 tree aggr_init_expr;
2637 int copy_from_buffer_p;
2639 aggr_init_expr = *tp;
2640 /* We don't need to walk into types; there's nothing in a type that
2641 needs simplification. (And, furthermore, there are places we
2642 actively don't want to go. For example, we don't want to wander
2643 into the default arguments for a FUNCTION_DECL that appears in a
2645 if (TYPE_P (aggr_init_expr))
2650 /* Only AGGR_INIT_EXPRs are interesting. */
2651 else if (TREE_CODE (aggr_init_expr) != AGGR_INIT_EXPR)
2654 /* Form an appropriate CALL_EXPR. */
2655 fn = TREE_OPERAND (aggr_init_expr, 0);
2656 args = TREE_OPERAND (aggr_init_expr, 1);
2657 slot = TREE_OPERAND (aggr_init_expr, 2);
2658 type = TREE_TYPE (aggr_init_expr);
2660 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2662 /* Replace the first argument with the address of the third
2663 argument to the AGGR_INIT_EXPR. */
2664 call_type = build_pointer_type (type);
2665 mark_addressable (slot);
2666 args = tree_cons (NULL_TREE, build1 (ADDR_EXPR, call_type, slot),
2669 call_expr = build (CALL_EXPR, call_type, fn, args, NULL_TREE);
2670 TREE_SIDE_EFFECTS (call_expr) = 1;
2672 /* If we're using the non-reentrant PCC calling convention, then we
2673 need to copy the returned value out of the static buffer into the
2675 copy_from_buffer_p = 0;
2676 #ifdef PCC_STATIC_STRUCT_RETURN
2677 if (!AGGR_INIT_VIA_CTOR_P (aggr_init_expr) && aggregate_value_p (type))
2681 flag_access_control = 0;
2682 call_expr = build_aggr_init (slot, call_expr, LOOKUP_ONLYCONVERTING);
2683 flag_access_control = old_ac;
2684 copy_from_buffer_p = 1;
2688 /* If this AGGR_INIT_EXPR indicates the value returned by a
2689 function, then we want to use the value of the initialized
2690 location as the result. */
2691 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr) || copy_from_buffer_p)
2693 call_expr = build (COMPOUND_EXPR, type,
2695 TREE_SIDE_EFFECTS (call_expr) = 1;
2698 /* Replace the AGGR_INIT_EXPR with the CALL_EXPR. */
2699 TREE_CHAIN (call_expr) = TREE_CHAIN (aggr_init_expr);
2702 /* Keep iterating. */
2706 /* Generate RTL for FN. */
2713 const char *saved_input_filename;
2715 /* When the parser calls us after finishing the body of a template
2716 function, we don't really want to expand the body. When we're
2717 processing an in-class definition of an inline function,
2718 PROCESSING_TEMPLATE_DECL will no longer be set here, so we have
2719 to look at the function itself. */
2720 if (processing_template_decl
2721 || (DECL_LANG_SPECIFIC (fn)
2722 && DECL_TEMPLATE_INFO (fn)
2723 && uses_template_parms (DECL_TI_ARGS (fn))))
2725 /* Normally, collection only occurs in rest_of_compilation. So,
2726 if we don't collect here, we never collect junk generated
2727 during the processing of templates until we hit a
2728 non-template function. */
2733 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
2734 walk_tree (&DECL_SAVED_TREE (fn), simplify_aggr_init_exprs_r, NULL);
2736 /* If this is a constructor or destructor body, we have to clone it
2737 under the new ABI. */
2738 if (maybe_clone_body (fn))
2740 /* We don't want to process FN again, so pretend we've written
2741 it out, even though we haven't. */
2742 TREE_ASM_WRITTEN (fn) = 1;
2746 /* There's no reason to do any of the work here if we're only doing
2747 semantic analysis; this code just generates RTL. */
2748 if (flag_syntax_only)
2751 /* If possible, avoid generating RTL for this function. Instead,
2752 just record it as an inline function, and wait until end-of-file
2753 to decide whether to write it out or not. */
2754 if (/* We have to generate RTL if it's not an inline function. */
2755 (DECL_INLINE (fn) || DECL_COMDAT (fn))
2756 /* Or if we have to keep all inline functions anyhow. */
2757 && !flag_keep_inline_functions
2758 /* Or if we actually have a reference to the function. */
2759 && !DECL_NEEDED_P (fn)
2760 /* Or if this is a nested function. */
2761 && !decl_function_context (fn))
2763 /* Give the function RTL now so that we can assign it to a
2764 function pointer, etc. */
2765 make_function_rtl (fn);
2766 /* Set DECL_EXTERNAL so that assemble_external will be called as
2767 necessary. We'll clear it again in finish_file. */
2768 if (!DECL_EXTERNAL (fn))
2770 DECL_NOT_REALLY_EXTERN (fn) = 1;
2771 DECL_EXTERNAL (fn) = 1;
2773 /* Remember this function. In finish_file we'll decide if
2774 we actually need to write this function out. */
2776 /* Let the back-end know that this funtion exists. */
2777 note_deferral_of_defined_inline_function (fn);
2781 /* Optimize the body of the function before expanding it. */
2782 optimize_function (fn);
2784 /* Save the current file name and line number. When we expand the
2785 body of the function, we'll set LINENO and INPUT_FILENAME so that
2786 error-mesages come out in the right places. */
2787 saved_lineno = lineno;
2788 saved_input_filename = input_filename;
2789 lineno = DECL_SOURCE_LINE (fn);
2790 input_filename = DECL_SOURCE_FILE (fn);
2792 start_function (NULL_TREE, fn, NULL_TREE, SF_PRE_PARSED | SF_EXPAND);
2793 store_parm_decls ();
2794 current_function_is_thunk = DECL_THUNK_P (fn);
2796 /* We don't need to redeclare __FUNCTION__, __PRETTY_FUNCTION__, or
2797 any of the other magic variables we set up when starting a
2799 current_function_name_declared = 1;
2801 /* Expand the body. */
2802 expand_stmt (DECL_SAVED_TREE (fn));
2804 /* Statements should always be full-expressions at the outermost set
2805 of curly braces for a function. */
2806 my_friendly_assert (stmts_are_full_exprs_p, 19990831);
2808 /* The outermost statement for a function contains the line number
2809 recorded when we finished processing the function. */
2810 lineno = STMT_LINENO (DECL_SAVED_TREE (fn));
2812 /* Generate code for the function. */
2813 finish_function (0);
2815 /* If possible, obliterate the body of the function so that it can
2816 be garbage collected. */
2817 if (flag_dump_translation_unit)
2818 /* Keep the body; we're going to dump it. */
2820 else if (DECL_INLINE (fn) && flag_inline_trees)
2821 /* We might need the body of this function so that we can expand
2822 it inline somewhere else. */
2825 /* We don't need the body; blow it away. */
2826 DECL_SAVED_TREE (fn) = NULL_TREE;
2828 /* And restore the current source position. */
2829 lineno = saved_lineno;
2830 input_filename = saved_input_filename;