1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
48 extern int current_class_depth
;
50 extern tree global_namespace
;
52 extern int (*valid_lang_attribute
) PARAMS ((tree
, tree
, tree
, tree
));
54 #ifndef BOOL_TYPE_SIZE
55 #ifdef SLOW_BYTE_ACCESS
56 /* In the new ABI, `bool' has size and alignment `1', on all
58 #define BOOL_TYPE_SIZE \
59 ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
61 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
65 /* We let tm.h override the types used here, to handle trivial differences
66 such as the choice of unsigned int or long unsigned int for size_t.
67 When machines start needing nontrivial differences in the size type,
68 it would be best to do something here to figure out automatically
69 from other information what type to use. */
72 #define SIZE_TYPE "long unsigned int"
76 #define PTRDIFF_TYPE "long int"
80 #define WCHAR_TYPE "int"
83 static tree grokparms
PARAMS ((tree
));
84 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
86 static void push_binding_level
PARAMS ((struct binding_level
*, int,
88 static void pop_binding_level
PARAMS ((void));
89 static void suspend_binding_level
PARAMS ((void));
90 static void resume_binding_level
PARAMS ((struct binding_level
*));
91 static struct binding_level
*make_binding_level
PARAMS ((void));
92 static void declare_namespace_level
PARAMS ((void));
93 static int decl_jump_unsafe
PARAMS ((tree
));
94 static void storedecls
PARAMS ((tree
));
95 static void require_complete_types_for_parms
PARAMS ((tree
));
96 static int ambi_op_p
PARAMS ((enum tree_code
));
97 static int unary_op_p
PARAMS ((enum tree_code
));
98 static tree store_bindings
PARAMS ((tree
, tree
));
99 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
100 static tree obscure_complex_init
PARAMS ((tree
, tree
));
101 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
102 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
103 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
104 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
105 enum overload_flags
, tree
,
106 tree
, int, int, int, int, int, int, tree
));
107 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
108 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
109 struct binding_level
*, int));
110 static void set_identifier_type_value_with_scope
111 PARAMS ((tree
, tree
, struct binding_level
*));
112 static void record_builtin_type
PARAMS ((enum rid
, const char *, tree
));
113 static void record_unknown_type
PARAMS ((tree
, const char *));
114 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
115 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
116 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
118 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
119 static void check_for_uninitialized_const_var
PARAMS ((tree
));
120 static unsigned long typename_hash
PARAMS ((hash_table_key
));
121 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
122 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
123 static int add_binding
PARAMS ((tree
, tree
));
124 static void pop_binding
PARAMS ((tree
, tree
));
125 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
126 static tree find_binding
PARAMS ((tree
, tree
));
127 static tree select_decl
PARAMS ((tree
, int));
128 static int lookup_flags
PARAMS ((int, int));
129 static tree qualify_lookup
PARAMS ((tree
, int));
130 static tree record_builtin_java_type
PARAMS ((const char *, int));
131 static const char *tag_name
PARAMS ((enum tag_types code
));
132 static void find_class_binding_level
PARAMS ((void));
133 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
134 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
135 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
136 static int walk_globals_r
PARAMS ((tree
, void *));
137 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
138 static tree make_label_decl
PARAMS ((tree
, int));
139 static void use_label
PARAMS ((tree
));
140 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
142 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
143 static void check_switch_goto
PARAMS ((struct binding_level
*));
144 static void check_previous_gotos
PARAMS ((tree
));
145 static void pop_label
PARAMS ((tree
, tree
));
146 static void pop_labels
PARAMS ((tree
));
147 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
148 static void layout_var_decl
PARAMS ((tree
));
149 static void maybe_commonize_var
PARAMS ((tree
));
150 static tree check_initializer
PARAMS ((tree
, tree
));
151 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
152 static void push_cp_function_context
PARAMS ((struct function
*));
153 static void pop_cp_function_context
PARAMS ((struct function
*));
154 static void mark_binding_level
PARAMS ((void *));
155 static void mark_named_label_lists
PARAMS ((void *, void *));
156 static void mark_cp_function_context
PARAMS ((struct function
*));
157 static void mark_saved_scope
PARAMS ((void *));
158 static void mark_lang_function
PARAMS ((struct cp_language_function
*));
159 static void save_function_data
PARAMS ((tree
));
160 static void check_function_type
PARAMS ((tree
, tree
));
161 static void destroy_local_var
PARAMS ((tree
));
162 static void finish_constructor_body
PARAMS ((void));
163 static void finish_destructor_body
PARAMS ((void));
164 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
165 static tree get_atexit_node
PARAMS ((void));
166 static tree get_dso_handle_node
PARAMS ((void));
167 static tree start_cleanup_fn
PARAMS ((void));
168 static void end_cleanup_fn
PARAMS ((void));
169 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
170 static void initialize_predefined_identifiers
PARAMS ((void));
171 static tree check_special_function_return_type
172 PARAMS ((special_function_kind
, tree
, tree
, tree
));
173 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
174 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
175 static void store_parm_decls
PARAMS ((tree
));
177 #if defined (DEBUG_CP_BINDING_LEVELS)
178 static void indent
PARAMS ((void));
181 /* Erroneous argument lists can use this *IFF* they do not modify it. */
182 tree error_mark_list
;
184 /* The following symbols are subsumed in the cp_global_trees array, and
185 listed here individually for documentation purposes.
188 tree wchar_decl_node;
190 tree vtable_entry_type;
191 tree delta_type_node;
194 tree __baselist_desc_type_node;
195 tree __i_desc_type_node, __m_desc_type_node;
196 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
198 tree __t_desc_type_node;
200 tree __tp_desc_type_node;
202 tree ti_desc_type_node;
203 tree bltn_desc_type_node, ptr_desc_type_node;
204 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
205 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
206 tree ptm_desc_type_node;
207 tree base_desc_type_node;
209 Not needed yet? May be needed one day?
210 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
211 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
212 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
215 tree class_type_node, record_type_node, union_type_node, enum_type_node;
216 tree unknown_type_node;
218 Array type `vtable_entry_type[]'
221 tree vtbl_ptr_type_node;
228 A FUNCTION_DECL which can call `abort'. Not necessarily the
229 one that the user will declare, but sufficient to be called
230 by routines that want to abort the program.
234 The FUNCTION_DECL for the default `::operator delete'.
236 tree global_delete_fndecl;
239 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
244 tree cp_global_trees
[CPTI_MAX
];
246 /* Indicates that there is a type value in some namespace, although
247 that is not necessarily in scope at the moment. */
249 static tree global_type_node
;
251 /* If non-zero, this is the number of times we have entered the `std'
252 namespace when we are treating that namespace as an alias for the
254 static int in_fake_std
;
256 /* Expect only namespace names now. */
257 static int only_namespace_names
;
259 /* Used only for jumps to as-yet undefined labels, since jumps to
260 defined labels can have their validity checked immediately. */
262 struct named_label_use_list
264 struct binding_level
*binding_level
;
267 const char *filename_o_goto
;
269 struct named_label_use_list
*next
;
272 #define named_label_uses cp_function_chain->x_named_label_uses
274 /* A list of objects which have constructors or destructors
275 which reside in the global scope. The decl is stored in
276 the TREE_VALUE slot and the initializer is stored
277 in the TREE_PURPOSE slot. */
278 tree static_aggregates
;
282 /* A node for the integer constants 2, and 3. */
284 tree integer_two_node
, integer_three_node
;
286 /* Parsing a function declarator leaves here a chain of structure
287 and enum types declared in the parmlist. */
289 static tree last_function_parm_tags
;
291 /* Similar, for last_function_parm_tags. */
292 tree last_function_parms
;
293 static tree current_function_parm_tags
;
295 /* A list of all LABEL_DECLs in the function that have names. Here so
296 we can clear out their names' definitions at the end of the
297 function, and so we can check the validity of jumps to these labels. */
299 struct named_label_list
301 struct binding_level
*binding_level
;
307 struct named_label_list
*next
;
310 #define named_labels cp_function_chain->x_named_labels
312 /* Set to 0 at beginning of a function definition, and whenever
313 a label (case or named) is defined. Set to value of expression
314 returned from function when that value can be transformed into
315 a named return value. */
317 tree current_function_return_value
;
319 /* Nonzero means use the ISO C94 dialect of C. */
323 /* Nonzero means use the ISO C99 dialect of C. */
327 /* Nonzero means we are a hosted implementation for code shared with C. */
331 /* Nonzero means add default format_arg attributes for functions not
334 int flag_noniso_default_format_attributes
= 1;
336 /* Nonzero means give `double' the same size as `float'. */
338 extern int flag_short_double
;
340 /* Nonzero if we want to conserve space in the .o files. We do this
341 by putting uninitialized data and runtime initialized data into
342 .common instead of .data at the expense of not flagging multiple
344 extern int flag_conserve_space
;
346 /* C and C++ flags are in decl2.c. */
348 /* Flag used when debugging spew.c */
350 extern int spew_debug
;
352 /* A expression of value 0 with the same precision as a sizetype
354 tree signed_size_zero_node
;
356 /* The name of the anonymous namespace, throughout this translation
358 tree anonymous_namespace_name
;
360 /* The number of function bodies which we are currently processing.
361 (Zero if we are at namespace scope, one inside the body of a
362 function, two inside the body of a function in a local class, etc.) */
365 /* For each binding contour we allocate a binding_level structure
366 which records the names defined in that contour.
369 1) one for each function definition,
370 where internal declarations of the parameters appear.
371 2) one for each compound statement,
372 to record its declarations.
374 The current meaning of a name can be found by searching the levels
375 from the current one out to the global one.
377 Off to the side, may be the class_binding_level. This exists only
378 to catch class-local declarations. It is otherwise nonexistent.
380 Also there may be binding levels that catch cleanups that must be
381 run when exceptions occur. Thus, to see whether a name is bound in
382 the current scope, it is not enough to look in the
383 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
386 /* Note that the information in the `names' component of the global contour
387 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
391 /* A chain of _DECL nodes for all variables, constants, functions,
392 and typedef types. These are in the reverse of the order
393 supplied. There may be OVERLOADs on this list, too, but they
394 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
397 /* A list of structure, union and enum definitions, for looking up
399 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
400 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
401 or ENUMERAL_TYPE node.
403 C++: the TREE_VALUE nodes can be simple types for
404 component_bindings. */
407 /* A list of USING_DECL nodes. */
410 /* A list of used namespaces. PURPOSE is the namespace,
411 VALUE the common ancestor with this binding_level's namespace. */
412 tree using_directives
;
414 /* If this binding level is the binding level for a class, then
415 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
416 is the name of an entity bound in the class; the TREE_VALUE is
417 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
418 when leaving class scope, we can restore the
419 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
420 the DECL bound by this name in the class. */
423 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
424 is used for all binding levels. */
427 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
428 label in this scope. The TREE_PURPOSE is the previous value of
429 the IDENTIFIER_LABEL VALUE. */
430 tree shadowed_labels
;
432 /* For each level (except not the global one),
433 a chain of BLOCK nodes for all the levels
434 that were entered and exited one level down. */
437 /* The _TYPE node for this level, if parm_flag == 2. */
440 /* The binding level which this one is contained in (inherits from). */
441 struct binding_level
*level_chain
;
443 /* List of decls in `names' that have incomplete
444 structure or union types. */
447 /* List of VAR_DECLS saved from a previous for statement.
448 These would be dead in ISO-conforming code, but might
449 be referenced in ARM-era code. These are stored in a
450 TREE_LIST; the TREE_VALUE is the actual declaration. */
451 tree dead_vars_from_for
;
453 /* 1 for the level that holds the parameters of a function.
454 2 for the level that holds a class declaration. */
455 unsigned parm_flag
: 2;
457 /* 1 means make a BLOCK for this level regardless of all else.
458 2 for temporary binding contours created by the compiler. */
461 /* Nonzero if this level "doesn't exist" for tags. */
462 unsigned tag_transparent
: 1;
464 /* Nonzero if this level can safely have additional
465 cleanup-needing variables added to it. */
466 unsigned more_cleanups_ok
: 1;
467 unsigned have_cleanups
: 1;
469 /* Nonzero if this scope is for storing the decls for template
470 parameters and generic decls; these decls will be discarded and
471 replaced with a TEMPLATE_DECL. */
472 unsigned template_parms_p
: 1;
474 /* Nonzero if this scope corresponds to the `<>' in a
475 `template <>' clause. Whenever this flag is set,
476 TEMPLATE_PARMS_P will be set as well. */
477 unsigned template_spec_p
: 1;
479 /* This is set for a namespace binding level. */
480 unsigned namespace_p
: 1;
482 /* True if this level is that of a for-statement where we need to
483 worry about ambiguous (ARM or ISO) scope rules. */
484 unsigned is_for_scope
: 1;
486 /* True if this level corresponds to an EH region, as for a try block.
487 Currently this information is only available while building the
489 unsigned eh_region
: 1;
491 /* Four bits left for this word. */
493 #if defined(DEBUG_CP_BINDING_LEVELS)
494 /* Binding depth at which this level began. */
495 unsigned binding_depth
;
496 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
499 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
501 /* The binding level currently in effect. */
503 #define current_binding_level \
505 ? cp_function_chain->bindings \
506 : scope_chain->bindings)
508 /* The binding level of the current class, if any. */
510 #define class_binding_level scope_chain->class_bindings
512 /* A chain of binding_level structures awaiting reuse. */
514 static struct binding_level
*free_binding_level
;
516 /* The outermost binding level, for names of file scope.
517 This is created when the compiler is started and exists
518 through the entire run. */
520 static struct binding_level
*global_binding_level
;
522 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
524 static int keep_next_level_flag
;
526 #if defined(DEBUG_CP_BINDING_LEVELS)
527 static int binding_depth
= 0;
528 static int is_class_level
= 0;
535 for (i
= 0; i
< binding_depth
*2; i
++)
538 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
540 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
543 push_binding_level (newlevel
, tag_transparent
, keep
)
544 struct binding_level
*newlevel
;
545 int tag_transparent
, keep
;
547 /* Add this level to the front of the chain (stack) of levels that
549 memset ((char*) newlevel
, 0, sizeof (struct binding_level
));
550 newlevel
->level_chain
= current_binding_level
;
551 current_binding_level
= newlevel
;
552 newlevel
->tag_transparent
= tag_transparent
;
553 newlevel
->more_cleanups_ok
= 1;
555 newlevel
->keep
= keep
;
556 #if defined(DEBUG_CP_BINDING_LEVELS)
557 newlevel
->binding_depth
= binding_depth
;
559 fprintf (stderr
, "push %s level 0x%08x line %d\n",
560 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
563 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
566 /* Find the innermost enclosing class scope, and reset
567 CLASS_BINDING_LEVEL appropriately. */
570 find_class_binding_level ()
572 struct binding_level
*level
= current_binding_level
;
574 while (level
&& level
->parm_flag
!= 2)
575 level
= level
->level_chain
;
576 if (level
&& level
->parm_flag
== 2)
577 class_binding_level
= level
;
579 class_binding_level
= 0;
585 if (global_binding_level
)
587 /* Cannot pop a level, if there are none left to pop. */
588 if (current_binding_level
== global_binding_level
)
589 my_friendly_abort (123);
591 /* Pop the current level, and free the structure for reuse. */
592 #if defined(DEBUG_CP_BINDING_LEVELS)
595 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
596 (is_class_level
) ? "class" : "block",
597 current_binding_level
, lineno
);
598 if (is_class_level
!= (current_binding_level
== class_binding_level
))
601 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
604 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
606 register struct binding_level
*level
= current_binding_level
;
607 current_binding_level
= current_binding_level
->level_chain
;
608 level
->level_chain
= free_binding_level
;
609 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
610 if (level
->binding_depth
!= binding_depth
)
612 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
613 free_binding_level
= level
;
614 find_class_binding_level ();
619 suspend_binding_level ()
621 if (class_binding_level
)
622 current_binding_level
= class_binding_level
;
624 if (global_binding_level
)
626 /* Cannot suspend a level, if there are none left to suspend. */
627 if (current_binding_level
== global_binding_level
)
628 my_friendly_abort (123);
630 /* Suspend the current level. */
631 #if defined(DEBUG_CP_BINDING_LEVELS)
634 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
635 (is_class_level
) ? "class" : "block",
636 current_binding_level
, lineno
);
637 if (is_class_level
!= (current_binding_level
== class_binding_level
))
640 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
643 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
644 current_binding_level
= current_binding_level
->level_chain
;
645 find_class_binding_level ();
649 resume_binding_level (b
)
650 struct binding_level
*b
;
652 /* Resuming binding levels is meant only for namespaces,
653 and those cannot nest into classes. */
654 my_friendly_assert(!class_binding_level
, 386);
655 /* Also, resuming a non-directly nested namespace is a no-no. */
656 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
657 current_binding_level
= b
;
658 #if defined(DEBUG_CP_BINDING_LEVELS)
659 b
->binding_depth
= binding_depth
;
661 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
662 (is_class_level
) ? "class" : "block", b
, lineno
);
665 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
668 /* Create a new `struct binding_level'. */
671 struct binding_level
*
672 make_binding_level ()
675 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
678 /* Nonzero if we are currently in the global binding level. */
683 return current_binding_level
== global_binding_level
;
686 /* Return the innermost binding level that is not for a class scope. */
688 static struct binding_level
*
689 innermost_nonclass_level ()
691 struct binding_level
*b
;
693 b
= current_binding_level
;
694 while (b
->parm_flag
== 2)
700 /* Nonzero if we are currently in a toplevel binding level. This
701 means either the global binding level or a namespace in a toplevel
702 binding level. Since there are no non-toplevel namespace levels,
703 this really means any namespace or template parameter level. We
704 also include a class whose context is toplevel. */
707 toplevel_bindings_p ()
709 struct binding_level
*b
= innermost_nonclass_level ();
711 return b
->namespace_p
|| b
->template_parms_p
;
714 /* Nonzero if this is a namespace scope, or if we are defining a class
715 which is itself at namespace scope, or whose enclosing class is
716 such a class, etc. */
719 namespace_bindings_p ()
721 struct binding_level
*b
= innermost_nonclass_level ();
723 return b
->namespace_p
;
726 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
727 unconditionally. Otherwise, use the normal logic to decide whether
728 or not to create a BLOCK. */
731 keep_next_level (keep
)
734 keep_next_level_flag
= keep
;
737 /* Nonzero if the current level needs to have a BLOCK made. */
742 return (current_binding_level
->blocks
!= NULL_TREE
743 || current_binding_level
->keep
744 || current_binding_level
->names
!= NULL_TREE
745 || (current_binding_level
->tags
!= NULL_TREE
746 && !current_binding_level
->tag_transparent
));
750 declare_namespace_level ()
752 current_binding_level
->namespace_p
= 1;
755 /* Returns non-zero if this scope was created to store template
759 template_parm_scope_p ()
761 return current_binding_level
->template_parms_p
;
764 /* Returns the kind of template specialization we are currently
765 processing, given that it's declaration contained N_CLASS_SCOPES
766 explicit scope qualifications. */
769 current_tmpl_spec_kind (n_class_scopes
)
772 int n_template_parm_scopes
= 0;
773 int seen_specialization_p
= 0;
774 int innermost_specialization_p
= 0;
775 struct binding_level
*b
;
777 /* Scan through the template parameter scopes. */
778 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
780 /* If we see a specialization scope inside a parameter scope,
781 then something is wrong. That corresponds to a declaration
784 template <class T> template <> ...
786 which is always illegal since [temp.expl.spec] forbids the
787 specialization of a class member template if the enclosing
788 class templates are not explicitly specialized as well. */
789 if (b
->template_spec_p
)
791 if (n_template_parm_scopes
== 0)
792 innermost_specialization_p
= 1;
794 seen_specialization_p
= 1;
796 else if (seen_specialization_p
== 1)
797 return tsk_invalid_member_spec
;
799 ++n_template_parm_scopes
;
802 /* Handle explicit instantiations. */
803 if (processing_explicit_instantiation
)
805 if (n_template_parm_scopes
!= 0)
806 /* We've seen a template parameter list during an explicit
807 instantiation. For example:
809 template <class T> template void f(int);
811 This is erroneous. */
812 return tsk_invalid_expl_inst
;
814 return tsk_expl_inst
;
817 if (n_template_parm_scopes
< n_class_scopes
)
818 /* We've not seen enough template headers to match all the
819 specialized classes present. For example:
821 template <class T> void R<T>::S<T>::f(int);
823 This is illegal; there needs to be one set of template
824 parameters for each class. */
825 return tsk_insufficient_parms
;
826 else if (n_template_parm_scopes
== n_class_scopes
)
827 /* We're processing a non-template declaration (even though it may
828 be a member of a template class.) For example:
830 template <class T> void S<T>::f(int);
832 The `class T' maches the `S<T>', leaving no template headers
833 corresponding to the `f'. */
835 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
836 /* We've got too many template headers. For example:
838 template <> template <class T> void f (T);
840 There need to be more enclosing classes. */
841 return tsk_excessive_parms
;
843 /* This must be a template. It's of the form:
845 template <class T> template <class U> void S<T>::f(U);
847 This is a specialization if the innermost level was a
848 specialization; otherwise it's just a definition of the
850 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
854 set_class_shadows (shadows
)
857 class_binding_level
->class_shadowed
= shadows
;
860 /* Enter a new binding level.
861 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
862 not for that of tags. */
865 pushlevel (tag_transparent
)
868 struct binding_level
*newlevel
;
870 if (cfun
&& !doing_semantic_analysis_p ())
873 /* Reuse or create a struct for this binding level. */
874 #if defined(DEBUG_CP_BINDING_LEVELS)
876 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
877 if (free_binding_level
)
878 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
880 newlevel
= free_binding_level
;
881 free_binding_level
= free_binding_level
->level_chain
;
884 newlevel
= make_binding_level ();
886 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
887 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
888 keep_next_level_flag
= 0;
891 /* Enter a new scope. The KIND indicates what kind of scope is being
902 case sk_template_spec
:
903 current_binding_level
->template_spec_p
= 1;
906 case sk_template_parms
:
907 current_binding_level
->template_parms_p
= 1;
911 my_friendly_abort (20000309);
915 /* Exit the current scope. */
924 note_level_for_for ()
926 current_binding_level
->is_for_scope
= 1;
929 /* Record that the current binding level represents a try block. */
934 current_binding_level
->eh_region
= 1;
937 /* For a binding between a name and an entity at a block scope,
938 this is the `struct binding_level' for the block. */
939 #define BINDING_LEVEL(NODE) \
940 (((struct tree_binding*)NODE)->scope.level)
942 /* Make DECL the innermost binding for ID. The LEVEL is the binding
943 level at which this declaration is being bound. */
946 push_binding (id
, decl
, level
)
949 struct binding_level
* level
;
953 binding
= make_node (CPLUS_BINDING
);
955 /* Now, fill in the binding information. */
956 BINDING_VALUE (binding
) = decl
;
957 BINDING_TYPE (binding
) = NULL_TREE
;
958 BINDING_LEVEL (binding
) = level
;
959 INHERITED_VALUE_BINDING_P (binding
) = 0;
960 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
961 BINDING_HAS_LEVEL_P (binding
) = 1;
963 /* And put it on the front of the list of bindings for ID. */
964 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
965 IDENTIFIER_BINDING (id
) = binding
;
968 /* ID is already bound in the current scope. But, DECL is an
969 additional binding for ID in the same scope. This is the `struct
970 stat' hack whereby a non-typedef class-name or enum-name can be
971 bound at the same level as some other kind of entity. It's the
972 responsibility of the caller to check that inserting this name is
973 legal here. Returns nonzero if the new binding was successful. */
975 add_binding (id
, decl
)
979 tree binding
= IDENTIFIER_BINDING (id
);
982 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
983 /* The new name is the type name. */
984 BINDING_TYPE (binding
) = decl
;
985 else if (!BINDING_VALUE (binding
))
986 /* This situation arises when push_class_level_binding moves an
987 inherited type-binding out of the way to make room for a new
989 BINDING_VALUE (binding
) = decl
;
990 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
991 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
993 /* The old binding was a type name. It was placed in
994 BINDING_VALUE because it was thought, at the point it was
995 declared, to be the only entity with such a name. Move the
996 type name into the type slot; it is now hidden by the new
998 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
999 BINDING_VALUE (binding
) = decl
;
1000 INHERITED_VALUE_BINDING_P (binding
) = 0;
1002 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1003 && TREE_CODE (decl
) == TYPE_DECL
1004 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1005 && same_type_p (TREE_TYPE (decl
),
1006 TREE_TYPE (BINDING_VALUE (binding
))))
1007 /* We have two typedef-names, both naming the same type to have
1008 the same name. This is OK because of:
1012 In a given scope, a typedef specifier can be used to redefine
1013 the name of any type declared in that scope to refer to the
1014 type to which it already refers. */
1016 /* There can be two block-scope declarations of the same variable,
1017 so long as they are `extern' declarations. */
1018 else if (TREE_CODE (decl
) == VAR_DECL
1019 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1020 && DECL_EXTERNAL (decl
)
1021 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1023 duplicate_decls (decl
, BINDING_VALUE (binding
));
1028 cp_error ("declaration of `%#D'", decl
);
1029 cp_error_at ("conflicts with previous declaration `%#D'",
1030 BINDING_VALUE (binding
));
1037 /* Add DECL to the list of things declared in B. */
1040 add_decl_to_level (decl
, b
)
1042 struct binding_level
*b
;
1044 /* We build up the list in reverse order, and reverse it later if
1046 TREE_CHAIN (decl
) = b
->names
;
1050 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1051 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1052 doesn't really belong to this binding level, that it got here
1053 through a using-declaration. */
1056 push_local_binding (id
, decl
, flags
)
1061 struct binding_level
*b
;
1063 /* Skip over any local classes. This makes sense if we call
1064 push_local_binding with a friend decl of a local class. */
1065 b
= current_binding_level
;
1066 while (b
->parm_flag
== 2)
1069 if (lookup_name_current_level (id
))
1071 /* Supplement the existing binding. */
1072 if (!add_binding (id
, decl
))
1073 /* It didn't work. Something else must be bound at this
1074 level. Do not add DECL to the list of things to pop
1079 /* Create a new binding. */
1080 push_binding (id
, decl
, b
);
1082 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1083 /* We must put the OVERLOAD into a TREE_LIST since the
1084 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1085 decls that got here through a using-declaration. */
1086 decl
= build_tree_list (NULL_TREE
, decl
);
1088 /* And put DECL on the list of things declared by the current
1090 add_decl_to_level (decl
, b
);
1093 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1094 binding was successful. */
1097 push_class_binding (id
, decl
)
1102 tree binding
= IDENTIFIER_BINDING (id
);
1105 /* Note that we declared this value so that we can issue an error if
1106 this an illegal redeclaration of a name already used for some
1108 note_name_declared_in_class (id
, decl
);
1110 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1111 /* Supplement the existing binding. */
1112 result
= add_binding (id
, decl
);
1114 /* Create a new binding. */
1115 push_binding (id
, decl
, class_binding_level
);
1117 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1118 class-level declaration. Note that we do not use DECL here
1119 because of the possibility of the `struct stat' hack; if DECL is
1120 a class-name or enum-name we might prefer a field-name, or some
1122 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1124 /* If this is a binding from a base class, mark it as such. */
1125 binding
= IDENTIFIER_BINDING (id
);
1126 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1128 /* Any implicit typename must be from a base-class. The
1129 context for an implicit typename declaration is always
1130 the derived class in which the lookup was done, so the checks
1131 based on the context of DECL below will not trigger. */
1132 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1133 INHERITED_VALUE_BINDING_P (binding
) = 1;
1136 if (TREE_CODE (decl
) == OVERLOAD
)
1137 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1140 my_friendly_assert (DECL_P (decl
), 0);
1141 context
= CP_DECL_CONTEXT (decl
);
1144 if (is_properly_derived_from (current_class_type
, context
))
1145 INHERITED_VALUE_BINDING_P (binding
) = 1;
1147 INHERITED_VALUE_BINDING_P (binding
) = 0;
1150 else if (BINDING_VALUE (binding
) == decl
)
1151 /* We only encounter a TREE_LIST when push_class_decls detects an
1152 ambiguity. Such an ambiguity can be overridden by a definition
1154 INHERITED_VALUE_BINDING_P (binding
) = 1;
1159 /* Remove the binding for DECL which should be the innermost binding
1163 pop_binding (id
, decl
)
1169 if (id
== NULL_TREE
)
1170 /* It's easiest to write the loops that call this function without
1171 checking whether or not the entities involved have names. We
1172 get here for such an entity. */
1175 /* Get the innermost binding for ID. */
1176 binding
= IDENTIFIER_BINDING (id
);
1178 /* The name should be bound. */
1179 my_friendly_assert (binding
!= NULL_TREE
, 0);
1181 /* The DECL will be either the ordinary binding or the type
1182 binding for this identifier. Remove that binding. */
1183 if (BINDING_VALUE (binding
) == decl
)
1184 BINDING_VALUE (binding
) = NULL_TREE
;
1185 else if (BINDING_TYPE (binding
) == decl
)
1186 BINDING_TYPE (binding
) = NULL_TREE
;
1188 my_friendly_abort (0);
1190 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1191 /* We're completely done with the innermost binding for this
1192 identifier. Unhook it from the list of bindings. */
1193 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1196 /* When a label goes out of scope, check to see if that label was used
1197 in a valid manner, and issue any appropriate warnings or errors. */
1200 pop_label (label
, old_value
)
1204 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1206 if (DECL_INITIAL (label
) == NULL_TREE
)
1208 cp_error_at ("label `%D' used but not defined", label
);
1209 /* Avoid crashing later. */
1210 define_label (input_filename
, 1, DECL_NAME (label
));
1212 else if (warn_unused_label
&& !TREE_USED (label
))
1213 cp_warning_at ("label `%D' defined but not used", label
);
1216 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1219 /* At the end of a function, all labels declared within the function
1220 go out of scope. BLOCK is the top-level block for the
1227 struct named_label_list
*link
;
1229 /* Clear out the definitions of all label names, since their scopes
1231 for (link
= named_labels
; link
; link
= link
->next
)
1233 pop_label (link
->label_decl
, link
->old_value
);
1234 /* Put the labels into the "variables" of the top-level block,
1235 so debugger can see them. */
1236 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1237 BLOCK_VARS (block
) = link
->label_decl
;
1240 named_labels
= NULL
;
1243 /* Exit a binding level.
1244 Pop the level off, and restore the state of the identifier-decl mappings
1245 that were in effect when this level was entered.
1247 If KEEP == 1, this level had explicit declarations, so
1248 and create a "block" (a BLOCK node) for the level
1249 to record its declarations and subblocks for symbol table output.
1251 If FUNCTIONBODY is nonzero, this level is the body of a function,
1252 so create a block as if KEEP were set and also clear out all
1255 If REVERSE is nonzero, reverse the order of decls before putting
1256 them into the BLOCK. */
1259 poplevel (keep
, reverse
, functionbody
)
1265 /* The chain of decls was accumulated in reverse order.
1266 Put it into forward order, just for cleanliness. */
1268 int tmp
= functionbody
;
1269 int real_functionbody
;
1272 tree block
= NULL_TREE
;
1274 int leaving_for_scope
;
1276 if (cfun
&& !doing_semantic_analysis_p ())
1279 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1282 real_functionbody
= (current_binding_level
->keep
== 2
1283 ? ((functionbody
= 0), tmp
) : functionbody
);
1284 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1285 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1287 my_friendly_assert (!current_binding_level
->class_shadowed
,
1290 /* We used to use KEEP == 2 to indicate that the new block should go
1291 at the beginning of the list of blocks at this binding level,
1292 rather than the end. This hack is no longer used. */
1293 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1295 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1296 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1297 current_binding_level
->parm_flag
,
1298 current_binding_level
->keep
);
1300 if (current_binding_level
->keep
== 1)
1303 /* Any uses of undefined labels, and any defined labels, now operate
1304 under constraints of next binding contour. */
1305 if (cfun
&& !functionbody
)
1307 struct binding_level
*level_chain
;
1308 level_chain
= current_binding_level
->level_chain
;
1311 struct named_label_use_list
*uses
;
1312 struct named_label_list
*labels
;
1313 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1314 if (labels
->binding_level
== current_binding_level
)
1317 if (current_binding_level
->eh_region
)
1318 labels
->eh_region
= 1;
1319 for (decl
= labels
->names_in_scope
; decl
;
1320 decl
= TREE_CHAIN (decl
))
1321 if (decl_jump_unsafe (decl
))
1322 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1324 labels
->binding_level
= level_chain
;
1325 labels
->names_in_scope
= level_chain
->names
;
1328 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1329 if (uses
->binding_level
== current_binding_level
)
1331 uses
->binding_level
= level_chain
;
1332 uses
->names_in_scope
= level_chain
->names
;
1337 /* Get the decls in the order they were written.
1338 Usually current_binding_level->names is in reverse order.
1339 But parameter decls were previously put in forward order. */
1342 current_binding_level
->names
1343 = decls
= nreverse (current_binding_level
->names
);
1345 decls
= current_binding_level
->names
;
1347 /* Output any nested inline functions within this block
1348 if they weren't already output. */
1349 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1350 if (TREE_CODE (decl
) == FUNCTION_DECL
1351 && ! TREE_ASM_WRITTEN (decl
)
1352 && DECL_INITIAL (decl
) != NULL_TREE
1353 && TREE_ADDRESSABLE (decl
)
1354 && decl_function_context (decl
) == current_function_decl
)
1356 /* If this decl was copied from a file-scope decl
1357 on account of a block-scope extern decl,
1358 propagate TREE_ADDRESSABLE to the file-scope decl. */
1359 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1360 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1363 push_function_context ();
1364 output_inline_function (decl
);
1365 pop_function_context ();
1369 /* When not in function-at-a-time mode, expand_end_bindings will
1370 warn about unused variables. But, in function-at-a-time mode
1371 expand_end_bindings is not passed the list of variables in the
1372 current scope, and therefore no warning is emitted. So, we
1373 explicitly warn here. */
1374 if (!processing_template_decl
)
1375 warn_about_unused_variables (getdecls ());
1377 /* If there were any declarations or structure tags in that level,
1378 or if this level is a function body,
1379 create a BLOCK to record them for the life of this function. */
1381 if (keep
== 1 || functionbody
)
1382 block
= make_node (BLOCK
);
1383 if (block
!= NULL_TREE
)
1385 BLOCK_VARS (block
) = decls
;
1386 BLOCK_SUBBLOCKS (block
) = subblocks
;
1389 /* In each subblock, record that this is its superior. */
1391 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1392 BLOCK_SUPERCONTEXT (link
) = block
;
1394 /* We still support the old for-scope rules, whereby the variables
1395 in a for-init statement were in scope after the for-statement
1396 ended. We only use the new rules in flag_new_for_scope is
1399 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1401 /* Remove declarations for all the DECLs in this level. */
1402 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1404 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1405 && DECL_NAME (link
))
1408 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1412 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1414 ns_binding
= NULL_TREE
;
1417 && (BINDING_LEVEL (outer_binding
)
1418 == current_binding_level
->level_chain
))
1419 /* We have something like:
1424 and we are leaving the `for' scope. There's no reason to
1425 keep the binding of the inner `i' in this case. */
1426 pop_binding (DECL_NAME (link
), link
);
1427 else if ((outer_binding
1428 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1431 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1432 /* Here, we have something like:
1440 We must pop the for-scope binding so we know what's a
1441 type and what isn't. */
1442 pop_binding (DECL_NAME (link
), link
);
1445 /* Mark this VAR_DECL as dead so that we can tell we left it
1446 there only for backward compatibility. */
1447 DECL_DEAD_FOR_LOCAL (link
) = 1;
1449 /* Keep track of what should of have happenned when we
1450 popped the binding. */
1451 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1452 DECL_SHADOWED_FOR_VAR (link
)
1453 = BINDING_VALUE (outer_binding
);
1455 /* Add it to the list of dead variables in the next
1456 outermost binding to that we can remove these when we
1457 leave that binding. */
1458 current_binding_level
->level_chain
->dead_vars_from_for
1459 = tree_cons (NULL_TREE
, link
,
1460 current_binding_level
->level_chain
->
1461 dead_vars_from_for
);
1463 /* Although we don't pop the CPLUS_BINDING, we do clear
1464 its BINDING_LEVEL since the level is going away now. */
1465 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1471 /* Remove the binding. */
1473 if (TREE_CODE (decl
) == TREE_LIST
)
1474 decl
= TREE_VALUE (decl
);
1476 pop_binding (DECL_NAME (decl
), decl
);
1477 else if (TREE_CODE (decl
) == OVERLOAD
)
1478 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1480 my_friendly_abort (0);
1484 /* Remove declarations for any `for' variables from inner scopes
1485 that we kept around. */
1486 for (link
= current_binding_level
->dead_vars_from_for
;
1487 link
; link
= TREE_CHAIN (link
))
1488 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1490 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1491 for (link
= current_binding_level
->type_shadowed
;
1492 link
; link
= TREE_CHAIN (link
))
1493 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1495 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1496 for (link
= current_binding_level
->shadowed_labels
;
1498 link
= TREE_CHAIN (link
))
1499 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1501 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1502 list if a `using' declaration put them there. The debugging
1503 back-ends won't understand OVERLOAD, so we remove them here.
1504 Because the BLOCK_VARS are (temporarily) shared with
1505 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1506 popped all the bindings. */
1511 for (d
= &BLOCK_VARS (block
); *d
; )
1513 if (TREE_CODE (*d
) == TREE_LIST
)
1514 *d
= TREE_CHAIN (*d
);
1516 d
= &TREE_CHAIN (*d
);
1520 /* If the level being exited is the top level of a function,
1521 check over all the labels. */
1524 /* Since this is the top level block of a function, the vars are
1525 the function's parameters. Don't leave them in the BLOCK
1526 because they are found in the FUNCTION_DECL instead. */
1527 BLOCK_VARS (block
) = 0;
1531 tmp
= current_binding_level
->keep
;
1533 pop_binding_level ();
1535 DECL_INITIAL (current_function_decl
) = block
;
1537 current_binding_level
->blocks
1538 = chainon (current_binding_level
->blocks
, block
);
1540 /* If we did not make a block for the level just exited,
1541 any blocks made for inner levels
1542 (since they cannot be recorded as subblocks in that level)
1543 must be carried forward so they will later become subblocks
1544 of something else. */
1546 current_binding_level
->blocks
1547 = chainon (current_binding_level
->blocks
, subblocks
);
1549 /* Each and every BLOCK node created here in `poplevel' is important
1550 (e.g. for proper debugging information) so if we created one
1551 earlier, mark it as "used". */
1553 TREE_USED (block
) = 1;
1555 /* Take care of compiler's internal binding structures. */
1561 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1564 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1565 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1568 block
= poplevel (keep
, reverse
, functionbody
);
1574 /* Delete the node BLOCK from the current binding level.
1575 This is used for the block inside a stmt expr ({...})
1576 so that the block can be reinserted where appropriate. */
1579 delete_block (block
)
1583 if (current_binding_level
->blocks
== block
)
1584 current_binding_level
->blocks
= TREE_CHAIN (block
);
1585 for (t
= current_binding_level
->blocks
; t
;)
1587 if (TREE_CHAIN (t
) == block
)
1588 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1592 TREE_CHAIN (block
) = NULL_TREE
;
1593 /* Clear TREE_USED which is always set by poplevel.
1594 The flag is set again if insert_block is called. */
1595 TREE_USED (block
) = 0;
1598 /* Insert BLOCK at the end of the list of subblocks of the
1599 current binding level. This is used when a BIND_EXPR is expanded,
1600 to handle the BLOCK node inside the BIND_EXPR. */
1603 insert_block (block
)
1606 TREE_USED (block
) = 1;
1607 current_binding_level
->blocks
1608 = chainon (current_binding_level
->blocks
, block
);
1611 /* Set the BLOCK node for the innermost scope
1612 (the one we are currently in). */
1616 tree block ATTRIBUTE_UNUSED
;
1618 /* The RTL expansion machinery requires us to provide this callback,
1619 but it is not applicable in function-at-a-time mode. */
1620 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1623 /* Do a pushlevel for class declarations. */
1628 register struct binding_level
*newlevel
;
1630 /* Reuse or create a struct for this binding level. */
1631 #if defined(DEBUG_CP_BINDING_LEVELS)
1633 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1634 if (free_binding_level
)
1635 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1637 newlevel
= free_binding_level
;
1638 free_binding_level
= free_binding_level
->level_chain
;
1641 newlevel
= make_binding_level ();
1643 #if defined(DEBUG_CP_BINDING_LEVELS)
1645 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1647 push_binding_level (newlevel
, 0, 0);
1649 class_binding_level
= current_binding_level
;
1650 class_binding_level
->parm_flag
= 2;
1651 class_binding_level
->this_class
= current_class_type
;
1654 /* ...and a poplevel for class declarations. */
1659 register struct binding_level
*level
= class_binding_level
;
1662 my_friendly_assert (level
!= 0, 354);
1664 /* If we're leaving a toplevel class, don't bother to do the setting
1665 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1666 shouldn't even be used when current_class_type isn't set, and second,
1667 if we don't touch it here, we're able to use the cache effect if the
1668 next time we're entering a class scope, it is the same class. */
1669 if (current_class_depth
!= 1)
1671 struct binding_level
* b
;
1673 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1674 for (shadowed
= level
->class_shadowed
;
1676 shadowed
= TREE_CHAIN (shadowed
))
1677 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1679 /* Find the next enclosing class, and recreate
1680 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1681 b
= level
->level_chain
;
1682 while (b
&& b
->parm_flag
!= 2)
1686 for (shadowed
= b
->class_shadowed
;
1688 shadowed
= TREE_CHAIN (shadowed
))
1692 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1693 while (t
&& BINDING_LEVEL (t
) != b
)
1697 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1698 = BINDING_VALUE (t
);
1702 /* Remember to save what IDENTIFIER's were bound in this scope so we
1703 can recover from cache misses. */
1705 previous_class_type
= current_class_type
;
1706 previous_class_values
= class_binding_level
->class_shadowed
;
1708 for (shadowed
= level
->type_shadowed
;
1710 shadowed
= TREE_CHAIN (shadowed
))
1711 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1713 /* Remove the bindings for all of the class-level declarations. */
1714 for (shadowed
= level
->class_shadowed
;
1716 shadowed
= TREE_CHAIN (shadowed
))
1717 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1719 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1720 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1721 class_binding_level
->parm_flag
,
1722 class_binding_level
->keep
);
1724 /* Now, pop out of the binding level which we created up in the
1725 `pushlevel_class' routine. */
1726 #if defined(DEBUG_CP_BINDING_LEVELS)
1728 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1730 pop_binding_level ();
1733 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1734 for any names in enclosing classes. */
1737 clear_identifier_class_values ()
1741 if (!class_binding_level
)
1744 for (t
= class_binding_level
->class_shadowed
;
1747 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1750 /* Returns non-zero if T is a virtual function table. */
1753 vtable_decl_p (t
, data
)
1755 void *data ATTRIBUTE_UNUSED
;
1757 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1760 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1764 vtype_decl_p (t
, data
)
1766 void *data ATTRIBUTE_UNUSED
;
1768 return (TREE_CODE (t
) == TYPE_DECL
1769 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1770 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1773 /* Return the declarations that are members of the namespace NS. */
1776 cp_namespace_decls (ns
)
1779 return NAMESPACE_LEVEL (ns
)->names
;
1782 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1783 itself, calling F for each. The DATA is passed to F as well. */
1786 walk_namespaces_r (namespace, f
, data
)
1788 walk_namespaces_fn f
;
1794 result
|= (*f
) (namespace, data
);
1796 for (current
= cp_namespace_decls (namespace);
1798 current
= TREE_CHAIN (current
))
1800 if (TREE_CODE (current
) != NAMESPACE_DECL
1801 || DECL_NAMESPACE_ALIAS (current
))
1803 if (!DECL_LANG_SPECIFIC (current
))
1806 my_friendly_assert (current
== fake_std_node
, 393);
1810 /* We found a namespace. */
1811 result
|= walk_namespaces_r (current
, f
, data
);
1817 /* Walk all the namespaces, calling F for each. The DATA is passed to
1821 walk_namespaces (f
, data
)
1822 walk_namespaces_fn f
;
1825 return walk_namespaces_r (global_namespace
, f
, data
);
1828 struct walk_globals_data
{
1829 walk_globals_pred p
;
1834 /* Walk the global declarations in NAMESPACE. Whenever one is found
1835 for which P returns non-zero, call F with its address. If any call
1836 to F returns a non-zero value, return a non-zero value. */
1839 walk_globals_r (namespace, data
)
1843 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1844 walk_globals_pred p
= wgd
->p
;
1845 walk_globals_fn f
= wgd
->f
;
1846 void *d
= wgd
->data
;
1850 t
= &NAMESPACE_LEVEL (namespace)->names
;
1857 result
|= (*f
) (t
, d
);
1859 /* If F changed *T, then *T still points at the next item to
1862 t
= &TREE_CHAIN (*t
);
1868 /* Walk the global declarations. Whenever one is found for which P
1869 returns non-zero, call F with its address. If any call to F
1870 returns a non-zero value, return a non-zero value. */
1873 walk_globals (p
, f
, data
)
1874 walk_globals_pred p
;
1878 struct walk_globals_data wgd
;
1883 return walk_namespaces (walk_globals_r
, &wgd
);
1886 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1887 DATA is non-NULL, this is the last time we will call
1888 wrapup_global_declarations for this NAMESPACE. */
1891 wrapup_globals_for_namespace (namespace, data
)
1895 tree globals
= cp_namespace_decls (namespace);
1896 int len
= list_length (globals
);
1897 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1901 int last_time
= (data
!= 0);
1903 if (last_time
&& namespace == global_namespace
)
1904 /* Let compile_file handle the global namespace. */
1907 /* Process the decls in reverse order--earliest first.
1908 Put them into VEC from back to front, then take out from front. */
1909 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1910 vec
[len
- i
- 1] = decl
;
1914 check_global_declarations (vec
, len
);
1918 /* Temporarily mark vtables as external. That prevents
1919 wrapup_global_declarations from writing them out; we must process
1920 them ourselves in finish_vtable_vardecl. */
1921 for (i
= 0; i
< len
; ++i
)
1922 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1924 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1925 DECL_EXTERNAL (vec
[i
]) = 1;
1928 /* Write out any globals that need to be output. */
1929 result
= wrapup_global_declarations (vec
, len
);
1931 /* Undo the hack to DECL_EXTERNAL above. */
1932 for (i
= 0; i
< len
; ++i
)
1933 if (vtable_decl_p (vec
[i
], /*data=*/0)
1934 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1936 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1937 DECL_EXTERNAL (vec
[i
]) = 0;
1944 /* Mark ARG (which is really a struct binding_level **) for GC. */
1947 mark_binding_level (arg
)
1950 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1952 for (; lvl
; lvl
= lvl
->level_chain
)
1954 ggc_mark_tree (lvl
->names
);
1955 ggc_mark_tree (lvl
->tags
);
1956 ggc_mark_tree (lvl
->usings
);
1957 ggc_mark_tree (lvl
->using_directives
);
1958 ggc_mark_tree (lvl
->class_shadowed
);
1959 ggc_mark_tree (lvl
->type_shadowed
);
1960 ggc_mark_tree (lvl
->shadowed_labels
);
1961 ggc_mark_tree (lvl
->blocks
);
1962 ggc_mark_tree (lvl
->this_class
);
1963 ggc_mark_tree (lvl
->incomplete
);
1964 ggc_mark_tree (lvl
->dead_vars_from_for
);
1969 mark_named_label_lists (labs
, uses
)
1973 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
1974 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
1976 for (; l
; l
= l
->next
)
1979 mark_binding_level (l
->binding_level
);
1980 ggc_mark_tree (l
->old_value
);
1981 ggc_mark_tree (l
->label_decl
);
1982 ggc_mark_tree (l
->bad_decls
);
1985 for (; u
; u
= u
->next
)
1989 /* For debugging. */
1990 static int no_print_functions
= 0;
1991 static int no_print_builtins
= 0;
1994 print_binding_level (lvl
)
1995 struct binding_level
*lvl
;
1999 fprintf (stderr
, " blocks=");
2000 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2001 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2002 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2003 if (lvl
->tag_transparent
)
2004 fprintf (stderr
, " tag-transparent");
2005 if (lvl
->more_cleanups_ok
)
2006 fprintf (stderr
, " more-cleanups-ok");
2007 if (lvl
->have_cleanups
)
2008 fprintf (stderr
, " have-cleanups");
2009 fprintf (stderr
, "\n");
2012 fprintf (stderr
, " names:\t");
2013 /* We can probably fit 3 names to a line? */
2014 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2016 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2018 if (no_print_builtins
2019 && (TREE_CODE (t
) == TYPE_DECL
)
2020 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2023 /* Function decls tend to have longer names. */
2024 if (TREE_CODE (t
) == FUNCTION_DECL
)
2031 fprintf (stderr
, "\n\t");
2034 print_node_brief (stderr
, "", t
, 0);
2035 if (t
== error_mark_node
)
2039 fprintf (stderr
, "\n");
2043 fprintf (stderr
, " tags:\t");
2045 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2047 if (TREE_PURPOSE (t
) == NULL_TREE
)
2049 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2056 fprintf (stderr
, "\n\t");
2059 if (TREE_PURPOSE (t
) == NULL_TREE
)
2061 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2062 fprintf (stderr
, ">");
2064 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2065 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2068 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2069 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2070 fprintf (stderr
, ">");
2074 fprintf (stderr
, "\n");
2076 if (lvl
->class_shadowed
)
2078 fprintf (stderr
, " class-shadowed:");
2079 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2081 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2083 fprintf (stderr
, "\n");
2085 if (lvl
->type_shadowed
)
2087 fprintf (stderr
, " type-shadowed:");
2088 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2090 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2092 fprintf (stderr
, "\n");
2097 print_other_binding_stack (stack
)
2098 struct binding_level
*stack
;
2100 struct binding_level
*level
;
2101 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2103 fprintf (stderr
, "binding level ");
2104 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2105 fprintf (stderr
, "\n");
2106 print_binding_level (level
);
2111 print_binding_stack ()
2113 struct binding_level
*b
;
2114 fprintf (stderr
, "current_binding_level=");
2115 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2116 fprintf (stderr
, "\nclass_binding_level=");
2117 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2118 fprintf (stderr
, "\nglobal_binding_level=");
2119 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2120 fprintf (stderr
, "\n");
2121 if (class_binding_level
)
2123 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2124 if (b
== current_binding_level
)
2127 b
= class_binding_level
;
2129 b
= current_binding_level
;
2132 b
= current_binding_level
;
2133 print_other_binding_stack (b
);
2134 fprintf (stderr
, "global:\n");
2135 print_binding_level (global_binding_level
);
2138 /* Namespace binding access routines: The namespace_bindings field of
2139 the identifier is polymorphic, with three possible values:
2140 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2141 indicating the BINDING_VALUE of global_namespace. */
2143 /* Check whether the a binding for the name to scope is known.
2144 Assumes that the bindings of the name are already a list
2145 of bindings. Returns the binding found, or NULL_TREE. */
2148 find_binding (name
, scope
)
2152 tree iter
, prev
= NULL_TREE
;
2154 scope
= ORIGINAL_NAMESPACE (scope
);
2156 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2157 iter
= TREE_CHAIN (iter
))
2159 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2160 if (BINDING_SCOPE (iter
) == scope
)
2162 /* Move binding found to the front of the list, so
2163 subsequent lookups will find it faster. */
2166 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2167 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2168 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2177 /* Always returns a binding for name in scope. If the
2178 namespace_bindings is not a list, convert it to one first.
2179 If no binding is found, make a new one. */
2182 binding_for_name (name
, scope
)
2186 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2189 scope
= ORIGINAL_NAMESPACE (scope
);
2191 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2193 /* Get rid of optimization for global scope. */
2194 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2195 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2196 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2198 if (b
&& (result
= find_binding (name
, scope
)))
2200 /* Not found, make a new one. */
2201 result
= make_node (CPLUS_BINDING
);
2202 TREE_CHAIN (result
) = b
;
2203 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2204 BINDING_SCOPE (result
) = scope
;
2205 BINDING_TYPE (result
) = NULL_TREE
;
2206 BINDING_VALUE (result
) = NULL_TREE
;
2210 /* Return the binding value for name in scope, considering that
2211 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2214 namespace_binding (name
, scope
)
2218 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2221 if (scope
== NULL_TREE
)
2222 scope
= global_namespace
;
2223 if (TREE_CODE (b
) != CPLUS_BINDING
)
2224 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2225 name
= find_binding (name
,scope
);
2226 if (name
== NULL_TREE
)
2228 return BINDING_VALUE (name
);
2231 /* Set the binding value for name in scope. If modifying the binding
2232 of global_namespace is attempted, try to optimize it. */
2235 set_namespace_binding (name
, scope
, val
)
2242 if (scope
== NULL_TREE
)
2243 scope
= global_namespace
;
2245 if (scope
== global_namespace
)
2247 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2248 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2250 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2254 b
= binding_for_name (name
, scope
);
2255 BINDING_VALUE (b
) = val
;
2258 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2259 select a name that is unique to this compilation unit. */
2262 push_namespace (name
)
2267 int implicit_use
= 0;
2269 if (!global_namespace
)
2271 /* This must be ::. */
2272 my_friendly_assert (name
== get_identifier ("::"), 377);
2277 /* The name of anonymous namespace is unique for the translation
2279 if (!anonymous_namespace_name
)
2280 anonymous_namespace_name
= get_file_function_name ('N');
2281 name
= anonymous_namespace_name
;
2282 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2284 /* Reopening anonymous namespace. */
2288 else if (current_namespace
== global_namespace
2290 && name
== std_identifier
)
2297 /* Check whether this is an extended namespace definition. */
2298 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2299 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2302 if (DECL_NAMESPACE_ALIAS (d
))
2304 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2305 d
, DECL_NAMESPACE_ALIAS (d
));
2306 d
= DECL_NAMESPACE_ALIAS (d
);
2313 /* Make a new namespace, binding the name to it. */
2314 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2315 /* The global namespace is not pushed, and the global binding
2316 level is set elsewhere. */
2319 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2322 declare_namespace_level ();
2323 NAMESPACE_LEVEL (d
) = current_binding_level
;
2327 resume_binding_level (NAMESPACE_LEVEL (d
));
2330 do_using_directive (d
);
2331 /* Enter the name space. */
2332 current_namespace
= d
;
2335 /* Pop from the scope of the current namespace. */
2340 if (current_namespace
== global_namespace
)
2342 my_friendly_assert (in_fake_std
> 0, 980421);
2346 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2347 /* The binding level is not popped, as it might be re-opened later. */
2348 suspend_binding_level ();
2351 /* Push into the scope of the namespace NS, even if it is deeply
2352 nested within another namespace. */
2355 push_nested_namespace (ns
)
2358 if (ns
== global_namespace
)
2359 push_to_top_level ();
2362 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2363 push_namespace (DECL_NAME (ns
));
2367 /* Pop back from the scope of the namespace NS, which was previously
2368 entered with push_nested_namespace. */
2371 pop_nested_namespace (ns
)
2374 while (ns
!= global_namespace
)
2377 ns
= CP_DECL_CONTEXT (ns
);
2380 pop_from_top_level ();
2384 /* Subroutines for reverting temporarily to top-level for instantiation
2385 of templates and such. We actually need to clear out the class- and
2386 local-value slots of all identifiers, so that only the global values
2387 are at all visible. Simply setting current_binding_level to the global
2388 scope isn't enough, because more binding levels may be pushed. */
2389 struct saved_scope
*scope_chain
;
2391 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2394 mark_saved_scope (arg
)
2397 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2400 mark_binding_level (&t
->class_bindings
);
2401 ggc_mark_tree (t
->old_bindings
);
2402 ggc_mark_tree (t
->old_namespace
);
2403 ggc_mark_tree (t
->class_name
);
2404 ggc_mark_tree (t
->class_type
);
2405 ggc_mark_tree (t
->access_specifier
);
2406 ggc_mark_tree (t
->function_decl
);
2408 ggc_mark_tree_varray (t
->lang_base
);
2409 ggc_mark_tree (t
->lang_name
);
2410 ggc_mark_tree (t
->template_parms
);
2411 ggc_mark_tree (t
->x_previous_class_type
);
2412 ggc_mark_tree (t
->x_previous_class_values
);
2413 ggc_mark_tree (t
->x_saved_tree
);
2414 ggc_mark_tree (t
->incomplete
);
2415 ggc_mark_tree (t
->lookups
);
2417 mark_stmt_tree (&t
->x_stmt_tree
);
2418 mark_binding_level (&t
->bindings
);
2424 store_bindings (names
, old_bindings
)
2425 tree names
, old_bindings
;
2428 tree search_bindings
= old_bindings
;
2430 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2432 tree binding
, t1
, id
;
2434 if (TREE_CODE (t
) == TREE_LIST
)
2435 id
= TREE_PURPOSE (t
);
2440 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2441 we have no IDENTIFIER_BINDING if we have left the class
2442 scope, but cached the class-level declarations. */
2443 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2446 for (t1
= search_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2447 if (TREE_VEC_ELT (t1
, 0) == id
)
2450 binding
= make_tree_vec (4);
2454 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2455 TREE_VEC_ELT (binding
, 0) = id
;
2456 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2457 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2458 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2459 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2460 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2462 TREE_CHAIN (binding
) = old_bindings
;
2463 old_bindings
= binding
;
2467 return old_bindings
;
2471 maybe_push_to_top_level (pseudo
)
2474 struct saved_scope
*s
;
2475 struct binding_level
*b
;
2479 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2481 b
= scope_chain
? current_binding_level
: 0;
2483 /* If we're in the middle of some function, save our state. */
2487 push_function_context_to (NULL_TREE
);
2492 old_bindings
= NULL_TREE
;
2493 if (scope_chain
&& previous_class_type
)
2494 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2496 /* Have to include global_binding_level, because class-level decls
2497 aren't listed anywhere useful. */
2498 for (; b
; b
= b
->level_chain
)
2502 /* Template IDs are inserted into the global level. If they were
2503 inserted into namespace level, finish_file wouldn't find them
2504 when doing pending instantiations. Therefore, don't stop at
2505 namespace level, but continue until :: . */
2506 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2509 old_bindings
= store_bindings (b
->names
, old_bindings
);
2510 /* We also need to check class_shadowed to save class-level type
2511 bindings, since pushclass doesn't fill in b->names. */
2512 if (b
->parm_flag
== 2)
2513 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2515 /* Unwind type-value slots back to top level. */
2516 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2517 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2519 s
->prev
= scope_chain
;
2520 s
->old_bindings
= old_bindings
;
2522 s
->need_pop_function_context
= need_pop
;
2523 s
->function_decl
= current_function_decl
;
2526 current_function_decl
= NULL_TREE
;
2527 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2528 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2529 current_lang_name
= lang_name_cplusplus
;
2530 current_namespace
= global_namespace
;
2534 push_to_top_level ()
2536 maybe_push_to_top_level (0);
2540 pop_from_top_level ()
2542 struct saved_scope
*s
= scope_chain
;
2545 /* Clear out class-level bindings cache. */
2546 if (previous_class_type
)
2547 invalidate_class_lookup_cache ();
2549 VARRAY_FREE (current_lang_base
);
2551 scope_chain
= s
->prev
;
2552 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2554 tree id
= TREE_VEC_ELT (t
, 0);
2557 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2558 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2559 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2563 /* If we were in the middle of compiling a function, restore our
2565 if (s
->need_pop_function_context
)
2566 pop_function_context_from (NULL_TREE
);
2567 current_function_decl
= s
->function_decl
;
2572 /* Push a definition of struct, union or enum tag "name".
2573 into binding_level "b". "type" should be the type node,
2574 We assume that the tag "name" is not already defined.
2576 Note that the definition may really be just a forward reference.
2577 In that case, the TYPE_SIZE will be a NULL_TREE.
2579 C++ gratuitously puts all these tags in the name space. */
2581 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2582 record the shadowed value for this binding contour. TYPE is
2583 the type that ID maps to. */
2586 set_identifier_type_value_with_scope (id
, type
, b
)
2589 struct binding_level
*b
;
2591 if (!b
->namespace_p
)
2593 /* Shadow the marker, not the real thing, so that the marker
2594 gets restored later. */
2595 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2597 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2601 tree binding
= binding_for_name (id
, current_namespace
);
2602 BINDING_TYPE (binding
) = type
;
2603 /* Store marker instead of real type. */
2604 type
= global_type_node
;
2606 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2609 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2612 set_identifier_type_value (id
, type
)
2616 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2619 /* Return the type associated with id. */
2622 identifier_type_value (id
)
2625 /* There is no type with that name, anywhere. */
2626 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2628 /* This is not the type marker, but the real thing. */
2629 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2630 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2631 /* Have to search for it. It must be on the global level, now.
2632 Ask lookup_name not to return non-types. */
2633 id
= lookup_name_real (id
, 2, 1, 0);
2635 return TREE_TYPE (id
);
2639 /* Pop off extraneous binding levels left over due to syntax errors.
2641 We don't pop past namespaces, as they might be valid. */
2646 #ifdef DEBUG_CP_BINDING_LEVELS
2647 fprintf (stderr
, "XXX entering pop_everything ()\n");
2649 while (!toplevel_bindings_p ())
2651 if (current_binding_level
->parm_flag
== 2)
2652 pop_nested_class ();
2656 #ifdef DEBUG_CP_BINDING_LEVELS
2657 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2661 /* The type TYPE is being declared. If it is a class template, or a
2662 specialization of a class template, do any processing required and
2663 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2664 being declared a friend. B is the binding level at which this TYPE
2667 Returns the TYPE_DECL for TYPE, which may have been altered by this
2671 maybe_process_template_type_declaration (type
, globalize
, b
)
2674 struct binding_level
* b
;
2676 tree decl
= TYPE_NAME (type
);
2678 if (processing_template_parmlist
)
2679 /* You can't declare a new template type in a template parameter
2680 list. But, you can declare a non-template type:
2682 template <class A*> struct S;
2684 is a forward-declaration of `A'. */
2688 maybe_check_template_type (type
);
2690 my_friendly_assert (IS_AGGR_TYPE (type
)
2691 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2694 if (processing_template_decl
)
2696 /* This may change after the call to
2697 push_template_decl_real, but we want the original value. */
2698 tree name
= DECL_NAME (decl
);
2700 decl
= push_template_decl_real (decl
, globalize
);
2701 /* If the current binding level is the binding level for the
2702 template parameters (see the comment in
2703 begin_template_parm_list) and the enclosing level is a class
2704 scope, and we're not looking at a friend, push the
2705 declaration of the member class into the class scope. In the
2706 friend case, push_template_decl will already have put the
2707 friend into global scope, if appropriate. */
2708 if (TREE_CODE (type
) != ENUMERAL_TYPE
2709 && !globalize
&& b
->template_parms_p
2710 && b
->level_chain
->parm_flag
== 2)
2712 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2713 /* Put this tag on the list of tags for the class, since
2714 that won't happen below because B is not the class
2715 binding level, but is instead the pseudo-global level. */
2716 b
->level_chain
->tags
=
2717 tree_cons (name
, type
, b
->level_chain
->tags
);
2718 if (!COMPLETE_TYPE_P (current_class_type
))
2719 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2727 /* In C++, you don't have to write `struct S' to refer to `S'; you
2728 can just use `S'. We accomplish this by creating a TYPE_DECL as
2729 if the user had written `typedef struct S S'. Create and return
2730 the TYPE_DECL for TYPE. */
2733 create_implicit_typedef (name
, type
)
2739 decl
= build_decl (TYPE_DECL
, name
, type
);
2740 DECL_ARTIFICIAL (decl
) = 1;
2741 /* There are other implicit type declarations, like the one *within*
2742 a class that allows you to write `S::S'. We must distinguish
2744 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2745 TYPE_NAME (type
) = 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 || (globalize
&& b
->parm_flag
== 2))
2767 b
->tags
= tree_cons (name
, type
, b
->tags
);
2771 /* Do C++ gratuitous typedefing. */
2772 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2774 register tree d
= NULL_TREE
;
2776 tree context
= TYPE_CONTEXT (type
);
2780 tree cs
= current_scope ();
2784 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2785 /* When declaring a friend class of a local class, we want
2786 to inject the newly named class into the scope
2787 containing the local class, not the namespace scope. */
2788 context
= decl_function_context (get_type_decl (cs
));
2791 context
= current_namespace
;
2793 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2794 || b
->parm_flag
== 2)
2797 if (current_lang_name
== lang_name_java
)
2798 TYPE_FOR_JAVA (type
) = 1;
2800 d
= create_implicit_typedef (name
, type
);
2801 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2803 set_identifier_type_value_with_scope (name
, type
, b
);
2805 d
= maybe_process_template_type_declaration (type
,
2808 if (b
->parm_flag
== 2)
2810 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2811 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2812 class. But if it's a member template class, we
2813 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2815 finish_member_declaration (d
);
2817 pushdecl_class_level (d
);
2820 d
= pushdecl_with_scope (d
, b
);
2822 if (ANON_AGGRNAME_P (name
))
2823 DECL_IGNORED_P (d
) = 1;
2825 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2826 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2828 /* If this is a local class, keep track of it. We need this
2829 information for name-mangling, and so that it is possible to find
2830 all function definitions in a translation unit in a convenient
2831 way. (It's otherwise tricky to find a member function definition
2832 it's only pointed to from within a local class.) */
2833 if (TYPE_CONTEXT (type
)
2834 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2835 && !processing_template_decl
)
2836 VARRAY_PUSH_TREE (local_classes
, type
);
2838 if (!uses_template_parms (type
))
2841 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2843 DECL_ASSEMBLER_NAME (d
)
2844 = get_identifier (build_overload_name (type
, 1, 1));
2847 if (b
->parm_flag
== 2)
2849 if (!COMPLETE_TYPE_P (current_class_type
))
2850 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2854 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2855 /* Use the canonical TYPE_DECL for this node. */
2856 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2859 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2860 will be the tagged type we just added to the current
2861 binding level. This fake NULL-named TYPE_DECL node helps
2862 dwarfout.c to know when it needs to output a
2863 representation of a tagged type, and it also gives us a
2864 convenient place to record the "scope start" address for
2867 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2868 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2872 /* Counter used to create anonymous type names. */
2874 static int anon_cnt
= 0;
2876 /* Return an IDENTIFIER which can be used as a name for
2877 anonymous structs and unions. */
2884 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2885 return get_identifier (buf
);
2888 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2889 This keeps dbxout from getting confused. */
2894 register struct binding_level
*b
;
2896 static int last_cnt
= 0;
2898 /* Fast out if no new anon names were declared. */
2899 if (last_cnt
== anon_cnt
)
2902 b
= current_binding_level
;
2903 while (b
->tag_transparent
)
2908 /* A NULL purpose means we have already processed all tags
2909 from here to the end of the list. */
2910 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2912 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2913 TREE_PURPOSE (tags
) = NULL_TREE
;
2914 tags
= TREE_CHAIN (tags
);
2916 last_cnt
= anon_cnt
;
2919 /* Subroutine of duplicate_decls: return truthvalue of whether
2920 or not types of these decls match.
2922 For C++, we must compare the parameter list so that `int' can match
2923 `int&' in a parameter position, but `int&' is not confused with
2927 decls_match (newdecl
, olddecl
)
2928 tree newdecl
, olddecl
;
2932 if (newdecl
== olddecl
)
2935 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2936 /* If the two DECLs are not even the same kind of thing, we're not
2937 interested in their types. */
2940 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2942 tree f1
= TREE_TYPE (newdecl
);
2943 tree f2
= TREE_TYPE (olddecl
);
2944 tree p1
= TYPE_ARG_TYPES (f1
);
2945 tree p2
= TYPE_ARG_TYPES (f2
);
2947 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2948 && ! (DECL_EXTERN_C_P (newdecl
)
2949 && DECL_EXTERN_C_P (olddecl
)))
2952 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2955 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2957 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
2958 && (DECL_BUILT_IN (olddecl
)
2959 #ifndef NO_IMPLICIT_EXTERN_C
2960 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
2961 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
2965 types_match
= self_promoting_args_p (p1
);
2966 if (p1
== void_list_node
)
2967 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2969 #ifndef NO_IMPLICIT_EXTERN_C
2970 else if (p1
== NULL_TREE
2971 && (DECL_EXTERN_C_P (olddecl
)
2972 && DECL_IN_SYSTEM_HEADER (olddecl
)
2973 && !DECL_CLASS_SCOPE_P (olddecl
))
2974 && (DECL_EXTERN_C_P (newdecl
)
2975 && DECL_IN_SYSTEM_HEADER (newdecl
)
2976 && !DECL_CLASS_SCOPE_P (newdecl
)))
2978 types_match
= self_promoting_args_p (p2
);
2979 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2983 types_match
= compparms (p1
, p2
);
2988 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2990 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2991 DECL_TEMPLATE_PARMS (olddecl
)))
2994 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
2995 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
2998 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3001 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3002 DECL_TEMPLATE_RESULT (newdecl
));
3006 if (TREE_TYPE (newdecl
) == error_mark_node
)
3007 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3008 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3009 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3010 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3013 types_match
= comptypes (TREE_TYPE (newdecl
),
3014 TREE_TYPE (olddecl
),
3015 COMPARE_REDECLARATION
);
3021 /* If NEWDECL is `static' and an `extern' was seen previously,
3022 warn about it. OLDDECL is the previous declaration.
3024 Note that this does not apply to the C++ case of declaring
3025 a variable `extern const' and then later `const'.
3027 Don't complain about built-in functions, since they are beyond
3028 the user's control. */
3031 warn_extern_redeclared_static (newdecl
, olddecl
)
3032 tree newdecl
, olddecl
;
3034 static const char *explicit_extern_static_warning
3035 = "`%D' was declared `extern' and later `static'";
3036 static const char *implicit_extern_static_warning
3037 = "`%D' was declared implicitly `extern' and later `static'";
3041 if (TREE_CODE (newdecl
) == TYPE_DECL
3042 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3043 || TREE_CODE (newdecl
) == CONST_DECL
)
3046 /* Don't get confused by static member functions; that's a different
3048 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3049 && DECL_STATIC_FUNCTION_P (newdecl
))
3052 /* If the old declaration was `static', or the new one isn't, then
3053 then everything is OK. */
3054 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3057 /* It's OK to declare a builtin function as `static'. */
3058 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3059 && DECL_ARTIFICIAL (olddecl
))
3062 name
= DECL_ASSEMBLER_NAME (newdecl
);
3063 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3064 ? implicit_extern_static_warning
3065 : explicit_extern_static_warning
, newdecl
);
3066 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3069 /* Handle when a new declaration NEWDECL has the same name as an old
3070 one OLDDECL in the same binding contour. Prints an error message
3073 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3074 Otherwise, return 0. */
3077 duplicate_decls (newdecl
, olddecl
)
3078 tree newdecl
, olddecl
;
3080 unsigned olddecl_uid
= DECL_UID (olddecl
);
3081 int olddecl_friend
= 0, types_match
= 0;
3082 int new_defines_function
= 0;
3084 if (newdecl
== olddecl
)
3087 types_match
= decls_match (newdecl
, olddecl
);
3089 /* If either the type of the new decl or the type of the old decl is an
3090 error_mark_node, then that implies that we have already issued an
3091 error (earlier) for some bogus type specification, and in that case,
3092 it is rather pointless to harass the user with yet more error message
3093 about the same declaration, so just pretend the types match here. */
3094 if (TREE_TYPE (newdecl
) == error_mark_node
3095 || TREE_TYPE (olddecl
) == error_mark_node
)
3098 /* Check for redeclaration and other discrepancies. */
3099 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3100 && DECL_ARTIFICIAL (olddecl
))
3102 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3104 /* If you declare a built-in or predefined function name as static,
3105 the old definition is overridden, but optionally warn this was a
3106 bad choice of name. */
3107 if (! TREE_PUBLIC (newdecl
))
3110 cp_warning ("shadowing %s function `%#D'",
3111 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3113 /* Discard the old built-in function. */
3116 /* If the built-in is not ansi, then programs can override
3117 it even globally without an error. */
3118 else if (! DECL_BUILT_IN (olddecl
))
3119 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3123 cp_error ("declaration of `%#D'", newdecl
);
3124 cp_error ("conflicts with built-in declaration `%#D'",
3129 else if (!types_match
)
3131 if ((DECL_EXTERN_C_P (newdecl
)
3132 && DECL_EXTERN_C_P (olddecl
))
3133 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3134 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3136 /* A near match; override the builtin. */
3138 if (TREE_PUBLIC (newdecl
))
3140 cp_warning ("new declaration `%#D'", newdecl
);
3141 cp_warning ("ambiguates built-in declaration `%#D'",
3144 else if (warn_shadow
)
3145 cp_warning ("shadowing %s function `%#D'",
3146 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3150 /* Discard the old built-in function. */
3154 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3156 /* If a builtin function is redeclared as `static', merge
3157 the declarations, but make the original one static. */
3158 DECL_THIS_STATIC (olddecl
) = 1;
3159 TREE_PUBLIC (olddecl
) = 0;
3161 /* Make the old declaration consistent with the new one so
3162 that all remnants of the builtin-ness of this function
3163 will be banished. */
3164 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3165 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3166 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3167 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3171 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3173 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3174 && TREE_CODE (newdecl
) != TYPE_DECL
3175 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3176 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3177 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3178 && TREE_CODE (olddecl
) != TYPE_DECL
3179 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3180 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3183 /* We do nothing special here, because C++ does such nasty
3184 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3185 get shadowed, and know that if we need to find a TYPE_DECL
3186 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3187 slot of the identifier. */
3191 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3192 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3193 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3194 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3197 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3198 if (TREE_CODE (olddecl
) == TREE_LIST
)
3199 olddecl
= TREE_VALUE (olddecl
);
3200 cp_error_at ("previous declaration of `%#D'", olddecl
);
3202 /* New decl is completely inconsistent with the old one =>
3203 tell caller to replace the old one. */
3207 else if (!types_match
)
3209 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3210 /* These are certainly not duplicate declarations; they're
3211 from different scopes. */
3214 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3216 /* The name of a class template may not be declared to refer to
3217 any other template, class, function, object, namespace, value,
3218 or type in the same scope. */
3219 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3220 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3222 cp_error ("declaration of template `%#D'", newdecl
);
3223 cp_error_at ("conflicts with previous declaration `%#D'",
3226 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3227 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3228 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3229 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3230 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3231 DECL_TEMPLATE_PARMS (olddecl
)))
3233 cp_error ("new declaration `%#D'", newdecl
);
3234 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3238 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3240 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3242 cp_error ("declaration of C function `%#D' conflicts with",
3244 cp_error_at ("previous declaration `%#D' here", olddecl
);
3246 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3247 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3249 cp_error ("new declaration `%#D'", newdecl
);
3250 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3256 /* Already complained about this, so don't do so again. */
3257 else if (current_class_type
== NULL_TREE
3258 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3260 cp_error ("conflicting types for `%#D'", newdecl
);
3261 cp_error_at ("previous declaration as `%#D'", olddecl
);
3264 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3265 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3266 && (!DECL_TEMPLATE_INFO (newdecl
)
3267 || (DECL_TI_TEMPLATE (newdecl
)
3268 != DECL_TI_TEMPLATE (olddecl
))))
3269 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3270 && (!DECL_TEMPLATE_INFO (olddecl
)
3271 || (DECL_TI_TEMPLATE (olddecl
)
3272 != DECL_TI_TEMPLATE (newdecl
))))))
3273 /* It's OK to have a template specialization and a non-template
3274 with the same type, or to have specializations of two
3275 different templates with the same type. Note that if one is a
3276 specialization, and the other is an instantiation of the same
3277 template, that we do not exit at this point. That situation
3278 can occur if we instantiate a template class, and then
3279 specialize one of its methods. This situation is legal, but
3280 the declarations must be merged in the usual way. */
3282 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3283 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3284 && !DECL_USE_TEMPLATE (newdecl
))
3285 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3286 && !DECL_USE_TEMPLATE (olddecl
))))
3287 /* One of the declarations is a template instantiation, and the
3288 other is not a template at all. That's OK. */
3290 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3291 && DECL_NAMESPACE_ALIAS (newdecl
)
3292 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3293 /* Redeclaration of namespace alias, ignore it. */
3297 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3300 cp_error (errmsg
, newdecl
);
3301 if (DECL_NAME (olddecl
) != NULL_TREE
)
3302 cp_error_at ((DECL_INITIAL (olddecl
)
3303 && namespace_bindings_p ())
3304 ? "`%#D' previously defined here"
3305 : "`%#D' previously declared here", olddecl
);
3307 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3308 && DECL_INITIAL (olddecl
) != NULL_TREE
3309 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3310 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3312 /* Prototype decl follows defn w/o prototype. */
3313 cp_warning_at ("prototype for `%#D'", newdecl
);
3314 cp_warning_at ("follows non-prototype definition here", olddecl
);
3316 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3317 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3319 /* extern "C" int foo ();
3320 int foo () { bar (); }
3322 if (current_lang_stack
3323 == &VARRAY_TREE (current_lang_base
, 0))
3324 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3327 cp_error_at ("previous declaration of `%#D' with %L linkage",
3328 olddecl
, DECL_LANGUAGE (olddecl
));
3329 cp_error ("conflicts with new declaration with %L linkage",
3330 DECL_LANGUAGE (newdecl
));
3334 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3336 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3338 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3339 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3342 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3343 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3345 for (; t1
&& t1
!= void_list_node
;
3346 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3347 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3349 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3354 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3356 cp_pedwarn_at ("after previous specification in `%#D'",
3362 cp_error ("default argument given for parameter %d of `%#D'",
3364 cp_error_at ("after previous specification in `%#D'",
3369 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3370 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3372 cp_warning ("`%#D' was used before it was declared inline",
3374 cp_warning_at ("previous non-inline declaration here",
3380 /* If new decl is `static' and an `extern' was seen previously,
3382 warn_extern_redeclared_static (newdecl
, olddecl
);
3384 /* We have committed to returning 1 at this point. */
3385 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3387 /* Now that functions must hold information normally held
3388 by field decls, there is extra work to do so that
3389 declaration information does not get destroyed during
3391 if (DECL_VINDEX (olddecl
))
3392 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3393 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3394 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3395 if (DECL_CONTEXT (olddecl
))
3396 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3397 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3398 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3399 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3400 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3401 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3402 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3403 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3404 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3405 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3406 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3408 /* Optionally warn about more than one declaration for the same
3409 name, but don't warn about a function declaration followed by a
3411 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3412 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3413 /* Don't warn about extern decl followed by definition. */
3414 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3415 /* Don't warn about friends, let add_friend take care of it. */
3416 && ! DECL_FRIEND_P (newdecl
))
3418 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3419 cp_warning_at ("previous declaration of `%D'", olddecl
);
3423 /* Deal with C++: must preserve virtual function table size. */
3424 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3426 register tree newtype
= TREE_TYPE (newdecl
);
3427 register tree oldtype
= TREE_TYPE (olddecl
);
3429 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3430 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3432 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3433 CLASSTYPE_FRIEND_CLASSES (newtype
)
3434 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3437 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3440 /* Copy all the DECL_... slots specified in the new decl
3441 except for any that we copy here from the old type. */
3442 DECL_MACHINE_ATTRIBUTES (newdecl
)
3443 = merge_machine_decl_attributes (olddecl
, newdecl
);
3445 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3447 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3448 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3449 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3450 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3457 /* Automatically handles default parameters. */
3458 tree oldtype
= TREE_TYPE (olddecl
);
3461 /* Merge the data types specified in the two decls. */
3462 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3464 /* If common_type produces a non-typedef type, just use the old type. */
3465 if (TREE_CODE (newdecl
) == TYPE_DECL
3466 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3469 if (TREE_CODE (newdecl
) == VAR_DECL
)
3470 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3471 /* Do this after calling `common_type' so that default
3472 parameters don't confuse us. */
3473 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3474 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3475 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3477 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3478 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3479 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3480 TYPE_RAISES_EXCEPTIONS (oldtype
));
3482 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3483 && DECL_SOURCE_LINE (olddecl
) != 0
3485 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3486 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3488 cp_error ("declaration of `%F' throws different exceptions",
3490 cp_error_at ("than previous declaration `%F'", olddecl
);
3493 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3495 /* Lay the type out, unless already done. */
3496 if (! same_type_p (newtype
, oldtype
)
3497 && TREE_TYPE (newdecl
) != error_mark_node
3498 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3499 layout_type (TREE_TYPE (newdecl
));
3501 if ((TREE_CODE (newdecl
) == VAR_DECL
3502 || TREE_CODE (newdecl
) == PARM_DECL
3503 || TREE_CODE (newdecl
) == RESULT_DECL
3504 || TREE_CODE (newdecl
) == FIELD_DECL
3505 || TREE_CODE (newdecl
) == TYPE_DECL
)
3506 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3507 layout_decl (newdecl
, 0);
3509 /* Merge the type qualifiers. */
3510 if (TREE_READONLY (newdecl
))
3511 TREE_READONLY (olddecl
) = 1;
3512 if (TREE_THIS_VOLATILE (newdecl
))
3513 TREE_THIS_VOLATILE (olddecl
) = 1;
3515 /* Merge the initialization information. */
3516 if (DECL_INITIAL (newdecl
) == NULL_TREE
3517 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3519 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3520 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3521 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3522 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3523 && DECL_LANG_SPECIFIC (newdecl
)
3524 && DECL_LANG_SPECIFIC (olddecl
))
3525 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3528 /* Merge the section attribute.
3529 We want to issue an error if the sections conflict but that must be
3530 done later in decl_attributes since we are called before attributes
3532 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3533 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3535 /* Keep the old rtl since we can safely use it. */
3536 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3538 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3540 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3541 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3542 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3543 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3544 DECL_NO_LIMIT_STACK (newdecl
)
3545 |= DECL_NO_LIMIT_STACK (olddecl
);
3548 /* If cannot merge, then use the new type and qualifiers,
3549 and don't preserve the old rtl. */
3552 /* Clean out any memory we had of the old declaration. */
3553 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3555 TREE_VALUE (oldstatic
) = error_mark_node
;
3557 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3558 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3559 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3560 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3563 /* Merge the storage class information. */
3564 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3565 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3566 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3567 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3568 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3569 if (! DECL_EXTERNAL (olddecl
))
3570 DECL_EXTERNAL (newdecl
) = 0;
3572 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3574 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3575 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3576 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3577 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3578 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3579 /* Don't really know how much of the language-specific
3580 values we should copy from old to new. */
3581 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3582 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3583 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3584 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3585 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3587 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3588 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3589 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3590 DECL_BEFRIENDING_CLASSES (newdecl
)
3591 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3592 DECL_BEFRIENDING_CLASSES (olddecl
));
3595 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3597 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3598 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3600 /* If newdecl is not a specialization, then it is not a
3601 template-related function at all. And that means that we
3602 shoud have exited above, returning 0. */
3603 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3606 if (TREE_USED (olddecl
))
3607 /* From [temp.expl.spec]:
3609 If a template, a member template or the member of a class
3610 template is explicitly specialized then that
3611 specialization shall be declared before the first use of
3612 that specialization that would cause an implicit
3613 instantiation to take place, in every translation unit in
3614 which such a use occurs. */
3615 cp_error ("explicit specialization of %D after first use",
3618 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3620 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3622 /* If either decl says `inline', this fn is inline, unless its
3623 definition was passed already. */
3624 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3625 DECL_INLINE (olddecl
) = 1;
3626 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3630 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3631 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3632 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3634 if (! types_match
|| new_defines_function
)
3636 /* These need to be copied so that the names are available.
3637 Note that if the types do match, we'll preserve inline
3638 info and other bits, but if not, we won't. */
3639 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3640 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3642 if (new_defines_function
)
3643 /* If defining a function declared with other language
3644 linkage, use the previously declared language linkage. */
3645 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3646 else if (types_match
)
3648 /* If redeclaring a builtin function, and not a definition,
3649 it stays built in. */
3650 if (DECL_BUILT_IN (olddecl
))
3652 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3653 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3654 /* If we're keeping the built-in definition, keep the rtl,
3655 regardless of declaration matches. */
3656 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3659 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3661 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3662 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3663 /* Previously saved insns go together with
3664 the function's previous definition. */
3665 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3666 /* Don't clear out the arguments if we're redefining a function. */
3667 if (DECL_ARGUMENTS (olddecl
))
3668 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3672 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3674 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3677 /* Now preserve various other info from the definition. */
3678 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3679 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3680 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3681 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3683 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3687 function_size
= sizeof (struct tree_decl
);
3689 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3690 (char *) olddecl
+ sizeof (struct tree_common
),
3691 function_size
- sizeof (struct tree_common
));
3693 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3695 /* If newdecl is a template instantiation, it is possible that
3696 the following sequence of events has occurred:
3698 o A friend function was declared in a class template. The
3699 class template was instantiated.
3701 o The instantiation of the friend declaration was
3702 recorded on the instantiation list, and is newdecl.
3704 o Later, however, instantiate_class_template called pushdecl
3705 on the newdecl to perform name injection. But, pushdecl in
3706 turn called duplicate_decls when it discovered that another
3707 declaration of a global function with the same name already
3710 o Here, in duplicate_decls, we decided to clobber newdecl.
3712 If we're going to do that, we'd better make sure that
3713 olddecl, and not newdecl, is on the list of
3714 instantiations so that if we try to do the instantiation
3715 again we won't get the clobbered declaration. */
3717 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3718 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3720 for (; decls
; decls
= TREE_CHAIN (decls
))
3721 if (TREE_VALUE (decls
) == newdecl
)
3722 TREE_VALUE (decls
) = olddecl
;
3727 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3728 (char *) olddecl
+ sizeof (struct tree_common
),
3729 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3730 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3733 DECL_UID (olddecl
) = olddecl_uid
;
3735 DECL_FRIEND_P (olddecl
) = 1;
3737 /* NEWDECL contains the merged attribute lists.
3738 Update OLDDECL to be the same. */
3739 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3744 /* Record a decl-node X as belonging to the current lexical scope.
3745 Check for errors (such as an incompatible declaration for the same
3746 name already seen in the same scope).
3748 Returns either X or an old decl for the same name.
3749 If an old decl is returned, it may have been smashed
3750 to agree with what X says. */
3758 int need_new_binding
;
3760 /* We shouldn't be calling pushdecl when we're generating RTL for a
3761 function that we already did semantic analysis on previously. */
3762 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3765 need_new_binding
= 1;
3767 if (DECL_TEMPLATE_PARM_P (x
))
3768 /* Template parameters have no context; they are not X::T even
3769 when declared within a class or namespace. */
3773 if (current_function_decl
&& x
!= current_function_decl
3774 /* A local declaration for a function doesn't constitute
3776 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3777 /* A local declaration for an `extern' variable is in the
3778 scope of the current namespace, not the current
3780 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3781 && !DECL_CONTEXT (x
))
3782 DECL_CONTEXT (x
) = current_function_decl
;
3784 /* If this is the declaration for a namespace-scope function,
3785 but the declaration itself is in a local scope, mark the
3787 if (TREE_CODE (x
) == FUNCTION_DECL
3788 && DECL_NAMESPACE_SCOPE_P (x
)
3789 && current_function_decl
3790 && x
!= current_function_decl
)
3791 DECL_LOCAL_FUNCTION_P (x
) = 1;
3794 name
= DECL_NAME (x
);
3797 int different_binding_level
= 0;
3799 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3800 name
= TREE_OPERAND (name
, 0);
3802 /* In case this decl was explicitly namespace-qualified, look it
3803 up in its namespace context. */
3804 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3805 && namespace_bindings_p ())
3806 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3808 t
= lookup_name_current_level (name
);
3810 /* [basic.link] If there is a visible declaration of an entity
3811 with linkage having the same name and type, ignoring entities
3812 declared outside the innermost enclosing namespace scope, the
3813 block scope declaration declares that same entity and
3814 receives the linkage of the previous declaration. */
3815 if (! t
&& current_function_decl
&& x
!= current_function_decl
3816 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3817 && DECL_EXTERNAL (x
))
3819 /* Look in block scope. */
3820 t
= IDENTIFIER_VALUE (name
);
3821 /* Or in the innermost namespace. */
3823 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3824 /* Does it have linkage? Note that if this isn't a DECL, it's an
3825 OVERLOAD, which is OK. */
3826 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3829 different_binding_level
= 1;
3832 /* If we are declaring a function, and the result of name-lookup
3833 was an OVERLOAD, look for an overloaded instance that is
3834 actually the same as the function we are declaring. (If
3835 there is one, we have to merge our declaration with the
3836 previous declaration.) */
3837 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3841 if (TREE_CODE (x
) == FUNCTION_DECL
)
3842 for (match
= t
; match
; match
= OVL_NEXT (match
))
3844 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3845 == DECL_ASSEMBLER_NAME (x
))
3849 /* Just choose one. */
3853 t
= OVL_CURRENT (match
);
3858 if (t
== error_mark_node
)
3860 /* error_mark_node is 0 for a while during initialization! */
3862 cp_error_at ("`%#D' used prior to declaration", x
);
3864 else if (t
!= NULL_TREE
)
3866 if (different_binding_level
)
3868 if (decls_match (x
, t
))
3869 /* The standard only says that the local extern
3870 inherits linkage from the previous decl; in
3871 particular, default args are not shared. It would
3872 be nice to propagate inlining info, though. FIXME. */
3873 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3875 else if (TREE_CODE (t
) == PARM_DECL
)
3877 if (DECL_CONTEXT (t
) == NULL_TREE
)
3878 fatal ("parse errors have confused me too much");
3880 /* Check for duplicate params. */
3881 if (duplicate_decls (x
, t
))
3884 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3885 || DECL_FUNCTION_TEMPLATE_P (x
))
3886 && is_overloaded_fn (t
))
3887 /* Don't do anything just yet. */;
3888 else if (t
== wchar_decl_node
)
3890 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3891 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3893 /* Throw away the redeclaration. */
3896 else if (TREE_CODE (t
) != TREE_CODE (x
))
3898 if (duplicate_decls (x
, t
))
3901 else if (duplicate_decls (x
, t
))
3903 if (TREE_CODE (t
) == TYPE_DECL
)
3904 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3905 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3906 check_default_args (t
);
3910 else if (DECL_MAIN_P (x
))
3912 /* A redeclaration of main, but not a duplicate of the
3917 This function shall not be overloaded. */
3918 cp_error_at ("invalid redeclaration of `%D'", t
);
3919 cp_error ("as `%D'", x
);
3920 /* We don't try to push this declaration since that
3926 check_template_shadow (x
);
3928 /* If this is a function conjured up by the backend, massage it
3929 so it looks friendly. */
3930 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3932 retrofit_lang_decl (x
);
3933 DECL_LANGUAGE (x
) = lang_c
;
3936 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3938 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3941 if (!namespace_bindings_p ())
3942 /* We do not need to create a binding for this name;
3943 push_overloaded_decl will have already done so if
3945 need_new_binding
= 0;
3947 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3949 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3951 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3955 /* If declaring a type as a typedef, copy the type (unless we're
3956 at line 0), and install this TYPE_DECL as the new type's typedef
3957 name. See the extensive comment in ../c-decl.c (pushdecl). */
3958 if (TREE_CODE (x
) == TYPE_DECL
)
3960 tree type
= TREE_TYPE (x
);
3961 if (DECL_SOURCE_LINE (x
) == 0)
3963 if (TYPE_NAME (type
) == 0)
3964 TYPE_NAME (type
) = x
;
3966 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3967 /* We don't want to copy the type when all we're
3968 doing is making a TYPE_DECL for the purposes of
3970 && (!TYPE_NAME (type
)
3971 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3973 DECL_ORIGINAL_TYPE (x
) = type
;
3974 type
= build_type_copy (type
);
3975 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3976 TYPE_NAME (type
) = x
;
3977 TREE_TYPE (x
) = type
;
3980 if (type
!= error_mark_node
3982 && TYPE_IDENTIFIER (type
))
3983 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3984 current_binding_level
);
3988 /* Multiple external decls of the same identifier ought to match.
3990 We get warnings about inline functions where they are defined.
3991 We get warnings about other functions from push_overloaded_decl.
3993 Avoid duplicate warnings where they are used. */
3994 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3998 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3999 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4000 decl
= OVL_FUNCTION (decl
);
4002 if (decl
&& decl
!= error_mark_node
4003 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4004 /* If different sort of thing, we already gave an error. */
4005 && TREE_CODE (decl
) == TREE_CODE (x
)
4006 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4008 cp_pedwarn ("type mismatch with previous external decl", x
);
4009 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4013 /* This name is new in its binding level.
4014 Install the new declaration and return it. */
4015 if (namespace_bindings_p ())
4017 /* Install a global value. */
4019 /* If the first global decl has external linkage,
4020 warn if we later see static one. */
4021 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4022 TREE_PUBLIC (name
) = 1;
4024 /* Bind the mangled name for the entity. In the future, we
4025 should not need to do this; mangled names are an
4026 implementation detail of which the front-end should not
4027 need to be aware. */
4028 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4030 /* For an ordinary function, we create a binding from
4031 the mangled name (i.e., NAME) to the DECL. But, for
4032 an `extern "C"' function, the mangled name and the
4033 ordinary name are the same so we need not do this. */
4034 && !DECL_EXTERN_C_FUNCTION_P (x
))
4038 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4039 || TREE_CODE (x
) == NAMESPACE_DECL
)
4040 mangled_name
= name
;
4042 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4044 if (TREE_CODE (x
) == FUNCTION_DECL
)
4046 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4047 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4048 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4051 /* Don't forget if the function was used via an implicit decl. */
4052 if (IDENTIFIER_IMPLICIT_DECL (name
)
4053 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4056 /* Don't forget if its address was taken in that way. */
4057 if (IDENTIFIER_IMPLICIT_DECL (name
)
4058 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4059 TREE_ADDRESSABLE (x
) = 1;
4061 /* Warn about mismatches against previous implicit decl. */
4062 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4063 /* If this real decl matches the implicit, don't complain. */
4064 && ! (TREE_CODE (x
) == FUNCTION_DECL
4065 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4067 ("`%D' was previously implicitly declared to return `int'", x
);
4069 /* If new decl is `static' and an `extern' was seen previously,
4071 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4072 warn_extern_redeclared_static (x
, t
);
4076 /* Here to install a non-global value. */
4077 tree oldlocal
= IDENTIFIER_VALUE (name
);
4078 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4080 if (need_new_binding
)
4082 push_local_binding (name
, x
, 0);
4083 /* Because push_local_binding will hook X on to the
4084 current_binding_level's name list, we don't want to
4085 do that again below. */
4086 need_new_binding
= 0;
4089 /* If this is a TYPE_DECL, push it into the type value slot. */
4090 if (TREE_CODE (x
) == TYPE_DECL
)
4091 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4092 current_binding_level
);
4094 /* Clear out any TYPE_DECL shadowed by a namespace so that
4095 we won't think this is a type. The C struct hack doesn't
4096 go through namespaces. */
4097 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4098 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4099 current_binding_level
);
4106 && TREE_CODE (oldlocal
) == VAR_DECL
4107 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4108 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4110 if (oldlocal
== NULL_TREE
)
4111 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4114 /* If this is an extern function declaration, see if we
4115 have a global definition or declaration for the function. */
4116 if (oldlocal
== NULL_TREE
4117 && DECL_EXTERNAL (x
)
4118 && oldglobal
!= NULL_TREE
4119 && TREE_CODE (x
) == FUNCTION_DECL
4120 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4122 /* We have one. Their types must agree. */
4123 if (decls_match (x
, oldglobal
))
4127 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4128 cp_warning_at ("global declaration `%#D'", oldglobal
);
4131 /* If we have a local external declaration,
4132 and no file-scope declaration has yet been seen,
4133 then if we later have a file-scope decl it must not be static. */
4134 if (oldlocal
== NULL_TREE
4135 && oldglobal
== NULL_TREE
4136 && DECL_EXTERNAL (x
)
4138 TREE_PUBLIC (name
) = 1;
4140 /* Warn if shadowing an argument at the top level of the body. */
4141 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4142 /* Inline decls shadow nothing. */
4143 && !DECL_FROM_INLINE (x
)
4144 && TREE_CODE (oldlocal
) == PARM_DECL
4145 /* Don't complain if it's from an enclosing function. */
4146 && DECL_CONTEXT (oldlocal
) == current_function_decl
4147 && TREE_CODE (x
) != PARM_DECL
)
4149 /* Go to where the parms should be and see if we
4151 struct binding_level
*b
= current_binding_level
->level_chain
;
4157 if (b
->parm_flag
== 1)
4158 cp_error ("declaration of `%#D' shadows a parameter", name
);
4161 /* Maybe warn if shadowing something else. */
4162 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4163 /* Inline decls shadow nothing. */
4164 && !DECL_FROM_INLINE (x
)
4165 /* No shadow warnings for internally generated vars. */
4166 && ! DECL_ARTIFICIAL (x
)
4167 /* No shadow warnings for vars made for inlining. */
4168 && ! DECL_FROM_INLINE (x
))
4170 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4171 warning ("declaration of `%s' shadows a parameter",
4172 IDENTIFIER_POINTER (name
));
4173 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4174 && current_class_ptr
4175 && !TREE_STATIC (name
))
4176 warning ("declaration of `%s' shadows a member of `this'",
4177 IDENTIFIER_POINTER (name
));
4178 else if (oldlocal
!= NULL_TREE
)
4179 warning ("declaration of `%s' shadows previous local",
4180 IDENTIFIER_POINTER (name
));
4181 else if (oldglobal
!= NULL_TREE
)
4182 /* XXX shadow warnings in outer-more namespaces */
4183 warning ("declaration of `%s' shadows global declaration",
4184 IDENTIFIER_POINTER (name
));
4188 if (TREE_CODE (x
) == FUNCTION_DECL
)
4189 check_default_args (x
);
4191 /* Keep count of variables in this level with incomplete type. */
4192 if (TREE_CODE (x
) == VAR_DECL
4193 && TREE_TYPE (x
) != error_mark_node
4194 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4195 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4196 /* RTTI TD entries are created while defining the type_info. */
4197 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4198 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4200 if (namespace_bindings_p ())
4201 namespace_scope_incomplete
4202 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4204 current_binding_level
->incomplete
4205 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4209 if (need_new_binding
)
4210 add_decl_to_level (x
,
4211 DECL_NAMESPACE_SCOPE_P (x
)
4212 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4213 : current_binding_level
);
4218 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4219 caller to set DECL_CONTEXT properly. */
4222 pushdecl_with_scope (x
, level
)
4224 struct binding_level
*level
;
4226 register struct binding_level
*b
;
4227 tree function_decl
= current_function_decl
;
4229 current_function_decl
= NULL_TREE
;
4230 if (level
->parm_flag
== 2)
4232 b
= class_binding_level
;
4233 class_binding_level
= level
;
4234 pushdecl_class_level (x
);
4235 class_binding_level
= b
;
4239 b
= current_binding_level
;
4240 current_binding_level
= level
;
4242 current_binding_level
= b
;
4244 current_function_decl
= function_decl
;
4248 /* Like pushdecl, only it places X in the current namespace,
4252 pushdecl_namespace_level (x
)
4255 register struct binding_level
*b
= current_binding_level
;
4258 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4260 /* Now, the type_shadowed stack may screw us. Munge it so it does
4262 if (TREE_CODE (x
) == TYPE_DECL
)
4264 tree name
= DECL_NAME (x
);
4266 tree
*ptr
= (tree
*)0;
4267 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4269 tree shadowed
= b
->type_shadowed
;
4270 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4271 if (TREE_PURPOSE (shadowed
) == name
)
4273 ptr
= &TREE_VALUE (shadowed
);
4274 /* Can't break out of the loop here because sometimes
4275 a binding level will have duplicate bindings for
4276 PT names. It's gross, but I haven't time to fix it. */
4279 newval
= TREE_TYPE (x
);
4280 if (ptr
== (tree
*)0)
4282 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4283 up here if this is changed to an assertion. --KR */
4284 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4294 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4298 pushdecl_top_level (x
)
4301 push_to_top_level ();
4302 x
= pushdecl_namespace_level (x
);
4303 pop_from_top_level ();
4307 /* Make the declaration of X appear in CLASS scope. */
4310 pushdecl_class_level (x
)
4313 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4314 scope looks for the pre-mangled name. */
4317 if (TREE_CODE (x
) == OVERLOAD
)
4318 x
= OVL_CURRENT (x
);
4319 name
= DECL_NAME (x
);
4323 push_class_level_binding (name
, x
);
4324 if (TREE_CODE (x
) == TYPE_DECL
)
4325 set_identifier_type_value (name
, TREE_TYPE (x
));
4327 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4331 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4334 pushdecl_class_level (f
);
4338 /* Enter DECL into the symbol table, if that's appropriate. Returns
4339 DECL, or a modified version thereof. */
4342 maybe_push_decl (decl
)
4345 tree type
= TREE_TYPE (decl
);
4347 /* Add this decl to the current binding level, but not if it comes
4348 from another scope, e.g. a static member variable. TEM may equal
4349 DECL or it may be a previous decl of the same name. */
4350 if (decl
== error_mark_node
4351 || (TREE_CODE (decl
) != PARM_DECL
4352 && DECL_CONTEXT (decl
) != NULL_TREE
4353 /* Definitions of namespace members outside their namespace are
4355 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4356 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4357 || TREE_CODE (type
) == UNKNOWN_TYPE
4358 /* The declaration of a template specialization does not affect
4359 the functions available for overload resolution, so we do not
4361 || (TREE_CODE (decl
) == FUNCTION_DECL
4362 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4365 return pushdecl (decl
);
4368 /* Make the declaration(s) of X appear in CLASS scope
4369 under the name NAME. */
4372 push_class_level_binding (name
, x
)
4377 /* The class_binding_level will be NULL if x is a template
4378 parameter name in a member template. */
4379 if (!class_binding_level
)
4382 /* Make sure that this new member does not have the same name
4383 as a template parameter. */
4384 if (TYPE_BEING_DEFINED (current_class_type
))
4385 check_template_shadow (x
);
4387 /* If this declaration shadows a declaration from an enclosing
4388 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4389 we leave this class. Record the shadowed declaration here. */
4390 binding
= IDENTIFIER_BINDING (name
);
4392 && ((TREE_CODE (x
) == OVERLOAD
4393 && BINDING_VALUE (binding
)
4394 && is_overloaded_fn (BINDING_VALUE (binding
)))
4395 || INHERITED_VALUE_BINDING_P (binding
)))
4400 /* If the old binding was from a base class, and was for a tag
4401 name, slide it over to make room for the new binding. The
4402 old binding is still visible if explicitly qualified with a
4404 if (INHERITED_VALUE_BINDING_P (binding
)
4405 && BINDING_VALUE (binding
)
4406 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4407 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4408 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4410 old_decl
= BINDING_TYPE (binding
);
4411 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4412 BINDING_VALUE (binding
) = NULL_TREE
;
4413 INHERITED_VALUE_BINDING_P (binding
) = 0;
4416 old_decl
= BINDING_VALUE (binding
);
4418 /* There was already a binding for X containing fewer
4419 functions than are named in X. Find the previous
4420 declaration of X on the class-shadowed list, and update it. */
4421 for (shadow
= class_binding_level
->class_shadowed
;
4423 shadow
= TREE_CHAIN (shadow
))
4424 if (TREE_PURPOSE (shadow
) == name
4425 && TREE_TYPE (shadow
) == old_decl
)
4427 BINDING_VALUE (binding
) = x
;
4428 INHERITED_VALUE_BINDING_P (binding
) = 0;
4429 TREE_TYPE (shadow
) = x
;
4434 /* If we didn't replace an existing binding, put the binding on the
4435 stack of bindings for the identifier, and update
4436 IDENTIFIER_CLASS_VALUE. */
4437 if (push_class_binding (name
, x
))
4439 class_binding_level
->class_shadowed
4440 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4441 class_binding_level
->class_shadowed
);
4442 /* Record the value we are binding NAME to so that we can know
4443 what to pop later. */
4444 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4448 /* Insert another USING_DECL into the current binding level, returning
4449 this declaration. If this is a redeclaration, do nothing, and
4450 return NULL_TREE if this not in namespace scope (in namespace
4451 scope, a using decl might extend any previous bindings). */
4454 push_using_decl (scope
, name
)
4460 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4461 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4462 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4463 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4466 return namespace_bindings_p () ? decl
: NULL_TREE
;
4467 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4468 DECL_INITIAL (decl
) = scope
;
4469 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4470 current_binding_level
->usings
= decl
;
4474 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4475 changed (i.e. there was already a directive), or the fresh
4476 TREE_LIST otherwise. */
4479 push_using_directive (used
)
4482 tree ud
= current_binding_level
->using_directives
;
4483 tree iter
, ancestor
;
4485 /* Check if we already have this. */
4486 if (purpose_member (used
, ud
) != NULL_TREE
)
4489 /* Recursively add all namespaces used. */
4490 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4491 push_using_directive (TREE_PURPOSE (iter
));
4493 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4494 ud
= current_binding_level
->using_directives
;
4495 ud
= tree_cons (used
, ancestor
, ud
);
4496 current_binding_level
->using_directives
= ud
;
4500 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4501 other definitions already in place. We get around this by making
4502 the value of the identifier point to a list of all the things that
4503 want to be referenced by that name. It is then up to the users of
4504 that name to decide what to do with that list.
4506 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4507 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4509 FLAGS is a bitwise-or of the following values:
4510 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4512 PUSH_USING: DECL is being pushed as the result of a using
4515 The value returned may be a previous declaration if we guessed wrong
4516 about what language DECL should belong to (C or C++). Otherwise,
4517 it's always DECL (and never something that's not a _DECL). */
4520 push_overloaded_decl (decl
, flags
)
4524 tree name
= DECL_NAME (decl
);
4527 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4530 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4532 old
= lookup_name_current_level (name
);
4536 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4538 tree t
= TREE_TYPE (old
);
4539 if (IS_AGGR_TYPE (t
) && warn_shadow
4540 && (! DECL_IN_SYSTEM_HEADER (decl
)
4541 || ! DECL_IN_SYSTEM_HEADER (old
)))
4542 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4545 else if (is_overloaded_fn (old
))
4549 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4551 tree fn
= OVL_CURRENT (tmp
);
4553 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4554 && !(flags
& PUSH_USING
)
4555 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4556 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4557 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4560 if (duplicate_decls (decl
, fn
))
4564 else if (old
== error_mark_node
)
4565 /* Ignore the undefined symbol marker. */
4569 cp_error_at ("previous non-function declaration `%#D'", old
);
4570 cp_error ("conflicts with function declaration `%#D'", decl
);
4575 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4577 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4578 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4580 new_binding
= ovl_cons (decl
, old
);
4581 if (flags
& PUSH_USING
)
4582 OVL_USED (new_binding
) = 1;
4585 /* NAME is not ambiguous. */
4589 set_namespace_binding (name
, current_namespace
, new_binding
);
4592 /* We only create an OVERLOAD if there was a previous binding at
4593 this level, or if decl is a template. In the former case, we
4594 need to remove the old binding and replace it with the new
4595 binding. We must also run through the NAMES on the binding
4596 level where the name was bound to update the chain. */
4598 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4602 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4604 d
= &TREE_CHAIN (*d
))
4606 || (TREE_CODE (*d
) == TREE_LIST
4607 && TREE_VALUE (*d
) == old
))
4609 if (TREE_CODE (*d
) == TREE_LIST
)
4610 /* Just replace the old binding with the new. */
4611 TREE_VALUE (*d
) = new_binding
;
4613 /* Build a TREE_LIST to wrap the OVERLOAD. */
4614 *d
= tree_cons (NULL_TREE
, new_binding
,
4617 /* And update the CPLUS_BINDING node. */
4618 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4623 /* We should always find a previous binding in this case. */
4624 my_friendly_abort (0);
4627 /* Install the new binding. */
4628 push_local_binding (name
, new_binding
, flags
);
4634 /* Generate an implicit declaration for identifier FUNCTIONID
4635 as a function of type int (). Print a warning if appropriate. */
4638 implicitly_declare (functionid
)
4643 /* We used to reuse an old implicit decl here,
4644 but this loses with inline functions because it can clobber
4645 the saved decl chains. */
4646 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4648 DECL_EXTERNAL (decl
) = 1;
4649 TREE_PUBLIC (decl
) = 1;
4651 /* ISO standard says implicit declarations are in the innermost block.
4652 So we record the decl in the standard fashion. */
4654 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4657 /* Only one warning per identifier. */
4658 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4660 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4663 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4668 /* Return zero if the declaration NEWDECL is valid
4669 when the declaration OLDDECL (assumed to be for the same name)
4670 has already been seen.
4671 Otherwise return an error message format string with a %s
4672 where the identifier should go. */
4675 redeclaration_error_message (newdecl
, olddecl
)
4676 tree newdecl
, olddecl
;
4678 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4680 /* Because C++ can put things into name space for free,
4681 constructs like "typedef struct foo { ... } foo"
4682 would look like an erroneous redeclaration. */
4683 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4686 return "redefinition of `%#D'";
4688 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4690 /* If this is a pure function, its olddecl will actually be
4691 the original initialization to `0' (which we force to call
4692 abort()). Don't complain about redefinition in this case. */
4693 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4696 /* If both functions come from different namespaces, this is not
4697 a redeclaration - this is a conflict with a used function. */
4698 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4699 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4700 return "`%D' conflicts with used function";
4702 /* We'll complain about linkage mismatches in
4703 warn_extern_redeclared_static. */
4705 /* Defining the same name twice is no good. */
4706 if (DECL_INITIAL (olddecl
) != NULL_TREE
4707 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4709 if (DECL_NAME (olddecl
) == NULL_TREE
)
4710 return "`%#D' not declared in class";
4712 return "redefinition of `%#D'";
4716 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4718 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4719 && (DECL_TEMPLATE_RESULT (newdecl
)
4720 != DECL_TEMPLATE_RESULT (olddecl
))
4721 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4722 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4723 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4724 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4725 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4726 return "redefinition of `%#D'";
4729 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4731 /* Objects declared at top level: */
4732 /* If at least one is a reference, it's ok. */
4733 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4735 /* Reject two definitions. */
4736 return "redefinition of `%#D'";
4740 /* Objects declared with block scope: */
4741 /* Reject two definitions, and reject a definition
4742 together with an external reference. */
4743 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4744 return "redeclaration of `%#D'";
4749 /* Create a new label, named ID. */
4752 make_label_decl (id
, local_p
)
4758 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4760 /* Make sure every label has an rtx. */
4763 DECL_CONTEXT (decl
) = current_function_decl
;
4764 DECL_MODE (decl
) = VOIDmode
;
4765 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4767 /* Say where one reference is to the label, for the sake of the
4768 error if it is not defined. */
4769 DECL_SOURCE_LINE (decl
) = lineno
;
4770 DECL_SOURCE_FILE (decl
) = input_filename
;
4772 /* Record the fact that this identifier is bound to this label. */
4773 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4778 /* Record this label on the list of used labels so that we can check
4779 at the end of the function to see whether or not the label was
4780 actually defined, and so we can check when the label is defined whether
4781 this use is valid. */
4787 if (named_label_uses
== NULL
4788 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4789 || named_label_uses
->label_decl
!= decl
)
4791 struct named_label_use_list
*new_ent
;
4792 new_ent
= ((struct named_label_use_list
*)
4793 ggc_alloc (sizeof (struct named_label_use_list
)));
4794 new_ent
->label_decl
= decl
;
4795 new_ent
->names_in_scope
= current_binding_level
->names
;
4796 new_ent
->binding_level
= current_binding_level
;
4797 new_ent
->lineno_o_goto
= lineno
;
4798 new_ent
->filename_o_goto
= input_filename
;
4799 new_ent
->next
= named_label_uses
;
4800 named_label_uses
= new_ent
;
4804 /* Look for a label named ID in the current function. If one cannot
4805 be found, create one. (We keep track of used, but undefined,
4806 labels, and complain about them at the end of a function.) */
4813 struct named_label_list
*ent
;
4815 /* You can't use labels at global scope. */
4816 if (current_function_decl
== NULL_TREE
)
4818 error ("label `%s' referenced outside of any function",
4819 IDENTIFIER_POINTER (id
));
4823 /* See if we've already got this label. */
4824 decl
= IDENTIFIER_LABEL_VALUE (id
);
4825 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4828 /* Record this label on the list of labels used in this function.
4829 We do this before calling make_label_decl so that we get the
4830 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4831 ent
= ((struct named_label_list
*)
4832 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4833 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4834 ent
->next
= named_labels
;
4837 /* We need a new label. */
4838 decl
= make_label_decl (id
, /*local_p=*/0);
4840 /* Now fill in the information we didn't have before. */
4841 ent
->label_decl
= decl
;
4846 /* Declare a local label named ID. */
4849 declare_local_label (id
)
4854 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4855 this scope we can restore the old value of
4856 IDENTIFIER_TYPE_VALUE. */
4857 current_binding_level
->shadowed_labels
4858 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4859 current_binding_level
->shadowed_labels
);
4860 /* Look for the label. */
4861 decl
= make_label_decl (id
, /*local_p=*/1);
4862 /* Now fill in the information we didn't have before. */
4863 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4868 /* Returns nonzero if it is ill-formed to jump past the declaration of
4869 DECL. Returns 2 if it's also a real problem. */
4872 decl_jump_unsafe (decl
)
4875 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4878 if (DECL_INITIAL (decl
) == NULL_TREE
4879 && pod_type_p (TREE_TYPE (decl
)))
4882 /* This is really only important if we're crossing an initialization.
4883 The POD stuff is just pedantry; why should it matter if the class
4884 contains a field of pointer to member type? */
4885 if (DECL_INITIAL (decl
)
4886 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4891 /* Check that a single previously seen jump to a newly defined label
4892 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4893 the jump context; NAMES are the names in scope in LEVEL at the jump
4894 context; FILE and LINE are the source position of the jump or 0. */
4897 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4899 struct binding_level
*level
;
4906 struct binding_level
*b
= current_binding_level
;
4907 for (; b
; b
= b
->level_chain
)
4909 tree new_decls
= b
->names
;
4910 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4911 for (; new_decls
!= old_decls
;
4912 new_decls
= TREE_CHAIN (new_decls
))
4914 int problem
= decl_jump_unsafe (new_decls
);
4921 cp_pedwarn ("jump to label `%D'", decl
);
4923 pedwarn ("jump to case label");
4926 pedwarn_with_file_and_line (file
, line
, " from here");
4930 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4931 /* Can't skip init of __exception_info. */
4932 cp_error_at (" enters catch block", new_decls
);
4933 else if (problem
> 1)
4934 cp_error_at (" crosses initialization of `%#D'",
4937 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4943 if (b
->eh_region
&& ! saw_eh
)
4948 cp_pedwarn ("jump to label `%D'", decl
);
4950 pedwarn ("jump to case label");
4953 pedwarn_with_file_and_line (file
, line
, " from here");
4956 error (" enters try block");
4963 check_previous_goto (use
)
4964 struct named_label_use_list
*use
;
4966 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4967 use
->names_in_scope
, use
->filename_o_goto
,
4968 use
->lineno_o_goto
);
4972 check_switch_goto (level
)
4973 struct binding_level
*level
;
4975 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
4978 /* Check that any previously seen jumps to a newly defined label DECL
4979 are OK. Called by define_label. */
4982 check_previous_gotos (decl
)
4985 struct named_label_use_list
**usep
;
4987 if (! TREE_USED (decl
))
4990 for (usep
= &named_label_uses
; *usep
; )
4992 struct named_label_use_list
*use
= *usep
;
4993 if (use
->label_decl
== decl
)
4995 check_previous_goto (use
);
4999 usep
= &(use
->next
);
5003 /* Check that a new jump to a label DECL is OK. Called by
5004 finish_goto_stmt. */
5012 struct named_label_list
*lab
;
5014 /* We can't know where a computed goto is jumping. So we assume
5016 if (! DECL_P (decl
))
5019 /* If the label hasn't been defined yet, defer checking. */
5020 if (! DECL_INITIAL (decl
))
5026 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5027 if (decl
== lab
->label_decl
)
5030 /* If the label is not on named_labels it's a gcc local label, so
5031 it must be in an outer scope, so jumping to it is always OK. */
5035 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5037 cp_pedwarn_at ("jump to label `%D'", decl
);
5038 pedwarn (" from here");
5042 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5044 tree b
= TREE_VALUE (bad
);
5045 int u
= decl_jump_unsafe (b
);
5047 if (u
> 1 && DECL_ARTIFICIAL (b
))
5048 /* Can't skip init of __exception_info. */
5049 cp_error_at (" enters catch block", b
);
5051 cp_error_at (" skips initialization of `%#D'", b
);
5053 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5057 error (" enters try block");
5060 /* Define a label, specifying the location in the source file.
5061 Return the LABEL_DECL node for the label, if the definition is valid.
5062 Otherwise return 0. */
5065 define_label (filename
, line
, name
)
5066 const char *filename
;
5070 tree decl
= lookup_label (name
);
5071 struct named_label_list
*ent
;
5072 register struct binding_level
*p
;
5074 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5075 if (ent
->label_decl
== decl
)
5078 /* After labels, make any new cleanups in the function go into their
5079 own new (temporary) binding contour. */
5080 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5081 p
->more_cleanups_ok
= 0;
5083 if (name
== get_identifier ("wchar_t"))
5084 cp_pedwarn ("label named wchar_t");
5086 if (DECL_INITIAL (decl
) != NULL_TREE
)
5088 cp_error ("duplicate label `%D'", decl
);
5093 /* Mark label as having been defined. */
5094 DECL_INITIAL (decl
) = error_mark_node
;
5095 /* Say where in the source. */
5096 DECL_SOURCE_FILE (decl
) = filename
;
5097 DECL_SOURCE_LINE (decl
) = line
;
5100 ent
->names_in_scope
= current_binding_level
->names
;
5101 ent
->binding_level
= current_binding_level
;
5103 check_previous_gotos (decl
);
5104 current_function_return_value
= NULL_TREE
;
5111 struct binding_level
*level
;
5112 struct cp_switch
*next
;
5113 /* The SWITCH_STMT being built. */
5115 /* A splay-tree mapping the low element of a case range to the high
5116 element, or NULL_TREE if there is no high element. Used to
5117 determine whether or not a new case label duplicates an old case
5118 label. We need a tree, rather than simply a hash table, because
5119 of the GNU case range extension. */
5123 /* A stack of the currently active switch statements. The innermost
5124 switch statement is on the top of the stack. There is no need to
5125 mark the stack for garbage collection because it is only active
5126 during the processing of the body of a function, and we never
5127 collect at that point. */
5129 static struct cp_switch
*switch_stack
;
5131 /* Called right after a switch-statement condition is parsed.
5132 SWITCH_STMT is the switch statement being parsed. */
5135 push_switch (switch_stmt
)
5139 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5140 p
->level
= current_binding_level
;
5141 p
->next
= switch_stack
;
5142 p
->switch_stmt
= switch_stmt
;
5143 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5150 struct cp_switch
*cs
;
5153 splay_tree_delete (cs
->cases
);
5154 switch_stack
= switch_stack
->next
;
5158 /* Note that we've seen a definition of a case label, and complain if this
5159 is a bad place for one. */
5162 finish_case_label (low_value
, high_value
)
5167 register struct binding_level
*p
;
5172 error ("case label not within a switch statement");
5174 cp_error ("case label `%E' not within a switch statement",
5177 error ("`default' label not within a switch statement");
5181 if (processing_template_decl
)
5185 /* For templates, just add the case label; we'll do semantic
5186 analysis at instantiation-time. */
5187 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5188 return add_stmt (build_case_label (low_value
, high_value
, label
));
5191 /* Find the condition on which this switch statement depends. */
5192 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5193 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5194 cond
= TREE_VALUE (cond
);
5196 r
= c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5197 if (r
== error_mark_node
)
5200 check_switch_goto (switch_stack
->level
);
5202 /* After labels, make any new cleanups in the function go into their
5203 own new (temporary) binding contour. */
5204 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5205 p
->more_cleanups_ok
= 0;
5206 current_function_return_value
= NULL_TREE
;
5211 /* Return the list of declarations of the current level.
5212 Note that this list is in reverse order unless/until
5213 you nreverse it; and when you do nreverse it, you must
5214 store the result back using `storedecls' or you will lose. */
5219 return current_binding_level
->names
;
5222 /* Return the list of type-tags (for structs, etc) of the current level. */
5227 return current_binding_level
->tags
;
5230 /* Store the list of declarations of the current level.
5231 This is done for the parameter declarations of a function being defined,
5232 after they are modified in the light of any missing parameters. */
5238 current_binding_level
->names
= decls
;
5241 /* Similarly, store the list of tags of the current level. */
5247 current_binding_level
->tags
= tags
;
5250 /* Given NAME, an IDENTIFIER_NODE,
5251 return the structure (or union or enum) definition for that name.
5252 Searches binding levels from BINDING_LEVEL up to the global level.
5253 If THISLEVEL_ONLY is nonzero, searches only the specified context
5254 (but skips any tag-transparent contexts to find one that is
5255 meaningful for tags).
5256 FORM says which kind of type the caller wants;
5257 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5258 If the wrong kind of type is found, and it's not a template, an error is
5262 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5263 enum tree_code form
;
5265 struct binding_level
*binding_level
;
5268 register struct binding_level
*level
;
5269 /* Non-zero if, we should look past a template parameter level, even
5270 if THISLEVEL_ONLY. */
5271 int allow_template_parms_p
= 1;
5273 for (level
= binding_level
; level
; level
= level
->level_chain
)
5276 if (ANON_AGGRNAME_P (name
))
5277 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5279 /* There's no need for error checking here, because
5280 anon names are unique throughout the compilation. */
5281 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5282 return TREE_VALUE (tail
);
5284 else if (level
->namespace_p
)
5285 /* Do namespace lookup. */
5286 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5288 tree old
= binding_for_name (name
, tail
);
5290 /* If we just skipped past a template parameter level,
5291 even though THISLEVEL_ONLY, and we find a template
5292 class declaration, then we use the _TYPE node for the
5293 template. See the example below. */
5294 if (thislevel_only
&& !allow_template_parms_p
5295 && old
&& BINDING_VALUE (old
)
5296 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5297 old
= TREE_TYPE (BINDING_VALUE (old
));
5299 old
= BINDING_TYPE (old
);
5301 /* If it has an original type, it is a typedef, and we
5302 should not return it. */
5303 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5305 if (old
&& TREE_CODE (old
) != form
5306 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5308 cp_error ("`%#D' redeclared as %C", old
, form
);
5313 if (thislevel_only
|| tail
== global_namespace
)
5317 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5319 if (TREE_PURPOSE (tail
) == name
)
5321 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5322 /* Should tighten this up; it'll probably permit
5323 UNION_TYPE and a struct template, for example. */
5325 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5327 /* Definition isn't the kind we were looking for. */
5328 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5332 return TREE_VALUE (tail
);
5335 if (thislevel_only
&& ! level
->tag_transparent
)
5337 if (level
->template_parms_p
&& allow_template_parms_p
)
5339 /* We must deal with cases like this:
5341 template <class T> struct S;
5342 template <class T> struct S {};
5344 When looking up `S', for the second declaration, we
5345 would like to find the first declaration. But, we
5346 are in the pseudo-global level created for the
5347 template parameters, rather than the (surrounding)
5348 namespace level. Thus, we keep going one more level,
5349 even though THISLEVEL_ONLY is non-zero. */
5350 allow_template_parms_p
= 0;
5362 set_current_level_tags_transparency (tags_transparent
)
5363 int tags_transparent
;
5365 current_binding_level
->tag_transparent
= tags_transparent
;
5369 /* Given a type, find the tag that was defined for it and return the tag name.
5370 Otherwise return 0. However, the value can never be 0
5371 in the cases in which this is used.
5373 C++: If NAME is non-zero, this is the new name to install. This is
5374 done when replacing anonymous tags with real tag names. */
5377 lookup_tag_reverse (type
, name
)
5381 register struct binding_level
*level
;
5383 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5386 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5388 if (TREE_VALUE (tail
) == type
)
5391 TREE_PURPOSE (tail
) = name
;
5392 return TREE_PURPOSE (tail
);
5399 /* Look up NAME in the NAMESPACE. */
5402 lookup_namespace_name (namespace, name
)
5403 tree
namespace, name
;
5406 tree template_id
= NULL_TREE
;
5408 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5410 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5411 /* This happens for A::B<int> when B is a namespace. */
5413 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5415 /* This happens for A::B where B is a template, and there are no
5416 template arguments. */
5417 cp_error ("invalid use of `%D'", name
);
5418 return error_mark_node
;
5421 namespace = ORIGINAL_NAMESPACE (namespace);
5423 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5426 name
= TREE_OPERAND (name
, 0);
5427 if (TREE_CODE (name
) == OVERLOAD
)
5428 name
= DECL_NAME (OVL_CURRENT (name
));
5429 else if (DECL_P (name
))
5430 name
= DECL_NAME (name
);
5433 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5435 val
= make_node (CPLUS_BINDING
);
5436 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5437 return error_mark_node
;
5439 if (BINDING_VALUE (val
))
5441 val
= BINDING_VALUE (val
);
5445 if (DECL_CLASS_TEMPLATE_P (val
))
5446 val
= lookup_template_class (val
,
5447 TREE_OPERAND (template_id
, 1),
5448 /*in_decl=*/NULL_TREE
,
5449 /*context=*/NULL_TREE
,
5450 /*entering_scope=*/0);
5451 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5452 || TREE_CODE (val
) == OVERLOAD
)
5453 val
= lookup_template_function (val
,
5454 TREE_OPERAND (template_id
, 1));
5457 cp_error ("`%D::%D' is not a template",
5459 return error_mark_node
;
5463 /* If we have a single function from a using decl, pull it out. */
5464 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5465 val
= OVL_FUNCTION (val
);
5469 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5470 return error_mark_node
;
5473 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5475 static unsigned long
5483 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5484 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5489 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5492 typename_compare (k1
, k2
)
5503 d1
= TYPE_NAME (t1
);
5504 d2
= TYPE_NAME (t2
);
5506 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5507 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5508 && ((TREE_TYPE (t1
) != NULL_TREE
)
5509 == (TREE_TYPE (t2
) != NULL_TREE
))
5510 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5511 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5514 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5515 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5516 is non-NULL, this type is being created by the implicit typename
5517 extension, and BASE_TYPE is a type named `t' in some base class of
5518 `T' which depends on template parameters.
5520 Returns the new TYPENAME_TYPE. */
5523 build_typename_type (context
, name
, fullname
, base_type
)
5531 struct hash_entry
* e
;
5533 static struct hash_table ht
;
5537 static struct hash_table
*h
= &ht
;
5538 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5540 fatal ("virtual memory exhausted");
5541 ggc_add_tree_hash_table_root (&h
, 1);
5544 /* Build the TYPENAME_TYPE. */
5545 t
= make_aggr_type (TYPENAME_TYPE
);
5546 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5547 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5548 TREE_TYPE (t
) = base_type
;
5550 /* Build the corresponding TYPE_DECL. */
5551 d
= build_decl (TYPE_DECL
, name
, t
);
5552 TYPE_NAME (TREE_TYPE (d
)) = d
;
5553 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5554 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5555 DECL_ARTIFICIAL (d
) = 1;
5557 /* See if we already have this type. */
5558 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5562 /* Insert the type into the table. */
5563 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5568 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5569 unless an error occurs, in which case error_mark_node is returned.
5570 If COMPLAIN zero, don't complain about any errors that occur. */
5573 make_typename_type (context
, name
, complain
)
5581 if (!(TYPE_LANG_SPECIFIC (name
)
5582 && (CLASSTYPE_IS_TEMPLATE (name
)
5583 || CLASSTYPE_USE_TEMPLATE (name
))))
5584 name
= TYPE_IDENTIFIER (name
);
5586 /* Create a TEMPLATE_ID_EXPR for the type. */
5587 name
= build_nt (TEMPLATE_ID_EXPR
,
5588 CLASSTYPE_TI_TEMPLATE (name
),
5589 CLASSTYPE_TI_ARGS (name
));
5591 else if (TREE_CODE (name
) == TYPE_DECL
)
5592 name
= DECL_NAME (name
);
5596 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5598 name
= TREE_OPERAND (name
, 0);
5599 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5600 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5602 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5603 my_friendly_abort (2000);
5605 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5607 /* We can get here from typename_sub0 in the explicit_template_type
5608 expansion. Just fail. */
5610 cp_error ("no class template named `%#T' in `%#T'",
5612 return error_mark_node
;
5615 if (! uses_template_parms (context
)
5616 || currently_open_class (context
))
5618 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5620 tree tmpl
= NULL_TREE
;
5621 if (IS_AGGR_TYPE (context
))
5622 tmpl
= lookup_field (context
, name
, 0, 0);
5623 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5626 cp_error ("no class template named `%#T' in `%#T'",
5628 return error_mark_node
;
5631 return lookup_template_class (tmpl
,
5632 TREE_OPERAND (fullname
, 1),
5634 /*entering_scope=*/0);
5640 if (!IS_AGGR_TYPE (context
))
5643 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5644 return error_mark_node
;
5647 t
= lookup_field (context
, name
, 0, 1);
5649 return TREE_TYPE (t
);
5653 /* If the CONTEXT is not a template type, then either the field is
5654 there now or its never going to be. */
5655 if (!uses_template_parms (context
))
5658 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5659 return error_mark_node
;
5663 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5666 /* Select the right _DECL from multiple choices. */
5669 select_decl (binding
, flags
)
5674 val
= BINDING_VALUE (binding
);
5676 /* When we implicitly declare some builtin entity, we mark it
5677 DECL_ANTICIPATED, so that we know to ignore it until it is
5679 if (val
&& DECL_P (val
)
5680 && DECL_LANG_SPECIFIC (val
)
5681 && DECL_ANTICIPATED (val
))
5684 if (LOOKUP_NAMESPACES_ONLY (flags
))
5686 /* We are not interested in types. */
5687 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5692 /* If we could have a type and
5693 we have nothing or we need a type and have none. */
5694 if (BINDING_TYPE (binding
)
5695 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5696 && TREE_CODE (val
) != TYPE_DECL
)))
5697 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5698 /* Don't return non-types if we really prefer types. */
5699 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5700 && (TREE_CODE (val
) != TEMPLATE_DECL
5701 || !DECL_CLASS_TEMPLATE_P (val
)))
5707 /* Unscoped lookup of a global: iterate over current namespaces,
5708 considering using-directives. If SPACESP is non-NULL, store a list
5709 of the namespaces we've considered in it. */
5712 unqualified_namespace_lookup (name
, flags
, spacesp
)
5717 tree b
= make_node (CPLUS_BINDING
);
5718 tree initial
= current_decl_namespace();
5719 tree scope
= initial
;
5721 struct binding_level
*level
;
5722 tree val
= NULL_TREE
;
5725 *spacesp
= NULL_TREE
;
5727 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5730 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5731 val
= binding_for_name (name
, scope
);
5733 /* Initialize binding for this context. */
5734 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5735 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5737 /* Add all _DECLs seen through local using-directives. */
5738 for (level
= current_binding_level
;
5739 !level
->namespace_p
;
5740 level
= level
->level_chain
)
5741 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5742 scope
, flags
, spacesp
))
5743 /* Give up because of error. */
5744 return error_mark_node
;
5746 /* Add all _DECLs seen through global using-directives. */
5747 /* XXX local and global using lists should work equally. */
5751 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5752 scope
, flags
, spacesp
))
5753 /* Give up because of error. */
5754 return error_mark_node
;
5755 if (siter
== scope
) break;
5756 siter
= CP_DECL_CONTEXT (siter
);
5759 val
= select_decl (b
, flags
);
5760 if (scope
== global_namespace
)
5766 /* Combine prefer_type and namespaces_only into flags. */
5769 lookup_flags (prefer_type
, namespaces_only
)
5770 int prefer_type
, namespaces_only
;
5772 if (namespaces_only
)
5773 return LOOKUP_PREFER_NAMESPACES
;
5774 if (prefer_type
> 1)
5775 return LOOKUP_PREFER_TYPES
;
5776 if (prefer_type
> 0)
5777 return LOOKUP_PREFER_BOTH
;
5781 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5782 ignore it or not. Subroutine of lookup_name_real. */
5785 qualify_lookup (val
, flags
)
5789 if (val
== NULL_TREE
)
5791 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5793 if ((flags
& LOOKUP_PREFER_TYPES
)
5794 && (TREE_CODE (val
) == TYPE_DECL
5795 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5796 && DECL_CLASS_TEMPLATE_P (val
))))
5798 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5803 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5807 warn_about_implicit_typename_lookup (typename
, binding
)
5811 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5812 tree name
= DECL_NAME (typename
);
5814 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5815 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5816 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5817 && ! (TREE_CODE (binding
) == TYPE_DECL
5818 && same_type_p (TREE_TYPE (binding
), subtype
)))
5820 cp_warning ("lookup of `%D' finds `%#D'",
5822 cp_warning (" instead of `%D' from dependent base class",
5824 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5825 constructor_name (current_class_type
), name
);
5829 /* Look up NAME in the current binding level and its superiors in the
5830 namespace of variables, functions and typedefs. Return a ..._DECL
5831 node of some kind representing its definition if there is only one
5832 such declaration, or return a TREE_LIST with all the overloaded
5833 definitions if there are many, or return 0 if it is undefined.
5835 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5836 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5837 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5838 Otherwise we prefer non-TYPE_DECLs.
5840 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5841 using IDENTIFIER_CLASS_VALUE. */
5844 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5846 int prefer_type
, nonclass
, namespaces_only
;
5849 tree val
= NULL_TREE
;
5851 tree from_obj
= NULL_TREE
;
5853 int val_is_implicit_typename
= 0;
5855 /* Hack: copy flag set by parser, if set. */
5856 if (only_namespace_names
)
5857 namespaces_only
= 1;
5859 if (prefer_type
== -2)
5861 extern int looking_for_typename
;
5862 tree type
= NULL_TREE
;
5865 prefer_type
= looking_for_typename
;
5867 flags
= lookup_flags (prefer_type
, namespaces_only
);
5868 /* If the next thing is '<', class templates are types. */
5869 if (looking_for_template
)
5870 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5872 /* std:: becomes :: for now. */
5873 if (got_scope
&& got_scope
== fake_std_node
)
5874 got_scope
= void_type_node
;
5878 else if (got_object
!= error_mark_node
)
5883 if (type
== error_mark_node
)
5884 return error_mark_node
;
5885 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5886 type
= TREE_TYPE (type
);
5889 type
= complete_type (type
);
5891 if (TREE_CODE (type
) == VOID_TYPE
)
5892 type
= global_namespace
;
5893 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5895 val
= make_node (CPLUS_BINDING
);
5896 flags
|= LOOKUP_COMPLAIN
;
5897 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5899 val
= select_decl (val
, flags
);
5901 else if (! IS_AGGR_TYPE (type
)
5902 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5903 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5904 || TREE_CODE (type
) == TYPENAME_TYPE
)
5905 /* Someone else will give an error about this if needed. */
5907 else if (type
== current_class_type
)
5908 val
= IDENTIFIER_CLASS_VALUE (name
);
5911 val
= lookup_member (type
, name
, 0, prefer_type
);
5912 type_access_control (type
, val
);
5914 /* Restore the containing TYPENAME_TYPE if we looked
5915 through it before. */
5916 if (got_scope
&& got_scope
!= type
5917 && val
&& TREE_CODE (val
) == TYPE_DECL
5918 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5919 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5927 else if (got_object
&& val
)
5935 flags
= lookup_flags (prefer_type
, namespaces_only
);
5936 /* If we're not parsing, we need to complain. */
5937 flags
|= LOOKUP_COMPLAIN
;
5940 /* First, look in non-namespace scopes. */
5942 if (current_class_type
== NULL_TREE
)
5945 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5949 if (!LOCAL_BINDING_P (t
) && nonclass
)
5950 /* We're not looking for class-scoped bindings, so keep going. */
5953 /* If this is the kind of thing we're looking for, we're done. */
5954 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5955 binding
= BINDING_VALUE (t
);
5956 else if ((flags
& LOOKUP_PREFER_TYPES
)
5957 && qualify_lookup (BINDING_TYPE (t
), flags
))
5958 binding
= BINDING_TYPE (t
);
5960 binding
= NULL_TREE
;
5962 /* Handle access control on types from enclosing or base classes. */
5963 if (binding
&& ! yylex
5964 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5965 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5968 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5970 if (val_is_implicit_typename
&& !yylex
)
5971 warn_about_implicit_typename_lookup (val
, binding
);
5973 val_is_implicit_typename
5974 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5975 if (!val_is_implicit_typename
)
5980 /* Now lookup in namespace scopes. */
5981 if (!val
|| val_is_implicit_typename
)
5983 t
= unqualified_namespace_lookup (name
, flags
, 0);
5986 if (val_is_implicit_typename
&& !yylex
)
5987 warn_about_implicit_typename_lookup (val
, t
);
5995 /* This should only warn about types used in qualified-ids. */
5996 if (from_obj
&& from_obj
!= val
)
5998 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5999 && TREE_CODE (val
) == TYPE_DECL
6000 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
6002 lookup of `%D' in the scope of `%#T' (`%#T') \
6003 does not match lookup in the current scope (`%#T')",
6004 name
, got_object
, TREE_TYPE (from_obj
),
6007 /* We don't change val to from_obj if got_object depends on
6008 template parms because that breaks implicit typename for
6009 destructor calls. */
6010 if (! uses_template_parms (got_object
))
6014 /* If we have a single function from a using decl, pull it out. */
6015 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6016 val
= OVL_FUNCTION (val
);
6025 lookup_name_nonclass (name
)
6028 return lookup_name_real (name
, 0, 1, 0);
6032 lookup_function_nonclass (name
, args
)
6036 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6040 lookup_name_namespace_only (name
)
6043 /* type-or-namespace, nonclass, namespace_only */
6044 return lookup_name_real (name
, 1, 1, 1);
6048 lookup_name (name
, prefer_type
)
6052 return lookup_name_real (name
, prefer_type
, 0, 0);
6055 /* Similar to `lookup_name' but look only in the innermost non-class
6059 lookup_name_current_level (name
)
6062 struct binding_level
*b
;
6065 b
= current_binding_level
;
6066 while (b
->parm_flag
== 2)
6071 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6073 /* extern "C" function() */
6074 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6077 else if (IDENTIFIER_BINDING (name
)
6078 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6082 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6083 return IDENTIFIER_VALUE (name
);
6095 /* Like lookup_name_current_level, but for types. */
6098 lookup_type_current_level (name
)
6101 register tree t
= NULL_TREE
;
6103 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6105 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6106 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6108 struct binding_level
*b
= current_binding_level
;
6111 if (purpose_member (name
, b
->type_shadowed
))
6112 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6124 begin_only_namespace_names ()
6126 only_namespace_names
= 1;
6130 end_only_namespace_names ()
6132 only_namespace_names
= 0;
6135 /* Push the declarations of builtin types into the namespace.
6136 RID_INDEX is the index of the builtin type
6137 in the array RID_POINTERS. NAME is the name used when looking
6138 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6141 record_builtin_type (rid_index
, name
, type
)
6146 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6147 tree tdecl
= NULL_TREE
;
6149 if ((int) rid_index
< (int) RID_MAX
)
6150 rname
= ridpointers
[(int) rid_index
];
6152 tname
= get_identifier (name
);
6154 TYPE_BUILT_IN (type
) = 1;
6158 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6159 set_identifier_type_value (tname
, NULL_TREE
);
6160 if ((int) rid_index
< (int) RID_MAX
)
6161 /* Built-in types live in the global namespace. */
6162 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6164 if (rname
!= NULL_TREE
)
6166 if (tname
!= NULL_TREE
)
6168 set_identifier_type_value (rname
, NULL_TREE
);
6169 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6173 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6174 set_identifier_type_value (rname
, NULL_TREE
);
6179 /* Record one of the standard Java types.
6180 * Declare it as having the given NAME.
6181 * If SIZE > 0, it is the size of one of the integral types;
6182 * otherwise it is the negative of the size of one of the other types. */
6185 record_builtin_java_type (name
, size
)
6191 type
= make_signed_type (size
);
6192 else if (size
> -32)
6193 { /* "__java_char" or ""__java_boolean". */
6194 type
= make_unsigned_type (-size
);
6195 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6198 { /* "__java_float" or ""__java_double". */
6199 type
= make_node (REAL_TYPE
);
6200 TYPE_PRECISION (type
) = - size
;
6203 record_builtin_type (RID_MAX
, name
, type
);
6204 decl
= TYPE_NAME (type
);
6206 /* Suppress generate debug symbol entries for these types,
6207 since for normal C++ they are just clutter.
6208 However, push_lang_context undoes this if extern "Java" is seen. */
6209 DECL_IGNORED_P (decl
) = 1;
6211 TYPE_FOR_JAVA (type
) = 1;
6215 /* Push a type into the namespace so that the back-ends ignore it. */
6218 record_unknown_type (type
, name
)
6222 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6223 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6224 DECL_IGNORED_P (decl
) = 1;
6225 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6226 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6227 TYPE_ALIGN (type
) = 1;
6228 TYPE_USER_ALIGN (type
) = 0;
6229 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6232 /* An string for which we should create an IDENTIFIER_NODE at
6235 typedef struct predefined_identifier
6237 /* The name of the identifier. */
6239 /* The place where the IDENTIFIER_NODE should be stored. */
6241 /* Non-zero if this is the name of a constructor or destructor. */
6243 } predefined_identifier
;
6245 /* Create all the predefined identifiers. */
6248 initialize_predefined_identifiers ()
6250 struct predefined_identifier
*pid
;
6252 /* A table of identifiers to create at startup. */
6253 static predefined_identifier predefined_identifiers
[] = {
6254 { "C++", &lang_name_cplusplus
, 0 },
6255 { "C", &lang_name_c
, 0 },
6256 { "Java", &lang_name_java
, 0 },
6257 { CTOR_NAME
, &ctor_identifier
, 1 },
6258 { "__base_ctor", &base_ctor_identifier
, 1 },
6259 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6260 { DTOR_NAME
, &dtor_identifier
, 1 },
6261 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6262 { "__base_dtor", &base_dtor_identifier
, 1 },
6263 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6264 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6265 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6266 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6267 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6268 { "nelts", &nelts_identifier
, 0 },
6269 { THIS_NAME
, &this_identifier
, 0 },
6270 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6271 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6272 { "_vptr", &vptr_identifier
, 0 },
6273 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6274 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6275 { "std", &std_identifier
, 0 },
6279 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6281 *pid
->node
= get_identifier (pid
->name
);
6282 if (pid
->ctor_or_dtor_p
)
6283 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6287 /* Create the predefined scalar types of C,
6288 and some nodes representing standard constants (0, 1, (void *)0).
6289 Initialize the global binding level.
6290 Make definitions for built-in primitive functions. */
6293 init_decl_processing ()
6296 int wchar_type_size
;
6297 tree array_domain_type
;
6299 /* Check to see that the user did not specify an invalid combination
6300 of command-line options. */
6301 if (flag_new_abi
&& !flag_vtable_thunks
)
6302 fatal ("the new ABI requires vtable thunks");
6304 /* Create all the identifiers we need. */
6305 initialize_predefined_identifiers ();
6307 /* Fill in back-end hooks. */
6308 init_lang_status
= &push_cp_function_context
;
6309 free_lang_status
= &pop_cp_function_context
;
6310 mark_lang_status
= &mark_cp_function_context
;
6311 lang_safe_from_p
= &c_safe_from_p
;
6312 lang_dump_tree
= &cp_dump_tree
;
6318 /* Create the global variables. */
6319 push_to_top_level ();
6321 /* Enter the global namespace. */
6322 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6323 push_namespace (get_identifier ("::"));
6324 global_namespace
= current_namespace
;
6325 current_lang_name
= NULL_TREE
;
6327 /* Adjust various flags based on command-line settings. */
6328 if (! flag_permissive
&& ! pedantic
)
6329 flag_pedantic_errors
= 1;
6330 if (!flag_no_inline
)
6331 flag_inline_trees
= 1;
6334 current_lang_name
= lang_name_c
;
6336 current_function_decl
= NULL_TREE
;
6337 current_binding_level
= NULL_BINDING_LEVEL
;
6338 free_binding_level
= NULL_BINDING_LEVEL
;
6340 build_common_tree_nodes (flag_signed_char
);
6342 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6343 TREE_TYPE (error_mark_list
) = error_mark_node
;
6345 /* Make the binding_level structure for global names. */
6347 global_binding_level
= current_binding_level
;
6348 /* The global level is the namespace level of ::. */
6349 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6350 declare_namespace_level ();
6352 /* Create the `std' namespace. */
6355 push_namespace (std_identifier
);
6356 std_node
= current_namespace
;
6358 fake_std_node
= error_mark_node
;
6362 fake_std_node
= build_decl (NAMESPACE_DECL
,
6365 pushdecl (fake_std_node
);
6368 /* Define `int' and `char' first so that dbx will output them first. */
6369 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6370 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6372 /* `signed' is the same as `int' */
6373 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6374 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6375 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6376 record_builtin_type (RID_MAX
, "long unsigned int",
6377 long_unsigned_type_node
);
6378 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6379 record_builtin_type (RID_MAX
, "long long int",
6380 long_long_integer_type_node
);
6381 record_builtin_type (RID_MAX
, "long long unsigned int",
6382 long_long_unsigned_type_node
);
6383 record_builtin_type (RID_MAX
, "long long unsigned",
6384 long_long_unsigned_type_node
);
6385 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6386 record_builtin_type (RID_MAX
, "short unsigned int",
6387 short_unsigned_type_node
);
6388 record_builtin_type (RID_MAX
, "unsigned short",
6389 short_unsigned_type_node
);
6391 /* Define both `signed char' and `unsigned char'. */
6392 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6393 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6395 /* `unsigned long' is the standard type for sizeof.
6396 Note that stddef.h uses `unsigned long',
6397 and this must agree, even if long and int are the same size. */
6399 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
)));
6400 signed_size_type_node
= signed_type (c_size_type_node
);
6401 set_sizetype (c_size_type_node
);
6403 /* Create the widest literal types. */
6404 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6405 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6406 widest_integer_literal_type_node
));
6408 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6409 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6410 widest_unsigned_literal_type_node
));
6412 /* These are types that type_for_size and type_for_mode use. */
6413 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6414 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6415 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6416 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6417 #if HOST_BITS_PER_WIDE_INT >= 64
6418 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6420 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6421 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6422 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6423 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6424 #if HOST_BITS_PER_WIDE_INT >= 64
6425 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6428 build_common_tree_nodes_2 (flag_short_double
);
6430 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6431 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6432 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6433 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6434 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6435 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6436 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6437 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6439 integer_two_node
= build_int_2 (2, 0);
6440 TREE_TYPE (integer_two_node
) = integer_type_node
;
6441 integer_three_node
= build_int_2 (3, 0);
6442 TREE_TYPE (integer_three_node
) = integer_type_node
;
6444 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6445 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6446 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6447 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6448 TYPE_PRECISION (boolean_type_node
) = 1;
6449 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6450 boolean_false_node
= build_int_2 (0, 0);
6451 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6452 boolean_true_node
= build_int_2 (1, 0);
6453 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6455 signed_size_zero_node
= build_int_2 (0, 0);
6456 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6457 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6458 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6460 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6461 complex_integer_type_node
));
6462 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6463 complex_float_type_node
));
6464 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6465 complex_double_type_node
));
6466 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6467 complex_long_double_type_node
));
6469 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6471 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6472 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6473 TREE_PARMLIST (void_list_node
) = 1;
6475 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6476 /* Make a type to be the domain of a few array types
6477 whose domains don't really matter.
6478 200 is small enough that it always fits in size_t. */
6479 array_domain_type
= build_index_type (build_int_2 (200, 0));
6481 /* Make a type for arrays of characters.
6482 With luck nothing will ever really depend on the length of this
6484 char_array_type_node
6485 = build_array_type (char_type_node
, array_domain_type
);
6487 /* Likewise for arrays of ints. */
6489 = build_array_type (integer_type_node
, array_domain_type
);
6491 c_common_nodes_and_builtins ();
6494 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6498 delta_type_node
= ptrdiff_type_node
;
6499 else if (flag_huge_objects
)
6500 delta_type_node
= long_integer_type_node
;
6502 delta_type_node
= short_integer_type_node
;
6505 vtable_index_type
= ptrdiff_type_node
;
6507 vtable_index_type
= delta_type_node
;
6509 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6510 lang_type_promotes_to
= convert_type_from_ellipsis
;
6513 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6515 #ifdef MD_INIT_BUILTINS
6519 /* C++ extensions */
6521 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6522 record_unknown_type (unknown_type_node
, "unknown type");
6524 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6525 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6527 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6529 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6531 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6532 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6534 /* This is special for C++ so functions can be overloaded. */
6535 wchar_type_node
= get_identifier (flag_short_wchar
6536 ? "short unsigned int"
6538 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6539 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6540 if (TREE_UNSIGNED (wchar_type_node
))
6541 wchar_type_node
= make_signed_type (wchar_type_size
);
6543 wchar_type_node
= make_unsigned_type (wchar_type_size
);
6544 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
6546 /* This is for wide string constants. */
6547 wchar_array_type_node
6548 = build_array_type (wchar_type_node
, array_domain_type
);
6550 if (flag_vtable_thunks
)
6552 /* Make sure we get a unique function type, so we can give
6553 its pointer type a name. (This wins for gdb.) */
6554 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6555 TREE_TYPE (vfunc_type
) = integer_type_node
;
6556 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6557 layout_type (vfunc_type
);
6559 vtable_entry_type
= build_pointer_type (vfunc_type
);
6563 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6564 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6566 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6568 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6570 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6573 /* Make this part of an invisible union. */
6574 fields
[3] = copy_node (fields
[2]);
6575 TREE_TYPE (fields
[3]) = delta_type_node
;
6576 DECL_NAME (fields
[3]) = delta2_identifier
;
6577 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6578 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6579 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6580 TREE_UNSIGNED (fields
[3]) = 0;
6581 TREE_CHAIN (fields
[2]) = fields
[3];
6582 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6585 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6588 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6589 layout_type (vtbl_type_node
);
6590 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6591 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6592 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6593 layout_type (vtbl_ptr_type_node
);
6594 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6598 push_namespace (get_identifier ("__cxxabiv1"));
6599 abi_node
= current_namespace
;
6603 global_type_node
= make_node (LANG_TYPE
);
6604 record_unknown_type (global_type_node
, "global type");
6607 current_lang_name
= lang_name_cplusplus
;
6610 tree bad_alloc_type_node
, newtype
, deltype
;
6612 push_namespace (std_identifier
);
6613 bad_alloc_type_node
= xref_tag
6614 (class_type_node
, get_identifier ("bad_alloc"), 1);
6617 newtype
= build_exception_variant
6618 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6619 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6620 push_cp_library_fn (NEW_EXPR
, newtype
);
6621 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6622 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6623 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6627 = build_library_fn_ptr ((flag_new_abi
6628 ? "__cxa_pure_virtual"
6629 : "__pure_virtual"),
6632 /* Perform other language dependent initializations. */
6633 init_class_processing ();
6634 init_init_processing ();
6635 init_search_processing ();
6636 init_rtti_processing ();
6638 if (flag_exceptions
)
6639 init_exception_processing ();
6642 flag_inline_functions
= 0;
6645 if (! supports_one_only ())
6648 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6649 function_id_node
= get_identifier ("__FUNCTION__");
6650 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6651 func_id_node
= get_identifier ("__func__");
6653 make_fname_decl
= cp_make_fname_decl
;
6654 declare_function_name ();
6656 /* Prepare to check format strings against argument lists. */
6657 init_function_format_info ();
6659 /* Show we use EH for cleanups. */
6660 using_eh_for_cleanups ();
6662 valid_lang_attribute
= cp_valid_lang_attribute
;
6664 /* Maintain consistency. Perhaps we should just complain if they
6665 say -fwritable-strings? */
6666 if (flag_writable_strings
)
6667 flag_const_strings
= 0;
6669 /* Add GC roots for all of our global variables. */
6670 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6671 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6672 ggc_add_tree_root (&integer_three_node
, 1);
6673 ggc_add_tree_root (&integer_two_node
, 1);
6674 ggc_add_tree_root (&signed_size_zero_node
, 1);
6675 ggc_add_tree_root (&size_one_node
, 1);
6676 ggc_add_tree_root (&size_zero_node
, 1);
6677 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6678 mark_binding_level
);
6679 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6680 ggc_add_tree_root (&static_ctors
, 1);
6681 ggc_add_tree_root (&static_dtors
, 1);
6682 ggc_add_tree_root (&lastiddecl
, 1);
6684 ggc_add_tree_root (&last_function_parm_tags
, 1);
6685 ggc_add_tree_root (¤t_function_return_value
, 1);
6686 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6687 ggc_add_tree_root (&last_function_parms
, 1);
6688 ggc_add_tree_root (&error_mark_list
, 1);
6690 ggc_add_tree_root (&global_namespace
, 1);
6691 ggc_add_tree_root (&global_type_node
, 1);
6692 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6694 ggc_add_tree_root (&got_object
, 1);
6695 ggc_add_tree_root (&got_scope
, 1);
6697 ggc_add_tree_root (¤t_lang_name
, 1);
6698 ggc_add_tree_root (&static_aggregates
, 1);
6701 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6702 decl, NAME is the initialization string and TYPE_DEP indicates whether
6703 NAME depended on the type of the function. We make use of that to detect
6704 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6705 the function before emitting any of it, we don't need to treat the
6706 VAR_DECL specially. We can decide whether to emit it later, if it was
6710 cp_make_fname_decl (id
, name
, type_dep
)
6715 tree decl
, type
, init
;
6716 size_t length
= strlen (name
);
6717 tree domain
= NULL_TREE
;
6719 if (!processing_template_decl
)
6722 domain
= build_index_type (build_int_2 (length
, 0));
6724 type
= build_cplus_array_type
6725 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6728 decl
= build_decl (VAR_DECL
, id
, type
);
6729 TREE_STATIC (decl
) = 1;
6730 TREE_READONLY (decl
) = 1;
6731 DECL_SOURCE_LINE (decl
) = 0;
6732 DECL_ARTIFICIAL (decl
) = 1;
6733 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6735 if (processing_template_decl
)
6736 decl
= push_template_decl (decl
);
6739 init
= build (FUNCTION_NAME
, type
);
6740 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6744 init
= build_string (length
+ 1, name
);
6745 TREE_TYPE (init
) = type
;
6747 DECL_INITIAL (decl
) = init
;
6748 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6750 /* We will have to make sure we only emit this, if it is actually used. */
6754 /* Entry point for the benefit of c_common_nodes_and_builtins.
6756 Make a definition for a builtin function named NAME and whose data type
6757 is TYPE. TYPE should be a function type with argument types.
6759 CLASS and CODE tell later passes how to compile calls to this function.
6760 See tree.h for possible values.
6762 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6763 the name to be called if we can't opencode the function. */
6766 builtin_function (name
, type
, code
, class, libname
)
6770 enum built_in_class
class;
6771 const char *libname
;
6773 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6774 DECL_BUILT_IN_CLASS (decl
) = class;
6775 DECL_FUNCTION_CODE (decl
) = code
;
6777 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6779 /* All builtins that don't begin with an `_' should go in the `std'
6781 if (flag_honor_std
&& name
[0] != '_')
6783 push_namespace (std_identifier
);
6784 DECL_CONTEXT (decl
) = std_node
;
6787 if (flag_honor_std
&& name
[0] != '_')
6790 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6791 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6792 function in the namespace. */
6794 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6795 make_function_rtl (decl
);
6797 /* Warn if a function in the namespace for users
6798 is used without an occasion to consider it declared. */
6799 if (name
[0] != '_' || name
[1] != '_')
6800 DECL_ANTICIPATED (decl
) = 1;
6805 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6806 function. Not called directly. */
6809 build_library_fn_1 (name
, operator_code
, type
)
6811 enum tree_code operator_code
;
6814 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6815 DECL_EXTERNAL (fn
) = 1;
6816 TREE_PUBLIC (fn
) = 1;
6817 DECL_ARTIFICIAL (fn
) = 1;
6818 TREE_NOTHROW (fn
) = 1;
6819 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6823 /* Returns the _DECL for a library function with C linkage.
6824 We assume that such functions never throw; if this is incorrect,
6825 callers should unset TREE_NOTHROW. */
6828 build_library_fn (name
, type
)
6832 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6833 make_function_rtl (fn
);
6837 /* Returns the _DECL for a library function with C++ linkage. */
6840 build_cp_library_fn (name
, operator_code
, type
)
6842 enum tree_code operator_code
;
6845 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6846 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6847 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6848 set_mangled_name_for_decl (fn
);
6849 make_function_rtl (fn
);
6853 /* Like build_library_fn, but takes a C string instead of an
6857 build_library_fn_ptr (name
, type
)
6861 return build_library_fn (get_identifier (name
), type
);
6864 /* Like build_cp_library_fn, but takes a C string instead of an
6868 build_cp_library_fn_ptr (name
, type
)
6872 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6875 /* Like build_library_fn, but also pushes the function so that we will
6876 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6879 push_library_fn (name
, type
)
6882 tree fn
= build_library_fn (name
, type
);
6883 pushdecl_top_level (fn
);
6887 /* Like build_cp_library_fn, but also pushes the function so that it
6888 will be found by normal lookup. */
6891 push_cp_library_fn (operator_code
, type
)
6892 enum tree_code operator_code
;
6895 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6902 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6906 push_void_library_fn (name
, parmtypes
)
6907 tree name
, parmtypes
;
6909 tree type
= build_function_type (void_type_node
, parmtypes
);
6910 return push_library_fn (name
, type
);
6913 /* Like push_library_fn, but also note that this function throws
6914 and does not return. Used for __throw_foo and the like. */
6917 push_throw_library_fn (name
, type
)
6920 tree fn
= push_library_fn (name
, type
);
6921 TREE_THIS_VOLATILE (fn
) = 1;
6922 TREE_NOTHROW (fn
) = 0;
6926 /* When we call finish_struct for an anonymous union, we create
6927 default copy constructors and such. But, an anonymous union
6928 shouldn't have such things; this function undoes the damage to the
6929 anonymous union type T.
6931 (The reason that we create the synthesized methods is that we don't
6932 distinguish `union { int i; }' from `typedef union { int i; } U'.
6933 The first is an anonymous union; the second is just an ordinary
6937 fixup_anonymous_aggr (t
)
6942 /* Wipe out memory of synthesized methods */
6943 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6944 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6945 TYPE_HAS_INIT_REF (t
) = 0;
6946 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6947 TYPE_HAS_ASSIGN_REF (t
) = 0;
6948 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6950 /* Splice the implicitly generated functions out of the TYPE_METHODS
6952 q
= &TYPE_METHODS (t
);
6955 if (DECL_ARTIFICIAL (*q
))
6956 *q
= TREE_CHAIN (*q
);
6958 q
= &TREE_CHAIN (*q
);
6961 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6962 if (TYPE_METHODS (t
))
6963 error ("an anonymous union cannot have function members");
6966 /* Make sure that a declaration with no declarator is well-formed, i.e.
6967 just defines a tagged type or anonymous union.
6969 Returns the type defined, if any. */
6972 check_tag_decl (declspecs
)
6977 tree ob_modifier
= NULL_TREE
;
6979 register tree t
= NULL_TREE
;
6981 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6983 register tree value
= TREE_VALUE (link
);
6986 || (TREE_CODE (value
) == IDENTIFIER_NODE
6987 && IDENTIFIER_GLOBAL_VALUE (value
)
6988 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
6992 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6993 || TREE_CODE (value
) == ENUMERAL_TYPE
)
6995 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6999 else if (value
== ridpointers
[(int) RID_FRIEND
])
7001 if (current_class_type
== NULL_TREE
7002 || current_scope () != current_class_type
)
7003 ob_modifier
= value
;
7007 else if (value
== ridpointers
[(int) RID_STATIC
]
7008 || value
== ridpointers
[(int) RID_EXTERN
]
7009 || value
== ridpointers
[(int) RID_AUTO
]
7010 || value
== ridpointers
[(int) RID_REGISTER
]
7011 || value
== ridpointers
[(int) RID_INLINE
]
7012 || value
== ridpointers
[(int) RID_VIRTUAL
]
7013 || value
== ridpointers
[(int) RID_CONST
]
7014 || value
== ridpointers
[(int) RID_VOLATILE
]
7015 || value
== ridpointers
[(int) RID_EXPLICIT
])
7016 ob_modifier
= value
;
7020 error ("multiple types in one declaration");
7022 if (t
== NULL_TREE
&& ! saw_friend
)
7023 pedwarn ("declaration does not declare anything");
7025 /* Check for an anonymous union. We're careful
7026 accessing TYPE_IDENTIFIER because some built-in types, like
7027 pointer-to-member types, do not have TYPE_NAME. */
7028 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
7030 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
7032 /* Anonymous unions are objects, so they can have specifiers. */;
7033 SET_ANON_AGGR_TYPE_P (t
);
7035 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7036 pedwarn ("ISO C++ prohibits anonymous structs");
7039 else if (ob_modifier
)
7041 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7042 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7043 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7044 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7045 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7046 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7047 cp_error ("`%D' can only be specified for constructors",
7050 cp_error ("`%D' can only be specified for objects and functions",
7057 /* Called when a declaration is seen that contains no names to declare.
7058 If its type is a reference to a structure, union or enum inherited
7059 from a containing scope, shadow that tag name for the current scope
7060 with a forward reference.
7061 If its type defines a new named structure or union
7062 or defines an enum, it is valid but we need not do anything here.
7063 Otherwise, it is an error.
7065 C++: may have to grok the declspecs to learn about static,
7066 complain for anonymous unions. */
7069 shadow_tag (declspecs
)
7072 tree t
= check_tag_decl (declspecs
);
7075 maybe_process_partial_specialization (t
);
7077 /* This is where the variables in an anonymous union are
7078 declared. An anonymous union declaration looks like:
7080 because there is no declarator after the union, the parser
7081 sends that declaration here. */
7082 if (t
&& ANON_AGGR_TYPE_P (t
))
7084 fixup_anonymous_aggr (t
);
7086 if (TYPE_FIELDS (t
))
7088 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7090 finish_anon_union (decl
);
7095 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7098 groktypename (typename
)
7101 if (TREE_CODE (typename
) != TREE_LIST
)
7103 return grokdeclarator (TREE_VALUE (typename
),
7104 TREE_PURPOSE (typename
),
7105 TYPENAME
, 0, NULL_TREE
);
7108 /* Decode a declarator in an ordinary declaration or data definition.
7109 This is called as soon as the type information and variable name
7110 have been parsed, before parsing the initializer if any.
7111 Here we create the ..._DECL node, fill in its type,
7112 and put it on the list of decls for the current context.
7113 The ..._DECL node is returned as the value.
7115 Exception: for arrays where the length is not specified,
7116 the type is left null, to be filled in by `cp_finish_decl'.
7118 Function definitions do not come here; they go to start_function
7119 instead. However, external and forward declarations of functions
7120 do go through here. Structure field declarations are done by
7121 grokfield and not through here. */
7124 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7125 tree declarator
, declspecs
;
7127 tree attributes
, prefix_attributes
;
7130 register tree type
, tem
;
7132 extern int have_extern_spec
;
7133 extern int used_extern_spec
;
7137 /* See code below that used this. */
7138 int init_written
= initialized
;
7141 /* This should only be done once on the top most decl. */
7142 if (have_extern_spec
&& !used_extern_spec
)
7144 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7146 used_extern_spec
= 1;
7149 if (attributes
|| prefix_attributes
)
7150 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7152 attrlist
= NULL_TREE
;
7154 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7157 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7160 type
= TREE_TYPE (decl
);
7162 if (type
== error_mark_node
)
7165 context
= DECL_CONTEXT (decl
);
7167 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7168 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7170 /* When parsing the initializer, lookup should use the object's
7172 push_decl_namespace (context
);
7175 /* We are only interested in class contexts, later. */
7176 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7177 context
= NULL_TREE
;
7180 /* Is it valid for this decl to have an initializer at all?
7181 If not, set INITIALIZED to zero, which will indirectly
7182 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7183 switch (TREE_CODE (decl
))
7186 /* typedef foo = bar means give foo the same type as bar.
7187 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7188 Any other case of an initialization in a TYPE_DECL is an error. */
7189 if (pedantic
|| list_length (declspecs
) > 1)
7191 cp_error ("typedef `%D' is initialized", decl
);
7197 cp_error ("function `%#D' is initialized like a variable", decl
);
7207 if (! toplevel_bindings_p ()
7208 && DECL_EXTERNAL (decl
))
7209 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7211 DECL_EXTERNAL (decl
) = 0;
7212 if (toplevel_bindings_p ())
7213 TREE_STATIC (decl
) = 1;
7215 /* Tell `pushdecl' this is an initialized decl
7216 even though we don't yet have the initializer expression.
7217 Also tell `cp_finish_decl' it may store the real initializer. */
7218 DECL_INITIAL (decl
) = error_mark_node
;
7221 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7222 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7225 /* Set attributes here so if duplicate decl, will have proper attributes. */
7226 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7228 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7230 push_nested_class (context
, 2);
7232 if (TREE_CODE (decl
) == VAR_DECL
)
7234 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7235 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7236 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7239 if (DECL_CONTEXT (field
) != context
)
7241 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7242 DECL_CONTEXT (field
), DECL_NAME (decl
),
7243 context
, DECL_NAME (decl
));
7244 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7246 /* Static data member are tricky; an in-class initialization
7247 still doesn't provide a definition, so the in-class
7248 declaration will have DECL_EXTERNAL set, but will have an
7249 initialization. Thus, duplicate_decls won't warn
7250 about this situation, and so we check here. */
7251 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7252 cp_error ("duplicate initialization of %D", decl
);
7253 if (duplicate_decls (decl
, field
))
7259 tree field
= check_classfn (context
, decl
);
7260 if (field
&& duplicate_decls (decl
, field
))
7264 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7265 DECL_IN_AGGR_P (decl
) = 0;
7266 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7267 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7269 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7270 /* [temp.expl.spec] An explicit specialization of a static data
7271 member of a template is a definition if the declaration
7272 includes an initializer; otherwise, it is a declaration.
7274 We check for processing_specialization so this only applies
7275 to the new specialization syntax. */
7276 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7277 DECL_EXTERNAL (decl
) = 1;
7280 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7281 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7285 /* Enter this declaration into the symbol table. */
7286 tem
= maybe_push_decl (decl
);
7288 if (processing_template_decl
)
7289 tem
= push_template_decl (tem
);
7291 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7292 /* Tell the back-end to use or not use .common as appropriate. If we say
7293 -fconserve-space, we want this to save .data space, at the expense of
7294 wrong semantics. If we say -fno-conserve-space, we want this to
7295 produce errors about redefs; to do this we force variables into the
7297 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7300 if (! processing_template_decl
)
7310 tree type
= TREE_TYPE (decl
);
7311 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7313 if (type
== error_mark_node
)
7316 /* If this type of object needs a cleanup, but we're not allowed to
7317 add any more objects with cleanups to the current scope, create a
7318 new binding level. */
7319 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7320 && current_binding_level
->more_cleanups_ok
== 0)
7322 keep_next_level (2);
7325 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7329 /* Is it valid for this decl to have an initializer at all?
7330 If not, set INITIALIZED to zero, which will indirectly
7331 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7333 /* Don't allow initializations for incomplete types except for
7334 arrays which might be completed by the initialization. */
7335 if (COMPLETE_TYPE_P (complete_type (type
)))
7336 ; /* A complete type is ok. */
7337 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7339 cp_error ("variable `%#D' has initializer but incomplete type",
7342 type
= TREE_TYPE (decl
) = error_mark_node
;
7344 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7346 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7347 cp_error ("elements of array `%#D' have incomplete type", decl
);
7348 /* else we already gave an error in start_decl. */
7354 && TREE_CODE (decl
) != TYPE_DECL
7355 && TREE_CODE (decl
) != TEMPLATE_DECL
7356 && type
!= error_mark_node
7357 && IS_AGGR_TYPE (type
)
7358 && ! DECL_EXTERNAL (decl
))
7360 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7361 && !COMPLETE_TYPE_P (complete_type (type
)))
7363 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7365 /* Change the type so that assemble_variable will give
7366 DECL an rtl we can live with: (mem (const_int 0)). */
7367 type
= TREE_TYPE (decl
) = error_mark_node
;
7371 /* If any base type in the hierarchy of TYPE needs a constructor,
7372 then we set initialized to 1. This way any nodes which are
7373 created for the purposes of initializing this aggregate
7374 will live as long as it does. This is necessary for global
7375 aggregates which do not have their initializers processed until
7376 the end of the file. */
7377 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7382 DECL_INITIAL (decl
) = NULL_TREE
;
7385 /* Handle initialization of references.
7386 These three arguments are from `cp_finish_decl', and have the
7387 same meaning here that they do there.
7389 Quotes on semantics can be found in ARM 8.4.3. */
7392 grok_reference_init (decl
, type
, init
)
7393 tree decl
, type
, init
;
7397 if (init
== NULL_TREE
)
7399 if ((DECL_LANG_SPECIFIC (decl
) == 0
7400 || DECL_IN_AGGR_P (decl
) == 0)
7401 && ! DECL_THIS_EXTERN (decl
))
7402 cp_error ("`%D' declared as reference but not initialized", decl
);
7406 if (init
== error_mark_node
)
7409 if (TREE_CODE (init
) == CONSTRUCTOR
)
7411 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7415 if (TREE_CODE (init
) == TREE_LIST
)
7416 init
= build_compound_expr (init
);
7418 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7419 init
= convert_from_reference (init
);
7421 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7422 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7424 /* Note: default conversion is only called in very special cases. */
7425 init
= default_conversion (init
);
7428 /* Convert INIT to the reference type TYPE. This may involve the
7429 creation of a temporary, whose lifetime must be the same as that
7430 of the reference. If so, a DECL_STMT for the temporary will be
7431 added just after the DECL_STMT for DECL. That's why we don't set
7432 DECL_INITIAL for local references (instead assigning to them
7433 explicitly); we need to allow the temporary to be initialized
7435 tmp
= convert_to_reference
7436 (type
, init
, CONV_IMPLICIT
,
7437 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7440 if (tmp
== error_mark_node
)
7442 else if (tmp
!= NULL_TREE
)
7445 tmp
= save_expr (tmp
);
7446 if (building_stmt_tree ())
7448 /* Initialize the declaration. */
7449 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7450 finish_expr_stmt (tmp
);
7453 DECL_INITIAL (decl
) = tmp
;
7457 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7461 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7463 expand_static_init (decl
, DECL_INITIAL (decl
));
7464 DECL_INITIAL (decl
) = NULL_TREE
;
7469 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7470 mucking with forces it does not comprehend (i.e. initialization with a
7471 constructor). If we are at global scope and won't go into COMMON, fill
7472 it in with a dummy CONSTRUCTOR to force the variable into .data;
7473 otherwise we can use error_mark_node. */
7476 obscure_complex_init (decl
, init
)
7479 if (! flag_no_inline
&& TREE_STATIC (decl
))
7481 if (extract_init (decl
, init
))
7485 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7486 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7487 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7491 DECL_INITIAL (decl
) = error_mark_node
;
7496 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7497 array until we finish parsing the initializer. If that's the
7498 situation we're in, update DECL accordingly. */
7501 maybe_deduce_size_from_array_init (decl
, init
)
7505 tree type
= TREE_TYPE (decl
);
7507 if (TREE_CODE (type
) == ARRAY_TYPE
7508 && TYPE_DOMAIN (type
) == NULL_TREE
7509 && TREE_CODE (decl
) != TYPE_DECL
)
7511 /* do_default is really a C-ism to deal with tentative definitions.
7512 But let's leave it here to ease the eventual merge. */
7513 int do_default
= !DECL_EXTERNAL (decl
);
7514 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7515 int failure
= complete_array_type (type
, initializer
, do_default
);
7518 cp_error ("initializer fails to determine size of `%D'", decl
);
7523 cp_error ("array size missing in `%D'", decl
);
7524 /* If a `static' var's size isn't known, make it extern as
7525 well as static, so it does not get allocated. If it's not
7526 `static', then don't mark it extern; finish_incomplete_decl
7527 will give it a default size and it will get allocated. */
7528 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7529 DECL_EXTERNAL (decl
) = 1;
7532 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7533 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7535 cp_error ("zero-size array `%D'", decl
);
7537 layout_decl (decl
, 0);
7541 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7542 any appropriate error messages regarding the layout. */
7545 layout_var_decl (decl
)
7548 tree type
= TREE_TYPE (decl
);
7550 tree ttype
= target_type (type
);
7553 /* If we haven't already layed out this declaration, do so now.
7554 Note that we must not call complete type for an external object
7555 because it's type might involve templates that we are not
7556 supposed to isntantiate yet. (And it's perfectly legal to say
7557 `extern X x' for some incomplete type `X'.) */
7558 if (!DECL_EXTERNAL (decl
))
7559 complete_type (type
);
7560 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7561 layout_decl (decl
, 0);
7563 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7565 /* An automatic variable with an incomplete type: that is an error.
7566 Don't talk about array types here, since we took care of that
7567 message in grokdeclarator. */
7568 cp_error ("storage size of `%D' isn't known", decl
);
7569 TREE_TYPE (decl
) = error_mark_node
;
7572 /* Keep this code around in case we later want to control debug info
7573 based on whether a type is "used". (jason 1999-11-11) */
7575 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7576 /* Let debugger know it should output info for this type. */
7577 note_debug_info_needed (ttype
);
7579 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7580 note_debug_info_needed (DECL_CONTEXT (decl
));
7583 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7584 && DECL_SIZE (decl
) != NULL_TREE
7585 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7587 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7588 constant_expression_warning (DECL_SIZE (decl
));
7590 cp_error ("storage size of `%D' isn't constant", decl
);
7594 /* If a local static variable is declared in an inline function, or if
7595 we have a weak definition, we must endeavor to create only one
7596 instance of the variable at link-time. */
7599 maybe_commonize_var (decl
)
7602 /* Static data in a function with comdat linkage also has comdat
7604 if (TREE_STATIC (decl
)
7605 /* Don't mess with __FUNCTION__. */
7606 && ! DECL_ARTIFICIAL (decl
)
7607 && current_function_decl
7608 && DECL_CONTEXT (decl
) == current_function_decl
7609 && (DECL_THIS_INLINE (current_function_decl
)
7610 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7611 && TREE_PUBLIC (current_function_decl
))
7613 /* Rather than try to get this right with inlining, we suppress
7614 inlining of such functions. */
7615 current_function_cannot_inline
7616 = "function with static variable cannot be inline";
7617 DECL_UNINLINABLE (current_function_decl
) = 1;
7619 /* If flag_weak, we don't need to mess with this, as we can just
7620 make the function weak, and let it refer to its unique local
7621 copy. This works because we don't allow the function to be
7625 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7627 TREE_PUBLIC (decl
) = 1;
7628 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7630 else if (DECL_INITIAL (decl
) == NULL_TREE
7631 || DECL_INITIAL (decl
) == error_mark_node
)
7633 TREE_PUBLIC (decl
) = 1;
7634 DECL_COMMON (decl
) = 1;
7636 /* else we lose. We can only do this if we can use common,
7637 which we can't if it has been initialized. */
7639 if (TREE_PUBLIC (decl
))
7640 DECL_ASSEMBLER_NAME (decl
)
7641 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7644 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7645 cp_warning_at (" you can work around this by removing the initializer", decl
);
7649 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7650 /* Set it up again; we might have set DECL_INITIAL since the last
7652 comdat_linkage (decl
);
7655 /* Issue an error message if DECL is an uninitialized const variable. */
7658 check_for_uninitialized_const_var (decl
)
7661 tree type
= TREE_TYPE (decl
);
7663 /* ``Unless explicitly declared extern, a const object does not have
7664 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7666 if (TREE_CODE (decl
) == VAR_DECL
7667 && TREE_CODE (type
) != REFERENCE_TYPE
7668 && CP_TYPE_CONST_P (type
)
7669 && !TYPE_NEEDS_CONSTRUCTING (type
)
7670 && !DECL_INITIAL (decl
))
7671 cp_error ("uninitialized const `%D'", decl
);
7674 /* Verify INIT (the initializer for DECL), and record the
7675 initialization in DECL_INITIAL, if appropriate. Returns a new
7679 check_initializer (decl
, init
)
7685 if (TREE_CODE (decl
) == FIELD_DECL
)
7688 type
= TREE_TYPE (decl
);
7690 /* If `start_decl' didn't like having an initialization, ignore it now. */
7691 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7694 /* Check the initializer. */
7697 /* Things that are going to be initialized need to have complete
7699 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7701 if (type
== error_mark_node
)
7702 /* We will have already complained. */
7704 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7706 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7709 else if (TREE_CODE (type
) == ARRAY_TYPE
7710 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7712 cp_error ("elements of array `%#D' have incomplete type", decl
);
7715 else if (!COMPLETE_TYPE_P (type
))
7717 cp_error ("`%D' has incomplete type", decl
);
7718 TREE_TYPE (decl
) = error_mark_node
;
7723 if (TREE_CODE (decl
) == CONST_DECL
)
7725 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7727 DECL_INITIAL (decl
) = init
;
7729 /* This will keep us from needing to worry about our obstacks. */
7730 my_friendly_assert (init
!= NULL_TREE
, 149);
7733 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7735 if (TREE_STATIC (decl
))
7736 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7737 grok_reference_init (decl
, type
, init
);
7742 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7744 if (TREE_CODE (type
) == ARRAY_TYPE
)
7745 init
= digest_init (type
, init
, (tree
*) 0);
7746 else if (TREE_CODE (init
) == CONSTRUCTOR
7747 && TREE_HAS_CONSTRUCTOR (init
))
7749 if (TYPE_NON_AGGREGATE_CLASS (type
))
7751 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7753 init
= error_mark_node
;
7756 goto dont_use_constructor
;
7761 dont_use_constructor
:
7762 if (TREE_CODE (init
) != TREE_VEC
)
7763 init
= store_init_value (decl
, init
);
7767 /* We must hide the initializer so that expand_decl
7768 won't try to do something it does not understand. */
7769 init
= obscure_complex_init (decl
, init
);
7771 else if (DECL_EXTERNAL (decl
))
7773 else if (TYPE_P (type
)
7774 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7776 tree core_type
= strip_array_types (type
);
7778 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7780 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7781 cp_error ("structure `%D' with uninitialized const members", decl
);
7782 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7783 cp_error ("structure `%D' with uninitialized reference members",
7787 check_for_uninitialized_const_var (decl
);
7789 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7790 init
= obscure_complex_init (decl
, NULL_TREE
);
7794 check_for_uninitialized_const_var (decl
);
7799 /* If DECL is not a local variable, give it RTL. */
7802 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7805 const char *asmspec
;
7807 int toplev
= toplevel_bindings_p ();
7810 /* Handle non-variables up front. */
7811 if (TREE_CODE (decl
) != VAR_DECL
)
7813 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7817 /* If we see a class member here, it should be a static data
7819 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7821 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7822 /* An in-class declaration of a static data member should be
7823 external; it is only a declaration, and not a definition. */
7824 if (init
== NULL_TREE
)
7825 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7828 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7830 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7832 /* We don't create any RTL for local variables. */
7833 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7836 /* We defer emission of local statics until the corresponding
7837 DECL_STMT is expanded. */
7838 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7840 /* We try to defer namespace-scope static constants so that they are
7841 not emitted into the object file unncessarily. */
7842 if (!DECL_VIRTUAL_P (decl
)
7843 && TREE_READONLY (decl
)
7844 && DECL_INITIAL (decl
) != NULL_TREE
7845 && DECL_INITIAL (decl
) != error_mark_node
7846 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7848 && !TREE_PUBLIC (decl
))
7850 /* Fool with the linkage according to #pragma interface. */
7851 if (!interface_unknown
)
7853 TREE_PUBLIC (decl
) = 1;
7854 DECL_EXTERNAL (decl
) = interface_only
;
7860 /* If we're deferring the variable, just make RTL. Do not actually
7861 emit the variable. */
7863 make_decl_rtl (decl
, asmspec
, toplev
);
7864 /* If we're not deferring, go ahead and assemble the variable. */
7866 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7869 /* The old ARM scoping rules injected variables declared in the
7870 initialization statement of a for-statement into the surrounding
7871 scope. We support this usage, in order to be backward-compatible.
7872 DECL is a just-declared VAR_DECL; if necessary inject its
7873 declaration into the surrounding scope. */
7876 maybe_inject_for_scope_var (decl
)
7879 if (!DECL_NAME (decl
))
7882 if (current_binding_level
->is_for_scope
)
7884 struct binding_level
*outer
7885 = current_binding_level
->level_chain
;
7887 /* Check to see if the same name is already bound at the outer
7888 level, either because it was directly declared, or because a
7889 dead for-decl got preserved. In either case, the code would
7890 not have been valid under the ARM scope rules, so clear
7891 is_for_scope for the current_binding_level.
7893 Otherwise, we need to preserve the temp slot for decl to last
7894 into the outer binding level. */
7897 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7899 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7900 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7902 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7904 BINDING_VALUE (outer_binding
)
7905 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7906 current_binding_level
->is_for_scope
= 0;
7908 else if (DECL_IN_MEMORY_P (decl
))
7909 preserve_temp_slots (DECL_RTL (decl
));
7913 /* Generate code to initialize DECL (a local variable). */
7916 initialize_local_var (decl
, init
, flags
)
7921 tree type
= TREE_TYPE (decl
);
7923 /* If the type is bogus, don't bother initializing the variable. */
7924 if (type
== error_mark_node
)
7927 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7929 /* If we used it already as memory, it must stay in memory. */
7930 DECL_INITIAL (decl
) = NULL_TREE
;
7931 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7934 /* Local statics are handled differently from ordinary automatic
7936 if (TREE_STATIC (decl
))
7938 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7939 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7940 expand_static_init (decl
, init
);
7944 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7948 /* Compute and store the initial value. */
7949 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7951 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7953 int saved_stmts_are_full_exprs_p
;
7955 my_friendly_assert (building_stmt_tree (), 20000906);
7956 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7957 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7958 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7959 current_stmt_tree ()->stmts_are_full_exprs_p
=
7960 saved_stmts_are_full_exprs_p
;
7963 /* Set this to 0 so we can tell whether an aggregate which was
7964 initialized was ever used. Don't do this if it has a
7965 destructor, so we don't complain about the 'resource
7966 allocation is initialization' idiom. Now set
7967 attribute((unused)) on types so decls of that type will be
7968 marked used. (see TREE_USED, above.) */
7969 if (TYPE_NEEDS_CONSTRUCTING (type
)
7971 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7972 && DECL_NAME (decl
))
7973 TREE_USED (decl
) = 0;
7974 else if (already_used
)
7975 TREE_USED (decl
) = 1;
7979 /* Generate code to destroy DECL (a local variable). */
7982 destroy_local_var (decl
)
7985 tree type
= TREE_TYPE (decl
);
7988 /* Only variables get cleaned up. */
7989 if (TREE_CODE (decl
) != VAR_DECL
)
7992 /* And only things with destructors need cleaning up. */
7993 if (type
== error_mark_node
7994 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7997 if (TREE_CODE (decl
) == VAR_DECL
&&
7998 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7999 /* We don't clean up things that aren't defined in this
8000 translation unit, or that need a static cleanup. The latter
8001 are handled by finish_file. */
8004 /* Compute the cleanup. */
8005 cleanup
= maybe_build_cleanup (decl
);
8007 /* Record the cleanup required for this declaration. */
8008 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
8010 finish_decl_cleanup (decl
, cleanup
);
8013 /* Finish processing of a declaration;
8014 install its line number and initial value.
8015 If the length of an array type is not known before,
8016 it must be determined now, from the initial value, or it is an error.
8018 INIT holds the value of an initializer that should be allowed to escape
8021 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8022 if the (init) syntax was used. */
8025 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8031 tree ttype
= NULL_TREE
;
8032 const char *asmspec
= NULL
;
8033 int was_readonly
= 0;
8038 error ("assignment (not initialization) in declaration");
8042 /* If a name was specified, get the string. */
8044 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8046 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8048 cp_error ("cannot initialize `%D' to namespace `%D'",
8053 if (current_class_type
8054 && CP_DECL_CONTEXT (decl
) == current_class_type
8055 && TYPE_BEING_DEFINED (current_class_type
)
8056 && (DECL_INITIAL (decl
) || init
))
8057 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
8059 if (TREE_CODE (decl
) == VAR_DECL
8060 && DECL_CONTEXT (decl
)
8061 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8062 && DECL_CONTEXT (decl
) != current_namespace
8065 /* Leave the namespace of the object. */
8066 pop_decl_namespace ();
8069 type
= TREE_TYPE (decl
);
8071 if (type
== error_mark_node
)
8074 /* Add this declaration to the statement-tree. */
8075 if (building_stmt_tree ()
8076 && at_function_scope_p ()
8077 && TREE_CODE (decl
) != RESULT_DECL
)
8078 add_decl_stmt (decl
);
8080 if (TYPE_HAS_MUTABLE_P (type
))
8081 TREE_READONLY (decl
) = 0;
8083 if (processing_template_decl
)
8085 if (init
&& DECL_INITIAL (decl
))
8086 DECL_INITIAL (decl
) = init
;
8090 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8091 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8093 /* Take care of TYPE_DECLs up front. */
8094 if (TREE_CODE (decl
) == TYPE_DECL
)
8096 if (init
&& DECL_INITIAL (decl
))
8098 /* typedef foo = bar; store the type of bar as the type of foo. */
8099 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
8100 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8102 if (type
!= error_mark_node
8103 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8105 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8106 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8107 set_identifier_type_value (DECL_NAME (decl
), type
);
8108 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8110 GNU_xref_decl (current_function_decl
, decl
);
8112 /* If we have installed this as the canonical typedef for this
8113 type, and that type has not been defined yet, delay emitting
8114 the debug information for it, as we will emit it later. */
8115 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8116 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8117 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8119 rest_of_decl_compilation (decl
, NULL_PTR
,
8120 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8124 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8125 ttype
= target_type (type
);
8127 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8128 && TYPE_NEEDS_CONSTRUCTING (type
))
8130 /* Currently, GNU C++ puts constants in text space, making them
8131 impossible to initialize. In the future, one would hope for
8132 an operating system which understood the difference between
8133 initialization and the running of a program. */
8135 TREE_READONLY (decl
) = 0;
8138 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8140 /* This must override the asm specifier which was placed by
8141 grokclassfn. Lay this out fresh. */
8142 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8143 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8144 make_decl_rtl (decl
, asmspec
, 0);
8147 /* Deduce size of array from initialization, if not already known. */
8148 maybe_deduce_size_from_array_init (decl
, init
);
8149 init
= check_initializer (decl
, init
);
8151 GNU_xref_decl (current_function_decl
, decl
);
8153 if (TREE_CODE (decl
) == VAR_DECL
)
8154 layout_var_decl (decl
);
8156 /* Output the assembler code and/or RTL code for variables and functions,
8157 unless the type is an undefined structure or union.
8158 If not, it will get done when the type is completed. */
8159 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8160 || TREE_CODE (decl
) == RESULT_DECL
)
8162 if (TREE_CODE (decl
) == VAR_DECL
)
8163 maybe_commonize_var (decl
);
8165 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8167 if (TREE_CODE (type
) == FUNCTION_TYPE
8168 || TREE_CODE (type
) == METHOD_TYPE
)
8169 abstract_virtuals_error (decl
,
8170 strip_array_types (TREE_TYPE (type
)));
8172 abstract_virtuals_error (decl
, strip_array_types (type
));
8174 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8176 else if (DECL_EXTERNAL (decl
)
8177 && ! (DECL_LANG_SPECIFIC (decl
)
8178 && DECL_NOT_REALLY_EXTERN (decl
)))
8181 DECL_INITIAL (decl
) = init
;
8183 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8185 /* This is a local declaration. */
8186 if (doing_semantic_analysis_p ())
8187 maybe_inject_for_scope_var (decl
);
8188 /* Initialize the local variable. But, if we're building a
8189 statement-tree, we'll do the initialization when we
8191 if (processing_template_decl
)
8193 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8194 DECL_INITIAL (decl
) = init
;
8198 /* If we're not building RTL, then we need to do so
8200 my_friendly_assert (building_stmt_tree (), 20000906);
8201 /* Initialize the variable. */
8202 initialize_local_var (decl
, init
, flags
);
8203 /* Clean up the variable. */
8204 destroy_local_var (decl
);
8207 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8209 /* Cleanups for static variables are handled by `finish_file'. */
8210 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8211 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8212 expand_static_init (decl
, init
);
8216 /* Undo call to `pushclass' that was done in `start_decl'
8217 due to initialization of qualified member variable.
8218 I.e., Foo::x = 10; */
8220 tree context
= CP_DECL_CONTEXT (decl
);
8223 && (TREE_CODE (decl
) == VAR_DECL
8224 /* We also have a pushclass done that we need to undo here
8225 if we're at top level and declare a method. */
8226 || TREE_CODE (decl
) == FUNCTION_DECL
)
8227 /* If size hasn't been set, we're still defining it,
8228 and therefore inside the class body; don't pop
8229 the binding level.. */
8230 && COMPLETE_TYPE_P (context
)
8231 && context
== current_class_type
)
8232 pop_nested_class ();
8239 TREE_READONLY (decl
) = 1;
8242 /* This is here for a midend callback from c-common.c */
8245 finish_decl (decl
, init
, asmspec_tree
)
8249 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8252 /* Returns a declaration for a VAR_DECL as if:
8254 extern "C" TYPE NAME;
8256 had been seen. Used to create compiler-generated global
8260 declare_global_var (name
, type
)
8266 push_to_top_level ();
8267 decl
= build_decl (VAR_DECL
, name
, type
);
8268 TREE_PUBLIC (decl
) = 1;
8269 DECL_EXTERNAL (decl
) = 1;
8270 DECL_ARTIFICIAL (decl
) = 1;
8272 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8273 pop_from_top_level ();
8278 /* Returns a pointer to the `atexit' function. Note that if
8279 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8280 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8294 if (flag_use_cxa_atexit
)
8296 /* The declaration for `__cxa_atexit' is:
8298 int __cxa_atexit (void (*)(void *), void *, void *)
8300 We build up the argument types and then then function type
8303 /* First, build the pointer-to-function type for the first
8305 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8306 fn_type
= build_function_type (void_type_node
, arg_types
);
8307 fn_ptr_type
= build_pointer_type (fn_type
);
8308 /* Then, build the rest of the argument types. */
8309 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8310 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8311 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8312 /* And the final __cxa_atexit type. */
8313 fn_type
= build_function_type (integer_type_node
, arg_types
);
8314 fn_ptr_type
= build_pointer_type (fn_type
);
8315 name
= "__cxa_atexit";
8319 /* The declaration for `atexit' is:
8321 int atexit (void (*)());
8323 We build up the argument types and then then function type
8325 fn_type
= build_function_type (void_type_node
, void_list_node
);
8326 fn_ptr_type
= build_pointer_type (fn_type
);
8327 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8328 /* Build the final atexit type. */
8329 fn_type
= build_function_type (integer_type_node
, arg_types
);
8333 /* Now, build the function declaration. */
8334 push_lang_context (lang_name_c
);
8335 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8336 mark_used (atexit_fndecl
);
8337 pop_lang_context ();
8338 atexit_node
= default_conversion (atexit_fndecl
);
8343 /* Returns the __dso_handle VAR_DECL. */
8346 get_dso_handle_node ()
8348 if (dso_handle_node
)
8349 return dso_handle_node
;
8351 /* Declare the variable. */
8352 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8355 return dso_handle_node
;
8358 /* Begin a new function with internal linkage whose job will be simply
8359 to destroy some particular variable. */
8364 static int counter
= 0;
8365 int old_interface_unknown
= interface_unknown
;
8371 push_to_top_level ();
8373 /* No need to mangle this. */
8374 push_lang_context (lang_name_c
);
8376 interface_unknown
= 1;
8378 /* Build the parameter-types. */
8379 parmtypes
= void_list_node
;
8380 /* Functions passed to __cxa_atexit take an additional parameter.
8381 We'll just ignore it. After we implement the new calling
8382 convention for destructors, we can eliminate the use of
8383 additional cleanup functions entirely in the -fnew-abi case. */
8384 if (flag_use_cxa_atexit
)
8385 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8386 /* Build the function type itself. */
8387 fntype
= build_function_type (void_type_node
, parmtypes
);
8388 /* Build the name of the function. */
8389 sprintf (name
, "__tcf_%d", counter
++);
8390 /* Build the function declaration. */
8391 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8392 /* It's a function with internal linkage, generated by the
8394 TREE_PUBLIC (fndecl
) = 0;
8395 DECL_ARTIFICIAL (fndecl
) = 1;
8396 /* Make the function `inline' so that it is only emitted if it is
8397 actually needed. It is unlikely that it will be inlined, since
8398 it is only called via a function pointer, but we avoid unncessary
8399 emissions this way. */
8400 DECL_INLINE (fndecl
) = 1;
8401 /* Build the parameter. */
8402 if (flag_use_cxa_atexit
)
8406 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8407 DECL_CONTEXT (parmdecl
) = fndecl
;
8408 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8409 TREE_USED (parmdecl
) = 1;
8410 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8414 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8417 interface_unknown
= old_interface_unknown
;
8419 pop_lang_context ();
8421 return current_function_decl
;
8424 /* Finish the cleanup function begun by start_cleanup_fn. */
8431 expand_body (finish_function (0));
8433 pop_from_top_level ();
8436 /* Generate code to handle the destruction of DECL, an object with
8437 static storage duration. */
8440 register_dtor_fn (decl
)
8448 int saved_flag_access_control
;
8450 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8453 /* Call build_cleanup before we enter the anonymous function so that
8454 any access checks will be done relative to the current scope,
8455 rather than the scope of the anonymous function. */
8456 build_cleanup (decl
);
8458 /* Now start the function. */
8459 cleanup
= start_cleanup_fn ();
8461 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8462 to the original function, rather than the anonymous one. That
8463 will make the back-end think that nested functions are in use,
8464 which causes confusion. */
8465 saved_flag_access_control
= flag_access_control
;
8466 flag_access_control
= 0;
8467 fcall
= build_cleanup (decl
);
8468 flag_access_control
= saved_flag_access_control
;
8470 /* Create the body of the anonymous function. */
8471 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8472 finish_expr_stmt (fcall
);
8473 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8476 /* Call atexit with the cleanup function. */
8477 mark_addressable (cleanup
);
8478 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8479 if (flag_use_cxa_atexit
)
8481 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8482 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8483 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8486 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8487 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8491 expand_static_init (decl
, init
)
8495 tree oldstatic
= value_member (decl
, static_aggregates
);
8499 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8500 cp_error ("multiple initializations given for `%D'", decl
);
8502 else if (! toplevel_bindings_p ())
8504 /* Emit code to perform this initialization but once. */
8511 /* Emit code to perform this initialization but once. This code
8514 static int guard = 0;
8516 // Do initialization.
8518 // Register variable for destruction at end of program.
8521 Note that the `temp' variable is only set to 1 *after* the
8522 initialization is complete. This ensures that an exception,
8523 thrown during the construction, will cause the variable to
8524 reinitialized when we pass through this code again, as per:
8528 If the initialization exits by throwing an exception, the
8529 initialization is not complete, so it will be tried again
8530 the next time control enters the declaration.
8532 In theory, this process should be thread-safe, too; multiple
8533 threads should not be able to initialize the variable more
8534 than once. We don't yet attempt to ensure thread-safety. */
8536 /* Create the guard variable. */
8537 guard
= get_guard (decl
);
8539 /* Begin the conditional initialization. */
8540 if_stmt
= begin_if_stmt ();
8541 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8542 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8544 /* Do the initialization itself. */
8545 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8546 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8547 assignment
= build_aggr_init (decl
, init
, 0);
8549 /* The initialization we're doing here is just a bitwise
8551 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8553 assignment
= NULL_TREE
;
8555 /* Once the assignment is complete, set TEMP to 1. Since the
8556 construction of the static object is complete at this point,
8557 we want to make sure TEMP is set to 1 even if a temporary
8558 constructed during the initialization throws an exception
8559 when it is destroyed. So, we combine the initialization and
8560 the assignment to TEMP into a single expression, ensuring
8561 that when we call finish_expr_stmt the cleanups will not be
8562 run until after TEMP is set to 1. */
8563 guard_init
= set_guard (guard
);
8566 assignment
= tree_cons (NULL_TREE
, assignment
,
8567 build_tree_list (NULL_TREE
,
8569 assignment
= build_compound_expr (assignment
);
8572 assignment
= guard_init
;
8573 finish_expr_stmt (assignment
);
8575 /* Use atexit to register a function for destroying this static
8577 register_dtor_fn (decl
);
8579 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8580 finish_then_clause (if_stmt
);
8584 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8587 /* Finish the declaration of a catch-parameter. */
8590 start_handler_parms (declspecs
, declarator
)
8597 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8599 if (decl
== NULL_TREE
)
8600 error ("invalid catch parameter");
8609 /* Make TYPE a complete type based on INITIAL_VALUE.
8610 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8611 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8614 complete_array_type (type
, initial_value
, do_default
)
8615 tree type
, initial_value
;
8618 register tree maxindex
= NULL_TREE
;
8623 /* An array of character type can be initialized from a
8624 brace-enclosed string constant. */
8625 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8626 && TREE_CODE (initial_value
) == CONSTRUCTOR
8627 && CONSTRUCTOR_ELTS (initial_value
)
8628 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8630 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8631 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8633 /* Note MAXINDEX is really the maximum index, one less than the
8635 if (TREE_CODE (initial_value
) == STRING_CST
)
8638 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8639 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8642 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8644 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8646 maxindex
= ssize_int (-1);
8647 for (; elts
; elts
= TREE_CHAIN (elts
))
8649 if (TREE_PURPOSE (elts
))
8650 maxindex
= TREE_PURPOSE (elts
);
8652 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8654 maxindex
= copy_node (maxindex
);
8658 /* Make an error message unless that happened already. */
8659 if (initial_value
!= error_mark_node
)
8662 initial_value
= NULL_TREE
;
8664 /* Prevent further error messages. */
8665 maxindex
= build_int_2 (0, 0);
8672 maxindex
= build_int_2 (0, 0);
8681 domain
= build_index_type (maxindex
);
8682 TYPE_DOMAIN (type
) = domain
;
8684 if (! TREE_TYPE (maxindex
))
8685 TREE_TYPE (maxindex
) = domain
;
8687 itype
= TREE_TYPE (initial_value
);
8690 if (itype
&& !TYPE_DOMAIN (itype
))
8691 TYPE_DOMAIN (itype
) = domain
;
8692 /* The type of the main variant should never be used for arrays
8693 of different sizes. It should only ever be completed with the
8694 size of the array. */
8695 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8696 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8699 /* Lay out the type now that we can get the real answer. */
8706 /* Return zero if something is declared to be a member of type
8707 CTYPE when in the context of CUR_TYPE. STRING is the error
8708 message to print in that case. Otherwise, quietly return 1. */
8711 member_function_or_else (ctype
, cur_type
, flags
)
8712 tree ctype
, cur_type
;
8713 enum overload_flags flags
;
8715 if (ctype
&& ctype
!= cur_type
)
8717 if (flags
== DTOR_FLAG
)
8718 cp_error ("destructor for alien class `%T' cannot be a member",
8721 cp_error ("constructor for alien class `%T' cannot be a member",
8728 /* Subroutine of `grokdeclarator'. */
8730 /* Generate errors possibly applicable for a given set of specifiers.
8731 This is for ARM $7.1.2. */
8734 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8737 int virtualp
, quals
, friendp
, raises
, inlinep
;
8740 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8742 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8744 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8747 cp_error_at ("`%D' declared as a friend", object
);
8749 cp_error_at ("`%D' declared with an exception specification", object
);
8752 /* CTYPE is class type, or null if non-class.
8753 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8755 DECLARATOR is the function's name.
8756 VIRTUALP is truthvalue of whether the function is virtual or not.
8757 FLAGS are to be passed through to `grokclassfn'.
8758 QUALS are qualifiers indicating whether the function is `const'
8760 RAISES is a list of exceptions that this function can raise.
8761 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8762 not look, and -1 if we should not call `grokclassfn' at all.
8764 Returns `NULL_TREE' if something goes wrong, after issuing
8765 applicable error messages. */
8768 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8769 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8770 template_count
, in_namespace
)
8773 tree orig_declarator
;
8775 enum overload_flags flags
;
8777 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8781 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8782 int has_default_arg
= 0;
8786 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8787 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8793 type
= build_exception_variant (type
, raises
);
8796 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8797 /* Propagate volatile out from type to decl. */
8798 if (TYPE_VOLATILE (type
))
8799 TREE_THIS_VOLATILE (decl
) = 1;
8801 /* If this decl has namespace scope, set that up. */
8803 set_decl_namespace (decl
, in_namespace
, friendp
);
8805 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8807 /* `main' and builtins have implicit 'C' linkage. */
8808 if ((MAIN_NAME_P (declarator
)
8809 || (IDENTIFIER_LENGTH (declarator
) > 10
8810 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8811 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8812 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8813 && current_lang_name
== lang_name_cplusplus
8814 && ctype
== NULL_TREE
8815 /* NULL_TREE means global namespace. */
8816 && DECL_CONTEXT (decl
) == NULL_TREE
)
8817 DECL_LANGUAGE (decl
) = lang_c
;
8819 /* Should probably propagate const out from type to decl I bet (mrs). */
8822 DECL_STATIC_FUNCTION_P (decl
) = 1;
8823 DECL_CONTEXT (decl
) = ctype
;
8827 DECL_CONTEXT (decl
) = ctype
;
8829 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8831 if (processing_template_decl
)
8832 error ("cannot declare `::main' to be a template");
8834 error ("cannot declare `::main' to be inline");
8836 error ("cannot declare `::main' to be static");
8837 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8839 error ("`main' must return `int'");
8844 /* Members of anonymous types and local classes have no linkage; make
8846 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8847 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8852 /* [basic.link]: A name with no linkage (notably, the name of a class
8853 or enumeration declared in a local scope) shall not be used to
8854 declare an entity with linkage.
8856 Only check this for public decls for now. */
8857 t
= no_linkage_check (TREE_TYPE (decl
));
8860 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8862 if (DECL_EXTERN_C_P (decl
))
8863 /* Allow this; it's pretty common in C. */;
8865 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8869 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8874 TREE_PUBLIC (decl
) = publicp
;
8877 DECL_INTERFACE_KNOWN (decl
) = 1;
8878 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8882 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8884 DECL_EXTERNAL (decl
) = 1;
8885 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8887 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8888 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8892 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8893 grok_op_properties (decl
, virtualp
, check
< 0);
8895 if (ctype
&& decl_function_context (decl
))
8896 DECL_NO_STATIC_CHAIN (decl
) = 1;
8898 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8899 if (TREE_PURPOSE (t
)
8900 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8902 has_default_arg
= 1;
8907 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8911 ("defining explicit specialization `%D' in friend declaration",
8915 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8916 tree args
= TREE_OPERAND (orig_declarator
, 1);
8918 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8920 /* Something like `template <class T> friend void f<T>()'. */
8921 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8927 /* A friend declaration of the form friend void f<>(). Record
8928 the information in the TEMPLATE_ID_EXPR. */
8929 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8931 if (TREE_CODE (fns
) == COMPONENT_REF
)
8933 /* Due to bison parser ickiness, we will have already looked
8934 up an operator_name or PFUNCNAME within the current class
8935 (see template_id in parse.y). If the current class contains
8936 such a name, we'll get a COMPONENT_REF here. Undo that. */
8938 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8939 == current_class_type
, 20001120);
8940 fns
= TREE_OPERAND (fns
, 1);
8942 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8943 || TREE_CODE (fns
) == LOOKUP_EXPR
8944 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8945 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8947 if (has_default_arg
)
8949 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8956 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8963 if (has_default_arg
)
8964 add_defarg_fn (decl
);
8966 /* Plain overloading: will not be grok'd by grokclassfn. */
8967 if (! ctype
&& ! processing_template_decl
8968 && !DECL_EXTERN_C_P (decl
)
8969 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8970 set_mangled_name_for_decl (decl
);
8973 /* Make the init_value nonzero so pushdecl knows this is not
8974 tentative. error_mark_node is replaced later with the BLOCK. */
8975 DECL_INITIAL (decl
) = error_mark_node
;
8977 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8978 TREE_NOTHROW (decl
) = 1;
8980 /* Caller will do the rest of this. */
8984 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8985 DECL_CONSTRUCTOR_P (decl
) = 1;
8987 /* Function gets the ugly name, field gets the nice one. This call
8988 may change the type of the function (because of default
8990 if (ctype
!= NULL_TREE
)
8991 grokclassfn (ctype
, decl
, flags
, quals
);
8993 decl
= check_explicit_specialization (orig_declarator
, decl
,
8995 2 * (funcdef_flag
!= 0) +
8996 4 * (friendp
!= 0));
8997 if (decl
== error_mark_node
)
9000 if (ctype
!= NULL_TREE
9001 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
9006 old_decl
= check_classfn (ctype
, decl
);
9008 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
9009 /* Because grokfndecl is always supposed to return a
9010 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9011 here. We depend on our callers to figure out that its
9012 really a template that's being returned. */
9013 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
9015 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
9016 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
9018 /* Remove the `this' parm added by grokclassfn.
9019 XXX Isn't this done in start_function, too? */
9020 revert_static_member_fn (decl
);
9021 last_function_parms
= TREE_CHAIN (last_function_parms
);
9023 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
9024 cp_error ("definition of implicitly-declared `%D'", old_decl
);
9028 /* Since we've smashed OLD_DECL to its
9029 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9030 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9031 decl
= DECL_TEMPLATE_RESULT (decl
);
9033 /* Attempt to merge the declarations. This can fail, in
9034 the case of some illegal specialization declarations. */
9035 if (!duplicate_decls (decl
, old_decl
))
9036 cp_error ("no `%#D' member function declared in class `%T'",
9042 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
9045 if (ctype
== NULL_TREE
|| check
)
9049 DECL_VIRTUAL_P (decl
) = 1;
9055 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
9058 RID_BIT_TYPE
*specbits_in
;
9064 RID_BIT_TYPE specbits
;
9066 specbits
= *specbits_in
;
9068 if (TREE_CODE (type
) == OFFSET_TYPE
)
9070 /* If you declare a static member so that it
9071 can be initialized, the code will reach here. */
9072 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
9073 type
= TREE_TYPE (type
);
9074 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9075 DECL_CONTEXT (decl
) = basetype
;
9076 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9078 if (!uses_template_parms (decl
))
9081 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9083 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
9092 context
= in_namespace
;
9093 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9094 context
= current_namespace
;
9096 context
= NULL_TREE
;
9098 if (processing_template_decl
&& context
)
9099 /* For global variables, declared in a template, we need the
9101 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9103 decl
= build_decl (VAR_DECL
, declarator
, type
);
9106 set_decl_namespace (decl
, context
, 0);
9108 context
= DECL_CONTEXT (decl
);
9109 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9112 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9114 DECL_ASSEMBLER_NAME (decl
)
9115 = build_static_name (context
, declarator
);
9120 set_decl_namespace (decl
, in_namespace
, 0);
9122 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9124 DECL_THIS_EXTERN (decl
) = 1;
9125 DECL_EXTERNAL (decl
) = !initialized
;
9128 /* In class context, static means one per class,
9129 public access, and static storage. */
9130 if (DECL_CLASS_SCOPE_P (decl
))
9132 TREE_PUBLIC (decl
) = 1;
9133 TREE_STATIC (decl
) = 1;
9134 DECL_EXTERNAL (decl
) = 0;
9136 /* At top level, either `static' or no s.c. makes a definition
9137 (perhaps tentative), and absence of `static' makes it public. */
9138 else if (toplevel_bindings_p ())
9140 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9141 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9142 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9144 /* Not at top level, only `static' makes a static definition. */
9147 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9148 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9151 if (TREE_PUBLIC (decl
))
9153 /* [basic.link]: A name with no linkage (notably, the name of a class
9154 or enumeration declared in a local scope) shall not be used to
9155 declare an entity with linkage.
9157 Only check this for public decls for now. */
9158 tree t
= no_linkage_check (TREE_TYPE (decl
));
9161 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9162 /* Ignore for now; `enum { foo } e' is pretty common. */;
9164 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9172 /* Create and return a canonical pointer to member function type, for
9173 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9176 build_ptrmemfunc_type (type
)
9182 tree unqualified_variant
= NULL_TREE
;
9184 if (type
== error_mark_node
)
9187 /* If a canonical type already exists for this type, use it. We use
9188 this method instead of type_hash_canon, because it only does a
9189 simple equality check on the list of field members. */
9191 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9194 /* Make sure that we always have the unqualified pointer-to-member
9196 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9198 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9200 t
= make_aggr_type (RECORD_TYPE
);
9201 /* Let the front-end know this is a pointer to member function... */
9202 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9203 /* ... and not really an aggregate. */
9204 SET_IS_AGGR_TYPE (t
, 0);
9208 u
= make_aggr_type (UNION_TYPE
);
9209 SET_IS_AGGR_TYPE (u
, 0);
9210 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9211 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9213 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9214 TYPE_NAME (u
) = NULL_TREE
;
9216 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9218 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9220 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9221 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9225 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9226 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9228 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9231 /* Zap out the name so that the back-end will give us the debugging
9232 information for this anonymous RECORD_TYPE. */
9233 TYPE_NAME (t
) = NULL_TREE
;
9235 /* If this is not the unqualified form of this pointer-to-member
9236 type, set the TYPE_MAIN_VARIANT for this type to be the
9237 unqualified type. Since they are actually RECORD_TYPEs that are
9238 not variants of each other, we must do this manually. */
9239 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9241 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9242 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9243 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9244 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9247 /* Cache this pointer-to-member type so that we can find it again
9249 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9251 /* Seems to be wanted. */
9252 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9257 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9258 Check to see that the definition is valid. Issue appropriate error
9259 messages. Return 1 if the definition is particularly bad, or 0
9263 check_static_variable_definition (decl
, type
)
9267 /* Motion 10 at San Diego: If a static const integral data member is
9268 initialized with an integral constant expression, the initializer
9269 may appear either in the declaration (within the class), or in
9270 the definition, but not both. If it appears in the class, the
9271 member is a member constant. The file-scope definition is always
9273 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9275 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9277 /* If we just return the declaration, crashes will sometimes
9278 occur. We therefore return void_type_node, as if this was a
9279 friend declaration, to cause callers to completely ignore
9280 this declaration. */
9283 else if (!CP_TYPE_CONST_P (type
))
9284 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9286 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9287 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9292 /* Given the SIZE (i.e., number of elements) in an array, compute an
9293 appropriate index type for the array. If non-NULL, NAME is the
9294 name of the thing being declared. */
9297 compute_array_index_type (name
, size
)
9303 /* The size might be the result of a cast. */
9304 STRIP_TYPE_NOPS (size
);
9306 /* It might be a const variable or enumeration constant. */
9307 size
= decl_constant_value (size
);
9309 /* If this involves a template parameter, it will be a constant at
9310 instantiation time, but we don't know what the value is yet.
9311 Even if no template parameters are involved, we may an expression
9312 that is not a constant; we don't even simplify `1 + 2' when
9313 processing a template. */
9314 if (processing_template_decl
)
9316 /* Resolve a qualified reference to an enumerator or static
9317 const data member of ours. */
9318 if (TREE_CODE (size
) == SCOPE_REF
9319 && TREE_OPERAND (size
, 0) == current_class_type
)
9321 tree t
= lookup_field (current_class_type
,
9322 TREE_OPERAND (size
, 1), 0, 0);
9327 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9328 size
, integer_one_node
));
9331 /* The array bound must be an integer type. */
9332 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9333 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9334 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9337 cp_error ("size of array `%D' has non-integer type", name
);
9339 cp_error ("size of array has non-integer type");
9340 size
= integer_one_node
;
9343 /* Normally, the array-bound will be a constant. */
9344 if (TREE_CODE (size
) == INTEGER_CST
)
9346 /* Check to see if the array bound overflowed. Make that an
9347 error, no matter how generous we're being. */
9348 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9349 int old_pedantic
= pedantic
;
9350 pedantic
= flag_pedantic_errors
= 1;
9351 constant_expression_warning (size
);
9352 pedantic
= old_pedantic
;
9353 flag_pedantic_errors
= old_flag_pedantic_errors
;
9355 /* An array must have a positive number of elements. */
9356 if (INT_CST_LT (size
, integer_zero_node
))
9359 cp_error ("size of array `%D' is negative", name
);
9361 cp_error ("size of array is negative");
9362 size
= integer_one_node
;
9364 /* Except that an extension we allow zero-sized arrays. We
9365 always allow them in system headers because glibc uses
9367 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9370 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9372 cp_pedwarn ("ISO C++ forbids zero-size array");
9375 else if (TREE_CONSTANT (size
))
9377 /* `(int) &fn' is not a valid array bound. */
9379 cp_error ("size of array `%D' is not an integral constant-expression",
9382 cp_error ("size of array is not an integral constant-expression");
9385 /* Compute the index of the largest element in the array. It is
9386 one less than the number of elements in the array. */
9388 = fold (cp_build_binary_op (MINUS_EXPR
,
9389 cp_convert (ssizetype
, size
),
9390 cp_convert (ssizetype
,
9391 integer_one_node
)));
9393 /* Check for variable-sized arrays. We allow such things as an
9394 extension, even though they are not allowed in ANSI/ISO C++. */
9395 if (!TREE_CONSTANT (itype
))
9400 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9403 cp_pedwarn ("ISO C++ forbids variable-size array");
9406 /* Create a variable-sized array index type. */
9407 itype
= variable_size (itype
);
9409 /* Make sure that there was no overflow when creating to a signed
9410 index type. (For example, on a 32-bit machine, an array with
9411 size 2^32 - 1 is too big.) */
9412 else if (TREE_OVERFLOW (itype
))
9414 error ("overflow in array dimension");
9415 TREE_OVERFLOW (itype
) = 0;
9418 /* Create and return the appropriate index type. */
9419 return build_index_type (itype
);
9422 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9423 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9427 create_array_type_for_decl (name
, type
, size
)
9432 tree itype
= NULL_TREE
;
9433 const char* error_msg
;
9435 /* If things have already gone awry, bail now. */
9436 if (type
== error_mark_node
|| size
== error_mark_node
)
9437 return error_mark_node
;
9439 /* Assume that everything will go OK. */
9442 /* There are some types which cannot be array elements. */
9443 switch (TREE_CODE (type
))
9446 error_msg
= "array of void";
9450 error_msg
= "array of functions";
9453 case REFERENCE_TYPE
:
9454 error_msg
= "array of references";
9458 error_msg
= "array of data members";
9462 error_msg
= "array of function members";
9469 /* If something went wrong, issue an error-message and return. */
9473 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9475 cp_error ("creating %s", error_msg
);
9477 return error_mark_node
;
9482 The constant expressions that specify the bounds of the arrays
9483 can be omitted only for the first member of the sequence. */
9484 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9486 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9489 return error_mark_node
;
9492 /* Figure out the index type for the array. */
9494 itype
= compute_array_index_type (name
, size
);
9496 return build_cplus_array_type (type
, itype
);
9499 /* Check that it's OK to declare a function with the indicated TYPE.
9500 SFK indicates the kind of special function (if any) that this
9501 function is. CTYPE is the class of which this function is a
9502 member. OPTYPE is the type given in a conversion operator
9503 declaration. Returns the actual return type of the function; that
9504 may be different than TYPE if an error occurs, or for certain
9505 special functions. */
9508 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9509 special_function_kind sfk
;
9516 case sfk_constructor
:
9518 cp_error ("return type specification for constructor invalid");
9520 /* In the old ABI, we return `this'; in the new ABI we don't
9522 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9525 case sfk_destructor
:
9527 cp_error ("return type specification for destructor invalid");
9528 type
= void_type_node
;
9531 case sfk_conversion
:
9532 if (type
&& !same_type_p (type
, optype
))
9533 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9535 cp_pedwarn ("return type specified for `operator %T'", optype
);
9540 my_friendly_abort (20000408);
9547 /* Given declspecs and a declarator,
9548 determine the name and type of the object declared
9549 and construct a ..._DECL node for it.
9550 (In one case we can return a ..._TYPE node instead.
9551 For invalid input we sometimes return 0.)
9553 DECLSPECS is a chain of tree_list nodes whose value fields
9554 are the storage classes and type specifiers.
9556 DECL_CONTEXT says which syntactic context this declaration is in:
9557 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9558 FUNCDEF for a function definition. Like NORMAL but a few different
9559 error messages in each case. Return value may be zero meaning
9560 this definition is too screwy to try to parse.
9561 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9562 handle member functions (which have FIELD context).
9563 Return value may be zero meaning this definition is too screwy to
9565 PARM for a parameter declaration (either within a function prototype
9566 or before a function body). Make a PARM_DECL, or return void_type_node.
9567 CATCHPARM for a parameter declaration before a catch clause.
9568 TYPENAME if for a typename (in a cast or sizeof).
9569 Don't make a DECL node; just return the ..._TYPE node.
9570 FIELD for a struct or union field; make a FIELD_DECL.
9571 BITFIELD for a field with specified width.
9572 INITIALIZED is 1 if the decl has an initializer.
9574 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9575 normal attributes in TREE_PURPOSE, or NULL_TREE.
9577 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9578 It may also be so in the PARM case, for a prototype where the
9579 argument type is specified but not the name.
9581 This function is where the complicated C meanings of `static'
9582 and `extern' are interpreted.
9584 For C++, if there is any monkey business to do, the function which
9585 calls this one must do it, i.e., prepending instance variables,
9586 renaming overloaded function names, etc.
9588 Note that for this C++, it is an error to define a method within a class
9589 which does not belong to that class.
9591 Except in the case where SCOPE_REFs are implicitly known (such as
9592 methods within a class being redundantly qualified),
9593 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9594 (class_name::decl_name). The caller must also deal with this.
9596 If a constructor or destructor is seen, and the context is FIELD,
9597 then the type gains the attribute TREE_HAS_x. If such a declaration
9598 is erroneous, NULL_TREE is returned.
9600 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9601 function, these are the qualifiers to give to the `this' pointer. We
9602 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9604 May return void_type_node if the declarator turned out to be a friend.
9605 See grokfield for details. */
9608 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9611 enum decl_context decl_context
;
9615 RID_BIT_TYPE specbits
;
9618 tree type
= NULL_TREE
;
9624 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9625 int explicit_int
= 0;
9626 int explicit_char
= 0;
9627 int defaulted_int
= 0;
9628 tree typedef_decl
= NULL_TREE
;
9630 tree typedef_type
= NULL_TREE
;
9631 int funcdef_flag
= 0;
9632 enum tree_code innermost_code
= ERROR_MARK
;
9635 /* See the code below that used this. */
9636 tree decl_machine_attr
= NULL_TREE
;
9638 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9639 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9640 tree init
= NULL_TREE
;
9642 /* Keep track of what sort of function is being processed
9643 so that we can warn about default return values, or explicit
9644 return values which do not match prescribed defaults. */
9645 special_function_kind sfk
= sfk_none
;
9647 tree dname
= NULL_TREE
;
9648 tree ctype
= current_class_type
;
9649 tree ctor_return_type
= NULL_TREE
;
9650 enum overload_flags flags
= NO_SPECIAL
;
9651 tree quals
= NULL_TREE
;
9652 tree raises
= NULL_TREE
;
9653 int template_count
= 0;
9654 tree in_namespace
= NULL_TREE
;
9658 RIDBIT_RESET_ALL (specbits
);
9659 if (decl_context
== FUNCDEF
)
9660 funcdef_flag
= 1, decl_context
= NORMAL
;
9661 else if (decl_context
== MEMFUNCDEF
)
9662 funcdef_flag
= -1, decl_context
= FIELD
;
9663 else if (decl_context
== BITFIELD
)
9664 bitfield
= 1, decl_context
= FIELD
;
9666 /* Look inside a declarator for the name being declared
9667 and get it as a string, for an error message. */
9669 tree
*next
= &declarator
;
9673 while (next
&& *next
)
9676 switch (TREE_CODE (decl
))
9679 /* For attributes. */
9680 next
= &TREE_VALUE (decl
);
9685 next
= &TREE_OPERAND (decl
, 0);
9688 case BIT_NOT_EXPR
: /* For C++ destructors! */
9690 tree name
= TREE_OPERAND (decl
, 0);
9691 tree rename
= NULL_TREE
;
9693 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9695 sfk
= sfk_destructor
;
9696 if (TREE_CODE (name
) == TYPE_DECL
)
9697 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9698 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9699 if (ctype
== NULL_TREE
)
9701 if (current_class_type
== NULL_TREE
)
9703 error ("destructors must be member functions");
9708 tree t
= constructor_name (current_class_name
);
9715 tree t
= constructor_name (ctype
);
9722 cp_error ("destructor `%T' must match class name `%T'",
9724 TREE_OPERAND (decl
, 0) = rename
;
9730 case ADDR_EXPR
: /* C++ reference declaration */
9735 innermost_code
= TREE_CODE (decl
);
9736 next
= &TREE_OPERAND (decl
, 0);
9740 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9742 /* This is actually a variable declaration using
9743 constructor syntax. We need to call start_decl and
9744 cp_finish_decl so we can get the variable
9747 tree attributes
, prefix_attributes
;
9749 *next
= TREE_OPERAND (decl
, 0);
9750 init
= CALL_DECLARATOR_PARMS (decl
);
9754 attributes
= TREE_PURPOSE (attrlist
);
9755 prefix_attributes
= TREE_VALUE (attrlist
);
9759 attributes
= NULL_TREE
;
9760 prefix_attributes
= NULL_TREE
;
9763 decl
= start_decl (declarator
, declspecs
, 1,
9764 attributes
, prefix_attributes
);
9765 decl_type_access_control (decl
);
9768 /* Look for __unused__ attribute */
9769 if (TREE_USED (TREE_TYPE (decl
)))
9770 TREE_USED (decl
) = 1;
9771 finish_decl (decl
, init
, NULL_TREE
);
9774 cp_error ("invalid declarator");
9777 innermost_code
= TREE_CODE (decl
);
9778 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9779 ctype
= current_class_type
;
9781 && TREE_OPERAND (decl
, 0)
9782 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9783 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9784 == constructor_name_full (ctype
))
9785 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9786 == constructor_name (ctype
)))))
9787 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9788 next
= &TREE_OPERAND (decl
, 0);
9790 if (ctype
!= NULL_TREE
9791 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9792 && decl
== constructor_name (ctype
))
9794 sfk
= sfk_constructor
;
9795 ctor_return_type
= ctype
;
9800 case TEMPLATE_ID_EXPR
:
9802 tree fns
= TREE_OPERAND (decl
, 0);
9804 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9805 fns
= TREE_OPERAND (fns
, 0);
9808 if (TREE_CODE (dname
) == COMPONENT_REF
)
9809 dname
= TREE_OPERAND (dname
, 1);
9810 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9812 my_friendly_assert (is_overloaded_fn (dname
),
9814 dname
= DECL_NAME (get_first_fn (dname
));
9819 case IDENTIFIER_NODE
:
9820 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9825 if (C_IS_RESERVED_WORD (dname
))
9827 cp_error ("declarator-id missing; using reserved word `%D'",
9829 name
= IDENTIFIER_POINTER (dname
);
9831 else if (!IDENTIFIER_TYPENAME_P (dname
))
9832 name
= IDENTIFIER_POINTER (dname
);
9835 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9836 flags
= TYPENAME_FLAG
;
9837 ctor_return_type
= TREE_TYPE (dname
);
9838 sfk
= sfk_conversion
;
9839 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9840 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9842 name
= IDENTIFIER_POINTER (dname
);
9844 name
= "<invalid operator>";
9851 /* Perform error checking, and decide on a ctype. */
9852 tree cname
= TREE_OPERAND (decl
, 0);
9853 if (cname
== NULL_TREE
)
9855 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9858 in_namespace
= TREE_OPERAND (decl
, 0);
9859 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9861 else if (! is_aggr_type (cname
, 1))
9862 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9863 /* Must test TREE_OPERAND (decl, 1), in case user gives
9864 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9865 else if (TREE_OPERAND (decl
, 1)
9866 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9868 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9869 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9871 cp_error ("`%T::%D' is not a valid declarator", cname
,
9872 TREE_OPERAND (decl
, 1));
9873 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9874 cname
, TREE_OPERAND (decl
, 1));
9875 return void_type_node
;
9877 else if (ctype
== NULL_TREE
)
9879 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9880 TREE_OPERAND (decl
, 0) = ctype
;
9883 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9885 cp_error ("type `%T' is not derived from type `%T'",
9887 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9893 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9894 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9895 == constructor_name_full (ctype
))
9896 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9897 == constructor_name (ctype
))))
9898 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9899 next
= &TREE_OPERAND (decl
, 1);
9903 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9904 && constructor_name (ctype
) == decl
)
9906 sfk
= sfk_constructor
;
9907 ctor_return_type
= ctype
;
9909 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9910 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9911 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9912 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9914 sfk
= sfk_destructor
;
9915 ctor_return_type
= ctype
;
9917 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9918 next
= &TREE_OPERAND (decl
, 0);
9929 /* Parse error puts this typespec where
9930 a declarator should go. */
9931 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9932 if (TREE_TYPE (decl
) == current_class_type
)
9933 cp_error (" perhaps you want `%T' for a constructor",
9934 current_class_name
);
9935 dname
= DECL_NAME (decl
);
9936 name
= IDENTIFIER_POINTER (dname
);
9938 /* Avoid giving two errors for this. */
9939 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9941 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9947 cp_compiler_error ("`%D' as declarator", decl
);
9948 return 0; /* We used to do a 155 abort here. */
9953 /* A function definition's declarator must have the form of
9954 a function declarator. */
9956 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9959 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9960 && innermost_code
!= CALL_EXPR
9961 && ! (ctype
&& declspecs
== NULL_TREE
))
9963 cp_error ("declaration of `%D' as non-function", dname
);
9964 return void_type_node
;
9967 /* Anything declared one level down from the top level
9968 must be one of the parameters of a function
9969 (because the body is at least two levels down). */
9971 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9972 by not allowing C++ class definitions to specify their parameters
9973 with xdecls (must be spec.d in the parmlist).
9975 Since we now wait to push a class scope until we are sure that
9976 we are in a legitimate method context, we must set oldcname
9977 explicitly (since current_class_name is not yet alive).
9979 We also want to avoid calling this a PARM if it is in a namespace. */
9981 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9983 struct binding_level
*b
= current_binding_level
;
9984 current_binding_level
= b
->level_chain
;
9985 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9986 decl_context
= PARM
;
9987 current_binding_level
= b
;
9991 name
= decl_context
== PARM
? "parameter" : "type name";
9993 /* Look through the decl specs and record which ones appear.
9994 Some typespecs are defined as built-in typenames.
9995 Others, the ones that are modifiers of other types,
9996 are represented by bits in SPECBITS: set the bits for
9997 the modifiers that appear. Storage class keywords are also in SPECBITS.
9999 If there is a typedef name or a type, store the type in TYPE.
10000 This includes builtin typedefs such as `int'.
10002 Set EXPLICIT_INT if the type is `int' or `char' and did not
10003 come from a user typedef.
10005 Set LONGLONG if `long' is mentioned twice.
10007 For C++, constructors and destructors have their own fast treatment. */
10009 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
10014 /* Certain parse errors slip through. For example,
10015 `int class;' is not caught by the parser. Try
10016 weakly to recover here. */
10017 if (TREE_CODE (spec
) != TREE_LIST
)
10020 id
= TREE_VALUE (spec
);
10022 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10024 if (id
== ridpointers
[(int) RID_INT
]
10025 || id
== ridpointers
[(int) RID_CHAR
]
10026 || id
== ridpointers
[(int) RID_BOOL
]
10027 || id
== ridpointers
[(int) RID_WCHAR
])
10031 if (id
== ridpointers
[(int) RID_BOOL
])
10032 error ("`bool' is now a keyword");
10034 cp_error ("extraneous `%T' ignored", id
);
10038 if (id
== ridpointers
[(int) RID_INT
])
10040 else if (id
== ridpointers
[(int) RID_CHAR
])
10042 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
10046 /* C++ aggregate types. */
10047 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
10050 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
10052 type
= IDENTIFIER_TYPE_VALUE (id
);
10056 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10058 if (ridpointers
[i
] == id
)
10060 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10062 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10063 pedwarn ("ISO C++ does not support `long long'");
10065 error ("`long long long' is too long for GCC");
10069 else if (RIDBIT_SETP (i
, specbits
))
10070 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10071 RIDBIT_SET (i
, specbits
);
10076 /* C++ aggregate types. */
10077 else if (TREE_CODE (id
) == TYPE_DECL
)
10080 cp_error ("multiple declarations `%T' and `%T'", type
,
10084 type
= TREE_TYPE (id
);
10085 TREE_VALUE (spec
) = type
;
10090 error ("two or more data types in declaration of `%s'", name
);
10091 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10093 register tree t
= lookup_name (id
, 1);
10094 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10095 error ("`%s' fails to be a typedef or built in type",
10096 IDENTIFIER_POINTER (id
));
10099 type
= TREE_TYPE (t
);
10101 /* See the code below that used this. */
10102 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
10107 else if (id
!= error_mark_node
)
10108 /* Can't change CLASS nodes into RECORD nodes here! */
10114 typedef_type
= type
;
10116 /* No type at all: default to `int', and set DEFAULTED_INT
10117 because it was not a user-defined typedef. */
10119 if (type
== NULL_TREE
10120 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10121 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10122 || RIDBIT_SETP (RID_LONG
, specbits
)
10123 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10125 /* These imply 'int'. */
10126 type
= integer_type_node
;
10130 if (sfk
!= sfk_none
)
10131 type
= check_special_function_return_type (sfk
, type
,
10134 else if (type
== NULL_TREE
)
10140 /* We handle `main' specially here, because 'main () { }' is so
10141 common. With no options, it is allowed. With -Wreturn-type,
10142 it is a warning. It is only an error with -pedantic-errors. */
10143 is_main
= (funcdef_flag
10144 && MAIN_NAME_P (dname
)
10145 && ctype
== NULL_TREE
10146 && in_namespace
== NULL_TREE
10147 && current_namespace
== global_namespace
);
10149 if (in_system_header
|| flag_ms_extensions
)
10150 /* Allow it, sigh. */;
10151 else if (pedantic
|| ! is_main
)
10152 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10154 else if (warn_return_type
)
10155 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10158 type
= integer_type_node
;
10163 /* Now process the modifiers that were specified
10164 and check for invalid combinations. */
10166 /* Long double is a special combination. */
10168 if (RIDBIT_SETP (RID_LONG
, specbits
)
10169 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10171 RIDBIT_RESET (RID_LONG
, specbits
);
10172 type
= build_qualified_type (long_double_type_node
,
10173 CP_TYPE_QUALS (type
));
10176 /* Check all other uses of type modifiers. */
10178 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10179 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10180 || RIDBIT_SETP (RID_LONG
, specbits
)
10181 || RIDBIT_SETP (RID_SHORT
, specbits
))
10185 if (TREE_CODE (type
) == REAL_TYPE
)
10186 error ("short, signed or unsigned invalid for `%s'", name
);
10187 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10188 error ("long, short, signed or unsigned invalid for `%s'", name
);
10189 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10190 && RIDBIT_SETP (RID_SHORT
, specbits
))
10191 error ("long and short specified together for `%s'", name
);
10192 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10193 || RIDBIT_SETP (RID_SHORT
, specbits
))
10195 error ("long or short specified with char for `%s'", name
);
10196 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10197 || RIDBIT_SETP (RID_SHORT
, specbits
))
10198 && TREE_CODE (type
) == REAL_TYPE
)
10199 error ("long or short specified with floating type for `%s'", name
);
10200 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10201 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10202 error ("signed and unsigned given together for `%s'", name
);
10206 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10208 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10210 if (flag_pedantic_errors
)
10215 /* Discard the type modifiers if they are invalid. */
10218 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10219 RIDBIT_RESET (RID_SIGNED
, specbits
);
10220 RIDBIT_RESET (RID_LONG
, specbits
);
10221 RIDBIT_RESET (RID_SHORT
, specbits
);
10226 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10227 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10229 error ("complex invalid for `%s'", name
);
10230 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10233 /* Decide whether an integer type is signed or not.
10234 Optionally treat bitfields as signed by default. */
10235 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10238 It is implementation-defined whether a plain (neither
10239 explicitly signed or unsigned) char, short, int, or long
10240 bit-field is signed or unsigned.
10242 Naturally, we extend this to long long as well. Note that
10243 this does not include wchar_t. */
10244 || (bitfield
&& !flag_signed_bitfields
10245 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10246 /* A typedef for plain `int' without `signed' can be
10247 controlled just like plain `int', but a typedef for
10248 `signed int' cannot be so controlled. */
10250 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10251 && (TREE_CODE (type
) == INTEGER_TYPE
10252 || TREE_CODE (type
) == CHAR_TYPE
)
10253 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10256 type
= long_long_unsigned_type_node
;
10257 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10258 type
= long_unsigned_type_node
;
10259 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10260 type
= short_unsigned_type_node
;
10261 else if (type
== char_type_node
)
10262 type
= unsigned_char_type_node
;
10263 else if (typedef_decl
)
10264 type
= unsigned_type (type
);
10266 type
= unsigned_type_node
;
10268 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10269 && type
== char_type_node
)
10270 type
= signed_char_type_node
;
10272 type
= long_long_integer_type_node
;
10273 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10274 type
= long_integer_type_node
;
10275 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10276 type
= short_integer_type_node
;
10278 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10280 /* If we just have "complex", it is equivalent to
10281 "complex double", but if any modifiers at all are specified it is
10282 the complex form of TYPE. E.g, "complex short" is
10283 "complex short int". */
10285 if (defaulted_int
&& ! longlong
10286 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10287 || RIDBIT_SETP (RID_SHORT
, specbits
)
10288 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10289 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10290 type
= complex_double_type_node
;
10291 else if (type
== integer_type_node
)
10292 type
= complex_integer_type_node
;
10293 else if (type
== float_type_node
)
10294 type
= complex_float_type_node
;
10295 else if (type
== double_type_node
)
10296 type
= complex_double_type_node
;
10297 else if (type
== long_double_type_node
)
10298 type
= complex_long_double_type_node
;
10300 type
= build_complex_type (type
);
10303 if (sfk
== sfk_conversion
10304 && (RIDBIT_SETP (RID_CONST
, specbits
)
10305 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10306 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10307 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10310 /* Set CONSTP if this declaration is `const', whether by
10311 explicit specification or via a typedef.
10312 Likewise for VOLATILEP. */
10314 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10316 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10318 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10319 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10320 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10321 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10322 type
= cp_build_qualified_type (type
, type_quals
);
10324 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10325 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10326 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10327 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10328 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10330 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10331 staticp
= 1 + (decl_context
== FIELD
);
10333 if (virtualp
&& staticp
== 2)
10335 cp_error ("member `%D' cannot be declared both virtual and static",
10339 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10340 RIDBIT_RESET (RID_FRIEND
, specbits
);
10342 /* Warn if two storage classes are given. Default to `auto'. */
10344 if (RIDBIT_ANY_SET (specbits
))
10346 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10347 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10348 if (decl_context
== PARM
&& nclasses
> 0)
10349 error ("storage class specifiers invalid in parameter declarations");
10350 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10352 if (decl_context
== PARM
)
10353 error ("typedef declaration invalid in parameter declaration");
10356 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10357 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10360 /* Give error if `virtual' is used outside of class declaration. */
10362 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10364 error ("virtual outside class declaration");
10368 /* Static anonymous unions are dealt with here. */
10369 if (staticp
&& decl_context
== TYPENAME
10370 && TREE_CODE (declspecs
) == TREE_LIST
10371 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10372 decl_context
= FIELD
;
10374 /* Warn about storage classes that are invalid for certain
10375 kinds of declarations (parameters, typenames, etc.). */
10378 error ("multiple storage classes in declaration of `%s'", name
);
10379 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10381 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10382 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10383 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10385 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10387 else if (decl_context
== FIELD
10388 /* C++ allows static class elements */
10389 && RIDBIT_SETP (RID_STATIC
, specbits
))
10390 /* C++ also allows inlines and signed and unsigned elements,
10391 but in those cases we don't come in here. */
10395 if (decl_context
== FIELD
)
10397 tree tmp
= NULL_TREE
;
10398 register int op
= 0;
10402 /* Avoid trying to get an operand off an identifier node. */
10403 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10406 tmp
= TREE_OPERAND (declarator
, 0);
10407 op
= IDENTIFIER_OPNAME_P (tmp
);
10408 if (IDENTIFIER_TYPENAME_P (tmp
))
10410 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10411 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10413 name
= IDENTIFIER_POINTER (tmp
);
10415 name
= "<invalid operator>";
10418 error ("storage class specified for %s `%s'",
10419 op
? "member operator" : "field",
10424 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10425 error ("storage class specified for parameter `%s'", name
);
10427 error ("storage class specified for typename");
10429 RIDBIT_RESET (RID_REGISTER
, specbits
);
10430 RIDBIT_RESET (RID_AUTO
, specbits
);
10431 RIDBIT_RESET (RID_EXTERN
, specbits
);
10434 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10436 if (toplevel_bindings_p ())
10438 /* It's common practice (and completely valid) to have a const
10439 be initialized and declared extern. */
10440 if (!(type_quals
& TYPE_QUAL_CONST
))
10441 warning ("`%s' initialized and declared `extern'", name
);
10444 error ("`%s' has both `extern' and initializer", name
);
10446 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10447 && ! toplevel_bindings_p ())
10448 error ("nested function `%s' declared `extern'", name
);
10449 else if (toplevel_bindings_p ())
10451 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10452 error ("top-level declaration of `%s' specifies `auto'", name
);
10455 if (nclasses
> 0 && friendp
)
10456 error ("storage class specifiers invalid in friend function declarations");
10458 /* Now figure out the structure of the declarator proper.
10459 Descend through it, creating more complex types, until we reach
10460 the declared identifier (or NULL_TREE, in an absolute declarator). */
10462 inner_attrs
= NULL_TREE
;
10465 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10466 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10468 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10469 an INDIRECT_REF (for *...),
10470 a CALL_EXPR (for ...(...)),
10471 an identifier (for the name being declared)
10472 or a null pointer (for the place in an absolute declarator
10473 where the name was omitted).
10474 For the last two cases, we have just exited the loop.
10476 For C++ it could also be
10477 a SCOPE_REF (for class :: ...). In this case, we have converted
10478 sensible names to types, and those are the values we use to
10479 qualify the member name.
10480 an ADDR_EXPR (for &...),
10481 a BIT_NOT_EXPR (for destructors)
10483 At this point, TYPE is the type of elements of an array,
10484 or for a function to return, or for a pointer to point to.
10485 After this sequence of ifs, TYPE is the type of the
10486 array or function or pointer, and DECLARATOR has had its
10487 outermost layer removed. */
10489 if (type
== error_mark_node
)
10491 if (TREE_CODE (declarator
) == SCOPE_REF
)
10492 declarator
= TREE_OPERAND (declarator
, 1);
10494 declarator
= TREE_OPERAND (declarator
, 0);
10497 if (quals
!= NULL_TREE
10498 && (declarator
== NULL_TREE
10499 || TREE_CODE (declarator
) != SCOPE_REF
))
10501 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10502 ctype
= TYPE_METHOD_BASETYPE (type
);
10503 if (ctype
!= NULL_TREE
)
10505 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10506 grok_method_quals (ctype
, dummy
, quals
);
10507 type
= TREE_TYPE (dummy
);
10508 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10513 /* See the comment for the TREE_LIST case, below. */
10516 else if (inner_attrs
)
10518 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10519 inner_attrs
= NULL_TREE
;
10522 switch (TREE_CODE (declarator
))
10526 /* We encode a declarator with embedded attributes using
10527 a TREE_LIST. The attributes apply to the declarator
10528 directly inside them, so we have to skip an iteration
10529 before applying them to the type. If the declarator just
10530 inside is the declarator-id, we apply the attrs to the
10532 inner_attrs
= TREE_PURPOSE (declarator
);
10534 declarator
= TREE_VALUE (declarator
);
10540 register tree size
;
10542 size
= TREE_OPERAND (declarator
, 1);
10544 /* VC++ spells a zero-sized array with []. */
10545 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10546 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10547 size
= integer_zero_node
;
10549 declarator
= TREE_OPERAND (declarator
, 0);
10551 type
= create_array_type_for_decl (dname
, type
, size
);
10553 /* VLAs never work as fields. */
10554 if (decl_context
== FIELD
&& !processing_template_decl
10555 && TREE_CODE (type
) == ARRAY_TYPE
10556 && TYPE_DOMAIN (type
) != NULL_TREE
10557 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10559 cp_error ("size of member `%D' is not constant", dname
);
10560 /* Proceed with arbitrary constant size, so that offset
10561 computations don't get confused. */
10562 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10574 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10575 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10577 /* Declaring a function type.
10578 Make sure we have a valid type for the function to return. */
10580 /* We now know that the TYPE_QUALS don't apply to the
10581 decl, but to its return type. */
10582 type_quals
= TYPE_UNQUALIFIED
;
10584 /* Warn about some types functions can't return. */
10586 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10588 error ("`%s' declared as function returning a function", name
);
10589 type
= integer_type_node
;
10591 if (TREE_CODE (type
) == ARRAY_TYPE
)
10593 error ("`%s' declared as function returning an array", name
);
10594 type
= integer_type_node
;
10597 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10598 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10600 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10601 inner_decl
= dname
;
10603 /* Pick up type qualifiers which should be applied to `this'. */
10604 quals
= CALL_DECLARATOR_QUALS (declarator
);
10606 /* Pick up the exception specifications. */
10607 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10609 /* Say it's a definition only for the CALL_EXPR
10610 closest to the identifier. */
10613 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10614 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10615 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10617 if (ctype
== NULL_TREE
10618 && decl_context
== FIELD
10620 && (friendp
== 0 || dname
== current_class_name
))
10621 ctype
= current_class_type
;
10623 if (ctype
&& sfk
== sfk_conversion
)
10624 TYPE_HAS_CONVERSION (ctype
) = 1;
10625 if (ctype
&& constructor_name (ctype
) == dname
)
10627 /* We are within a class's scope. If our declarator name
10628 is the same as the class name, and we are defining
10629 a function, then it is a constructor/destructor, and
10630 therefore returns a void type. */
10632 if (flags
== DTOR_FLAG
)
10634 /* ISO C++ 12.4/2. A destructor may not be
10635 declared const or volatile. A destructor may
10638 error ("destructor cannot be static member function");
10641 cp_error ("destructors may not be `%s'",
10642 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10645 if (decl_context
== FIELD
)
10647 if (! member_function_or_else (ctype
,
10648 current_class_type
,
10650 return void_type_node
;
10653 else /* It's a constructor. */
10655 if (explicitp
== 1)
10657 /* ISO C++ 12.1. A constructor may not be
10658 declared const or volatile. A constructor may
10659 not be virtual. A constructor may not be
10662 error ("constructor cannot be static member function");
10665 pedwarn ("constructors cannot be declared virtual");
10670 cp_error ("constructors may not be `%s'",
10671 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10675 RID_BIT_TYPE tmp_bits
;
10676 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10677 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10678 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10679 if (RIDBIT_ANY_SET (tmp_bits
))
10680 error ("return value type specifier for constructor ignored");
10682 if (decl_context
== FIELD
)
10684 if (! member_function_or_else (ctype
,
10685 current_class_type
,
10687 return void_type_node
;
10688 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10689 if (sfk
!= sfk_constructor
)
10693 if (decl_context
== FIELD
)
10699 error ("can't initialize friend function `%s'", name
);
10702 /* Cannot be both friend and virtual. */
10703 error ("virtual functions cannot be friends");
10704 RIDBIT_RESET (RID_FRIEND
, specbits
);
10707 if (decl_context
== NORMAL
)
10708 error ("friend declaration not in class definition");
10709 if (current_function_decl
&& funcdef_flag
)
10710 cp_error ("can't define friend function `%s' in a local class definition",
10714 /* Construct the function type and go to the next
10715 inner layer of declarator. */
10717 declarator
= TREE_OPERAND (declarator
, 0);
10719 /* FIXME: This is where default args should be fully
10722 arg_types
= grokparms (inner_parms
);
10724 if (declarator
&& flags
== DTOR_FLAG
)
10726 /* A destructor declared in the body of a class will
10727 be represented as a BIT_NOT_EXPR. But, we just
10728 want the underlying IDENTIFIER. */
10729 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10730 declarator
= TREE_OPERAND (declarator
, 0);
10732 if (arg_types
!= void_list_node
)
10734 cp_error ("destructors may not have parameters");
10735 arg_types
= void_list_node
;
10736 last_function_parms
= NULL_TREE
;
10740 /* ANSI says that `const int foo ();'
10741 does not make the function foo const. */
10742 type
= build_function_type (type
, arg_types
);
10746 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10747 if (TREE_PURPOSE (t
)
10748 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10750 add_defarg_fn (type
);
10759 /* Filter out pointers-to-references and references-to-references.
10760 We can get these if a TYPE_DECL is used. */
10762 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10764 error ("cannot declare %s to references",
10765 TREE_CODE (declarator
) == ADDR_EXPR
10766 ? "references" : "pointers");
10767 declarator
= TREE_OPERAND (declarator
, 0);
10771 if (TREE_CODE (type
) == OFFSET_TYPE
10772 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10773 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10775 cp_error ("cannot declare pointer to `%#T' member",
10777 type
= TREE_TYPE (type
);
10780 /* Merge any constancy or volatility into the target type
10781 for the pointer. */
10783 /* We now know that the TYPE_QUALS don't apply to the decl,
10784 but to the target of the pointer. */
10785 type_quals
= TYPE_UNQUALIFIED
;
10787 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10789 if (TREE_CODE (type
) == VOID_TYPE
)
10790 error ("invalid type: `void &'");
10792 type
= build_reference_type (type
);
10794 else if (TREE_CODE (type
) == METHOD_TYPE
)
10795 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10797 type
= build_pointer_type (type
);
10799 /* Process a list of type modifier keywords (such as
10800 const or volatile) that were given inside the `*' or `&'. */
10802 if (TREE_TYPE (declarator
))
10804 register tree typemodlist
;
10810 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10811 typemodlist
= TREE_CHAIN (typemodlist
))
10813 tree qualifier
= TREE_VALUE (typemodlist
);
10815 if (qualifier
== ridpointers
[(int) RID_CONST
])
10817 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10819 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10824 error ("invalid type modifier within pointer declarator");
10828 pedwarn ("duplicate `const'");
10830 pedwarn ("duplicate `volatile'");
10832 pedwarn ("duplicate `restrict'");
10834 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10835 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10836 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10837 if (TREE_CODE (declarator
) == ADDR_EXPR
10838 && (constp
|| volatilep
))
10841 pedwarn ("discarding `const' applied to a reference");
10843 pedwarn ("discarding `volatile' applied to a reference");
10844 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10846 type
= cp_build_qualified_type (type
, type_quals
);
10848 declarator
= TREE_OPERAND (declarator
, 0);
10854 /* We have converted type names to NULL_TREE if the
10855 name was bogus, or to a _TYPE node, if not.
10857 The variable CTYPE holds the type we will ultimately
10858 resolve to. The code here just needs to build
10859 up appropriate member types. */
10860 tree sname
= TREE_OPERAND (declarator
, 1);
10863 /* Destructors can have their visibilities changed as well. */
10864 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10865 sname
= TREE_OPERAND (sname
, 0);
10867 if (TREE_COMPLEXITY (declarator
) == 0)
10868 /* This needs to be here, in case we are called
10869 multiple times. */ ;
10870 else if (TREE_COMPLEXITY (declarator
) == -1)
10871 /* Namespace member. */
10872 pop_decl_namespace ();
10873 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10874 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10875 else if (! IS_AGGR_TYPE_CODE
10876 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10878 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10880 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10881 that refer to ctype. They couldn't be resolved earlier
10882 because we hadn't pushed into the class yet.
10883 Example: resolve 'B<T>::type' in
10884 'B<typename B<T>::type> B<T>::f () { }'. */
10885 if (current_template_parms
10886 && uses_template_parms (type
)
10887 && uses_template_parms (current_class_type
))
10889 tree args
= current_template_args ();
10890 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10893 /* This pop_nested_class corresponds to the
10894 push_nested_class used to push into class scope for
10895 parsing the argument list of a function decl, in
10897 pop_nested_class ();
10898 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10901 my_friendly_abort (16);
10903 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10905 /* We had a reference to a global decl, or
10906 perhaps we were given a non-aggregate typedef,
10907 in which case we cleared this out, and should just
10908 keep going as though it wasn't there. */
10909 declarator
= sname
;
10912 ctype
= TREE_OPERAND (declarator
, 0);
10915 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10917 /* You're supposed to have one `template <...>'
10918 for every template class, but you don't need one
10919 for a full specialization. For example:
10921 template <class T> struct S{};
10922 template <> struct S<int> { void f(); };
10923 void S<int>::f () {}
10925 is correct; there shouldn't be a `template <>' for
10926 the definition of `S<int>::f'. */
10927 if (CLASSTYPE_TEMPLATE_INFO (t
)
10928 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10929 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10930 template_count
+= 1;
10932 t
= TYPE_MAIN_DECL (t
);
10933 if (DECL_LANG_SPECIFIC (t
))
10934 t
= DECL_CONTEXT (t
);
10939 if (sname
== NULL_TREE
)
10942 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10944 /* This is the `standard' use of the scoping operator:
10945 basetype :: member . */
10947 if (ctype
== current_class_type
)
10953 Is this ill-formed? */
10956 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10959 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10961 if (current_class_type
== NULL_TREE
|| friendp
)
10962 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10963 TYPE_ARG_TYPES (type
));
10966 cp_error ("cannot declare member function `%T::%s' within `%T'",
10967 ctype
, name
, current_class_type
);
10968 return void_type_node
;
10971 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10972 || COMPLETE_TYPE_P (complete_type (ctype
)))
10974 /* Have to move this code elsewhere in this function.
10975 this code is used for i.e., typedef int A::M; M *pm;
10977 It is? How? jason 10/2/94 */
10979 if (current_class_type
)
10981 cp_error ("cannot declare member `%T::%s' within `%T'",
10982 ctype
, name
, current_class_type
);
10983 return void_type_node
;
10985 type
= build_offset_type (ctype
, type
);
10989 incomplete_type_error (NULL_TREE
, ctype
);
10990 return error_mark_node
;
10993 declarator
= sname
;
10995 else if (TREE_CODE (sname
) == SCOPE_REF
)
10996 my_friendly_abort (17);
11000 declarator
= TREE_OPERAND (declarator
, 1);
11001 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
11002 /* In this case, we will deal with it later. */
11006 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11007 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11008 TYPE_ARG_TYPES (type
));
11010 type
= build_offset_type (ctype
, type
);
11017 declarator
= TREE_OPERAND (declarator
, 0);
11022 case ENUMERAL_TYPE
:
11023 declarator
= NULL_TREE
;
11027 declarator
= NULL_TREE
;
11031 my_friendly_abort (158);
11035 /* See the comment for the TREE_LIST case, above. */
11038 if (! ignore_attrs
)
11039 decl_attributes (type
, inner_attrs
, NULL_TREE
);
11041 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
11043 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
11046 /* Now TYPE has the actual type. */
11048 if (explicitp
== 1 || (explicitp
&& friendp
))
11050 /* [dcl.fct.spec] The explicit specifier shall only be used in
11051 declarations of constructors within a class definition. */
11052 error ("only declarations of constructors can be `explicit'");
11056 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11058 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11060 error ("non-member `%s' cannot be declared `mutable'", name
);
11061 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11063 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11065 error ("non-object member `%s' cannot be declared `mutable'", name
);
11066 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11068 else if (TREE_CODE (type
) == FUNCTION_TYPE
11069 || TREE_CODE (type
) == METHOD_TYPE
)
11071 error ("function `%s' cannot be declared `mutable'", name
);
11072 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11076 error ("static `%s' cannot be declared `mutable'", name
);
11077 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11079 else if (type_quals
& TYPE_QUAL_CONST
)
11081 error ("const `%s' cannot be declared `mutable'", name
);
11082 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11086 if (declarator
== NULL_TREE
11087 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11088 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11089 && (TREE_CODE (type
) == FUNCTION_TYPE
11090 || TREE_CODE (type
) == METHOD_TYPE
)))
11092 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11094 cp_error ("template-id `%D' used as a declarator", declarator
);
11095 declarator
= dname
;
11098 /* Unexpected declarator format. */
11099 my_friendly_abort (990210);
11101 /* If this is declaring a typedef name, return a TYPE_DECL. */
11103 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11107 /* Note that the grammar rejects storage classes
11108 in typenames, fields or parameters. */
11109 if (current_lang_name
== lang_name_java
)
11110 TYPE_FOR_JAVA (type
) = 1;
11112 if (decl_context
== FIELD
)
11114 if (declarator
== constructor_name (current_class_type
))
11115 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11117 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11120 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11122 /* If the user declares "typedef struct {...} foo" then the
11123 struct will have an anonymous name. Fill that name in now.
11124 Nothing can refer to it, so nothing needs know about the name
11126 if (type
!= error_mark_node
11128 && TYPE_NAME (type
)
11129 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11130 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11131 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11133 tree oldname
= TYPE_NAME (type
);
11136 /* Replace the anonymous name with the real name everywhere. */
11137 lookup_tag_reverse (type
, declarator
);
11138 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11139 if (TYPE_NAME (t
) == oldname
)
11140 TYPE_NAME (t
) = decl
;
11142 if (TYPE_LANG_SPECIFIC (type
))
11143 TYPE_WAS_ANONYMOUS (type
) = 1;
11145 /* If this is a typedef within a template class, the nested
11146 type is a (non-primary) template. The name for the
11147 template needs updating as well. */
11148 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11149 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11150 = TYPE_IDENTIFIER (type
);
11153 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11156 /* XXX Temporarily set the scope.
11157 When returning, start_decl expects it as NULL_TREE,
11158 and will then then set it using pushdecl. */
11159 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11160 if (current_class_type
)
11161 DECL_CONTEXT (decl
) = current_class_type
;
11163 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11165 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11166 DECL_ASSEMBLER_NAME (decl
)
11167 = get_identifier (build_overload_name (type
, 1, 1));
11168 DECL_CONTEXT (decl
) = NULL_TREE
;
11171 /* FIXME remangle member functions; member functions of a
11172 type with external linkage have external linkage. */
11175 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11177 cp_error_at ("typedef name may not be class-qualified", decl
);
11182 if (ctype
== NULL_TREE
)
11184 if (TREE_CODE (type
) != METHOD_TYPE
)
11185 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11187 ctype
= TYPE_METHOD_BASETYPE (type
);
11189 if (ctype
!= NULL_TREE
)
11190 grok_method_quals (ctype
, decl
, quals
);
11193 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11194 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11195 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11197 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11198 inlinep
, friendp
, raises
!= NULL_TREE
);
11201 error ("typedef declaration includes an initializer");
11206 /* Detect the case of an array type of unspecified size
11207 which came, as such, direct from a typedef name.
11208 We must copy the type, so that each identifier gets
11209 a distinct type, so that each identifier's size can be
11210 controlled separately by its own initializer. */
11212 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11213 && TYPE_DOMAIN (type
) == NULL_TREE
)
11215 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11218 /* If this is a type name (such as, in a cast or sizeof),
11219 compute the type and return it now. */
11221 if (decl_context
== TYPENAME
)
11223 /* Note that the grammar rejects storage classes
11224 in typenames, fields or parameters. */
11225 if (type_quals
!= TYPE_UNQUALIFIED
)
11226 type_quals
= TYPE_UNQUALIFIED
;
11228 /* Special case: "friend class foo" looks like a TYPENAME context. */
11231 if (type_quals
!= TYPE_UNQUALIFIED
)
11233 cp_error ("type qualifiers specified for friend class declaration");
11234 type_quals
= TYPE_UNQUALIFIED
;
11238 cp_error ("`inline' specified for friend class declaration");
11242 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11243 But don't allow implicit typenames except with a class-key. */
11244 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11245 || IMPLICIT_TYPENAME_P (type
)))
11247 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11248 cp_pedwarn ("template parameters cannot be friends");
11249 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11251 friend declaration requires class-key, i.e. `friend class %T::%T'",
11252 constructor_name (current_class_type
),
11253 TYPE_IDENTIFIER (type
));
11256 friend declaration requires class-key, i.e. `friend %#T'",
11260 /* Only try to do this stuff if we didn't already give up. */
11261 if (type
!= integer_type_node
)
11263 decl_type_access_control (TYPE_NAME (type
));
11265 /* A friendly class? */
11266 if (current_class_type
)
11267 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11269 cp_error ("trying to make class `%T' a friend of global scope",
11272 type
= void_type_node
;
11277 if (ctype
== NULL_TREE
)
11279 if (TREE_CODE (type
) != METHOD_TYPE
)
11280 cp_error ("invalid qualifiers on non-member function type");
11282 ctype
= TYPE_METHOD_BASETYPE (type
);
11286 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11287 grok_method_quals (ctype
, dummy
, quals
);
11288 type
= TREE_TYPE (dummy
);
11294 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11295 && decl_context
!= CATCHPARM
11296 && TREE_CODE (type
) != UNION_TYPE
11299 cp_error ("abstract declarator `%T' used as declaration", type
);
11300 declarator
= make_anon_name ();
11303 /* `void' at top level (not within pointer)
11304 is allowed only in typedefs or type names.
11305 We don't complain about parms either, but that is because
11306 a better error message can be made later. */
11308 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11311 error ("unnamed variable or field declared void");
11312 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11314 if (IDENTIFIER_OPNAME_P (declarator
))
11315 my_friendly_abort (356);
11317 error ("variable or field `%s' declared void", name
);
11320 error ("variable or field declared void");
11321 type
= integer_type_node
;
11324 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11325 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11327 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11329 if (ctype
|| in_namespace
)
11330 error ("cannot use `::' in parameter declaration");
11332 /* A parameter declared as an array of T is really a pointer to T.
11333 One declared as a function is really a pointer to a function.
11334 One declared as a member is really a pointer to member. */
11336 if (TREE_CODE (type
) == ARRAY_TYPE
)
11338 /* Transfer const-ness of array into that of type pointed to. */
11339 type
= build_pointer_type (TREE_TYPE (type
));
11340 type_quals
= TYPE_UNQUALIFIED
;
11342 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11343 type
= build_pointer_type (type
);
11344 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11345 type
= build_pointer_type (type
);
11349 register tree decl
;
11351 if (decl_context
== PARM
)
11353 decl
= build_decl (PARM_DECL
, declarator
, type
);
11355 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11356 inlinep
, friendp
, raises
!= NULL_TREE
);
11358 /* Compute the type actually passed in the parmlist,
11359 for the case where there is no prototype.
11360 (For example, shorts and chars are passed as ints.)
11361 When there is a prototype, this is overridden later. */
11363 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11365 else if (decl_context
== FIELD
)
11367 if (type
== error_mark_node
)
11369 /* Happens when declaring arrays of sizes which
11370 are error_mark_node, for example. */
11373 else if (in_namespace
&& !friendp
)
11375 /* Something like struct S { int N::j; }; */
11376 cp_error ("invalid use of `::'");
11379 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11382 tree function_context
;
11384 /* We catch the others as conflicts with the builtin
11386 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11388 cp_error ("function `%D' cannot be declared friend",
11395 if (ctype
== NULL_TREE
)
11396 ctype
= current_class_type
;
11398 if (ctype
== NULL_TREE
)
11400 cp_error ("can't make `%D' into a method -- not in a class",
11402 return void_type_node
;
11405 /* ``A union may [ ... ] not [ have ] virtual functions.''
11407 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11409 cp_error ("function `%D' declared virtual inside a union",
11411 return void_type_node
;
11414 if (declarator
== ansi_opname (NEW_EXPR
)
11415 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11416 || declarator
== ansi_opname (DELETE_EXPR
)
11417 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11421 cp_error ("`%D' cannot be declared virtual, since it is always static",
11426 else if (staticp
< 2)
11427 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11428 TYPE_ARG_TYPES (type
));
11431 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11432 function_context
= (ctype
!= NULL_TREE
) ?
11433 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11434 publicp
= (! friendp
|| ! staticp
)
11435 && function_context
== NULL_TREE
;
11436 decl
= grokfndecl (ctype
, type
,
11437 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11438 ? declarator
: dname
,
11440 virtualp
, flags
, quals
, raises
,
11441 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11442 funcdef_flag
, template_count
, in_namespace
);
11443 if (decl
== NULL_TREE
)
11446 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11447 /* The decl and setting of decl_machine_attr is also turned off. */
11448 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11451 /* [class.conv.ctor]
11453 A constructor declared without the function-specifier
11454 explicit that can be called with a single parameter
11455 specifies a conversion from the type of its first
11456 parameter to the type of its class. Such a constructor
11457 is called a converting constructor. */
11458 if (explicitp
== 2)
11459 DECL_NONCONVERTING_P (decl
) = 1;
11460 else if (DECL_CONSTRUCTOR_P (decl
))
11462 /* The constructor can be called with exactly one
11463 parameter if there is at least one parameter, and
11464 any subsequent parameters have default arguments.
11465 We don't look at the first parameter, which is
11466 really just the `this' parameter for the new
11469 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11471 /* Skip the `in_chrg' argument too, if present. */
11472 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11473 arg_types
= TREE_CHAIN (arg_types
);
11475 if (arg_types
== void_list_node
11477 && TREE_CHAIN (arg_types
)
11478 && TREE_CHAIN (arg_types
) != void_list_node
11479 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11480 DECL_NONCONVERTING_P (decl
) = 1;
11483 else if (TREE_CODE (type
) == METHOD_TYPE
)
11485 /* We only get here for friend declarations of
11486 members of other classes. */
11487 /* All method decls are public, so tell grokfndecl to set
11488 TREE_PUBLIC, also. */
11489 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11490 virtualp
, flags
, quals
, raises
,
11491 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11492 template_count
, in_namespace
);
11493 if (decl
== NULL_TREE
)
11496 else if (!staticp
&& ! processing_template_decl
11497 && !COMPLETE_TYPE_P (complete_type (type
))
11498 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11501 cp_error ("field `%D' has incomplete type", declarator
);
11503 cp_error ("name `%T' has incomplete type", type
);
11505 /* If we're instantiating a template, tell them which
11506 instantiation made the field's type be incomplete. */
11507 if (current_class_type
11508 && TYPE_NAME (current_class_type
)
11509 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11510 && declspecs
&& TREE_VALUE (declspecs
)
11511 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11512 cp_error (" in instantiation of template `%T'",
11513 current_class_type
);
11515 type
= error_mark_node
;
11522 error ("`%s' is neither function nor member function; cannot be declared friend",
11523 IDENTIFIER_POINTER (declarator
));
11531 /* Friends are treated specially. */
11532 if (ctype
== current_class_type
)
11533 warning ("member functions are implicitly friends of their class");
11536 tree t
= NULL_TREE
;
11537 if (decl
&& DECL_NAME (decl
))
11539 if (template_class_depth (current_class_type
) == 0)
11542 = check_explicit_specialization
11544 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11545 if (decl
== error_mark_node
)
11546 return error_mark_node
;
11549 t
= do_friend (ctype
, declarator
, decl
,
11550 last_function_parms
, attrlist
, flags
, quals
,
11553 if (t
&& funcdef_flag
)
11556 return void_type_node
;
11560 /* Structure field. It may not be a function, except for C++ */
11562 if (decl
== NULL_TREE
)
11568 /* An attempt is being made to initialize a non-static
11569 member. But, from [class.mem]:
11571 4 A member-declarator can contain a
11572 constant-initializer only if it declares a static
11573 member (_class.static_) of integral or enumeration
11574 type, see _class.static.data_.
11576 This used to be relatively common practice, but
11577 the rest of the compiler does not correctly
11578 handle the initialization unless the member is
11579 static so we make it static below. */
11580 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11582 cp_pedwarn ("making `%D' static", declarator
);
11586 if (uses_template_parms (type
))
11587 /* We'll check at instantiation time. */
11589 else if (check_static_variable_definition (declarator
,
11591 /* If we just return the declaration, crashes
11592 will sometimes occur. We therefore return
11593 void_type_node, as if this was a friend
11594 declaration, to cause callers to completely
11595 ignore this declaration. */
11596 return void_type_node
;
11599 /* 9.2p13 [class.mem] */
11600 if (declarator
== constructor_name (current_class_type
)
11601 /* The standard does not allow non-static data members
11602 here either, but we agreed at the 10/99 meeting
11603 to change that in TC 1 so that they are allowed in
11604 classes with no user-defined constructors. */
11606 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11611 /* C++ allows static class members. All other work
11612 for this is done by grokfield. */
11613 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11614 TREE_STATIC (decl
) = 1;
11615 /* In class context, 'static' means public access. */
11616 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11620 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11621 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11622 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11624 DECL_MUTABLE_P (decl
) = 1;
11625 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11629 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11630 inlinep
, friendp
, raises
!= NULL_TREE
);
11633 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11635 tree original_name
;
11641 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11642 original_name
= dname
;
11644 original_name
= declarator
;
11646 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11647 error ("storage class `auto' invalid for function `%s'", name
);
11648 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11649 error ("storage class `register' invalid for function `%s'", name
);
11651 /* Function declaration not at top level.
11652 Storage classes other than `extern' are not allowed
11653 and `extern' makes no difference. */
11654 if (! toplevel_bindings_p ()
11655 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11656 || RIDBIT_SETP (RID_INLINE
, specbits
))
11659 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11660 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11662 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11665 if (ctype
== NULL_TREE
)
11669 error ("virtual non-class function `%s'", name
);
11673 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11674 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11675 TYPE_ARG_TYPES (type
));
11677 /* Record presence of `static'. */
11678 publicp
= (ctype
!= NULL_TREE
11679 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11680 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11682 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11683 virtualp
, flags
, quals
, raises
,
11685 publicp
, inlinep
, funcdef_flag
,
11686 template_count
, in_namespace
);
11687 if (decl
== NULL_TREE
)
11692 int illegal_static
= 0;
11694 /* Don't allow a static member function in a class, and forbid
11695 declaring main to be static. */
11696 if (TREE_CODE (type
) == METHOD_TYPE
)
11698 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11699 illegal_static
= 1;
11701 else if (current_function_decl
)
11703 /* FIXME need arm citation */
11704 error ("cannot declare static function inside another function");
11705 illegal_static
= 1;
11708 if (illegal_static
)
11711 RIDBIT_RESET (RID_STATIC
, specbits
);
11717 /* It's a variable. */
11719 /* An uninitialized decl with `extern' is a reference. */
11720 decl
= grokvardecl (type
, declarator
, &specbits
,
11722 (type_quals
& TYPE_QUAL_CONST
) != 0,
11724 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11725 inlinep
, friendp
, raises
!= NULL_TREE
);
11729 DECL_CONTEXT (decl
) = ctype
;
11732 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11734 RIDBIT_RESET (RID_STATIC
, specbits
);
11736 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11738 cp_error ("static member `%D' declared `register'", decl
);
11739 RIDBIT_RESET (RID_REGISTER
, specbits
);
11741 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11743 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11745 RIDBIT_RESET (RID_EXTERN
, specbits
);
11750 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11752 /* Record `register' declaration for warnings on &
11753 and in case doing stupid register allocation. */
11755 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11756 DECL_REGISTER (decl
) = 1;
11758 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11759 DECL_THIS_EXTERN (decl
) = 1;
11761 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11762 DECL_THIS_STATIC (decl
) = 1;
11764 /* Record constancy and volatility. There's no need to do this
11765 when processing a template; we'll do this for the instantiated
11766 declaration based on the type of DECL. */
11767 if (!processing_template_decl
)
11768 c_apply_type_quals_to_decl (type_quals
, decl
);
11774 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11775 An empty exprlist is a parmlist. An exprlist which
11776 contains only identifiers at the global level
11777 is a parmlist. Otherwise, it is an exprlist. */
11780 parmlist_is_exprlist (exprs
)
11783 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11786 if (toplevel_bindings_p ())
11788 /* At the global level, if these are all identifiers,
11789 then it is a parmlist. */
11792 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11794 exprs
= TREE_CHAIN (exprs
);
11801 /* Subroutine of start_function. Ensure that each of the parameter
11802 types (as listed in PARMS) is complete, as is required for a
11803 function definition. */
11806 require_complete_types_for_parms (parms
)
11809 for (; parms
; parms
= TREE_CHAIN (parms
))
11811 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11812 /* grokparms will have already issued an error */
11813 TREE_TYPE (parms
) = error_mark_node
;
11814 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11815 layout_decl (parms
, 0);
11817 TREE_TYPE (parms
) = error_mark_node
;
11821 /* Returns non-zero if T is a local variable. */
11824 local_variable_p (t
)
11827 if ((TREE_CODE (t
) == VAR_DECL
11828 /* A VAR_DECL with a context that is a _TYPE is a static data
11830 && !TYPE_P (CP_DECL_CONTEXT (t
))
11831 /* Any other non-local variable must be at namespace scope. */
11832 && !DECL_NAMESPACE_SCOPE_P (t
))
11833 || (TREE_CODE (t
) == PARM_DECL
))
11839 /* Returns non-zero if T is an automatic local variable or a label.
11840 (These are the declarations that need to be remapped when the code
11841 containing them is duplicated.) */
11844 nonstatic_local_decl_p (t
)
11847 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11848 || TREE_CODE (t
) == LABEL_DECL
11849 || TREE_CODE (t
) == RESULT_DECL
);
11852 /* Like local_variable_p, but suitable for use as a tree-walking
11856 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11858 int *walk_subtrees ATTRIBUTE_UNUSED
;
11859 void *data ATTRIBUTE_UNUSED
;
11861 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11862 ? *tp
: NULL_TREE
);
11865 /* Check that ARG, which is a default-argument expression for a
11866 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11867 something goes wrong. DECL may also be a _TYPE node, rather than a
11868 DECL, if there is no DECL available. */
11871 check_default_argument (decl
, arg
)
11878 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11879 /* We get a DEFAULT_ARG when looking at an in-class declaration
11880 with a default argument. Ignore the argument for now; we'll
11881 deal with it after the class is complete. */
11884 if (processing_template_decl
|| uses_template_parms (arg
))
11885 /* We don't do anything checking until instantiation-time. Note
11886 that there may be uninstantiated arguments even for an
11887 instantiated function, since default arguments are not
11888 instantiated until they are needed. */
11897 decl_type
= TREE_TYPE (decl
);
11899 if (arg
== error_mark_node
11900 || decl
== error_mark_node
11901 || TREE_TYPE (arg
) == error_mark_node
11902 || decl_type
== error_mark_node
)
11903 /* Something already went wrong. There's no need to check
11905 return error_mark_node
;
11907 /* [dcl.fct.default]
11909 A default argument expression is implicitly converted to the
11911 if (!TREE_TYPE (arg
)
11912 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11915 cp_error ("default argument for `%#D' has type `%T'",
11916 decl
, TREE_TYPE (arg
));
11918 cp_error ("default argument for parameter of type `%T' has type `%T'",
11919 decl_type
, TREE_TYPE (arg
));
11921 return error_mark_node
;
11924 /* [dcl.fct.default]
11926 Local variables shall not be used in default argument
11929 The keyword `this' shall not be used in a default argument of a
11930 member function. */
11931 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11935 cp_error ("default argument `%E' uses local variable `%D'",
11937 return error_mark_node
;
11944 /* Decode the list of parameter types for a function type.
11945 Given the list of things declared inside the parens,
11946 return a list of types.
11948 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11949 flag. If unset, we append void_list_node. A parmlist declared
11950 as `(void)' is accepted as the empty parmlist.
11952 Also set last_function_parms to the chain of PARM_DECLs. */
11955 grokparms (first_parm
)
11958 tree result
= NULL_TREE
;
11959 tree decls
= NULL_TREE
;
11960 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
11964 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
11966 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11968 tree type
= NULL_TREE
;
11969 register tree decl
= TREE_VALUE (parm
);
11970 tree init
= TREE_PURPOSE (parm
);
11972 chain
= TREE_CHAIN (parm
);
11973 /* @@ weak defense against parse errors. */
11974 if (TREE_CODE (decl
) != VOID_TYPE
11975 && TREE_CODE (decl
) != TREE_LIST
)
11977 /* Give various messages as the need arises. */
11978 if (TREE_CODE (decl
) == STRING_CST
)
11979 cp_error ("invalid string constant `%E'", decl
);
11980 else if (TREE_CODE (decl
) == INTEGER_CST
)
11981 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11985 if (parm
== void_list_node
)
11988 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
11989 PARM
, init
!= NULL_TREE
, NULL_TREE
);
11990 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11993 type
= TREE_TYPE (decl
);
11994 if (VOID_TYPE_P (type
))
11996 if (same_type_p (type
, void_type_node
)
11997 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
11998 /* this is a parmlist of `(void)', which is ok. */
12000 incomplete_type_error (decl
, type
);
12001 /* It's not a good idea to actually create parameters of
12002 type `void'; other parts of the compiler assume that a
12003 void type terminates the parameter list. */
12004 type
= error_mark_node
;
12005 TREE_TYPE (decl
) = error_mark_node
;
12008 if (type
!= error_mark_node
)
12010 /* Top-level qualifiers on the parameters are
12011 ignored for function types. */
12012 type
= TYPE_MAIN_VARIANT (type
);
12013 if (TREE_CODE (type
) == METHOD_TYPE
)
12015 cp_error ("parameter `%D' invalidly declared method type", decl
);
12016 type
= build_pointer_type (type
);
12017 TREE_TYPE (decl
) = type
;
12019 else if (TREE_CODE (type
) == OFFSET_TYPE
)
12021 cp_error ("parameter `%D' invalidly declared offset type", decl
);
12022 type
= build_pointer_type (type
);
12023 TREE_TYPE (decl
) = type
;
12025 else if (abstract_virtuals_error (decl
, type
))
12026 any_error
= 1; /* Seems like a good idea. */
12027 else if (POINTER_TYPE_P (type
))
12029 /* [dcl.fct]/6, parameter types cannot contain pointers
12030 (references) to arrays of unknown bound. */
12033 while (POINTER_TYPE_P (t
)
12034 || (TREE_CODE (t
) == ARRAY_TYPE
12035 && TYPE_DOMAIN (t
) != NULL_TREE
))
12037 if (TREE_CODE (t
) == ARRAY_TYPE
)
12038 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
12039 decl
, TYPE_PTR_P (type
) ? "pointer" : "reference", t
);
12042 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
12043 if (PROMOTE_PROTOTYPES
12044 && (TREE_CODE (type
) == INTEGER_TYPE
12045 || TREE_CODE (type
) == ENUMERAL_TYPE
)
12046 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
12047 DECL_ARG_TYPE (decl
) = integer_type_node
;
12048 if (!any_error
&& init
)
12049 init
= check_default_argument (decl
, init
);
12054 TREE_CHAIN (decl
) = decls
;
12056 result
= tree_cons (init
, type
, result
);
12058 decls
= nreverse (decls
);
12059 result
= nreverse (result
);
12061 result
= chainon (result
, void_list_node
);
12062 last_function_parms
= decls
;
12067 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12068 FUNCTION_TYPE with the newly parsed version of its default argument, which
12069 was previously digested as text. See snarf_defarg et al in lex.c. */
12072 replace_defarg (arg
, init
)
12075 if (! processing_template_decl
12076 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
12077 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12078 TREE_TYPE (init
), TREE_VALUE (arg
));
12079 TREE_PURPOSE (arg
) = init
;
12082 /* D is a constructor or overloaded `operator='. Returns non-zero if
12083 D's arguments allow it to be a copy constructor, or copy assignment
12092 if (!DECL_FUNCTION_MEMBER_P (d
))
12095 t
= FUNCTION_ARG_CHAIN (d
);
12096 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
12097 t
= TREE_CHAIN (t
);
12098 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12099 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12100 == DECL_CONTEXT (d
))
12101 && (TREE_CHAIN (t
) == NULL_TREE
12102 || TREE_CHAIN (t
) == void_list_node
12103 || TREE_PURPOSE (TREE_CHAIN (t
))))
12108 /* These memoizing functions keep track of special properties which
12109 a class may have. `grok_ctor_properties' notices whether a class
12110 has a constructor of the form X(X&), and also complains
12111 if the class has a constructor of the form X(X).
12112 `grok_op_properties' takes notice of the various forms of
12113 operator= which are defined, as well as what sorts of type conversion
12114 may apply. Both functions take a FUNCTION_DECL as an argument. */
12117 grok_ctor_properties (ctype
, decl
)
12120 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12121 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12123 /* When a type has virtual baseclasses, a magical first int argument is
12124 added to any ctor so we can tell if the class has been initialized
12125 yet. This could screw things up in this function, so we deliberately
12126 ignore the leading int if we're in that situation. */
12127 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12129 my_friendly_assert (parmtypes
12130 && TREE_VALUE (parmtypes
) == integer_type_node
,
12132 parmtypes
= TREE_CHAIN (parmtypes
);
12133 parmtype
= TREE_VALUE (parmtypes
);
12138 A non-template constructor for class X is a copy constructor if
12139 its first parameter is of type X&, const X&, volatile X& or const
12140 volatile X&, and either there are no other parameters or else all
12141 other parameters have default arguments. */
12142 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12143 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12144 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12145 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12146 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12148 TYPE_HAS_INIT_REF (ctype
) = 1;
12149 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12150 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12154 A declaration of a constructor for a class X is ill-formed if its
12155 first parameter is of type (optionally cv-qualified) X and either
12156 there are no other parameters or else all other parameters have
12159 We *don't* complain about member template instantiations that
12160 have this form, though; they can occur as we try to decide what
12161 constructor to use during overload resolution. Since overload
12162 resolution will never prefer such a constructor to the
12163 non-template copy constructor (which is either explicitly or
12164 implicitly defined), there's no need to worry about their
12165 existence. Theoretically, they should never even be
12166 instantiated, but that's hard to forestall. */
12167 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12168 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12169 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12170 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12172 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12174 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12177 else if (TREE_CODE (parmtype
) == VOID_TYPE
12178 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12179 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12184 /* An operator with this code is unary, but can also be binary. */
12188 enum tree_code code
;
12190 return (code
== INDIRECT_REF
12191 || code
== ADDR_EXPR
12192 || code
== CONVERT_EXPR
12193 || code
== NEGATE_EXPR
12194 || code
== PREINCREMENT_EXPR
12195 || code
== PREDECREMENT_EXPR
);
12198 /* An operator with this name can only be unary. */
12202 enum tree_code code
;
12204 return (code
== TRUTH_NOT_EXPR
12205 || code
== BIT_NOT_EXPR
12206 || code
== COMPONENT_REF
12207 || code
== TYPE_EXPR
);
12210 /* Do a little sanity-checking on how they declared their operator. */
12213 grok_op_properties (decl
, virtualp
, friendp
)
12215 int virtualp
, friendp
;
12217 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12219 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12220 tree name
= DECL_NAME (decl
);
12221 enum tree_code operator_code
;
12224 /* Count the number of arguments. */
12225 for (argtype
= argtypes
, arity
= 0;
12226 argtype
&& argtype
!= void_list_node
;
12227 argtype
= TREE_CHAIN (argtype
))
12230 if (current_class_type
== NULL_TREE
)
12233 if (DECL_CONV_FN_P (decl
))
12234 operator_code
= TYPE_EXPR
;
12238 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12239 if (ansi_opname (CODE) == name) \
12241 operator_code = CODE; \
12244 else if (ansi_assopname (CODE) == name) \
12246 operator_code = CODE; \
12247 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12251 #include "operators.def"
12252 #undef DEF_OPERATOR
12254 my_friendly_abort (20000527);
12257 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12258 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12262 switch (operator_code
)
12265 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12269 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12272 case COMPONENT_REF
:
12274 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12278 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12282 TYPE_GETS_DELETE (current_class_type
) |= 1;
12286 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12289 case VEC_DELETE_EXPR
:
12290 TYPE_GETS_DELETE (current_class_type
) |= 2;
12298 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12300 /* When the compiler encounters the definition of A::operator new, it
12301 doesn't look at the class declaration to find out if it's static. */
12303 revert_static_member_fn (decl
);
12305 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12307 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12310 revert_static_member_fn (decl
);
12312 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12316 /* An operator function must either be a non-static member function
12317 or have at least one parameter of a class, a reference to a class,
12318 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12319 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12321 if (operator_code
== TYPE_EXPR
12322 || operator_code
== CALL_EXPR
12323 || operator_code
== COMPONENT_REF
12324 || operator_code
== ARRAY_REF
12325 || operator_code
== NOP_EXPR
)
12326 cp_error ("`%D' must be a nonstatic member function", decl
);
12331 if (DECL_STATIC_FUNCTION_P (decl
))
12332 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12335 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12337 tree arg
= TREE_VALUE (p
);
12338 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12339 arg
= TREE_TYPE (arg
);
12341 /* This lets bad template code slip through. */
12342 if (IS_AGGR_TYPE (arg
)
12343 || TREE_CODE (arg
) == ENUMERAL_TYPE
12344 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12345 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12349 ("`%D' must have an argument of class or enumerated type",
12356 if (operator_code
== CALL_EXPR
)
12357 return; /* No restrictions on args. */
12359 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12361 tree t
= TREE_TYPE (name
);
12364 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12365 const char *what
= 0;
12368 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12370 if (TREE_CODE (t
) == VOID_TYPE
)
12372 else if (t
== current_class_type
)
12373 what
= "the same type";
12374 /* Don't force t to be complete here. */
12375 else if (IS_AGGR_TYPE (t
)
12376 && COMPLETE_TYPE_P (t
)
12377 && DERIVED_FROM_P (t
, current_class_type
))
12378 what
= "a base class";
12381 warning ("conversion to %s%s will never use a type conversion operator",
12382 ref
? "a reference to " : "", what
);
12386 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12387 && operator_code
== NOP_EXPR
)
12391 if (arity
!= 2 && methodp
)
12393 cp_error ("`%D' must take exactly one argument", decl
);
12396 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12400 A user-declared copy assignment operator X::operator= is
12401 a non-static non-template member function of class X with
12402 exactly one parameter of type X, X&, const X&, volatile
12403 X& or const volatile X&. */
12404 if (copy_assignment_arg_p (parmtype
, virtualp
)
12405 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12406 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12409 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12410 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12411 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12412 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12415 else if (operator_code
== COND_EXPR
)
12418 cp_error ("ISO C++ prohibits overloading operator ?:");
12420 else if (ambi_op_p (operator_code
))
12423 /* We pick the one-argument operator codes by default, so
12424 we don't have to change anything. */
12426 else if (arity
== 2)
12428 /* If we thought this was a unary operator, we now know
12429 it to be a binary operator. */
12430 switch (operator_code
)
12433 operator_code
= MULT_EXPR
;
12437 operator_code
= BIT_AND_EXPR
;
12441 operator_code
= PLUS_EXPR
;
12445 operator_code
= MINUS_EXPR
;
12448 case PREINCREMENT_EXPR
:
12449 operator_code
= POSTINCREMENT_EXPR
;
12452 case PREDECREMENT_EXPR
:
12453 operator_code
= POSTDECREMENT_EXPR
;
12457 my_friendly_abort (20000527);
12460 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12462 if ((operator_code
== POSTINCREMENT_EXPR
12463 || operator_code
== POSTDECREMENT_EXPR
)
12464 && ! processing_template_decl
12465 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12468 cp_error ("postfix `%D' must take `int' as its argument",
12472 ("postfix `%D' must take `int' as its second argument",
12479 cp_error ("`%D' must take either zero or one argument", decl
);
12481 cp_error ("`%D' must take either one or two arguments", decl
);
12484 /* More Effective C++ rule 6. */
12486 && (operator_code
== POSTINCREMENT_EXPR
12487 || operator_code
== POSTDECREMENT_EXPR
12488 || operator_code
== PREINCREMENT_EXPR
12489 || operator_code
== PREDECREMENT_EXPR
))
12491 tree arg
= TREE_VALUE (argtypes
);
12492 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12493 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12494 arg
= TREE_TYPE (arg
);
12495 arg
= TYPE_MAIN_VARIANT (arg
);
12496 if (operator_code
== PREINCREMENT_EXPR
12497 || operator_code
== PREDECREMENT_EXPR
)
12499 if (TREE_CODE (ret
) != REFERENCE_TYPE
12500 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12502 cp_warning ("prefix `%D' should return `%T'", decl
,
12503 build_reference_type (arg
));
12507 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12508 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12512 else if (unary_op_p (operator_code
))
12517 cp_error ("`%D' must take `void'", decl
);
12519 cp_error ("`%D' must take exactly one argument", decl
);
12522 else /* if (binary_op_p (operator_code)) */
12527 cp_error ("`%D' must take exactly one argument", decl
);
12529 cp_error ("`%D' must take exactly two arguments", decl
);
12532 /* More Effective C++ rule 7. */
12534 && (operator_code
== TRUTH_ANDIF_EXPR
12535 || operator_code
== TRUTH_ORIF_EXPR
12536 || operator_code
== COMPOUND_EXPR
))
12537 cp_warning ("user-defined `%D' always evaluates both arguments",
12541 /* Effective C++ rule 23. */
12544 && (operator_code
== PLUS_EXPR
12545 || operator_code
== MINUS_EXPR
12546 || operator_code
== TRUNC_DIV_EXPR
12547 || operator_code
== MULT_EXPR
)
12548 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12549 cp_warning ("`%D' should return by value", decl
);
12552 for (; argtypes
&& argtypes
!= void_list_node
;
12553 argtypes
= TREE_CHAIN (argtypes
))
12554 if (TREE_PURPOSE (argtypes
))
12556 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12557 if (operator_code
== POSTINCREMENT_EXPR
12558 || operator_code
== POSTDECREMENT_EXPR
)
12561 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12564 cp_error ("`%D' cannot have default arguments", decl
);
12570 static const char *
12572 enum tag_types code
;
12585 my_friendly_abort (981122);
12589 /* Get the struct, enum or union (CODE says which) with tag NAME.
12590 Define the tag as a forward-reference if it is not defined.
12592 C++: If a class derivation is given, process it here, and report
12593 an error if multiple derivation declarations are not identical.
12595 If this is a definition, come in through xref_tag and only look in
12596 the current frame for the name (since C++ allows new names in any
12600 xref_tag (code_type_node
, name
, globalize
)
12601 tree code_type_node
;
12605 enum tag_types tag_code
;
12606 enum tree_code code
;
12607 register tree ref
, t
;
12608 struct binding_level
*b
= current_binding_level
;
12610 tree attributes
= NULL_TREE
;
12611 tree context
= NULL_TREE
;
12613 /* If we are called from the parser, code_type_node will sometimes be a
12614 TREE_LIST. This indicates that the user wrote
12615 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12617 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12619 attributes
= TREE_PURPOSE (code_type_node
);
12620 code_type_node
= TREE_VALUE (code_type_node
);
12623 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12628 code
= RECORD_TYPE
;
12634 code
= ENUMERAL_TYPE
;
12637 my_friendly_abort (18);
12640 /* If a cross reference is requested, look up the type
12641 already defined for this tag and return it. */
12645 name
= TYPE_IDENTIFIER (t
);
12649 t
= IDENTIFIER_TYPE_VALUE (name
);
12651 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12652 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12654 static int explained
;
12656 cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12657 to refer to the inherited type, say `%s %T::%T'%s",
12658 tag_name (tag_code
), name
, tag_name (tag_code
),
12659 constructor_name (current_class_type
), TYPE_IDENTIFIER (t
),
12661 (names from dependent base classes are not visible to unqualified name lookup)"
12667 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12668 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12673 /* If we know we are defining this tag, only look it up in
12674 this scope and don't try to find it as a type. */
12675 ref
= lookup_tag (code
, name
, b
, 1);
12681 /* [dcl.type.elab] If the identifier resolves to a
12682 typedef-name or a template type-parameter, the
12683 elaborated-type-specifier is ill-formed. */
12684 if (t
!= TYPE_MAIN_VARIANT (t
)
12685 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12686 cp_pedwarn ("using typedef-name `%D' after `%s'",
12687 TYPE_NAME (t
), tag_name (tag_code
));
12688 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12689 cp_error ("using template type parameter `%T' after `%s'",
12690 t
, tag_name (tag_code
));
12695 ref
= lookup_tag (code
, name
, b
, 0);
12699 /* Try finding it as a type declaration. If that wins,
12701 ref
= lookup_name (name
, 1);
12703 if (ref
!= NULL_TREE
12704 && processing_template_decl
12705 && DECL_CLASS_TEMPLATE_P (ref
)
12706 && template_class_depth (current_class_type
) == 0)
12707 /* Since GLOBALIZE is true, we're declaring a global
12708 template, so we want this type. */
12709 ref
= DECL_TEMPLATE_RESULT (ref
);
12711 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12712 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12713 ref
= TREE_TYPE (ref
);
12718 if (ref
&& current_class_type
12719 && template_class_depth (current_class_type
)
12720 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12722 /* Since GLOBALIZE is non-zero, we are not looking at a
12723 definition of this tag. Since, in addition, we are currently
12724 processing a (member) template declaration of a template
12725 class, we must be very careful; consider:
12732 { template <class V>
12733 friend struct S1; };
12735 Here, the S2::S1 declaration should not be confused with the
12736 outer declaration. In particular, the inner version should
12737 have a template parameter of level 2, not level 1. This
12738 would be particularly important if the member declaration
12741 template <class V = U> friend struct S1;
12743 say, when we should tsubst into `U' when instantiating
12744 S2. On the other hand, when presented with:
12754 we must find the inner binding eventually. We
12755 accomplish this by making sure that the new type we
12756 create to represent this declaration has the right
12758 context
= TYPE_CONTEXT (ref
);
12765 /* If no such tag is yet defined, create a forward-reference node
12766 and record it as the "definition".
12767 When a real declaration of this type is found,
12768 the forward-reference will be altered into a real type. */
12769 if (code
== ENUMERAL_TYPE
)
12771 cp_error ("use of enum `%#D' without previous declaration", name
);
12773 ref
= make_node (ENUMERAL_TYPE
);
12775 /* Give the type a default layout like unsigned int
12776 to avoid crashing if it does not get defined. */
12777 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12778 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12779 TYPE_USER_ALIGN (ref
) = 0;
12780 TREE_UNSIGNED (ref
) = 1;
12781 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12782 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12783 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12785 /* Enable us to recognize when a type is created in class context.
12786 To do nested classes correctly, this should probably be cleared
12787 out when we leave this classes scope. Currently this in only
12788 done in `start_enum'. */
12790 pushtag (name
, ref
, globalize
);
12794 struct binding_level
*old_b
= class_binding_level
;
12796 ref
= make_aggr_type (code
);
12797 TYPE_CONTEXT (ref
) = context
;
12799 #ifdef NONNESTED_CLASSES
12800 /* Class types don't nest the way enums do. */
12801 class_binding_level
= (struct binding_level
*)0;
12803 pushtag (name
, ref
, globalize
);
12804 class_binding_level
= old_b
;
12809 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12810 redeclare_class_template (ref
, current_template_parms
);
12813 /* Until the type is defined, tentatively accept whatever
12814 structure tag the user hands us. */
12815 if (!COMPLETE_TYPE_P (ref
)
12816 && ref
!= current_class_type
12817 /* Have to check this, in case we have contradictory tag info. */
12818 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12820 if (tag_code
== class_type
)
12821 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12822 else if (tag_code
== record_type
)
12823 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12826 TREE_TYPE (ref
) = attributes
;
12832 xref_tag_from_type (old
, id
, globalize
)
12836 tree code_type_node
;
12838 if (TREE_CODE (old
) == RECORD_TYPE
)
12839 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12840 ? class_type_node
: record_type_node
);
12842 code_type_node
= union_type_node
;
12844 if (id
== NULL_TREE
)
12845 id
= TYPE_IDENTIFIER (old
);
12847 return xref_tag (code_type_node
, id
, globalize
);
12850 /* REF is a type (named NAME), for which we have just seen some
12851 baseclasses. BINFO is a list of those baseclasses; the
12852 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12853 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12854 struct, or union. */
12857 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12858 tree code_type_node
;
12862 /* In the declaration `A : X, Y, ... Z' we mark all the types
12863 (A, X, Y, ..., Z) so we can check for duplicates. */
12868 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12870 if (tag_code
== union_type
)
12872 cp_error ("derived union `%T' invalid", ref
);
12876 len
= list_length (binfo
);
12878 /* First, make sure that any templates in base-classes are
12879 instantiated. This ensures that if we call ourselves recursively
12880 we do not get confused about which classes are marked and which
12882 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12883 complete_type (TREE_VALUE (base
));
12885 SET_CLASSTYPE_MARKED (ref
);
12886 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12888 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12890 /* The base of a derived struct is public by default. */
12892 = (TREE_PURPOSE (binfo
) == access_public_node
12893 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12894 || (tag_code
!= class_type
12895 && (TREE_PURPOSE (binfo
) == access_default_node
12896 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12898 = (TREE_PURPOSE (binfo
) == access_protected_node
12899 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12901 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12902 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12903 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12904 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12905 tree basetype
= TREE_VALUE (binfo
);
12908 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12909 basetype
= TREE_TYPE (basetype
);
12911 || (TREE_CODE (basetype
) != RECORD_TYPE
12912 && TREE_CODE (basetype
) != TYPENAME_TYPE
12913 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12914 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12916 cp_error ("base type `%T' fails to be a struct or class type",
12917 TREE_VALUE (binfo
));
12921 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12923 /* This code replaces similar code in layout_basetypes.
12924 We put the complete_type first for implicit `typename'. */
12925 if (!COMPLETE_TYPE_P (basetype
)
12926 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12928 cp_error ("base class `%T' has incomplete type", basetype
);
12933 if (CLASSTYPE_MARKED (basetype
))
12935 if (basetype
== ref
)
12936 cp_error ("recursive type `%T' undefined", basetype
);
12938 cp_error ("duplicate base type `%T' invalid", basetype
);
12942 if (TYPE_FOR_JAVA (basetype
)
12943 && (current_lang_stack
12944 == &VARRAY_TREE (current_lang_base
, 0)))
12945 TYPE_FOR_JAVA (ref
) = 1;
12947 /* Note that the BINFO records which describe individual
12948 inheritances are *not* shared in the lattice! They
12949 cannot be shared because a given baseclass may be
12950 inherited with different `accessibility' by different
12951 derived classes. (Each BINFO record describing an
12952 individual inheritance contains flags which say what
12953 the `accessibility' of that particular inheritance is.) */
12956 = make_binfo (size_zero_node
, basetype
,
12957 CLASS_TYPE_P (basetype
)
12958 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12959 CLASS_TYPE_P (basetype
)
12960 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12962 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12963 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12964 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12965 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12966 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12968 /* We need to unshare the binfos now so that lookups during class
12969 definition work. */
12970 unshare_base_binfos (base_binfo
);
12972 SET_CLASSTYPE_MARKED (basetype
);
12974 /* We are free to modify these bits because they are meaningless
12975 at top level, and BASETYPE is a top-level type. */
12976 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12978 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12979 /* Converting to a virtual base class requires looking
12980 up the offset of the virtual base. */
12981 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12984 if (CLASS_TYPE_P (basetype
))
12986 TYPE_HAS_NEW_OPERATOR (ref
)
12987 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12988 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12989 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12990 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12991 /* If the base-class uses multiple inheritance, so do we. */
12992 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12993 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12994 /* Likewise, if converting to a base of the base may require
12995 code, then we may need to generate code to convert to a
12997 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12998 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
13005 TREE_VEC_LENGTH (binfos
) = i
;
13007 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
13011 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
13012 /* If there is more than one non-empty they cannot be at the same
13014 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13017 /* Unmark all the types. */
13019 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
13020 CLEAR_CLASSTYPE_MARKED (ref
);
13022 /* Now that we know all the base-classes, set up the list of virtual
13024 get_vbase_types (ref
);
13028 /* Begin compiling the definition of an enumeration type.
13029 NAME is its name (or null if anonymous).
13030 Returns the type object, as yet incomplete.
13031 Also records info about it so that build_enumerator
13032 may be used to declare the individual values as they are read. */
13038 register tree enumtype
= NULL_TREE
;
13039 struct binding_level
*b
= current_binding_level
;
13041 /* If this is the real definition for a previous forward reference,
13042 fill in the contents in the same object that used to be the
13043 forward reference. */
13045 if (name
!= NULL_TREE
)
13046 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
13048 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
13050 cp_error ("multiple definition of `%#T'", enumtype
);
13051 cp_error_at ("previous definition here", enumtype
);
13052 /* Clear out TYPE_VALUES, and start again. */
13053 TYPE_VALUES (enumtype
) = NULL_TREE
;
13057 enumtype
= make_node (ENUMERAL_TYPE
);
13058 pushtag (name
, enumtype
, 0);
13061 if (current_class_type
)
13062 TREE_ADDRESSABLE (b
->tags
) = 1;
13064 GNU_xref_decl (current_function_decl
, enumtype
);
13068 /* After processing and defining all the values of an enumeration type,
13069 install their decls in the enumeration type and finish it off.
13070 ENUMTYPE is the type object and VALUES a list of name-value pairs.
13071 Returns ENUMTYPE. */
13074 finish_enum (enumtype
)
13077 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
13078 /* Calculate the maximum value of any enumerator in this type. */
13080 tree values
= TYPE_VALUES (enumtype
);
13085 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
13090 /* The TREE_VALUE is a CONST_DECL for this enumeration
13092 decl
= TREE_VALUE (pair
);
13096 Following the closing brace of an enum-specifier, each
13097 enumerator has the type of its enumeration. Prior to the
13098 closing brace, the type of each enumerator is the type of
13099 its initializing value. */
13100 TREE_TYPE (decl
) = enumtype
;
13102 /* The DECL_INITIAL will be NULL if we are processing a
13103 template declaration and this enumeration constant had no
13104 explicit initializer. */
13105 value
= DECL_INITIAL (decl
);
13106 if (value
&& !processing_template_decl
)
13108 /* Set the TREE_TYPE for the VALUE as well. That's so
13109 that when we call decl_constant_value we get an
13110 entity of the right type (but with the constant
13111 value). Since we shouldn't ever call
13112 decl_constant_value on a template type, there's no
13113 reason to do that when processing_template_decl.
13114 And, if the expression is something like a
13115 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13116 wreak havoc on the intended type of the expression.
13118 Of course, there's also no point in trying to compute
13119 minimum or maximum values if we're in a template. */
13120 TREE_TYPE (value
) = enumtype
;
13123 minnode
= maxnode
= value
;
13124 else if (tree_int_cst_lt (maxnode
, value
))
13126 else if (tree_int_cst_lt (value
, minnode
))
13130 if (processing_template_decl
)
13131 /* If this is just a template, leave the CONST_DECL
13132 alone. That way tsubst_copy will find CONST_DECLs for
13133 CONST_DECLs, and not INTEGER_CSTs. */
13136 /* In the list we're building up, we want the enumeration
13137 values, not the CONST_DECLs. */
13138 TREE_VALUE (pair
) = value
;
13142 maxnode
= minnode
= integer_zero_node
;
13144 TYPE_VALUES (enumtype
) = nreverse (values
);
13146 if (processing_template_decl
)
13148 tree scope
= current_scope ();
13149 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13150 add_stmt (build_min (TAG_DEFN
, enumtype
));
13154 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13155 int lowprec
= min_precision (minnode
, unsignedp
);
13156 int highprec
= min_precision (maxnode
, unsignedp
);
13157 int precision
= MAX (lowprec
, highprec
);
13160 TYPE_SIZE (enumtype
) = NULL_TREE
;
13162 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13164 TYPE_PRECISION (enumtype
) = precision
;
13166 fixup_unsigned_type (enumtype
);
13168 fixup_signed_type (enumtype
);
13170 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13171 /* Use the width of the narrowest normal C type which is wide
13173 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13176 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13178 TYPE_SIZE (enumtype
) = 0;
13179 layout_type (enumtype
);
13181 /* Fix up all variant types of this enum type. */
13182 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13183 tem
= TYPE_NEXT_VARIANT (tem
))
13185 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13186 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13187 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13188 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13189 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13190 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13191 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13192 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13193 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13194 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13197 /* Finish debugging output for this type. */
13198 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13204 /* Build and install a CONST_DECL for an enumeration constant of the
13205 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13206 Assignment of sequential values by default is handled here. */
13209 build_enumerator (name
, value
, enumtype
)
13219 /* Remove no-op casts from the value. */
13221 STRIP_TYPE_NOPS (value
);
13223 if (! processing_template_decl
)
13225 /* Validate and default VALUE. */
13226 if (value
!= NULL_TREE
)
13228 value
= decl_constant_value (value
);
13230 if (TREE_CODE (value
) == INTEGER_CST
)
13232 value
= default_conversion (value
);
13233 constant_expression_warning (value
);
13237 cp_error ("enumerator value for `%D' not integer constant", name
);
13242 /* Default based on previous value. */
13243 if (value
== NULL_TREE
&& ! processing_template_decl
)
13247 if (TYPE_VALUES (enumtype
))
13249 /* The next value is the previous value ... */
13250 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13251 /* ... plus one. */
13252 value
= cp_build_binary_op (PLUS_EXPR
,
13256 if (tree_int_cst_lt (value
, prev_value
))
13257 cp_error ("overflow in enumeration values at `%D'", name
);
13260 value
= integer_zero_node
;
13263 /* Remove no-op casts from the value. */
13265 STRIP_TYPE_NOPS (value
);
13267 /* To fix MAX_VAL enum consts. (bkoz) */
13268 TREE_TYPE (value
) = integer_type_node
;
13272 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13273 Even in other cases, we will later (in finish_enum) be setting
13274 the type of VALUE. But, we don't need to make a copy if this
13275 VALUE is one of the enumeration constants for this same
13276 enumeration type. */
13277 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13278 if (TREE_VALUE (values
) == value
)
13280 /* If we didn't break out of the loop, then we do need a copy. */
13281 if (!values
&& value
)
13282 value
= copy_node (value
);
13284 /* C++ associates enums with global, function, or class declarations. */
13285 context
= current_scope ();
13287 /* Build the actual enumeration constant. Note that the enumeration
13288 constants have the type of their initializers until the
13289 enumeration is complete:
13293 Following the closing brace of an enum-specifier, each enumer-
13294 ator has the type of its enumeration. Prior to the closing
13295 brace, the type of each enumerator is the type of its
13296 initializing value.
13298 In finish_enum we will reset the type. Of course, if we're
13299 processing a template, there may be no value. */
13300 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13302 if (context
&& context
== current_class_type
)
13303 /* This enum declaration is local to the class. We need the full
13304 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13305 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13307 /* It's a global enum, or it's local to a function. (Note local to
13308 a function could mean local to a class method. */
13309 decl
= build_decl (CONST_DECL
, name
, type
);
13311 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13312 DECL_INITIAL (decl
) = value
;
13313 TREE_READONLY (decl
) = 1;
13315 if (context
&& context
== current_class_type
)
13316 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13317 on the TYPE_FIELDS list for `S'. (That's so that you can say
13318 things like `S::i' later.) */
13319 finish_member_declaration (decl
);
13323 GNU_xref_decl (current_function_decl
, decl
);
13326 /* Add this enumeration constant to the list for this type. */
13327 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13331 /* We're defining DECL. Make sure that it's type is OK. */
13334 check_function_type (decl
, current_function_parms
)
13336 tree current_function_parms
;
13338 tree fntype
= TREE_TYPE (decl
);
13339 tree return_type
= complete_type (TREE_TYPE (fntype
));
13341 /* In a function definition, arg types must be complete. */
13342 require_complete_types_for_parms (current_function_parms
);
13344 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13346 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13348 /* Make it return void instead, but don't change the
13349 type of the DECL_RESULT, in case we have a named return value. */
13350 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13352 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13354 = build_cplus_method_type (ctype
,
13356 FUNCTION_ARG_CHAIN (decl
));
13360 = build_function_type (void_type_node
,
13361 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13363 = build_exception_variant (fntype
,
13364 TYPE_RAISES_EXCEPTIONS (fntype
));
13367 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13370 /* Create the FUNCTION_DECL for a function definition.
13371 DECLSPECS and DECLARATOR are the parts of the declaration;
13372 they describe the function's name and the type it returns,
13373 but twisted together in a fashion that parallels the syntax of C.
13375 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13376 DECLARATOR is really the DECL for the function we are about to
13377 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13378 indicating that the function is an inline defined in-class.
13380 This function creates a binding context for the function body
13381 as well as setting up the FUNCTION_DECL in current_function_decl.
13383 Returns 1 on success. If the DECLARATOR is not suitable for a function
13384 (it defines a datum instead), we return 0, which tells
13385 yyparse to report a parse error.
13387 For C++, we must first check whether that datum makes any sense.
13388 For example, "class A local_a(1,2);" means that variable local_a
13389 is an aggregate of type A, which should have a constructor
13390 applied to it with the argument list [1, 2]. */
13393 start_function (declspecs
, declarator
, attrs
, flags
)
13394 tree declspecs
, declarator
, attrs
;
13398 tree ctype
= NULL_TREE
;
13401 extern int have_extern_spec
;
13402 extern int used_extern_spec
;
13403 int doing_friend
= 0;
13404 struct binding_level
*bl
;
13405 tree current_function_parms
;
13407 /* Sanity check. */
13408 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13409 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13411 /* This should only be done once on the top most decl. */
13412 if (have_extern_spec
&& !used_extern_spec
)
13414 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13415 used_extern_spec
= 1;
13418 if (flags
& SF_PRE_PARSED
)
13420 decl1
= declarator
;
13422 fntype
= TREE_TYPE (decl1
);
13423 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13424 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13426 /* ISO C++ 11.4/5. A friend function defined in a class is in
13427 the (lexical) scope of the class in which it is defined. */
13428 if (!ctype
&& DECL_FRIEND_P (decl1
))
13430 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13432 /* CTYPE could be null here if we're dealing with a template;
13433 for example, `inline friend float foo()' inside a template
13434 will have no CTYPE set. */
13435 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13441 last_function_parms
= DECL_ARGUMENTS (decl1
);
13442 last_function_parm_tags
= NULL_TREE
;
13446 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13447 /* If the declarator is not suitable for a function definition,
13448 cause a syntax error. */
13449 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13451 fntype
= TREE_TYPE (decl1
);
13453 restype
= TREE_TYPE (fntype
);
13454 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13456 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13457 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13458 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13459 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13460 fntype
= build_function_type (integer_type_node
,
13461 TYPE_ARG_TYPES (fntype
));
13463 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13465 TYPE_ARG_TYPES (fntype
));
13466 TREE_TYPE (decl1
) = fntype
;
13469 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13470 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13471 else if (DECL_MAIN_P (decl1
))
13473 /* If this doesn't return integer_type, complain. */
13474 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13476 if (pedantic
|| warn_return_type
)
13477 pedwarn ("return type for `main' changed to `int'");
13478 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13483 /* Sometimes we don't notice that a function is a static member, and
13484 build a METHOD_TYPE for it. Fix that up now. */
13485 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13486 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13488 revert_static_member_fn (decl1
);
13489 last_function_parms
= TREE_CHAIN (last_function_parms
);
13493 /* Warn if function was previously implicitly declared
13494 (but not if we warned then). */
13495 if (! warn_implicit
13496 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13497 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13499 /* Set up current_class_type, and enter the scope of the class, if
13502 push_nested_class (ctype
, 1);
13503 else if (DECL_STATIC_FUNCTION_P (decl1
))
13504 push_nested_class (DECL_CONTEXT (decl1
), 2);
13506 /* Now that we have entered the scope of the class, we must restore
13507 the bindings for any template parameters surrounding DECL1, if it
13508 is an inline member template. (Order is important; consider the
13509 case where a template parameter has the same name as a field of
13510 the class.) It is not until after this point that
13511 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13512 if (flags
& SF_INCLASS_INLINE
)
13513 maybe_begin_member_template_processing (decl1
);
13515 /* Effective C++ rule 15. */
13517 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13518 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13519 cp_warning ("`operator=' should return a reference to `*this'");
13521 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13522 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13523 if (!DECL_INITIAL (decl1
))
13524 DECL_INITIAL (decl1
) = error_mark_node
;
13526 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13527 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13530 /* This function exists in static storage.
13531 (This does not mean `static' in the C sense!) */
13532 TREE_STATIC (decl1
) = 1;
13534 /* We must call push_template_decl after current_class_type is set
13535 up. (If we are processing inline definitions after exiting a
13536 class scope, current_class_type will be NULL_TREE until set above
13537 by push_nested_class.) */
13538 if (processing_template_decl
)
13539 decl1
= push_template_decl (decl1
);
13541 /* We are now in the scope of the function being defined. */
13542 current_function_decl
= decl1
;
13544 /* Save the parm names or decls from this function's declarator
13545 where store_parm_decls will find them. */
13546 current_function_parms
= last_function_parms
;
13547 current_function_parm_tags
= last_function_parm_tags
;
13549 /* Make sure the parameter and return types are reasonable. When
13550 you declare a function, these types can be incomplete, but they
13551 must be complete when you define the function. */
13552 if (! processing_template_decl
)
13553 check_function_type (decl1
, current_function_parms
);
13555 /* Build the return declaration for the function. */
13556 restype
= TREE_TYPE (fntype
);
13557 if (!processing_template_decl
)
13559 if (!DECL_RESULT (decl1
))
13561 DECL_RESULT (decl1
)
13562 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13563 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13564 DECL_RESULT (decl1
));
13568 /* Just use `void'. Nobody will ever look at this anyhow. */
13569 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13571 /* Initialize RTL machinery. We cannot do this until
13572 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13573 even when processing a template; this is how we get
13574 CFUN set up, and our per-function variables initialized.
13575 FIXME factor out the non-RTL stuff. */
13576 bl
= current_binding_level
;
13577 init_function_start (decl1
, input_filename
, lineno
);
13578 current_binding_level
= bl
;
13580 /* Even though we're inside a function body, we still don't want to
13581 call expand_expr to calculate the size of a variable-sized array.
13582 We haven't necessarily assigned RTL to all variables yet, so it's
13583 not safe to try to expand expressions involving them. */
13584 immediate_size_expand
= 0;
13585 cfun
->x_dont_save_pending_sizes_p
= 1;
13587 /* Start the statement-tree, start the tree now. */
13588 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13590 /* Let the user know we're compiling this function. */
13591 announce_function (decl1
);
13593 /* Record the decl so that the function name is defined.
13594 If we already have a decl for this name, and it is a FUNCTION_DECL,
13595 use the old decl. */
13596 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13598 /* A specialization is not used to guide overload resolution. */
13599 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13600 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13601 decl1
= pushdecl (decl1
);
13604 /* We need to set the DECL_CONTEXT. */
13605 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13606 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13607 /* And make sure we have enough default args. */
13608 check_default_args (decl1
);
13610 fntype
= TREE_TYPE (decl1
);
13613 /* Reset these in case the call to pushdecl changed them. */
13614 current_function_decl
= decl1
;
13615 cfun
->decl
= decl1
;
13617 /* If we are (erroneously) defining a function that we have already
13618 defined before, wipe out what we knew before. */
13619 if (!DECL_PENDING_INLINE_P (decl1
)
13620 && DECL_SAVED_FUNCTION_DATA (decl1
))
13622 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13623 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13626 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13628 /* We know that this was set up by `grokclassfn'. We do not
13629 wait until `store_parm_decls', since evil parse errors may
13630 never get us to that point. Here we keep the consistency
13631 between `current_class_type' and `current_class_ptr'. */
13632 tree t
= DECL_ARGUMENTS (decl1
);
13634 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13636 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13639 cp_function_chain
->x_current_class_ref
13640 = build_indirect_ref (t
, NULL_PTR
);
13641 cp_function_chain
->x_current_class_ptr
= t
;
13643 /* Constructors and destructors need to know whether they're "in
13644 charge" of initializing virtual base classes. */
13645 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13646 current_in_charge_parm
= TREE_CHAIN (t
);
13649 if (DECL_INTERFACE_KNOWN (decl1
))
13651 tree ctx
= decl_function_context (decl1
);
13653 if (DECL_NOT_REALLY_EXTERN (decl1
))
13654 DECL_EXTERNAL (decl1
) = 0;
13656 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13657 && TREE_PUBLIC (ctx
))
13658 /* This is a function in a local class in an extern inline
13660 comdat_linkage (decl1
);
13662 /* If this function belongs to an interface, it is public.
13663 If it belongs to someone else's interface, it is also external.
13664 This only affects inlines and template instantiations. */
13665 else if (interface_unknown
== 0
13666 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13667 || flag_alt_external_templates
))
13669 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13670 || processing_template_decl
)
13672 DECL_EXTERNAL (decl1
)
13674 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13675 && !DECL_VINDEX (decl1
)));
13677 /* For WIN32 we also want to put these in linkonce sections. */
13678 maybe_make_one_only (decl1
);
13681 DECL_EXTERNAL (decl1
) = 0;
13682 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13683 DECL_INTERFACE_KNOWN (decl1
) = 1;
13685 else if (interface_unknown
&& interface_only
13686 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13687 || flag_alt_external_templates
))
13689 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13690 interface, we will have interface_only set but not
13691 interface_known. In that case, we don't want to use the normal
13692 heuristics because someone will supply a #pragma implementation
13693 elsewhere, and deducing it here would produce a conflict. */
13694 comdat_linkage (decl1
);
13695 DECL_EXTERNAL (decl1
) = 0;
13696 DECL_INTERFACE_KNOWN (decl1
) = 1;
13697 DECL_DEFER_OUTPUT (decl1
) = 1;
13701 /* This is a definition, not a reference.
13702 So clear DECL_EXTERNAL. */
13703 DECL_EXTERNAL (decl1
) = 0;
13705 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13706 && ! DECL_INTERFACE_KNOWN (decl1
)
13707 /* Don't try to defer nested functions for now. */
13708 && ! decl_function_context (decl1
))
13709 DECL_DEFER_OUTPUT (decl1
) = 1;
13711 DECL_INTERFACE_KNOWN (decl1
) = 1;
13715 current_binding_level
->parm_flag
= 1;
13718 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13720 /* We need to do this even if we aren't expanding yet so that
13721 assemble_external works. */
13722 make_function_rtl (decl1
);
13724 /* Promote the value to int before returning it. */
13725 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13726 restype
= type_promotes_to (restype
);
13728 /* If this fcn was already referenced via a block-scope `extern' decl
13729 (or an implicit decl), propagate certain information about the usage. */
13730 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13731 TREE_ADDRESSABLE (decl1
) = 1;
13733 if (DECL_RESULT (decl1
) == NULL_TREE
)
13735 DECL_RESULT (decl1
)
13736 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13737 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13738 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13743 if (DECL_DESTRUCTOR_P (decl1
))
13745 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13746 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13748 /* Under the old ABI we return `this' from constructors, so we make
13749 ordinary `return' statements in constructors jump to CTOR_LABEL;
13750 from there we return `this'. Under the new ABI, we don't bother
13751 with any of this. By not setting CTOR_LABEL the remainder of the
13752 machinery is automatically disabled. */
13753 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13755 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13756 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13759 store_parm_decls (current_function_parms
);
13764 /* Store the parameter declarations into the current function declaration.
13765 This is called after parsing the parameter declarations, before
13766 digesting the body of the function.
13768 Also install to binding contour return value identifier, if any. */
13771 store_parm_decls (current_function_parms
)
13772 tree current_function_parms
;
13774 register tree fndecl
= current_function_decl
;
13775 register tree parm
;
13776 int parms_have_cleanups
= 0;
13777 tree cleanups
= NULL_TREE
;
13779 /* This is a list of types declared among parms in a prototype. */
13780 tree parmtags
= current_function_parm_tags
;
13782 /* This is a chain of any other decls that came in among the parm
13783 declarations. If a parm is declared with enum {foo, bar} x;
13784 then CONST_DECLs for foo and bar are put here. */
13785 tree nonparms
= NULL_TREE
;
13787 if (current_function_parms
)
13789 /* This case is when the function was defined with an ANSI prototype.
13790 The parms already have decls, so we need not do anything here
13791 except record them as in effect
13792 and complain if any redundant old-style parm decls were written. */
13794 tree specparms
= current_function_parms
;
13797 /* Must clear this because it might contain TYPE_DECLs declared
13799 storedecls (NULL_TREE
);
13801 /* If we're doing semantic analysis, then we'll call pushdecl
13802 for each of these. We must do them in reverse order so that
13803 they end in the correct forward order. */
13804 specparms
= nreverse (specparms
);
13806 for (parm
= specparms
; parm
; parm
= next
)
13808 next
= TREE_CHAIN (parm
);
13809 if (TREE_CODE (parm
) == PARM_DECL
)
13813 if (DECL_NAME (parm
) == NULL_TREE
13814 || TREE_CODE (parm
) != VOID_TYPE
)
13817 cp_error ("parameter `%D' declared void", parm
);
13819 cleanup
= (processing_template_decl
13821 : maybe_build_cleanup (parm
));
13824 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13828 /* If we find an enum constant or a type tag,
13829 put it aside for the moment. */
13830 TREE_CHAIN (parm
) = NULL_TREE
;
13831 nonparms
= chainon (nonparms
, parm
);
13835 /* Get the decls in their original chain order and record in the
13836 function. This is all and only the PARM_DECLs that were
13837 pushed into scope by the loop above. */
13838 DECL_ARGUMENTS (fndecl
) = getdecls ();
13839 storetags (chainon (parmtags
, gettags ()));
13842 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13844 /* Now store the final chain of decls for the arguments
13845 as the decl-chain of the current lexical scope.
13846 Put the enumerators in as well, at the front so that
13847 DECL_ARGUMENTS is not modified. */
13848 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13850 /* Now that we have initialized the parms, we can start their
13851 cleanups. We cannot do this before, since expand_decl_cleanup
13852 should not be called before the parm can be used. */
13855 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13856 TREE_VALUE (cleanups
));
13857 cleanups
= TREE_CHAIN (cleanups
);
13860 /* Create a binding contour which can be used to catch
13861 cleanup-generated temporaries. */
13862 if (parms_have_cleanups
)
13865 /* Do the starting of the exception specifications, if we have any. */
13866 if (flag_exceptions
&& !processing_template_decl
13867 && flag_enforce_eh_specs
13868 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13869 current_eh_spec_try_block
= expand_start_eh_spec ();
13873 /* We have finished doing semantic analysis on DECL, but have not yet
13874 generated RTL for its body. Save away our current state, so that
13875 when we want to generate RTL later we know what to do. */
13878 save_function_data (decl
)
13881 struct cp_language_function
*f
;
13883 /* Save the language-specific per-function data so that we can
13884 get it back when we really expand this function. */
13885 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13889 f
= ((struct cp_language_function
*)
13890 xmalloc (sizeof (struct cp_language_function
)));
13891 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13892 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13894 /* Clear out the bits we don't need. */
13895 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13896 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13897 f
->x_named_label_uses
= NULL
;
13898 f
->bindings
= NULL
;
13900 /* When we get back here again, we will be expanding. */
13901 f
->x_expanding_p
= 1;
13903 /* If we've already decided that we cannot inline this function, we
13904 must remember that fact when we actually go to expand the
13906 f
->cannot_inline
= current_function_cannot_inline
;
13909 /* At the end of every constructor we generate to code to return
13910 `this'. Do that now. */
13913 finish_constructor_body ()
13915 /* Any return from a constructor will end up here. */
13917 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13919 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13920 generate the return, rather than a goto to CTOR_LABEL. */
13921 ctor_label
= NULL_TREE
;
13922 /* In check_return_expr we translate an empty return from a
13923 constructor to a return of `this'. */
13924 finish_return_stmt (NULL_TREE
);
13925 /* Mark the end of the constructor. */
13926 add_stmt (build_stmt (CTOR_STMT
));
13929 /* At the end of every destructor we generate code to restore virtual
13930 function tables to the values desired by base classes and to call
13931 to base class destructors. Do that now. */
13934 finish_destructor_body ()
13936 tree compound_stmt
;
13941 /* Create a block to contain all the extra code. */
13942 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13944 /* Any return from a destructor will end up here. */
13945 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13947 /* Generate the code to call destructor on base class. If this
13948 destructor belongs to a class with virtual functions, then set
13949 the virtual function table pointer to represent the type of our
13952 /* This side-effect makes call to `build_delete' generate the code
13953 we have to have at the end of this destructor. `build_delete'
13954 will set the flag again. */
13955 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13957 exprstmt
= build_delete (current_class_type
,
13959 sfk_base_destructor
,
13960 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13963 if (exprstmt
!= error_mark_node
13964 && (TREE_CODE (exprstmt
) != NOP_EXPR
13965 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13966 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13968 if (exprstmt
!= void_zero_node
)
13969 /* Don't call `expand_expr_stmt' if we're not going to do
13970 anything, since -Wall will give a diagnostic. */
13971 finish_expr_stmt (exprstmt
);
13973 /* Run destructors for all virtual baseclasses. */
13974 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13979 if_stmt
= begin_if_stmt ();
13980 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13981 current_in_charge_parm
,
13985 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
13986 /* The CLASSTYPE_VBASECLASSES list is in initialization
13987 order, so we have to march through it in reverse order. */
13988 for (vbases
= nreverse (copy_list (vbases
));
13990 vbases
= TREE_CHAIN (vbases
))
13992 tree vbase
= TREE_VALUE (vbases
);
13994 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
13996 tree vb
= get_vbase
13997 (BINFO_TYPE (vbase
),
13998 TYPE_BINFO (current_class_type
));
14000 (build_scoped_method_call
14001 (current_class_ref
, vb
, base_dtor_identifier
,
14006 finish_then_clause (if_stmt
);
14011 virtual_size
= c_sizeof (current_class_type
);
14013 /* At the end, call delete if that's what's requested. */
14015 /* FDIS sez: At the point of definition of a virtual destructor
14016 (including an implicit definition), non-placement operator delete
14017 shall be looked up in the scope of the destructor's class and if
14018 found shall be accessible and unambiguous.
14020 This is somewhat unclear, but I take it to mean that if the class
14021 only defines placement deletes we don't do anything here. So we
14022 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14023 they ever try to delete one of these. */
14024 exprstmt
= build_op_delete_call
14025 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14026 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14028 if_stmt
= begin_if_stmt ();
14029 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14030 current_in_charge_parm
,
14033 finish_expr_stmt (exprstmt
);
14034 finish_then_clause (if_stmt
);
14037 /* Close the block we started above. */
14038 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
14041 /* Finish up a function declaration and compile that function
14042 all the way to assembler language output. The free the storage
14043 for the function definition.
14045 FLAGS is a bitwise or of the following values:
14047 An extra call to poplevel (and expand_end_bindings) must be
14048 made to take care of the binding contour for the base
14049 initializers. This is only relevant for constructors.
14051 We just finished processing the body of an in-class inline
14052 function definition. (This processing will have taken place
14053 after the class definition is complete.) */
14056 finish_function (flags
)
14059 register tree fndecl
= current_function_decl
;
14060 tree fntype
, ctype
= NULL_TREE
;
14061 int call_poplevel
= (flags
& 1) != 0;
14062 int inclass_inline
= (flags
& 2) != 0;
14065 /* When we get some parse errors, we can end up without a
14066 current_function_decl, so cope. */
14067 if (fndecl
== NULL_TREE
)
14068 return error_mark_node
;
14070 nested
= function_depth
> 1;
14071 fntype
= TREE_TYPE (fndecl
);
14073 /* TREE_READONLY (fndecl) = 1;
14074 This caused &foo to be of type ptr-to-const-function
14075 which then got a warning when stored in a ptr-to-function variable. */
14077 my_friendly_assert (building_stmt_tree (), 20000911);
14079 /* For a cloned function, we've already got all the code we need;
14080 there's no need to add any extra bits. */
14081 if (!DECL_CLONED_FUNCTION_P (fndecl
))
14083 if (DECL_CONSTRUCTOR_P (fndecl
))
14085 finish_constructor_body ();
14089 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
14090 finish_destructor_body ();
14091 else if (DECL_MAIN_P (fndecl
))
14093 /* Make it so that `main' always returns 0 by default. */
14095 finish_return_stmt (integer_one_node
);
14097 finish_return_stmt (integer_zero_node
);
14101 /* Finish dealing with exception specifiers. */
14102 if (flag_exceptions
&& !processing_template_decl
14103 && flag_enforce_eh_specs
14104 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14105 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14106 (TREE_TYPE (current_function_decl
)),
14107 current_eh_spec_try_block
);
14110 /* If we're saving up tree structure, tie off the function now. */
14111 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14113 /* This must come after expand_function_end because cleanups might
14114 have declarations (from inline functions) that need to go into
14115 this function's blocks. */
14116 if (current_binding_level
->parm_flag
!= 1)
14117 my_friendly_abort (122);
14118 poplevel (1, 0, 1);
14120 /* Remember that we were in class scope. */
14121 if (current_class_name
)
14122 ctype
= current_class_type
;
14124 /* Must mark the RESULT_DECL as being in this function. */
14125 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14127 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14128 to the FUNCTION_DECL node itself. */
14129 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14131 /* Save away current state, if appropriate. */
14132 if (!processing_template_decl
)
14133 save_function_data (fndecl
);
14135 /* If this function calls `setjmp' it cannot be inlined. When
14136 `longjmp' is called it is not guaranteed to restore the value of
14137 local variables that have been modified since the call to
14138 `setjmp'. So, if were to inline this function into some caller
14139 `c', then when we `longjmp', we might not restore all variables
14140 in `c'. (It might seem, at first blush, that there's no way for
14141 this function to modify local variables in `c', but their
14142 addresses may have been stored somewhere accessible to this
14144 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14145 DECL_UNINLINABLE (fndecl
) = 1;
14147 /* Clear out memory we no longer need. */
14148 free_after_parsing (cfun
);
14149 /* Since we never call rest_of_compilation, we never clear
14150 CFUN. Do so explicitly. */
14151 free_after_compilation (cfun
);
14154 /* If this is a in-class inline definition, we may have to pop the
14155 bindings for the template parameters that we added in
14156 maybe_begin_member_template_processing when start_function was
14158 if (inclass_inline
)
14159 maybe_end_member_template_processing ();
14161 /* Leave the scope of the class. */
14163 pop_nested_class ();
14169 /* Let the error reporting routines know that we're outside a
14170 function. For a nested function, this value is used in
14171 pop_cp_function_context and then reset via pop_function_context. */
14172 current_function_decl
= NULL_TREE
;
14177 /* Create the FUNCTION_DECL for a function definition.
14178 DECLSPECS and DECLARATOR are the parts of the declaration;
14179 they describe the return type and the name of the function,
14180 but twisted together in a fashion that parallels the syntax of C.
14182 This function creates a binding context for the function body
14183 as well as setting up the FUNCTION_DECL in current_function_decl.
14185 Returns a FUNCTION_DECL on success.
14187 If the DECLARATOR is not suitable for a function (it defines a datum
14188 instead), we return 0, which tells yyparse to report a parse error.
14190 May return void_type_node indicating that this method is actually
14191 a friend. See grokfield for more details.
14193 Came here with a `.pushlevel' .
14195 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14196 CHANGES TO CODE IN `grokfield'. */
14199 start_method (declspecs
, declarator
, attrlist
)
14200 tree declarator
, declspecs
, attrlist
;
14202 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14205 /* Something too ugly to handle. */
14206 if (fndecl
== NULL_TREE
)
14209 /* Pass friends other than inline friend functions back. */
14210 if (fndecl
== void_type_node
)
14213 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14214 /* Not a function, tell parser to report parse error. */
14217 if (DECL_IN_AGGR_P (fndecl
))
14219 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14221 if (DECL_CONTEXT (fndecl
)
14222 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14223 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14224 DECL_CONTEXT (fndecl
));
14226 return void_type_node
;
14229 check_template_shadow (fndecl
);
14231 DECL_THIS_INLINE (fndecl
) = 1;
14233 if (flag_default_inline
)
14234 DECL_INLINE (fndecl
) = 1;
14236 /* We process method specializations in finish_struct_1. */
14237 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14238 fndecl
= push_template_decl (fndecl
);
14240 if (! DECL_FRIEND_P (fndecl
))
14242 if (TREE_CHAIN (fndecl
))
14244 fndecl
= copy_node (fndecl
);
14245 TREE_CHAIN (fndecl
) = NULL_TREE
;
14248 if (DECL_CONSTRUCTOR_P (fndecl
))
14250 if (! grok_ctor_properties (current_class_type
, fndecl
))
14251 return void_type_node
;
14253 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14254 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14257 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14259 /* Make a place for the parms */
14261 current_binding_level
->parm_flag
= 1;
14263 DECL_IN_AGGR_P (fndecl
) = 1;
14267 /* Go through the motions of finishing a function definition.
14268 We don't compile this method until after the whole class has
14271 FINISH_METHOD must return something that looks as though it
14272 came from GROKFIELD (since we are defining a method, after all).
14274 This is called after parsing the body of the function definition.
14275 STMTS is the chain of statements that makes up the function body.
14277 DECL is the ..._DECL that `start_method' provided. */
14280 finish_method (decl
)
14283 register tree fndecl
= decl
;
14286 register tree link
;
14288 if (decl
== void_type_node
)
14291 old_initial
= DECL_INITIAL (fndecl
);
14293 /* Undo the level for the parms (from start_method).
14294 This is like poplevel, but it causes nothing to be
14295 saved. Saving information here confuses symbol-table
14296 output routines. Besides, this information will
14297 be correctly output when this method is actually
14300 /* Clear out the meanings of the local variables of this level;
14301 also record in each decl which block it belongs to. */
14303 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14305 if (DECL_NAME (link
) != NULL_TREE
)
14306 pop_binding (DECL_NAME (link
), link
);
14307 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14308 DECL_CONTEXT (link
) = NULL_TREE
;
14311 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14312 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14313 current_binding_level
->parm_flag
,
14314 current_binding_level
->keep
);
14316 poplevel (0, 0, 0);
14318 DECL_INITIAL (fndecl
) = old_initial
;
14320 /* We used to check if the context of FNDECL was different from
14321 current_class_type as another way to get inside here. This didn't work
14322 for String.cc in libg++. */
14323 if (DECL_FRIEND_P (fndecl
))
14325 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14326 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14327 decl
= void_type_node
;
14333 /* Called when a new struct TYPE is defined.
14334 If this structure or union completes the type of any previous
14335 variable declaration, lay it out and output its rtl. */
14338 hack_incomplete_structures (type
)
14342 struct binding_level
*level
;
14344 if (!type
) /* Don't do this for class templates. */
14347 if (namespace_bindings_p ())
14350 list
= &namespace_scope_incomplete
;
14354 level
= innermost_nonclass_level ();
14355 list
= &level
->incomplete
;
14362 tree decl
= TREE_VALUE (*list
);
14363 if ((decl
&& TREE_TYPE (decl
) == type
)
14364 || (TREE_TYPE (decl
)
14365 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14366 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14368 int toplevel
= toplevel_bindings_p ();
14369 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14370 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14371 layout_type (TREE_TYPE (decl
));
14372 layout_decl (decl
, 0);
14373 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14377 expand_decl (decl
);
14378 cleanup
= maybe_build_cleanup (decl
);
14379 expand_decl_init (decl
);
14380 if (! expand_decl_cleanup (decl
, cleanup
))
14381 cp_error ("parser lost in parsing declaration of `%D'",
14384 *list
= TREE_CHAIN (*list
);
14387 list
= &TREE_CHAIN (*list
);
14390 /* Keep looking through artificial binding levels generated
14391 for local variables. */
14392 if (level
&& level
->keep
== 2)
14394 level
= level
->level_chain
;
14395 list
= &level
->incomplete
;
14402 /* If DECL is of a type which needs a cleanup, build that cleanup
14406 maybe_build_cleanup (decl
)
14409 tree type
= TREE_TYPE (decl
);
14411 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14413 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14416 if (TREE_CODE (type
) == ARRAY_TYPE
)
14420 mark_addressable (decl
);
14421 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14424 /* Optimize for space over speed here. */
14425 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14426 || flag_expensive_optimizations
)
14427 flags
|= LOOKUP_NONVIRTUAL
;
14429 rval
= build_delete (TREE_TYPE (rval
), rval
,
14430 sfk_complete_destructor
, flags
, 0);
14432 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14433 && ! TYPE_HAS_DESTRUCTOR (type
))
14434 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14435 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14442 /* When a stmt has been parsed, this function is called. */
14447 /* Always assume this statement was not an expression statement. If
14448 it actually was an expression statement, its our callers
14449 responsibility to fix this up. */
14450 last_expr_type
= NULL_TREE
;
14453 /* DECL was originally constructed as a non-static member function,
14454 but turned out to be static. Update it accordingly. */
14457 revert_static_member_fn (decl
)
14461 tree function
= TREE_TYPE (decl
);
14462 tree args
= TYPE_ARG_TYPES (function
);
14464 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14465 != TYPE_UNQUALIFIED
)
14466 cp_error ("static member function `%#D' declared with type qualifiers",
14469 args
= TREE_CHAIN (args
);
14470 tmp
= build_function_type (TREE_TYPE (function
), args
);
14471 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14472 tmp
= build_exception_variant (tmp
,
14473 TYPE_RAISES_EXCEPTIONS (function
));
14474 TREE_TYPE (decl
) = tmp
;
14475 if (DECL_ARGUMENTS (decl
))
14476 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14477 DECL_STATIC_FUNCTION_P (decl
) = 1;
14480 /* Initialize the variables used during compilation of a C++
14484 push_cp_function_context (f
)
14485 struct function
*f
;
14487 struct cp_language_function
*p
14488 = ((struct cp_language_function
*)
14489 xcalloc (1, sizeof (struct cp_language_function
)));
14490 f
->language
= (struct language_function
*) p
;
14492 /* It takes an explicit call to expand_body to generate RTL for a
14496 /* Whenever we start a new function, we destroy temporaries in the
14498 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14501 /* Free the language-specific parts of F, now that we've finished
14502 compiling the function. */
14505 pop_cp_function_context (f
)
14506 struct function
*f
;
14509 free (f
->language
);
14513 /* Mark P for GC. */
14516 mark_lang_function (p
)
14517 struct cp_language_function
*p
;
14522 mark_c_language_function (&p
->base
);
14524 ggc_mark_tree (p
->x_ctor_label
);
14525 ggc_mark_tree (p
->x_dtor_label
);
14526 ggc_mark_tree (p
->x_current_class_ptr
);
14527 ggc_mark_tree (p
->x_current_class_ref
);
14528 ggc_mark_tree (p
->x_eh_spec_try_block
);
14530 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14531 mark_binding_level (&p
->bindings
);
14534 /* Mark the language-specific data in F for GC. */
14537 mark_cp_function_context (f
)
14538 struct function
*f
;
14540 mark_lang_function ((struct cp_language_function
*) f
->language
);
14547 enum tree_code code
= TREE_CODE (t
);
14548 if (code
== IDENTIFIER_NODE
)
14550 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14551 struct lang_id2
*li2
= li
->x
;
14552 ggc_mark_tree (li
->namespace_bindings
);
14553 ggc_mark_tree (li
->bindings
);
14554 ggc_mark_tree (li
->class_value
);
14555 ggc_mark_tree (li
->class_template_info
);
14559 ggc_mark_tree (li2
->label_value
);
14560 ggc_mark_tree (li2
->implicit_decl
);
14561 ggc_mark_tree (li2
->error_locus
);
14564 else if (code
== CPLUS_BINDING
)
14566 if (BINDING_HAS_LEVEL_P (t
))
14567 mark_binding_level (&BINDING_LEVEL (t
));
14569 ggc_mark_tree (BINDING_SCOPE (t
));
14570 ggc_mark_tree (BINDING_VALUE (t
));
14572 else if (code
== OVERLOAD
)
14573 ggc_mark_tree (OVL_FUNCTION (t
));
14574 else if (code
== TEMPLATE_PARM_INDEX
)
14575 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14576 else if (TREE_CODE_CLASS (code
) == 'd')
14578 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14583 c_mark_lang_decl (&ld
->decl_flags
.base
);
14584 if (!DECL_GLOBAL_CTOR_P (t
)
14585 && !DECL_GLOBAL_DTOR_P (t
)
14586 && !DECL_THUNK_P (t
))
14587 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14588 else if (DECL_THUNK_P (t
))
14589 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14590 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14591 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14593 mark_binding_level (&NAMESPACE_LEVEL (t
));
14594 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14596 ggc_mark_tree (ld
->befriending_classes
);
14597 ggc_mark_tree (ld
->context
);
14598 ggc_mark_tree (ld
->cloned_function
);
14599 if (!DECL_OVERLOADED_OPERATOR_P (t
))
14600 ggc_mark_tree (ld
->u2
.vtt_parm
);
14601 if (TREE_CODE (t
) == TYPE_DECL
)
14602 ggc_mark_tree (ld
->u
.sorted_fields
);
14603 else if (TREE_CODE (t
) == FUNCTION_DECL
14604 && !DECL_PENDING_INLINE_P (t
))
14605 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14609 else if (TREE_CODE_CLASS (code
) == 't')
14611 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14613 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14614 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14617 ggc_mark_tree (lt
->primary_base
);
14618 ggc_mark_tree (lt
->vfields
);
14619 ggc_mark_tree (lt
->vbases
);
14620 ggc_mark_tree (lt
->tags
);
14621 ggc_mark_tree (lt
->size
);
14622 ggc_mark_tree (lt
->pure_virtuals
);
14623 ggc_mark_tree (lt
->friend_classes
);
14624 ggc_mark_tree (lt
->rtti
);
14625 ggc_mark_tree (lt
->methods
);
14626 ggc_mark_tree (lt
->template_info
);
14627 ggc_mark_tree (lt
->befriending_classes
);
14630 /* In the case of pointer-to-member function types, the
14631 TYPE_LANG_SPECIFIC is really just a tree. */
14632 ggc_mark_tree ((tree
) lt
);
14636 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14637 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14640 identifier_global_value (t
)
14643 return IDENTIFIER_GLOBAL_VALUE (t
);