1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
48 extern int (*valid_lang_attribute
) PARAMS ((tree
, tree
, tree
, tree
));
50 #ifndef BOOL_TYPE_SIZE
51 /* In the new ABI, `bool' has size and alignment `1', on all
53 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
56 static tree grokparms
PARAMS ((tree
));
57 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
59 static void push_binding_level
PARAMS ((struct binding_level
*, int,
61 static void pop_binding_level
PARAMS ((void));
62 static void suspend_binding_level
PARAMS ((void));
63 static void resume_binding_level
PARAMS ((struct binding_level
*));
64 static struct binding_level
*make_binding_level
PARAMS ((void));
65 static void declare_namespace_level
PARAMS ((void));
66 static int decl_jump_unsafe
PARAMS ((tree
));
67 static void storedecls
PARAMS ((tree
));
68 static void require_complete_types_for_parms
PARAMS ((tree
));
69 static int ambi_op_p
PARAMS ((enum tree_code
));
70 static int unary_op_p
PARAMS ((enum tree_code
));
71 static tree store_bindings
PARAMS ((tree
, tree
));
72 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
73 static tree obscure_complex_init
PARAMS ((tree
, tree
));
74 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
75 static void push_local_name
PARAMS ((tree
));
76 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
77 static tree grok_reference_init
PARAMS ((tree
, tree
, tree
));
78 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
79 enum overload_flags
, tree
,
80 tree
, int, int, int, int, int, int, tree
));
81 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
82 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
83 struct binding_level
*, int));
84 static void set_identifier_type_value_with_scope
85 PARAMS ((tree
, tree
, struct binding_level
*));
86 static void record_unknown_type
PARAMS ((tree
, const char *));
87 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
88 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
89 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
91 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
92 static void check_for_uninitialized_const_var
PARAMS ((tree
));
93 static unsigned long typename_hash
PARAMS ((hash_table_key
));
94 static bool typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
95 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
96 static int add_binding
PARAMS ((tree
, tree
));
97 static void pop_binding
PARAMS ((tree
, tree
));
98 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
99 static tree find_binding
PARAMS ((tree
, tree
));
100 static tree select_decl
PARAMS ((tree
, int));
101 static int lookup_flags
PARAMS ((int, int));
102 static tree qualify_lookup
PARAMS ((tree
, int));
103 static tree record_builtin_java_type
PARAMS ((const char *, int));
104 static const char *tag_name
PARAMS ((enum tag_types code
));
105 static void find_class_binding_level
PARAMS ((void));
106 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
107 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
108 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
109 static int walk_globals_r
PARAMS ((tree
, void *));
110 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
111 static tree make_label_decl
PARAMS ((tree
, int));
112 static void use_label
PARAMS ((tree
));
113 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
115 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
116 static void check_switch_goto
PARAMS ((struct binding_level
*));
117 static void check_previous_gotos
PARAMS ((tree
));
118 static void pop_label
PARAMS ((tree
, tree
));
119 static void pop_labels
PARAMS ((tree
));
120 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
121 static void layout_var_decl
PARAMS ((tree
));
122 static void maybe_commonize_var
PARAMS ((tree
));
123 static tree check_initializer
PARAMS ((tree
, tree
));
124 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
125 static void push_cp_function_context
PARAMS ((struct function
*));
126 static void pop_cp_function_context
PARAMS ((struct function
*));
127 static void mark_binding_level
PARAMS ((void *));
128 static void mark_named_label_lists
PARAMS ((void *, void *));
129 static void mark_cp_function_context
PARAMS ((struct function
*));
130 static void mark_saved_scope
PARAMS ((void *));
131 static void mark_lang_function
PARAMS ((struct cp_language_function
*));
132 static void save_function_data
PARAMS ((tree
));
133 static void check_function_type
PARAMS ((tree
, tree
));
134 static void destroy_local_var
PARAMS ((tree
));
135 static void finish_constructor_body
PARAMS ((void));
136 static void finish_destructor_body
PARAMS ((void));
137 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
138 static tree get_atexit_node
PARAMS ((void));
139 static tree get_dso_handle_node
PARAMS ((void));
140 static tree start_cleanup_fn
PARAMS ((void));
141 static void end_cleanup_fn
PARAMS ((void));
142 static tree cp_make_fname_decl
PARAMS ((tree
, int));
143 static void initialize_predefined_identifiers
PARAMS ((void));
144 static tree check_special_function_return_type
145 PARAMS ((special_function_kind
, tree
, tree
));
146 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
147 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
148 static void store_parm_decls
PARAMS ((tree
));
149 static int cp_missing_noreturn_ok_p
PARAMS ((tree
));
151 #if defined (DEBUG_CP_BINDING_LEVELS)
152 static void indent
PARAMS ((void));
155 /* Erroneous argument lists can use this *IFF* they do not modify it. */
156 tree error_mark_list
;
158 /* The following symbols are subsumed in the cp_global_trees array, and
159 listed here individually for documentation purposes.
162 tree wchar_decl_node;
164 tree vtable_entry_type;
165 tree delta_type_node;
168 tree __baselist_desc_type_node;
169 tree __i_desc_type_node, __m_desc_type_node;
170 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
172 tree __t_desc_type_node;
174 tree __tp_desc_type_node;
176 tree ti_desc_type_node;
177 tree bltn_desc_type_node, ptr_desc_type_node;
178 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
179 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
180 tree ptm_desc_type_node;
181 tree base_desc_type_node;
183 Not needed yet? May be needed one day?
184 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
185 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
186 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
189 tree class_type_node, record_type_node, union_type_node, enum_type_node;
190 tree unknown_type_node;
192 Array type `vtable_entry_type[]'
195 tree vtbl_ptr_type_node;
202 A FUNCTION_DECL which can call `abort'. Not necessarily the
203 one that the user will declare, but sufficient to be called
204 by routines that want to abort the program.
208 The FUNCTION_DECL for the default `::operator delete'.
210 tree global_delete_fndecl;
213 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
218 tree cp_global_trees
[CPTI_MAX
];
220 /* Indicates that there is a type value in some namespace, although
221 that is not necessarily in scope at the moment. */
223 static tree global_type_node
;
225 /* If non-zero, this is the number of times we have entered the `std'
226 namespace when we are treating that namespace as an alias for the
228 static int in_fake_std
;
230 /* Expect only namespace names now. */
231 static int only_namespace_names
;
233 /* Used only for jumps to as-yet undefined labels, since jumps to
234 defined labels can have their validity checked immediately. */
236 struct named_label_use_list
238 struct binding_level
*binding_level
;
241 const char *filename_o_goto
;
243 struct named_label_use_list
*next
;
246 #define named_label_uses cp_function_chain->x_named_label_uses
248 #define local_names cp_function_chain->x_local_names
250 /* A list of objects which have constructors or destructors
251 which reside in the global scope. The decl is stored in
252 the TREE_VALUE slot and the initializer is stored
253 in the TREE_PURPOSE slot. */
254 tree static_aggregates
;
258 /* A node for the integer constants 2, and 3. */
260 tree integer_two_node
, integer_three_node
;
262 /* Parsing a function declarator leaves here a chain of structure
263 and enum types declared in the parmlist. */
265 static tree last_function_parm_tags
;
267 /* Similar, for last_function_parm_tags. */
268 tree last_function_parms
;
269 static tree current_function_parm_tags
;
271 /* A list of all LABEL_DECLs in the function that have names. Here so
272 we can clear out their names' definitions at the end of the
273 function, and so we can check the validity of jumps to these labels. */
275 struct named_label_list
277 struct binding_level
*binding_level
;
282 struct named_label_list
*next
;
283 unsigned int in_try_scope
: 1;
284 unsigned int in_catch_scope
: 1;
287 #define named_labels cp_function_chain->x_named_labels
289 /* Nonzero means use the ISO C94 dialect of C. */
293 /* Nonzero means use the ISO C99 dialect of C. */
297 /* Nonzero means we are a hosted implementation for code shared with C. */
301 /* Nonzero means add default format_arg attributes for functions not
304 int flag_noniso_default_format_attributes
= 1;
306 /* Nonzero if we want to conserve space in the .o files. We do this
307 by putting uninitialized data and runtime initialized data into
308 .common instead of .data at the expense of not flagging multiple
310 extern int flag_conserve_space
;
312 /* C and C++ flags are in decl2.c. */
314 /* Flag used when debugging spew.c */
316 extern int spew_debug
;
318 /* A expression of value 0 with the same precision as a sizetype
320 tree signed_size_zero_node
;
322 /* The name of the anonymous namespace, throughout this translation
324 tree anonymous_namespace_name
;
326 /* The number of function bodies which we are currently processing.
327 (Zero if we are at namespace scope, one inside the body of a
328 function, two inside the body of a function in a local class, etc.) */
331 /* For each binding contour we allocate a binding_level structure
332 which records the names defined in that contour.
335 1) one for each function definition,
336 where internal declarations of the parameters appear.
337 2) one for each compound statement,
338 to record its declarations.
340 The current meaning of a name can be found by searching the levels
341 from the current one out to the global one.
343 Off to the side, may be the class_binding_level. This exists only
344 to catch class-local declarations. It is otherwise nonexistent.
346 Also there may be binding levels that catch cleanups that must be
347 run when exceptions occur. Thus, to see whether a name is bound in
348 the current scope, it is not enough to look in the
349 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
352 /* Note that the information in the `names' component of the global contour
353 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
357 /* A chain of _DECL nodes for all variables, constants, functions,
358 and typedef types. These are in the reverse of the order
359 supplied. There may be OVERLOADs on this list, too, but they
360 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
363 /* A list of structure, union and enum definitions, for looking up
365 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
366 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
367 or ENUMERAL_TYPE node.
369 C++: the TREE_VALUE nodes can be simple types for
370 component_bindings. */
373 /* A list of USING_DECL nodes. */
376 /* A list of used namespaces. PURPOSE is the namespace,
377 VALUE the common ancestor with this binding_level's namespace. */
378 tree using_directives
;
380 /* If this binding level is the binding level for a class, then
381 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
382 is the name of an entity bound in the class. The TREE_TYPE is
383 the DECL bound by this name in the class. */
386 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
387 is used for all binding levels. In addition the TREE_VALUE is the
388 IDENTIFIER_TYPE_VALUE before we entered the class. */
391 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
392 label in this scope. The TREE_PURPOSE is the previous value of
393 the IDENTIFIER_LABEL VALUE. */
394 tree shadowed_labels
;
396 /* For each level (except not the global one),
397 a chain of BLOCK nodes for all the levels
398 that were entered and exited one level down. */
401 /* The _TYPE node for this level, if parm_flag == 2. */
404 /* The binding level which this one is contained in (inherits from). */
405 struct binding_level
*level_chain
;
407 /* List of decls in `names' that have incomplete
408 structure or union types. */
411 /* List of VAR_DECLS saved from a previous for statement.
412 These would be dead in ISO-conforming code, but might
413 be referenced in ARM-era code. These are stored in a
414 TREE_LIST; the TREE_VALUE is the actual declaration. */
415 tree dead_vars_from_for
;
417 /* 1 for the level that holds the parameters of a function.
418 2 for the level that holds a class declaration. */
419 unsigned parm_flag
: 2;
421 /* 1 means make a BLOCK for this level regardless of all else.
422 2 for temporary binding contours created by the compiler. */
425 /* Nonzero if this level "doesn't exist" for tags. */
426 unsigned tag_transparent
: 1;
428 /* Nonzero if this level can safely have additional
429 cleanup-needing variables added to it. */
430 unsigned more_cleanups_ok
: 1;
431 unsigned have_cleanups
: 1;
433 /* Nonzero if this scope is for storing the decls for template
434 parameters and generic decls; these decls will be discarded and
435 replaced with a TEMPLATE_DECL. */
436 unsigned template_parms_p
: 1;
438 /* Nonzero if this scope corresponds to the `<>' in a
439 `template <>' clause. Whenever this flag is set,
440 TEMPLATE_PARMS_P will be set as well. */
441 unsigned template_spec_p
: 1;
443 /* This is set for a namespace binding level. */
444 unsigned namespace_p
: 1;
446 /* True if this level is that of a for-statement where we need to
447 worry about ambiguous (ARM or ISO) scope rules. */
448 unsigned is_for_scope
: 1;
450 /* True if this level corresponds to a TRY block. Currently this
451 information is only available while building the tree structure. */
452 unsigned is_try_scope
: 1;
454 /* True if this level corresponds to a CATCH block. Currently this
455 information is only available while building the tree structure. */
456 unsigned is_catch_scope
: 1;
458 /* Three bits left for this word. */
460 #if defined(DEBUG_CP_BINDING_LEVELS)
461 /* Binding depth at which this level began. */
462 unsigned binding_depth
;
463 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
466 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
468 /* The binding level currently in effect. */
470 #define current_binding_level \
471 (cfun && cp_function_chain->bindings \
472 ? cp_function_chain->bindings \
473 : scope_chain->bindings)
475 /* The binding level of the current class, if any. */
477 #define class_binding_level scope_chain->class_bindings
479 /* A chain of binding_level structures awaiting reuse. */
481 static struct binding_level
*free_binding_level
;
483 /* The outermost binding level, for names of file scope.
484 This is created when the compiler is started and exists
485 through the entire run. */
487 static struct binding_level
*global_binding_level
;
489 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
491 static int keep_next_level_flag
;
493 #if defined(DEBUG_CP_BINDING_LEVELS)
494 static int binding_depth
= 0;
495 static int is_class_level
= 0;
502 for (i
= 0; i
< binding_depth
*2; i
++)
505 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
507 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
510 push_binding_level (newlevel
, tag_transparent
, keep
)
511 struct binding_level
*newlevel
;
512 int tag_transparent
, keep
;
514 /* Add this level to the front of the chain (stack) of levels that
516 memset ((char*) newlevel
, 0, sizeof (struct binding_level
));
517 newlevel
->level_chain
= current_binding_level
;
518 current_binding_level
= newlevel
;
519 newlevel
->tag_transparent
= tag_transparent
;
520 newlevel
->more_cleanups_ok
= 1;
522 newlevel
->keep
= keep
;
523 #if defined(DEBUG_CP_BINDING_LEVELS)
524 newlevel
->binding_depth
= binding_depth
;
526 fprintf (stderr
, "push %s level 0x%08x line %d\n",
527 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
530 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
533 /* Find the innermost enclosing class scope, and reset
534 CLASS_BINDING_LEVEL appropriately. */
537 find_class_binding_level ()
539 struct binding_level
*level
= current_binding_level
;
541 while (level
&& level
->parm_flag
!= 2)
542 level
= level
->level_chain
;
543 if (level
&& level
->parm_flag
== 2)
544 class_binding_level
= level
;
546 class_binding_level
= 0;
552 if (global_binding_level
)
554 /* Cannot pop a level, if there are none left to pop. */
555 if (current_binding_level
== global_binding_level
)
556 my_friendly_abort (123);
558 /* Pop the current level, and free the structure for reuse. */
559 #if defined(DEBUG_CP_BINDING_LEVELS)
562 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
563 (is_class_level
) ? "class" : "block",
564 current_binding_level
, lineno
);
565 if (is_class_level
!= (current_binding_level
== class_binding_level
))
568 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
571 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
573 register struct binding_level
*level
= current_binding_level
;
574 current_binding_level
= current_binding_level
->level_chain
;
575 level
->level_chain
= free_binding_level
;
576 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
577 if (level
->binding_depth
!= binding_depth
)
579 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
580 free_binding_level
= level
;
581 find_class_binding_level ();
586 suspend_binding_level ()
588 if (class_binding_level
)
589 current_binding_level
= class_binding_level
;
591 if (global_binding_level
)
593 /* Cannot suspend a level, if there are none left to suspend. */
594 if (current_binding_level
== global_binding_level
)
595 my_friendly_abort (123);
597 /* Suspend the current level. */
598 #if defined(DEBUG_CP_BINDING_LEVELS)
601 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
602 (is_class_level
) ? "class" : "block",
603 current_binding_level
, lineno
);
604 if (is_class_level
!= (current_binding_level
== class_binding_level
))
607 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
610 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
611 current_binding_level
= current_binding_level
->level_chain
;
612 find_class_binding_level ();
616 resume_binding_level (b
)
617 struct binding_level
*b
;
619 /* Resuming binding levels is meant only for namespaces,
620 and those cannot nest into classes. */
621 my_friendly_assert(!class_binding_level
, 386);
622 /* Also, resuming a non-directly nested namespace is a no-no. */
623 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
624 current_binding_level
= b
;
625 #if defined(DEBUG_CP_BINDING_LEVELS)
626 b
->binding_depth
= binding_depth
;
628 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
629 (is_class_level
) ? "class" : "block", b
, lineno
);
632 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
635 /* Create a new `struct binding_level'. */
638 struct binding_level
*
639 make_binding_level ()
642 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
645 /* Nonzero if we are currently in the global binding level. */
650 return current_binding_level
== global_binding_level
;
653 /* Return the innermost binding level that is not for a class scope. */
655 static struct binding_level
*
656 innermost_nonclass_level ()
658 struct binding_level
*b
;
660 b
= current_binding_level
;
661 while (b
->parm_flag
== 2)
667 /* Nonzero if we are currently in a toplevel binding level. This
668 means either the global binding level or a namespace in a toplevel
669 binding level. Since there are no non-toplevel namespace levels,
670 this really means any namespace or template parameter level. We
671 also include a class whose context is toplevel. */
674 toplevel_bindings_p ()
676 struct binding_level
*b
= innermost_nonclass_level ();
678 return b
->namespace_p
|| b
->template_parms_p
;
681 /* Nonzero if this is a namespace scope, or if we are defining a class
682 which is itself at namespace scope, or whose enclosing class is
683 such a class, etc. */
686 namespace_bindings_p ()
688 struct binding_level
*b
= innermost_nonclass_level ();
690 return b
->namespace_p
;
693 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
694 unconditionally. Otherwise, use the normal logic to decide whether
695 or not to create a BLOCK. */
698 keep_next_level (keep
)
701 keep_next_level_flag
= keep
;
704 /* Nonzero if the current level needs to have a BLOCK made. */
709 return (current_binding_level
->blocks
!= NULL_TREE
710 || current_binding_level
->keep
711 || current_binding_level
->names
!= NULL_TREE
712 || (current_binding_level
->tags
!= NULL_TREE
713 && !current_binding_level
->tag_transparent
));
717 declare_namespace_level ()
719 current_binding_level
->namespace_p
= 1;
722 /* Returns non-zero if this scope was created to store template
726 template_parm_scope_p ()
728 return current_binding_level
->template_parms_p
;
731 /* Returns the kind of template specialization we are currently
732 processing, given that it's declaration contained N_CLASS_SCOPES
733 explicit scope qualifications. */
736 current_tmpl_spec_kind (n_class_scopes
)
739 int n_template_parm_scopes
= 0;
740 int seen_specialization_p
= 0;
741 int innermost_specialization_p
= 0;
742 struct binding_level
*b
;
744 /* Scan through the template parameter scopes. */
745 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
747 /* If we see a specialization scope inside a parameter scope,
748 then something is wrong. That corresponds to a declaration
751 template <class T> template <> ...
753 which is always illegal since [temp.expl.spec] forbids the
754 specialization of a class member template if the enclosing
755 class templates are not explicitly specialized as well. */
756 if (b
->template_spec_p
)
758 if (n_template_parm_scopes
== 0)
759 innermost_specialization_p
= 1;
761 seen_specialization_p
= 1;
763 else if (seen_specialization_p
== 1)
764 return tsk_invalid_member_spec
;
766 ++n_template_parm_scopes
;
769 /* Handle explicit instantiations. */
770 if (processing_explicit_instantiation
)
772 if (n_template_parm_scopes
!= 0)
773 /* We've seen a template parameter list during an explicit
774 instantiation. For example:
776 template <class T> template void f(int);
778 This is erroneous. */
779 return tsk_invalid_expl_inst
;
781 return tsk_expl_inst
;
784 if (n_template_parm_scopes
< n_class_scopes
)
785 /* We've not seen enough template headers to match all the
786 specialized classes present. For example:
788 template <class T> void R<T>::S<T>::f(int);
790 This is illegal; there needs to be one set of template
791 parameters for each class. */
792 return tsk_insufficient_parms
;
793 else if (n_template_parm_scopes
== n_class_scopes
)
794 /* We're processing a non-template declaration (even though it may
795 be a member of a template class.) For example:
797 template <class T> void S<T>::f(int);
799 The `class T' maches the `S<T>', leaving no template headers
800 corresponding to the `f'. */
802 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
803 /* We've got too many template headers. For example:
805 template <> template <class T> void f (T);
807 There need to be more enclosing classes. */
808 return tsk_excessive_parms
;
810 /* This must be a template. It's of the form:
812 template <class T> template <class U> void S<T>::f(U);
814 This is a specialization if the innermost level was a
815 specialization; otherwise it's just a definition of the
817 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
821 set_class_shadows (shadows
)
824 class_binding_level
->class_shadowed
= shadows
;
827 /* Enter a new binding level.
828 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
829 not for that of tags. */
832 pushlevel (tag_transparent
)
835 struct binding_level
*newlevel
;
837 if (cfun
&& !doing_semantic_analysis_p ())
840 /* Reuse or create a struct for this binding level. */
841 #if defined(DEBUG_CP_BINDING_LEVELS)
843 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
844 if (free_binding_level
)
845 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
847 newlevel
= free_binding_level
;
848 free_binding_level
= free_binding_level
->level_chain
;
851 newlevel
= make_binding_level ();
853 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
854 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
855 keep_next_level_flag
= 0;
858 /* We're defining an object of type TYPE. If it needs a cleanup, but
859 we're not allowed to add any more objects with cleanups to the current
860 scope, create a new binding level. */
863 maybe_push_cleanup_level (type
)
866 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
867 && current_binding_level
->more_cleanups_ok
== 0)
872 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
876 /* Enter a new scope. The KIND indicates what kind of scope is being
887 case sk_template_spec
:
888 current_binding_level
->template_spec_p
= 1;
891 case sk_template_parms
:
892 current_binding_level
->template_parms_p
= 1;
896 my_friendly_abort (20000309);
900 /* Exit the current scope. */
909 note_level_for_for ()
911 current_binding_level
->is_for_scope
= 1;
914 /* Record that the current binding level represents a try block. */
917 note_level_for_try ()
919 current_binding_level
->is_try_scope
= 1;
922 /* Record that the current binding level represents a catch block. */
925 note_level_for_catch ()
927 current_binding_level
->is_catch_scope
= 1;
930 /* For a binding between a name and an entity at a block scope,
931 this is the `struct binding_level' for the block. */
932 #define BINDING_LEVEL(NODE) \
933 (((struct tree_binding*)NODE)->scope.level)
935 /* A free list of CPLUS_BINDING nodes, connected by their
938 static tree free_bindings
;
940 /* Make DECL the innermost binding for ID. The LEVEL is the binding
941 level at which this declaration is being bound. */
944 push_binding (id
, decl
, level
)
947 struct binding_level
* level
;
953 binding
= free_bindings
;
954 free_bindings
= TREE_CHAIN (binding
);
957 binding
= make_node (CPLUS_BINDING
);
959 /* Now, fill in the binding information. */
960 BINDING_VALUE (binding
) = decl
;
961 BINDING_TYPE (binding
) = NULL_TREE
;
962 BINDING_LEVEL (binding
) = level
;
963 INHERITED_VALUE_BINDING_P (binding
) = 0;
964 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
965 BINDING_HAS_LEVEL_P (binding
) = 1;
967 /* And put it on the front of the list of bindings for ID. */
968 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
969 IDENTIFIER_BINDING (id
) = binding
;
972 /* ID is already bound in the current scope. But, DECL is an
973 additional binding for ID in the same scope. This is the `struct
974 stat' hack whereby a non-typedef class-name or enum-name can be
975 bound at the same level as some other kind of entity. It's the
976 responsibility of the caller to check that inserting this name is
977 legal here. Returns nonzero if the new binding was successful. */
979 add_binding (id
, decl
)
983 tree binding
= IDENTIFIER_BINDING (id
);
986 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
987 /* The new name is the type name. */
988 BINDING_TYPE (binding
) = decl
;
989 else if (!BINDING_VALUE (binding
))
990 /* This situation arises when push_class_level_binding moves an
991 inherited type-binding out of the way to make room for a new
993 BINDING_VALUE (binding
) = decl
;
994 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
995 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
997 /* The old binding was a type name. It was placed in
998 BINDING_VALUE because it was thought, at the point it was
999 declared, to be the only entity with such a name. Move the
1000 type name into the type slot; it is now hidden by the new
1002 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1003 BINDING_VALUE (binding
) = decl
;
1004 INHERITED_VALUE_BINDING_P (binding
) = 0;
1006 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1007 && TREE_CODE (decl
) == TYPE_DECL
1008 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1009 && same_type_p (TREE_TYPE (decl
),
1010 TREE_TYPE (BINDING_VALUE (binding
))))
1011 /* We have two typedef-names, both naming the same type to have
1012 the same name. This is OK because of:
1016 In a given scope, a typedef specifier can be used to redefine
1017 the name of any type declared in that scope to refer to the
1018 type to which it already refers. */
1020 /* There can be two block-scope declarations of the same variable,
1021 so long as they are `extern' declarations. */
1022 else if (TREE_CODE (decl
) == VAR_DECL
1023 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1024 && DECL_EXTERNAL (decl
)
1025 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1027 duplicate_decls (decl
, BINDING_VALUE (binding
));
1032 cp_error ("declaration of `%#D'", decl
);
1033 cp_error_at ("conflicts with previous declaration `%#D'",
1034 BINDING_VALUE (binding
));
1041 /* Add DECL to the list of things declared in B. */
1044 add_decl_to_level (decl
, b
)
1046 struct binding_level
*b
;
1048 /* We build up the list in reverse order, and reverse it later if
1050 TREE_CHAIN (decl
) = b
->names
;
1054 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1055 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1056 doesn't really belong to this binding level, that it got here
1057 through a using-declaration. */
1060 push_local_binding (id
, decl
, flags
)
1065 struct binding_level
*b
;
1067 /* Skip over any local classes. This makes sense if we call
1068 push_local_binding with a friend decl of a local class. */
1069 b
= current_binding_level
;
1070 while (b
->parm_flag
== 2)
1073 if (lookup_name_current_level (id
))
1075 /* Supplement the existing binding. */
1076 if (!add_binding (id
, decl
))
1077 /* It didn't work. Something else must be bound at this
1078 level. Do not add DECL to the list of things to pop
1083 /* Create a new binding. */
1084 push_binding (id
, decl
, b
);
1086 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1087 /* We must put the OVERLOAD into a TREE_LIST since the
1088 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1089 decls that got here through a using-declaration. */
1090 decl
= build_tree_list (NULL_TREE
, decl
);
1092 /* And put DECL on the list of things declared by the current
1094 add_decl_to_level (decl
, b
);
1097 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1098 binding was successful. */
1101 push_class_binding (id
, decl
)
1106 tree binding
= IDENTIFIER_BINDING (id
);
1109 /* Note that we declared this value so that we can issue an error if
1110 this an illegal redeclaration of a name already used for some
1112 note_name_declared_in_class (id
, decl
);
1114 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1115 /* Supplement the existing binding. */
1116 result
= add_binding (id
, decl
);
1118 /* Create a new binding. */
1119 push_binding (id
, decl
, class_binding_level
);
1121 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1122 class-level declaration. Note that we do not use DECL here
1123 because of the possibility of the `struct stat' hack; if DECL is
1124 a class-name or enum-name we might prefer a field-name, or some
1126 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1128 /* If this is a binding from a base class, mark it as such. */
1129 binding
= IDENTIFIER_BINDING (id
);
1130 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1132 /* Any implicit typename must be from a base-class. The
1133 context for an implicit typename declaration is always
1134 the derived class in which the lookup was done, so the checks
1135 based on the context of DECL below will not trigger. */
1136 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1137 INHERITED_VALUE_BINDING_P (binding
) = 1;
1140 if (TREE_CODE (decl
) == OVERLOAD
)
1141 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1144 my_friendly_assert (DECL_P (decl
), 0);
1145 context
= context_for_name_lookup (decl
);
1148 if (is_properly_derived_from (current_class_type
, context
))
1149 INHERITED_VALUE_BINDING_P (binding
) = 1;
1151 INHERITED_VALUE_BINDING_P (binding
) = 0;
1154 else if (BINDING_VALUE (binding
) == decl
)
1155 /* We only encounter a TREE_LIST when push_class_decls detects an
1156 ambiguity. Such an ambiguity can be overridden by a definition
1158 INHERITED_VALUE_BINDING_P (binding
) = 1;
1163 /* Remove the binding for DECL which should be the innermost binding
1167 pop_binding (id
, decl
)
1173 if (id
== NULL_TREE
)
1174 /* It's easiest to write the loops that call this function without
1175 checking whether or not the entities involved have names. We
1176 get here for such an entity. */
1179 /* Get the innermost binding for ID. */
1180 binding
= IDENTIFIER_BINDING (id
);
1182 /* The name should be bound. */
1183 my_friendly_assert (binding
!= NULL_TREE
, 0);
1185 /* The DECL will be either the ordinary binding or the type
1186 binding for this identifier. Remove that binding. */
1187 if (BINDING_VALUE (binding
) == decl
)
1188 BINDING_VALUE (binding
) = NULL_TREE
;
1189 else if (BINDING_TYPE (binding
) == decl
)
1190 BINDING_TYPE (binding
) = NULL_TREE
;
1192 my_friendly_abort (0);
1194 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1196 /* We're completely done with the innermost binding for this
1197 identifier. Unhook it from the list of bindings. */
1198 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1200 /* Add it to the free list. */
1201 TREE_CHAIN (binding
) = free_bindings
;
1202 free_bindings
= binding
;
1204 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1206 BINDING_LEVEL (binding
) = NULL
;
1210 /* When a label goes out of scope, check to see if that label was used
1211 in a valid manner, and issue any appropriate warnings or errors. */
1214 pop_label (label
, old_value
)
1218 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1220 if (DECL_INITIAL (label
) == NULL_TREE
)
1222 cp_error_at ("label `%D' used but not defined", label
);
1223 /* Avoid crashing later. */
1224 define_label (input_filename
, 1, DECL_NAME (label
));
1226 else if (warn_unused_label
&& !TREE_USED (label
))
1227 cp_warning_at ("label `%D' defined but not used", label
);
1230 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1233 /* At the end of a function, all labels declared within the function
1234 go out of scope. BLOCK is the top-level block for the
1241 struct named_label_list
*link
;
1243 /* Clear out the definitions of all label names, since their scopes
1245 for (link
= named_labels
; link
; link
= link
->next
)
1247 pop_label (link
->label_decl
, link
->old_value
);
1248 /* Put the labels into the "variables" of the top-level block,
1249 so debugger can see them. */
1250 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1251 BLOCK_VARS (block
) = link
->label_decl
;
1254 named_labels
= NULL
;
1257 /* Exit a binding level.
1258 Pop the level off, and restore the state of the identifier-decl mappings
1259 that were in effect when this level was entered.
1261 If KEEP == 1, this level had explicit declarations, so
1262 and create a "block" (a BLOCK node) for the level
1263 to record its declarations and subblocks for symbol table output.
1265 If FUNCTIONBODY is nonzero, this level is the body of a function,
1266 so create a block as if KEEP were set and also clear out all
1269 If REVERSE is nonzero, reverse the order of decls before putting
1270 them into the BLOCK. */
1273 poplevel (keep
, reverse
, functionbody
)
1279 /* The chain of decls was accumulated in reverse order.
1280 Put it into forward order, just for cleanliness. */
1282 int tmp
= functionbody
;
1283 int real_functionbody
;
1286 tree block
= NULL_TREE
;
1288 int leaving_for_scope
;
1290 if (cfun
&& !doing_semantic_analysis_p ())
1293 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1296 real_functionbody
= (current_binding_level
->keep
== 2
1297 ? ((functionbody
= 0), tmp
) : functionbody
);
1298 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1299 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1301 my_friendly_assert (!current_binding_level
->class_shadowed
,
1304 /* We used to use KEEP == 2 to indicate that the new block should go
1305 at the beginning of the list of blocks at this binding level,
1306 rather than the end. This hack is no longer used. */
1307 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1309 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1310 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1311 current_binding_level
->parm_flag
,
1312 current_binding_level
->keep
);
1314 if (current_binding_level
->keep
== 1)
1317 /* Any uses of undefined labels, and any defined labels, now operate
1318 under constraints of next binding contour. */
1319 if (cfun
&& !functionbody
)
1321 struct binding_level
*level_chain
;
1322 level_chain
= current_binding_level
->level_chain
;
1325 struct named_label_use_list
*uses
;
1326 struct named_label_list
*labels
;
1327 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1328 if (labels
->binding_level
== current_binding_level
)
1331 if (current_binding_level
->is_try_scope
)
1332 labels
->in_try_scope
= 1;
1333 if (current_binding_level
->is_catch_scope
)
1334 labels
->in_catch_scope
= 1;
1335 for (decl
= labels
->names_in_scope
; decl
;
1336 decl
= TREE_CHAIN (decl
))
1337 if (decl_jump_unsafe (decl
))
1338 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1340 labels
->binding_level
= level_chain
;
1341 labels
->names_in_scope
= level_chain
->names
;
1344 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1345 if (uses
->binding_level
== current_binding_level
)
1347 uses
->binding_level
= level_chain
;
1348 uses
->names_in_scope
= level_chain
->names
;
1353 /* Get the decls in the order they were written.
1354 Usually current_binding_level->names is in reverse order.
1355 But parameter decls were previously put in forward order. */
1358 current_binding_level
->names
1359 = decls
= nreverse (current_binding_level
->names
);
1361 decls
= current_binding_level
->names
;
1363 /* Output any nested inline functions within this block
1364 if they weren't already output. */
1365 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1366 if (TREE_CODE (decl
) == FUNCTION_DECL
1367 && ! TREE_ASM_WRITTEN (decl
)
1368 && DECL_INITIAL (decl
) != NULL_TREE
1369 && TREE_ADDRESSABLE (decl
)
1370 && decl_function_context (decl
) == current_function_decl
)
1372 /* If this decl was copied from a file-scope decl
1373 on account of a block-scope extern decl,
1374 propagate TREE_ADDRESSABLE to the file-scope decl. */
1375 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1376 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1379 push_function_context ();
1380 output_inline_function (decl
);
1381 pop_function_context ();
1385 /* When not in function-at-a-time mode, expand_end_bindings will
1386 warn about unused variables. But, in function-at-a-time mode
1387 expand_end_bindings is not passed the list of variables in the
1388 current scope, and therefore no warning is emitted. So, we
1389 explicitly warn here. */
1390 if (!processing_template_decl
)
1391 warn_about_unused_variables (getdecls ());
1393 /* If there were any declarations or structure tags in that level,
1394 or if this level is a function body,
1395 create a BLOCK to record them for the life of this function. */
1397 if (keep
== 1 || functionbody
)
1398 block
= make_node (BLOCK
);
1399 if (block
!= NULL_TREE
)
1401 BLOCK_VARS (block
) = decls
;
1402 BLOCK_SUBBLOCKS (block
) = subblocks
;
1405 /* In each subblock, record that this is its superior. */
1407 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1408 BLOCK_SUPERCONTEXT (link
) = block
;
1410 /* We still support the old for-scope rules, whereby the variables
1411 in a for-init statement were in scope after the for-statement
1412 ended. We only use the new rules in flag_new_for_scope is
1415 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1417 /* Remove declarations for all the DECLs in this level. */
1418 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1420 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1421 && DECL_NAME (link
))
1424 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1428 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1430 ns_binding
= NULL_TREE
;
1433 && (BINDING_LEVEL (outer_binding
)
1434 == current_binding_level
->level_chain
))
1435 /* We have something like:
1440 and we are leaving the `for' scope. There's no reason to
1441 keep the binding of the inner `i' in this case. */
1442 pop_binding (DECL_NAME (link
), link
);
1443 else if ((outer_binding
1444 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1447 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1448 /* Here, we have something like:
1456 We must pop the for-scope binding so we know what's a
1457 type and what isn't. */
1458 pop_binding (DECL_NAME (link
), link
);
1461 /* Mark this VAR_DECL as dead so that we can tell we left it
1462 there only for backward compatibility. */
1463 DECL_DEAD_FOR_LOCAL (link
) = 1;
1465 /* Keep track of what should of have happenned when we
1466 popped the binding. */
1467 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1468 DECL_SHADOWED_FOR_VAR (link
)
1469 = BINDING_VALUE (outer_binding
);
1471 /* Add it to the list of dead variables in the next
1472 outermost binding to that we can remove these when we
1473 leave that binding. */
1474 current_binding_level
->level_chain
->dead_vars_from_for
1475 = tree_cons (NULL_TREE
, link
,
1476 current_binding_level
->level_chain
->
1477 dead_vars_from_for
);
1479 /* Although we don't pop the CPLUS_BINDING, we do clear
1480 its BINDING_LEVEL since the level is going away now. */
1481 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1487 /* Remove the binding. */
1489 if (TREE_CODE (decl
) == TREE_LIST
)
1490 decl
= TREE_VALUE (decl
);
1492 pop_binding (DECL_NAME (decl
), decl
);
1493 else if (TREE_CODE (decl
) == OVERLOAD
)
1494 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1496 my_friendly_abort (0);
1500 /* Remove declarations for any `for' variables from inner scopes
1501 that we kept around. */
1502 for (link
= current_binding_level
->dead_vars_from_for
;
1503 link
; link
= TREE_CHAIN (link
))
1504 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1506 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1507 for (link
= current_binding_level
->type_shadowed
;
1508 link
; link
= TREE_CHAIN (link
))
1509 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1511 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1512 for (link
= current_binding_level
->shadowed_labels
;
1514 link
= TREE_CHAIN (link
))
1515 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1517 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1518 list if a `using' declaration put them there. The debugging
1519 back-ends won't understand OVERLOAD, so we remove them here.
1520 Because the BLOCK_VARS are (temporarily) shared with
1521 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1522 popped all the bindings. */
1527 for (d
= &BLOCK_VARS (block
); *d
; )
1529 if (TREE_CODE (*d
) == TREE_LIST
)
1530 *d
= TREE_CHAIN (*d
);
1532 d
= &TREE_CHAIN (*d
);
1536 /* If the level being exited is the top level of a function,
1537 check over all the labels. */
1540 /* Since this is the top level block of a function, the vars are
1541 the function's parameters. Don't leave them in the BLOCK
1542 because they are found in the FUNCTION_DECL instead. */
1543 BLOCK_VARS (block
) = 0;
1547 tmp
= current_binding_level
->keep
;
1549 pop_binding_level ();
1551 DECL_INITIAL (current_function_decl
) = block
;
1553 current_binding_level
->blocks
1554 = chainon (current_binding_level
->blocks
, block
);
1556 /* If we did not make a block for the level just exited,
1557 any blocks made for inner levels
1558 (since they cannot be recorded as subblocks in that level)
1559 must be carried forward so they will later become subblocks
1560 of something else. */
1562 current_binding_level
->blocks
1563 = chainon (current_binding_level
->blocks
, subblocks
);
1565 /* Each and every BLOCK node created here in `poplevel' is important
1566 (e.g. for proper debugging information) so if we created one
1567 earlier, mark it as "used". */
1569 TREE_USED (block
) = 1;
1571 /* Take care of compiler's internal binding structures. */
1577 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1580 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1581 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1584 block
= poplevel (keep
, reverse
, functionbody
);
1590 /* Delete the node BLOCK from the current binding level.
1591 This is used for the block inside a stmt expr ({...})
1592 so that the block can be reinserted where appropriate. */
1595 delete_block (block
)
1599 if (current_binding_level
->blocks
== block
)
1600 current_binding_level
->blocks
= TREE_CHAIN (block
);
1601 for (t
= current_binding_level
->blocks
; t
;)
1603 if (TREE_CHAIN (t
) == block
)
1604 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1608 TREE_CHAIN (block
) = NULL_TREE
;
1609 /* Clear TREE_USED which is always set by poplevel.
1610 The flag is set again if insert_block is called. */
1611 TREE_USED (block
) = 0;
1614 /* Insert BLOCK at the end of the list of subblocks of the
1615 current binding level. This is used when a BIND_EXPR is expanded,
1616 to handle the BLOCK node inside the BIND_EXPR. */
1619 insert_block (block
)
1622 TREE_USED (block
) = 1;
1623 current_binding_level
->blocks
1624 = chainon (current_binding_level
->blocks
, block
);
1627 /* Set the BLOCK node for the innermost scope
1628 (the one we are currently in). */
1632 tree block ATTRIBUTE_UNUSED
;
1634 /* The RTL expansion machinery requires us to provide this callback,
1635 but it is not applicable in function-at-a-time mode. */
1636 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1639 /* Do a pushlevel for class declarations. */
1644 register struct binding_level
*newlevel
;
1646 /* Reuse or create a struct for this binding level. */
1647 #if defined(DEBUG_CP_BINDING_LEVELS)
1649 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1650 if (free_binding_level
)
1651 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1653 newlevel
= free_binding_level
;
1654 free_binding_level
= free_binding_level
->level_chain
;
1657 newlevel
= make_binding_level ();
1659 #if defined(DEBUG_CP_BINDING_LEVELS)
1661 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1663 push_binding_level (newlevel
, 0, 0);
1665 class_binding_level
= current_binding_level
;
1666 class_binding_level
->parm_flag
= 2;
1667 class_binding_level
->this_class
= current_class_type
;
1670 /* ...and a poplevel for class declarations. */
1675 register struct binding_level
*level
= class_binding_level
;
1678 my_friendly_assert (level
!= 0, 354);
1680 /* If we're leaving a toplevel class, don't bother to do the setting
1681 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1682 shouldn't even be used when current_class_type isn't set, and second,
1683 if we don't touch it here, we're able to use the cache effect if the
1684 next time we're entering a class scope, it is the same class. */
1685 if (current_class_depth
!= 1)
1687 struct binding_level
* b
;
1689 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1690 for (shadowed
= level
->class_shadowed
;
1692 shadowed
= TREE_CHAIN (shadowed
))
1693 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1695 /* Find the next enclosing class, and recreate
1696 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1697 b
= level
->level_chain
;
1698 while (b
&& b
->parm_flag
!= 2)
1702 for (shadowed
= b
->class_shadowed
;
1704 shadowed
= TREE_CHAIN (shadowed
))
1708 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1709 while (t
&& BINDING_LEVEL (t
) != b
)
1713 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1714 = BINDING_VALUE (t
);
1718 /* Remember to save what IDENTIFIER's were bound in this scope so we
1719 can recover from cache misses. */
1721 previous_class_type
= current_class_type
;
1722 previous_class_values
= class_binding_level
->class_shadowed
;
1724 for (shadowed
= level
->type_shadowed
;
1726 shadowed
= TREE_CHAIN (shadowed
))
1727 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1729 /* Remove the bindings for all of the class-level declarations. */
1730 for (shadowed
= level
->class_shadowed
;
1732 shadowed
= TREE_CHAIN (shadowed
))
1733 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1735 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1736 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1737 class_binding_level
->parm_flag
,
1738 class_binding_level
->keep
);
1740 /* Now, pop out of the binding level which we created up in the
1741 `pushlevel_class' routine. */
1742 #if defined(DEBUG_CP_BINDING_LEVELS)
1744 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1746 pop_binding_level ();
1749 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1750 for any names in enclosing classes. */
1753 clear_identifier_class_values ()
1757 if (!class_binding_level
)
1760 for (t
= class_binding_level
->class_shadowed
;
1763 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1766 /* Returns non-zero if T is a virtual function table. */
1769 vtable_decl_p (t
, data
)
1771 void *data ATTRIBUTE_UNUSED
;
1773 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1776 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1780 vtype_decl_p (t
, data
)
1782 void *data ATTRIBUTE_UNUSED
;
1784 return (TREE_CODE (t
) == TYPE_DECL
1785 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1786 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1789 /* Return the declarations that are members of the namespace NS. */
1792 cp_namespace_decls (ns
)
1795 return NAMESPACE_LEVEL (ns
)->names
;
1798 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1799 itself, calling F for each. The DATA is passed to F as well. */
1802 walk_namespaces_r (namespace, f
, data
)
1804 walk_namespaces_fn f
;
1810 result
|= (*f
) (namespace, data
);
1812 for (current
= cp_namespace_decls (namespace);
1814 current
= TREE_CHAIN (current
))
1816 if (TREE_CODE (current
) != NAMESPACE_DECL
1817 || DECL_NAMESPACE_ALIAS (current
))
1819 if (!DECL_LANG_SPECIFIC (current
))
1822 my_friendly_assert (current
== fake_std_node
, 393);
1826 /* We found a namespace. */
1827 result
|= walk_namespaces_r (current
, f
, data
);
1833 /* Walk all the namespaces, calling F for each. The DATA is passed to
1837 walk_namespaces (f
, data
)
1838 walk_namespaces_fn f
;
1841 return walk_namespaces_r (global_namespace
, f
, data
);
1844 struct walk_globals_data
{
1845 walk_globals_pred p
;
1850 /* Walk the global declarations in NAMESPACE. Whenever one is found
1851 for which P returns non-zero, call F with its address. If any call
1852 to F returns a non-zero value, return a non-zero value. */
1855 walk_globals_r (namespace, data
)
1859 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1860 walk_globals_pred p
= wgd
->p
;
1861 walk_globals_fn f
= wgd
->f
;
1862 void *d
= wgd
->data
;
1866 t
= &NAMESPACE_LEVEL (namespace)->names
;
1873 result
|= (*f
) (t
, d
);
1875 /* If F changed *T, then *T still points at the next item to
1878 t
= &TREE_CHAIN (*t
);
1884 /* Walk the global declarations. Whenever one is found for which P
1885 returns non-zero, call F with its address. If any call to F
1886 returns a non-zero value, return a non-zero value. */
1889 walk_globals (p
, f
, data
)
1890 walk_globals_pred p
;
1894 struct walk_globals_data wgd
;
1899 return walk_namespaces (walk_globals_r
, &wgd
);
1902 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1903 DATA is non-NULL, this is the last time we will call
1904 wrapup_global_declarations for this NAMESPACE. */
1907 wrapup_globals_for_namespace (namespace, data
)
1911 tree globals
= cp_namespace_decls (namespace);
1912 int len
= list_length (globals
);
1913 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1917 int last_time
= (data
!= 0);
1919 if (last_time
&& namespace == global_namespace
)
1920 /* Let compile_file handle the global namespace. */
1923 /* Process the decls in reverse order--earliest first.
1924 Put them into VEC from back to front, then take out from front. */
1925 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1926 vec
[len
- i
- 1] = decl
;
1930 check_global_declarations (vec
, len
);
1934 /* Temporarily mark vtables as external. That prevents
1935 wrapup_global_declarations from writing them out; we must process
1936 them ourselves in finish_vtable_vardecl. */
1937 for (i
= 0; i
< len
; ++i
)
1938 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1940 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1941 DECL_EXTERNAL (vec
[i
]) = 1;
1944 /* Write out any globals that need to be output. */
1945 result
= wrapup_global_declarations (vec
, len
);
1947 /* Undo the hack to DECL_EXTERNAL above. */
1948 for (i
= 0; i
< len
; ++i
)
1949 if (vtable_decl_p (vec
[i
], /*data=*/0)
1950 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1952 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1953 DECL_EXTERNAL (vec
[i
]) = 0;
1960 /* Mark ARG (which is really a struct binding_level **) for GC. */
1963 mark_binding_level (arg
)
1966 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1968 for (; lvl
; lvl
= lvl
->level_chain
)
1970 ggc_mark_tree (lvl
->names
);
1971 ggc_mark_tree (lvl
->tags
);
1972 ggc_mark_tree (lvl
->usings
);
1973 ggc_mark_tree (lvl
->using_directives
);
1974 ggc_mark_tree (lvl
->class_shadowed
);
1975 ggc_mark_tree (lvl
->type_shadowed
);
1976 ggc_mark_tree (lvl
->shadowed_labels
);
1977 ggc_mark_tree (lvl
->blocks
);
1978 ggc_mark_tree (lvl
->this_class
);
1979 ggc_mark_tree (lvl
->incomplete
);
1980 ggc_mark_tree (lvl
->dead_vars_from_for
);
1985 mark_named_label_lists (labs
, uses
)
1989 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
1990 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
1992 for (; l
; l
= l
->next
)
1995 mark_binding_level (l
->binding_level
);
1996 ggc_mark_tree (l
->old_value
);
1997 ggc_mark_tree (l
->label_decl
);
1998 ggc_mark_tree (l
->bad_decls
);
2001 for (; u
; u
= u
->next
)
2005 /* For debugging. */
2006 static int no_print_functions
= 0;
2007 static int no_print_builtins
= 0;
2010 print_binding_level (lvl
)
2011 struct binding_level
*lvl
;
2015 fprintf (stderr
, " blocks=");
2016 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2017 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2018 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2019 if (lvl
->tag_transparent
)
2020 fprintf (stderr
, " tag-transparent");
2021 if (lvl
->more_cleanups_ok
)
2022 fprintf (stderr
, " more-cleanups-ok");
2023 if (lvl
->have_cleanups
)
2024 fprintf (stderr
, " have-cleanups");
2025 fprintf (stderr
, "\n");
2028 fprintf (stderr
, " names:\t");
2029 /* We can probably fit 3 names to a line? */
2030 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2032 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2034 if (no_print_builtins
2035 && (TREE_CODE (t
) == TYPE_DECL
)
2036 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2039 /* Function decls tend to have longer names. */
2040 if (TREE_CODE (t
) == FUNCTION_DECL
)
2047 fprintf (stderr
, "\n\t");
2050 print_node_brief (stderr
, "", t
, 0);
2051 if (t
== error_mark_node
)
2055 fprintf (stderr
, "\n");
2059 fprintf (stderr
, " tags:\t");
2061 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2063 if (TREE_PURPOSE (t
) == NULL_TREE
)
2065 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2072 fprintf (stderr
, "\n\t");
2075 if (TREE_PURPOSE (t
) == NULL_TREE
)
2077 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2078 fprintf (stderr
, ">");
2080 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2081 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2084 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2085 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2086 fprintf (stderr
, ">");
2090 fprintf (stderr
, "\n");
2092 if (lvl
->class_shadowed
)
2094 fprintf (stderr
, " class-shadowed:");
2095 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2097 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2099 fprintf (stderr
, "\n");
2101 if (lvl
->type_shadowed
)
2103 fprintf (stderr
, " type-shadowed:");
2104 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2106 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2108 fprintf (stderr
, "\n");
2113 print_other_binding_stack (stack
)
2114 struct binding_level
*stack
;
2116 struct binding_level
*level
;
2117 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2119 fprintf (stderr
, "binding level ");
2120 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2121 fprintf (stderr
, "\n");
2122 print_binding_level (level
);
2127 print_binding_stack ()
2129 struct binding_level
*b
;
2130 fprintf (stderr
, "current_binding_level=");
2131 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2132 fprintf (stderr
, "\nclass_binding_level=");
2133 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2134 fprintf (stderr
, "\nglobal_binding_level=");
2135 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2136 fprintf (stderr
, "\n");
2137 if (class_binding_level
)
2139 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2140 if (b
== current_binding_level
)
2143 b
= class_binding_level
;
2145 b
= current_binding_level
;
2148 b
= current_binding_level
;
2149 print_other_binding_stack (b
);
2150 fprintf (stderr
, "global:\n");
2151 print_binding_level (global_binding_level
);
2154 /* Namespace binding access routines: The namespace_bindings field of
2155 the identifier is polymorphic, with three possible values:
2156 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2157 indicating the BINDING_VALUE of global_namespace. */
2159 /* Check whether the a binding for the name to scope is known.
2160 Assumes that the bindings of the name are already a list
2161 of bindings. Returns the binding found, or NULL_TREE. */
2164 find_binding (name
, scope
)
2168 tree iter
, prev
= NULL_TREE
;
2170 scope
= ORIGINAL_NAMESPACE (scope
);
2172 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2173 iter
= TREE_CHAIN (iter
))
2175 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2176 if (BINDING_SCOPE (iter
) == scope
)
2178 /* Move binding found to the front of the list, so
2179 subsequent lookups will find it faster. */
2182 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2183 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2184 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2193 /* Always returns a binding for name in scope. If the
2194 namespace_bindings is not a list, convert it to one first.
2195 If no binding is found, make a new one. */
2198 binding_for_name (name
, scope
)
2202 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2205 scope
= ORIGINAL_NAMESPACE (scope
);
2207 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2209 /* Get rid of optimization for global scope. */
2210 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2211 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2212 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2214 if (b
&& (result
= find_binding (name
, scope
)))
2216 /* Not found, make a new one. */
2217 result
= make_node (CPLUS_BINDING
);
2218 TREE_CHAIN (result
) = b
;
2219 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2220 BINDING_SCOPE (result
) = scope
;
2221 BINDING_TYPE (result
) = NULL_TREE
;
2222 BINDING_VALUE (result
) = NULL_TREE
;
2226 /* Return the binding value for name in scope, considering that
2227 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2230 namespace_binding (name
, scope
)
2234 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2237 if (scope
== NULL_TREE
)
2238 scope
= global_namespace
;
2239 if (TREE_CODE (b
) != CPLUS_BINDING
)
2240 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2241 name
= find_binding (name
,scope
);
2242 if (name
== NULL_TREE
)
2244 return BINDING_VALUE (name
);
2247 /* Set the binding value for name in scope. If modifying the binding
2248 of global_namespace is attempted, try to optimize it. */
2251 set_namespace_binding (name
, scope
, val
)
2258 if (scope
== NULL_TREE
)
2259 scope
= global_namespace
;
2261 if (scope
== global_namespace
)
2263 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2264 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2266 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2270 b
= binding_for_name (name
, scope
);
2271 BINDING_VALUE (b
) = val
;
2274 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2275 select a name that is unique to this compilation unit. */
2278 push_namespace (name
)
2283 int implicit_use
= 0;
2285 if (!global_namespace
)
2287 /* This must be ::. */
2288 my_friendly_assert (name
== get_identifier ("::"), 377);
2293 /* The name of anonymous namespace is unique for the translation
2295 if (!anonymous_namespace_name
)
2296 anonymous_namespace_name
= get_file_function_name ('N');
2297 name
= anonymous_namespace_name
;
2298 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2300 /* Reopening anonymous namespace. */
2304 else if (current_namespace
== global_namespace
2306 && name
== std_identifier
)
2313 /* Check whether this is an extended namespace definition. */
2314 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2315 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2318 if (DECL_NAMESPACE_ALIAS (d
))
2320 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2321 d
, DECL_NAMESPACE_ALIAS (d
));
2322 d
= DECL_NAMESPACE_ALIAS (d
);
2329 /* Make a new namespace, binding the name to it. */
2330 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2331 /* The global namespace is not pushed, and the global binding
2332 level is set elsewhere. */
2335 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2338 declare_namespace_level ();
2339 NAMESPACE_LEVEL (d
) = current_binding_level
;
2343 resume_binding_level (NAMESPACE_LEVEL (d
));
2346 do_using_directive (d
);
2347 /* Enter the name space. */
2348 current_namespace
= d
;
2351 /* Pop from the scope of the current namespace. */
2356 if (current_namespace
== global_namespace
)
2358 my_friendly_assert (in_fake_std
> 0, 980421);
2362 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2363 /* The binding level is not popped, as it might be re-opened later. */
2364 suspend_binding_level ();
2367 /* Push into the scope of the namespace NS, even if it is deeply
2368 nested within another namespace. */
2371 push_nested_namespace (ns
)
2374 if (ns
== global_namespace
)
2375 push_to_top_level ();
2378 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2379 push_namespace (DECL_NAME (ns
));
2383 /* Pop back from the scope of the namespace NS, which was previously
2384 entered with push_nested_namespace. */
2387 pop_nested_namespace (ns
)
2390 while (ns
!= global_namespace
)
2393 ns
= CP_DECL_CONTEXT (ns
);
2396 pop_from_top_level ();
2400 /* Subroutines for reverting temporarily to top-level for instantiation
2401 of templates and such. We actually need to clear out the class- and
2402 local-value slots of all identifiers, so that only the global values
2403 are at all visible. Simply setting current_binding_level to the global
2404 scope isn't enough, because more binding levels may be pushed. */
2405 struct saved_scope
*scope_chain
;
2407 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2410 mark_saved_scope (arg
)
2413 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2416 mark_binding_level (&t
->class_bindings
);
2417 ggc_mark_tree (t
->old_bindings
);
2418 ggc_mark_tree (t
->old_namespace
);
2419 ggc_mark_tree (t
->decl_ns_list
);
2420 ggc_mark_tree (t
->class_name
);
2421 ggc_mark_tree (t
->class_type
);
2422 ggc_mark_tree (t
->access_specifier
);
2423 ggc_mark_tree (t
->function_decl
);
2425 ggc_mark_tree_varray (t
->lang_base
);
2426 ggc_mark_tree (t
->lang_name
);
2427 ggc_mark_tree (t
->template_parms
);
2428 ggc_mark_tree (t
->x_previous_class_type
);
2429 ggc_mark_tree (t
->x_previous_class_values
);
2430 ggc_mark_tree (t
->x_saved_tree
);
2431 ggc_mark_tree (t
->incomplete
);
2432 ggc_mark_tree (t
->lookups
);
2434 mark_stmt_tree (&t
->x_stmt_tree
);
2435 mark_binding_level (&t
->bindings
);
2441 store_bindings (names
, old_bindings
)
2442 tree names
, old_bindings
;
2445 tree search_bindings
= old_bindings
;
2447 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2449 tree binding
, t1
, id
;
2451 if (TREE_CODE (t
) == TREE_LIST
)
2452 id
= TREE_PURPOSE (t
);
2457 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2458 we have no IDENTIFIER_BINDING if we have left the class
2459 scope, but cached the class-level declarations. */
2460 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2463 for (t1
= search_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2464 if (TREE_VEC_ELT (t1
, 0) == id
)
2467 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2468 binding
= make_tree_vec (4);
2469 TREE_VEC_ELT (binding
, 0) = id
;
2470 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2471 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2472 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2473 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2474 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2475 TREE_CHAIN (binding
) = old_bindings
;
2476 old_bindings
= binding
;
2480 return old_bindings
;
2484 maybe_push_to_top_level (pseudo
)
2487 struct saved_scope
*s
;
2488 struct binding_level
*b
;
2492 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2494 b
= scope_chain
? current_binding_level
: 0;
2496 /* If we're in the middle of some function, save our state. */
2500 push_function_context_to (NULL_TREE
);
2505 old_bindings
= NULL_TREE
;
2506 if (scope_chain
&& previous_class_type
)
2507 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2509 /* Have to include global_binding_level, because class-level decls
2510 aren't listed anywhere useful. */
2511 for (; b
; b
= b
->level_chain
)
2515 /* Template IDs are inserted into the global level. If they were
2516 inserted into namespace level, finish_file wouldn't find them
2517 when doing pending instantiations. Therefore, don't stop at
2518 namespace level, but continue until :: . */
2519 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2522 old_bindings
= store_bindings (b
->names
, old_bindings
);
2523 /* We also need to check class_shadowed to save class-level type
2524 bindings, since pushclass doesn't fill in b->names. */
2525 if (b
->parm_flag
== 2)
2526 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2528 /* Unwind type-value slots back to top level. */
2529 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2530 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2532 s
->prev
= scope_chain
;
2533 s
->old_bindings
= old_bindings
;
2535 s
->need_pop_function_context
= need_pop
;
2536 s
->function_decl
= current_function_decl
;
2539 current_function_decl
= NULL_TREE
;
2540 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2541 current_lang_name
= lang_name_cplusplus
;
2542 current_namespace
= global_namespace
;
2546 push_to_top_level ()
2548 maybe_push_to_top_level (0);
2552 pop_from_top_level ()
2554 struct saved_scope
*s
= scope_chain
;
2557 /* Clear out class-level bindings cache. */
2558 if (previous_class_type
)
2559 invalidate_class_lookup_cache ();
2561 VARRAY_FREE (current_lang_base
);
2563 scope_chain
= s
->prev
;
2564 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2566 tree id
= TREE_VEC_ELT (t
, 0);
2568 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2569 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2570 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2573 /* If we were in the middle of compiling a function, restore our
2575 if (s
->need_pop_function_context
)
2576 pop_function_context_from (NULL_TREE
);
2577 current_function_decl
= s
->function_decl
;
2582 /* Push a definition of struct, union or enum tag "name".
2583 into binding_level "b". "type" should be the type node,
2584 We assume that the tag "name" is not already defined.
2586 Note that the definition may really be just a forward reference.
2587 In that case, the TYPE_SIZE will be a NULL_TREE.
2589 C++ gratuitously puts all these tags in the name space. */
2591 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2592 record the shadowed value for this binding contour. TYPE is
2593 the type that ID maps to. */
2596 set_identifier_type_value_with_scope (id
, type
, b
)
2599 struct binding_level
*b
;
2601 if (!b
->namespace_p
)
2603 /* Shadow the marker, not the real thing, so that the marker
2604 gets restored later. */
2605 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2607 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2611 tree binding
= binding_for_name (id
, current_namespace
);
2612 BINDING_TYPE (binding
) = type
;
2613 /* Store marker instead of real type. */
2614 type
= global_type_node
;
2616 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2619 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2622 set_identifier_type_value (id
, type
)
2626 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2629 /* Return the type associated with id. */
2632 identifier_type_value (id
)
2635 /* There is no type with that name, anywhere. */
2636 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2638 /* This is not the type marker, but the real thing. */
2639 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2640 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2641 /* Have to search for it. It must be on the global level, now.
2642 Ask lookup_name not to return non-types. */
2643 id
= lookup_name_real (id
, 2, 1, 0);
2645 return TREE_TYPE (id
);
2649 /* Pop off extraneous binding levels left over due to syntax errors.
2651 We don't pop past namespaces, as they might be valid. */
2656 #ifdef DEBUG_CP_BINDING_LEVELS
2657 fprintf (stderr
, "XXX entering pop_everything ()\n");
2659 while (!toplevel_bindings_p ())
2661 if (current_binding_level
->parm_flag
== 2)
2662 pop_nested_class ();
2666 #ifdef DEBUG_CP_BINDING_LEVELS
2667 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2671 /* The type TYPE is being declared. If it is a class template, or a
2672 specialization of a class template, do any processing required and
2673 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2674 being declared a friend. B is the binding level at which this TYPE
2677 Returns the TYPE_DECL for TYPE, which may have been altered by this
2681 maybe_process_template_type_declaration (type
, globalize
, b
)
2684 struct binding_level
* b
;
2686 tree decl
= TYPE_NAME (type
);
2688 if (processing_template_parmlist
)
2689 /* You can't declare a new template type in a template parameter
2690 list. But, you can declare a non-template type:
2692 template <class A*> struct S;
2694 is a forward-declaration of `A'. */
2698 maybe_check_template_type (type
);
2700 my_friendly_assert (IS_AGGR_TYPE (type
)
2701 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2704 if (processing_template_decl
)
2706 /* This may change after the call to
2707 push_template_decl_real, but we want the original value. */
2708 tree name
= DECL_NAME (decl
);
2710 decl
= push_template_decl_real (decl
, globalize
);
2711 /* If the current binding level is the binding level for the
2712 template parameters (see the comment in
2713 begin_template_parm_list) and the enclosing level is a class
2714 scope, and we're not looking at a friend, push the
2715 declaration of the member class into the class scope. In the
2716 friend case, push_template_decl will already have put the
2717 friend into global scope, if appropriate. */
2718 if (TREE_CODE (type
) != ENUMERAL_TYPE
2719 && !globalize
&& b
->template_parms_p
2720 && b
->level_chain
->parm_flag
== 2)
2722 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2723 /* Put this tag on the list of tags for the class, since
2724 that won't happen below because B is not the class
2725 binding level, but is instead the pseudo-global level. */
2726 b
->level_chain
->tags
=
2727 tree_cons (name
, type
, b
->level_chain
->tags
);
2728 if (!COMPLETE_TYPE_P (current_class_type
))
2729 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2737 /* In C++, you don't have to write `struct S' to refer to `S'; you
2738 can just use `S'. We accomplish this by creating a TYPE_DECL as
2739 if the user had written `typedef struct S S'. Create and return
2740 the TYPE_DECL for TYPE. */
2743 create_implicit_typedef (name
, type
)
2749 decl
= build_decl (TYPE_DECL
, name
, type
);
2750 DECL_ARTIFICIAL (decl
) = 1;
2751 /* There are other implicit type declarations, like the one *within*
2752 a class that allows you to write `S::S'. We must distinguish
2754 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2755 TYPE_NAME (type
) = decl
;
2760 /* Remember a local name for name-mangling purposes. */
2763 push_local_name (decl
)
2770 VARRAY_TREE_INIT (local_names
, 8, "local_names");
2772 name
= DECL_NAME (decl
);
2774 nelts
= VARRAY_ACTIVE_SIZE (local_names
);
2775 for (i
= 0; i
< nelts
; i
++)
2777 t
= VARRAY_TREE (local_names
, i
);
2778 if (DECL_NAME (t
) == name
)
2780 if (!DECL_LANG_SPECIFIC (decl
))
2781 retrofit_lang_decl (decl
);
2782 if (DECL_LANG_SPECIFIC (t
))
2783 DECL_DISCRIMINATOR (decl
) = DECL_DISCRIMINATOR (t
) + 1;
2785 DECL_DISCRIMINATOR (decl
) = 1;
2787 VARRAY_TREE (local_names
, i
) = decl
;
2792 VARRAY_PUSH_TREE (local_names
, decl
);
2795 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2796 Normally put it into the inner-most non-tag-transparent scope,
2797 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2798 The latter is needed for implicit declarations. */
2801 pushtag (name
, type
, globalize
)
2805 register struct binding_level
*b
;
2807 b
= current_binding_level
;
2808 while (b
->tag_transparent
2809 || (b
->parm_flag
== 2
2811 /* We may be defining a new type in the initializer
2812 of a static member variable. We allow this when
2813 not pedantic, and it is particularly useful for
2814 type punning via an anonymous union. */
2815 || COMPLETE_TYPE_P (b
->this_class
))))
2818 b
->tags
= tree_cons (name
, type
, b
->tags
);
2822 /* Do C++ gratuitous typedefing. */
2823 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2825 register tree d
= NULL_TREE
;
2827 tree context
= TYPE_CONTEXT (type
);
2831 tree cs
= current_scope ();
2835 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2836 /* When declaring a friend class of a local class, we want
2837 to inject the newly named class into the scope
2838 containing the local class, not the namespace scope. */
2839 context
= decl_function_context (get_type_decl (cs
));
2842 context
= current_namespace
;
2844 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2845 || b
->parm_flag
== 2)
2848 if (current_lang_name
== lang_name_java
)
2849 TYPE_FOR_JAVA (type
) = 1;
2851 d
= create_implicit_typedef (name
, type
);
2852 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2854 set_identifier_type_value_with_scope (name
, type
, b
);
2856 d
= maybe_process_template_type_declaration (type
,
2859 if (b
->parm_flag
== 2)
2861 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2862 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2863 class. But if it's a member template class, we
2864 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2866 finish_member_declaration (d
);
2868 pushdecl_class_level (d
);
2871 d
= pushdecl_with_scope (d
, b
);
2873 /* FIXME what if it gets a name from typedef? */
2874 if (ANON_AGGRNAME_P (name
))
2875 DECL_IGNORED_P (d
) = 1;
2877 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2879 /* If this is a local class, keep track of it. We need this
2880 information for name-mangling, and so that it is possible to find
2881 all function definitions in a translation unit in a convenient
2882 way. (It's otherwise tricky to find a member function definition
2883 it's only pointed to from within a local class.) */
2884 if (TYPE_CONTEXT (type
)
2885 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2886 && !processing_template_decl
)
2887 VARRAY_PUSH_TREE (local_classes
, type
);
2889 if (b
->parm_flag
== 2)
2891 if (!COMPLETE_TYPE_P (current_class_type
))
2892 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2896 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2897 /* Use the canonical TYPE_DECL for this node. */
2898 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2901 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2902 will be the tagged type we just added to the current
2903 binding level. This fake NULL-named TYPE_DECL node helps
2904 dwarfout.c to know when it needs to output a
2905 representation of a tagged type, and it also gives us a
2906 convenient place to record the "scope start" address for
2909 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2910 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2914 /* Counter used to create anonymous type names. */
2916 static int anon_cnt
= 0;
2918 /* Return an IDENTIFIER which can be used as a name for
2919 anonymous structs and unions. */
2926 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2927 return get_identifier (buf
);
2930 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2931 This keeps dbxout from getting confused. */
2936 register struct binding_level
*b
;
2938 static int last_cnt
= 0;
2940 /* Fast out if no new anon names were declared. */
2941 if (last_cnt
== anon_cnt
)
2944 b
= current_binding_level
;
2945 while (b
->tag_transparent
)
2950 /* A NULL purpose means we have already processed all tags
2951 from here to the end of the list. */
2952 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2954 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2955 TREE_PURPOSE (tags
) = NULL_TREE
;
2956 tags
= TREE_CHAIN (tags
);
2958 last_cnt
= anon_cnt
;
2961 /* Subroutine of duplicate_decls: return truthvalue of whether
2962 or not types of these decls match.
2964 For C++, we must compare the parameter list so that `int' can match
2965 `int&' in a parameter position, but `int&' is not confused with
2969 decls_match (newdecl
, olddecl
)
2970 tree newdecl
, olddecl
;
2974 if (newdecl
== olddecl
)
2977 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2978 /* If the two DECLs are not even the same kind of thing, we're not
2979 interested in their types. */
2982 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2984 tree f1
= TREE_TYPE (newdecl
);
2985 tree f2
= TREE_TYPE (olddecl
);
2986 tree p1
= TYPE_ARG_TYPES (f1
);
2987 tree p2
= TYPE_ARG_TYPES (f2
);
2989 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2990 && ! (DECL_EXTERN_C_P (newdecl
)
2991 && DECL_EXTERN_C_P (olddecl
)))
2994 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2997 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2999 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
3000 && (DECL_BUILT_IN (olddecl
)
3001 #ifndef NO_IMPLICIT_EXTERN_C
3002 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
3003 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
3007 types_match
= self_promoting_args_p (p1
);
3008 if (p1
== void_list_node
)
3009 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3011 #ifndef NO_IMPLICIT_EXTERN_C
3012 else if (p1
== NULL_TREE
3013 && (DECL_EXTERN_C_P (olddecl
)
3014 && DECL_IN_SYSTEM_HEADER (olddecl
)
3015 && !DECL_CLASS_SCOPE_P (olddecl
))
3016 && (DECL_EXTERN_C_P (newdecl
)
3017 && DECL_IN_SYSTEM_HEADER (newdecl
)
3018 && !DECL_CLASS_SCOPE_P (newdecl
)))
3020 types_match
= self_promoting_args_p (p2
);
3021 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3025 types_match
= compparms (p1
, p2
);
3030 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3032 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3033 DECL_TEMPLATE_PARMS (olddecl
)))
3036 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
3037 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
3040 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3043 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3044 DECL_TEMPLATE_RESULT (newdecl
));
3048 if (TREE_TYPE (newdecl
) == error_mark_node
)
3049 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3050 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3051 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3052 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3055 types_match
= comptypes (TREE_TYPE (newdecl
),
3056 TREE_TYPE (olddecl
),
3057 COMPARE_REDECLARATION
);
3063 /* If NEWDECL is `static' and an `extern' was seen previously,
3064 warn about it. OLDDECL is the previous declaration.
3066 Note that this does not apply to the C++ case of declaring
3067 a variable `extern const' and then later `const'.
3069 Don't complain about built-in functions, since they are beyond
3070 the user's control. */
3073 warn_extern_redeclared_static (newdecl
, olddecl
)
3074 tree newdecl
, olddecl
;
3076 static const char *explicit_extern_static_warning
3077 = "`%D' was declared `extern' and later `static'";
3078 static const char *implicit_extern_static_warning
3079 = "`%D' was declared implicitly `extern' and later `static'";
3083 if (TREE_CODE (newdecl
) == TYPE_DECL
3084 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3085 || TREE_CODE (newdecl
) == CONST_DECL
)
3088 /* Don't get confused by static member functions; that's a different
3090 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3091 && DECL_STATIC_FUNCTION_P (newdecl
))
3094 /* If the old declaration was `static', or the new one isn't, then
3095 then everything is OK. */
3096 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3099 /* It's OK to declare a builtin function as `static'. */
3100 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3101 && DECL_ARTIFICIAL (olddecl
))
3104 name
= DECL_ASSEMBLER_NAME (newdecl
);
3105 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3106 ? implicit_extern_static_warning
3107 : explicit_extern_static_warning
, newdecl
);
3108 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3111 /* Handle when a new declaration NEWDECL has the same name as an old
3112 one OLDDECL in the same binding contour. Prints an error message
3115 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3116 Otherwise, return 0. */
3119 duplicate_decls (newdecl
, olddecl
)
3120 tree newdecl
, olddecl
;
3122 unsigned olddecl_uid
= DECL_UID (olddecl
);
3123 int olddecl_friend
= 0, types_match
= 0;
3124 int new_defines_function
= 0;
3126 if (newdecl
== olddecl
)
3129 types_match
= decls_match (newdecl
, olddecl
);
3131 /* If either the type of the new decl or the type of the old decl is an
3132 error_mark_node, then that implies that we have already issued an
3133 error (earlier) for some bogus type specification, and in that case,
3134 it is rather pointless to harass the user with yet more error message
3135 about the same declaration, so just pretend the types match here. */
3136 if (TREE_TYPE (newdecl
) == error_mark_node
3137 || TREE_TYPE (olddecl
) == error_mark_node
)
3140 /* Check for redeclaration and other discrepancies. */
3141 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3142 && DECL_ARTIFICIAL (olddecl
))
3144 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3146 /* If you declare a built-in or predefined function name as static,
3147 the old definition is overridden, but optionally warn this was a
3148 bad choice of name. */
3149 if (! TREE_PUBLIC (newdecl
))
3152 cp_warning ("shadowing %s function `%#D'",
3153 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3155 /* Discard the old built-in function. */
3158 /* If the built-in is not ansi, then programs can override
3159 it even globally without an error. */
3160 else if (! DECL_BUILT_IN (olddecl
))
3161 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3165 cp_error ("declaration of `%#D'", newdecl
);
3166 cp_error ("conflicts with built-in declaration `%#D'",
3171 else if (!types_match
)
3173 if ((DECL_EXTERN_C_P (newdecl
)
3174 && DECL_EXTERN_C_P (olddecl
))
3175 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3176 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3178 /* A near match; override the builtin. */
3180 if (TREE_PUBLIC (newdecl
))
3182 cp_warning ("new declaration `%#D'", newdecl
);
3183 cp_warning ("ambiguates built-in declaration `%#D'",
3186 else if (warn_shadow
)
3187 cp_warning ("shadowing %s function `%#D'",
3188 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3192 /* Discard the old built-in function. */
3196 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3198 /* If a builtin function is redeclared as `static', merge
3199 the declarations, but make the original one static. */
3200 DECL_THIS_STATIC (olddecl
) = 1;
3201 TREE_PUBLIC (olddecl
) = 0;
3203 /* Make the old declaration consistent with the new one so
3204 that all remnants of the builtin-ness of this function
3205 will be banished. */
3206 SET_DECL_LANGUAGE (olddecl
, DECL_LANGUAGE (newdecl
));
3207 SET_DECL_RTL (olddecl
, DECL_RTL (newdecl
));
3208 COPY_DECL_ASSEMBLER_NAME (olddecl
, newdecl
);
3209 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3213 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3215 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3216 && TREE_CODE (newdecl
) != TYPE_DECL
3217 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3218 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3219 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3220 && TREE_CODE (olddecl
) != TYPE_DECL
3221 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3222 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3225 /* We do nothing special here, because C++ does such nasty
3226 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3227 get shadowed, and know that if we need to find a TYPE_DECL
3228 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3229 slot of the identifier. */
3233 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3234 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3235 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3236 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3239 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3240 if (TREE_CODE (olddecl
) == TREE_LIST
)
3241 olddecl
= TREE_VALUE (olddecl
);
3242 cp_error_at ("previous declaration of `%#D'", olddecl
);
3244 /* New decl is completely inconsistent with the old one =>
3245 tell caller to replace the old one. */
3249 else if (!types_match
)
3251 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3252 /* These are certainly not duplicate declarations; they're
3253 from different scopes. */
3256 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3258 /* The name of a class template may not be declared to refer to
3259 any other template, class, function, object, namespace, value,
3260 or type in the same scope. */
3261 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3262 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3264 cp_error ("declaration of template `%#D'", newdecl
);
3265 cp_error_at ("conflicts with previous declaration `%#D'",
3268 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3269 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3270 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3271 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3272 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3273 DECL_TEMPLATE_PARMS (olddecl
)))
3275 cp_error ("new declaration `%#D'", newdecl
);
3276 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3280 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3282 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3284 cp_error ("declaration of C function `%#D' conflicts with",
3286 cp_error_at ("previous declaration `%#D' here", olddecl
);
3288 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3289 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3291 cp_error ("new declaration `%#D'", newdecl
);
3292 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3298 /* Already complained about this, so don't do so again. */
3299 else if (current_class_type
== NULL_TREE
3300 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3302 cp_error ("conflicting types for `%#D'", newdecl
);
3303 cp_error_at ("previous declaration as `%#D'", olddecl
);
3306 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3307 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3308 && (!DECL_TEMPLATE_INFO (newdecl
)
3309 || (DECL_TI_TEMPLATE (newdecl
)
3310 != DECL_TI_TEMPLATE (olddecl
))))
3311 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3312 && (!DECL_TEMPLATE_INFO (olddecl
)
3313 || (DECL_TI_TEMPLATE (olddecl
)
3314 != DECL_TI_TEMPLATE (newdecl
))))))
3315 /* It's OK to have a template specialization and a non-template
3316 with the same type, or to have specializations of two
3317 different templates with the same type. Note that if one is a
3318 specialization, and the other is an instantiation of the same
3319 template, that we do not exit at this point. That situation
3320 can occur if we instantiate a template class, and then
3321 specialize one of its methods. This situation is legal, but
3322 the declarations must be merged in the usual way. */
3324 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3325 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3326 && !DECL_USE_TEMPLATE (newdecl
))
3327 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3328 && !DECL_USE_TEMPLATE (olddecl
))))
3329 /* One of the declarations is a template instantiation, and the
3330 other is not a template at all. That's OK. */
3332 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3333 && DECL_NAMESPACE_ALIAS (newdecl
)
3334 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3335 /* Redeclaration of namespace alias, ignore it. */
3339 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3342 cp_error (errmsg
, newdecl
);
3343 if (DECL_NAME (olddecl
) != NULL_TREE
)
3344 cp_error_at ((DECL_INITIAL (olddecl
)
3345 && namespace_bindings_p ())
3346 ? "`%#D' previously defined here"
3347 : "`%#D' previously declared here", olddecl
);
3349 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3350 && DECL_INITIAL (olddecl
) != NULL_TREE
3351 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3352 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3354 /* Prototype decl follows defn w/o prototype. */
3355 cp_warning_at ("prototype for `%#D'", newdecl
);
3356 cp_warning_at ("follows non-prototype definition here", olddecl
);
3358 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3359 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3361 /* extern "C" int foo ();
3362 int foo () { bar (); }
3364 if (current_lang_depth () == 0)
3365 SET_DECL_LANGUAGE (newdecl
, DECL_LANGUAGE (olddecl
));
3368 cp_error_at ("previous declaration of `%#D' with %L linkage",
3369 olddecl
, DECL_LANGUAGE (olddecl
));
3370 cp_error ("conflicts with new declaration with %L linkage",
3371 DECL_LANGUAGE (newdecl
));
3375 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3377 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3379 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3380 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3383 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3384 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3386 for (; t1
&& t1
!= void_list_node
;
3387 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3388 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3390 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3395 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3397 cp_pedwarn_at ("after previous specification in `%#D'",
3403 cp_error ("default argument given for parameter %d of `%#D'",
3405 cp_error_at ("after previous specification in `%#D'",
3410 if (DECL_DECLARED_INLINE_P (newdecl
)
3411 && ! DECL_DECLARED_INLINE_P (olddecl
)
3412 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3414 cp_warning ("`%#D' was used before it was declared inline",
3416 cp_warning_at ("previous non-inline declaration here",
3422 /* If new decl is `static' and an `extern' was seen previously,
3424 warn_extern_redeclared_static (newdecl
, olddecl
);
3426 /* We have committed to returning 1 at this point. */
3427 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3429 /* Now that functions must hold information normally held
3430 by field decls, there is extra work to do so that
3431 declaration information does not get destroyed during
3433 if (DECL_VINDEX (olddecl
))
3434 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3435 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3436 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3437 if (DECL_CONTEXT (olddecl
))
3438 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3439 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3440 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3441 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3442 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3443 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3444 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3445 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3446 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3447 if (DECL_OVERLOADED_OPERATOR_P (olddecl
) != ERROR_MARK
)
3448 SET_OVERLOADED_OPERATOR_CODE
3449 (newdecl
, DECL_OVERLOADED_OPERATOR_P (olddecl
));
3450 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3452 /* Optionally warn about more than one declaration for the same
3453 name, but don't warn about a function declaration followed by a
3455 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3456 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3457 /* Don't warn about extern decl followed by definition. */
3458 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3459 /* Don't warn about friends, let add_friend take care of it. */
3460 && ! (DECL_FRIEND_P (newdecl
) || DECL_FRIEND_P (olddecl
)))
3462 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3463 cp_warning_at ("previous declaration of `%D'", olddecl
);
3467 /* Deal with C++: must preserve virtual function table size. */
3468 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3470 register tree newtype
= TREE_TYPE (newdecl
);
3471 register tree oldtype
= TREE_TYPE (olddecl
);
3473 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3474 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3476 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3477 CLASSTYPE_FRIEND_CLASSES (newtype
)
3478 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3481 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3484 /* Copy all the DECL_... slots specified in the new decl
3485 except for any that we copy here from the old type. */
3486 DECL_MACHINE_ATTRIBUTES (newdecl
)
3487 = (*targetm
.merge_decl_attributes
) (olddecl
, newdecl
);
3489 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3491 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3492 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3493 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3494 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3496 /* If the new declaration is a definition, update the file and
3497 line information on the declaration. */
3498 if (DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)) == NULL_TREE
3499 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
)) != NULL_TREE
)
3501 DECL_SOURCE_LINE (olddecl
)
3502 = DECL_SOURCE_LINE (DECL_TEMPLATE_RESULT (olddecl
))
3503 = DECL_SOURCE_LINE (newdecl
);
3504 DECL_SOURCE_FILE (olddecl
)
3505 = DECL_SOURCE_FILE (DECL_TEMPLATE_RESULT (olddecl
))
3506 = DECL_SOURCE_FILE (newdecl
);
3514 /* Automatically handles default parameters. */
3515 tree oldtype
= TREE_TYPE (olddecl
);
3518 /* Merge the data types specified in the two decls. */
3519 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3521 /* If common_type produces a non-typedef type, just use the old type. */
3522 if (TREE_CODE (newdecl
) == TYPE_DECL
3523 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3526 if (TREE_CODE (newdecl
) == VAR_DECL
)
3527 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3528 /* Do this after calling `common_type' so that default
3529 parameters don't confuse us. */
3530 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3531 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3532 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3534 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3535 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3536 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3537 TYPE_RAISES_EXCEPTIONS (oldtype
));
3539 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3540 && DECL_SOURCE_LINE (olddecl
) != 0
3542 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3543 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3545 cp_error ("declaration of `%F' throws different exceptions",
3547 cp_error_at ("than previous declaration `%F'", olddecl
);
3550 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3552 /* Lay the type out, unless already done. */
3553 if (! same_type_p (newtype
, oldtype
)
3554 && TREE_TYPE (newdecl
) != error_mark_node
3555 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3556 layout_type (TREE_TYPE (newdecl
));
3558 if ((TREE_CODE (newdecl
) == VAR_DECL
3559 || TREE_CODE (newdecl
) == PARM_DECL
3560 || TREE_CODE (newdecl
) == RESULT_DECL
3561 || TREE_CODE (newdecl
) == FIELD_DECL
3562 || TREE_CODE (newdecl
) == TYPE_DECL
)
3563 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3564 layout_decl (newdecl
, 0);
3566 /* Merge the type qualifiers. */
3567 if (TREE_READONLY (newdecl
))
3568 TREE_READONLY (olddecl
) = 1;
3569 if (TREE_THIS_VOLATILE (newdecl
))
3570 TREE_THIS_VOLATILE (olddecl
) = 1;
3572 /* Merge the initialization information. */
3573 if (DECL_INITIAL (newdecl
) == NULL_TREE
3574 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3576 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3577 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3578 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3579 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3580 && DECL_LANG_SPECIFIC (newdecl
)
3581 && DECL_LANG_SPECIFIC (olddecl
))
3582 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3585 /* Merge the section attribute.
3586 We want to issue an error if the sections conflict but that must be
3587 done later in decl_attributes since we are called before attributes
3589 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3590 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3592 /* Keep the old rtl since we can safely use it. */
3593 COPY_DECL_RTL (olddecl
, newdecl
);
3595 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3597 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3598 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3599 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3600 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3601 DECL_NO_LIMIT_STACK (newdecl
)
3602 |= DECL_NO_LIMIT_STACK (olddecl
);
3605 /* If cannot merge, then use the new type and qualifiers,
3606 and don't preserve the old rtl. */
3609 /* Clean out any memory we had of the old declaration. */
3610 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3612 TREE_VALUE (oldstatic
) = error_mark_node
;
3614 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3615 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3616 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3617 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3620 /* Merge the storage class information. */
3621 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3622 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3623 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3624 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3625 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3626 if (! DECL_EXTERNAL (olddecl
))
3627 DECL_EXTERNAL (newdecl
) = 0;
3629 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3631 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3632 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3633 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3634 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3635 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3636 /* Don't really know how much of the language-specific
3637 values we should copy from old to new. */
3638 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3639 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3640 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3641 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3642 DECL_INITIALIZED_IN_CLASS_P (newdecl
)
3643 |= DECL_INITIALIZED_IN_CLASS_P (olddecl
);
3644 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3646 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3647 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3648 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3649 DECL_BEFRIENDING_CLASSES (newdecl
)
3650 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3651 DECL_BEFRIENDING_CLASSES (olddecl
));
3654 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3656 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3657 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3659 /* If newdecl is not a specialization, then it is not a
3660 template-related function at all. And that means that we
3661 shoud have exited above, returning 0. */
3662 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3665 if (TREE_USED (olddecl
))
3666 /* From [temp.expl.spec]:
3668 If a template, a member template or the member of a class
3669 template is explicitly specialized then that
3670 specialization shall be declared before the first use of
3671 that specialization that would cause an implicit
3672 instantiation to take place, in every translation unit in
3673 which such a use occurs. */
3674 cp_error ("explicit specialization of %D after first use",
3677 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3679 DECL_DECLARED_INLINE_P (newdecl
) |= DECL_DECLARED_INLINE_P (olddecl
);
3681 /* If either decl says `inline', this fn is inline, unless its
3682 definition was passed already. */
3683 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3684 DECL_INLINE (olddecl
) = 1;
3685 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3687 /* Preserve abstractness on cloned [cd]tors. */
3688 DECL_ABSTRACT (newdecl
) = DECL_ABSTRACT (olddecl
);
3692 SET_DECL_LANGUAGE (olddecl
, DECL_LANGUAGE (newdecl
));
3693 COPY_DECL_ASSEMBLER_NAME (newdecl
, olddecl
);
3694 SET_DECL_RTL (olddecl
, DECL_RTL (newdecl
));
3696 if (! types_match
|| new_defines_function
)
3698 /* These need to be copied so that the names are available.
3699 Note that if the types do match, we'll preserve inline
3700 info and other bits, but if not, we won't. */
3701 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3702 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3704 if (new_defines_function
)
3705 /* If defining a function declared with other language
3706 linkage, use the previously declared language linkage. */
3707 SET_DECL_LANGUAGE (newdecl
, DECL_LANGUAGE (olddecl
));
3708 else if (types_match
)
3710 /* If redeclaring a builtin function, and not a definition,
3711 it stays built in. */
3712 if (DECL_BUILT_IN (olddecl
))
3714 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3715 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3716 /* If we're keeping the built-in definition, keep the rtl,
3717 regardless of declaration matches. */
3718 SET_DECL_RTL (newdecl
, DECL_RTL (olddecl
));
3721 DECL_NUM_STMTS (newdecl
) = DECL_NUM_STMTS (olddecl
);
3723 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3724 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3725 /* Previously saved insns go together with
3726 the function's previous definition. */
3727 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3728 /* Don't clear out the arguments if we're redefining a function. */
3729 if (DECL_ARGUMENTS (olddecl
))
3730 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3733 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3734 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3736 /* Now preserve various other info from the definition. */
3737 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3738 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3739 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3740 COPY_DECL_ASSEMBLER_NAME (olddecl
, newdecl
);
3742 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3746 function_size
= sizeof (struct tree_decl
);
3748 memcpy ((char *) olddecl
+ sizeof (struct tree_common
),
3749 (char *) newdecl
+ sizeof (struct tree_common
),
3750 function_size
- sizeof (struct tree_common
));
3752 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3754 /* If newdecl is a template instantiation, it is possible that
3755 the following sequence of events has occurred:
3757 o A friend function was declared in a class template. The
3758 class template was instantiated.
3760 o The instantiation of the friend declaration was
3761 recorded on the instantiation list, and is newdecl.
3763 o Later, however, instantiate_class_template called pushdecl
3764 on the newdecl to perform name injection. But, pushdecl in
3765 turn called duplicate_decls when it discovered that another
3766 declaration of a global function with the same name already
3769 o Here, in duplicate_decls, we decided to clobber newdecl.
3771 If we're going to do that, we'd better make sure that
3772 olddecl, and not newdecl, is on the list of
3773 instantiations so that if we try to do the instantiation
3774 again we won't get the clobbered declaration. */
3776 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3777 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3779 for (; decls
; decls
= TREE_CHAIN (decls
))
3780 if (TREE_VALUE (decls
) == newdecl
)
3781 TREE_VALUE (decls
) = olddecl
;
3786 memcpy ((char *) olddecl
+ sizeof (struct tree_common
),
3787 (char *) newdecl
+ sizeof (struct tree_common
),
3788 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3789 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3792 DECL_UID (olddecl
) = olddecl_uid
;
3794 DECL_FRIEND_P (olddecl
) = 1;
3796 /* NEWDECL contains the merged attribute lists.
3797 Update OLDDECL to be the same. */
3798 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3803 /* Record a decl-node X as belonging to the current lexical scope.
3804 Check for errors (such as an incompatible declaration for the same
3805 name already seen in the same scope).
3807 Returns either X or an old decl for the same name.
3808 If an old decl is returned, it may have been smashed
3809 to agree with what X says. */
3817 int need_new_binding
;
3819 /* We shouldn't be calling pushdecl when we're generating RTL for a
3820 function that we already did semantic analysis on previously. */
3821 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3824 need_new_binding
= 1;
3826 if (DECL_TEMPLATE_PARM_P (x
))
3827 /* Template parameters have no context; they are not X::T even
3828 when declared within a class or namespace. */
3832 if (current_function_decl
&& x
!= current_function_decl
3833 /* A local declaration for a function doesn't constitute
3835 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3836 /* A local declaration for an `extern' variable is in the
3837 scope of the current namespace, not the current
3839 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3840 && !DECL_CONTEXT (x
))
3841 DECL_CONTEXT (x
) = current_function_decl
;
3843 /* If this is the declaration for a namespace-scope function,
3844 but the declaration itself is in a local scope, mark the
3846 if (TREE_CODE (x
) == FUNCTION_DECL
3847 && DECL_NAMESPACE_SCOPE_P (x
)
3848 && current_function_decl
3849 && x
!= current_function_decl
)
3850 DECL_LOCAL_FUNCTION_P (x
) = 1;
3853 name
= DECL_NAME (x
);
3856 int different_binding_level
= 0;
3858 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3859 name
= TREE_OPERAND (name
, 0);
3861 /* In case this decl was explicitly namespace-qualified, look it
3862 up in its namespace context. */
3863 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3864 && namespace_bindings_p ())
3865 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3867 t
= lookup_name_current_level (name
);
3869 /* [basic.link] If there is a visible declaration of an entity
3870 with linkage having the same name and type, ignoring entities
3871 declared outside the innermost enclosing namespace scope, the
3872 block scope declaration declares that same entity and
3873 receives the linkage of the previous declaration. */
3874 if (! t
&& current_function_decl
&& x
!= current_function_decl
3875 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3876 && DECL_EXTERNAL (x
))
3878 /* Look in block scope. */
3879 t
= IDENTIFIER_VALUE (name
);
3880 /* Or in the innermost namespace. */
3882 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3883 /* Does it have linkage? Note that if this isn't a DECL, it's an
3884 OVERLOAD, which is OK. */
3885 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3888 different_binding_level
= 1;
3891 /* If we are declaring a function, and the result of name-lookup
3892 was an OVERLOAD, look for an overloaded instance that is
3893 actually the same as the function we are declaring. (If
3894 there is one, we have to merge our declaration with the
3895 previous declaration.) */
3896 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3900 if (TREE_CODE (x
) == FUNCTION_DECL
)
3901 for (match
= t
; match
; match
= OVL_NEXT (match
))
3903 if (decls_match (OVL_CURRENT (match
), x
))
3907 /* Just choose one. */
3911 t
= OVL_CURRENT (match
);
3916 if (t
== error_mark_node
)
3918 /* error_mark_node is 0 for a while during initialization! */
3920 cp_error_at ("`%#D' used prior to declaration", x
);
3922 else if (t
!= NULL_TREE
)
3924 if (different_binding_level
)
3926 if (decls_match (x
, t
))
3927 /* The standard only says that the local extern
3928 inherits linkage from the previous decl; in
3929 particular, default args are not shared. It would
3930 be nice to propagate inlining info, though. FIXME. */
3931 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3933 else if (TREE_CODE (t
) == PARM_DECL
)
3935 if (DECL_CONTEXT (t
) == NULL_TREE
)
3936 /* This is probaby caused by too many errors, but calling
3937 abort will say that if errors have occurred. */
3940 /* Check for duplicate params. */
3941 if (duplicate_decls (x
, t
))
3944 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3945 || DECL_FUNCTION_TEMPLATE_P (x
))
3946 && is_overloaded_fn (t
))
3947 /* Don't do anything just yet. */;
3948 else if (t
== wchar_decl_node
)
3950 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3951 cp_pedwarn ("redeclaration of `wchar_t' as `%T'",
3954 /* Throw away the redeclaration. */
3957 else if (TREE_CODE (t
) != TREE_CODE (x
))
3959 if (duplicate_decls (x
, t
))
3962 else if (duplicate_decls (x
, t
))
3964 if (TREE_CODE (t
) == TYPE_DECL
)
3965 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3966 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3967 check_default_args (t
);
3971 else if (DECL_MAIN_P (x
))
3973 /* A redeclaration of main, but not a duplicate of the
3978 This function shall not be overloaded. */
3979 cp_error_at ("invalid redeclaration of `%D'", t
);
3980 cp_error ("as `%D'", x
);
3981 /* We don't try to push this declaration since that
3987 check_template_shadow (x
);
3989 /* If this is a function conjured up by the backend, massage it
3990 so it looks friendly. */
3991 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3993 retrofit_lang_decl (x
);
3994 SET_DECL_LANGUAGE (x
, lang_c
);
3997 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3999 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
4002 if (!namespace_bindings_p ())
4003 /* We do not need to create a binding for this name;
4004 push_overloaded_decl will have already done so if
4006 need_new_binding
= 0;
4008 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
4010 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
4012 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
4016 /* If declaring a type as a typedef, copy the type (unless we're
4017 at line 0), and install this TYPE_DECL as the new type's typedef
4018 name. See the extensive comment in ../c-decl.c (pushdecl). */
4019 if (TREE_CODE (x
) == TYPE_DECL
)
4021 tree type
= TREE_TYPE (x
);
4022 if (DECL_SOURCE_LINE (x
) == 0)
4024 if (TYPE_NAME (type
) == 0)
4025 TYPE_NAME (type
) = x
;
4027 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
4028 /* We don't want to copy the type when all we're
4029 doing is making a TYPE_DECL for the purposes of
4031 && (!TYPE_NAME (type
)
4032 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
4034 DECL_ORIGINAL_TYPE (x
) = type
;
4035 type
= build_type_copy (type
);
4036 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
4037 TYPE_NAME (type
) = x
;
4038 TREE_TYPE (x
) = type
;
4041 if (type
!= error_mark_node
4043 && TYPE_IDENTIFIER (type
))
4044 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4045 current_binding_level
);
4049 /* Multiple external decls of the same identifier ought to match.
4051 We get warnings about inline functions where they are defined.
4052 We get warnings about other functions from push_overloaded_decl.
4054 Avoid duplicate warnings where they are used. */
4055 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4059 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4060 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4061 decl
= OVL_FUNCTION (decl
);
4063 if (decl
&& decl
!= error_mark_node
4064 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4065 /* If different sort of thing, we already gave an error. */
4066 && TREE_CODE (decl
) == TREE_CODE (x
)
4067 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4069 cp_pedwarn ("type mismatch with previous external decl", x
);
4070 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4074 /* This name is new in its binding level.
4075 Install the new declaration and return it. */
4076 if (namespace_bindings_p ())
4078 /* Install a global value. */
4080 /* If the first global decl has external linkage,
4081 warn if we later see static one. */
4082 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4083 TREE_PUBLIC (name
) = 1;
4085 /* Bind the name for the entity. */
4086 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4088 && (TREE_CODE (x
) == TYPE_DECL
4089 || TREE_CODE (x
) == VAR_DECL
4090 || TREE_CODE (x
) == NAMESPACE_DECL
4091 || TREE_CODE (x
) == CONST_DECL
4092 || TREE_CODE (x
) == TEMPLATE_DECL
))
4093 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
4095 /* Don't forget if the function was used via an implicit decl. */
4096 if (IDENTIFIER_IMPLICIT_DECL (name
)
4097 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4100 /* Don't forget if its address was taken in that way. */
4101 if (IDENTIFIER_IMPLICIT_DECL (name
)
4102 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4103 TREE_ADDRESSABLE (x
) = 1;
4105 /* Warn about mismatches against previous implicit decl. */
4106 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4107 /* If this real decl matches the implicit, don't complain. */
4108 && ! (TREE_CODE (x
) == FUNCTION_DECL
4109 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4111 ("`%D' was previously implicitly declared to return `int'", x
);
4113 /* If new decl is `static' and an `extern' was seen previously,
4115 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4116 warn_extern_redeclared_static (x
, t
);
4120 /* Here to install a non-global value. */
4121 tree oldlocal
= IDENTIFIER_VALUE (name
);
4122 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4124 if (need_new_binding
)
4126 push_local_binding (name
, x
, 0);
4127 /* Because push_local_binding will hook X on to the
4128 current_binding_level's name list, we don't want to
4129 do that again below. */
4130 need_new_binding
= 0;
4133 /* If this is a TYPE_DECL, push it into the type value slot. */
4134 if (TREE_CODE (x
) == TYPE_DECL
)
4135 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4136 current_binding_level
);
4138 /* Clear out any TYPE_DECL shadowed by a namespace so that
4139 we won't think this is a type. The C struct hack doesn't
4140 go through namespaces. */
4141 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4142 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4143 current_binding_level
);
4150 && TREE_CODE (oldlocal
) == VAR_DECL
4151 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4152 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4154 if (oldlocal
== NULL_TREE
)
4155 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4158 /* If this is an extern function declaration, see if we
4159 have a global definition or declaration for the function. */
4160 if (oldlocal
== NULL_TREE
4161 && DECL_EXTERNAL (x
)
4162 && oldglobal
!= NULL_TREE
4163 && TREE_CODE (x
) == FUNCTION_DECL
4164 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4166 /* We have one. Their types must agree. */
4167 if (decls_match (x
, oldglobal
))
4171 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4172 cp_warning_at ("global declaration `%#D'", oldglobal
);
4175 /* If we have a local external declaration,
4176 and no file-scope declaration has yet been seen,
4177 then if we later have a file-scope decl it must not be static. */
4178 if (oldlocal
== NULL_TREE
4179 && oldglobal
== NULL_TREE
4180 && DECL_EXTERNAL (x
)
4182 TREE_PUBLIC (name
) = 1;
4184 /* Warn if shadowing an argument at the top level of the body. */
4185 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4186 /* Inline decls shadow nothing. */
4187 && !DECL_FROM_INLINE (x
)
4188 && TREE_CODE (oldlocal
) == PARM_DECL
4189 /* Don't complain if it's from an enclosing function. */
4190 && DECL_CONTEXT (oldlocal
) == current_function_decl
4191 && TREE_CODE (x
) != PARM_DECL
)
4193 /* Go to where the parms should be and see if we
4195 struct binding_level
*b
= current_binding_level
->level_chain
;
4201 if (b
->parm_flag
== 1)
4202 cp_error ("declaration of `%#D' shadows a parameter", name
);
4205 /* Maybe warn if shadowing something else. */
4206 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4207 /* Inline decls shadow nothing. */
4208 && !DECL_FROM_INLINE (x
)
4209 /* No shadow warnings for internally generated vars. */
4210 && ! DECL_ARTIFICIAL (x
)
4211 /* No shadow warnings for vars made for inlining. */
4212 && ! DECL_FROM_INLINE (x
))
4214 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4215 warning ("declaration of `%s' shadows a parameter",
4216 IDENTIFIER_POINTER (name
));
4217 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4218 && current_class_ptr
4219 && !TREE_STATIC (name
))
4220 warning ("declaration of `%s' shadows a member of `this'",
4221 IDENTIFIER_POINTER (name
));
4222 else if (oldlocal
!= NULL_TREE
)
4223 warning ("declaration of `%s' shadows previous local",
4224 IDENTIFIER_POINTER (name
));
4225 else if (oldglobal
!= NULL_TREE
)
4226 /* XXX shadow warnings in outer-more namespaces */
4227 warning ("declaration of `%s' shadows global declaration",
4228 IDENTIFIER_POINTER (name
));
4232 if (TREE_CODE (x
) == FUNCTION_DECL
)
4233 check_default_args (x
);
4235 /* Keep count of variables in this level with incomplete type. */
4236 if (TREE_CODE (x
) == VAR_DECL
4237 && TREE_TYPE (x
) != error_mark_node
4238 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4239 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4240 /* RTTI TD entries are created while defining the type_info. */
4241 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4242 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4244 if (namespace_bindings_p ())
4245 namespace_scope_incomplete
4246 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4248 current_binding_level
->incomplete
4249 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4253 if (need_new_binding
)
4254 add_decl_to_level (x
,
4255 DECL_NAMESPACE_SCOPE_P (x
)
4256 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4257 : current_binding_level
);
4262 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4263 caller to set DECL_CONTEXT properly. */
4266 pushdecl_with_scope (x
, level
)
4268 struct binding_level
*level
;
4270 register struct binding_level
*b
;
4271 tree function_decl
= current_function_decl
;
4273 current_function_decl
= NULL_TREE
;
4274 if (level
->parm_flag
== 2)
4276 b
= class_binding_level
;
4277 class_binding_level
= level
;
4278 pushdecl_class_level (x
);
4279 class_binding_level
= b
;
4283 b
= current_binding_level
;
4284 current_binding_level
= level
;
4286 current_binding_level
= b
;
4288 current_function_decl
= function_decl
;
4292 /* Like pushdecl, only it places X in the current namespace,
4296 pushdecl_namespace_level (x
)
4299 register struct binding_level
*b
= current_binding_level
;
4302 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4304 /* Now, the type_shadowed stack may screw us. Munge it so it does
4306 if (TREE_CODE (x
) == TYPE_DECL
)
4308 tree name
= DECL_NAME (x
);
4310 tree
*ptr
= (tree
*)0;
4311 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4313 tree shadowed
= b
->type_shadowed
;
4314 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4315 if (TREE_PURPOSE (shadowed
) == name
)
4317 ptr
= &TREE_VALUE (shadowed
);
4318 /* Can't break out of the loop here because sometimes
4319 a binding level will have duplicate bindings for
4320 PT names. It's gross, but I haven't time to fix it. */
4323 newval
= TREE_TYPE (x
);
4324 if (ptr
== (tree
*)0)
4326 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4327 up here if this is changed to an assertion. --KR */
4328 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4338 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4342 pushdecl_top_level (x
)
4345 push_to_top_level ();
4346 x
= pushdecl_namespace_level (x
);
4347 pop_from_top_level ();
4351 /* Make the declaration of X appear in CLASS scope. */
4354 pushdecl_class_level (x
)
4357 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4358 scope looks for the pre-mangled name. */
4361 if (TREE_CODE (x
) == OVERLOAD
)
4362 x
= OVL_CURRENT (x
);
4363 name
= DECL_NAME (x
);
4367 push_class_level_binding (name
, x
);
4368 if (TREE_CODE (x
) == TYPE_DECL
)
4369 set_identifier_type_value (name
, TREE_TYPE (x
));
4371 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4375 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4378 pushdecl_class_level (f
);
4382 /* Enter DECL into the symbol table, if that's appropriate. Returns
4383 DECL, or a modified version thereof. */
4386 maybe_push_decl (decl
)
4389 tree type
= TREE_TYPE (decl
);
4391 /* Add this decl to the current binding level, but not if it comes
4392 from another scope, e.g. a static member variable. TEM may equal
4393 DECL or it may be a previous decl of the same name. */
4394 if (decl
== error_mark_node
4395 || (TREE_CODE (decl
) != PARM_DECL
4396 && DECL_CONTEXT (decl
) != NULL_TREE
4397 /* Definitions of namespace members outside their namespace are
4399 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4400 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4401 || TREE_CODE (type
) == UNKNOWN_TYPE
4402 /* The declaration of a template specialization does not affect
4403 the functions available for overload resolution, so we do not
4405 || (TREE_CODE (decl
) == FUNCTION_DECL
4406 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4409 return pushdecl (decl
);
4412 /* Make the declaration(s) of X appear in CLASS scope
4413 under the name NAME. */
4416 push_class_level_binding (name
, x
)
4421 /* The class_binding_level will be NULL if x is a template
4422 parameter name in a member template. */
4423 if (!class_binding_level
)
4426 /* Make sure that this new member does not have the same name
4427 as a template parameter. */
4428 if (TYPE_BEING_DEFINED (current_class_type
))
4429 check_template_shadow (x
);
4431 /* If this declaration shadows a declaration from an enclosing
4432 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4433 we leave this class. Record the shadowed declaration here. */
4434 binding
= IDENTIFIER_BINDING (name
);
4436 && ((TREE_CODE (x
) == OVERLOAD
4437 && BINDING_VALUE (binding
)
4438 && is_overloaded_fn (BINDING_VALUE (binding
)))
4439 || INHERITED_VALUE_BINDING_P (binding
)))
4444 /* If the old binding was from a base class, and was for a tag
4445 name, slide it over to make room for the new binding. The
4446 old binding is still visible if explicitly qualified with a
4448 if (INHERITED_VALUE_BINDING_P (binding
)
4449 && BINDING_VALUE (binding
)
4450 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4451 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4452 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4454 old_decl
= BINDING_TYPE (binding
);
4455 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4456 BINDING_VALUE (binding
) = NULL_TREE
;
4457 INHERITED_VALUE_BINDING_P (binding
) = 0;
4460 old_decl
= BINDING_VALUE (binding
);
4462 /* Find the previous binding of name on the class-shadowed
4463 list, and update it. */
4464 for (shadow
= class_binding_level
->class_shadowed
;
4466 shadow
= TREE_CHAIN (shadow
))
4467 if (TREE_PURPOSE (shadow
) == name
4468 && TREE_TYPE (shadow
) == old_decl
)
4470 BINDING_VALUE (binding
) = x
;
4471 INHERITED_VALUE_BINDING_P (binding
) = 0;
4472 TREE_TYPE (shadow
) = x
;
4473 IDENTIFIER_CLASS_VALUE (name
) = x
;
4478 /* If we didn't replace an existing binding, put the binding on the
4479 stack of bindings for the identifier, and update the shadowed list. */
4480 if (push_class_binding (name
, x
))
4482 class_binding_level
->class_shadowed
4483 = tree_cons (name
, NULL
,
4484 class_binding_level
->class_shadowed
);
4485 /* Record the value we are binding NAME to so that we can know
4486 what to pop later. */
4487 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4491 /* Insert another USING_DECL into the current binding level, returning
4492 this declaration. If this is a redeclaration, do nothing, and
4493 return NULL_TREE if this not in namespace scope (in namespace
4494 scope, a using decl might extend any previous bindings). */
4497 push_using_decl (scope
, name
)
4503 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4504 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4505 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4506 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4509 return namespace_bindings_p () ? decl
: NULL_TREE
;
4510 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4511 DECL_INITIAL (decl
) = scope
;
4512 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4513 current_binding_level
->usings
= decl
;
4517 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4518 changed (i.e. there was already a directive), or the fresh
4519 TREE_LIST otherwise. */
4522 push_using_directive (used
)
4525 tree ud
= current_binding_level
->using_directives
;
4526 tree iter
, ancestor
;
4528 /* Check if we already have this. */
4529 if (purpose_member (used
, ud
) != NULL_TREE
)
4532 /* Recursively add all namespaces used. */
4533 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4534 push_using_directive (TREE_PURPOSE (iter
));
4536 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4537 ud
= current_binding_level
->using_directives
;
4538 ud
= tree_cons (used
, ancestor
, ud
);
4539 current_binding_level
->using_directives
= ud
;
4543 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4544 other definitions already in place. We get around this by making
4545 the value of the identifier point to a list of all the things that
4546 want to be referenced by that name. It is then up to the users of
4547 that name to decide what to do with that list.
4549 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4550 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4552 FLAGS is a bitwise-or of the following values:
4553 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4555 PUSH_USING: DECL is being pushed as the result of a using
4558 The value returned may be a previous declaration if we guessed wrong
4559 about what language DECL should belong to (C or C++). Otherwise,
4560 it's always DECL (and never something that's not a _DECL). */
4563 push_overloaded_decl (decl
, flags
)
4567 tree name
= DECL_NAME (decl
);
4570 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4573 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4575 old
= lookup_name_current_level (name
);
4579 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4581 tree t
= TREE_TYPE (old
);
4582 if (IS_AGGR_TYPE (t
) && warn_shadow
4583 && (! DECL_IN_SYSTEM_HEADER (decl
)
4584 || ! DECL_IN_SYSTEM_HEADER (old
)))
4585 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4588 else if (is_overloaded_fn (old
))
4592 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4594 tree fn
= OVL_CURRENT (tmp
);
4596 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4597 && !(flags
& PUSH_USING
)
4598 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4599 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4600 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4603 if (duplicate_decls (decl
, fn
))
4607 else if (old
== error_mark_node
)
4608 /* Ignore the undefined symbol marker. */
4612 cp_error_at ("previous non-function declaration `%#D'", old
);
4613 cp_error ("conflicts with function declaration `%#D'", decl
);
4618 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4620 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4621 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4623 new_binding
= ovl_cons (decl
, old
);
4624 if (flags
& PUSH_USING
)
4625 OVL_USED (new_binding
) = 1;
4628 /* NAME is not ambiguous. */
4632 set_namespace_binding (name
, current_namespace
, new_binding
);
4635 /* We only create an OVERLOAD if there was a previous binding at
4636 this level, or if decl is a template. In the former case, we
4637 need to remove the old binding and replace it with the new
4638 binding. We must also run through the NAMES on the binding
4639 level where the name was bound to update the chain. */
4641 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4645 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4647 d
= &TREE_CHAIN (*d
))
4649 || (TREE_CODE (*d
) == TREE_LIST
4650 && TREE_VALUE (*d
) == old
))
4652 if (TREE_CODE (*d
) == TREE_LIST
)
4653 /* Just replace the old binding with the new. */
4654 TREE_VALUE (*d
) = new_binding
;
4656 /* Build a TREE_LIST to wrap the OVERLOAD. */
4657 *d
= tree_cons (NULL_TREE
, new_binding
,
4660 /* And update the CPLUS_BINDING node. */
4661 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4666 /* We should always find a previous binding in this case. */
4667 my_friendly_abort (0);
4670 /* Install the new binding. */
4671 push_local_binding (name
, new_binding
, flags
);
4677 /* Generate an implicit declaration for identifier FUNCTIONID
4678 as a function of type int (). Print a warning if appropriate. */
4681 implicitly_declare (functionid
)
4686 /* We used to reuse an old implicit decl here,
4687 but this loses with inline functions because it can clobber
4688 the saved decl chains. */
4689 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4691 DECL_EXTERNAL (decl
) = 1;
4692 TREE_PUBLIC (decl
) = 1;
4694 /* ISO standard says implicit declarations are in the innermost block.
4695 So we record the decl in the standard fashion. */
4697 rest_of_decl_compilation (decl
, NULL
, 0, 0);
4700 /* Only one warning per identifier. */
4701 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4703 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4706 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4711 /* Return zero if the declaration NEWDECL is valid
4712 when the declaration OLDDECL (assumed to be for the same name)
4713 has already been seen.
4714 Otherwise return an error message format string with a %s
4715 where the identifier should go. */
4718 redeclaration_error_message (newdecl
, olddecl
)
4719 tree newdecl
, olddecl
;
4721 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4723 /* Because C++ can put things into name space for free,
4724 constructs like "typedef struct foo { ... } foo"
4725 would look like an erroneous redeclaration. */
4726 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4729 return "redefinition of `%#D'";
4731 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4733 /* If this is a pure function, its olddecl will actually be
4734 the original initialization to `0' (which we force to call
4735 abort()). Don't complain about redefinition in this case. */
4736 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4739 /* If both functions come from different namespaces, this is not
4740 a redeclaration - this is a conflict with a used function. */
4741 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4742 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4743 return "`%D' conflicts with used function";
4745 /* We'll complain about linkage mismatches in
4746 warn_extern_redeclared_static. */
4748 /* Defining the same name twice is no good. */
4749 if (DECL_INITIAL (olddecl
) != NULL_TREE
4750 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4752 if (DECL_NAME (olddecl
) == NULL_TREE
)
4753 return "`%#D' not declared in class";
4755 return "redefinition of `%#D'";
4759 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4761 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4762 && (DECL_TEMPLATE_RESULT (newdecl
)
4763 != DECL_TEMPLATE_RESULT (olddecl
))
4764 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4765 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4766 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4767 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4768 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4769 return "redefinition of `%#D'";
4772 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4774 /* Objects declared at top level: */
4775 /* If at least one is a reference, it's ok. */
4776 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4778 /* Reject two definitions. */
4779 return "redefinition of `%#D'";
4783 /* Objects declared with block scope: */
4784 /* Reject two definitions, and reject a definition
4785 together with an external reference. */
4786 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4787 return "redeclaration of `%#D'";
4792 /* Create a new label, named ID. */
4795 make_label_decl (id
, local_p
)
4801 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4803 /* Make sure every label has an rtx. */
4806 DECL_CONTEXT (decl
) = current_function_decl
;
4807 DECL_MODE (decl
) = VOIDmode
;
4808 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4810 /* Say where one reference is to the label, for the sake of the
4811 error if it is not defined. */
4812 DECL_SOURCE_LINE (decl
) = lineno
;
4813 DECL_SOURCE_FILE (decl
) = input_filename
;
4815 /* Record the fact that this identifier is bound to this label. */
4816 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4821 /* Record this label on the list of used labels so that we can check
4822 at the end of the function to see whether or not the label was
4823 actually defined, and so we can check when the label is defined whether
4824 this use is valid. */
4830 if (named_label_uses
== NULL
4831 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4832 || named_label_uses
->label_decl
!= decl
)
4834 struct named_label_use_list
*new_ent
;
4835 new_ent
= ((struct named_label_use_list
*)
4836 ggc_alloc (sizeof (struct named_label_use_list
)));
4837 new_ent
->label_decl
= decl
;
4838 new_ent
->names_in_scope
= current_binding_level
->names
;
4839 new_ent
->binding_level
= current_binding_level
;
4840 new_ent
->lineno_o_goto
= lineno
;
4841 new_ent
->filename_o_goto
= input_filename
;
4842 new_ent
->next
= named_label_uses
;
4843 named_label_uses
= new_ent
;
4847 /* Look for a label named ID in the current function. If one cannot
4848 be found, create one. (We keep track of used, but undefined,
4849 labels, and complain about them at the end of a function.) */
4856 struct named_label_list
*ent
;
4858 /* You can't use labels at global scope. */
4859 if (current_function_decl
== NULL_TREE
)
4861 error ("label `%s' referenced outside of any function",
4862 IDENTIFIER_POINTER (id
));
4866 /* See if we've already got this label. */
4867 decl
= IDENTIFIER_LABEL_VALUE (id
);
4868 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4871 /* Record this label on the list of labels used in this function.
4872 We do this before calling make_label_decl so that we get the
4873 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4874 ent
= ((struct named_label_list
*)
4875 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4876 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4877 ent
->next
= named_labels
;
4880 /* We need a new label. */
4881 decl
= make_label_decl (id
, /*local_p=*/0);
4883 /* Now fill in the information we didn't have before. */
4884 ent
->label_decl
= decl
;
4889 /* Declare a local label named ID. */
4892 declare_local_label (id
)
4897 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4898 this scope we can restore the old value of
4899 IDENTIFIER_TYPE_VALUE. */
4900 current_binding_level
->shadowed_labels
4901 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4902 current_binding_level
->shadowed_labels
);
4903 /* Look for the label. */
4904 decl
= make_label_decl (id
, /*local_p=*/1);
4905 /* Now fill in the information we didn't have before. */
4906 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4911 /* Returns nonzero if it is ill-formed to jump past the declaration of
4912 DECL. Returns 2 if it's also a real problem. */
4915 decl_jump_unsafe (decl
)
4918 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4921 if (DECL_INITIAL (decl
) == NULL_TREE
4922 && pod_type_p (TREE_TYPE (decl
)))
4925 /* This is really only important if we're crossing an initialization.
4926 The POD stuff is just pedantry; why should it matter if the class
4927 contains a field of pointer to member type? */
4928 if (DECL_INITIAL (decl
)
4929 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4934 /* Check that a single previously seen jump to a newly defined label
4935 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4936 the jump context; NAMES are the names in scope in LEVEL at the jump
4937 context; FILE and LINE are the source position of the jump or 0. */
4940 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4942 struct binding_level
*level
;
4949 struct binding_level
*b
= current_binding_level
;
4950 for (; b
; b
= b
->level_chain
)
4952 tree new_decls
= b
->names
;
4953 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4954 for (; new_decls
!= old_decls
;
4955 new_decls
= TREE_CHAIN (new_decls
))
4957 int problem
= decl_jump_unsafe (new_decls
);
4964 cp_pedwarn ("jump to label `%D'", decl
);
4966 pedwarn ("jump to case label");
4969 pedwarn_with_file_and_line (file
, line
, " from here");
4974 cp_error_at (" crosses initialization of `%#D'",
4977 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4983 if ((b
->is_try_scope
|| b
->is_catch_scope
) && ! saw_eh
)
4988 cp_pedwarn ("jump to label `%D'", decl
);
4990 pedwarn ("jump to case label");
4993 pedwarn_with_file_and_line (file
, line
, " from here");
4996 if (b
->is_try_scope
)
4997 error (" enters try block");
4999 error (" enters catch block");
5006 check_previous_goto (use
)
5007 struct named_label_use_list
*use
;
5009 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
5010 use
->names_in_scope
, use
->filename_o_goto
,
5011 use
->lineno_o_goto
);
5015 check_switch_goto (level
)
5016 struct binding_level
*level
;
5018 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
5021 /* Check that any previously seen jumps to a newly defined label DECL
5022 are OK. Called by define_label. */
5025 check_previous_gotos (decl
)
5028 struct named_label_use_list
**usep
;
5030 if (! TREE_USED (decl
))
5033 for (usep
= &named_label_uses
; *usep
; )
5035 struct named_label_use_list
*use
= *usep
;
5036 if (use
->label_decl
== decl
)
5038 check_previous_goto (use
);
5042 usep
= &(use
->next
);
5046 /* Check that a new jump to a label DECL is OK. Called by
5047 finish_goto_stmt. */
5055 struct named_label_list
*lab
;
5057 /* We can't know where a computed goto is jumping. So we assume
5059 if (! DECL_P (decl
))
5062 /* If the label hasn't been defined yet, defer checking. */
5063 if (! DECL_INITIAL (decl
))
5069 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5070 if (decl
== lab
->label_decl
)
5073 /* If the label is not on named_labels it's a gcc local label, so
5074 it must be in an outer scope, so jumping to it is always OK. */
5078 if ((lab
->in_try_scope
|| lab
->in_catch_scope
|| lab
->bad_decls
)
5081 cp_pedwarn_at ("jump to label `%D'", decl
);
5082 pedwarn (" from here");
5086 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5088 tree b
= TREE_VALUE (bad
);
5089 int u
= decl_jump_unsafe (b
);
5091 if (u
> 1 && DECL_ARTIFICIAL (b
))
5092 /* Can't skip init of __exception_info. */
5093 cp_error_at (" enters catch block", b
);
5095 cp_error_at (" skips initialization of `%#D'", b
);
5097 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5100 if (lab
->in_try_scope
)
5101 error (" enters try block");
5102 else if (lab
->in_catch_scope
)
5103 error (" enters catch block");
5106 /* Define a label, specifying the location in the source file.
5107 Return the LABEL_DECL node for the label, if the definition is valid.
5108 Otherwise return 0. */
5111 define_label (filename
, line
, name
)
5112 const char *filename
;
5116 tree decl
= lookup_label (name
);
5117 struct named_label_list
*ent
;
5118 register struct binding_level
*p
;
5120 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5121 if (ent
->label_decl
== decl
)
5124 /* After labels, make any new cleanups in the function go into their
5125 own new (temporary) binding contour. */
5126 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5127 p
->more_cleanups_ok
= 0;
5129 if (name
== get_identifier ("wchar_t"))
5130 cp_pedwarn ("label named wchar_t");
5132 if (DECL_INITIAL (decl
) != NULL_TREE
)
5134 cp_error ("duplicate label `%D'", decl
);
5139 /* Mark label as having been defined. */
5140 DECL_INITIAL (decl
) = error_mark_node
;
5141 /* Say where in the source. */
5142 DECL_SOURCE_FILE (decl
) = filename
;
5143 DECL_SOURCE_LINE (decl
) = line
;
5146 ent
->names_in_scope
= current_binding_level
->names
;
5147 ent
->binding_level
= current_binding_level
;
5149 check_previous_gotos (decl
);
5156 struct binding_level
*level
;
5157 struct cp_switch
*next
;
5158 /* The SWITCH_STMT being built. */
5160 /* A splay-tree mapping the low element of a case range to the high
5161 element, or NULL_TREE if there is no high element. Used to
5162 determine whether or not a new case label duplicates an old case
5163 label. We need a tree, rather than simply a hash table, because
5164 of the GNU case range extension. */
5168 /* A stack of the currently active switch statements. The innermost
5169 switch statement is on the top of the stack. There is no need to
5170 mark the stack for garbage collection because it is only active
5171 during the processing of the body of a function, and we never
5172 collect at that point. */
5174 static struct cp_switch
*switch_stack
;
5176 /* Called right after a switch-statement condition is parsed.
5177 SWITCH_STMT is the switch statement being parsed. */
5180 push_switch (switch_stmt
)
5184 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5185 p
->level
= current_binding_level
;
5186 p
->next
= switch_stack
;
5187 p
->switch_stmt
= switch_stmt
;
5188 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5195 struct cp_switch
*cs
;
5198 splay_tree_delete (cs
->cases
);
5199 switch_stack
= switch_stack
->next
;
5203 /* Note that we've seen a definition of a case label, and complain if this
5204 is a bad place for one. */
5207 finish_case_label (low_value
, high_value
)
5212 register struct binding_level
*p
;
5217 error ("case label not within a switch statement");
5219 cp_error ("case label `%E' not within a switch statement",
5222 error ("`default' label not within a switch statement");
5226 if (processing_template_decl
)
5230 /* For templates, just add the case label; we'll do semantic
5231 analysis at instantiation-time. */
5232 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5233 return add_stmt (build_case_label (low_value
, high_value
, label
));
5236 /* Find the condition on which this switch statement depends. */
5237 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5238 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5239 cond
= TREE_VALUE (cond
);
5241 r
= c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5242 if (r
== error_mark_node
)
5245 check_switch_goto (switch_stack
->level
);
5247 /* After labels, make any new cleanups in the function go into their
5248 own new (temporary) binding contour. */
5249 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5250 p
->more_cleanups_ok
= 0;
5255 /* Return the list of declarations of the current level.
5256 Note that this list is in reverse order unless/until
5257 you nreverse it; and when you do nreverse it, you must
5258 store the result back using `storedecls' or you will lose. */
5263 return current_binding_level
->names
;
5266 /* Return the list of type-tags (for structs, etc) of the current level. */
5271 return current_binding_level
->tags
;
5274 /* Store the list of declarations of the current level.
5275 This is done for the parameter declarations of a function being defined,
5276 after they are modified in the light of any missing parameters. */
5282 current_binding_level
->names
= decls
;
5285 /* Similarly, store the list of tags of the current level. */
5291 current_binding_level
->tags
= tags
;
5294 /* Given NAME, an IDENTIFIER_NODE,
5295 return the structure (or union or enum) definition for that name.
5296 Searches binding levels from BINDING_LEVEL up to the global level.
5297 If THISLEVEL_ONLY is nonzero, searches only the specified context
5298 (but skips any tag-transparent contexts to find one that is
5299 meaningful for tags).
5300 FORM says which kind of type the caller wants;
5301 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5302 If the wrong kind of type is found, and it's not a template, an error is
5306 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5307 enum tree_code form
;
5309 struct binding_level
*binding_level
;
5312 register struct binding_level
*level
;
5313 /* Non-zero if, we should look past a template parameter level, even
5314 if THISLEVEL_ONLY. */
5315 int allow_template_parms_p
= 1;
5317 for (level
= binding_level
; level
; level
= level
->level_chain
)
5320 if (ANON_AGGRNAME_P (name
))
5321 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5323 /* There's no need for error checking here, because
5324 anon names are unique throughout the compilation. */
5325 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5326 return TREE_VALUE (tail
);
5328 else if (level
->namespace_p
)
5329 /* Do namespace lookup. */
5330 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5332 tree old
= binding_for_name (name
, tail
);
5334 /* If we just skipped past a template parameter level,
5335 even though THISLEVEL_ONLY, and we find a template
5336 class declaration, then we use the _TYPE node for the
5337 template. See the example below. */
5338 if (thislevel_only
&& !allow_template_parms_p
5339 && old
&& BINDING_VALUE (old
)
5340 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5341 old
= TREE_TYPE (BINDING_VALUE (old
));
5343 old
= BINDING_TYPE (old
);
5345 /* If it has an original type, it is a typedef, and we
5346 should not return it. */
5347 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5349 if (old
&& TREE_CODE (old
) != form
5350 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5352 cp_error ("`%#D' redeclared as %C", old
, form
);
5357 if (thislevel_only
|| tail
== global_namespace
)
5361 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5363 if (TREE_PURPOSE (tail
) == name
)
5365 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5366 /* Should tighten this up; it'll probably permit
5367 UNION_TYPE and a struct template, for example. */
5369 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5371 /* Definition isn't the kind we were looking for. */
5372 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5376 return TREE_VALUE (tail
);
5379 if (thislevel_only
&& ! level
->tag_transparent
)
5381 if (level
->template_parms_p
&& allow_template_parms_p
)
5383 /* We must deal with cases like this:
5385 template <class T> struct S;
5386 template <class T> struct S {};
5388 When looking up `S', for the second declaration, we
5389 would like to find the first declaration. But, we
5390 are in the pseudo-global level created for the
5391 template parameters, rather than the (surrounding)
5392 namespace level. Thus, we keep going one more level,
5393 even though THISLEVEL_ONLY is non-zero. */
5394 allow_template_parms_p
= 0;
5406 set_current_level_tags_transparency (tags_transparent
)
5407 int tags_transparent
;
5409 current_binding_level
->tag_transparent
= tags_transparent
;
5413 /* Given a type, find the tag that was defined for it and return the tag name.
5414 Otherwise return 0. However, the value can never be 0
5415 in the cases in which this is used.
5417 C++: If NAME is non-zero, this is the new name to install. This is
5418 done when replacing anonymous tags with real tag names. */
5421 lookup_tag_reverse (type
, name
)
5425 register struct binding_level
*level
;
5427 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5430 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5432 if (TREE_VALUE (tail
) == type
)
5435 TREE_PURPOSE (tail
) = name
;
5436 return TREE_PURPOSE (tail
);
5443 /* Look up NAME in the NAMESPACE. */
5446 lookup_namespace_name (namespace, name
)
5447 tree
namespace, name
;
5450 tree template_id
= NULL_TREE
;
5452 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5454 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5455 /* This happens for A::B<int> when B is a namespace. */
5457 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5459 /* This happens for A::B where B is a template, and there are no
5460 template arguments. */
5461 cp_error ("invalid use of `%D'", name
);
5462 return error_mark_node
;
5465 namespace = ORIGINAL_NAMESPACE (namespace);
5467 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5470 name
= TREE_OPERAND (name
, 0);
5471 if (TREE_CODE (name
) == OVERLOAD
)
5472 name
= DECL_NAME (OVL_CURRENT (name
));
5473 else if (DECL_P (name
))
5474 name
= DECL_NAME (name
);
5477 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5479 val
= make_node (CPLUS_BINDING
);
5480 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5481 return error_mark_node
;
5483 if (BINDING_VALUE (val
))
5485 val
= BINDING_VALUE (val
);
5489 if (DECL_CLASS_TEMPLATE_P (val
))
5490 val
= lookup_template_class (val
,
5491 TREE_OPERAND (template_id
, 1),
5492 /*in_decl=*/NULL_TREE
,
5493 /*context=*/NULL_TREE
,
5494 /*entering_scope=*/0,
5496 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5497 || TREE_CODE (val
) == OVERLOAD
)
5498 val
= lookup_template_function (val
,
5499 TREE_OPERAND (template_id
, 1));
5502 cp_error ("`%D::%D' is not a template",
5504 return error_mark_node
;
5508 /* If we have a single function from a using decl, pull it out. */
5509 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5510 val
= OVL_FUNCTION (val
);
5514 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5515 return error_mark_node
;
5518 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5520 static unsigned long
5528 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5529 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5534 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5537 typename_compare (k1
, k2
)
5548 d1
= TYPE_NAME (t1
);
5549 d2
= TYPE_NAME (t2
);
5551 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5552 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5553 && ((TREE_TYPE (t1
) != NULL_TREE
)
5554 == (TREE_TYPE (t2
) != NULL_TREE
))
5555 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5556 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5559 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5560 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5561 is non-NULL, this type is being created by the implicit typename
5562 extension, and BASE_TYPE is a type named `t' in some base class of
5563 `T' which depends on template parameters.
5565 Returns the new TYPENAME_TYPE. */
5568 build_typename_type (context
, name
, fullname
, base_type
)
5576 struct hash_entry
*e
;
5578 static struct hash_table ht
;
5582 static struct hash_table
*h
= &ht
;
5584 hash_table_init (&ht
, &hash_newfunc
, &typename_hash
, &typename_compare
);
5585 ggc_add_tree_hash_table_root (&h
, 1);
5588 /* Build the TYPENAME_TYPE. */
5589 t
= make_aggr_type (TYPENAME_TYPE
);
5590 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5591 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5592 TREE_TYPE (t
) = base_type
;
5594 /* Build the corresponding TYPE_DECL. */
5595 d
= build_decl (TYPE_DECL
, name
, t
);
5596 TYPE_NAME (TREE_TYPE (d
)) = d
;
5597 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5598 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5599 DECL_ARTIFICIAL (d
) = 1;
5601 /* See if we already have this type. */
5602 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5606 /* Insert the type into the table. */
5607 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5612 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5613 unless an error occurs, in which case error_mark_node is returned.
5614 If COMPLAIN zero, don't complain about any errors that occur. */
5617 make_typename_type (context
, name
, complain
)
5625 if (!(TYPE_LANG_SPECIFIC (name
)
5626 && (CLASSTYPE_IS_TEMPLATE (name
)
5627 || CLASSTYPE_USE_TEMPLATE (name
))))
5628 name
= TYPE_IDENTIFIER (name
);
5630 /* Create a TEMPLATE_ID_EXPR for the type. */
5631 name
= build_nt (TEMPLATE_ID_EXPR
,
5632 CLASSTYPE_TI_TEMPLATE (name
),
5633 CLASSTYPE_TI_ARGS (name
));
5635 else if (TREE_CODE (name
) == TYPE_DECL
)
5636 name
= DECL_NAME (name
);
5640 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5642 name
= TREE_OPERAND (name
, 0);
5643 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5644 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5646 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5647 my_friendly_abort (2000);
5649 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5651 /* We can get here from typename_sub0 in the explicit_template_type
5652 expansion. Just fail. */
5654 cp_error ("no class template named `%#T' in `%#T'",
5656 return error_mark_node
;
5659 if (! uses_template_parms (context
)
5660 || currently_open_class (context
))
5662 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5664 tree tmpl
= NULL_TREE
;
5665 if (IS_AGGR_TYPE (context
))
5666 tmpl
= lookup_field (context
, name
, 0, 0);
5667 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5670 cp_error ("no class template named `%#T' in `%#T'",
5672 return error_mark_node
;
5675 return lookup_template_class (tmpl
,
5676 TREE_OPERAND (fullname
, 1),
5678 /*entering_scope=*/0,
5685 if (!IS_AGGR_TYPE (context
))
5688 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5689 return error_mark_node
;
5692 t
= lookup_field (context
, name
, 0, 1);
5694 return TREE_TYPE (t
);
5698 /* If the CONTEXT is not a template type, then either the field is
5699 there now or its never going to be. */
5700 if (!uses_template_parms (context
))
5703 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5704 return error_mark_node
;
5708 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5711 /* Select the right _DECL from multiple choices. */
5714 select_decl (binding
, flags
)
5719 val
= BINDING_VALUE (binding
);
5721 /* When we implicitly declare some builtin entity, we mark it
5722 DECL_ANTICIPATED, so that we know to ignore it until it is
5724 if (val
&& DECL_P (val
)
5725 && DECL_LANG_SPECIFIC (val
)
5726 && DECL_ANTICIPATED (val
))
5729 if (LOOKUP_NAMESPACES_ONLY (flags
))
5731 /* We are not interested in types. */
5732 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5737 /* If we could have a type and
5738 we have nothing or we need a type and have none. */
5739 if (BINDING_TYPE (binding
)
5740 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5741 && TREE_CODE (val
) != TYPE_DECL
)))
5742 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5743 /* Don't return non-types if we really prefer types. */
5744 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5745 && (TREE_CODE (val
) != TEMPLATE_DECL
5746 || !DECL_CLASS_TEMPLATE_P (val
)))
5752 /* Unscoped lookup of a global: iterate over current namespaces,
5753 considering using-directives. If SPACESP is non-NULL, store a list
5754 of the namespaces we've considered in it. */
5757 unqualified_namespace_lookup (name
, flags
, spacesp
)
5762 tree b
= make_node (CPLUS_BINDING
);
5763 tree initial
= current_decl_namespace ();
5764 tree scope
= initial
;
5766 struct binding_level
*level
;
5767 tree val
= NULL_TREE
;
5770 *spacesp
= NULL_TREE
;
5772 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5775 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5776 val
= binding_for_name (name
, scope
);
5778 /* Initialize binding for this context. */
5779 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5780 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5782 /* Add all _DECLs seen through local using-directives. */
5783 for (level
= current_binding_level
;
5784 !level
->namespace_p
;
5785 level
= level
->level_chain
)
5786 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5787 scope
, flags
, spacesp
))
5788 /* Give up because of error. */
5789 return error_mark_node
;
5791 /* Add all _DECLs seen through global using-directives. */
5792 /* XXX local and global using lists should work equally. */
5796 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5797 scope
, flags
, spacesp
))
5798 /* Give up because of error. */
5799 return error_mark_node
;
5800 if (siter
== scope
) break;
5801 siter
= CP_DECL_CONTEXT (siter
);
5804 val
= select_decl (b
, flags
);
5805 if (scope
== global_namespace
)
5811 /* Combine prefer_type and namespaces_only into flags. */
5814 lookup_flags (prefer_type
, namespaces_only
)
5815 int prefer_type
, namespaces_only
;
5817 if (namespaces_only
)
5818 return LOOKUP_PREFER_NAMESPACES
;
5819 if (prefer_type
> 1)
5820 return LOOKUP_PREFER_TYPES
;
5821 if (prefer_type
> 0)
5822 return LOOKUP_PREFER_BOTH
;
5826 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5827 ignore it or not. Subroutine of lookup_name_real. */
5830 qualify_lookup (val
, flags
)
5834 if (val
== NULL_TREE
)
5836 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5838 if ((flags
& LOOKUP_PREFER_TYPES
)
5839 && (TREE_CODE (val
) == TYPE_DECL
5840 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5841 && DECL_CLASS_TEMPLATE_P (val
))))
5843 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5848 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5852 warn_about_implicit_typename_lookup (typename
, binding
)
5856 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5857 tree name
= DECL_NAME (typename
);
5859 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5860 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5861 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5862 && ! (TREE_CODE (binding
) == TYPE_DECL
5863 && same_type_p (TREE_TYPE (binding
), subtype
)))
5865 cp_warning ("lookup of `%D' finds `%#D'",
5867 cp_warning (" instead of `%D' from dependent base class",
5869 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5870 constructor_name (current_class_type
), name
);
5874 /* Look up NAME in the current binding level and its superiors in the
5875 namespace of variables, functions and typedefs. Return a ..._DECL
5876 node of some kind representing its definition if there is only one
5877 such declaration, or return a TREE_LIST with all the overloaded
5878 definitions if there are many, or return 0 if it is undefined.
5880 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5881 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5882 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5883 Otherwise we prefer non-TYPE_DECLs.
5885 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5886 using IDENTIFIER_CLASS_VALUE. */
5889 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5891 int prefer_type
, nonclass
, namespaces_only
;
5894 tree val
= NULL_TREE
;
5896 tree from_obj
= NULL_TREE
;
5898 int val_is_implicit_typename
= 0;
5900 /* Hack: copy flag set by parser, if set. */
5901 if (only_namespace_names
)
5902 namespaces_only
= 1;
5904 if (prefer_type
== -2)
5906 extern int looking_for_typename
;
5907 tree type
= NULL_TREE
;
5910 prefer_type
= looking_for_typename
;
5912 flags
= lookup_flags (prefer_type
, namespaces_only
);
5913 /* If the next thing is '<', class templates are types. */
5914 if (looking_for_template
)
5915 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5917 /* std:: becomes :: for now. */
5918 if (got_scope
&& got_scope
== fake_std_node
)
5919 got_scope
= void_type_node
;
5923 else if (got_object
!= error_mark_node
)
5928 if (type
== error_mark_node
)
5929 return error_mark_node
;
5930 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5931 type
= TREE_TYPE (type
);
5934 type
= complete_type (type
);
5936 if (TREE_CODE (type
) == VOID_TYPE
)
5937 type
= global_namespace
;
5938 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5940 val
= make_node (CPLUS_BINDING
);
5941 flags
|= LOOKUP_COMPLAIN
;
5942 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5944 val
= select_decl (val
, flags
);
5946 else if (! IS_AGGR_TYPE (type
)
5947 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5948 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5949 || TREE_CODE (type
) == TYPENAME_TYPE
)
5950 /* Someone else will give an error about this if needed. */
5952 else if (type
== current_class_type
)
5953 val
= IDENTIFIER_CLASS_VALUE (name
);
5956 val
= lookup_member (type
, name
, 0, prefer_type
);
5957 type_access_control (type
, val
);
5959 /* Restore the containing TYPENAME_TYPE if we looked
5960 through it before. */
5961 if (got_scope
&& got_scope
!= type
5962 && val
&& TREE_CODE (val
) == TYPE_DECL
5963 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5964 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5972 else if (got_object
&& val
)
5980 flags
= lookup_flags (prefer_type
, namespaces_only
);
5981 /* If we're not parsing, we need to complain. */
5982 flags
|= LOOKUP_COMPLAIN
;
5985 /* First, look in non-namespace scopes. */
5987 if (current_class_type
== NULL_TREE
)
5990 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5994 if (!LOCAL_BINDING_P (t
) && nonclass
)
5995 /* We're not looking for class-scoped bindings, so keep going. */
5998 /* If this is the kind of thing we're looking for, we're done. */
5999 if (qualify_lookup (BINDING_VALUE (t
), flags
))
6000 binding
= BINDING_VALUE (t
);
6001 else if ((flags
& LOOKUP_PREFER_TYPES
)
6002 && qualify_lookup (BINDING_TYPE (t
), flags
))
6003 binding
= BINDING_TYPE (t
);
6005 binding
= NULL_TREE
;
6007 /* Handle access control on types from enclosing or base classes. */
6008 if (binding
&& ! yylex
6009 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
6010 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
6013 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
6015 if (val_is_implicit_typename
&& !yylex
)
6016 warn_about_implicit_typename_lookup (val
, binding
);
6018 val_is_implicit_typename
6019 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
6020 if (!val_is_implicit_typename
)
6025 /* Now lookup in namespace scopes. */
6026 if (!val
|| val_is_implicit_typename
)
6028 t
= unqualified_namespace_lookup (name
, flags
, 0);
6031 if (val_is_implicit_typename
&& !yylex
)
6032 warn_about_implicit_typename_lookup (val
, t
);
6040 /* This should only warn about types used in qualified-ids. */
6041 if (from_obj
&& from_obj
!= val
)
6043 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
6044 && TREE_CODE (val
) == TYPE_DECL
6045 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
6047 lookup of `%D' in the scope of `%#T' (`%#D') \
6048 does not match lookup in the current scope (`%#D')",
6049 name
, got_object
, from_obj
, val
);
6051 /* We don't change val to from_obj if got_object depends on
6052 template parms because that breaks implicit typename for
6053 destructor calls. */
6054 if (! uses_template_parms (got_object
))
6058 /* If we have a single function from a using decl, pull it out. */
6059 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6060 val
= OVL_FUNCTION (val
);
6069 lookup_name_nonclass (name
)
6072 return lookup_name_real (name
, 0, 1, 0);
6076 lookup_function_nonclass (name
, args
)
6080 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6084 lookup_name_namespace_only (name
)
6087 /* type-or-namespace, nonclass, namespace_only */
6088 return lookup_name_real (name
, 1, 1, 1);
6092 lookup_name (name
, prefer_type
)
6096 return lookup_name_real (name
, prefer_type
, 0, 0);
6099 /* Similar to `lookup_name' but look only in the innermost non-class
6103 lookup_name_current_level (name
)
6106 struct binding_level
*b
;
6109 b
= current_binding_level
;
6110 while (b
->parm_flag
== 2)
6115 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6117 /* extern "C" function() */
6118 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6121 else if (IDENTIFIER_BINDING (name
)
6122 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6126 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6127 return IDENTIFIER_VALUE (name
);
6139 /* Like lookup_name_current_level, but for types. */
6142 lookup_type_current_level (name
)
6145 register tree t
= NULL_TREE
;
6147 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6149 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6150 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6152 struct binding_level
*b
= current_binding_level
;
6155 if (purpose_member (name
, b
->type_shadowed
))
6156 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6168 begin_only_namespace_names ()
6170 only_namespace_names
= 1;
6174 end_only_namespace_names ()
6176 only_namespace_names
= 0;
6179 /* Push the declarations of builtin types into the namespace.
6180 RID_INDEX is the index of the builtin type
6181 in the array RID_POINTERS. NAME is the name used when looking
6182 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6185 record_builtin_type (rid_index
, name
, type
)
6190 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6191 tree tdecl
= NULL_TREE
;
6193 if ((int) rid_index
< (int) RID_MAX
)
6194 rname
= ridpointers
[(int) rid_index
];
6196 tname
= get_identifier (name
);
6198 TYPE_BUILT_IN (type
) = 1;
6202 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6203 set_identifier_type_value (tname
, NULL_TREE
);
6204 if ((int) rid_index
< (int) RID_MAX
)
6205 /* Built-in types live in the global namespace. */
6206 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6208 if (rname
!= NULL_TREE
)
6210 if (tname
!= NULL_TREE
)
6212 set_identifier_type_value (rname
, NULL_TREE
);
6213 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6217 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6218 set_identifier_type_value (rname
, NULL_TREE
);
6223 /* Record one of the standard Java types.
6224 * Declare it as having the given NAME.
6225 * If SIZE > 0, it is the size of one of the integral types;
6226 * otherwise it is the negative of the size of one of the other types. */
6229 record_builtin_java_type (name
, size
)
6235 type
= make_signed_type (size
);
6236 else if (size
> -32)
6237 { /* "__java_char" or ""__java_boolean". */
6238 type
= make_unsigned_type (-size
);
6239 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6242 { /* "__java_float" or ""__java_double". */
6243 type
= make_node (REAL_TYPE
);
6244 TYPE_PRECISION (type
) = - size
;
6247 record_builtin_type (RID_MAX
, name
, type
);
6248 decl
= TYPE_NAME (type
);
6250 /* Suppress generate debug symbol entries for these types,
6251 since for normal C++ they are just clutter.
6252 However, push_lang_context undoes this if extern "Java" is seen. */
6253 DECL_IGNORED_P (decl
) = 1;
6255 TYPE_FOR_JAVA (type
) = 1;
6259 /* Push a type into the namespace so that the back-ends ignore it. */
6262 record_unknown_type (type
, name
)
6266 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6267 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6268 DECL_IGNORED_P (decl
) = 1;
6269 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6270 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6271 TYPE_ALIGN (type
) = 1;
6272 TYPE_USER_ALIGN (type
) = 0;
6273 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6276 /* An string for which we should create an IDENTIFIER_NODE at
6279 typedef struct predefined_identifier
6281 /* The name of the identifier. */
6283 /* The place where the IDENTIFIER_NODE should be stored. */
6285 /* Non-zero if this is the name of a constructor or destructor. */
6287 } predefined_identifier
;
6289 /* Create all the predefined identifiers. */
6292 initialize_predefined_identifiers ()
6294 struct predefined_identifier
*pid
;
6296 /* A table of identifiers to create at startup. */
6297 static predefined_identifier predefined_identifiers
[] = {
6298 { "C++", &lang_name_cplusplus
, 0 },
6299 { "C", &lang_name_c
, 0 },
6300 { "Java", &lang_name_java
, 0 },
6301 { CTOR_NAME
, &ctor_identifier
, 1 },
6302 { "__base_ctor", &base_ctor_identifier
, 1 },
6303 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6304 { DTOR_NAME
, &dtor_identifier
, 1 },
6305 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6306 { "__base_dtor", &base_dtor_identifier
, 1 },
6307 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6308 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6309 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6310 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6311 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6312 { "nelts", &nelts_identifier
, 0 },
6313 { THIS_NAME
, &this_identifier
, 0 },
6314 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6315 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6316 { "_vptr", &vptr_identifier
, 0 },
6317 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6318 { "std", &std_identifier
, 0 },
6322 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6324 *pid
->node
= get_identifier (pid
->name
);
6325 if (pid
->ctor_or_dtor_p
)
6326 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6330 /* Create the predefined scalar types of C,
6331 and some nodes representing standard constants (0, 1, (void *)0).
6332 Initialize the global binding level.
6333 Make definitions for built-in primitive functions. */
6336 init_decl_processing ()
6340 tree void_ftype_ptr
;
6342 /* Check to see that the user did not specify an invalid combination
6343 of command-line options. */
6344 if (!flag_vtable_thunks
)
6345 error ("the ABI requires vtable thunks");
6347 /* Create all the identifiers we need. */
6348 initialize_predefined_identifiers ();
6350 /* Fill in back-end hooks. */
6351 init_lang_status
= &push_cp_function_context
;
6352 free_lang_status
= &pop_cp_function_context
;
6353 mark_lang_status
= &mark_cp_function_context
;
6354 lang_safe_from_p
= &c_safe_from_p
;
6355 lang_dump_tree
= &cp_dump_tree
;
6356 lang_missing_noreturn_ok_p
= &cp_missing_noreturn_ok_p
;
6362 /* Create the global variables. */
6363 push_to_top_level ();
6365 /* Enter the global namespace. */
6366 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6367 push_namespace (get_identifier ("::"));
6368 global_namespace
= current_namespace
;
6369 current_lang_name
= NULL_TREE
;
6371 /* Adjust various flags based on command-line settings. */
6372 if (! flag_permissive
&& ! pedantic
)
6373 flag_pedantic_errors
= 1;
6374 if (!flag_no_inline
)
6376 flag_inline_trees
= 1;
6379 if (flag_inline_functions
)
6381 flag_inline_trees
= 2;
6382 flag_inline_functions
= 0;
6385 /* In C++, we never create builtin functions whose name does not
6386 begin with `__'. Users should be using headers to get prototypes
6387 in C++. It would be nice if we could warn when `-fbuiltin' is
6388 used explicitly, but we do not have that information. */
6389 flag_no_builtin
= 1;
6392 current_lang_name
= lang_name_c
;
6394 current_function_decl
= NULL_TREE
;
6395 current_binding_level
= NULL_BINDING_LEVEL
;
6396 free_binding_level
= NULL_BINDING_LEVEL
;
6398 build_common_tree_nodes (flag_signed_char
);
6400 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6401 TREE_TYPE (error_mark_list
) = error_mark_node
;
6403 /* Make the binding_level structure for global names. */
6405 global_binding_level
= current_binding_level
;
6406 /* The global level is the namespace level of ::. */
6407 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6408 declare_namespace_level ();
6410 /* Create the `std' namespace. */
6413 push_namespace (std_identifier
);
6414 std_node
= current_namespace
;
6416 fake_std_node
= error_mark_node
;
6420 fake_std_node
= build_decl (NAMESPACE_DECL
,
6423 pushdecl (fake_std_node
);
6426 c_common_nodes_and_builtins ();
6428 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6429 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6430 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6431 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6432 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6433 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6434 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6435 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6437 integer_two_node
= build_int_2 (2, 0);
6438 TREE_TYPE (integer_two_node
) = integer_type_node
;
6439 integer_three_node
= build_int_2 (3, 0);
6440 TREE_TYPE (integer_three_node
) = integer_type_node
;
6442 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6443 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6444 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6445 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6446 TYPE_PRECISION (boolean_type_node
) = 1;
6447 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6448 boolean_false_node
= build_int_2 (0, 0);
6449 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6450 boolean_true_node
= build_int_2 (1, 0);
6451 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6453 signed_size_zero_node
= build_int_2 (0, 0);
6454 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6456 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6459 record_builtin_type (RID_MAX
, NULL
, string_type_node
);
6462 delta_type_node
= ptrdiff_type_node
;
6463 vtable_index_type
= ptrdiff_type_node
;
6465 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6466 lang_type_promotes_to
= convert_type_from_ellipsis
;
6468 void_ftype
= build_function_type (void_type_node
, void_list_node
);
6469 void_ftype_ptr
= build_function_type (void_type_node
,
6470 tree_cons (NULL_TREE
,
6474 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6476 /* C++ extensions */
6478 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6479 record_unknown_type (unknown_type_node
, "unknown type");
6481 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6482 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6484 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6486 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6488 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6489 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6491 if (flag_vtable_thunks
)
6493 /* Make sure we get a unique function type, so we can give
6494 its pointer type a name. (This wins for gdb.) */
6495 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6496 TREE_TYPE (vfunc_type
) = integer_type_node
;
6497 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6498 layout_type (vfunc_type
);
6500 vtable_entry_type
= build_pointer_type (vfunc_type
);
6504 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6505 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6507 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6509 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6511 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6514 /* Make this part of an invisible union. */
6515 fields
[3] = copy_node (fields
[2]);
6516 TREE_TYPE (fields
[3]) = delta_type_node
;
6517 DECL_NAME (fields
[3]) = delta2_identifier
;
6518 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6519 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6520 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6521 TREE_UNSIGNED (fields
[3]) = 0;
6522 TREE_CHAIN (fields
[2]) = fields
[3];
6523 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6526 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6529 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6530 layout_type (vtbl_type_node
);
6531 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6532 record_builtin_type (RID_MAX
, NULL
, vtbl_type_node
);
6533 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6534 layout_type (vtbl_ptr_type_node
);
6535 record_builtin_type (RID_MAX
, NULL
, vtbl_ptr_type_node
);
6537 push_namespace (get_identifier ("__cxxabiv1"));
6538 abi_node
= current_namespace
;
6541 global_type_node
= make_node (LANG_TYPE
);
6542 record_unknown_type (global_type_node
, "global type");
6545 current_lang_name
= lang_name_cplusplus
;
6548 tree bad_alloc_type_node
, newtype
, deltype
;
6549 tree ptr_ftype_sizetype
;
6552 push_namespace (std_identifier
);
6553 bad_alloc_type_node
= xref_tag
6554 (class_type_node
, get_identifier ("bad_alloc"), 1);
6558 = build_function_type (ptr_type_node
,
6559 tree_cons (NULL_TREE
,
6562 newtype
= build_exception_variant
6563 (ptr_ftype_sizetype
, add_exception_specifier
6564 (NULL_TREE
, bad_alloc_type_node
, -1));
6565 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6566 push_cp_library_fn (NEW_EXPR
, newtype
);
6567 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6568 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6569 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6573 = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype
);
6575 /* Perform other language dependent initializations. */
6576 init_class_processing ();
6577 init_init_processing ();
6578 init_search_processing ();
6579 init_rtti_processing ();
6581 if (flag_exceptions
)
6582 init_exception_processing ();
6584 if (! supports_one_only ())
6587 make_fname_decl
= cp_make_fname_decl
;
6588 start_fname_decls ();
6590 /* Prepare to check format strings against argument lists. */
6591 init_function_format_info ();
6593 /* Show we use EH for cleanups. */
6594 using_eh_for_cleanups ();
6596 valid_lang_attribute
= cp_valid_lang_attribute
;
6598 /* Maintain consistency. Perhaps we should just complain if they
6599 say -fwritable-strings? */
6600 if (flag_writable_strings
)
6601 flag_const_strings
= 0;
6603 /* Add GC roots for all of our global variables. */
6604 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6605 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6606 ggc_add_tree_root (&integer_three_node
, 1);
6607 ggc_add_tree_root (&integer_two_node
, 1);
6608 ggc_add_tree_root (&signed_size_zero_node
, 1);
6609 ggc_add_tree_root (&size_one_node
, 1);
6610 ggc_add_tree_root (&size_zero_node
, 1);
6611 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6612 mark_binding_level
);
6613 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6614 ggc_add_tree_root (&static_ctors
, 1);
6615 ggc_add_tree_root (&static_dtors
, 1);
6616 ggc_add_tree_root (&lastiddecl
, 1);
6618 ggc_add_tree_root (&last_function_parm_tags
, 1);
6619 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6620 ggc_add_tree_root (&last_function_parms
, 1);
6621 ggc_add_tree_root (&error_mark_list
, 1);
6623 ggc_add_tree_root (&global_namespace
, 1);
6624 ggc_add_tree_root (&global_type_node
, 1);
6625 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6627 ggc_add_tree_root (&got_object
, 1);
6628 ggc_add_tree_root (&got_scope
, 1);
6630 ggc_add_tree_root (¤t_lang_name
, 1);
6631 ggc_add_tree_root (&static_aggregates
, 1);
6632 ggc_add_tree_root (&free_bindings
, 1);
6635 /* Generate an initializer for a function naming variable from
6636 NAME. NAME may be NULL, in which case we generate a special
6637 ERROR_MARK node which should be replaced later. */
6640 cp_fname_init (name
)
6643 tree domain
= NULL_TREE
;
6645 tree init
= NULL_TREE
;
6650 length
= strlen (name
);
6651 domain
= build_index_type (size_int (length
));
6652 init
= build_string (length
+ 1, name
);
6655 type
= build_qualified_type (char_type_node
, TYPE_QUAL_CONST
);
6656 type
= build_cplus_array_type (type
, domain
);
6659 TREE_TYPE (init
) = type
;
6661 /* We don't know the value until instantiation time. Make
6662 something which will be digested now, but replaced later. */
6663 init
= build (ERROR_MARK
, type
);
6668 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6669 decl, NAME is the initialization string and TYPE_DEP indicates whether
6670 NAME depended on the type of the function. We make use of that to detect
6671 __PRETTY_FUNCTION__ inside a template fn. This is being done
6672 lazily at the point of first use, so we musn't push the decl now. */
6675 cp_make_fname_decl (id
, type_dep
)
6679 const char *name
= (type_dep
&& processing_template_decl
6680 ? NULL
: fname_as_string (type_dep
));
6681 tree init
= cp_fname_init (name
);
6682 tree decl
= build_decl (VAR_DECL
, id
, TREE_TYPE (init
));
6684 /* As we don't push the decl here, we must set the context. */
6685 DECL_CONTEXT (decl
) = current_function_decl
;
6686 DECL_PRETTY_FUNCTION_P (decl
) = type_dep
;
6688 TREE_STATIC (decl
) = 1;
6689 TREE_READONLY (decl
) = 1;
6690 DECL_ARTIFICIAL (decl
) = 1;
6691 DECL_INITIAL (decl
) = init
;
6693 TREE_USED (decl
) = 1;
6695 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6700 /* Entry point for the benefit of c_common_nodes_and_builtins.
6702 Make a definition for a builtin function named NAME and whose data type
6703 is TYPE. TYPE should be a function type with argument types.
6705 CLASS and CODE tell later passes how to compile calls to this function.
6706 See tree.h for possible values.
6708 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6709 the name to be called if we can't opencode the function. */
6712 builtin_function (name
, type
, code
, class, libname
)
6716 enum built_in_class
class;
6717 const char *libname
;
6719 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6720 DECL_BUILT_IN_CLASS (decl
) = class;
6721 DECL_FUNCTION_CODE (decl
) = code
;
6723 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6725 /* All builtins that don't begin with an `_' should go in the `std'
6727 if (flag_honor_std
&& name
[0] != '_')
6729 push_namespace (std_identifier
);
6730 DECL_CONTEXT (decl
) = std_node
;
6733 if (flag_honor_std
&& name
[0] != '_')
6736 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6737 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6738 function in the namespace. */
6740 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (libname
));
6741 make_decl_rtl (decl
, NULL
);
6743 /* Warn if a function in the namespace for users
6744 is used without an occasion to consider it declared. */
6745 if (name
[0] != '_' || name
[1] != '_')
6746 DECL_ANTICIPATED (decl
) = 1;
6751 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6752 function. Not called directly. */
6755 build_library_fn_1 (name
, operator_code
, type
)
6757 enum tree_code operator_code
;
6760 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6761 DECL_EXTERNAL (fn
) = 1;
6762 TREE_PUBLIC (fn
) = 1;
6763 DECL_ARTIFICIAL (fn
) = 1;
6764 TREE_NOTHROW (fn
) = 1;
6765 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6766 SET_DECL_LANGUAGE (fn
, lang_c
);
6770 /* Returns the _DECL for a library function with C linkage.
6771 We assume that such functions never throw; if this is incorrect,
6772 callers should unset TREE_NOTHROW. */
6775 build_library_fn (name
, type
)
6779 return build_library_fn_1 (name
, ERROR_MARK
, type
);
6782 /* Returns the _DECL for a library function with C++ linkage. */
6785 build_cp_library_fn (name
, operator_code
, type
)
6787 enum tree_code operator_code
;
6790 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6791 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6792 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6793 SET_DECL_LANGUAGE (fn
, lang_cplusplus
);
6794 set_mangled_name_for_decl (fn
);
6798 /* Like build_library_fn, but takes a C string instead of an
6802 build_library_fn_ptr (name
, type
)
6806 return build_library_fn (get_identifier (name
), type
);
6809 /* Like build_cp_library_fn, but takes a C string instead of an
6813 build_cp_library_fn_ptr (name
, type
)
6817 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6820 /* Like build_library_fn, but also pushes the function so that we will
6821 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6824 push_library_fn (name
, type
)
6827 tree fn
= build_library_fn (name
, type
);
6828 pushdecl_top_level (fn
);
6832 /* Like build_cp_library_fn, but also pushes the function so that it
6833 will be found by normal lookup. */
6836 push_cp_library_fn (operator_code
, type
)
6837 enum tree_code operator_code
;
6840 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6847 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6851 push_void_library_fn (name
, parmtypes
)
6852 tree name
, parmtypes
;
6854 tree type
= build_function_type (void_type_node
, parmtypes
);
6855 return push_library_fn (name
, type
);
6858 /* Like push_library_fn, but also note that this function throws
6859 and does not return. Used for __throw_foo and the like. */
6862 push_throw_library_fn (name
, type
)
6865 tree fn
= push_library_fn (name
, type
);
6866 TREE_THIS_VOLATILE (fn
) = 1;
6867 TREE_NOTHROW (fn
) = 0;
6871 /* When we call finish_struct for an anonymous union, we create
6872 default copy constructors and such. But, an anonymous union
6873 shouldn't have such things; this function undoes the damage to the
6874 anonymous union type T.
6876 (The reason that we create the synthesized methods is that we don't
6877 distinguish `union { int i; }' from `typedef union { int i; } U'.
6878 The first is an anonymous union; the second is just an ordinary
6882 fixup_anonymous_aggr (t
)
6887 /* Wipe out memory of synthesized methods */
6888 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6889 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6890 TYPE_HAS_INIT_REF (t
) = 0;
6891 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6892 TYPE_HAS_ASSIGN_REF (t
) = 0;
6893 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6895 /* Splice the implicitly generated functions out of the TYPE_METHODS
6897 q
= &TYPE_METHODS (t
);
6900 if (DECL_ARTIFICIAL (*q
))
6901 *q
= TREE_CHAIN (*q
);
6903 q
= &TREE_CHAIN (*q
);
6906 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6907 if (TYPE_METHODS (t
))
6908 cp_error_at ("an anonymous union cannot have function members", t
);
6910 /* Anonymous aggregates cannot have fields with ctors, dtors or complex
6911 assignment operators (because they cannot have these methods themselves).
6912 For anonymous unions this is already checked because they are not allowed
6913 in any union, otherwise we have to check it. */
6914 if (TREE_CODE (t
) != UNION_TYPE
)
6918 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
6919 if (TREE_CODE (field
) == FIELD_DECL
)
6921 type
= TREE_TYPE (field
);
6922 if (CLASS_TYPE_P (type
))
6924 if (TYPE_NEEDS_CONSTRUCTING (type
))
6925 cp_error_at ("member %#D' with constructor not allowed in anonymous aggregate",
6927 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
6928 cp_error_at ("member %#D' with destructor not allowed in anonymous aggregate",
6930 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type
))
6931 cp_error_at ("member %#D' with copy assignment operator not allowed in anonymous aggregate",
6938 /* Make sure that a declaration with no declarator is well-formed, i.e.
6939 just defines a tagged type or anonymous union.
6941 Returns the type defined, if any. */
6944 check_tag_decl (declspecs
)
6949 int saw_typedef
= 0;
6950 tree ob_modifier
= NULL_TREE
;
6952 register tree t
= NULL_TREE
;
6954 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6956 register tree value
= TREE_VALUE (link
);
6959 || TREE_CODE (value
) == TYPE_DECL
6960 || (TREE_CODE (value
) == IDENTIFIER_NODE
6961 && IDENTIFIER_GLOBAL_VALUE (value
)
6962 && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (value
)) == TYPE_DECL
))
6966 if (found_type
== 2 && TREE_CODE (value
) == IDENTIFIER_NODE
)
6968 if (! in_system_header
)
6969 cp_pedwarn ("redeclaration of C++ built-in type `%T'", value
);
6974 && ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6975 || TREE_CODE (value
) == ENUMERAL_TYPE
))
6977 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6981 else if (value
== ridpointers
[(int) RID_TYPEDEF
])
6983 else if (value
== ridpointers
[(int) RID_FRIEND
])
6985 if (current_class_type
== NULL_TREE
6986 || current_scope () != current_class_type
)
6987 ob_modifier
= value
;
6991 else if (value
== ridpointers
[(int) RID_STATIC
]
6992 || value
== ridpointers
[(int) RID_EXTERN
]
6993 || value
== ridpointers
[(int) RID_AUTO
]
6994 || value
== ridpointers
[(int) RID_REGISTER
]
6995 || value
== ridpointers
[(int) RID_INLINE
]
6996 || value
== ridpointers
[(int) RID_VIRTUAL
]
6997 || value
== ridpointers
[(int) RID_CONST
]
6998 || value
== ridpointers
[(int) RID_VOLATILE
]
6999 || value
== ridpointers
[(int) RID_EXPLICIT
])
7000 ob_modifier
= value
;
7004 error ("multiple types in one declaration");
7006 if (t
== NULL_TREE
&& ! saw_friend
)
7007 pedwarn ("declaration does not declare anything");
7009 /* Check for an anonymous union. */
7010 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
7011 && TYPE_ANONYMOUS_P (t
))
7013 /* 7/3 In a simple-declaration, the optional init-declarator-list
7014 can be omitted only when declaring a class (clause 9) or
7015 enumeration (7.2), that is, when the decl-specifier-seq contains
7016 either a class-specifier, an elaborated-type-specifier with
7017 a class-key (9.1), or an enum-specifier. In these cases and
7018 whenever a class-specifier or enum-specifier is present in the
7019 decl-specifier-seq, the identifiers in these specifiers are among
7020 the names being declared by the declaration (as class-name,
7021 enum-names, or enumerators, depending on the syntax). In such
7022 cases, and except for the declaration of an unnamed bit-field (9.6),
7023 the decl-specifier-seq shall introduce one or more names into the
7024 program, or shall redeclare a name introduced by a previous
7025 declaration. [Example:
7026 enum { }; // ill-formed
7027 typedef class { }; // ill-formed
7031 error ("Missing type-name in typedef-declaration.");
7034 /* Anonymous unions are objects, so they can have specifiers. */;
7035 SET_ANON_AGGR_TYPE_P (t
);
7037 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7038 pedwarn ("ISO C++ prohibits anonymous structs");
7041 else if (ob_modifier
)
7043 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7044 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7045 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7046 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7047 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7048 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7049 cp_error ("`%D' can only be specified for constructors",
7052 cp_error ("`%D' can only be specified for objects and functions",
7059 /* Called when a declaration is seen that contains no names to declare.
7060 If its type is a reference to a structure, union or enum inherited
7061 from a containing scope, shadow that tag name for the current scope
7062 with a forward reference.
7063 If its type defines a new named structure or union
7064 or defines an enum, it is valid but we need not do anything here.
7065 Otherwise, it is an error.
7067 C++: may have to grok the declspecs to learn about static,
7068 complain for anonymous unions. */
7071 shadow_tag (declspecs
)
7074 tree t
= check_tag_decl (declspecs
);
7077 maybe_process_partial_specialization (t
);
7079 /* This is where the variables in an anonymous union are
7080 declared. An anonymous union declaration looks like:
7082 because there is no declarator after the union, the parser
7083 sends that declaration here. */
7084 if (t
&& ANON_AGGR_TYPE_P (t
))
7086 fixup_anonymous_aggr (t
);
7088 if (TYPE_FIELDS (t
))
7090 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7092 finish_anon_union (decl
);
7097 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7100 groktypename (typename
)
7103 if (TREE_CODE (typename
) != TREE_LIST
)
7105 return grokdeclarator (TREE_VALUE (typename
),
7106 TREE_PURPOSE (typename
),
7107 TYPENAME
, 0, NULL_TREE
);
7110 /* Decode a declarator in an ordinary declaration or data definition.
7111 This is called as soon as the type information and variable name
7112 have been parsed, before parsing the initializer if any.
7113 Here we create the ..._DECL node, fill in its type,
7114 and put it on the list of decls for the current context.
7115 The ..._DECL node is returned as the value.
7117 Exception: for arrays where the length is not specified,
7118 the type is left null, to be filled in by `cp_finish_decl'.
7120 Function definitions do not come here; they go to start_function
7121 instead. However, external and forward declarations of functions
7122 do go through here. Structure field declarations are done by
7123 grokfield and not through here. */
7126 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7127 tree declarator
, declspecs
;
7129 tree attributes
, prefix_attributes
;
7132 register tree type
, tem
;
7134 extern int have_extern_spec
;
7135 extern int used_extern_spec
;
7139 /* See code below that used this. */
7140 int init_written
= initialized
;
7143 /* This should only be done once on the top most decl. */
7144 if (have_extern_spec
&& !used_extern_spec
)
7146 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7148 used_extern_spec
= 1;
7151 if (attributes
|| prefix_attributes
)
7152 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7154 attrlist
= NULL_TREE
;
7156 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7159 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7162 type
= TREE_TYPE (decl
);
7164 if (type
== error_mark_node
)
7167 context
= DECL_CONTEXT (decl
);
7169 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7170 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7172 /* When parsing the initializer, lookup should use the object's
7174 push_decl_namespace (context
);
7177 /* We are only interested in class contexts, later. */
7178 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7179 context
= NULL_TREE
;
7182 /* Is it valid for this decl to have an initializer at all?
7183 If not, set INITIALIZED to zero, which will indirectly
7184 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7185 switch (TREE_CODE (decl
))
7188 /* typedef foo = bar means give foo the same type as bar.
7189 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7190 Any other case of an initialization in a TYPE_DECL is an error. */
7191 if (pedantic
|| list_length (declspecs
) > 1)
7193 cp_error ("typedef `%D' is initialized", decl
);
7199 cp_error ("function `%#D' is initialized like a variable", decl
);
7209 if (! toplevel_bindings_p ()
7210 && DECL_EXTERNAL (decl
))
7211 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7213 DECL_EXTERNAL (decl
) = 0;
7214 if (toplevel_bindings_p ())
7215 TREE_STATIC (decl
) = 1;
7217 /* Tell `pushdecl' this is an initialized decl
7218 even though we don't yet have the initializer expression.
7219 Also tell `cp_finish_decl' it may store the real initializer. */
7220 DECL_INITIAL (decl
) = error_mark_node
;
7223 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7224 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7227 /* Set attributes here so if duplicate decl, will have proper attributes. */
7228 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7230 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7232 push_nested_class (context
, 2);
7234 if (TREE_CODE (decl
) == VAR_DECL
)
7236 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7237 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7238 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7241 if (DECL_CONTEXT (field
) != context
)
7243 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7244 DECL_CONTEXT (field
), DECL_NAME (decl
),
7245 context
, DECL_NAME (decl
));
7246 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7248 /* Static data member are tricky; an in-class initialization
7249 still doesn't provide a definition, so the in-class
7250 declaration will have DECL_EXTERNAL set, but will have an
7251 initialization. Thus, duplicate_decls won't warn
7252 about this situation, and so we check here. */
7253 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7254 cp_error ("duplicate initialization of %D", decl
);
7255 if (duplicate_decls (decl
, field
))
7261 tree field
= check_classfn (context
, decl
);
7262 if (field
&& duplicate_decls (decl
, field
))
7266 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7267 DECL_IN_AGGR_P (decl
) = 0;
7268 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7269 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7271 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7272 /* [temp.expl.spec] An explicit specialization of a static data
7273 member of a template is a definition if the declaration
7274 includes an initializer; otherwise, it is a declaration.
7276 We check for processing_specialization so this only applies
7277 to the new specialization syntax. */
7278 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7279 DECL_EXTERNAL (decl
) = 1;
7282 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7283 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7287 /* Enter this declaration into the symbol table. */
7288 tem
= maybe_push_decl (decl
);
7290 if (processing_template_decl
)
7291 tem
= push_template_decl (tem
);
7293 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7294 /* Tell the back-end to use or not use .common as appropriate. If we say
7295 -fconserve-space, we want this to save .data space, at the expense of
7296 wrong semantics. If we say -fno-conserve-space, we want this to
7297 produce errors about redefs; to do this we force variables into the
7299 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7302 if (! processing_template_decl
)
7312 tree type
= TREE_TYPE (decl
);
7313 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7315 if (type
== error_mark_node
)
7318 maybe_push_cleanup_level (type
);
7321 /* Is it valid for this decl to have an initializer at all?
7322 If not, set INITIALIZED to zero, which will indirectly
7323 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7325 /* Don't allow initializations for incomplete types except for
7326 arrays which might be completed by the initialization. */
7327 if (COMPLETE_TYPE_P (complete_type (type
)))
7328 ; /* A complete type is ok. */
7329 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7331 cp_error ("variable `%#D' has initializer but incomplete type",
7334 type
= TREE_TYPE (decl
) = error_mark_node
;
7336 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7338 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7339 cp_error ("elements of array `%#D' have incomplete type", decl
);
7340 /* else we already gave an error in start_decl. */
7346 && TREE_CODE (decl
) != TYPE_DECL
7347 && TREE_CODE (decl
) != TEMPLATE_DECL
7348 && type
!= error_mark_node
7349 && IS_AGGR_TYPE (type
)
7350 && ! DECL_EXTERNAL (decl
))
7352 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7353 && !COMPLETE_TYPE_P (complete_type (type
)))
7355 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7357 /* Change the type so that assemble_variable will give
7358 DECL an rtl we can live with: (mem (const_int 0)). */
7359 type
= TREE_TYPE (decl
) = error_mark_node
;
7363 /* If any base type in the hierarchy of TYPE needs a constructor,
7364 then we set initialized to 1. This way any nodes which are
7365 created for the purposes of initializing this aggregate
7366 will live as long as it does. This is necessary for global
7367 aggregates which do not have their initializers processed until
7368 the end of the file. */
7369 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7374 DECL_INITIAL (decl
) = NULL_TREE
;
7377 /* Handle initialization of references.
7378 These three arguments are from `cp_finish_decl', and have the
7379 same meaning here that they do there.
7381 Quotes on semantics can be found in ARM 8.4.3. */
7384 grok_reference_init (decl
, type
, init
)
7385 tree decl
, type
, init
;
7389 if (init
== NULL_TREE
)
7391 if ((DECL_LANG_SPECIFIC (decl
) == 0
7392 || DECL_IN_AGGR_P (decl
) == 0)
7393 && ! DECL_THIS_EXTERN (decl
))
7394 cp_error ("`%D' declared as reference but not initialized", decl
);
7398 if (init
== error_mark_node
)
7401 if (TREE_CODE (init
) == CONSTRUCTOR
)
7403 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7407 if (TREE_CODE (init
) == TREE_LIST
)
7408 init
= build_compound_expr (init
);
7410 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7411 init
= convert_from_reference (init
);
7413 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7414 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7416 /* Note: default conversion is only called in very special cases. */
7417 init
= default_conversion (init
);
7420 /* Convert INIT to the reference type TYPE. This may involve the
7421 creation of a temporary, whose lifetime must be the same as that
7422 of the reference. If so, a DECL_STMT for the temporary will be
7423 added just after the DECL_STMT for DECL. That's why we don't set
7424 DECL_INITIAL for local references (instead assigning to them
7425 explicitly); we need to allow the temporary to be initialized
7427 tmp
= convert_to_reference
7428 (type
, init
, CONV_IMPLICIT
,
7429 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7432 if (tmp
== error_mark_node
)
7434 else if (tmp
== NULL_TREE
)
7436 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7440 if (TREE_STATIC (decl
) && !TREE_CONSTANT (tmp
))
7443 if (building_stmt_tree ())
7445 /* Initialize the declaration. */
7446 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7447 finish_expr_stmt (tmp
);
7450 DECL_INITIAL (decl
) = tmp
;
7455 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7456 mucking with forces it does not comprehend (i.e. initialization with a
7457 constructor). If we are at global scope and won't go into COMMON, fill
7458 it in with a dummy CONSTRUCTOR to force the variable into .data;
7459 otherwise we can use error_mark_node. */
7462 obscure_complex_init (decl
, init
)
7465 if (! flag_no_inline
&& TREE_STATIC (decl
))
7467 if (extract_init (decl
, init
))
7471 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7472 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7473 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7477 DECL_INITIAL (decl
) = error_mark_node
;
7482 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7483 array until we finish parsing the initializer. If that's the
7484 situation we're in, update DECL accordingly. */
7487 maybe_deduce_size_from_array_init (decl
, init
)
7491 tree type
= TREE_TYPE (decl
);
7493 if (TREE_CODE (type
) == ARRAY_TYPE
7494 && TYPE_DOMAIN (type
) == NULL_TREE
7495 && TREE_CODE (decl
) != TYPE_DECL
)
7497 /* do_default is really a C-ism to deal with tentative definitions.
7498 But let's leave it here to ease the eventual merge. */
7499 int do_default
= !DECL_EXTERNAL (decl
);
7500 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7501 int failure
= complete_array_type (type
, initializer
, do_default
);
7504 cp_error ("initializer fails to determine size of `%D'", decl
);
7509 cp_error ("array size missing in `%D'", decl
);
7510 /* If a `static' var's size isn't known, make it extern as
7511 well as static, so it does not get allocated. If it's not
7512 `static', then don't mark it extern; finish_incomplete_decl
7513 will give it a default size and it will get allocated. */
7514 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7515 DECL_EXTERNAL (decl
) = 1;
7518 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7519 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7521 cp_error ("zero-size array `%D'", decl
);
7523 layout_decl (decl
, 0);
7527 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7528 any appropriate error messages regarding the layout. */
7531 layout_var_decl (decl
)
7534 tree type
= TREE_TYPE (decl
);
7536 tree ttype
= target_type (type
);
7539 /* If we haven't already layed out this declaration, do so now.
7540 Note that we must not call complete type for an external object
7541 because it's type might involve templates that we are not
7542 supposed to isntantiate yet. (And it's perfectly legal to say
7543 `extern X x' for some incomplete type `X'.) */
7544 if (!DECL_EXTERNAL (decl
))
7545 complete_type (type
);
7546 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7547 layout_decl (decl
, 0);
7549 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7551 /* An automatic variable with an incomplete type: that is an error.
7552 Don't talk about array types here, since we took care of that
7553 message in grokdeclarator. */
7554 cp_error ("storage size of `%D' isn't known", decl
);
7555 TREE_TYPE (decl
) = error_mark_node
;
7558 /* Keep this code around in case we later want to control debug info
7559 based on whether a type is "used". (jason 1999-11-11) */
7561 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7562 /* Let debugger know it should output info for this type. */
7563 note_debug_info_needed (ttype
);
7565 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7566 note_debug_info_needed (DECL_CONTEXT (decl
));
7569 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7570 && DECL_SIZE (decl
) != NULL_TREE
7571 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7573 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7574 constant_expression_warning (DECL_SIZE (decl
));
7576 cp_error ("storage size of `%D' isn't constant", decl
);
7579 if (TREE_STATIC (decl
)
7580 && !DECL_ARTIFICIAL (decl
)
7581 && current_function_decl
7582 && DECL_CONTEXT (decl
) == current_function_decl
)
7583 push_local_name (decl
);
7586 /* If a local static variable is declared in an inline function, or if
7587 we have a weak definition, we must endeavor to create only one
7588 instance of the variable at link-time. */
7591 maybe_commonize_var (decl
)
7594 /* Static data in a function with comdat linkage also has comdat
7596 if (TREE_STATIC (decl
)
7597 /* Don't mess with __FUNCTION__. */
7598 && ! DECL_ARTIFICIAL (decl
)
7599 && current_function_decl
7600 && DECL_CONTEXT (decl
) == current_function_decl
7601 && (DECL_DECLARED_INLINE_P (current_function_decl
)
7602 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7603 && TREE_PUBLIC (current_function_decl
))
7605 /* If flag_weak, we don't need to mess with this, as we can just
7606 make the function weak, and let it refer to its unique local
7607 copy. This works because we don't allow the function to be
7611 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7613 TREE_PUBLIC (decl
) = 1;
7614 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7616 else if (DECL_INITIAL (decl
) == NULL_TREE
7617 || DECL_INITIAL (decl
) == error_mark_node
)
7619 TREE_PUBLIC (decl
) = 1;
7620 DECL_COMMON (decl
) = 1;
7622 /* else we lose. We can only do this if we can use common,
7623 which we can't if it has been initialized. */
7625 if (!TREE_PUBLIC (decl
))
7627 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7628 cp_warning_at (" you can work around this by removing the initializer", decl
);
7632 comdat_linkage (decl
);
7634 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7635 /* Set it up again; we might have set DECL_INITIAL since the last
7637 comdat_linkage (decl
);
7640 /* Issue an error message if DECL is an uninitialized const variable. */
7643 check_for_uninitialized_const_var (decl
)
7646 tree type
= TREE_TYPE (decl
);
7648 /* ``Unless explicitly declared extern, a const object does not have
7649 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7651 if (TREE_CODE (decl
) == VAR_DECL
7652 && TREE_CODE (type
) != REFERENCE_TYPE
7653 && CP_TYPE_CONST_P (type
)
7654 && !TYPE_NEEDS_CONSTRUCTING (type
)
7655 && !DECL_INITIAL (decl
))
7656 cp_error ("uninitialized const `%D'", decl
);
7659 /* Verify INIT (the initializer for DECL), and record the
7660 initialization in DECL_INITIAL, if appropriate. Returns a new
7664 check_initializer (decl
, init
)
7670 if (TREE_CODE (decl
) == FIELD_DECL
)
7673 type
= TREE_TYPE (decl
);
7675 /* If `start_decl' didn't like having an initialization, ignore it now. */
7676 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7679 /* Check the initializer. */
7682 /* Things that are going to be initialized need to have complete
7684 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7686 if (type
== error_mark_node
)
7687 /* We will have already complained. */
7689 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7691 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7694 else if (TREE_CODE (type
) == ARRAY_TYPE
7695 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7697 cp_error ("elements of array `%#D' have incomplete type", decl
);
7700 else if (!COMPLETE_TYPE_P (type
))
7702 cp_error ("`%D' has incomplete type", decl
);
7703 TREE_TYPE (decl
) = error_mark_node
;
7708 if (TREE_CODE (decl
) == CONST_DECL
)
7710 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7712 DECL_INITIAL (decl
) = init
;
7714 my_friendly_assert (init
!= NULL_TREE
, 149);
7717 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7719 init
= grok_reference_init (decl
, type
, init
);
7721 init
= obscure_complex_init (decl
, init
);
7725 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7727 if (TREE_CODE (type
) == ARRAY_TYPE
)
7728 init
= digest_init (type
, init
, (tree
*) 0);
7729 else if (TREE_CODE (init
) == CONSTRUCTOR
7730 && TREE_HAS_CONSTRUCTOR (init
))
7732 if (TYPE_NON_AGGREGATE_CLASS (type
))
7734 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7736 init
= error_mark_node
;
7739 goto dont_use_constructor
;
7744 dont_use_constructor
:
7745 if (TREE_CODE (init
) != TREE_VEC
)
7746 init
= store_init_value (decl
, init
);
7750 /* We must hide the initializer so that expand_decl
7751 won't try to do something it does not understand. */
7752 init
= obscure_complex_init (decl
, init
);
7754 else if (DECL_EXTERNAL (decl
))
7756 else if (TYPE_P (type
)
7757 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7759 tree core_type
= strip_array_types (type
);
7761 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7763 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7764 cp_error ("structure `%D' with uninitialized const members", decl
);
7765 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7766 cp_error ("structure `%D' with uninitialized reference members",
7770 check_for_uninitialized_const_var (decl
);
7772 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7773 init
= obscure_complex_init (decl
, NULL_TREE
);
7777 check_for_uninitialized_const_var (decl
);
7782 /* If DECL is not a local variable, give it RTL. */
7785 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7788 const char *asmspec
;
7790 int toplev
= toplevel_bindings_p ();
7793 /* Handle non-variables up front. */
7794 if (TREE_CODE (decl
) != VAR_DECL
)
7796 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7800 /* If we see a class member here, it should be a static data
7802 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7804 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7805 /* An in-class declaration of a static data member should be
7806 external; it is only a declaration, and not a definition. */
7807 if (init
== NULL_TREE
)
7808 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7811 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7813 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (asmspec
));
7815 /* We don't create any RTL for local variables. */
7816 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7819 /* We defer emission of local statics until the corresponding
7820 DECL_STMT is expanded. */
7821 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7823 /* We try to defer namespace-scope static constants so that they are
7824 not emitted into the object file unncessarily. */
7825 if (!DECL_VIRTUAL_P (decl
)
7826 && TREE_READONLY (decl
)
7827 && DECL_INITIAL (decl
) != NULL_TREE
7828 && DECL_INITIAL (decl
) != error_mark_node
7829 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7831 && !TREE_PUBLIC (decl
))
7833 /* Fool with the linkage according to #pragma interface. */
7834 if (!interface_unknown
)
7836 TREE_PUBLIC (decl
) = 1;
7837 DECL_EXTERNAL (decl
) = interface_only
;
7843 /* If we're deferring the variable, we only need to make RTL if
7844 there's an ASMSPEC. Otherwise, we'll lazily create it later when
7845 we need it. (There's no way to lazily create RTL for things that
7846 have assembly specs because the information about the specifier
7847 isn't stored in the tree, yet) */
7848 if (defer_p
&& asmspec
)
7849 make_decl_rtl (decl
, asmspec
);
7850 /* If we're not deferring, go ahead and assemble the variable. */
7852 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7855 /* The old ARM scoping rules injected variables declared in the
7856 initialization statement of a for-statement into the surrounding
7857 scope. We support this usage, in order to be backward-compatible.
7858 DECL is a just-declared VAR_DECL; if necessary inject its
7859 declaration into the surrounding scope. */
7862 maybe_inject_for_scope_var (decl
)
7865 if (!DECL_NAME (decl
))
7868 if (current_binding_level
->is_for_scope
)
7870 struct binding_level
*outer
7871 = current_binding_level
->level_chain
;
7873 /* Check to see if the same name is already bound at the outer
7874 level, either because it was directly declared, or because a
7875 dead for-decl got preserved. In either case, the code would
7876 not have been valid under the ARM scope rules, so clear
7877 is_for_scope for the current_binding_level.
7879 Otherwise, we need to preserve the temp slot for decl to last
7880 into the outer binding level. */
7883 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7885 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7886 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7888 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7890 BINDING_VALUE (outer_binding
)
7891 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7892 current_binding_level
->is_for_scope
= 0;
7894 else if (DECL_IN_MEMORY_P (decl
))
7895 preserve_temp_slots (DECL_RTL (decl
));
7899 /* Generate code to initialize DECL (a local variable). */
7902 initialize_local_var (decl
, init
, flags
)
7907 tree type
= TREE_TYPE (decl
);
7909 /* If the type is bogus, don't bother initializing the variable. */
7910 if (type
== error_mark_node
)
7913 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7915 /* If we used it already as memory, it must stay in memory. */
7916 DECL_INITIAL (decl
) = NULL_TREE
;
7917 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7920 /* Local statics are handled differently from ordinary automatic
7922 if (TREE_STATIC (decl
))
7924 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7925 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7926 expand_static_init (decl
, init
);
7930 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7934 /* Compute and store the initial value. */
7935 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7937 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7939 int saved_stmts_are_full_exprs_p
;
7941 my_friendly_assert (building_stmt_tree (), 20000906);
7942 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7943 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7944 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7945 current_stmt_tree ()->stmts_are_full_exprs_p
=
7946 saved_stmts_are_full_exprs_p
;
7949 /* Set this to 0 so we can tell whether an aggregate which was
7950 initialized was ever used. Don't do this if it has a
7951 destructor, so we don't complain about the 'resource
7952 allocation is initialization' idiom. Now set
7953 attribute((unused)) on types so decls of that type will be
7954 marked used. (see TREE_USED, above.) */
7955 if (TYPE_NEEDS_CONSTRUCTING (type
)
7957 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7958 && DECL_NAME (decl
))
7959 TREE_USED (decl
) = 0;
7960 else if (already_used
)
7961 TREE_USED (decl
) = 1;
7965 /* Generate code to destroy DECL (a local variable). */
7968 destroy_local_var (decl
)
7971 tree type
= TREE_TYPE (decl
);
7974 /* Only variables get cleaned up. */
7975 if (TREE_CODE (decl
) != VAR_DECL
)
7978 /* And only things with destructors need cleaning up. */
7979 if (type
== error_mark_node
7980 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7983 if (TREE_CODE (decl
) == VAR_DECL
&&
7984 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7985 /* We don't clean up things that aren't defined in this
7986 translation unit, or that need a static cleanup. The latter
7987 are handled by finish_file. */
7990 /* Compute the cleanup. */
7991 cleanup
= maybe_build_cleanup (decl
);
7993 /* Record the cleanup required for this declaration. */
7994 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7996 finish_decl_cleanup (decl
, cleanup
);
7999 /* Finish processing of a declaration;
8000 install its line number and initial value.
8001 If the length of an array type is not known before,
8002 it must be determined now, from the initial value, or it is an error.
8004 INIT holds the value of an initializer that should be allowed to escape
8007 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8008 if the (init) syntax was used. */
8011 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8017 tree ttype
= NULL_TREE
;
8018 const char *asmspec
= NULL
;
8019 int was_readonly
= 0;
8024 error ("assignment (not initialization) in declaration");
8028 /* If a name was specified, get the string. */
8030 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8032 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8034 cp_error ("cannot initialize `%D' to namespace `%D'",
8039 if (current_class_type
8040 && CP_DECL_CONTEXT (decl
) == current_class_type
8041 && TYPE_BEING_DEFINED (current_class_type
)
8042 && (DECL_INITIAL (decl
) || init
))
8043 DECL_INITIALIZED_IN_CLASS_P (decl
) = 1;
8045 if (TREE_CODE (decl
) == VAR_DECL
8046 && DECL_CONTEXT (decl
)
8047 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8048 && DECL_CONTEXT (decl
) != current_namespace
8051 /* Leave the namespace of the object. */
8052 pop_decl_namespace ();
8055 type
= TREE_TYPE (decl
);
8057 if (type
== error_mark_node
)
8060 /* Add this declaration to the statement-tree. */
8061 if (building_stmt_tree ()
8062 && at_function_scope_p ()
8063 && TREE_CODE (decl
) != RESULT_DECL
)
8064 add_decl_stmt (decl
);
8066 if (TYPE_HAS_MUTABLE_P (type
))
8067 TREE_READONLY (decl
) = 0;
8069 if (processing_template_decl
)
8071 if (init
&& DECL_INITIAL (decl
))
8072 DECL_INITIAL (decl
) = init
;
8076 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8077 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8079 /* Take care of TYPE_DECLs up front. */
8080 if (TREE_CODE (decl
) == TYPE_DECL
)
8082 if (init
&& DECL_INITIAL (decl
))
8084 /* typedef foo = bar; store the type of bar as the type of foo. */
8085 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
8086 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8088 if (type
!= error_mark_node
8089 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8091 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8092 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8093 set_identifier_type_value (DECL_NAME (decl
), type
);
8094 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8096 GNU_xref_decl (current_function_decl
, decl
);
8098 /* If we have installed this as the canonical typedef for this
8099 type, and that type has not been defined yet, delay emitting
8100 the debug information for it, as we will emit it later. */
8101 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8102 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8103 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8105 rest_of_decl_compilation (decl
, NULL
,
8106 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8110 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8111 ttype
= target_type (type
);
8113 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8114 && TYPE_NEEDS_CONSTRUCTING (type
))
8116 /* Currently, GNU C++ puts constants in text space, making them
8117 impossible to initialize. In the future, one would hope for
8118 an operating system which understood the difference between
8119 initialization and the running of a program. */
8121 TREE_READONLY (decl
) = 0;
8124 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8126 /* This must override the asm specifier which was placed by
8127 grokclassfn. Lay this out fresh. */
8128 SET_DECL_RTL (TREE_TYPE (decl
), NULL_RTX
);
8129 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (asmspec
));
8130 make_decl_rtl (decl
, asmspec
);
8133 /* Deduce size of array from initialization, if not already known. */
8134 maybe_deduce_size_from_array_init (decl
, init
);
8135 init
= check_initializer (decl
, init
);
8137 GNU_xref_decl (current_function_decl
, decl
);
8139 if (TREE_CODE (decl
) == VAR_DECL
)
8140 layout_var_decl (decl
);
8142 /* Output the assembler code and/or RTL code for variables and functions,
8143 unless the type is an undefined structure or union.
8144 If not, it will get done when the type is completed. */
8145 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8146 || TREE_CODE (decl
) == RESULT_DECL
)
8148 if (TREE_CODE (decl
) == VAR_DECL
)
8149 maybe_commonize_var (decl
);
8151 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8153 if (TREE_CODE (type
) == FUNCTION_TYPE
8154 || TREE_CODE (type
) == METHOD_TYPE
)
8155 abstract_virtuals_error (decl
,
8156 strip_array_types (TREE_TYPE (type
)));
8158 abstract_virtuals_error (decl
, strip_array_types (type
));
8160 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8162 else if (DECL_EXTERNAL (decl
)
8163 && ! (DECL_LANG_SPECIFIC (decl
)
8164 && DECL_NOT_REALLY_EXTERN (decl
)))
8167 DECL_INITIAL (decl
) = init
;
8169 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8171 /* This is a local declaration. */
8172 if (doing_semantic_analysis_p ())
8173 maybe_inject_for_scope_var (decl
);
8174 /* Initialize the local variable. But, if we're building a
8175 statement-tree, we'll do the initialization when we
8177 if (processing_template_decl
)
8179 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8180 DECL_INITIAL (decl
) = init
;
8184 /* If we're not building RTL, then we need to do so
8186 my_friendly_assert (building_stmt_tree (), 20000906);
8187 /* Initialize the variable. */
8188 initialize_local_var (decl
, init
, flags
);
8189 /* Clean up the variable. */
8190 destroy_local_var (decl
);
8193 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8195 /* Cleanups for static variables are handled by `finish_file'. */
8196 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8197 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8198 expand_static_init (decl
, init
);
8202 /* Undo call to `pushclass' that was done in `start_decl'
8203 due to initialization of qualified member variable.
8204 I.e., Foo::x = 10; */
8206 tree context
= CP_DECL_CONTEXT (decl
);
8209 && (TREE_CODE (decl
) == VAR_DECL
8210 /* We also have a pushclass done that we need to undo here
8211 if we're at top level and declare a method. */
8212 || TREE_CODE (decl
) == FUNCTION_DECL
)
8213 /* If size hasn't been set, we're still defining it,
8214 and therefore inside the class body; don't pop
8215 the binding level.. */
8216 && COMPLETE_TYPE_P (context
)
8217 && context
== current_class_type
)
8218 pop_nested_class ();
8225 TREE_READONLY (decl
) = 1;
8228 /* This is here for a midend callback from c-common.c */
8231 finish_decl (decl
, init
, asmspec_tree
)
8235 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8238 /* Returns a declaration for a VAR_DECL as if:
8240 extern "C" TYPE NAME;
8242 had been seen. Used to create compiler-generated global
8246 declare_global_var (name
, type
)
8252 push_to_top_level ();
8253 decl
= build_decl (VAR_DECL
, name
, type
);
8254 TREE_PUBLIC (decl
) = 1;
8255 DECL_EXTERNAL (decl
) = 1;
8256 DECL_ARTIFICIAL (decl
) = 1;
8258 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8259 pop_from_top_level ();
8264 /* Returns a pointer to the `atexit' function. Note that if
8265 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8266 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8280 if (flag_use_cxa_atexit
)
8282 /* The declaration for `__cxa_atexit' is:
8284 int __cxa_atexit (void (*)(void *), void *, void *)
8286 We build up the argument types and then then function type
8289 /* First, build the pointer-to-function type for the first
8291 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8292 fn_type
= build_function_type (void_type_node
, arg_types
);
8293 fn_ptr_type
= build_pointer_type (fn_type
);
8294 /* Then, build the rest of the argument types. */
8295 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8296 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8297 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8298 /* And the final __cxa_atexit type. */
8299 fn_type
= build_function_type (integer_type_node
, arg_types
);
8300 fn_ptr_type
= build_pointer_type (fn_type
);
8301 name
= "__cxa_atexit";
8305 /* The declaration for `atexit' is:
8307 int atexit (void (*)());
8309 We build up the argument types and then then function type
8311 fn_type
= build_function_type (void_type_node
, void_list_node
);
8312 fn_ptr_type
= build_pointer_type (fn_type
);
8313 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8314 /* Build the final atexit type. */
8315 fn_type
= build_function_type (integer_type_node
, arg_types
);
8319 /* Now, build the function declaration. */
8320 push_lang_context (lang_name_c
);
8321 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8322 mark_used (atexit_fndecl
);
8323 pop_lang_context ();
8324 atexit_node
= default_conversion (atexit_fndecl
);
8329 /* Returns the __dso_handle VAR_DECL. */
8332 get_dso_handle_node ()
8334 if (dso_handle_node
)
8335 return dso_handle_node
;
8337 /* Declare the variable. */
8338 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8341 return dso_handle_node
;
8344 /* Begin a new function with internal linkage whose job will be simply
8345 to destroy some particular variable. */
8350 static int counter
= 0;
8351 int old_interface_unknown
= interface_unknown
;
8357 push_to_top_level ();
8359 /* No need to mangle this. */
8360 push_lang_context (lang_name_c
);
8362 interface_unknown
= 1;
8364 /* Build the parameter-types. */
8365 parmtypes
= void_list_node
;
8366 /* Functions passed to __cxa_atexit take an additional parameter.
8367 We'll just ignore it. After we implement the new calling
8368 convention for destructors, we can eliminate the use of
8369 additional cleanup functions entirely in the -fnew-abi case. */
8370 if (flag_use_cxa_atexit
)
8371 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8372 /* Build the function type itself. */
8373 fntype
= build_function_type (void_type_node
, parmtypes
);
8374 /* Build the name of the function. */
8375 sprintf (name
, "__tcf_%d", counter
++);
8376 /* Build the function declaration. */
8377 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8378 /* It's a function with internal linkage, generated by the
8380 TREE_PUBLIC (fndecl
) = 0;
8381 DECL_ARTIFICIAL (fndecl
) = 1;
8382 /* Make the function `inline' so that it is only emitted if it is
8383 actually needed. It is unlikely that it will be inlined, since
8384 it is only called via a function pointer, but we avoid unncessary
8385 emissions this way. */
8386 DECL_INLINE (fndecl
) = 1;
8387 /* Build the parameter. */
8388 if (flag_use_cxa_atexit
)
8392 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8393 DECL_CONTEXT (parmdecl
) = fndecl
;
8394 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8395 TREE_USED (parmdecl
) = 1;
8396 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8400 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8403 interface_unknown
= old_interface_unknown
;
8405 pop_lang_context ();
8407 return current_function_decl
;
8410 /* Finish the cleanup function begun by start_cleanup_fn. */
8417 expand_body (finish_function (0));
8419 pop_from_top_level ();
8422 /* Generate code to handle the destruction of DECL, an object with
8423 static storage duration. */
8426 register_dtor_fn (decl
)
8434 int saved_flag_access_control
;
8436 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8439 /* Call build_cleanup before we enter the anonymous function so that
8440 any access checks will be done relative to the current scope,
8441 rather than the scope of the anonymous function. */
8442 build_cleanup (decl
);
8444 /* Now start the function. */
8445 cleanup
= start_cleanup_fn ();
8447 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8448 to the original function, rather than the anonymous one. That
8449 will make the back-end think that nested functions are in use,
8450 which causes confusion. */
8451 saved_flag_access_control
= flag_access_control
;
8452 flag_access_control
= 0;
8453 fcall
= build_cleanup (decl
);
8454 flag_access_control
= saved_flag_access_control
;
8456 /* Create the body of the anonymous function. */
8457 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8458 finish_expr_stmt (fcall
);
8459 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8462 /* Call atexit with the cleanup function. */
8463 mark_addressable (cleanup
);
8464 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8465 if (flag_use_cxa_atexit
)
8467 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8468 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8469 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8472 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8473 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8477 expand_static_init (decl
, init
)
8481 tree oldstatic
= value_member (decl
, static_aggregates
);
8485 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8486 cp_error ("multiple initializations given for `%D'", decl
);
8488 else if (! toplevel_bindings_p ())
8490 /* Emit code to perform this initialization but once. */
8497 /* Emit code to perform this initialization but once. This code
8500 static int guard = 0;
8502 // Do initialization.
8504 // Register variable for destruction at end of program.
8507 Note that the `temp' variable is only set to 1 *after* the
8508 initialization is complete. This ensures that an exception,
8509 thrown during the construction, will cause the variable to
8510 reinitialized when we pass through this code again, as per:
8514 If the initialization exits by throwing an exception, the
8515 initialization is not complete, so it will be tried again
8516 the next time control enters the declaration.
8518 In theory, this process should be thread-safe, too; multiple
8519 threads should not be able to initialize the variable more
8520 than once. We don't yet attempt to ensure thread-safety. */
8522 /* Create the guard variable. */
8523 guard
= get_guard (decl
);
8525 /* Begin the conditional initialization. */
8526 if_stmt
= begin_if_stmt ();
8527 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8528 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8530 /* Do the initialization itself. */
8531 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8532 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8533 assignment
= build_aggr_init (decl
, init
, 0);
8535 /* The initialization we're doing here is just a bitwise
8537 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8539 assignment
= NULL_TREE
;
8541 /* Once the assignment is complete, set TEMP to 1. Since the
8542 construction of the static object is complete at this point,
8543 we want to make sure TEMP is set to 1 even if a temporary
8544 constructed during the initialization throws an exception
8545 when it is destroyed. So, we combine the initialization and
8546 the assignment to TEMP into a single expression, ensuring
8547 that when we call finish_expr_stmt the cleanups will not be
8548 run until after TEMP is set to 1. */
8549 guard_init
= set_guard (guard
);
8552 assignment
= tree_cons (NULL_TREE
, assignment
,
8553 build_tree_list (NULL_TREE
,
8555 assignment
= build_compound_expr (assignment
);
8558 assignment
= guard_init
;
8559 finish_expr_stmt (assignment
);
8561 /* Use atexit to register a function for destroying this static
8563 register_dtor_fn (decl
);
8565 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8566 finish_then_clause (if_stmt
);
8570 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8573 /* Finish the declaration of a catch-parameter. */
8576 start_handler_parms (declspecs
, declarator
)
8583 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8585 if (decl
== NULL_TREE
)
8586 error ("invalid catch parameter");
8595 /* Make TYPE a complete type based on INITIAL_VALUE.
8596 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8597 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8600 complete_array_type (type
, initial_value
, do_default
)
8601 tree type
, initial_value
;
8604 register tree maxindex
= NULL_TREE
;
8609 /* An array of character type can be initialized from a
8610 brace-enclosed string constant. */
8611 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8612 && TREE_CODE (initial_value
) == CONSTRUCTOR
8613 && CONSTRUCTOR_ELTS (initial_value
)
8614 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8616 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8617 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8619 /* Note MAXINDEX is really the maximum index, one less than the
8621 if (TREE_CODE (initial_value
) == STRING_CST
)
8624 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8625 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8628 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8630 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8632 maxindex
= ssize_int (-1);
8633 for (; elts
; elts
= TREE_CHAIN (elts
))
8635 if (TREE_PURPOSE (elts
))
8636 maxindex
= TREE_PURPOSE (elts
);
8638 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8640 maxindex
= copy_node (maxindex
);
8644 /* Make an error message unless that happened already. */
8645 if (initial_value
!= error_mark_node
)
8648 initial_value
= NULL_TREE
;
8650 /* Prevent further error messages. */
8651 maxindex
= build_int_2 (0, 0);
8658 maxindex
= build_int_2 (0, 0);
8667 domain
= build_index_type (maxindex
);
8668 TYPE_DOMAIN (type
) = domain
;
8670 if (! TREE_TYPE (maxindex
))
8671 TREE_TYPE (maxindex
) = domain
;
8673 itype
= TREE_TYPE (initial_value
);
8676 if (itype
&& !TYPE_DOMAIN (itype
))
8677 TYPE_DOMAIN (itype
) = domain
;
8678 /* The type of the main variant should never be used for arrays
8679 of different sizes. It should only ever be completed with the
8680 size of the array. */
8681 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8682 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8685 /* Lay out the type now that we can get the real answer. */
8692 /* Return zero if something is declared to be a member of type
8693 CTYPE when in the context of CUR_TYPE. STRING is the error
8694 message to print in that case. Otherwise, quietly return 1. */
8697 member_function_or_else (ctype
, cur_type
, flags
)
8698 tree ctype
, cur_type
;
8699 enum overload_flags flags
;
8701 if (ctype
&& ctype
!= cur_type
)
8703 if (flags
== DTOR_FLAG
)
8704 cp_error ("destructor for alien class `%T' cannot be a member",
8707 cp_error ("constructor for alien class `%T' cannot be a member",
8714 /* Subroutine of `grokdeclarator'. */
8716 /* Generate errors possibly applicable for a given set of specifiers.
8717 This is for ARM $7.1.2. */
8720 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8723 int virtualp
, quals
, friendp
, raises
, inlinep
;
8726 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8728 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8730 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8733 cp_error_at ("`%D' declared as a friend", object
);
8734 if (raises
&& !TYPE_PTRFN_P (TREE_TYPE (object
))
8735 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object
)))
8736 cp_error_at ("`%D' declared with an exception specification", object
);
8739 /* CTYPE is class type, or null if non-class.
8740 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8742 DECLARATOR is the function's name.
8743 VIRTUALP is truthvalue of whether the function is virtual or not.
8744 FLAGS are to be passed through to `grokclassfn'.
8745 QUALS are qualifiers indicating whether the function is `const'
8747 RAISES is a list of exceptions that this function can raise.
8748 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8749 not look, and -1 if we should not call `grokclassfn' at all.
8751 Returns `NULL_TREE' if something goes wrong, after issuing
8752 applicable error messages. */
8755 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8756 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8757 template_count
, in_namespace
)
8760 tree orig_declarator
;
8762 enum overload_flags flags
;
8764 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8768 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8769 int has_default_arg
= 0;
8774 type
= build_exception_variant (type
, raises
);
8777 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8778 /* Propagate volatile out from type to decl. */
8779 if (TYPE_VOLATILE (type
))
8780 TREE_THIS_VOLATILE (decl
) = 1;
8782 /* If this decl has namespace scope, set that up. */
8784 set_decl_namespace (decl
, in_namespace
, friendp
);
8786 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8788 /* `main' and builtins have implicit 'C' linkage. */
8789 if ((MAIN_NAME_P (declarator
)
8790 || (IDENTIFIER_LENGTH (declarator
) > 10
8791 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8792 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8793 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8794 && current_lang_name
== lang_name_cplusplus
8795 && ctype
== NULL_TREE
8796 /* NULL_TREE means global namespace. */
8797 && DECL_CONTEXT (decl
) == NULL_TREE
)
8798 SET_DECL_LANGUAGE (decl
, lang_c
);
8800 /* Should probably propagate const out from type to decl I bet (mrs). */
8803 DECL_STATIC_FUNCTION_P (decl
) = 1;
8804 DECL_CONTEXT (decl
) = ctype
;
8808 DECL_CONTEXT (decl
) = ctype
;
8810 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8812 if (processing_template_decl
)
8813 error ("cannot declare `::main' to be a template");
8815 error ("cannot declare `::main' to be inline");
8817 error ("cannot declare `::main' to be static");
8818 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8820 error ("`main' must return `int'");
8825 /* Members of anonymous types and local classes have no linkage; make
8827 /* FIXME what if it gets a name from typedef? */
8828 if (ctype
&& (TYPE_ANONYMOUS_P (ctype
)
8829 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8834 /* [basic.link]: A name with no linkage (notably, the name of a class
8835 or enumeration declared in a local scope) shall not be used to
8836 declare an entity with linkage.
8838 Only check this for public decls for now. */
8839 t
= no_linkage_check (TREE_TYPE (decl
));
8842 if (TYPE_ANONYMOUS_P (t
))
8844 if (DECL_EXTERN_C_P (decl
))
8845 /* Allow this; it's pretty common in C. */;
8848 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8850 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t
)))
8852 `%#D' does not refer to the unqualified type, so it is not used for linkage",
8857 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8862 TREE_PUBLIC (decl
) = publicp
;
8865 DECL_INTERFACE_KNOWN (decl
) = 1;
8866 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8869 /* If the declaration was declared inline, mark it as such. */
8871 DECL_DECLARED_INLINE_P (decl
) = 1;
8872 /* We inline functions that are explicitly declared inline, or, when
8873 the user explicitly asks us to, all functions. */
8874 if (DECL_DECLARED_INLINE_P (decl
) || flag_inline_trees
== 2)
8875 DECL_INLINE (decl
) = 1;
8877 DECL_EXTERNAL (decl
) = 1;
8878 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8880 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8881 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8885 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8886 grok_op_properties (decl
, virtualp
, check
< 0);
8888 if (ctype
&& decl_function_context (decl
))
8889 DECL_NO_STATIC_CHAIN (decl
) = 1;
8891 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8892 if (TREE_PURPOSE (t
)
8893 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8895 has_default_arg
= 1;
8900 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8904 ("defining explicit specialization `%D' in friend declaration",
8908 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8909 tree args
= TREE_OPERAND (orig_declarator
, 1);
8911 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8913 /* Something like `template <class T> friend void f<T>()'. */
8914 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8920 /* A friend declaration of the form friend void f<>(). Record
8921 the information in the TEMPLATE_ID_EXPR. */
8922 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8924 if (TREE_CODE (fns
) == COMPONENT_REF
)
8926 /* Due to bison parser ickiness, we will have already looked
8927 up an operator_name or PFUNCNAME within the current class
8928 (see template_id in parse.y). If the current class contains
8929 such a name, we'll get a COMPONENT_REF here. Undo that. */
8931 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8932 == current_class_type
, 20001120);
8933 fns
= TREE_OPERAND (fns
, 1);
8935 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8936 || TREE_CODE (fns
) == LOOKUP_EXPR
8937 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8938 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8940 if (has_default_arg
)
8942 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8949 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8956 if (has_default_arg
)
8957 add_defarg_fn (decl
);
8960 /* Make the init_value nonzero so pushdecl knows this is not
8961 tentative. error_mark_node is replaced later with the BLOCK. */
8962 DECL_INITIAL (decl
) = error_mark_node
;
8964 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8965 TREE_NOTHROW (decl
) = 1;
8967 /* Caller will do the rest of this. */
8971 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (ctype
) == declarator
)
8972 DECL_CONSTRUCTOR_P (decl
) = 1;
8974 /* Function gets the ugly name, field gets the nice one. This call
8975 may change the type of the function (because of default
8977 if (ctype
!= NULL_TREE
)
8978 grokclassfn (ctype
, decl
, flags
, quals
);
8980 decl
= check_explicit_specialization (orig_declarator
, decl
,
8982 2 * (funcdef_flag
!= 0) +
8983 4 * (friendp
!= 0));
8984 if (decl
== error_mark_node
)
8987 if (ctype
!= NULL_TREE
8988 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8993 old_decl
= check_classfn (ctype
, decl
);
8995 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8996 /* Because grokfndecl is always supposed to return a
8997 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8998 here. We depend on our callers to figure out that its
8999 really a template that's being returned. */
9000 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
9002 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
9003 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
9005 /* Remove the `this' parm added by grokclassfn.
9006 XXX Isn't this done in start_function, too? */
9007 revert_static_member_fn (decl
);
9008 last_function_parms
= TREE_CHAIN (last_function_parms
);
9010 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
9011 cp_error ("definition of implicitly-declared `%D'", old_decl
);
9015 /* Since we've smashed OLD_DECL to its
9016 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9017 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9018 decl
= DECL_TEMPLATE_RESULT (decl
);
9020 /* Attempt to merge the declarations. This can fail, in
9021 the case of some illegal specialization declarations. */
9022 if (!duplicate_decls (decl
, old_decl
))
9023 cp_error ("no `%#D' member function declared in class `%T'",
9029 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
9032 if (ctype
== NULL_TREE
|| check
)
9036 DECL_VIRTUAL_P (decl
) = 1;
9042 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
9045 RID_BIT_TYPE
*specbits_in
;
9051 RID_BIT_TYPE specbits
;
9053 specbits
= *specbits_in
;
9055 if (TREE_CODE (type
) == OFFSET_TYPE
)
9057 /* If you declare a static member so that it
9058 can be initialized, the code will reach here. */
9059 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
9060 type
= TREE_TYPE (type
);
9061 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9062 DECL_CONTEXT (decl
) = basetype
;
9069 context
= in_namespace
;
9070 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9071 context
= current_namespace
;
9073 context
= NULL_TREE
;
9075 /* For namespace-scope variables, declared in a template, we
9076 need the full lang_decl. The same is true for
9077 namespace-scope variables that do not have C++ language
9080 && (processing_template_decl
9081 || current_lang_name
!= lang_name_cplusplus
))
9082 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9084 decl
= build_decl (VAR_DECL
, declarator
, type
);
9087 set_decl_namespace (decl
, context
, 0);
9089 context
= DECL_CONTEXT (decl
);
9090 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9091 /* We can't mangle lazily here because we don't have any
9092 way to recover whether or not a variable was `extern
9098 set_decl_namespace (decl
, in_namespace
, 0);
9100 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9102 DECL_THIS_EXTERN (decl
) = 1;
9103 DECL_EXTERNAL (decl
) = !initialized
;
9106 /* In class context, static means one per class,
9107 public access, and static storage. */
9108 if (DECL_CLASS_SCOPE_P (decl
))
9110 TREE_PUBLIC (decl
) = 1;
9111 TREE_STATIC (decl
) = 1;
9112 DECL_EXTERNAL (decl
) = 0;
9114 /* At top level, either `static' or no s.c. makes a definition
9115 (perhaps tentative), and absence of `static' makes it public. */
9116 else if (toplevel_bindings_p ())
9118 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9119 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9120 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9122 /* Not at top level, only `static' makes a static definition. */
9125 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9126 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9129 if (TREE_PUBLIC (decl
))
9131 /* [basic.link]: A name with no linkage (notably, the name of a class
9132 or enumeration declared in a local scope) shall not be used to
9133 declare an entity with linkage.
9135 Only check this for public decls for now. */
9136 tree t
= no_linkage_check (TREE_TYPE (decl
));
9139 if (TYPE_ANONYMOUS_P (t
))
9140 /* Ignore for now; `enum { foo } e' is pretty common. */;
9142 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9150 /* Create and return a canonical pointer to member function type, for
9151 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9154 build_ptrmemfunc_type (type
)
9159 tree unqualified_variant
= NULL_TREE
;
9161 if (type
== error_mark_node
)
9164 /* If a canonical type already exists for this type, use it. We use
9165 this method instead of type_hash_canon, because it only does a
9166 simple equality check on the list of field members. */
9168 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9171 /* Make sure that we always have the unqualified pointer-to-member
9173 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9175 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9177 t
= make_aggr_type (RECORD_TYPE
);
9178 /* Let the front-end know this is a pointer to member function... */
9179 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9180 /* ... and not really an aggregate. */
9181 SET_IS_AGGR_TYPE (t
, 0);
9183 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9184 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9186 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9188 /* Zap out the name so that the back-end will give us the debugging
9189 information for this anonymous RECORD_TYPE. */
9190 TYPE_NAME (t
) = NULL_TREE
;
9192 /* If this is not the unqualified form of this pointer-to-member
9193 type, set the TYPE_MAIN_VARIANT for this type to be the
9194 unqualified type. Since they are actually RECORD_TYPEs that are
9195 not variants of each other, we must do this manually. */
9196 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9198 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9199 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9200 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9201 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9204 /* Cache this pointer-to-member type so that we can find it again
9206 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9208 /* Seems to be wanted. */
9209 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9214 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9215 Check to see that the definition is valid. Issue appropriate error
9216 messages. Return 1 if the definition is particularly bad, or 0
9220 check_static_variable_definition (decl
, type
)
9224 /* Motion 10 at San Diego: If a static const integral data member is
9225 initialized with an integral constant expression, the initializer
9226 may appear either in the declaration (within the class), or in
9227 the definition, but not both. If it appears in the class, the
9228 member is a member constant. The file-scope definition is always
9230 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9232 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9234 /* If we just return the declaration, crashes will sometimes
9235 occur. We therefore return void_type_node, as if this was a
9236 friend declaration, to cause callers to completely ignore
9237 this declaration. */
9240 else if (!CP_TYPE_CONST_P (type
))
9241 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9243 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9244 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9249 /* Given the SIZE (i.e., number of elements) in an array, compute an
9250 appropriate index type for the array. If non-NULL, NAME is the
9251 name of the thing being declared. */
9254 compute_array_index_type (name
, size
)
9260 /* If this involves a template parameter, it will be a constant at
9261 instantiation time, but we don't know what the value is yet.
9262 Even if no template parameters are involved, we may an expression
9263 that is not a constant; we don't even simplify `1 + 2' when
9264 processing a template. */
9265 if (processing_template_decl
)
9267 /* Resolve a qualified reference to an enumerator or static
9268 const data member of ours. */
9269 if (TREE_CODE (size
) == SCOPE_REF
9270 && TREE_OPERAND (size
, 0) == current_class_type
)
9272 tree t
= lookup_field (current_class_type
,
9273 TREE_OPERAND (size
, 1), 0, 0);
9278 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9279 size
, integer_one_node
));
9282 /* The size might be the result of a cast. */
9283 STRIP_TYPE_NOPS (size
);
9285 /* It might be a const variable or enumeration constant. */
9286 size
= decl_constant_value (size
);
9288 /* The array bound must be an integer type. */
9289 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9290 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9291 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9294 cp_error ("size of array `%D' has non-integer type", name
);
9296 cp_error ("size of array has non-integer type");
9297 size
= integer_one_node
;
9300 /* Normally, the array-bound will be a constant. */
9301 if (TREE_CODE (size
) == INTEGER_CST
)
9303 /* Check to see if the array bound overflowed. Make that an
9304 error, no matter how generous we're being. */
9305 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9306 int old_pedantic
= pedantic
;
9307 pedantic
= flag_pedantic_errors
= 1;
9308 constant_expression_warning (size
);
9309 pedantic
= old_pedantic
;
9310 flag_pedantic_errors
= old_flag_pedantic_errors
;
9312 /* An array must have a positive number of elements. */
9313 if (INT_CST_LT (size
, integer_zero_node
))
9316 cp_error ("size of array `%D' is negative", name
);
9318 cp_error ("size of array is negative");
9319 size
= integer_one_node
;
9321 /* Except that an extension we allow zero-sized arrays. We
9322 always allow them in system headers because glibc uses
9324 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9327 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9329 cp_pedwarn ("ISO C++ forbids zero-size array");
9332 else if (TREE_CONSTANT (size
))
9334 /* `(int) &fn' is not a valid array bound. */
9336 cp_error ("size of array `%D' is not an integral constant-expression",
9339 cp_error ("size of array is not an integral constant-expression");
9342 /* Compute the index of the largest element in the array. It is
9343 one less than the number of elements in the array. */
9345 = fold (cp_build_binary_op (MINUS_EXPR
,
9346 cp_convert (ssizetype
, size
),
9347 cp_convert (ssizetype
,
9348 integer_one_node
)));
9350 /* Check for variable-sized arrays. We allow such things as an
9351 extension, even though they are not allowed in ANSI/ISO C++. */
9352 if (!TREE_CONSTANT (itype
))
9357 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9360 cp_pedwarn ("ISO C++ forbids variable-size array");
9363 /* Create a variable-sized array index type. */
9364 itype
= variable_size (itype
);
9366 /* Make sure that there was no overflow when creating to a signed
9367 index type. (For example, on a 32-bit machine, an array with
9368 size 2^32 - 1 is too big.) */
9369 else if (TREE_OVERFLOW (itype
))
9371 error ("overflow in array dimension");
9372 TREE_OVERFLOW (itype
) = 0;
9375 /* Create and return the appropriate index type. */
9376 return build_index_type (itype
);
9379 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9380 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9384 create_array_type_for_decl (name
, type
, size
)
9389 tree itype
= NULL_TREE
;
9390 const char* error_msg
;
9392 /* If things have already gone awry, bail now. */
9393 if (type
== error_mark_node
|| size
== error_mark_node
)
9394 return error_mark_node
;
9396 /* Assume that everything will go OK. */
9399 /* There are some types which cannot be array elements. */
9400 switch (TREE_CODE (type
))
9403 error_msg
= "array of void";
9407 error_msg
= "array of functions";
9410 case REFERENCE_TYPE
:
9411 error_msg
= "array of references";
9415 error_msg
= "array of data members";
9419 error_msg
= "array of function members";
9426 /* If something went wrong, issue an error-message and return. */
9430 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9432 cp_error ("creating %s", error_msg
);
9434 return error_mark_node
;
9439 The constant expressions that specify the bounds of the arrays
9440 can be omitted only for the first member of the sequence. */
9441 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9443 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9446 return error_mark_node
;
9449 /* Figure out the index type for the array. */
9451 itype
= compute_array_index_type (name
, size
);
9453 return build_cplus_array_type (type
, itype
);
9456 /* Check that it's OK to declare a function with the indicated TYPE.
9457 SFK indicates the kind of special function (if any) that this
9458 function is. OPTYPE is the type given in a conversion operator
9459 declaration. Returns the actual return type of the function; that
9460 may be different than TYPE if an error occurs, or for certain
9461 special functions. */
9464 check_special_function_return_type (sfk
, type
, optype
)
9465 special_function_kind sfk
;
9471 case sfk_constructor
:
9473 cp_error ("return type specification for constructor invalid");
9475 /* In the new ABI constructors do not return a value. */
9476 type
= void_type_node
;
9479 case sfk_destructor
:
9481 cp_error ("return type specification for destructor invalid");
9482 type
= void_type_node
;
9485 case sfk_conversion
:
9486 if (type
&& !same_type_p (type
, optype
))
9487 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9489 cp_pedwarn ("return type specified for `operator %T'", optype
);
9494 my_friendly_abort (20000408);
9501 /* Given declspecs and a declarator,
9502 determine the name and type of the object declared
9503 and construct a ..._DECL node for it.
9504 (In one case we can return a ..._TYPE node instead.
9505 For invalid input we sometimes return 0.)
9507 DECLSPECS is a chain of tree_list nodes whose value fields
9508 are the storage classes and type specifiers.
9510 DECL_CONTEXT says which syntactic context this declaration is in:
9511 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9512 FUNCDEF for a function definition. Like NORMAL but a few different
9513 error messages in each case. Return value may be zero meaning
9514 this definition is too screwy to try to parse.
9515 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9516 handle member functions (which have FIELD context).
9517 Return value may be zero meaning this definition is too screwy to
9519 PARM for a parameter declaration (either within a function prototype
9520 or before a function body). Make a PARM_DECL, or return void_type_node.
9521 CATCHPARM for a parameter declaration before a catch clause.
9522 TYPENAME if for a typename (in a cast or sizeof).
9523 Don't make a DECL node; just return the ..._TYPE node.
9524 FIELD for a struct or union field; make a FIELD_DECL.
9525 BITFIELD for a field with specified width.
9526 INITIALIZED is 1 if the decl has an initializer.
9528 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9529 normal attributes in TREE_PURPOSE, or NULL_TREE.
9531 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9532 It may also be so in the PARM case, for a prototype where the
9533 argument type is specified but not the name.
9535 This function is where the complicated C meanings of `static'
9536 and `extern' are interpreted.
9538 For C++, if there is any monkey business to do, the function which
9539 calls this one must do it, i.e., prepending instance variables,
9540 renaming overloaded function names, etc.
9542 Note that for this C++, it is an error to define a method within a class
9543 which does not belong to that class.
9545 Except in the case where SCOPE_REFs are implicitly known (such as
9546 methods within a class being redundantly qualified),
9547 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9548 (class_name::decl_name). The caller must also deal with this.
9550 If a constructor or destructor is seen, and the context is FIELD,
9551 then the type gains the attribute TREE_HAS_x. If such a declaration
9552 is erroneous, NULL_TREE is returned.
9554 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9555 function, these are the qualifiers to give to the `this' pointer. We
9556 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9558 May return void_type_node if the declarator turned out to be a friend.
9559 See grokfield for details. */
9562 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9565 enum decl_context decl_context
;
9569 RID_BIT_TYPE specbits
;
9572 tree type
= NULL_TREE
;
9578 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9579 int explicit_int
= 0;
9580 int explicit_char
= 0;
9581 int defaulted_int
= 0;
9582 tree typedef_decl
= NULL_TREE
;
9584 tree typedef_type
= NULL_TREE
;
9585 int funcdef_flag
= 0;
9586 enum tree_code innermost_code
= ERROR_MARK
;
9589 /* See the code below that used this. */
9590 tree decl_machine_attr
= NULL_TREE
;
9592 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9593 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9594 tree init
= NULL_TREE
;
9596 /* Keep track of what sort of function is being processed
9597 so that we can warn about default return values, or explicit
9598 return values which do not match prescribed defaults. */
9599 special_function_kind sfk
= sfk_none
;
9601 tree dname
= NULL_TREE
;
9602 tree ctype
= current_class_type
;
9603 tree ctor_return_type
= NULL_TREE
;
9604 enum overload_flags flags
= NO_SPECIAL
;
9605 tree quals
= NULL_TREE
;
9606 tree raises
= NULL_TREE
;
9607 int template_count
= 0;
9608 tree in_namespace
= NULL_TREE
;
9612 RIDBIT_RESET_ALL (specbits
);
9613 if (decl_context
== FUNCDEF
)
9614 funcdef_flag
= 1, decl_context
= NORMAL
;
9615 else if (decl_context
== MEMFUNCDEF
)
9616 funcdef_flag
= -1, decl_context
= FIELD
;
9617 else if (decl_context
== BITFIELD
)
9618 bitfield
= 1, decl_context
= FIELD
;
9620 /* Look inside a declarator for the name being declared
9621 and get it as a string, for an error message. */
9623 tree
*next
= &declarator
;
9627 while (next
&& *next
)
9630 switch (TREE_CODE (decl
))
9633 /* For attributes. */
9634 next
= &TREE_VALUE (decl
);
9639 next
= &TREE_OPERAND (decl
, 0);
9642 case BIT_NOT_EXPR
: /* For C++ destructors! */
9644 tree name
= TREE_OPERAND (decl
, 0);
9645 tree rename
= NULL_TREE
;
9647 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9649 sfk
= sfk_destructor
;
9650 if (TREE_CODE (name
) == TYPE_DECL
)
9651 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9652 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9653 if (ctype
== NULL_TREE
)
9655 if (current_class_type
== NULL_TREE
)
9657 error ("destructors must be member functions");
9662 tree t
= constructor_name (current_class_name
);
9669 tree t
= constructor_name (ctype
);
9676 cp_error ("destructor `%T' must match class name `%T'",
9678 TREE_OPERAND (decl
, 0) = rename
;
9684 case ADDR_EXPR
: /* C++ reference declaration */
9689 innermost_code
= TREE_CODE (decl
);
9690 next
= &TREE_OPERAND (decl
, 0);
9694 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9696 /* This is actually a variable declaration using
9697 constructor syntax. We need to call start_decl and
9698 cp_finish_decl so we can get the variable
9701 tree attributes
, prefix_attributes
;
9703 *next
= TREE_OPERAND (decl
, 0);
9704 init
= CALL_DECLARATOR_PARMS (decl
);
9708 attributes
= TREE_PURPOSE (attrlist
);
9709 prefix_attributes
= TREE_VALUE (attrlist
);
9713 attributes
= NULL_TREE
;
9714 prefix_attributes
= NULL_TREE
;
9717 decl
= start_decl (declarator
, declspecs
, 1,
9718 attributes
, prefix_attributes
);
9719 decl_type_access_control (decl
);
9722 /* Look for __unused__ attribute */
9723 if (TREE_USED (TREE_TYPE (decl
)))
9724 TREE_USED (decl
) = 1;
9725 finish_decl (decl
, init
, NULL_TREE
);
9728 cp_error ("invalid declarator");
9731 innermost_code
= TREE_CODE (decl
);
9732 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9733 ctype
= current_class_type
;
9735 && TREE_OPERAND (decl
, 0)
9736 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9737 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9738 == constructor_name_full (ctype
))
9739 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9740 == constructor_name (ctype
)))))
9741 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9742 next
= &TREE_OPERAND (decl
, 0);
9744 if (ctype
!= NULL_TREE
9745 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9746 && decl
== constructor_name (ctype
))
9748 sfk
= sfk_constructor
;
9749 ctor_return_type
= ctype
;
9754 case TEMPLATE_ID_EXPR
:
9756 tree fns
= TREE_OPERAND (decl
, 0);
9758 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9759 fns
= TREE_OPERAND (fns
, 0);
9762 if (TREE_CODE (dname
) == COMPONENT_REF
)
9763 dname
= TREE_OPERAND (dname
, 1);
9764 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9766 my_friendly_assert (is_overloaded_fn (dname
),
9768 dname
= DECL_NAME (get_first_fn (dname
));
9773 case IDENTIFIER_NODE
:
9774 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9779 if (C_IS_RESERVED_WORD (dname
))
9781 cp_error ("declarator-id missing; using reserved word `%D'",
9783 name
= IDENTIFIER_POINTER (dname
);
9785 else if (!IDENTIFIER_TYPENAME_P (dname
))
9786 name
= IDENTIFIER_POINTER (dname
);
9789 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9790 flags
= TYPENAME_FLAG
;
9791 ctor_return_type
= TREE_TYPE (dname
);
9792 sfk
= sfk_conversion
;
9793 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9794 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9796 name
= IDENTIFIER_POINTER (dname
);
9798 name
= "<invalid operator>";
9805 /* Perform error checking, and decide on a ctype. */
9806 tree cname
= TREE_OPERAND (decl
, 0);
9807 if (cname
== NULL_TREE
)
9809 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9812 in_namespace
= TREE_OPERAND (decl
, 0);
9813 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9815 else if (! is_aggr_type (cname
, 1))
9816 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9817 /* Must test TREE_OPERAND (decl, 1), in case user gives
9818 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9819 else if (TREE_OPERAND (decl
, 1)
9820 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9822 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9823 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9825 cp_error ("`%T::%D' is not a valid declarator", cname
,
9826 TREE_OPERAND (decl
, 1));
9827 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9828 cname
, TREE_OPERAND (decl
, 1));
9829 return void_type_node
;
9831 else if (ctype
== NULL_TREE
)
9833 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9834 TREE_OPERAND (decl
, 0) = ctype
;
9837 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9839 cp_error ("type `%T' is not derived from type `%T'",
9841 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9847 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9848 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9849 == constructor_name_full (ctype
))
9850 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9851 == constructor_name (ctype
))))
9852 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9853 next
= &TREE_OPERAND (decl
, 1);
9857 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9858 && constructor_name (ctype
) == decl
)
9860 sfk
= sfk_constructor
;
9861 ctor_return_type
= ctype
;
9863 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9864 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9865 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9866 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9868 sfk
= sfk_destructor
;
9869 ctor_return_type
= ctype
;
9871 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9872 next
= &TREE_OPERAND (decl
, 0);
9883 /* Parse error puts this typespec where
9884 a declarator should go. */
9885 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9886 if (TREE_TYPE (decl
) == current_class_type
)
9887 cp_error (" perhaps you want `%T' for a constructor",
9888 current_class_name
);
9889 dname
= DECL_NAME (decl
);
9890 name
= IDENTIFIER_POINTER (dname
);
9892 /* Avoid giving two errors for this. */
9893 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9895 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9901 cp_compiler_error ("`%D' as declarator", decl
);
9902 return 0; /* We used to do a 155 abort here. */
9907 /* A function definition's declarator must have the form of
9908 a function declarator. */
9910 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9913 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9914 && innermost_code
!= CALL_EXPR
9915 && ! (ctype
&& declspecs
== NULL_TREE
))
9917 cp_error ("declaration of `%D' as non-function", dname
);
9918 return void_type_node
;
9921 /* Anything declared one level down from the top level
9922 must be one of the parameters of a function
9923 (because the body is at least two levels down). */
9925 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9926 by not allowing C++ class definitions to specify their parameters
9927 with xdecls (must be spec.d in the parmlist).
9929 Since we now wait to push a class scope until we are sure that
9930 we are in a legitimate method context, we must set oldcname
9931 explicitly (since current_class_name is not yet alive).
9933 We also want to avoid calling this a PARM if it is in a namespace. */
9935 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9937 struct binding_level
*b
= current_binding_level
;
9938 current_binding_level
= b
->level_chain
;
9939 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9940 decl_context
= PARM
;
9941 current_binding_level
= b
;
9945 name
= decl_context
== PARM
? "parameter" : "type name";
9947 /* Look through the decl specs and record which ones appear.
9948 Some typespecs are defined as built-in typenames.
9949 Others, the ones that are modifiers of other types,
9950 are represented by bits in SPECBITS: set the bits for
9951 the modifiers that appear. Storage class keywords are also in SPECBITS.
9953 If there is a typedef name or a type, store the type in TYPE.
9954 This includes builtin typedefs such as `int'.
9956 Set EXPLICIT_INT if the type is `int' or `char' and did not
9957 come from a user typedef.
9959 Set LONGLONG if `long' is mentioned twice.
9961 For C++, constructors and destructors have their own fast treatment. */
9963 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9968 /* Certain parse errors slip through. For example,
9969 `int class;' is not caught by the parser. Try
9970 weakly to recover here. */
9971 if (TREE_CODE (spec
) != TREE_LIST
)
9974 id
= TREE_VALUE (spec
);
9976 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9978 if (id
== ridpointers
[(int) RID_INT
]
9979 || id
== ridpointers
[(int) RID_CHAR
]
9980 || id
== ridpointers
[(int) RID_BOOL
]
9981 || id
== ridpointers
[(int) RID_WCHAR
])
9985 if (id
== ridpointers
[(int) RID_BOOL
])
9986 error ("`bool' is now a keyword");
9988 cp_error ("extraneous `%T' ignored", id
);
9992 if (id
== ridpointers
[(int) RID_INT
])
9994 else if (id
== ridpointers
[(int) RID_CHAR
])
9996 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
10000 /* C++ aggregate types. */
10001 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
10004 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
10006 type
= IDENTIFIER_TYPE_VALUE (id
);
10010 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10012 if (ridpointers
[i
] == id
)
10014 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10016 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10017 pedwarn ("ISO C++ does not support `long long'");
10019 error ("`long long long' is too long for GCC");
10023 else if (RIDBIT_SETP (i
, specbits
))
10024 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10025 RIDBIT_SET (i
, specbits
);
10030 /* C++ aggregate types. */
10031 else if (TREE_CODE (id
) == TYPE_DECL
)
10034 cp_error ("multiple declarations `%T' and `%T'", type
,
10038 type
= TREE_TYPE (id
);
10039 TREE_VALUE (spec
) = type
;
10044 error ("two or more data types in declaration of `%s'", name
);
10045 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10047 register tree t
= lookup_name (id
, 1);
10048 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10049 error ("`%s' fails to be a typedef or built in type",
10050 IDENTIFIER_POINTER (id
));
10053 type
= TREE_TYPE (t
);
10055 /* See the code below that used this. */
10056 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
10061 else if (id
!= error_mark_node
)
10062 /* Can't change CLASS nodes into RECORD nodes here! */
10068 typedef_type
= type
;
10070 /* No type at all: default to `int', and set DEFAULTED_INT
10071 because it was not a user-defined typedef. */
10073 if (type
== NULL_TREE
10074 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10075 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10076 || RIDBIT_SETP (RID_LONG
, specbits
)
10077 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10079 /* These imply 'int'. */
10080 type
= integer_type_node
;
10084 if (sfk
!= sfk_none
)
10085 type
= check_special_function_return_type (sfk
, type
,
10087 else if (type
== NULL_TREE
)
10093 /* We handle `main' specially here, because 'main () { }' is so
10094 common. With no options, it is allowed. With -Wreturn-type,
10095 it is a warning. It is only an error with -pedantic-errors. */
10096 is_main
= (funcdef_flag
10097 && MAIN_NAME_P (dname
)
10098 && ctype
== NULL_TREE
10099 && in_namespace
== NULL_TREE
10100 && current_namespace
== global_namespace
);
10102 if (in_system_header
|| flag_ms_extensions
)
10103 /* Allow it, sigh. */;
10104 else if (pedantic
|| ! is_main
)
10105 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10107 else if (warn_return_type
)
10108 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10111 type
= integer_type_node
;
10116 /* Now process the modifiers that were specified
10117 and check for invalid combinations. */
10119 /* Long double is a special combination. */
10121 if (RIDBIT_SETP (RID_LONG
, specbits
)
10122 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10124 RIDBIT_RESET (RID_LONG
, specbits
);
10125 type
= build_qualified_type (long_double_type_node
,
10126 CP_TYPE_QUALS (type
));
10129 /* Check all other uses of type modifiers. */
10131 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10132 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10133 || RIDBIT_SETP (RID_LONG
, specbits
)
10134 || RIDBIT_SETP (RID_SHORT
, specbits
))
10138 if (TREE_CODE (type
) == REAL_TYPE
)
10139 error ("short, signed or unsigned invalid for `%s'", name
);
10140 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10141 error ("long, short, signed or unsigned invalid for `%s'", name
);
10142 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10143 && RIDBIT_SETP (RID_SHORT
, specbits
))
10144 error ("long and short specified together for `%s'", name
);
10145 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10146 || RIDBIT_SETP (RID_SHORT
, specbits
))
10148 error ("long or short specified with char for `%s'", name
);
10149 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10150 || RIDBIT_SETP (RID_SHORT
, specbits
))
10151 && TREE_CODE (type
) == REAL_TYPE
)
10152 error ("long or short specified with floating type for `%s'", name
);
10153 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10154 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10155 error ("signed and unsigned given together for `%s'", name
);
10159 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10161 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10163 if (flag_pedantic_errors
)
10168 /* Discard the type modifiers if they are invalid. */
10171 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10172 RIDBIT_RESET (RID_SIGNED
, specbits
);
10173 RIDBIT_RESET (RID_LONG
, specbits
);
10174 RIDBIT_RESET (RID_SHORT
, specbits
);
10179 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10180 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10182 error ("complex invalid for `%s'", name
);
10183 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10186 /* Decide whether an integer type is signed or not.
10187 Optionally treat bitfields as signed by default. */
10188 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10191 It is implementation-defined whether a plain (neither
10192 explicitly signed or unsigned) char, short, int, or long
10193 bit-field is signed or unsigned.
10195 Naturally, we extend this to long long as well. Note that
10196 this does not include wchar_t. */
10197 || (bitfield
&& !flag_signed_bitfields
10198 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10199 /* A typedef for plain `int' without `signed' can be
10200 controlled just like plain `int', but a typedef for
10201 `signed int' cannot be so controlled. */
10203 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10204 && (TREE_CODE (type
) == INTEGER_TYPE
10205 || TREE_CODE (type
) == CHAR_TYPE
)
10206 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10209 type
= long_long_unsigned_type_node
;
10210 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10211 type
= long_unsigned_type_node
;
10212 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10213 type
= short_unsigned_type_node
;
10214 else if (type
== char_type_node
)
10215 type
= unsigned_char_type_node
;
10216 else if (typedef_decl
)
10217 type
= unsigned_type (type
);
10219 type
= unsigned_type_node
;
10221 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10222 && type
== char_type_node
)
10223 type
= signed_char_type_node
;
10225 type
= long_long_integer_type_node
;
10226 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10227 type
= long_integer_type_node
;
10228 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10229 type
= short_integer_type_node
;
10231 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10233 /* If we just have "complex", it is equivalent to
10234 "complex double", but if any modifiers at all are specified it is
10235 the complex form of TYPE. E.g, "complex short" is
10236 "complex short int". */
10238 if (defaulted_int
&& ! longlong
10239 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10240 || RIDBIT_SETP (RID_SHORT
, specbits
)
10241 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10242 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10243 type
= complex_double_type_node
;
10244 else if (type
== integer_type_node
)
10245 type
= complex_integer_type_node
;
10246 else if (type
== float_type_node
)
10247 type
= complex_float_type_node
;
10248 else if (type
== double_type_node
)
10249 type
= complex_double_type_node
;
10250 else if (type
== long_double_type_node
)
10251 type
= complex_long_double_type_node
;
10253 type
= build_complex_type (type
);
10256 if (sfk
== sfk_conversion
10257 && (RIDBIT_SETP (RID_CONST
, specbits
)
10258 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10259 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10260 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10263 /* Set CONSTP if this declaration is `const', whether by
10264 explicit specification or via a typedef.
10265 Likewise for VOLATILEP. */
10267 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10269 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10271 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10272 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10273 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10274 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10275 type
= cp_build_qualified_type (type
, type_quals
);
10277 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10278 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10279 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10280 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10281 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10283 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10284 staticp
= 1 + (decl_context
== FIELD
);
10286 if (virtualp
&& staticp
== 2)
10288 cp_error ("member `%D' cannot be declared both virtual and static",
10292 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10293 RIDBIT_RESET (RID_FRIEND
, specbits
);
10295 /* Warn if two storage classes are given. Default to `auto'. */
10297 if (RIDBIT_ANY_SET (specbits
))
10299 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10300 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10301 if (decl_context
== PARM
&& nclasses
> 0)
10302 error ("storage class specifiers invalid in parameter declarations");
10303 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10305 if (decl_context
== PARM
)
10306 error ("typedef declaration invalid in parameter declaration");
10309 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10310 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10313 /* Give error if `virtual' is used outside of class declaration. */
10315 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10317 error ("virtual outside class declaration");
10321 /* Static anonymous unions are dealt with here. */
10322 if (staticp
&& decl_context
== TYPENAME
10323 && TREE_CODE (declspecs
) == TREE_LIST
10324 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10325 decl_context
= FIELD
;
10327 /* Warn about storage classes that are invalid for certain
10328 kinds of declarations (parameters, typenames, etc.). */
10331 error ("multiple storage classes in declaration of `%s'", name
);
10332 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10334 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10335 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10336 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10338 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10340 else if (decl_context
== FIELD
10341 /* C++ allows static class elements */
10342 && RIDBIT_SETP (RID_STATIC
, specbits
))
10343 /* C++ also allows inlines and signed and unsigned elements,
10344 but in those cases we don't come in here. */
10348 if (decl_context
== FIELD
)
10350 tree tmp
= NULL_TREE
;
10351 register int op
= 0;
10355 /* Avoid trying to get an operand off an identifier node. */
10356 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10359 tmp
= TREE_OPERAND (declarator
, 0);
10360 op
= IDENTIFIER_OPNAME_P (tmp
);
10361 if (IDENTIFIER_TYPENAME_P (tmp
))
10363 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10364 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10366 name
= IDENTIFIER_POINTER (tmp
);
10368 name
= "<invalid operator>";
10371 error ("storage class specified for %s `%s'",
10372 op
? "member operator" : "field",
10377 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10378 error ("storage class specified for parameter `%s'", name
);
10380 error ("storage class specified for typename");
10382 RIDBIT_RESET (RID_REGISTER
, specbits
);
10383 RIDBIT_RESET (RID_AUTO
, specbits
);
10384 RIDBIT_RESET (RID_EXTERN
, specbits
);
10387 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10389 if (toplevel_bindings_p ())
10391 /* It's common practice (and completely valid) to have a const
10392 be initialized and declared extern. */
10393 if (!(type_quals
& TYPE_QUAL_CONST
))
10394 warning ("`%s' initialized and declared `extern'", name
);
10397 error ("`%s' has both `extern' and initializer", name
);
10399 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10400 && ! toplevel_bindings_p ())
10401 error ("nested function `%s' declared `extern'", name
);
10402 else if (toplevel_bindings_p ())
10404 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10405 error ("top-level declaration of `%s' specifies `auto'", name
);
10408 if (nclasses
> 0 && friendp
)
10409 error ("storage class specifiers invalid in friend function declarations");
10411 /* Now figure out the structure of the declarator proper.
10412 Descend through it, creating more complex types, until we reach
10413 the declared identifier (or NULL_TREE, in an absolute declarator). */
10415 inner_attrs
= NULL_TREE
;
10418 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10419 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10421 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10422 an INDIRECT_REF (for *...),
10423 a CALL_EXPR (for ...(...)),
10424 an identifier (for the name being declared)
10425 or a null pointer (for the place in an absolute declarator
10426 where the name was omitted).
10427 For the last two cases, we have just exited the loop.
10429 For C++ it could also be
10430 a SCOPE_REF (for class :: ...). In this case, we have converted
10431 sensible names to types, and those are the values we use to
10432 qualify the member name.
10433 an ADDR_EXPR (for &...),
10434 a BIT_NOT_EXPR (for destructors)
10436 At this point, TYPE is the type of elements of an array,
10437 or for a function to return, or for a pointer to point to.
10438 After this sequence of ifs, TYPE is the type of the
10439 array or function or pointer, and DECLARATOR has had its
10440 outermost layer removed. */
10442 if (type
== error_mark_node
)
10444 if (TREE_CODE (declarator
) == SCOPE_REF
)
10445 declarator
= TREE_OPERAND (declarator
, 1);
10447 declarator
= TREE_OPERAND (declarator
, 0);
10450 if (quals
!= NULL_TREE
10451 && (declarator
== NULL_TREE
10452 || TREE_CODE (declarator
) != SCOPE_REF
))
10454 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10455 ctype
= TYPE_METHOD_BASETYPE (type
);
10456 if (ctype
!= NULL_TREE
)
10458 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10459 grok_method_quals (ctype
, dummy
, quals
);
10460 type
= TREE_TYPE (dummy
);
10461 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10466 /* See the comment for the TREE_LIST case, below. */
10469 else if (inner_attrs
)
10471 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10472 inner_attrs
= NULL_TREE
;
10475 switch (TREE_CODE (declarator
))
10479 /* We encode a declarator with embedded attributes using
10480 a TREE_LIST. The attributes apply to the declarator
10481 directly inside them, so we have to skip an iteration
10482 before applying them to the type. If the declarator just
10483 inside is the declarator-id, we apply the attrs to the
10485 inner_attrs
= TREE_PURPOSE (declarator
);
10487 declarator
= TREE_VALUE (declarator
);
10493 register tree size
;
10495 size
= TREE_OPERAND (declarator
, 1);
10497 /* VC++ spells a zero-sized array with []. */
10498 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10499 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10500 size
= integer_zero_node
;
10502 declarator
= TREE_OPERAND (declarator
, 0);
10504 type
= create_array_type_for_decl (dname
, type
, size
);
10506 /* VLAs never work as fields. */
10507 if (decl_context
== FIELD
&& !processing_template_decl
10508 && TREE_CODE (type
) == ARRAY_TYPE
10509 && TYPE_DOMAIN (type
) != NULL_TREE
10510 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10512 cp_error ("size of member `%D' is not constant", dname
);
10513 /* Proceed with arbitrary constant size, so that offset
10514 computations don't get confused. */
10515 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10527 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10528 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10530 /* Declaring a function type.
10531 Make sure we have a valid type for the function to return. */
10533 /* We now know that the TYPE_QUALS don't apply to the
10534 decl, but to its return type. */
10535 type_quals
= TYPE_UNQUALIFIED
;
10537 /* Warn about some types functions can't return. */
10539 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10541 error ("`%s' declared as function returning a function", name
);
10542 type
= integer_type_node
;
10544 if (TREE_CODE (type
) == ARRAY_TYPE
)
10546 error ("`%s' declared as function returning an array", name
);
10547 type
= integer_type_node
;
10550 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10551 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10553 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10554 inner_decl
= dname
;
10556 /* Pick up type qualifiers which should be applied to `this'. */
10557 quals
= CALL_DECLARATOR_QUALS (declarator
);
10559 /* Pick up the exception specifications. */
10560 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10562 /* Say it's a definition only for the CALL_EXPR
10563 closest to the identifier. */
10566 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10567 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10568 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10570 if (ctype
== NULL_TREE
10571 && decl_context
== FIELD
10573 && (friendp
== 0 || dname
== current_class_name
))
10574 ctype
= current_class_type
;
10576 if (ctype
&& sfk
== sfk_conversion
)
10577 TYPE_HAS_CONVERSION (ctype
) = 1;
10578 if (ctype
&& constructor_name (ctype
) == dname
)
10580 /* We are within a class's scope. If our declarator name
10581 is the same as the class name, and we are defining
10582 a function, then it is a constructor/destructor, and
10583 therefore returns a void type. */
10585 if (flags
== DTOR_FLAG
)
10587 /* ISO C++ 12.4/2. A destructor may not be
10588 declared const or volatile. A destructor may
10591 error ("destructor cannot be static member function");
10594 cp_error ("destructors may not be `%s'",
10595 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10598 if (decl_context
== FIELD
)
10600 if (! member_function_or_else (ctype
,
10601 current_class_type
,
10603 return void_type_node
;
10606 else /* It's a constructor. */
10608 if (explicitp
== 1)
10610 /* ISO C++ 12.1. A constructor may not be
10611 declared const or volatile. A constructor may
10612 not be virtual. A constructor may not be
10615 error ("constructor cannot be static member function");
10618 pedwarn ("constructors cannot be declared virtual");
10623 cp_error ("constructors may not be `%s'",
10624 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10628 RID_BIT_TYPE tmp_bits
;
10629 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10630 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10631 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10632 if (RIDBIT_ANY_SET (tmp_bits
))
10633 error ("return value type specifier for constructor ignored");
10635 if (decl_context
== FIELD
)
10637 if (! member_function_or_else (ctype
,
10638 current_class_type
,
10640 return void_type_node
;
10641 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10642 if (sfk
!= sfk_constructor
)
10646 if (decl_context
== FIELD
)
10652 error ("can't initialize friend function `%s'", name
);
10655 /* Cannot be both friend and virtual. */
10656 error ("virtual functions cannot be friends");
10657 RIDBIT_RESET (RID_FRIEND
, specbits
);
10660 if (decl_context
== NORMAL
)
10661 error ("friend declaration not in class definition");
10662 if (current_function_decl
&& funcdef_flag
)
10663 cp_error ("can't define friend function `%s' in a local class definition",
10667 /* Construct the function type and go to the next
10668 inner layer of declarator. */
10670 declarator
= TREE_OPERAND (declarator
, 0);
10672 /* FIXME: This is where default args should be fully
10675 arg_types
= grokparms (inner_parms
);
10677 if (declarator
&& flags
== DTOR_FLAG
)
10679 /* A destructor declared in the body of a class will
10680 be represented as a BIT_NOT_EXPR. But, we just
10681 want the underlying IDENTIFIER. */
10682 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10683 declarator
= TREE_OPERAND (declarator
, 0);
10685 if (arg_types
!= void_list_node
)
10687 cp_error ("destructors may not have parameters");
10688 arg_types
= void_list_node
;
10689 last_function_parms
= NULL_TREE
;
10693 /* ANSI says that `const int foo ();'
10694 does not make the function foo const. */
10695 type
= build_function_type (type
, arg_types
);
10699 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10700 if (TREE_PURPOSE (t
)
10701 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10703 add_defarg_fn (type
);
10712 /* Filter out pointers-to-references and references-to-references.
10713 We can get these if a TYPE_DECL is used. */
10715 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10717 error ("cannot declare %s to references",
10718 TREE_CODE (declarator
) == ADDR_EXPR
10719 ? "references" : "pointers");
10720 declarator
= TREE_OPERAND (declarator
, 0);
10724 if (TREE_CODE (type
) == OFFSET_TYPE
10725 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10726 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10728 cp_error ("cannot declare pointer to `%#T' member",
10730 type
= TREE_TYPE (type
);
10733 /* Merge any constancy or volatility into the target type
10734 for the pointer. */
10736 /* We now know that the TYPE_QUALS don't apply to the decl,
10737 but to the target of the pointer. */
10738 type_quals
= TYPE_UNQUALIFIED
;
10740 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10742 if (TREE_CODE (type
) == VOID_TYPE
)
10743 error ("invalid type: `void &'");
10745 type
= build_reference_type (type
);
10747 else if (TREE_CODE (type
) == METHOD_TYPE
)
10748 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10750 type
= build_pointer_type (type
);
10752 /* Process a list of type modifier keywords (such as
10753 const or volatile) that were given inside the `*' or `&'. */
10755 if (TREE_TYPE (declarator
))
10757 register tree typemodlist
;
10763 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10764 typemodlist
= TREE_CHAIN (typemodlist
))
10766 tree qualifier
= TREE_VALUE (typemodlist
);
10768 if (qualifier
== ridpointers
[(int) RID_CONST
])
10770 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10772 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10777 error ("invalid type modifier within pointer declarator");
10781 pedwarn ("duplicate `const'");
10783 pedwarn ("duplicate `volatile'");
10785 pedwarn ("duplicate `restrict'");
10787 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10788 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10789 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10790 if (TREE_CODE (declarator
) == ADDR_EXPR
10791 && (constp
|| volatilep
))
10794 pedwarn ("discarding `const' applied to a reference");
10796 pedwarn ("discarding `volatile' applied to a reference");
10797 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10799 type
= cp_build_qualified_type (type
, type_quals
);
10801 declarator
= TREE_OPERAND (declarator
, 0);
10807 /* We have converted type names to NULL_TREE if the
10808 name was bogus, or to a _TYPE node, if not.
10810 The variable CTYPE holds the type we will ultimately
10811 resolve to. The code here just needs to build
10812 up appropriate member types. */
10813 tree sname
= TREE_OPERAND (declarator
, 1);
10816 /* Destructors can have their visibilities changed as well. */
10817 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10818 sname
= TREE_OPERAND (sname
, 0);
10820 if (TREE_COMPLEXITY (declarator
) == 0)
10821 /* This needs to be here, in case we are called
10822 multiple times. */ ;
10823 else if (TREE_COMPLEXITY (declarator
) == -1)
10824 /* Namespace member. */
10825 pop_decl_namespace ();
10826 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10827 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10828 else if (! IS_AGGR_TYPE_CODE
10829 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10831 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10833 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10834 that refer to ctype. They couldn't be resolved earlier
10835 because we hadn't pushed into the class yet.
10836 Example: resolve 'B<T>::type' in
10837 'B<typename B<T>::type> B<T>::f () { }'. */
10838 if (current_template_parms
10839 && uses_template_parms (type
)
10840 && uses_template_parms (current_class_type
))
10842 tree args
= current_template_args ();
10843 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10846 /* This pop_nested_class corresponds to the
10847 push_nested_class used to push into class scope for
10848 parsing the argument list of a function decl, in
10850 pop_nested_class ();
10851 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10854 my_friendly_abort (16);
10856 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10858 /* We had a reference to a global decl, or
10859 perhaps we were given a non-aggregate typedef,
10860 in which case we cleared this out, and should just
10861 keep going as though it wasn't there. */
10862 declarator
= sname
;
10865 ctype
= TREE_OPERAND (declarator
, 0);
10868 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10870 /* You're supposed to have one `template <...>'
10871 for every template class, but you don't need one
10872 for a full specialization. For example:
10874 template <class T> struct S{};
10875 template <> struct S<int> { void f(); };
10876 void S<int>::f () {}
10878 is correct; there shouldn't be a `template <>' for
10879 the definition of `S<int>::f'. */
10880 if (CLASSTYPE_TEMPLATE_INFO (t
)
10881 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10882 || uses_template_parms (CLASSTYPE_TI_ARGS (t
)))
10883 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)))
10884 template_count
+= 1;
10886 t
= TYPE_MAIN_DECL (t
);
10887 t
= DECL_CONTEXT (t
);
10890 if (sname
== NULL_TREE
)
10893 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10895 /* This is the `standard' use of the scoping operator:
10896 basetype :: member . */
10898 if (ctype
== current_class_type
)
10904 Is this ill-formed? */
10907 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10910 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10912 if (current_class_type
== NULL_TREE
|| friendp
)
10913 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10914 TYPE_ARG_TYPES (type
));
10917 cp_error ("cannot declare member function `%T::%s' within `%T'",
10918 ctype
, name
, current_class_type
);
10919 return void_type_node
;
10922 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10923 || COMPLETE_TYPE_P (complete_type (ctype
)))
10925 /* Have to move this code elsewhere in this function.
10926 this code is used for i.e., typedef int A::M; M *pm;
10928 It is? How? jason 10/2/94 */
10930 if (current_class_type
)
10932 cp_error ("cannot declare member `%T::%s' within `%T'",
10933 ctype
, name
, current_class_type
);
10934 return void_type_node
;
10936 type
= build_offset_type (ctype
, type
);
10940 incomplete_type_error (NULL_TREE
, ctype
);
10941 return error_mark_node
;
10944 declarator
= sname
;
10946 else if (TREE_CODE (sname
) == SCOPE_REF
)
10947 my_friendly_abort (17);
10951 declarator
= TREE_OPERAND (declarator
, 1);
10952 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10953 /* In this case, we will deal with it later. */
10957 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10958 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10959 TYPE_ARG_TYPES (type
));
10961 type
= build_offset_type (ctype
, type
);
10968 declarator
= TREE_OPERAND (declarator
, 0);
10973 case ENUMERAL_TYPE
:
10974 declarator
= NULL_TREE
;
10978 declarator
= NULL_TREE
;
10982 my_friendly_abort (158);
10986 /* See the comment for the TREE_LIST case, above. */
10989 if (! ignore_attrs
)
10990 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10992 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10994 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
10997 /* Now TYPE has the actual type. */
10999 if (explicitp
== 1 || (explicitp
&& friendp
))
11001 /* [dcl.fct.spec] The explicit specifier shall only be used in
11002 declarations of constructors within a class definition. */
11003 error ("only declarations of constructors can be `explicit'");
11007 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11009 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11011 error ("non-member `%s' cannot be declared `mutable'", name
);
11012 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11014 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11016 error ("non-object member `%s' cannot be declared `mutable'", name
);
11017 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11019 else if (TREE_CODE (type
) == FUNCTION_TYPE
11020 || TREE_CODE (type
) == METHOD_TYPE
)
11022 error ("function `%s' cannot be declared `mutable'", name
);
11023 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11027 error ("static `%s' cannot be declared `mutable'", name
);
11028 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11030 else if (type_quals
& TYPE_QUAL_CONST
)
11032 error ("const `%s' cannot be declared `mutable'", name
);
11033 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11037 if (declarator
== NULL_TREE
11038 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11039 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11040 && (TREE_CODE (type
) == FUNCTION_TYPE
11041 || TREE_CODE (type
) == METHOD_TYPE
)))
11043 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11045 cp_error ("template-id `%D' used as a declarator", declarator
);
11046 declarator
= dname
;
11049 /* Unexpected declarator format. */
11050 my_friendly_abort (990210);
11052 /* If this is declaring a typedef name, return a TYPE_DECL. */
11054 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11058 /* Note that the grammar rejects storage classes
11059 in typenames, fields or parameters. */
11060 if (current_lang_name
== lang_name_java
)
11061 TYPE_FOR_JAVA (type
) = 1;
11063 if (decl_context
== FIELD
)
11065 if (declarator
== constructor_name (current_class_type
))
11066 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11068 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11072 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11073 if (!current_function_decl
)
11074 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11077 /* If the user declares "typedef struct {...} foo" then the
11078 struct will have an anonymous name. Fill that name in now.
11079 Nothing can refer to it, so nothing needs know about the name
11081 if (type
!= error_mark_node
11083 && TYPE_NAME (type
)
11084 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11085 && TYPE_ANONYMOUS_P (type
)
11086 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11088 tree oldname
= TYPE_NAME (type
);
11091 /* Replace the anonymous name with the real name everywhere. */
11092 lookup_tag_reverse (type
, declarator
);
11093 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11094 if (TYPE_NAME (t
) == oldname
)
11095 TYPE_NAME (t
) = decl
;
11097 if (TYPE_LANG_SPECIFIC (type
))
11098 TYPE_WAS_ANONYMOUS (type
) = 1;
11100 /* If this is a typedef within a template class, the nested
11101 type is a (non-primary) template. The name for the
11102 template needs updating as well. */
11103 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11104 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11105 = TYPE_IDENTIFIER (type
);
11107 /* FIXME remangle member functions; member functions of a
11108 type with external linkage have external linkage. */
11111 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11113 cp_error_at ("typedef name may not be class-qualified", decl
);
11118 if (ctype
== NULL_TREE
)
11120 if (TREE_CODE (type
) != METHOD_TYPE
)
11121 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11123 ctype
= TYPE_METHOD_BASETYPE (type
);
11125 if (ctype
!= NULL_TREE
)
11126 grok_method_quals (ctype
, decl
, quals
);
11129 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11130 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11131 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11133 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11134 inlinep
, friendp
, raises
!= NULL_TREE
);
11137 error ("typedef declaration includes an initializer");
11142 /* Detect the case of an array type of unspecified size
11143 which came, as such, direct from a typedef name.
11144 We must copy the type, so that each identifier gets
11145 a distinct type, so that each identifier's size can be
11146 controlled separately by its own initializer. */
11148 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11149 && TYPE_DOMAIN (type
) == NULL_TREE
)
11151 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11154 /* If this is a type name (such as, in a cast or sizeof),
11155 compute the type and return it now. */
11157 if (decl_context
== TYPENAME
)
11159 /* Note that the grammar rejects storage classes
11160 in typenames, fields or parameters. */
11161 if (type_quals
!= TYPE_UNQUALIFIED
)
11162 type_quals
= TYPE_UNQUALIFIED
;
11164 /* Special case: "friend class foo" looks like a TYPENAME context. */
11167 if (type_quals
!= TYPE_UNQUALIFIED
)
11169 cp_error ("type qualifiers specified for friend class declaration");
11170 type_quals
= TYPE_UNQUALIFIED
;
11174 cp_error ("`inline' specified for friend class declaration");
11178 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11179 But don't allow implicit typenames except with a class-key. */
11180 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11181 || IMPLICIT_TYPENAME_P (type
)))
11183 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11184 cp_pedwarn ("template parameters cannot be friends");
11185 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11187 friend declaration requires class-key, i.e. `friend class %T::%T'",
11188 constructor_name (current_class_type
),
11189 TYPE_IDENTIFIER (type
));
11192 friend declaration requires class-key, i.e. `friend %#T'",
11196 /* Only try to do this stuff if we didn't already give up. */
11197 if (type
!= integer_type_node
)
11199 /* DR 209. The friendly class does not need to be accessible
11200 in the scope of the class granting friendship. */
11201 skip_type_access_control ();
11203 /* A friendly class? */
11204 if (current_class_type
)
11205 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11207 cp_error ("trying to make class `%T' a friend of global scope",
11210 type
= void_type_node
;
11215 if (ctype
== NULL_TREE
)
11217 if (TREE_CODE (type
) != METHOD_TYPE
)
11218 cp_error ("invalid qualifiers on non-member function type");
11220 ctype
= TYPE_METHOD_BASETYPE (type
);
11224 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11225 grok_method_quals (ctype
, dummy
, quals
);
11226 type
= TREE_TYPE (dummy
);
11232 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11233 && decl_context
!= CATCHPARM
11234 && TREE_CODE (type
) != UNION_TYPE
11237 cp_error ("abstract declarator `%T' used as declaration", type
);
11238 declarator
= make_anon_name ();
11241 /* `void' at top level (not within pointer)
11242 is allowed only in typedefs or type names.
11243 We don't complain about parms either, but that is because
11244 a better error message can be made later. */
11246 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11249 error ("unnamed variable or field declared void");
11250 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11252 if (IDENTIFIER_OPNAME_P (declarator
))
11253 my_friendly_abort (356);
11255 error ("variable or field `%s' declared void", name
);
11258 error ("variable or field declared void");
11259 type
= integer_type_node
;
11262 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11263 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11265 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11267 if (ctype
|| in_namespace
)
11268 error ("cannot use `::' in parameter declaration");
11270 /* A parameter declared as an array of T is really a pointer to T.
11271 One declared as a function is really a pointer to a function.
11272 One declared as a member is really a pointer to member. */
11274 if (TREE_CODE (type
) == ARRAY_TYPE
)
11276 /* Transfer const-ness of array into that of type pointed to. */
11277 type
= build_pointer_type (TREE_TYPE (type
));
11278 type_quals
= TYPE_UNQUALIFIED
;
11280 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11281 type
= build_pointer_type (type
);
11282 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11283 type
= build_pointer_type (type
);
11287 register tree decl
;
11289 if (decl_context
== PARM
)
11291 decl
= build_decl (PARM_DECL
, declarator
, type
);
11293 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11294 inlinep
, friendp
, raises
!= NULL_TREE
);
11296 /* Compute the type actually passed in the parmlist,
11297 for the case where there is no prototype.
11298 (For example, shorts and chars are passed as ints.)
11299 When there is a prototype, this is overridden later. */
11301 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11303 else if (decl_context
== FIELD
)
11305 if (type
== error_mark_node
)
11307 /* Happens when declaring arrays of sizes which
11308 are error_mark_node, for example. */
11311 else if (in_namespace
&& !friendp
)
11313 /* Something like struct S { int N::j; }; */
11314 cp_error ("invalid use of `::'");
11317 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11320 tree function_context
;
11322 /* We catch the others as conflicts with the builtin
11324 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11326 cp_error ("function `%D' cannot be declared friend",
11333 if (ctype
== NULL_TREE
)
11334 ctype
= current_class_type
;
11336 if (ctype
== NULL_TREE
)
11338 cp_error ("can't make `%D' into a method -- not in a class",
11340 return void_type_node
;
11343 /* ``A union may [ ... ] not [ have ] virtual functions.''
11345 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11347 cp_error ("function `%D' declared virtual inside a union",
11349 return void_type_node
;
11352 if (declarator
== ansi_opname (NEW_EXPR
)
11353 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11354 || declarator
== ansi_opname (DELETE_EXPR
)
11355 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11359 cp_error ("`%D' cannot be declared virtual, since it is always static",
11364 else if (staticp
< 2)
11365 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11366 TYPE_ARG_TYPES (type
));
11369 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11370 function_context
= (ctype
!= NULL_TREE
) ?
11371 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11372 publicp
= (! friendp
|| ! staticp
)
11373 && function_context
== NULL_TREE
;
11374 decl
= grokfndecl (ctype
, type
,
11375 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11376 ? declarator
: dname
,
11378 virtualp
, flags
, quals
, raises
,
11379 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11380 funcdef_flag
, template_count
, in_namespace
);
11381 if (decl
== NULL_TREE
)
11384 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11385 /* The decl and setting of decl_machine_attr is also turned off. */
11386 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11389 /* [class.conv.ctor]
11391 A constructor declared without the function-specifier
11392 explicit that can be called with a single parameter
11393 specifies a conversion from the type of its first
11394 parameter to the type of its class. Such a constructor
11395 is called a converting constructor. */
11396 if (explicitp
== 2)
11397 DECL_NONCONVERTING_P (decl
) = 1;
11398 else if (DECL_CONSTRUCTOR_P (decl
))
11400 /* The constructor can be called with exactly one
11401 parameter if there is at least one parameter, and
11402 any subsequent parameters have default arguments.
11403 Ignore any compiler-added parms. */
11404 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11406 if (arg_types
== void_list_node
11408 && TREE_CHAIN (arg_types
)
11409 && TREE_CHAIN (arg_types
) != void_list_node
11410 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11411 DECL_NONCONVERTING_P (decl
) = 1;
11414 else if (TREE_CODE (type
) == METHOD_TYPE
)
11416 /* We only get here for friend declarations of
11417 members of other classes. */
11418 /* All method decls are public, so tell grokfndecl to set
11419 TREE_PUBLIC, also. */
11420 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11421 virtualp
, flags
, quals
, raises
,
11422 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11423 template_count
, in_namespace
);
11424 if (decl
== NULL_TREE
)
11427 else if (!staticp
&& ! processing_template_decl
11428 && !COMPLETE_TYPE_P (complete_type (type
))
11429 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11432 cp_error ("field `%D' has incomplete type", declarator
);
11434 cp_error ("name `%T' has incomplete type", type
);
11436 /* If we're instantiating a template, tell them which
11437 instantiation made the field's type be incomplete. */
11438 if (current_class_type
11439 && TYPE_NAME (current_class_type
)
11440 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11441 && declspecs
&& TREE_VALUE (declspecs
)
11442 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11443 cp_error (" in instantiation of template `%T'",
11444 current_class_type
);
11446 type
= error_mark_node
;
11453 error ("`%s' is neither function nor member function; cannot be declared friend",
11454 IDENTIFIER_POINTER (declarator
));
11462 /* Friends are treated specially. */
11463 tree t
= NULL_TREE
;
11465 /* DR 209. The friend does not need to be accessible at this
11467 skip_type_access_control ();
11469 if (ctype
== current_class_type
)
11470 warning ("member functions are implicitly friends of their class");
11472 if (decl
&& DECL_NAME (decl
))
11474 if (template_class_depth (current_class_type
) == 0)
11476 decl
= check_explicit_specialization
11478 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11479 if (decl
== error_mark_node
)
11480 return error_mark_node
;
11483 t
= do_friend (ctype
, declarator
, decl
,
11484 last_function_parms
, attrlist
, flags
, quals
,
11487 if (t
&& funcdef_flag
)
11489 return void_type_node
;
11492 /* Structure field. It may not be a function, except for C++ */
11494 if (decl
== NULL_TREE
)
11500 /* An attempt is being made to initialize a non-static
11501 member. But, from [class.mem]:
11503 4 A member-declarator can contain a
11504 constant-initializer only if it declares a static
11505 member (_class.static_) of integral or enumeration
11506 type, see _class.static.data_.
11508 This used to be relatively common practice, but
11509 the rest of the compiler does not correctly
11510 handle the initialization unless the member is
11511 static so we make it static below. */
11512 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11514 cp_pedwarn ("making `%D' static", declarator
);
11518 if (uses_template_parms (type
))
11519 /* We'll check at instantiation time. */
11521 else if (check_static_variable_definition (declarator
,
11523 /* If we just return the declaration, crashes
11524 will sometimes occur. We therefore return
11525 void_type_node, as if this was a friend
11526 declaration, to cause callers to completely
11527 ignore this declaration. */
11528 return void_type_node
;
11531 /* 9.2p13 [class.mem] */
11532 if (declarator
== constructor_name (current_class_type
)
11533 /* The standard does not allow non-static data members
11534 here either, but we agreed at the 10/99 meeting
11535 to change that in TC 1 so that they are allowed in
11536 classes with no user-defined constructors. */
11538 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11543 /* C++ allows static class members. All other work
11544 for this is done by grokfield. */
11545 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11546 TREE_STATIC (decl
) = 1;
11547 /* In class context, 'static' means public access. */
11548 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11552 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11553 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11554 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11556 DECL_MUTABLE_P (decl
) = 1;
11557 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11561 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11562 inlinep
, friendp
, raises
!= NULL_TREE
);
11565 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11567 tree original_name
;
11573 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11574 original_name
= dname
;
11576 original_name
= declarator
;
11578 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11579 error ("storage class `auto' invalid for function `%s'", name
);
11580 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11581 error ("storage class `register' invalid for function `%s'", name
);
11583 /* Function declaration not at top level.
11584 Storage classes other than `extern' are not allowed
11585 and `extern' makes no difference. */
11586 if (! toplevel_bindings_p ()
11587 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11588 || RIDBIT_SETP (RID_INLINE
, specbits
))
11591 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11592 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11594 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11597 if (ctype
== NULL_TREE
)
11601 error ("virtual non-class function `%s'", name
);
11605 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11606 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11607 TYPE_ARG_TYPES (type
));
11609 /* Record presence of `static'. */
11610 publicp
= (ctype
!= NULL_TREE
11611 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11612 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11614 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11615 virtualp
, flags
, quals
, raises
,
11617 publicp
, inlinep
, funcdef_flag
,
11618 template_count
, in_namespace
);
11619 if (decl
== NULL_TREE
)
11624 int illegal_static
= 0;
11626 /* Don't allow a static member function in a class, and forbid
11627 declaring main to be static. */
11628 if (TREE_CODE (type
) == METHOD_TYPE
)
11630 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11631 illegal_static
= 1;
11633 else if (current_function_decl
)
11635 /* FIXME need arm citation */
11636 error ("cannot declare static function inside another function");
11637 illegal_static
= 1;
11640 if (illegal_static
)
11643 RIDBIT_RESET (RID_STATIC
, specbits
);
11649 /* It's a variable. */
11651 /* An uninitialized decl with `extern' is a reference. */
11652 decl
= grokvardecl (type
, declarator
, &specbits
,
11654 (type_quals
& TYPE_QUAL_CONST
) != 0,
11656 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11657 inlinep
, friendp
, raises
!= NULL_TREE
);
11661 DECL_CONTEXT (decl
) = ctype
;
11664 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11666 RIDBIT_RESET (RID_STATIC
, specbits
);
11668 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11670 cp_error ("static member `%D' declared `register'", decl
);
11671 RIDBIT_RESET (RID_REGISTER
, specbits
);
11673 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11675 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11677 RIDBIT_RESET (RID_EXTERN
, specbits
);
11682 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11684 /* Record `register' declaration for warnings on &
11685 and in case doing stupid register allocation. */
11687 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11688 DECL_REGISTER (decl
) = 1;
11690 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11691 DECL_THIS_EXTERN (decl
) = 1;
11693 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11694 DECL_THIS_STATIC (decl
) = 1;
11696 /* Record constancy and volatility. There's no need to do this
11697 when processing a template; we'll do this for the instantiated
11698 declaration based on the type of DECL. */
11699 if (!processing_template_decl
)
11700 c_apply_type_quals_to_decl (type_quals
, decl
);
11706 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11707 An empty exprlist is a parmlist. An exprlist which
11708 contains only identifiers at the global level
11709 is a parmlist. Otherwise, it is an exprlist. */
11712 parmlist_is_exprlist (exprs
)
11715 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11718 if (toplevel_bindings_p ())
11720 /* At the global level, if these are all identifiers,
11721 then it is a parmlist. */
11724 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11726 exprs
= TREE_CHAIN (exprs
);
11733 /* Subroutine of start_function. Ensure that each of the parameter
11734 types (as listed in PARMS) is complete, as is required for a
11735 function definition. */
11738 require_complete_types_for_parms (parms
)
11741 for (; parms
; parms
= TREE_CHAIN (parms
))
11743 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11744 /* grokparms will have already issued an error */
11745 TREE_TYPE (parms
) = error_mark_node
;
11746 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11747 layout_decl (parms
, 0);
11749 TREE_TYPE (parms
) = error_mark_node
;
11753 /* Returns non-zero if T is a local variable. */
11756 local_variable_p (t
)
11759 if ((TREE_CODE (t
) == VAR_DECL
11760 /* A VAR_DECL with a context that is a _TYPE is a static data
11762 && !TYPE_P (CP_DECL_CONTEXT (t
))
11763 /* Any other non-local variable must be at namespace scope. */
11764 && !DECL_NAMESPACE_SCOPE_P (t
))
11765 || (TREE_CODE (t
) == PARM_DECL
))
11771 /* Returns non-zero if T is an automatic local variable or a label.
11772 (These are the declarations that need to be remapped when the code
11773 containing them is duplicated.) */
11776 nonstatic_local_decl_p (t
)
11779 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11780 || TREE_CODE (t
) == LABEL_DECL
11781 || TREE_CODE (t
) == RESULT_DECL
);
11784 /* Like local_variable_p, but suitable for use as a tree-walking
11788 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11790 int *walk_subtrees ATTRIBUTE_UNUSED
;
11791 void *data ATTRIBUTE_UNUSED
;
11793 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11794 ? *tp
: NULL_TREE
);
11797 /* Check that ARG, which is a default-argument expression for a
11798 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11799 something goes wrong. DECL may also be a _TYPE node, rather than a
11800 DECL, if there is no DECL available. */
11803 check_default_argument (decl
, arg
)
11810 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11811 /* We get a DEFAULT_ARG when looking at an in-class declaration
11812 with a default argument. Ignore the argument for now; we'll
11813 deal with it after the class is complete. */
11816 if (processing_template_decl
|| uses_template_parms (arg
))
11817 /* We don't do anything checking until instantiation-time. Note
11818 that there may be uninstantiated arguments even for an
11819 instantiated function, since default arguments are not
11820 instantiated until they are needed. */
11829 decl_type
= TREE_TYPE (decl
);
11831 if (arg
== error_mark_node
11832 || decl
== error_mark_node
11833 || TREE_TYPE (arg
) == error_mark_node
11834 || decl_type
== error_mark_node
)
11835 /* Something already went wrong. There's no need to check
11837 return error_mark_node
;
11839 /* [dcl.fct.default]
11841 A default argument expression is implicitly converted to the
11843 if (!TREE_TYPE (arg
)
11844 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11847 cp_error ("default argument for `%#D' has type `%T'",
11848 decl
, TREE_TYPE (arg
));
11850 cp_error ("default argument for parameter of type `%T' has type `%T'",
11851 decl_type
, TREE_TYPE (arg
));
11853 return error_mark_node
;
11856 /* [dcl.fct.default]
11858 Local variables shall not be used in default argument
11861 The keyword `this' shall not be used in a default argument of a
11862 member function. */
11863 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11867 cp_error ("default argument `%E' uses local variable `%D'",
11869 return error_mark_node
;
11876 /* Decode the list of parameter types for a function type.
11877 Given the list of things declared inside the parens,
11878 return a list of types.
11880 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11881 flag. If unset, we append void_list_node. A parmlist declared
11882 as `(void)' is accepted as the empty parmlist.
11884 Also set last_function_parms to the chain of PARM_DECLs. */
11887 grokparms (first_parm
)
11890 tree result
= NULL_TREE
;
11891 tree decls
= NULL_TREE
;
11892 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
11896 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
11898 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11900 tree type
= NULL_TREE
;
11901 register tree decl
= TREE_VALUE (parm
);
11902 tree init
= TREE_PURPOSE (parm
);
11904 chain
= TREE_CHAIN (parm
);
11905 /* @@ weak defense against parse errors. */
11906 if (TREE_CODE (decl
) != VOID_TYPE
11907 && TREE_CODE (decl
) != TREE_LIST
)
11909 /* Give various messages as the need arises. */
11910 if (TREE_CODE (decl
) == STRING_CST
)
11911 cp_error ("invalid string constant `%E'", decl
);
11912 else if (TREE_CODE (decl
) == INTEGER_CST
)
11913 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11917 if (parm
== void_list_node
)
11920 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
11921 PARM
, init
!= NULL_TREE
, NULL_TREE
);
11922 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11925 type
= TREE_TYPE (decl
);
11926 if (VOID_TYPE_P (type
))
11928 if (same_type_p (type
, void_type_node
)
11929 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
11930 /* this is a parmlist of `(void)', which is ok. */
11932 incomplete_type_error (decl
, type
);
11933 /* It's not a good idea to actually create parameters of
11934 type `void'; other parts of the compiler assume that a
11935 void type terminates the parameter list. */
11936 type
= error_mark_node
;
11937 TREE_TYPE (decl
) = error_mark_node
;
11940 if (type
!= error_mark_node
)
11942 /* Top-level qualifiers on the parameters are
11943 ignored for function types. */
11944 type
= TYPE_MAIN_VARIANT (type
);
11945 if (TREE_CODE (type
) == METHOD_TYPE
)
11947 cp_error ("parameter `%D' invalidly declared method type", decl
);
11948 type
= build_pointer_type (type
);
11949 TREE_TYPE (decl
) = type
;
11951 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11953 cp_error ("parameter `%D' invalidly declared offset type", decl
);
11954 type
= build_pointer_type (type
);
11955 TREE_TYPE (decl
) = type
;
11957 else if (abstract_virtuals_error (decl
, type
))
11958 any_error
= 1; /* Seems like a good idea. */
11959 else if (POINTER_TYPE_P (type
))
11961 /* [dcl.fct]/6, parameter types cannot contain pointers
11962 (references) to arrays of unknown bound. */
11963 tree t
= TREE_TYPE (type
);
11964 int ptr
= TYPE_PTR_P (type
);
11968 if (TYPE_PTR_P (t
))
11970 else if (TREE_CODE (t
) != ARRAY_TYPE
)
11972 else if (!TYPE_DOMAIN (t
))
11976 if (TREE_CODE (t
) == ARRAY_TYPE
)
11977 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
11978 decl
, ptr
? "pointer" : "reference", t
);
11981 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11982 if (PROMOTE_PROTOTYPES
11983 && INTEGRAL_TYPE_P (type
)
11984 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11985 DECL_ARG_TYPE (decl
) = integer_type_node
;
11986 if (!any_error
&& init
)
11987 init
= check_default_argument (decl
, init
);
11992 TREE_CHAIN (decl
) = decls
;
11994 result
= tree_cons (init
, type
, result
);
11996 decls
= nreverse (decls
);
11997 result
= nreverse (result
);
11999 result
= chainon (result
, void_list_node
);
12000 last_function_parms
= decls
;
12006 /* D is a constructor or overloaded `operator='. Returns non-zero if
12007 D's arguments allow it to be a copy constructor, or copy assignment
12016 if (!DECL_FUNCTION_MEMBER_P (d
))
12019 t
= FUNCTION_FIRST_USER_PARMTYPE (d
);
12020 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12021 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12022 == DECL_CONTEXT (d
))
12023 && (TREE_CHAIN (t
) == NULL_TREE
12024 || TREE_CHAIN (t
) == void_list_node
12025 || TREE_PURPOSE (TREE_CHAIN (t
))))
12030 /* These memoizing functions keep track of special properties which
12031 a class may have. `grok_ctor_properties' notices whether a class
12032 has a constructor of the form X(X&), and also complains
12033 if the class has a constructor of the form X(X).
12034 `grok_op_properties' takes notice of the various forms of
12035 operator= which are defined, as well as what sorts of type conversion
12036 may apply. Both functions take a FUNCTION_DECL as an argument. */
12039 grok_ctor_properties (ctype
, decl
)
12042 tree parmtypes
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
12043 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12047 A non-template constructor for class X is a copy constructor if
12048 its first parameter is of type X&, const X&, volatile X& or const
12049 volatile X&, and either there are no other parameters or else all
12050 other parameters have default arguments. */
12051 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12052 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12053 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12054 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12055 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12057 TYPE_HAS_INIT_REF (ctype
) = 1;
12058 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12059 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12063 A declaration of a constructor for a class X is ill-formed if its
12064 first parameter is of type (optionally cv-qualified) X and either
12065 there are no other parameters or else all other parameters have
12068 We *don't* complain about member template instantiations that
12069 have this form, though; they can occur as we try to decide what
12070 constructor to use during overload resolution. Since overload
12071 resolution will never prefer such a constructor to the
12072 non-template copy constructor (which is either explicitly or
12073 implicitly defined), there's no need to worry about their
12074 existence. Theoretically, they should never even be
12075 instantiated, but that's hard to forestall. */
12076 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12077 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12078 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12079 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12081 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12083 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12086 else if (TREE_CODE (parmtype
) == VOID_TYPE
12087 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12088 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12093 /* An operator with this code is unary, but can also be binary. */
12097 enum tree_code code
;
12099 return (code
== INDIRECT_REF
12100 || code
== ADDR_EXPR
12101 || code
== CONVERT_EXPR
12102 || code
== NEGATE_EXPR
12103 || code
== PREINCREMENT_EXPR
12104 || code
== PREDECREMENT_EXPR
);
12107 /* An operator with this name can only be unary. */
12111 enum tree_code code
;
12113 return (code
== TRUTH_NOT_EXPR
12114 || code
== BIT_NOT_EXPR
12115 || code
== COMPONENT_REF
12116 || code
== TYPE_EXPR
);
12119 /* Do a little sanity-checking on how they declared their operator. */
12122 grok_op_properties (decl
, virtualp
, friendp
)
12124 int virtualp
, friendp
;
12126 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12128 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12129 tree name
= DECL_NAME (decl
);
12130 enum tree_code operator_code
;
12133 /* Count the number of arguments. */
12134 for (argtype
= argtypes
, arity
= 0;
12135 argtype
&& argtype
!= void_list_node
;
12136 argtype
= TREE_CHAIN (argtype
))
12139 if (current_class_type
== NULL_TREE
)
12142 if (DECL_CONV_FN_P (decl
))
12143 operator_code
= TYPE_EXPR
;
12147 #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \
12148 if (ansi_opname (CODE) == name) \
12150 operator_code = CODE; \
12153 else if (ansi_assopname (CODE) == name) \
12155 operator_code = CODE; \
12156 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12160 #include "operators.def"
12161 #undef DEF_OPERATOR
12163 my_friendly_abort (20000527);
12166 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12167 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12171 switch (operator_code
)
12174 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12178 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12181 case COMPONENT_REF
:
12183 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12187 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12191 TYPE_GETS_DELETE (current_class_type
) |= 1;
12195 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12198 case VEC_DELETE_EXPR
:
12199 TYPE_GETS_DELETE (current_class_type
) |= 2;
12207 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12209 /* When the compiler encounters the definition of A::operator new, it
12210 doesn't look at the class declaration to find out if it's static. */
12212 revert_static_member_fn (decl
);
12214 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12216 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12219 revert_static_member_fn (decl
);
12221 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12225 /* An operator function must either be a non-static member function
12226 or have at least one parameter of a class, a reference to a class,
12227 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12228 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12230 if (operator_code
== TYPE_EXPR
12231 || operator_code
== CALL_EXPR
12232 || operator_code
== COMPONENT_REF
12233 || operator_code
== ARRAY_REF
12234 || operator_code
== NOP_EXPR
)
12235 cp_error ("`%D' must be a nonstatic member function", decl
);
12240 if (DECL_STATIC_FUNCTION_P (decl
))
12241 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12244 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12246 tree arg
= TREE_VALUE (p
);
12247 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12248 arg
= TREE_TYPE (arg
);
12250 /* This lets bad template code slip through. */
12251 if (IS_AGGR_TYPE (arg
)
12252 || TREE_CODE (arg
) == ENUMERAL_TYPE
12253 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12254 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12258 ("`%D' must have an argument of class or enumerated type",
12265 if (operator_code
== CALL_EXPR
)
12266 return; /* No restrictions on args. */
12268 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12270 tree t
= TREE_TYPE (name
);
12273 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12274 const char *what
= 0;
12277 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12279 if (TREE_CODE (t
) == VOID_TYPE
)
12281 else if (t
== current_class_type
)
12282 what
= "the same type";
12283 /* Don't force t to be complete here. */
12284 else if (IS_AGGR_TYPE (t
)
12285 && COMPLETE_TYPE_P (t
)
12286 && DERIVED_FROM_P (t
, current_class_type
))
12287 what
= "a base class";
12290 warning ("conversion to %s%s will never use a type conversion operator",
12291 ref
? "a reference to " : "", what
);
12295 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12296 && operator_code
== NOP_EXPR
)
12300 if (arity
!= 2 && methodp
)
12302 cp_error ("`%D' must take exactly one argument", decl
);
12305 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12309 A user-declared copy assignment operator X::operator= is
12310 a non-static non-template member function of class X with
12311 exactly one parameter of type X, X&, const X&, volatile
12312 X& or const volatile X&. */
12313 if (copy_assignment_arg_p (parmtype
, virtualp
)
12314 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12315 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12318 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12319 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12320 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12321 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12324 else if (operator_code
== COND_EXPR
)
12327 cp_error ("ISO C++ prohibits overloading operator ?:");
12329 else if (ambi_op_p (operator_code
))
12332 /* We pick the one-argument operator codes by default, so
12333 we don't have to change anything. */
12335 else if (arity
== 2)
12337 /* If we thought this was a unary operator, we now know
12338 it to be a binary operator. */
12339 switch (operator_code
)
12342 operator_code
= MULT_EXPR
;
12346 operator_code
= BIT_AND_EXPR
;
12350 operator_code
= PLUS_EXPR
;
12354 operator_code
= MINUS_EXPR
;
12357 case PREINCREMENT_EXPR
:
12358 operator_code
= POSTINCREMENT_EXPR
;
12361 case PREDECREMENT_EXPR
:
12362 operator_code
= POSTDECREMENT_EXPR
;
12366 my_friendly_abort (20000527);
12369 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12371 if ((operator_code
== POSTINCREMENT_EXPR
12372 || operator_code
== POSTDECREMENT_EXPR
)
12373 && ! processing_template_decl
12374 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12377 cp_error ("postfix `%D' must take `int' as its argument",
12381 ("postfix `%D' must take `int' as its second argument",
12388 cp_error ("`%D' must take either zero or one argument", decl
);
12390 cp_error ("`%D' must take either one or two arguments", decl
);
12393 /* More Effective C++ rule 6. */
12395 && (operator_code
== POSTINCREMENT_EXPR
12396 || operator_code
== POSTDECREMENT_EXPR
12397 || operator_code
== PREINCREMENT_EXPR
12398 || operator_code
== PREDECREMENT_EXPR
))
12400 tree arg
= TREE_VALUE (argtypes
);
12401 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12402 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12403 arg
= TREE_TYPE (arg
);
12404 arg
= TYPE_MAIN_VARIANT (arg
);
12405 if (operator_code
== PREINCREMENT_EXPR
12406 || operator_code
== PREDECREMENT_EXPR
)
12408 if (TREE_CODE (ret
) != REFERENCE_TYPE
12409 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12411 cp_warning ("prefix `%D' should return `%T'", decl
,
12412 build_reference_type (arg
));
12416 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12417 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12421 else if (unary_op_p (operator_code
))
12426 cp_error ("`%D' must take `void'", decl
);
12428 cp_error ("`%D' must take exactly one argument", decl
);
12431 else /* if (binary_op_p (operator_code)) */
12436 cp_error ("`%D' must take exactly one argument", decl
);
12438 cp_error ("`%D' must take exactly two arguments", decl
);
12441 /* More Effective C++ rule 7. */
12443 && (operator_code
== TRUTH_ANDIF_EXPR
12444 || operator_code
== TRUTH_ORIF_EXPR
12445 || operator_code
== COMPOUND_EXPR
))
12446 cp_warning ("user-defined `%D' always evaluates both arguments",
12450 /* Effective C++ rule 23. */
12453 && (operator_code
== PLUS_EXPR
12454 || operator_code
== MINUS_EXPR
12455 || operator_code
== TRUNC_DIV_EXPR
12456 || operator_code
== MULT_EXPR
)
12457 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12458 cp_warning ("`%D' should return by value", decl
);
12461 for (; argtypes
&& argtypes
!= void_list_node
;
12462 argtypes
= TREE_CHAIN (argtypes
))
12463 if (TREE_PURPOSE (argtypes
))
12465 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12466 if (operator_code
== POSTINCREMENT_EXPR
12467 || operator_code
== POSTDECREMENT_EXPR
)
12470 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12473 cp_error ("`%D' cannot have default arguments", decl
);
12479 static const char *
12481 enum tag_types code
;
12494 my_friendly_abort (981122);
12498 /* Get the struct, enum or union (CODE says which) with tag NAME.
12499 Define the tag as a forward-reference if it is not defined.
12501 C++: If a class derivation is given, process it here, and report
12502 an error if multiple derivation declarations are not identical.
12504 If this is a definition, come in through xref_tag and only look in
12505 the current frame for the name (since C++ allows new names in any
12509 xref_tag (code_type_node
, name
, globalize
)
12510 tree code_type_node
;
12514 enum tag_types tag_code
;
12515 enum tree_code code
;
12516 register tree ref
, t
;
12517 struct binding_level
*b
= current_binding_level
;
12519 tree attributes
= NULL_TREE
;
12520 tree context
= NULL_TREE
;
12522 /* If we are called from the parser, code_type_node will sometimes be a
12523 TREE_LIST. This indicates that the user wrote
12524 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12526 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12528 attributes
= TREE_PURPOSE (code_type_node
);
12529 code_type_node
= TREE_VALUE (code_type_node
);
12532 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12537 code
= RECORD_TYPE
;
12543 code
= ENUMERAL_TYPE
;
12546 my_friendly_abort (18);
12549 /* If a cross reference is requested, look up the type
12550 already defined for this tag and return it. */
12554 name
= TYPE_IDENTIFIER (t
);
12558 t
= IDENTIFIER_TYPE_VALUE (name
);
12560 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12561 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12563 static int explained
;
12566 cp_warning ("`%s %T' declares a new type at namespace scope",
12567 tag_name (tag_code
), name
);
12569 cp_warning (" names from dependent base classes are not visible to unqualified name lookup - to refer to the inherited type, say `%s %T::%T'",
12570 tag_name (tag_code
),
12571 constructor_name (current_class_type
),
12572 TYPE_IDENTIFIER (t
));
12574 /* We need to remove the class scope binding for the
12575 TYPENAME_TYPE as otherwise poplevel_class gets confused. */
12576 for (shadowed
= b
->class_shadowed
;
12578 shadowed
= TREE_CHAIN (shadowed
))
12579 if (TREE_TYPE (shadowed
) == TYPE_NAME (t
))
12581 TREE_PURPOSE (shadowed
) = NULL_TREE
;
12586 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12587 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12592 /* If we know we are defining this tag, only look it up in
12593 this scope and don't try to find it as a type. */
12594 ref
= lookup_tag (code
, name
, b
, 1);
12600 /* [dcl.type.elab] If the identifier resolves to a
12601 typedef-name or a template type-parameter, the
12602 elaborated-type-specifier is ill-formed. */
12603 if (t
!= TYPE_MAIN_VARIANT (t
)
12604 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12605 cp_pedwarn ("using typedef-name `%D' after `%s'",
12606 TYPE_NAME (t
), tag_name (tag_code
));
12607 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12608 cp_error ("using template type parameter `%T' after `%s'",
12609 t
, tag_name (tag_code
));
12614 ref
= lookup_tag (code
, name
, b
, 0);
12618 /* Try finding it as a type declaration. If that wins,
12620 ref
= lookup_name (name
, 1);
12622 if (ref
!= NULL_TREE
12623 && processing_template_decl
12624 && DECL_CLASS_TEMPLATE_P (ref
)
12625 && template_class_depth (current_class_type
) == 0)
12626 /* Since GLOBALIZE is true, we're declaring a global
12627 template, so we want this type. */
12628 ref
= DECL_TEMPLATE_RESULT (ref
);
12630 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12631 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12632 ref
= TREE_TYPE (ref
);
12637 if (ref
&& current_class_type
12638 && template_class_depth (current_class_type
)
12639 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12641 /* Since GLOBALIZE is non-zero, we are not looking at a
12642 definition of this tag. Since, in addition, we are currently
12643 processing a (member) template declaration of a template
12644 class, we must be very careful; consider:
12651 { template <class V>
12652 friend struct S1; };
12654 Here, the S2::S1 declaration should not be confused with the
12655 outer declaration. In particular, the inner version should
12656 have a template parameter of level 2, not level 1. This
12657 would be particularly important if the member declaration
12660 template <class V = U> friend struct S1;
12662 say, when we should tsubst into `U' when instantiating
12663 S2. On the other hand, when presented with:
12673 we must find the inner binding eventually. We
12674 accomplish this by making sure that the new type we
12675 create to represent this declaration has the right
12677 context
= TYPE_CONTEXT (ref
);
12684 /* If no such tag is yet defined, create a forward-reference node
12685 and record it as the "definition".
12686 When a real declaration of this type is found,
12687 the forward-reference will be altered into a real type. */
12688 if (code
== ENUMERAL_TYPE
)
12690 cp_error ("use of enum `%#D' without previous declaration", name
);
12692 ref
= make_node (ENUMERAL_TYPE
);
12694 /* Give the type a default layout like unsigned int
12695 to avoid crashing if it does not get defined. */
12696 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12697 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12698 TYPE_USER_ALIGN (ref
) = 0;
12699 TREE_UNSIGNED (ref
) = 1;
12700 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12701 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12702 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12704 /* Enable us to recognize when a type is created in class context.
12705 To do nested classes correctly, this should probably be cleared
12706 out when we leave this classes scope. Currently this in only
12707 done in `start_enum'. */
12709 pushtag (name
, ref
, globalize
);
12713 struct binding_level
*old_b
= class_binding_level
;
12715 ref
= make_aggr_type (code
);
12716 TYPE_CONTEXT (ref
) = context
;
12718 #ifdef NONNESTED_CLASSES
12719 /* Class types don't nest the way enums do. */
12720 class_binding_level
= (struct binding_level
*)0;
12722 pushtag (name
, ref
, globalize
);
12723 class_binding_level
= old_b
;
12728 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12729 redeclare_class_template (ref
, current_template_parms
);
12732 /* Until the type is defined, tentatively accept whatever
12733 structure tag the user hands us. */
12734 if (!COMPLETE_TYPE_P (ref
)
12735 && ref
!= current_class_type
12736 /* Have to check this, in case we have contradictory tag info. */
12737 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12739 if (tag_code
== class_type
)
12740 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12741 else if (tag_code
== record_type
)
12742 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12745 TREE_TYPE (ref
) = attributes
;
12751 xref_tag_from_type (old
, id
, globalize
)
12755 tree code_type_node
;
12757 if (TREE_CODE (old
) == RECORD_TYPE
)
12758 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12759 ? class_type_node
: record_type_node
);
12761 code_type_node
= union_type_node
;
12763 if (id
== NULL_TREE
)
12764 id
= TYPE_IDENTIFIER (old
);
12766 return xref_tag (code_type_node
, id
, globalize
);
12769 /* REF is a type (named NAME), for which we have just seen some
12770 baseclasses. BINFO is a list of those baseclasses; the
12771 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12772 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12773 struct, or union. */
12776 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12777 tree code_type_node
;
12781 /* In the declaration `A : X, Y, ... Z' we mark all the types
12782 (A, X, Y, ..., Z) so we can check for duplicates. */
12787 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12789 if (tag_code
== union_type
)
12791 cp_error ("derived union `%T' invalid", ref
);
12795 len
= list_length (binfo
);
12797 /* First, make sure that any templates in base-classes are
12798 instantiated. This ensures that if we call ourselves recursively
12799 we do not get confused about which classes are marked and which
12801 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12802 complete_type (TREE_VALUE (base
));
12804 SET_CLASSTYPE_MARKED (ref
);
12805 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12807 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12809 /* The base of a derived struct is public by default. */
12811 = (TREE_PURPOSE (binfo
) == access_public_node
12812 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12813 || (tag_code
!= class_type
12814 && (TREE_PURPOSE (binfo
) == access_default_node
12815 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12817 = (TREE_PURPOSE (binfo
) == access_protected_node
12818 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12820 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12821 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12822 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12823 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12824 tree basetype
= TREE_VALUE (binfo
);
12827 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12828 basetype
= TREE_TYPE (basetype
);
12830 || (TREE_CODE (basetype
) != RECORD_TYPE
12831 && TREE_CODE (basetype
) != TYPENAME_TYPE
12832 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12833 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12835 cp_error ("base type `%T' fails to be a struct or class type",
12836 TREE_VALUE (binfo
));
12840 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12842 /* This code replaces similar code in layout_basetypes.
12843 We put the complete_type first for implicit `typename'. */
12844 if (!COMPLETE_TYPE_P (basetype
)
12845 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12847 cp_error ("base class `%T' has incomplete type", basetype
);
12852 if (CLASSTYPE_MARKED (basetype
))
12854 if (basetype
== ref
)
12855 cp_error ("recursive type `%T' undefined", basetype
);
12857 cp_error ("duplicate base type `%T' invalid", basetype
);
12861 if (TYPE_FOR_JAVA (basetype
)
12862 && (current_lang_depth () == 0))
12863 TYPE_FOR_JAVA (ref
) = 1;
12865 /* Note that the BINFO records which describe individual
12866 inheritances are *not* shared in the lattice! They
12867 cannot be shared because a given baseclass may be
12868 inherited with different `accessibility' by different
12869 derived classes. (Each BINFO record describing an
12870 individual inheritance contains flags which say what
12871 the `accessibility' of that particular inheritance is.) */
12874 = make_binfo (size_zero_node
, basetype
,
12875 CLASS_TYPE_P (basetype
)
12876 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12877 CLASS_TYPE_P (basetype
)
12878 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12880 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12881 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12882 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12883 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12884 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12886 /* We need to unshare the binfos now so that lookups during class
12887 definition work. */
12888 unshare_base_binfos (base_binfo
);
12890 SET_CLASSTYPE_MARKED (basetype
);
12892 /* We are free to modify these bits because they are meaningless
12893 at top level, and BASETYPE is a top-level type. */
12894 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12896 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12897 /* Converting to a virtual base class requires looking
12898 up the offset of the virtual base. */
12899 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12902 if (CLASS_TYPE_P (basetype
))
12904 TYPE_HAS_NEW_OPERATOR (ref
)
12905 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12906 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12907 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12908 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12909 /* If the base-class uses multiple inheritance, so do we. */
12910 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12911 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12912 /* Likewise, if converting to a base of the base may require
12913 code, then we may need to generate code to convert to a
12915 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12916 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
12923 TREE_VEC_LENGTH (binfos
) = i
;
12925 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12929 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12930 /* If there is more than one non-empty they cannot be at the same
12932 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12935 /* Unmark all the types. */
12937 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12938 CLEAR_CLASSTYPE_MARKED (ref
);
12940 /* Now that we know all the base-classes, set up the list of virtual
12942 get_vbase_types (ref
);
12946 /* Begin compiling the definition of an enumeration type.
12947 NAME is its name (or null if anonymous).
12948 Returns the type object, as yet incomplete.
12949 Also records info about it so that build_enumerator
12950 may be used to declare the individual values as they are read. */
12956 register tree enumtype
= NULL_TREE
;
12957 struct binding_level
*b
= current_binding_level
;
12959 /* If this is the real definition for a previous forward reference,
12960 fill in the contents in the same object that used to be the
12961 forward reference. */
12963 if (name
!= NULL_TREE
)
12964 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12966 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12968 cp_error ("multiple definition of `%#T'", enumtype
);
12969 cp_error_at ("previous definition here", enumtype
);
12970 /* Clear out TYPE_VALUES, and start again. */
12971 TYPE_VALUES (enumtype
) = NULL_TREE
;
12975 enumtype
= make_node (ENUMERAL_TYPE
);
12976 pushtag (name
, enumtype
, 0);
12979 if (current_class_type
)
12980 TREE_ADDRESSABLE (b
->tags
) = 1;
12982 GNU_xref_decl (current_function_decl
, enumtype
);
12986 /* After processing and defining all the values of an enumeration type,
12987 install their decls in the enumeration type and finish it off.
12988 ENUMTYPE is the type object and VALUES a list of name-value pairs. */
12991 finish_enum (enumtype
)
13003 /* We built up the VALUES in reverse order. */
13004 TYPE_VALUES (enumtype
) = nreverse (TYPE_VALUES (enumtype
));
13008 Following the closing brace of an enum-specifier, each
13009 enumerator has the type of its enumeration. Prior to the
13010 closing brace, the type of each enumerator is the type of
13011 its initializing value. */
13012 for (pair
= TYPE_VALUES (enumtype
); pair
; pair
= TREE_CHAIN (pair
))
13013 TREE_TYPE (TREE_VALUE (pair
)) = enumtype
;
13015 /* For a enum defined in a template, all further processing is
13016 postponed until the template is instantiated. */
13017 if (processing_template_decl
)
13019 tree scope
= current_scope ();
13020 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13021 add_stmt (build_min (TAG_DEFN
, enumtype
));
13027 /* Figure out what the minimum and maximum values of the enumerators
13029 if (TYPE_VALUES (enumtype
))
13031 minnode
= maxnode
= NULL_TREE
;
13033 for (pair
= TYPE_VALUES (enumtype
);
13035 pair
= TREE_CHAIN (pair
))
13039 value
= DECL_INITIAL (TREE_VALUE (pair
));
13042 minnode
= maxnode
= value
;
13043 else if (tree_int_cst_lt (maxnode
, value
))
13045 else if (tree_int_cst_lt (value
, minnode
))
13050 minnode
= maxnode
= integer_zero_node
;
13052 /* Compute the number of bits require to represent all values of the
13053 enumeration. We must do this before the type of MINNODE and
13054 MAXNODE are transformed, since min_precision relies on the
13055 TREE_TYPE of the value it is passed. */
13056 unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13057 lowprec
= min_precision (minnode
, unsignedp
);
13058 highprec
= min_precision (maxnode
, unsignedp
);
13059 precision
= MAX (lowprec
, highprec
);
13061 /* Set the TREE_TYPE for the values as well. That's so that when we
13062 call decl_constant_value we get an entity of the right type (but
13063 with the constant value). In addition, transform the TYPE_VALUES
13064 list to contain the values, rather than the CONST_DECLs for them. */
13065 for (pair
= TYPE_VALUES (enumtype
); pair
; pair
= TREE_CHAIN (pair
))
13067 tree value
= DECL_INITIAL (TREE_VALUE (pair
));
13069 TREE_TYPE (value
) = enumtype
;
13070 TREE_VALUE (pair
) = value
;
13073 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13074 TYPE_SIZE (enumtype
) = NULL_TREE
;
13075 TYPE_PRECISION (enumtype
) = precision
;
13077 fixup_unsigned_type (enumtype
);
13079 fixup_signed_type (enumtype
);
13081 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13082 /* Use the width of the narrowest normal C type which is wide
13084 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13087 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13089 TYPE_SIZE (enumtype
) = NULL_TREE
;
13090 layout_type (enumtype
);
13092 /* Fix up all variant types of this enum type. */
13093 for (t
= TYPE_MAIN_VARIANT (enumtype
); t
; t
= TYPE_NEXT_VARIANT (t
))
13095 TYPE_VALUES (t
) = TYPE_VALUES (enumtype
);
13096 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (enumtype
);
13097 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (enumtype
);
13098 TYPE_SIZE (t
) = TYPE_SIZE (enumtype
);
13099 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (enumtype
);
13100 TYPE_MODE (t
) = TYPE_MODE (enumtype
);
13101 TYPE_PRECISION (t
) = TYPE_PRECISION (enumtype
);
13102 TYPE_ALIGN (t
) = TYPE_ALIGN (enumtype
);
13103 TYPE_USER_ALIGN (t
) = TYPE_USER_ALIGN (enumtype
);
13104 TREE_UNSIGNED (t
) = TREE_UNSIGNED (enumtype
);
13107 /* Finish debugging output for this type. */
13108 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13111 /* Build and install a CONST_DECL for an enumeration constant of the
13112 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13113 Assignment of sequential values by default is handled here. */
13116 build_enumerator (name
, value
, enumtype
)
13126 /* Remove no-op casts from the value. */
13128 STRIP_TYPE_NOPS (value
);
13130 if (! processing_template_decl
)
13132 /* Validate and default VALUE. */
13133 if (value
!= NULL_TREE
)
13135 value
= decl_constant_value (value
);
13137 if (TREE_CODE (value
) == INTEGER_CST
)
13139 value
= default_conversion (value
);
13140 constant_expression_warning (value
);
13144 cp_error ("enumerator value for `%D' not integer constant", name
);
13149 /* Default based on previous value. */
13150 if (value
== NULL_TREE
&& ! processing_template_decl
)
13154 if (TYPE_VALUES (enumtype
))
13156 /* The next value is the previous value ... */
13157 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13158 /* ... plus one. */
13159 value
= cp_build_binary_op (PLUS_EXPR
,
13163 if (tree_int_cst_lt (value
, prev_value
))
13164 cp_error ("overflow in enumeration values at `%D'", name
);
13167 value
= integer_zero_node
;
13170 /* Remove no-op casts from the value. */
13172 STRIP_TYPE_NOPS (value
);
13174 /* To fix MAX_VAL enum consts. (bkoz) */
13175 TREE_TYPE (value
) = integer_type_node
;
13179 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13180 Even in other cases, we will later (in finish_enum) be setting
13181 the type of VALUE. But, we don't need to make a copy if this
13182 VALUE is one of the enumeration constants for this same
13183 enumeration type. */
13184 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13185 if (TREE_VALUE (values
) == value
)
13187 /* If we didn't break out of the loop, then we do need a copy. */
13188 if (!values
&& value
)
13189 value
= copy_node (value
);
13191 /* C++ associates enums with global, function, or class declarations. */
13192 context
= current_scope ();
13194 /* Build the actual enumeration constant. Note that the enumeration
13195 constants have the type of their initializers until the
13196 enumeration is complete:
13200 Following the closing brace of an enum-specifier, each enumer-
13201 ator has the type of its enumeration. Prior to the closing
13202 brace, the type of each enumerator is the type of its
13203 initializing value.
13205 In finish_enum we will reset the type. Of course, if we're
13206 processing a template, there may be no value. */
13207 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13209 if (context
&& context
== current_class_type
)
13210 /* This enum declaration is local to the class. We need the full
13211 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13212 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13214 /* It's a global enum, or it's local to a function. (Note local to
13215 a function could mean local to a class method. */
13216 decl
= build_decl (CONST_DECL
, name
, type
);
13218 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13219 DECL_INITIAL (decl
) = value
;
13220 TREE_READONLY (decl
) = 1;
13222 if (context
&& context
== current_class_type
)
13223 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13224 on the TYPE_FIELDS list for `S'. (That's so that you can say
13225 things like `S::i' later.) */
13226 finish_member_declaration (decl
);
13230 GNU_xref_decl (current_function_decl
, decl
);
13233 /* Add this enumeration constant to the list for this type. */
13234 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13238 /* We're defining DECL. Make sure that it's type is OK. */
13241 check_function_type (decl
, current_function_parms
)
13243 tree current_function_parms
;
13245 tree fntype
= TREE_TYPE (decl
);
13246 tree return_type
= complete_type (TREE_TYPE (fntype
));
13248 /* In a function definition, arg types must be complete. */
13249 require_complete_types_for_parms (current_function_parms
);
13251 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13253 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13255 /* Make it return void instead, but don't change the
13256 type of the DECL_RESULT, in case we have a named return value. */
13257 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13259 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13261 = build_cplus_method_type (ctype
,
13263 FUNCTION_ARG_CHAIN (decl
));
13267 = build_function_type (void_type_node
,
13268 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13270 = build_exception_variant (fntype
,
13271 TYPE_RAISES_EXCEPTIONS (fntype
));
13274 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13277 /* Create the FUNCTION_DECL for a function definition.
13278 DECLSPECS and DECLARATOR are the parts of the declaration;
13279 they describe the function's name and the type it returns,
13280 but twisted together in a fashion that parallels the syntax of C.
13282 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13283 DECLARATOR is really the DECL for the function we are about to
13284 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13285 indicating that the function is an inline defined in-class.
13287 This function creates a binding context for the function body
13288 as well as setting up the FUNCTION_DECL in current_function_decl.
13290 Returns 1 on success. If the DECLARATOR is not suitable for a function
13291 (it defines a datum instead), we return 0, which tells
13292 yyparse to report a parse error.
13294 For C++, we must first check whether that datum makes any sense.
13295 For example, "class A local_a(1,2);" means that variable local_a
13296 is an aggregate of type A, which should have a constructor
13297 applied to it with the argument list [1, 2]. */
13300 start_function (declspecs
, declarator
, attrs
, flags
)
13301 tree declspecs
, declarator
, attrs
;
13305 tree ctype
= NULL_TREE
;
13308 extern int have_extern_spec
;
13309 extern int used_extern_spec
;
13310 int doing_friend
= 0;
13311 struct binding_level
*bl
;
13312 tree current_function_parms
;
13314 /* Sanity check. */
13315 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13316 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13318 /* This should only be done once on the top most decl. */
13319 if (have_extern_spec
&& !used_extern_spec
)
13321 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13322 used_extern_spec
= 1;
13325 if (flags
& SF_PRE_PARSED
)
13327 decl1
= declarator
;
13329 fntype
= TREE_TYPE (decl1
);
13330 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13331 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13333 /* ISO C++ 11.4/5. A friend function defined in a class is in
13334 the (lexical) scope of the class in which it is defined. */
13335 if (!ctype
&& DECL_FRIEND_P (decl1
))
13337 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13339 /* CTYPE could be null here if we're dealing with a template;
13340 for example, `inline friend float foo()' inside a template
13341 will have no CTYPE set. */
13342 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13348 last_function_parms
= DECL_ARGUMENTS (decl1
);
13349 last_function_parm_tags
= NULL_TREE
;
13353 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13354 /* If the declarator is not suitable for a function definition,
13355 cause a syntax error. */
13356 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13358 fntype
= TREE_TYPE (decl1
);
13360 restype
= TREE_TYPE (fntype
);
13361 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13363 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13364 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13365 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13366 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13367 fntype
= build_function_type (integer_type_node
,
13368 TYPE_ARG_TYPES (fntype
));
13370 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13372 TYPE_ARG_TYPES (fntype
));
13373 TREE_TYPE (decl1
) = fntype
;
13376 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13377 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13378 else if (DECL_MAIN_P (decl1
))
13380 /* If this doesn't return integer_type, complain. */
13381 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13383 if (pedantic
|| warn_return_type
)
13384 pedwarn ("return type for `main' changed to `int'");
13385 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13390 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1
))
13391 /* This is a constructor, we must ensure that any default args
13392 introduced by this definition are propagated to the clones
13393 now. The clones are used directly in overload resolution. */
13394 adjust_clone_args (decl1
);
13396 /* Sometimes we don't notice that a function is a static member, and
13397 build a METHOD_TYPE for it. Fix that up now. */
13398 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13399 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13401 revert_static_member_fn (decl1
);
13402 last_function_parms
= TREE_CHAIN (last_function_parms
);
13406 /* Warn if function was previously implicitly declared
13407 (but not if we warned then). */
13408 if (! warn_implicit
13409 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13410 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13412 /* Set up current_class_type, and enter the scope of the class, if
13415 push_nested_class (ctype
, 1);
13416 else if (DECL_STATIC_FUNCTION_P (decl1
))
13417 push_nested_class (DECL_CONTEXT (decl1
), 2);
13419 /* Now that we have entered the scope of the class, we must restore
13420 the bindings for any template parameters surrounding DECL1, if it
13421 is an inline member template. (Order is important; consider the
13422 case where a template parameter has the same name as a field of
13423 the class.) It is not until after this point that
13424 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13425 if (flags
& SF_INCLASS_INLINE
)
13426 maybe_begin_member_template_processing (decl1
);
13428 /* Effective C++ rule 15. */
13430 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13431 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13432 cp_warning ("`operator=' should return a reference to `*this'");
13434 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13435 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13436 if (!DECL_INITIAL (decl1
))
13437 DECL_INITIAL (decl1
) = error_mark_node
;
13439 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13440 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13443 /* This function exists in static storage.
13444 (This does not mean `static' in the C sense!) */
13445 TREE_STATIC (decl1
) = 1;
13447 /* We must call push_template_decl after current_class_type is set
13448 up. (If we are processing inline definitions after exiting a
13449 class scope, current_class_type will be NULL_TREE until set above
13450 by push_nested_class.) */
13451 if (processing_template_decl
)
13452 decl1
= push_template_decl (decl1
);
13454 /* We are now in the scope of the function being defined. */
13455 current_function_decl
= decl1
;
13457 /* Save the parm names or decls from this function's declarator
13458 where store_parm_decls will find them. */
13459 current_function_parms
= last_function_parms
;
13460 current_function_parm_tags
= last_function_parm_tags
;
13462 /* Make sure the parameter and return types are reasonable. When
13463 you declare a function, these types can be incomplete, but they
13464 must be complete when you define the function. */
13465 if (! processing_template_decl
)
13466 check_function_type (decl1
, current_function_parms
);
13468 /* Build the return declaration for the function. */
13469 restype
= TREE_TYPE (fntype
);
13470 if (!processing_template_decl
)
13472 if (!DECL_RESULT (decl1
))
13474 DECL_RESULT (decl1
)
13475 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13476 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13477 DECL_RESULT (decl1
));
13481 /* Just use `void'. Nobody will ever look at this anyhow. */
13482 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13484 /* Initialize RTL machinery. We cannot do this until
13485 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13486 even when processing a template; this is how we get
13487 CFUN set up, and our per-function variables initialized.
13488 FIXME factor out the non-RTL stuff. */
13489 bl
= current_binding_level
;
13490 init_function_start (decl1
, input_filename
, lineno
);
13491 current_binding_level
= bl
;
13493 /* Even though we're inside a function body, we still don't want to
13494 call expand_expr to calculate the size of a variable-sized array.
13495 We haven't necessarily assigned RTL to all variables yet, so it's
13496 not safe to try to expand expressions involving them. */
13497 immediate_size_expand
= 0;
13498 cfun
->x_dont_save_pending_sizes_p
= 1;
13500 /* Start the statement-tree, start the tree now. */
13501 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13503 /* Let the user know we're compiling this function. */
13504 announce_function (decl1
);
13506 /* Record the decl so that the function name is defined.
13507 If we already have a decl for this name, and it is a FUNCTION_DECL,
13508 use the old decl. */
13509 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13511 /* A specialization is not used to guide overload resolution. */
13512 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13513 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13514 decl1
= pushdecl (decl1
);
13517 /* We need to set the DECL_CONTEXT. */
13518 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13519 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13520 /* And make sure we have enough default args. */
13521 check_default_args (decl1
);
13523 fntype
= TREE_TYPE (decl1
);
13526 /* Reset these in case the call to pushdecl changed them. */
13527 current_function_decl
= decl1
;
13528 cfun
->decl
= decl1
;
13530 /* If we are (erroneously) defining a function that we have already
13531 defined before, wipe out what we knew before. */
13532 if (!DECL_PENDING_INLINE_P (decl1
)
13533 && DECL_SAVED_FUNCTION_DATA (decl1
))
13535 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13536 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13539 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13541 /* We know that this was set up by `grokclassfn'. We do not
13542 wait until `store_parm_decls', since evil parse errors may
13543 never get us to that point. Here we keep the consistency
13544 between `current_class_type' and `current_class_ptr'. */
13545 tree t
= DECL_ARGUMENTS (decl1
);
13547 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13549 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13552 cp_function_chain
->x_current_class_ref
13553 = build_indirect_ref (t
, NULL
);
13554 cp_function_chain
->x_current_class_ptr
= t
;
13556 /* Constructors and destructors need to know whether they're "in
13557 charge" of initializing virtual base classes. */
13558 t
= TREE_CHAIN (t
);
13559 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13561 current_in_charge_parm
= t
;
13562 t
= TREE_CHAIN (t
);
13564 if (DECL_HAS_VTT_PARM_P (decl1
))
13566 if (DECL_NAME (t
) != vtt_parm_identifier
)
13568 current_vtt_parm
= t
;
13572 if (DECL_INTERFACE_KNOWN (decl1
))
13574 tree ctx
= decl_function_context (decl1
);
13576 if (DECL_NOT_REALLY_EXTERN (decl1
))
13577 DECL_EXTERNAL (decl1
) = 0;
13579 if (ctx
!= NULL_TREE
&& DECL_DECLARED_INLINE_P (ctx
)
13580 && TREE_PUBLIC (ctx
))
13581 /* This is a function in a local class in an extern inline
13583 comdat_linkage (decl1
);
13585 /* If this function belongs to an interface, it is public.
13586 If it belongs to someone else's interface, it is also external.
13587 This only affects inlines and template instantiations. */
13588 else if (interface_unknown
== 0
13589 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13590 || flag_alt_external_templates
))
13592 if (DECL_DECLARED_INLINE_P (decl1
)
13593 || DECL_TEMPLATE_INSTANTIATION (decl1
)
13594 || processing_template_decl
)
13596 DECL_EXTERNAL (decl1
)
13598 || (DECL_DECLARED_INLINE_P (decl1
)
13599 && ! flag_implement_inlines
13600 && !DECL_VINDEX (decl1
)));
13602 /* For WIN32 we also want to put these in linkonce sections. */
13603 maybe_make_one_only (decl1
);
13606 DECL_EXTERNAL (decl1
) = 0;
13607 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13608 DECL_INTERFACE_KNOWN (decl1
) = 1;
13610 else if (interface_unknown
&& interface_only
13611 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13612 || flag_alt_external_templates
))
13614 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13615 interface, we will have interface_only set but not
13616 interface_known. In that case, we don't want to use the normal
13617 heuristics because someone will supply a #pragma implementation
13618 elsewhere, and deducing it here would produce a conflict. */
13619 comdat_linkage (decl1
);
13620 DECL_EXTERNAL (decl1
) = 0;
13621 DECL_INTERFACE_KNOWN (decl1
) = 1;
13622 DECL_DEFER_OUTPUT (decl1
) = 1;
13626 /* This is a definition, not a reference.
13627 So clear DECL_EXTERNAL. */
13628 DECL_EXTERNAL (decl1
) = 0;
13630 if ((DECL_DECLARED_INLINE_P (decl1
)
13631 || DECL_TEMPLATE_INSTANTIATION (decl1
))
13632 && ! DECL_INTERFACE_KNOWN (decl1
)
13633 /* Don't try to defer nested functions for now. */
13634 && ! decl_function_context (decl1
))
13635 DECL_DEFER_OUTPUT (decl1
) = 1;
13637 DECL_INTERFACE_KNOWN (decl1
) = 1;
13641 current_binding_level
->parm_flag
= 1;
13644 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13646 /* Promote the value to int before returning it. */
13647 if (c_promoting_integer_type_p (restype
))
13648 restype
= type_promotes_to (restype
);
13650 if (DECL_RESULT (decl1
) == NULL_TREE
)
13652 DECL_RESULT (decl1
)
13653 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13654 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13655 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13660 if (DECL_DESTRUCTOR_P (decl1
))
13662 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13663 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13666 start_fname_decls ();
13668 store_parm_decls (current_function_parms
);
13673 /* Store the parameter declarations into the current function declaration.
13674 This is called after parsing the parameter declarations, before
13675 digesting the body of the function.
13677 Also install to binding contour return value identifier, if any. */
13680 store_parm_decls (current_function_parms
)
13681 tree current_function_parms
;
13683 register tree fndecl
= current_function_decl
;
13684 register tree parm
;
13685 int parms_have_cleanups
= 0;
13686 tree cleanups
= NULL_TREE
;
13688 /* This is a list of types declared among parms in a prototype. */
13689 tree parmtags
= current_function_parm_tags
;
13691 /* This is a chain of any other decls that came in among the parm
13692 declarations. If a parm is declared with enum {foo, bar} x;
13693 then CONST_DECLs for foo and bar are put here. */
13694 tree nonparms
= NULL_TREE
;
13696 if (current_function_parms
)
13698 /* This case is when the function was defined with an ANSI prototype.
13699 The parms already have decls, so we need not do anything here
13700 except record them as in effect
13701 and complain if any redundant old-style parm decls were written. */
13703 tree specparms
= current_function_parms
;
13706 /* Must clear this because it might contain TYPE_DECLs declared
13708 storedecls (NULL_TREE
);
13710 /* If we're doing semantic analysis, then we'll call pushdecl
13711 for each of these. We must do them in reverse order so that
13712 they end in the correct forward order. */
13713 specparms
= nreverse (specparms
);
13715 for (parm
= specparms
; parm
; parm
= next
)
13717 next
= TREE_CHAIN (parm
);
13718 if (TREE_CODE (parm
) == PARM_DECL
)
13722 if (DECL_NAME (parm
) == NULL_TREE
13723 || TREE_CODE (parm
) != VOID_TYPE
)
13726 cp_error ("parameter `%D' declared void", parm
);
13728 cleanup
= (processing_template_decl
13730 : maybe_build_cleanup (parm
));
13733 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13737 /* If we find an enum constant or a type tag,
13738 put it aside for the moment. */
13739 TREE_CHAIN (parm
) = NULL_TREE
;
13740 nonparms
= chainon (nonparms
, parm
);
13744 /* Get the decls in their original chain order and record in the
13745 function. This is all and only the PARM_DECLs that were
13746 pushed into scope by the loop above. */
13747 DECL_ARGUMENTS (fndecl
) = getdecls ();
13748 storetags (chainon (parmtags
, gettags ()));
13751 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13753 /* Now store the final chain of decls for the arguments
13754 as the decl-chain of the current lexical scope.
13755 Put the enumerators in as well, at the front so that
13756 DECL_ARGUMENTS is not modified. */
13757 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13759 /* Now that we have initialized the parms, we can start their
13760 cleanups. We cannot do this before, since expand_decl_cleanup
13761 should not be called before the parm can be used. */
13764 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13765 TREE_VALUE (cleanups
));
13766 cleanups
= TREE_CHAIN (cleanups
);
13769 /* Create a binding contour which can be used to catch
13770 cleanup-generated temporaries. */
13771 if (parms_have_cleanups
)
13774 /* Do the starting of the exception specifications, if we have any. */
13775 if (flag_exceptions
&& !processing_template_decl
13776 && flag_enforce_eh_specs
13777 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13778 current_eh_spec_block
= begin_eh_spec_block ();
13782 /* We have finished doing semantic analysis on DECL, but have not yet
13783 generated RTL for its body. Save away our current state, so that
13784 when we want to generate RTL later we know what to do. */
13787 save_function_data (decl
)
13790 struct cp_language_function
*f
;
13792 /* Save the language-specific per-function data so that we can
13793 get it back when we really expand this function. */
13794 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13798 f
= ((struct cp_language_function
*)
13799 xmalloc (sizeof (struct cp_language_function
)));
13800 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13801 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13803 /* Clear out the bits we don't need. */
13804 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13805 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13806 f
->x_named_label_uses
= NULL
;
13807 f
->bindings
= NULL
;
13808 f
->x_local_names
= NULL
;
13810 /* When we get back here again, we will be expanding. */
13811 f
->x_expanding_p
= 1;
13813 /* If we've already decided that we cannot inline this function, we
13814 must remember that fact when we actually go to expand the
13816 if (current_function_cannot_inline
)
13818 f
->cannot_inline
= current_function_cannot_inline
;
13819 DECL_INLINE (decl
) = 0;
13823 /* At the end of every constructor we generate to code to return
13824 `this'. Do that now. */
13827 finish_constructor_body ()
13829 /* Any return from a constructor will end up here. */
13831 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13833 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13834 generate the return, rather than a goto to CTOR_LABEL. */
13835 ctor_label
= NULL_TREE
;
13836 /* In check_return_expr we translate an empty return from a
13837 constructor to a return of `this'. */
13838 finish_return_stmt (NULL_TREE
);
13839 /* Mark the end of the constructor. */
13840 add_stmt (build_stmt (CTOR_STMT
));
13843 /* At the end of every destructor we generate code to restore virtual
13844 function tables to the values desired by base classes and to call
13845 to base class destructors. Do that now. */
13848 finish_destructor_body ()
13850 tree compound_stmt
;
13853 /* Create a block to contain all the extra code. */
13854 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13856 /* Any return from a destructor will end up here. */
13857 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13859 /* Generate the code to call destructor on base class. If this
13860 destructor belongs to a class with virtual functions, then set
13861 the virtual function table pointer to represent the type of our
13864 /* This side-effect makes call to `build_delete' generate the code
13865 we have to have at the end of this destructor. `build_delete'
13866 will set the flag again. */
13867 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13869 exprstmt
= build_delete (current_class_type
,
13871 sfk_base_destructor
,
13872 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13875 if (exprstmt
!= error_mark_node
13876 && (TREE_CODE (exprstmt
) != NOP_EXPR
13877 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13878 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13880 if (exprstmt
!= void_zero_node
)
13881 /* Don't call `expand_expr_stmt' if we're not going to do
13882 anything, since -Wall will give a diagnostic. */
13883 finish_expr_stmt (exprstmt
);
13885 /* Run destructors for all virtual baseclasses. */
13886 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13891 if_stmt
= begin_if_stmt ();
13892 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13893 current_in_charge_parm
,
13897 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
13898 /* The CLASSTYPE_VBASECLASSES list is in initialization
13899 order, so we have to march through it in reverse order. */
13900 for (vbases
= nreverse (copy_list (vbases
));
13902 vbases
= TREE_CHAIN (vbases
))
13904 tree vbase
= TREE_VALUE (vbases
);
13905 tree base_type
= BINFO_TYPE (vbase
);
13907 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type
))
13909 tree base_ptr_type
= build_pointer_type (base_type
);
13910 tree expr
= current_class_ptr
;
13912 /* Convert to the basetype here, as we know the layout is
13913 fixed. What is more, if we let build_method_call do it,
13914 it will use the vtable, which may have been clobbered
13915 by the deletion of our primary base. */
13917 expr
= build1 (NOP_EXPR
, base_ptr_type
, expr
);
13918 expr
= build (PLUS_EXPR
, base_ptr_type
, expr
,
13919 BINFO_OFFSET (vbase
));
13920 expr
= build_indirect_ref (expr
, NULL
);
13921 expr
= build_method_call (expr
, base_dtor_identifier
,
13924 finish_expr_stmt (expr
);
13928 finish_then_clause (if_stmt
);
13933 /* In a virtual destructor, we must call delete. */
13934 if (DECL_VIRTUAL_P (current_function_decl
))
13937 tree virtual_size
= c_sizeof (current_class_type
);
13941 At the point of definition of a virtual destructor (including
13942 an implicit definition), non-placement operator delete shall
13943 be looked up in the scope of the destructor's class and if
13944 found shall be accessible and unambiguous. */
13945 exprstmt
= build_op_delete_call
13946 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13947 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13949 if_stmt
= begin_if_stmt ();
13950 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13951 current_in_charge_parm
,
13954 finish_expr_stmt (exprstmt
);
13955 finish_then_clause (if_stmt
);
13959 /* Close the block we started above. */
13960 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13963 /* Finish up a function declaration and compile that function
13964 all the way to assembler language output. The free the storage
13965 for the function definition.
13967 FLAGS is a bitwise or of the following values:
13969 An extra call to poplevel (and expand_end_bindings) must be
13970 made to take care of the binding contour for the base
13971 initializers. This is only relevant for constructors.
13973 We just finished processing the body of an in-class inline
13974 function definition. (This processing will have taken place
13975 after the class definition is complete.) */
13978 finish_function (flags
)
13981 register tree fndecl
= current_function_decl
;
13982 tree fntype
, ctype
= NULL_TREE
;
13983 int call_poplevel
= (flags
& 1) != 0;
13984 int inclass_inline
= (flags
& 2) != 0;
13987 /* When we get some parse errors, we can end up without a
13988 current_function_decl, so cope. */
13989 if (fndecl
== NULL_TREE
)
13990 return error_mark_node
;
13992 nested
= function_depth
> 1;
13993 fntype
= TREE_TYPE (fndecl
);
13995 /* TREE_READONLY (fndecl) = 1;
13996 This caused &foo to be of type ptr-to-const-function
13997 which then got a warning when stored in a ptr-to-function variable. */
13999 my_friendly_assert (building_stmt_tree (), 20000911);
14001 finish_fname_decls ();
14003 /* For a cloned function, we've already got all the code we need;
14004 there's no need to add any extra bits. */
14005 if (!DECL_CLONED_FUNCTION_P (fndecl
))
14007 if (DECL_CONSTRUCTOR_P (fndecl
))
14009 finish_constructor_body ();
14013 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
14014 finish_destructor_body ();
14015 else if (DECL_MAIN_P (fndecl
))
14017 /* Make it so that `main' always returns 0 by default. */
14019 finish_return_stmt (integer_one_node
);
14021 finish_return_stmt (integer_zero_node
);
14025 /* Finish dealing with exception specifiers. */
14026 if (flag_exceptions
&& !processing_template_decl
14027 && flag_enforce_eh_specs
14028 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14029 finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS
14030 (TREE_TYPE (current_function_decl
)),
14031 current_eh_spec_block
);
14034 /* If we're saving up tree structure, tie off the function now. */
14035 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14037 /* This must come after expand_function_end because cleanups might
14038 have declarations (from inline functions) that need to go into
14039 this function's blocks. */
14040 if (current_binding_level
->parm_flag
!= 1)
14041 my_friendly_abort (122);
14042 poplevel (1, 0, 1);
14044 /* Remember that we were in class scope. */
14045 if (current_class_name
)
14046 ctype
= current_class_type
;
14048 /* Must mark the RESULT_DECL as being in this function. */
14049 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14051 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14052 to the FUNCTION_DECL node itself. */
14053 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14055 /* Save away current state, if appropriate. */
14056 if (!processing_template_decl
)
14057 save_function_data (fndecl
);
14059 /* If this function calls `setjmp' it cannot be inlined. When
14060 `longjmp' is called it is not guaranteed to restore the value of
14061 local variables that have been modified since the call to
14062 `setjmp'. So, if were to inline this function into some caller
14063 `c', then when we `longjmp', we might not restore all variables
14064 in `c'. (It might seem, at first blush, that there's no way for
14065 this function to modify local variables in `c', but their
14066 addresses may have been stored somewhere accessible to this
14068 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14069 DECL_UNINLINABLE (fndecl
) = 1;
14071 /* Clear out memory we no longer need. */
14072 free_after_parsing (cfun
);
14073 /* Since we never call rest_of_compilation, we never clear
14074 CFUN. Do so explicitly. */
14075 free_after_compilation (cfun
);
14078 /* If this is a in-class inline definition, we may have to pop the
14079 bindings for the template parameters that we added in
14080 maybe_begin_member_template_processing when start_function was
14082 if (inclass_inline
)
14083 maybe_end_member_template_processing ();
14085 /* Leave the scope of the class. */
14087 pop_nested_class ();
14093 /* Let the error reporting routines know that we're outside a
14094 function. For a nested function, this value is used in
14095 pop_cp_function_context and then reset via pop_function_context. */
14096 current_function_decl
= NULL_TREE
;
14101 /* Create the FUNCTION_DECL for a function definition.
14102 DECLSPECS and DECLARATOR are the parts of the declaration;
14103 they describe the return type and the name of the function,
14104 but twisted together in a fashion that parallels the syntax of C.
14106 This function creates a binding context for the function body
14107 as well as setting up the FUNCTION_DECL in current_function_decl.
14109 Returns a FUNCTION_DECL on success.
14111 If the DECLARATOR is not suitable for a function (it defines a datum
14112 instead), we return 0, which tells yyparse to report a parse error.
14114 May return void_type_node indicating that this method is actually
14115 a friend. See grokfield for more details.
14117 Came here with a `.pushlevel' .
14119 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14120 CHANGES TO CODE IN `grokfield'. */
14123 start_method (declspecs
, declarator
, attrlist
)
14124 tree declarator
, declspecs
, attrlist
;
14126 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14129 /* Something too ugly to handle. */
14130 if (fndecl
== NULL_TREE
)
14133 /* Pass friends other than inline friend functions back. */
14134 if (fndecl
== void_type_node
)
14137 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14138 /* Not a function, tell parser to report parse error. */
14141 if (DECL_IN_AGGR_P (fndecl
))
14143 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14145 if (DECL_CONTEXT (fndecl
)
14146 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14147 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14148 DECL_CONTEXT (fndecl
));
14150 return void_type_node
;
14153 check_template_shadow (fndecl
);
14155 DECL_DECLARED_INLINE_P (fndecl
) = 1;
14157 if (flag_default_inline
)
14158 DECL_INLINE (fndecl
) = 1;
14160 /* We process method specializations in finish_struct_1. */
14161 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14162 fndecl
= push_template_decl (fndecl
);
14164 if (! DECL_FRIEND_P (fndecl
))
14166 if (TREE_CHAIN (fndecl
))
14168 fndecl
= copy_node (fndecl
);
14169 TREE_CHAIN (fndecl
) = NULL_TREE
;
14172 if (DECL_CONSTRUCTOR_P (fndecl
))
14174 if (! grok_ctor_properties (current_class_type
, fndecl
))
14175 return void_type_node
;
14177 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14178 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14181 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14183 /* Make a place for the parms */
14185 current_binding_level
->parm_flag
= 1;
14187 DECL_IN_AGGR_P (fndecl
) = 1;
14191 /* Go through the motions of finishing a function definition.
14192 We don't compile this method until after the whole class has
14195 FINISH_METHOD must return something that looks as though it
14196 came from GROKFIELD (since we are defining a method, after all).
14198 This is called after parsing the body of the function definition.
14199 STMTS is the chain of statements that makes up the function body.
14201 DECL is the ..._DECL that `start_method' provided. */
14204 finish_method (decl
)
14207 register tree fndecl
= decl
;
14210 register tree link
;
14212 if (decl
== void_type_node
)
14215 old_initial
= DECL_INITIAL (fndecl
);
14217 /* Undo the level for the parms (from start_method).
14218 This is like poplevel, but it causes nothing to be
14219 saved. Saving information here confuses symbol-table
14220 output routines. Besides, this information will
14221 be correctly output when this method is actually
14224 /* Clear out the meanings of the local variables of this level;
14225 also record in each decl which block it belongs to. */
14227 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14229 if (DECL_NAME (link
) != NULL_TREE
)
14230 pop_binding (DECL_NAME (link
), link
);
14231 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14232 DECL_CONTEXT (link
) = NULL_TREE
;
14235 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14236 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14237 current_binding_level
->parm_flag
,
14238 current_binding_level
->keep
);
14240 poplevel (0, 0, 0);
14242 DECL_INITIAL (fndecl
) = old_initial
;
14244 /* We used to check if the context of FNDECL was different from
14245 current_class_type as another way to get inside here. This didn't work
14246 for String.cc in libg++. */
14247 if (DECL_FRIEND_P (fndecl
))
14249 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14250 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14251 decl
= void_type_node
;
14257 /* Called when a new struct TYPE is defined.
14258 If this structure or union completes the type of any previous
14259 variable declaration, lay it out and output its rtl. */
14262 hack_incomplete_structures (type
)
14266 struct binding_level
*level
;
14268 if (!type
) /* Don't do this for class templates. */
14271 if (namespace_bindings_p ())
14274 list
= &namespace_scope_incomplete
;
14278 level
= innermost_nonclass_level ();
14279 list
= &level
->incomplete
;
14286 tree decl
= TREE_VALUE (*list
);
14287 if ((decl
&& TREE_TYPE (decl
) == type
)
14288 || (TREE_TYPE (decl
)
14289 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14290 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14292 int toplevel
= toplevel_bindings_p ();
14293 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14294 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14295 layout_type (TREE_TYPE (decl
));
14296 layout_decl (decl
, 0);
14297 rest_of_decl_compilation (decl
, NULL
, toplevel
, 0);
14301 expand_decl (decl
);
14302 cleanup
= maybe_build_cleanup (decl
);
14303 expand_decl_init (decl
);
14304 if (! expand_decl_cleanup (decl
, cleanup
))
14305 cp_error ("parser lost in parsing declaration of `%D'",
14308 *list
= TREE_CHAIN (*list
);
14311 list
= &TREE_CHAIN (*list
);
14314 /* Keep looking through artificial binding levels generated
14315 for local variables. */
14316 if (level
&& level
->keep
== 2)
14318 level
= level
->level_chain
;
14319 list
= &level
->incomplete
;
14326 /* If DECL is of a type which needs a cleanup, build that cleanup
14330 maybe_build_cleanup (decl
)
14333 tree type
= TREE_TYPE (decl
);
14335 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14337 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14340 if (TREE_CODE (type
) == ARRAY_TYPE
)
14344 mark_addressable (decl
);
14345 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14348 /* Optimize for space over speed here. */
14349 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14350 || flag_expensive_optimizations
)
14351 flags
|= LOOKUP_NONVIRTUAL
;
14353 rval
= build_delete (TREE_TYPE (rval
), rval
,
14354 sfk_complete_destructor
, flags
, 0);
14356 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14357 && ! TYPE_HAS_DESTRUCTOR (type
))
14358 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14359 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14366 /* When a stmt has been parsed, this function is called. */
14371 /* Always assume this statement was not an expression statement. If
14372 it actually was an expression statement, its our callers
14373 responsibility to fix this up. */
14374 last_expr_type
= NULL_TREE
;
14377 /* DECL was originally constructed as a non-static member function,
14378 but turned out to be static. Update it accordingly. */
14381 revert_static_member_fn (decl
)
14385 tree function
= TREE_TYPE (decl
);
14386 tree args
= TYPE_ARG_TYPES (function
);
14388 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14389 != TYPE_UNQUALIFIED
)
14390 cp_error ("static member function `%#D' declared with type qualifiers",
14393 args
= TREE_CHAIN (args
);
14394 tmp
= build_function_type (TREE_TYPE (function
), args
);
14395 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14396 tmp
= build_exception_variant (tmp
,
14397 TYPE_RAISES_EXCEPTIONS (function
));
14398 TREE_TYPE (decl
) = tmp
;
14399 if (DECL_ARGUMENTS (decl
))
14400 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14401 DECL_STATIC_FUNCTION_P (decl
) = 1;
14404 /* Initialize the variables used during compilation of a C++
14408 push_cp_function_context (f
)
14409 struct function
*f
;
14411 struct cp_language_function
*p
14412 = ((struct cp_language_function
*)
14413 xcalloc (1, sizeof (struct cp_language_function
)));
14414 f
->language
= (struct language_function
*) p
;
14416 /* It takes an explicit call to expand_body to generate RTL for a
14420 /* Whenever we start a new function, we destroy temporaries in the
14422 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14425 /* Free the language-specific parts of F, now that we've finished
14426 compiling the function. */
14429 pop_cp_function_context (f
)
14430 struct function
*f
;
14434 struct cp_language_function
*cp
=
14435 (struct cp_language_function
*) f
->language
;
14436 if (cp
->x_local_names
)
14437 VARRAY_FREE (cp
->x_local_names
);
14438 free (f
->language
);
14443 /* Mark P for GC. */
14446 mark_lang_function (p
)
14447 struct cp_language_function
*p
;
14452 mark_c_language_function (&p
->base
);
14454 ggc_mark_tree (p
->x_ctor_label
);
14455 ggc_mark_tree (p
->x_dtor_label
);
14456 ggc_mark_tree (p
->x_current_class_ptr
);
14457 ggc_mark_tree (p
->x_current_class_ref
);
14458 ggc_mark_tree (p
->x_eh_spec_block
);
14459 ggc_mark_tree_varray (p
->x_local_names
);
14461 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14462 mark_binding_level (&p
->bindings
);
14465 /* Mark the language-specific data in F for GC. */
14468 mark_cp_function_context (f
)
14469 struct function
*f
;
14471 mark_lang_function ((struct cp_language_function
*) f
->language
);
14478 enum tree_code code
= TREE_CODE (t
);
14479 if (code
== IDENTIFIER_NODE
)
14481 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14482 struct lang_id2
*li2
= li
->x
;
14483 ggc_mark_tree (li
->namespace_bindings
);
14484 ggc_mark_tree (li
->bindings
);
14485 ggc_mark_tree (li
->class_value
);
14486 ggc_mark_tree (li
->class_template_info
);
14490 ggc_mark_tree (li2
->label_value
);
14491 ggc_mark_tree (li2
->implicit_decl
);
14492 ggc_mark_tree (li2
->error_locus
);
14495 else if (code
== CPLUS_BINDING
)
14497 if (BINDING_HAS_LEVEL_P (t
))
14498 mark_binding_level (&BINDING_LEVEL (t
));
14500 ggc_mark_tree (BINDING_SCOPE (t
));
14501 ggc_mark_tree (BINDING_VALUE (t
));
14503 else if (code
== OVERLOAD
)
14504 ggc_mark_tree (OVL_FUNCTION (t
));
14505 else if (code
== TEMPLATE_PARM_INDEX
)
14506 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14507 else if (TREE_CODE_CLASS (code
) == 'd')
14509 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14514 c_mark_lang_decl (&ld
->decl_flags
.base
);
14515 if (!DECL_GLOBAL_CTOR_P (t
)
14516 && !DECL_GLOBAL_DTOR_P (t
)
14517 && !DECL_THUNK_P (t
)
14518 && !DECL_DISCRIMINATOR_P (t
))
14519 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14520 else if (DECL_THUNK_P (t
))
14521 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14522 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14523 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14525 mark_binding_level (&NAMESPACE_LEVEL (t
));
14526 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14528 ggc_mark_tree (ld
->befriending_classes
);
14529 ggc_mark_tree (ld
->context
);
14530 ggc_mark_tree (ld
->cloned_function
);
14531 ggc_mark_tree (ld
->inlined_fns
);
14532 if (TREE_CODE (t
) == TYPE_DECL
)
14533 ggc_mark_tree (ld
->u
.sorted_fields
);
14534 else if (TREE_CODE (t
) == FUNCTION_DECL
14535 && !DECL_PENDING_INLINE_P (t
))
14536 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14540 else if (TREE_CODE_CLASS (code
) == 't')
14542 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14544 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14545 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14548 ggc_mark_tree (lt
->primary_base
);
14549 ggc_mark_tree (lt
->vfields
);
14550 ggc_mark_tree (lt
->vbases
);
14551 ggc_mark_tree (lt
->tags
);
14552 ggc_mark_tree (lt
->size
);
14553 ggc_mark_tree (lt
->pure_virtuals
);
14554 ggc_mark_tree (lt
->friend_classes
);
14555 ggc_mark_tree (lt
->rtti
);
14556 ggc_mark_tree (lt
->methods
);
14557 ggc_mark_tree (lt
->template_info
);
14558 ggc_mark_tree (lt
->befriending_classes
);
14561 /* In the case of pointer-to-member function types, the
14562 TYPE_LANG_SPECIFIC is really just a tree. */
14563 ggc_mark_tree ((tree
) lt
);
14567 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14568 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14571 identifier_global_value (t
)
14574 return IDENTIFIER_GLOBAL_VALUE (t
);
14577 /* Build the void_list_node (void_type_node having been created). */
14579 build_void_list_node ()
14581 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
14582 TREE_PARMLIST (t
) = 1;
14587 cp_missing_noreturn_ok_p (decl
)
14590 /* A missing noreturn is ok for the `main' function. */
14591 return DECL_MAIN_P (decl
);