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 const struct attribute_spec
*lang_attribute_table
;
50 #ifndef BOOL_TYPE_SIZE
51 /* `bool' has size and alignment `1', on all platforms. */
52 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
55 static tree grokparms
PARAMS ((tree
));
56 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
58 static void push_binding_level
PARAMS ((struct binding_level
*, int,
60 static void pop_binding_level
PARAMS ((void));
61 static void suspend_binding_level
PARAMS ((void));
62 static void resume_binding_level
PARAMS ((struct binding_level
*));
63 static struct binding_level
*make_binding_level
PARAMS ((void));
64 static void declare_namespace_level
PARAMS ((void));
65 static int decl_jump_unsafe
PARAMS ((tree
));
66 static void storedecls
PARAMS ((tree
));
67 static void require_complete_types_for_parms
PARAMS ((tree
));
68 static int ambi_op_p
PARAMS ((enum tree_code
));
69 static int unary_op_p
PARAMS ((enum tree_code
));
70 static tree store_bindings
PARAMS ((tree
, tree
));
71 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
72 static tree obscure_complex_init
PARAMS ((tree
, tree
));
73 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
74 static void push_local_name
PARAMS ((tree
));
75 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
76 static tree grok_reference_init
PARAMS ((tree
, tree
, tree
));
77 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
78 enum overload_flags
, tree
,
79 tree
, int, int, int, int, int, int, tree
));
80 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
81 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
82 struct binding_level
*, int));
83 static void set_identifier_type_value_with_scope
84 PARAMS ((tree
, tree
, struct binding_level
*));
85 static void record_unknown_type
PARAMS ((tree
, const char *));
86 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
87 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
88 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
90 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
91 static void check_for_uninitialized_const_var
PARAMS ((tree
));
92 static unsigned long typename_hash
PARAMS ((hash_table_key
));
93 static bool typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
94 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
95 static int add_binding
PARAMS ((tree
, tree
));
96 static void pop_binding
PARAMS ((tree
, tree
));
97 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
98 static tree find_binding
PARAMS ((tree
, tree
));
99 static tree select_decl
PARAMS ((tree
, int));
100 static int lookup_flags
PARAMS ((int, int));
101 static tree qualify_lookup
PARAMS ((tree
, int));
102 static tree record_builtin_java_type
PARAMS ((const char *, int));
103 static const char *tag_name
PARAMS ((enum tag_types code
));
104 static void find_class_binding_level
PARAMS ((void));
105 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
106 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
107 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
108 static int walk_globals_r
PARAMS ((tree
, void *));
109 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
110 static tree make_label_decl
PARAMS ((tree
, int));
111 static void use_label
PARAMS ((tree
));
112 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
114 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
115 static void check_switch_goto
PARAMS ((struct binding_level
*));
116 static void check_previous_gotos
PARAMS ((tree
));
117 static void pop_label
PARAMS ((tree
, tree
));
118 static void pop_labels
PARAMS ((tree
));
119 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
120 static void layout_var_decl
PARAMS ((tree
));
121 static void maybe_commonize_var
PARAMS ((tree
));
122 static tree check_initializer
PARAMS ((tree
, tree
));
123 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
124 static void push_cp_function_context
PARAMS ((struct function
*));
125 static void pop_cp_function_context
PARAMS ((struct function
*));
126 static void mark_binding_level
PARAMS ((void *));
127 static void mark_named_label_lists
PARAMS ((void *, void *));
128 static void mark_cp_function_context
PARAMS ((struct function
*));
129 static void mark_saved_scope
PARAMS ((void *));
130 static void mark_lang_function
PARAMS ((struct cp_language_function
*));
131 static void save_function_data
PARAMS ((tree
));
132 static void check_function_type
PARAMS ((tree
, tree
));
133 static void destroy_local_var
PARAMS ((tree
));
134 static void finish_constructor_body
PARAMS ((void));
135 static void finish_destructor_body
PARAMS ((void));
136 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
137 static tree get_atexit_node
PARAMS ((void));
138 static tree get_dso_handle_node
PARAMS ((void));
139 static tree start_cleanup_fn
PARAMS ((void));
140 static void end_cleanup_fn
PARAMS ((void));
141 static tree cp_make_fname_decl
PARAMS ((tree
, int));
142 static void initialize_predefined_identifiers
PARAMS ((void));
143 static tree check_special_function_return_type
144 PARAMS ((special_function_kind
, tree
, tree
));
145 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
146 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
147 static void store_parm_decls
PARAMS ((tree
));
148 static int cp_missing_noreturn_ok_p
PARAMS ((tree
));
150 #if defined (DEBUG_CP_BINDING_LEVELS)
151 static void indent
PARAMS ((void));
154 /* Erroneous argument lists can use this *IFF* they do not modify it. */
155 tree error_mark_list
;
157 /* The following symbols are subsumed in the cp_global_trees array, and
158 listed here individually for documentation purposes.
161 tree wchar_decl_node;
163 tree vtable_entry_type;
164 tree delta_type_node;
165 tree __t_desc_type_node;
166 tree ti_desc_type_node;
167 tree bltn_desc_type_node, ptr_desc_type_node;
168 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
169 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
170 tree ptm_desc_type_node;
171 tree base_desc_type_node;
173 tree class_type_node, record_type_node, union_type_node, enum_type_node;
174 tree unknown_type_node;
176 Array type `vtable_entry_type[]'
179 tree vtbl_ptr_type_node;
186 A FUNCTION_DECL which can call `abort'. Not necessarily the
187 one that the user will declare, but sufficient to be called
188 by routines that want to abort the program.
192 The FUNCTION_DECL for the default `::operator delete'.
194 tree global_delete_fndecl;
197 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
202 tree cp_global_trees
[CPTI_MAX
];
204 /* Indicates that there is a type value in some namespace, although
205 that is not necessarily in scope at the moment. */
207 static tree global_type_node
;
209 /* Expect only namespace names now. */
210 static int only_namespace_names
;
212 /* Used only for jumps to as-yet undefined labels, since jumps to
213 defined labels can have their validity checked immediately. */
215 struct named_label_use_list
217 struct binding_level
*binding_level
;
220 const char *filename_o_goto
;
222 struct named_label_use_list
*next
;
225 #define named_label_uses cp_function_chain->x_named_label_uses
227 #define local_names cp_function_chain->x_local_names
229 /* A list of objects which have constructors or destructors
230 which reside in the global scope. The decl is stored in
231 the TREE_VALUE slot and the initializer is stored
232 in the TREE_PURPOSE slot. */
233 tree static_aggregates
;
237 /* A node for the integer constants 2, and 3. */
239 tree integer_two_node
, integer_three_node
;
241 /* Similar, for last_function_parm_tags. */
242 tree last_function_parms
;
244 /* A list of all LABEL_DECLs in the function that have names. Here so
245 we can clear out their names' definitions at the end of the
246 function, and so we can check the validity of jumps to these labels. */
248 struct named_label_list
250 struct binding_level
*binding_level
;
255 struct named_label_list
*next
;
256 unsigned int in_try_scope
: 1;
257 unsigned int in_catch_scope
: 1;
260 #define named_labels cp_function_chain->x_named_labels
262 /* Nonzero means use the ISO C94 dialect of C. */
266 /* Nonzero means use the ISO C99 dialect of C. */
270 /* Nonzero means we are a hosted implementation for code shared with C. */
274 /* Nonzero means add default format_arg attributes for functions not
277 int flag_noniso_default_format_attributes
= 1;
279 /* Nonzero if we want to conserve space in the .o files. We do this
280 by putting uninitialized data and runtime initialized data into
281 .common instead of .data at the expense of not flagging multiple
283 extern int flag_conserve_space
;
285 /* C and C++ flags are in decl2.c. */
287 /* Flag used when debugging spew.c */
289 extern int spew_debug
;
291 /* A expression of value 0 with the same precision as a sizetype
293 tree signed_size_zero_node
;
295 /* The name of the anonymous namespace, throughout this translation
297 tree anonymous_namespace_name
;
299 /* The number of function bodies which we are currently processing.
300 (Zero if we are at namespace scope, one inside the body of a
301 function, two inside the body of a function in a local class, etc.) */
304 /* For each binding contour we allocate a binding_level structure
305 which records the names defined in that contour.
308 1) one for each function definition,
309 where internal declarations of the parameters appear.
310 2) one for each compound statement,
311 to record its declarations.
313 The current meaning of a name can be found by searching the levels
314 from the current one out to the global one.
316 Off to the side, may be the class_binding_level. This exists only
317 to catch class-local declarations. It is otherwise nonexistent.
319 Also there may be binding levels that catch cleanups that must be
320 run when exceptions occur. Thus, to see whether a name is bound in
321 the current scope, it is not enough to look in the
322 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
325 /* Note that the information in the `names' component of the global contour
326 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
330 /* A chain of _DECL nodes for all variables, constants, functions,
331 and typedef types. These are in the reverse of the order
332 supplied. There may be OVERLOADs on this list, too, but they
333 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
336 /* A list of structure, union and enum definitions, for looking up
338 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
339 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
340 or ENUMERAL_TYPE node.
342 C++: the TREE_VALUE nodes can be simple types for
343 component_bindings. */
346 /* A list of USING_DECL nodes. */
349 /* A list of used namespaces. PURPOSE is the namespace,
350 VALUE the common ancestor with this binding_level's namespace. */
351 tree using_directives
;
353 /* If this binding level is the binding level for a class, then
354 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
355 is the name of an entity bound in the class. The TREE_TYPE is
356 the DECL bound by this name in the class. */
359 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
360 is used for all binding levels. In addition the TREE_VALUE is the
361 IDENTIFIER_TYPE_VALUE before we entered the class. */
364 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
365 label in this scope. The TREE_PURPOSE is the previous value of
366 the IDENTIFIER_LABEL VALUE. */
367 tree shadowed_labels
;
369 /* For each level (except not the global one),
370 a chain of BLOCK nodes for all the levels
371 that were entered and exited one level down. */
374 /* The _TYPE node for this level, if parm_flag == 2. */
377 /* The binding level which this one is contained in (inherits from). */
378 struct binding_level
*level_chain
;
380 /* List of decls in `names' that have incomplete
381 structure or union types. */
384 /* List of VAR_DECLS saved from a previous for statement.
385 These would be dead in ISO-conforming code, but might
386 be referenced in ARM-era code. These are stored in a
387 TREE_LIST; the TREE_VALUE is the actual declaration. */
388 tree dead_vars_from_for
;
390 /* 1 for the level that holds the parameters of a function.
391 2 for the level that holds a class declaration. */
392 unsigned parm_flag
: 2;
394 /* 1 means make a BLOCK for this level regardless of all else.
395 2 for temporary binding contours created by the compiler. */
398 /* Nonzero if this level "doesn't exist" for tags. */
399 unsigned tag_transparent
: 1;
401 /* Nonzero if this level can safely have additional
402 cleanup-needing variables added to it. */
403 unsigned more_cleanups_ok
: 1;
404 unsigned have_cleanups
: 1;
406 /* Nonzero if this scope is for storing the decls for template
407 parameters and generic decls; these decls will be discarded and
408 replaced with a TEMPLATE_DECL. */
409 unsigned template_parms_p
: 1;
411 /* Nonzero if this scope corresponds to the `<>' in a
412 `template <>' clause. Whenever this flag is set,
413 TEMPLATE_PARMS_P will be set as well. */
414 unsigned template_spec_p
: 1;
416 /* This is set for a namespace binding level. */
417 unsigned namespace_p
: 1;
419 /* True if this level is that of a for-statement where we need to
420 worry about ambiguous (ARM or ISO) scope rules. */
421 unsigned is_for_scope
: 1;
423 /* True if this level corresponds to a TRY block. Currently this
424 information is only available while building the tree structure. */
425 unsigned is_try_scope
: 1;
427 /* True if this level corresponds to a CATCH block. Currently this
428 information is only available while building the tree structure. */
429 unsigned is_catch_scope
: 1;
431 /* Three bits left for this word. */
433 #if defined(DEBUG_CP_BINDING_LEVELS)
434 /* Binding depth at which this level began. */
435 unsigned binding_depth
;
436 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
439 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
441 /* The binding level currently in effect. */
443 #define current_binding_level \
444 (cfun && cp_function_chain->bindings \
445 ? cp_function_chain->bindings \
446 : scope_chain->bindings)
448 /* The binding level of the current class, if any. */
450 #define class_binding_level scope_chain->class_bindings
452 /* A chain of binding_level structures awaiting reuse. */
454 static struct binding_level
*free_binding_level
;
456 /* The outermost binding level, for names of file scope.
457 This is created when the compiler is started and exists
458 through the entire run. */
460 static struct binding_level
*global_binding_level
;
462 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
464 static int keep_next_level_flag
;
466 #if defined(DEBUG_CP_BINDING_LEVELS)
467 static int binding_depth
= 0;
468 static int is_class_level
= 0;
475 for (i
= 0; i
< binding_depth
*2; i
++)
478 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
480 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
483 push_binding_level (newlevel
, tag_transparent
, keep
)
484 struct binding_level
*newlevel
;
485 int tag_transparent
, keep
;
487 /* Add this level to the front of the chain (stack) of levels that
489 memset ((char*) newlevel
, 0, sizeof (struct binding_level
));
490 newlevel
->level_chain
= current_binding_level
;
491 current_binding_level
= newlevel
;
492 newlevel
->tag_transparent
= tag_transparent
;
493 newlevel
->more_cleanups_ok
= 1;
495 newlevel
->keep
= keep
;
496 #if defined(DEBUG_CP_BINDING_LEVELS)
497 newlevel
->binding_depth
= binding_depth
;
499 fprintf (stderr
, "push %s level 0x%08x line %d\n",
500 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
503 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
506 /* Find the innermost enclosing class scope, and reset
507 CLASS_BINDING_LEVEL appropriately. */
510 find_class_binding_level ()
512 struct binding_level
*level
= current_binding_level
;
514 while (level
&& level
->parm_flag
!= 2)
515 level
= level
->level_chain
;
516 if (level
&& level
->parm_flag
== 2)
517 class_binding_level
= level
;
519 class_binding_level
= 0;
525 if (global_binding_level
)
527 /* Cannot pop a level, if there are none left to pop. */
528 if (current_binding_level
== global_binding_level
)
529 my_friendly_abort (123);
531 /* Pop the current level, and free the structure for reuse. */
532 #if defined(DEBUG_CP_BINDING_LEVELS)
535 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
536 (is_class_level
) ? "class" : "block",
537 current_binding_level
, lineno
);
538 if (is_class_level
!= (current_binding_level
== class_binding_level
))
541 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
544 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
546 register struct binding_level
*level
= current_binding_level
;
547 current_binding_level
= current_binding_level
->level_chain
;
548 level
->level_chain
= free_binding_level
;
549 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
550 if (level
->binding_depth
!= binding_depth
)
552 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
553 free_binding_level
= level
;
554 find_class_binding_level ();
559 suspend_binding_level ()
561 if (class_binding_level
)
562 current_binding_level
= class_binding_level
;
564 if (global_binding_level
)
566 /* Cannot suspend a level, if there are none left to suspend. */
567 if (current_binding_level
== global_binding_level
)
568 my_friendly_abort (123);
570 /* Suspend the current level. */
571 #if defined(DEBUG_CP_BINDING_LEVELS)
574 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
575 (is_class_level
) ? "class" : "block",
576 current_binding_level
, lineno
);
577 if (is_class_level
!= (current_binding_level
== class_binding_level
))
580 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
583 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
584 current_binding_level
= current_binding_level
->level_chain
;
585 find_class_binding_level ();
589 resume_binding_level (b
)
590 struct binding_level
*b
;
592 /* Resuming binding levels is meant only for namespaces,
593 and those cannot nest into classes. */
594 my_friendly_assert(!class_binding_level
, 386);
595 /* Also, resuming a non-directly nested namespace is a no-no. */
596 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
597 current_binding_level
= b
;
598 #if defined(DEBUG_CP_BINDING_LEVELS)
599 b
->binding_depth
= binding_depth
;
601 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
602 (is_class_level
) ? "class" : "block", b
, lineno
);
605 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
608 /* Create a new `struct binding_level'. */
611 struct binding_level
*
612 make_binding_level ()
615 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
618 /* Nonzero if we are currently in the global binding level. */
623 return current_binding_level
== global_binding_level
;
626 /* Return the innermost binding level that is not for a class scope. */
628 static struct binding_level
*
629 innermost_nonclass_level ()
631 struct binding_level
*b
;
633 b
= current_binding_level
;
634 while (b
->parm_flag
== 2)
640 /* Nonzero if we are currently in a toplevel binding level. This
641 means either the global binding level or a namespace in a toplevel
642 binding level. Since there are no non-toplevel namespace levels,
643 this really means any namespace or template parameter level. We
644 also include a class whose context is toplevel. */
647 toplevel_bindings_p ()
649 struct binding_level
*b
= innermost_nonclass_level ();
651 return b
->namespace_p
|| b
->template_parms_p
;
654 /* Nonzero if this is a namespace scope, or if we are defining a class
655 which is itself at namespace scope, or whose enclosing class is
656 such a class, etc. */
659 namespace_bindings_p ()
661 struct binding_level
*b
= innermost_nonclass_level ();
663 return b
->namespace_p
;
666 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
667 unconditionally. Otherwise, use the normal logic to decide whether
668 or not to create a BLOCK. */
671 keep_next_level (keep
)
674 keep_next_level_flag
= keep
;
677 /* Nonzero if the current level needs to have a BLOCK made. */
682 return (current_binding_level
->blocks
!= NULL_TREE
683 || current_binding_level
->keep
684 || current_binding_level
->names
!= NULL_TREE
685 || (current_binding_level
->tags
!= NULL_TREE
686 && !current_binding_level
->tag_transparent
));
690 declare_namespace_level ()
692 current_binding_level
->namespace_p
= 1;
695 /* Returns non-zero if this scope was created to store template
699 template_parm_scope_p ()
701 return current_binding_level
->template_parms_p
;
704 /* Returns the kind of template specialization we are currently
705 processing, given that it's declaration contained N_CLASS_SCOPES
706 explicit scope qualifications. */
709 current_tmpl_spec_kind (n_class_scopes
)
712 int n_template_parm_scopes
= 0;
713 int seen_specialization_p
= 0;
714 int innermost_specialization_p
= 0;
715 struct binding_level
*b
;
717 /* Scan through the template parameter scopes. */
718 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
720 /* If we see a specialization scope inside a parameter scope,
721 then something is wrong. That corresponds to a declaration
724 template <class T> template <> ...
726 which is always illegal since [temp.expl.spec] forbids the
727 specialization of a class member template if the enclosing
728 class templates are not explicitly specialized as well. */
729 if (b
->template_spec_p
)
731 if (n_template_parm_scopes
== 0)
732 innermost_specialization_p
= 1;
734 seen_specialization_p
= 1;
736 else if (seen_specialization_p
== 1)
737 return tsk_invalid_member_spec
;
739 ++n_template_parm_scopes
;
742 /* Handle explicit instantiations. */
743 if (processing_explicit_instantiation
)
745 if (n_template_parm_scopes
!= 0)
746 /* We've seen a template parameter list during an explicit
747 instantiation. For example:
749 template <class T> template void f(int);
751 This is erroneous. */
752 return tsk_invalid_expl_inst
;
754 return tsk_expl_inst
;
757 if (n_template_parm_scopes
< n_class_scopes
)
758 /* We've not seen enough template headers to match all the
759 specialized classes present. For example:
761 template <class T> void R<T>::S<T>::f(int);
763 This is illegal; there needs to be one set of template
764 parameters for each class. */
765 return tsk_insufficient_parms
;
766 else if (n_template_parm_scopes
== n_class_scopes
)
767 /* We're processing a non-template declaration (even though it may
768 be a member of a template class.) For example:
770 template <class T> void S<T>::f(int);
772 The `class T' maches the `S<T>', leaving no template headers
773 corresponding to the `f'. */
775 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
776 /* We've got too many template headers. For example:
778 template <> template <class T> void f (T);
780 There need to be more enclosing classes. */
781 return tsk_excessive_parms
;
783 /* This must be a template. It's of the form:
785 template <class T> template <class U> void S<T>::f(U);
787 This is a specialization if the innermost level was a
788 specialization; otherwise it's just a definition of the
790 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
794 set_class_shadows (shadows
)
797 class_binding_level
->class_shadowed
= shadows
;
800 /* Enter a new binding level.
801 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
802 not for that of tags. */
805 pushlevel (tag_transparent
)
808 struct binding_level
*newlevel
;
810 if (cfun
&& !doing_semantic_analysis_p ())
813 /* Reuse or create a struct for this binding level. */
814 #if defined(DEBUG_CP_BINDING_LEVELS)
816 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
817 if (free_binding_level
)
818 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
820 newlevel
= free_binding_level
;
821 free_binding_level
= free_binding_level
->level_chain
;
824 newlevel
= make_binding_level ();
826 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
827 GNU_xref_start_scope ((size_t) newlevel
);
828 keep_next_level_flag
= 0;
831 /* We're defining an object of type TYPE. If it needs a cleanup, but
832 we're not allowed to add any more objects with cleanups to the current
833 scope, create a new binding level. */
836 maybe_push_cleanup_level (type
)
839 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
840 && current_binding_level
->more_cleanups_ok
== 0)
845 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
849 /* Enter a new scope. The KIND indicates what kind of scope is being
860 case sk_template_spec
:
861 current_binding_level
->template_spec_p
= 1;
864 case sk_template_parms
:
865 current_binding_level
->template_parms_p
= 1;
869 my_friendly_abort (20000309);
873 /* Exit the current scope. */
882 note_level_for_for ()
884 current_binding_level
->is_for_scope
= 1;
887 /* Record that the current binding level represents a try block. */
890 note_level_for_try ()
892 current_binding_level
->is_try_scope
= 1;
895 /* Record that the current binding level represents a catch block. */
898 note_level_for_catch ()
900 current_binding_level
->is_catch_scope
= 1;
903 /* For a binding between a name and an entity at a block scope,
904 this is the `struct binding_level' for the block. */
905 #define BINDING_LEVEL(NODE) \
906 (((struct tree_binding*)NODE)->scope.level)
908 /* A free list of CPLUS_BINDING nodes, connected by their
911 static tree free_bindings
;
913 /* Make DECL the innermost binding for ID. The LEVEL is the binding
914 level at which this declaration is being bound. */
917 push_binding (id
, decl
, level
)
920 struct binding_level
* level
;
926 binding
= free_bindings
;
927 free_bindings
= TREE_CHAIN (binding
);
930 binding
= make_node (CPLUS_BINDING
);
932 /* Now, fill in the binding information. */
933 BINDING_VALUE (binding
) = decl
;
934 BINDING_TYPE (binding
) = NULL_TREE
;
935 BINDING_LEVEL (binding
) = level
;
936 INHERITED_VALUE_BINDING_P (binding
) = 0;
937 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
938 BINDING_HAS_LEVEL_P (binding
) = 1;
940 /* And put it on the front of the list of bindings for ID. */
941 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
942 IDENTIFIER_BINDING (id
) = binding
;
945 /* ID is already bound in the current scope. But, DECL is an
946 additional binding for ID in the same scope. This is the `struct
947 stat' hack whereby a non-typedef class-name or enum-name can be
948 bound at the same level as some other kind of entity. It's the
949 responsibility of the caller to check that inserting this name is
950 legal here. Returns nonzero if the new binding was successful. */
952 add_binding (id
, decl
)
956 tree binding
= IDENTIFIER_BINDING (id
);
959 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
960 /* The new name is the type name. */
961 BINDING_TYPE (binding
) = decl
;
962 else if (!BINDING_VALUE (binding
))
963 /* This situation arises when push_class_level_binding moves an
964 inherited type-binding out of the way to make room for a new
966 BINDING_VALUE (binding
) = decl
;
967 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
968 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
970 /* The old binding was a type name. It was placed in
971 BINDING_VALUE because it was thought, at the point it was
972 declared, to be the only entity with such a name. Move the
973 type name into the type slot; it is now hidden by the new
975 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
976 BINDING_VALUE (binding
) = decl
;
977 INHERITED_VALUE_BINDING_P (binding
) = 0;
979 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
980 && TREE_CODE (decl
) == TYPE_DECL
981 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
982 && same_type_p (TREE_TYPE (decl
),
983 TREE_TYPE (BINDING_VALUE (binding
))))
984 /* We have two typedef-names, both naming the same type to have
985 the same name. This is OK because of:
989 In a given scope, a typedef specifier can be used to redefine
990 the name of any type declared in that scope to refer to the
991 type to which it already refers. */
993 /* There can be two block-scope declarations of the same variable,
994 so long as they are `extern' declarations. */
995 else if (TREE_CODE (decl
) == VAR_DECL
996 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
997 && DECL_EXTERNAL (decl
)
998 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1000 duplicate_decls (decl
, BINDING_VALUE (binding
));
1005 cp_error ("declaration of `%#D'", decl
);
1006 cp_error_at ("conflicts with previous declaration `%#D'",
1007 BINDING_VALUE (binding
));
1014 /* Add DECL to the list of things declared in B. */
1017 add_decl_to_level (decl
, b
)
1019 struct binding_level
*b
;
1021 /* We build up the list in reverse order, and reverse it later if
1023 TREE_CHAIN (decl
) = b
->names
;
1027 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1028 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1029 doesn't really belong to this binding level, that it got here
1030 through a using-declaration. */
1033 push_local_binding (id
, decl
, flags
)
1038 struct binding_level
*b
;
1040 /* Skip over any local classes. This makes sense if we call
1041 push_local_binding with a friend decl of a local class. */
1042 b
= current_binding_level
;
1043 while (b
->parm_flag
== 2)
1046 if (lookup_name_current_level (id
))
1048 /* Supplement the existing binding. */
1049 if (!add_binding (id
, decl
))
1050 /* It didn't work. Something else must be bound at this
1051 level. Do not add DECL to the list of things to pop
1056 /* Create a new binding. */
1057 push_binding (id
, decl
, b
);
1059 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1060 /* We must put the OVERLOAD into a TREE_LIST since the
1061 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1062 decls that got here through a using-declaration. */
1063 decl
= build_tree_list (NULL_TREE
, decl
);
1065 /* And put DECL on the list of things declared by the current
1067 add_decl_to_level (decl
, b
);
1070 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1071 binding was successful. */
1074 push_class_binding (id
, decl
)
1079 tree binding
= IDENTIFIER_BINDING (id
);
1082 /* Note that we declared this value so that we can issue an error if
1083 this an illegal redeclaration of a name already used for some
1085 note_name_declared_in_class (id
, decl
);
1087 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1088 /* Supplement the existing binding. */
1089 result
= add_binding (id
, decl
);
1091 /* Create a new binding. */
1092 push_binding (id
, decl
, class_binding_level
);
1094 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1095 class-level declaration. Note that we do not use DECL here
1096 because of the possibility of the `struct stat' hack; if DECL is
1097 a class-name or enum-name we might prefer a field-name, or some
1099 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1101 /* If this is a binding from a base class, mark it as such. */
1102 binding
= IDENTIFIER_BINDING (id
);
1103 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1105 /* Any implicit typename must be from a base-class. The
1106 context for an implicit typename declaration is always
1107 the derived class in which the lookup was done, so the checks
1108 based on the context of DECL below will not trigger. */
1109 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1110 INHERITED_VALUE_BINDING_P (binding
) = 1;
1113 if (TREE_CODE (decl
) == OVERLOAD
)
1114 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1117 my_friendly_assert (DECL_P (decl
), 0);
1118 context
= context_for_name_lookup (decl
);
1121 if (is_properly_derived_from (current_class_type
, context
))
1122 INHERITED_VALUE_BINDING_P (binding
) = 1;
1124 INHERITED_VALUE_BINDING_P (binding
) = 0;
1127 else if (BINDING_VALUE (binding
) == decl
)
1128 /* We only encounter a TREE_LIST when push_class_decls detects an
1129 ambiguity. Such an ambiguity can be overridden by a definition
1131 INHERITED_VALUE_BINDING_P (binding
) = 1;
1136 /* Remove the binding for DECL which should be the innermost binding
1140 pop_binding (id
, decl
)
1146 if (id
== NULL_TREE
)
1147 /* It's easiest to write the loops that call this function without
1148 checking whether or not the entities involved have names. We
1149 get here for such an entity. */
1152 /* Get the innermost binding for ID. */
1153 binding
= IDENTIFIER_BINDING (id
);
1155 /* The name should be bound. */
1156 my_friendly_assert (binding
!= NULL_TREE
, 0);
1158 /* The DECL will be either the ordinary binding or the type
1159 binding for this identifier. Remove that binding. */
1160 if (BINDING_VALUE (binding
) == decl
)
1161 BINDING_VALUE (binding
) = NULL_TREE
;
1162 else if (BINDING_TYPE (binding
) == decl
)
1163 BINDING_TYPE (binding
) = NULL_TREE
;
1165 my_friendly_abort (0);
1167 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1169 /* We're completely done with the innermost binding for this
1170 identifier. Unhook it from the list of bindings. */
1171 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1173 /* Add it to the free list. */
1174 TREE_CHAIN (binding
) = free_bindings
;
1175 free_bindings
= binding
;
1177 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1179 BINDING_LEVEL (binding
) = NULL
;
1183 /* When a label goes out of scope, check to see if that label was used
1184 in a valid manner, and issue any appropriate warnings or errors. */
1187 pop_label (label
, old_value
)
1191 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1193 if (DECL_INITIAL (label
) == NULL_TREE
)
1195 cp_error_at ("label `%D' used but not defined", label
);
1196 /* Avoid crashing later. */
1197 define_label (input_filename
, 1, DECL_NAME (label
));
1199 else if (warn_unused_label
&& !TREE_USED (label
))
1200 cp_warning_at ("label `%D' defined but not used", label
);
1203 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1206 /* At the end of a function, all labels declared within the function
1207 go out of scope. BLOCK is the top-level block for the
1214 struct named_label_list
*link
;
1216 /* Clear out the definitions of all label names, since their scopes
1218 for (link
= named_labels
; link
; link
= link
->next
)
1220 pop_label (link
->label_decl
, link
->old_value
);
1221 /* Put the labels into the "variables" of the top-level block,
1222 so debugger can see them. */
1223 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1224 BLOCK_VARS (block
) = link
->label_decl
;
1227 named_labels
= NULL
;
1230 /* Exit a binding level.
1231 Pop the level off, and restore the state of the identifier-decl mappings
1232 that were in effect when this level was entered.
1234 If KEEP == 1, this level had explicit declarations, so
1235 and create a "block" (a BLOCK node) for the level
1236 to record its declarations and subblocks for symbol table output.
1238 If FUNCTIONBODY is nonzero, this level is the body of a function,
1239 so create a block as if KEEP were set and also clear out all
1242 If REVERSE is nonzero, reverse the order of decls before putting
1243 them into the BLOCK. */
1246 poplevel (keep
, reverse
, functionbody
)
1252 /* The chain of decls was accumulated in reverse order.
1253 Put it into forward order, just for cleanliness. */
1255 int tmp
= functionbody
;
1256 int real_functionbody
;
1259 tree block
= NULL_TREE
;
1261 int leaving_for_scope
;
1263 if (cfun
&& !doing_semantic_analysis_p ())
1266 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1269 real_functionbody
= (current_binding_level
->keep
== 2
1270 ? ((functionbody
= 0), tmp
) : functionbody
);
1271 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1272 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1274 my_friendly_assert (!current_binding_level
->class_shadowed
,
1277 /* We used to use KEEP == 2 to indicate that the new block should go
1278 at the beginning of the list of blocks at this binding level,
1279 rather than the end. This hack is no longer used. */
1280 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1282 GNU_xref_end_scope ((size_t) current_binding_level
,
1283 (size_t) current_binding_level
->level_chain
,
1284 current_binding_level
->parm_flag
,
1285 current_binding_level
->keep
);
1287 if (current_binding_level
->keep
== 1)
1290 /* Any uses of undefined labels, and any defined labels, now operate
1291 under constraints of next binding contour. */
1292 if (cfun
&& !functionbody
)
1294 struct binding_level
*level_chain
;
1295 level_chain
= current_binding_level
->level_chain
;
1298 struct named_label_use_list
*uses
;
1299 struct named_label_list
*labels
;
1300 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1301 if (labels
->binding_level
== current_binding_level
)
1304 if (current_binding_level
->is_try_scope
)
1305 labels
->in_try_scope
= 1;
1306 if (current_binding_level
->is_catch_scope
)
1307 labels
->in_catch_scope
= 1;
1308 for (decl
= labels
->names_in_scope
; decl
;
1309 decl
= TREE_CHAIN (decl
))
1310 if (decl_jump_unsafe (decl
))
1311 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1313 labels
->binding_level
= level_chain
;
1314 labels
->names_in_scope
= level_chain
->names
;
1317 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1318 if (uses
->binding_level
== current_binding_level
)
1320 uses
->binding_level
= level_chain
;
1321 uses
->names_in_scope
= level_chain
->names
;
1326 /* Get the decls in the order they were written.
1327 Usually current_binding_level->names is in reverse order.
1328 But parameter decls were previously put in forward order. */
1331 current_binding_level
->names
1332 = decls
= nreverse (current_binding_level
->names
);
1334 decls
= current_binding_level
->names
;
1336 /* Output any nested inline functions within this block
1337 if they weren't already output. */
1338 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1339 if (TREE_CODE (decl
) == FUNCTION_DECL
1340 && ! TREE_ASM_WRITTEN (decl
)
1341 && DECL_INITIAL (decl
) != NULL_TREE
1342 && TREE_ADDRESSABLE (decl
)
1343 && decl_function_context (decl
) == current_function_decl
)
1345 /* If this decl was copied from a file-scope decl
1346 on account of a block-scope extern decl,
1347 propagate TREE_ADDRESSABLE to the file-scope decl. */
1348 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1349 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1352 push_function_context ();
1353 output_inline_function (decl
);
1354 pop_function_context ();
1358 /* When not in function-at-a-time mode, expand_end_bindings will
1359 warn about unused variables. But, in function-at-a-time mode
1360 expand_end_bindings is not passed the list of variables in the
1361 current scope, and therefore no warning is emitted. So, we
1362 explicitly warn here. */
1363 if (!processing_template_decl
)
1364 warn_about_unused_variables (getdecls ());
1366 /* If there were any declarations or structure tags in that level,
1367 or if this level is a function body,
1368 create a BLOCK to record them for the life of this function. */
1370 if (keep
== 1 || functionbody
)
1371 block
= make_node (BLOCK
);
1372 if (block
!= NULL_TREE
)
1374 BLOCK_VARS (block
) = decls
;
1375 BLOCK_SUBBLOCKS (block
) = subblocks
;
1378 /* In each subblock, record that this is its superior. */
1380 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1381 BLOCK_SUPERCONTEXT (link
) = block
;
1383 /* We still support the old for-scope rules, whereby the variables
1384 in a for-init statement were in scope after the for-statement
1385 ended. We only use the new rules in flag_new_for_scope is
1388 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1390 /* Remove declarations for all the DECLs in this level. */
1391 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1393 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1394 && DECL_NAME (link
))
1397 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1401 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1403 ns_binding
= NULL_TREE
;
1406 && (BINDING_LEVEL (outer_binding
)
1407 == current_binding_level
->level_chain
))
1408 /* We have something like:
1413 and we are leaving the `for' scope. There's no reason to
1414 keep the binding of the inner `i' in this case. */
1415 pop_binding (DECL_NAME (link
), link
);
1416 else if ((outer_binding
1417 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1420 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1421 /* Here, we have something like:
1429 We must pop the for-scope binding so we know what's a
1430 type and what isn't. */
1431 pop_binding (DECL_NAME (link
), link
);
1434 /* Mark this VAR_DECL as dead so that we can tell we left it
1435 there only for backward compatibility. */
1436 DECL_DEAD_FOR_LOCAL (link
) = 1;
1438 /* Keep track of what should of have happenned when we
1439 popped the binding. */
1440 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1441 DECL_SHADOWED_FOR_VAR (link
)
1442 = BINDING_VALUE (outer_binding
);
1444 /* Add it to the list of dead variables in the next
1445 outermost binding to that we can remove these when we
1446 leave that binding. */
1447 current_binding_level
->level_chain
->dead_vars_from_for
1448 = tree_cons (NULL_TREE
, link
,
1449 current_binding_level
->level_chain
->
1450 dead_vars_from_for
);
1452 /* Although we don't pop the CPLUS_BINDING, we do clear
1453 its BINDING_LEVEL since the level is going away now. */
1454 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1460 /* Remove the binding. */
1462 if (TREE_CODE (decl
) == TREE_LIST
)
1463 decl
= TREE_VALUE (decl
);
1465 pop_binding (DECL_NAME (decl
), decl
);
1466 else if (TREE_CODE (decl
) == OVERLOAD
)
1467 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1469 my_friendly_abort (0);
1473 /* Remove declarations for any `for' variables from inner scopes
1474 that we kept around. */
1475 for (link
= current_binding_level
->dead_vars_from_for
;
1476 link
; link
= TREE_CHAIN (link
))
1477 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1479 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1480 for (link
= current_binding_level
->type_shadowed
;
1481 link
; link
= TREE_CHAIN (link
))
1482 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1484 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1485 for (link
= current_binding_level
->shadowed_labels
;
1487 link
= TREE_CHAIN (link
))
1488 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1490 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1491 list if a `using' declaration put them there. The debugging
1492 back-ends won't understand OVERLOAD, so we remove them here.
1493 Because the BLOCK_VARS are (temporarily) shared with
1494 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1495 popped all the bindings. */
1500 for (d
= &BLOCK_VARS (block
); *d
; )
1502 if (TREE_CODE (*d
) == TREE_LIST
)
1503 *d
= TREE_CHAIN (*d
);
1505 d
= &TREE_CHAIN (*d
);
1509 /* If the level being exited is the top level of a function,
1510 check over all the labels. */
1513 /* Since this is the top level block of a function, the vars are
1514 the function's parameters. Don't leave them in the BLOCK
1515 because they are found in the FUNCTION_DECL instead. */
1516 BLOCK_VARS (block
) = 0;
1520 tmp
= current_binding_level
->keep
;
1522 pop_binding_level ();
1524 DECL_INITIAL (current_function_decl
) = block
;
1526 current_binding_level
->blocks
1527 = chainon (current_binding_level
->blocks
, block
);
1529 /* If we did not make a block for the level just exited,
1530 any blocks made for inner levels
1531 (since they cannot be recorded as subblocks in that level)
1532 must be carried forward so they will later become subblocks
1533 of something else. */
1535 current_binding_level
->blocks
1536 = chainon (current_binding_level
->blocks
, subblocks
);
1538 /* Each and every BLOCK node created here in `poplevel' is important
1539 (e.g. for proper debugging information) so if we created one
1540 earlier, mark it as "used". */
1542 TREE_USED (block
) = 1;
1544 /* Take care of compiler's internal binding structures. */
1550 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1553 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1554 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1557 block
= poplevel (keep
, reverse
, functionbody
);
1563 /* Delete the node BLOCK from the current binding level.
1564 This is used for the block inside a stmt expr ({...})
1565 so that the block can be reinserted where appropriate. */
1568 delete_block (block
)
1572 if (current_binding_level
->blocks
== block
)
1573 current_binding_level
->blocks
= TREE_CHAIN (block
);
1574 for (t
= current_binding_level
->blocks
; t
;)
1576 if (TREE_CHAIN (t
) == block
)
1577 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1581 TREE_CHAIN (block
) = NULL_TREE
;
1582 /* Clear TREE_USED which is always set by poplevel.
1583 The flag is set again if insert_block is called. */
1584 TREE_USED (block
) = 0;
1587 /* Insert BLOCK at the end of the list of subblocks of the
1588 current binding level. This is used when a BIND_EXPR is expanded,
1589 to handle the BLOCK node inside the BIND_EXPR. */
1592 insert_block (block
)
1595 TREE_USED (block
) = 1;
1596 current_binding_level
->blocks
1597 = chainon (current_binding_level
->blocks
, block
);
1600 /* Set the BLOCK node for the innermost scope
1601 (the one we are currently in). */
1605 tree block ATTRIBUTE_UNUSED
;
1607 /* The RTL expansion machinery requires us to provide this callback,
1608 but it is not applicable in function-at-a-time mode. */
1609 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1612 /* Do a pushlevel for class declarations. */
1617 register struct binding_level
*newlevel
;
1619 /* Reuse or create a struct for this binding level. */
1620 #if defined(DEBUG_CP_BINDING_LEVELS)
1622 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1623 if (free_binding_level
)
1624 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1626 newlevel
= free_binding_level
;
1627 free_binding_level
= free_binding_level
->level_chain
;
1630 newlevel
= make_binding_level ();
1632 #if defined(DEBUG_CP_BINDING_LEVELS)
1634 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1636 push_binding_level (newlevel
, 0, 0);
1638 class_binding_level
= current_binding_level
;
1639 class_binding_level
->parm_flag
= 2;
1640 class_binding_level
->this_class
= current_class_type
;
1643 /* ...and a poplevel for class declarations. */
1648 register struct binding_level
*level
= class_binding_level
;
1651 my_friendly_assert (level
!= 0, 354);
1653 /* If we're leaving a toplevel class, don't bother to do the setting
1654 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1655 shouldn't even be used when current_class_type isn't set, and second,
1656 if we don't touch it here, we're able to use the cache effect if the
1657 next time we're entering a class scope, it is the same class. */
1658 if (current_class_depth
!= 1)
1660 struct binding_level
* b
;
1662 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1663 for (shadowed
= level
->class_shadowed
;
1665 shadowed
= TREE_CHAIN (shadowed
))
1666 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1668 /* Find the next enclosing class, and recreate
1669 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1670 b
= level
->level_chain
;
1671 while (b
&& b
->parm_flag
!= 2)
1675 for (shadowed
= b
->class_shadowed
;
1677 shadowed
= TREE_CHAIN (shadowed
))
1681 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1682 while (t
&& BINDING_LEVEL (t
) != b
)
1686 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1687 = BINDING_VALUE (t
);
1691 /* Remember to save what IDENTIFIER's were bound in this scope so we
1692 can recover from cache misses. */
1694 previous_class_type
= current_class_type
;
1695 previous_class_values
= class_binding_level
->class_shadowed
;
1697 for (shadowed
= level
->type_shadowed
;
1699 shadowed
= TREE_CHAIN (shadowed
))
1700 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1702 /* Remove the bindings for all of the class-level declarations. */
1703 for (shadowed
= level
->class_shadowed
;
1705 shadowed
= TREE_CHAIN (shadowed
))
1706 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1708 GNU_xref_end_scope ((size_t) class_binding_level
,
1709 (size_t) class_binding_level
->level_chain
,
1710 class_binding_level
->parm_flag
,
1711 class_binding_level
->keep
);
1713 /* Now, pop out of the binding level which we created up in the
1714 `pushlevel_class' routine. */
1715 #if defined(DEBUG_CP_BINDING_LEVELS)
1717 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1719 pop_binding_level ();
1722 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1723 for any names in enclosing classes. */
1726 clear_identifier_class_values ()
1730 if (!class_binding_level
)
1733 for (t
= class_binding_level
->class_shadowed
;
1736 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1739 /* Returns non-zero if T is a virtual function table. */
1742 vtable_decl_p (t
, data
)
1744 void *data ATTRIBUTE_UNUSED
;
1746 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1749 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1753 vtype_decl_p (t
, data
)
1755 void *data ATTRIBUTE_UNUSED
;
1757 return (TREE_CODE (t
) == TYPE_DECL
1758 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1759 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1762 /* Return the declarations that are members of the namespace NS. */
1765 cp_namespace_decls (ns
)
1768 return NAMESPACE_LEVEL (ns
)->names
;
1771 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1772 itself, calling F for each. The DATA is passed to F as well. */
1775 walk_namespaces_r (namespace, f
, data
)
1777 walk_namespaces_fn f
;
1783 result
|= (*f
) (namespace, data
);
1785 for (current
= cp_namespace_decls (namespace);
1787 current
= TREE_CHAIN (current
))
1789 if (TREE_CODE (current
) != NAMESPACE_DECL
1790 || DECL_NAMESPACE_ALIAS (current
))
1793 /* We found a namespace. */
1794 result
|= walk_namespaces_r (current
, f
, data
);
1800 /* Walk all the namespaces, calling F for each. The DATA is passed to
1804 walk_namespaces (f
, data
)
1805 walk_namespaces_fn f
;
1808 return walk_namespaces_r (global_namespace
, f
, data
);
1811 struct walk_globals_data
{
1812 walk_globals_pred p
;
1817 /* Walk the global declarations in NAMESPACE. Whenever one is found
1818 for which P returns non-zero, call F with its address. If any call
1819 to F returns a non-zero value, return a non-zero value. */
1822 walk_globals_r (namespace, data
)
1826 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1827 walk_globals_pred p
= wgd
->p
;
1828 walk_globals_fn f
= wgd
->f
;
1829 void *d
= wgd
->data
;
1833 t
= &NAMESPACE_LEVEL (namespace)->names
;
1840 result
|= (*f
) (t
, d
);
1842 /* If F changed *T, then *T still points at the next item to
1845 t
= &TREE_CHAIN (*t
);
1851 /* Walk the global declarations. Whenever one is found for which P
1852 returns non-zero, call F with its address. If any call to F
1853 returns a non-zero value, return a non-zero value. */
1856 walk_globals (p
, f
, data
)
1857 walk_globals_pred p
;
1861 struct walk_globals_data wgd
;
1866 return walk_namespaces (walk_globals_r
, &wgd
);
1869 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1870 DATA is non-NULL, this is the last time we will call
1871 wrapup_global_declarations for this NAMESPACE. */
1874 wrapup_globals_for_namespace (namespace, data
)
1878 tree globals
= cp_namespace_decls (namespace);
1879 int len
= list_length (globals
);
1880 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1884 int last_time
= (data
!= 0);
1886 if (last_time
&& namespace == global_namespace
)
1887 /* Let compile_file handle the global namespace. */
1890 /* Process the decls in reverse order--earliest first.
1891 Put them into VEC from back to front, then take out from front. */
1892 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1893 vec
[len
- i
- 1] = decl
;
1897 check_global_declarations (vec
, len
);
1901 /* Temporarily mark vtables as external. That prevents
1902 wrapup_global_declarations from writing them out; we must process
1903 them ourselves in finish_vtable_vardecl. */
1904 for (i
= 0; i
< len
; ++i
)
1905 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1907 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1908 DECL_EXTERNAL (vec
[i
]) = 1;
1911 /* Write out any globals that need to be output. */
1912 result
= wrapup_global_declarations (vec
, len
);
1914 /* Undo the hack to DECL_EXTERNAL above. */
1915 for (i
= 0; i
< len
; ++i
)
1916 if (vtable_decl_p (vec
[i
], /*data=*/0)
1917 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1919 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1920 DECL_EXTERNAL (vec
[i
]) = 0;
1927 /* Mark ARG (which is really a struct binding_level **) for GC. */
1930 mark_binding_level (arg
)
1933 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1935 for (; lvl
; lvl
= lvl
->level_chain
)
1937 ggc_mark_tree (lvl
->names
);
1938 ggc_mark_tree (lvl
->tags
);
1939 ggc_mark_tree (lvl
->usings
);
1940 ggc_mark_tree (lvl
->using_directives
);
1941 ggc_mark_tree (lvl
->class_shadowed
);
1942 ggc_mark_tree (lvl
->type_shadowed
);
1943 ggc_mark_tree (lvl
->shadowed_labels
);
1944 ggc_mark_tree (lvl
->blocks
);
1945 ggc_mark_tree (lvl
->this_class
);
1946 ggc_mark_tree (lvl
->incomplete
);
1947 ggc_mark_tree (lvl
->dead_vars_from_for
);
1952 mark_named_label_lists (labs
, uses
)
1956 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
1957 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
1959 for (; l
; l
= l
->next
)
1962 mark_binding_level (l
->binding_level
);
1963 ggc_mark_tree (l
->old_value
);
1964 ggc_mark_tree (l
->label_decl
);
1965 ggc_mark_tree (l
->bad_decls
);
1968 for (; u
; u
= u
->next
)
1972 /* For debugging. */
1973 static int no_print_functions
= 0;
1974 static int no_print_builtins
= 0;
1977 print_binding_level (lvl
)
1978 struct binding_level
*lvl
;
1982 fprintf (stderr
, " blocks=");
1983 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1984 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1985 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1986 if (lvl
->tag_transparent
)
1987 fprintf (stderr
, " tag-transparent");
1988 if (lvl
->more_cleanups_ok
)
1989 fprintf (stderr
, " more-cleanups-ok");
1990 if (lvl
->have_cleanups
)
1991 fprintf (stderr
, " have-cleanups");
1992 fprintf (stderr
, "\n");
1995 fprintf (stderr
, " names:\t");
1996 /* We can probably fit 3 names to a line? */
1997 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1999 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2001 if (no_print_builtins
2002 && (TREE_CODE (t
) == TYPE_DECL
)
2003 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2006 /* Function decls tend to have longer names. */
2007 if (TREE_CODE (t
) == FUNCTION_DECL
)
2014 fprintf (stderr
, "\n\t");
2017 print_node_brief (stderr
, "", t
, 0);
2018 if (t
== error_mark_node
)
2022 fprintf (stderr
, "\n");
2026 fprintf (stderr
, " tags:\t");
2028 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2030 if (TREE_PURPOSE (t
) == NULL_TREE
)
2032 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2039 fprintf (stderr
, "\n\t");
2042 if (TREE_PURPOSE (t
) == NULL_TREE
)
2044 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2045 fprintf (stderr
, ">");
2047 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2048 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2051 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2052 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2053 fprintf (stderr
, ">");
2057 fprintf (stderr
, "\n");
2059 if (lvl
->class_shadowed
)
2061 fprintf (stderr
, " class-shadowed:");
2062 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2064 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2066 fprintf (stderr
, "\n");
2068 if (lvl
->type_shadowed
)
2070 fprintf (stderr
, " type-shadowed:");
2071 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2073 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2075 fprintf (stderr
, "\n");
2080 print_other_binding_stack (stack
)
2081 struct binding_level
*stack
;
2083 struct binding_level
*level
;
2084 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2086 fprintf (stderr
, "binding level ");
2087 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2088 fprintf (stderr
, "\n");
2089 print_binding_level (level
);
2094 print_binding_stack ()
2096 struct binding_level
*b
;
2097 fprintf (stderr
, "current_binding_level=");
2098 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2099 fprintf (stderr
, "\nclass_binding_level=");
2100 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2101 fprintf (stderr
, "\nglobal_binding_level=");
2102 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2103 fprintf (stderr
, "\n");
2104 if (class_binding_level
)
2106 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2107 if (b
== current_binding_level
)
2110 b
= class_binding_level
;
2112 b
= current_binding_level
;
2115 b
= current_binding_level
;
2116 print_other_binding_stack (b
);
2117 fprintf (stderr
, "global:\n");
2118 print_binding_level (global_binding_level
);
2121 /* Namespace binding access routines: The namespace_bindings field of
2122 the identifier is polymorphic, with three possible values:
2123 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2124 indicating the BINDING_VALUE of global_namespace. */
2126 /* Check whether the a binding for the name to scope is known.
2127 Assumes that the bindings of the name are already a list
2128 of bindings. Returns the binding found, or NULL_TREE. */
2131 find_binding (name
, scope
)
2135 tree iter
, prev
= NULL_TREE
;
2137 scope
= ORIGINAL_NAMESPACE (scope
);
2139 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2140 iter
= TREE_CHAIN (iter
))
2142 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2143 if (BINDING_SCOPE (iter
) == scope
)
2145 /* Move binding found to the front of the list, so
2146 subsequent lookups will find it faster. */
2149 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2150 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2151 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2160 /* Always returns a binding for name in scope. If the
2161 namespace_bindings is not a list, convert it to one first.
2162 If no binding is found, make a new one. */
2165 binding_for_name (name
, scope
)
2169 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2172 scope
= ORIGINAL_NAMESPACE (scope
);
2174 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2176 /* Get rid of optimization for global scope. */
2177 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2178 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2179 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2181 if (b
&& (result
= find_binding (name
, scope
)))
2183 /* Not found, make a new one. */
2184 result
= make_node (CPLUS_BINDING
);
2185 TREE_CHAIN (result
) = b
;
2186 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2187 BINDING_SCOPE (result
) = scope
;
2188 BINDING_TYPE (result
) = NULL_TREE
;
2189 BINDING_VALUE (result
) = NULL_TREE
;
2193 /* Return the binding value for name in scope, considering that
2194 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2197 namespace_binding (name
, scope
)
2201 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2204 if (scope
== NULL_TREE
)
2205 scope
= global_namespace
;
2206 if (TREE_CODE (b
) != CPLUS_BINDING
)
2207 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2208 name
= find_binding (name
,scope
);
2209 if (name
== NULL_TREE
)
2211 return BINDING_VALUE (name
);
2214 /* Set the binding value for name in scope. If modifying the binding
2215 of global_namespace is attempted, try to optimize it. */
2218 set_namespace_binding (name
, scope
, val
)
2225 if (scope
== NULL_TREE
)
2226 scope
= global_namespace
;
2228 if (scope
== global_namespace
)
2230 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2231 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2233 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2237 b
= binding_for_name (name
, scope
);
2238 BINDING_VALUE (b
) = val
;
2241 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2242 select a name that is unique to this compilation unit. */
2245 push_namespace (name
)
2250 int implicit_use
= 0;
2252 if (!global_namespace
)
2254 /* This must be ::. */
2255 my_friendly_assert (name
== get_identifier ("::"), 377);
2260 /* The name of anonymous namespace is unique for the translation
2262 if (!anonymous_namespace_name
)
2263 anonymous_namespace_name
= get_file_function_name ('N');
2264 name
= anonymous_namespace_name
;
2265 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2267 /* Reopening anonymous namespace. */
2273 /* Check whether this is an extended namespace definition. */
2274 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2275 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2278 if (DECL_NAMESPACE_ALIAS (d
))
2280 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2281 d
, DECL_NAMESPACE_ALIAS (d
));
2282 d
= DECL_NAMESPACE_ALIAS (d
);
2289 /* Make a new namespace, binding the name to it. */
2290 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2291 /* The global namespace is not pushed, and the global binding
2292 level is set elsewhere. */
2295 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2298 declare_namespace_level ();
2299 NAMESPACE_LEVEL (d
) = current_binding_level
;
2303 resume_binding_level (NAMESPACE_LEVEL (d
));
2306 do_using_directive (d
);
2307 /* Enter the name space. */
2308 current_namespace
= d
;
2311 /* Pop from the scope of the current namespace. */
2316 my_friendly_assert (current_namespace
!= global_namespace
, 20010801);
2317 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2318 /* The binding level is not popped, as it might be re-opened later. */
2319 suspend_binding_level ();
2322 /* Push into the scope of the namespace NS, even if it is deeply
2323 nested within another namespace. */
2326 push_nested_namespace (ns
)
2329 if (ns
== global_namespace
)
2330 push_to_top_level ();
2333 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2334 push_namespace (DECL_NAME (ns
));
2338 /* Pop back from the scope of the namespace NS, which was previously
2339 entered with push_nested_namespace. */
2342 pop_nested_namespace (ns
)
2345 while (ns
!= global_namespace
)
2348 ns
= CP_DECL_CONTEXT (ns
);
2351 pop_from_top_level ();
2355 /* Subroutines for reverting temporarily to top-level for instantiation
2356 of templates and such. We actually need to clear out the class- and
2357 local-value slots of all identifiers, so that only the global values
2358 are at all visible. Simply setting current_binding_level to the global
2359 scope isn't enough, because more binding levels may be pushed. */
2360 struct saved_scope
*scope_chain
;
2362 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2365 mark_saved_scope (arg
)
2368 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2371 mark_binding_level (&t
->class_bindings
);
2372 ggc_mark_tree (t
->old_bindings
);
2373 ggc_mark_tree (t
->old_namespace
);
2374 ggc_mark_tree (t
->decl_ns_list
);
2375 ggc_mark_tree (t
->class_name
);
2376 ggc_mark_tree (t
->class_type
);
2377 ggc_mark_tree (t
->access_specifier
);
2378 ggc_mark_tree (t
->function_decl
);
2380 ggc_mark_tree_varray (t
->lang_base
);
2381 ggc_mark_tree (t
->lang_name
);
2382 ggc_mark_tree (t
->template_parms
);
2383 ggc_mark_tree (t
->x_previous_class_type
);
2384 ggc_mark_tree (t
->x_previous_class_values
);
2385 ggc_mark_tree (t
->x_saved_tree
);
2386 ggc_mark_tree (t
->incomplete
);
2387 ggc_mark_tree (t
->lookups
);
2389 mark_stmt_tree (&t
->x_stmt_tree
);
2390 mark_binding_level (&t
->bindings
);
2396 store_bindings (names
, old_bindings
)
2397 tree names
, old_bindings
;
2400 tree search_bindings
= old_bindings
;
2402 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2404 tree binding
, t1
, id
;
2406 if (TREE_CODE (t
) == TREE_LIST
)
2407 id
= TREE_PURPOSE (t
);
2412 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2413 we have no IDENTIFIER_BINDING if we have left the class
2414 scope, but cached the class-level declarations. */
2415 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2418 for (t1
= search_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2419 if (TREE_VEC_ELT (t1
, 0) == id
)
2422 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2423 binding
= make_tree_vec (4);
2424 TREE_VEC_ELT (binding
, 0) = id
;
2425 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2426 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2427 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2428 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2429 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2430 TREE_CHAIN (binding
) = old_bindings
;
2431 old_bindings
= binding
;
2435 return old_bindings
;
2439 maybe_push_to_top_level (pseudo
)
2442 struct saved_scope
*s
;
2443 struct binding_level
*b
;
2447 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2449 b
= scope_chain
? current_binding_level
: 0;
2451 /* If we're in the middle of some function, save our state. */
2455 push_function_context_to (NULL_TREE
);
2460 old_bindings
= NULL_TREE
;
2461 if (scope_chain
&& previous_class_type
)
2462 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2464 /* Have to include global_binding_level, because class-level decls
2465 aren't listed anywhere useful. */
2466 for (; b
; b
= b
->level_chain
)
2470 /* Template IDs are inserted into the global level. If they were
2471 inserted into namespace level, finish_file wouldn't find them
2472 when doing pending instantiations. Therefore, don't stop at
2473 namespace level, but continue until :: . */
2474 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2477 old_bindings
= store_bindings (b
->names
, old_bindings
);
2478 /* We also need to check class_shadowed to save class-level type
2479 bindings, since pushclass doesn't fill in b->names. */
2480 if (b
->parm_flag
== 2)
2481 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2483 /* Unwind type-value slots back to top level. */
2484 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2485 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2487 s
->prev
= scope_chain
;
2488 s
->old_bindings
= old_bindings
;
2490 s
->need_pop_function_context
= need_pop
;
2491 s
->function_decl
= current_function_decl
;
2494 current_function_decl
= NULL_TREE
;
2495 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2496 current_lang_name
= lang_name_cplusplus
;
2497 current_namespace
= global_namespace
;
2501 push_to_top_level ()
2503 maybe_push_to_top_level (0);
2507 pop_from_top_level ()
2509 struct saved_scope
*s
= scope_chain
;
2512 /* Clear out class-level bindings cache. */
2513 if (previous_class_type
)
2514 invalidate_class_lookup_cache ();
2516 VARRAY_FREE (current_lang_base
);
2518 scope_chain
= s
->prev
;
2519 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2521 tree id
= TREE_VEC_ELT (t
, 0);
2523 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2524 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2525 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2528 /* If we were in the middle of compiling a function, restore our
2530 if (s
->need_pop_function_context
)
2531 pop_function_context_from (NULL_TREE
);
2532 current_function_decl
= s
->function_decl
;
2537 /* Push a definition of struct, union or enum tag "name".
2538 into binding_level "b". "type" should be the type node,
2539 We assume that the tag "name" is not already defined.
2541 Note that the definition may really be just a forward reference.
2542 In that case, the TYPE_SIZE will be a NULL_TREE.
2544 C++ gratuitously puts all these tags in the name space. */
2546 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2547 record the shadowed value for this binding contour. TYPE is
2548 the type that ID maps to. */
2551 set_identifier_type_value_with_scope (id
, type
, b
)
2554 struct binding_level
*b
;
2556 if (!b
->namespace_p
)
2558 /* Shadow the marker, not the real thing, so that the marker
2559 gets restored later. */
2560 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2562 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2566 tree binding
= binding_for_name (id
, current_namespace
);
2567 BINDING_TYPE (binding
) = type
;
2568 /* Store marker instead of real type. */
2569 type
= global_type_node
;
2571 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2574 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2577 set_identifier_type_value (id
, type
)
2581 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2584 /* Return the type associated with id. */
2587 identifier_type_value (id
)
2590 /* There is no type with that name, anywhere. */
2591 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2593 /* This is not the type marker, but the real thing. */
2594 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2595 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2596 /* Have to search for it. It must be on the global level, now.
2597 Ask lookup_name not to return non-types. */
2598 id
= lookup_name_real (id
, 2, 1, 0);
2600 return TREE_TYPE (id
);
2604 /* Pop off extraneous binding levels left over due to syntax errors.
2606 We don't pop past namespaces, as they might be valid. */
2611 #ifdef DEBUG_CP_BINDING_LEVELS
2612 fprintf (stderr
, "XXX entering pop_everything ()\n");
2614 while (!toplevel_bindings_p ())
2616 if (current_binding_level
->parm_flag
== 2)
2617 pop_nested_class ();
2621 #ifdef DEBUG_CP_BINDING_LEVELS
2622 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2626 /* The type TYPE is being declared. If it is a class template, or a
2627 specialization of a class template, do any processing required and
2628 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2629 being declared a friend. B is the binding level at which this TYPE
2632 Returns the TYPE_DECL for TYPE, which may have been altered by this
2636 maybe_process_template_type_declaration (type
, globalize
, b
)
2639 struct binding_level
* b
;
2641 tree decl
= TYPE_NAME (type
);
2643 if (processing_template_parmlist
)
2644 /* You can't declare a new template type in a template parameter
2645 list. But, you can declare a non-template type:
2647 template <class A*> struct S;
2649 is a forward-declaration of `A'. */
2653 maybe_check_template_type (type
);
2655 my_friendly_assert (IS_AGGR_TYPE (type
)
2656 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2659 if (processing_template_decl
)
2661 /* This may change after the call to
2662 push_template_decl_real, but we want the original value. */
2663 tree name
= DECL_NAME (decl
);
2665 decl
= push_template_decl_real (decl
, globalize
);
2666 /* If the current binding level is the binding level for the
2667 template parameters (see the comment in
2668 begin_template_parm_list) and the enclosing level is a class
2669 scope, and we're not looking at a friend, push the
2670 declaration of the member class into the class scope. In the
2671 friend case, push_template_decl will already have put the
2672 friend into global scope, if appropriate. */
2673 if (TREE_CODE (type
) != ENUMERAL_TYPE
2674 && !globalize
&& b
->template_parms_p
2675 && b
->level_chain
->parm_flag
== 2)
2677 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2678 /* Put this tag on the list of tags for the class, since
2679 that won't happen below because B is not the class
2680 binding level, but is instead the pseudo-global level. */
2681 b
->level_chain
->tags
=
2682 tree_cons (name
, type
, b
->level_chain
->tags
);
2683 if (!COMPLETE_TYPE_P (current_class_type
))
2684 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2692 /* In C++, you don't have to write `struct S' to refer to `S'; you
2693 can just use `S'. We accomplish this by creating a TYPE_DECL as
2694 if the user had written `typedef struct S S'. Create and return
2695 the TYPE_DECL for TYPE. */
2698 create_implicit_typedef (name
, type
)
2704 decl
= build_decl (TYPE_DECL
, name
, type
);
2705 DECL_ARTIFICIAL (decl
) = 1;
2706 /* There are other implicit type declarations, like the one *within*
2707 a class that allows you to write `S::S'. We must distinguish
2709 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2710 TYPE_NAME (type
) = decl
;
2715 /* Remember a local name for name-mangling purposes. */
2718 push_local_name (decl
)
2725 VARRAY_TREE_INIT (local_names
, 8, "local_names");
2727 name
= DECL_NAME (decl
);
2729 nelts
= VARRAY_ACTIVE_SIZE (local_names
);
2730 for (i
= 0; i
< nelts
; i
++)
2732 t
= VARRAY_TREE (local_names
, i
);
2733 if (DECL_NAME (t
) == name
)
2735 if (!DECL_LANG_SPECIFIC (decl
))
2736 retrofit_lang_decl (decl
);
2737 if (DECL_LANG_SPECIFIC (t
))
2738 DECL_DISCRIMINATOR (decl
) = DECL_DISCRIMINATOR (t
) + 1;
2740 DECL_DISCRIMINATOR (decl
) = 1;
2742 VARRAY_TREE (local_names
, i
) = decl
;
2747 VARRAY_PUSH_TREE (local_names
, decl
);
2750 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2751 Normally put it into the inner-most non-tag-transparent scope,
2752 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2753 The latter is needed for implicit declarations. */
2756 pushtag (name
, type
, globalize
)
2760 register struct binding_level
*b
;
2762 b
= current_binding_level
;
2763 while (b
->tag_transparent
2764 || (b
->parm_flag
== 2
2766 /* We may be defining a new type in the initializer
2767 of a static member variable. We allow this when
2768 not pedantic, and it is particularly useful for
2769 type punning via an anonymous union. */
2770 || COMPLETE_TYPE_P (b
->this_class
))))
2773 b
->tags
= tree_cons (name
, type
, b
->tags
);
2777 /* Do C++ gratuitous typedefing. */
2778 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2780 register tree d
= NULL_TREE
;
2782 tree context
= TYPE_CONTEXT (type
);
2786 tree cs
= current_scope ();
2790 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2791 /* When declaring a friend class of a local class, we want
2792 to inject the newly named class into the scope
2793 containing the local class, not the namespace scope. */
2794 context
= decl_function_context (get_type_decl (cs
));
2797 context
= current_namespace
;
2799 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2800 || b
->parm_flag
== 2)
2803 if (current_lang_name
== lang_name_java
)
2804 TYPE_FOR_JAVA (type
) = 1;
2806 d
= create_implicit_typedef (name
, type
);
2807 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2809 set_identifier_type_value_with_scope (name
, type
, b
);
2811 d
= maybe_process_template_type_declaration (type
,
2814 if (b
->parm_flag
== 2)
2816 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2817 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2818 class. But if it's a member template class, we
2819 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2821 finish_member_declaration (d
);
2823 pushdecl_class_level (d
);
2826 d
= pushdecl_with_scope (d
, b
);
2828 /* FIXME what if it gets a name from typedef? */
2829 if (ANON_AGGRNAME_P (name
))
2830 DECL_IGNORED_P (d
) = 1;
2832 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2834 /* If this is a local class, keep track of it. We need this
2835 information for name-mangling, and so that it is possible to find
2836 all function definitions in a translation unit in a convenient
2837 way. (It's otherwise tricky to find a member function definition
2838 it's only pointed to from within a local class.) */
2839 if (TYPE_CONTEXT (type
)
2840 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2841 && !processing_template_decl
)
2842 VARRAY_PUSH_TREE (local_classes
, type
);
2844 if (b
->parm_flag
== 2)
2846 if (!COMPLETE_TYPE_P (current_class_type
))
2847 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2851 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2852 /* Use the canonical TYPE_DECL for this node. */
2853 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2856 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2857 will be the tagged type we just added to the current
2858 binding level. This fake NULL-named TYPE_DECL node helps
2859 dwarfout.c to know when it needs to output a
2860 representation of a tagged type, and it also gives us a
2861 convenient place to record the "scope start" address for
2864 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2865 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2869 /* Counter used to create anonymous type names. */
2871 static int anon_cnt
= 0;
2873 /* Return an IDENTIFIER which can be used as a name for
2874 anonymous structs and unions. */
2881 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2882 return get_identifier (buf
);
2885 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2886 This keeps dbxout from getting confused. */
2891 register struct binding_level
*b
;
2893 static int last_cnt
= 0;
2895 /* Fast out if no new anon names were declared. */
2896 if (last_cnt
== anon_cnt
)
2899 b
= current_binding_level
;
2900 while (b
->tag_transparent
)
2905 /* A NULL purpose means we have already processed all tags
2906 from here to the end of the list. */
2907 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2909 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2910 TREE_PURPOSE (tags
) = NULL_TREE
;
2911 tags
= TREE_CHAIN (tags
);
2913 last_cnt
= anon_cnt
;
2916 /* Subroutine of duplicate_decls: return truthvalue of whether
2917 or not types of these decls match.
2919 For C++, we must compare the parameter list so that `int' can match
2920 `int&' in a parameter position, but `int&' is not confused with
2924 decls_match (newdecl
, olddecl
)
2925 tree newdecl
, olddecl
;
2929 if (newdecl
== olddecl
)
2932 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2933 /* If the two DECLs are not even the same kind of thing, we're not
2934 interested in their types. */
2937 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2939 tree f1
= TREE_TYPE (newdecl
);
2940 tree f2
= TREE_TYPE (olddecl
);
2941 tree p1
= TYPE_ARG_TYPES (f1
);
2942 tree p2
= TYPE_ARG_TYPES (f2
);
2944 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2945 && ! (DECL_EXTERN_C_P (newdecl
)
2946 && DECL_EXTERN_C_P (olddecl
)))
2949 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2952 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2954 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
2955 && (DECL_BUILT_IN (olddecl
)
2956 #ifndef NO_IMPLICIT_EXTERN_C
2957 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
2958 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
2962 types_match
= self_promoting_args_p (p1
);
2963 if (p1
== void_list_node
)
2964 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2966 #ifndef NO_IMPLICIT_EXTERN_C
2967 else if (p1
== NULL_TREE
2968 && (DECL_EXTERN_C_P (olddecl
)
2969 && DECL_IN_SYSTEM_HEADER (olddecl
)
2970 && !DECL_CLASS_SCOPE_P (olddecl
))
2971 && (DECL_EXTERN_C_P (newdecl
)
2972 && DECL_IN_SYSTEM_HEADER (newdecl
)
2973 && !DECL_CLASS_SCOPE_P (newdecl
)))
2975 types_match
= self_promoting_args_p (p2
);
2976 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2980 types_match
= compparms (p1
, p2
);
2985 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2987 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2988 DECL_TEMPLATE_PARMS (olddecl
)))
2991 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
2992 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
2995 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2998 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2999 DECL_TEMPLATE_RESULT (newdecl
));
3003 if (TREE_TYPE (newdecl
) == error_mark_node
)
3004 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3005 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3006 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3007 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3010 types_match
= comptypes (TREE_TYPE (newdecl
),
3011 TREE_TYPE (olddecl
),
3012 COMPARE_REDECLARATION
);
3018 /* If NEWDECL is `static' and an `extern' was seen previously,
3019 warn about it. OLDDECL is the previous declaration.
3021 Note that this does not apply to the C++ case of declaring
3022 a variable `extern const' and then later `const'.
3024 Don't complain about built-in functions, since they are beyond
3025 the user's control. */
3028 warn_extern_redeclared_static (newdecl
, olddecl
)
3029 tree newdecl
, olddecl
;
3031 static const char *const explicit_extern_static_warning
3032 = "`%D' was declared `extern' and later `static'";
3033 static const char *const implicit_extern_static_warning
3034 = "`%D' was declared implicitly `extern' and later `static'";
3038 if (TREE_CODE (newdecl
) == TYPE_DECL
3039 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3040 || TREE_CODE (newdecl
) == CONST_DECL
)
3043 /* Don't get confused by static member functions; that's a different
3045 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3046 && DECL_STATIC_FUNCTION_P (newdecl
))
3049 /* If the old declaration was `static', or the new one isn't, then
3050 then everything is OK. */
3051 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3054 /* It's OK to declare a builtin function as `static'. */
3055 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3056 && DECL_ARTIFICIAL (olddecl
))
3059 name
= DECL_ASSEMBLER_NAME (newdecl
);
3060 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3061 ? implicit_extern_static_warning
3062 : explicit_extern_static_warning
, newdecl
);
3063 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3066 /* Handle when a new declaration NEWDECL has the same name as an old
3067 one OLDDECL in the same binding contour. Prints an error message
3070 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3071 Otherwise, return 0. */
3074 duplicate_decls (newdecl
, olddecl
)
3075 tree newdecl
, olddecl
;
3077 unsigned olddecl_uid
= DECL_UID (olddecl
);
3078 int olddecl_friend
= 0, types_match
= 0;
3079 int new_defines_function
= 0;
3081 if (newdecl
== olddecl
)
3084 types_match
= decls_match (newdecl
, olddecl
);
3086 /* If either the type of the new decl or the type of the old decl is an
3087 error_mark_node, then that implies that we have already issued an
3088 error (earlier) for some bogus type specification, and in that case,
3089 it is rather pointless to harass the user with yet more error message
3090 about the same declaration, so just pretend the types match here. */
3091 if (TREE_TYPE (newdecl
) == error_mark_node
3092 || TREE_TYPE (olddecl
) == error_mark_node
)
3095 /* Check for redeclaration and other discrepancies. */
3096 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3097 && DECL_ARTIFICIAL (olddecl
))
3099 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3101 /* If you declare a built-in or predefined function name as static,
3102 the old definition is overridden, but optionally warn this was a
3103 bad choice of name. */
3104 if (! TREE_PUBLIC (newdecl
))
3107 cp_warning ("shadowing %s function `%#D'",
3108 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3110 /* Discard the old built-in function. */
3113 /* If the built-in is not ansi, then programs can override
3114 it even globally without an error. */
3115 else if (! DECL_BUILT_IN (olddecl
))
3116 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3120 cp_error ("declaration of `%#D'", newdecl
);
3121 cp_error ("conflicts with built-in declaration `%#D'",
3126 else if (!types_match
)
3128 if ((DECL_EXTERN_C_P (newdecl
)
3129 && DECL_EXTERN_C_P (olddecl
))
3130 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3131 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3133 /* A near match; override the builtin. */
3135 if (TREE_PUBLIC (newdecl
))
3137 cp_warning ("new declaration `%#D'", newdecl
);
3138 cp_warning ("ambiguates built-in declaration `%#D'",
3141 else if (warn_shadow
)
3142 cp_warning ("shadowing %s function `%#D'",
3143 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3147 /* Discard the old built-in function. */
3151 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3153 /* If a builtin function is redeclared as `static', merge
3154 the declarations, but make the original one static. */
3155 DECL_THIS_STATIC (olddecl
) = 1;
3156 TREE_PUBLIC (olddecl
) = 0;
3158 /* Make the old declaration consistent with the new one so
3159 that all remnants of the builtin-ness of this function
3160 will be banished. */
3161 SET_DECL_LANGUAGE (olddecl
, DECL_LANGUAGE (newdecl
));
3162 SET_DECL_RTL (olddecl
, DECL_RTL (newdecl
));
3163 COPY_DECL_ASSEMBLER_NAME (olddecl
, newdecl
);
3164 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3168 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3170 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3171 && TREE_CODE (newdecl
) != TYPE_DECL
3172 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3173 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3174 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3175 && TREE_CODE (olddecl
) != TYPE_DECL
3176 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3177 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3180 /* We do nothing special here, because C++ does such nasty
3181 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3182 get shadowed, and know that if we need to find a TYPE_DECL
3183 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3184 slot of the identifier. */
3188 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3189 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3190 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3191 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3194 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3195 if (TREE_CODE (olddecl
) == TREE_LIST
)
3196 olddecl
= TREE_VALUE (olddecl
);
3197 cp_error_at ("previous declaration of `%#D'", olddecl
);
3199 /* New decl is completely inconsistent with the old one =>
3200 tell caller to replace the old one. */
3204 else if (!types_match
)
3206 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3207 /* These are certainly not duplicate declarations; they're
3208 from different scopes. */
3211 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3213 /* The name of a class template may not be declared to refer to
3214 any other template, class, function, object, namespace, value,
3215 or type in the same scope. */
3216 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3217 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3219 cp_error ("declaration of template `%#D'", newdecl
);
3220 cp_error_at ("conflicts with previous declaration `%#D'",
3223 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3224 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3225 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3226 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3227 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3228 DECL_TEMPLATE_PARMS (olddecl
)))
3230 cp_error ("new declaration `%#D'", newdecl
);
3231 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3235 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3237 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3239 cp_error ("declaration of C function `%#D' conflicts with",
3241 cp_error_at ("previous declaration `%#D' here", olddecl
);
3243 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3244 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3246 cp_error ("new declaration `%#D'", newdecl
);
3247 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3253 /* Already complained about this, so don't do so again. */
3254 else if (current_class_type
== NULL_TREE
3255 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3257 cp_error ("conflicting types for `%#D'", newdecl
);
3258 cp_error_at ("previous declaration as `%#D'", olddecl
);
3261 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3262 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3263 && (!DECL_TEMPLATE_INFO (newdecl
)
3264 || (DECL_TI_TEMPLATE (newdecl
)
3265 != DECL_TI_TEMPLATE (olddecl
))))
3266 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3267 && (!DECL_TEMPLATE_INFO (olddecl
)
3268 || (DECL_TI_TEMPLATE (olddecl
)
3269 != DECL_TI_TEMPLATE (newdecl
))))))
3270 /* It's OK to have a template specialization and a non-template
3271 with the same type, or to have specializations of two
3272 different templates with the same type. Note that if one is a
3273 specialization, and the other is an instantiation of the same
3274 template, that we do not exit at this point. That situation
3275 can occur if we instantiate a template class, and then
3276 specialize one of its methods. This situation is legal, but
3277 the declarations must be merged in the usual way. */
3279 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3280 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3281 && !DECL_USE_TEMPLATE (newdecl
))
3282 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3283 && !DECL_USE_TEMPLATE (olddecl
))))
3284 /* One of the declarations is a template instantiation, and the
3285 other is not a template at all. That's OK. */
3287 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3288 && DECL_NAMESPACE_ALIAS (newdecl
)
3289 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3290 /* Redeclaration of namespace alias, ignore it. */
3294 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3297 cp_error (errmsg
, newdecl
);
3298 if (DECL_NAME (olddecl
) != NULL_TREE
)
3299 cp_error_at ((DECL_INITIAL (olddecl
)
3300 && namespace_bindings_p ())
3301 ? "`%#D' previously defined here"
3302 : "`%#D' previously declared here", olddecl
);
3304 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3305 && DECL_INITIAL (olddecl
) != NULL_TREE
3306 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3307 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3309 /* Prototype decl follows defn w/o prototype. */
3310 cp_warning_at ("prototype for `%#D'", newdecl
);
3311 cp_warning_at ("follows non-prototype definition here", olddecl
);
3313 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3314 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3316 /* extern "C" int foo ();
3317 int foo () { bar (); }
3319 if (current_lang_depth () == 0)
3320 SET_DECL_LANGUAGE (newdecl
, DECL_LANGUAGE (olddecl
));
3323 cp_error_at ("previous declaration of `%#D' with %L linkage",
3324 olddecl
, DECL_LANGUAGE (olddecl
));
3325 cp_error ("conflicts with new declaration with %L linkage",
3326 DECL_LANGUAGE (newdecl
));
3330 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3332 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3334 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3335 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3338 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3339 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3341 for (; t1
&& t1
!= void_list_node
;
3342 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3343 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3345 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3350 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3352 cp_pedwarn_at ("after previous specification in `%#D'",
3358 cp_error ("default argument given for parameter %d of `%#D'",
3360 cp_error_at ("after previous specification in `%#D'",
3365 if (DECL_DECLARED_INLINE_P (newdecl
)
3366 && ! DECL_DECLARED_INLINE_P (olddecl
)
3367 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3369 cp_warning ("`%#D' was used before it was declared inline",
3371 cp_warning_at ("previous non-inline declaration here",
3377 /* If new decl is `static' and an `extern' was seen previously,
3379 warn_extern_redeclared_static (newdecl
, olddecl
);
3381 /* We have committed to returning 1 at this point. */
3382 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3384 /* Now that functions must hold information normally held
3385 by field decls, there is extra work to do so that
3386 declaration information does not get destroyed during
3388 if (DECL_VINDEX (olddecl
))
3389 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3390 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3391 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3392 if (DECL_CONTEXT (olddecl
))
3393 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3394 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3395 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3396 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3397 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3398 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3399 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3400 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3401 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3402 if (DECL_OVERLOADED_OPERATOR_P (olddecl
) != ERROR_MARK
)
3403 SET_OVERLOADED_OPERATOR_CODE
3404 (newdecl
, DECL_OVERLOADED_OPERATOR_P (olddecl
));
3405 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3407 /* Optionally warn about more than one declaration for the same
3408 name, but don't warn about a function declaration followed by a
3410 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3411 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3412 /* Don't warn about extern decl followed by definition. */
3413 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3414 /* Don't warn about friends, let add_friend take care of it. */
3415 && ! (DECL_FRIEND_P (newdecl
) || DECL_FRIEND_P (olddecl
)))
3417 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3418 cp_warning_at ("previous declaration of `%D'", olddecl
);
3422 /* Deal with C++: must preserve virtual function table size. */
3423 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3425 register tree newtype
= TREE_TYPE (newdecl
);
3426 register tree oldtype
= TREE_TYPE (olddecl
);
3428 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3429 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3431 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3432 CLASSTYPE_FRIEND_CLASSES (newtype
)
3433 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3436 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3439 /* Copy all the DECL_... slots specified in the new decl
3440 except for any that we copy here from the old type. */
3441 DECL_ATTRIBUTES (newdecl
)
3442 = (*targetm
.merge_decl_attributes
) (olddecl
, newdecl
);
3444 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3446 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3447 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3448 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3449 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3451 /* If the new declaration is a definition, update the file and
3452 line information on the declaration. */
3453 if (DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)) == NULL_TREE
3454 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
)) != NULL_TREE
)
3456 DECL_SOURCE_LINE (olddecl
)
3457 = DECL_SOURCE_LINE (DECL_TEMPLATE_RESULT (olddecl
))
3458 = DECL_SOURCE_LINE (newdecl
);
3459 DECL_SOURCE_FILE (olddecl
)
3460 = DECL_SOURCE_FILE (DECL_TEMPLATE_RESULT (olddecl
))
3461 = DECL_SOURCE_FILE (newdecl
);
3469 /* Automatically handles default parameters. */
3470 tree oldtype
= TREE_TYPE (olddecl
);
3473 /* Merge the data types specified in the two decls. */
3474 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3476 /* If common_type produces a non-typedef type, just use the old type. */
3477 if (TREE_CODE (newdecl
) == TYPE_DECL
3478 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3481 if (TREE_CODE (newdecl
) == VAR_DECL
)
3482 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3483 /* Do this after calling `common_type' so that default
3484 parameters don't confuse us. */
3485 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3486 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3487 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3489 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3490 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3491 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3492 TYPE_RAISES_EXCEPTIONS (oldtype
));
3494 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3495 && DECL_SOURCE_LINE (olddecl
) != 0
3497 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3498 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3500 cp_error ("declaration of `%F' throws different exceptions",
3502 cp_error_at ("than previous declaration `%F'", olddecl
);
3505 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3507 /* Lay the type out, unless already done. */
3508 if (! same_type_p (newtype
, oldtype
)
3509 && TREE_TYPE (newdecl
) != error_mark_node
3510 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3511 layout_type (TREE_TYPE (newdecl
));
3513 if ((TREE_CODE (newdecl
) == VAR_DECL
3514 || TREE_CODE (newdecl
) == PARM_DECL
3515 || TREE_CODE (newdecl
) == RESULT_DECL
3516 || TREE_CODE (newdecl
) == FIELD_DECL
3517 || TREE_CODE (newdecl
) == TYPE_DECL
)
3518 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3519 layout_decl (newdecl
, 0);
3521 /* Merge the type qualifiers. */
3522 if (TREE_READONLY (newdecl
))
3523 TREE_READONLY (olddecl
) = 1;
3524 if (TREE_THIS_VOLATILE (newdecl
))
3525 TREE_THIS_VOLATILE (olddecl
) = 1;
3527 /* Merge the initialization information. */
3528 if (DECL_INITIAL (newdecl
) == NULL_TREE
3529 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3531 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3532 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3533 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3534 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3535 && DECL_LANG_SPECIFIC (newdecl
)
3536 && DECL_LANG_SPECIFIC (olddecl
))
3537 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3540 /* Merge the section attribute.
3541 We want to issue an error if the sections conflict but that must be
3542 done later in decl_attributes since we are called before attributes
3544 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3545 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3547 /* Keep the old rtl since we can safely use it. */
3548 COPY_DECL_RTL (olddecl
, newdecl
);
3550 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3552 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3553 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3554 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3555 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3556 DECL_NO_LIMIT_STACK (newdecl
)
3557 |= DECL_NO_LIMIT_STACK (olddecl
);
3560 /* If cannot merge, then use the new type and qualifiers,
3561 and don't preserve the old rtl. */
3564 /* Clean out any memory we had of the old declaration. */
3565 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3567 TREE_VALUE (oldstatic
) = error_mark_node
;
3569 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3570 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3571 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3572 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3575 /* Merge the storage class information. */
3576 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3577 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3578 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3579 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3580 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3581 if (! DECL_EXTERNAL (olddecl
))
3582 DECL_EXTERNAL (newdecl
) = 0;
3584 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3586 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3587 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3588 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3589 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3590 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3591 /* Don't really know how much of the language-specific
3592 values we should copy from old to new. */
3593 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3594 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3595 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3596 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3597 DECL_INITIALIZED_IN_CLASS_P (newdecl
)
3598 |= DECL_INITIALIZED_IN_CLASS_P (olddecl
);
3599 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3601 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3602 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3603 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3604 DECL_BEFRIENDING_CLASSES (newdecl
)
3605 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3606 DECL_BEFRIENDING_CLASSES (olddecl
));
3609 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3611 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3612 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3614 /* If newdecl is not a specialization, then it is not a
3615 template-related function at all. And that means that we
3616 shoud have exited above, returning 0. */
3617 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3620 if (TREE_USED (olddecl
))
3621 /* From [temp.expl.spec]:
3623 If a template, a member template or the member of a class
3624 template is explicitly specialized then that
3625 specialization shall be declared before the first use of
3626 that specialization that would cause an implicit
3627 instantiation to take place, in every translation unit in
3628 which such a use occurs. */
3629 cp_error ("explicit specialization of %D after first use",
3632 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3634 DECL_DECLARED_INLINE_P (newdecl
) |= DECL_DECLARED_INLINE_P (olddecl
);
3636 /* If either decl says `inline', this fn is inline, unless its
3637 definition was passed already. */
3638 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3639 DECL_INLINE (olddecl
) = 1;
3640 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3642 /* Preserve abstractness on cloned [cd]tors. */
3643 DECL_ABSTRACT (newdecl
) = DECL_ABSTRACT (olddecl
);
3647 SET_DECL_LANGUAGE (olddecl
, DECL_LANGUAGE (newdecl
));
3648 COPY_DECL_ASSEMBLER_NAME (newdecl
, olddecl
);
3649 SET_DECL_RTL (olddecl
, DECL_RTL (newdecl
));
3651 if (! types_match
|| new_defines_function
)
3653 /* These need to be copied so that the names are available.
3654 Note that if the types do match, we'll preserve inline
3655 info and other bits, but if not, we won't. */
3656 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3657 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3659 if (new_defines_function
)
3660 /* If defining a function declared with other language
3661 linkage, use the previously declared language linkage. */
3662 SET_DECL_LANGUAGE (newdecl
, DECL_LANGUAGE (olddecl
));
3663 else if (types_match
)
3665 /* If redeclaring a builtin function, and not a definition,
3666 it stays built in. */
3667 if (DECL_BUILT_IN (olddecl
))
3669 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3670 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3671 /* If we're keeping the built-in definition, keep the rtl,
3672 regardless of declaration matches. */
3673 SET_DECL_RTL (newdecl
, DECL_RTL (olddecl
));
3676 DECL_NUM_STMTS (newdecl
) = DECL_NUM_STMTS (olddecl
);
3678 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3679 /* Don't clear out the arguments if we're redefining a function. */
3680 if (DECL_ARGUMENTS (olddecl
))
3681 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3684 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3685 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3687 /* Now preserve various other info from the definition. */
3688 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3689 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3690 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3691 COPY_DECL_ASSEMBLER_NAME (olddecl
, newdecl
);
3693 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3697 function_size
= sizeof (struct tree_decl
);
3699 memcpy ((char *) olddecl
+ sizeof (struct tree_common
),
3700 (char *) newdecl
+ sizeof (struct tree_common
),
3701 function_size
- sizeof (struct tree_common
));
3703 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3705 /* If newdecl is a template instantiation, it is possible that
3706 the following sequence of events has occurred:
3708 o A friend function was declared in a class template. The
3709 class template was instantiated.
3711 o The instantiation of the friend declaration was
3712 recorded on the instantiation list, and is newdecl.
3714 o Later, however, instantiate_class_template called pushdecl
3715 on the newdecl to perform name injection. But, pushdecl in
3716 turn called duplicate_decls when it discovered that another
3717 declaration of a global function with the same name already
3720 o Here, in duplicate_decls, we decided to clobber newdecl.
3722 If we're going to do that, we'd better make sure that
3723 olddecl, and not newdecl, is on the list of
3724 instantiations so that if we try to do the instantiation
3725 again we won't get the clobbered declaration. */
3727 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3728 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3730 for (; decls
; decls
= TREE_CHAIN (decls
))
3731 if (TREE_VALUE (decls
) == newdecl
)
3732 TREE_VALUE (decls
) = olddecl
;
3737 memcpy ((char *) olddecl
+ sizeof (struct tree_common
),
3738 (char *) newdecl
+ sizeof (struct tree_common
),
3739 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3740 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3743 DECL_UID (olddecl
) = olddecl_uid
;
3745 DECL_FRIEND_P (olddecl
) = 1;
3747 /* NEWDECL contains the merged attribute lists.
3748 Update OLDDECL to be the same. */
3749 DECL_ATTRIBUTES (olddecl
) = DECL_ATTRIBUTES (newdecl
);
3754 /* Record a decl-node X as belonging to the current lexical scope.
3755 Check for errors (such as an incompatible declaration for the same
3756 name already seen in the same scope).
3758 Returns either X or an old decl for the same name.
3759 If an old decl is returned, it may have been smashed
3760 to agree with what X says. */
3768 int need_new_binding
;
3770 /* We shouldn't be calling pushdecl when we're generating RTL for a
3771 function that we already did semantic analysis on previously. */
3772 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3775 need_new_binding
= 1;
3777 if (DECL_TEMPLATE_PARM_P (x
))
3778 /* Template parameters have no context; they are not X::T even
3779 when declared within a class or namespace. */
3783 if (current_function_decl
&& x
!= current_function_decl
3784 /* A local declaration for a function doesn't constitute
3786 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3787 /* A local declaration for an `extern' variable is in the
3788 scope of the current namespace, not the current
3790 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3791 && !DECL_CONTEXT (x
))
3792 DECL_CONTEXT (x
) = current_function_decl
;
3794 /* If this is the declaration for a namespace-scope function,
3795 but the declaration itself is in a local scope, mark the
3797 if (TREE_CODE (x
) == FUNCTION_DECL
3798 && DECL_NAMESPACE_SCOPE_P (x
)
3799 && current_function_decl
3800 && x
!= current_function_decl
)
3801 DECL_LOCAL_FUNCTION_P (x
) = 1;
3804 name
= DECL_NAME (x
);
3807 int different_binding_level
= 0;
3809 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3810 name
= TREE_OPERAND (name
, 0);
3812 /* In case this decl was explicitly namespace-qualified, look it
3813 up in its namespace context. */
3814 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3815 && namespace_bindings_p ())
3816 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3818 t
= lookup_name_current_level (name
);
3820 /* [basic.link] If there is a visible declaration of an entity
3821 with linkage having the same name and type, ignoring entities
3822 declared outside the innermost enclosing namespace scope, the
3823 block scope declaration declares that same entity and
3824 receives the linkage of the previous declaration. */
3825 if (! t
&& current_function_decl
&& x
!= current_function_decl
3826 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3827 && DECL_EXTERNAL (x
))
3829 /* Look in block scope. */
3830 t
= IDENTIFIER_VALUE (name
);
3831 /* Or in the innermost namespace. */
3833 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3834 /* Does it have linkage? Note that if this isn't a DECL, it's an
3835 OVERLOAD, which is OK. */
3836 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3839 different_binding_level
= 1;
3842 /* If we are declaring a function, and the result of name-lookup
3843 was an OVERLOAD, look for an overloaded instance that is
3844 actually the same as the function we are declaring. (If
3845 there is one, we have to merge our declaration with the
3846 previous declaration.) */
3847 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3851 if (TREE_CODE (x
) == FUNCTION_DECL
)
3852 for (match
= t
; match
; match
= OVL_NEXT (match
))
3854 if (decls_match (OVL_CURRENT (match
), x
))
3858 /* Just choose one. */
3862 t
= OVL_CURRENT (match
);
3867 if (t
== error_mark_node
)
3869 /* error_mark_node is 0 for a while during initialization! */
3871 cp_error_at ("`%#D' used prior to declaration", x
);
3873 else if (t
!= NULL_TREE
)
3875 if (different_binding_level
)
3877 if (decls_match (x
, t
))
3878 /* The standard only says that the local extern
3879 inherits linkage from the previous decl; in
3880 particular, default args are not shared. It would
3881 be nice to propagate inlining info, though. FIXME. */
3882 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3884 else if (TREE_CODE (t
) == PARM_DECL
)
3886 if (DECL_CONTEXT (t
) == NULL_TREE
)
3887 /* This is probaby caused by too many errors, but calling
3888 abort will say that if errors have occurred. */
3891 /* Check for duplicate params. */
3892 if (duplicate_decls (x
, t
))
3895 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3896 || DECL_FUNCTION_TEMPLATE_P (x
))
3897 && is_overloaded_fn (t
))
3898 /* Don't do anything just yet. */;
3899 else if (t
== wchar_decl_node
)
3901 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3902 cp_pedwarn ("redeclaration of `wchar_t' as `%T'",
3905 /* Throw away the redeclaration. */
3908 else if (TREE_CODE (t
) != TREE_CODE (x
))
3910 if (duplicate_decls (x
, t
))
3913 else if (duplicate_decls (x
, t
))
3915 if (TREE_CODE (t
) == TYPE_DECL
)
3916 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3917 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3918 check_default_args (t
);
3922 else if (DECL_MAIN_P (x
))
3924 /* A redeclaration of main, but not a duplicate of the
3929 This function shall not be overloaded. */
3930 cp_error_at ("invalid redeclaration of `%D'", t
);
3931 cp_error ("as `%D'", x
);
3932 /* We don't try to push this declaration since that
3938 check_template_shadow (x
);
3940 /* If this is a function conjured up by the backend, massage it
3941 so it looks friendly. */
3942 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3944 retrofit_lang_decl (x
);
3945 SET_DECL_LANGUAGE (x
, lang_c
);
3948 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3950 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3953 if (!namespace_bindings_p ())
3954 /* We do not need to create a binding for this name;
3955 push_overloaded_decl will have already done so if
3957 need_new_binding
= 0;
3959 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3961 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3963 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3967 /* If declaring a type as a typedef, copy the type (unless we're
3968 at line 0), and install this TYPE_DECL as the new type's typedef
3969 name. See the extensive comment in ../c-decl.c (pushdecl). */
3970 if (TREE_CODE (x
) == TYPE_DECL
)
3972 tree type
= TREE_TYPE (x
);
3973 if (DECL_SOURCE_LINE (x
) == 0)
3975 if (TYPE_NAME (type
) == 0)
3976 TYPE_NAME (type
) = x
;
3978 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3979 /* We don't want to copy the type when all we're
3980 doing is making a TYPE_DECL for the purposes of
3982 && (!TYPE_NAME (type
)
3983 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3985 DECL_ORIGINAL_TYPE (x
) = type
;
3986 type
= build_type_copy (type
);
3987 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3988 TYPE_NAME (type
) = x
;
3989 TREE_TYPE (x
) = type
;
3992 if (type
!= error_mark_node
3994 && TYPE_IDENTIFIER (type
))
3995 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3996 current_binding_level
);
4000 /* Multiple external decls of the same identifier ought to match.
4002 We get warnings about inline functions where they are defined.
4003 We get warnings about other functions from push_overloaded_decl.
4005 Avoid duplicate warnings where they are used. */
4006 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4010 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4011 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4012 decl
= OVL_FUNCTION (decl
);
4014 if (decl
&& decl
!= error_mark_node
4015 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4016 /* If different sort of thing, we already gave an error. */
4017 && TREE_CODE (decl
) == TREE_CODE (x
)
4018 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4020 cp_pedwarn ("type mismatch with previous external decl", x
);
4021 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4025 /* This name is new in its binding level.
4026 Install the new declaration and return it. */
4027 if (namespace_bindings_p ())
4029 /* Install a global value. */
4031 /* If the first global decl has external linkage,
4032 warn if we later see static one. */
4033 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4034 TREE_PUBLIC (name
) = 1;
4036 /* Bind the name for the entity. */
4037 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4039 && (TREE_CODE (x
) == TYPE_DECL
4040 || TREE_CODE (x
) == VAR_DECL
4041 || TREE_CODE (x
) == NAMESPACE_DECL
4042 || TREE_CODE (x
) == CONST_DECL
4043 || TREE_CODE (x
) == TEMPLATE_DECL
))
4044 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
4046 /* Don't forget if the function was used via an implicit decl. */
4047 if (IDENTIFIER_IMPLICIT_DECL (name
)
4048 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4051 /* Don't forget if its address was taken in that way. */
4052 if (IDENTIFIER_IMPLICIT_DECL (name
)
4053 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4054 TREE_ADDRESSABLE (x
) = 1;
4056 /* Warn about mismatches against previous implicit decl. */
4057 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4058 /* If this real decl matches the implicit, don't complain. */
4059 && ! (TREE_CODE (x
) == FUNCTION_DECL
4060 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4062 ("`%D' was previously implicitly declared to return `int'", x
);
4064 /* If new decl is `static' and an `extern' was seen previously,
4066 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4067 warn_extern_redeclared_static (x
, t
);
4071 /* Here to install a non-global value. */
4072 tree oldlocal
= IDENTIFIER_VALUE (name
);
4073 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4075 if (need_new_binding
)
4077 push_local_binding (name
, x
, 0);
4078 /* Because push_local_binding will hook X on to the
4079 current_binding_level's name list, we don't want to
4080 do that again below. */
4081 need_new_binding
= 0;
4084 /* If this is a TYPE_DECL, push it into the type value slot. */
4085 if (TREE_CODE (x
) == TYPE_DECL
)
4086 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4087 current_binding_level
);
4089 /* Clear out any TYPE_DECL shadowed by a namespace so that
4090 we won't think this is a type. The C struct hack doesn't
4091 go through namespaces. */
4092 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4093 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4094 current_binding_level
);
4101 && TREE_CODE (oldlocal
) == VAR_DECL
4102 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4103 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4105 if (oldlocal
== NULL_TREE
)
4106 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4109 /* If this is an extern function declaration, see if we
4110 have a global definition or declaration for the function. */
4111 if (oldlocal
== NULL_TREE
4112 && DECL_EXTERNAL (x
)
4113 && oldglobal
!= NULL_TREE
4114 && TREE_CODE (x
) == FUNCTION_DECL
4115 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4117 /* We have one. Their types must agree. */
4118 if (decls_match (x
, oldglobal
))
4122 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4123 cp_warning_at ("global declaration `%#D'", oldglobal
);
4126 /* If we have a local external declaration,
4127 and no file-scope declaration has yet been seen,
4128 then if we later have a file-scope decl it must not be static. */
4129 if (oldlocal
== NULL_TREE
4130 && oldglobal
== NULL_TREE
4131 && DECL_EXTERNAL (x
)
4133 TREE_PUBLIC (name
) = 1;
4135 /* Warn if shadowing an argument at the top level of the body. */
4136 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4137 /* Inline decls shadow nothing. */
4138 && !DECL_FROM_INLINE (x
)
4139 && TREE_CODE (oldlocal
) == PARM_DECL
4140 /* Don't complain if it's from an enclosing function. */
4141 && DECL_CONTEXT (oldlocal
) == current_function_decl
4142 && TREE_CODE (x
) != PARM_DECL
)
4144 /* Go to where the parms should be and see if we
4146 struct binding_level
*b
= current_binding_level
->level_chain
;
4152 if (b
->parm_flag
== 1)
4153 cp_error ("declaration of `%#D' shadows a parameter", name
);
4156 /* Maybe warn if shadowing something else. */
4157 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4158 /* Inline decls shadow nothing. */
4159 && !DECL_FROM_INLINE (x
)
4160 /* No shadow warnings for internally generated vars. */
4161 && ! DECL_ARTIFICIAL (x
)
4162 /* No shadow warnings for vars made for inlining. */
4163 && ! DECL_FROM_INLINE (x
))
4165 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4166 warning ("declaration of `%s' shadows a parameter",
4167 IDENTIFIER_POINTER (name
));
4168 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4169 && current_class_ptr
4170 && !TREE_STATIC (name
))
4171 warning ("declaration of `%s' shadows a member of `this'",
4172 IDENTIFIER_POINTER (name
));
4173 else if (oldlocal
!= NULL_TREE
)
4174 warning ("declaration of `%s' shadows previous local",
4175 IDENTIFIER_POINTER (name
));
4176 else if (oldglobal
!= NULL_TREE
)
4177 /* XXX shadow warnings in outer-more namespaces */
4178 warning ("declaration of `%s' shadows global declaration",
4179 IDENTIFIER_POINTER (name
));
4183 if (TREE_CODE (x
) == FUNCTION_DECL
)
4184 check_default_args (x
);
4186 /* Keep count of variables in this level with incomplete type. */
4187 if (TREE_CODE (x
) == VAR_DECL
4188 && TREE_TYPE (x
) != error_mark_node
4189 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4190 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4191 /* RTTI TD entries are created while defining the type_info. */
4192 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4193 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4195 if (namespace_bindings_p ())
4196 namespace_scope_incomplete
4197 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4199 current_binding_level
->incomplete
4200 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4204 if (need_new_binding
)
4205 add_decl_to_level (x
,
4206 DECL_NAMESPACE_SCOPE_P (x
)
4207 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4208 : current_binding_level
);
4213 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4214 caller to set DECL_CONTEXT properly. */
4217 pushdecl_with_scope (x
, level
)
4219 struct binding_level
*level
;
4221 register struct binding_level
*b
;
4222 tree function_decl
= current_function_decl
;
4224 current_function_decl
= NULL_TREE
;
4225 if (level
->parm_flag
== 2)
4227 b
= class_binding_level
;
4228 class_binding_level
= level
;
4229 pushdecl_class_level (x
);
4230 class_binding_level
= b
;
4234 b
= current_binding_level
;
4235 current_binding_level
= level
;
4237 current_binding_level
= b
;
4239 current_function_decl
= function_decl
;
4243 /* Like pushdecl, only it places X in the current namespace,
4247 pushdecl_namespace_level (x
)
4250 register struct binding_level
*b
= current_binding_level
;
4253 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4255 /* Now, the type_shadowed stack may screw us. Munge it so it does
4257 if (TREE_CODE (x
) == TYPE_DECL
)
4259 tree name
= DECL_NAME (x
);
4261 tree
*ptr
= (tree
*)0;
4262 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4264 tree shadowed
= b
->type_shadowed
;
4265 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4266 if (TREE_PURPOSE (shadowed
) == name
)
4268 ptr
= &TREE_VALUE (shadowed
);
4269 /* Can't break out of the loop here because sometimes
4270 a binding level will have duplicate bindings for
4271 PT names. It's gross, but I haven't time to fix it. */
4274 newval
= TREE_TYPE (x
);
4275 if (ptr
== (tree
*)0)
4277 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4278 up here if this is changed to an assertion. --KR */
4279 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4289 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4293 pushdecl_top_level (x
)
4296 push_to_top_level ();
4297 x
= pushdecl_namespace_level (x
);
4298 pop_from_top_level ();
4302 /* Make the declaration of X appear in CLASS scope. */
4305 pushdecl_class_level (x
)
4308 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4309 scope looks for the pre-mangled name. */
4312 if (TREE_CODE (x
) == OVERLOAD
)
4313 x
= OVL_CURRENT (x
);
4314 name
= DECL_NAME (x
);
4318 push_class_level_binding (name
, x
);
4319 if (TREE_CODE (x
) == TYPE_DECL
)
4320 set_identifier_type_value (name
, TREE_TYPE (x
));
4322 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4326 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4329 pushdecl_class_level (f
);
4333 /* Enter DECL into the symbol table, if that's appropriate. Returns
4334 DECL, or a modified version thereof. */
4337 maybe_push_decl (decl
)
4340 tree type
= TREE_TYPE (decl
);
4342 /* Add this decl to the current binding level, but not if it comes
4343 from another scope, e.g. a static member variable. TEM may equal
4344 DECL or it may be a previous decl of the same name. */
4345 if (decl
== error_mark_node
4346 || (TREE_CODE (decl
) != PARM_DECL
4347 && DECL_CONTEXT (decl
) != NULL_TREE
4348 /* Definitions of namespace members outside their namespace are
4350 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4351 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4352 || TREE_CODE (type
) == UNKNOWN_TYPE
4353 /* The declaration of a template specialization does not affect
4354 the functions available for overload resolution, so we do not
4356 || (TREE_CODE (decl
) == FUNCTION_DECL
4357 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4360 return pushdecl (decl
);
4363 /* Make the declaration(s) of X appear in CLASS scope
4364 under the name NAME. */
4367 push_class_level_binding (name
, x
)
4372 /* The class_binding_level will be NULL if x is a template
4373 parameter name in a member template. */
4374 if (!class_binding_level
)
4377 /* Make sure that this new member does not have the same name
4378 as a template parameter. */
4379 if (TYPE_BEING_DEFINED (current_class_type
))
4380 check_template_shadow (x
);
4382 /* If this declaration shadows a declaration from an enclosing
4383 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4384 we leave this class. Record the shadowed declaration here. */
4385 binding
= IDENTIFIER_BINDING (name
);
4387 && ((TREE_CODE (x
) == OVERLOAD
4388 && BINDING_VALUE (binding
)
4389 && is_overloaded_fn (BINDING_VALUE (binding
)))
4390 || INHERITED_VALUE_BINDING_P (binding
)))
4395 /* If the old binding was from a base class, and was for a tag
4396 name, slide it over to make room for the new binding. The
4397 old binding is still visible if explicitly qualified with a
4399 if (INHERITED_VALUE_BINDING_P (binding
)
4400 && BINDING_VALUE (binding
)
4401 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4402 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4403 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4405 old_decl
= BINDING_TYPE (binding
);
4406 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4407 BINDING_VALUE (binding
) = NULL_TREE
;
4408 INHERITED_VALUE_BINDING_P (binding
) = 0;
4411 old_decl
= BINDING_VALUE (binding
);
4413 /* Find the previous binding of name on the class-shadowed
4414 list, and update it. */
4415 for (shadow
= class_binding_level
->class_shadowed
;
4417 shadow
= TREE_CHAIN (shadow
))
4418 if (TREE_PURPOSE (shadow
) == name
4419 && TREE_TYPE (shadow
) == old_decl
)
4421 BINDING_VALUE (binding
) = x
;
4422 INHERITED_VALUE_BINDING_P (binding
) = 0;
4423 TREE_TYPE (shadow
) = x
;
4424 IDENTIFIER_CLASS_VALUE (name
) = x
;
4429 /* If we didn't replace an existing binding, put the binding on the
4430 stack of bindings for the identifier, and update the shadowed list. */
4431 if (push_class_binding (name
, x
))
4433 class_binding_level
->class_shadowed
4434 = tree_cons (name
, NULL
,
4435 class_binding_level
->class_shadowed
);
4436 /* Record the value we are binding NAME to so that we can know
4437 what to pop later. */
4438 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4442 /* Insert another USING_DECL into the current binding level, returning
4443 this declaration. If this is a redeclaration, do nothing, and
4444 return NULL_TREE if this not in namespace scope (in namespace
4445 scope, a using decl might extend any previous bindings). */
4448 push_using_decl (scope
, name
)
4454 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4455 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4456 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4457 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4460 return namespace_bindings_p () ? decl
: NULL_TREE
;
4461 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4462 DECL_INITIAL (decl
) = scope
;
4463 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4464 current_binding_level
->usings
= decl
;
4468 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4469 changed (i.e. there was already a directive), or the fresh
4470 TREE_LIST otherwise. */
4473 push_using_directive (used
)
4476 tree ud
= current_binding_level
->using_directives
;
4477 tree iter
, ancestor
;
4479 /* Check if we already have this. */
4480 if (purpose_member (used
, ud
) != NULL_TREE
)
4483 /* Recursively add all namespaces used. */
4484 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4485 push_using_directive (TREE_PURPOSE (iter
));
4487 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4488 ud
= current_binding_level
->using_directives
;
4489 ud
= tree_cons (used
, ancestor
, ud
);
4490 current_binding_level
->using_directives
= ud
;
4494 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4495 other definitions already in place. We get around this by making
4496 the value of the identifier point to a list of all the things that
4497 want to be referenced by that name. It is then up to the users of
4498 that name to decide what to do with that list.
4500 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4501 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4503 FLAGS is a bitwise-or of the following values:
4504 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4506 PUSH_USING: DECL is being pushed as the result of a using
4509 The value returned may be a previous declaration if we guessed wrong
4510 about what language DECL should belong to (C or C++). Otherwise,
4511 it's always DECL (and never something that's not a _DECL). */
4514 push_overloaded_decl (decl
, flags
)
4518 tree name
= DECL_NAME (decl
);
4521 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4524 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4526 old
= lookup_name_current_level (name
);
4530 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4532 tree t
= TREE_TYPE (old
);
4533 if (IS_AGGR_TYPE (t
) && warn_shadow
4534 && (! DECL_IN_SYSTEM_HEADER (decl
)
4535 || ! DECL_IN_SYSTEM_HEADER (old
)))
4536 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4539 else if (is_overloaded_fn (old
))
4543 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4545 tree fn
= OVL_CURRENT (tmp
);
4547 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4548 && !(flags
& PUSH_USING
)
4549 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4550 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4551 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4554 if (duplicate_decls (decl
, fn
))
4558 else if (old
== error_mark_node
)
4559 /* Ignore the undefined symbol marker. */
4563 cp_error_at ("previous non-function declaration `%#D'", old
);
4564 cp_error ("conflicts with function declaration `%#D'", decl
);
4569 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4571 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4572 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4574 new_binding
= ovl_cons (decl
, old
);
4575 if (flags
& PUSH_USING
)
4576 OVL_USED (new_binding
) = 1;
4579 /* NAME is not ambiguous. */
4583 set_namespace_binding (name
, current_namespace
, new_binding
);
4586 /* We only create an OVERLOAD if there was a previous binding at
4587 this level, or if decl is a template. In the former case, we
4588 need to remove the old binding and replace it with the new
4589 binding. We must also run through the NAMES on the binding
4590 level where the name was bound to update the chain. */
4592 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4596 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4598 d
= &TREE_CHAIN (*d
))
4600 || (TREE_CODE (*d
) == TREE_LIST
4601 && TREE_VALUE (*d
) == old
))
4603 if (TREE_CODE (*d
) == TREE_LIST
)
4604 /* Just replace the old binding with the new. */
4605 TREE_VALUE (*d
) = new_binding
;
4607 /* Build a TREE_LIST to wrap the OVERLOAD. */
4608 *d
= tree_cons (NULL_TREE
, new_binding
,
4611 /* And update the CPLUS_BINDING node. */
4612 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4617 /* We should always find a previous binding in this case. */
4618 my_friendly_abort (0);
4621 /* Install the new binding. */
4622 push_local_binding (name
, new_binding
, flags
);
4628 /* Generate an implicit declaration for identifier FUNCTIONID
4629 as a function of type int (). Print a warning if appropriate. */
4632 implicitly_declare (functionid
)
4637 /* We used to reuse an old implicit decl here,
4638 but this loses with inline functions because it can clobber
4639 the saved decl chains. */
4640 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4642 DECL_EXTERNAL (decl
) = 1;
4643 TREE_PUBLIC (decl
) = 1;
4645 /* ISO standard says implicit declarations are in the innermost block.
4646 So we record the decl in the standard fashion. */
4648 rest_of_decl_compilation (decl
, NULL
, 0, 0);
4651 /* Only one warning per identifier. */
4652 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4654 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4657 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4662 /* Return zero if the declaration NEWDECL is valid
4663 when the declaration OLDDECL (assumed to be for the same name)
4664 has already been seen.
4665 Otherwise return an error message format string with a %s
4666 where the identifier should go. */
4669 redeclaration_error_message (newdecl
, olddecl
)
4670 tree newdecl
, olddecl
;
4672 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4674 /* Because C++ can put things into name space for free,
4675 constructs like "typedef struct foo { ... } foo"
4676 would look like an erroneous redeclaration. */
4677 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4680 return "redefinition of `%#D'";
4682 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4684 /* If this is a pure function, its olddecl will actually be
4685 the original initialization to `0' (which we force to call
4686 abort()). Don't complain about redefinition in this case. */
4687 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4690 /* If both functions come from different namespaces, this is not
4691 a redeclaration - this is a conflict with a used function. */
4692 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4693 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4694 return "`%D' conflicts with used function";
4696 /* We'll complain about linkage mismatches in
4697 warn_extern_redeclared_static. */
4699 /* Defining the same name twice is no good. */
4700 if (DECL_INITIAL (olddecl
) != NULL_TREE
4701 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4703 if (DECL_NAME (olddecl
) == NULL_TREE
)
4704 return "`%#D' not declared in class";
4706 return "redefinition of `%#D'";
4710 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4712 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4713 && (DECL_TEMPLATE_RESULT (newdecl
)
4714 != DECL_TEMPLATE_RESULT (olddecl
))
4715 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4716 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4717 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4718 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4719 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4720 return "redefinition of `%#D'";
4723 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4725 /* Objects declared at top level: */
4726 /* If at least one is a reference, it's ok. */
4727 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4729 /* Reject two definitions. */
4730 return "redefinition of `%#D'";
4734 /* Objects declared with block scope: */
4735 /* Reject two definitions, and reject a definition
4736 together with an external reference. */
4737 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4738 return "redeclaration of `%#D'";
4743 /* Create a new label, named ID. */
4746 make_label_decl (id
, local_p
)
4752 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4754 /* Make sure every label has an rtx. */
4757 DECL_CONTEXT (decl
) = current_function_decl
;
4758 DECL_MODE (decl
) = VOIDmode
;
4759 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4761 /* Say where one reference is to the label, for the sake of the
4762 error if it is not defined. */
4763 DECL_SOURCE_LINE (decl
) = lineno
;
4764 DECL_SOURCE_FILE (decl
) = input_filename
;
4766 /* Record the fact that this identifier is bound to this label. */
4767 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4772 /* Record this label on the list of used labels so that we can check
4773 at the end of the function to see whether or not the label was
4774 actually defined, and so we can check when the label is defined whether
4775 this use is valid. */
4781 if (named_label_uses
== NULL
4782 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4783 || named_label_uses
->label_decl
!= decl
)
4785 struct named_label_use_list
*new_ent
;
4786 new_ent
= ((struct named_label_use_list
*)
4787 ggc_alloc (sizeof (struct named_label_use_list
)));
4788 new_ent
->label_decl
= decl
;
4789 new_ent
->names_in_scope
= current_binding_level
->names
;
4790 new_ent
->binding_level
= current_binding_level
;
4791 new_ent
->lineno_o_goto
= lineno
;
4792 new_ent
->filename_o_goto
= input_filename
;
4793 new_ent
->next
= named_label_uses
;
4794 named_label_uses
= new_ent
;
4798 /* Look for a label named ID in the current function. If one cannot
4799 be found, create one. (We keep track of used, but undefined,
4800 labels, and complain about them at the end of a function.) */
4807 struct named_label_list
*ent
;
4809 /* You can't use labels at global scope. */
4810 if (current_function_decl
== NULL_TREE
)
4812 error ("label `%s' referenced outside of any function",
4813 IDENTIFIER_POINTER (id
));
4817 /* See if we've already got this label. */
4818 decl
= IDENTIFIER_LABEL_VALUE (id
);
4819 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4822 /* Record this label on the list of labels used in this function.
4823 We do this before calling make_label_decl so that we get the
4824 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4825 ent
= ((struct named_label_list
*)
4826 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4827 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4828 ent
->next
= named_labels
;
4831 /* We need a new label. */
4832 decl
= make_label_decl (id
, /*local_p=*/0);
4834 /* Now fill in the information we didn't have before. */
4835 ent
->label_decl
= decl
;
4840 /* Declare a local label named ID. */
4843 declare_local_label (id
)
4848 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4849 this scope we can restore the old value of
4850 IDENTIFIER_TYPE_VALUE. */
4851 current_binding_level
->shadowed_labels
4852 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4853 current_binding_level
->shadowed_labels
);
4854 /* Look for the label. */
4855 decl
= make_label_decl (id
, /*local_p=*/1);
4856 /* Now fill in the information we didn't have before. */
4857 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4862 /* Returns nonzero if it is ill-formed to jump past the declaration of
4863 DECL. Returns 2 if it's also a real problem. */
4866 decl_jump_unsafe (decl
)
4869 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4872 if (DECL_INITIAL (decl
) == NULL_TREE
4873 && pod_type_p (TREE_TYPE (decl
)))
4876 /* This is really only important if we're crossing an initialization.
4877 The POD stuff is just pedantry; why should it matter if the class
4878 contains a field of pointer to member type? */
4879 if (DECL_INITIAL (decl
)
4880 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4885 /* Check that a single previously seen jump to a newly defined label
4886 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4887 the jump context; NAMES are the names in scope in LEVEL at the jump
4888 context; FILE and LINE are the source position of the jump or 0. */
4891 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4893 struct binding_level
*level
;
4900 struct binding_level
*b
= current_binding_level
;
4901 for (; b
; b
= b
->level_chain
)
4903 tree new_decls
= b
->names
;
4904 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4905 for (; new_decls
!= old_decls
;
4906 new_decls
= TREE_CHAIN (new_decls
))
4908 int problem
= decl_jump_unsafe (new_decls
);
4915 cp_pedwarn ("jump to label `%D'", decl
);
4917 pedwarn ("jump to case label");
4920 pedwarn_with_file_and_line (file
, line
, " from here");
4925 cp_error_at (" crosses initialization of `%#D'",
4928 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4934 if ((b
->is_try_scope
|| b
->is_catch_scope
) && ! saw_eh
)
4939 cp_pedwarn ("jump to label `%D'", decl
);
4941 pedwarn ("jump to case label");
4944 pedwarn_with_file_and_line (file
, line
, " from here");
4947 if (b
->is_try_scope
)
4948 error (" enters try block");
4950 error (" enters catch block");
4957 check_previous_goto (use
)
4958 struct named_label_use_list
*use
;
4960 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4961 use
->names_in_scope
, use
->filename_o_goto
,
4962 use
->lineno_o_goto
);
4966 check_switch_goto (level
)
4967 struct binding_level
*level
;
4969 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
4972 /* Check that any previously seen jumps to a newly defined label DECL
4973 are OK. Called by define_label. */
4976 check_previous_gotos (decl
)
4979 struct named_label_use_list
**usep
;
4981 if (! TREE_USED (decl
))
4984 for (usep
= &named_label_uses
; *usep
; )
4986 struct named_label_use_list
*use
= *usep
;
4987 if (use
->label_decl
== decl
)
4989 check_previous_goto (use
);
4993 usep
= &(use
->next
);
4997 /* Check that a new jump to a label DECL is OK. Called by
4998 finish_goto_stmt. */
5006 struct named_label_list
*lab
;
5008 /* We can't know where a computed goto is jumping. So we assume
5010 if (! DECL_P (decl
))
5013 /* If the label hasn't been defined yet, defer checking. */
5014 if (! DECL_INITIAL (decl
))
5020 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5021 if (decl
== lab
->label_decl
)
5024 /* If the label is not on named_labels it's a gcc local label, so
5025 it must be in an outer scope, so jumping to it is always OK. */
5029 if ((lab
->in_try_scope
|| lab
->in_catch_scope
|| lab
->bad_decls
)
5032 cp_pedwarn_at ("jump to label `%D'", decl
);
5033 pedwarn (" from here");
5037 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5039 tree b
= TREE_VALUE (bad
);
5040 int u
= decl_jump_unsafe (b
);
5042 if (u
> 1 && DECL_ARTIFICIAL (b
))
5043 /* Can't skip init of __exception_info. */
5044 cp_error_at (" enters catch block", b
);
5046 cp_error_at (" skips initialization of `%#D'", b
);
5048 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5051 if (lab
->in_try_scope
)
5052 error (" enters try block");
5053 else if (lab
->in_catch_scope
)
5054 error (" enters catch block");
5057 /* Define a label, specifying the location in the source file.
5058 Return the LABEL_DECL node for the label, if the definition is valid.
5059 Otherwise return 0. */
5062 define_label (filename
, line
, name
)
5063 const char *filename
;
5067 tree decl
= lookup_label (name
);
5068 struct named_label_list
*ent
;
5069 register struct binding_level
*p
;
5071 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5072 if (ent
->label_decl
== decl
)
5075 /* After labels, make any new cleanups in the function go into their
5076 own new (temporary) binding contour. */
5077 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5078 p
->more_cleanups_ok
= 0;
5080 if (name
== get_identifier ("wchar_t"))
5081 cp_pedwarn ("label named wchar_t");
5083 if (DECL_INITIAL (decl
) != NULL_TREE
)
5085 cp_error ("duplicate label `%D'", decl
);
5090 /* Mark label as having been defined. */
5091 DECL_INITIAL (decl
) = error_mark_node
;
5092 /* Say where in the source. */
5093 DECL_SOURCE_FILE (decl
) = filename
;
5094 DECL_SOURCE_LINE (decl
) = line
;
5097 ent
->names_in_scope
= current_binding_level
->names
;
5098 ent
->binding_level
= current_binding_level
;
5100 check_previous_gotos (decl
);
5107 struct binding_level
*level
;
5108 struct cp_switch
*next
;
5109 /* The SWITCH_STMT being built. */
5111 /* A splay-tree mapping the low element of a case range to the high
5112 element, or NULL_TREE if there is no high element. Used to
5113 determine whether or not a new case label duplicates an old case
5114 label. We need a tree, rather than simply a hash table, because
5115 of the GNU case range extension. */
5119 /* A stack of the currently active switch statements. The innermost
5120 switch statement is on the top of the stack. There is no need to
5121 mark the stack for garbage collection because it is only active
5122 during the processing of the body of a function, and we never
5123 collect at that point. */
5125 static struct cp_switch
*switch_stack
;
5127 /* Called right after a switch-statement condition is parsed.
5128 SWITCH_STMT is the switch statement being parsed. */
5131 push_switch (switch_stmt
)
5135 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5136 p
->level
= current_binding_level
;
5137 p
->next
= switch_stack
;
5138 p
->switch_stmt
= switch_stmt
;
5139 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5146 struct cp_switch
*cs
;
5149 splay_tree_delete (cs
->cases
);
5150 switch_stack
= switch_stack
->next
;
5154 /* Note that we've seen a definition of a case label, and complain if this
5155 is a bad place for one. */
5158 finish_case_label (low_value
, high_value
)
5163 register struct binding_level
*p
;
5168 error ("case label not within a switch statement");
5170 cp_error ("case label `%E' not within a switch statement",
5173 error ("`default' label not within a switch statement");
5177 if (processing_template_decl
)
5181 /* For templates, just add the case label; we'll do semantic
5182 analysis at instantiation-time. */
5183 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5184 return add_stmt (build_case_label (low_value
, high_value
, label
));
5187 /* Find the condition on which this switch statement depends. */
5188 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5189 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5190 cond
= TREE_VALUE (cond
);
5192 r
= c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5193 if (r
== error_mark_node
)
5196 check_switch_goto (switch_stack
->level
);
5198 /* After labels, make any new cleanups in the function go into their
5199 own new (temporary) binding contour. */
5200 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5201 p
->more_cleanups_ok
= 0;
5206 /* Return the list of declarations of the current level.
5207 Note that this list is in reverse order unless/until
5208 you nreverse it; and when you do nreverse it, you must
5209 store the result back using `storedecls' or you will lose. */
5214 return current_binding_level
->names
;
5217 /* Return the list of type-tags (for structs, etc) of the current level. */
5222 return current_binding_level
->tags
;
5225 /* Store the list of declarations of the current level.
5226 This is done for the parameter declarations of a function being defined,
5227 after they are modified in the light of any missing parameters. */
5233 current_binding_level
->names
= decls
;
5236 /* Similarly, store the list of tags of the current level. */
5242 current_binding_level
->tags
= tags
;
5245 /* Given NAME, an IDENTIFIER_NODE,
5246 return the structure (or union or enum) definition for that name.
5247 Searches binding levels from BINDING_LEVEL up to the global level.
5248 If THISLEVEL_ONLY is nonzero, searches only the specified context
5249 (but skips any tag-transparent contexts to find one that is
5250 meaningful for tags).
5251 FORM says which kind of type the caller wants;
5252 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5253 If the wrong kind of type is found, and it's not a template, an error is
5257 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5258 enum tree_code form
;
5260 struct binding_level
*binding_level
;
5263 register struct binding_level
*level
;
5264 /* Non-zero if, we should look past a template parameter level, even
5265 if THISLEVEL_ONLY. */
5266 int allow_template_parms_p
= 1;
5268 for (level
= binding_level
; level
; level
= level
->level_chain
)
5271 if (ANON_AGGRNAME_P (name
))
5272 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5274 /* There's no need for error checking here, because
5275 anon names are unique throughout the compilation. */
5276 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5277 return TREE_VALUE (tail
);
5279 else if (level
->namespace_p
)
5280 /* Do namespace lookup. */
5281 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5283 tree old
= binding_for_name (name
, tail
);
5285 /* If we just skipped past a template parameter level,
5286 even though THISLEVEL_ONLY, and we find a template
5287 class declaration, then we use the _TYPE node for the
5288 template. See the example below. */
5289 if (thislevel_only
&& !allow_template_parms_p
5290 && old
&& BINDING_VALUE (old
)
5291 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5292 old
= TREE_TYPE (BINDING_VALUE (old
));
5294 old
= BINDING_TYPE (old
);
5296 /* If it has an original type, it is a typedef, and we
5297 should not return it. */
5298 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5300 if (old
&& TREE_CODE (old
) != form
5301 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5303 cp_error ("`%#D' redeclared as %C", old
, form
);
5308 if (thislevel_only
|| tail
== global_namespace
)
5312 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5314 if (TREE_PURPOSE (tail
) == name
)
5316 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5317 /* Should tighten this up; it'll probably permit
5318 UNION_TYPE and a struct template, for example. */
5320 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5322 /* Definition isn't the kind we were looking for. */
5323 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5327 return TREE_VALUE (tail
);
5330 if (thislevel_only
&& ! level
->tag_transparent
)
5332 if (level
->template_parms_p
&& allow_template_parms_p
)
5334 /* We must deal with cases like this:
5336 template <class T> struct S;
5337 template <class T> struct S {};
5339 When looking up `S', for the second declaration, we
5340 would like to find the first declaration. But, we
5341 are in the pseudo-global level created for the
5342 template parameters, rather than the (surrounding)
5343 namespace level. Thus, we keep going one more level,
5344 even though THISLEVEL_ONLY is non-zero. */
5345 allow_template_parms_p
= 0;
5357 set_current_level_tags_transparency (tags_transparent
)
5358 int tags_transparent
;
5360 current_binding_level
->tag_transparent
= tags_transparent
;
5364 /* Given a type, find the tag that was defined for it and return the tag name.
5365 Otherwise return 0. However, the value can never be 0
5366 in the cases in which this is used.
5368 C++: If NAME is non-zero, this is the new name to install. This is
5369 done when replacing anonymous tags with real tag names. */
5372 lookup_tag_reverse (type
, name
)
5376 register struct binding_level
*level
;
5378 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5381 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5383 if (TREE_VALUE (tail
) == type
)
5386 TREE_PURPOSE (tail
) = name
;
5387 return TREE_PURPOSE (tail
);
5394 /* Look up NAME in the NAMESPACE. */
5397 lookup_namespace_name (namespace, name
)
5398 tree
namespace, name
;
5401 tree template_id
= NULL_TREE
;
5403 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5405 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5406 /* This happens for A::B<int> when B is a namespace. */
5408 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5410 /* This happens for A::B where B is a template, and there are no
5411 template arguments. */
5412 cp_error ("invalid use of `%D'", name
);
5413 return error_mark_node
;
5416 namespace = ORIGINAL_NAMESPACE (namespace);
5418 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5421 name
= TREE_OPERAND (name
, 0);
5422 if (TREE_CODE (name
) == OVERLOAD
)
5423 name
= DECL_NAME (OVL_CURRENT (name
));
5424 else if (DECL_P (name
))
5425 name
= DECL_NAME (name
);
5428 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5430 val
= make_node (CPLUS_BINDING
);
5431 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5432 return error_mark_node
;
5434 if (BINDING_VALUE (val
))
5436 val
= BINDING_VALUE (val
);
5440 if (DECL_CLASS_TEMPLATE_P (val
))
5441 val
= lookup_template_class (val
,
5442 TREE_OPERAND (template_id
, 1),
5443 /*in_decl=*/NULL_TREE
,
5444 /*context=*/NULL_TREE
,
5445 /*entering_scope=*/0,
5447 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5448 || TREE_CODE (val
) == OVERLOAD
)
5449 val
= lookup_template_function (val
,
5450 TREE_OPERAND (template_id
, 1));
5453 cp_error ("`%D::%D' is not a template",
5455 return error_mark_node
;
5459 /* If we have a single function from a using decl, pull it out. */
5460 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5461 val
= OVL_FUNCTION (val
);
5465 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5466 return error_mark_node
;
5469 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5471 static unsigned long
5479 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5480 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5485 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5488 typename_compare (k1
, k2
)
5499 d1
= TYPE_NAME (t1
);
5500 d2
= TYPE_NAME (t2
);
5502 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5503 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5504 && ((TREE_TYPE (t1
) != NULL_TREE
)
5505 == (TREE_TYPE (t2
) != NULL_TREE
))
5506 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5507 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5510 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5511 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5512 is non-NULL, this type is being created by the implicit typename
5513 extension, and BASE_TYPE is a type named `t' in some base class of
5514 `T' which depends on template parameters.
5516 Returns the new TYPENAME_TYPE. */
5519 build_typename_type (context
, name
, fullname
, base_type
)
5527 struct hash_entry
*e
;
5529 static struct hash_table ht
;
5533 static struct hash_table
*h
= &ht
;
5535 hash_table_init (&ht
, &hash_newfunc
, &typename_hash
, &typename_compare
);
5536 ggc_add_tree_hash_table_root (&h
, 1);
5539 /* Build the TYPENAME_TYPE. */
5540 t
= make_aggr_type (TYPENAME_TYPE
);
5541 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5542 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5543 TREE_TYPE (t
) = base_type
;
5545 /* Build the corresponding TYPE_DECL. */
5546 d
= build_decl (TYPE_DECL
, name
, t
);
5547 TYPE_NAME (TREE_TYPE (d
)) = d
;
5548 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5549 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5550 DECL_ARTIFICIAL (d
) = 1;
5552 /* See if we already have this type. */
5553 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5557 /* Insert the type into the table. */
5558 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5563 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5564 unless an error occurs, in which case error_mark_node is returned.
5565 If COMPLAIN zero, don't complain about any errors that occur. */
5568 make_typename_type (context
, name
, complain
)
5576 if (!(TYPE_LANG_SPECIFIC (name
)
5577 && (CLASSTYPE_IS_TEMPLATE (name
)
5578 || CLASSTYPE_USE_TEMPLATE (name
))))
5579 name
= TYPE_IDENTIFIER (name
);
5581 /* Create a TEMPLATE_ID_EXPR for the type. */
5582 name
= build_nt (TEMPLATE_ID_EXPR
,
5583 CLASSTYPE_TI_TEMPLATE (name
),
5584 CLASSTYPE_TI_ARGS (name
));
5586 else if (TREE_CODE (name
) == TYPE_DECL
)
5587 name
= DECL_NAME (name
);
5591 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5593 name
= TREE_OPERAND (name
, 0);
5594 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5595 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5597 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5598 my_friendly_abort (2000);
5600 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5602 /* We can get here from typename_sub0 in the explicit_template_type
5603 expansion. Just fail. */
5605 cp_error ("no class template named `%#T' in `%#T'",
5607 return error_mark_node
;
5610 if (! uses_template_parms (context
)
5611 || currently_open_class (context
))
5613 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5615 tree tmpl
= NULL_TREE
;
5616 if (IS_AGGR_TYPE (context
))
5617 tmpl
= lookup_field (context
, name
, 0, 0);
5618 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5621 cp_error ("no class template named `%#T' in `%#T'",
5623 return error_mark_node
;
5626 return lookup_template_class (tmpl
,
5627 TREE_OPERAND (fullname
, 1),
5629 /*entering_scope=*/0,
5636 if (!IS_AGGR_TYPE (context
))
5639 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5640 return error_mark_node
;
5643 t
= lookup_field (context
, name
, 0, 1);
5645 return TREE_TYPE (t
);
5649 /* If the CONTEXT is not a template type, then either the field is
5650 there now or its never going to be. */
5651 if (!uses_template_parms (context
))
5654 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5655 return error_mark_node
;
5659 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5662 /* Select the right _DECL from multiple choices. */
5665 select_decl (binding
, flags
)
5670 val
= BINDING_VALUE (binding
);
5672 /* When we implicitly declare some builtin entity, we mark it
5673 DECL_ANTICIPATED, so that we know to ignore it until it is
5675 if (val
&& DECL_P (val
)
5676 && DECL_LANG_SPECIFIC (val
)
5677 && DECL_ANTICIPATED (val
))
5680 if (LOOKUP_NAMESPACES_ONLY (flags
))
5682 /* We are not interested in types. */
5683 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5688 /* If we could have a type and
5689 we have nothing or we need a type and have none. */
5690 if (BINDING_TYPE (binding
)
5691 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5692 && TREE_CODE (val
) != TYPE_DECL
)))
5693 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5694 /* Don't return non-types if we really prefer types. */
5695 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5696 && (TREE_CODE (val
) != TEMPLATE_DECL
5697 || !DECL_CLASS_TEMPLATE_P (val
)))
5703 /* Unscoped lookup of a global: iterate over current namespaces,
5704 considering using-directives. If SPACESP is non-NULL, store a list
5705 of the namespaces we've considered in it. */
5708 unqualified_namespace_lookup (name
, flags
, spacesp
)
5713 tree b
= make_node (CPLUS_BINDING
);
5714 tree initial
= current_decl_namespace ();
5715 tree scope
= initial
;
5717 struct binding_level
*level
;
5718 tree val
= NULL_TREE
;
5721 *spacesp
= NULL_TREE
;
5723 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5726 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5727 val
= binding_for_name (name
, scope
);
5729 /* Initialize binding for this context. */
5730 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5731 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5733 /* Add all _DECLs seen through local using-directives. */
5734 for (level
= current_binding_level
;
5735 !level
->namespace_p
;
5736 level
= level
->level_chain
)
5737 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5738 scope
, flags
, spacesp
))
5739 /* Give up because of error. */
5740 return error_mark_node
;
5742 /* Add all _DECLs seen through global using-directives. */
5743 /* XXX local and global using lists should work equally. */
5747 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5748 scope
, flags
, spacesp
))
5749 /* Give up because of error. */
5750 return error_mark_node
;
5751 if (siter
== scope
) break;
5752 siter
= CP_DECL_CONTEXT (siter
);
5755 val
= select_decl (b
, flags
);
5756 if (scope
== global_namespace
)
5762 /* Combine prefer_type and namespaces_only into flags. */
5765 lookup_flags (prefer_type
, namespaces_only
)
5766 int prefer_type
, namespaces_only
;
5768 if (namespaces_only
)
5769 return LOOKUP_PREFER_NAMESPACES
;
5770 if (prefer_type
> 1)
5771 return LOOKUP_PREFER_TYPES
;
5772 if (prefer_type
> 0)
5773 return LOOKUP_PREFER_BOTH
;
5777 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5778 ignore it or not. Subroutine of lookup_name_real. */
5781 qualify_lookup (val
, flags
)
5785 if (val
== NULL_TREE
)
5787 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5789 if ((flags
& LOOKUP_PREFER_TYPES
)
5790 && (TREE_CODE (val
) == TYPE_DECL
5791 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5792 && DECL_CLASS_TEMPLATE_P (val
))))
5794 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5799 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5803 warn_about_implicit_typename_lookup (typename
, binding
)
5807 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5808 tree name
= DECL_NAME (typename
);
5810 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5811 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5812 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5813 && ! (TREE_CODE (binding
) == TYPE_DECL
5814 && same_type_p (TREE_TYPE (binding
), subtype
)))
5816 cp_warning ("lookup of `%D' finds `%#D'",
5818 cp_warning (" instead of `%D' from dependent base class",
5820 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5821 constructor_name (current_class_type
), name
);
5825 /* Look up NAME in the current binding level and its superiors in the
5826 namespace of variables, functions and typedefs. Return a ..._DECL
5827 node of some kind representing its definition if there is only one
5828 such declaration, or return a TREE_LIST with all the overloaded
5829 definitions if there are many, or return 0 if it is undefined.
5831 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5832 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5833 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5834 Otherwise we prefer non-TYPE_DECLs.
5836 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5837 using IDENTIFIER_CLASS_VALUE. */
5840 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5842 int prefer_type
, nonclass
, namespaces_only
;
5845 tree val
= NULL_TREE
;
5847 tree from_obj
= NULL_TREE
;
5849 int val_is_implicit_typename
= 0;
5851 /* Hack: copy flag set by parser, if set. */
5852 if (only_namespace_names
)
5853 namespaces_only
= 1;
5855 if (prefer_type
== -2)
5857 extern int looking_for_typename
;
5858 tree type
= NULL_TREE
;
5861 prefer_type
= looking_for_typename
;
5863 flags
= lookup_flags (prefer_type
, namespaces_only
);
5864 /* If the next thing is '<', class templates are types. */
5865 if (looking_for_template
)
5866 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5870 else if (got_object
!= error_mark_node
)
5875 if (type
== error_mark_node
)
5876 return error_mark_node
;
5877 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5878 type
= TREE_TYPE (type
);
5881 type
= complete_type (type
);
5883 if (TREE_CODE (type
) == VOID_TYPE
)
5884 type
= global_namespace
;
5885 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5887 val
= make_node (CPLUS_BINDING
);
5888 flags
|= LOOKUP_COMPLAIN
;
5889 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5891 val
= select_decl (val
, flags
);
5893 else if (! IS_AGGR_TYPE (type
)
5894 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5895 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5896 || TREE_CODE (type
) == TYPENAME_TYPE
)
5897 /* Someone else will give an error about this if needed. */
5899 else if (type
== current_class_type
)
5900 val
= IDENTIFIER_CLASS_VALUE (name
);
5903 val
= lookup_member (type
, name
, 0, prefer_type
);
5904 type_access_control (type
, val
);
5906 /* Restore the containing TYPENAME_TYPE if we looked
5907 through it before. */
5908 if (got_scope
&& got_scope
!= type
5909 && val
&& TREE_CODE (val
) == TYPE_DECL
5910 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5911 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5919 else if (got_object
&& val
)
5927 flags
= lookup_flags (prefer_type
, namespaces_only
);
5928 /* If we're not parsing, we need to complain. */
5929 flags
|= LOOKUP_COMPLAIN
;
5932 /* First, look in non-namespace scopes. */
5934 if (current_class_type
== NULL_TREE
)
5937 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5941 if (!LOCAL_BINDING_P (t
) && nonclass
)
5942 /* We're not looking for class-scoped bindings, so keep going. */
5945 /* If this is the kind of thing we're looking for, we're done. */
5946 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5947 binding
= BINDING_VALUE (t
);
5948 else if ((flags
& LOOKUP_PREFER_TYPES
)
5949 && qualify_lookup (BINDING_TYPE (t
), flags
))
5950 binding
= BINDING_TYPE (t
);
5952 binding
= NULL_TREE
;
5954 /* Handle access control on types from enclosing or base classes. */
5955 if (binding
&& ! yylex
5956 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5957 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5960 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5962 if (val_is_implicit_typename
&& !yylex
)
5963 warn_about_implicit_typename_lookup (val
, binding
);
5965 val_is_implicit_typename
5966 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5967 if (!val_is_implicit_typename
)
5972 /* Now lookup in namespace scopes. */
5973 if (!val
|| val_is_implicit_typename
)
5975 t
= unqualified_namespace_lookup (name
, flags
, 0);
5978 if (val_is_implicit_typename
&& !yylex
)
5979 warn_about_implicit_typename_lookup (val
, t
);
5987 /* This should only warn about types used in qualified-ids. */
5988 if (from_obj
&& from_obj
!= val
)
5990 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5991 && TREE_CODE (val
) == TYPE_DECL
5992 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
5994 lookup of `%D' in the scope of `%#T' (`%#D') \
5995 does not match lookup in the current scope (`%#D')",
5996 name
, got_object
, from_obj
, val
);
5998 /* We don't change val to from_obj if got_object depends on
5999 template parms because that breaks implicit typename for
6000 destructor calls. */
6001 if (! uses_template_parms (got_object
))
6005 /* If we have a single function from a using decl, pull it out. */
6006 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6007 val
= OVL_FUNCTION (val
);
6016 lookup_name_nonclass (name
)
6019 return lookup_name_real (name
, 0, 1, 0);
6023 lookup_function_nonclass (name
, args
)
6027 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6031 lookup_name_namespace_only (name
)
6034 /* type-or-namespace, nonclass, namespace_only */
6035 return lookup_name_real (name
, 1, 1, 1);
6039 lookup_name (name
, prefer_type
)
6043 return lookup_name_real (name
, prefer_type
, 0, 0);
6046 /* Similar to `lookup_name' but look only in the innermost non-class
6050 lookup_name_current_level (name
)
6053 struct binding_level
*b
;
6056 b
= current_binding_level
;
6057 while (b
->parm_flag
== 2)
6062 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6064 /* extern "C" function() */
6065 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6068 else if (IDENTIFIER_BINDING (name
)
6069 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6073 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6074 return IDENTIFIER_VALUE (name
);
6086 /* Like lookup_name_current_level, but for types. */
6089 lookup_type_current_level (name
)
6092 register tree t
= NULL_TREE
;
6094 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6096 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6097 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6099 struct binding_level
*b
= current_binding_level
;
6102 if (purpose_member (name
, b
->type_shadowed
))
6103 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6115 begin_only_namespace_names ()
6117 only_namespace_names
= 1;
6121 end_only_namespace_names ()
6123 only_namespace_names
= 0;
6126 /* Push the declarations of builtin types into the namespace.
6127 RID_INDEX is the index of the builtin type
6128 in the array RID_POINTERS. NAME is the name used when looking
6129 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6132 record_builtin_type (rid_index
, name
, type
)
6137 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6138 tree tdecl
= NULL_TREE
;
6140 if ((int) rid_index
< (int) RID_MAX
)
6141 rname
= ridpointers
[(int) rid_index
];
6143 tname
= get_identifier (name
);
6145 TYPE_BUILT_IN (type
) = 1;
6149 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6150 set_identifier_type_value (tname
, NULL_TREE
);
6151 if ((int) rid_index
< (int) RID_MAX
)
6152 /* Built-in types live in the global namespace. */
6153 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6155 if (rname
!= NULL_TREE
)
6157 if (tname
!= NULL_TREE
)
6159 set_identifier_type_value (rname
, NULL_TREE
);
6160 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6164 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6165 set_identifier_type_value (rname
, NULL_TREE
);
6170 /* Record one of the standard Java types.
6171 * Declare it as having the given NAME.
6172 * If SIZE > 0, it is the size of one of the integral types;
6173 * otherwise it is the negative of the size of one of the other types. */
6176 record_builtin_java_type (name
, size
)
6182 type
= make_signed_type (size
);
6183 else if (size
> -32)
6184 { /* "__java_char" or ""__java_boolean". */
6185 type
= make_unsigned_type (-size
);
6186 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6189 { /* "__java_float" or ""__java_double". */
6190 type
= make_node (REAL_TYPE
);
6191 TYPE_PRECISION (type
) = - size
;
6194 record_builtin_type (RID_MAX
, name
, type
);
6195 decl
= TYPE_NAME (type
);
6197 /* Suppress generate debug symbol entries for these types,
6198 since for normal C++ they are just clutter.
6199 However, push_lang_context undoes this if extern "Java" is seen. */
6200 DECL_IGNORED_P (decl
) = 1;
6202 TYPE_FOR_JAVA (type
) = 1;
6206 /* Push a type into the namespace so that the back-ends ignore it. */
6209 record_unknown_type (type
, name
)
6213 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6214 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6215 DECL_IGNORED_P (decl
) = 1;
6216 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6217 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6218 TYPE_ALIGN (type
) = 1;
6219 TYPE_USER_ALIGN (type
) = 0;
6220 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6223 /* An string for which we should create an IDENTIFIER_NODE at
6226 typedef struct predefined_identifier
6228 /* The name of the identifier. */
6230 /* The place where the IDENTIFIER_NODE should be stored. */
6232 /* Non-zero if this is the name of a constructor or destructor. */
6234 } predefined_identifier
;
6236 /* Create all the predefined identifiers. */
6239 initialize_predefined_identifiers ()
6241 struct predefined_identifier
*pid
;
6243 /* A table of identifiers to create at startup. */
6244 static predefined_identifier predefined_identifiers
[] = {
6245 { "C++", &lang_name_cplusplus
, 0 },
6246 { "C", &lang_name_c
, 0 },
6247 { "Java", &lang_name_java
, 0 },
6248 { CTOR_NAME
, &ctor_identifier
, 1 },
6249 { "__base_ctor", &base_ctor_identifier
, 1 },
6250 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6251 { DTOR_NAME
, &dtor_identifier
, 1 },
6252 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6253 { "__base_dtor", &base_dtor_identifier
, 1 },
6254 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6255 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6256 { "nelts", &nelts_identifier
, 0 },
6257 { THIS_NAME
, &this_identifier
, 0 },
6258 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6259 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6260 { "_vptr", &vptr_identifier
, 0 },
6261 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6262 { "std", &std_identifier
, 0 },
6266 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6268 *pid
->node
= get_identifier (pid
->name
);
6269 if (pid
->ctor_or_dtor_p
)
6270 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6274 /* Create the predefined scalar types of C,
6275 and some nodes representing standard constants (0, 1, (void *)0).
6276 Initialize the global binding level.
6277 Make definitions for built-in primitive functions. */
6280 init_decl_processing ()
6283 tree void_ftype_ptr
;
6285 /* Create all the identifiers we need. */
6286 initialize_predefined_identifiers ();
6288 /* Fill in back-end hooks. */
6289 init_lang_status
= &push_cp_function_context
;
6290 free_lang_status
= &pop_cp_function_context
;
6291 mark_lang_status
= &mark_cp_function_context
;
6292 lang_safe_from_p
= &c_safe_from_p
;
6293 lang_dump_tree
= &cp_dump_tree
;
6294 lang_missing_noreturn_ok_p
= &cp_missing_noreturn_ok_p
;
6300 /* Create the global variables. */
6301 push_to_top_level ();
6303 /* Enter the global namespace. */
6304 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6305 push_namespace (get_identifier ("::"));
6306 global_namespace
= current_namespace
;
6307 current_lang_name
= NULL_TREE
;
6309 /* Adjust various flags based on command-line settings. */
6310 if (! flag_permissive
&& ! pedantic
)
6311 flag_pedantic_errors
= 1;
6312 if (!flag_no_inline
)
6314 flag_inline_trees
= 1;
6317 if (flag_inline_functions
)
6319 flag_inline_trees
= 2;
6320 flag_inline_functions
= 0;
6323 /* In C++, we never create builtin functions whose name does not
6324 begin with `__'. Users should be using headers to get prototypes
6325 in C++. It would be nice if we could warn when `-fbuiltin' is
6326 used explicitly, but we do not have that information. */
6327 flag_no_builtin
= 1;
6330 current_lang_name
= lang_name_c
;
6332 current_function_decl
= NULL_TREE
;
6333 current_binding_level
= NULL_BINDING_LEVEL
;
6334 free_binding_level
= NULL_BINDING_LEVEL
;
6336 build_common_tree_nodes (flag_signed_char
);
6338 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6339 TREE_TYPE (error_mark_list
) = error_mark_node
;
6341 /* Make the binding_level structure for global names. */
6343 global_binding_level
= current_binding_level
;
6344 /* The global level is the namespace level of ::. */
6345 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6346 declare_namespace_level ();
6348 /* Create the `std' namespace. */
6349 push_namespace (std_identifier
);
6350 std_node
= current_namespace
;
6353 lang_attribute_table
= cp_attribute_table
;
6355 c_common_nodes_and_builtins ();
6357 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6358 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6359 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6360 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6361 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6362 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6363 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6364 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6366 integer_two_node
= build_int_2 (2, 0);
6367 TREE_TYPE (integer_two_node
) = integer_type_node
;
6368 integer_three_node
= build_int_2 (3, 0);
6369 TREE_TYPE (integer_three_node
) = integer_type_node
;
6371 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6372 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6373 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6374 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6375 TYPE_PRECISION (boolean_type_node
) = 1;
6376 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6377 boolean_false_node
= build_int_2 (0, 0);
6378 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6379 boolean_true_node
= build_int_2 (1, 0);
6380 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6382 signed_size_zero_node
= build_int_2 (0, 0);
6383 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6385 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6388 record_builtin_type (RID_MAX
, NULL
, string_type_node
);
6391 delta_type_node
= ptrdiff_type_node
;
6392 vtable_index_type
= ptrdiff_type_node
;
6394 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6395 lang_type_promotes_to
= convert_type_from_ellipsis
;
6397 void_ftype
= build_function_type (void_type_node
, void_list_node
);
6398 void_ftype_ptr
= build_function_type (void_type_node
,
6399 tree_cons (NULL_TREE
,
6403 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6405 /* C++ extensions */
6407 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6408 record_unknown_type (unknown_type_node
, "unknown type");
6410 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6411 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6413 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6415 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6417 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6418 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6421 /* Make sure we get a unique function type, so we can give
6422 its pointer type a name. (This wins for gdb.) */
6423 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6424 TREE_TYPE (vfunc_type
) = integer_type_node
;
6425 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6426 layout_type (vfunc_type
);
6428 vtable_entry_type
= build_pointer_type (vfunc_type
);
6430 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6433 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6434 layout_type (vtbl_type_node
);
6435 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6436 record_builtin_type (RID_MAX
, NULL
, vtbl_type_node
);
6437 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6438 layout_type (vtbl_ptr_type_node
);
6439 record_builtin_type (RID_MAX
, NULL
, vtbl_ptr_type_node
);
6441 push_namespace (get_identifier ("__cxxabiv1"));
6442 abi_node
= current_namespace
;
6445 global_type_node
= make_node (LANG_TYPE
);
6446 record_unknown_type (global_type_node
, "global type");
6449 current_lang_name
= lang_name_cplusplus
;
6452 tree bad_alloc_type_node
, newtype
, deltype
;
6453 tree ptr_ftype_sizetype
;
6455 push_namespace (std_identifier
);
6456 bad_alloc_type_node
= xref_tag
6457 (class_type_node
, get_identifier ("bad_alloc"), 1);
6460 = build_function_type (ptr_type_node
,
6461 tree_cons (NULL_TREE
,
6464 newtype
= build_exception_variant
6465 (ptr_ftype_sizetype
, add_exception_specifier
6466 (NULL_TREE
, bad_alloc_type_node
, -1));
6467 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6468 push_cp_library_fn (NEW_EXPR
, newtype
);
6469 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6470 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6471 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6475 = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype
);
6477 /* Perform other language dependent initializations. */
6478 init_class_processing ();
6479 init_init_processing ();
6480 init_search_processing ();
6481 init_rtti_processing ();
6483 if (flag_exceptions
)
6484 init_exception_processing ();
6486 if (! supports_one_only ())
6489 make_fname_decl
= cp_make_fname_decl
;
6490 start_fname_decls ();
6492 /* Show we use EH for cleanups. */
6493 using_eh_for_cleanups ();
6495 /* Maintain consistency. Perhaps we should just complain if they
6496 say -fwritable-strings? */
6497 if (flag_writable_strings
)
6498 flag_const_strings
= 0;
6500 /* Add GC roots for all of our global variables. */
6501 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6502 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6503 ggc_add_tree_root (&integer_three_node
, 1);
6504 ggc_add_tree_root (&integer_two_node
, 1);
6505 ggc_add_tree_root (&signed_size_zero_node
, 1);
6506 ggc_add_tree_root (&size_one_node
, 1);
6507 ggc_add_tree_root (&size_zero_node
, 1);
6508 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6509 mark_binding_level
);
6510 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6511 ggc_add_tree_root (&static_ctors
, 1);
6512 ggc_add_tree_root (&static_dtors
, 1);
6513 ggc_add_tree_root (&lastiddecl
, 1);
6515 ggc_add_tree_root (&last_function_parms
, 1);
6516 ggc_add_tree_root (&error_mark_list
, 1);
6518 ggc_add_tree_root (&global_namespace
, 1);
6519 ggc_add_tree_root (&global_type_node
, 1);
6520 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6522 ggc_add_tree_root (&got_object
, 1);
6523 ggc_add_tree_root (&got_scope
, 1);
6525 ggc_add_tree_root (¤t_lang_name
, 1);
6526 ggc_add_tree_root (&static_aggregates
, 1);
6527 ggc_add_tree_root (&free_bindings
, 1);
6530 /* Generate an initializer for a function naming variable from
6531 NAME. NAME may be NULL, in which case we generate a special
6532 ERROR_MARK node which should be replaced later. */
6535 cp_fname_init (name
)
6538 tree domain
= NULL_TREE
;
6540 tree init
= NULL_TREE
;
6545 length
= strlen (name
);
6546 domain
= build_index_type (size_int (length
));
6547 init
= build_string (length
+ 1, name
);
6550 type
= build_qualified_type (char_type_node
, TYPE_QUAL_CONST
);
6551 type
= build_cplus_array_type (type
, domain
);
6554 TREE_TYPE (init
) = type
;
6556 /* We don't know the value until instantiation time. Make
6557 something which will be digested now, but replaced later. */
6558 init
= build (ERROR_MARK
, type
);
6563 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6564 decl, NAME is the initialization string and TYPE_DEP indicates whether
6565 NAME depended on the type of the function. We make use of that to detect
6566 __PRETTY_FUNCTION__ inside a template fn. This is being done
6567 lazily at the point of first use, so we musn't push the decl now. */
6570 cp_make_fname_decl (id
, type_dep
)
6574 const char *const name
= (type_dep
&& processing_template_decl
6575 ? NULL
: fname_as_string (type_dep
));
6576 tree init
= cp_fname_init (name
);
6577 tree decl
= build_decl (VAR_DECL
, id
, TREE_TYPE (init
));
6579 /* As we don't push the decl here, we must set the context. */
6580 DECL_CONTEXT (decl
) = current_function_decl
;
6581 DECL_PRETTY_FUNCTION_P (decl
) = type_dep
;
6583 TREE_STATIC (decl
) = 1;
6584 TREE_READONLY (decl
) = 1;
6585 DECL_ARTIFICIAL (decl
) = 1;
6586 DECL_INITIAL (decl
) = init
;
6588 TREE_USED (decl
) = 1;
6590 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6595 /* Entry point for the benefit of c_common_nodes_and_builtins.
6597 Make a definition for a builtin function named NAME and whose data type
6598 is TYPE. TYPE should be a function type with argument types.
6600 CLASS and CODE tell later passes how to compile calls to this function.
6601 See tree.h for possible values.
6603 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6604 the name to be called if we can't opencode the function. */
6607 builtin_function (name
, type
, code
, class, libname
)
6611 enum built_in_class
class;
6612 const char *libname
;
6614 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6615 DECL_BUILT_IN_CLASS (decl
) = class;
6616 DECL_FUNCTION_CODE (decl
) = code
;
6618 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6620 /* All builtins that don't begin with an `_' should go in the `std'
6624 push_namespace (std_identifier
);
6625 DECL_CONTEXT (decl
) = std_node
;
6631 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6632 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6633 function in the namespace. */
6635 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (libname
));
6636 make_decl_rtl (decl
, NULL
);
6638 /* Warn if a function in the namespace for users
6639 is used without an occasion to consider it declared. */
6640 if (name
[0] != '_' || name
[1] != '_')
6641 DECL_ANTICIPATED (decl
) = 1;
6643 /* Possibly apply some default attributes to this built-in function. */
6644 decl_attributes (&decl
, NULL_TREE
, 0);
6649 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6650 function. Not called directly. */
6653 build_library_fn_1 (name
, operator_code
, type
)
6655 enum tree_code operator_code
;
6658 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6659 DECL_EXTERNAL (fn
) = 1;
6660 TREE_PUBLIC (fn
) = 1;
6661 DECL_ARTIFICIAL (fn
) = 1;
6662 TREE_NOTHROW (fn
) = 1;
6663 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6664 SET_DECL_LANGUAGE (fn
, lang_c
);
6668 /* Returns the _DECL for a library function with C linkage.
6669 We assume that such functions never throw; if this is incorrect,
6670 callers should unset TREE_NOTHROW. */
6673 build_library_fn (name
, type
)
6677 return build_library_fn_1 (name
, ERROR_MARK
, type
);
6680 /* Returns the _DECL for a library function with C++ linkage. */
6683 build_cp_library_fn (name
, operator_code
, type
)
6685 enum tree_code operator_code
;
6688 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6689 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6690 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6691 SET_DECL_LANGUAGE (fn
, lang_cplusplus
);
6692 set_mangled_name_for_decl (fn
);
6696 /* Like build_library_fn, but takes a C string instead of an
6700 build_library_fn_ptr (name
, type
)
6704 return build_library_fn (get_identifier (name
), type
);
6707 /* Like build_cp_library_fn, but takes a C string instead of an
6711 build_cp_library_fn_ptr (name
, type
)
6715 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6718 /* Like build_library_fn, but also pushes the function so that we will
6719 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6722 push_library_fn (name
, type
)
6725 tree fn
= build_library_fn (name
, type
);
6726 pushdecl_top_level (fn
);
6730 /* Like build_cp_library_fn, but also pushes the function so that it
6731 will be found by normal lookup. */
6734 push_cp_library_fn (operator_code
, type
)
6735 enum tree_code operator_code
;
6738 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6745 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6749 push_void_library_fn (name
, parmtypes
)
6750 tree name
, parmtypes
;
6752 tree type
= build_function_type (void_type_node
, parmtypes
);
6753 return push_library_fn (name
, type
);
6756 /* Like push_library_fn, but also note that this function throws
6757 and does not return. Used for __throw_foo and the like. */
6760 push_throw_library_fn (name
, type
)
6763 tree fn
= push_library_fn (name
, type
);
6764 TREE_THIS_VOLATILE (fn
) = 1;
6765 TREE_NOTHROW (fn
) = 0;
6769 /* Apply default attributes to a function, if a system function with default
6773 insert_default_attributes (decl
)
6776 if (!DECL_EXTERN_C_FUNCTION_P (decl
))
6778 if (!TREE_PUBLIC (decl
))
6780 c_common_insert_default_attributes (decl
);
6783 /* When we call finish_struct for an anonymous union, we create
6784 default copy constructors and such. But, an anonymous union
6785 shouldn't have such things; this function undoes the damage to the
6786 anonymous union type T.
6788 (The reason that we create the synthesized methods is that we don't
6789 distinguish `union { int i; }' from `typedef union { int i; } U'.
6790 The first is an anonymous union; the second is just an ordinary
6794 fixup_anonymous_aggr (t
)
6799 /* Wipe out memory of synthesized methods */
6800 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6801 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6802 TYPE_HAS_INIT_REF (t
) = 0;
6803 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6804 TYPE_HAS_ASSIGN_REF (t
) = 0;
6805 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6807 /* Splice the implicitly generated functions out of the TYPE_METHODS
6809 q
= &TYPE_METHODS (t
);
6812 if (DECL_ARTIFICIAL (*q
))
6813 *q
= TREE_CHAIN (*q
);
6815 q
= &TREE_CHAIN (*q
);
6818 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6819 if (TYPE_METHODS (t
))
6820 cp_error_at ("an anonymous union cannot have function members", t
);
6822 /* Anonymous aggregates cannot have fields with ctors, dtors or complex
6823 assignment operators (because they cannot have these methods themselves).
6824 For anonymous unions this is already checked because they are not allowed
6825 in any union, otherwise we have to check it. */
6826 if (TREE_CODE (t
) != UNION_TYPE
)
6830 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
6831 if (TREE_CODE (field
) == FIELD_DECL
)
6833 type
= TREE_TYPE (field
);
6834 if (CLASS_TYPE_P (type
))
6836 if (TYPE_NEEDS_CONSTRUCTING (type
))
6837 cp_error_at ("member %#D' with constructor not allowed in anonymous aggregate",
6839 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
6840 cp_error_at ("member %#D' with destructor not allowed in anonymous aggregate",
6842 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type
))
6843 cp_error_at ("member %#D' with copy assignment operator not allowed in anonymous aggregate",
6850 /* Make sure that a declaration with no declarator is well-formed, i.e.
6851 just defines a tagged type or anonymous union.
6853 Returns the type defined, if any. */
6856 check_tag_decl (declspecs
)
6861 int saw_typedef
= 0;
6862 tree ob_modifier
= NULL_TREE
;
6864 register tree t
= NULL_TREE
;
6866 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6868 register tree value
= TREE_VALUE (link
);
6871 || TREE_CODE (value
) == TYPE_DECL
6872 || (TREE_CODE (value
) == IDENTIFIER_NODE
6873 && IDENTIFIER_GLOBAL_VALUE (value
)
6874 && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (value
)) == TYPE_DECL
))
6878 if (found_type
== 2 && TREE_CODE (value
) == IDENTIFIER_NODE
)
6880 if (! in_system_header
)
6881 cp_pedwarn ("redeclaration of C++ built-in type `%T'", value
);
6886 && ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6887 || TREE_CODE (value
) == ENUMERAL_TYPE
))
6889 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6893 else if (value
== ridpointers
[(int) RID_TYPEDEF
])
6895 else if (value
== ridpointers
[(int) RID_FRIEND
])
6897 if (current_class_type
== NULL_TREE
6898 || current_scope () != current_class_type
)
6899 ob_modifier
= value
;
6903 else if (value
== ridpointers
[(int) RID_STATIC
]
6904 || value
== ridpointers
[(int) RID_EXTERN
]
6905 || value
== ridpointers
[(int) RID_AUTO
]
6906 || value
== ridpointers
[(int) RID_REGISTER
]
6907 || value
== ridpointers
[(int) RID_INLINE
]
6908 || value
== ridpointers
[(int) RID_VIRTUAL
]
6909 || value
== ridpointers
[(int) RID_CONST
]
6910 || value
== ridpointers
[(int) RID_VOLATILE
]
6911 || value
== ridpointers
[(int) RID_EXPLICIT
])
6912 ob_modifier
= value
;
6916 error ("multiple types in one declaration");
6918 if (t
== NULL_TREE
&& ! saw_friend
)
6919 pedwarn ("declaration does not declare anything");
6921 /* Check for an anonymous union. */
6922 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6923 && TYPE_ANONYMOUS_P (t
))
6925 /* 7/3 In a simple-declaration, the optional init-declarator-list
6926 can be omitted only when declaring a class (clause 9) or
6927 enumeration (7.2), that is, when the decl-specifier-seq contains
6928 either a class-specifier, an elaborated-type-specifier with
6929 a class-key (9.1), or an enum-specifier. In these cases and
6930 whenever a class-specifier or enum-specifier is present in the
6931 decl-specifier-seq, the identifiers in these specifiers are among
6932 the names being declared by the declaration (as class-name,
6933 enum-names, or enumerators, depending on the syntax). In such
6934 cases, and except for the declaration of an unnamed bit-field (9.6),
6935 the decl-specifier-seq shall introduce one or more names into the
6936 program, or shall redeclare a name introduced by a previous
6937 declaration. [Example:
6938 enum { }; // ill-formed
6939 typedef class { }; // ill-formed
6943 error ("Missing type-name in typedef-declaration.");
6946 /* Anonymous unions are objects, so they can have specifiers. */;
6947 SET_ANON_AGGR_TYPE_P (t
);
6949 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6950 pedwarn ("ISO C++ prohibits anonymous structs");
6953 else if (ob_modifier
)
6955 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6956 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6957 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6958 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6959 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6960 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6961 cp_error ("`%D' can only be specified for constructors",
6964 cp_error ("`%D' can only be specified for objects and functions",
6971 /* Called when a declaration is seen that contains no names to declare.
6972 If its type is a reference to a structure, union or enum inherited
6973 from a containing scope, shadow that tag name for the current scope
6974 with a forward reference.
6975 If its type defines a new named structure or union
6976 or defines an enum, it is valid but we need not do anything here.
6977 Otherwise, it is an error.
6979 C++: may have to grok the declspecs to learn about static,
6980 complain for anonymous unions. */
6983 shadow_tag (declspecs
)
6986 tree t
= check_tag_decl (declspecs
);
6989 maybe_process_partial_specialization (t
);
6991 /* This is where the variables in an anonymous union are
6992 declared. An anonymous union declaration looks like:
6994 because there is no declarator after the union, the parser
6995 sends that declaration here. */
6996 if (t
&& ANON_AGGR_TYPE_P (t
))
6998 fixup_anonymous_aggr (t
);
7000 if (TYPE_FIELDS (t
))
7002 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7004 finish_anon_union (decl
);
7009 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7012 groktypename (typename
)
7015 if (TREE_CODE (typename
) != TREE_LIST
)
7017 return grokdeclarator (TREE_VALUE (typename
),
7018 TREE_PURPOSE (typename
),
7022 /* Decode a declarator in an ordinary declaration or data definition.
7023 This is called as soon as the type information and variable name
7024 have been parsed, before parsing the initializer if any.
7025 Here we create the ..._DECL node, fill in its type,
7026 and put it on the list of decls for the current context.
7027 The ..._DECL node is returned as the value.
7029 Exception: for arrays where the length is not specified,
7030 the type is left null, to be filled in by `cp_finish_decl'.
7032 Function definitions do not come here; they go to start_function
7033 instead. However, external and forward declarations of functions
7034 do go through here. Structure field declarations are done by
7035 grokfield and not through here. */
7038 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7039 tree declarator
, declspecs
;
7041 tree attributes
, prefix_attributes
;
7044 register tree type
, tem
;
7046 extern int have_extern_spec
;
7047 extern int used_extern_spec
;
7050 /* See code below that used this. */
7051 int init_written
= initialized
;
7054 /* This should only be done once on the top most decl. */
7055 if (have_extern_spec
&& !used_extern_spec
)
7057 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7059 used_extern_spec
= 1;
7062 attributes
= chainon (attributes
, prefix_attributes
);
7064 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7067 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7070 type
= TREE_TYPE (decl
);
7072 if (type
== error_mark_node
)
7075 context
= DECL_CONTEXT (decl
);
7077 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7078 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7080 /* When parsing the initializer, lookup should use the object's
7082 push_decl_namespace (context
);
7085 /* We are only interested in class contexts, later. */
7086 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7087 context
= NULL_TREE
;
7090 /* Is it valid for this decl to have an initializer at all?
7091 If not, set INITIALIZED to zero, which will indirectly
7092 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7093 switch (TREE_CODE (decl
))
7096 /* typedef foo = bar means give foo the same type as bar.
7097 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7098 Any other case of an initialization in a TYPE_DECL is an error. */
7099 if (pedantic
|| list_length (declspecs
) > 1)
7101 cp_error ("typedef `%D' is initialized", decl
);
7107 cp_error ("function `%#D' is initialized like a variable", decl
);
7117 if (! toplevel_bindings_p ()
7118 && DECL_EXTERNAL (decl
))
7119 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7121 DECL_EXTERNAL (decl
) = 0;
7122 if (toplevel_bindings_p ())
7123 TREE_STATIC (decl
) = 1;
7125 /* Tell `pushdecl' this is an initialized decl
7126 even though we don't yet have the initializer expression.
7127 Also tell `cp_finish_decl' it may store the real initializer. */
7128 DECL_INITIAL (decl
) = error_mark_node
;
7131 /* Set attributes here so if duplicate decl, will have proper attributes. */
7132 cplus_decl_attributes (&decl
, attributes
, 0);
7134 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7136 push_nested_class (context
, 2);
7138 if (TREE_CODE (decl
) == VAR_DECL
)
7140 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7141 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7142 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7145 if (DECL_CONTEXT (field
) != context
)
7147 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7148 DECL_CONTEXT (field
), DECL_NAME (decl
),
7149 context
, DECL_NAME (decl
));
7150 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7152 /* Static data member are tricky; an in-class initialization
7153 still doesn't provide a definition, so the in-class
7154 declaration will have DECL_EXTERNAL set, but will have an
7155 initialization. Thus, duplicate_decls won't warn
7156 about this situation, and so we check here. */
7157 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7158 cp_error ("duplicate initialization of %D", decl
);
7159 if (duplicate_decls (decl
, field
))
7165 tree field
= check_classfn (context
, decl
);
7166 if (field
&& duplicate_decls (decl
, field
))
7170 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7171 DECL_IN_AGGR_P (decl
) = 0;
7172 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7173 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7175 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7176 /* [temp.expl.spec] An explicit specialization of a static data
7177 member of a template is a definition if the declaration
7178 includes an initializer; otherwise, it is a declaration.
7180 We check for processing_specialization so this only applies
7181 to the new specialization syntax. */
7182 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7183 DECL_EXTERNAL (decl
) = 1;
7186 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7187 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7191 /* Enter this declaration into the symbol table. */
7192 tem
= maybe_push_decl (decl
);
7194 if (processing_template_decl
)
7195 tem
= push_template_decl (tem
);
7197 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7198 /* Tell the back-end to use or not use .common as appropriate. If we say
7199 -fconserve-space, we want this to save .data space, at the expense of
7200 wrong semantics. If we say -fno-conserve-space, we want this to
7201 produce errors about redefs; to do this we force variables into the
7203 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7206 if (! processing_template_decl
)
7216 tree type
= TREE_TYPE (decl
);
7217 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7219 if (type
== error_mark_node
)
7222 maybe_push_cleanup_level (type
);
7225 /* Is it valid for this decl to have an initializer at all?
7226 If not, set INITIALIZED to zero, which will indirectly
7227 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7229 /* Don't allow initializations for incomplete types except for
7230 arrays which might be completed by the initialization. */
7231 if (COMPLETE_TYPE_P (complete_type (type
)))
7232 ; /* A complete type is ok. */
7233 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7235 cp_error ("variable `%#D' has initializer but incomplete type",
7238 type
= TREE_TYPE (decl
) = error_mark_node
;
7240 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7242 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7243 cp_error ("elements of array `%#D' have incomplete type", decl
);
7244 /* else we already gave an error in start_decl. */
7250 && TREE_CODE (decl
) != TYPE_DECL
7251 && TREE_CODE (decl
) != TEMPLATE_DECL
7252 && type
!= error_mark_node
7253 && IS_AGGR_TYPE (type
)
7254 && ! DECL_EXTERNAL (decl
))
7256 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7257 && !COMPLETE_TYPE_P (complete_type (type
)))
7259 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7261 /* Change the type so that assemble_variable will give
7262 DECL an rtl we can live with: (mem (const_int 0)). */
7263 type
= TREE_TYPE (decl
) = error_mark_node
;
7267 /* If any base type in the hierarchy of TYPE needs a constructor,
7268 then we set initialized to 1. This way any nodes which are
7269 created for the purposes of initializing this aggregate
7270 will live as long as it does. This is necessary for global
7271 aggregates which do not have their initializers processed until
7272 the end of the file. */
7273 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7278 DECL_INITIAL (decl
) = NULL_TREE
;
7281 /* Handle initialization of references.
7282 These three arguments are from `cp_finish_decl', and have the
7283 same meaning here that they do there.
7285 Quotes on semantics can be found in ARM 8.4.3. */
7288 grok_reference_init (decl
, type
, init
)
7289 tree decl
, type
, init
;
7293 if (init
== NULL_TREE
)
7295 if ((DECL_LANG_SPECIFIC (decl
) == 0
7296 || DECL_IN_AGGR_P (decl
) == 0)
7297 && ! DECL_THIS_EXTERN (decl
))
7298 cp_error ("`%D' declared as reference but not initialized", decl
);
7302 if (init
== error_mark_node
)
7305 if (TREE_CODE (init
) == CONSTRUCTOR
)
7307 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7311 if (TREE_CODE (init
) == TREE_LIST
)
7312 init
= build_compound_expr (init
);
7314 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7315 init
= convert_from_reference (init
);
7317 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7318 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7320 /* Note: default conversion is only called in very special cases. */
7321 init
= default_conversion (init
);
7324 /* Convert INIT to the reference type TYPE. This may involve the
7325 creation of a temporary, whose lifetime must be the same as that
7326 of the reference. If so, a DECL_STMT for the temporary will be
7327 added just after the DECL_STMT for DECL. That's why we don't set
7328 DECL_INITIAL for local references (instead assigning to them
7329 explicitly); we need to allow the temporary to be initialized
7331 tmp
= convert_to_reference
7332 (type
, init
, CONV_IMPLICIT
,
7333 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7336 if (tmp
== error_mark_node
)
7338 else if (tmp
== NULL_TREE
)
7340 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7344 if (TREE_STATIC (decl
) && !TREE_CONSTANT (tmp
))
7347 DECL_INITIAL (decl
) = tmp
;
7352 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7353 mucking with forces it does not comprehend (i.e. initialization with a
7354 constructor). If we are at global scope and won't go into COMMON, fill
7355 it in with a dummy CONSTRUCTOR to force the variable into .data;
7356 otherwise we can use error_mark_node. */
7359 obscure_complex_init (decl
, init
)
7362 if (! flag_no_inline
&& TREE_STATIC (decl
))
7364 if (extract_init (decl
, init
))
7368 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7369 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7370 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7374 DECL_INITIAL (decl
) = error_mark_node
;
7379 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7380 array until we finish parsing the initializer. If that's the
7381 situation we're in, update DECL accordingly. */
7384 maybe_deduce_size_from_array_init (decl
, init
)
7388 tree type
= TREE_TYPE (decl
);
7390 if (TREE_CODE (type
) == ARRAY_TYPE
7391 && TYPE_DOMAIN (type
) == NULL_TREE
7392 && TREE_CODE (decl
) != TYPE_DECL
)
7394 /* do_default is really a C-ism to deal with tentative definitions.
7395 But let's leave it here to ease the eventual merge. */
7396 int do_default
= !DECL_EXTERNAL (decl
);
7397 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7398 int failure
= complete_array_type (type
, initializer
, do_default
);
7401 cp_error ("initializer fails to determine size of `%D'", decl
);
7406 cp_error ("array size missing in `%D'", decl
);
7407 /* If a `static' var's size isn't known, make it extern as
7408 well as static, so it does not get allocated. If it's not
7409 `static', then don't mark it extern; finish_incomplete_decl
7410 will give it a default size and it will get allocated. */
7411 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7412 DECL_EXTERNAL (decl
) = 1;
7415 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7416 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7418 cp_error ("zero-size array `%D'", decl
);
7420 layout_decl (decl
, 0);
7424 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7425 any appropriate error messages regarding the layout. */
7428 layout_var_decl (decl
)
7431 tree type
= TREE_TYPE (decl
);
7433 tree ttype
= target_type (type
);
7436 /* If we haven't already layed out this declaration, do so now.
7437 Note that we must not call complete type for an external object
7438 because it's type might involve templates that we are not
7439 supposed to isntantiate yet. (And it's perfectly legal to say
7440 `extern X x' for some incomplete type `X'.) */
7441 if (!DECL_EXTERNAL (decl
))
7442 complete_type (type
);
7443 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7444 layout_decl (decl
, 0);
7446 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7448 /* An automatic variable with an incomplete type: that is an error.
7449 Don't talk about array types here, since we took care of that
7450 message in grokdeclarator. */
7451 cp_error ("storage size of `%D' isn't known", decl
);
7452 TREE_TYPE (decl
) = error_mark_node
;
7455 /* Keep this code around in case we later want to control debug info
7456 based on whether a type is "used". (jason 1999-11-11) */
7458 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7459 /* Let debugger know it should output info for this type. */
7460 note_debug_info_needed (ttype
);
7462 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7463 note_debug_info_needed (DECL_CONTEXT (decl
));
7466 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7467 && DECL_SIZE (decl
) != NULL_TREE
7468 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7470 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7471 constant_expression_warning (DECL_SIZE (decl
));
7473 cp_error ("storage size of `%D' isn't constant", decl
);
7476 if (TREE_STATIC (decl
)
7477 && !DECL_ARTIFICIAL (decl
)
7478 && current_function_decl
7479 && DECL_CONTEXT (decl
) == current_function_decl
)
7480 push_local_name (decl
);
7483 /* If a local static variable is declared in an inline function, or if
7484 we have a weak definition, we must endeavor to create only one
7485 instance of the variable at link-time. */
7488 maybe_commonize_var (decl
)
7491 /* Static data in a function with comdat linkage also has comdat
7493 if (TREE_STATIC (decl
)
7494 /* Don't mess with __FUNCTION__. */
7495 && ! DECL_ARTIFICIAL (decl
)
7496 && current_function_decl
7497 && DECL_CONTEXT (decl
) == current_function_decl
7498 && (DECL_DECLARED_INLINE_P (current_function_decl
)
7499 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7500 && TREE_PUBLIC (current_function_decl
))
7502 /* If flag_weak, we don't need to mess with this, as we can just
7503 make the function weak, and let it refer to its unique local
7504 copy. This works because we don't allow the function to be
7508 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7510 TREE_PUBLIC (decl
) = 1;
7511 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7513 else if (DECL_INITIAL (decl
) == NULL_TREE
7514 || DECL_INITIAL (decl
) == error_mark_node
)
7516 TREE_PUBLIC (decl
) = 1;
7517 DECL_COMMON (decl
) = 1;
7519 /* else we lose. We can only do this if we can use common,
7520 which we can't if it has been initialized. */
7522 if (!TREE_PUBLIC (decl
))
7524 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7525 cp_warning_at (" you can work around this by removing the initializer", decl
);
7529 comdat_linkage (decl
);
7531 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7532 /* Set it up again; we might have set DECL_INITIAL since the last
7534 comdat_linkage (decl
);
7537 /* Issue an error message if DECL is an uninitialized const variable. */
7540 check_for_uninitialized_const_var (decl
)
7543 tree type
= TREE_TYPE (decl
);
7545 /* ``Unless explicitly declared extern, a const object does not have
7546 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7548 if (TREE_CODE (decl
) == VAR_DECL
7549 && TREE_CODE (type
) != REFERENCE_TYPE
7550 && CP_TYPE_CONST_P (type
)
7551 && !TYPE_NEEDS_CONSTRUCTING (type
)
7552 && !DECL_INITIAL (decl
))
7553 cp_error ("uninitialized const `%D'", decl
);
7556 /* Verify INIT (the initializer for DECL), and record the
7557 initialization in DECL_INITIAL, if appropriate. Returns a new
7561 check_initializer (decl
, init
)
7567 if (TREE_CODE (decl
) == FIELD_DECL
)
7570 type
= TREE_TYPE (decl
);
7572 /* If `start_decl' didn't like having an initialization, ignore it now. */
7573 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7576 /* Check the initializer. */
7579 /* Things that are going to be initialized need to have complete
7581 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7583 if (type
== error_mark_node
)
7584 /* We will have already complained. */
7586 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7588 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7591 else if (TREE_CODE (type
) == ARRAY_TYPE
7592 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7594 cp_error ("elements of array `%#D' have incomplete type", decl
);
7597 else if (!COMPLETE_TYPE_P (type
))
7599 cp_error ("`%D' has incomplete type", decl
);
7600 TREE_TYPE (decl
) = error_mark_node
;
7605 if (TREE_CODE (decl
) == CONST_DECL
)
7607 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7609 DECL_INITIAL (decl
) = init
;
7611 my_friendly_assert (init
!= NULL_TREE
, 149);
7614 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7616 init
= grok_reference_init (decl
, type
, init
);
7618 init
= obscure_complex_init (decl
, init
);
7622 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7624 if (TREE_CODE (type
) == ARRAY_TYPE
)
7625 init
= digest_init (type
, init
, (tree
*) 0);
7626 else if (TREE_CODE (init
) == CONSTRUCTOR
7627 && TREE_HAS_CONSTRUCTOR (init
))
7629 if (TYPE_NON_AGGREGATE_CLASS (type
))
7631 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7633 init
= error_mark_node
;
7636 goto dont_use_constructor
;
7641 dont_use_constructor
:
7642 if (TREE_CODE (init
) != TREE_VEC
)
7643 init
= store_init_value (decl
, init
);
7647 /* We must hide the initializer so that expand_decl
7648 won't try to do something it does not understand. */
7649 init
= obscure_complex_init (decl
, init
);
7651 else if (DECL_EXTERNAL (decl
))
7653 else if (TYPE_P (type
)
7654 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7656 tree core_type
= strip_array_types (type
);
7658 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7660 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7661 cp_error ("structure `%D' with uninitialized const members", decl
);
7662 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7663 cp_error ("structure `%D' with uninitialized reference members",
7667 check_for_uninitialized_const_var (decl
);
7669 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7670 init
= obscure_complex_init (decl
, NULL_TREE
);
7674 check_for_uninitialized_const_var (decl
);
7679 /* If DECL is not a local variable, give it RTL. */
7682 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7685 const char *asmspec
;
7687 int toplev
= toplevel_bindings_p ();
7690 /* Handle non-variables up front. */
7691 if (TREE_CODE (decl
) != VAR_DECL
)
7693 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7697 /* If we see a class member here, it should be a static data
7699 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7701 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7702 /* An in-class declaration of a static data member should be
7703 external; it is only a declaration, and not a definition. */
7704 if (init
== NULL_TREE
)
7705 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7708 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7711 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (asmspec
));
7712 /* The `register' keyword, when used together with an
7713 asm-specification, indicates that the variable should be
7714 placed in a particular register. */
7715 if (DECL_REGISTER (decl
))
7716 DECL_C_HARD_REGISTER (decl
) = 1;
7719 /* We don't create any RTL for local variables. */
7720 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7723 /* We defer emission of local statics until the corresponding
7724 DECL_STMT is expanded. */
7725 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7727 /* We try to defer namespace-scope static constants so that they are
7728 not emitted into the object file unncessarily. */
7729 if (!DECL_VIRTUAL_P (decl
)
7730 && TREE_READONLY (decl
)
7731 && DECL_INITIAL (decl
) != NULL_TREE
7732 && DECL_INITIAL (decl
) != error_mark_node
7733 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7735 && !TREE_PUBLIC (decl
))
7737 /* Fool with the linkage according to #pragma interface. */
7738 if (!interface_unknown
)
7740 TREE_PUBLIC (decl
) = 1;
7741 DECL_EXTERNAL (decl
) = interface_only
;
7747 /* If we're deferring the variable, we only need to make RTL if
7748 there's an ASMSPEC. Otherwise, we'll lazily create it later when
7749 we need it. (There's no way to lazily create RTL for things that
7750 have assembly specs because the information about the specifier
7751 isn't stored in the tree, yet) */
7752 if (defer_p
&& asmspec
)
7753 make_decl_rtl (decl
, asmspec
);
7754 /* If we're not deferring, go ahead and assemble the variable. */
7756 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7759 /* The old ARM scoping rules injected variables declared in the
7760 initialization statement of a for-statement into the surrounding
7761 scope. We support this usage, in order to be backward-compatible.
7762 DECL is a just-declared VAR_DECL; if necessary inject its
7763 declaration into the surrounding scope. */
7766 maybe_inject_for_scope_var (decl
)
7769 if (!DECL_NAME (decl
))
7772 if (current_binding_level
->is_for_scope
)
7774 struct binding_level
*outer
7775 = current_binding_level
->level_chain
;
7777 /* Check to see if the same name is already bound at the outer
7778 level, either because it was directly declared, or because a
7779 dead for-decl got preserved. In either case, the code would
7780 not have been valid under the ARM scope rules, so clear
7781 is_for_scope for the current_binding_level.
7783 Otherwise, we need to preserve the temp slot for decl to last
7784 into the outer binding level. */
7787 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7789 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7790 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7792 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7794 BINDING_VALUE (outer_binding
)
7795 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7796 current_binding_level
->is_for_scope
= 0;
7798 else if (DECL_IN_MEMORY_P (decl
))
7799 preserve_temp_slots (DECL_RTL (decl
));
7803 /* Generate code to initialize DECL (a local variable). */
7806 initialize_local_var (decl
, init
, flags
)
7811 tree type
= TREE_TYPE (decl
);
7813 /* If the type is bogus, don't bother initializing the variable. */
7814 if (type
== error_mark_node
)
7817 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7819 /* If we used it already as memory, it must stay in memory. */
7820 DECL_INITIAL (decl
) = NULL_TREE
;
7821 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7824 /* Local statics are handled differently from ordinary automatic
7826 if (TREE_STATIC (decl
))
7828 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7829 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7830 expand_static_init (decl
, init
);
7834 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7838 /* Compute and store the initial value. */
7839 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7841 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7843 int saved_stmts_are_full_exprs_p
;
7845 my_friendly_assert (building_stmt_tree (), 20000906);
7846 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7847 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7848 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7849 current_stmt_tree ()->stmts_are_full_exprs_p
=
7850 saved_stmts_are_full_exprs_p
;
7853 /* Set this to 0 so we can tell whether an aggregate which was
7854 initialized was ever used. Don't do this if it has a
7855 destructor, so we don't complain about the 'resource
7856 allocation is initialization' idiom. Now set
7857 attribute((unused)) on types so decls of that type will be
7858 marked used. (see TREE_USED, above.) */
7859 if (TYPE_NEEDS_CONSTRUCTING (type
)
7861 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7862 && DECL_NAME (decl
))
7863 TREE_USED (decl
) = 0;
7864 else if (already_used
)
7865 TREE_USED (decl
) = 1;
7869 /* Generate code to destroy DECL (a local variable). */
7872 destroy_local_var (decl
)
7875 tree type
= TREE_TYPE (decl
);
7878 /* Only variables get cleaned up. */
7879 if (TREE_CODE (decl
) != VAR_DECL
)
7882 /* And only things with destructors need cleaning up. */
7883 if (type
== error_mark_node
7884 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7887 if (TREE_CODE (decl
) == VAR_DECL
&&
7888 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7889 /* We don't clean up things that aren't defined in this
7890 translation unit, or that need a static cleanup. The latter
7891 are handled by finish_file. */
7894 /* Compute the cleanup. */
7895 cleanup
= maybe_build_cleanup (decl
);
7897 /* Record the cleanup required for this declaration. */
7898 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7900 finish_decl_cleanup (decl
, cleanup
);
7903 /* Finish processing of a declaration;
7904 install its line number and initial value.
7905 If the length of an array type is not known before,
7906 it must be determined now, from the initial value, or it is an error.
7908 INIT holds the value of an initializer that should be allowed to escape
7911 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7912 if the (init) syntax was used. */
7915 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7921 tree ttype
= NULL_TREE
;
7922 const char *asmspec
= NULL
;
7923 int was_readonly
= 0;
7928 error ("assignment (not initialization) in declaration");
7932 /* If a name was specified, get the string. */
7934 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7936 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7938 cp_error ("cannot initialize `%D' to namespace `%D'",
7943 if (current_class_type
7944 && CP_DECL_CONTEXT (decl
) == current_class_type
7945 && TYPE_BEING_DEFINED (current_class_type
)
7946 && (DECL_INITIAL (decl
) || init
))
7947 DECL_INITIALIZED_IN_CLASS_P (decl
) = 1;
7949 if (TREE_CODE (decl
) == VAR_DECL
7950 && DECL_CONTEXT (decl
)
7951 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7952 && DECL_CONTEXT (decl
) != current_namespace
7955 /* Leave the namespace of the object. */
7956 pop_decl_namespace ();
7959 type
= TREE_TYPE (decl
);
7961 if (type
== error_mark_node
)
7964 if (TYPE_HAS_MUTABLE_P (type
))
7965 TREE_READONLY (decl
) = 0;
7967 if (processing_template_decl
)
7969 /* Add this declaration to the statement-tree. */
7970 if (at_function_scope_p ()
7971 && TREE_CODE (decl
) != RESULT_DECL
)
7972 add_decl_stmt (decl
);
7974 if (init
&& DECL_INITIAL (decl
))
7975 DECL_INITIAL (decl
) = init
;
7979 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7980 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7982 /* Take care of TYPE_DECLs up front. */
7983 if (TREE_CODE (decl
) == TYPE_DECL
)
7985 if (init
&& DECL_INITIAL (decl
))
7987 /* typedef foo = bar; store the type of bar as the type of foo. */
7988 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7989 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7991 if (type
!= error_mark_node
7992 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7994 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7995 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7996 set_identifier_type_value (DECL_NAME (decl
), type
);
7997 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7999 GNU_xref_decl (current_function_decl
, decl
);
8001 /* If we have installed this as the canonical typedef for this
8002 type, and that type has not been defined yet, delay emitting
8003 the debug information for it, as we will emit it later. */
8004 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8005 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8006 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8008 rest_of_decl_compilation (decl
, NULL
,
8009 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8013 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8014 ttype
= target_type (type
);
8016 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8017 && TYPE_NEEDS_CONSTRUCTING (type
))
8019 /* Currently, GNU C++ puts constants in text space, making them
8020 impossible to initialize. In the future, one would hope for
8021 an operating system which understood the difference between
8022 initialization and the running of a program. */
8024 TREE_READONLY (decl
) = 0;
8027 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8029 /* This must override the asm specifier which was placed by
8030 grokclassfn. Lay this out fresh. */
8031 SET_DECL_RTL (TREE_TYPE (decl
), NULL_RTX
);
8032 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (asmspec
));
8033 make_decl_rtl (decl
, asmspec
);
8036 /* Deduce size of array from initialization, if not already known. */
8037 maybe_deduce_size_from_array_init (decl
, init
);
8038 init
= check_initializer (decl
, init
);
8040 GNU_xref_decl (current_function_decl
, decl
);
8042 /* Add this declaration to the statement-tree. This needs to happen
8043 after the call to check_initializer so that the DECL_STMT for a
8044 reference temp is added before the DECL_STMT for the reference itself. */
8045 if (building_stmt_tree ()
8046 && at_function_scope_p ()
8047 && TREE_CODE (decl
) != RESULT_DECL
)
8048 add_decl_stmt (decl
);
8050 if (TREE_CODE (decl
) == VAR_DECL
)
8051 layout_var_decl (decl
);
8053 /* Output the assembler code and/or RTL code for variables and functions,
8054 unless the type is an undefined structure or union.
8055 If not, it will get done when the type is completed. */
8056 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8057 || TREE_CODE (decl
) == RESULT_DECL
)
8059 if (TREE_CODE (decl
) == VAR_DECL
)
8060 maybe_commonize_var (decl
);
8062 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8064 if (TREE_CODE (type
) == FUNCTION_TYPE
8065 || TREE_CODE (type
) == METHOD_TYPE
)
8066 abstract_virtuals_error (decl
,
8067 strip_array_types (TREE_TYPE (type
)));
8069 abstract_virtuals_error (decl
, strip_array_types (type
));
8071 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8073 else if (DECL_EXTERNAL (decl
)
8074 && ! (DECL_LANG_SPECIFIC (decl
)
8075 && DECL_NOT_REALLY_EXTERN (decl
)))
8078 DECL_INITIAL (decl
) = init
;
8080 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8082 /* This is a local declaration. */
8083 if (doing_semantic_analysis_p ())
8084 maybe_inject_for_scope_var (decl
);
8085 /* Initialize the local variable. But, if we're building a
8086 statement-tree, we'll do the initialization when we
8088 if (processing_template_decl
)
8090 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8091 DECL_INITIAL (decl
) = init
;
8095 /* If we're not building RTL, then we need to do so
8097 my_friendly_assert (building_stmt_tree (), 20000906);
8098 /* Initialize the variable. */
8099 initialize_local_var (decl
, init
, flags
);
8100 /* Clean up the variable. */
8101 destroy_local_var (decl
);
8104 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8106 /* Cleanups for static variables are handled by `finish_file'. */
8107 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8108 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8109 expand_static_init (decl
, init
);
8113 /* Undo call to `pushclass' that was done in `start_decl'
8114 due to initialization of qualified member variable.
8115 I.e., Foo::x = 10; */
8117 tree context
= CP_DECL_CONTEXT (decl
);
8120 && (TREE_CODE (decl
) == VAR_DECL
8121 /* We also have a pushclass done that we need to undo here
8122 if we're at top level and declare a method. */
8123 || TREE_CODE (decl
) == FUNCTION_DECL
)
8124 /* If size hasn't been set, we're still defining it,
8125 and therefore inside the class body; don't pop
8126 the binding level.. */
8127 && COMPLETE_TYPE_P (context
)
8128 && context
== current_class_type
)
8129 pop_nested_class ();
8136 TREE_READONLY (decl
) = 1;
8139 /* This is here for a midend callback from c-common.c */
8142 finish_decl (decl
, init
, asmspec_tree
)
8146 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8149 /* Returns a declaration for a VAR_DECL as if:
8151 extern "C" TYPE NAME;
8153 had been seen. Used to create compiler-generated global
8157 declare_global_var (name
, type
)
8163 push_to_top_level ();
8164 decl
= build_decl (VAR_DECL
, name
, type
);
8165 TREE_PUBLIC (decl
) = 1;
8166 DECL_EXTERNAL (decl
) = 1;
8167 DECL_ARTIFICIAL (decl
) = 1;
8169 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8170 pop_from_top_level ();
8175 /* Returns a pointer to the `atexit' function. Note that if
8176 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8177 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8191 if (flag_use_cxa_atexit
)
8193 /* The declaration for `__cxa_atexit' is:
8195 int __cxa_atexit (void (*)(void *), void *, void *)
8197 We build up the argument types and then then function type
8200 /* First, build the pointer-to-function type for the first
8202 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8203 fn_type
= build_function_type (void_type_node
, arg_types
);
8204 fn_ptr_type
= build_pointer_type (fn_type
);
8205 /* Then, build the rest of the argument types. */
8206 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8207 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8208 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8209 /* And the final __cxa_atexit type. */
8210 fn_type
= build_function_type (integer_type_node
, arg_types
);
8211 fn_ptr_type
= build_pointer_type (fn_type
);
8212 name
= "__cxa_atexit";
8216 /* The declaration for `atexit' is:
8218 int atexit (void (*)());
8220 We build up the argument types and then then function type
8222 fn_type
= build_function_type (void_type_node
, void_list_node
);
8223 fn_ptr_type
= build_pointer_type (fn_type
);
8224 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8225 /* Build the final atexit type. */
8226 fn_type
= build_function_type (integer_type_node
, arg_types
);
8230 /* Now, build the function declaration. */
8231 push_lang_context (lang_name_c
);
8232 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8233 mark_used (atexit_fndecl
);
8234 pop_lang_context ();
8235 atexit_node
= default_conversion (atexit_fndecl
);
8240 /* Returns the __dso_handle VAR_DECL. */
8243 get_dso_handle_node ()
8245 if (dso_handle_node
)
8246 return dso_handle_node
;
8248 /* Declare the variable. */
8249 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8252 return dso_handle_node
;
8255 /* Begin a new function with internal linkage whose job will be simply
8256 to destroy some particular variable. */
8261 static int counter
= 0;
8262 int old_interface_unknown
= interface_unknown
;
8268 push_to_top_level ();
8270 /* No need to mangle this. */
8271 push_lang_context (lang_name_c
);
8273 interface_unknown
= 1;
8275 /* Build the parameter-types. */
8276 parmtypes
= void_list_node
;
8277 /* Functions passed to __cxa_atexit take an additional parameter.
8278 We'll just ignore it. After we implement the new calling
8279 convention for destructors, we can eliminate the use of
8280 additional cleanup functions entirely in the -fnew-abi case. */
8281 if (flag_use_cxa_atexit
)
8282 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8283 /* Build the function type itself. */
8284 fntype
= build_function_type (void_type_node
, parmtypes
);
8285 /* Build the name of the function. */
8286 sprintf (name
, "__tcf_%d", counter
++);
8287 /* Build the function declaration. */
8288 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8289 /* It's a function with internal linkage, generated by the
8291 TREE_PUBLIC (fndecl
) = 0;
8292 DECL_ARTIFICIAL (fndecl
) = 1;
8293 /* Make the function `inline' so that it is only emitted if it is
8294 actually needed. It is unlikely that it will be inlined, since
8295 it is only called via a function pointer, but we avoid unncessary
8296 emissions this way. */
8297 DECL_INLINE (fndecl
) = 1;
8298 /* Build the parameter. */
8299 if (flag_use_cxa_atexit
)
8303 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8304 DECL_CONTEXT (parmdecl
) = fndecl
;
8305 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8306 TREE_USED (parmdecl
) = 1;
8307 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8311 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8314 interface_unknown
= old_interface_unknown
;
8316 pop_lang_context ();
8318 return current_function_decl
;
8321 /* Finish the cleanup function begun by start_cleanup_fn. */
8328 expand_body (finish_function (0));
8330 pop_from_top_level ();
8333 /* Generate code to handle the destruction of DECL, an object with
8334 static storage duration. */
8337 register_dtor_fn (decl
)
8345 int saved_flag_access_control
;
8347 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8350 /* Call build_cleanup before we enter the anonymous function so that
8351 any access checks will be done relative to the current scope,
8352 rather than the scope of the anonymous function. */
8353 build_cleanup (decl
);
8355 /* Now start the function. */
8356 cleanup
= start_cleanup_fn ();
8358 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8359 to the original function, rather than the anonymous one. That
8360 will make the back-end think that nested functions are in use,
8361 which causes confusion. */
8362 saved_flag_access_control
= flag_access_control
;
8363 flag_access_control
= 0;
8364 fcall
= build_cleanup (decl
);
8365 flag_access_control
= saved_flag_access_control
;
8367 /* Create the body of the anonymous function. */
8368 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8369 finish_expr_stmt (fcall
);
8370 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8373 /* Call atexit with the cleanup function. */
8374 mark_addressable (cleanup
);
8375 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8376 if (flag_use_cxa_atexit
)
8378 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8379 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8380 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8383 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8384 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8388 expand_static_init (decl
, init
)
8392 tree oldstatic
= value_member (decl
, static_aggregates
);
8396 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8397 cp_error ("multiple initializations given for `%D'", decl
);
8399 else if (! toplevel_bindings_p ())
8401 /* Emit code to perform this initialization but once. */
8408 /* Emit code to perform this initialization but once. This code
8411 static int guard = 0;
8413 // Do initialization.
8415 // Register variable for destruction at end of program.
8418 Note that the `temp' variable is only set to 1 *after* the
8419 initialization is complete. This ensures that an exception,
8420 thrown during the construction, will cause the variable to
8421 reinitialized when we pass through this code again, as per:
8425 If the initialization exits by throwing an exception, the
8426 initialization is not complete, so it will be tried again
8427 the next time control enters the declaration.
8429 In theory, this process should be thread-safe, too; multiple
8430 threads should not be able to initialize the variable more
8431 than once. We don't yet attempt to ensure thread-safety. */
8433 /* Create the guard variable. */
8434 guard
= get_guard (decl
);
8436 /* Begin the conditional initialization. */
8437 if_stmt
= begin_if_stmt ();
8438 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8439 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8441 /* Do the initialization itself. */
8442 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8443 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8444 assignment
= build_aggr_init (decl
, init
, 0);
8446 /* The initialization we're doing here is just a bitwise
8448 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8450 assignment
= NULL_TREE
;
8452 /* Once the assignment is complete, set TEMP to 1. Since the
8453 construction of the static object is complete at this point,
8454 we want to make sure TEMP is set to 1 even if a temporary
8455 constructed during the initialization throws an exception
8456 when it is destroyed. So, we combine the initialization and
8457 the assignment to TEMP into a single expression, ensuring
8458 that when we call finish_expr_stmt the cleanups will not be
8459 run until after TEMP is set to 1. */
8460 guard_init
= set_guard (guard
);
8463 assignment
= tree_cons (NULL_TREE
, assignment
,
8464 build_tree_list (NULL_TREE
,
8466 assignment
= build_compound_expr (assignment
);
8469 assignment
= guard_init
;
8470 finish_expr_stmt (assignment
);
8472 /* Use atexit to register a function for destroying this static
8474 register_dtor_fn (decl
);
8476 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8477 finish_then_clause (if_stmt
);
8481 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8484 /* Finish the declaration of a catch-parameter. */
8487 start_handler_parms (declspecs
, declarator
)
8494 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8496 if (decl
== NULL_TREE
)
8497 error ("invalid catch parameter");
8506 /* Make TYPE a complete type based on INITIAL_VALUE.
8507 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8508 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8511 complete_array_type (type
, initial_value
, do_default
)
8512 tree type
, initial_value
;
8515 register tree maxindex
= NULL_TREE
;
8520 /* An array of character type can be initialized from a
8521 brace-enclosed string constant. */
8522 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8523 && TREE_CODE (initial_value
) == CONSTRUCTOR
8524 && CONSTRUCTOR_ELTS (initial_value
)
8525 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8527 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8528 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8530 /* Note MAXINDEX is really the maximum index, one less than the
8532 if (TREE_CODE (initial_value
) == STRING_CST
)
8535 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8536 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8539 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8541 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8543 maxindex
= ssize_int (-1);
8544 for (; elts
; elts
= TREE_CHAIN (elts
))
8546 if (TREE_PURPOSE (elts
))
8547 maxindex
= TREE_PURPOSE (elts
);
8549 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8551 maxindex
= copy_node (maxindex
);
8555 /* Make an error message unless that happened already. */
8556 if (initial_value
!= error_mark_node
)
8559 initial_value
= NULL_TREE
;
8561 /* Prevent further error messages. */
8562 maxindex
= build_int_2 (0, 0);
8569 maxindex
= build_int_2 (0, 0);
8578 domain
= build_index_type (maxindex
);
8579 TYPE_DOMAIN (type
) = domain
;
8581 if (! TREE_TYPE (maxindex
))
8582 TREE_TYPE (maxindex
) = domain
;
8584 itype
= TREE_TYPE (initial_value
);
8587 if (itype
&& !TYPE_DOMAIN (itype
))
8588 TYPE_DOMAIN (itype
) = domain
;
8589 /* The type of the main variant should never be used for arrays
8590 of different sizes. It should only ever be completed with the
8591 size of the array. */
8592 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8593 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8596 /* Lay out the type now that we can get the real answer. */
8603 /* Return zero if something is declared to be a member of type
8604 CTYPE when in the context of CUR_TYPE. STRING is the error
8605 message to print in that case. Otherwise, quietly return 1. */
8608 member_function_or_else (ctype
, cur_type
, flags
)
8609 tree ctype
, cur_type
;
8610 enum overload_flags flags
;
8612 if (ctype
&& ctype
!= cur_type
)
8614 if (flags
== DTOR_FLAG
)
8615 cp_error ("destructor for alien class `%T' cannot be a member",
8618 cp_error ("constructor for alien class `%T' cannot be a member",
8625 /* Subroutine of `grokdeclarator'. */
8627 /* Generate errors possibly applicable for a given set of specifiers.
8628 This is for ARM $7.1.2. */
8631 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8634 int virtualp
, quals
, friendp
, raises
, inlinep
;
8637 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8639 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8641 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8644 cp_error_at ("`%D' declared as a friend", object
);
8645 if (raises
&& !TYPE_PTRFN_P (TREE_TYPE (object
))
8646 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object
)))
8647 cp_error_at ("`%D' declared with an exception specification", object
);
8650 /* CTYPE is class type, or null if non-class.
8651 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8653 DECLARATOR is the function's name.
8654 VIRTUALP is truthvalue of whether the function is virtual or not.
8655 FLAGS are to be passed through to `grokclassfn'.
8656 QUALS are qualifiers indicating whether the function is `const'
8658 RAISES is a list of exceptions that this function can raise.
8659 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8660 not look, and -1 if we should not call `grokclassfn' at all.
8662 Returns `NULL_TREE' if something goes wrong, after issuing
8663 applicable error messages. */
8666 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8667 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8668 template_count
, in_namespace
)
8671 tree orig_declarator
;
8673 enum overload_flags flags
;
8675 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8679 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8680 int has_default_arg
= 0;
8685 type
= build_exception_variant (type
, raises
);
8688 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8689 /* Propagate volatile out from type to decl. */
8690 if (TYPE_VOLATILE (type
))
8691 TREE_THIS_VOLATILE (decl
) = 1;
8693 /* If this decl has namespace scope, set that up. */
8695 set_decl_namespace (decl
, in_namespace
, friendp
);
8697 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8699 /* `main' and builtins have implicit 'C' linkage. */
8700 if ((MAIN_NAME_P (declarator
)
8701 || (IDENTIFIER_LENGTH (declarator
) > 10
8702 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8703 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8704 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8705 && current_lang_name
== lang_name_cplusplus
8706 && ctype
== NULL_TREE
8707 /* NULL_TREE means global namespace. */
8708 && DECL_CONTEXT (decl
) == NULL_TREE
)
8709 SET_DECL_LANGUAGE (decl
, lang_c
);
8711 /* Should probably propagate const out from type to decl I bet (mrs). */
8714 DECL_STATIC_FUNCTION_P (decl
) = 1;
8715 DECL_CONTEXT (decl
) = ctype
;
8719 DECL_CONTEXT (decl
) = ctype
;
8721 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8723 if (processing_template_decl
)
8724 error ("cannot declare `::main' to be a template");
8726 error ("cannot declare `::main' to be inline");
8728 error ("cannot declare `::main' to be static");
8729 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8731 error ("`main' must return `int'");
8736 /* Members of anonymous types and local classes have no linkage; make
8738 /* FIXME what if it gets a name from typedef? */
8739 if (ctype
&& (TYPE_ANONYMOUS_P (ctype
)
8740 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8745 /* [basic.link]: A name with no linkage (notably, the name of a class
8746 or enumeration declared in a local scope) shall not be used to
8747 declare an entity with linkage.
8749 Only check this for public decls for now. */
8750 t
= no_linkage_check (TREE_TYPE (decl
));
8753 if (TYPE_ANONYMOUS_P (t
))
8755 if (DECL_EXTERN_C_P (decl
))
8756 /* Allow this; it's pretty common in C. */;
8759 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8761 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t
)))
8763 `%#D' does not refer to the unqualified type, so it is not used for linkage",
8768 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8773 TREE_PUBLIC (decl
) = publicp
;
8776 DECL_INTERFACE_KNOWN (decl
) = 1;
8777 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8780 /* If the declaration was declared inline, mark it as such. */
8782 DECL_DECLARED_INLINE_P (decl
) = 1;
8783 /* We inline functions that are explicitly declared inline, or, when
8784 the user explicitly asks us to, all functions. */
8785 if (DECL_DECLARED_INLINE_P (decl
) || flag_inline_trees
== 2)
8786 DECL_INLINE (decl
) = 1;
8788 DECL_EXTERNAL (decl
) = 1;
8789 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8791 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8792 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8796 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8797 grok_op_properties (decl
, virtualp
, check
< 0);
8799 if (ctype
&& decl_function_context (decl
))
8800 DECL_NO_STATIC_CHAIN (decl
) = 1;
8802 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8803 if (TREE_PURPOSE (t
)
8804 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8806 has_default_arg
= 1;
8811 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8815 ("defining explicit specialization `%D' in friend declaration",
8819 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8820 tree args
= TREE_OPERAND (orig_declarator
, 1);
8822 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8824 /* Something like `template <class T> friend void f<T>()'. */
8825 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8831 /* A friend declaration of the form friend void f<>(). Record
8832 the information in the TEMPLATE_ID_EXPR. */
8833 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8835 if (TREE_CODE (fns
) == COMPONENT_REF
)
8837 /* Due to bison parser ickiness, we will have already looked
8838 up an operator_name or PFUNCNAME within the current class
8839 (see template_id in parse.y). If the current class contains
8840 such a name, we'll get a COMPONENT_REF here. Undo that. */
8842 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8843 == current_class_type
, 20001120);
8844 fns
= TREE_OPERAND (fns
, 1);
8846 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8847 || TREE_CODE (fns
) == LOOKUP_EXPR
8848 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8849 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8851 if (has_default_arg
)
8853 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8860 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8867 if (has_default_arg
)
8868 add_defarg_fn (decl
);
8871 /* Make the init_value nonzero so pushdecl knows this is not
8872 tentative. error_mark_node is replaced later with the BLOCK. */
8873 DECL_INITIAL (decl
) = error_mark_node
;
8875 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8876 TREE_NOTHROW (decl
) = 1;
8878 /* Caller will do the rest of this. */
8882 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (ctype
) == declarator
)
8883 DECL_CONSTRUCTOR_P (decl
) = 1;
8885 /* Function gets the ugly name, field gets the nice one. This call
8886 may change the type of the function (because of default
8888 if (ctype
!= NULL_TREE
)
8889 grokclassfn (ctype
, decl
, flags
, quals
);
8891 decl
= check_explicit_specialization (orig_declarator
, decl
,
8893 2 * (funcdef_flag
!= 0) +
8894 4 * (friendp
!= 0));
8895 if (decl
== error_mark_node
)
8898 if (ctype
!= NULL_TREE
8899 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8904 old_decl
= check_classfn (ctype
, decl
);
8906 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8907 /* Because grokfndecl is always supposed to return a
8908 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8909 here. We depend on our callers to figure out that its
8910 really a template that's being returned. */
8911 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8913 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8914 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8916 /* Remove the `this' parm added by grokclassfn.
8917 XXX Isn't this done in start_function, too? */
8918 revert_static_member_fn (decl
);
8919 last_function_parms
= TREE_CHAIN (last_function_parms
);
8921 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
8922 cp_error ("definition of implicitly-declared `%D'", old_decl
);
8926 /* Since we've smashed OLD_DECL to its
8927 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8928 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8929 decl
= DECL_TEMPLATE_RESULT (decl
);
8931 /* Attempt to merge the declarations. This can fail, in
8932 the case of some illegal specialization declarations. */
8933 if (!duplicate_decls (decl
, old_decl
))
8934 cp_error ("no `%#D' member function declared in class `%T'",
8940 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
8943 if (ctype
== NULL_TREE
|| check
)
8947 DECL_VIRTUAL_P (decl
) = 1;
8953 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8956 RID_BIT_TYPE
*specbits_in
;
8962 RID_BIT_TYPE specbits
;
8964 specbits
= *specbits_in
;
8966 if (TREE_CODE (type
) == OFFSET_TYPE
)
8968 /* If you declare a static member so that it
8969 can be initialized, the code will reach here. */
8970 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8971 type
= TREE_TYPE (type
);
8972 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8973 DECL_CONTEXT (decl
) = basetype
;
8980 context
= in_namespace
;
8981 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8982 context
= current_namespace
;
8984 context
= NULL_TREE
;
8986 /* For namespace-scope variables, declared in a template, we
8987 need the full lang_decl. The same is true for
8988 namespace-scope variables that do not have C++ language
8991 && (processing_template_decl
8992 || current_lang_name
!= lang_name_cplusplus
))
8993 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8995 decl
= build_decl (VAR_DECL
, declarator
, type
);
8998 set_decl_namespace (decl
, context
, 0);
9000 context
= DECL_CONTEXT (decl
);
9001 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9002 /* We can't mangle lazily here because we don't have any
9003 way to recover whether or not a variable was `extern
9009 set_decl_namespace (decl
, in_namespace
, 0);
9011 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9013 DECL_THIS_EXTERN (decl
) = 1;
9014 DECL_EXTERNAL (decl
) = !initialized
;
9017 /* In class context, static means one per class,
9018 public access, and static storage. */
9019 if (DECL_CLASS_SCOPE_P (decl
))
9021 TREE_PUBLIC (decl
) = 1;
9022 TREE_STATIC (decl
) = 1;
9023 DECL_EXTERNAL (decl
) = 0;
9025 /* At top level, either `static' or no s.c. makes a definition
9026 (perhaps tentative), and absence of `static' makes it public. */
9027 else if (toplevel_bindings_p ())
9029 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9030 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9031 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9033 /* Not at top level, only `static' makes a static definition. */
9036 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9037 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9040 if (TREE_PUBLIC (decl
))
9042 /* [basic.link]: A name with no linkage (notably, the name of a class
9043 or enumeration declared in a local scope) shall not be used to
9044 declare an entity with linkage.
9046 Only check this for public decls for now. */
9047 tree t
= no_linkage_check (TREE_TYPE (decl
));
9050 if (TYPE_ANONYMOUS_P (t
))
9051 /* Ignore for now; `enum { foo } e' is pretty common. */;
9053 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9061 /* Create and return a canonical pointer to member function type, for
9062 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9065 build_ptrmemfunc_type (type
)
9070 tree unqualified_variant
= NULL_TREE
;
9072 if (type
== error_mark_node
)
9075 /* If a canonical type already exists for this type, use it. We use
9076 this method instead of type_hash_canon, because it only does a
9077 simple equality check on the list of field members. */
9079 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9082 /* Make sure that we always have the unqualified pointer-to-member
9084 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9086 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9088 t
= make_aggr_type (RECORD_TYPE
);
9089 /* Let the front-end know this is a pointer to member function... */
9090 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9091 /* ... and not really an aggregate. */
9092 SET_IS_AGGR_TYPE (t
, 0);
9094 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9095 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9097 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9099 /* Zap out the name so that the back-end will give us the debugging
9100 information for this anonymous RECORD_TYPE. */
9101 TYPE_NAME (t
) = NULL_TREE
;
9103 /* If this is not the unqualified form of this pointer-to-member
9104 type, set the TYPE_MAIN_VARIANT for this type to be the
9105 unqualified type. Since they are actually RECORD_TYPEs that are
9106 not variants of each other, we must do this manually. */
9107 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9109 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9110 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9111 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9112 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9115 /* Cache this pointer-to-member type so that we can find it again
9117 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9119 /* Seems to be wanted. */
9120 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9125 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9126 Check to see that the definition is valid. Issue appropriate error
9127 messages. Return 1 if the definition is particularly bad, or 0
9131 check_static_variable_definition (decl
, type
)
9135 /* Motion 10 at San Diego: If a static const integral data member is
9136 initialized with an integral constant expression, the initializer
9137 may appear either in the declaration (within the class), or in
9138 the definition, but not both. If it appears in the class, the
9139 member is a member constant. The file-scope definition is always
9141 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9143 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9145 /* If we just return the declaration, crashes will sometimes
9146 occur. We therefore return void_type_node, as if this was a
9147 friend declaration, to cause callers to completely ignore
9148 this declaration. */
9151 else if (!CP_TYPE_CONST_P (type
))
9152 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9154 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9155 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9160 /* Given the SIZE (i.e., number of elements) in an array, compute an
9161 appropriate index type for the array. If non-NULL, NAME is the
9162 name of the thing being declared. */
9165 compute_array_index_type (name
, size
)
9171 /* If this involves a template parameter, it will be a constant at
9172 instantiation time, but we don't know what the value is yet.
9173 Even if no template parameters are involved, we may an expression
9174 that is not a constant; we don't even simplify `1 + 2' when
9175 processing a template. */
9176 if (processing_template_decl
)
9178 /* Resolve a qualified reference to an enumerator or static
9179 const data member of ours. */
9180 if (TREE_CODE (size
) == SCOPE_REF
9181 && TREE_OPERAND (size
, 0) == current_class_type
)
9183 tree t
= lookup_field (current_class_type
,
9184 TREE_OPERAND (size
, 1), 0, 0);
9189 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9190 size
, integer_one_node
));
9193 /* The size might be the result of a cast. */
9194 STRIP_TYPE_NOPS (size
);
9196 /* It might be a const variable or enumeration constant. */
9197 size
= decl_constant_value (size
);
9199 /* The array bound must be an integer type. */
9200 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9201 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9202 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9205 cp_error ("size of array `%D' has non-integer type", name
);
9207 cp_error ("size of array has non-integer type");
9208 size
= integer_one_node
;
9211 /* Normally, the array-bound will be a constant. */
9212 if (TREE_CODE (size
) == INTEGER_CST
)
9214 /* Check to see if the array bound overflowed. Make that an
9215 error, no matter how generous we're being. */
9216 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9217 int old_pedantic
= pedantic
;
9218 pedantic
= flag_pedantic_errors
= 1;
9219 constant_expression_warning (size
);
9220 pedantic
= old_pedantic
;
9221 flag_pedantic_errors
= old_flag_pedantic_errors
;
9223 /* An array must have a positive number of elements. */
9224 if (INT_CST_LT (size
, integer_zero_node
))
9227 cp_error ("size of array `%D' is negative", name
);
9229 cp_error ("size of array is negative");
9230 size
= integer_one_node
;
9232 /* Except that an extension we allow zero-sized arrays. We
9233 always allow them in system headers because glibc uses
9235 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9238 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9240 cp_pedwarn ("ISO C++ forbids zero-size array");
9243 else if (TREE_CONSTANT (size
))
9245 /* `(int) &fn' is not a valid array bound. */
9247 cp_error ("size of array `%D' is not an integral constant-expression",
9250 cp_error ("size of array is not an integral constant-expression");
9253 /* Compute the index of the largest element in the array. It is
9254 one less than the number of elements in the array. */
9256 = fold (cp_build_binary_op (MINUS_EXPR
,
9257 cp_convert (ssizetype
, size
),
9258 cp_convert (ssizetype
,
9259 integer_one_node
)));
9261 /* Check for variable-sized arrays. We allow such things as an
9262 extension, even though they are not allowed in ANSI/ISO C++. */
9263 if (!TREE_CONSTANT (itype
))
9268 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9271 cp_pedwarn ("ISO C++ forbids variable-size array");
9274 /* Create a variable-sized array index type. */
9275 itype
= variable_size (itype
);
9277 /* Make sure that there was no overflow when creating to a signed
9278 index type. (For example, on a 32-bit machine, an array with
9279 size 2^32 - 1 is too big.) */
9280 else if (TREE_OVERFLOW (itype
))
9282 error ("overflow in array dimension");
9283 TREE_OVERFLOW (itype
) = 0;
9286 /* Create and return the appropriate index type. */
9287 return build_index_type (itype
);
9290 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9291 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9295 create_array_type_for_decl (name
, type
, size
)
9300 tree itype
= NULL_TREE
;
9301 const char* error_msg
;
9303 /* If things have already gone awry, bail now. */
9304 if (type
== error_mark_node
|| size
== error_mark_node
)
9305 return error_mark_node
;
9307 /* Assume that everything will go OK. */
9310 /* There are some types which cannot be array elements. */
9311 switch (TREE_CODE (type
))
9314 error_msg
= "array of void";
9318 error_msg
= "array of functions";
9321 case REFERENCE_TYPE
:
9322 error_msg
= "array of references";
9326 error_msg
= "array of data members";
9330 error_msg
= "array of function members";
9337 /* If something went wrong, issue an error-message and return. */
9341 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9343 cp_error ("creating %s", error_msg
);
9345 return error_mark_node
;
9350 The constant expressions that specify the bounds of the arrays
9351 can be omitted only for the first member of the sequence. */
9352 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9354 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9357 return error_mark_node
;
9360 /* Figure out the index type for the array. */
9362 itype
= compute_array_index_type (name
, size
);
9364 return build_cplus_array_type (type
, itype
);
9367 /* Check that it's OK to declare a function with the indicated TYPE.
9368 SFK indicates the kind of special function (if any) that this
9369 function is. OPTYPE is the type given in a conversion operator
9370 declaration. Returns the actual return type of the function; that
9371 may be different than TYPE if an error occurs, or for certain
9372 special functions. */
9375 check_special_function_return_type (sfk
, type
, optype
)
9376 special_function_kind sfk
;
9382 case sfk_constructor
:
9384 cp_error ("return type specification for constructor invalid");
9386 type
= void_type_node
;
9389 case sfk_destructor
:
9391 cp_error ("return type specification for destructor invalid");
9392 type
= void_type_node
;
9395 case sfk_conversion
:
9396 if (type
&& !same_type_p (type
, optype
))
9397 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9399 cp_pedwarn ("return type specified for `operator %T'", optype
);
9404 my_friendly_abort (20000408);
9411 /* Given declspecs and a declarator,
9412 determine the name and type of the object declared
9413 and construct a ..._DECL node for it.
9414 (In one case we can return a ..._TYPE node instead.
9415 For invalid input we sometimes return 0.)
9417 DECLSPECS is a chain of tree_list nodes whose value fields
9418 are the storage classes and type specifiers.
9420 DECL_CONTEXT says which syntactic context this declaration is in:
9421 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9422 FUNCDEF for a function definition. Like NORMAL but a few different
9423 error messages in each case. Return value may be zero meaning
9424 this definition is too screwy to try to parse.
9425 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9426 handle member functions (which have FIELD context).
9427 Return value may be zero meaning this definition is too screwy to
9429 PARM for a parameter declaration (either within a function prototype
9430 or before a function body). Make a PARM_DECL, or return void_type_node.
9431 CATCHPARM for a parameter declaration before a catch clause.
9432 TYPENAME if for a typename (in a cast or sizeof).
9433 Don't make a DECL node; just return the ..._TYPE node.
9434 FIELD for a struct or union field; make a FIELD_DECL.
9435 BITFIELD for a field with specified width.
9436 INITIALIZED is 1 if the decl has an initializer.
9438 ATTRLIST is a pointer to the list of attributes, which may be NULL
9439 if there are none; *ATTRLIST may be modified if attributes from inside
9440 the declarator should be applied to the declaration.
9442 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9443 It may also be so in the PARM case, for a prototype where the
9444 argument type is specified but not the name.
9446 This function is where the complicated C meanings of `static'
9447 and `extern' are interpreted.
9449 For C++, if there is any monkey business to do, the function which
9450 calls this one must do it, i.e., prepending instance variables,
9451 renaming overloaded function names, etc.
9453 Note that for this C++, it is an error to define a method within a class
9454 which does not belong to that class.
9456 Except in the case where SCOPE_REFs are implicitly known (such as
9457 methods within a class being redundantly qualified),
9458 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9459 (class_name::decl_name). The caller must also deal with this.
9461 If a constructor or destructor is seen, and the context is FIELD,
9462 then the type gains the attribute TREE_HAS_x. If such a declaration
9463 is erroneous, NULL_TREE is returned.
9465 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9466 function, these are the qualifiers to give to the `this' pointer. We
9467 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9469 May return void_type_node if the declarator turned out to be a friend.
9470 See grokfield for details. */
9473 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9476 enum decl_context decl_context
;
9480 RID_BIT_TYPE specbits
;
9483 tree type
= NULL_TREE
;
9489 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9490 int explicit_int
= 0;
9491 int explicit_char
= 0;
9492 int defaulted_int
= 0;
9493 tree typedef_decl
= NULL_TREE
;
9495 tree typedef_type
= NULL_TREE
;
9496 int funcdef_flag
= 0;
9497 enum tree_code innermost_code
= ERROR_MARK
;
9500 /* See the code below that used this. */
9501 tree decl_attr
= NULL_TREE
;
9503 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9504 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9505 tree init
= NULL_TREE
;
9507 /* Keep track of what sort of function is being processed
9508 so that we can warn about default return values, or explicit
9509 return values which do not match prescribed defaults. */
9510 special_function_kind sfk
= sfk_none
;
9512 tree dname
= NULL_TREE
;
9513 tree ctype
= current_class_type
;
9514 tree ctor_return_type
= NULL_TREE
;
9515 enum overload_flags flags
= NO_SPECIAL
;
9516 tree quals
= NULL_TREE
;
9517 tree raises
= NULL_TREE
;
9518 int template_count
= 0;
9519 tree in_namespace
= NULL_TREE
;
9520 tree returned_attrs
= NULL_TREE
;
9522 RIDBIT_RESET_ALL (specbits
);
9523 if (decl_context
== FUNCDEF
)
9524 funcdef_flag
= 1, decl_context
= NORMAL
;
9525 else if (decl_context
== MEMFUNCDEF
)
9526 funcdef_flag
= -1, decl_context
= FIELD
;
9527 else if (decl_context
== BITFIELD
)
9528 bitfield
= 1, decl_context
= FIELD
;
9530 /* Look inside a declarator for the name being declared
9531 and get it as a string, for an error message. */
9533 tree
*next
= &declarator
;
9537 while (next
&& *next
)
9540 switch (TREE_CODE (decl
))
9543 /* For attributes. */
9544 next
= &TREE_VALUE (decl
);
9549 next
= &TREE_OPERAND (decl
, 0);
9552 case BIT_NOT_EXPR
: /* For C++ destructors! */
9554 tree name
= TREE_OPERAND (decl
, 0);
9555 tree rename
= NULL_TREE
;
9557 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9559 sfk
= sfk_destructor
;
9560 if (TREE_CODE (name
) == TYPE_DECL
)
9561 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9562 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9563 if (ctype
== NULL_TREE
)
9565 if (current_class_type
== NULL_TREE
)
9567 error ("destructors must be member functions");
9572 tree t
= constructor_name (current_class_name
);
9579 tree t
= constructor_name (ctype
);
9586 cp_error ("destructor `%T' must match class name `%T'",
9588 TREE_OPERAND (decl
, 0) = rename
;
9594 case ADDR_EXPR
: /* C++ reference declaration */
9599 innermost_code
= TREE_CODE (decl
);
9600 next
= &TREE_OPERAND (decl
, 0);
9604 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9606 /* This is actually a variable declaration using
9607 constructor syntax. We need to call start_decl and
9608 cp_finish_decl so we can get the variable
9613 *next
= TREE_OPERAND (decl
, 0);
9614 init
= CALL_DECLARATOR_PARMS (decl
);
9618 attributes
= *attrlist
;
9622 attributes
= NULL_TREE
;
9625 decl
= start_decl (declarator
, declspecs
, 1,
9626 attributes
, NULL_TREE
);
9627 decl_type_access_control (decl
);
9630 /* Look for __unused__ attribute */
9631 if (TREE_USED (TREE_TYPE (decl
)))
9632 TREE_USED (decl
) = 1;
9633 finish_decl (decl
, init
, NULL_TREE
);
9636 cp_error ("invalid declarator");
9639 innermost_code
= TREE_CODE (decl
);
9640 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9641 ctype
= current_class_type
;
9643 && TREE_OPERAND (decl
, 0)
9644 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9645 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9646 == constructor_name_full (ctype
))
9647 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9648 == constructor_name (ctype
)))))
9649 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9650 next
= &TREE_OPERAND (decl
, 0);
9652 if (ctype
!= NULL_TREE
9653 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9654 && decl
== constructor_name (ctype
))
9656 sfk
= sfk_constructor
;
9657 ctor_return_type
= ctype
;
9662 case TEMPLATE_ID_EXPR
:
9664 tree fns
= TREE_OPERAND (decl
, 0);
9666 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9667 fns
= TREE_OPERAND (fns
, 0);
9670 if (TREE_CODE (dname
) == COMPONENT_REF
)
9671 dname
= TREE_OPERAND (dname
, 1);
9672 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9674 my_friendly_assert (is_overloaded_fn (dname
),
9676 dname
= DECL_NAME (get_first_fn (dname
));
9681 case IDENTIFIER_NODE
:
9682 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9687 if (C_IS_RESERVED_WORD (dname
))
9689 cp_error ("declarator-id missing; using reserved word `%D'",
9691 name
= IDENTIFIER_POINTER (dname
);
9693 else if (!IDENTIFIER_TYPENAME_P (dname
))
9694 name
= IDENTIFIER_POINTER (dname
);
9697 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9698 flags
= TYPENAME_FLAG
;
9699 ctor_return_type
= TREE_TYPE (dname
);
9700 sfk
= sfk_conversion
;
9701 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9702 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9704 name
= IDENTIFIER_POINTER (dname
);
9706 name
= "<invalid operator>";
9713 /* Perform error checking, and decide on a ctype. */
9714 tree cname
= TREE_OPERAND (decl
, 0);
9715 if (cname
== NULL_TREE
)
9717 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9720 in_namespace
= TREE_OPERAND (decl
, 0);
9721 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9723 else if (! is_aggr_type (cname
, 1))
9724 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9725 /* Must test TREE_OPERAND (decl, 1), in case user gives
9726 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9727 else if (TREE_OPERAND (decl
, 1)
9728 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9730 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9731 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9733 cp_error ("`%T::%D' is not a valid declarator", cname
,
9734 TREE_OPERAND (decl
, 1));
9735 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9736 cname
, TREE_OPERAND (decl
, 1));
9737 return void_type_node
;
9739 else if (ctype
== NULL_TREE
)
9741 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9742 TREE_OPERAND (decl
, 0) = ctype
;
9745 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9747 cp_error ("type `%T' is not derived from type `%T'",
9749 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9755 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9756 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9757 == constructor_name_full (ctype
))
9758 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9759 == constructor_name (ctype
))))
9760 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9761 next
= &TREE_OPERAND (decl
, 1);
9765 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9766 && constructor_name (ctype
) == decl
)
9768 sfk
= sfk_constructor
;
9769 ctor_return_type
= ctype
;
9771 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9772 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9773 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9774 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9776 sfk
= sfk_destructor
;
9777 ctor_return_type
= ctype
;
9779 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9780 next
= &TREE_OPERAND (decl
, 0);
9791 /* Parse error puts this typespec where
9792 a declarator should go. */
9793 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9794 if (TREE_TYPE (decl
) == current_class_type
)
9795 cp_error (" perhaps you want `%T' for a constructor",
9796 current_class_name
);
9797 dname
= DECL_NAME (decl
);
9798 name
= IDENTIFIER_POINTER (dname
);
9800 /* Avoid giving two errors for this. */
9801 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9803 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9809 cp_compiler_error ("`%D' as declarator", decl
);
9810 return 0; /* We used to do a 155 abort here. */
9815 /* A function definition's declarator must have the form of
9816 a function declarator. */
9818 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9821 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9822 && innermost_code
!= CALL_EXPR
9823 && ! (ctype
&& declspecs
== NULL_TREE
))
9825 cp_error ("declaration of `%D' as non-function", dname
);
9826 return void_type_node
;
9829 /* Anything declared one level down from the top level
9830 must be one of the parameters of a function
9831 (because the body is at least two levels down). */
9833 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9834 by not allowing C++ class definitions to specify their parameters
9835 with xdecls (must be spec.d in the parmlist).
9837 Since we now wait to push a class scope until we are sure that
9838 we are in a legitimate method context, we must set oldcname
9839 explicitly (since current_class_name is not yet alive).
9841 We also want to avoid calling this a PARM if it is in a namespace. */
9843 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9845 struct binding_level
*b
= current_binding_level
;
9846 current_binding_level
= b
->level_chain
;
9847 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9848 decl_context
= PARM
;
9849 current_binding_level
= b
;
9853 name
= decl_context
== PARM
? "parameter" : "type name";
9855 /* Look through the decl specs and record which ones appear.
9856 Some typespecs are defined as built-in typenames.
9857 Others, the ones that are modifiers of other types,
9858 are represented by bits in SPECBITS: set the bits for
9859 the modifiers that appear. Storage class keywords are also in SPECBITS.
9861 If there is a typedef name or a type, store the type in TYPE.
9862 This includes builtin typedefs such as `int'.
9864 Set EXPLICIT_INT if the type is `int' or `char' and did not
9865 come from a user typedef.
9867 Set LONGLONG if `long' is mentioned twice.
9869 For C++, constructors and destructors have their own fast treatment. */
9871 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9876 /* Certain parse errors slip through. For example,
9877 `int class;' is not caught by the parser. Try
9878 weakly to recover here. */
9879 if (TREE_CODE (spec
) != TREE_LIST
)
9882 id
= TREE_VALUE (spec
);
9884 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9886 if (id
== ridpointers
[(int) RID_INT
]
9887 || id
== ridpointers
[(int) RID_CHAR
]
9888 || id
== ridpointers
[(int) RID_BOOL
]
9889 || id
== ridpointers
[(int) RID_WCHAR
])
9893 if (id
== ridpointers
[(int) RID_BOOL
])
9894 error ("`bool' is now a keyword");
9896 cp_error ("extraneous `%T' ignored", id
);
9900 if (id
== ridpointers
[(int) RID_INT
])
9902 else if (id
== ridpointers
[(int) RID_CHAR
])
9904 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9908 /* C++ aggregate types. */
9909 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9912 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9914 type
= IDENTIFIER_TYPE_VALUE (id
);
9918 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9920 if (ridpointers
[i
] == id
)
9922 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9924 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9925 pedwarn ("ISO C++ does not support `long long'");
9927 error ("`long long long' is too long for GCC");
9931 else if (RIDBIT_SETP (i
, specbits
))
9932 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9933 RIDBIT_SET (i
, specbits
);
9938 /* C++ aggregate types. */
9939 else if (TREE_CODE (id
) == TYPE_DECL
)
9942 cp_error ("multiple declarations `%T' and `%T'", type
,
9946 type
= TREE_TYPE (id
);
9947 TREE_VALUE (spec
) = type
;
9952 error ("two or more data types in declaration of `%s'", name
);
9953 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9955 register tree t
= lookup_name (id
, 1);
9956 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9957 error ("`%s' fails to be a typedef or built in type",
9958 IDENTIFIER_POINTER (id
));
9961 type
= TREE_TYPE (t
);
9963 /* See the code below that used this. */
9964 decl_attr
= DECL_ATTRIBUTES (id
);
9969 else if (id
!= error_mark_node
)
9970 /* Can't change CLASS nodes into RECORD nodes here! */
9976 typedef_type
= type
;
9978 /* No type at all: default to `int', and set DEFAULTED_INT
9979 because it was not a user-defined typedef. */
9981 if (type
== NULL_TREE
9982 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9983 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9984 || RIDBIT_SETP (RID_LONG
, specbits
)
9985 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9987 /* These imply 'int'. */
9988 type
= integer_type_node
;
9992 if (sfk
!= sfk_none
)
9993 type
= check_special_function_return_type (sfk
, type
,
9995 else if (type
== NULL_TREE
)
10001 /* We handle `main' specially here, because 'main () { }' is so
10002 common. With no options, it is allowed. With -Wreturn-type,
10003 it is a warning. It is only an error with -pedantic-errors. */
10004 is_main
= (funcdef_flag
10005 && MAIN_NAME_P (dname
)
10006 && ctype
== NULL_TREE
10007 && in_namespace
== NULL_TREE
10008 && current_namespace
== global_namespace
);
10010 if (in_system_header
|| flag_ms_extensions
)
10011 /* Allow it, sigh. */;
10012 else if (pedantic
|| ! is_main
)
10013 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10015 else if (warn_return_type
)
10016 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10019 type
= integer_type_node
;
10024 /* Now process the modifiers that were specified
10025 and check for invalid combinations. */
10027 /* Long double is a special combination. */
10029 if (RIDBIT_SETP (RID_LONG
, specbits
)
10030 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10032 RIDBIT_RESET (RID_LONG
, specbits
);
10033 type
= build_qualified_type (long_double_type_node
,
10034 CP_TYPE_QUALS (type
));
10037 /* Check all other uses of type modifiers. */
10039 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10040 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10041 || RIDBIT_SETP (RID_LONG
, specbits
)
10042 || RIDBIT_SETP (RID_SHORT
, specbits
))
10046 if (TREE_CODE (type
) == REAL_TYPE
)
10047 error ("short, signed or unsigned invalid for `%s'", name
);
10048 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10049 error ("long, short, signed or unsigned invalid for `%s'", name
);
10050 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10051 && RIDBIT_SETP (RID_SHORT
, specbits
))
10052 error ("long and short specified together for `%s'", name
);
10053 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10054 || RIDBIT_SETP (RID_SHORT
, specbits
))
10056 error ("long or short specified with char for `%s'", name
);
10057 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10058 || RIDBIT_SETP (RID_SHORT
, specbits
))
10059 && TREE_CODE (type
) == REAL_TYPE
)
10060 error ("long or short specified with floating type for `%s'", name
);
10061 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10062 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10063 error ("signed and unsigned given together for `%s'", name
);
10067 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10069 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10071 if (flag_pedantic_errors
)
10076 /* Discard the type modifiers if they are invalid. */
10079 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10080 RIDBIT_RESET (RID_SIGNED
, specbits
);
10081 RIDBIT_RESET (RID_LONG
, specbits
);
10082 RIDBIT_RESET (RID_SHORT
, specbits
);
10087 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10088 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10090 error ("complex invalid for `%s'", name
);
10091 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10094 /* Decide whether an integer type is signed or not.
10095 Optionally treat bitfields as signed by default. */
10096 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10099 It is implementation-defined whether a plain (neither
10100 explicitly signed or unsigned) char, short, int, or long
10101 bit-field is signed or unsigned.
10103 Naturally, we extend this to long long as well. Note that
10104 this does not include wchar_t. */
10105 || (bitfield
&& !flag_signed_bitfields
10106 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10107 /* A typedef for plain `int' without `signed' can be
10108 controlled just like plain `int', but a typedef for
10109 `signed int' cannot be so controlled. */
10111 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10112 && (TREE_CODE (type
) == INTEGER_TYPE
10113 || TREE_CODE (type
) == CHAR_TYPE
)
10114 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10117 type
= long_long_unsigned_type_node
;
10118 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10119 type
= long_unsigned_type_node
;
10120 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10121 type
= short_unsigned_type_node
;
10122 else if (type
== char_type_node
)
10123 type
= unsigned_char_type_node
;
10124 else if (typedef_decl
)
10125 type
= unsigned_type (type
);
10127 type
= unsigned_type_node
;
10129 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10130 && type
== char_type_node
)
10131 type
= signed_char_type_node
;
10133 type
= long_long_integer_type_node
;
10134 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10135 type
= long_integer_type_node
;
10136 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10137 type
= short_integer_type_node
;
10139 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10141 /* If we just have "complex", it is equivalent to
10142 "complex double", but if any modifiers at all are specified it is
10143 the complex form of TYPE. E.g, "complex short" is
10144 "complex short int". */
10146 if (defaulted_int
&& ! longlong
10147 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10148 || RIDBIT_SETP (RID_SHORT
, specbits
)
10149 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10150 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10151 type
= complex_double_type_node
;
10152 else if (type
== integer_type_node
)
10153 type
= complex_integer_type_node
;
10154 else if (type
== float_type_node
)
10155 type
= complex_float_type_node
;
10156 else if (type
== double_type_node
)
10157 type
= complex_double_type_node
;
10158 else if (type
== long_double_type_node
)
10159 type
= complex_long_double_type_node
;
10161 type
= build_complex_type (type
);
10164 if (sfk
== sfk_conversion
10165 && (RIDBIT_SETP (RID_CONST
, specbits
)
10166 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10167 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10168 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10171 /* Set CONSTP if this declaration is `const', whether by
10172 explicit specification or via a typedef.
10173 Likewise for VOLATILEP. */
10175 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10177 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10179 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10180 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10181 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10182 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10183 type
= cp_build_qualified_type (type
, type_quals
);
10185 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10186 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10187 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10188 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10189 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10191 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10192 staticp
= 1 + (decl_context
== FIELD
);
10194 if (virtualp
&& staticp
== 2)
10196 cp_error ("member `%D' cannot be declared both virtual and static",
10200 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10201 RIDBIT_RESET (RID_FRIEND
, specbits
);
10203 /* Warn if two storage classes are given. Default to `auto'. */
10205 if (RIDBIT_ANY_SET (specbits
))
10207 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10208 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10209 if (decl_context
== PARM
&& nclasses
> 0)
10210 error ("storage class specifiers invalid in parameter declarations");
10211 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10213 if (decl_context
== PARM
)
10214 error ("typedef declaration invalid in parameter declaration");
10217 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10218 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10221 /* Give error if `virtual' is used outside of class declaration. */
10223 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10225 error ("virtual outside class declaration");
10229 /* Static anonymous unions are dealt with here. */
10230 if (staticp
&& decl_context
== TYPENAME
10231 && TREE_CODE (declspecs
) == TREE_LIST
10232 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10233 decl_context
= FIELD
;
10235 /* Warn about storage classes that are invalid for certain
10236 kinds of declarations (parameters, typenames, etc.). */
10239 error ("multiple storage classes in declaration of `%s'", name
);
10240 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10242 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10243 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10244 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10246 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10248 else if (decl_context
== FIELD
10249 /* C++ allows static class elements */
10250 && RIDBIT_SETP (RID_STATIC
, specbits
))
10251 /* C++ also allows inlines and signed and unsigned elements,
10252 but in those cases we don't come in here. */
10256 if (decl_context
== FIELD
)
10258 tree tmp
= NULL_TREE
;
10259 register int op
= 0;
10263 /* Avoid trying to get an operand off an identifier node. */
10264 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10267 tmp
= TREE_OPERAND (declarator
, 0);
10268 op
= IDENTIFIER_OPNAME_P (tmp
);
10269 if (IDENTIFIER_TYPENAME_P (tmp
))
10271 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10272 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10274 name
= IDENTIFIER_POINTER (tmp
);
10276 name
= "<invalid operator>";
10279 error ("storage class specified for %s `%s'",
10280 op
? "member operator" : "field",
10285 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10286 error ("storage class specified for parameter `%s'", name
);
10288 error ("storage class specified for typename");
10290 RIDBIT_RESET (RID_REGISTER
, specbits
);
10291 RIDBIT_RESET (RID_AUTO
, specbits
);
10292 RIDBIT_RESET (RID_EXTERN
, specbits
);
10295 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10297 if (toplevel_bindings_p ())
10299 /* It's common practice (and completely valid) to have a const
10300 be initialized and declared extern. */
10301 if (!(type_quals
& TYPE_QUAL_CONST
))
10302 warning ("`%s' initialized and declared `extern'", name
);
10305 error ("`%s' has both `extern' and initializer", name
);
10307 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10308 && ! toplevel_bindings_p ())
10309 error ("nested function `%s' declared `extern'", name
);
10310 else if (toplevel_bindings_p ())
10312 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10313 error ("top-level declaration of `%s' specifies `auto'", name
);
10316 if (nclasses
> 0 && friendp
)
10317 error ("storage class specifiers invalid in friend function declarations");
10319 /* Now figure out the structure of the declarator proper.
10320 Descend through it, creating more complex types, until we reach
10321 the declared identifier (or NULL_TREE, in an absolute declarator). */
10323 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10324 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10326 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10327 an INDIRECT_REF (for *...),
10328 a CALL_EXPR (for ...(...)),
10329 an identifier (for the name being declared)
10330 or a null pointer (for the place in an absolute declarator
10331 where the name was omitted).
10332 For the last two cases, we have just exited the loop.
10334 For C++ it could also be
10335 a SCOPE_REF (for class :: ...). In this case, we have converted
10336 sensible names to types, and those are the values we use to
10337 qualify the member name.
10338 an ADDR_EXPR (for &...),
10339 a BIT_NOT_EXPR (for destructors)
10341 At this point, TYPE is the type of elements of an array,
10342 or for a function to return, or for a pointer to point to.
10343 After this sequence of ifs, TYPE is the type of the
10344 array or function or pointer, and DECLARATOR has had its
10345 outermost layer removed. */
10347 if (type
== error_mark_node
)
10349 if (TREE_CODE (declarator
) == SCOPE_REF
)
10350 declarator
= TREE_OPERAND (declarator
, 1);
10352 declarator
= TREE_OPERAND (declarator
, 0);
10355 if (quals
!= NULL_TREE
10356 && (declarator
== NULL_TREE
10357 || TREE_CODE (declarator
) != SCOPE_REF
))
10359 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10360 ctype
= TYPE_METHOD_BASETYPE (type
);
10361 if (ctype
!= NULL_TREE
)
10363 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10364 grok_method_quals (ctype
, dummy
, quals
);
10365 type
= TREE_TYPE (dummy
);
10366 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10371 switch (TREE_CODE (declarator
))
10375 /* We encode a declarator with embedded attributes using
10377 tree attrs
= TREE_PURPOSE (declarator
);
10381 declarator
= TREE_VALUE (declarator
);
10382 inner_decl
= declarator
;
10383 while (inner_decl
!= NULL_TREE
10384 && TREE_CODE (inner_decl
) == TREE_LIST
)
10385 inner_decl
= TREE_VALUE (inner_decl
);
10387 if (inner_decl
== NULL_TREE
10388 || TREE_CODE (inner_decl
) == IDENTIFIER_NODE
)
10389 attr_flags
|= (int) ATTR_FLAG_DECL_NEXT
;
10390 if (TREE_CODE (inner_decl
) == CALL_EXPR
)
10391 attr_flags
|= (int) ATTR_FLAG_FUNCTION_NEXT
;
10392 if (TREE_CODE (inner_decl
) == ARRAY_REF
)
10393 attr_flags
|= (int) ATTR_FLAG_ARRAY_NEXT
;
10394 returned_attrs
= decl_attributes (&type
,
10395 chainon (returned_attrs
, attrs
),
10402 register tree size
;
10404 size
= TREE_OPERAND (declarator
, 1);
10406 /* VC++ spells a zero-sized array with []. */
10407 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10408 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10409 size
= integer_zero_node
;
10411 declarator
= TREE_OPERAND (declarator
, 0);
10413 type
= create_array_type_for_decl (dname
, type
, size
);
10415 /* VLAs never work as fields. */
10416 if (decl_context
== FIELD
&& !processing_template_decl
10417 && TREE_CODE (type
) == ARRAY_TYPE
10418 && TYPE_DOMAIN (type
) != NULL_TREE
10419 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10421 cp_error ("size of member `%D' is not constant", dname
);
10422 /* Proceed with arbitrary constant size, so that offset
10423 computations don't get confused. */
10424 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10436 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10437 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10439 /* Declaring a function type.
10440 Make sure we have a valid type for the function to return. */
10442 /* We now know that the TYPE_QUALS don't apply to the
10443 decl, but to its return type. */
10444 type_quals
= TYPE_UNQUALIFIED
;
10446 /* Warn about some types functions can't return. */
10448 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10450 error ("`%s' declared as function returning a function", name
);
10451 type
= integer_type_node
;
10453 if (TREE_CODE (type
) == ARRAY_TYPE
)
10455 error ("`%s' declared as function returning an array", name
);
10456 type
= integer_type_node
;
10459 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10460 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10462 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10463 inner_decl
= dname
;
10465 /* Pick up type qualifiers which should be applied to `this'. */
10466 quals
= CALL_DECLARATOR_QUALS (declarator
);
10468 /* Pick up the exception specifications. */
10469 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10471 /* Say it's a definition only for the CALL_EXPR
10472 closest to the identifier. */
10475 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10476 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10477 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10479 if (ctype
== NULL_TREE
10480 && decl_context
== FIELD
10482 && (friendp
== 0 || dname
== current_class_name
))
10483 ctype
= current_class_type
;
10485 if (ctype
&& sfk
== sfk_conversion
)
10486 TYPE_HAS_CONVERSION (ctype
) = 1;
10487 if (ctype
&& constructor_name (ctype
) == dname
)
10489 /* We are within a class's scope. If our declarator name
10490 is the same as the class name, and we are defining
10491 a function, then it is a constructor/destructor, and
10492 therefore returns a void type. */
10494 if (flags
== DTOR_FLAG
)
10496 /* ISO C++ 12.4/2. A destructor may not be
10497 declared const or volatile. A destructor may
10500 error ("destructor cannot be static member function");
10503 cp_error ("destructors may not be `%s'",
10504 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10507 if (decl_context
== FIELD
)
10509 if (! member_function_or_else (ctype
,
10510 current_class_type
,
10512 return void_type_node
;
10515 else /* It's a constructor. */
10517 if (explicitp
== 1)
10519 /* ISO C++ 12.1. A constructor may not be
10520 declared const or volatile. A constructor may
10521 not be virtual. A constructor may not be
10524 error ("constructor cannot be static member function");
10527 pedwarn ("constructors cannot be declared virtual");
10532 cp_error ("constructors may not be `%s'",
10533 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10537 RID_BIT_TYPE tmp_bits
;
10538 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10539 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10540 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10541 if (RIDBIT_ANY_SET (tmp_bits
))
10542 error ("return value type specifier for constructor ignored");
10544 if (decl_context
== FIELD
)
10546 if (! member_function_or_else (ctype
,
10547 current_class_type
,
10549 return void_type_node
;
10550 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10551 if (sfk
!= sfk_constructor
)
10555 if (decl_context
== FIELD
)
10561 error ("can't initialize friend function `%s'", name
);
10564 /* Cannot be both friend and virtual. */
10565 error ("virtual functions cannot be friends");
10566 RIDBIT_RESET (RID_FRIEND
, specbits
);
10569 if (decl_context
== NORMAL
)
10570 error ("friend declaration not in class definition");
10571 if (current_function_decl
&& funcdef_flag
)
10572 cp_error ("can't define friend function `%s' in a local class definition",
10576 /* Construct the function type and go to the next
10577 inner layer of declarator. */
10579 declarator
= TREE_OPERAND (declarator
, 0);
10581 /* FIXME: This is where default args should be fully
10584 arg_types
= grokparms (inner_parms
);
10586 if (declarator
&& flags
== DTOR_FLAG
)
10588 /* A destructor declared in the body of a class will
10589 be represented as a BIT_NOT_EXPR. But, we just
10590 want the underlying IDENTIFIER. */
10591 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10592 declarator
= TREE_OPERAND (declarator
, 0);
10594 if (arg_types
!= void_list_node
)
10596 cp_error ("destructors may not have parameters");
10597 arg_types
= void_list_node
;
10598 last_function_parms
= NULL_TREE
;
10602 /* ANSI says that `const int foo ();'
10603 does not make the function foo const. */
10604 type
= build_function_type (type
, arg_types
);
10608 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10609 if (TREE_PURPOSE (t
)
10610 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10612 add_defarg_fn (type
);
10621 /* Filter out pointers-to-references and references-to-references.
10622 We can get these if a TYPE_DECL is used. */
10624 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10626 error ("cannot declare %s to references",
10627 TREE_CODE (declarator
) == ADDR_EXPR
10628 ? "references" : "pointers");
10629 declarator
= TREE_OPERAND (declarator
, 0);
10633 if (TREE_CODE (type
) == OFFSET_TYPE
10634 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10635 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10637 cp_error ("cannot declare pointer to `%#T' member",
10639 type
= TREE_TYPE (type
);
10642 /* Merge any constancy or volatility into the target type
10643 for the pointer. */
10645 /* We now know that the TYPE_QUALS don't apply to the decl,
10646 but to the target of the pointer. */
10647 type_quals
= TYPE_UNQUALIFIED
;
10649 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10651 if (TREE_CODE (type
) == VOID_TYPE
)
10652 error ("invalid type: `void &'");
10654 type
= build_reference_type (type
);
10656 else if (TREE_CODE (type
) == METHOD_TYPE
)
10657 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10659 type
= build_pointer_type (type
);
10661 /* Process a list of type modifier keywords (such as
10662 const or volatile) that were given inside the `*' or `&'. */
10664 if (TREE_TYPE (declarator
))
10666 register tree typemodlist
;
10672 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10673 typemodlist
= TREE_CHAIN (typemodlist
))
10675 tree qualifier
= TREE_VALUE (typemodlist
);
10677 if (qualifier
== ridpointers
[(int) RID_CONST
])
10679 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10681 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10686 error ("invalid type modifier within pointer declarator");
10690 pedwarn ("duplicate `const'");
10692 pedwarn ("duplicate `volatile'");
10694 pedwarn ("duplicate `restrict'");
10696 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10697 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10698 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10699 if (TREE_CODE (declarator
) == ADDR_EXPR
10700 && (constp
|| volatilep
))
10703 pedwarn ("discarding `const' applied to a reference");
10705 pedwarn ("discarding `volatile' applied to a reference");
10706 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10708 type
= cp_build_qualified_type (type
, type_quals
);
10710 declarator
= TREE_OPERAND (declarator
, 0);
10716 /* We have converted type names to NULL_TREE if the
10717 name was bogus, or to a _TYPE node, if not.
10719 The variable CTYPE holds the type we will ultimately
10720 resolve to. The code here just needs to build
10721 up appropriate member types. */
10722 tree sname
= TREE_OPERAND (declarator
, 1);
10725 /* Destructors can have their visibilities changed as well. */
10726 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10727 sname
= TREE_OPERAND (sname
, 0);
10729 if (TREE_COMPLEXITY (declarator
) == 0)
10730 /* This needs to be here, in case we are called
10731 multiple times. */ ;
10732 else if (TREE_COMPLEXITY (declarator
) == -1)
10733 /* Namespace member. */
10734 pop_decl_namespace ();
10735 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10736 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10737 else if (! IS_AGGR_TYPE_CODE
10738 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10740 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10742 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10743 that refer to ctype. They couldn't be resolved earlier
10744 because we hadn't pushed into the class yet.
10745 Example: resolve 'B<T>::type' in
10746 'B<typename B<T>::type> B<T>::f () { }'. */
10747 if (current_template_parms
10748 && uses_template_parms (type
)
10749 && uses_template_parms (current_class_type
))
10751 tree args
= current_template_args ();
10752 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10755 /* This pop_nested_class corresponds to the
10756 push_nested_class used to push into class scope for
10757 parsing the argument list of a function decl, in
10759 pop_nested_class ();
10760 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10763 my_friendly_abort (16);
10765 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10767 /* We had a reference to a global decl, or
10768 perhaps we were given a non-aggregate typedef,
10769 in which case we cleared this out, and should just
10770 keep going as though it wasn't there. */
10771 declarator
= sname
;
10774 ctype
= TREE_OPERAND (declarator
, 0);
10777 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10779 /* You're supposed to have one `template <...>'
10780 for every template class, but you don't need one
10781 for a full specialization. For example:
10783 template <class T> struct S{};
10784 template <> struct S<int> { void f(); };
10785 void S<int>::f () {}
10787 is correct; there shouldn't be a `template <>' for
10788 the definition of `S<int>::f'. */
10789 if (CLASSTYPE_TEMPLATE_INFO (t
)
10790 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10791 || uses_template_parms (CLASSTYPE_TI_ARGS (t
)))
10792 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)))
10793 template_count
+= 1;
10795 t
= TYPE_MAIN_DECL (t
);
10796 t
= DECL_CONTEXT (t
);
10799 if (sname
== NULL_TREE
)
10802 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10804 /* This is the `standard' use of the scoping operator:
10805 basetype :: member . */
10807 if (ctype
== current_class_type
)
10813 Is this ill-formed? */
10816 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10819 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10821 if (current_class_type
== NULL_TREE
|| friendp
)
10822 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10823 TYPE_ARG_TYPES (type
));
10826 cp_error ("cannot declare member function `%T::%s' within `%T'",
10827 ctype
, name
, current_class_type
);
10828 return void_type_node
;
10831 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10832 || COMPLETE_TYPE_P (complete_type (ctype
)))
10834 /* Have to move this code elsewhere in this function.
10835 this code is used for i.e., typedef int A::M; M *pm;
10837 It is? How? jason 10/2/94 */
10839 if (current_class_type
)
10841 cp_error ("cannot declare member `%T::%s' within `%T'",
10842 ctype
, name
, current_class_type
);
10843 return void_type_node
;
10845 type
= build_offset_type (ctype
, type
);
10849 incomplete_type_error (NULL_TREE
, ctype
);
10850 return error_mark_node
;
10853 declarator
= sname
;
10855 else if (TREE_CODE (sname
) == SCOPE_REF
)
10856 my_friendly_abort (17);
10860 declarator
= TREE_OPERAND (declarator
, 1);
10861 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10862 /* In this case, we will deal with it later. */
10866 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10867 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10868 TYPE_ARG_TYPES (type
));
10870 type
= build_offset_type (ctype
, type
);
10877 declarator
= TREE_OPERAND (declarator
, 0);
10882 case ENUMERAL_TYPE
:
10883 declarator
= NULL_TREE
;
10887 declarator
= NULL_TREE
;
10891 my_friendly_abort (158);
10895 if (returned_attrs
)
10898 *attrlist
= chainon (returned_attrs
, *attrlist
);
10900 attrlist
= &returned_attrs
;
10903 /* Now TYPE has the actual type. */
10905 /* Did array size calculations overflow? */
10907 if (TREE_CODE (type
) == ARRAY_TYPE
10908 && COMPLETE_TYPE_P (type
)
10909 && TREE_OVERFLOW (TYPE_SIZE (type
)))
10911 error ("size of array `%s' is too large", name
);
10912 /* If we proceed with the array type as it is, we'll eventully
10913 crash in tree_low_cst(). */
10914 type
= error_mark_node
;
10917 if (explicitp
== 1 || (explicitp
&& friendp
))
10919 /* [dcl.fct.spec] The explicit specifier shall only be used in
10920 declarations of constructors within a class definition. */
10921 error ("only declarations of constructors can be `explicit'");
10925 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10927 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10929 error ("non-member `%s' cannot be declared `mutable'", name
);
10930 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10932 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10934 error ("non-object member `%s' cannot be declared `mutable'", name
);
10935 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10937 else if (TREE_CODE (type
) == FUNCTION_TYPE
10938 || TREE_CODE (type
) == METHOD_TYPE
)
10940 error ("function `%s' cannot be declared `mutable'", name
);
10941 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10945 error ("static `%s' cannot be declared `mutable'", name
);
10946 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10948 else if (type_quals
& TYPE_QUAL_CONST
)
10950 error ("const `%s' cannot be declared `mutable'", name
);
10951 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10955 if (declarator
== NULL_TREE
10956 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10957 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10958 && (TREE_CODE (type
) == FUNCTION_TYPE
10959 || TREE_CODE (type
) == METHOD_TYPE
)))
10961 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10963 cp_error ("template-id `%D' used as a declarator", declarator
);
10964 declarator
= dname
;
10967 /* Unexpected declarator format. */
10968 my_friendly_abort (990210);
10970 /* If this is declaring a typedef name, return a TYPE_DECL. */
10972 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10976 /* Note that the grammar rejects storage classes
10977 in typenames, fields or parameters. */
10978 if (current_lang_name
== lang_name_java
)
10979 TYPE_FOR_JAVA (type
) = 1;
10981 if (decl_context
== FIELD
)
10983 if (declarator
== constructor_name (current_class_type
))
10984 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
10986 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10990 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10991 if (!current_function_decl
)
10992 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10995 /* If the user declares "typedef struct {...} foo" then the
10996 struct will have an anonymous name. Fill that name in now.
10997 Nothing can refer to it, so nothing needs know about the name
10999 if (type
!= error_mark_node
11001 && TYPE_NAME (type
)
11002 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11003 && TYPE_ANONYMOUS_P (type
)
11004 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11006 tree oldname
= TYPE_NAME (type
);
11009 /* Replace the anonymous name with the real name everywhere. */
11010 lookup_tag_reverse (type
, declarator
);
11011 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11012 if (TYPE_NAME (t
) == oldname
)
11013 TYPE_NAME (t
) = decl
;
11015 if (TYPE_LANG_SPECIFIC (type
))
11016 TYPE_WAS_ANONYMOUS (type
) = 1;
11018 /* If this is a typedef within a template class, the nested
11019 type is a (non-primary) template. The name for the
11020 template needs updating as well. */
11021 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11022 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11023 = TYPE_IDENTIFIER (type
);
11025 /* FIXME remangle member functions; member functions of a
11026 type with external linkage have external linkage. */
11029 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11031 cp_error_at ("typedef name may not be class-qualified", decl
);
11036 if (ctype
== NULL_TREE
)
11038 if (TREE_CODE (type
) != METHOD_TYPE
)
11039 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11041 ctype
= TYPE_METHOD_BASETYPE (type
);
11043 if (ctype
!= NULL_TREE
)
11044 grok_method_quals (ctype
, decl
, quals
);
11047 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11048 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11049 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11051 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11052 inlinep
, friendp
, raises
!= NULL_TREE
);
11055 error ("typedef declaration includes an initializer");
11060 /* Detect the case of an array type of unspecified size
11061 which came, as such, direct from a typedef name.
11062 We must copy the type, so that each identifier gets
11063 a distinct type, so that each identifier's size can be
11064 controlled separately by its own initializer. */
11066 if (type
!= 0 && typedef_type
!= 0
11067 && TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
) == 0
11068 && TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (typedef_type
))
11070 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11073 /* Detect where we're using a typedef of function type to declare a
11074 function. last_function_parms will not be set, so we must create
11077 if (type
== typedef_type
&& TREE_CODE (type
) == FUNCTION_TYPE
)
11079 tree decls
= NULL_TREE
;
11082 for (args
= TYPE_ARG_TYPES (type
); args
; args
= TREE_CHAIN (args
))
11084 tree decl
= build_decl (PARM_DECL
, NULL_TREE
, TREE_VALUE (args
));
11086 TREE_CHAIN (decl
) = decls
;
11090 last_function_parms
= nreverse (decls
);
11093 /* If this is a type name (such as, in a cast or sizeof),
11094 compute the type and return it now. */
11096 if (decl_context
== TYPENAME
)
11098 /* Note that the grammar rejects storage classes
11099 in typenames, fields or parameters. */
11100 if (type_quals
!= TYPE_UNQUALIFIED
)
11101 type_quals
= TYPE_UNQUALIFIED
;
11103 /* Special case: "friend class foo" looks like a TYPENAME context. */
11106 if (type_quals
!= TYPE_UNQUALIFIED
)
11108 cp_error ("type qualifiers specified for friend class declaration");
11109 type_quals
= TYPE_UNQUALIFIED
;
11113 cp_error ("`inline' specified for friend class declaration");
11117 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11118 But don't allow implicit typenames except with a class-key. */
11119 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11120 || IMPLICIT_TYPENAME_P (type
)))
11122 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11123 cp_pedwarn ("template parameters cannot be friends");
11124 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11126 friend declaration requires class-key, i.e. `friend class %T::%T'",
11127 constructor_name (current_class_type
),
11128 TYPE_IDENTIFIER (type
));
11131 friend declaration requires class-key, i.e. `friend %#T'",
11135 /* Only try to do this stuff if we didn't already give up. */
11136 if (type
!= integer_type_node
)
11138 /* DR 209. The friendly class does not need to be accessible
11139 in the scope of the class granting friendship. */
11140 skip_type_access_control ();
11142 /* A friendly class? */
11143 if (current_class_type
)
11144 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11146 cp_error ("trying to make class `%T' a friend of global scope",
11149 type
= void_type_node
;
11154 if (ctype
== NULL_TREE
)
11156 if (TREE_CODE (type
) != METHOD_TYPE
)
11157 cp_error ("invalid qualifiers on non-member function type");
11159 ctype
= TYPE_METHOD_BASETYPE (type
);
11163 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11164 grok_method_quals (ctype
, dummy
, quals
);
11165 type
= TREE_TYPE (dummy
);
11171 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11172 && decl_context
!= CATCHPARM
11173 && TREE_CODE (type
) != UNION_TYPE
11176 cp_error ("abstract declarator `%T' used as declaration", type
);
11177 declarator
= make_anon_name ();
11180 /* `void' at top level (not within pointer)
11181 is allowed only in typedefs or type names.
11182 We don't complain about parms either, but that is because
11183 a better error message can be made later. */
11185 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11188 error ("unnamed variable or field declared void");
11189 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11191 if (IDENTIFIER_OPNAME_P (declarator
))
11192 my_friendly_abort (356);
11194 error ("variable or field `%s' declared void", name
);
11197 error ("variable or field declared void");
11198 type
= integer_type_node
;
11201 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11202 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11204 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11206 if (ctype
|| in_namespace
)
11207 error ("cannot use `::' in parameter declaration");
11209 /* A parameter declared as an array of T is really a pointer to T.
11210 One declared as a function is really a pointer to a function.
11211 One declared as a member is really a pointer to member. */
11213 if (TREE_CODE (type
) == ARRAY_TYPE
)
11215 /* Transfer const-ness of array into that of type pointed to. */
11216 type
= build_pointer_type (TREE_TYPE (type
));
11217 type_quals
= TYPE_UNQUALIFIED
;
11219 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11220 type
= build_pointer_type (type
);
11221 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11222 type
= build_pointer_type (type
);
11226 register tree decl
;
11228 if (decl_context
== PARM
)
11230 decl
= build_decl (PARM_DECL
, declarator
, type
);
11232 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11233 inlinep
, friendp
, raises
!= NULL_TREE
);
11235 /* Compute the type actually passed in the parmlist,
11236 for the case where there is no prototype.
11237 (For example, shorts and chars are passed as ints.)
11238 When there is a prototype, this is overridden later. */
11240 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11242 else if (decl_context
== FIELD
)
11244 if (type
== error_mark_node
)
11246 /* Happens when declaring arrays of sizes which
11247 are error_mark_node, for example. */
11250 else if (in_namespace
&& !friendp
)
11252 /* Something like struct S { int N::j; }; */
11253 cp_error ("invalid use of `::'");
11256 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11259 tree function_context
;
11261 /* We catch the others as conflicts with the builtin
11263 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11265 cp_error ("function `%D' cannot be declared friend",
11272 if (ctype
== NULL_TREE
)
11273 ctype
= current_class_type
;
11275 if (ctype
== NULL_TREE
)
11277 cp_error ("can't make `%D' into a method -- not in a class",
11279 return void_type_node
;
11282 /* ``A union may [ ... ] not [ have ] virtual functions.''
11284 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11286 cp_error ("function `%D' declared virtual inside a union",
11288 return void_type_node
;
11291 if (declarator
== ansi_opname (NEW_EXPR
)
11292 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11293 || declarator
== ansi_opname (DELETE_EXPR
)
11294 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11298 cp_error ("`%D' cannot be declared virtual, since it is always static",
11303 else if (staticp
< 2)
11304 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11305 TYPE_ARG_TYPES (type
));
11308 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11309 function_context
= (ctype
!= NULL_TREE
) ?
11310 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11311 publicp
= (! friendp
|| ! staticp
)
11312 && function_context
== NULL_TREE
;
11313 decl
= grokfndecl (ctype
, type
,
11314 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11315 ? declarator
: dname
,
11317 virtualp
, flags
, quals
, raises
,
11318 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11319 funcdef_flag
, template_count
, in_namespace
);
11320 if (decl
== NULL_TREE
)
11323 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11324 /* The decl and setting of decl_attr is also turned off. */
11325 decl
= build_decl_attribute_variant (decl
, decl_attr
);
11328 /* [class.conv.ctor]
11330 A constructor declared without the function-specifier
11331 explicit that can be called with a single parameter
11332 specifies a conversion from the type of its first
11333 parameter to the type of its class. Such a constructor
11334 is called a converting constructor. */
11335 if (explicitp
== 2)
11336 DECL_NONCONVERTING_P (decl
) = 1;
11337 else if (DECL_CONSTRUCTOR_P (decl
))
11339 /* The constructor can be called with exactly one
11340 parameter if there is at least one parameter, and
11341 any subsequent parameters have default arguments.
11342 Ignore any compiler-added parms. */
11343 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11345 if (arg_types
== void_list_node
11347 && TREE_CHAIN (arg_types
)
11348 && TREE_CHAIN (arg_types
) != void_list_node
11349 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11350 DECL_NONCONVERTING_P (decl
) = 1;
11353 else if (TREE_CODE (type
) == METHOD_TYPE
)
11355 /* We only get here for friend declarations of
11356 members of other classes. */
11357 /* All method decls are public, so tell grokfndecl to set
11358 TREE_PUBLIC, also. */
11359 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11360 virtualp
, flags
, quals
, raises
,
11361 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11362 template_count
, in_namespace
);
11363 if (decl
== NULL_TREE
)
11366 else if (!staticp
&& ! processing_template_decl
11367 && !COMPLETE_TYPE_P (complete_type (type
))
11368 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11371 cp_error ("field `%D' has incomplete type", declarator
);
11373 cp_error ("name `%T' has incomplete type", type
);
11375 /* If we're instantiating a template, tell them which
11376 instantiation made the field's type be incomplete. */
11377 if (current_class_type
11378 && TYPE_NAME (current_class_type
)
11379 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11380 && declspecs
&& TREE_VALUE (declspecs
)
11381 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11382 cp_error (" in instantiation of template `%T'",
11383 current_class_type
);
11385 type
= error_mark_node
;
11392 error ("`%s' is neither function nor member function; cannot be declared friend",
11393 IDENTIFIER_POINTER (declarator
));
11401 /* Friends are treated specially. */
11402 tree t
= NULL_TREE
;
11404 /* DR 209. The friend does not need to be accessible at this
11406 skip_type_access_control ();
11408 if (ctype
== current_class_type
)
11409 warning ("member functions are implicitly friends of their class");
11411 if (decl
&& DECL_NAME (decl
))
11413 if (template_class_depth (current_class_type
) == 0)
11415 decl
= check_explicit_specialization
11417 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11418 if (decl
== error_mark_node
)
11419 return error_mark_node
;
11422 t
= do_friend (ctype
, declarator
, decl
,
11423 last_function_parms
, *attrlist
, flags
, quals
,
11426 if (t
&& funcdef_flag
)
11428 return void_type_node
;
11431 /* Structure field. It may not be a function, except for C++ */
11433 if (decl
== NULL_TREE
)
11439 /* An attempt is being made to initialize a non-static
11440 member. But, from [class.mem]:
11442 4 A member-declarator can contain a
11443 constant-initializer only if it declares a static
11444 member (_class.static_) of integral or enumeration
11445 type, see _class.static.data_.
11447 This used to be relatively common practice, but
11448 the rest of the compiler does not correctly
11449 handle the initialization unless the member is
11450 static so we make it static below. */
11451 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11453 cp_pedwarn ("making `%D' static", declarator
);
11457 if (uses_template_parms (type
))
11458 /* We'll check at instantiation time. */
11460 else if (check_static_variable_definition (declarator
,
11462 /* If we just return the declaration, crashes
11463 will sometimes occur. We therefore return
11464 void_type_node, as if this was a friend
11465 declaration, to cause callers to completely
11466 ignore this declaration. */
11467 return void_type_node
;
11470 /* 9.2p13 [class.mem] */
11471 if (declarator
== constructor_name (current_class_type
)
11472 /* The standard does not allow non-static data members
11473 here either, but we agreed at the 10/99 meeting
11474 to change that in TC 1 so that they are allowed in
11475 classes with no user-defined constructors. */
11477 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11482 /* C++ allows static class members. All other work
11483 for this is done by grokfield. */
11484 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11485 TREE_STATIC (decl
) = 1;
11486 /* In class context, 'static' means public access. */
11487 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11491 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11492 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11493 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11495 DECL_MUTABLE_P (decl
) = 1;
11496 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11500 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11501 inlinep
, friendp
, raises
!= NULL_TREE
);
11504 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11506 tree original_name
;
11512 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11513 original_name
= dname
;
11515 original_name
= declarator
;
11517 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11518 error ("storage class `auto' invalid for function `%s'", name
);
11519 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11520 error ("storage class `register' invalid for function `%s'", name
);
11522 /* Function declaration not at top level.
11523 Storage classes other than `extern' are not allowed
11524 and `extern' makes no difference. */
11525 if (! toplevel_bindings_p ()
11526 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11527 || RIDBIT_SETP (RID_INLINE
, specbits
))
11530 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11531 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11533 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11536 if (ctype
== NULL_TREE
)
11540 error ("virtual non-class function `%s'", name
);
11544 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11545 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11546 TYPE_ARG_TYPES (type
));
11548 /* Record presence of `static'. */
11549 publicp
= (ctype
!= NULL_TREE
11550 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11551 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11553 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11554 virtualp
, flags
, quals
, raises
,
11556 publicp
, inlinep
, funcdef_flag
,
11557 template_count
, in_namespace
);
11558 if (decl
== NULL_TREE
)
11563 int illegal_static
= 0;
11565 /* Don't allow a static member function in a class, and forbid
11566 declaring main to be static. */
11567 if (TREE_CODE (type
) == METHOD_TYPE
)
11569 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11570 illegal_static
= 1;
11572 else if (current_function_decl
)
11574 /* FIXME need arm citation */
11575 error ("cannot declare static function inside another function");
11576 illegal_static
= 1;
11579 if (illegal_static
)
11582 RIDBIT_RESET (RID_STATIC
, specbits
);
11588 /* It's a variable. */
11590 /* An uninitialized decl with `extern' is a reference. */
11591 decl
= grokvardecl (type
, declarator
, &specbits
,
11593 (type_quals
& TYPE_QUAL_CONST
) != 0,
11595 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11596 inlinep
, friendp
, raises
!= NULL_TREE
);
11600 DECL_CONTEXT (decl
) = ctype
;
11603 cp_pedwarn ("`static' may not be used when defining (as opposed to declaring) a static data member");
11605 RIDBIT_RESET (RID_STATIC
, specbits
);
11607 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11609 cp_error ("static member `%D' declared `register'", decl
);
11610 RIDBIT_RESET (RID_REGISTER
, specbits
);
11612 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11614 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11616 RIDBIT_RESET (RID_EXTERN
, specbits
);
11621 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11623 /* Record `register' declaration for warnings on &
11624 and in case doing stupid register allocation. */
11626 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11627 DECL_REGISTER (decl
) = 1;
11629 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11630 DECL_THIS_EXTERN (decl
) = 1;
11632 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11633 DECL_THIS_STATIC (decl
) = 1;
11635 /* Record constancy and volatility. There's no need to do this
11636 when processing a template; we'll do this for the instantiated
11637 declaration based on the type of DECL. */
11638 if (!processing_template_decl
)
11639 c_apply_type_quals_to_decl (type_quals
, decl
);
11645 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11646 An empty exprlist is a parmlist. An exprlist which
11647 contains only identifiers at the global level
11648 is a parmlist. Otherwise, it is an exprlist. */
11651 parmlist_is_exprlist (exprs
)
11654 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11657 if (toplevel_bindings_p ())
11659 /* At the global level, if these are all identifiers,
11660 then it is a parmlist. */
11663 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11665 exprs
= TREE_CHAIN (exprs
);
11672 /* Subroutine of start_function. Ensure that each of the parameter
11673 types (as listed in PARMS) is complete, as is required for a
11674 function definition. */
11677 require_complete_types_for_parms (parms
)
11680 for (; parms
; parms
= TREE_CHAIN (parms
))
11682 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11683 /* grokparms will have already issued an error */
11684 TREE_TYPE (parms
) = error_mark_node
;
11685 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11686 layout_decl (parms
, 0);
11688 TREE_TYPE (parms
) = error_mark_node
;
11692 /* Returns non-zero if T is a local variable. */
11695 local_variable_p (t
)
11698 if ((TREE_CODE (t
) == VAR_DECL
11699 /* A VAR_DECL with a context that is a _TYPE is a static data
11701 && !TYPE_P (CP_DECL_CONTEXT (t
))
11702 /* Any other non-local variable must be at namespace scope. */
11703 && !DECL_NAMESPACE_SCOPE_P (t
))
11704 || (TREE_CODE (t
) == PARM_DECL
))
11710 /* Returns non-zero if T is an automatic local variable or a label.
11711 (These are the declarations that need to be remapped when the code
11712 containing them is duplicated.) */
11715 nonstatic_local_decl_p (t
)
11718 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11719 || TREE_CODE (t
) == LABEL_DECL
11720 || TREE_CODE (t
) == RESULT_DECL
);
11723 /* Like local_variable_p, but suitable for use as a tree-walking
11727 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11729 int *walk_subtrees ATTRIBUTE_UNUSED
;
11730 void *data ATTRIBUTE_UNUSED
;
11732 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11733 ? *tp
: NULL_TREE
);
11736 /* Check that ARG, which is a default-argument expression for a
11737 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11738 something goes wrong. DECL may also be a _TYPE node, rather than a
11739 DECL, if there is no DECL available. */
11742 check_default_argument (decl
, arg
)
11749 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11750 /* We get a DEFAULT_ARG when looking at an in-class declaration
11751 with a default argument. Ignore the argument for now; we'll
11752 deal with it after the class is complete. */
11755 if (processing_template_decl
|| uses_template_parms (arg
))
11756 /* We don't do anything checking until instantiation-time. Note
11757 that there may be uninstantiated arguments even for an
11758 instantiated function, since default arguments are not
11759 instantiated until they are needed. */
11768 decl_type
= TREE_TYPE (decl
);
11770 if (arg
== error_mark_node
11771 || decl
== error_mark_node
11772 || TREE_TYPE (arg
) == error_mark_node
11773 || decl_type
== error_mark_node
)
11774 /* Something already went wrong. There's no need to check
11776 return error_mark_node
;
11778 /* [dcl.fct.default]
11780 A default argument expression is implicitly converted to the
11782 if (!TREE_TYPE (arg
)
11783 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11786 cp_error ("default argument for `%#D' has type `%T'",
11787 decl
, TREE_TYPE (arg
));
11789 cp_error ("default argument for parameter of type `%T' has type `%T'",
11790 decl_type
, TREE_TYPE (arg
));
11792 return error_mark_node
;
11795 /* [dcl.fct.default]
11797 Local variables shall not be used in default argument
11800 The keyword `this' shall not be used in a default argument of a
11801 member function. */
11802 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11806 cp_error ("default argument `%E' uses local variable `%D'",
11808 return error_mark_node
;
11815 /* Decode the list of parameter types for a function type.
11816 Given the list of things declared inside the parens,
11817 return a list of types.
11819 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11820 flag. If unset, we append void_list_node. A parmlist declared
11821 as `(void)' is accepted as the empty parmlist.
11823 Also set last_function_parms to the chain of PARM_DECLs. */
11826 grokparms (first_parm
)
11829 tree result
= NULL_TREE
;
11830 tree decls
= NULL_TREE
;
11831 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
11835 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
11837 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11839 tree type
= NULL_TREE
;
11840 register tree decl
= TREE_VALUE (parm
);
11841 tree init
= TREE_PURPOSE (parm
);
11843 chain
= TREE_CHAIN (parm
);
11844 /* @@ weak defense against parse errors. */
11845 if (TREE_CODE (decl
) != VOID_TYPE
11846 && TREE_CODE (decl
) != TREE_LIST
)
11848 /* Give various messages as the need arises. */
11849 if (TREE_CODE (decl
) == STRING_CST
)
11850 cp_error ("invalid string constant `%E'", decl
);
11851 else if (TREE_CODE (decl
) == INTEGER_CST
)
11852 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11856 if (parm
== void_list_node
)
11859 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
11860 PARM
, init
!= NULL_TREE
, NULL
);
11861 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11864 type
= TREE_TYPE (decl
);
11865 if (VOID_TYPE_P (type
))
11867 if (same_type_p (type
, void_type_node
)
11868 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
11869 /* this is a parmlist of `(void)', which is ok. */
11871 incomplete_type_error (decl
, type
);
11872 /* It's not a good idea to actually create parameters of
11873 type `void'; other parts of the compiler assume that a
11874 void type terminates the parameter list. */
11875 type
= error_mark_node
;
11876 TREE_TYPE (decl
) = error_mark_node
;
11879 if (type
!= error_mark_node
)
11881 /* Top-level qualifiers on the parameters are
11882 ignored for function types. */
11883 type
= TYPE_MAIN_VARIANT (type
);
11884 if (TREE_CODE (type
) == METHOD_TYPE
)
11886 cp_error ("parameter `%D' invalidly declared method type", decl
);
11887 type
= build_pointer_type (type
);
11888 TREE_TYPE (decl
) = type
;
11890 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11892 cp_error ("parameter `%D' invalidly declared offset type", decl
);
11893 type
= build_pointer_type (type
);
11894 TREE_TYPE (decl
) = type
;
11896 else if (abstract_virtuals_error (decl
, type
))
11897 any_error
= 1; /* Seems like a good idea. */
11898 else if (POINTER_TYPE_P (type
))
11900 /* [dcl.fct]/6, parameter types cannot contain pointers
11901 (references) to arrays of unknown bound. */
11902 tree t
= TREE_TYPE (type
);
11903 int ptr
= TYPE_PTR_P (type
);
11907 if (TYPE_PTR_P (t
))
11909 else if (TREE_CODE (t
) != ARRAY_TYPE
)
11911 else if (!TYPE_DOMAIN (t
))
11915 if (TREE_CODE (t
) == ARRAY_TYPE
)
11916 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
11917 decl
, ptr
? "pointer" : "reference", t
);
11920 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11921 if (PROMOTE_PROTOTYPES
11922 && INTEGRAL_TYPE_P (type
)
11923 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11924 DECL_ARG_TYPE (decl
) = integer_type_node
;
11925 if (!any_error
&& init
)
11926 init
= check_default_argument (decl
, init
);
11931 TREE_CHAIN (decl
) = decls
;
11933 result
= tree_cons (init
, type
, result
);
11935 decls
= nreverse (decls
);
11936 result
= nreverse (result
);
11938 result
= chainon (result
, void_list_node
);
11939 last_function_parms
= decls
;
11945 /* D is a constructor or overloaded `operator='. Returns non-zero if
11946 D's arguments allow it to be a copy constructor, or copy assignment
11955 if (!DECL_FUNCTION_MEMBER_P (d
))
11958 t
= FUNCTION_FIRST_USER_PARMTYPE (d
);
11959 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11960 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11961 == DECL_CONTEXT (d
))
11962 && (TREE_CHAIN (t
) == NULL_TREE
11963 || TREE_CHAIN (t
) == void_list_node
11964 || TREE_PURPOSE (TREE_CHAIN (t
))))
11969 /* These memoizing functions keep track of special properties which
11970 a class may have. `grok_ctor_properties' notices whether a class
11971 has a constructor of the form X(X&), and also complains
11972 if the class has a constructor of the form X(X).
11973 `grok_op_properties' takes notice of the various forms of
11974 operator= which are defined, as well as what sorts of type conversion
11975 may apply. Both functions take a FUNCTION_DECL as an argument. */
11978 grok_ctor_properties (ctype
, decl
)
11981 tree parmtypes
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11982 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11986 A non-template constructor for class X is a copy constructor if
11987 its first parameter is of type X&, const X&, volatile X& or const
11988 volatile X&, and either there are no other parameters or else all
11989 other parameters have default arguments. */
11990 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11991 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11992 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
11993 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11994 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11996 TYPE_HAS_INIT_REF (ctype
) = 1;
11997 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11998 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12002 A declaration of a constructor for a class X is ill-formed if its
12003 first parameter is of type (optionally cv-qualified) X and either
12004 there are no other parameters or else all other parameters have
12007 We *don't* complain about member template instantiations that
12008 have this form, though; they can occur as we try to decide what
12009 constructor to use during overload resolution. Since overload
12010 resolution will never prefer such a constructor to the
12011 non-template copy constructor (which is either explicitly or
12012 implicitly defined), there's no need to worry about their
12013 existence. Theoretically, they should never even be
12014 instantiated, but that's hard to forestall. */
12015 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12016 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12017 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12018 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12020 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12022 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12025 else if (TREE_CODE (parmtype
) == VOID_TYPE
12026 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12027 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12032 /* An operator with this code is unary, but can also be binary. */
12036 enum tree_code code
;
12038 return (code
== INDIRECT_REF
12039 || code
== ADDR_EXPR
12040 || code
== CONVERT_EXPR
12041 || code
== NEGATE_EXPR
12042 || code
== PREINCREMENT_EXPR
12043 || code
== PREDECREMENT_EXPR
);
12046 /* An operator with this name can only be unary. */
12050 enum tree_code code
;
12052 return (code
== TRUTH_NOT_EXPR
12053 || code
== BIT_NOT_EXPR
12054 || code
== COMPONENT_REF
12055 || code
== TYPE_EXPR
);
12058 /* Do a little sanity-checking on how they declared their operator. */
12061 grok_op_properties (decl
, virtualp
, friendp
)
12063 int virtualp
, friendp
;
12065 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12067 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12068 tree name
= DECL_NAME (decl
);
12069 enum tree_code operator_code
;
12072 /* Count the number of arguments. */
12073 for (argtype
= argtypes
, arity
= 0;
12074 argtype
&& argtype
!= void_list_node
;
12075 argtype
= TREE_CHAIN (argtype
))
12078 if (current_class_type
== NULL_TREE
)
12081 if (DECL_CONV_FN_P (decl
))
12082 operator_code
= TYPE_EXPR
;
12086 #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \
12087 if (ansi_opname (CODE) == name) \
12089 operator_code = CODE; \
12092 else if (ansi_assopname (CODE) == name) \
12094 operator_code = CODE; \
12095 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12099 #include "operators.def"
12100 #undef DEF_OPERATOR
12102 my_friendly_abort (20000527);
12105 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12106 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12110 switch (operator_code
)
12113 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12117 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12120 case COMPONENT_REF
:
12122 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12126 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12130 TYPE_GETS_DELETE (current_class_type
) |= 1;
12134 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12137 case VEC_DELETE_EXPR
:
12138 TYPE_GETS_DELETE (current_class_type
) |= 2;
12146 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12148 /* When the compiler encounters the definition of A::operator new, it
12149 doesn't look at the class declaration to find out if it's static. */
12151 revert_static_member_fn (decl
);
12153 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12155 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12158 revert_static_member_fn (decl
);
12160 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12164 /* An operator function must either be a non-static member function
12165 or have at least one parameter of a class, a reference to a class,
12166 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12167 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12169 if (operator_code
== TYPE_EXPR
12170 || operator_code
== CALL_EXPR
12171 || operator_code
== COMPONENT_REF
12172 || operator_code
== ARRAY_REF
12173 || operator_code
== NOP_EXPR
)
12174 cp_error ("`%D' must be a nonstatic member function", decl
);
12179 if (DECL_STATIC_FUNCTION_P (decl
))
12180 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12183 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12185 tree arg
= TREE_VALUE (p
);
12186 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12187 arg
= TREE_TYPE (arg
);
12189 /* This lets bad template code slip through. */
12190 if (IS_AGGR_TYPE (arg
)
12191 || TREE_CODE (arg
) == ENUMERAL_TYPE
12192 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12193 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12197 ("`%D' must have an argument of class or enumerated type",
12204 if (operator_code
== CALL_EXPR
)
12205 return; /* No restrictions on args. */
12207 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12209 tree t
= TREE_TYPE (name
);
12212 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12213 const char *what
= 0;
12216 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12218 if (TREE_CODE (t
) == VOID_TYPE
)
12220 else if (t
== current_class_type
)
12221 what
= "the same type";
12222 /* Don't force t to be complete here. */
12223 else if (IS_AGGR_TYPE (t
)
12224 && COMPLETE_TYPE_P (t
)
12225 && DERIVED_FROM_P (t
, current_class_type
))
12226 what
= "a base class";
12229 warning ("conversion to %s%s will never use a type conversion operator",
12230 ref
? "a reference to " : "", what
);
12234 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12235 && operator_code
== NOP_EXPR
)
12239 if (arity
!= 2 && methodp
)
12241 cp_error ("`%D' must take exactly one argument", decl
);
12244 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12248 A user-declared copy assignment operator X::operator= is
12249 a non-static non-template member function of class X with
12250 exactly one parameter of type X, X&, const X&, volatile
12251 X& or const volatile X&. */
12252 if (copy_assignment_arg_p (parmtype
, virtualp
)
12253 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12254 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12257 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12258 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12259 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12260 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12263 else if (operator_code
== COND_EXPR
)
12266 cp_error ("ISO C++ prohibits overloading operator ?:");
12268 else if (ambi_op_p (operator_code
))
12271 /* We pick the one-argument operator codes by default, so
12272 we don't have to change anything. */
12274 else if (arity
== 2)
12276 /* If we thought this was a unary operator, we now know
12277 it to be a binary operator. */
12278 switch (operator_code
)
12281 operator_code
= MULT_EXPR
;
12285 operator_code
= BIT_AND_EXPR
;
12289 operator_code
= PLUS_EXPR
;
12293 operator_code
= MINUS_EXPR
;
12296 case PREINCREMENT_EXPR
:
12297 operator_code
= POSTINCREMENT_EXPR
;
12300 case PREDECREMENT_EXPR
:
12301 operator_code
= POSTDECREMENT_EXPR
;
12305 my_friendly_abort (20000527);
12308 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12310 if ((operator_code
== POSTINCREMENT_EXPR
12311 || operator_code
== POSTDECREMENT_EXPR
)
12312 && ! processing_template_decl
12313 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12316 cp_error ("postfix `%D' must take `int' as its argument",
12320 ("postfix `%D' must take `int' as its second argument",
12327 cp_error ("`%D' must take either zero or one argument", decl
);
12329 cp_error ("`%D' must take either one or two arguments", decl
);
12332 /* More Effective C++ rule 6. */
12334 && (operator_code
== POSTINCREMENT_EXPR
12335 || operator_code
== POSTDECREMENT_EXPR
12336 || operator_code
== PREINCREMENT_EXPR
12337 || operator_code
== PREDECREMENT_EXPR
))
12339 tree arg
= TREE_VALUE (argtypes
);
12340 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12341 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12342 arg
= TREE_TYPE (arg
);
12343 arg
= TYPE_MAIN_VARIANT (arg
);
12344 if (operator_code
== PREINCREMENT_EXPR
12345 || operator_code
== PREDECREMENT_EXPR
)
12347 if (TREE_CODE (ret
) != REFERENCE_TYPE
12348 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12350 cp_warning ("prefix `%D' should return `%T'", decl
,
12351 build_reference_type (arg
));
12355 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12356 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12360 else if (unary_op_p (operator_code
))
12365 cp_error ("`%D' must take `void'", decl
);
12367 cp_error ("`%D' must take exactly one argument", decl
);
12370 else /* if (binary_op_p (operator_code)) */
12375 cp_error ("`%D' must take exactly one argument", decl
);
12377 cp_error ("`%D' must take exactly two arguments", decl
);
12380 /* More Effective C++ rule 7. */
12382 && (operator_code
== TRUTH_ANDIF_EXPR
12383 || operator_code
== TRUTH_ORIF_EXPR
12384 || operator_code
== COMPOUND_EXPR
))
12385 cp_warning ("user-defined `%D' always evaluates both arguments",
12389 /* Effective C++ rule 23. */
12392 && (operator_code
== PLUS_EXPR
12393 || operator_code
== MINUS_EXPR
12394 || operator_code
== TRUNC_DIV_EXPR
12395 || operator_code
== MULT_EXPR
)
12396 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12397 cp_warning ("`%D' should return by value", decl
);
12400 for (; argtypes
&& argtypes
!= void_list_node
;
12401 argtypes
= TREE_CHAIN (argtypes
))
12402 if (TREE_PURPOSE (argtypes
))
12404 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12405 if (operator_code
== POSTINCREMENT_EXPR
12406 || operator_code
== POSTDECREMENT_EXPR
)
12409 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12412 cp_error ("`%D' cannot have default arguments", decl
);
12418 static const char *
12420 enum tag_types code
;
12433 my_friendly_abort (981122);
12437 /* Get the struct, enum or union (CODE says which) with tag NAME.
12438 Define the tag as a forward-reference if it is not defined.
12440 C++: If a class derivation is given, process it here, and report
12441 an error if multiple derivation declarations are not identical.
12443 If this is a definition, come in through xref_tag and only look in
12444 the current frame for the name (since C++ allows new names in any
12448 xref_tag (code_type_node
, name
, globalize
)
12449 tree code_type_node
;
12453 enum tag_types tag_code
;
12454 enum tree_code code
;
12455 register tree ref
, t
;
12456 struct binding_level
*b
= current_binding_level
;
12458 tree attributes
= NULL_TREE
;
12459 tree context
= NULL_TREE
;
12461 /* If we are called from the parser, code_type_node will sometimes be a
12462 TREE_LIST. This indicates that the user wrote
12463 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12465 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12467 attributes
= TREE_PURPOSE (code_type_node
);
12468 code_type_node
= TREE_VALUE (code_type_node
);
12471 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12476 code
= RECORD_TYPE
;
12482 code
= ENUMERAL_TYPE
;
12485 my_friendly_abort (18);
12488 /* If a cross reference is requested, look up the type
12489 already defined for this tag and return it. */
12493 name
= TYPE_IDENTIFIER (t
);
12497 t
= IDENTIFIER_TYPE_VALUE (name
);
12499 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12500 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12502 static int explained
;
12505 cp_warning ("`%s %T' declares a new type at namespace scope",
12506 tag_name (tag_code
), name
);
12508 cp_warning (" names from dependent base classes are not visible to unqualified name lookup - to refer to the inherited type, say `%s %T::%T'",
12509 tag_name (tag_code
),
12510 constructor_name (current_class_type
),
12511 TYPE_IDENTIFIER (t
));
12513 /* We need to remove the class scope binding for the
12514 TYPENAME_TYPE as otherwise poplevel_class gets confused. */
12515 for (shadowed
= b
->class_shadowed
;
12517 shadowed
= TREE_CHAIN (shadowed
))
12518 if (TREE_TYPE (shadowed
) == TYPE_NAME (t
))
12520 TREE_PURPOSE (shadowed
) = NULL_TREE
;
12525 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12526 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12531 /* If we know we are defining this tag, only look it up in
12532 this scope and don't try to find it as a type. */
12533 ref
= lookup_tag (code
, name
, b
, 1);
12539 /* [dcl.type.elab] If the identifier resolves to a
12540 typedef-name or a template type-parameter, the
12541 elaborated-type-specifier is ill-formed. */
12542 if (t
!= TYPE_MAIN_VARIANT (t
)
12543 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12544 cp_pedwarn ("using typedef-name `%D' after `%s'",
12545 TYPE_NAME (t
), tag_name (tag_code
));
12546 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12547 cp_error ("using template type parameter `%T' after `%s'",
12548 t
, tag_name (tag_code
));
12553 ref
= lookup_tag (code
, name
, b
, 0);
12557 /* Try finding it as a type declaration. If that wins,
12559 ref
= lookup_name (name
, 1);
12561 if (ref
!= NULL_TREE
12562 && processing_template_decl
12563 && DECL_CLASS_TEMPLATE_P (ref
)
12564 && template_class_depth (current_class_type
) == 0)
12565 /* Since GLOBALIZE is true, we're declaring a global
12566 template, so we want this type. */
12567 ref
= DECL_TEMPLATE_RESULT (ref
);
12569 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12570 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12571 ref
= TREE_TYPE (ref
);
12576 if (ref
&& current_class_type
12577 && template_class_depth (current_class_type
)
12578 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12580 /* Since GLOBALIZE is non-zero, we are not looking at a
12581 definition of this tag. Since, in addition, we are currently
12582 processing a (member) template declaration of a template
12583 class, we must be very careful; consider:
12590 { template <class V>
12591 friend struct S1; };
12593 Here, the S2::S1 declaration should not be confused with the
12594 outer declaration. In particular, the inner version should
12595 have a template parameter of level 2, not level 1. This
12596 would be particularly important if the member declaration
12599 template <class V = U> friend struct S1;
12601 say, when we should tsubst into `U' when instantiating
12602 S2. On the other hand, when presented with:
12612 we must find the inner binding eventually. We
12613 accomplish this by making sure that the new type we
12614 create to represent this declaration has the right
12616 context
= TYPE_CONTEXT (ref
);
12623 /* If no such tag is yet defined, create a forward-reference node
12624 and record it as the "definition".
12625 When a real declaration of this type is found,
12626 the forward-reference will be altered into a real type. */
12627 if (code
== ENUMERAL_TYPE
)
12629 cp_error ("use of enum `%#D' without previous declaration", name
);
12631 ref
= make_node (ENUMERAL_TYPE
);
12633 /* Give the type a default layout like unsigned int
12634 to avoid crashing if it does not get defined. */
12635 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12636 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12637 TYPE_USER_ALIGN (ref
) = 0;
12638 TREE_UNSIGNED (ref
) = 1;
12639 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12640 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12641 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12643 /* Enable us to recognize when a type is created in class context.
12644 To do nested classes correctly, this should probably be cleared
12645 out when we leave this classes scope. Currently this in only
12646 done in `start_enum'. */
12648 pushtag (name
, ref
, globalize
);
12652 struct binding_level
*old_b
= class_binding_level
;
12654 ref
= make_aggr_type (code
);
12655 TYPE_CONTEXT (ref
) = context
;
12657 #ifdef NONNESTED_CLASSES
12658 /* Class types don't nest the way enums do. */
12659 class_binding_level
= (struct binding_level
*)0;
12661 pushtag (name
, ref
, globalize
);
12662 class_binding_level
= old_b
;
12667 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12668 redeclare_class_template (ref
, current_template_parms
);
12671 /* Until the type is defined, tentatively accept whatever
12672 structure tag the user hands us. */
12673 if (!COMPLETE_TYPE_P (ref
)
12674 && ref
!= current_class_type
12675 /* Have to check this, in case we have contradictory tag info. */
12676 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12678 if (tag_code
== class_type
)
12679 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12680 else if (tag_code
== record_type
)
12681 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12684 TREE_TYPE (ref
) = attributes
;
12690 xref_tag_from_type (old
, id
, globalize
)
12694 tree code_type_node
;
12696 if (TREE_CODE (old
) == RECORD_TYPE
)
12697 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12698 ? class_type_node
: record_type_node
);
12700 code_type_node
= union_type_node
;
12702 if (id
== NULL_TREE
)
12703 id
= TYPE_IDENTIFIER (old
);
12705 return xref_tag (code_type_node
, id
, globalize
);
12708 /* REF is a type (named NAME), for which we have just seen some
12709 baseclasses. BINFO is a list of those baseclasses; the
12710 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12711 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12712 struct, or union. */
12715 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12716 tree code_type_node
;
12720 /* In the declaration `A : X, Y, ... Z' we mark all the types
12721 (A, X, Y, ..., Z) so we can check for duplicates. */
12726 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12728 if (tag_code
== union_type
)
12730 cp_error ("derived union `%T' invalid", ref
);
12734 len
= list_length (binfo
);
12736 /* First, make sure that any templates in base-classes are
12737 instantiated. This ensures that if we call ourselves recursively
12738 we do not get confused about which classes are marked and which
12740 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12741 complete_type (TREE_VALUE (base
));
12743 SET_CLASSTYPE_MARKED (ref
);
12744 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12746 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12748 /* The base of a derived struct is public by default. */
12750 = (TREE_PURPOSE (binfo
) == access_public_node
12751 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12752 || (tag_code
!= class_type
12753 && (TREE_PURPOSE (binfo
) == access_default_node
12754 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12756 = (TREE_PURPOSE (binfo
) == access_protected_node
12757 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12759 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12760 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12761 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12762 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12763 tree basetype
= TREE_VALUE (binfo
);
12766 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12767 basetype
= TREE_TYPE (basetype
);
12769 || (TREE_CODE (basetype
) != RECORD_TYPE
12770 && TREE_CODE (basetype
) != TYPENAME_TYPE
12771 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12772 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12774 cp_error ("base type `%T' fails to be a struct or class type",
12775 TREE_VALUE (binfo
));
12779 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12781 /* This code replaces similar code in layout_basetypes.
12782 We put the complete_type first for implicit `typename'. */
12783 if (!COMPLETE_TYPE_P (basetype
)
12784 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12786 cp_error ("base class `%T' has incomplete type", basetype
);
12791 if (CLASSTYPE_MARKED (basetype
))
12793 if (basetype
== ref
)
12794 cp_error ("recursive type `%T' undefined", basetype
);
12796 cp_error ("duplicate base type `%T' invalid", basetype
);
12800 if (TYPE_FOR_JAVA (basetype
)
12801 && (current_lang_depth () == 0))
12802 TYPE_FOR_JAVA (ref
) = 1;
12804 /* Note that the BINFO records which describe individual
12805 inheritances are *not* shared in the lattice! They
12806 cannot be shared because a given baseclass may be
12807 inherited with different `accessibility' by different
12808 derived classes. (Each BINFO record describing an
12809 individual inheritance contains flags which say what
12810 the `accessibility' of that particular inheritance is.) */
12813 = make_binfo (size_zero_node
, basetype
,
12814 CLASS_TYPE_P (basetype
)
12815 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12816 CLASS_TYPE_P (basetype
)
12817 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12819 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12820 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12821 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12822 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12823 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12825 /* We need to unshare the binfos now so that lookups during class
12826 definition work. */
12827 unshare_base_binfos (base_binfo
);
12829 SET_CLASSTYPE_MARKED (basetype
);
12831 /* We are free to modify these bits because they are meaningless
12832 at top level, and BASETYPE is a top-level type. */
12833 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12835 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12836 /* Converting to a virtual base class requires looking
12837 up the offset of the virtual base. */
12838 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12841 if (CLASS_TYPE_P (basetype
))
12843 TYPE_HAS_NEW_OPERATOR (ref
)
12844 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12845 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12846 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12847 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12848 /* If the base-class uses multiple inheritance, so do we. */
12849 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12850 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12851 /* Likewise, if converting to a base of the base may require
12852 code, then we may need to generate code to convert to a
12854 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12855 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
12862 TREE_VEC_LENGTH (binfos
) = i
;
12864 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12868 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12869 /* If there is more than one non-empty they cannot be at the same
12871 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12874 /* Unmark all the types. */
12876 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12877 CLEAR_CLASSTYPE_MARKED (ref
);
12879 /* Now that we know all the base-classes, set up the list of virtual
12881 get_vbase_types (ref
);
12885 /* Begin compiling the definition of an enumeration type.
12886 NAME is its name (or null if anonymous).
12887 Returns the type object, as yet incomplete.
12888 Also records info about it so that build_enumerator
12889 may be used to declare the individual values as they are read. */
12895 register tree enumtype
= NULL_TREE
;
12896 struct binding_level
*b
= current_binding_level
;
12898 /* If this is the real definition for a previous forward reference,
12899 fill in the contents in the same object that used to be the
12900 forward reference. */
12902 if (name
!= NULL_TREE
)
12903 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12905 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12907 cp_error ("multiple definition of `%#T'", enumtype
);
12908 cp_error_at ("previous definition here", enumtype
);
12909 /* Clear out TYPE_VALUES, and start again. */
12910 TYPE_VALUES (enumtype
) = NULL_TREE
;
12914 enumtype
= make_node (ENUMERAL_TYPE
);
12915 pushtag (name
, enumtype
, 0);
12918 if (current_class_type
)
12919 TREE_ADDRESSABLE (b
->tags
) = 1;
12921 GNU_xref_decl (current_function_decl
, enumtype
);
12925 /* After processing and defining all the values of an enumeration type,
12926 install their decls in the enumeration type and finish it off.
12927 ENUMTYPE is the type object and VALUES a list of name-value pairs. */
12930 finish_enum (enumtype
)
12942 /* We built up the VALUES in reverse order. */
12943 TYPE_VALUES (enumtype
) = nreverse (TYPE_VALUES (enumtype
));
12947 Following the closing brace of an enum-specifier, each
12948 enumerator has the type of its enumeration. Prior to the
12949 closing brace, the type of each enumerator is the type of
12950 its initializing value. */
12951 for (pair
= TYPE_VALUES (enumtype
); pair
; pair
= TREE_CHAIN (pair
))
12952 TREE_TYPE (TREE_VALUE (pair
)) = enumtype
;
12954 /* For a enum defined in a template, all further processing is
12955 postponed until the template is instantiated. */
12956 if (processing_template_decl
)
12958 tree scope
= current_scope ();
12959 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12960 add_stmt (build_min (TAG_DEFN
, enumtype
));
12966 /* Figure out what the minimum and maximum values of the enumerators
12968 if (TYPE_VALUES (enumtype
))
12970 minnode
= maxnode
= NULL_TREE
;
12972 for (pair
= TYPE_VALUES (enumtype
);
12974 pair
= TREE_CHAIN (pair
))
12978 value
= DECL_INITIAL (TREE_VALUE (pair
));
12981 minnode
= maxnode
= value
;
12982 else if (tree_int_cst_lt (maxnode
, value
))
12984 else if (tree_int_cst_lt (value
, minnode
))
12989 minnode
= maxnode
= integer_zero_node
;
12991 /* Compute the number of bits require to represent all values of the
12992 enumeration. We must do this before the type of MINNODE and
12993 MAXNODE are transformed, since min_precision relies on the
12994 TREE_TYPE of the value it is passed. */
12995 unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12996 lowprec
= min_precision (minnode
, unsignedp
);
12997 highprec
= min_precision (maxnode
, unsignedp
);
12998 precision
= MAX (lowprec
, highprec
);
13000 /* Set the TREE_TYPE for the values as well. That's so that when we
13001 call decl_constant_value we get an entity of the right type (but
13002 with the constant value). In addition, transform the TYPE_VALUES
13003 list to contain the values, rather than the CONST_DECLs for them. */
13004 for (pair
= TYPE_VALUES (enumtype
); pair
; pair
= TREE_CHAIN (pair
))
13006 tree value
= DECL_INITIAL (TREE_VALUE (pair
));
13008 TREE_TYPE (value
) = enumtype
;
13009 TREE_VALUE (pair
) = value
;
13012 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13013 TYPE_SIZE (enumtype
) = NULL_TREE
;
13014 TYPE_PRECISION (enumtype
) = precision
;
13016 fixup_unsigned_type (enumtype
);
13018 fixup_signed_type (enumtype
);
13020 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13021 /* Use the width of the narrowest normal C type which is wide
13023 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13026 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13028 TYPE_SIZE (enumtype
) = NULL_TREE
;
13029 layout_type (enumtype
);
13031 /* Fix up all variant types of this enum type. */
13032 for (t
= TYPE_MAIN_VARIANT (enumtype
); t
; t
= TYPE_NEXT_VARIANT (t
))
13034 TYPE_VALUES (t
) = TYPE_VALUES (enumtype
);
13035 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (enumtype
);
13036 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (enumtype
);
13037 TYPE_SIZE (t
) = TYPE_SIZE (enumtype
);
13038 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (enumtype
);
13039 TYPE_MODE (t
) = TYPE_MODE (enumtype
);
13040 TYPE_PRECISION (t
) = TYPE_PRECISION (enumtype
);
13041 TYPE_ALIGN (t
) = TYPE_ALIGN (enumtype
);
13042 TYPE_USER_ALIGN (t
) = TYPE_USER_ALIGN (enumtype
);
13043 TREE_UNSIGNED (t
) = TREE_UNSIGNED (enumtype
);
13046 /* Finish debugging output for this type. */
13047 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13050 /* Build and install a CONST_DECL for an enumeration constant of the
13051 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13052 Assignment of sequential values by default is handled here. */
13055 build_enumerator (name
, value
, enumtype
)
13065 /* Remove no-op casts from the value. */
13067 STRIP_TYPE_NOPS (value
);
13069 if (! processing_template_decl
)
13071 /* Validate and default VALUE. */
13072 if (value
!= NULL_TREE
)
13074 value
= decl_constant_value (value
);
13076 if (TREE_CODE (value
) == INTEGER_CST
)
13078 value
= default_conversion (value
);
13079 constant_expression_warning (value
);
13083 cp_error ("enumerator value for `%D' not integer constant", name
);
13088 /* Default based on previous value. */
13089 if (value
== NULL_TREE
&& ! processing_template_decl
)
13093 if (TYPE_VALUES (enumtype
))
13095 /* The next value is the previous value ... */
13096 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13097 /* ... plus one. */
13098 value
= cp_build_binary_op (PLUS_EXPR
,
13102 if (tree_int_cst_lt (value
, prev_value
))
13103 cp_error ("overflow in enumeration values at `%D'", name
);
13106 value
= integer_zero_node
;
13109 /* Remove no-op casts from the value. */
13111 STRIP_TYPE_NOPS (value
);
13113 /* To fix MAX_VAL enum consts. (bkoz) */
13114 TREE_TYPE (value
) = integer_type_node
;
13118 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13119 Even in other cases, we will later (in finish_enum) be setting
13120 the type of VALUE. But, we don't need to make a copy if this
13121 VALUE is one of the enumeration constants for this same
13122 enumeration type. */
13123 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13124 if (TREE_VALUE (values
) == value
)
13126 /* If we didn't break out of the loop, then we do need a copy. */
13127 if (!values
&& value
)
13128 value
= copy_node (value
);
13130 /* C++ associates enums with global, function, or class declarations. */
13131 context
= current_scope ();
13133 /* Build the actual enumeration constant. Note that the enumeration
13134 constants have the type of their initializers until the
13135 enumeration is complete:
13139 Following the closing brace of an enum-specifier, each enumer-
13140 ator has the type of its enumeration. Prior to the closing
13141 brace, the type of each enumerator is the type of its
13142 initializing value.
13144 In finish_enum we will reset the type. Of course, if we're
13145 processing a template, there may be no value. */
13146 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13148 if (context
&& context
== current_class_type
)
13149 /* This enum declaration is local to the class. We need the full
13150 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13151 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13153 /* It's a global enum, or it's local to a function. (Note local to
13154 a function could mean local to a class method. */
13155 decl
= build_decl (CONST_DECL
, name
, type
);
13157 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13158 DECL_INITIAL (decl
) = value
;
13159 TREE_READONLY (decl
) = 1;
13161 if (context
&& context
== current_class_type
)
13162 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13163 on the TYPE_FIELDS list for `S'. (That's so that you can say
13164 things like `S::i' later.) */
13165 finish_member_declaration (decl
);
13169 GNU_xref_decl (current_function_decl
, decl
);
13172 /* Add this enumeration constant to the list for this type. */
13173 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13177 /* We're defining DECL. Make sure that it's type is OK. */
13180 check_function_type (decl
, current_function_parms
)
13182 tree current_function_parms
;
13184 tree fntype
= TREE_TYPE (decl
);
13185 tree return_type
= complete_type (TREE_TYPE (fntype
));
13187 /* In a function definition, arg types must be complete. */
13188 require_complete_types_for_parms (current_function_parms
);
13190 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13192 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13194 /* Make it return void instead, but don't change the
13195 type of the DECL_RESULT, in case we have a named return value. */
13196 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13198 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13200 = build_cplus_method_type (ctype
,
13202 FUNCTION_ARG_CHAIN (decl
));
13206 = build_function_type (void_type_node
,
13207 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13209 = build_exception_variant (fntype
,
13210 TYPE_RAISES_EXCEPTIONS (fntype
));
13213 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13216 /* Create the FUNCTION_DECL for a function definition.
13217 DECLSPECS and DECLARATOR are the parts of the declaration;
13218 they describe the function's name and the type it returns,
13219 but twisted together in a fashion that parallels the syntax of C.
13221 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13222 DECLARATOR is really the DECL for the function we are about to
13223 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13224 indicating that the function is an inline defined in-class.
13226 This function creates a binding context for the function body
13227 as well as setting up the FUNCTION_DECL in current_function_decl.
13229 Returns 1 on success. If the DECLARATOR is not suitable for a function
13230 (it defines a datum instead), we return 0, which tells
13231 yyparse to report a parse error.
13233 For C++, we must first check whether that datum makes any sense.
13234 For example, "class A local_a(1,2);" means that variable local_a
13235 is an aggregate of type A, which should have a constructor
13236 applied to it with the argument list [1, 2]. */
13239 start_function (declspecs
, declarator
, attrs
, flags
)
13240 tree declspecs
, declarator
, attrs
;
13244 tree ctype
= NULL_TREE
;
13247 extern int have_extern_spec
;
13248 extern int used_extern_spec
;
13249 int doing_friend
= 0;
13250 struct binding_level
*bl
;
13251 tree current_function_parms
;
13253 /* Sanity check. */
13254 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13255 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13257 /* This should only be done once on the top most decl. */
13258 if (have_extern_spec
&& !used_extern_spec
)
13260 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13261 used_extern_spec
= 1;
13264 if (flags
& SF_PRE_PARSED
)
13266 decl1
= declarator
;
13268 fntype
= TREE_TYPE (decl1
);
13269 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13270 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13272 /* ISO C++ 11.4/5. A friend function defined in a class is in
13273 the (lexical) scope of the class in which it is defined. */
13274 if (!ctype
&& DECL_FRIEND_P (decl1
))
13276 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13278 /* CTYPE could be null here if we're dealing with a template;
13279 for example, `inline friend float foo()' inside a template
13280 will have no CTYPE set. */
13281 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13287 last_function_parms
= DECL_ARGUMENTS (decl1
);
13291 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL
);
13292 /* If the declarator is not suitable for a function definition,
13293 cause a syntax error. */
13294 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13296 fntype
= TREE_TYPE (decl1
);
13298 restype
= TREE_TYPE (fntype
);
13299 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13301 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13302 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13303 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13304 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13305 fntype
= build_function_type (integer_type_node
,
13306 TYPE_ARG_TYPES (fntype
));
13308 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13310 TYPE_ARG_TYPES (fntype
));
13311 TREE_TYPE (decl1
) = fntype
;
13314 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13315 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13316 else if (DECL_MAIN_P (decl1
))
13318 /* If this doesn't return integer_type, complain. */
13319 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13321 if (pedantic
|| warn_return_type
)
13322 pedwarn ("return type for `main' changed to `int'");
13323 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13328 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1
))
13329 /* This is a constructor, we must ensure that any default args
13330 introduced by this definition are propagated to the clones
13331 now. The clones are used directly in overload resolution. */
13332 adjust_clone_args (decl1
);
13334 /* Sometimes we don't notice that a function is a static member, and
13335 build a METHOD_TYPE for it. Fix that up now. */
13336 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13337 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13339 revert_static_member_fn (decl1
);
13340 last_function_parms
= TREE_CHAIN (last_function_parms
);
13344 /* Warn if function was previously implicitly declared
13345 (but not if we warned then). */
13346 if (! warn_implicit
13347 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13348 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13350 /* Set up current_class_type, and enter the scope of the class, if
13353 push_nested_class (ctype
, 1);
13354 else if (DECL_STATIC_FUNCTION_P (decl1
))
13355 push_nested_class (DECL_CONTEXT (decl1
), 2);
13357 /* Now that we have entered the scope of the class, we must restore
13358 the bindings for any template parameters surrounding DECL1, if it
13359 is an inline member template. (Order is important; consider the
13360 case where a template parameter has the same name as a field of
13361 the class.) It is not until after this point that
13362 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13363 if (flags
& SF_INCLASS_INLINE
)
13364 maybe_begin_member_template_processing (decl1
);
13366 /* Effective C++ rule 15. */
13368 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13369 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13370 cp_warning ("`operator=' should return a reference to `*this'");
13372 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13373 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13374 if (!DECL_INITIAL (decl1
))
13375 DECL_INITIAL (decl1
) = error_mark_node
;
13377 /* This function exists in static storage.
13378 (This does not mean `static' in the C sense!) */
13379 TREE_STATIC (decl1
) = 1;
13381 /* We must call push_template_decl after current_class_type is set
13382 up. (If we are processing inline definitions after exiting a
13383 class scope, current_class_type will be NULL_TREE until set above
13384 by push_nested_class.) */
13385 if (processing_template_decl
)
13386 decl1
= push_template_decl (decl1
);
13388 /* We are now in the scope of the function being defined. */
13389 current_function_decl
= decl1
;
13391 /* Save the parm names or decls from this function's declarator
13392 where store_parm_decls will find them. */
13393 current_function_parms
= last_function_parms
;
13395 /* Make sure the parameter and return types are reasonable. When
13396 you declare a function, these types can be incomplete, but they
13397 must be complete when you define the function. */
13398 if (! processing_template_decl
)
13399 check_function_type (decl1
, current_function_parms
);
13401 /* Build the return declaration for the function. */
13402 restype
= TREE_TYPE (fntype
);
13403 if (!processing_template_decl
)
13405 if (!DECL_RESULT (decl1
))
13407 DECL_RESULT (decl1
)
13408 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13409 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13410 DECL_RESULT (decl1
));
13414 /* Just use `void'. Nobody will ever look at this anyhow. */
13415 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13417 /* Initialize RTL machinery. We cannot do this until
13418 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13419 even when processing a template; this is how we get
13420 CFUN set up, and our per-function variables initialized.
13421 FIXME factor out the non-RTL stuff. */
13422 bl
= current_binding_level
;
13423 init_function_start (decl1
, input_filename
, lineno
);
13424 current_binding_level
= bl
;
13426 /* Even though we're inside a function body, we still don't want to
13427 call expand_expr to calculate the size of a variable-sized array.
13428 We haven't necessarily assigned RTL to all variables yet, so it's
13429 not safe to try to expand expressions involving them. */
13430 immediate_size_expand
= 0;
13431 cfun
->x_dont_save_pending_sizes_p
= 1;
13433 /* Start the statement-tree, start the tree now. */
13434 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13436 /* Let the user know we're compiling this function. */
13437 announce_function (decl1
);
13439 /* Record the decl so that the function name is defined.
13440 If we already have a decl for this name, and it is a FUNCTION_DECL,
13441 use the old decl. */
13442 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13444 /* A specialization is not used to guide overload resolution. */
13445 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13446 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13447 decl1
= pushdecl (decl1
);
13450 /* We need to set the DECL_CONTEXT. */
13451 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13452 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13453 /* And make sure we have enough default args. */
13454 check_default_args (decl1
);
13456 fntype
= TREE_TYPE (decl1
);
13459 /* Reset these in case the call to pushdecl changed them. */
13460 current_function_decl
= decl1
;
13461 cfun
->decl
= decl1
;
13463 /* If we are (erroneously) defining a function that we have already
13464 defined before, wipe out what we knew before. */
13465 if (!DECL_PENDING_INLINE_P (decl1
)
13466 && DECL_SAVED_FUNCTION_DATA (decl1
))
13468 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13469 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13472 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13474 /* We know that this was set up by `grokclassfn'. We do not
13475 wait until `store_parm_decls', since evil parse errors may
13476 never get us to that point. Here we keep the consistency
13477 between `current_class_type' and `current_class_ptr'. */
13478 tree t
= DECL_ARGUMENTS (decl1
);
13480 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13482 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13485 cp_function_chain
->x_current_class_ref
13486 = build_indirect_ref (t
, NULL
);
13487 cp_function_chain
->x_current_class_ptr
= t
;
13489 /* Constructors and destructors need to know whether they're "in
13490 charge" of initializing virtual base classes. */
13491 t
= TREE_CHAIN (t
);
13492 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13494 current_in_charge_parm
= t
;
13495 t
= TREE_CHAIN (t
);
13497 if (DECL_HAS_VTT_PARM_P (decl1
))
13499 if (DECL_NAME (t
) != vtt_parm_identifier
)
13501 current_vtt_parm
= t
;
13505 if (DECL_INTERFACE_KNOWN (decl1
))
13507 tree ctx
= decl_function_context (decl1
);
13509 if (DECL_NOT_REALLY_EXTERN (decl1
))
13510 DECL_EXTERNAL (decl1
) = 0;
13512 if (ctx
!= NULL_TREE
&& DECL_DECLARED_INLINE_P (ctx
)
13513 && TREE_PUBLIC (ctx
))
13514 /* This is a function in a local class in an extern inline
13516 comdat_linkage (decl1
);
13518 /* If this function belongs to an interface, it is public.
13519 If it belongs to someone else's interface, it is also external.
13520 This only affects inlines and template instantiations. */
13521 else if (interface_unknown
== 0
13522 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13523 || flag_alt_external_templates
))
13525 if (DECL_DECLARED_INLINE_P (decl1
)
13526 || DECL_TEMPLATE_INSTANTIATION (decl1
)
13527 || processing_template_decl
)
13529 DECL_EXTERNAL (decl1
)
13531 || (DECL_DECLARED_INLINE_P (decl1
)
13532 && ! flag_implement_inlines
13533 && !DECL_VINDEX (decl1
)));
13535 /* For WIN32 we also want to put these in linkonce sections. */
13536 maybe_make_one_only (decl1
);
13539 DECL_EXTERNAL (decl1
) = 0;
13540 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13541 DECL_INTERFACE_KNOWN (decl1
) = 1;
13543 else if (interface_unknown
&& interface_only
13544 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13545 || flag_alt_external_templates
))
13547 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13548 interface, we will have interface_only set but not
13549 interface_known. In that case, we don't want to use the normal
13550 heuristics because someone will supply a #pragma implementation
13551 elsewhere, and deducing it here would produce a conflict. */
13552 comdat_linkage (decl1
);
13553 DECL_EXTERNAL (decl1
) = 0;
13554 DECL_INTERFACE_KNOWN (decl1
) = 1;
13555 DECL_DEFER_OUTPUT (decl1
) = 1;
13559 /* This is a definition, not a reference.
13560 So clear DECL_EXTERNAL. */
13561 DECL_EXTERNAL (decl1
) = 0;
13563 if ((DECL_DECLARED_INLINE_P (decl1
)
13564 || DECL_TEMPLATE_INSTANTIATION (decl1
))
13565 && ! DECL_INTERFACE_KNOWN (decl1
)
13566 /* Don't try to defer nested functions for now. */
13567 && ! decl_function_context (decl1
))
13568 DECL_DEFER_OUTPUT (decl1
) = 1;
13570 DECL_INTERFACE_KNOWN (decl1
) = 1;
13574 current_binding_level
->parm_flag
= 1;
13576 cplus_decl_attributes (&decl1
, attrs
, 0);
13578 /* Promote the value to int before returning it. */
13579 if (c_promoting_integer_type_p (restype
))
13580 restype
= type_promotes_to (restype
);
13582 if (DECL_RESULT (decl1
) == NULL_TREE
)
13584 DECL_RESULT (decl1
)
13585 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13586 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13587 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13592 if (DECL_DESTRUCTOR_P (decl1
))
13594 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13595 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13598 start_fname_decls ();
13600 store_parm_decls (current_function_parms
);
13605 /* Store the parameter declarations into the current function declaration.
13606 This is called after parsing the parameter declarations, before
13607 digesting the body of the function.
13609 Also install to binding contour return value identifier, if any. */
13612 store_parm_decls (current_function_parms
)
13613 tree current_function_parms
;
13615 register tree fndecl
= current_function_decl
;
13616 register tree parm
;
13617 int parms_have_cleanups
= 0;
13618 tree cleanups
= NULL_TREE
;
13620 /* This is a chain of any other decls that came in among the parm
13621 declarations. If a parm is declared with enum {foo, bar} x;
13622 then CONST_DECLs for foo and bar are put here. */
13623 tree nonparms
= NULL_TREE
;
13625 if (current_function_parms
)
13627 /* This case is when the function was defined with an ANSI prototype.
13628 The parms already have decls, so we need not do anything here
13629 except record them as in effect
13630 and complain if any redundant old-style parm decls were written. */
13632 tree specparms
= current_function_parms
;
13635 /* Must clear this because it might contain TYPE_DECLs declared
13637 storedecls (NULL_TREE
);
13639 /* If we're doing semantic analysis, then we'll call pushdecl
13640 for each of these. We must do them in reverse order so that
13641 they end in the correct forward order. */
13642 specparms
= nreverse (specparms
);
13644 for (parm
= specparms
; parm
; parm
= next
)
13646 next
= TREE_CHAIN (parm
);
13647 if (TREE_CODE (parm
) == PARM_DECL
)
13651 if (DECL_NAME (parm
) == NULL_TREE
13652 || TREE_CODE (parm
) != VOID_TYPE
)
13655 cp_error ("parameter `%D' declared void", parm
);
13657 cleanup
= (processing_template_decl
13659 : maybe_build_cleanup (parm
));
13662 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13666 /* If we find an enum constant or a type tag,
13667 put it aside for the moment. */
13668 TREE_CHAIN (parm
) = NULL_TREE
;
13669 nonparms
= chainon (nonparms
, parm
);
13673 /* Get the decls in their original chain order and record in the
13674 function. This is all and only the PARM_DECLs that were
13675 pushed into scope by the loop above. */
13676 DECL_ARGUMENTS (fndecl
) = getdecls ();
13677 storetags (gettags ());
13680 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13682 /* Now store the final chain of decls for the arguments
13683 as the decl-chain of the current lexical scope.
13684 Put the enumerators in as well, at the front so that
13685 DECL_ARGUMENTS is not modified. */
13686 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13688 /* Now that we have initialized the parms, we can start their
13689 cleanups. We cannot do this before, since expand_decl_cleanup
13690 should not be called before the parm can be used. */
13693 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13694 TREE_VALUE (cleanups
));
13695 cleanups
= TREE_CHAIN (cleanups
);
13698 /* Create a binding contour which can be used to catch
13699 cleanup-generated temporaries. */
13700 if (parms_have_cleanups
)
13703 /* Do the starting of the exception specifications, if we have any. */
13704 if (flag_exceptions
&& !processing_template_decl
13705 && flag_enforce_eh_specs
13706 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13707 current_eh_spec_block
= begin_eh_spec_block ();
13711 /* We have finished doing semantic analysis on DECL, but have not yet
13712 generated RTL for its body. Save away our current state, so that
13713 when we want to generate RTL later we know what to do. */
13716 save_function_data (decl
)
13719 struct cp_language_function
*f
;
13721 /* Save the language-specific per-function data so that we can
13722 get it back when we really expand this function. */
13723 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13727 f
= ((struct cp_language_function
*)
13728 xmalloc (sizeof (struct cp_language_function
)));
13729 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13730 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13732 /* Clear out the bits we don't need. */
13733 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13734 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13735 f
->x_named_label_uses
= NULL
;
13736 f
->bindings
= NULL
;
13737 f
->x_local_names
= NULL
;
13739 /* When we get back here again, we will be expanding. */
13740 f
->x_expanding_p
= 1;
13742 /* If we've already decided that we cannot inline this function, we
13743 must remember that fact when we actually go to expand the
13745 if (current_function_cannot_inline
)
13747 f
->cannot_inline
= current_function_cannot_inline
;
13748 DECL_INLINE (decl
) = 0;
13752 /* At the end of every constructor we generate to code to return
13753 `this'. Do that now. */
13756 finish_constructor_body ()
13758 /* Any return from a constructor will end up here. */
13760 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13762 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13763 generate the return, rather than a goto to CTOR_LABEL. */
13764 ctor_label
= NULL_TREE
;
13765 /* In check_return_expr we translate an empty return from a
13766 constructor to a return of `this'. */
13767 finish_return_stmt (NULL_TREE
);
13768 /* Mark the end of the constructor. */
13769 add_stmt (build_stmt (CTOR_STMT
));
13772 /* At the end of every destructor we generate code to restore virtual
13773 function tables to the values desired by base classes and to call
13774 to base class destructors. Do that now. */
13777 finish_destructor_body ()
13779 tree compound_stmt
;
13782 /* Create a block to contain all the extra code. */
13783 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13785 /* Any return from a destructor will end up here. */
13786 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13788 /* Generate the code to call destructor on base class. If this
13789 destructor belongs to a class with virtual functions, then set
13790 the virtual function table pointer to represent the type of our
13793 /* This side-effect makes call to `build_delete' generate the code
13794 we have to have at the end of this destructor. `build_delete'
13795 will set the flag again. */
13796 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13798 exprstmt
= build_delete (current_class_type
,
13800 sfk_base_destructor
,
13801 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13804 if (exprstmt
!= error_mark_node
13805 && (TREE_CODE (exprstmt
) != NOP_EXPR
13806 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13807 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13809 if (exprstmt
!= void_zero_node
)
13810 /* Don't call `expand_expr_stmt' if we're not going to do
13811 anything, since -Wall will give a diagnostic. */
13812 finish_expr_stmt (exprstmt
);
13814 /* Run destructors for all virtual baseclasses. */
13815 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13820 if_stmt
= begin_if_stmt ();
13821 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13822 current_in_charge_parm
,
13826 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
13827 /* The CLASSTYPE_VBASECLASSES list is in initialization
13828 order, so we have to march through it in reverse order. */
13829 for (vbases
= nreverse (copy_list (vbases
));
13831 vbases
= TREE_CHAIN (vbases
))
13833 tree vbase
= TREE_VALUE (vbases
);
13834 tree base_type
= BINFO_TYPE (vbase
);
13836 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type
))
13838 tree base_ptr_type
= build_pointer_type (base_type
);
13839 tree expr
= current_class_ptr
;
13841 /* Convert to the basetype here, as we know the layout is
13842 fixed. What is more, if we let build_method_call do it,
13843 it will use the vtable, which may have been clobbered
13844 by the deletion of our primary base. */
13846 expr
= build1 (NOP_EXPR
, base_ptr_type
, expr
);
13847 expr
= build (PLUS_EXPR
, base_ptr_type
, expr
,
13848 BINFO_OFFSET (vbase
));
13849 expr
= build_indirect_ref (expr
, NULL
);
13850 expr
= build_method_call (expr
, base_dtor_identifier
,
13853 finish_expr_stmt (expr
);
13857 finish_then_clause (if_stmt
);
13862 /* In a virtual destructor, we must call delete. */
13863 if (DECL_VIRTUAL_P (current_function_decl
))
13866 tree virtual_size
= c_sizeof (current_class_type
);
13870 At the point of definition of a virtual destructor (including
13871 an implicit definition), non-placement operator delete shall
13872 be looked up in the scope of the destructor's class and if
13873 found shall be accessible and unambiguous. */
13874 exprstmt
= build_op_delete_call
13875 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13876 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13878 if_stmt
= begin_if_stmt ();
13879 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13880 current_in_charge_parm
,
13883 finish_expr_stmt (exprstmt
);
13884 finish_then_clause (if_stmt
);
13888 /* Close the block we started above. */
13889 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13892 /* Finish up a function declaration and compile that function
13893 all the way to assembler language output. The free the storage
13894 for the function definition.
13896 FLAGS is a bitwise or of the following values:
13898 An extra call to poplevel (and expand_end_bindings) must be
13899 made to take care of the binding contour for the base
13900 initializers. This is only relevant for constructors.
13902 We just finished processing the body of an in-class inline
13903 function definition. (This processing will have taken place
13904 after the class definition is complete.) */
13907 finish_function (flags
)
13910 register tree fndecl
= current_function_decl
;
13911 tree fntype
, ctype
= NULL_TREE
;
13912 int call_poplevel
= (flags
& 1) != 0;
13913 int inclass_inline
= (flags
& 2) != 0;
13916 /* When we get some parse errors, we can end up without a
13917 current_function_decl, so cope. */
13918 if (fndecl
== NULL_TREE
)
13919 return error_mark_node
;
13921 nested
= function_depth
> 1;
13922 fntype
= TREE_TYPE (fndecl
);
13924 /* TREE_READONLY (fndecl) = 1;
13925 This caused &foo to be of type ptr-to-const-function
13926 which then got a warning when stored in a ptr-to-function variable. */
13928 my_friendly_assert (building_stmt_tree (), 20000911);
13930 finish_fname_decls ();
13932 /* For a cloned function, we've already got all the code we need;
13933 there's no need to add any extra bits. */
13934 if (!DECL_CLONED_FUNCTION_P (fndecl
))
13936 if (DECL_CONSTRUCTOR_P (fndecl
))
13938 finish_constructor_body ();
13942 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13943 finish_destructor_body ();
13944 else if (DECL_MAIN_P (fndecl
))
13946 /* Make it so that `main' always returns 0 by default. */
13948 finish_return_stmt (integer_one_node
);
13950 finish_return_stmt (integer_zero_node
);
13954 /* Finish dealing with exception specifiers. */
13955 if (flag_exceptions
&& !processing_template_decl
13956 && flag_enforce_eh_specs
13957 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13958 finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS
13959 (TREE_TYPE (current_function_decl
)),
13960 current_eh_spec_block
);
13963 /* If we're saving up tree structure, tie off the function now. */
13964 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13966 /* This must come after expand_function_end because cleanups might
13967 have declarations (from inline functions) that need to go into
13968 this function's blocks. */
13969 if (current_binding_level
->parm_flag
!= 1)
13970 my_friendly_abort (122);
13971 poplevel (1, 0, 1);
13973 /* Set up the named return value optimization, if we can. Here, we
13974 eliminate the copy from the nrv into the RESULT_DECL and any cleanup
13975 for the nrv. genrtl_start_function and declare_return_variable
13976 handle making the nrv and RESULT_DECL share space. */
13977 if (current_function_return_value
)
13979 tree r
= current_function_return_value
;
13980 /* This is only worth doing for fns that return in memory--and
13981 simpler, since we don't have to worry about promoted modes. */
13982 if (r
!= error_mark_node
13983 && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl
))))
13985 DECL_ALIGN (r
) = DECL_ALIGN (DECL_RESULT (fndecl
));
13986 walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl
),
13987 nullify_returns_r
, r
);
13990 /* Clear it so genrtl_start_function and declare_return_variable
13991 know we're not optimizing. */
13992 current_function_return_value
= NULL_TREE
;
13995 /* Remember that we were in class scope. */
13996 if (current_class_name
)
13997 ctype
= current_class_type
;
13999 /* Must mark the RESULT_DECL as being in this function. */
14000 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14002 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14003 to the FUNCTION_DECL node itself. */
14004 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14006 /* Save away current state, if appropriate. */
14007 if (!processing_template_decl
)
14008 save_function_data (fndecl
);
14010 /* If this function calls `setjmp' it cannot be inlined. When
14011 `longjmp' is called it is not guaranteed to restore the value of
14012 local variables that have been modified since the call to
14013 `setjmp'. So, if were to inline this function into some caller
14014 `c', then when we `longjmp', we might not restore all variables
14015 in `c'. (It might seem, at first blush, that there's no way for
14016 this function to modify local variables in `c', but their
14017 addresses may have been stored somewhere accessible to this
14019 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14020 DECL_UNINLINABLE (fndecl
) = 1;
14022 /* Clear out memory we no longer need. */
14023 free_after_parsing (cfun
);
14024 /* Since we never call rest_of_compilation, we never clear
14025 CFUN. Do so explicitly. */
14026 free_after_compilation (cfun
);
14029 /* If this is a in-class inline definition, we may have to pop the
14030 bindings for the template parameters that we added in
14031 maybe_begin_member_template_processing when start_function was
14033 if (inclass_inline
)
14034 maybe_end_member_template_processing ();
14036 /* Leave the scope of the class. */
14038 pop_nested_class ();
14044 /* Let the error reporting routines know that we're outside a
14045 function. For a nested function, this value is used in
14046 pop_cp_function_context and then reset via pop_function_context. */
14047 current_function_decl
= NULL_TREE
;
14052 /* Create the FUNCTION_DECL for a function definition.
14053 DECLSPECS and DECLARATOR are the parts of the declaration;
14054 they describe the return type and the name of the function,
14055 but twisted together in a fashion that parallels the syntax of C.
14057 This function creates a binding context for the function body
14058 as well as setting up the FUNCTION_DECL in current_function_decl.
14060 Returns a FUNCTION_DECL on success.
14062 If the DECLARATOR is not suitable for a function (it defines a datum
14063 instead), we return 0, which tells yyparse to report a parse error.
14065 May return void_type_node indicating that this method is actually
14066 a friend. See grokfield for more details.
14068 Came here with a `.pushlevel' .
14070 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14071 CHANGES TO CODE IN `grokfield'. */
14074 start_method (declspecs
, declarator
, attrlist
)
14075 tree declarator
, declspecs
, attrlist
;
14077 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14080 /* Something too ugly to handle. */
14081 if (fndecl
== NULL_TREE
)
14084 /* Pass friends other than inline friend functions back. */
14085 if (fndecl
== void_type_node
)
14088 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14089 /* Not a function, tell parser to report parse error. */
14092 if (DECL_IN_AGGR_P (fndecl
))
14094 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14096 if (DECL_CONTEXT (fndecl
)
14097 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14098 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14099 DECL_CONTEXT (fndecl
));
14101 return void_type_node
;
14104 check_template_shadow (fndecl
);
14106 DECL_DECLARED_INLINE_P (fndecl
) = 1;
14108 if (flag_default_inline
)
14109 DECL_INLINE (fndecl
) = 1;
14111 /* We process method specializations in finish_struct_1. */
14112 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14113 fndecl
= push_template_decl (fndecl
);
14115 if (! DECL_FRIEND_P (fndecl
))
14117 if (TREE_CHAIN (fndecl
))
14119 fndecl
= copy_node (fndecl
);
14120 TREE_CHAIN (fndecl
) = NULL_TREE
;
14123 if (DECL_CONSTRUCTOR_P (fndecl
))
14125 if (! grok_ctor_properties (current_class_type
, fndecl
))
14126 return void_type_node
;
14128 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14129 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14132 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14134 /* Make a place for the parms */
14136 current_binding_level
->parm_flag
= 1;
14138 DECL_IN_AGGR_P (fndecl
) = 1;
14142 /* Go through the motions of finishing a function definition.
14143 We don't compile this method until after the whole class has
14146 FINISH_METHOD must return something that looks as though it
14147 came from GROKFIELD (since we are defining a method, after all).
14149 This is called after parsing the body of the function definition.
14150 STMTS is the chain of statements that makes up the function body.
14152 DECL is the ..._DECL that `start_method' provided. */
14155 finish_method (decl
)
14158 register tree fndecl
= decl
;
14161 register tree link
;
14163 if (decl
== void_type_node
)
14166 old_initial
= DECL_INITIAL (fndecl
);
14168 /* Undo the level for the parms (from start_method).
14169 This is like poplevel, but it causes nothing to be
14170 saved. Saving information here confuses symbol-table
14171 output routines. Besides, this information will
14172 be correctly output when this method is actually
14175 /* Clear out the meanings of the local variables of this level;
14176 also record in each decl which block it belongs to. */
14178 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14180 if (DECL_NAME (link
) != NULL_TREE
)
14181 pop_binding (DECL_NAME (link
), link
);
14182 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14183 DECL_CONTEXT (link
) = NULL_TREE
;
14186 GNU_xref_end_scope ((size_t) current_binding_level
,
14187 (size_t) current_binding_level
->level_chain
,
14188 current_binding_level
->parm_flag
,
14189 current_binding_level
->keep
);
14191 poplevel (0, 0, 0);
14193 DECL_INITIAL (fndecl
) = old_initial
;
14195 /* We used to check if the context of FNDECL was different from
14196 current_class_type as another way to get inside here. This didn't work
14197 for String.cc in libg++. */
14198 if (DECL_FRIEND_P (fndecl
))
14200 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14201 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14202 decl
= void_type_node
;
14208 /* Called when a new struct TYPE is defined.
14209 If this structure or union completes the type of any previous
14210 variable declaration, lay it out and output its rtl. */
14213 hack_incomplete_structures (type
)
14217 struct binding_level
*level
;
14219 if (!type
) /* Don't do this for class templates. */
14222 if (namespace_bindings_p ())
14225 list
= &namespace_scope_incomplete
;
14229 level
= innermost_nonclass_level ();
14230 list
= &level
->incomplete
;
14237 tree decl
= TREE_VALUE (*list
);
14238 if ((decl
&& TREE_TYPE (decl
) == type
)
14239 || (TREE_TYPE (decl
)
14240 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14241 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14243 int toplevel
= toplevel_bindings_p ();
14244 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14245 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14246 layout_type (TREE_TYPE (decl
));
14247 layout_decl (decl
, 0);
14248 rest_of_decl_compilation (decl
, NULL
, toplevel
, 0);
14252 expand_decl (decl
);
14253 cleanup
= maybe_build_cleanup (decl
);
14254 expand_decl_init (decl
);
14255 if (! expand_decl_cleanup (decl
, cleanup
))
14256 cp_error ("parser lost in parsing declaration of `%D'",
14259 *list
= TREE_CHAIN (*list
);
14262 list
= &TREE_CHAIN (*list
);
14265 /* Keep looking through artificial binding levels generated
14266 for local variables. */
14267 if (level
&& level
->keep
== 2)
14269 level
= level
->level_chain
;
14270 list
= &level
->incomplete
;
14277 /* If DECL is of a type which needs a cleanup, build that cleanup
14281 maybe_build_cleanup (decl
)
14284 tree type
= TREE_TYPE (decl
);
14286 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14288 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14291 if (TREE_CODE (type
) == ARRAY_TYPE
)
14295 mark_addressable (decl
);
14296 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14299 /* Optimize for space over speed here. */
14300 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14301 || flag_expensive_optimizations
)
14302 flags
|= LOOKUP_NONVIRTUAL
;
14304 rval
= build_delete (TREE_TYPE (rval
), rval
,
14305 sfk_complete_destructor
, flags
, 0);
14307 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14308 && ! TYPE_HAS_DESTRUCTOR (type
))
14309 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14310 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14317 /* When a stmt has been parsed, this function is called. */
14322 /* Always assume this statement was not an expression statement. If
14323 it actually was an expression statement, its our callers
14324 responsibility to fix this up. */
14325 last_expr_type
= NULL_TREE
;
14328 /* DECL was originally constructed as a non-static member function,
14329 but turned out to be static. Update it accordingly. */
14332 revert_static_member_fn (decl
)
14336 tree function
= TREE_TYPE (decl
);
14337 tree args
= TYPE_ARG_TYPES (function
);
14339 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14340 != TYPE_UNQUALIFIED
)
14341 cp_error ("static member function `%#D' declared with type qualifiers",
14344 args
= TREE_CHAIN (args
);
14345 tmp
= build_function_type (TREE_TYPE (function
), args
);
14346 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14347 tmp
= build_exception_variant (tmp
,
14348 TYPE_RAISES_EXCEPTIONS (function
));
14349 TREE_TYPE (decl
) = tmp
;
14350 if (DECL_ARGUMENTS (decl
))
14351 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14352 DECL_STATIC_FUNCTION_P (decl
) = 1;
14355 /* Initialize the variables used during compilation of a C++
14359 push_cp_function_context (f
)
14360 struct function
*f
;
14362 struct cp_language_function
*p
14363 = ((struct cp_language_function
*)
14364 xcalloc (1, sizeof (struct cp_language_function
)));
14365 f
->language
= (struct language_function
*) p
;
14367 /* It takes an explicit call to expand_body to generate RTL for a
14371 /* Whenever we start a new function, we destroy temporaries in the
14373 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14376 /* Free the language-specific parts of F, now that we've finished
14377 compiling the function. */
14380 pop_cp_function_context (f
)
14381 struct function
*f
;
14385 struct cp_language_function
*cp
=
14386 (struct cp_language_function
*) f
->language
;
14387 if (cp
->x_local_names
)
14388 VARRAY_FREE (cp
->x_local_names
);
14389 free (f
->language
);
14394 /* Mark P for GC. */
14397 mark_lang_function (p
)
14398 struct cp_language_function
*p
;
14403 mark_c_language_function (&p
->base
);
14405 ggc_mark_tree (p
->x_ctor_label
);
14406 ggc_mark_tree (p
->x_dtor_label
);
14407 ggc_mark_tree (p
->x_current_class_ptr
);
14408 ggc_mark_tree (p
->x_current_class_ref
);
14409 ggc_mark_tree (p
->x_eh_spec_block
);
14410 ggc_mark_tree_varray (p
->x_local_names
);
14412 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14413 mark_binding_level (&p
->bindings
);
14416 /* Mark the language-specific data in F for GC. */
14419 mark_cp_function_context (f
)
14420 struct function
*f
;
14422 mark_lang_function ((struct cp_language_function
*) f
->language
);
14429 enum tree_code code
= TREE_CODE (t
);
14430 if (code
== IDENTIFIER_NODE
)
14432 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14433 struct lang_id2
*li2
= li
->x
;
14434 ggc_mark_tree (li
->namespace_bindings
);
14435 ggc_mark_tree (li
->bindings
);
14436 ggc_mark_tree (li
->class_value
);
14437 ggc_mark_tree (li
->class_template_info
);
14441 ggc_mark_tree (li2
->label_value
);
14442 ggc_mark_tree (li2
->implicit_decl
);
14443 ggc_mark_tree (li2
->error_locus
);
14446 else if (code
== CPLUS_BINDING
)
14448 if (BINDING_HAS_LEVEL_P (t
))
14449 mark_binding_level (&BINDING_LEVEL (t
));
14451 ggc_mark_tree (BINDING_SCOPE (t
));
14452 ggc_mark_tree (BINDING_VALUE (t
));
14454 else if (code
== OVERLOAD
)
14455 ggc_mark_tree (OVL_FUNCTION (t
));
14456 else if (code
== TEMPLATE_PARM_INDEX
)
14457 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14458 else if (TREE_CODE_CLASS (code
) == 'd')
14460 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14465 c_mark_lang_decl (&ld
->decl_flags
.base
);
14466 if (!DECL_GLOBAL_CTOR_P (t
)
14467 && !DECL_GLOBAL_DTOR_P (t
)
14468 && !DECL_THUNK_P (t
)
14469 && !DECL_DISCRIMINATOR_P (t
))
14470 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14471 else if (DECL_THUNK_P (t
))
14472 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14473 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14474 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14476 mark_binding_level (&NAMESPACE_LEVEL (t
));
14477 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14479 ggc_mark_tree (ld
->befriending_classes
);
14480 ggc_mark_tree (ld
->context
);
14481 ggc_mark_tree (ld
->cloned_function
);
14482 ggc_mark_tree (ld
->inlined_fns
);
14483 if (TREE_CODE (t
) == TYPE_DECL
)
14484 ggc_mark_tree (ld
->u
.sorted_fields
);
14485 else if (TREE_CODE (t
) == FUNCTION_DECL
14486 && !DECL_PENDING_INLINE_P (t
))
14487 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14491 else if (TREE_CODE_CLASS (code
) == 't')
14493 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14495 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14496 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14499 ggc_mark_tree (lt
->primary_base
);
14500 ggc_mark_tree (lt
->vfields
);
14501 ggc_mark_tree (lt
->vbases
);
14502 ggc_mark_tree (lt
->tags
);
14503 ggc_mark_tree (lt
->size
);
14504 ggc_mark_tree (lt
->pure_virtuals
);
14505 ggc_mark_tree (lt
->friend_classes
);
14506 ggc_mark_tree (lt
->rtti
);
14507 ggc_mark_tree (lt
->methods
);
14508 ggc_mark_tree (lt
->template_info
);
14509 ggc_mark_tree (lt
->befriending_classes
);
14512 /* In the case of pointer-to-member function types, the
14513 TYPE_LANG_SPECIFIC is really just a tree. */
14514 ggc_mark_tree ((tree
) lt
);
14518 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14519 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14522 identifier_global_value (t
)
14525 return IDENTIFIER_GLOBAL_VALUE (t
);
14528 /* Build the void_list_node (void_type_node having been created). */
14530 build_void_list_node ()
14532 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
14533 TREE_PARMLIST (t
) = 1;
14538 cp_missing_noreturn_ok_p (decl
)
14541 /* A missing noreturn is ok for the `main' function. */
14542 return DECL_MAIN_P (decl
);