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 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
35 /* There routines provide a modular interface to perform many parsing
36 operations. They may therefore be used during actual parsing, or
37 during template instantiation, which may be regarded as a
38 degenerate form of parsing. Since the current g++ parser is
39 lacking in several respects, and will be reimplemented, we are
40 attempting to move most code that is not directly related to
41 parsing into this file; that will make implementing the new parser
42 much easier since it will be able to make use of these routines. */
44 /* When parsing a template, LAST_TREE contains the last statement
45 parsed. These are chained together through the TREE_CHAIN field,
46 but often need to be re-organized since the parse is performed
47 bottom-up. This macro makes LAST_TREE the indicated SUBSTMT of
50 #define RECHAIN_STMTS(stmt, substmt, last) \
53 TREE_CHAIN (stmt) = NULL_TREE; \
57 #define RECHAIN_STMTS_FROM_LAST(stmt, substmt) \
58 RECHAIN_STMTS (stmt, substmt, last_tree)
60 #define RECHAIN_STMTS_FROM_CHAIN(stmt, substmt) \
61 RECHAIN_STMTS (stmt, substmt, TREE_CHAIN (stmt))
63 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
66 finish_expr_stmt (expr
)
69 if (expr
!= NULL_TREE
)
71 if (!processing_template_decl
)
73 emit_line_note (input_filename
, lineno
);
74 /* Do default conversion if safe and possibly important,
75 in case within ({...}). */
76 if ((TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
78 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
)
79 expr
= default_conversion (expr
);
82 cplus_expand_expr_stmt (expr
);
89 /* Begin an if-statement. Returns a newly created IF_STMT if
97 if (processing_template_decl
)
99 r
= build_min_nt (IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
110 /* Process the COND of an if-statement, which may be given by
114 finish_if_stmt_cond (cond
, if_stmt
)
118 if (processing_template_decl
)
120 if (last_tree
!= if_stmt
)
121 RECHAIN_STMTS_FROM_LAST (if_stmt
, IF_COND (if_stmt
));
123 IF_COND (if_stmt
) = cond
;
127 emit_line_note (input_filename
, lineno
);
128 expand_start_cond (condition_conversion (cond
), 0);
132 /* Finish the then-clause of an if-statement, which may be given by
136 finish_then_clause (if_stmt
)
139 if (processing_template_decl
)
141 RECHAIN_STMTS_FROM_CHAIN (if_stmt
,
142 THEN_CLAUSE (if_stmt
));
150 /* Begin the else-clause of an if-statement. */
155 if (!processing_template_decl
)
156 expand_start_else ();
159 /* Finish the else-clause of an if-statement, which may be given by
163 finish_else_clause (if_stmt
)
166 if (processing_template_decl
)
167 RECHAIN_STMTS_FROM_CHAIN (if_stmt
, ELSE_CLAUSE (if_stmt
));
170 /* Finsh an if-statement. */
175 if (!processing_template_decl
)
182 /* Begin a while-statement. Returns a newly created WHILE_STMT if
190 if (processing_template_decl
)
192 r
= build_min_nt (WHILE_STMT
, NULL_TREE
, NULL_TREE
);
198 emit_line_note (input_filename
, lineno
);
199 expand_start_loop (1);
208 /* Process the COND of an if-statement, which may be given by
212 finish_while_stmt_cond (cond
, while_stmt
)
216 if (processing_template_decl
)
218 if (last_tree
!= while_stmt
)
219 RECHAIN_STMTS_FROM_LAST (while_stmt
,
220 WHILE_COND (while_stmt
));
222 TREE_OPERAND (while_stmt
, 0) = cond
;
226 emit_line_note (input_filename
, lineno
);
227 expand_exit_loop_if_false (0, condition_conversion (cond
));
230 /* If COND wasn't a declaration, clear out the
231 block we made for it and start a new one here so the
232 optimization in expand_end_loop will work. */
233 if (getdecls () == NULL_TREE
)
240 /* Finish a while-statement, which may be given by WHILE_STMT. */
243 finish_while_stmt (while_stmt
)
248 if (processing_template_decl
)
249 RECHAIN_STMTS_FROM_CHAIN (while_stmt
, WHILE_BODY (while_stmt
));
255 /* Begin a do-statement. Returns a newly created DO_STMT if
261 if (processing_template_decl
)
263 tree r
= build_min_nt (DO_STMT
, NULL_TREE
, NULL_TREE
);
270 emit_line_note (input_filename
, lineno
);
271 expand_start_loop_continue_elsewhere (1);
276 /* Finish the body of a do-statement, which may be given by DO_STMT. */
279 finish_do_body (do_stmt
)
282 if (processing_template_decl
)
283 RECHAIN_STMTS_FROM_CHAIN (do_stmt
, DO_BODY (do_stmt
));
285 expand_loop_continue_here ();
288 /* Finish a do-statement, which may be given by DO_STMT, and whose
289 COND is as indicated. */
292 finish_do_stmt (cond
, do_stmt
)
296 if (processing_template_decl
)
297 DO_COND (do_stmt
) = cond
;
300 emit_line_note (input_filename
, lineno
);
301 expand_exit_loop_if_false (0, condition_conversion (cond
));
309 /* Finish a return-statement. The EXPRESSION returned, if any, is as
313 finish_return_stmt (expr
)
316 emit_line_note (input_filename
, lineno
);
317 c_expand_return (expr
);
321 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
328 if (processing_template_decl
)
330 r
= build_min_nt (FOR_STMT
, NULL_TREE
, NULL_TREE
,
331 NULL_TREE
, NULL_TREE
);
337 if (flag_new_for_scope
> 0)
340 note_level_for_for ();
346 /* Finish the for-init-statement of a for-statement, which may be
347 given by FOR_STMT. */
350 finish_for_init_stmt (for_stmt
)
353 if (processing_template_decl
)
355 if (last_tree
!= for_stmt
)
356 RECHAIN_STMTS_FROM_CHAIN (for_stmt
, FOR_INIT_STMT (for_stmt
));
361 emit_line_note (input_filename
, lineno
);
362 expand_start_loop_continue_elsewhere (1);
368 /* Finish the COND of a for-statement, which may be given by
372 finish_for_cond (cond
, for_stmt
)
376 if (processing_template_decl
)
378 if (last_tree
!= for_stmt
)
379 RECHAIN_STMTS_FROM_LAST (for_stmt
, FOR_COND (for_stmt
));
381 FOR_COND (for_stmt
) = cond
;
385 emit_line_note (input_filename
, lineno
);
387 expand_exit_loop_if_false (0, condition_conversion (cond
));
390 /* If the cond wasn't a declaration, clear out the
391 block we made for it and start a new one here so the
392 optimization in expand_end_loop will work. */
393 if (getdecls () == NULL_TREE
)
400 /* Finish the increment-EXPRESSION in a for-statement, which may be
401 given by FOR_STMT. */
404 finish_for_expr (expr
, for_stmt
)
408 if (processing_template_decl
)
409 FOR_EXPR (for_stmt
) = expr
;
411 /* Don't let the tree nodes for EXPR be discarded
412 by clear_momentary during the parsing of the next stmt. */
416 /* Finish the body of a for-statement, which may be given by
417 FOR_STMT. The increment-EXPR for the loop must be
421 finish_for_stmt (expr
, for_stmt
)
425 /* Pop the scope for the body of the loop. */
428 if (processing_template_decl
)
429 RECHAIN_STMTS_FROM_CHAIN (for_stmt
, FOR_BODY (for_stmt
));
432 emit_line_note (input_filename
, lineno
);
433 expand_loop_continue_here ();
435 cplus_expand_expr_stmt (expr
);
441 if (flag_new_for_scope
> 0)
447 /* Finish a break-statement. */
452 emit_line_note (input_filename
, lineno
);
453 if (processing_template_decl
)
454 add_tree (build_min_nt (BREAK_STMT
));
455 else if ( ! expand_exit_something ())
456 cp_error ("break statement not within loop or switch");
459 /* Finish a continue-statement. */
462 finish_continue_stmt ()
464 emit_line_note (input_filename
, lineno
);
465 if (processing_template_decl
)
466 add_tree (build_min_nt (CONTINUE_STMT
));
467 else if (! expand_continue_loop (0))
468 cp_error ("continue statement not within a loop");
471 /* Begin a switch-statement. */
479 /* Finish the cond of a switch-statement. Returns a new
480 SWITCH_STMT if appropriate. */
483 finish_switch_cond (cond
)
488 if (processing_template_decl
)
490 r
= build_min_nt (SWITCH_STMT
, cond
, NULL_TREE
);
495 emit_line_note (input_filename
, lineno
);
496 c_expand_start_case (cond
);
501 /* Don't let the tree nodes for COND be discarded by
502 clear_momentary during the parsing of the next stmt. */
508 /* Finish the body of a switch-statement, which may be given by
509 SWITCH_STMT. The COND to switch on is indicated. */
512 finish_switch_stmt (cond
, switch_stmt
)
516 if (processing_template_decl
)
517 RECHAIN_STMTS_FROM_CHAIN (switch_stmt
, SWITCH_BODY (switch_stmt
));
519 expand_end_case (cond
);
526 /* Finish a case-label. */
529 finish_case_label (low_value
, high_value
)
533 do_case (low_value
, high_value
);
537 /* Finish a goto-statement. */
540 finish_goto_stmt (destination
)
543 if (processing_template_decl
)
544 add_tree (build_min_nt (GOTO_STMT
, destination
));
547 emit_line_note (input_filename
, lineno
);
549 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
551 tree decl
= lookup_label (destination
);
552 TREE_USED (decl
) = 1;
556 expand_computed_goto (destination
);
560 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
566 if (processing_template_decl
)
568 tree r
= build_min_nt (TRY_BLOCK
, NULL_TREE
,
575 emit_line_note (input_filename
, lineno
);
576 expand_start_try_stmts ();
581 /* Finish a try-block, which may be given by TRY_BLOCK. */
584 finish_try_block (try_block
)
587 if (processing_template_decl
)
588 RECHAIN_STMTS_FROM_LAST (try_block
, TRY_STMTS (try_block
));
591 expand_start_all_catch ();
595 /* Finish a handler-sequence for a try-block, which may be given by
599 finish_handler_sequence (try_block
)
602 if (processing_template_decl
)
603 RECHAIN_STMTS_FROM_CHAIN (try_block
, TRY_HANDLERS (try_block
));
606 expand_end_all_catch ();
610 /* Begin a handler. Returns a HANDLER if appropriate. */
617 if (processing_template_decl
)
619 r
= build_min_nt (HANDLER
, NULL_TREE
, NULL_TREE
);
630 /* Finish the handler-parameters for a handler, which may be given by
634 finish_handler_parms (handler
)
637 if (processing_template_decl
)
638 RECHAIN_STMTS_FROM_CHAIN (handler
, HANDLER_PARMS (handler
));
641 /* Finish a handler, which may be given by HANDLER. */
644 finish_handler (handler
)
647 if (processing_template_decl
)
648 RECHAIN_STMTS_FROM_CHAIN (handler
, HANDLER_BODY (handler
));
650 expand_end_catch_block ();
655 /* Begin a compound-statement. If HAS_NO_SCOPE is non-zero, the
656 compound-statement does not define a scope. Returns a new
657 COMPOUND_STMT if appropriate. */
660 begin_compound_stmt (has_no_scope
)
665 if (processing_template_decl
)
667 r
= build_min_nt (COMPOUND_STMT
, NULL_TREE
);
670 COMPOUND_STMT_NO_SCOPE (r
) = 1;
682 /* Finish a compound-statement, which may be given by COMPOUND_STMT.
683 If HAS_NO_SCOPE is non-zero, the compound statement does not define
687 finish_compound_stmt (has_no_scope
, compound_stmt
)
698 if (processing_template_decl
)
699 RECHAIN_STMTS_FROM_CHAIN (compound_stmt
,
700 COMPOUND_BODY (compound_stmt
));
707 /* Finish an asm-statement, whose components are a CV_QUALIFIER, a
708 STRING, some OUTPUT_OPERANDS, some INPUT_OPERANDS, and some
712 finish_asm_stmt (cv_qualifier
, string
, output_operands
,
713 input_operands
, clobbers
)
716 tree output_operands
;
720 if (TREE_CHAIN (string
))
721 string
= combine_strings (string
);
723 if (processing_template_decl
)
725 tree r
= build_min_nt (ASM_STMT
, cv_qualifier
, string
,
726 output_operands
, input_operands
,
732 emit_line_note (input_filename
, lineno
);
733 if (output_operands
!= NULL_TREE
|| input_operands
!= NULL_TREE
734 || clobbers
!= NULL_TREE
)
736 if (cv_qualifier
!= NULL_TREE
737 && cv_qualifier
!= ridpointers
[(int) RID_VOLATILE
])
738 cp_warning ("%s qualifier ignored on asm",
739 IDENTIFIER_POINTER (cv_qualifier
));
741 c_expand_asm_operands (string
, output_operands
,
745 == ridpointers
[(int) RID_VOLATILE
],
746 input_filename
, lineno
);
750 /* Don't warn about redundant specification of 'volatile' here. */
751 if (cv_qualifier
!= NULL_TREE
752 && cv_qualifier
!= ridpointers
[(int) RID_VOLATILE
])
753 cp_warning ("%s qualifier ignored on asm",
754 IDENTIFIER_POINTER (cv_qualifier
));
762 /* Finish a parenthesized expression EXPR. */
765 finish_parenthesized_expr (expr
)
768 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expr
))))
769 /* This inhibits warnings in truthvalue_conversion. */
770 C_SET_EXP_ORIGINAL_CODE (expr
, ERROR_MARK
);
775 /* Begin a statement-expression. The value returned must be passed to
782 /* If we're processing_template_decl, then the upcoming compound
783 statement will be chained onto the tree structure, starting at
784 last_tree. We return last_tree so that we can later unhook the
785 compound statement. */
786 return processing_template_decl
? last_tree
: expand_start_stmt_expr();
789 /* Finish a statement-expression. RTL_EXPR should be the value
790 returned by the previous begin_stmt_expr; EXPR is the
791 statement-expression. Returns an expression representing the
792 statement-expression. */
795 finish_stmt_expr (rtl_expr
, expr
)
801 if (!processing_template_decl
)
803 rtl_expr
= expand_end_stmt_expr (rtl_expr
);
804 /* The statements have side effects, so the group does. */
805 TREE_SIDE_EFFECTS (rtl_expr
) = 1;
808 if (TREE_CODE (expr
) == BLOCK
)
810 /* Make a BIND_EXPR for the BLOCK already made. */
811 if (processing_template_decl
)
812 result
= build (BIND_EXPR
, NULL_TREE
,
813 NULL_TREE
, last_tree
, expr
);
815 result
= build (BIND_EXPR
, TREE_TYPE (rtl_expr
),
816 NULL_TREE
, rtl_expr
, expr
);
818 /* Remove the block from the tree at this point.
819 It gets put back at the proper place
820 when the BIND_EXPR is expanded. */
826 if (processing_template_decl
)
828 /* Remove the compound statement from the tree structure; it is
829 now saved in the BIND_EXPR. */
830 last_tree
= rtl_expr
;
831 TREE_CHAIN (last_tree
) = NULL_TREE
;
837 /* Finish a call to FN with ARGS. Returns a representation of the
841 finish_call_expr (fn
, args
, koenig
)
850 if (TREE_CODE (fn
) == BIT_NOT_EXPR
)
851 fn
= build_x_unary_op (BIT_NOT_EXPR
, TREE_OPERAND (fn
, 0));
852 else if (TREE_CODE (fn
) != TEMPLATE_ID_EXPR
)
853 fn
= do_identifier (fn
, 2, args
);
855 result
= build_x_function_call (fn
, args
, current_class_ref
);
857 if (TREE_CODE (result
) == CALL_EXPR
858 && TREE_TYPE (result
) != void_type_node
)
859 result
= require_complete_type (result
);
864 /* Finish a call to a postfix increment or decrement or EXPR. (Which
865 is indicated by CODE, which should be POSTINCREMENT_EXPR or
866 POSTDECREMENT_EXPR.) */
869 finish_increment_expr (expr
, code
)
873 /* If we get an OFFSET_REF, turn it into what it really means (e.g.,
874 a COMPONENT_REF). This way if we've got, say, a reference to a
875 static member that's being operated on, we don't end up trying to
876 find a member operator for the class it's in. */
878 if (TREE_CODE (expr
) == OFFSET_REF
)
879 expr
= resolve_offset_ref (expr
);
880 return build_x_unary_op (code
, expr
);
883 /* Finish a use of `this'. Returns an expression for `this'. */
890 if (current_class_ptr
)
892 #ifdef WARNING_ABOUT_CCD
893 TREE_USED (current_class_ptr
) = 1;
895 result
= current_class_ptr
;
897 else if (current_function_decl
898 && DECL_STATIC_FUNCTION_P (current_function_decl
))
900 error ("`this' is unavailable for static member functions");
901 result
= error_mark_node
;
905 if (current_function_decl
)
906 error ("invalid use of `this' in non-member function");
908 error ("invalid use of `this' at top level");
909 result
= error_mark_node
;
915 /* Finish a member function call using OBJECT and ARGS as arguments to
916 FN. Returns an expression for the call. */
919 finish_object_call_expr (fn
, object
, args
)
925 /* This is a future direction of this code, but because
926 build_x_function_call cannot always undo what is done in
927 build_component_ref entirely yet, we cannot do this. */
929 tree real_fn
= build_component_ref (object
, fn
, NULL_TREE
, 1);
930 return finish_call_expr (real_fn
, args
);
932 if (TREE_CODE (fn
) == TYPE_DECL
)
934 if (processing_template_decl
)
935 /* This can happen on code like:
938 template <class T> void f(T t) {
942 We just grab the underlying IDENTIFIER. */
946 cp_error ("calling type `%T' like a method", fn
);
947 return error_mark_node
;
951 return build_method_call (object
, fn
, args
, NULL_TREE
, LOOKUP_NORMAL
);
955 /* Finish a qualified member function call using OBJECT and ARGS as
956 arguments to FN. Returns an expressino for the call. */
959 finish_qualified_object_call_expr (fn
, object
, args
)
964 if (IS_SIGNATURE (TREE_OPERAND (fn
, 0)))
966 warning ("signature name in scope resolution ignored");
967 return finish_object_call_expr (TREE_OPERAND (fn
, 1), object
, args
);
970 return build_scoped_method_call (object
, TREE_OPERAND (fn
, 0),
971 TREE_OPERAND (fn
, 1), args
);
974 /* Finish a pseudo-destructor call expression of OBJECT, with SCOPE
975 being the scope, if any, of DESTRUCTOR. Returns an expression for
979 finish_pseudo_destructor_call_expr (object
, scope
, destructor
)
984 if (scope
&& scope
!= destructor
)
985 cp_error ("destructor specifier `%T::~%T()' must have matching names",
988 if ((scope
== NULL_TREE
|| IDENTIFIER_GLOBAL_VALUE (destructor
))
989 && (TREE_CODE (TREE_TYPE (object
)) !=
990 TREE_CODE (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (destructor
)))))
991 cp_error ("`%E' is not of type `%T'", object
, destructor
);
993 return cp_convert (void_type_node
, object
);
996 /* Finish a call to a globally qualified member function FN using
997 ARGS. Returns an expression for the call. */
1000 finish_qualified_call_expr (fn
, args
)
1004 if (processing_template_decl
)
1005 return build_min_nt (CALL_EXPR
, copy_to_permanent (fn
), args
,
1008 return build_member_call (TREE_OPERAND (fn
, 0),
1009 TREE_OPERAND (fn
, 1),
1013 /* Finish an expression taking the address of LABEL. Returns an
1014 expression for the address. */
1017 finish_label_address_expr (label
)
1022 label
= lookup_label (label
);
1023 if (label
== NULL_TREE
)
1024 result
= null_pointer_node
;
1027 TREE_USED (label
) = 1;
1028 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
1029 TREE_CONSTANT (result
) = 1;
1035 /* Finish an expression of the form CODE EXPR. */
1038 finish_unary_op_expr (code
, expr
)
1039 enum tree_code code
;
1042 tree result
= build_x_unary_op (code
, expr
);
1043 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
)
1044 TREE_NEGATED_INT (result
) = 1;
1045 overflow_warning (result
);
1049 /* Finish an id-expression. */
1052 finish_id_expr (expr
)
1055 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
1056 expr
= do_identifier (expr
, 1, NULL_TREE
);
1061 /* Begin a new-placement. */
1064 begin_new_placement ()
1066 /* The arguments to a placement new might be passed to a
1067 deallocation function, in the event that the allocation throws an
1068 exception. Since we don't expand exception handlers until the
1069 end of a function, we must make sure the arguments stay around
1071 return suspend_momentary ();
1074 /* Finish a new-placement. The ARGS are the placement arguments. The
1075 COOKIE is the value returned by the previous call to
1076 begin_new_placement. */
1079 finish_new_placement (args
, cookie
)
1083 resume_momentary (cookie
);
1087 /* Begin a function defniition declared with DECL_SPECS and
1088 DECLARATOR. Returns non-zero if the function-declaration is
1092 begin_function_definition (decl_specs
, declarator
)
1098 split_specs_attrs (decl_specs
, &specs
, &attrs
);
1099 if (!start_function (specs
, declarator
, attrs
, 0))
1102 reinit_parse_for_function ();
1103 /* The things we're about to see are not directly qualified by any
1104 template headers we've seen thus far. */
1105 reset_specialization ();
1110 /* Begin a constructor declarator of the form `SCOPE::NAME'. Returns
1114 begin_constructor_declarator (scope
, name
)
1118 tree result
= build_parse_node (SCOPE_REF
, scope
, name
);
1119 enter_scope_of (result
);
1123 /* Finish an init-declarator. Returns a DECL. */
1126 finish_declarator (declarator
, declspecs
, attributes
,
1127 prefix_attributes
, initialized
)
1131 tree prefix_attributes
;
1134 return start_decl (declarator
, declspecs
, initialized
, attributes
,
1138 /* Finish a translation unit. */
1141 finish_translation_unit ()
1143 /* In case there were missing closebraces,
1144 get us back to the global binding level. */
1145 while (! toplevel_bindings_p ())
1147 while (current_namespace
!= global_namespace
)
1152 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
1153 Returns the parameter. */
1156 finish_template_type_parm (aggr
, identifier
)
1160 if (aggr
== signature_type_node
)
1161 sorry ("signature as template type parameter");
1162 else if (aggr
!= class_type_node
)
1164 pedwarn ("template type parameters must use the keyword `class' or `typename'");
1165 aggr
= class_type_node
;
1168 return build_tree_list (aggr
, identifier
);
1171 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
1172 Returns the parameter. */
1175 finish_template_template_parm (aggr
, identifier
)
1179 tree decl
= build_decl (TYPE_DECL
, identifier
, NULL_TREE
);
1180 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
1181 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
1182 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
1183 SET_DECL_ARTIFICIAL (decl
);
1184 end_template_decl ();
1186 return finish_template_type_parm (aggr
, tmpl
);
1189 /* Finish a parameter list, indicated by PARMS. If ELLIPSIS is
1190 non-zero, the parameter list was terminated by a `...'. */
1193 finish_parmlist (parms
, ellipsis
)
1198 chainon (parms
, void_list_node
);
1199 /* We mark the PARMS as a parmlist so that declarator processing can
1200 disambiguate certain constructs. */
1201 if (parms
!= NULL_TREE
)
1202 TREE_PARMLIST (parms
) = 1;
1207 /* Begin a class definition, as indicated by T. */
1210 begin_class_definition (t
)
1213 push_obstacks_nochange ();
1214 end_temporary_allocation ();
1216 if (t
== error_mark_node
1217 || ! IS_AGGR_TYPE (t
))
1219 t
= make_lang_type (RECORD_TYPE
);
1220 pushtag (make_anon_name (), t
, 0);
1223 /* In a definition of a member class template, we will get here with an
1224 implicit typename, a TYPENAME_TYPE with a type. */
1225 if (TREE_CODE (t
) == TYPENAME_TYPE
)
1228 /* If we generated a partial instantiation of this type, but now
1229 we're seeing a real definition, we're actually looking at a
1230 partial specialization. Consider:
1232 template <class T, class U>
1238 template <class T, class U>
1241 typename X<Y<T, U> >::A a;
1244 template <class T, class U>
1249 We have to undo the effects of the previous partial
1251 if (PARTIAL_INSTANTIATION_P (t
))
1255 /* Unfortunately, when we're not in pedantic mode, we
1256 attempt to actually fill in some of the fields of the
1257 partial instantiation, in order to support the implicit
1258 typename extension. Clear those fields now, in
1259 preparation for the definition here. The fields cleared
1260 here must match those set in instantiate_class_template.
1261 Look for a comment mentioning begin_class_definition
1263 TYPE_BINFO_BASETYPES (t
) = NULL_TREE
;
1264 TYPE_FIELDS (t
) = NULL_TREE
;
1265 TYPE_METHODS (t
) = NULL_TREE
;
1266 CLASSTYPE_TAGS (t
) = NULL_TREE
;
1267 TYPE_SIZE (t
) = NULL_TREE
;
1270 /* This isn't a partial instantiation any more. */
1271 PARTIAL_INSTANTIATION_P (t
) = 0;
1273 /* If this type was already complete, and we see another definition,
1275 else if (TYPE_SIZE (t
))
1276 duplicate_tag_error (t
);
1278 if (TYPE_BEING_DEFINED (t
))
1280 t
= make_lang_type (TREE_CODE (t
));
1281 pushtag (TYPE_IDENTIFIER (t
), t
, 0);
1283 maybe_process_partial_specialization (t
);
1284 if (processing_template_decl
1285 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (t
)
1286 && TYPE_CONTEXT (t
) && TYPE_P (TYPE_CONTEXT (t
))
1287 && ! current_class_type
)
1288 push_template_decl (TYPE_STUB_DECL (t
));
1290 TYPE_BEING_DEFINED (t
) = 1;
1291 /* Reset the interface data, at the earliest possible
1292 moment, as it might have been set via a class foo;
1294 /* Don't change signatures. */
1295 if (! IS_SIGNATURE (t
))
1298 tree name
= TYPE_IDENTIFIER (t
);
1300 if (! ANON_AGGRNAME_P (name
))
1302 CLASSTYPE_INTERFACE_ONLY (t
) = interface_only
;
1303 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
1304 (t
, interface_unknown
);
1307 /* Record how to set the access of this class's
1308 virtual functions. If write_virtuals == 3, then
1309 inline virtuals are ``extern inline''. */
1310 if (write_virtuals
== 3)
1311 needs_writing
= ! CLASSTYPE_INTERFACE_ONLY (t
)
1312 && CLASSTYPE_INTERFACE_KNOWN (t
);
1315 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = needs_writing
;
1318 tmp
= TYPE_IDENTIFIER ($
<ttype
>0);
1319 if (tmp
&& IDENTIFIER_TEMPLATE (tmp
))
1320 overload_template_name (tmp
, 1);
1322 reset_specialization();
1324 /* In case this is a local class within a template
1325 function, we save the current tree structure so
1326 that we can get it back later. */
1332 /* Finish the member declaration given by DECL. */
1335 finish_member_declaration (decl
)
1338 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
1341 if (decl
== void_type_node
)
1342 /* The COMPONENT was a friend, not a member, and so there's
1343 nothing for us to do. */
1346 /* We should see only one DECL at a time. */
1347 my_friendly_assert (TREE_CHAIN (decl
) == NULL_TREE
, 0);
1349 /* Set up access control for DECL. */
1351 = (current_access_specifier
== access_private_node
);
1352 TREE_PROTECTED (decl
)
1353 = (current_access_specifier
== access_protected_node
);
1354 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
1356 TREE_PRIVATE (DECL_RESULT (decl
)) = TREE_PRIVATE (decl
);
1357 TREE_PROTECTED (DECL_RESULT (decl
)) = TREE_PROTECTED (decl
);
1360 /* Mark the DECL as a member of the current class. */
1361 if (TREE_CODE (decl
) == FUNCTION_DECL
1362 || DECL_FUNCTION_TEMPLATE_P (decl
))
1363 /* Historically, DECL_CONTEXT was not set for a FUNCTION_DECL in
1364 finish_struct. Presumably it is already set as the function is
1365 parsed. Perhaps DECL_CLASS_CONTEXT is already set, too? */
1366 DECL_CLASS_CONTEXT (decl
) = current_class_type
;
1367 else if (TREE_CODE (decl
) == TYPE_DECL
)
1368 /* Historically, DECL_CONTEXT was not set for a TYPE_DECL in
1369 finish_struct, so we do not do it here either. Perhaps we
1373 DECL_CONTEXT (decl
) = current_class_type
;
1375 /* Put functions on the TYPE_METHODS list and everything else on the
1376 TYPE_FIELDS list. Note that these are built up in reverse order.
1377 We reverse them (to obtain declaration order) in finish_struct. */
1378 if (TREE_CODE (decl
) == FUNCTION_DECL
1379 || DECL_FUNCTION_TEMPLATE_P (decl
))
1381 /* We also need to add this function to the
1382 CLASSTYPE_METHOD_VEC. */
1383 add_method (current_class_type
, 0, decl
);
1385 TREE_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
1386 TYPE_METHODS (current_class_type
) = decl
;
1390 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
1391 go at the beginning. The reason is that lookup_field_1
1392 searches the list in order, and we want a field name to
1393 override a type name so that the "struct stat hack" will
1394 work. In particular:
1396 struct S { enum E { }; int E } s;
1399 is legal. In addition, the FIELD_DECLs must be maintained in
1400 declaration order so that class layout works as expected.
1401 However, we don't need that order until class layout, so we
1402 save a little time by putting FIELD_DECLs on in reverse order
1403 here, and then reversing them in finish_struct_1. (We could
1404 also keep a pointer to the correct insertion points in the
1407 if (TREE_CODE (decl
) == TYPE_DECL
)
1408 TYPE_FIELDS (current_class_type
)
1409 = chainon (TYPE_FIELDS (current_class_type
), decl
);
1412 TREE_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
1413 TYPE_FIELDS (current_class_type
) = decl
;
1418 /* Finish a class definition T with the indicate ATTRIBUTES. If SEMI,
1419 the definition is immediately followed by a semicolon. Returns the
1423 finish_class_definition (t
, attributes
, semi
)
1429 /* Need to rework class nesting in the presence of nested classes,
1431 shadow_tag (CLASSTYPE_AS_LIST (t
)); */
1434 /* finish_struct nukes this anyway; if finish_exception does too,
1437 note_got_semicolon (t
);
1439 /* If we got any attributes in class_head, xref_tag will stick them in
1440 TREE_TYPE of the type. Grab them now. */
1441 attributes
= chainon (TREE_TYPE (t
), attributes
);
1442 TREE_TYPE (t
) = NULL_TREE
;
1444 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
1448 t
= finish_struct (t
, attributes
, semi
);
1450 note_got_semicolon (t
);
1456 check_for_missing_semicolon (t
);
1457 if (current_scope () == current_function_decl
)
1458 do_pending_defargs ();
1463 /* Finish processing the default argument expressions cached during
1464 the processing of a class definition. */
1467 finish_default_args ()
1470 && current_scope () == current_function_decl
)
1471 do_pending_inlines ();
1474 /* Finish processing the inline function definitions cached during the
1475 processing of a class definition. */
1478 begin_inline_definitions ()
1480 if (current_class_type
== NULL_TREE
)
1481 clear_inline_text_obstack ();
1483 /* Undo the begin_tree in begin_class_definition. */
1487 /* Finish processing the declaration of a member class template
1488 TYPES whose template parameters are given by PARMS. */
1491 finish_member_class_template (types
)
1496 /* If there are declared, but undefined, partial specializations
1497 mixed in with the typespecs they will not yet have passed through
1498 maybe_process_partial_specialization, so we do that here. */
1499 for (t
= types
; t
!= NULL_TREE
; t
= TREE_CHAIN (t
))
1500 if (IS_AGGR_TYPE_CODE (TREE_CODE (TREE_VALUE (t
))))
1501 maybe_process_partial_specialization (TREE_VALUE (t
));
1503 note_list_got_semicolon (types
);
1504 grok_x_components (types
);
1505 if (TYPE_CONTEXT (TREE_VALUE (types
)) != current_class_type
)
1506 /* The component was in fact a friend declaration. We avoid
1507 finish_member_template_decl performing certain checks by
1511 finish_member_template_decl (types
);
1513 /* As with other component type declarations, we do
1514 not store the new DECL on the list of
1519 /* Finish processsing a complete template declaration. The PARMS are
1520 the template parameters. */
1523 finish_template_decl (parms
)
1527 end_template_decl ();
1529 end_specialization ();
1532 /* Finish processing a a template-id (which names a type) of the form
1533 NAME < ARGS >. Return the TYPE_DECL for the type named by the
1534 template-id. If ENTERING_SCOPE is non-zero we are about to enter
1535 the scope of template-id indicated. */
1538 finish_template_type (name
, args
, entering_scope
)
1545 decl
= lookup_template_class (name
, args
,
1546 NULL_TREE
, NULL_TREE
, entering_scope
);
1547 if (decl
!= error_mark_node
)
1548 decl
= TYPE_STUB_DECL (decl
);
1553 /* SR is a SCOPE_REF node. Enter the scope of SR, whether it is a
1554 namespace scope or a class scope. */
1560 tree scope
= TREE_OPERAND (sr
, 0);
1562 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
1564 push_decl_namespace (scope
);
1565 TREE_COMPLEXITY (sr
) = -1;
1567 else if (scope
!= current_class_type
)
1569 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
1571 /* In a declarator for a template class member, the scope will
1572 get here as an implicit typename, a TYPENAME_TYPE with a type. */
1573 scope
= TREE_TYPE (scope
);
1574 TREE_OPERAND (sr
, 0) = scope
;
1576 push_nested_class (scope
, 3);
1577 TREE_COMPLEXITY (sr
) = current_class_depth
;
1581 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
1582 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
1583 BASE_CLASS, or NULL_TREE if an error occurred. The
1584 ACCESSS_SPECIFIER is one of
1585 access_{default,public,protected_private}[_virtual]_node.*/
1588 finish_base_specifier (access_specifier
, base_class
,
1589 current_aggr_is_signature
)
1590 tree access_specifier
;
1592 int current_aggr_is_signature
;
1597 if (base_class
== NULL_TREE
)
1599 error ("invalid base class");
1600 type
= error_mark_node
;
1603 type
= TREE_TYPE (base_class
);
1604 if (current_aggr_is_signature
&& access_specifier
)
1605 error ("access and source specifiers not allowed in signature");
1606 if (! is_aggr_type (type
, 1))
1608 else if (current_aggr_is_signature
1609 && (! type
) && (! IS_SIGNATURE (type
)))
1611 error ("class name not allowed as base signature");
1614 else if (current_aggr_is_signature
)
1616 sorry ("signature inheritance, base type `%s' ignored",
1617 IDENTIFIER_POINTER (access_specifier
));
1618 result
= build_tree_list (access_public_node
, type
);
1620 else if (type
&& IS_SIGNATURE (type
))
1622 error ("signature name not allowed as base class");
1626 result
= build_tree_list (access_specifier
, type
);
1631 /* Called when multiple declarators are processed. If that is not
1632 premitted in this context, an error is issued. */
1635 check_multiple_declarators ()
1639 In a template-declaration, explicit specialization, or explicit
1640 instantiation the init-declarator-list in the declaration shall
1641 contain at most one declarator.
1643 We don't just use PROCESSING_TEMPLATE_DECL for the first
1644 condition since that would disallow the perfectly legal code,
1645 like `template <class T> struct S { int i, j; };'. */
1646 tree scope
= current_scope ();
1648 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
1649 /* It's OK to write `template <class T> void f() { int i, j;}'. */
1652 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
1653 || processing_explicit_instantiation
1654 || processing_specialization
)
1655 cp_error ("multiple declarators in template declaration");
1659 finish_typeof (expr
)
1662 if (processing_template_decl
)
1666 push_obstacks_nochange ();
1667 end_temporary_allocation ();
1669 t
= make_lang_type (TYPEOF_TYPE
);
1670 TYPE_FIELDS (t
) = expr
;
1677 return TREE_TYPE (expr
);