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"
84 #define WINT_TYPE "unsigned int"
88 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
90 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
96 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
98 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
99 ? "long unsigned int" \
100 : "long long unsigned int"))
103 static tree grokparms
PARAMS ((tree
, int));
104 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
106 static void push_binding_level
PARAMS ((struct binding_level
*, int,
108 static void pop_binding_level
PARAMS ((void));
109 static void suspend_binding_level
PARAMS ((void));
110 static void resume_binding_level
PARAMS ((struct binding_level
*));
111 static struct binding_level
*make_binding_level
PARAMS ((void));
112 static void declare_namespace_level
PARAMS ((void));
113 static int decl_jump_unsafe
PARAMS ((tree
));
114 static void storedecls
PARAMS ((tree
));
115 static void require_complete_types_for_parms
PARAMS ((tree
));
116 static int ambi_op_p
PARAMS ((enum tree_code
));
117 static int unary_op_p
PARAMS ((enum tree_code
));
118 static tree store_bindings
PARAMS ((tree
, tree
));
119 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
120 static tree obscure_complex_init
PARAMS ((tree
, tree
));
121 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
122 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
123 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
124 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
125 enum overload_flags
, tree
,
126 tree
, int, int, int, int, int, int, tree
));
127 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
128 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
129 struct binding_level
*, int));
130 static void set_identifier_type_value_with_scope
131 PARAMS ((tree
, tree
, struct binding_level
*));
132 static void record_builtin_type
PARAMS ((enum rid
, const char *, tree
));
133 static void record_unknown_type
PARAMS ((tree
, const char *));
134 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
135 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
136 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
138 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
139 static void check_for_uninitialized_const_var
PARAMS ((tree
));
140 static unsigned long typename_hash
PARAMS ((hash_table_key
));
141 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
142 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
143 static int add_binding
PARAMS ((tree
, tree
));
144 static void pop_binding
PARAMS ((tree
, tree
));
145 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
146 static tree find_binding
PARAMS ((tree
, tree
));
147 static tree select_decl
PARAMS ((tree
, int));
148 static int lookup_flags
PARAMS ((int, int));
149 static tree qualify_lookup
PARAMS ((tree
, int));
150 static tree record_builtin_java_type
PARAMS ((const char *, int));
151 static const char *tag_name
PARAMS ((enum tag_types code
));
152 static void find_class_binding_level
PARAMS ((void));
153 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
154 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
155 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
156 static int walk_globals_r
PARAMS ((tree
, void *));
157 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
158 static tree make_label_decl
PARAMS ((tree
, int));
159 static void use_label
PARAMS ((tree
));
160 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
162 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
163 static void check_switch_goto
PARAMS ((struct binding_level
*));
164 static void check_previous_gotos
PARAMS ((tree
));
165 static void pop_label
PARAMS ((tree
, tree
));
166 static void pop_labels
PARAMS ((tree
));
167 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
168 static void layout_var_decl
PARAMS ((tree
));
169 static void maybe_commonize_var
PARAMS ((tree
));
170 static tree check_initializer
PARAMS ((tree
, tree
));
171 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
172 static void push_cp_function_context
PARAMS ((struct function
*));
173 static void pop_cp_function_context
PARAMS ((struct function
*));
174 static void mark_binding_level
PARAMS ((void *));
175 static void mark_named_label_lists
PARAMS ((void *, void *));
176 static void mark_cp_function_context
PARAMS ((struct function
*));
177 static void mark_saved_scope
PARAMS ((void *));
178 static void mark_lang_function
PARAMS ((struct cp_language_function
*));
179 static void save_function_data
PARAMS ((tree
));
180 static void check_function_type
PARAMS ((tree
, tree
));
181 static void destroy_local_var
PARAMS ((tree
));
182 static void finish_constructor_body
PARAMS ((void));
183 static void finish_destructor_body
PARAMS ((void));
184 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
185 static tree get_atexit_node
PARAMS ((void));
186 static tree get_dso_handle_node
PARAMS ((void));
187 static tree start_cleanup_fn
PARAMS ((void));
188 static void end_cleanup_fn
PARAMS ((void));
189 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
190 static void initialize_predefined_identifiers
PARAMS ((void));
191 static tree check_special_function_return_type
192 PARAMS ((special_function_kind
, tree
, tree
, tree
));
193 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
194 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
195 static void store_parm_decls
PARAMS ((tree
));
197 #if defined (DEBUG_CP_BINDING_LEVELS)
198 static void indent
PARAMS ((void));
201 /* Erroneous argument lists can use this *IFF* they do not modify it. */
202 tree error_mark_list
;
204 /* The following symbols are subsumed in the cp_global_trees array, and
205 listed here individually for documentation purposes.
208 tree wchar_decl_node;
210 tree vtable_entry_type;
211 tree delta_type_node;
214 tree __baselist_desc_type_node;
215 tree __i_desc_type_node, __m_desc_type_node;
216 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
218 tree __t_desc_type_node;
220 tree __tp_desc_type_node;
222 tree ti_desc_type_node;
223 tree bltn_desc_type_node, ptr_desc_type_node;
224 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
225 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
226 tree ptm_desc_type_node;
227 tree base_desc_type_node;
229 Not needed yet? May be needed one day?
230 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
231 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
232 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
235 tree class_type_node, record_type_node, union_type_node, enum_type_node;
236 tree unknown_type_node;
238 Array type `vtable_entry_type[]'
241 tree vtbl_ptr_type_node;
248 A FUNCTION_DECL which can call `abort'. Not necessarily the
249 one that the user will declare, but sufficient to be called
250 by routines that want to abort the program.
254 The FUNCTION_DECL for the default `::operator delete'.
256 tree global_delete_fndecl;
259 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
264 tree cp_global_trees
[CPTI_MAX
];
266 /* Indicates that there is a type value in some namespace, although
267 that is not necessarily in scope at the moment. */
269 static tree global_type_node
;
271 /* If non-zero, this is the number of times we have entered the `std'
272 namespace when we are treating that namespace as an alias for the
274 static int in_fake_std
;
276 /* Expect only namespace names now. */
277 static int only_namespace_names
;
279 /* Used only for jumps to as-yet undefined labels, since jumps to
280 defined labels can have their validity checked immediately. */
282 struct named_label_use_list
284 struct binding_level
*binding_level
;
287 const char *filename_o_goto
;
289 struct named_label_use_list
*next
;
292 #define named_label_uses cp_function_chain->x_named_label_uses
294 /* A list of objects which have constructors or destructors
295 which reside in the global scope. The decl is stored in
296 the TREE_VALUE slot and the initializer is stored
297 in the TREE_PURPOSE slot. */
298 tree static_aggregates
;
302 /* A node for the integer constants 2, and 3. */
304 tree integer_two_node
, integer_three_node
;
306 /* Parsing a function declarator leaves here a chain of structure
307 and enum types declared in the parmlist. */
309 static tree last_function_parm_tags
;
311 /* Similar, for last_function_parm_tags. */
312 tree last_function_parms
;
313 static tree current_function_parm_tags
;
315 /* A list of all LABEL_DECLs in the function that have names. Here so
316 we can clear out their names' definitions at the end of the
317 function, and so we can check the validity of jumps to these labels. */
319 struct named_label_list
321 struct binding_level
*binding_level
;
327 struct named_label_list
*next
;
330 #define named_labels cp_function_chain->x_named_labels
332 /* Set to 0 at beginning of a function definition, and whenever
333 a label (case or named) is defined. Set to value of expression
334 returned from function when that value can be transformed into
335 a named return value. */
337 tree current_function_return_value
;
339 /* Nonzero means use the ISO C94 dialect of C. */
343 /* Nonzero means use the ISO C99 dialect of C. */
347 /* Nonzero means we are a hosted implementation for code shared with C. */
351 /* Nonzero means add default format_arg attributes for functions not
354 int flag_noniso_default_format_attributes
= 1;
356 /* Nonzero means give `double' the same size as `float'. */
358 extern int flag_short_double
;
360 /* Nonzero if we want to conserve space in the .o files. We do this
361 by putting uninitialized data and runtime initialized data into
362 .common instead of .data at the expense of not flagging multiple
364 extern int flag_conserve_space
;
366 /* C and C++ flags are in decl2.c. */
368 /* Flag used when debugging spew.c */
370 extern int spew_debug
;
372 /* A expression of value 0 with the same precision as a sizetype
374 tree signed_size_zero_node
;
376 /* The name of the anonymous namespace, throughout this translation
378 tree anonymous_namespace_name
;
380 /* The number of function bodies which we are currently processing.
381 (Zero if we are at namespace scope, one inside the body of a
382 function, two inside the body of a function in a local class, etc.) */
385 /* For each binding contour we allocate a binding_level structure
386 which records the names defined in that contour.
389 1) one for each function definition,
390 where internal declarations of the parameters appear.
391 2) one for each compound statement,
392 to record its declarations.
394 The current meaning of a name can be found by searching the levels
395 from the current one out to the global one.
397 Off to the side, may be the class_binding_level. This exists only
398 to catch class-local declarations. It is otherwise nonexistent.
400 Also there may be binding levels that catch cleanups that must be
401 run when exceptions occur. Thus, to see whether a name is bound in
402 the current scope, it is not enough to look in the
403 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
406 /* Note that the information in the `names' component of the global contour
407 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
411 /* A chain of _DECL nodes for all variables, constants, functions,
412 and typedef types. These are in the reverse of the order
413 supplied. There may be OVERLOADs on this list, too, but they
414 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
417 /* A list of structure, union and enum definitions, for looking up
419 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
420 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
421 or ENUMERAL_TYPE node.
423 C++: the TREE_VALUE nodes can be simple types for
424 component_bindings. */
427 /* A list of USING_DECL nodes. */
430 /* A list of used namespaces. PURPOSE is the namespace,
431 VALUE the common ancestor with this binding_level's namespace. */
432 tree using_directives
;
434 /* If this binding level is the binding level for a class, then
435 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
436 is the name of an entity bound in the class; the TREE_VALUE is
437 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
438 when leaving class scope, we can restore the
439 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
440 the DECL bound by this name in the class. */
443 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
444 is used for all binding levels. */
447 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
448 label in this scope. The TREE_PURPOSE is the previous value of
449 the IDENTIFIER_LABEL VALUE. */
450 tree shadowed_labels
;
452 /* For each level (except not the global one),
453 a chain of BLOCK nodes for all the levels
454 that were entered and exited one level down. */
457 /* The _TYPE node for this level, if parm_flag == 2. */
460 /* The binding level which this one is contained in (inherits from). */
461 struct binding_level
*level_chain
;
463 /* List of decls in `names' that have incomplete
464 structure or union types. */
467 /* List of VAR_DECLS saved from a previous for statement.
468 These would be dead in ISO-conforming code, but might
469 be referenced in ARM-era code. These are stored in a
470 TREE_LIST; the TREE_VALUE is the actual declaration. */
471 tree dead_vars_from_for
;
473 /* 1 for the level that holds the parameters of a function.
474 2 for the level that holds a class declaration. */
475 unsigned parm_flag
: 2;
477 /* 1 means make a BLOCK for this level regardless of all else.
478 2 for temporary binding contours created by the compiler. */
481 /* Nonzero if this level "doesn't exist" for tags. */
482 unsigned tag_transparent
: 1;
484 /* Nonzero if this level can safely have additional
485 cleanup-needing variables added to it. */
486 unsigned more_cleanups_ok
: 1;
487 unsigned have_cleanups
: 1;
489 /* Nonzero if this scope is for storing the decls for template
490 parameters and generic decls; these decls will be discarded and
491 replaced with a TEMPLATE_DECL. */
492 unsigned template_parms_p
: 1;
494 /* Nonzero if this scope corresponds to the `<>' in a
495 `template <>' clause. Whenever this flag is set,
496 TEMPLATE_PARMS_P will be set as well. */
497 unsigned template_spec_p
: 1;
499 /* This is set for a namespace binding level. */
500 unsigned namespace_p
: 1;
502 /* True if this level is that of a for-statement where we need to
503 worry about ambiguous (ARM or ISO) scope rules. */
504 unsigned is_for_scope
: 1;
506 /* True if this level corresponds to an EH region, as for a try block.
507 Currently this information is only available while building the
509 unsigned eh_region
: 1;
511 /* Four bits left for this word. */
513 #if defined(DEBUG_CP_BINDING_LEVELS)
514 /* Binding depth at which this level began. */
515 unsigned binding_depth
;
516 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
519 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
521 /* The binding level currently in effect. */
523 #define current_binding_level \
525 ? cp_function_chain->bindings \
526 : scope_chain->bindings)
528 /* The binding level of the current class, if any. */
530 #define class_binding_level scope_chain->class_bindings
532 /* A chain of binding_level structures awaiting reuse. */
534 static struct binding_level
*free_binding_level
;
536 /* The outermost binding level, for names of file scope.
537 This is created when the compiler is started and exists
538 through the entire run. */
540 static struct binding_level
*global_binding_level
;
542 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
544 static int keep_next_level_flag
;
546 #if defined(DEBUG_CP_BINDING_LEVELS)
547 static int binding_depth
= 0;
548 static int is_class_level
= 0;
555 for (i
= 0; i
< binding_depth
*2; i
++)
558 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
560 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
563 push_binding_level (newlevel
, tag_transparent
, keep
)
564 struct binding_level
*newlevel
;
565 int tag_transparent
, keep
;
567 /* Add this level to the front of the chain (stack) of levels that
569 memset ((char*) newlevel
, 0, sizeof (struct binding_level
));
570 newlevel
->level_chain
= current_binding_level
;
571 current_binding_level
= newlevel
;
572 newlevel
->tag_transparent
= tag_transparent
;
573 newlevel
->more_cleanups_ok
= 1;
575 newlevel
->keep
= keep
;
576 #if defined(DEBUG_CP_BINDING_LEVELS)
577 newlevel
->binding_depth
= binding_depth
;
579 fprintf (stderr
, "push %s level 0x%08x line %d\n",
580 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
583 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
586 /* Find the innermost enclosing class scope, and reset
587 CLASS_BINDING_LEVEL appropriately. */
590 find_class_binding_level ()
592 struct binding_level
*level
= current_binding_level
;
594 while (level
&& level
->parm_flag
!= 2)
595 level
= level
->level_chain
;
596 if (level
&& level
->parm_flag
== 2)
597 class_binding_level
= level
;
599 class_binding_level
= 0;
605 if (global_binding_level
)
607 /* Cannot pop a level, if there are none left to pop. */
608 if (current_binding_level
== global_binding_level
)
609 my_friendly_abort (123);
611 /* Pop the current level, and free the structure for reuse. */
612 #if defined(DEBUG_CP_BINDING_LEVELS)
615 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
616 (is_class_level
) ? "class" : "block",
617 current_binding_level
, lineno
);
618 if (is_class_level
!= (current_binding_level
== class_binding_level
))
621 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
624 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
626 register struct binding_level
*level
= current_binding_level
;
627 current_binding_level
= current_binding_level
->level_chain
;
628 level
->level_chain
= free_binding_level
;
629 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
630 if (level
->binding_depth
!= binding_depth
)
632 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
633 free_binding_level
= level
;
634 find_class_binding_level ();
639 suspend_binding_level ()
641 if (class_binding_level
)
642 current_binding_level
= class_binding_level
;
644 if (global_binding_level
)
646 /* Cannot suspend a level, if there are none left to suspend. */
647 if (current_binding_level
== global_binding_level
)
648 my_friendly_abort (123);
650 /* Suspend the current level. */
651 #if defined(DEBUG_CP_BINDING_LEVELS)
654 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
655 (is_class_level
) ? "class" : "block",
656 current_binding_level
, lineno
);
657 if (is_class_level
!= (current_binding_level
== class_binding_level
))
660 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
663 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
664 current_binding_level
= current_binding_level
->level_chain
;
665 find_class_binding_level ();
669 resume_binding_level (b
)
670 struct binding_level
*b
;
672 /* Resuming binding levels is meant only for namespaces,
673 and those cannot nest into classes. */
674 my_friendly_assert(!class_binding_level
, 386);
675 /* Also, resuming a non-directly nested namespace is a no-no. */
676 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
677 current_binding_level
= b
;
678 #if defined(DEBUG_CP_BINDING_LEVELS)
679 b
->binding_depth
= binding_depth
;
681 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
682 (is_class_level
) ? "class" : "block", b
, lineno
);
685 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
688 /* Create a new `struct binding_level'. */
691 struct binding_level
*
692 make_binding_level ()
695 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
698 /* Nonzero if we are currently in the global binding level. */
703 return current_binding_level
== global_binding_level
;
706 /* Return the innermost binding level that is not for a class scope. */
708 static struct binding_level
*
709 innermost_nonclass_level ()
711 struct binding_level
*b
;
713 b
= current_binding_level
;
714 while (b
->parm_flag
== 2)
720 /* Nonzero if we are currently in a toplevel binding level. This
721 means either the global binding level or a namespace in a toplevel
722 binding level. Since there are no non-toplevel namespace levels,
723 this really means any namespace or template parameter level. We
724 also include a class whose context is toplevel. */
727 toplevel_bindings_p ()
729 struct binding_level
*b
= innermost_nonclass_level ();
731 return b
->namespace_p
|| b
->template_parms_p
;
734 /* Nonzero if this is a namespace scope, or if we are defining a class
735 which is itself at namespace scope, or whose enclosing class is
736 such a class, etc. */
739 namespace_bindings_p ()
741 struct binding_level
*b
= innermost_nonclass_level ();
743 return b
->namespace_p
;
746 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
747 unconditionally. Otherwise, use the normal logic to decide whether
748 or not to create a BLOCK. */
751 keep_next_level (keep
)
754 keep_next_level_flag
= keep
;
757 /* Nonzero if the current level needs to have a BLOCK made. */
762 return (current_binding_level
->blocks
!= NULL_TREE
763 || current_binding_level
->keep
764 || current_binding_level
->names
!= NULL_TREE
765 || (current_binding_level
->tags
!= NULL_TREE
766 && !current_binding_level
->tag_transparent
));
770 declare_namespace_level ()
772 current_binding_level
->namespace_p
= 1;
775 /* Returns non-zero if this scope was created to store template
779 template_parm_scope_p ()
781 return current_binding_level
->template_parms_p
;
784 /* Returns the kind of template specialization we are currently
785 processing, given that it's declaration contained N_CLASS_SCOPES
786 explicit scope qualifications. */
789 current_tmpl_spec_kind (n_class_scopes
)
792 int n_template_parm_scopes
= 0;
793 int seen_specialization_p
= 0;
794 int innermost_specialization_p
= 0;
795 struct binding_level
*b
;
797 /* Scan through the template parameter scopes. */
798 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
800 /* If we see a specialization scope inside a parameter scope,
801 then something is wrong. That corresponds to a declaration
804 template <class T> template <> ...
806 which is always illegal since [temp.expl.spec] forbids the
807 specialization of a class member template if the enclosing
808 class templates are not explicitly specialized as well. */
809 if (b
->template_spec_p
)
811 if (n_template_parm_scopes
== 0)
812 innermost_specialization_p
= 1;
814 seen_specialization_p
= 1;
816 else if (seen_specialization_p
== 1)
817 return tsk_invalid_member_spec
;
819 ++n_template_parm_scopes
;
822 /* Handle explicit instantiations. */
823 if (processing_explicit_instantiation
)
825 if (n_template_parm_scopes
!= 0)
826 /* We've seen a template parameter list during an explicit
827 instantiation. For example:
829 template <class T> template void f(int);
831 This is erroneous. */
832 return tsk_invalid_expl_inst
;
834 return tsk_expl_inst
;
837 if (n_template_parm_scopes
< n_class_scopes
)
838 /* We've not seen enough template headers to match all the
839 specialized classes present. For example:
841 template <class T> void R<T>::S<T>::f(int);
843 This is illegal; there needs to be one set of template
844 parameters for each class. */
845 return tsk_insufficient_parms
;
846 else if (n_template_parm_scopes
== n_class_scopes
)
847 /* We're processing a non-template declaration (even though it may
848 be a member of a template class.) For example:
850 template <class T> void S<T>::f(int);
852 The `class T' maches the `S<T>', leaving no template headers
853 corresponding to the `f'. */
855 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
856 /* We've got too many template headers. For example:
858 template <> template <class T> void f (T);
860 There need to be more enclosing classes. */
861 return tsk_excessive_parms
;
863 /* This must be a template. It's of the form:
865 template <class T> template <class U> void S<T>::f(U);
867 This is a specialization if the innermost level was a
868 specialization; otherwise it's just a definition of the
870 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
874 set_class_shadows (shadows
)
877 class_binding_level
->class_shadowed
= shadows
;
880 /* Enter a new binding level.
881 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
882 not for that of tags. */
885 pushlevel (tag_transparent
)
888 struct binding_level
*newlevel
;
890 if (cfun
&& !doing_semantic_analysis_p ())
893 /* Reuse or create a struct for this binding level. */
894 #if defined(DEBUG_CP_BINDING_LEVELS)
896 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
897 if (free_binding_level
)
898 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
900 newlevel
= free_binding_level
;
901 free_binding_level
= free_binding_level
->level_chain
;
904 newlevel
= make_binding_level ();
906 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
907 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
908 keep_next_level_flag
= 0;
911 /* Enter a new scope. The KIND indicates what kind of scope is being
922 case sk_template_spec
:
923 current_binding_level
->template_spec_p
= 1;
926 case sk_template_parms
:
927 current_binding_level
->template_parms_p
= 1;
931 my_friendly_abort (20000309);
935 /* Exit the current scope. */
944 note_level_for_for ()
946 current_binding_level
->is_for_scope
= 1;
949 /* Record that the current binding level represents a try block. */
954 current_binding_level
->eh_region
= 1;
957 /* For a binding between a name and an entity at a block scope,
958 this is the `struct binding_level' for the block. */
959 #define BINDING_LEVEL(NODE) \
960 (((struct tree_binding*)NODE)->scope.level)
962 /* Make DECL the innermost binding for ID. The LEVEL is the binding
963 level at which this declaration is being bound. */
966 push_binding (id
, decl
, level
)
969 struct binding_level
* level
;
973 binding
= make_node (CPLUS_BINDING
);
975 /* Now, fill in the binding information. */
976 BINDING_VALUE (binding
) = decl
;
977 BINDING_TYPE (binding
) = NULL_TREE
;
978 BINDING_LEVEL (binding
) = level
;
979 INHERITED_VALUE_BINDING_P (binding
) = 0;
980 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
981 BINDING_HAS_LEVEL_P (binding
) = 1;
983 /* And put it on the front of the list of bindings for ID. */
984 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
985 IDENTIFIER_BINDING (id
) = binding
;
988 /* ID is already bound in the current scope. But, DECL is an
989 additional binding for ID in the same scope. This is the `struct
990 stat' hack whereby a non-typedef class-name or enum-name can be
991 bound at the same level as some other kind of entity. It's the
992 responsibility of the caller to check that inserting this name is
993 legal here. Returns nonzero if the new binding was successful. */
995 add_binding (id
, decl
)
999 tree binding
= IDENTIFIER_BINDING (id
);
1002 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1003 /* The new name is the type name. */
1004 BINDING_TYPE (binding
) = decl
;
1005 else if (!BINDING_VALUE (binding
))
1006 /* This situation arises when push_class_level_binding moves an
1007 inherited type-binding out of the way to make room for a new
1009 BINDING_VALUE (binding
) = decl
;
1010 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1011 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1013 /* The old binding was a type name. It was placed in
1014 BINDING_VALUE because it was thought, at the point it was
1015 declared, to be the only entity with such a name. Move the
1016 type name into the type slot; it is now hidden by the new
1018 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1019 BINDING_VALUE (binding
) = decl
;
1020 INHERITED_VALUE_BINDING_P (binding
) = 0;
1022 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1023 && TREE_CODE (decl
) == TYPE_DECL
1024 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1025 && same_type_p (TREE_TYPE (decl
),
1026 TREE_TYPE (BINDING_VALUE (binding
))))
1027 /* We have two typedef-names, both naming the same type to have
1028 the same name. This is OK because of:
1032 In a given scope, a typedef specifier can be used to redefine
1033 the name of any type declared in that scope to refer to the
1034 type to which it already refers. */
1036 /* There can be two block-scope declarations of the same variable,
1037 so long as they are `extern' declarations. */
1038 else if (TREE_CODE (decl
) == VAR_DECL
1039 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1040 && DECL_EXTERNAL (decl
)
1041 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1043 duplicate_decls (decl
, BINDING_VALUE (binding
));
1048 cp_error ("declaration of `%#D'", decl
);
1049 cp_error_at ("conflicts with previous declaration `%#D'",
1050 BINDING_VALUE (binding
));
1057 /* Add DECL to the list of things declared in B. */
1060 add_decl_to_level (decl
, b
)
1062 struct binding_level
*b
;
1064 /* We build up the list in reverse order, and reverse it later if
1066 TREE_CHAIN (decl
) = b
->names
;
1070 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1071 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1072 doesn't really belong to this binding level, that it got here
1073 through a using-declaration. */
1076 push_local_binding (id
, decl
, flags
)
1081 struct binding_level
*b
;
1083 /* Skip over any local classes. This makes sense if we call
1084 push_local_binding with a friend decl of a local class. */
1085 b
= current_binding_level
;
1086 while (b
->parm_flag
== 2)
1089 if (lookup_name_current_level (id
))
1091 /* Supplement the existing binding. */
1092 if (!add_binding (id
, decl
))
1093 /* It didn't work. Something else must be bound at this
1094 level. Do not add DECL to the list of things to pop
1099 /* Create a new binding. */
1100 push_binding (id
, decl
, b
);
1102 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1103 /* We must put the OVERLOAD into a TREE_LIST since the
1104 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1105 decls that got here through a using-declaration. */
1106 decl
= build_tree_list (NULL_TREE
, decl
);
1108 /* And put DECL on the list of things declared by the current
1110 add_decl_to_level (decl
, b
);
1113 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1114 binding was successful. */
1117 push_class_binding (id
, decl
)
1122 tree binding
= IDENTIFIER_BINDING (id
);
1125 /* Note that we declared this value so that we can issue an error if
1126 this an illegal redeclaration of a name already used for some
1128 note_name_declared_in_class (id
, decl
);
1130 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1131 /* Supplement the existing binding. */
1132 result
= add_binding (id
, decl
);
1134 /* Create a new binding. */
1135 push_binding (id
, decl
, class_binding_level
);
1137 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1138 class-level declaration. Note that we do not use DECL here
1139 because of the possibility of the `struct stat' hack; if DECL is
1140 a class-name or enum-name we might prefer a field-name, or some
1142 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1144 /* If this is a binding from a base class, mark it as such. */
1145 binding
= IDENTIFIER_BINDING (id
);
1146 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1148 /* Any implicit typename must be from a base-class. The
1149 context for an implicit typename declaration is always
1150 the derived class in which the lookup was done, so the checks
1151 based on the context of DECL below will not trigger. */
1152 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1153 INHERITED_VALUE_BINDING_P (binding
) = 1;
1156 if (TREE_CODE (decl
) == OVERLOAD
)
1157 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1160 my_friendly_assert (DECL_P (decl
), 0);
1161 context
= CP_DECL_CONTEXT (decl
);
1164 if (is_properly_derived_from (current_class_type
, context
))
1165 INHERITED_VALUE_BINDING_P (binding
) = 1;
1167 INHERITED_VALUE_BINDING_P (binding
) = 0;
1170 else if (BINDING_VALUE (binding
) == decl
)
1171 /* We only encounter a TREE_LIST when push_class_decls detects an
1172 ambiguity. Such an ambiguity can be overridden by a definition
1174 INHERITED_VALUE_BINDING_P (binding
) = 1;
1179 /* Remove the binding for DECL which should be the innermost binding
1183 pop_binding (id
, decl
)
1189 if (id
== NULL_TREE
)
1190 /* It's easiest to write the loops that call this function without
1191 checking whether or not the entities involved have names. We
1192 get here for such an entity. */
1195 /* Get the innermost binding for ID. */
1196 binding
= IDENTIFIER_BINDING (id
);
1198 /* The name should be bound. */
1199 my_friendly_assert (binding
!= NULL_TREE
, 0);
1201 /* The DECL will be either the ordinary binding or the type
1202 binding for this identifier. Remove that binding. */
1203 if (BINDING_VALUE (binding
) == decl
)
1204 BINDING_VALUE (binding
) = NULL_TREE
;
1205 else if (BINDING_TYPE (binding
) == decl
)
1206 BINDING_TYPE (binding
) = NULL_TREE
;
1208 my_friendly_abort (0);
1210 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1211 /* We're completely done with the innermost binding for this
1212 identifier. Unhook it from the list of bindings. */
1213 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1216 /* When a label goes out of scope, check to see if that label was used
1217 in a valid manner, and issue any appropriate warnings or errors. */
1220 pop_label (label
, old_value
)
1224 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1226 if (DECL_INITIAL (label
) == NULL_TREE
)
1228 cp_error_at ("label `%D' used but not defined", label
);
1229 /* Avoid crashing later. */
1230 define_label (input_filename
, 1, DECL_NAME (label
));
1232 else if (warn_unused_label
&& !TREE_USED (label
))
1233 cp_warning_at ("label `%D' defined but not used", label
);
1236 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1239 /* At the end of a function, all labels declared within the function
1240 go out of scope. BLOCK is the top-level block for the
1247 struct named_label_list
*link
;
1249 /* Clear out the definitions of all label names, since their scopes
1251 for (link
= named_labels
; link
; link
= link
->next
)
1253 pop_label (link
->label_decl
, link
->old_value
);
1254 /* Put the labels into the "variables" of the top-level block,
1255 so debugger can see them. */
1256 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1257 BLOCK_VARS (block
) = link
->label_decl
;
1260 named_labels
= NULL
;
1263 /* Exit a binding level.
1264 Pop the level off, and restore the state of the identifier-decl mappings
1265 that were in effect when this level was entered.
1267 If KEEP == 1, this level had explicit declarations, so
1268 and create a "block" (a BLOCK node) for the level
1269 to record its declarations and subblocks for symbol table output.
1271 If FUNCTIONBODY is nonzero, this level is the body of a function,
1272 so create a block as if KEEP were set and also clear out all
1275 If REVERSE is nonzero, reverse the order of decls before putting
1276 them into the BLOCK. */
1279 poplevel (keep
, reverse
, functionbody
)
1285 /* The chain of decls was accumulated in reverse order.
1286 Put it into forward order, just for cleanliness. */
1288 int tmp
= functionbody
;
1289 int real_functionbody
;
1292 tree block
= NULL_TREE
;
1294 int leaving_for_scope
;
1296 if (cfun
&& !doing_semantic_analysis_p ())
1299 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1302 real_functionbody
= (current_binding_level
->keep
== 2
1303 ? ((functionbody
= 0), tmp
) : functionbody
);
1304 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1305 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1307 my_friendly_assert (!current_binding_level
->class_shadowed
,
1310 /* We used to use KEEP == 2 to indicate that the new block should go
1311 at the beginning of the list of blocks at this binding level,
1312 rather than the end. This hack is no longer used. */
1313 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1315 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1316 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1317 current_binding_level
->parm_flag
,
1318 current_binding_level
->keep
);
1320 if (current_binding_level
->keep
== 1)
1323 /* Any uses of undefined labels, and any defined labels, now operate
1324 under constraints of next binding contour. */
1325 if (cfun
&& !functionbody
)
1327 struct binding_level
*level_chain
;
1328 level_chain
= current_binding_level
->level_chain
;
1331 struct named_label_use_list
*uses
;
1332 struct named_label_list
*labels
;
1333 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1334 if (labels
->binding_level
== current_binding_level
)
1337 if (current_binding_level
->eh_region
)
1338 labels
->eh_region
= 1;
1339 for (decl
= labels
->names_in_scope
; decl
;
1340 decl
= TREE_CHAIN (decl
))
1341 if (decl_jump_unsafe (decl
))
1342 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1344 labels
->binding_level
= level_chain
;
1345 labels
->names_in_scope
= level_chain
->names
;
1348 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1349 if (uses
->binding_level
== current_binding_level
)
1351 uses
->binding_level
= level_chain
;
1352 uses
->names_in_scope
= level_chain
->names
;
1357 /* Get the decls in the order they were written.
1358 Usually current_binding_level->names is in reverse order.
1359 But parameter decls were previously put in forward order. */
1362 current_binding_level
->names
1363 = decls
= nreverse (current_binding_level
->names
);
1365 decls
= current_binding_level
->names
;
1367 /* Output any nested inline functions within this block
1368 if they weren't already output. */
1369 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1370 if (TREE_CODE (decl
) == FUNCTION_DECL
1371 && ! TREE_ASM_WRITTEN (decl
)
1372 && DECL_INITIAL (decl
) != NULL_TREE
1373 && TREE_ADDRESSABLE (decl
)
1374 && decl_function_context (decl
) == current_function_decl
)
1376 /* If this decl was copied from a file-scope decl
1377 on account of a block-scope extern decl,
1378 propagate TREE_ADDRESSABLE to the file-scope decl. */
1379 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1380 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1383 push_function_context ();
1384 output_inline_function (decl
);
1385 pop_function_context ();
1389 /* When not in function-at-a-time mode, expand_end_bindings will
1390 warn about unused variables. But, in function-at-a-time mode
1391 expand_end_bindings is not passed the list of variables in the
1392 current scope, and therefore no warning is emitted. So, we
1393 explicitly warn here. */
1394 if (!processing_template_decl
)
1395 warn_about_unused_variables (getdecls ());
1397 /* If there were any declarations or structure tags in that level,
1398 or if this level is a function body,
1399 create a BLOCK to record them for the life of this function. */
1401 if (keep
== 1 || functionbody
)
1402 block
= make_node (BLOCK
);
1403 if (block
!= NULL_TREE
)
1405 BLOCK_VARS (block
) = decls
;
1406 BLOCK_SUBBLOCKS (block
) = subblocks
;
1409 /* In each subblock, record that this is its superior. */
1411 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1412 BLOCK_SUPERCONTEXT (link
) = block
;
1414 /* We still support the old for-scope rules, whereby the variables
1415 in a for-init statement were in scope after the for-statement
1416 ended. We only use the new rules in flag_new_for_scope is
1419 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1421 /* Remove declarations for all the DECLs in this level. */
1422 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1424 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1425 && DECL_NAME (link
))
1428 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1432 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1434 ns_binding
= NULL_TREE
;
1437 && (BINDING_LEVEL (outer_binding
)
1438 == current_binding_level
->level_chain
))
1439 /* We have something like:
1444 and we are leaving the `for' scope. There's no reason to
1445 keep the binding of the inner `i' in this case. */
1446 pop_binding (DECL_NAME (link
), link
);
1447 else if ((outer_binding
1448 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1451 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1452 /* Here, we have something like:
1460 We must pop the for-scope binding so we know what's a
1461 type and what isn't. */
1462 pop_binding (DECL_NAME (link
), link
);
1465 /* Mark this VAR_DECL as dead so that we can tell we left it
1466 there only for backward compatibility. */
1467 DECL_DEAD_FOR_LOCAL (link
) = 1;
1469 /* Keep track of what should of have happenned when we
1470 popped the binding. */
1471 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1472 DECL_SHADOWED_FOR_VAR (link
)
1473 = BINDING_VALUE (outer_binding
);
1475 /* Add it to the list of dead variables in the next
1476 outermost binding to that we can remove these when we
1477 leave that binding. */
1478 current_binding_level
->level_chain
->dead_vars_from_for
1479 = tree_cons (NULL_TREE
, link
,
1480 current_binding_level
->level_chain
->
1481 dead_vars_from_for
);
1483 /* Although we don't pop the CPLUS_BINDING, we do clear
1484 its BINDING_LEVEL since the level is going away now. */
1485 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1491 /* Remove the binding. */
1493 if (TREE_CODE (decl
) == TREE_LIST
)
1494 decl
= TREE_VALUE (decl
);
1496 pop_binding (DECL_NAME (decl
), decl
);
1497 else if (TREE_CODE (decl
) == OVERLOAD
)
1498 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1500 my_friendly_abort (0);
1504 /* Remove declarations for any `for' variables from inner scopes
1505 that we kept around. */
1506 for (link
= current_binding_level
->dead_vars_from_for
;
1507 link
; link
= TREE_CHAIN (link
))
1508 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1510 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1511 for (link
= current_binding_level
->type_shadowed
;
1512 link
; link
= TREE_CHAIN (link
))
1513 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1515 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1516 for (link
= current_binding_level
->shadowed_labels
;
1518 link
= TREE_CHAIN (link
))
1519 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1521 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1522 list if a `using' declaration put them there. The debugging
1523 back-ends won't understand OVERLOAD, so we remove them here.
1524 Because the BLOCK_VARS are (temporarily) shared with
1525 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1526 popped all the bindings. */
1531 for (d
= &BLOCK_VARS (block
); *d
; )
1533 if (TREE_CODE (*d
) == TREE_LIST
)
1534 *d
= TREE_CHAIN (*d
);
1536 d
= &TREE_CHAIN (*d
);
1540 /* If the level being exited is the top level of a function,
1541 check over all the labels. */
1544 /* Since this is the top level block of a function, the vars are
1545 the function's parameters. Don't leave them in the BLOCK
1546 because they are found in the FUNCTION_DECL instead. */
1547 BLOCK_VARS (block
) = 0;
1551 tmp
= current_binding_level
->keep
;
1553 pop_binding_level ();
1555 DECL_INITIAL (current_function_decl
) = block
;
1557 current_binding_level
->blocks
1558 = chainon (current_binding_level
->blocks
, block
);
1560 /* If we did not make a block for the level just exited,
1561 any blocks made for inner levels
1562 (since they cannot be recorded as subblocks in that level)
1563 must be carried forward so they will later become subblocks
1564 of something else. */
1566 current_binding_level
->blocks
1567 = chainon (current_binding_level
->blocks
, subblocks
);
1569 /* Each and every BLOCK node created here in `poplevel' is important
1570 (e.g. for proper debugging information) so if we created one
1571 earlier, mark it as "used". */
1573 TREE_USED (block
) = 1;
1575 /* Take care of compiler's internal binding structures. */
1581 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1584 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1585 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1588 block
= poplevel (keep
, reverse
, functionbody
);
1594 /* Delete the node BLOCK from the current binding level.
1595 This is used for the block inside a stmt expr ({...})
1596 so that the block can be reinserted where appropriate. */
1599 delete_block (block
)
1603 if (current_binding_level
->blocks
== block
)
1604 current_binding_level
->blocks
= TREE_CHAIN (block
);
1605 for (t
= current_binding_level
->blocks
; t
;)
1607 if (TREE_CHAIN (t
) == block
)
1608 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1612 TREE_CHAIN (block
) = NULL_TREE
;
1613 /* Clear TREE_USED which is always set by poplevel.
1614 The flag is set again if insert_block is called. */
1615 TREE_USED (block
) = 0;
1618 /* Insert BLOCK at the end of the list of subblocks of the
1619 current binding level. This is used when a BIND_EXPR is expanded,
1620 to handle the BLOCK node inside the BIND_EXPR. */
1623 insert_block (block
)
1626 TREE_USED (block
) = 1;
1627 current_binding_level
->blocks
1628 = chainon (current_binding_level
->blocks
, block
);
1631 /* Set the BLOCK node for the innermost scope
1632 (the one we are currently in). */
1636 tree block ATTRIBUTE_UNUSED
;
1638 /* The RTL expansion machinery requires us to provide this callback,
1639 but it is not applicable in function-at-a-time mode. */
1640 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1643 /* Do a pushlevel for class declarations. */
1648 register struct binding_level
*newlevel
;
1650 /* Reuse or create a struct for this binding level. */
1651 #if defined(DEBUG_CP_BINDING_LEVELS)
1653 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1654 if (free_binding_level
)
1655 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1657 newlevel
= free_binding_level
;
1658 free_binding_level
= free_binding_level
->level_chain
;
1661 newlevel
= make_binding_level ();
1663 #if defined(DEBUG_CP_BINDING_LEVELS)
1665 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1667 push_binding_level (newlevel
, 0, 0);
1669 class_binding_level
= current_binding_level
;
1670 class_binding_level
->parm_flag
= 2;
1671 class_binding_level
->this_class
= current_class_type
;
1674 /* ...and a poplevel for class declarations. */
1679 register struct binding_level
*level
= class_binding_level
;
1682 my_friendly_assert (level
!= 0, 354);
1684 /* If we're leaving a toplevel class, don't bother to do the setting
1685 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1686 shouldn't even be used when current_class_type isn't set, and second,
1687 if we don't touch it here, we're able to use the cache effect if the
1688 next time we're entering a class scope, it is the same class. */
1689 if (current_class_depth
!= 1)
1691 struct binding_level
* b
;
1693 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1694 for (shadowed
= level
->class_shadowed
;
1696 shadowed
= TREE_CHAIN (shadowed
))
1697 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1699 /* Find the next enclosing class, and recreate
1700 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1701 b
= level
->level_chain
;
1702 while (b
&& b
->parm_flag
!= 2)
1706 for (shadowed
= b
->class_shadowed
;
1708 shadowed
= TREE_CHAIN (shadowed
))
1712 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1713 while (t
&& BINDING_LEVEL (t
) != b
)
1717 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1718 = BINDING_VALUE (t
);
1722 /* Remember to save what IDENTIFIER's were bound in this scope so we
1723 can recover from cache misses. */
1725 previous_class_type
= current_class_type
;
1726 previous_class_values
= class_binding_level
->class_shadowed
;
1728 for (shadowed
= level
->type_shadowed
;
1730 shadowed
= TREE_CHAIN (shadowed
))
1731 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1733 /* Remove the bindings for all of the class-level declarations. */
1734 for (shadowed
= level
->class_shadowed
;
1736 shadowed
= TREE_CHAIN (shadowed
))
1737 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1739 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1740 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1741 class_binding_level
->parm_flag
,
1742 class_binding_level
->keep
);
1744 /* Now, pop out of the binding level which we created up in the
1745 `pushlevel_class' routine. */
1746 #if defined(DEBUG_CP_BINDING_LEVELS)
1748 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1750 pop_binding_level ();
1753 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1754 for any names in enclosing classes. */
1757 clear_identifier_class_values ()
1761 if (!class_binding_level
)
1764 for (t
= class_binding_level
->class_shadowed
;
1767 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1770 /* Returns non-zero if T is a virtual function table. */
1773 vtable_decl_p (t
, data
)
1775 void *data ATTRIBUTE_UNUSED
;
1777 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1780 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1784 vtype_decl_p (t
, data
)
1786 void *data ATTRIBUTE_UNUSED
;
1788 return (TREE_CODE (t
) == TYPE_DECL
1789 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1790 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1793 /* Return the declarations that are members of the namespace NS. */
1796 cp_namespace_decls (ns
)
1799 return NAMESPACE_LEVEL (ns
)->names
;
1802 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1803 itself, calling F for each. The DATA is passed to F as well. */
1806 walk_namespaces_r (namespace, f
, data
)
1808 walk_namespaces_fn f
;
1814 result
|= (*f
) (namespace, data
);
1816 for (current
= cp_namespace_decls (namespace);
1818 current
= TREE_CHAIN (current
))
1820 if (TREE_CODE (current
) != NAMESPACE_DECL
1821 || DECL_NAMESPACE_ALIAS (current
))
1823 if (!DECL_LANG_SPECIFIC (current
))
1826 my_friendly_assert (current
== fake_std_node
, 393);
1830 /* We found a namespace. */
1831 result
|= walk_namespaces_r (current
, f
, data
);
1837 /* Walk all the namespaces, calling F for each. The DATA is passed to
1841 walk_namespaces (f
, data
)
1842 walk_namespaces_fn f
;
1845 return walk_namespaces_r (global_namespace
, f
, data
);
1848 struct walk_globals_data
{
1849 walk_globals_pred p
;
1854 /* Walk the global declarations in NAMESPACE. Whenever one is found
1855 for which P returns non-zero, call F with its address. If any call
1856 to F returns a non-zero value, return a non-zero value. */
1859 walk_globals_r (namespace, data
)
1863 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1864 walk_globals_pred p
= wgd
->p
;
1865 walk_globals_fn f
= wgd
->f
;
1866 void *d
= wgd
->data
;
1870 t
= &NAMESPACE_LEVEL (namespace)->names
;
1877 result
|= (*f
) (t
, d
);
1879 /* If F changed *T, then *T still points at the next item to
1882 t
= &TREE_CHAIN (*t
);
1888 /* Walk the global declarations. Whenever one is found for which P
1889 returns non-zero, call F with its address. If any call to F
1890 returns a non-zero value, return a non-zero value. */
1893 walk_globals (p
, f
, data
)
1894 walk_globals_pred p
;
1898 struct walk_globals_data wgd
;
1903 return walk_namespaces (walk_globals_r
, &wgd
);
1906 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1907 DATA is non-NULL, this is the last time we will call
1908 wrapup_global_declarations for this NAMESPACE. */
1911 wrapup_globals_for_namespace (namespace, data
)
1915 tree globals
= cp_namespace_decls (namespace);
1916 int len
= list_length (globals
);
1917 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1921 int last_time
= (data
!= 0);
1923 if (last_time
&& namespace == global_namespace
)
1924 /* Let compile_file handle the global namespace. */
1927 /* Process the decls in reverse order--earliest first.
1928 Put them into VEC from back to front, then take out from front. */
1930 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1932 /* Pretend we've output an unused static variable. This ensures
1933 that the toplevel __FUNCTION__ etc won't be emitted, unless
1935 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_ARTIFICIAL (decl
)
1936 && !TREE_PUBLIC (decl
) && !TREE_USED (decl
))
1938 TREE_ASM_WRITTEN (decl
) = 1;
1939 DECL_IGNORED_P (decl
) = 1;
1941 vec
[len
- i
- 1] = decl
;
1946 check_global_declarations (vec
, len
);
1950 /* Temporarily mark vtables as external. That prevents
1951 wrapup_global_declarations from writing them out; we must process
1952 them ourselves in finish_vtable_vardecl. */
1953 for (i
= 0; i
< len
; ++i
)
1954 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1956 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1957 DECL_EXTERNAL (vec
[i
]) = 1;
1960 /* Write out any globals that need to be output. */
1961 result
= wrapup_global_declarations (vec
, len
);
1963 /* Undo the hack to DECL_EXTERNAL above. */
1964 for (i
= 0; i
< len
; ++i
)
1965 if (vtable_decl_p (vec
[i
], /*data=*/0)
1966 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1968 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1969 DECL_EXTERNAL (vec
[i
]) = 0;
1976 /* Mark ARG (which is really a struct binding_level **) for GC. */
1979 mark_binding_level (arg
)
1982 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1984 for (; lvl
; lvl
= lvl
->level_chain
)
1986 ggc_mark_tree (lvl
->names
);
1987 ggc_mark_tree (lvl
->tags
);
1988 ggc_mark_tree (lvl
->usings
);
1989 ggc_mark_tree (lvl
->using_directives
);
1990 ggc_mark_tree (lvl
->class_shadowed
);
1991 ggc_mark_tree (lvl
->type_shadowed
);
1992 ggc_mark_tree (lvl
->shadowed_labels
);
1993 ggc_mark_tree (lvl
->blocks
);
1994 ggc_mark_tree (lvl
->this_class
);
1995 ggc_mark_tree (lvl
->incomplete
);
1996 ggc_mark_tree (lvl
->dead_vars_from_for
);
2001 mark_named_label_lists (labs
, uses
)
2005 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
2006 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
2008 for (; l
; l
= l
->next
)
2011 mark_binding_level (l
->binding_level
);
2012 ggc_mark_tree (l
->old_value
);
2013 ggc_mark_tree (l
->label_decl
);
2014 ggc_mark_tree (l
->bad_decls
);
2017 for (; u
; u
= u
->next
)
2021 /* For debugging. */
2022 static int no_print_functions
= 0;
2023 static int no_print_builtins
= 0;
2026 print_binding_level (lvl
)
2027 struct binding_level
*lvl
;
2031 fprintf (stderr
, " blocks=");
2032 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2033 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2034 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2035 if (lvl
->tag_transparent
)
2036 fprintf (stderr
, " tag-transparent");
2037 if (lvl
->more_cleanups_ok
)
2038 fprintf (stderr
, " more-cleanups-ok");
2039 if (lvl
->have_cleanups
)
2040 fprintf (stderr
, " have-cleanups");
2041 fprintf (stderr
, "\n");
2044 fprintf (stderr
, " names:\t");
2045 /* We can probably fit 3 names to a line? */
2046 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2048 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2050 if (no_print_builtins
2051 && (TREE_CODE (t
) == TYPE_DECL
)
2052 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2055 /* Function decls tend to have longer names. */
2056 if (TREE_CODE (t
) == FUNCTION_DECL
)
2063 fprintf (stderr
, "\n\t");
2066 print_node_brief (stderr
, "", t
, 0);
2067 if (t
== error_mark_node
)
2071 fprintf (stderr
, "\n");
2075 fprintf (stderr
, " tags:\t");
2077 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2079 if (TREE_PURPOSE (t
) == NULL_TREE
)
2081 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2088 fprintf (stderr
, "\n\t");
2091 if (TREE_PURPOSE (t
) == NULL_TREE
)
2093 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2094 fprintf (stderr
, ">");
2096 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2097 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2100 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2101 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2102 fprintf (stderr
, ">");
2106 fprintf (stderr
, "\n");
2108 if (lvl
->class_shadowed
)
2110 fprintf (stderr
, " class-shadowed:");
2111 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2113 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2115 fprintf (stderr
, "\n");
2117 if (lvl
->type_shadowed
)
2119 fprintf (stderr
, " type-shadowed:");
2120 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2122 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2124 fprintf (stderr
, "\n");
2129 print_other_binding_stack (stack
)
2130 struct binding_level
*stack
;
2132 struct binding_level
*level
;
2133 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2135 fprintf (stderr
, "binding level ");
2136 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2137 fprintf (stderr
, "\n");
2138 print_binding_level (level
);
2143 print_binding_stack ()
2145 struct binding_level
*b
;
2146 fprintf (stderr
, "current_binding_level=");
2147 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2148 fprintf (stderr
, "\nclass_binding_level=");
2149 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2150 fprintf (stderr
, "\nglobal_binding_level=");
2151 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2152 fprintf (stderr
, "\n");
2153 if (class_binding_level
)
2155 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2156 if (b
== current_binding_level
)
2159 b
= class_binding_level
;
2161 b
= current_binding_level
;
2164 b
= current_binding_level
;
2165 print_other_binding_stack (b
);
2166 fprintf (stderr
, "global:\n");
2167 print_binding_level (global_binding_level
);
2170 /* Namespace binding access routines: The namespace_bindings field of
2171 the identifier is polymorphic, with three possible values:
2172 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2173 indicating the BINDING_VALUE of global_namespace. */
2175 /* Check whether the a binding for the name to scope is known.
2176 Assumes that the bindings of the name are already a list
2177 of bindings. Returns the binding found, or NULL_TREE. */
2180 find_binding (name
, scope
)
2184 tree iter
, prev
= NULL_TREE
;
2186 scope
= ORIGINAL_NAMESPACE (scope
);
2188 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2189 iter
= TREE_CHAIN (iter
))
2191 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2192 if (BINDING_SCOPE (iter
) == scope
)
2194 /* Move binding found to the front of the list, so
2195 subsequent lookups will find it faster. */
2198 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2199 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2200 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2209 /* Always returns a binding for name in scope. If the
2210 namespace_bindings is not a list, convert it to one first.
2211 If no binding is found, make a new one. */
2214 binding_for_name (name
, scope
)
2218 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2221 scope
= ORIGINAL_NAMESPACE (scope
);
2223 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2225 /* Get rid of optimization for global scope. */
2226 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2227 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2228 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2230 if (b
&& (result
= find_binding (name
, scope
)))
2232 /* Not found, make a new one. */
2233 result
= make_node (CPLUS_BINDING
);
2234 TREE_CHAIN (result
) = b
;
2235 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2236 BINDING_SCOPE (result
) = scope
;
2237 BINDING_TYPE (result
) = NULL_TREE
;
2238 BINDING_VALUE (result
) = NULL_TREE
;
2242 /* Return the binding value for name in scope, considering that
2243 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2246 namespace_binding (name
, scope
)
2250 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2253 if (scope
== NULL_TREE
)
2254 scope
= global_namespace
;
2255 if (TREE_CODE (b
) != CPLUS_BINDING
)
2256 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2257 name
= find_binding (name
,scope
);
2258 if (name
== NULL_TREE
)
2260 return BINDING_VALUE (name
);
2263 /* Set the binding value for name in scope. If modifying the binding
2264 of global_namespace is attempted, try to optimize it. */
2267 set_namespace_binding (name
, scope
, val
)
2274 if (scope
== NULL_TREE
)
2275 scope
= global_namespace
;
2277 if (scope
== global_namespace
)
2279 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2280 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2282 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2286 b
= binding_for_name (name
, scope
);
2287 BINDING_VALUE (b
) = val
;
2290 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2291 select a name that is unique to this compilation unit. */
2294 push_namespace (name
)
2299 int implicit_use
= 0;
2301 if (!global_namespace
)
2303 /* This must be ::. */
2304 my_friendly_assert (name
== get_identifier ("::"), 377);
2309 /* The name of anonymous namespace is unique for the translation
2311 if (!anonymous_namespace_name
)
2312 anonymous_namespace_name
= get_file_function_name ('N');
2313 name
= anonymous_namespace_name
;
2314 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2316 /* Reopening anonymous namespace. */
2320 else if (current_namespace
== global_namespace
2322 && name
== std_identifier
)
2329 /* Check whether this is an extended namespace definition. */
2330 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2331 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2334 if (DECL_NAMESPACE_ALIAS (d
))
2336 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2337 d
, DECL_NAMESPACE_ALIAS (d
));
2338 d
= DECL_NAMESPACE_ALIAS (d
);
2345 /* Make a new namespace, binding the name to it. */
2346 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2347 /* The global namespace is not pushed, and the global binding
2348 level is set elsewhere. */
2351 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2354 declare_namespace_level ();
2355 NAMESPACE_LEVEL (d
) = current_binding_level
;
2359 resume_binding_level (NAMESPACE_LEVEL (d
));
2362 do_using_directive (d
);
2363 /* Enter the name space. */
2364 current_namespace
= d
;
2367 /* Pop from the scope of the current namespace. */
2372 if (current_namespace
== global_namespace
)
2374 my_friendly_assert (in_fake_std
> 0, 980421);
2378 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2379 /* The binding level is not popped, as it might be re-opened later. */
2380 suspend_binding_level ();
2383 /* Push into the scope of the namespace NS, even if it is deeply
2384 nested within another namespace. */
2387 push_nested_namespace (ns
)
2390 if (ns
== global_namespace
)
2391 push_to_top_level ();
2394 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2395 push_namespace (DECL_NAME (ns
));
2399 /* Pop back from the scope of the namespace NS, which was previously
2400 entered with push_nested_namespace. */
2403 pop_nested_namespace (ns
)
2406 while (ns
!= global_namespace
)
2409 ns
= CP_DECL_CONTEXT (ns
);
2412 pop_from_top_level ();
2416 /* Subroutines for reverting temporarily to top-level for instantiation
2417 of templates and such. We actually need to clear out the class- and
2418 local-value slots of all identifiers, so that only the global values
2419 are at all visible. Simply setting current_binding_level to the global
2420 scope isn't enough, because more binding levels may be pushed. */
2421 struct saved_scope
*scope_chain
;
2423 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2426 mark_saved_scope (arg
)
2429 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2432 mark_binding_level (&t
->class_bindings
);
2433 ggc_mark_tree (t
->old_bindings
);
2434 ggc_mark_tree (t
->old_namespace
);
2435 ggc_mark_tree (t
->class_name
);
2436 ggc_mark_tree (t
->class_type
);
2437 ggc_mark_tree (t
->access_specifier
);
2438 ggc_mark_tree (t
->function_decl
);
2440 ggc_mark_tree_varray (t
->lang_base
);
2441 ggc_mark_tree (t
->lang_name
);
2442 ggc_mark_tree (t
->template_parms
);
2443 ggc_mark_tree (t
->x_previous_class_type
);
2444 ggc_mark_tree (t
->x_previous_class_values
);
2445 ggc_mark_tree (t
->x_saved_tree
);
2446 ggc_mark_tree (t
->incomplete
);
2447 ggc_mark_tree (t
->lookups
);
2449 mark_stmt_tree (&t
->x_stmt_tree
);
2450 mark_binding_level (&t
->bindings
);
2456 store_bindings (names
, old_bindings
)
2457 tree names
, old_bindings
;
2460 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2462 tree binding
, t1
, id
;
2464 if (TREE_CODE (t
) == TREE_LIST
)
2465 id
= TREE_PURPOSE (t
);
2470 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2471 we have no IDENTIFIER_BINDING if we have left the class
2472 scope, but cached the class-level declarations. */
2473 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2476 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2477 if (TREE_VEC_ELT (t1
, 0) == id
)
2480 binding
= make_tree_vec (4);
2484 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2485 TREE_VEC_ELT (binding
, 0) = id
;
2486 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2487 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2488 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2489 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2490 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2492 TREE_CHAIN (binding
) = old_bindings
;
2493 old_bindings
= binding
;
2497 return old_bindings
;
2501 maybe_push_to_top_level (pseudo
)
2504 struct saved_scope
*s
;
2505 struct binding_level
*b
;
2509 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2511 b
= scope_chain
? current_binding_level
: 0;
2513 /* If we're in the middle of some function, save our state. */
2517 push_function_context_to (NULL_TREE
);
2522 old_bindings
= NULL_TREE
;
2523 if (scope_chain
&& previous_class_type
)
2524 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2526 /* Have to include global_binding_level, because class-level decls
2527 aren't listed anywhere useful. */
2528 for (; b
; b
= b
->level_chain
)
2532 /* Template IDs are inserted into the global level. If they were
2533 inserted into namespace level, finish_file wouldn't find them
2534 when doing pending instantiations. Therefore, don't stop at
2535 namespace level, but continue until :: . */
2536 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2539 old_bindings
= store_bindings (b
->names
, old_bindings
);
2540 /* We also need to check class_shadowed to save class-level type
2541 bindings, since pushclass doesn't fill in b->names. */
2542 if (b
->parm_flag
== 2)
2543 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2545 /* Unwind type-value slots back to top level. */
2546 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2547 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2549 s
->prev
= scope_chain
;
2550 s
->old_bindings
= old_bindings
;
2552 s
->need_pop_function_context
= need_pop
;
2553 s
->function_decl
= current_function_decl
;
2556 current_function_decl
= NULL_TREE
;
2557 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2558 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2559 current_lang_name
= lang_name_cplusplus
;
2560 current_namespace
= global_namespace
;
2564 push_to_top_level ()
2566 maybe_push_to_top_level (0);
2570 pop_from_top_level ()
2572 struct saved_scope
*s
= scope_chain
;
2575 /* Clear out class-level bindings cache. */
2576 if (previous_class_type
)
2577 invalidate_class_lookup_cache ();
2579 VARRAY_FREE (current_lang_base
);
2581 scope_chain
= s
->prev
;
2582 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2584 tree id
= TREE_VEC_ELT (t
, 0);
2587 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2588 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2589 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2593 /* If we were in the middle of compiling a function, restore our
2595 if (s
->need_pop_function_context
)
2596 pop_function_context_from (NULL_TREE
);
2597 current_function_decl
= s
->function_decl
;
2602 /* Push a definition of struct, union or enum tag "name".
2603 into binding_level "b". "type" should be the type node,
2604 We assume that the tag "name" is not already defined.
2606 Note that the definition may really be just a forward reference.
2607 In that case, the TYPE_SIZE will be a NULL_TREE.
2609 C++ gratuitously puts all these tags in the name space. */
2611 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2612 record the shadowed value for this binding contour. TYPE is
2613 the type that ID maps to. */
2616 set_identifier_type_value_with_scope (id
, type
, b
)
2619 struct binding_level
*b
;
2621 if (!b
->namespace_p
)
2623 /* Shadow the marker, not the real thing, so that the marker
2624 gets restored later. */
2625 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2627 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2631 tree binding
= binding_for_name (id
, current_namespace
);
2632 BINDING_TYPE (binding
) = type
;
2633 /* Store marker instead of real type. */
2634 type
= global_type_node
;
2636 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2639 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2642 set_identifier_type_value (id
, type
)
2646 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2649 /* Return the type associated with id. */
2652 identifier_type_value (id
)
2655 /* There is no type with that name, anywhere. */
2656 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2658 /* This is not the type marker, but the real thing. */
2659 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2660 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2661 /* Have to search for it. It must be on the global level, now.
2662 Ask lookup_name not to return non-types. */
2663 id
= lookup_name_real (id
, 2, 1, 0);
2665 return TREE_TYPE (id
);
2669 /* Pop off extraneous binding levels left over due to syntax errors.
2671 We don't pop past namespaces, as they might be valid. */
2676 #ifdef DEBUG_CP_BINDING_LEVELS
2677 fprintf (stderr
, "XXX entering pop_everything ()\n");
2679 while (!toplevel_bindings_p ())
2681 if (current_binding_level
->parm_flag
== 2)
2682 pop_nested_class ();
2686 #ifdef DEBUG_CP_BINDING_LEVELS
2687 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2691 /* The type TYPE is being declared. If it is a class template, or a
2692 specialization of a class template, do any processing required and
2693 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2694 being declared a friend. B is the binding level at which this TYPE
2697 Returns the TYPE_DECL for TYPE, which may have been altered by this
2701 maybe_process_template_type_declaration (type
, globalize
, b
)
2704 struct binding_level
* b
;
2706 tree decl
= TYPE_NAME (type
);
2708 if (processing_template_parmlist
)
2709 /* You can't declare a new template type in a template parameter
2710 list. But, you can declare a non-template type:
2712 template <class A*> struct S;
2714 is a forward-declaration of `A'. */
2718 maybe_check_template_type (type
);
2720 my_friendly_assert (IS_AGGR_TYPE (type
)
2721 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2724 if (processing_template_decl
)
2726 /* This may change after the call to
2727 push_template_decl_real, but we want the original value. */
2728 tree name
= DECL_NAME (decl
);
2730 decl
= push_template_decl_real (decl
, globalize
);
2731 /* If the current binding level is the binding level for the
2732 template parameters (see the comment in
2733 begin_template_parm_list) and the enclosing level is a class
2734 scope, and we're not looking at a friend, push the
2735 declaration of the member class into the class scope. In the
2736 friend case, push_template_decl will already have put the
2737 friend into global scope, if appropriate. */
2738 if (TREE_CODE (type
) != ENUMERAL_TYPE
2739 && !globalize
&& b
->template_parms_p
2740 && b
->level_chain
->parm_flag
== 2)
2742 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2743 /* Put this tag on the list of tags for the class, since
2744 that won't happen below because B is not the class
2745 binding level, but is instead the pseudo-global level. */
2746 b
->level_chain
->tags
=
2747 tree_cons (name
, type
, b
->level_chain
->tags
);
2748 if (!COMPLETE_TYPE_P (current_class_type
))
2749 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2757 /* In C++, you don't have to write `struct S' to refer to `S'; you
2758 can just use `S'. We accomplish this by creating a TYPE_DECL as
2759 if the user had written `typedef struct S S'. Create and return
2760 the TYPE_DECL for TYPE. */
2763 create_implicit_typedef (name
, type
)
2769 decl
= build_decl (TYPE_DECL
, name
, type
);
2770 DECL_ARTIFICIAL (decl
) = 1;
2771 /* There are other implicit type declarations, like the one *within*
2772 a class that allows you to write `S::S'. We must distinguish
2774 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2775 TYPE_NAME (type
) = decl
;
2780 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2781 Normally put it into the inner-most non-tag-transparent scope,
2782 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2783 The latter is needed for implicit declarations. */
2786 pushtag (name
, type
, globalize
)
2790 register struct binding_level
*b
;
2792 b
= current_binding_level
;
2793 while (b
->tag_transparent
2794 || (globalize
&& b
->parm_flag
== 2))
2797 b
->tags
= tree_cons (name
, type
, b
->tags
);
2801 /* Do C++ gratuitous typedefing. */
2802 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2804 register tree d
= NULL_TREE
;
2806 tree context
= TYPE_CONTEXT (type
);
2810 tree cs
= current_scope ();
2814 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2815 /* When declaring a friend class of a local class, we want
2816 to inject the newly named class into the scope
2817 containing the local class, not the namespace scope. */
2818 context
= decl_function_context (get_type_decl (cs
));
2821 context
= current_namespace
;
2823 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2824 || b
->parm_flag
== 2)
2827 if (current_lang_name
== lang_name_java
)
2828 TYPE_FOR_JAVA (type
) = 1;
2830 d
= create_implicit_typedef (name
, type
);
2831 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2833 set_identifier_type_value_with_scope (name
, type
, b
);
2835 d
= maybe_process_template_type_declaration (type
,
2838 if (b
->parm_flag
== 2)
2840 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2841 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2842 class. But if it's a member template class, we
2843 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2845 finish_member_declaration (d
);
2847 pushdecl_class_level (d
);
2850 d
= pushdecl_with_scope (d
, b
);
2852 if (ANON_AGGRNAME_P (name
))
2853 DECL_IGNORED_P (d
) = 1;
2855 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2856 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2858 /* If this is a local class, keep track of it. We need this
2859 information for name-mangling, and so that it is possible to find
2860 all function definitions in a translation unit in a convenient
2861 way. (It's otherwise tricky to find a member function definition
2862 it's only pointed to from within a local class.) */
2863 if (TYPE_CONTEXT (type
)
2864 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2865 && !processing_template_decl
)
2866 VARRAY_PUSH_TREE (local_classes
, type
);
2868 if (!uses_template_parms (type
))
2871 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2873 DECL_ASSEMBLER_NAME (d
)
2874 = get_identifier (build_overload_name (type
, 1, 1));
2877 if (b
->parm_flag
== 2)
2879 if (!COMPLETE_TYPE_P (current_class_type
))
2880 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2884 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2885 /* Use the canonical TYPE_DECL for this node. */
2886 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2889 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2890 will be the tagged type we just added to the current
2891 binding level. This fake NULL-named TYPE_DECL node helps
2892 dwarfout.c to know when it needs to output a
2893 representation of a tagged type, and it also gives us a
2894 convenient place to record the "scope start" address for
2897 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2898 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2902 /* Counter used to create anonymous type names. */
2904 static int anon_cnt
= 0;
2906 /* Return an IDENTIFIER which can be used as a name for
2907 anonymous structs and unions. */
2914 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2915 return get_identifier (buf
);
2918 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2919 This keeps dbxout from getting confused. */
2924 register struct binding_level
*b
;
2926 static int last_cnt
= 0;
2928 /* Fast out if no new anon names were declared. */
2929 if (last_cnt
== anon_cnt
)
2932 b
= current_binding_level
;
2933 while (b
->tag_transparent
)
2938 /* A NULL purpose means we have already processed all tags
2939 from here to the end of the list. */
2940 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2942 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2943 TREE_PURPOSE (tags
) = NULL_TREE
;
2944 tags
= TREE_CHAIN (tags
);
2946 last_cnt
= anon_cnt
;
2949 /* Subroutine of duplicate_decls: return truthvalue of whether
2950 or not types of these decls match.
2952 For C++, we must compare the parameter list so that `int' can match
2953 `int&' in a parameter position, but `int&' is not confused with
2957 decls_match (newdecl
, olddecl
)
2958 tree newdecl
, olddecl
;
2962 if (newdecl
== olddecl
)
2965 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2966 /* If the two DECLs are not even the same kind of thing, we're not
2967 interested in their types. */
2970 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2972 tree f1
= TREE_TYPE (newdecl
);
2973 tree f2
= TREE_TYPE (olddecl
);
2974 tree p1
= TYPE_ARG_TYPES (f1
);
2975 tree p2
= TYPE_ARG_TYPES (f2
);
2977 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2978 && ! (DECL_EXTERN_C_P (newdecl
)
2979 && DECL_EXTERN_C_P (olddecl
)))
2982 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2985 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2987 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
2988 && (DECL_BUILT_IN (olddecl
)
2989 #ifndef NO_IMPLICIT_EXTERN_C
2990 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
2991 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
2995 types_match
= self_promoting_args_p (p1
);
2996 if (p1
== void_list_node
)
2997 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2999 #ifndef NO_IMPLICIT_EXTERN_C
3000 else if (p1
== NULL_TREE
3001 && (DECL_EXTERN_C_P (olddecl
)
3002 && DECL_IN_SYSTEM_HEADER (olddecl
)
3003 && !DECL_CLASS_SCOPE_P (olddecl
))
3004 && (DECL_EXTERN_C_P (newdecl
)
3005 && DECL_IN_SYSTEM_HEADER (newdecl
)
3006 && !DECL_CLASS_SCOPE_P (newdecl
)))
3008 types_match
= self_promoting_args_p (p2
);
3009 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3013 types_match
= compparms (p1
, p2
);
3018 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3020 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3021 DECL_TEMPLATE_PARMS (olddecl
)))
3024 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
3025 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
3028 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3031 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3032 DECL_TEMPLATE_RESULT (newdecl
));
3036 if (TREE_TYPE (newdecl
) == error_mark_node
)
3037 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3038 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3039 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3040 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3043 types_match
= comptypes (TREE_TYPE (newdecl
),
3044 TREE_TYPE (olddecl
),
3045 COMPARE_REDECLARATION
);
3051 /* If NEWDECL is `static' and an `extern' was seen previously,
3052 warn about it. OLDDECL is the previous declaration.
3054 Note that this does not apply to the C++ case of declaring
3055 a variable `extern const' and then later `const'.
3057 Don't complain about built-in functions, since they are beyond
3058 the user's control. */
3061 warn_extern_redeclared_static (newdecl
, olddecl
)
3062 tree newdecl
, olddecl
;
3064 static const char *explicit_extern_static_warning
3065 = "`%D' was declared `extern' and later `static'";
3066 static const char *implicit_extern_static_warning
3067 = "`%D' was declared implicitly `extern' and later `static'";
3071 if (TREE_CODE (newdecl
) == TYPE_DECL
3072 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3073 || TREE_CODE (newdecl
) == CONST_DECL
)
3076 /* Don't get confused by static member functions; that's a different
3078 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3079 && DECL_STATIC_FUNCTION_P (newdecl
))
3082 /* If the old declaration was `static', or the new one isn't, then
3083 then everything is OK. */
3084 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3087 /* It's OK to declare a builtin function as `static'. */
3088 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3089 && DECL_ARTIFICIAL (olddecl
))
3092 name
= DECL_ASSEMBLER_NAME (newdecl
);
3093 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3094 ? implicit_extern_static_warning
3095 : explicit_extern_static_warning
, newdecl
);
3096 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3099 /* Handle when a new declaration NEWDECL has the same name as an old
3100 one OLDDECL in the same binding contour. Prints an error message
3103 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3104 Otherwise, return 0. */
3107 duplicate_decls (newdecl
, olddecl
)
3108 tree newdecl
, olddecl
;
3110 unsigned olddecl_uid
= DECL_UID (olddecl
);
3111 int olddecl_friend
= 0, types_match
= 0;
3112 int new_defines_function
= 0;
3114 if (newdecl
== olddecl
)
3117 types_match
= decls_match (newdecl
, olddecl
);
3119 /* If either the type of the new decl or the type of the old decl is an
3120 error_mark_node, then that implies that we have already issued an
3121 error (earlier) for some bogus type specification, and in that case,
3122 it is rather pointless to harass the user with yet more error message
3123 about the same declaration, so just pretend the types match here. */
3124 if (TREE_TYPE (newdecl
) == error_mark_node
3125 || TREE_TYPE (olddecl
) == error_mark_node
)
3128 /* Check for redeclaration and other discrepancies. */
3129 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3130 && DECL_ARTIFICIAL (olddecl
))
3132 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3134 /* If you declare a built-in or predefined function name as static,
3135 the old definition is overridden, but optionally warn this was a
3136 bad choice of name. */
3137 if (! TREE_PUBLIC (newdecl
))
3140 cp_warning ("shadowing %s function `%#D'",
3141 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3143 /* Discard the old built-in function. */
3146 /* If the built-in is not ansi, then programs can override
3147 it even globally without an error. */
3148 else if (! DECL_BUILT_IN (olddecl
))
3149 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3153 cp_error ("declaration of `%#D'", newdecl
);
3154 cp_error ("conflicts with built-in declaration `%#D'",
3159 else if (!types_match
)
3161 if ((DECL_EXTERN_C_P (newdecl
)
3162 && DECL_EXTERN_C_P (olddecl
))
3163 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3164 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3166 /* A near match; override the builtin. */
3168 if (TREE_PUBLIC (newdecl
))
3170 cp_warning ("new declaration `%#D'", newdecl
);
3171 cp_warning ("ambiguates built-in declaration `%#D'",
3174 else if (warn_shadow
)
3175 cp_warning ("shadowing %s function `%#D'",
3176 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3180 /* Discard the old built-in function. */
3184 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3186 /* If a builtin function is redeclared as `static', merge
3187 the declarations, but make the original one static. */
3188 DECL_THIS_STATIC (olddecl
) = 1;
3189 TREE_PUBLIC (olddecl
) = 0;
3191 /* Make the old declaration consistent with the new one so
3192 that all remnants of the builtin-ness of this function
3193 will be banished. */
3194 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3195 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3196 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3197 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3201 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3203 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3204 && TREE_CODE (newdecl
) != TYPE_DECL
3205 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3206 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3207 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3208 && TREE_CODE (olddecl
) != TYPE_DECL
3209 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3210 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3213 /* We do nothing special here, because C++ does such nasty
3214 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3215 get shadowed, and know that if we need to find a TYPE_DECL
3216 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3217 slot of the identifier. */
3221 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3222 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3223 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3224 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3227 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3228 if (TREE_CODE (olddecl
) == TREE_LIST
)
3229 olddecl
= TREE_VALUE (olddecl
);
3230 cp_error_at ("previous declaration of `%#D'", olddecl
);
3232 /* New decl is completely inconsistent with the old one =>
3233 tell caller to replace the old one. */
3237 else if (!types_match
)
3239 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3240 /* These are certainly not duplicate declarations; they're
3241 from different scopes. */
3244 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3246 /* The name of a class template may not be declared to refer to
3247 any other template, class, function, object, namespace, value,
3248 or type in the same scope. */
3249 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3250 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3252 cp_error ("declaration of template `%#D'", newdecl
);
3253 cp_error_at ("conflicts with previous declaration `%#D'",
3256 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3257 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3258 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3259 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3260 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3261 DECL_TEMPLATE_PARMS (olddecl
)))
3263 cp_error ("new declaration `%#D'", newdecl
);
3264 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3268 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3270 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3272 cp_error ("declaration of C function `%#D' conflicts with",
3274 cp_error_at ("previous declaration `%#D' here", olddecl
);
3276 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3277 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3279 cp_error ("new declaration `%#D'", newdecl
);
3280 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3286 /* Already complained about this, so don't do so again. */
3287 else if (current_class_type
== NULL_TREE
3288 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3290 cp_error ("conflicting types for `%#D'", newdecl
);
3291 cp_error_at ("previous declaration as `%#D'", olddecl
);
3294 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3295 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3296 && (!DECL_TEMPLATE_INFO (newdecl
)
3297 || (DECL_TI_TEMPLATE (newdecl
)
3298 != DECL_TI_TEMPLATE (olddecl
))))
3299 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3300 && (!DECL_TEMPLATE_INFO (olddecl
)
3301 || (DECL_TI_TEMPLATE (olddecl
)
3302 != DECL_TI_TEMPLATE (newdecl
))))))
3303 /* It's OK to have a template specialization and a non-template
3304 with the same type, or to have specializations of two
3305 different templates with the same type. Note that if one is a
3306 specialization, and the other is an instantiation of the same
3307 template, that we do not exit at this point. That situation
3308 can occur if we instantiate a template class, and then
3309 specialize one of its methods. This situation is legal, but
3310 the declarations must be merged in the usual way. */
3312 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3313 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3314 && !DECL_USE_TEMPLATE (newdecl
))
3315 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3316 && !DECL_USE_TEMPLATE (olddecl
))))
3317 /* One of the declarations is a template instantiation, and the
3318 other is not a template at all. That's OK. */
3320 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3321 && DECL_NAMESPACE_ALIAS (newdecl
)
3322 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3323 /* Redeclaration of namespace alias, ignore it. */
3327 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3330 cp_error (errmsg
, newdecl
);
3331 if (DECL_NAME (olddecl
) != NULL_TREE
)
3332 cp_error_at ((DECL_INITIAL (olddecl
)
3333 && namespace_bindings_p ())
3334 ? "`%#D' previously defined here"
3335 : "`%#D' previously declared here", olddecl
);
3337 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3338 && DECL_INITIAL (olddecl
) != NULL_TREE
3339 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3340 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3342 /* Prototype decl follows defn w/o prototype. */
3343 cp_warning_at ("prototype for `%#D'", newdecl
);
3344 cp_warning_at ("follows non-prototype definition here", olddecl
);
3346 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3347 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3349 /* extern "C" int foo ();
3350 int foo () { bar (); }
3352 if (current_lang_stack
3353 == &VARRAY_TREE (current_lang_base
, 0))
3354 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3357 cp_error_at ("previous declaration of `%#D' with %L linkage",
3358 olddecl
, DECL_LANGUAGE (olddecl
));
3359 cp_error ("conflicts with new declaration with %L linkage",
3360 DECL_LANGUAGE (newdecl
));
3364 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3366 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3368 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3369 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3372 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3373 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3375 for (; t1
&& t1
!= void_list_node
;
3376 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3377 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3379 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3384 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3386 cp_pedwarn_at ("after previous specification in `%#D'",
3392 cp_error ("default argument given for parameter %d of `%#D'",
3394 cp_error_at ("after previous specification in `%#D'",
3399 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3400 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3402 cp_warning ("`%#D' was used before it was declared inline",
3404 cp_warning_at ("previous non-inline declaration here",
3410 /* If new decl is `static' and an `extern' was seen previously,
3412 warn_extern_redeclared_static (newdecl
, olddecl
);
3414 /* We have committed to returning 1 at this point. */
3415 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3417 /* Now that functions must hold information normally held
3418 by field decls, there is extra work to do so that
3419 declaration information does not get destroyed during
3421 if (DECL_VINDEX (olddecl
))
3422 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3423 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3424 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3425 if (DECL_CONTEXT (olddecl
))
3426 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3427 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3428 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3429 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3430 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3431 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3432 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3433 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3434 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3435 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3436 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3438 /* Optionally warn about more than one declaration for the same
3439 name, but don't warn about a function declaration followed by a
3441 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3442 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3443 /* Don't warn about extern decl followed by definition. */
3444 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3445 /* Don't warn about friends, let add_friend take care of it. */
3446 && ! DECL_FRIEND_P (newdecl
))
3448 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3449 cp_warning_at ("previous declaration of `%D'", olddecl
);
3453 /* Deal with C++: must preserve virtual function table size. */
3454 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3456 register tree newtype
= TREE_TYPE (newdecl
);
3457 register tree oldtype
= TREE_TYPE (olddecl
);
3459 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3460 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3462 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3463 CLASSTYPE_FRIEND_CLASSES (newtype
)
3464 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3467 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3470 /* Copy all the DECL_... slots specified in the new decl
3471 except for any that we copy here from the old type. */
3472 DECL_MACHINE_ATTRIBUTES (newdecl
)
3473 = merge_machine_decl_attributes (olddecl
, newdecl
);
3475 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3477 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3478 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3479 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3480 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3487 /* Automatically handles default parameters. */
3488 tree oldtype
= TREE_TYPE (olddecl
);
3491 /* Merge the data types specified in the two decls. */
3492 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3494 /* If common_type produces a non-typedef type, just use the old type. */
3495 if (TREE_CODE (newdecl
) == TYPE_DECL
3496 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3499 if (TREE_CODE (newdecl
) == VAR_DECL
)
3500 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3501 /* Do this after calling `common_type' so that default
3502 parameters don't confuse us. */
3503 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3504 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3505 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3507 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3508 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3509 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3510 TYPE_RAISES_EXCEPTIONS (oldtype
));
3512 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3513 && DECL_SOURCE_LINE (olddecl
) != 0
3515 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3516 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3518 cp_error ("declaration of `%F' throws different exceptions",
3520 cp_error_at ("than previous declaration `%F'", olddecl
);
3523 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3525 /* Lay the type out, unless already done. */
3526 if (! same_type_p (newtype
, oldtype
)
3527 && TREE_TYPE (newdecl
) != error_mark_node
3528 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3529 layout_type (TREE_TYPE (newdecl
));
3531 if ((TREE_CODE (newdecl
) == VAR_DECL
3532 || TREE_CODE (newdecl
) == PARM_DECL
3533 || TREE_CODE (newdecl
) == RESULT_DECL
3534 || TREE_CODE (newdecl
) == FIELD_DECL
3535 || TREE_CODE (newdecl
) == TYPE_DECL
)
3536 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3537 layout_decl (newdecl
, 0);
3539 /* Merge the type qualifiers. */
3540 if (TREE_READONLY (newdecl
))
3541 TREE_READONLY (olddecl
) = 1;
3542 if (TREE_THIS_VOLATILE (newdecl
))
3543 TREE_THIS_VOLATILE (olddecl
) = 1;
3545 /* Merge the initialization information. */
3546 if (DECL_INITIAL (newdecl
) == NULL_TREE
3547 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3549 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3550 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3551 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3552 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3553 && DECL_LANG_SPECIFIC (newdecl
)
3554 && DECL_LANG_SPECIFIC (olddecl
))
3555 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3558 /* Merge the section attribute.
3559 We want to issue an error if the sections conflict but that must be
3560 done later in decl_attributes since we are called before attributes
3562 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3563 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3565 /* Keep the old rtl since we can safely use it. */
3566 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3568 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3570 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3571 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3572 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3573 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3574 DECL_NO_LIMIT_STACK (newdecl
)
3575 |= DECL_NO_LIMIT_STACK (olddecl
);
3578 /* If cannot merge, then use the new type and qualifiers,
3579 and don't preserve the old rtl. */
3582 /* Clean out any memory we had of the old declaration. */
3583 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3585 TREE_VALUE (oldstatic
) = error_mark_node
;
3587 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3588 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3589 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3590 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3593 /* Merge the storage class information. */
3594 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3595 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3596 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3597 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3598 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3599 if (! DECL_EXTERNAL (olddecl
))
3600 DECL_EXTERNAL (newdecl
) = 0;
3602 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3604 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3605 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3606 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3607 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3608 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3609 /* Don't really know how much of the language-specific
3610 values we should copy from old to new. */
3611 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3612 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3613 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3614 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3615 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3617 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3618 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3619 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3620 DECL_BEFRIENDING_CLASSES (newdecl
)
3621 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3622 DECL_BEFRIENDING_CLASSES (olddecl
));
3625 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3627 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3628 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3630 /* If newdecl is not a specialization, then it is not a
3631 template-related function at all. And that means that we
3632 shoud have exited above, returning 0. */
3633 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3636 if (TREE_USED (olddecl
))
3637 /* From [temp.expl.spec]:
3639 If a template, a member template or the member of a class
3640 template is explicitly specialized then that
3641 specialization shall be declared before the first use of
3642 that specialization that would cause an implicit
3643 instantiation to take place, in every translation unit in
3644 which such a use occurs. */
3645 cp_error ("explicit specialization of %D after first use",
3648 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3650 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3652 /* If either decl says `inline', this fn is inline, unless its
3653 definition was passed already. */
3654 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3655 DECL_INLINE (olddecl
) = 1;
3656 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3660 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3661 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3662 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3664 if (! types_match
|| new_defines_function
)
3666 /* These need to be copied so that the names are available.
3667 Note that if the types do match, we'll preserve inline
3668 info and other bits, but if not, we won't. */
3669 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3670 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3672 if (new_defines_function
)
3673 /* If defining a function declared with other language
3674 linkage, use the previously declared language linkage. */
3675 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3676 else if (types_match
)
3678 /* If redeclaring a builtin function, and not a definition,
3679 it stays built in. */
3680 if (DECL_BUILT_IN (olddecl
))
3682 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3683 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3684 /* If we're keeping the built-in definition, keep the rtl,
3685 regardless of declaration matches. */
3686 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3689 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3691 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3692 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3693 /* Previously saved insns go together with
3694 the function's previous definition. */
3695 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3696 /* Don't clear out the arguments if we're redefining a function. */
3697 if (DECL_ARGUMENTS (olddecl
))
3698 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3702 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3704 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3707 /* Now preserve various other info from the definition. */
3708 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3709 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3710 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3711 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3713 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3717 function_size
= sizeof (struct tree_decl
);
3719 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3720 (char *) olddecl
+ sizeof (struct tree_common
),
3721 function_size
- sizeof (struct tree_common
));
3723 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3725 /* If newdecl is a template instantiation, it is possible that
3726 the following sequence of events has occurred:
3728 o A friend function was declared in a class template. The
3729 class template was instantiated.
3731 o The instantiation of the friend declaration was
3732 recorded on the instantiation list, and is newdecl.
3734 o Later, however, instantiate_class_template called pushdecl
3735 on the newdecl to perform name injection. But, pushdecl in
3736 turn called duplicate_decls when it discovered that another
3737 declaration of a global function with the same name already
3740 o Here, in duplicate_decls, we decided to clobber newdecl.
3742 If we're going to do that, we'd better make sure that
3743 olddecl, and not newdecl, is on the list of
3744 instantiations so that if we try to do the instantiation
3745 again we won't get the clobbered declaration. */
3747 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3748 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3750 for (; decls
; decls
= TREE_CHAIN (decls
))
3751 if (TREE_VALUE (decls
) == newdecl
)
3752 TREE_VALUE (decls
) = olddecl
;
3757 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3758 (char *) olddecl
+ sizeof (struct tree_common
),
3759 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3760 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3763 DECL_UID (olddecl
) = olddecl_uid
;
3765 DECL_FRIEND_P (olddecl
) = 1;
3767 /* NEWDECL contains the merged attribute lists.
3768 Update OLDDECL to be the same. */
3769 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3774 /* Record a decl-node X as belonging to the current lexical scope.
3775 Check for errors (such as an incompatible declaration for the same
3776 name already seen in the same scope).
3778 Returns either X or an old decl for the same name.
3779 If an old decl is returned, it may have been smashed
3780 to agree with what X says. */
3788 int need_new_binding
;
3790 /* We shouldn't be calling pushdecl when we're generating RTL for a
3791 function that we already did semantic analysis on previously. */
3792 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3795 need_new_binding
= 1;
3797 if (DECL_TEMPLATE_PARM_P (x
))
3798 /* Template parameters have no context; they are not X::T even
3799 when declared within a class or namespace. */
3803 if (current_function_decl
&& x
!= current_function_decl
3804 /* A local declaration for a function doesn't constitute
3806 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3807 /* A local declaration for an `extern' variable is in the
3808 scope of the current namespace, not the current
3810 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3811 && !DECL_CONTEXT (x
))
3812 DECL_CONTEXT (x
) = current_function_decl
;
3814 /* If this is the declaration for a namespace-scope function,
3815 but the declaration itself is in a local scope, mark the
3817 if (TREE_CODE (x
) == FUNCTION_DECL
3818 && DECL_NAMESPACE_SCOPE_P (x
)
3819 && current_function_decl
3820 && x
!= current_function_decl
)
3821 DECL_LOCAL_FUNCTION_P (x
) = 1;
3824 name
= DECL_NAME (x
);
3827 int different_binding_level
= 0;
3829 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3830 name
= TREE_OPERAND (name
, 0);
3832 /* In case this decl was explicitly namespace-qualified, look it
3833 up in its namespace context. */
3834 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3835 && namespace_bindings_p ())
3836 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3838 t
= lookup_name_current_level (name
);
3840 /* [basic.link] If there is a visible declaration of an entity
3841 with linkage having the same name and type, ignoring entities
3842 declared outside the innermost enclosing namespace scope, the
3843 block scope declaration declares that same entity and
3844 receives the linkage of the previous declaration. */
3845 if (! t
&& current_function_decl
&& x
!= current_function_decl
3846 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3847 && DECL_EXTERNAL (x
))
3849 /* Look in block scope. */
3850 t
= IDENTIFIER_VALUE (name
);
3851 /* Or in the innermost namespace. */
3853 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3854 /* Does it have linkage? */
3855 if (t
&& ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3858 different_binding_level
= 1;
3861 /* If we are declaring a function, and the result of name-lookup
3862 was an OVERLOAD, look for an overloaded instance that is
3863 actually the same as the function we are declaring. (If
3864 there is one, we have to merge our declaration with the
3865 previous declaration.) */
3866 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3870 if (TREE_CODE (x
) == FUNCTION_DECL
)
3871 for (match
= t
; match
; match
= OVL_NEXT (match
))
3873 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3874 == DECL_ASSEMBLER_NAME (x
))
3878 /* Just choose one. */
3882 t
= OVL_CURRENT (match
);
3887 if (t
== error_mark_node
)
3889 /* error_mark_node is 0 for a while during initialization! */
3891 cp_error_at ("`%#D' used prior to declaration", x
);
3893 else if (t
!= NULL_TREE
)
3895 if (different_binding_level
)
3897 if (decls_match (x
, t
))
3898 /* The standard only says that the local extern
3899 inherits linkage from the previous decl; in
3900 particular, default args are not shared. It would
3901 be nice to propagate inlining info, though. FIXME. */
3902 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3904 else if (TREE_CODE (t
) == PARM_DECL
)
3906 if (DECL_CONTEXT (t
) == NULL_TREE
)
3907 fatal ("parse errors have confused me too much");
3909 /* Check for duplicate params. */
3910 if (duplicate_decls (x
, t
))
3913 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3914 || DECL_FUNCTION_TEMPLATE_P (x
))
3915 && is_overloaded_fn (t
))
3916 /* Don't do anything just yet. */;
3917 else if (t
== wchar_decl_node
)
3919 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3920 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3922 /* Throw away the redeclaration. */
3925 else if (TREE_CODE (t
) != TREE_CODE (x
))
3927 if (duplicate_decls (x
, t
))
3930 else if (duplicate_decls (x
, t
))
3932 if (TREE_CODE (t
) == TYPE_DECL
)
3933 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3934 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3935 check_default_args (t
);
3939 else if (DECL_MAIN_P (x
))
3941 /* A redeclaration of main, but not a duplicate of the
3946 This function shall not be overloaded. */
3947 cp_error_at ("invalid redeclaration of `%D'", t
);
3948 cp_error ("as `%D'", x
);
3949 /* We don't try to push this declaration since that
3955 check_template_shadow (x
);
3957 /* If this is a function conjured up by the backend, massage it
3958 so it looks friendly. */
3959 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3961 retrofit_lang_decl (x
);
3962 DECL_LANGUAGE (x
) = lang_c
;
3965 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3967 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3970 if (!namespace_bindings_p ())
3971 /* We do not need to create a binding for this name;
3972 push_overloaded_decl will have already done so if
3974 need_new_binding
= 0;
3976 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3978 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3980 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3984 /* If declaring a type as a typedef, copy the type (unless we're
3985 at line 0), and install this TYPE_DECL as the new type's typedef
3986 name. See the extensive comment in ../c-decl.c (pushdecl). */
3987 if (TREE_CODE (x
) == TYPE_DECL
)
3989 tree type
= TREE_TYPE (x
);
3990 if (DECL_SOURCE_LINE (x
) == 0)
3992 if (TYPE_NAME (type
) == 0)
3993 TYPE_NAME (type
) = x
;
3995 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3996 /* We don't want to copy the type when all we're
3997 doing is making a TYPE_DECL for the purposes of
3999 && (!TYPE_NAME (type
)
4000 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
4002 DECL_ORIGINAL_TYPE (x
) = type
;
4003 type
= build_type_copy (type
);
4004 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
4005 TYPE_NAME (type
) = x
;
4006 TREE_TYPE (x
) = type
;
4009 if (type
!= error_mark_node
4011 && TYPE_IDENTIFIER (type
))
4012 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4013 current_binding_level
);
4017 /* Multiple external decls of the same identifier ought to match.
4019 We get warnings about inline functions where they are defined.
4020 We get warnings about other functions from push_overloaded_decl.
4022 Avoid duplicate warnings where they are used. */
4023 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4027 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4028 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4029 decl
= OVL_FUNCTION (decl
);
4031 if (decl
&& decl
!= error_mark_node
4032 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4033 /* If different sort of thing, we already gave an error. */
4034 && TREE_CODE (decl
) == TREE_CODE (x
)
4035 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4037 cp_pedwarn ("type mismatch with previous external decl", x
);
4038 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4042 /* This name is new in its binding level.
4043 Install the new declaration and return it. */
4044 if (namespace_bindings_p ())
4046 /* Install a global value. */
4048 /* If the first global decl has external linkage,
4049 warn if we later see static one. */
4050 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4051 TREE_PUBLIC (name
) = 1;
4053 /* Bind the mangled name for the entity. In the future, we
4054 should not need to do this; mangled names are an
4055 implementation detail of which the front-end should not
4056 need to be aware. */
4057 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4059 /* For an ordinary function, we create a binding from
4060 the mangled name (i.e., NAME) to the DECL. But, for
4061 an `extern "C"' function, the mangled name and the
4062 ordinary name are the same so we need not do this. */
4063 && !DECL_EXTERN_C_FUNCTION_P (x
))
4067 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4068 || TREE_CODE (x
) == NAMESPACE_DECL
)
4069 mangled_name
= name
;
4071 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4073 if (TREE_CODE (x
) == FUNCTION_DECL
)
4075 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4076 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4077 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4080 /* Don't forget if the function was used via an implicit decl. */
4081 if (IDENTIFIER_IMPLICIT_DECL (name
)
4082 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4085 /* Don't forget if its address was taken in that way. */
4086 if (IDENTIFIER_IMPLICIT_DECL (name
)
4087 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4088 TREE_ADDRESSABLE (x
) = 1;
4090 /* Warn about mismatches against previous implicit decl. */
4091 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4092 /* If this real decl matches the implicit, don't complain. */
4093 && ! (TREE_CODE (x
) == FUNCTION_DECL
4094 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4096 ("`%D' was previously implicitly declared to return `int'", x
);
4098 /* If new decl is `static' and an `extern' was seen previously,
4100 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4101 warn_extern_redeclared_static (x
, t
);
4105 /* Here to install a non-global value. */
4106 tree oldlocal
= IDENTIFIER_VALUE (name
);
4107 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4109 if (need_new_binding
)
4111 push_local_binding (name
, x
, 0);
4112 /* Because push_local_binding will hook X on to the
4113 current_binding_level's name list, we don't want to
4114 do that again below. */
4115 need_new_binding
= 0;
4118 /* If this is a TYPE_DECL, push it into the type value slot. */
4119 if (TREE_CODE (x
) == TYPE_DECL
)
4120 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4121 current_binding_level
);
4123 /* Clear out any TYPE_DECL shadowed by a namespace so that
4124 we won't think this is a type. The C struct hack doesn't
4125 go through namespaces. */
4126 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4127 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4128 current_binding_level
);
4135 && TREE_CODE (oldlocal
) == VAR_DECL
4136 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4137 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4139 if (oldlocal
== NULL_TREE
)
4140 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4143 /* If this is an extern function declaration, see if we
4144 have a global definition or declaration for the function. */
4145 if (oldlocal
== NULL_TREE
4146 && DECL_EXTERNAL (x
)
4147 && oldglobal
!= NULL_TREE
4148 && TREE_CODE (x
) == FUNCTION_DECL
4149 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4151 /* We have one. Their types must agree. */
4152 if (decls_match (x
, oldglobal
))
4156 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4157 cp_warning_at ("global declaration `%#D'", oldglobal
);
4160 /* If we have a local external declaration,
4161 and no file-scope declaration has yet been seen,
4162 then if we later have a file-scope decl it must not be static. */
4163 if (oldlocal
== NULL_TREE
4164 && oldglobal
== NULL_TREE
4165 && DECL_EXTERNAL (x
)
4167 TREE_PUBLIC (name
) = 1;
4169 /* Warn if shadowing an argument at the top level of the body. */
4170 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4171 /* Inline decls shadow nothing. */
4172 && !DECL_FROM_INLINE (x
)
4173 && TREE_CODE (oldlocal
) == PARM_DECL
4174 /* Don't complain if it's from an enclosing function. */
4175 && DECL_CONTEXT (oldlocal
) == current_function_decl
4176 && TREE_CODE (x
) != PARM_DECL
)
4178 /* Go to where the parms should be and see if we
4180 struct binding_level
*b
= current_binding_level
->level_chain
;
4186 if (b
->parm_flag
== 1)
4187 cp_error ("declaration of `%#D' shadows a parameter", name
);
4190 /* Maybe warn if shadowing something else. */
4191 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4192 /* Inline decls shadow nothing. */
4193 && !DECL_FROM_INLINE (x
)
4194 /* No shadow warnings for internally generated vars. */
4195 && ! DECL_ARTIFICIAL (x
)
4196 /* No shadow warnings for vars made for inlining. */
4197 && ! DECL_FROM_INLINE (x
))
4199 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4200 warning ("declaration of `%s' shadows a parameter",
4201 IDENTIFIER_POINTER (name
));
4202 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4203 && current_class_ptr
4204 && !TREE_STATIC (name
))
4205 warning ("declaration of `%s' shadows a member of `this'",
4206 IDENTIFIER_POINTER (name
));
4207 else if (oldlocal
!= NULL_TREE
)
4208 warning ("declaration of `%s' shadows previous local",
4209 IDENTIFIER_POINTER (name
));
4210 else if (oldglobal
!= NULL_TREE
)
4211 /* XXX shadow warnings in outer-more namespaces */
4212 warning ("declaration of `%s' shadows global declaration",
4213 IDENTIFIER_POINTER (name
));
4217 if (TREE_CODE (x
) == FUNCTION_DECL
)
4218 check_default_args (x
);
4220 /* Keep count of variables in this level with incomplete type. */
4221 if (TREE_CODE (x
) == VAR_DECL
4222 && TREE_TYPE (x
) != error_mark_node
4223 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4224 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4225 /* RTTI TD entries are created while defining the type_info. */
4226 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4227 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4229 if (namespace_bindings_p ())
4230 namespace_scope_incomplete
4231 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4233 current_binding_level
->incomplete
4234 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4238 if (need_new_binding
)
4239 add_decl_to_level (x
,
4240 DECL_NAMESPACE_SCOPE_P (x
)
4241 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4242 : current_binding_level
);
4247 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4248 caller to set DECL_CONTEXT properly. */
4251 pushdecl_with_scope (x
, level
)
4253 struct binding_level
*level
;
4255 register struct binding_level
*b
;
4256 tree function_decl
= current_function_decl
;
4258 current_function_decl
= NULL_TREE
;
4259 if (level
->parm_flag
== 2)
4261 b
= class_binding_level
;
4262 class_binding_level
= level
;
4263 pushdecl_class_level (x
);
4264 class_binding_level
= b
;
4268 b
= current_binding_level
;
4269 current_binding_level
= level
;
4271 current_binding_level
= b
;
4273 current_function_decl
= function_decl
;
4277 /* Like pushdecl, only it places X in the current namespace,
4281 pushdecl_namespace_level (x
)
4284 register struct binding_level
*b
= current_binding_level
;
4287 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4289 /* Now, the type_shadowed stack may screw us. Munge it so it does
4291 if (TREE_CODE (x
) == TYPE_DECL
)
4293 tree name
= DECL_NAME (x
);
4295 tree
*ptr
= (tree
*)0;
4296 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4298 tree shadowed
= b
->type_shadowed
;
4299 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4300 if (TREE_PURPOSE (shadowed
) == name
)
4302 ptr
= &TREE_VALUE (shadowed
);
4303 /* Can't break out of the loop here because sometimes
4304 a binding level will have duplicate bindings for
4305 PT names. It's gross, but I haven't time to fix it. */
4308 newval
= TREE_TYPE (x
);
4309 if (ptr
== (tree
*)0)
4311 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4312 up here if this is changed to an assertion. --KR */
4313 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4323 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4327 pushdecl_top_level (x
)
4330 push_to_top_level ();
4331 x
= pushdecl_namespace_level (x
);
4332 pop_from_top_level ();
4336 /* Make the declaration of X appear in CLASS scope. */
4339 pushdecl_class_level (x
)
4342 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4343 scope looks for the pre-mangled name. */
4346 if (TREE_CODE (x
) == OVERLOAD
)
4347 x
= OVL_CURRENT (x
);
4348 name
= DECL_NAME (x
);
4352 push_class_level_binding (name
, x
);
4353 if (TREE_CODE (x
) == TYPE_DECL
)
4354 set_identifier_type_value (name
, TREE_TYPE (x
));
4356 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4360 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4363 pushdecl_class_level (f
);
4367 /* Enter DECL into the symbol table, if that's appropriate. Returns
4368 DECL, or a modified version thereof. */
4371 maybe_push_decl (decl
)
4374 tree type
= TREE_TYPE (decl
);
4376 /* Add this decl to the current binding level, but not if it comes
4377 from another scope, e.g. a static member variable. TEM may equal
4378 DECL or it may be a previous decl of the same name. */
4379 if (decl
== error_mark_node
4380 || (TREE_CODE (decl
) != PARM_DECL
4381 && DECL_CONTEXT (decl
) != NULL_TREE
4382 /* Definitions of namespace members outside their namespace are
4384 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4385 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4386 || TREE_CODE (type
) == UNKNOWN_TYPE
4387 /* The declaration of a template specialization does not affect
4388 the functions available for overload resolution, so we do not
4390 || (TREE_CODE (decl
) == FUNCTION_DECL
4391 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4394 return pushdecl (decl
);
4397 /* Make the declaration(s) of X appear in CLASS scope
4398 under the name NAME. */
4401 push_class_level_binding (name
, x
)
4406 /* The class_binding_level will be NULL if x is a template
4407 parameter name in a member template. */
4408 if (!class_binding_level
)
4411 /* Make sure that this new member does not have the same name
4412 as a template parameter. */
4413 if (TYPE_BEING_DEFINED (current_class_type
))
4414 check_template_shadow (x
);
4416 /* If this declaration shadows a declaration from an enclosing
4417 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4418 we leave this class. Record the shadowed declaration here. */
4419 binding
= IDENTIFIER_BINDING (name
);
4421 && ((TREE_CODE (x
) == OVERLOAD
4422 && BINDING_VALUE (binding
)
4423 && is_overloaded_fn (BINDING_VALUE (binding
)))
4424 || INHERITED_VALUE_BINDING_P (binding
)))
4429 /* If the old binding was from a base class, and was for a tag
4430 name, slide it over to make room for the new binding. The
4431 old binding is still visible if explicitly qualified with a
4433 if (INHERITED_VALUE_BINDING_P (binding
)
4434 && BINDING_VALUE (binding
)
4435 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4436 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4437 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4439 old_decl
= BINDING_TYPE (binding
);
4440 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4441 BINDING_VALUE (binding
) = NULL_TREE
;
4442 INHERITED_VALUE_BINDING_P (binding
) = 0;
4445 old_decl
= BINDING_VALUE (binding
);
4447 /* There was already a binding for X containing fewer
4448 functions than are named in X. Find the previous
4449 declaration of X on the class-shadowed list, and update it. */
4450 for (shadow
= class_binding_level
->class_shadowed
;
4452 shadow
= TREE_CHAIN (shadow
))
4453 if (TREE_PURPOSE (shadow
) == name
4454 && TREE_TYPE (shadow
) == old_decl
)
4456 BINDING_VALUE (binding
) = x
;
4457 INHERITED_VALUE_BINDING_P (binding
) = 0;
4458 TREE_TYPE (shadow
) = x
;
4463 /* If we didn't replace an existing binding, put the binding on the
4464 stack of bindings for the identifier, and update
4465 IDENTIFIER_CLASS_VALUE. */
4466 if (push_class_binding (name
, x
))
4468 class_binding_level
->class_shadowed
4469 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4470 class_binding_level
->class_shadowed
);
4471 /* Record the value we are binding NAME to so that we can know
4472 what to pop later. */
4473 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4477 /* Insert another USING_DECL into the current binding level, returning
4478 this declaration. If this is a redeclaration, do nothing, and
4479 return NULL_TREE if this not in namespace scope (in namespace
4480 scope, a using decl might extend any previous bindings). */
4483 push_using_decl (scope
, name
)
4489 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4490 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4491 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4492 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4495 return namespace_bindings_p () ? decl
: NULL_TREE
;
4496 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4497 DECL_INITIAL (decl
) = scope
;
4498 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4499 current_binding_level
->usings
= decl
;
4503 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4504 changed (i.e. there was already a directive), or the fresh
4505 TREE_LIST otherwise. */
4508 push_using_directive (used
)
4511 tree ud
= current_binding_level
->using_directives
;
4512 tree iter
, ancestor
;
4514 /* Check if we already have this. */
4515 if (purpose_member (used
, ud
) != NULL_TREE
)
4518 /* Recursively add all namespaces used. */
4519 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4520 push_using_directive (TREE_PURPOSE (iter
));
4522 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4523 ud
= current_binding_level
->using_directives
;
4524 ud
= tree_cons (used
, ancestor
, ud
);
4525 current_binding_level
->using_directives
= ud
;
4529 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4530 other definitions already in place. We get around this by making
4531 the value of the identifier point to a list of all the things that
4532 want to be referenced by that name. It is then up to the users of
4533 that name to decide what to do with that list.
4535 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4536 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4538 FLAGS is a bitwise-or of the following values:
4539 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4541 PUSH_USING: DECL is being pushed as the result of a using
4544 The value returned may be a previous declaration if we guessed wrong
4545 about what language DECL should belong to (C or C++). Otherwise,
4546 it's always DECL (and never something that's not a _DECL). */
4549 push_overloaded_decl (decl
, flags
)
4553 tree name
= DECL_NAME (decl
);
4556 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4559 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4561 old
= lookup_name_current_level (name
);
4565 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4567 tree t
= TREE_TYPE (old
);
4568 if (IS_AGGR_TYPE (t
) && warn_shadow
4569 && (! DECL_IN_SYSTEM_HEADER (decl
)
4570 || ! DECL_IN_SYSTEM_HEADER (old
)))
4571 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4574 else if (is_overloaded_fn (old
))
4578 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4580 tree fn
= OVL_CURRENT (tmp
);
4582 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4583 && !(flags
& PUSH_USING
)
4584 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4585 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4586 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4589 if (duplicate_decls (decl
, fn
))
4593 else if (old
== error_mark_node
)
4594 /* Ignore the undefined symbol marker. */
4598 cp_error_at ("previous non-function declaration `%#D'", old
);
4599 cp_error ("conflicts with function declaration `%#D'", decl
);
4604 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4606 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4607 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4609 new_binding
= ovl_cons (decl
, old
);
4610 if (flags
& PUSH_USING
)
4611 OVL_USED (new_binding
) = 1;
4614 /* NAME is not ambiguous. */
4618 set_namespace_binding (name
, current_namespace
, new_binding
);
4621 /* We only create an OVERLOAD if there was a previous binding at
4622 this level, or if decl is a template. In the former case, we
4623 need to remove the old binding and replace it with the new
4624 binding. We must also run through the NAMES on the binding
4625 level where the name was bound to update the chain. */
4627 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4631 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4633 d
= &TREE_CHAIN (*d
))
4635 || (TREE_CODE (*d
) == TREE_LIST
4636 && TREE_VALUE (*d
) == old
))
4638 if (TREE_CODE (*d
) == TREE_LIST
)
4639 /* Just replace the old binding with the new. */
4640 TREE_VALUE (*d
) = new_binding
;
4642 /* Build a TREE_LIST to wrap the OVERLOAD. */
4643 *d
= tree_cons (NULL_TREE
, new_binding
,
4646 /* And update the CPLUS_BINDING node. */
4647 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4652 /* We should always find a previous binding in this case. */
4653 my_friendly_abort (0);
4656 /* Install the new binding. */
4657 push_local_binding (name
, new_binding
, flags
);
4663 /* Generate an implicit declaration for identifier FUNCTIONID
4664 as a function of type int (). Print a warning if appropriate. */
4667 implicitly_declare (functionid
)
4672 /* We used to reuse an old implicit decl here,
4673 but this loses with inline functions because it can clobber
4674 the saved decl chains. */
4675 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4677 DECL_EXTERNAL (decl
) = 1;
4678 TREE_PUBLIC (decl
) = 1;
4680 /* ISO standard says implicit declarations are in the innermost block.
4681 So we record the decl in the standard fashion. */
4683 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4686 /* Only one warning per identifier. */
4687 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4689 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4692 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4697 /* Return zero if the declaration NEWDECL is valid
4698 when the declaration OLDDECL (assumed to be for the same name)
4699 has already been seen.
4700 Otherwise return an error message format string with a %s
4701 where the identifier should go. */
4704 redeclaration_error_message (newdecl
, olddecl
)
4705 tree newdecl
, olddecl
;
4707 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4709 /* Because C++ can put things into name space for free,
4710 constructs like "typedef struct foo { ... } foo"
4711 would look like an erroneous redeclaration. */
4712 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4715 return "redefinition of `%#D'";
4717 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4719 /* If this is a pure function, its olddecl will actually be
4720 the original initialization to `0' (which we force to call
4721 abort()). Don't complain about redefinition in this case. */
4722 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4725 /* If both functions come from different namespaces, this is not
4726 a redeclaration - this is a conflict with a used function. */
4727 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4728 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4729 return "`%D' conflicts with used function";
4731 /* We'll complain about linkage mismatches in
4732 warn_extern_redeclared_static. */
4734 /* Defining the same name twice is no good. */
4735 if (DECL_INITIAL (olddecl
) != NULL_TREE
4736 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4738 if (DECL_NAME (olddecl
) == NULL_TREE
)
4739 return "`%#D' not declared in class";
4741 return "redefinition of `%#D'";
4745 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4747 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4748 && (DECL_TEMPLATE_RESULT (newdecl
)
4749 != DECL_TEMPLATE_RESULT (olddecl
))
4750 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4751 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4752 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4753 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4754 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4755 return "redefinition of `%#D'";
4758 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4760 /* Objects declared at top level: */
4761 /* If at least one is a reference, it's ok. */
4762 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4764 /* Reject two definitions. */
4765 return "redefinition of `%#D'";
4769 /* Objects declared with block scope: */
4770 /* Reject two definitions, and reject a definition
4771 together with an external reference. */
4772 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4773 return "redeclaration of `%#D'";
4778 /* Create a new label, named ID. */
4781 make_label_decl (id
, local_p
)
4787 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4789 /* Make sure every label has an rtx. */
4792 DECL_CONTEXT (decl
) = current_function_decl
;
4793 DECL_MODE (decl
) = VOIDmode
;
4794 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4796 /* Say where one reference is to the label, for the sake of the
4797 error if it is not defined. */
4798 DECL_SOURCE_LINE (decl
) = lineno
;
4799 DECL_SOURCE_FILE (decl
) = input_filename
;
4801 /* Record the fact that this identifier is bound to this label. */
4802 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4807 /* Record this label on the list of used labels so that we can check
4808 at the end of the function to see whether or not the label was
4809 actually defined, and so we can check when the label is defined whether
4810 this use is valid. */
4816 if (named_label_uses
== NULL
4817 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4818 || named_label_uses
->label_decl
!= decl
)
4820 struct named_label_use_list
*new_ent
;
4821 new_ent
= ((struct named_label_use_list
*)
4822 ggc_alloc (sizeof (struct named_label_use_list
)));
4823 new_ent
->label_decl
= decl
;
4824 new_ent
->names_in_scope
= current_binding_level
->names
;
4825 new_ent
->binding_level
= current_binding_level
;
4826 new_ent
->lineno_o_goto
= lineno
;
4827 new_ent
->filename_o_goto
= input_filename
;
4828 new_ent
->next
= named_label_uses
;
4829 named_label_uses
= new_ent
;
4833 /* Look for a label named ID in the current function. If one cannot
4834 be found, create one. (We keep track of used, but undefined,
4835 labels, and complain about them at the end of a function.) */
4842 struct named_label_list
*ent
;
4844 /* You can't use labels at global scope. */
4845 if (current_function_decl
== NULL_TREE
)
4847 error ("label `%s' referenced outside of any function",
4848 IDENTIFIER_POINTER (id
));
4852 /* See if we've already got this label. */
4853 decl
= IDENTIFIER_LABEL_VALUE (id
);
4854 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4857 /* Record this label on the list of labels used in this function.
4858 We do this before calling make_label_decl so that we get the
4859 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4860 ent
= ((struct named_label_list
*)
4861 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4862 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4863 ent
->next
= named_labels
;
4866 /* We need a new label. */
4867 decl
= make_label_decl (id
, /*local_p=*/0);
4869 /* Now fill in the information we didn't have before. */
4870 ent
->label_decl
= decl
;
4875 /* Declare a local label named ID. */
4878 declare_local_label (id
)
4883 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4884 this scope we can restore the old value of
4885 IDENTIFIER_TYPE_VALUE. */
4886 current_binding_level
->shadowed_labels
4887 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4888 current_binding_level
->shadowed_labels
);
4889 /* Look for the label. */
4890 decl
= make_label_decl (id
, /*local_p=*/1);
4891 /* Now fill in the information we didn't have before. */
4892 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4897 /* Returns nonzero if it is ill-formed to jump past the declaration of
4898 DECL. Returns 2 if it's also a real problem. */
4901 decl_jump_unsafe (decl
)
4904 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4907 if (DECL_INITIAL (decl
) == NULL_TREE
4908 && pod_type_p (TREE_TYPE (decl
)))
4911 /* This is really only important if we're crossing an initialization.
4912 The POD stuff is just pedantry; why should it matter if the class
4913 contains a field of pointer to member type? */
4914 if (DECL_INITIAL (decl
)
4915 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4920 /* Check that a single previously seen jump to a newly defined label
4921 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4922 the jump context; NAMES are the names in scope in LEVEL at the jump
4923 context; FILE and LINE are the source position of the jump or 0. */
4926 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4928 struct binding_level
*level
;
4935 struct binding_level
*b
= current_binding_level
;
4936 for (; b
; b
= b
->level_chain
)
4938 tree new_decls
= b
->names
;
4939 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4940 for (; new_decls
!= old_decls
;
4941 new_decls
= TREE_CHAIN (new_decls
))
4943 int problem
= decl_jump_unsafe (new_decls
);
4950 cp_pedwarn ("jump to label `%D'", decl
);
4952 pedwarn ("jump to case label");
4955 pedwarn_with_file_and_line (file
, line
, " from here");
4959 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4960 /* Can't skip init of __exception_info. */
4961 cp_error_at (" enters catch block", new_decls
);
4962 else if (problem
> 1)
4963 cp_error_at (" crosses initialization of `%#D'",
4966 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4972 if (b
->eh_region
&& ! saw_eh
)
4977 cp_pedwarn ("jump to label `%D'", decl
);
4979 pedwarn ("jump to case label");
4982 pedwarn_with_file_and_line (file
, line
, " from here");
4985 error (" enters try block");
4992 check_previous_goto (use
)
4993 struct named_label_use_list
*use
;
4995 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4996 use
->names_in_scope
, use
->filename_o_goto
,
4997 use
->lineno_o_goto
);
5001 check_switch_goto (level
)
5002 struct binding_level
*level
;
5004 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
5007 /* Check that any previously seen jumps to a newly defined label DECL
5008 are OK. Called by define_label. */
5011 check_previous_gotos (decl
)
5014 struct named_label_use_list
**usep
;
5016 if (! TREE_USED (decl
))
5019 for (usep
= &named_label_uses
; *usep
; )
5021 struct named_label_use_list
*use
= *usep
;
5022 if (use
->label_decl
== decl
)
5024 check_previous_goto (use
);
5028 usep
= &(use
->next
);
5032 /* Check that a new jump to a label DECL is OK. Called by
5033 finish_goto_stmt. */
5041 struct named_label_list
*lab
;
5043 /* We can't know where a computed goto is jumping. So we assume
5045 if (! DECL_P (decl
))
5048 /* If the label hasn't been defined yet, defer checking. */
5049 if (! DECL_INITIAL (decl
))
5055 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5056 if (decl
== lab
->label_decl
)
5059 /* If the label is not on named_labels it's a gcc local label, so
5060 it must be in an outer scope, so jumping to it is always OK. */
5064 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5066 cp_pedwarn_at ("jump to label `%D'", decl
);
5067 pedwarn (" from here");
5071 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5073 tree b
= TREE_VALUE (bad
);
5074 int u
= decl_jump_unsafe (b
);
5076 if (u
> 1 && DECL_ARTIFICIAL (b
))
5077 /* Can't skip init of __exception_info. */
5078 cp_error_at (" enters catch block", b
);
5080 cp_error_at (" skips initialization of `%#D'", b
);
5082 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5086 error (" enters try block");
5089 /* Define a label, specifying the location in the source file.
5090 Return the LABEL_DECL node for the label, if the definition is valid.
5091 Otherwise return 0. */
5094 define_label (filename
, line
, name
)
5095 const char *filename
;
5099 tree decl
= lookup_label (name
);
5100 struct named_label_list
*ent
;
5102 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5103 if (ent
->label_decl
== decl
)
5106 /* After labels, make any new cleanups go into their
5107 own new (temporary) binding contour. */
5108 current_binding_level
->more_cleanups_ok
= 0;
5110 if (name
== get_identifier ("wchar_t"))
5111 cp_pedwarn ("label named wchar_t");
5113 if (DECL_INITIAL (decl
) != NULL_TREE
)
5115 cp_error ("duplicate label `%D'", decl
);
5120 /* Mark label as having been defined. */
5121 DECL_INITIAL (decl
) = error_mark_node
;
5122 /* Say where in the source. */
5123 DECL_SOURCE_FILE (decl
) = filename
;
5124 DECL_SOURCE_LINE (decl
) = line
;
5127 ent
->names_in_scope
= current_binding_level
->names
;
5128 ent
->binding_level
= current_binding_level
;
5130 check_previous_gotos (decl
);
5131 current_function_return_value
= NULL_TREE
;
5138 struct binding_level
*level
;
5139 struct cp_switch
*next
;
5140 /* The SWITCH_STMT being built. */
5142 /* A splay-tree mapping the low element of a case range to the high
5143 element, or NULL_TREE if there is no high element. Used to
5144 determine whether or not a new case label duplicates an old case
5145 label. We need a tree, rather than simply a hash table, because
5146 of the GNU case range extension. */
5150 /* A stack of the currently active switch statements. The innermost
5151 switch statement is on the top of the stack. There is no need to
5152 mark the stack for garbage collection because it is only active
5153 during the processing of the body of a function, and we never
5154 collect at that point. */
5156 static struct cp_switch
*switch_stack
;
5158 /* Called right after a switch-statement condition is parsed.
5159 SWITCH_STMT is the switch statement being parsed. */
5162 push_switch (switch_stmt
)
5166 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5167 p
->level
= current_binding_level
;
5168 p
->next
= switch_stack
;
5169 p
->switch_stmt
= switch_stmt
;
5170 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5177 struct cp_switch
*cs
;
5180 splay_tree_delete (cs
->cases
);
5181 switch_stack
= switch_stack
->next
;
5185 /* Note that we've seen a definition of a case label, and complain if this
5186 is a bad place for one. */
5189 finish_case_label (low_value
, high_value
)
5198 error ("case label not within a switch statement");
5200 cp_error ("case label `%E' not within a switch statement",
5203 error ("`default' label not within a switch statement");
5207 if (processing_template_decl
)
5211 /* For templates, just add the case label; we'll do semantic
5212 analysis at instantiation-time. */
5213 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5214 add_stmt (build_case_label (low_value
, high_value
, label
));
5218 /* Find the condition on which this switch statement depends. */
5219 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5220 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5221 cond
= TREE_VALUE (cond
);
5223 c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5225 check_switch_goto (switch_stack
->level
);
5227 /* After labels, make any new cleanups go into their
5228 own new (temporary) binding contour. */
5229 current_binding_level
->more_cleanups_ok
= 0;
5230 current_function_return_value
= NULL_TREE
;
5233 /* Return the list of declarations of the current level.
5234 Note that this list is in reverse order unless/until
5235 you nreverse it; and when you do nreverse it, you must
5236 store the result back using `storedecls' or you will lose. */
5241 return current_binding_level
->names
;
5244 /* Return the list of type-tags (for structs, etc) of the current level. */
5249 return current_binding_level
->tags
;
5252 /* Store the list of declarations of the current level.
5253 This is done for the parameter declarations of a function being defined,
5254 after they are modified in the light of any missing parameters. */
5260 current_binding_level
->names
= decls
;
5263 /* Similarly, store the list of tags of the current level. */
5269 current_binding_level
->tags
= tags
;
5272 /* Given NAME, an IDENTIFIER_NODE,
5273 return the structure (or union or enum) definition for that name.
5274 Searches binding levels from BINDING_LEVEL up to the global level.
5275 If THISLEVEL_ONLY is nonzero, searches only the specified context
5276 (but skips any tag-transparent contexts to find one that is
5277 meaningful for tags).
5278 FORM says which kind of type the caller wants;
5279 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5280 If the wrong kind of type is found, and it's not a template, an error is
5284 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5285 enum tree_code form
;
5287 struct binding_level
*binding_level
;
5290 register struct binding_level
*level
;
5291 /* Non-zero if, we should look past a template parameter level, even
5292 if THISLEVEL_ONLY. */
5293 int allow_template_parms_p
= 1;
5295 for (level
= binding_level
; level
; level
= level
->level_chain
)
5298 if (ANON_AGGRNAME_P (name
))
5299 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5301 /* There's no need for error checking here, because
5302 anon names are unique throughout the compilation. */
5303 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5304 return TREE_VALUE (tail
);
5306 else if (level
->namespace_p
)
5307 /* Do namespace lookup. */
5308 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5310 tree old
= binding_for_name (name
, tail
);
5312 /* If we just skipped past a template parameter level,
5313 even though THISLEVEL_ONLY, and we find a template
5314 class declaration, then we use the _TYPE node for the
5315 template. See the example below. */
5316 if (thislevel_only
&& !allow_template_parms_p
5317 && old
&& BINDING_VALUE (old
)
5318 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5319 old
= TREE_TYPE (BINDING_VALUE (old
));
5321 old
= BINDING_TYPE (old
);
5323 /* If it has an original type, it is a typedef, and we
5324 should not return it. */
5325 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5327 if (old
&& TREE_CODE (old
) != form
5328 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5330 cp_error ("`%#D' redeclared as %C", old
, form
);
5335 if (thislevel_only
|| tail
== global_namespace
)
5339 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5341 if (TREE_PURPOSE (tail
) == name
)
5343 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5344 /* Should tighten this up; it'll probably permit
5345 UNION_TYPE and a struct template, for example. */
5347 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5349 /* Definition isn't the kind we were looking for. */
5350 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5354 return TREE_VALUE (tail
);
5357 if (thislevel_only
&& ! level
->tag_transparent
)
5359 if (level
->template_parms_p
&& allow_template_parms_p
)
5361 /* We must deal with cases like this:
5363 template <class T> struct S;
5364 template <class T> struct S {};
5366 When looking up `S', for the second declaration, we
5367 would like to find the first declaration. But, we
5368 are in the pseudo-global level created for the
5369 template parameters, rather than the (surrounding)
5370 namespace level. Thus, we keep going one more level,
5371 even though THISLEVEL_ONLY is non-zero. */
5372 allow_template_parms_p
= 0;
5384 set_current_level_tags_transparency (tags_transparent
)
5385 int tags_transparent
;
5387 current_binding_level
->tag_transparent
= tags_transparent
;
5391 /* Given a type, find the tag that was defined for it and return the tag name.
5392 Otherwise return 0. However, the value can never be 0
5393 in the cases in which this is used.
5395 C++: If NAME is non-zero, this is the new name to install. This is
5396 done when replacing anonymous tags with real tag names. */
5399 lookup_tag_reverse (type
, name
)
5403 register struct binding_level
*level
;
5405 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5408 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5410 if (TREE_VALUE (tail
) == type
)
5413 TREE_PURPOSE (tail
) = name
;
5414 return TREE_PURPOSE (tail
);
5421 /* Look up NAME in the NAMESPACE. */
5424 lookup_namespace_name (namespace, name
)
5425 tree
namespace, name
;
5428 tree template_id
= NULL_TREE
;
5430 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5432 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5433 /* This happens for A::B<int> when B is a namespace. */
5435 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5437 /* This happens for A::B where B is a template, and there are no
5438 template arguments. */
5439 cp_error ("invalid use of `%D'", name
);
5440 return error_mark_node
;
5443 namespace = ORIGINAL_NAMESPACE (namespace);
5445 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5448 name
= TREE_OPERAND (name
, 0);
5449 if (TREE_CODE (name
) == OVERLOAD
)
5450 name
= DECL_NAME (OVL_CURRENT (name
));
5451 else if (DECL_P (name
))
5452 name
= DECL_NAME (name
);
5455 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5457 val
= make_node (CPLUS_BINDING
);
5458 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5459 return error_mark_node
;
5461 if (BINDING_VALUE (val
))
5463 val
= BINDING_VALUE (val
);
5467 if (DECL_CLASS_TEMPLATE_P (val
))
5468 val
= lookup_template_class (val
,
5469 TREE_OPERAND (template_id
, 1),
5470 /*in_decl=*/NULL_TREE
,
5471 /*context=*/NULL_TREE
,
5472 /*entering_scope=*/0);
5473 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5474 || TREE_CODE (val
) == OVERLOAD
)
5475 val
= lookup_template_function (val
,
5476 TREE_OPERAND (template_id
, 1));
5479 cp_error ("`%D::%D' is not a template",
5481 return error_mark_node
;
5485 /* If we have a single function from a using decl, pull it out. */
5486 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5487 val
= OVL_FUNCTION (val
);
5491 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5492 return error_mark_node
;
5495 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5497 static unsigned long
5505 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5506 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5511 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5514 typename_compare (k1
, k2
)
5525 d1
= TYPE_NAME (t1
);
5526 d2
= TYPE_NAME (t2
);
5528 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5529 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5530 && ((TREE_TYPE (t1
) != NULL_TREE
)
5531 == (TREE_TYPE (t2
) != NULL_TREE
))
5532 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5533 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5536 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5537 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5538 is non-NULL, this type is being created by the implicit typename
5539 extension, and BASE_TYPE is a type named `t' in some base class of
5540 `T' which depends on template parameters.
5542 Returns the new TYPENAME_TYPE. */
5545 build_typename_type (context
, name
, fullname
, base_type
)
5553 struct hash_entry
* e
;
5555 static struct hash_table ht
;
5559 static struct hash_table
*h
= &ht
;
5560 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5562 fatal ("virtual memory exhausted");
5563 ggc_add_tree_hash_table_root (&h
, 1);
5566 /* Build the TYPENAME_TYPE. */
5567 t
= make_aggr_type (TYPENAME_TYPE
);
5568 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5569 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5570 TREE_TYPE (t
) = base_type
;
5572 /* Build the corresponding TYPE_DECL. */
5573 d
= build_decl (TYPE_DECL
, name
, t
);
5574 TYPE_NAME (TREE_TYPE (d
)) = d
;
5575 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5576 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5577 DECL_ARTIFICIAL (d
) = 1;
5579 /* See if we already have this type. */
5580 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5584 /* Insert the type into the table. */
5585 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5590 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5591 unless an error occurs, in which case error_mark_node is returned.
5592 If COMPLAIN zero, don't complain about any errors that occur. */
5595 make_typename_type (context
, name
, complain
)
5603 if (!(TYPE_LANG_SPECIFIC (name
)
5604 && (CLASSTYPE_IS_TEMPLATE (name
)
5605 || CLASSTYPE_USE_TEMPLATE (name
))))
5606 name
= TYPE_IDENTIFIER (name
);
5608 /* Create a TEMPLATE_ID_EXPR for the type. */
5609 name
= build_nt (TEMPLATE_ID_EXPR
,
5610 CLASSTYPE_TI_TEMPLATE (name
),
5611 CLASSTYPE_TI_ARGS (name
));
5613 else if (TREE_CODE (name
) == TYPE_DECL
)
5614 name
= DECL_NAME (name
);
5618 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5620 name
= TREE_OPERAND (name
, 0);
5621 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5622 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5624 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5625 my_friendly_abort (2000);
5627 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5629 /* We can get here from typename_sub0 in the explicit_template_type
5630 expansion. Just fail. */
5632 cp_error ("no class template named `%#T' in `%#T'",
5634 return error_mark_node
;
5637 if (! uses_template_parms (context
)
5638 || currently_open_class (context
))
5640 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5642 tree tmpl
= NULL_TREE
;
5643 if (IS_AGGR_TYPE (context
))
5644 tmpl
= lookup_field (context
, name
, 0, 0);
5645 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5648 cp_error ("no class template named `%#T' in `%#T'",
5650 return error_mark_node
;
5653 return lookup_template_class (tmpl
,
5654 TREE_OPERAND (fullname
, 1),
5656 /*entering_scope=*/0);
5662 if (!IS_AGGR_TYPE (context
))
5665 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5666 return error_mark_node
;
5669 t
= lookup_field (context
, name
, 0, 1);
5671 return TREE_TYPE (t
);
5675 /* If the CONTEXT is not a template type, then either the field is
5676 there now or its never going to be. */
5677 if (!uses_template_parms (context
))
5680 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5681 return error_mark_node
;
5685 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5688 /* Select the right _DECL from multiple choices. */
5691 select_decl (binding
, flags
)
5696 val
= BINDING_VALUE (binding
);
5698 /* When we implicitly declare some builtin entity, we mark it
5699 DECL_ANTICIPATED, so that we know to ignore it until it is
5701 if (val
&& DECL_P (val
)
5702 && DECL_LANG_SPECIFIC (val
)
5703 && DECL_ANTICIPATED (val
))
5706 if (LOOKUP_NAMESPACES_ONLY (flags
))
5708 /* We are not interested in types. */
5709 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5714 /* If we could have a type and
5715 we have nothing or we need a type and have none. */
5716 if (BINDING_TYPE (binding
)
5717 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5718 && TREE_CODE (val
) != TYPE_DECL
)))
5719 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5720 /* Don't return non-types if we really prefer types. */
5721 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5722 && (TREE_CODE (val
) != TEMPLATE_DECL
5723 || !DECL_CLASS_TEMPLATE_P (val
)))
5729 /* Unscoped lookup of a global: iterate over current namespaces,
5730 considering using-directives. If SPACESP is non-NULL, store a list
5731 of the namespaces we've considered in it. */
5734 unqualified_namespace_lookup (name
, flags
, spacesp
)
5739 tree b
= make_node (CPLUS_BINDING
);
5740 tree initial
= current_decl_namespace();
5741 tree scope
= initial
;
5743 struct binding_level
*level
;
5744 tree val
= NULL_TREE
;
5747 *spacesp
= NULL_TREE
;
5749 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5752 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5753 val
= binding_for_name (name
, scope
);
5755 /* Initialize binding for this context. */
5756 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5757 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5759 /* Add all _DECLs seen through local using-directives. */
5760 for (level
= current_binding_level
;
5761 !level
->namespace_p
;
5762 level
= level
->level_chain
)
5763 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5764 scope
, flags
, spacesp
))
5765 /* Give up because of error. */
5766 return error_mark_node
;
5768 /* Add all _DECLs seen through global using-directives. */
5769 /* XXX local and global using lists should work equally. */
5773 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5774 scope
, flags
, spacesp
))
5775 /* Give up because of error. */
5776 return error_mark_node
;
5777 if (siter
== scope
) break;
5778 siter
= CP_DECL_CONTEXT (siter
);
5781 val
= select_decl (b
, flags
);
5782 if (scope
== global_namespace
)
5788 /* Combine prefer_type and namespaces_only into flags. */
5791 lookup_flags (prefer_type
, namespaces_only
)
5792 int prefer_type
, namespaces_only
;
5794 if (namespaces_only
)
5795 return LOOKUP_PREFER_NAMESPACES
;
5796 if (prefer_type
> 1)
5797 return LOOKUP_PREFER_TYPES
;
5798 if (prefer_type
> 0)
5799 return LOOKUP_PREFER_BOTH
;
5803 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5804 ignore it or not. Subroutine of lookup_name_real. */
5807 qualify_lookup (val
, flags
)
5811 if (val
== NULL_TREE
)
5813 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5815 if ((flags
& LOOKUP_PREFER_TYPES
)
5816 && (TREE_CODE (val
) == TYPE_DECL
5817 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5818 && DECL_CLASS_TEMPLATE_P (val
))))
5820 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5825 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5829 warn_about_implicit_typename_lookup (typename
, binding
)
5833 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5834 tree name
= DECL_NAME (typename
);
5836 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5837 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5838 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5839 && ! (TREE_CODE (binding
) == TYPE_DECL
5840 && same_type_p (TREE_TYPE (binding
), subtype
)))
5842 cp_warning ("lookup of `%D' finds `%#D'",
5844 cp_warning (" instead of `%D' from dependent base class",
5846 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5847 constructor_name (current_class_type
), name
);
5851 /* Look up NAME in the current binding level and its superiors in the
5852 namespace of variables, functions and typedefs. Return a ..._DECL
5853 node of some kind representing its definition if there is only one
5854 such declaration, or return a TREE_LIST with all the overloaded
5855 definitions if there are many, or return 0 if it is undefined.
5857 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5858 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5859 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5860 Otherwise we prefer non-TYPE_DECLs.
5862 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5863 using IDENTIFIER_CLASS_VALUE. */
5866 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5868 int prefer_type
, nonclass
, namespaces_only
;
5871 tree val
= NULL_TREE
;
5873 tree from_obj
= NULL_TREE
;
5875 int val_is_implicit_typename
= 0;
5877 /* Hack: copy flag set by parser, if set. */
5878 if (only_namespace_names
)
5879 namespaces_only
= 1;
5881 if (prefer_type
== -2)
5883 extern int looking_for_typename
;
5884 tree type
= NULL_TREE
;
5887 prefer_type
= looking_for_typename
;
5889 flags
= lookup_flags (prefer_type
, namespaces_only
);
5890 /* If the next thing is '<', class templates are types. */
5891 if (looking_for_template
)
5892 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5894 /* std:: becomes :: for now. */
5895 if (got_scope
&& got_scope
== fake_std_node
)
5896 got_scope
= void_type_node
;
5900 else if (got_object
!= error_mark_node
)
5905 if (type
== error_mark_node
)
5906 return error_mark_node
;
5907 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5908 type
= TREE_TYPE (type
);
5911 type
= complete_type (type
);
5913 if (TREE_CODE (type
) == VOID_TYPE
)
5914 type
= global_namespace
;
5915 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5917 val
= make_node (CPLUS_BINDING
);
5918 flags
|= LOOKUP_COMPLAIN
;
5919 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5921 val
= select_decl (val
, flags
);
5923 else if (! IS_AGGR_TYPE (type
)
5924 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5925 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5926 || TREE_CODE (type
) == TYPENAME_TYPE
)
5927 /* Someone else will give an error about this if needed. */
5929 else if (type
== current_class_type
)
5930 val
= IDENTIFIER_CLASS_VALUE (name
);
5933 val
= lookup_member (type
, name
, 0, prefer_type
);
5934 type_access_control (type
, val
);
5936 /* Restore the containing TYPENAME_TYPE if we looked
5937 through it before. */
5938 if (got_scope
&& got_scope
!= type
5939 && val
&& TREE_CODE (val
) == TYPE_DECL
5940 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5941 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5949 else if (got_object
&& val
)
5957 flags
= lookup_flags (prefer_type
, namespaces_only
);
5958 /* If we're not parsing, we need to complain. */
5959 flags
|= LOOKUP_COMPLAIN
;
5962 /* First, look in non-namespace scopes. */
5964 if (current_class_type
== NULL_TREE
)
5967 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5971 if (!LOCAL_BINDING_P (t
) && nonclass
)
5972 /* We're not looking for class-scoped bindings, so keep going. */
5975 /* If this is the kind of thing we're looking for, we're done. */
5976 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5977 binding
= BINDING_VALUE (t
);
5978 else if ((flags
& LOOKUP_PREFER_TYPES
)
5979 && qualify_lookup (BINDING_TYPE (t
), flags
))
5980 binding
= BINDING_TYPE (t
);
5982 binding
= NULL_TREE
;
5984 /* Handle access control on types from enclosing or base classes. */
5985 if (binding
&& ! yylex
5986 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5987 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5990 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5992 if (val_is_implicit_typename
&& !yylex
)
5993 warn_about_implicit_typename_lookup (val
, binding
);
5995 val_is_implicit_typename
5996 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5997 if (!val_is_implicit_typename
)
6002 /* Now lookup in namespace scopes. */
6003 if (!val
|| val_is_implicit_typename
)
6005 t
= unqualified_namespace_lookup (name
, flags
, 0);
6008 if (val_is_implicit_typename
&& !yylex
)
6009 warn_about_implicit_typename_lookup (val
, t
);
6017 /* This should only warn about types used in qualified-ids. */
6018 if (from_obj
&& from_obj
!= val
)
6020 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
6021 && TREE_CODE (val
) == TYPE_DECL
6022 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
6024 lookup of `%D' in the scope of `%#T' (`%#T') \
6025 does not match lookup in the current scope (`%#T')",
6026 name
, got_object
, TREE_TYPE (from_obj
),
6029 /* We don't change val to from_obj if got_object depends on
6030 template parms because that breaks implicit typename for
6031 destructor calls. */
6032 if (! uses_template_parms (got_object
))
6036 /* If we have a single function from a using decl, pull it out. */
6037 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6038 val
= OVL_FUNCTION (val
);
6047 lookup_name_nonclass (name
)
6050 return lookup_name_real (name
, 0, 1, 0);
6054 lookup_function_nonclass (name
, args
)
6058 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6062 lookup_name_namespace_only (name
)
6065 /* type-or-namespace, nonclass, namespace_only */
6066 return lookup_name_real (name
, 1, 1, 1);
6070 lookup_name (name
, prefer_type
)
6074 return lookup_name_real (name
, prefer_type
, 0, 0);
6077 /* Similar to `lookup_name' but look only in the innermost non-class
6081 lookup_name_current_level (name
)
6084 struct binding_level
*b
;
6087 b
= current_binding_level
;
6088 while (b
->parm_flag
== 2)
6093 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6095 /* extern "C" function() */
6096 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6099 else if (IDENTIFIER_BINDING (name
)
6100 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6104 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6105 return IDENTIFIER_VALUE (name
);
6117 /* Like lookup_name_current_level, but for types. */
6120 lookup_type_current_level (name
)
6123 register tree t
= NULL_TREE
;
6125 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6127 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6128 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6130 struct binding_level
*b
= current_binding_level
;
6133 if (purpose_member (name
, b
->type_shadowed
))
6134 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6146 begin_only_namespace_names ()
6148 only_namespace_names
= 1;
6152 end_only_namespace_names ()
6154 only_namespace_names
= 0;
6157 /* Push the declarations of builtin types into the namespace.
6158 RID_INDEX is the index of the builtin type
6159 in the array RID_POINTERS. NAME is the name used when looking
6160 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6163 record_builtin_type (rid_index
, name
, type
)
6168 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6169 tree tdecl
= NULL_TREE
;
6171 if ((int) rid_index
< (int) RID_MAX
)
6172 rname
= ridpointers
[(int) rid_index
];
6174 tname
= get_identifier (name
);
6176 TYPE_BUILT_IN (type
) = 1;
6180 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6181 set_identifier_type_value (tname
, NULL_TREE
);
6182 if ((int) rid_index
< (int) RID_MAX
)
6183 /* Built-in types live in the global namespace. */
6184 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6186 if (rname
!= NULL_TREE
)
6188 if (tname
!= NULL_TREE
)
6190 set_identifier_type_value (rname
, NULL_TREE
);
6191 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6195 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6196 set_identifier_type_value (rname
, NULL_TREE
);
6201 /* Record one of the standard Java types.
6202 * Declare it as having the given NAME.
6203 * If SIZE > 0, it is the size of one of the integral types;
6204 * otherwise it is the negative of the size of one of the other types. */
6207 record_builtin_java_type (name
, size
)
6213 type
= make_signed_type (size
);
6214 else if (size
> -32)
6215 { /* "__java_char" or ""__java_boolean". */
6216 type
= make_unsigned_type (-size
);
6217 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6220 { /* "__java_float" or ""__java_double". */
6221 type
= make_node (REAL_TYPE
);
6222 TYPE_PRECISION (type
) = - size
;
6225 record_builtin_type (RID_MAX
, name
, type
);
6226 decl
= TYPE_NAME (type
);
6228 /* Suppress generate debug symbol entries for these types,
6229 since for normal C++ they are just clutter.
6230 However, push_lang_context undoes this if extern "Java" is seen. */
6231 DECL_IGNORED_P (decl
) = 1;
6233 TYPE_FOR_JAVA (type
) = 1;
6237 /* Push a type into the namespace so that the back-ends ignore it. */
6240 record_unknown_type (type
, name
)
6244 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6245 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6246 DECL_IGNORED_P (decl
) = 1;
6247 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6248 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6249 TYPE_ALIGN (type
) = 1;
6250 TYPE_USER_ALIGN (type
) = 0;
6251 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6254 /* An string for which we should create an IDENTIFIER_NODE at
6257 typedef struct predefined_identifier
6259 /* The name of the identifier. */
6261 /* The place where the IDENTIFIER_NODE should be stored. */
6263 /* Non-zero if this is the name of a constructor or destructor. */
6265 } predefined_identifier
;
6267 /* Create all the predefined identifiers. */
6270 initialize_predefined_identifiers ()
6272 struct predefined_identifier
*pid
;
6274 /* A table of identifiers to create at startup. */
6275 static predefined_identifier predefined_identifiers
[] = {
6276 { "C++", &lang_name_cplusplus
, 0 },
6277 { "C", &lang_name_c
, 0 },
6278 { "Java", &lang_name_java
, 0 },
6279 { CTOR_NAME
, &ctor_identifier
, 1 },
6280 { "__base_ctor", &base_ctor_identifier
, 1 },
6281 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6282 { DTOR_NAME
, &dtor_identifier
, 1 },
6283 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6284 { "__base_dtor", &base_dtor_identifier
, 1 },
6285 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6286 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6287 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6288 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6289 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6290 { "nelts", &nelts_identifier
, 0 },
6291 { THIS_NAME
, &this_identifier
, 0 },
6292 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6293 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6294 { "_vptr", &vptr_identifier
, 0 },
6295 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6296 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6297 { "std", &std_identifier
, 0 },
6301 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6303 *pid
->node
= get_identifier (pid
->name
);
6304 if (pid
->ctor_or_dtor_p
)
6305 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6309 /* Create the predefined scalar types of C,
6310 and some nodes representing standard constants (0, 1, (void *)0).
6311 Initialize the global binding level.
6312 Make definitions for built-in primitive functions. */
6315 init_decl_processing ()
6318 int wchar_type_size
;
6319 tree array_domain_type
;
6321 /* Check to see that the user did not specify an invalid combination
6322 of command-line options. */
6323 if (flag_new_abi
&& !flag_vtable_thunks
)
6324 fatal ("the new ABI requires vtable thunks");
6326 /* Create all the identifiers we need. */
6327 initialize_predefined_identifiers ();
6329 /* Fill in back-end hooks. */
6330 init_lang_status
= &push_cp_function_context
;
6331 free_lang_status
= &pop_cp_function_context
;
6332 mark_lang_status
= &mark_cp_function_context
;
6333 lang_safe_from_p
= &c_safe_from_p
;
6339 /* Create the global variables. */
6340 push_to_top_level ();
6342 /* Enter the global namespace. */
6343 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6344 push_namespace (get_identifier ("::"));
6345 global_namespace
= current_namespace
;
6346 current_lang_name
= NULL_TREE
;
6348 /* Adjust various flags based on command-line settings. */
6349 if (! flag_permissive
&& ! pedantic
)
6350 flag_pedantic_errors
= 1;
6351 if (!flag_no_inline
)
6352 flag_inline_trees
= 1;
6355 current_lang_name
= lang_name_c
;
6357 current_function_decl
= NULL_TREE
;
6358 current_binding_level
= NULL_BINDING_LEVEL
;
6359 free_binding_level
= NULL_BINDING_LEVEL
;
6361 build_common_tree_nodes (flag_signed_char
);
6363 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6364 TREE_TYPE (error_mark_list
) = error_mark_node
;
6366 /* Make the binding_level structure for global names. */
6368 global_binding_level
= current_binding_level
;
6369 /* The global level is the namespace level of ::. */
6370 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6371 declare_namespace_level ();
6373 /* Create the `std' namespace. */
6376 push_namespace (std_identifier
);
6377 std_node
= current_namespace
;
6379 fake_std_node
= error_mark_node
;
6383 fake_std_node
= build_decl (NAMESPACE_DECL
,
6386 pushdecl (fake_std_node
);
6389 /* Define `int' and `char' first so that dbx will output them first. */
6390 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6391 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6393 /* `signed' is the same as `int' */
6394 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6395 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6396 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6397 record_builtin_type (RID_MAX
, "long unsigned int",
6398 long_unsigned_type_node
);
6399 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6400 record_builtin_type (RID_MAX
, "long long int",
6401 long_long_integer_type_node
);
6402 record_builtin_type (RID_MAX
, "long long unsigned int",
6403 long_long_unsigned_type_node
);
6404 record_builtin_type (RID_MAX
, "long long unsigned",
6405 long_long_unsigned_type_node
);
6406 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6407 record_builtin_type (RID_MAX
, "short unsigned int",
6408 short_unsigned_type_node
);
6409 record_builtin_type (RID_MAX
, "unsigned short",
6410 short_unsigned_type_node
);
6413 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6414 unsigned_ptrdiff_type_node
= unsigned_type (ptrdiff_type_node
);
6416 /* Define both `signed char' and `unsigned char'. */
6417 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6418 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6420 /* `unsigned long' is the standard type for sizeof.
6421 Note that stddef.h uses `unsigned long',
6422 and this must agree, even if long and int are the same size. */
6424 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
)));
6425 signed_size_type_node
= signed_type (c_size_type_node
);
6426 set_sizetype (c_size_type_node
);
6428 /* Create the widest literal types. */
6429 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6430 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6431 widest_integer_literal_type_node
));
6433 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6434 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6435 widest_unsigned_literal_type_node
));
6437 /* These are types that type_for_size and type_for_mode use. */
6438 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6439 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6440 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6441 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6442 #if HOST_BITS_PER_WIDE_INT >= 64
6443 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6445 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6446 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6447 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6448 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6449 #if HOST_BITS_PER_WIDE_INT >= 64
6450 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6453 build_common_tree_nodes_2 (flag_short_double
);
6455 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6456 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6457 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6458 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6459 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6460 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6461 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6462 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6464 integer_two_node
= build_int_2 (2, 0);
6465 TREE_TYPE (integer_two_node
) = integer_type_node
;
6466 integer_three_node
= build_int_2 (3, 0);
6467 TREE_TYPE (integer_three_node
) = integer_type_node
;
6469 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6470 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6471 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6472 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6473 TYPE_PRECISION (boolean_type_node
) = 1;
6474 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6475 boolean_false_node
= build_int_2 (0, 0);
6476 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6477 boolean_true_node
= build_int_2 (1, 0);
6478 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6480 signed_size_zero_node
= build_int_2 (0, 0);
6481 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6482 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6483 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6485 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6486 complex_integer_type_node
));
6487 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6488 complex_float_type_node
));
6489 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6490 complex_double_type_node
));
6491 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6492 complex_long_double_type_node
));
6494 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6496 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6497 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6498 TREE_PARMLIST (void_list_node
) = 1;
6500 string_type_node
= build_pointer_type (char_type_node
);
6501 const_string_type_node
6502 = build_pointer_type (build_qualified_type (char_type_node
,
6504 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6506 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6509 /* Make a type to be the domain of a few array types
6510 whose domains don't really matter.
6511 200 is small enough that it always fits in size_t. */
6512 array_domain_type
= build_index_type (build_int_2 (200, 0));
6514 /* Make a type for arrays of characters.
6515 With luck nothing will ever really depend on the length of this
6517 char_array_type_node
6518 = build_array_type (char_type_node
, array_domain_type
);
6520 /* Likewise for arrays of ints. */
6522 = build_array_type (integer_type_node
, array_domain_type
);
6525 delta_type_node
= ptrdiff_type_node
;
6526 else if (flag_huge_objects
)
6527 delta_type_node
= long_integer_type_node
;
6529 delta_type_node
= short_integer_type_node
;
6532 vtable_index_type
= ptrdiff_type_node
;
6534 vtable_index_type
= delta_type_node
;
6536 default_function_type
6537 = build_function_type (integer_type_node
, NULL_TREE
);
6539 ptr_type_node
= build_pointer_type (void_type_node
);
6541 = build_pointer_type (build_qualified_type (void_type_node
,
6543 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6544 c_common_nodes_and_builtins ();
6545 lang_type_promotes_to
= convert_type_from_ellipsis
;
6548 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6550 #ifdef MD_INIT_BUILTINS
6554 /* C++ extensions */
6556 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6557 record_unknown_type (unknown_type_node
, "unknown type");
6559 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6560 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6562 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6564 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6566 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6567 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6569 /* This is special for C++ so functions can be overloaded. */
6570 wchar_type_node
= get_identifier (flag_short_wchar
6571 ? "short unsigned int"
6573 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6574 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6575 if (TREE_UNSIGNED (wchar_type_node
))
6576 wchar_type_node
= make_signed_type (wchar_type_size
);
6578 wchar_type_node
= make_unsigned_type (wchar_type_size
);
6579 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
6581 /* This is for wide string constants. */
6582 wchar_array_type_node
6583 = build_array_type (wchar_type_node
, array_domain_type
);
6586 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WINT_TYPE
)));
6589 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (INTMAX_TYPE
)));
6591 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (UINTMAX_TYPE
)));
6593 if (flag_vtable_thunks
)
6595 /* Make sure we get a unique function type, so we can give
6596 its pointer type a name. (This wins for gdb.) */
6597 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6598 TREE_TYPE (vfunc_type
) = integer_type_node
;
6599 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6600 layout_type (vfunc_type
);
6602 vtable_entry_type
= build_pointer_type (vfunc_type
);
6606 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6607 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6609 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6611 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6613 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6616 /* Make this part of an invisible union. */
6617 fields
[3] = copy_node (fields
[2]);
6618 TREE_TYPE (fields
[3]) = delta_type_node
;
6619 DECL_NAME (fields
[3]) = delta2_identifier
;
6620 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6621 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6622 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6623 TREE_UNSIGNED (fields
[3]) = 0;
6624 TREE_CHAIN (fields
[2]) = fields
[3];
6625 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6628 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6631 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6632 layout_type (vtbl_type_node
);
6633 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6634 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6635 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6636 layout_type (vtbl_ptr_type_node
);
6637 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6641 push_namespace (get_identifier ("__cxxabiv1"));
6642 abi_node
= current_namespace
;
6646 global_type_node
= make_node (LANG_TYPE
);
6647 record_unknown_type (global_type_node
, "global type");
6650 current_lang_name
= lang_name_cplusplus
;
6653 tree bad_alloc_type_node
, newtype
, deltype
;
6655 push_namespace (std_identifier
);
6656 bad_alloc_type_node
= xref_tag
6657 (class_type_node
, get_identifier ("bad_alloc"), 1);
6660 newtype
= build_exception_variant
6661 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6662 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6663 push_cp_library_fn (NEW_EXPR
, newtype
);
6664 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6665 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6666 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6670 = build_library_fn_ptr ("__pure_virtual", void_ftype
);
6672 /* Perform other language dependent initializations. */
6673 init_class_processing ();
6674 init_init_processing ();
6675 init_search_processing ();
6676 init_rtti_processing ();
6678 if (flag_exceptions
)
6679 init_exception_processing ();
6682 flag_inline_functions
= 0;
6685 if (! supports_one_only ())
6688 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6689 function_id_node
= get_identifier ("__FUNCTION__");
6690 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6691 func_id_node
= get_identifier ("__func__");
6693 make_fname_decl
= cp_make_fname_decl
;
6694 declare_function_name ();
6696 /* Prepare to check format strings against argument lists. */
6697 init_function_format_info ();
6699 /* Show we use EH for cleanups. */
6700 using_eh_for_cleanups ();
6702 valid_lang_attribute
= cp_valid_lang_attribute
;
6704 /* Maintain consistency. Perhaps we should just complain if they
6705 say -fwritable-strings? */
6706 if (flag_writable_strings
)
6707 flag_const_strings
= 0;
6709 /* Add GC roots for all of our global variables. */
6710 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6711 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6712 ggc_add_tree_root (&integer_three_node
, 1);
6713 ggc_add_tree_root (&integer_two_node
, 1);
6714 ggc_add_tree_root (&signed_size_zero_node
, 1);
6715 ggc_add_tree_root (&size_one_node
, 1);
6716 ggc_add_tree_root (&size_zero_node
, 1);
6717 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6718 mark_binding_level
);
6719 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6720 ggc_add_tree_root (&static_ctors
, 1);
6721 ggc_add_tree_root (&static_dtors
, 1);
6722 ggc_add_tree_root (&lastiddecl
, 1);
6724 ggc_add_tree_root (&last_function_parm_tags
, 1);
6725 ggc_add_tree_root (¤t_function_return_value
, 1);
6726 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6727 ggc_add_tree_root (&last_function_parms
, 1);
6728 ggc_add_tree_root (&error_mark_list
, 1);
6730 ggc_add_tree_root (&global_namespace
, 1);
6731 ggc_add_tree_root (&global_type_node
, 1);
6732 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6734 ggc_add_tree_root (&got_object
, 1);
6735 ggc_add_tree_root (&got_scope
, 1);
6737 ggc_add_tree_root (¤t_lang_name
, 1);
6738 ggc_add_tree_root (&static_aggregates
, 1);
6741 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6742 decl, NAME is the initialization string and TYPE_DEP indicates whether
6743 NAME depended on the type of the function. We make use of that to detect
6744 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6745 the function before emitting any of it, we don't need to treat the
6746 VAR_DECL specially. We can decide whether to emit it later, if it was
6750 cp_make_fname_decl (id
, name
, type_dep
)
6755 tree decl
, type
, init
;
6756 size_t length
= strlen (name
);
6757 tree domain
= NULL_TREE
;
6759 if (!processing_template_decl
)
6762 domain
= build_index_type (build_int_2 (length
, 0));
6764 type
= build_cplus_array_type
6765 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6768 decl
= build_decl (VAR_DECL
, id
, type
);
6769 TREE_STATIC (decl
) = 1;
6770 TREE_READONLY (decl
) = 1;
6771 DECL_SOURCE_LINE (decl
) = 0;
6772 DECL_ARTIFICIAL (decl
) = 1;
6773 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6775 if (processing_template_decl
)
6776 decl
= push_template_decl (decl
);
6779 init
= build (FUNCTION_NAME
, type
);
6780 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6784 init
= build_string (length
+ 1, name
);
6785 TREE_TYPE (init
) = type
;
6787 DECL_INITIAL (decl
) = init
;
6788 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6790 /* We will have to make sure we only emit this, if it is actually used. */
6794 /* Entry point for the benefit of c_common_nodes_and_builtins.
6796 Make a definition for a builtin function named NAME and whose data type
6797 is TYPE. TYPE should be a function type with argument types.
6799 CLASS and CODE tell later passes how to compile calls to this function.
6800 See tree.h for possible values.
6802 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6803 the name to be called if we can't opencode the function. */
6806 builtin_function (name
, type
, code
, class, libname
)
6810 enum built_in_class
class;
6811 const char *libname
;
6813 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6814 DECL_BUILT_IN_CLASS (decl
) = class;
6815 DECL_FUNCTION_CODE (decl
) = code
;
6817 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6819 /* All builtins that don't begin with an `_' should go in the `std'
6821 if (flag_honor_std
&& name
[0] != '_')
6823 push_namespace (std_identifier
);
6824 DECL_CONTEXT (decl
) = std_node
;
6827 if (flag_honor_std
&& name
[0] != '_')
6830 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6831 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6832 function in the namespace. */
6834 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6835 make_function_rtl (decl
);
6837 /* Warn if a function in the namespace for users
6838 is used without an occasion to consider it declared. */
6839 if (name
[0] != '_' || name
[1] != '_')
6840 DECL_ANTICIPATED (decl
) = 1;
6845 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6846 function. Not called directly. */
6849 build_library_fn_1 (name
, operator_code
, type
)
6851 enum tree_code operator_code
;
6854 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6855 DECL_EXTERNAL (fn
) = 1;
6856 TREE_PUBLIC (fn
) = 1;
6857 DECL_ARTIFICIAL (fn
) = 1;
6858 TREE_NOTHROW (fn
) = 1;
6859 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6863 /* Returns the _DECL for a library function with C linkage.
6864 We assume that such functions never throw; if this is incorrect,
6865 callers should unset TREE_NOTHROW. */
6868 build_library_fn (name
, type
)
6872 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6873 make_function_rtl (fn
);
6877 /* Returns the _DECL for a library function with C++ linkage. */
6880 build_cp_library_fn (name
, operator_code
, type
)
6882 enum tree_code operator_code
;
6885 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6886 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6887 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6888 set_mangled_name_for_decl (fn
);
6889 make_function_rtl (fn
);
6893 /* Like build_library_fn, but takes a C string instead of an
6897 build_library_fn_ptr (name
, type
)
6901 return build_library_fn (get_identifier (name
), type
);
6904 /* Like build_cp_library_fn, but takes a C string instead of an
6908 build_cp_library_fn_ptr (name
, type
)
6912 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6915 /* Like build_library_fn, but also pushes the function so that we will
6916 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6919 push_library_fn (name
, type
)
6922 tree fn
= build_library_fn (name
, type
);
6923 pushdecl_top_level (fn
);
6927 /* Like build_cp_library_fn, but also pushes the function so that it
6928 will be found by normal lookup. */
6931 push_cp_library_fn (operator_code
, type
)
6932 enum tree_code operator_code
;
6935 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6942 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6946 push_void_library_fn (name
, parmtypes
)
6947 tree name
, parmtypes
;
6949 tree type
= build_function_type (void_type_node
, parmtypes
);
6950 return push_library_fn (name
, type
);
6953 /* Like push_library_fn, but also note that this function throws
6954 and does not return. Used for __throw_foo and the like. */
6957 push_throw_library_fn (name
, type
)
6960 tree fn
= push_library_fn (name
, type
);
6961 TREE_THIS_VOLATILE (fn
) = 1;
6962 TREE_NOTHROW (fn
) = 0;
6966 /* When we call finish_struct for an anonymous union, we create
6967 default copy constructors and such. But, an anonymous union
6968 shouldn't have such things; this function undoes the damage to the
6969 anonymous union type T.
6971 (The reason that we create the synthesized methods is that we don't
6972 distinguish `union { int i; }' from `typedef union { int i; } U'.
6973 The first is an anonymous union; the second is just an ordinary
6977 fixup_anonymous_aggr (t
)
6982 /* Wipe out memory of synthesized methods */
6983 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6984 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6985 TYPE_HAS_INIT_REF (t
) = 0;
6986 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6987 TYPE_HAS_ASSIGN_REF (t
) = 0;
6988 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6990 /* Splice the implicitly generated functions out of the TYPE_METHODS
6992 q
= &TYPE_METHODS (t
);
6995 if (DECL_ARTIFICIAL (*q
))
6996 *q
= TREE_CHAIN (*q
);
6998 q
= &TREE_CHAIN (*q
);
7001 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
7002 if (TYPE_METHODS (t
))
7003 error ("an anonymous union cannot have function members");
7006 /* Make sure that a declaration with no declarator is well-formed, i.e.
7007 just defines a tagged type or anonymous union.
7009 Returns the type defined, if any. */
7012 check_tag_decl (declspecs
)
7017 tree ob_modifier
= NULL_TREE
;
7019 register tree t
= NULL_TREE
;
7021 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
7023 register tree value
= TREE_VALUE (link
);
7026 || (TREE_CODE (value
) == IDENTIFIER_NODE
7027 && IDENTIFIER_GLOBAL_VALUE (value
)
7028 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
7032 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
7033 || TREE_CODE (value
) == ENUMERAL_TYPE
)
7035 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
7039 else if (value
== ridpointers
[(int) RID_FRIEND
])
7041 if (current_class_type
== NULL_TREE
7042 || current_scope () != current_class_type
)
7043 ob_modifier
= value
;
7047 else if (value
== ridpointers
[(int) RID_STATIC
]
7048 || value
== ridpointers
[(int) RID_EXTERN
]
7049 || value
== ridpointers
[(int) RID_AUTO
]
7050 || value
== ridpointers
[(int) RID_REGISTER
]
7051 || value
== ridpointers
[(int) RID_INLINE
]
7052 || value
== ridpointers
[(int) RID_VIRTUAL
]
7053 || value
== ridpointers
[(int) RID_CONST
]
7054 || value
== ridpointers
[(int) RID_VOLATILE
]
7055 || value
== ridpointers
[(int) RID_EXPLICIT
])
7056 ob_modifier
= value
;
7060 error ("multiple types in one declaration");
7062 if (t
== NULL_TREE
&& ! saw_friend
)
7063 pedwarn ("declaration does not declare anything");
7065 /* Check for an anonymous union. We're careful
7066 accessing TYPE_IDENTIFIER because some built-in types, like
7067 pointer-to-member types, do not have TYPE_NAME. */
7068 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
7070 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
7072 /* Anonymous unions are objects, so they can have specifiers. */;
7073 SET_ANON_AGGR_TYPE_P (t
);
7075 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7076 pedwarn ("ISO C++ prohibits anonymous structs");
7079 else if (ob_modifier
)
7081 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7082 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7083 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7084 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7085 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7086 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7087 cp_error ("`%D' can only be specified for constructors",
7090 cp_error ("`%D' can only be specified for objects and functions",
7097 /* Called when a declaration is seen that contains no names to declare.
7098 If its type is a reference to a structure, union or enum inherited
7099 from a containing scope, shadow that tag name for the current scope
7100 with a forward reference.
7101 If its type defines a new named structure or union
7102 or defines an enum, it is valid but we need not do anything here.
7103 Otherwise, it is an error.
7105 C++: may have to grok the declspecs to learn about static,
7106 complain for anonymous unions. */
7109 shadow_tag (declspecs
)
7112 tree t
= check_tag_decl (declspecs
);
7115 maybe_process_partial_specialization (t
);
7117 /* This is where the variables in an anonymous union are
7118 declared. An anonymous union declaration looks like:
7120 because there is no declarator after the union, the parser
7121 sends that declaration here. */
7122 if (t
&& ANON_AGGR_TYPE_P (t
))
7124 fixup_anonymous_aggr (t
);
7126 if (TYPE_FIELDS (t
))
7128 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7130 finish_anon_union (decl
);
7135 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7138 groktypename (typename
)
7141 if (TREE_CODE (typename
) != TREE_LIST
)
7143 return grokdeclarator (TREE_VALUE (typename
),
7144 TREE_PURPOSE (typename
),
7145 TYPENAME
, 0, NULL_TREE
);
7148 /* Decode a declarator in an ordinary declaration or data definition.
7149 This is called as soon as the type information and variable name
7150 have been parsed, before parsing the initializer if any.
7151 Here we create the ..._DECL node, fill in its type,
7152 and put it on the list of decls for the current context.
7153 The ..._DECL node is returned as the value.
7155 Exception: for arrays where the length is not specified,
7156 the type is left null, to be filled in by `cp_finish_decl'.
7158 Function definitions do not come here; they go to start_function
7159 instead. However, external and forward declarations of functions
7160 do go through here. Structure field declarations are done by
7161 grokfield and not through here. */
7164 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7165 tree declarator
, declspecs
;
7167 tree attributes
, prefix_attributes
;
7170 register tree type
, tem
;
7172 extern int have_extern_spec
;
7173 extern int used_extern_spec
;
7177 /* See code below that used this. */
7178 int init_written
= initialized
;
7181 /* This should only be done once on the top most decl. */
7182 if (have_extern_spec
&& !used_extern_spec
)
7184 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7186 used_extern_spec
= 1;
7189 if (attributes
|| prefix_attributes
)
7190 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7192 attrlist
= NULL_TREE
;
7194 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7197 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7200 type
= TREE_TYPE (decl
);
7202 if (type
== error_mark_node
)
7205 context
= DECL_CONTEXT (decl
);
7207 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7208 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7210 /* When parsing the initializer, lookup should use the object's
7212 push_decl_namespace (context
);
7215 /* We are only interested in class contexts, later. */
7216 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7217 context
= NULL_TREE
;
7220 /* Is it valid for this decl to have an initializer at all?
7221 If not, set INITIALIZED to zero, which will indirectly
7222 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7223 switch (TREE_CODE (decl
))
7226 /* typedef foo = bar means give foo the same type as bar.
7227 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7228 Any other case of an initialization in a TYPE_DECL is an error. */
7229 if (pedantic
|| list_length (declspecs
) > 1)
7231 cp_error ("typedef `%D' is initialized", decl
);
7237 cp_error ("function `%#D' is initialized like a variable", decl
);
7247 if (! toplevel_bindings_p ()
7248 && DECL_EXTERNAL (decl
))
7249 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7251 DECL_EXTERNAL (decl
) = 0;
7252 if (toplevel_bindings_p ())
7253 TREE_STATIC (decl
) = 1;
7255 /* Tell `pushdecl' this is an initialized decl
7256 even though we don't yet have the initializer expression.
7257 Also tell `cp_finish_decl' it may store the real initializer. */
7258 DECL_INITIAL (decl
) = error_mark_node
;
7261 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7262 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7265 /* Set attributes here so if duplicate decl, will have proper attributes. */
7266 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7268 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7270 push_nested_class (context
, 2);
7272 if (TREE_CODE (decl
) == VAR_DECL
)
7274 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7275 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7276 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7279 if (DECL_CONTEXT (field
) != context
)
7281 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7282 DECL_CONTEXT (field
), DECL_NAME (decl
),
7283 context
, DECL_NAME (decl
));
7284 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7286 /* Static data member are tricky; an in-class initialization
7287 still doesn't provide a definition, so the in-class
7288 declaration will have DECL_EXTERNAL set, but will have an
7289 initialization. Thus, duplicate_decls won't warn
7290 about this situation, and so we check here. */
7291 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7292 cp_error ("duplicate initialization of %D", decl
);
7293 if (duplicate_decls (decl
, field
))
7299 tree field
= check_classfn (context
, decl
);
7300 if (field
&& duplicate_decls (decl
, field
))
7304 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7305 DECL_IN_AGGR_P (decl
) = 0;
7306 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7307 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7309 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7310 /* [temp.expl.spec] An explicit specialization of a static data
7311 member of a template is a definition if the declaration
7312 includes an initializer; otherwise, it is a declaration.
7314 We check for processing_specialization so this only applies
7315 to the new specialization syntax. */
7316 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7317 DECL_EXTERNAL (decl
) = 1;
7320 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7321 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7325 /* Enter this declaration into the symbol table. */
7326 tem
= maybe_push_decl (decl
);
7328 if (processing_template_decl
)
7329 tem
= push_template_decl (tem
);
7331 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7332 /* Tell the back-end to use or not use .common as appropriate. If we say
7333 -fconserve-space, we want this to save .data space, at the expense of
7334 wrong semantics. If we say -fno-conserve-space, we want this to
7335 produce errors about redefs; to do this we force variables into the
7337 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7340 if (! processing_template_decl
)
7350 tree type
= TREE_TYPE (decl
);
7351 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7353 if (type
== error_mark_node
)
7356 /* If this type of object needs a cleanup, but we're not allowed to
7357 add any more objects with cleanups to the current scope, create a
7358 new binding level. */
7359 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7360 && current_binding_level
->more_cleanups_ok
== 0)
7362 keep_next_level (2);
7365 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7369 /* Is it valid for this decl to have an initializer at all?
7370 If not, set INITIALIZED to zero, which will indirectly
7371 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7373 /* Don't allow initializations for incomplete types except for
7374 arrays which might be completed by the initialization. */
7375 if (COMPLETE_TYPE_P (complete_type (type
)))
7376 ; /* A complete type is ok. */
7377 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7379 cp_error ("variable `%#D' has initializer but incomplete type",
7382 type
= TREE_TYPE (decl
) = error_mark_node
;
7384 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7386 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7387 cp_error ("elements of array `%#D' have incomplete type", decl
);
7388 /* else we already gave an error in start_decl. */
7394 && TREE_CODE (decl
) != TYPE_DECL
7395 && TREE_CODE (decl
) != TEMPLATE_DECL
7396 && type
!= error_mark_node
7397 && IS_AGGR_TYPE (type
)
7398 && ! DECL_EXTERNAL (decl
))
7400 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7401 && !COMPLETE_TYPE_P (complete_type (type
)))
7403 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7405 /* Change the type so that assemble_variable will give
7406 DECL an rtl we can live with: (mem (const_int 0)). */
7407 type
= TREE_TYPE (decl
) = error_mark_node
;
7411 /* If any base type in the hierarchy of TYPE needs a constructor,
7412 then we set initialized to 1. This way any nodes which are
7413 created for the purposes of initializing this aggregate
7414 will live as long as it does. This is necessary for global
7415 aggregates which do not have their initializers processed until
7416 the end of the file. */
7417 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7422 DECL_INITIAL (decl
) = NULL_TREE
;
7425 /* Handle initialization of references.
7426 These three arguments are from `cp_finish_decl', and have the
7427 same meaning here that they do there.
7429 Quotes on semantics can be found in ARM 8.4.3. */
7432 grok_reference_init (decl
, type
, init
)
7433 tree decl
, type
, init
;
7437 if (init
== NULL_TREE
)
7439 if ((DECL_LANG_SPECIFIC (decl
) == 0
7440 || DECL_IN_AGGR_P (decl
) == 0)
7441 && ! DECL_THIS_EXTERN (decl
))
7442 cp_error ("`%D' declared as reference but not initialized", decl
);
7446 if (init
== error_mark_node
)
7449 if (TREE_CODE (init
) == CONSTRUCTOR
)
7451 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7455 if (TREE_CODE (init
) == TREE_LIST
)
7456 init
= build_compound_expr (init
);
7458 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7459 init
= convert_from_reference (init
);
7461 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7462 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7464 /* Note: default conversion is only called in very special cases. */
7465 init
= default_conversion (init
);
7468 /* Convert INIT to the reference type TYPE. This may involve the
7469 creation of a temporary, whose lifetime must be the same as that
7470 of the reference. If so, a DECL_STMT for the temporary will be
7471 added just after the DECL_STMT for DECL. That's why we don't set
7472 DECL_INITIAL for local references (instead assigning to them
7473 explicitly); we need to allow the temporary to be initialized
7475 tmp
= convert_to_reference
7476 (type
, init
, CONV_IMPLICIT
,
7477 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7480 if (tmp
== error_mark_node
)
7482 else if (tmp
!= NULL_TREE
)
7485 tmp
= save_expr (tmp
);
7486 if (building_stmt_tree ())
7488 /* Initialize the declaration. */
7489 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7490 finish_expr_stmt (tmp
);
7493 DECL_INITIAL (decl
) = tmp
;
7497 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7501 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7503 expand_static_init (decl
, DECL_INITIAL (decl
));
7504 DECL_INITIAL (decl
) = NULL_TREE
;
7509 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7510 mucking with forces it does not comprehend (i.e. initialization with a
7511 constructor). If we are at global scope and won't go into COMMON, fill
7512 it in with a dummy CONSTRUCTOR to force the variable into .data;
7513 otherwise we can use error_mark_node. */
7516 obscure_complex_init (decl
, init
)
7519 if (! flag_no_inline
&& TREE_STATIC (decl
))
7521 if (extract_init (decl
, init
))
7525 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7526 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7527 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7531 DECL_INITIAL (decl
) = error_mark_node
;
7536 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7537 array until we finish parsing the initializer. If that's the
7538 situation we're in, update DECL accordingly. */
7541 maybe_deduce_size_from_array_init (decl
, init
)
7545 tree type
= TREE_TYPE (decl
);
7547 if (TREE_CODE (type
) == ARRAY_TYPE
7548 && TYPE_DOMAIN (type
) == NULL_TREE
7549 && TREE_CODE (decl
) != TYPE_DECL
)
7551 /* do_default is really a C-ism to deal with tentative definitions.
7552 But let's leave it here to ease the eventual merge. */
7553 int do_default
= !DECL_EXTERNAL (decl
);
7554 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7555 int failure
= complete_array_type (type
, initializer
, do_default
);
7558 cp_error ("initializer fails to determine size of `%D'", decl
);
7563 cp_error ("array size missing in `%D'", decl
);
7564 /* If a `static' var's size isn't known, make it extern as
7565 well as static, so it does not get allocated. If it's not
7566 `static', then don't mark it extern; finish_incomplete_decl
7567 will give it a default size and it will get allocated. */
7568 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7569 DECL_EXTERNAL (decl
) = 1;
7572 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7573 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7575 cp_error ("zero-size array `%D'", decl
);
7577 layout_decl (decl
, 0);
7581 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7582 any appropriate error messages regarding the layout. */
7585 layout_var_decl (decl
)
7588 tree type
= TREE_TYPE (decl
);
7590 tree ttype
= target_type (type
);
7593 /* If we haven't already layed out this declaration, do so now.
7594 Note that we must not call complete type for an external object
7595 because it's type might involve templates that we are not
7596 supposed to isntantiate yet. (And it's perfectly legal to say
7597 `extern X x' for some incomplete type `X'.) */
7598 if (!DECL_EXTERNAL (decl
))
7599 complete_type (type
);
7600 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7601 layout_decl (decl
, 0);
7603 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7605 /* An automatic variable with an incomplete type: that is an error.
7606 Don't talk about array types here, since we took care of that
7607 message in grokdeclarator. */
7608 cp_error ("storage size of `%D' isn't known", decl
);
7609 TREE_TYPE (decl
) = error_mark_node
;
7612 /* Keep this code around in case we later want to control debug info
7613 based on whether a type is "used". (jason 1999-11-11) */
7615 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7616 /* Let debugger know it should output info for this type. */
7617 note_debug_info_needed (ttype
);
7619 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7620 note_debug_info_needed (DECL_CONTEXT (decl
));
7623 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7624 && DECL_SIZE (decl
) != NULL_TREE
7625 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7627 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7628 constant_expression_warning (DECL_SIZE (decl
));
7630 cp_error ("storage size of `%D' isn't constant", decl
);
7634 /* If a local static variable is declared in an inline function, or if
7635 we have a weak definition, we must endeavor to create only one
7636 instance of the variable at link-time. */
7639 maybe_commonize_var (decl
)
7642 /* Static data in a function with comdat linkage also has comdat
7644 if (TREE_STATIC (decl
)
7645 /* Don't mess with __FUNCTION__. */
7646 && ! DECL_ARTIFICIAL (decl
)
7647 && current_function_decl
7648 && DECL_CONTEXT (decl
) == current_function_decl
7649 && (DECL_THIS_INLINE (current_function_decl
)
7650 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7651 && TREE_PUBLIC (current_function_decl
))
7653 /* Rather than try to get this right with inlining, we suppress
7654 inlining of such functions. */
7655 current_function_cannot_inline
7656 = "function with static variable cannot be inline";
7658 /* If flag_weak, we don't need to mess with this, as we can just
7659 make the function weak, and let it refer to its unique local
7660 copy. This works because we don't allow the function to be
7664 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7666 TREE_PUBLIC (decl
) = 1;
7667 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7669 else if (DECL_INITIAL (decl
) == NULL_TREE
7670 || DECL_INITIAL (decl
) == error_mark_node
)
7672 TREE_PUBLIC (decl
) = 1;
7673 DECL_COMMON (decl
) = 1;
7675 /* else we lose. We can only do this if we can use common,
7676 which we can't if it has been initialized. */
7678 if (TREE_PUBLIC (decl
))
7679 DECL_ASSEMBLER_NAME (decl
)
7680 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7683 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7684 cp_warning_at (" you can work around this by removing the initializer", decl
);
7688 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7689 /* Set it up again; we might have set DECL_INITIAL since the last
7691 comdat_linkage (decl
);
7694 /* Issue an error message if DECL is an uninitialized const variable. */
7697 check_for_uninitialized_const_var (decl
)
7700 tree type
= TREE_TYPE (decl
);
7702 /* ``Unless explicitly declared extern, a const object does not have
7703 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7705 if (TREE_CODE (decl
) == VAR_DECL
7706 && TREE_CODE (type
) != REFERENCE_TYPE
7707 && CP_TYPE_CONST_P (type
)
7708 && !TYPE_NEEDS_CONSTRUCTING (type
)
7709 && !DECL_INITIAL (decl
))
7710 cp_error ("uninitialized const `%D'", decl
);
7713 /* Verify INIT (the initializer for DECL), and record the
7714 initialization in DECL_INITIAL, if appropriate. Returns a new
7718 check_initializer (decl
, init
)
7724 if (TREE_CODE (decl
) == FIELD_DECL
)
7727 type
= TREE_TYPE (decl
);
7729 /* If `start_decl' didn't like having an initialization, ignore it now. */
7730 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7733 /* Check the initializer. */
7736 /* Things that are going to be initialized need to have complete
7738 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7740 if (type
== error_mark_node
)
7741 /* We will have already complained. */
7743 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7745 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7748 else if (TREE_CODE (type
) == ARRAY_TYPE
7749 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7751 cp_error ("elements of array `%#D' have incomplete type", decl
);
7754 else if (!COMPLETE_TYPE_P (type
))
7756 cp_error ("`%D' has incomplete type", decl
);
7757 TREE_TYPE (decl
) = error_mark_node
;
7762 if (TREE_CODE (decl
) == CONST_DECL
)
7764 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7766 DECL_INITIAL (decl
) = init
;
7768 /* This will keep us from needing to worry about our obstacks. */
7769 my_friendly_assert (init
!= NULL_TREE
, 149);
7772 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7774 if (TREE_STATIC (decl
))
7775 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7776 grok_reference_init (decl
, type
, init
);
7781 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7783 if (TREE_CODE (type
) == ARRAY_TYPE
)
7784 init
= digest_init (type
, init
, (tree
*) 0);
7785 else if (TREE_CODE (init
) == CONSTRUCTOR
7786 && TREE_HAS_CONSTRUCTOR (init
))
7788 if (TYPE_NON_AGGREGATE_CLASS (type
))
7790 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7792 init
= error_mark_node
;
7795 goto dont_use_constructor
;
7800 dont_use_constructor
:
7801 if (TREE_CODE (init
) != TREE_VEC
)
7802 init
= store_init_value (decl
, init
);
7806 /* We must hide the initializer so that expand_decl
7807 won't try to do something it does not understand. */
7808 init
= obscure_complex_init (decl
, init
);
7810 else if (DECL_EXTERNAL (decl
))
7812 else if (TYPE_P (type
)
7813 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7815 tree core_type
= strip_array_types (type
);
7817 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7819 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7820 cp_error ("structure `%D' with uninitialized const members", decl
);
7821 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7822 cp_error ("structure `%D' with uninitialized reference members",
7826 check_for_uninitialized_const_var (decl
);
7828 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7829 init
= obscure_complex_init (decl
, NULL_TREE
);
7833 check_for_uninitialized_const_var (decl
);
7838 /* If DECL is not a local variable, give it RTL. */
7841 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7844 const char *asmspec
;
7846 int toplev
= toplevel_bindings_p ();
7849 /* Handle non-variables up front. */
7850 if (TREE_CODE (decl
) != VAR_DECL
)
7852 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7856 /* If we see a class member here, it should be a static data
7858 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7860 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7861 /* An in-class declaration of a static data member should be
7862 external; it is only a declaration, and not a definition. */
7863 if (init
== NULL_TREE
)
7864 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7867 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7869 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7871 /* We don't create any RTL for local variables. */
7872 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7875 /* We defer emission of local statics until the corresponding
7876 DECL_STMT is expanded. */
7877 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7879 /* We try to defer namespace-scope static constants so that they are
7880 not emitted into the object file unncessarily. */
7881 if (!DECL_VIRTUAL_P (decl
)
7882 && TREE_READONLY (decl
)
7883 && DECL_INITIAL (decl
) != NULL_TREE
7884 && DECL_INITIAL (decl
) != error_mark_node
7885 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7887 && !TREE_PUBLIC (decl
))
7889 /* Fool with the linkage according to #pragma interface. */
7890 if (!interface_unknown
)
7892 TREE_PUBLIC (decl
) = 1;
7893 DECL_EXTERNAL (decl
) = interface_only
;
7899 /* If we're deferring the variable, just make RTL. Do not actually
7900 emit the variable. */
7902 make_decl_rtl (decl
, asmspec
, toplev
);
7903 /* If we're not deferring, go ahead and assemble the variable. */
7905 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7908 /* The old ARM scoping rules injected variables declared in the
7909 initialization statement of a for-statement into the surrounding
7910 scope. We support this usage, in order to be backward-compatible.
7911 DECL is a just-declared VAR_DECL; if necessary inject its
7912 declaration into the surrounding scope. */
7915 maybe_inject_for_scope_var (decl
)
7918 if (!DECL_NAME (decl
))
7921 if (current_binding_level
->is_for_scope
)
7923 struct binding_level
*outer
7924 = current_binding_level
->level_chain
;
7926 /* Check to see if the same name is already bound at the outer
7927 level, either because it was directly declared, or because a
7928 dead for-decl got preserved. In either case, the code would
7929 not have been valid under the ARM scope rules, so clear
7930 is_for_scope for the current_binding_level.
7932 Otherwise, we need to preserve the temp slot for decl to last
7933 into the outer binding level. */
7936 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7938 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7939 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7941 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7943 BINDING_VALUE (outer_binding
)
7944 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7945 current_binding_level
->is_for_scope
= 0;
7947 else if (DECL_IN_MEMORY_P (decl
))
7948 preserve_temp_slots (DECL_RTL (decl
));
7952 /* Generate code to initialize DECL (a local variable). */
7955 initialize_local_var (decl
, init
, flags
)
7960 tree type
= TREE_TYPE (decl
);
7962 /* If the type is bogus, don't bother initializing the variable. */
7963 if (type
== error_mark_node
)
7966 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7968 /* If we used it already as memory, it must stay in memory. */
7969 DECL_INITIAL (decl
) = NULL_TREE
;
7970 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7973 /* Local statics are handled differently from ordinary automatic
7975 if (TREE_STATIC (decl
))
7977 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7978 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7979 expand_static_init (decl
, init
);
7983 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7987 /* Compute and store the initial value. */
7988 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7990 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7992 int saved_stmts_are_full_exprs_p
;
7994 my_friendly_assert (building_stmt_tree (), 20000906);
7995 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7996 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7997 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7998 current_stmt_tree ()->stmts_are_full_exprs_p
=
7999 saved_stmts_are_full_exprs_p
;
8002 /* Set this to 0 so we can tell whether an aggregate which was
8003 initialized was ever used. Don't do this if it has a
8004 destructor, so we don't complain about the 'resource
8005 allocation is initialization' idiom. Now set
8006 attribute((unused)) on types so decls of that type will be
8007 marked used. (see TREE_USED, above.) */
8008 if (TYPE_NEEDS_CONSTRUCTING (type
)
8010 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
8011 && DECL_NAME (decl
))
8012 TREE_USED (decl
) = 0;
8013 else if (already_used
)
8014 TREE_USED (decl
) = 1;
8018 /* Generate code to destroy DECL (a local variable). */
8021 destroy_local_var (decl
)
8024 tree type
= TREE_TYPE (decl
);
8027 /* Only variables get cleaned up. */
8028 if (TREE_CODE (decl
) != VAR_DECL
)
8031 /* And only things with destructors need cleaning up. */
8032 if (type
== error_mark_node
8033 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
8036 if (TREE_CODE (decl
) == VAR_DECL
&&
8037 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
8038 /* We don't clean up things that aren't defined in this
8039 translation unit, or that need a static cleanup. The latter
8040 are handled by finish_file. */
8043 /* Compute the cleanup. */
8044 cleanup
= maybe_build_cleanup (decl
);
8046 /* Record the cleanup required for this declaration. */
8047 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
8049 finish_decl_cleanup (decl
, cleanup
);
8052 /* Finish processing of a declaration;
8053 install its line number and initial value.
8054 If the length of an array type is not known before,
8055 it must be determined now, from the initial value, or it is an error.
8057 INIT holds the value of an initializer that should be allowed to escape
8060 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8061 if the (init) syntax was used. */
8064 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8070 tree ttype
= NULL_TREE
;
8071 const char *asmspec
= NULL
;
8072 int was_readonly
= 0;
8077 error ("assignment (not initialization) in declaration");
8081 /* If a name was specified, get the string. */
8083 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8085 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8087 cp_error ("cannot initialize `%D' to namespace `%D'",
8092 if (current_class_type
8093 && CP_DECL_CONTEXT (decl
) == current_class_type
8094 && TYPE_BEING_DEFINED (current_class_type
)
8095 && (DECL_INITIAL (decl
) || init
))
8096 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
8098 if (TREE_CODE (decl
) == VAR_DECL
8099 && DECL_CONTEXT (decl
)
8100 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8101 && DECL_CONTEXT (decl
) != current_namespace
8104 /* Leave the namespace of the object. */
8105 pop_decl_namespace ();
8108 type
= TREE_TYPE (decl
);
8110 if (type
== error_mark_node
)
8113 /* Add this declaration to the statement-tree. */
8114 if (building_stmt_tree ()
8115 && at_function_scope_p ()
8116 && TREE_CODE (decl
) != RESULT_DECL
)
8117 add_decl_stmt (decl
);
8119 if (TYPE_HAS_MUTABLE_P (type
))
8120 TREE_READONLY (decl
) = 0;
8122 if (processing_template_decl
)
8124 if (init
&& DECL_INITIAL (decl
))
8125 DECL_INITIAL (decl
) = init
;
8129 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8130 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8132 /* Take care of TYPE_DECLs up front. */
8133 if (TREE_CODE (decl
) == TYPE_DECL
)
8135 if (init
&& DECL_INITIAL (decl
))
8137 /* typedef foo = bar; store the type of bar as the type of foo. */
8138 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
8139 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8141 if (type
!= error_mark_node
8142 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8144 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8145 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8146 set_identifier_type_value (DECL_NAME (decl
), type
);
8147 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8149 GNU_xref_decl (current_function_decl
, decl
);
8151 /* If we have installed this as the canonical typedef for this
8152 type, and that type has not been defined yet, delay emitting
8153 the debug information for it, as we will emit it later. */
8154 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8155 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8156 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8158 rest_of_decl_compilation (decl
, NULL_PTR
,
8159 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8163 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8164 ttype
= target_type (type
);
8166 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8167 && TYPE_NEEDS_CONSTRUCTING (type
))
8169 /* Currently, GNU C++ puts constants in text space, making them
8170 impossible to initialize. In the future, one would hope for
8171 an operating system which understood the difference between
8172 initialization and the running of a program. */
8174 TREE_READONLY (decl
) = 0;
8177 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8179 /* This must override the asm specifier which was placed by
8180 grokclassfn. Lay this out fresh. */
8181 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8182 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8183 make_decl_rtl (decl
, asmspec
, 0);
8186 /* Deduce size of array from initialization, if not already known. */
8187 maybe_deduce_size_from_array_init (decl
, init
);
8188 init
= check_initializer (decl
, init
);
8190 GNU_xref_decl (current_function_decl
, decl
);
8192 if (TREE_CODE (decl
) == VAR_DECL
)
8193 layout_var_decl (decl
);
8195 /* Output the assembler code and/or RTL code for variables and functions,
8196 unless the type is an undefined structure or union.
8197 If not, it will get done when the type is completed. */
8198 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8199 || TREE_CODE (decl
) == RESULT_DECL
)
8201 if (TREE_CODE (decl
) == VAR_DECL
)
8202 maybe_commonize_var (decl
);
8204 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8206 if (TREE_CODE (type
) == FUNCTION_TYPE
8207 || TREE_CODE (type
) == METHOD_TYPE
)
8208 abstract_virtuals_error (decl
,
8209 strip_array_types (TREE_TYPE (type
)));
8211 abstract_virtuals_error (decl
, strip_array_types (type
));
8213 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8215 else if (DECL_EXTERNAL (decl
)
8216 && ! (DECL_LANG_SPECIFIC (decl
)
8217 && DECL_NOT_REALLY_EXTERN (decl
)))
8220 DECL_INITIAL (decl
) = init
;
8222 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8224 /* This is a local declaration. */
8225 if (doing_semantic_analysis_p ())
8226 maybe_inject_for_scope_var (decl
);
8227 /* Initialize the local variable. But, if we're building a
8228 statement-tree, we'll do the initialization when we
8230 if (processing_template_decl
)
8232 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8233 DECL_INITIAL (decl
) = init
;
8237 /* If we're not building RTL, then we need to do so
8239 my_friendly_assert (building_stmt_tree (), 20000906);
8240 /* Initialize the variable. */
8241 initialize_local_var (decl
, init
, flags
);
8242 /* Clean up the variable. */
8243 destroy_local_var (decl
);
8246 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8248 /* Cleanups for static variables are handled by `finish_file'. */
8249 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8250 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8251 expand_static_init (decl
, init
);
8255 /* Undo call to `pushclass' that was done in `start_decl'
8256 due to initialization of qualified member variable.
8257 I.e., Foo::x = 10; */
8259 tree context
= CP_DECL_CONTEXT (decl
);
8262 && (TREE_CODE (decl
) == VAR_DECL
8263 /* We also have a pushclass done that we need to undo here
8264 if we're at top level and declare a method. */
8265 || TREE_CODE (decl
) == FUNCTION_DECL
)
8266 /* If size hasn't been set, we're still defining it,
8267 and therefore inside the class body; don't pop
8268 the binding level.. */
8269 && COMPLETE_TYPE_P (context
)
8270 && context
== current_class_type
)
8271 pop_nested_class ();
8278 TREE_READONLY (decl
) = 1;
8281 /* This is here for a midend callback from c-common.c */
8284 finish_decl (decl
, init
, asmspec_tree
)
8288 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8291 /* Returns a declaration for a VAR_DECL as if:
8293 extern "C" TYPE NAME;
8295 had been seen. Used to create compiler-generated global
8299 declare_global_var (name
, type
)
8305 push_to_top_level ();
8306 decl
= build_decl (VAR_DECL
, name
, type
);
8307 TREE_PUBLIC (decl
) = 1;
8308 DECL_EXTERNAL (decl
) = 1;
8309 DECL_ARTIFICIAL (decl
) = 1;
8311 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8312 pop_from_top_level ();
8317 /* Returns a pointer to the `atexit' function. Note that if
8318 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8319 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8333 if (flag_use_cxa_atexit
)
8335 /* The declaration for `__cxa_atexit' is:
8337 int __cxa_atexit (void (*)(void *), void *, void *)
8339 We build up the argument types and then then function type
8342 /* First, build the pointer-to-function type for the first
8344 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8345 fn_type
= build_function_type (void_type_node
, arg_types
);
8346 fn_ptr_type
= build_pointer_type (fn_type
);
8347 /* Then, build the rest of the argument types. */
8348 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8349 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8350 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8351 /* And the final __cxa_atexit type. */
8352 fn_type
= build_function_type (integer_type_node
, arg_types
);
8353 fn_ptr_type
= build_pointer_type (fn_type
);
8354 name
= "__cxa_atexit";
8358 /* The declaration for `atexit' is:
8360 int atexit (void (*)());
8362 We build up the argument types and then then function type
8364 fn_type
= build_function_type (void_type_node
, void_list_node
);
8365 fn_ptr_type
= build_pointer_type (fn_type
);
8366 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8367 /* Build the final atexit type. */
8368 fn_type
= build_function_type (integer_type_node
, arg_types
);
8372 /* Now, build the function declaration. */
8373 push_lang_context (lang_name_c
);
8374 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8375 mark_used (atexit_fndecl
);
8376 pop_lang_context ();
8377 atexit_node
= default_conversion (atexit_fndecl
);
8382 /* Returns the __dso_handle VAR_DECL. */
8385 get_dso_handle_node ()
8387 if (dso_handle_node
)
8388 return dso_handle_node
;
8390 /* Declare the variable. */
8391 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8394 return dso_handle_node
;
8397 /* Begin a new function with internal linkage whose job will be simply
8398 to destroy some particular variable. */
8403 static int counter
= 0;
8404 int old_interface_unknown
= interface_unknown
;
8410 push_to_top_level ();
8412 /* No need to mangle this. */
8413 push_lang_context (lang_name_c
);
8415 interface_unknown
= 1;
8417 /* Build the parameter-types. */
8418 parmtypes
= void_list_node
;
8419 /* Functions passed to __cxa_atexit take an additional parameter.
8420 We'll just ignore it. After we implement the new calling
8421 convention for destructors, we can eliminate the use of
8422 additional cleanup functions entirely in the -fnew-abi case. */
8423 if (flag_use_cxa_atexit
)
8424 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8425 /* Build the function type itself. */
8426 fntype
= build_function_type (void_type_node
, parmtypes
);
8427 /* Build the name of the function. */
8428 sprintf (name
, "__tcf_%d", counter
++);
8429 /* Build the function declaration. */
8430 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8431 /* It's a function with internal linkage, generated by the
8433 TREE_PUBLIC (fndecl
) = 0;
8434 DECL_ARTIFICIAL (fndecl
) = 1;
8435 /* Make the function `inline' so that it is only emitted if it is
8436 actually needed. It is unlikely that it will be inlined, since
8437 it is only called via a function pointer, but we avoid unncessary
8438 emissions this way. */
8439 DECL_INLINE (fndecl
) = 1;
8440 /* Build the parameter. */
8441 if (flag_use_cxa_atexit
)
8445 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8446 DECL_CONTEXT (parmdecl
) = fndecl
;
8447 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8448 TREE_USED (parmdecl
) = 1;
8449 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8453 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8456 interface_unknown
= old_interface_unknown
;
8458 pop_lang_context ();
8460 return current_function_decl
;
8463 /* Finish the cleanup function begun by start_cleanup_fn. */
8470 expand_body (finish_function (0));
8472 pop_from_top_level ();
8475 /* Generate code to handle the destruction of DECL, an object with
8476 static storage duration. */
8479 register_dtor_fn (decl
)
8487 int saved_flag_access_control
;
8489 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8492 /* Call build_cleanup before we enter the anonymous function so that
8493 any access checks will be done relative to the current scope,
8494 rather than the scope of the anonymous function. */
8495 build_cleanup (decl
);
8497 /* Now start the function. */
8498 cleanup
= start_cleanup_fn ();
8500 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8501 to the original function, rather than the anonymous one. That
8502 will make the back-end think that nested functions are in use,
8503 which causes confusion. */
8504 saved_flag_access_control
= flag_access_control
;
8505 flag_access_control
= 0;
8506 fcall
= build_cleanup (decl
);
8507 flag_access_control
= saved_flag_access_control
;
8509 /* Create the body of the anonymous function. */
8510 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8511 finish_expr_stmt (fcall
);
8512 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8515 /* Call atexit with the cleanup function. */
8516 mark_addressable (cleanup
);
8517 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8518 if (flag_use_cxa_atexit
)
8520 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8521 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8522 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8525 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8526 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8530 expand_static_init (decl
, init
)
8534 tree oldstatic
= value_member (decl
, static_aggregates
);
8538 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8539 cp_error ("multiple initializations given for `%D'", decl
);
8541 else if (! toplevel_bindings_p ())
8543 /* Emit code to perform this initialization but once. */
8550 /* Emit code to perform this initialization but once. This code
8553 static int guard = 0;
8555 // Do initialization.
8557 // Register variable for destruction at end of program.
8560 Note that the `temp' variable is only set to 1 *after* the
8561 initialization is complete. This ensures that an exception,
8562 thrown during the construction, will cause the variable to
8563 reinitialized when we pass through this code again, as per:
8567 If the initialization exits by throwing an exception, the
8568 initialization is not complete, so it will be tried again
8569 the next time control enters the declaration.
8571 In theory, this process should be thread-safe, too; multiple
8572 threads should not be able to initialize the variable more
8573 than once. We don't yet attempt to ensure thread-safety. */
8575 /* Create the guard variable. */
8576 guard
= get_guard (decl
);
8578 /* Begin the conditional initialization. */
8579 if_stmt
= begin_if_stmt ();
8580 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8581 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8583 /* Do the initialization itself. */
8584 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8585 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8586 assignment
= build_aggr_init (decl
, init
, 0);
8588 /* The initialization we're doing here is just a bitwise
8590 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8592 assignment
= NULL_TREE
;
8594 /* Once the assignment is complete, set TEMP to 1. Since the
8595 construction of the static object is complete at this point,
8596 we want to make sure TEMP is set to 1 even if a temporary
8597 constructed during the initialization throws an exception
8598 when it is destroyed. So, we combine the initialization and
8599 the assignment to TEMP into a single expression, ensuring
8600 that when we call finish_expr_stmt the cleanups will not be
8601 run until after TEMP is set to 1. */
8602 guard_init
= set_guard (guard
);
8605 assignment
= tree_cons (NULL_TREE
, assignment
,
8606 build_tree_list (NULL_TREE
,
8608 assignment
= build_compound_expr (assignment
);
8611 assignment
= guard_init
;
8612 finish_expr_stmt (assignment
);
8614 /* Use atexit to register a function for destroying this static
8616 register_dtor_fn (decl
);
8618 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8619 finish_then_clause (if_stmt
);
8623 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8626 /* Finish the declaration of a catch-parameter. */
8629 start_handler_parms (declspecs
, declarator
)
8636 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8638 if (decl
== NULL_TREE
)
8639 error ("invalid catch parameter");
8648 /* Make TYPE a complete type based on INITIAL_VALUE.
8649 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8650 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8653 complete_array_type (type
, initial_value
, do_default
)
8654 tree type
, initial_value
;
8657 register tree maxindex
= NULL_TREE
;
8662 /* An array of character type can be initialized from a
8663 brace-enclosed string constant. */
8664 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8665 && TREE_CODE (initial_value
) == CONSTRUCTOR
8666 && CONSTRUCTOR_ELTS (initial_value
)
8667 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8669 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8670 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8672 /* Note MAXINDEX is really the maximum index, one less than the
8674 if (TREE_CODE (initial_value
) == STRING_CST
)
8677 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8678 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8681 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8683 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8685 maxindex
= ssize_int (-1);
8686 for (; elts
; elts
= TREE_CHAIN (elts
))
8688 if (TREE_PURPOSE (elts
))
8689 maxindex
= TREE_PURPOSE (elts
);
8691 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8693 maxindex
= copy_node (maxindex
);
8697 /* Make an error message unless that happened already. */
8698 if (initial_value
!= error_mark_node
)
8701 initial_value
= NULL_TREE
;
8703 /* Prevent further error messages. */
8704 maxindex
= build_int_2 (0, 0);
8711 maxindex
= build_int_2 (0, 0);
8720 domain
= build_index_type (maxindex
);
8721 TYPE_DOMAIN (type
) = domain
;
8723 if (! TREE_TYPE (maxindex
))
8724 TREE_TYPE (maxindex
) = domain
;
8726 itype
= TREE_TYPE (initial_value
);
8729 if (itype
&& !TYPE_DOMAIN (itype
))
8730 TYPE_DOMAIN (itype
) = domain
;
8731 /* The type of the main variant should never be used for arrays
8732 of different sizes. It should only ever be completed with the
8733 size of the array. */
8734 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8735 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8738 /* Lay out the type now that we can get the real answer. */
8745 /* Return zero if something is declared to be a member of type
8746 CTYPE when in the context of CUR_TYPE. STRING is the error
8747 message to print in that case. Otherwise, quietly return 1. */
8750 member_function_or_else (ctype
, cur_type
, flags
)
8751 tree ctype
, cur_type
;
8752 enum overload_flags flags
;
8754 if (ctype
&& ctype
!= cur_type
)
8756 if (flags
== DTOR_FLAG
)
8757 cp_error ("destructor for alien class `%T' cannot be a member",
8760 cp_error ("constructor for alien class `%T' cannot be a member",
8767 /* Subroutine of `grokdeclarator'. */
8769 /* Generate errors possibly applicable for a given set of specifiers.
8770 This is for ARM $7.1.2. */
8773 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8776 int virtualp
, quals
, friendp
, raises
, inlinep
;
8779 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8781 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8783 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8786 cp_error_at ("`%D' declared as a friend", object
);
8788 cp_error_at ("`%D' declared with an exception specification", object
);
8791 /* CTYPE is class type, or null if non-class.
8792 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8794 DECLARATOR is the function's name.
8795 VIRTUALP is truthvalue of whether the function is virtual or not.
8796 FLAGS are to be passed through to `grokclassfn'.
8797 QUALS are qualifiers indicating whether the function is `const'
8799 RAISES is a list of exceptions that this function can raise.
8800 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8801 not look, and -1 if we should not call `grokclassfn' at all.
8803 Returns `NULL_TREE' if something goes wrong, after issuing
8804 applicable error messages. */
8807 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8808 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8809 template_count
, in_namespace
)
8812 tree orig_declarator
;
8814 enum overload_flags flags
;
8816 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8820 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8821 int has_default_arg
= 0;
8825 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8826 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8832 type
= build_exception_variant (type
, raises
);
8835 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8836 /* Propagate volatile out from type to decl. */
8837 if (TYPE_VOLATILE (type
))
8838 TREE_THIS_VOLATILE (decl
) = 1;
8840 /* If this decl has namespace scope, set that up. */
8842 set_decl_namespace (decl
, in_namespace
, friendp
);
8844 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8846 /* `main' and builtins have implicit 'C' linkage. */
8847 if ((MAIN_NAME_P (declarator
)
8848 || (IDENTIFIER_LENGTH (declarator
) > 10
8849 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8850 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8851 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8852 && current_lang_name
== lang_name_cplusplus
8853 && ctype
== NULL_TREE
8854 /* NULL_TREE means global namespace. */
8855 && DECL_CONTEXT (decl
) == NULL_TREE
)
8856 DECL_LANGUAGE (decl
) = lang_c
;
8858 /* Should probably propagate const out from type to decl I bet (mrs). */
8861 DECL_STATIC_FUNCTION_P (decl
) = 1;
8862 DECL_CONTEXT (decl
) = ctype
;
8866 DECL_CONTEXT (decl
) = ctype
;
8868 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8870 if (processing_template_decl
)
8871 error ("cannot declare `::main' to be a template");
8873 error ("cannot declare `::main' to be inline");
8875 error ("cannot declare `::main' to be static");
8876 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8878 error ("`main' must return `int'");
8883 /* Members of anonymous types and local classes have no linkage; make
8885 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8886 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8891 /* [basic.link]: A name with no linkage (notably, the name of a class
8892 or enumeration declared in a local scope) shall not be used to
8893 declare an entity with linkage.
8895 Only check this for public decls for now. */
8896 t
= no_linkage_check (TREE_TYPE (decl
));
8899 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8901 if (DECL_EXTERN_C_P (decl
))
8902 /* Allow this; it's pretty common in C. */;
8904 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8908 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8913 TREE_PUBLIC (decl
) = publicp
;
8916 DECL_INTERFACE_KNOWN (decl
) = 1;
8917 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8921 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8923 DECL_EXTERNAL (decl
) = 1;
8924 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8926 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8927 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8931 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8932 grok_op_properties (decl
, virtualp
, check
< 0);
8934 if (ctype
&& decl_function_context (decl
))
8935 DECL_NO_STATIC_CHAIN (decl
) = 1;
8937 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8938 if (TREE_PURPOSE (t
)
8939 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8941 has_default_arg
= 1;
8946 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8950 ("defining explicit specialization `%D' in friend declaration",
8954 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8956 /* Something like `template <class T> friend void f<T>()'. */
8957 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8963 /* A friend declaration of the form friend void f<>(). Record
8964 the information in the TEMPLATE_ID_EXPR. */
8965 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8966 DECL_TEMPLATE_INFO (decl
)
8967 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8968 TREE_OPERAND (orig_declarator
, 1),
8971 if (has_default_arg
)
8973 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8980 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8987 if (has_default_arg
)
8988 add_defarg_fn (decl
);
8990 /* Plain overloading: will not be grok'd by grokclassfn. */
8991 if (! ctype
&& ! processing_template_decl
8992 && !DECL_EXTERN_C_P (decl
)
8993 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8994 set_mangled_name_for_decl (decl
);
8997 /* Make the init_value nonzero so pushdecl knows this is not
8998 tentative. error_mark_node is replaced later with the BLOCK. */
8999 DECL_INITIAL (decl
) = error_mark_node
;
9001 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
9002 TREE_NOTHROW (decl
) = 1;
9004 /* Caller will do the rest of this. */
9008 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
9009 DECL_CONSTRUCTOR_P (decl
) = 1;
9011 /* Function gets the ugly name, field gets the nice one. This call
9012 may change the type of the function (because of default
9014 if (ctype
!= NULL_TREE
)
9015 grokclassfn (ctype
, decl
, flags
, quals
);
9017 decl
= check_explicit_specialization (orig_declarator
, decl
,
9019 2 * (funcdef_flag
!= 0) +
9020 4 * (friendp
!= 0));
9021 if (decl
== error_mark_node
)
9024 if (ctype
!= NULL_TREE
9025 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
9030 old_decl
= check_classfn (ctype
, decl
);
9032 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
9033 /* Because grokfndecl is always supposed to return a
9034 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9035 here. We depend on our callers to figure out that its
9036 really a template that's being returned. */
9037 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
9039 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
9040 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
9042 /* Remove the `this' parm added by grokclassfn.
9043 XXX Isn't this done in start_function, too? */
9044 revert_static_member_fn (decl
);
9045 last_function_parms
= TREE_CHAIN (last_function_parms
);
9047 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
9048 cp_error ("definition of implicitly-declared `%D'", old_decl
);
9052 /* Since we've smashed OLD_DECL to its
9053 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9054 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9055 decl
= DECL_TEMPLATE_RESULT (decl
);
9057 /* Attempt to merge the declarations. This can fail, in
9058 the case of some illegal specialization declarations. */
9059 if (!duplicate_decls (decl
, old_decl
))
9060 cp_error ("no `%#D' member function declared in class `%T'",
9066 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
9069 if (ctype
== NULL_TREE
|| check
)
9074 DECL_VIRTUAL_P (decl
) = 1;
9075 if (DECL_VINDEX (decl
) == NULL_TREE
)
9076 DECL_VINDEX (decl
) = error_mark_node
;
9077 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
9084 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
9087 RID_BIT_TYPE
*specbits_in
;
9093 RID_BIT_TYPE specbits
;
9095 specbits
= *specbits_in
;
9097 if (TREE_CODE (type
) == OFFSET_TYPE
)
9099 /* If you declare a static member so that it
9100 can be initialized, the code will reach here. */
9101 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
9102 type
= TREE_TYPE (type
);
9103 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9104 DECL_CONTEXT (decl
) = basetype
;
9105 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9107 if (!uses_template_parms (decl
))
9110 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9112 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
9121 context
= in_namespace
;
9122 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9123 context
= current_namespace
;
9125 context
= NULL_TREE
;
9127 if (processing_template_decl
&& context
)
9128 /* For global variables, declared in a template, we need the
9130 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9132 decl
= build_decl (VAR_DECL
, declarator
, type
);
9135 set_decl_namespace (decl
, context
, 0);
9137 context
= DECL_CONTEXT (decl
);
9138 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9141 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9143 DECL_ASSEMBLER_NAME (decl
)
9144 = build_static_name (context
, declarator
);
9149 set_decl_namespace (decl
, in_namespace
, 0);
9151 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9153 DECL_THIS_EXTERN (decl
) = 1;
9154 DECL_EXTERNAL (decl
) = !initialized
;
9157 /* In class context, static means one per class,
9158 public access, and static storage. */
9159 if (DECL_CLASS_SCOPE_P (decl
))
9161 TREE_PUBLIC (decl
) = 1;
9162 TREE_STATIC (decl
) = 1;
9163 DECL_EXTERNAL (decl
) = 0;
9165 /* At top level, either `static' or no s.c. makes a definition
9166 (perhaps tentative), and absence of `static' makes it public. */
9167 else if (toplevel_bindings_p ())
9169 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9170 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9171 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9173 /* Not at top level, only `static' makes a static definition. */
9176 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9177 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9180 if (TREE_PUBLIC (decl
))
9182 /* [basic.link]: A name with no linkage (notably, the name of a class
9183 or enumeration declared in a local scope) shall not be used to
9184 declare an entity with linkage.
9186 Only check this for public decls for now. */
9187 tree t
= no_linkage_check (TREE_TYPE (decl
));
9190 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9191 /* Ignore for now; `enum { foo } e' is pretty common. */;
9193 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9201 /* Create and return a canonical pointer to member function type, for
9202 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9205 build_ptrmemfunc_type (type
)
9211 tree unqualified_variant
= NULL_TREE
;
9213 if (type
== error_mark_node
)
9216 /* If a canonical type already exists for this type, use it. We use
9217 this method instead of type_hash_canon, because it only does a
9218 simple equality check on the list of field members. */
9220 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9223 /* Make sure that we always have the unqualified pointer-to-member
9225 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9227 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9229 t
= make_aggr_type (RECORD_TYPE
);
9230 /* Let the front-end know this is a pointer to member function... */
9231 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9232 /* ... and not really an aggregate. */
9233 SET_IS_AGGR_TYPE (t
, 0);
9237 u
= make_aggr_type (UNION_TYPE
);
9238 SET_IS_AGGR_TYPE (u
, 0);
9239 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9240 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9242 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9243 TYPE_NAME (u
) = NULL_TREE
;
9245 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9247 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9249 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9250 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9254 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9255 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9257 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9260 /* Zap out the name so that the back-end will give us the debugging
9261 information for this anonymous RECORD_TYPE. */
9262 TYPE_NAME (t
) = NULL_TREE
;
9264 /* If this is not the unqualified form of this pointer-to-member
9265 type, set the TYPE_MAIN_VARIANT for this type to be the
9266 unqualified type. Since they are actually RECORD_TYPEs that are
9267 not variants of each other, we must do this manually. */
9268 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9270 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9271 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9272 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9273 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9276 /* Cache this pointer-to-member type so that we can find it again
9278 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9280 /* Seems to be wanted. */
9281 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9286 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9287 Check to see that the definition is valid. Issue appropriate error
9288 messages. Return 1 if the definition is particularly bad, or 0
9292 check_static_variable_definition (decl
, type
)
9296 /* Motion 10 at San Diego: If a static const integral data member is
9297 initialized with an integral constant expression, the initializer
9298 may appear either in the declaration (within the class), or in
9299 the definition, but not both. If it appears in the class, the
9300 member is a member constant. The file-scope definition is always
9302 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9304 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9306 /* If we just return the declaration, crashes will sometimes
9307 occur. We therefore return void_type_node, as if this was a
9308 friend declaration, to cause callers to completely ignore
9309 this declaration. */
9312 else if (!CP_TYPE_CONST_P (type
))
9313 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9315 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9316 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9321 /* Given the SIZE (i.e., number of elements) in an array, compute an
9322 appropriate index type for the array. If non-NULL, NAME is the
9323 name of the thing being declared. */
9326 compute_array_index_type (name
, size
)
9332 /* The size might be the result of a cast. */
9333 STRIP_TYPE_NOPS (size
);
9335 /* It might be a const variable or enumeration constant. */
9336 size
= decl_constant_value (size
);
9338 /* If this involves a template parameter, it will be a constant at
9339 instantiation time, but we don't know what the value is yet.
9340 Even if no template parameters are involved, we may an expression
9341 that is not a constant; we don't even simplify `1 + 2' when
9342 processing a template. */
9343 if (processing_template_decl
)
9345 /* Resolve a qualified reference to an enumerator or static
9346 const data member of ours. */
9347 if (TREE_CODE (size
) == SCOPE_REF
9348 && TREE_OPERAND (size
, 0) == current_class_type
)
9350 tree t
= lookup_field (current_class_type
,
9351 TREE_OPERAND (size
, 1), 0, 0);
9356 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9357 size
, integer_one_node
));
9360 /* The array bound must be an integer type. */
9361 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9362 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9363 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9366 cp_error ("size of array `%D' has non-integer type", name
);
9368 cp_error ("size of array has non-integer type");
9369 size
= integer_one_node
;
9372 /* Normally, the array-bound will be a constant. */
9373 if (TREE_CODE (size
) == INTEGER_CST
)
9375 /* Check to see if the array bound overflowed. Make that an
9376 error, no matter how generous we're being. */
9377 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9378 int old_pedantic
= pedantic
;
9379 pedantic
= flag_pedantic_errors
= 1;
9380 constant_expression_warning (size
);
9381 pedantic
= old_pedantic
;
9382 flag_pedantic_errors
= old_flag_pedantic_errors
;
9384 /* An array must have a positive number of elements. */
9385 if (INT_CST_LT (size
, integer_zero_node
))
9388 cp_error ("size of array `%D' is negative", name
);
9390 cp_error ("size of array is negative");
9391 size
= integer_one_node
;
9393 /* Except that an extension we allow zero-sized arrays. We
9394 always allow them in system headers because glibc uses
9396 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9399 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9401 cp_pedwarn ("ISO C++ forbids zero-size array");
9404 else if (TREE_CONSTANT (size
))
9406 /* `(int) &fn' is not a valid array bound. */
9408 cp_error ("size of array `%D' is not an integral constant-expression",
9411 cp_error ("size of array is not an integral constant-expression");
9414 /* Compute the index of the largest element in the array. It is
9415 one less than the number of elements in the array. */
9417 = fold (cp_build_binary_op (MINUS_EXPR
,
9418 cp_convert (ssizetype
, size
),
9419 cp_convert (ssizetype
,
9420 integer_one_node
)));
9422 /* Check for variable-sized arrays. We allow such things as an
9423 extension, even though they are not allowed in ANSI/ISO C++. */
9424 if (!TREE_CONSTANT (itype
))
9429 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9432 cp_pedwarn ("ISO C++ forbids variable-size array");
9435 /* Create a variable-sized array index type. */
9436 itype
= variable_size (itype
);
9438 /* Make sure that there was no overflow when creating to a signed
9439 index type. (For example, on a 32-bit machine, an array with
9440 size 2^32 - 1 is too big.) */
9441 else if (TREE_OVERFLOW (itype
))
9443 error ("overflow in array dimension");
9444 TREE_OVERFLOW (itype
) = 0;
9447 /* Create and return the appropriate index type. */
9448 return build_index_type (itype
);
9451 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9452 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9456 create_array_type_for_decl (name
, type
, size
)
9461 tree itype
= NULL_TREE
;
9462 const char* error_msg
;
9464 /* If things have already gone awry, bail now. */
9465 if (type
== error_mark_node
|| size
== error_mark_node
)
9466 return error_mark_node
;
9468 /* Assume that everything will go OK. */
9471 /* There are some types which cannot be array elements. */
9472 switch (TREE_CODE (type
))
9475 error_msg
= "array of void";
9479 error_msg
= "array of functions";
9482 case REFERENCE_TYPE
:
9483 error_msg
= "array of references";
9487 error_msg
= "array of data members";
9491 error_msg
= "array of function members";
9498 /* If something went wrong, issue an error-message and return. */
9502 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9504 cp_error ("creating %s", error_msg
);
9506 return error_mark_node
;
9511 The constant expressions that specify the bounds of the arrays
9512 can be omitted only for the first member of the sequence. */
9513 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9515 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9518 return error_mark_node
;
9521 /* Figure out the index type for the array. */
9523 itype
= compute_array_index_type (name
, size
);
9525 return build_cplus_array_type (type
, itype
);
9528 /* Check that it's OK to declare a function with the indicated TYPE.
9529 SFK indicates the kind of special function (if any) that this
9530 function is. CTYPE is the class of which this function is a
9531 member. OPTYPE is the type given in a conversion operator
9532 declaration. Returns the actual return type of the function; that
9533 may be different than TYPE if an error occurs, or for certain
9534 special functions. */
9537 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9538 special_function_kind sfk
;
9545 case sfk_constructor
:
9547 cp_error ("return type specification for constructor invalid");
9549 /* In the old ABI, we return `this'; in the new ABI we don't
9551 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9554 case sfk_destructor
:
9556 cp_error ("return type specification for destructor invalid");
9557 type
= void_type_node
;
9560 case sfk_conversion
:
9561 if (type
&& !same_type_p (type
, optype
))
9562 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9564 cp_pedwarn ("return type specified for `operator %T'", optype
);
9569 my_friendly_abort (20000408);
9576 /* Given declspecs and a declarator,
9577 determine the name and type of the object declared
9578 and construct a ..._DECL node for it.
9579 (In one case we can return a ..._TYPE node instead.
9580 For invalid input we sometimes return 0.)
9582 DECLSPECS is a chain of tree_list nodes whose value fields
9583 are the storage classes and type specifiers.
9585 DECL_CONTEXT says which syntactic context this declaration is in:
9586 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9587 FUNCDEF for a function definition. Like NORMAL but a few different
9588 error messages in each case. Return value may be zero meaning
9589 this definition is too screwy to try to parse.
9590 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9591 handle member functions (which have FIELD context).
9592 Return value may be zero meaning this definition is too screwy to
9594 PARM for a parameter declaration (either within a function prototype
9595 or before a function body). Make a PARM_DECL, or return void_type_node.
9596 CATCHPARM for a parameter declaration before a catch clause.
9597 TYPENAME if for a typename (in a cast or sizeof).
9598 Don't make a DECL node; just return the ..._TYPE node.
9599 FIELD for a struct or union field; make a FIELD_DECL.
9600 BITFIELD for a field with specified width.
9601 INITIALIZED is 1 if the decl has an initializer.
9603 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9604 normal attributes in TREE_PURPOSE, or NULL_TREE.
9606 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9607 It may also be so in the PARM case, for a prototype where the
9608 argument type is specified but not the name.
9610 This function is where the complicated C meanings of `static'
9611 and `extern' are interpreted.
9613 For C++, if there is any monkey business to do, the function which
9614 calls this one must do it, i.e., prepending instance variables,
9615 renaming overloaded function names, etc.
9617 Note that for this C++, it is an error to define a method within a class
9618 which does not belong to that class.
9620 Except in the case where SCOPE_REFs are implicitly known (such as
9621 methods within a class being redundantly qualified),
9622 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9623 (class_name::decl_name). The caller must also deal with this.
9625 If a constructor or destructor is seen, and the context is FIELD,
9626 then the type gains the attribute TREE_HAS_x. If such a declaration
9627 is erroneous, NULL_TREE is returned.
9629 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9630 function, these are the qualifiers to give to the `this' pointer. We
9631 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9633 May return void_type_node if the declarator turned out to be a friend.
9634 See grokfield for details. */
9637 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9640 enum decl_context decl_context
;
9644 RID_BIT_TYPE specbits
;
9647 tree type
= NULL_TREE
;
9653 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9654 int explicit_int
= 0;
9655 int explicit_char
= 0;
9656 int defaulted_int
= 0;
9657 tree typedef_decl
= NULL_TREE
;
9659 tree typedef_type
= NULL_TREE
;
9660 int funcdef_flag
= 0;
9661 enum tree_code innermost_code
= ERROR_MARK
;
9664 /* See the code below that used this. */
9665 tree decl_machine_attr
= NULL_TREE
;
9667 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9668 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9669 tree init
= NULL_TREE
;
9671 /* Keep track of what sort of function is being processed
9672 so that we can warn about default return values, or explicit
9673 return values which do not match prescribed defaults. */
9674 special_function_kind sfk
= sfk_none
;
9676 tree dname
= NULL_TREE
;
9677 tree ctype
= current_class_type
;
9678 tree ctor_return_type
= NULL_TREE
;
9679 enum overload_flags flags
= NO_SPECIAL
;
9680 tree quals
= NULL_TREE
;
9681 tree raises
= NULL_TREE
;
9682 int template_count
= 0;
9683 tree in_namespace
= NULL_TREE
;
9687 RIDBIT_RESET_ALL (specbits
);
9688 if (decl_context
== FUNCDEF
)
9689 funcdef_flag
= 1, decl_context
= NORMAL
;
9690 else if (decl_context
== MEMFUNCDEF
)
9691 funcdef_flag
= -1, decl_context
= FIELD
;
9692 else if (decl_context
== BITFIELD
)
9693 bitfield
= 1, decl_context
= FIELD
;
9695 /* Look inside a declarator for the name being declared
9696 and get it as a string, for an error message. */
9698 tree
*next
= &declarator
;
9702 while (next
&& *next
)
9705 switch (TREE_CODE (decl
))
9708 /* For attributes. */
9709 next
= &TREE_VALUE (decl
);
9714 next
= &TREE_OPERAND (decl
, 0);
9717 case BIT_NOT_EXPR
: /* For C++ destructors! */
9719 tree name
= TREE_OPERAND (decl
, 0);
9720 tree rename
= NULL_TREE
;
9722 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9724 sfk
= sfk_destructor
;
9725 if (TREE_CODE (name
) == TYPE_DECL
)
9726 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9727 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9728 if (ctype
== NULL_TREE
)
9730 if (current_class_type
== NULL_TREE
)
9732 error ("destructors must be member functions");
9737 tree t
= constructor_name (current_class_name
);
9744 tree t
= constructor_name (ctype
);
9751 cp_error ("destructor `%T' must match class name `%T'",
9753 TREE_OPERAND (decl
, 0) = rename
;
9759 case ADDR_EXPR
: /* C++ reference declaration */
9764 innermost_code
= TREE_CODE (decl
);
9765 next
= &TREE_OPERAND (decl
, 0);
9769 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9771 /* This is actually a variable declaration using
9772 constructor syntax. We need to call start_decl and
9773 cp_finish_decl so we can get the variable
9776 tree attributes
, prefix_attributes
;
9778 *next
= TREE_OPERAND (decl
, 0);
9779 init
= CALL_DECLARATOR_PARMS (decl
);
9783 attributes
= TREE_PURPOSE (attrlist
);
9784 prefix_attributes
= TREE_VALUE (attrlist
);
9788 attributes
= NULL_TREE
;
9789 prefix_attributes
= NULL_TREE
;
9792 decl
= start_decl (declarator
, declspecs
, 1,
9793 attributes
, prefix_attributes
);
9794 decl_type_access_control (decl
);
9797 /* Look for __unused__ attribute */
9798 if (TREE_USED (TREE_TYPE (decl
)))
9799 TREE_USED (decl
) = 1;
9800 finish_decl (decl
, init
, NULL_TREE
);
9803 cp_error ("invalid declarator");
9806 innermost_code
= TREE_CODE (decl
);
9807 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9808 ctype
= current_class_type
;
9810 && TREE_OPERAND (decl
, 0)
9811 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9812 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9813 == constructor_name_full (ctype
))
9814 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9815 == constructor_name (ctype
)))))
9816 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9817 next
= &TREE_OPERAND (decl
, 0);
9819 if (ctype
!= NULL_TREE
9820 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9821 && decl
== constructor_name (ctype
))
9823 sfk
= sfk_constructor
;
9824 ctor_return_type
= ctype
;
9829 case TEMPLATE_ID_EXPR
:
9831 tree fns
= TREE_OPERAND (decl
, 0);
9833 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9834 fns
= TREE_OPERAND (fns
, 0);
9837 if (TREE_CODE (dname
) == COMPONENT_REF
)
9838 dname
= TREE_OPERAND (dname
, 1);
9839 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9841 my_friendly_assert (is_overloaded_fn (dname
),
9843 dname
= DECL_NAME (get_first_fn (dname
));
9848 case IDENTIFIER_NODE
:
9849 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9854 if (C_IS_RESERVED_WORD (dname
))
9856 cp_error ("declarator-id missing; using reserved word `%D'",
9858 name
= IDENTIFIER_POINTER (dname
);
9860 else if (!IDENTIFIER_TYPENAME_P (dname
))
9861 name
= IDENTIFIER_POINTER (dname
);
9864 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9865 flags
= TYPENAME_FLAG
;
9866 ctor_return_type
= TREE_TYPE (dname
);
9867 sfk
= sfk_conversion
;
9868 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9869 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9871 name
= IDENTIFIER_POINTER (dname
);
9873 name
= "<invalid operator>";
9880 /* Perform error checking, and decide on a ctype. */
9881 tree cname
= TREE_OPERAND (decl
, 0);
9882 if (cname
== NULL_TREE
)
9884 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9887 in_namespace
= TREE_OPERAND (decl
, 0);
9888 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9890 else if (! is_aggr_type (cname
, 1))
9891 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9892 /* Must test TREE_OPERAND (decl, 1), in case user gives
9893 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9894 else if (TREE_OPERAND (decl
, 1)
9895 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9897 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9898 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9900 cp_error ("`%T::%D' is not a valid declarator", cname
,
9901 TREE_OPERAND (decl
, 1));
9902 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9903 cname
, TREE_OPERAND (decl
, 1));
9904 return void_type_node
;
9906 else if (ctype
== NULL_TREE
)
9908 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9909 TREE_OPERAND (decl
, 0) = ctype
;
9912 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9914 cp_error ("type `%T' is not derived from type `%T'",
9916 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9922 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9923 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9924 == constructor_name_full (ctype
))
9925 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9926 == constructor_name (ctype
))))
9927 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9928 next
= &TREE_OPERAND (decl
, 1);
9932 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9933 && constructor_name (ctype
) == decl
)
9935 sfk
= sfk_constructor
;
9936 ctor_return_type
= ctype
;
9938 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9939 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9940 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9941 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9943 sfk
= sfk_destructor
;
9944 ctor_return_type
= ctype
;
9946 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9947 next
= &TREE_OPERAND (decl
, 0);
9958 /* Parse error puts this typespec where
9959 a declarator should go. */
9960 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9961 if (TREE_TYPE (decl
) == current_class_type
)
9962 cp_error (" perhaps you want `%T' for a constructor",
9963 current_class_name
);
9964 dname
= DECL_NAME (decl
);
9965 name
= IDENTIFIER_POINTER (dname
);
9967 /* Avoid giving two errors for this. */
9968 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9970 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9976 cp_compiler_error ("`%D' as declarator", decl
);
9977 return 0; /* We used to do a 155 abort here. */
9982 /* A function definition's declarator must have the form of
9983 a function declarator. */
9985 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9988 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9989 && innermost_code
!= CALL_EXPR
9990 && ! (ctype
&& declspecs
== NULL_TREE
))
9992 cp_error ("declaration of `%D' as non-function", dname
);
9993 return void_type_node
;
9996 /* Anything declared one level down from the top level
9997 must be one of the parameters of a function
9998 (because the body is at least two levels down). */
10000 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
10001 by not allowing C++ class definitions to specify their parameters
10002 with xdecls (must be spec.d in the parmlist).
10004 Since we now wait to push a class scope until we are sure that
10005 we are in a legitimate method context, we must set oldcname
10006 explicitly (since current_class_name is not yet alive).
10008 We also want to avoid calling this a PARM if it is in a namespace. */
10010 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
10012 struct binding_level
*b
= current_binding_level
;
10013 current_binding_level
= b
->level_chain
;
10014 if (current_binding_level
!= 0 && toplevel_bindings_p ())
10015 decl_context
= PARM
;
10016 current_binding_level
= b
;
10020 name
= decl_context
== PARM
? "parameter" : "type name";
10022 /* Look through the decl specs and record which ones appear.
10023 Some typespecs are defined as built-in typenames.
10024 Others, the ones that are modifiers of other types,
10025 are represented by bits in SPECBITS: set the bits for
10026 the modifiers that appear. Storage class keywords are also in SPECBITS.
10028 If there is a typedef name or a type, store the type in TYPE.
10029 This includes builtin typedefs such as `int'.
10031 Set EXPLICIT_INT if the type is `int' or `char' and did not
10032 come from a user typedef.
10034 Set LONGLONG if `long' is mentioned twice.
10036 For C++, constructors and destructors have their own fast treatment. */
10038 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
10043 /* Certain parse errors slip through. For example,
10044 `int class;' is not caught by the parser. Try
10045 weakly to recover here. */
10046 if (TREE_CODE (spec
) != TREE_LIST
)
10049 id
= TREE_VALUE (spec
);
10051 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10053 if (id
== ridpointers
[(int) RID_INT
]
10054 || id
== ridpointers
[(int) RID_CHAR
]
10055 || id
== ridpointers
[(int) RID_BOOL
]
10056 || id
== ridpointers
[(int) RID_WCHAR
])
10060 if (id
== ridpointers
[(int) RID_BOOL
])
10061 error ("`bool' is now a keyword");
10063 cp_error ("extraneous `%T' ignored", id
);
10067 if (id
== ridpointers
[(int) RID_INT
])
10069 else if (id
== ridpointers
[(int) RID_CHAR
])
10071 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
10075 /* C++ aggregate types. */
10076 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
10079 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
10081 type
= IDENTIFIER_TYPE_VALUE (id
);
10085 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10087 if (ridpointers
[i
] == id
)
10089 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10091 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10092 pedwarn ("ISO C++ does not support `long long'");
10094 error ("`long long long' is too long for GCC");
10098 else if (RIDBIT_SETP (i
, specbits
))
10099 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10100 RIDBIT_SET (i
, specbits
);
10105 /* C++ aggregate types. */
10106 else if (TREE_CODE (id
) == TYPE_DECL
)
10109 cp_error ("multiple declarations `%T' and `%T'", type
,
10113 type
= TREE_TYPE (id
);
10114 TREE_VALUE (spec
) = type
;
10119 error ("two or more data types in declaration of `%s'", name
);
10120 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10122 register tree t
= lookup_name (id
, 1);
10123 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10124 error ("`%s' fails to be a typedef or built in type",
10125 IDENTIFIER_POINTER (id
));
10128 type
= TREE_TYPE (t
);
10130 /* See the code below that used this. */
10131 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
10136 else if (id
!= error_mark_node
)
10137 /* Can't change CLASS nodes into RECORD nodes here! */
10143 typedef_type
= type
;
10145 /* No type at all: default to `int', and set DEFAULTED_INT
10146 because it was not a user-defined typedef. */
10148 if (type
== NULL_TREE
10149 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10150 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10151 || RIDBIT_SETP (RID_LONG
, specbits
)
10152 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10154 /* These imply 'int'. */
10155 type
= integer_type_node
;
10159 if (sfk
!= sfk_none
)
10160 type
= check_special_function_return_type (sfk
, type
,
10163 else if (type
== NULL_TREE
)
10169 /* We handle `main' specially here, because 'main () { }' is so
10170 common. With no options, it is allowed. With -Wreturn-type,
10171 it is a warning. It is only an error with -pedantic-errors. */
10172 is_main
= (funcdef_flag
10173 && MAIN_NAME_P (dname
)
10174 && ctype
== NULL_TREE
10175 && in_namespace
== NULL_TREE
10176 && current_namespace
== global_namespace
);
10178 if (in_system_header
|| flag_ms_extensions
)
10179 /* Allow it, sigh. */;
10180 else if (pedantic
|| ! is_main
)
10181 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10183 else if (warn_return_type
)
10184 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10187 type
= integer_type_node
;
10192 /* Now process the modifiers that were specified
10193 and check for invalid combinations. */
10195 /* Long double is a special combination. */
10197 if (RIDBIT_SETP (RID_LONG
, specbits
)
10198 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10200 RIDBIT_RESET (RID_LONG
, specbits
);
10201 type
= build_qualified_type (long_double_type_node
,
10202 CP_TYPE_QUALS (type
));
10205 /* Check all other uses of type modifiers. */
10207 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10208 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10209 || RIDBIT_SETP (RID_LONG
, specbits
)
10210 || RIDBIT_SETP (RID_SHORT
, specbits
))
10214 if (TREE_CODE (type
) == REAL_TYPE
)
10215 error ("short, signed or unsigned invalid for `%s'", name
);
10216 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10217 error ("long, short, signed or unsigned invalid for `%s'", name
);
10218 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10219 && RIDBIT_SETP (RID_SHORT
, specbits
))
10220 error ("long and short specified together for `%s'", name
);
10221 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10222 || RIDBIT_SETP (RID_SHORT
, specbits
))
10224 error ("long or short specified with char for `%s'", name
);
10225 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10226 || RIDBIT_SETP (RID_SHORT
, specbits
))
10227 && TREE_CODE (type
) == REAL_TYPE
)
10228 error ("long or short specified with floating type for `%s'", name
);
10229 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10230 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10231 error ("signed and unsigned given together for `%s'", name
);
10235 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10237 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10239 if (flag_pedantic_errors
)
10244 /* Discard the type modifiers if they are invalid. */
10247 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10248 RIDBIT_RESET (RID_SIGNED
, specbits
);
10249 RIDBIT_RESET (RID_LONG
, specbits
);
10250 RIDBIT_RESET (RID_SHORT
, specbits
);
10255 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10256 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10258 error ("complex invalid for `%s'", name
);
10259 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10262 /* Decide whether an integer type is signed or not.
10263 Optionally treat bitfields as signed by default. */
10264 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10267 It is implementation-defined whether a plain (neither
10268 explicitly signed or unsigned) char, short, int, or long
10269 bit-field is signed or unsigned.
10271 Naturally, we extend this to long long as well. Note that
10272 this does not include wchar_t. */
10273 || (bitfield
&& !flag_signed_bitfields
10274 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10275 /* A typedef for plain `int' without `signed' can be
10276 controlled just like plain `int', but a typedef for
10277 `signed int' cannot be so controlled. */
10279 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10280 && (TREE_CODE (type
) == INTEGER_TYPE
10281 || TREE_CODE (type
) == CHAR_TYPE
)
10282 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10285 type
= long_long_unsigned_type_node
;
10286 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10287 type
= long_unsigned_type_node
;
10288 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10289 type
= short_unsigned_type_node
;
10290 else if (type
== char_type_node
)
10291 type
= unsigned_char_type_node
;
10292 else if (typedef_decl
)
10293 type
= unsigned_type (type
);
10295 type
= unsigned_type_node
;
10297 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10298 && type
== char_type_node
)
10299 type
= signed_char_type_node
;
10301 type
= long_long_integer_type_node
;
10302 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10303 type
= long_integer_type_node
;
10304 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10305 type
= short_integer_type_node
;
10307 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10309 /* If we just have "complex", it is equivalent to
10310 "complex double", but if any modifiers at all are specified it is
10311 the complex form of TYPE. E.g, "complex short" is
10312 "complex short int". */
10314 if (defaulted_int
&& ! longlong
10315 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10316 || RIDBIT_SETP (RID_SHORT
, specbits
)
10317 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10318 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10319 type
= complex_double_type_node
;
10320 else if (type
== integer_type_node
)
10321 type
= complex_integer_type_node
;
10322 else if (type
== float_type_node
)
10323 type
= complex_float_type_node
;
10324 else if (type
== double_type_node
)
10325 type
= complex_double_type_node
;
10326 else if (type
== long_double_type_node
)
10327 type
= complex_long_double_type_node
;
10329 type
= build_complex_type (type
);
10332 if (sfk
== sfk_conversion
10333 && (RIDBIT_SETP (RID_CONST
, specbits
)
10334 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10335 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10336 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10339 /* Set CONSTP if this declaration is `const', whether by
10340 explicit specification or via a typedef.
10341 Likewise for VOLATILEP. */
10343 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10345 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10347 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10348 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10349 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10350 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10351 type
= cp_build_qualified_type (type
, type_quals
);
10353 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10354 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10355 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10356 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10357 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10359 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10360 staticp
= 1 + (decl_context
== FIELD
);
10362 if (virtualp
&& staticp
== 2)
10364 cp_error ("member `%D' cannot be declared both virtual and static",
10368 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10369 RIDBIT_RESET (RID_FRIEND
, specbits
);
10371 /* Warn if two storage classes are given. Default to `auto'. */
10373 if (RIDBIT_ANY_SET (specbits
))
10375 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10376 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10377 if (decl_context
== PARM
&& nclasses
> 0)
10378 error ("storage class specifiers invalid in parameter declarations");
10379 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10381 if (decl_context
== PARM
)
10382 error ("typedef declaration invalid in parameter declaration");
10385 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10386 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10389 /* Give error if `virtual' is used outside of class declaration. */
10391 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10393 error ("virtual outside class declaration");
10397 /* Static anonymous unions are dealt with here. */
10398 if (staticp
&& decl_context
== TYPENAME
10399 && TREE_CODE (declspecs
) == TREE_LIST
10400 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10401 decl_context
= FIELD
;
10403 /* Warn about storage classes that are invalid for certain
10404 kinds of declarations (parameters, typenames, etc.). */
10407 error ("multiple storage classes in declaration of `%s'", name
);
10408 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10410 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10411 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10412 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10414 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10416 else if (decl_context
== FIELD
10417 /* C++ allows static class elements */
10418 && RIDBIT_SETP (RID_STATIC
, specbits
))
10419 /* C++ also allows inlines and signed and unsigned elements,
10420 but in those cases we don't come in here. */
10424 if (decl_context
== FIELD
)
10426 tree tmp
= NULL_TREE
;
10427 register int op
= 0;
10431 /* Avoid trying to get an operand off an identifier node. */
10432 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10435 tmp
= TREE_OPERAND (declarator
, 0);
10436 op
= IDENTIFIER_OPNAME_P (tmp
);
10437 if (IDENTIFIER_TYPENAME_P (tmp
))
10439 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10440 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10442 name
= IDENTIFIER_POINTER (tmp
);
10444 name
= "<invalid operator>";
10447 error ("storage class specified for %s `%s'",
10448 op
? "member operator" : "field",
10453 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10454 error ("storage class specified for parameter `%s'", name
);
10456 error ("storage class specified for typename");
10458 RIDBIT_RESET (RID_REGISTER
, specbits
);
10459 RIDBIT_RESET (RID_AUTO
, specbits
);
10460 RIDBIT_RESET (RID_EXTERN
, specbits
);
10463 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10465 if (toplevel_bindings_p ())
10467 /* It's common practice (and completely valid) to have a const
10468 be initialized and declared extern. */
10469 if (!(type_quals
& TYPE_QUAL_CONST
))
10470 warning ("`%s' initialized and declared `extern'", name
);
10473 error ("`%s' has both `extern' and initializer", name
);
10475 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10476 && ! toplevel_bindings_p ())
10477 error ("nested function `%s' declared `extern'", name
);
10478 else if (toplevel_bindings_p ())
10480 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10481 error ("top-level declaration of `%s' specifies `auto'", name
);
10484 if (nclasses
> 0 && friendp
)
10485 error ("storage class specifiers invalid in friend function declarations");
10487 /* Now figure out the structure of the declarator proper.
10488 Descend through it, creating more complex types, until we reach
10489 the declared identifier (or NULL_TREE, in an absolute declarator). */
10491 inner_attrs
= NULL_TREE
;
10494 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10495 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10497 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10498 an INDIRECT_REF (for *...),
10499 a CALL_EXPR (for ...(...)),
10500 an identifier (for the name being declared)
10501 or a null pointer (for the place in an absolute declarator
10502 where the name was omitted).
10503 For the last two cases, we have just exited the loop.
10505 For C++ it could also be
10506 a SCOPE_REF (for class :: ...). In this case, we have converted
10507 sensible names to types, and those are the values we use to
10508 qualify the member name.
10509 an ADDR_EXPR (for &...),
10510 a BIT_NOT_EXPR (for destructors)
10512 At this point, TYPE is the type of elements of an array,
10513 or for a function to return, or for a pointer to point to.
10514 After this sequence of ifs, TYPE is the type of the
10515 array or function or pointer, and DECLARATOR has had its
10516 outermost layer removed. */
10518 if (type
== error_mark_node
)
10520 if (TREE_CODE (declarator
) == SCOPE_REF
)
10521 declarator
= TREE_OPERAND (declarator
, 1);
10523 declarator
= TREE_OPERAND (declarator
, 0);
10526 if (quals
!= NULL_TREE
10527 && (declarator
== NULL_TREE
10528 || TREE_CODE (declarator
) != SCOPE_REF
))
10530 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10531 ctype
= TYPE_METHOD_BASETYPE (type
);
10532 if (ctype
!= NULL_TREE
)
10534 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10535 grok_method_quals (ctype
, dummy
, quals
);
10536 type
= TREE_TYPE (dummy
);
10537 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10542 /* See the comment for the TREE_LIST case, below. */
10545 else if (inner_attrs
)
10547 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10548 inner_attrs
= NULL_TREE
;
10551 switch (TREE_CODE (declarator
))
10555 /* We encode a declarator with embedded attributes using
10556 a TREE_LIST. The attributes apply to the declarator
10557 directly inside them, so we have to skip an iteration
10558 before applying them to the type. If the declarator just
10559 inside is the declarator-id, we apply the attrs to the
10561 inner_attrs
= TREE_PURPOSE (declarator
);
10563 declarator
= TREE_VALUE (declarator
);
10569 register tree size
;
10571 size
= TREE_OPERAND (declarator
, 1);
10573 /* VC++ spells a zero-sized array with []. */
10574 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10575 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10576 size
= integer_zero_node
;
10578 declarator
= TREE_OPERAND (declarator
, 0);
10580 type
= create_array_type_for_decl (dname
, type
, size
);
10582 /* VLAs never work as fields. */
10583 if (decl_context
== FIELD
&& !processing_template_decl
10584 && TREE_CODE (type
) == ARRAY_TYPE
10585 && TYPE_DOMAIN (type
) != NULL_TREE
10586 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10588 cp_error ("size of member `%D' is not constant", dname
);
10589 /* Proceed with arbitrary constant size, so that offset
10590 computations don't get confused. */
10591 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10603 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10604 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10606 /* Declaring a function type.
10607 Make sure we have a valid type for the function to return. */
10609 /* We now know that the TYPE_QUALS don't apply to the
10610 decl, but to its return type. */
10611 type_quals
= TYPE_UNQUALIFIED
;
10613 /* Warn about some types functions can't return. */
10615 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10617 error ("`%s' declared as function returning a function", name
);
10618 type
= integer_type_node
;
10620 if (TREE_CODE (type
) == ARRAY_TYPE
)
10622 error ("`%s' declared as function returning an array", name
);
10623 type
= integer_type_node
;
10626 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10627 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10629 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10630 inner_decl
= dname
;
10632 /* Pick up type qualifiers which should be applied to `this'. */
10633 quals
= CALL_DECLARATOR_QUALS (declarator
);
10635 /* Pick up the exception specifications. */
10636 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10638 /* Say it's a definition only for the CALL_EXPR
10639 closest to the identifier. */
10642 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10643 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10644 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10646 if (ctype
== NULL_TREE
10647 && decl_context
== FIELD
10649 && (friendp
== 0 || dname
== current_class_name
))
10650 ctype
= current_class_type
;
10652 if (ctype
&& sfk
== sfk_conversion
)
10653 TYPE_HAS_CONVERSION (ctype
) = 1;
10654 if (ctype
&& constructor_name (ctype
) == dname
)
10656 /* We are within a class's scope. If our declarator name
10657 is the same as the class name, and we are defining
10658 a function, then it is a constructor/destructor, and
10659 therefore returns a void type. */
10661 if (flags
== DTOR_FLAG
)
10663 /* ISO C++ 12.4/2. A destructor may not be
10664 declared const or volatile. A destructor may
10667 error ("destructor cannot be static member function");
10670 cp_error ("destructors may not be `%s'",
10671 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10674 if (decl_context
== FIELD
)
10676 if (! member_function_or_else (ctype
,
10677 current_class_type
,
10679 return void_type_node
;
10682 else /* It's a constructor. */
10684 if (explicitp
== 1)
10686 /* ISO C++ 12.1. A constructor may not be
10687 declared const or volatile. A constructor may
10688 not be virtual. A constructor may not be
10691 error ("constructor cannot be static member function");
10694 pedwarn ("constructors cannot be declared virtual");
10699 cp_error ("constructors may not be `%s'",
10700 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10704 RID_BIT_TYPE tmp_bits
;
10705 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10706 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10707 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10708 if (RIDBIT_ANY_SET (tmp_bits
))
10709 error ("return value type specifier for constructor ignored");
10711 if (decl_context
== FIELD
)
10713 if (! member_function_or_else (ctype
,
10714 current_class_type
,
10716 return void_type_node
;
10717 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10718 if (sfk
!= sfk_constructor
)
10722 if (decl_context
== FIELD
)
10728 error ("can't initialize friend function `%s'", name
);
10731 /* Cannot be both friend and virtual. */
10732 error ("virtual functions cannot be friends");
10733 RIDBIT_RESET (RID_FRIEND
, specbits
);
10736 if (decl_context
== NORMAL
)
10737 error ("friend declaration not in class definition");
10738 if (current_function_decl
&& funcdef_flag
)
10739 cp_error ("can't define friend function `%s' in a local class definition",
10743 /* Construct the function type and go to the next
10744 inner layer of declarator. */
10746 declarator
= TREE_OPERAND (declarator
, 0);
10748 /* FIXME: This is where default args should be fully
10751 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10753 if (declarator
&& flags
== DTOR_FLAG
)
10755 /* A destructor declared in the body of a class will
10756 be represented as a BIT_NOT_EXPR. But, we just
10757 want the underlying IDENTIFIER. */
10758 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10759 declarator
= TREE_OPERAND (declarator
, 0);
10761 if (arg_types
!= void_list_node
)
10763 cp_error ("destructors may not have parameters");
10764 arg_types
= void_list_node
;
10765 last_function_parms
= NULL_TREE
;
10769 /* ANSI says that `const int foo ();'
10770 does not make the function foo const. */
10771 type
= build_function_type (type
, arg_types
);
10775 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10776 if (TREE_PURPOSE (t
)
10777 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10779 add_defarg_fn (type
);
10788 /* Filter out pointers-to-references and references-to-references.
10789 We can get these if a TYPE_DECL is used. */
10791 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10793 error ("cannot declare %s to references",
10794 TREE_CODE (declarator
) == ADDR_EXPR
10795 ? "references" : "pointers");
10796 declarator
= TREE_OPERAND (declarator
, 0);
10800 if (TREE_CODE (type
) == OFFSET_TYPE
10801 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10802 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10804 cp_error ("cannot declare pointer to `%#T' member",
10806 type
= TREE_TYPE (type
);
10809 /* Merge any constancy or volatility into the target type
10810 for the pointer. */
10812 /* We now know that the TYPE_QUALS don't apply to the decl,
10813 but to the target of the pointer. */
10814 type_quals
= TYPE_UNQUALIFIED
;
10816 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10818 if (TREE_CODE (type
) == VOID_TYPE
)
10819 error ("invalid type: `void &'");
10821 type
= build_reference_type (type
);
10823 else if (TREE_CODE (type
) == METHOD_TYPE
)
10824 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10826 type
= build_pointer_type (type
);
10828 /* Process a list of type modifier keywords (such as
10829 const or volatile) that were given inside the `*' or `&'. */
10831 if (TREE_TYPE (declarator
))
10833 register tree typemodlist
;
10839 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10840 typemodlist
= TREE_CHAIN (typemodlist
))
10842 tree qualifier
= TREE_VALUE (typemodlist
);
10844 if (qualifier
== ridpointers
[(int) RID_CONST
])
10846 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10848 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10853 error ("invalid type modifier within pointer declarator");
10857 pedwarn ("duplicate `const'");
10859 pedwarn ("duplicate `volatile'");
10861 pedwarn ("duplicate `restrict'");
10863 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10864 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10865 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10866 if (TREE_CODE (declarator
) == ADDR_EXPR
10867 && (constp
|| volatilep
))
10870 pedwarn ("discarding `const' applied to a reference");
10872 pedwarn ("discarding `volatile' applied to a reference");
10873 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10875 type
= cp_build_qualified_type (type
, type_quals
);
10877 declarator
= TREE_OPERAND (declarator
, 0);
10883 /* We have converted type names to NULL_TREE if the
10884 name was bogus, or to a _TYPE node, if not.
10886 The variable CTYPE holds the type we will ultimately
10887 resolve to. The code here just needs to build
10888 up appropriate member types. */
10889 tree sname
= TREE_OPERAND (declarator
, 1);
10892 /* Destructors can have their visibilities changed as well. */
10893 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10894 sname
= TREE_OPERAND (sname
, 0);
10896 if (TREE_COMPLEXITY (declarator
) == 0)
10897 /* This needs to be here, in case we are called
10898 multiple times. */ ;
10899 else if (TREE_COMPLEXITY (declarator
) == -1)
10900 /* Namespace member. */
10901 pop_decl_namespace ();
10902 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10903 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10904 else if (! IS_AGGR_TYPE_CODE
10905 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10907 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10909 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10910 that refer to ctype. They couldn't be resolved earlier
10911 because we hadn't pushed into the class yet.
10912 Example: resolve 'B<T>::type' in
10913 'B<typename B<T>::type> B<T>::f () { }'. */
10914 if (current_template_parms
10915 && uses_template_parms (type
)
10916 && uses_template_parms (current_class_type
))
10918 tree args
= current_template_args ();
10919 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10922 /* This pop_nested_class corresponds to the
10923 push_nested_class used to push into class scope for
10924 parsing the argument list of a function decl, in
10926 pop_nested_class ();
10927 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10930 my_friendly_abort (16);
10932 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10934 /* We had a reference to a global decl, or
10935 perhaps we were given a non-aggregate typedef,
10936 in which case we cleared this out, and should just
10937 keep going as though it wasn't there. */
10938 declarator
= sname
;
10941 ctype
= TREE_OPERAND (declarator
, 0);
10944 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10946 /* You're supposed to have one `template <...>'
10947 for every template class, but you don't need one
10948 for a full specialization. For example:
10950 template <class T> struct S{};
10951 template <> struct S<int> { void f(); };
10952 void S<int>::f () {}
10954 is correct; there shouldn't be a `template <>' for
10955 the definition of `S<int>::f'. */
10956 if (CLASSTYPE_TEMPLATE_INFO (t
)
10957 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10958 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10959 template_count
+= 1;
10961 t
= TYPE_MAIN_DECL (t
);
10962 if (DECL_LANG_SPECIFIC (t
))
10963 t
= DECL_CONTEXT (t
);
10968 if (sname
== NULL_TREE
)
10971 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10973 /* This is the `standard' use of the scoping operator:
10974 basetype :: member . */
10976 if (ctype
== current_class_type
)
10982 Is this ill-formed? */
10985 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10988 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10990 if (current_class_type
== NULL_TREE
10992 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10993 TYPE_ARG_TYPES (type
));
10996 cp_error ("cannot declare member function `%T::%s' within `%T'",
10997 ctype
, name
, current_class_type
);
10998 return void_type_node
;
11001 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
11002 || COMPLETE_TYPE_P (complete_type (ctype
)))
11004 /* Have to move this code elsewhere in this function.
11005 this code is used for i.e., typedef int A::M; M *pm;
11007 It is? How? jason 10/2/94 */
11009 if (current_class_type
)
11011 cp_error ("cannot declare member `%T::%s' within `%T'",
11012 ctype
, name
, current_class_type
);
11013 return void_type_node
;
11015 type
= build_offset_type (ctype
, type
);
11017 else if (uses_template_parms (ctype
))
11019 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11021 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
11022 TYPE_ARG_TYPES (type
));
11026 cp_error ("structure `%T' not yet defined", ctype
);
11027 return error_mark_node
;
11030 declarator
= sname
;
11032 else if (TREE_CODE (sname
) == SCOPE_REF
)
11033 my_friendly_abort (17);
11037 declarator
= TREE_OPERAND (declarator
, 1);
11038 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
11039 /* In this case, we will deal with it later. */
11043 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11044 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11045 TYPE_ARG_TYPES (type
));
11047 type
= build_offset_type (ctype
, type
);
11054 declarator
= TREE_OPERAND (declarator
, 0);
11059 case ENUMERAL_TYPE
:
11060 declarator
= NULL_TREE
;
11064 declarator
= NULL_TREE
;
11068 my_friendly_abort (158);
11072 /* See the comment for the TREE_LIST case, above. */
11075 if (! ignore_attrs
)
11076 decl_attributes (type
, inner_attrs
, NULL_TREE
);
11078 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
11080 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
11083 /* Now TYPE has the actual type. */
11085 if (explicitp
== 1 || (explicitp
&& friendp
))
11087 /* [dcl.fct.spec] The explicit specifier shall only be used in
11088 declarations of constructors within a class definition. */
11089 error ("only declarations of constructors can be `explicit'");
11093 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11095 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11097 error ("non-member `%s' cannot be declared `mutable'", name
);
11098 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11100 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11102 error ("non-object member `%s' cannot be declared `mutable'", name
);
11103 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11105 else if (TREE_CODE (type
) == FUNCTION_TYPE
11106 || TREE_CODE (type
) == METHOD_TYPE
)
11108 error ("function `%s' cannot be declared `mutable'", name
);
11109 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11113 error ("static `%s' cannot be declared `mutable'", name
);
11114 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11116 else if (type_quals
& TYPE_QUAL_CONST
)
11118 error ("const `%s' cannot be declared `mutable'", name
);
11119 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11123 if (declarator
== NULL_TREE
11124 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11125 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11126 && (TREE_CODE (type
) == FUNCTION_TYPE
11127 || TREE_CODE (type
) == METHOD_TYPE
)))
11129 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11131 cp_error ("template-id `%D' used as a declarator", declarator
);
11132 declarator
= dname
;
11135 /* Unexpected declarator format. */
11136 my_friendly_abort (990210);
11138 /* If this is declaring a typedef name, return a TYPE_DECL. */
11140 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11144 /* Note that the grammar rejects storage classes
11145 in typenames, fields or parameters. */
11146 if (current_lang_name
== lang_name_java
)
11147 TYPE_FOR_JAVA (type
) = 1;
11149 if (decl_context
== FIELD
)
11151 if (declarator
== constructor_name (current_class_type
))
11152 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11154 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11157 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11159 /* If the user declares "typedef struct {...} foo" then the
11160 struct will have an anonymous name. Fill that name in now.
11161 Nothing can refer to it, so nothing needs know about the name
11163 if (type
!= error_mark_node
11165 && TYPE_NAME (type
)
11166 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11167 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11168 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11170 tree oldname
= TYPE_NAME (type
);
11173 /* Replace the anonymous name with the real name everywhere. */
11174 lookup_tag_reverse (type
, declarator
);
11175 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11176 if (TYPE_NAME (t
) == oldname
)
11177 TYPE_NAME (t
) = decl
;
11179 if (TYPE_LANG_SPECIFIC (type
))
11180 TYPE_WAS_ANONYMOUS (type
) = 1;
11182 /* If this is a typedef within a template class, the nested
11183 type is a (non-primary) template. The name for the
11184 template needs updating as well. */
11185 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11186 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11187 = TYPE_IDENTIFIER (type
);
11190 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11193 /* XXX Temporarily set the scope.
11194 When returning, start_decl expects it as NULL_TREE,
11195 and will then then set it using pushdecl. */
11196 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11197 if (current_class_type
)
11198 DECL_CONTEXT (decl
) = current_class_type
;
11200 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11202 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11203 DECL_ASSEMBLER_NAME (decl
)
11204 = get_identifier (build_overload_name (type
, 1, 1));
11205 DECL_CONTEXT (decl
) = NULL_TREE
;
11208 /* FIXME remangle member functions; member functions of a
11209 type with external linkage have external linkage. */
11212 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11214 cp_error_at ("typedef name may not be class-qualified", decl
);
11219 if (ctype
== NULL_TREE
)
11221 if (TREE_CODE (type
) != METHOD_TYPE
)
11222 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11224 ctype
= TYPE_METHOD_BASETYPE (type
);
11226 if (ctype
!= NULL_TREE
)
11227 grok_method_quals (ctype
, decl
, quals
);
11230 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11231 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11232 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11234 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11235 inlinep
, friendp
, raises
!= NULL_TREE
);
11238 error ("typedef declaration includes an initializer");
11243 /* Detect the case of an array type of unspecified size
11244 which came, as such, direct from a typedef name.
11245 We must copy the type, so that each identifier gets
11246 a distinct type, so that each identifier's size can be
11247 controlled separately by its own initializer. */
11249 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11250 && TYPE_DOMAIN (type
) == NULL_TREE
)
11252 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11255 /* If this is a type name (such as, in a cast or sizeof),
11256 compute the type and return it now. */
11258 if (decl_context
== TYPENAME
)
11260 /* Note that the grammar rejects storage classes
11261 in typenames, fields or parameters. */
11262 if (type_quals
!= TYPE_UNQUALIFIED
)
11263 type_quals
= TYPE_UNQUALIFIED
;
11265 /* Special case: "friend class foo" looks like a TYPENAME context. */
11268 if (type_quals
!= TYPE_UNQUALIFIED
)
11270 cp_error ("type qualifiers specified for friend class declaration");
11271 type_quals
= TYPE_UNQUALIFIED
;
11275 cp_error ("`inline' specified for friend class declaration");
11279 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11280 But don't allow implicit typenames. */
11281 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11282 || IMPLICIT_TYPENAME_P (type
)))
11284 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11285 cp_pedwarn ("template parameters cannot be friends");
11286 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11288 friend declaration requires class-key, i.e. `friend class %T::%T'",
11289 constructor_name (current_class_type
),
11290 TYPE_IDENTIFIER (type
));
11293 friend declaration requires class-key, i.e. `friend %#T'",
11297 /* Only try to do this stuff if we didn't already give up. */
11298 if (type
!= integer_type_node
)
11300 /* A friendly class? */
11301 if (current_class_type
)
11302 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11304 cp_error ("trying to make class `%T' a friend of global scope",
11306 type
= void_type_node
;
11311 if (ctype
== NULL_TREE
)
11313 if (TREE_CODE (type
) != METHOD_TYPE
)
11314 cp_error ("invalid qualifiers on non-member function type");
11316 ctype
= TYPE_METHOD_BASETYPE (type
);
11320 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11321 grok_method_quals (ctype
, dummy
, quals
);
11322 type
= TREE_TYPE (dummy
);
11328 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11329 && decl_context
!= CATCHPARM
11330 && TREE_CODE (type
) != UNION_TYPE
11333 cp_error ("abstract declarator `%T' used as declaration", type
);
11334 declarator
= make_anon_name ();
11337 /* `void' at top level (not within pointer)
11338 is allowed only in typedefs or type names.
11339 We don't complain about parms either, but that is because
11340 a better error message can be made later. */
11342 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11345 error ("unnamed variable or field declared void");
11346 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11348 if (IDENTIFIER_OPNAME_P (declarator
))
11349 my_friendly_abort (356);
11351 error ("variable or field `%s' declared void", name
);
11354 error ("variable or field declared void");
11355 type
= integer_type_node
;
11358 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11359 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11361 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11363 if (ctype
|| in_namespace
)
11364 error ("cannot use `::' in parameter declaration");
11366 /* A parameter declared as an array of T is really a pointer to T.
11367 One declared as a function is really a pointer to a function.
11368 One declared as a member is really a pointer to member. */
11370 if (TREE_CODE (type
) == ARRAY_TYPE
)
11372 /* Transfer const-ness of array into that of type pointed to. */
11373 type
= build_pointer_type (TREE_TYPE (type
));
11374 type_quals
= TYPE_UNQUALIFIED
;
11376 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11377 type
= build_pointer_type (type
);
11378 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11379 type
= build_pointer_type (type
);
11380 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
11382 error ("declaration of `%s' as void", name
);
11388 register tree decl
;
11390 if (decl_context
== PARM
)
11392 decl
= build_decl (PARM_DECL
, declarator
, type
);
11394 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11395 inlinep
, friendp
, raises
!= NULL_TREE
);
11397 /* Compute the type actually passed in the parmlist,
11398 for the case where there is no prototype.
11399 (For example, shorts and chars are passed as ints.)
11400 When there is a prototype, this is overridden later. */
11402 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11404 else if (decl_context
== FIELD
)
11406 if (type
== error_mark_node
)
11408 /* Happens when declaring arrays of sizes which
11409 are error_mark_node, for example. */
11412 else if (in_namespace
&& !friendp
)
11414 /* Something like struct S { int N::j; }; */
11415 cp_error ("invalid use of `::'");
11418 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11421 tree function_context
;
11423 /* We catch the others as conflicts with the builtin
11425 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11427 cp_error ("function `%D' cannot be declared friend",
11434 if (ctype
== NULL_TREE
)
11435 ctype
= current_class_type
;
11437 if (ctype
== NULL_TREE
)
11439 cp_error ("can't make `%D' into a method -- not in a class",
11441 return void_type_node
;
11444 /* ``A union may [ ... ] not [ have ] virtual functions.''
11446 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11448 cp_error ("function `%D' declared virtual inside a union",
11450 return void_type_node
;
11453 if (declarator
== ansi_opname (NEW_EXPR
)
11454 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11455 || declarator
== ansi_opname (DELETE_EXPR
)
11456 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11460 cp_error ("`%D' cannot be declared virtual, since it is always static",
11465 else if (staticp
< 2)
11466 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11467 TYPE_ARG_TYPES (type
));
11470 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11471 function_context
= (ctype
!= NULL_TREE
) ?
11472 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11473 publicp
= (! friendp
|| ! staticp
)
11474 && function_context
== NULL_TREE
;
11475 decl
= grokfndecl (ctype
, type
,
11476 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11477 ? declarator
: dname
,
11479 virtualp
, flags
, quals
, raises
,
11480 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11481 funcdef_flag
, template_count
, in_namespace
);
11482 if (decl
== NULL_TREE
)
11485 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11486 /* The decl and setting of decl_machine_attr is also turned off. */
11487 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11490 /* [class.conv.ctor]
11492 A constructor declared without the function-specifier
11493 explicit that can be called with a single parameter
11494 specifies a conversion from the type of its first
11495 parameter to the type of its class. Such a constructor
11496 is called a converting constructor. */
11497 if (explicitp
== 2)
11498 DECL_NONCONVERTING_P (decl
) = 1;
11499 else if (DECL_CONSTRUCTOR_P (decl
))
11501 /* The constructor can be called with exactly one
11502 parameter if there is at least one parameter, and
11503 any subsequent parameters have default arguments.
11504 We don't look at the first parameter, which is
11505 really just the `this' parameter for the new
11508 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11510 /* Skip the `in_chrg' argument too, if present. */
11511 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11512 arg_types
= TREE_CHAIN (arg_types
);
11514 if (arg_types
== void_list_node
11516 && TREE_CHAIN (arg_types
)
11517 && TREE_CHAIN (arg_types
) != void_list_node
11518 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11519 DECL_NONCONVERTING_P (decl
) = 1;
11522 else if (TREE_CODE (type
) == METHOD_TYPE
)
11524 /* We only get here for friend declarations of
11525 members of other classes. */
11526 /* All method decls are public, so tell grokfndecl to set
11527 TREE_PUBLIC, also. */
11528 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11529 virtualp
, flags
, quals
, raises
,
11530 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11531 template_count
, in_namespace
);
11532 if (decl
== NULL_TREE
)
11535 else if (!staticp
&& ! processing_template_decl
11536 && !COMPLETE_TYPE_P (complete_type (type
))
11537 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11540 cp_error ("field `%D' has incomplete type", declarator
);
11542 cp_error ("name `%T' has incomplete type", type
);
11544 /* If we're instantiating a template, tell them which
11545 instantiation made the field's type be incomplete. */
11546 if (current_class_type
11547 && TYPE_NAME (current_class_type
)
11548 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11549 && declspecs
&& TREE_VALUE (declspecs
)
11550 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11551 cp_error (" in instantiation of template `%T'",
11552 current_class_type
);
11554 type
= error_mark_node
;
11561 error ("`%s' is neither function nor member function; cannot be declared friend",
11562 IDENTIFIER_POINTER (declarator
));
11570 /* Friends are treated specially. */
11571 if (ctype
== current_class_type
)
11572 warning ("member functions are implicitly friends of their class");
11575 tree t
= NULL_TREE
;
11576 if (decl
&& DECL_NAME (decl
))
11578 if (template_class_depth (current_class_type
) == 0)
11581 = check_explicit_specialization
11583 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11584 if (decl
== error_mark_node
)
11585 return error_mark_node
;
11588 t
= do_friend (ctype
, declarator
, decl
,
11589 last_function_parms
, attrlist
, flags
, quals
,
11592 if (t
&& funcdef_flag
)
11595 return void_type_node
;
11599 /* Structure field. It may not be a function, except for C++ */
11601 if (decl
== NULL_TREE
)
11607 /* An attempt is being made to initialize a non-static
11608 member. But, from [class.mem]:
11610 4 A member-declarator can contain a
11611 constant-initializer only if it declares a static
11612 member (_class.static_) of integral or enumeration
11613 type, see _class.static.data_.
11615 This used to be relatively common practice, but
11616 the rest of the compiler does not correctly
11617 handle the initialization unless the member is
11618 static so we make it static below. */
11619 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11621 cp_pedwarn ("making `%D' static", declarator
);
11625 if (uses_template_parms (type
))
11626 /* We'll check at instantiation time. */
11628 else if (check_static_variable_definition (declarator
,
11630 /* If we just return the declaration, crashes
11631 will sometimes occur. We therefore return
11632 void_type_node, as if this was a friend
11633 declaration, to cause callers to completely
11634 ignore this declaration. */
11635 return void_type_node
;
11638 /* 9.2p13 [class.mem] */
11639 if (declarator
== constructor_name (current_class_type
)
11640 /* The standard does not allow non-static data members
11641 here either, but we agreed at the 10/99 meeting
11642 to change that in TC 1 so that they are allowed in
11643 classes with no user-defined constructors. */
11645 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11650 /* C++ allows static class members. All other work
11651 for this is done by grokfield. */
11652 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11653 TREE_STATIC (decl
) = 1;
11654 /* In class context, 'static' means public access. */
11655 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11659 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11660 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11661 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11663 DECL_MUTABLE_P (decl
) = 1;
11664 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11668 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11669 inlinep
, friendp
, raises
!= NULL_TREE
);
11672 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11674 tree original_name
;
11680 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11681 original_name
= dname
;
11683 original_name
= declarator
;
11685 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11686 error ("storage class `auto' invalid for function `%s'", name
);
11687 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11688 error ("storage class `register' invalid for function `%s'", name
);
11690 /* Function declaration not at top level.
11691 Storage classes other than `extern' are not allowed
11692 and `extern' makes no difference. */
11693 if (! toplevel_bindings_p ()
11694 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11695 || RIDBIT_SETP (RID_INLINE
, specbits
))
11698 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11699 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11701 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11704 if (ctype
== NULL_TREE
)
11708 error ("virtual non-class function `%s'", name
);
11712 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11713 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11714 TYPE_ARG_TYPES (type
));
11716 /* Record presence of `static'. */
11717 publicp
= (ctype
!= NULL_TREE
11718 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11719 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11721 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11722 virtualp
, flags
, quals
, raises
,
11724 publicp
, inlinep
, funcdef_flag
,
11725 template_count
, in_namespace
);
11726 if (decl
== NULL_TREE
)
11731 int illegal_static
= 0;
11733 /* Don't allow a static member function in a class, and forbid
11734 declaring main to be static. */
11735 if (TREE_CODE (type
) == METHOD_TYPE
)
11737 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11738 illegal_static
= 1;
11740 else if (current_function_decl
)
11742 /* FIXME need arm citation */
11743 error ("cannot declare static function inside another function");
11744 illegal_static
= 1;
11747 if (illegal_static
)
11750 RIDBIT_RESET (RID_STATIC
, specbits
);
11756 /* It's a variable. */
11758 /* An uninitialized decl with `extern' is a reference. */
11759 decl
= grokvardecl (type
, declarator
, &specbits
,
11761 (type_quals
& TYPE_QUAL_CONST
) != 0,
11763 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11764 inlinep
, friendp
, raises
!= NULL_TREE
);
11768 DECL_CONTEXT (decl
) = ctype
;
11771 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11773 RIDBIT_RESET (RID_STATIC
, specbits
);
11775 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11777 cp_error ("static member `%D' declared `register'", decl
);
11778 RIDBIT_RESET (RID_REGISTER
, specbits
);
11780 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11782 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11784 RIDBIT_RESET (RID_EXTERN
, specbits
);
11789 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11791 /* Record `register' declaration for warnings on &
11792 and in case doing stupid register allocation. */
11794 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11795 DECL_REGISTER (decl
) = 1;
11797 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11798 DECL_THIS_EXTERN (decl
) = 1;
11800 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11801 DECL_THIS_STATIC (decl
) = 1;
11803 /* Record constancy and volatility. There's no need to do this
11804 when processing a template; we'll do this for the instantiated
11805 declaration based on the type of DECL. */
11806 if (!processing_template_decl
)
11807 c_apply_type_quals_to_decl (type_quals
, decl
);
11813 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11814 An empty exprlist is a parmlist. An exprlist which
11815 contains only identifiers at the global level
11816 is a parmlist. Otherwise, it is an exprlist. */
11819 parmlist_is_exprlist (exprs
)
11822 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11825 if (toplevel_bindings_p ())
11827 /* At the global level, if these are all identifiers,
11828 then it is a parmlist. */
11831 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11833 exprs
= TREE_CHAIN (exprs
);
11840 /* Subroutine of start_function. Ensure that each of the parameter
11841 types (as listed in PARMS) is complete, as is required for a
11842 function definition. */
11845 require_complete_types_for_parms (parms
)
11848 for (; parms
; parms
= TREE_CHAIN (parms
))
11850 tree type
= TREE_TYPE (parms
);
11852 /* Try to complete the TYPE. */
11853 type
= complete_type (type
);
11855 if (type
== error_mark_node
)
11858 if (!COMPLETE_TYPE_P (type
))
11860 if (DECL_NAME (parms
))
11861 error ("parameter `%s' has incomplete type",
11862 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11864 error ("parameter has incomplete type");
11865 TREE_TYPE (parms
) = error_mark_node
;
11868 layout_decl (parms
, 0);
11872 /* Returns non-zero if T is a local variable. */
11875 local_variable_p (t
)
11878 if ((TREE_CODE (t
) == VAR_DECL
11879 /* A VAR_DECL with a context that is a _TYPE is a static data
11881 && !TYPE_P (CP_DECL_CONTEXT (t
))
11882 /* Any other non-local variable must be at namespace scope. */
11883 && !DECL_NAMESPACE_SCOPE_P (t
))
11884 || (TREE_CODE (t
) == PARM_DECL
))
11890 /* Returns non-zero if T is an automatic local variable or a label.
11891 (These are the declarations that need to be remapped when the code
11892 containing them is duplicated.) */
11895 nonstatic_local_decl_p (t
)
11898 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11899 || TREE_CODE (t
) == LABEL_DECL
11900 || TREE_CODE (t
) == RESULT_DECL
);
11903 /* Like local_variable_p, but suitable for use as a tree-walking
11907 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11909 int *walk_subtrees ATTRIBUTE_UNUSED
;
11910 void *data ATTRIBUTE_UNUSED
;
11912 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11913 ? *tp
: NULL_TREE
);
11916 /* Check that ARG, which is a default-argument expression for a
11917 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11918 something goes wrong. DECL may also be a _TYPE node, rather than a
11919 DECL, if there is no DECL available. */
11922 check_default_argument (decl
, arg
)
11929 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11930 /* We get a DEFAULT_ARG when looking at an in-class declaration
11931 with a default argument. Ignore the argument for now; we'll
11932 deal with it after the class is complete. */
11935 if (processing_template_decl
|| uses_template_parms (arg
))
11936 /* We don't do anything checking until instantiation-time. Note
11937 that there may be uninstantiated arguments even for an
11938 instantiated function, since default arguments are not
11939 instantiated until they are needed. */
11948 decl_type
= TREE_TYPE (decl
);
11950 if (arg
== error_mark_node
11951 || decl
== error_mark_node
11952 || TREE_TYPE (arg
) == error_mark_node
11953 || decl_type
== error_mark_node
)
11954 /* Something already went wrong. There's no need to check
11956 return error_mark_node
;
11958 /* [dcl.fct.default]
11960 A default argument expression is implicitly converted to the
11962 if (!TREE_TYPE (arg
)
11963 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11966 cp_error ("default argument for `%#D' has type `%T'",
11967 decl
, TREE_TYPE (arg
));
11969 cp_error ("default argument for parameter of type `%T' has type `%T'",
11970 decl_type
, TREE_TYPE (arg
));
11972 return error_mark_node
;
11975 /* [dcl.fct.default]
11977 Local variables shall not be used in default argument
11980 The keyword `this' shall not be used in a default argument of a
11981 member function. */
11982 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11986 cp_error ("default argument `%E' uses local variable `%D'",
11988 return error_mark_node
;
11995 /* Decode the list of parameter types for a function type.
11996 Given the list of things declared inside the parens,
11997 return a list of types.
11999 The list we receive can have three kinds of elements:
12000 an IDENTIFIER_NODE for names given without types,
12001 a TREE_LIST node for arguments given as typespecs or names with typespecs,
12002 or void_type_node, to mark the end of an argument list
12003 when additional arguments are not permitted (... was not used).
12005 FUNCDEF_FLAG is nonzero for a function definition, 0 for
12006 a mere declaration. A nonempty identifier-list gets an error message
12007 when FUNCDEF_FLAG is zero.
12008 If FUNCDEF_FLAG is 1, then parameter types must be complete.
12009 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
12011 If all elements of the input list contain types,
12012 we return a list of the types.
12013 If all elements contain no type (except perhaps a void_type_node
12014 at the end), we return a null list.
12015 If some have types and some do not, it is an error, and we
12016 return a null list.
12018 Also set last_function_parms to either
12019 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
12020 A list of names is converted to a chain of PARM_DECLs
12021 by store_parm_decls so that ultimately it is always a chain of decls.
12023 Note that in C++, parameters can take default values. These default
12024 values are in the TREE_PURPOSE field of the TREE_LIST. It is
12025 an error to specify default values which are followed by parameters
12026 that have no default values, or an ELLIPSES. For simplicities sake,
12027 only parameters which are specified with their types can take on
12031 grokparms (first_parm
, funcdef_flag
)
12035 tree result
= NULL_TREE
;
12036 tree decls
= NULL_TREE
;
12038 if (first_parm
!= NULL_TREE
12039 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
12041 if (! funcdef_flag
)
12042 pedwarn ("parameter names (without types) in function declaration");
12043 last_function_parms
= first_parm
;
12046 else if (first_parm
!= NULL_TREE
12047 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
12048 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
12049 my_friendly_abort (145);
12052 /* Types were specified. This is a list of declarators
12053 each represented as a TREE_LIST node. */
12054 register tree parm
, chain
;
12055 int any_init
= 0, any_error
= 0;
12057 if (first_parm
!= NULL_TREE
)
12059 tree last_result
= NULL_TREE
;
12060 tree last_decl
= NULL_TREE
;
12062 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
12064 tree type
= NULL_TREE
, list_node
= parm
;
12065 register tree decl
= TREE_VALUE (parm
);
12066 tree init
= TREE_PURPOSE (parm
);
12068 chain
= TREE_CHAIN (parm
);
12069 /* @@ weak defense against parse errors. */
12070 if (TREE_CODE (decl
) != VOID_TYPE
12071 && TREE_CODE (decl
) != TREE_LIST
)
12073 /* Give various messages as the need arises. */
12074 if (TREE_CODE (decl
) == STRING_CST
)
12075 cp_error ("invalid string constant `%E'", decl
);
12076 else if (TREE_CODE (decl
) == INTEGER_CST
)
12077 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12081 if (TREE_CODE (decl
) != VOID_TYPE
)
12083 decl
= grokdeclarator (TREE_VALUE (decl
),
12084 TREE_PURPOSE (decl
),
12085 PARM
, init
!= NULL_TREE
,
12087 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
12090 /* Top-level qualifiers on the parameters are
12091 ignored for function types. */
12092 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
12094 if (TREE_CODE (type
) == VOID_TYPE
)
12095 decl
= void_type_node
;
12096 else if (TREE_CODE (type
) == METHOD_TYPE
)
12098 if (DECL_NAME (decl
))
12099 /* Cannot use the decl here because
12100 we don't have DECL_CONTEXT set up yet. */
12101 cp_error ("parameter `%D' invalidly declared method type",
12104 error ("parameter invalidly declared method type");
12105 type
= build_pointer_type (type
);
12106 TREE_TYPE (decl
) = type
;
12108 else if (TREE_CODE (type
) == OFFSET_TYPE
)
12110 if (DECL_NAME (decl
))
12111 cp_error ("parameter `%D' invalidly declared offset type",
12114 error ("parameter invalidly declared offset type");
12115 type
= build_pointer_type (type
);
12116 TREE_TYPE (decl
) = type
;
12118 else if (abstract_virtuals_error (decl
, type
))
12119 any_error
= 1; /* Seems like a good idea. */
12120 else if (POINTER_TYPE_P (type
))
12123 while (POINTER_TYPE_P (t
)
12124 || (TREE_CODE (t
) == ARRAY_TYPE
12125 && TYPE_DOMAIN (t
) != NULL_TREE
))
12127 if (TREE_CODE (t
) == ARRAY_TYPE
)
12128 cp_error ("parameter type `%T' includes %s to array of unknown bound",
12130 TYPE_PTR_P (type
) ? "pointer" : "reference");
12134 if (TREE_CODE (decl
) == VOID_TYPE
)
12136 if (result
== NULL_TREE
)
12138 result
= void_list_node
;
12139 last_result
= result
;
12143 TREE_CHAIN (last_result
) = void_list_node
;
12144 last_result
= void_list_node
;
12147 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
12148 error ("`void' in parameter list must be entire list");
12152 /* Since there is a prototype, args are passed in their own types. */
12153 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
12154 if (PROMOTE_PROTOTYPES
12155 && (TREE_CODE (type
) == INTEGER_TYPE
12156 || TREE_CODE (type
) == ENUMERAL_TYPE
)
12157 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
12158 DECL_ARG_TYPE (decl
) = integer_type_node
;
12159 if (!any_error
&& init
)
12162 init
= check_default_argument (decl
, init
);
12167 if (decls
== NULL_TREE
)
12174 TREE_CHAIN (last_decl
) = decl
;
12177 list_node
= tree_cons (init
, type
, NULL_TREE
);
12178 if (result
== NULL_TREE
)
12180 result
= list_node
;
12181 last_result
= result
;
12185 TREE_CHAIN (last_result
) = list_node
;
12186 last_result
= list_node
;
12190 TREE_CHAIN (last_result
) = NULL_TREE
;
12191 /* If there are no parameters, and the function does not end
12192 with `...', then last_decl will be NULL_TREE. */
12193 if (last_decl
!= NULL_TREE
)
12194 TREE_CHAIN (last_decl
) = NULL_TREE
;
12198 last_function_parms
= decls
;
12203 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12204 FUNCTION_TYPE with the newly parsed version of its default argument, which
12205 was previously digested as text. See snarf_defarg et al in lex.c. */
12208 replace_defarg (arg
, init
)
12211 if (! processing_template_decl
12212 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
12213 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12214 TREE_TYPE (init
), TREE_VALUE (arg
));
12215 TREE_PURPOSE (arg
) = init
;
12218 /* D is a constructor or overloaded `operator='. Returns non-zero if
12219 D's arguments allow it to be a copy constructor, or copy assignment
12228 if (!DECL_FUNCTION_MEMBER_P (d
))
12231 t
= FUNCTION_ARG_CHAIN (d
);
12232 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
12233 t
= TREE_CHAIN (t
);
12234 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12235 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12236 == DECL_CONTEXT (d
))
12237 && (TREE_CHAIN (t
) == NULL_TREE
12238 || TREE_CHAIN (t
) == void_list_node
12239 || TREE_PURPOSE (TREE_CHAIN (t
))))
12244 /* These memoizing functions keep track of special properties which
12245 a class may have. `grok_ctor_properties' notices whether a class
12246 has a constructor of the form X(X&), and also complains
12247 if the class has a constructor of the form X(X).
12248 `grok_op_properties' takes notice of the various forms of
12249 operator= which are defined, as well as what sorts of type conversion
12250 may apply. Both functions take a FUNCTION_DECL as an argument. */
12253 grok_ctor_properties (ctype
, decl
)
12256 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12257 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12259 /* When a type has virtual baseclasses, a magical first int argument is
12260 added to any ctor so we can tell if the class has been initialized
12261 yet. This could screw things up in this function, so we deliberately
12262 ignore the leading int if we're in that situation. */
12263 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12265 my_friendly_assert (parmtypes
12266 && TREE_VALUE (parmtypes
) == integer_type_node
,
12268 parmtypes
= TREE_CHAIN (parmtypes
);
12269 parmtype
= TREE_VALUE (parmtypes
);
12274 A non-template constructor for class X is a copy constructor if
12275 its first parameter is of type X&, const X&, volatile X& or const
12276 volatile X&, and either there are no other parameters or else all
12277 other parameters have default arguments. */
12278 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12279 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12280 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12281 || TREE_CHAIN (parmtypes
) == void_list_node
12282 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12283 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12284 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12286 TYPE_HAS_INIT_REF (ctype
) = 1;
12287 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12288 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12292 A declaration of a constructor for a class X is ill-formed if its
12293 first parameter is of type (optionally cv-qualified) X and either
12294 there are no other parameters or else all other parameters have
12297 We *don't* complain about member template instantiations that
12298 have this form, though; they can occur as we try to decide what
12299 constructor to use during overload resolution. Since overload
12300 resolution will never prefer such a constructor to the
12301 non-template copy constructor (which is either explicitly or
12302 implicitly defined), there's no need to worry about their
12303 existence. Theoretically, they should never even be
12304 instantiated, but that's hard to forestall. */
12305 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12306 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12307 || TREE_CHAIN (parmtypes
) == void_list_node
12308 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12309 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12310 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12312 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12314 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12317 else if (TREE_CODE (parmtype
) == VOID_TYPE
12318 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12319 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12324 /* An operator with this code is unary, but can also be binary. */
12328 enum tree_code code
;
12330 return (code
== INDIRECT_REF
12331 || code
== ADDR_EXPR
12332 || code
== CONVERT_EXPR
12333 || code
== NEGATE_EXPR
12334 || code
== PREINCREMENT_EXPR
12335 || code
== PREDECREMENT_EXPR
);
12338 /* An operator with this name can only be unary. */
12342 enum tree_code code
;
12344 return (code
== TRUTH_NOT_EXPR
12345 || code
== BIT_NOT_EXPR
12346 || code
== COMPONENT_REF
12347 || code
== TYPE_EXPR
);
12350 /* Do a little sanity-checking on how they declared their operator. */
12353 grok_op_properties (decl
, virtualp
, friendp
)
12355 int virtualp
, friendp
;
12357 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12359 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12360 tree name
= DECL_NAME (decl
);
12361 enum tree_code operator_code
;
12364 /* Count the number of arguments. */
12365 for (argtype
= argtypes
, arity
= 0;
12366 argtype
&& argtype
!= void_list_node
;
12367 argtype
= TREE_CHAIN (argtype
))
12370 if (current_class_type
== NULL_TREE
)
12373 if (DECL_CONV_FN_P (decl
))
12374 operator_code
= TYPE_EXPR
;
12378 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12379 if (ansi_opname (CODE) == name) \
12381 operator_code = CODE; \
12384 else if (ansi_assopname (CODE) == name) \
12386 operator_code = CODE; \
12387 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12391 #include "operators.def"
12392 #undef DEF_OPERATOR
12394 my_friendly_abort (20000527);
12397 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12398 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12402 switch (operator_code
)
12405 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12409 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12412 case COMPONENT_REF
:
12414 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12418 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12422 TYPE_GETS_DELETE (current_class_type
) |= 1;
12426 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12429 case VEC_DELETE_EXPR
:
12430 TYPE_GETS_DELETE (current_class_type
) |= 2;
12438 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12440 /* When the compiler encounters the definition of A::operator new, it
12441 doesn't look at the class declaration to find out if it's static. */
12443 revert_static_member_fn (decl
);
12445 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12447 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12450 revert_static_member_fn (decl
);
12452 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12456 /* An operator function must either be a non-static member function
12457 or have at least one parameter of a class, a reference to a class,
12458 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12459 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12461 if (operator_code
== TYPE_EXPR
12462 || operator_code
== CALL_EXPR
12463 || operator_code
== COMPONENT_REF
12464 || operator_code
== ARRAY_REF
12465 || operator_code
== NOP_EXPR
)
12466 cp_error ("`%D' must be a nonstatic member function", decl
);
12471 if (DECL_STATIC_FUNCTION_P (decl
))
12472 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12475 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12477 tree arg
= TREE_VALUE (p
);
12478 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12479 arg
= TREE_TYPE (arg
);
12481 /* This lets bad template code slip through. */
12482 if (IS_AGGR_TYPE (arg
)
12483 || TREE_CODE (arg
) == ENUMERAL_TYPE
12484 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12485 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12489 ("`%D' must have an argument of class or enumerated type",
12496 if (operator_code
== CALL_EXPR
)
12497 return; /* No restrictions on args. */
12499 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12501 tree t
= TREE_TYPE (name
);
12504 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12505 const char *what
= 0;
12508 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12510 if (TREE_CODE (t
) == VOID_TYPE
)
12512 else if (t
== current_class_type
)
12513 what
= "the same type";
12514 /* Don't force t to be complete here. */
12515 else if (IS_AGGR_TYPE (t
)
12516 && COMPLETE_TYPE_P (t
)
12517 && DERIVED_FROM_P (t
, current_class_type
))
12518 what
= "a base class";
12521 warning ("conversion to %s%s will never use a type conversion operator",
12522 ref
? "a reference to " : "", what
);
12526 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12527 && operator_code
== NOP_EXPR
)
12531 if (arity
!= 2 && methodp
)
12533 cp_error ("`%D' must take exactly one argument", decl
);
12536 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12540 A user-declared copy assignment operator X::operator= is
12541 a non-static non-template member function of class X with
12542 exactly one parameter of type X, X&, const X&, volatile
12543 X& or const volatile X&. */
12544 if (copy_assignment_arg_p (parmtype
, virtualp
)
12545 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12546 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12549 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12550 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12551 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12552 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12555 else if (operator_code
== COND_EXPR
)
12558 cp_error ("ISO C++ prohibits overloading operator ?:");
12560 else if (ambi_op_p (operator_code
))
12563 /* We pick the one-argument operator codes by default, so
12564 we don't have to change anything. */
12566 else if (arity
== 2)
12568 /* If we thought this was a unary operator, we now know
12569 it to be a binary operator. */
12570 switch (operator_code
)
12573 operator_code
= MULT_EXPR
;
12577 operator_code
= BIT_AND_EXPR
;
12581 operator_code
= PLUS_EXPR
;
12585 operator_code
= MINUS_EXPR
;
12588 case PREINCREMENT_EXPR
:
12589 operator_code
= POSTINCREMENT_EXPR
;
12592 case PREDECREMENT_EXPR
:
12593 operator_code
= POSTDECREMENT_EXPR
;
12597 my_friendly_abort (20000527);
12600 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12602 if ((operator_code
== POSTINCREMENT_EXPR
12603 || operator_code
== POSTDECREMENT_EXPR
)
12604 && ! processing_template_decl
12605 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12608 cp_error ("postfix `%D' must take `int' as its argument",
12612 ("postfix `%D' must take `int' as its second argument",
12619 cp_error ("`%D' must take either zero or one argument", decl
);
12621 cp_error ("`%D' must take either one or two arguments", decl
);
12624 /* More Effective C++ rule 6. */
12626 && (operator_code
== POSTINCREMENT_EXPR
12627 || operator_code
== POSTDECREMENT_EXPR
12628 || operator_code
== PREINCREMENT_EXPR
12629 || operator_code
== PREDECREMENT_EXPR
))
12631 tree arg
= TREE_VALUE (argtypes
);
12632 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12633 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12634 arg
= TREE_TYPE (arg
);
12635 arg
= TYPE_MAIN_VARIANT (arg
);
12636 if (operator_code
== PREINCREMENT_EXPR
12637 || operator_code
== PREDECREMENT_EXPR
)
12639 if (TREE_CODE (ret
) != REFERENCE_TYPE
12640 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12642 cp_warning ("prefix `%D' should return `%T'", decl
,
12643 build_reference_type (arg
));
12647 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12648 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12652 else if (unary_op_p (operator_code
))
12657 cp_error ("`%D' must take `void'", decl
);
12659 cp_error ("`%D' must take exactly one argument", decl
);
12662 else /* if (binary_op_p (operator_code)) */
12667 cp_error ("`%D' must take exactly one argument", decl
);
12669 cp_error ("`%D' must take exactly two arguments", decl
);
12672 /* More Effective C++ rule 7. */
12674 && (operator_code
== TRUTH_ANDIF_EXPR
12675 || operator_code
== TRUTH_ORIF_EXPR
12676 || operator_code
== COMPOUND_EXPR
))
12677 cp_warning ("user-defined `%D' always evaluates both arguments",
12681 /* Effective C++ rule 23. */
12684 && (operator_code
== PLUS_EXPR
12685 || operator_code
== MINUS_EXPR
12686 || operator_code
== TRUNC_DIV_EXPR
12687 || operator_code
== MULT_EXPR
)
12688 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12689 cp_warning ("`%D' should return by value", decl
);
12692 for (; argtypes
&& argtypes
!= void_list_node
;
12693 argtypes
= TREE_CHAIN (argtypes
))
12694 if (TREE_PURPOSE (argtypes
))
12696 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12697 if (operator_code
== POSTINCREMENT_EXPR
12698 || operator_code
== POSTDECREMENT_EXPR
)
12701 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12704 cp_error ("`%D' cannot have default arguments", decl
);
12710 static const char *
12712 enum tag_types code
;
12725 my_friendly_abort (981122);
12729 /* Get the struct, enum or union (CODE says which) with tag NAME.
12730 Define the tag as a forward-reference if it is not defined.
12732 C++: If a class derivation is given, process it here, and report
12733 an error if multiple derivation declarations are not identical.
12735 If this is a definition, come in through xref_tag and only look in
12736 the current frame for the name (since C++ allows new names in any
12740 xref_tag (code_type_node
, name
, globalize
)
12741 tree code_type_node
;
12745 enum tag_types tag_code
;
12746 enum tree_code code
;
12747 register tree ref
, t
;
12748 struct binding_level
*b
= current_binding_level
;
12750 tree attributes
= NULL_TREE
;
12751 tree context
= NULL_TREE
;
12753 /* If we are called from the parser, code_type_node will sometimes be a
12754 TREE_LIST. This indicates that the user wrote
12755 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12757 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12759 attributes
= TREE_PURPOSE (code_type_node
);
12760 code_type_node
= TREE_VALUE (code_type_node
);
12763 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12768 code
= RECORD_TYPE
;
12774 code
= ENUMERAL_TYPE
;
12777 my_friendly_abort (18);
12780 /* If a cross reference is requested, look up the type
12781 already defined for this tag and return it. */
12785 name
= TYPE_IDENTIFIER (t
);
12789 t
= IDENTIFIER_TYPE_VALUE (name
);
12791 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12792 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12794 static int explained
;
12796 cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12797 to refer to the inherited type, say `%s %T::%T'%s",
12798 tag_name (tag_code
), name
, tag_name (tag_code
),
12799 constructor_name (current_class_type
), TYPE_IDENTIFIER (t
),
12801 (names from dependent base classes are not visible to unqualified name lookup)"
12807 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12808 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12813 /* If we know we are defining this tag, only look it up in
12814 this scope and don't try to find it as a type. */
12815 ref
= lookup_tag (code
, name
, b
, 1);
12821 /* [dcl.type.elab] If the identifier resolves to a
12822 typedef-name or a template type-parameter, the
12823 elaborated-type-specifier is ill-formed. */
12824 if (t
!= TYPE_MAIN_VARIANT (t
)
12825 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12826 cp_pedwarn ("using typedef-name `%D' after `%s'",
12827 TYPE_NAME (t
), tag_name (tag_code
));
12828 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12829 cp_error ("using template type parameter `%T' after `%s'",
12830 t
, tag_name (tag_code
));
12835 ref
= lookup_tag (code
, name
, b
, 0);
12839 /* Try finding it as a type declaration. If that wins,
12841 ref
= lookup_name (name
, 1);
12843 if (ref
!= NULL_TREE
12844 && processing_template_decl
12845 && DECL_CLASS_TEMPLATE_P (ref
)
12846 && template_class_depth (current_class_type
) == 0)
12847 /* Since GLOBALIZE is true, we're declaring a global
12848 template, so we want this type. */
12849 ref
= DECL_TEMPLATE_RESULT (ref
);
12851 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12852 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12853 ref
= TREE_TYPE (ref
);
12858 if (ref
&& current_class_type
12859 && template_class_depth (current_class_type
)
12860 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12862 /* Since GLOBALIZE is non-zero, we are not looking at a
12863 definition of this tag. Since, in addition, we are currently
12864 processing a (member) template declaration of a template
12865 class, we must be very careful; consider:
12872 { template <class V>
12873 friend struct S1; };
12875 Here, the S2::S1 declaration should not be confused with the
12876 outer declaration. In particular, the inner version should
12877 have a template parameter of level 2, not level 1. This
12878 would be particularly important if the member declaration
12881 template <class V = U> friend struct S1;
12883 say, when we should tsubst into `U' when instantiating
12884 S2. On the other hand, when presented with:
12894 we must find the inner binding eventually. We
12895 accomplish this by making sure that the new type we
12896 create to represent this declaration has the right
12898 context
= TYPE_CONTEXT (ref
);
12905 /* If no such tag is yet defined, create a forward-reference node
12906 and record it as the "definition".
12907 When a real declaration of this type is found,
12908 the forward-reference will be altered into a real type. */
12909 if (code
== ENUMERAL_TYPE
)
12911 cp_error ("use of enum `%#D' without previous declaration", name
);
12913 ref
= make_node (ENUMERAL_TYPE
);
12915 /* Give the type a default layout like unsigned int
12916 to avoid crashing if it does not get defined. */
12917 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12918 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12919 TYPE_USER_ALIGN (ref
) = 0;
12920 TREE_UNSIGNED (ref
) = 1;
12921 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12922 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12923 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12925 /* Enable us to recognize when a type is created in class context.
12926 To do nested classes correctly, this should probably be cleared
12927 out when we leave this classes scope. Currently this in only
12928 done in `start_enum'. */
12930 pushtag (name
, ref
, globalize
);
12934 struct binding_level
*old_b
= class_binding_level
;
12936 ref
= make_aggr_type (code
);
12937 TYPE_CONTEXT (ref
) = context
;
12939 #ifdef NONNESTED_CLASSES
12940 /* Class types don't nest the way enums do. */
12941 class_binding_level
= (struct binding_level
*)0;
12943 pushtag (name
, ref
, globalize
);
12944 class_binding_level
= old_b
;
12949 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12950 redeclare_class_template (ref
, current_template_parms
);
12953 /* Until the type is defined, tentatively accept whatever
12954 structure tag the user hands us. */
12955 if (!COMPLETE_TYPE_P (ref
)
12956 && ref
!= current_class_type
12957 /* Have to check this, in case we have contradictory tag info. */
12958 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12960 if (tag_code
== class_type
)
12961 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12962 else if (tag_code
== record_type
)
12963 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12966 TREE_TYPE (ref
) = attributes
;
12972 xref_tag_from_type (old
, id
, globalize
)
12976 tree code_type_node
;
12978 if (TREE_CODE (old
) == RECORD_TYPE
)
12979 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12980 ? class_type_node
: record_type_node
);
12982 code_type_node
= union_type_node
;
12984 if (id
== NULL_TREE
)
12985 id
= TYPE_IDENTIFIER (old
);
12987 return xref_tag (code_type_node
, id
, globalize
);
12990 /* REF is a type (named NAME), for which we have just seen some
12991 baseclasses. BINFO is a list of those baseclasses; the
12992 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12993 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12994 struct, or union. */
12997 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12998 tree code_type_node
;
13002 /* In the declaration `A : X, Y, ... Z' we mark all the types
13003 (A, X, Y, ..., Z) so we can check for duplicates. */
13008 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
13010 if (tag_code
== union_type
)
13012 cp_error ("derived union `%T' invalid", ref
);
13016 len
= list_length (binfo
);
13018 /* First, make sure that any templates in base-classes are
13019 instantiated. This ensures that if we call ourselves recursively
13020 we do not get confused about which classes are marked and which
13022 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
13023 complete_type (TREE_VALUE (base
));
13025 SET_CLASSTYPE_MARKED (ref
);
13026 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
13028 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
13030 /* The base of a derived struct is public by default. */
13032 = (TREE_PURPOSE (binfo
) == access_public_node
13033 || TREE_PURPOSE (binfo
) == access_public_virtual_node
13034 || (tag_code
!= class_type
13035 && (TREE_PURPOSE (binfo
) == access_default_node
13036 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
13038 = (TREE_PURPOSE (binfo
) == access_protected_node
13039 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
13041 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
13042 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
13043 || TREE_PURPOSE (binfo
) == access_public_virtual_node
13044 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
13045 tree basetype
= TREE_VALUE (binfo
);
13048 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
13049 basetype
= TREE_TYPE (basetype
);
13051 || (TREE_CODE (basetype
) != RECORD_TYPE
13052 && TREE_CODE (basetype
) != TYPENAME_TYPE
13053 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
13054 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
13056 cp_error ("base type `%T' fails to be a struct or class type",
13057 TREE_VALUE (binfo
));
13061 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
13063 /* This code replaces similar code in layout_basetypes.
13064 We put the complete_type first for implicit `typename'. */
13065 if (!COMPLETE_TYPE_P (basetype
)
13066 && ! (current_template_parms
&& uses_template_parms (basetype
)))
13068 cp_error ("base class `%T' has incomplete type", basetype
);
13073 if (CLASSTYPE_MARKED (basetype
))
13075 if (basetype
== ref
)
13076 cp_error ("recursive type `%T' undefined", basetype
);
13078 cp_error ("duplicate base type `%T' invalid", basetype
);
13082 if (TYPE_FOR_JAVA (basetype
)
13083 && (current_lang_stack
13084 == &VARRAY_TREE (current_lang_base
, 0)))
13085 TYPE_FOR_JAVA (ref
) = 1;
13087 /* Note that the BINFO records which describe individual
13088 inheritances are *not* shared in the lattice! They
13089 cannot be shared because a given baseclass may be
13090 inherited with different `accessibility' by different
13091 derived classes. (Each BINFO record describing an
13092 individual inheritance contains flags which say what
13093 the `accessibility' of that particular inheritance is.) */
13096 = make_binfo (size_zero_node
, basetype
,
13097 CLASS_TYPE_P (basetype
)
13098 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
13099 CLASS_TYPE_P (basetype
)
13100 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
13102 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
13103 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
13104 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
13105 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
13106 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
13108 /* We need to unshare the binfos now so that lookups during class
13109 definition work. */
13110 unshare_base_binfos (base_binfo
);
13112 SET_CLASSTYPE_MARKED (basetype
);
13114 /* We are free to modify these bits because they are meaningless
13115 at top level, and BASETYPE is a top-level type. */
13116 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
13118 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
13119 /* Converting to a virtual base class requires looking
13120 up the offset of the virtual base. */
13121 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13124 if (CLASS_TYPE_P (basetype
))
13126 TYPE_HAS_NEW_OPERATOR (ref
)
13127 |= TYPE_HAS_NEW_OPERATOR (basetype
);
13128 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
13129 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
13130 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
13131 /* If the base-class uses multiple inheritance, so do we. */
13132 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
13133 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
13134 /* Likewise, if converting to a base of the base may require
13135 code, then we may need to generate code to convert to a
13137 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
13138 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
13145 TREE_VEC_LENGTH (binfos
) = i
;
13147 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
13151 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
13152 /* If there is more than one non-empty they cannot be at the same
13154 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13157 /* Unmark all the types. */
13159 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
13160 CLEAR_CLASSTYPE_MARKED (ref
);
13162 /* Now that we know all the base-classes, set up the list of virtual
13164 get_vbase_types (ref
);
13168 /* Begin compiling the definition of an enumeration type.
13169 NAME is its name (or null if anonymous).
13170 Returns the type object, as yet incomplete.
13171 Also records info about it so that build_enumerator
13172 may be used to declare the individual values as they are read. */
13178 register tree enumtype
= NULL_TREE
;
13179 struct binding_level
*b
= current_binding_level
;
13181 /* If this is the real definition for a previous forward reference,
13182 fill in the contents in the same object that used to be the
13183 forward reference. */
13185 if (name
!= NULL_TREE
)
13186 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
13188 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
13190 cp_error ("multiple definition of `%#T'", enumtype
);
13191 cp_error_at ("previous definition here", enumtype
);
13192 /* Clear out TYPE_VALUES, and start again. */
13193 TYPE_VALUES (enumtype
) = NULL_TREE
;
13197 enumtype
= make_node (ENUMERAL_TYPE
);
13198 pushtag (name
, enumtype
, 0);
13201 if (current_class_type
)
13202 TREE_ADDRESSABLE (b
->tags
) = 1;
13204 GNU_xref_decl (current_function_decl
, enumtype
);
13208 /* After processing and defining all the values of an enumeration type,
13209 install their decls in the enumeration type and finish it off.
13210 ENUMTYPE is the type object and VALUES a list of name-value pairs.
13211 Returns ENUMTYPE. */
13214 finish_enum (enumtype
)
13217 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
13218 /* Calculate the maximum value of any enumerator in this type. */
13220 tree values
= TYPE_VALUES (enumtype
);
13225 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
13230 /* The TREE_VALUE is a CONST_DECL for this enumeration
13232 decl
= TREE_VALUE (pair
);
13236 Following the closing brace of an enum-specifier, each
13237 enumerator has the type of its enumeration. Prior to the
13238 closing brace, the type of each enumerator is the type of
13239 its initializing value. */
13240 TREE_TYPE (decl
) = enumtype
;
13242 /* The DECL_INITIAL will be NULL if we are processing a
13243 template declaration and this enumeration constant had no
13244 explicit initializer. */
13245 value
= DECL_INITIAL (decl
);
13246 if (value
&& !processing_template_decl
)
13248 /* Set the TREE_TYPE for the VALUE as well. That's so
13249 that when we call decl_constant_value we get an
13250 entity of the right type (but with the constant
13251 value). Since we shouldn't ever call
13252 decl_constant_value on a template type, there's no
13253 reason to do that when processing_template_decl.
13254 And, if the expression is something like a
13255 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13256 wreak havoc on the intended type of the expression.
13258 Of course, there's also no point in trying to compute
13259 minimum or maximum values if we're in a template. */
13260 TREE_TYPE (value
) = enumtype
;
13263 minnode
= maxnode
= value
;
13264 else if (tree_int_cst_lt (maxnode
, value
))
13266 else if (tree_int_cst_lt (value
, minnode
))
13270 if (processing_template_decl
)
13271 /* If this is just a template, leave the CONST_DECL
13272 alone. That way tsubst_copy will find CONST_DECLs for
13273 CONST_DECLs, and not INTEGER_CSTs. */
13276 /* In the list we're building up, we want the enumeration
13277 values, not the CONST_DECLs. */
13278 TREE_VALUE (pair
) = value
;
13282 maxnode
= minnode
= integer_zero_node
;
13284 TYPE_VALUES (enumtype
) = nreverse (values
);
13286 if (processing_template_decl
)
13288 tree scope
= current_scope ();
13289 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13290 add_stmt (build_min (TAG_DEFN
, enumtype
));
13294 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13295 int lowprec
= min_precision (minnode
, unsignedp
);
13296 int highprec
= min_precision (maxnode
, unsignedp
);
13297 int precision
= MAX (lowprec
, highprec
);
13300 TYPE_SIZE (enumtype
) = NULL_TREE
;
13302 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13304 TYPE_PRECISION (enumtype
) = precision
;
13306 fixup_unsigned_type (enumtype
);
13308 fixup_signed_type (enumtype
);
13310 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13311 /* Use the width of the narrowest normal C type which is wide
13313 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13316 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13318 TYPE_SIZE (enumtype
) = 0;
13319 layout_type (enumtype
);
13321 /* Fix up all variant types of this enum type. */
13322 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13323 tem
= TYPE_NEXT_VARIANT (tem
))
13325 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13326 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13327 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13328 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13329 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13330 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13331 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13332 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13333 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13334 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13337 /* Finish debugging output for this type. */
13338 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13344 /* Build and install a CONST_DECL for an enumeration constant of the
13345 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13346 Assignment of sequential values by default is handled here. */
13349 build_enumerator (name
, value
, enumtype
)
13359 /* Remove no-op casts from the value. */
13361 STRIP_TYPE_NOPS (value
);
13363 if (! processing_template_decl
)
13365 /* Validate and default VALUE. */
13366 if (value
!= NULL_TREE
)
13368 value
= decl_constant_value (value
);
13370 if (TREE_CODE (value
) == INTEGER_CST
)
13372 value
= default_conversion (value
);
13373 constant_expression_warning (value
);
13377 cp_error ("enumerator value for `%D' not integer constant", name
);
13382 /* Default based on previous value. */
13383 if (value
== NULL_TREE
&& ! processing_template_decl
)
13387 if (TYPE_VALUES (enumtype
))
13389 /* The next value is the previous value ... */
13390 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13391 /* ... plus one. */
13392 value
= cp_build_binary_op (PLUS_EXPR
,
13396 if (tree_int_cst_lt (value
, prev_value
))
13397 cp_error ("overflow in enumeration values at `%D'", name
);
13400 value
= integer_zero_node
;
13403 /* Remove no-op casts from the value. */
13405 STRIP_TYPE_NOPS (value
);
13407 /* To fix MAX_VAL enum consts. (bkoz) */
13408 TREE_TYPE (value
) = integer_type_node
;
13412 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13413 Even in other cases, we will later (in finish_enum) be setting
13414 the type of VALUE. But, we don't need to make a copy if this
13415 VALUE is one of the enumeration constants for this same
13416 enumeration type. */
13417 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13418 if (TREE_VALUE (values
) == value
)
13420 /* If we didn't break out of the loop, then we do need a copy. */
13421 if (!values
&& value
)
13422 value
= copy_node (value
);
13424 /* C++ associates enums with global, function, or class declarations. */
13425 context
= current_scope ();
13427 /* Build the actual enumeration constant. Note that the enumeration
13428 constants have the type of their initializers until the
13429 enumeration is complete:
13433 Following the closing brace of an enum-specifier, each enumer-
13434 ator has the type of its enumeration. Prior to the closing
13435 brace, the type of each enumerator is the type of its
13436 initializing value.
13438 In finish_enum we will reset the type. Of course, if we're
13439 processing a template, there may be no value. */
13440 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13442 if (context
&& context
== current_class_type
)
13443 /* This enum declaration is local to the class. We need the full
13444 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13445 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13447 /* It's a global enum, or it's local to a function. (Note local to
13448 a function could mean local to a class method. */
13449 decl
= build_decl (CONST_DECL
, name
, type
);
13451 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13452 DECL_INITIAL (decl
) = value
;
13453 TREE_READONLY (decl
) = 1;
13455 if (context
&& context
== current_class_type
)
13456 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13457 on the TYPE_FIELDS list for `S'. (That's so that you can say
13458 things like `S::i' later.) */
13459 finish_member_declaration (decl
);
13463 GNU_xref_decl (current_function_decl
, decl
);
13466 /* Add this enumeration constant to the list for this type. */
13467 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13471 /* We're defining DECL. Make sure that it's type is OK. */
13474 check_function_type (decl
, current_function_parms
)
13476 tree current_function_parms
;
13478 tree fntype
= TREE_TYPE (decl
);
13479 tree return_type
= complete_type (TREE_TYPE (fntype
));
13481 /* In a function definition, arg types must be complete. */
13482 require_complete_types_for_parms (current_function_parms
);
13484 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13486 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13488 /* Make it return void instead, but don't change the
13489 type of the DECL_RESULT, in case we have a named return value. */
13490 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13492 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13494 = build_cplus_method_type (ctype
,
13496 FUNCTION_ARG_CHAIN (decl
));
13500 = build_function_type (void_type_node
,
13501 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13503 = build_exception_variant (fntype
,
13504 TYPE_RAISES_EXCEPTIONS (fntype
));
13507 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13510 /* Create the FUNCTION_DECL for a function definition.
13511 DECLSPECS and DECLARATOR are the parts of the declaration;
13512 they describe the function's name and the type it returns,
13513 but twisted together in a fashion that parallels the syntax of C.
13515 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13516 DECLARATOR is really the DECL for the function we are about to
13517 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13518 indicating that the function is an inline defined in-class.
13520 This function creates a binding context for the function body
13521 as well as setting up the FUNCTION_DECL in current_function_decl.
13523 Returns 1 on success. If the DECLARATOR is not suitable for a function
13524 (it defines a datum instead), we return 0, which tells
13525 yyparse to report a parse error.
13527 For C++, we must first check whether that datum makes any sense.
13528 For example, "class A local_a(1,2);" means that variable local_a
13529 is an aggregate of type A, which should have a constructor
13530 applied to it with the argument list [1, 2]. */
13533 start_function (declspecs
, declarator
, attrs
, flags
)
13534 tree declspecs
, declarator
, attrs
;
13538 tree ctype
= NULL_TREE
;
13541 extern int have_extern_spec
;
13542 extern int used_extern_spec
;
13543 int doing_friend
= 0;
13544 struct binding_level
*bl
;
13545 tree current_function_parms
;
13547 /* Sanity check. */
13548 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13549 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13551 /* This should only be done once on the top most decl. */
13552 if (have_extern_spec
&& !used_extern_spec
)
13554 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13555 used_extern_spec
= 1;
13558 if (flags
& SF_PRE_PARSED
)
13560 decl1
= declarator
;
13562 fntype
= TREE_TYPE (decl1
);
13563 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13564 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13566 /* ISO C++ 11.4/5. A friend function defined in a class is in
13567 the (lexical) scope of the class in which it is defined. */
13568 if (!ctype
&& DECL_FRIEND_P (decl1
))
13570 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13572 /* CTYPE could be null here if we're dealing with a template;
13573 for example, `inline friend float foo()' inside a template
13574 will have no CTYPE set. */
13575 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13581 last_function_parms
= DECL_ARGUMENTS (decl1
);
13582 last_function_parm_tags
= NULL_TREE
;
13586 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13587 /* If the declarator is not suitable for a function definition,
13588 cause a syntax error. */
13589 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13591 fntype
= TREE_TYPE (decl1
);
13593 restype
= TREE_TYPE (fntype
);
13594 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13596 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13597 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13598 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13599 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13600 fntype
= build_function_type (integer_type_node
,
13601 TYPE_ARG_TYPES (fntype
));
13603 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13605 TYPE_ARG_TYPES (fntype
));
13606 TREE_TYPE (decl1
) = fntype
;
13609 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13610 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13611 else if (DECL_MAIN_P (decl1
))
13613 /* If this doesn't return integer_type, complain. */
13614 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13616 if (pedantic
|| warn_return_type
)
13617 pedwarn ("return type for `main' changed to `int'");
13618 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13623 /* Sometimes we don't notice that a function is a static member, and
13624 build a METHOD_TYPE for it. Fix that up now. */
13625 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13626 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13628 revert_static_member_fn (decl1
);
13629 last_function_parms
= TREE_CHAIN (last_function_parms
);
13633 /* Warn if function was previously implicitly declared
13634 (but not if we warned then). */
13635 if (! warn_implicit
13636 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13637 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13639 /* Set up current_class_type, and enter the scope of the class, if
13642 push_nested_class (ctype
, 1);
13643 else if (DECL_STATIC_FUNCTION_P (decl1
))
13644 push_nested_class (DECL_CONTEXT (decl1
), 2);
13646 /* Now that we have entered the scope of the class, we must restore
13647 the bindings for any template parameters surrounding DECL1, if it
13648 is an inline member template. (Order is important; consider the
13649 case where a template parameter has the same name as a field of
13650 the class.) It is not until after this point that
13651 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13652 if (flags
& SF_INCLASS_INLINE
)
13653 maybe_begin_member_template_processing (decl1
);
13655 /* Effective C++ rule 15. */
13657 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13658 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13659 cp_warning ("`operator=' should return a reference to `*this'");
13661 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13662 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13663 if (!DECL_INITIAL (decl1
))
13664 DECL_INITIAL (decl1
) = error_mark_node
;
13666 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13667 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13670 /* This function exists in static storage.
13671 (This does not mean `static' in the C sense!) */
13672 TREE_STATIC (decl1
) = 1;
13674 /* We must call push_template_decl after current_class_type is set
13675 up. (If we are processing inline definitions after exiting a
13676 class scope, current_class_type will be NULL_TREE until set above
13677 by push_nested_class.) */
13678 if (processing_template_decl
)
13679 decl1
= push_template_decl (decl1
);
13681 /* We are now in the scope of the function being defined. */
13682 current_function_decl
= decl1
;
13684 /* Save the parm names or decls from this function's declarator
13685 where store_parm_decls will find them. */
13686 current_function_parms
= last_function_parms
;
13687 current_function_parm_tags
= last_function_parm_tags
;
13689 /* Make sure the parameter and return types are reasonable. When
13690 you declare a function, these types can be incomplete, but they
13691 must be complete when you define the function. */
13692 if (! processing_template_decl
)
13693 check_function_type (decl1
, current_function_parms
);
13695 /* Build the return declaration for the function. */
13696 restype
= TREE_TYPE (fntype
);
13697 if (!processing_template_decl
)
13699 if (!DECL_RESULT (decl1
))
13701 DECL_RESULT (decl1
)
13702 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13703 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13704 DECL_RESULT (decl1
));
13708 /* Just use `void'. Nobody will ever look at this anyhow. */
13709 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13711 /* Initialize RTL machinery. We cannot do this until
13712 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13713 even when processing a template; this is how we get
13714 CFUN set up, and our per-function variables initialized. */
13715 bl
= current_binding_level
;
13716 init_function_start (decl1
, input_filename
, lineno
);
13717 current_binding_level
= bl
;
13719 /* Even though we're inside a function body, we still don't want to
13720 call expand_expr to calculate the size of a variable-sized array.
13721 We haven't necessarily assigned RTL to all variables yet, so it's
13722 not safe to try to expand expressions involving them. */
13723 immediate_size_expand
= 0;
13724 cfun
->x_dont_save_pending_sizes_p
= 1;
13726 /* Start the statement-tree, start the tree now. */
13727 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13729 /* Let the user know we're compiling this function. */
13730 announce_function (decl1
);
13732 /* Record the decl so that the function name is defined.
13733 If we already have a decl for this name, and it is a FUNCTION_DECL,
13734 use the old decl. */
13735 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13737 /* A specialization is not used to guide overload resolution. */
13738 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13739 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13740 decl1
= pushdecl (decl1
);
13743 /* We need to set the DECL_CONTEXT. */
13744 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13745 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13746 /* And make sure we have enough default args. */
13747 check_default_args (decl1
);
13749 fntype
= TREE_TYPE (decl1
);
13752 /* Reset these in case the call to pushdecl changed them. */
13753 current_function_decl
= decl1
;
13754 cfun
->decl
= decl1
;
13756 /* If we are (erroneously) defining a function that we have already
13757 defined before, wipe out what we knew before. */
13758 if (!DECL_PENDING_INLINE_P (decl1
)
13759 && DECL_SAVED_FUNCTION_DATA (decl1
))
13761 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13762 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13765 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13767 /* We know that this was set up by `grokclassfn'. We do not
13768 wait until `store_parm_decls', since evil parse errors may
13769 never get us to that point. Here we keep the consistency
13770 between `current_class_type' and `current_class_ptr'. */
13771 tree t
= DECL_ARGUMENTS (decl1
);
13773 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13775 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13778 cp_function_chain
->x_current_class_ref
13779 = build_indirect_ref (t
, NULL_PTR
);
13780 cp_function_chain
->x_current_class_ptr
= t
;
13782 /* Constructors and destructors need to know whether they're "in
13783 charge" of initializing virtual base classes. */
13784 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13785 current_in_charge_parm
= TREE_CHAIN (t
);
13788 if (DECL_INTERFACE_KNOWN (decl1
))
13790 tree ctx
= decl_function_context (decl1
);
13792 if (DECL_NOT_REALLY_EXTERN (decl1
))
13793 DECL_EXTERNAL (decl1
) = 0;
13795 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13796 && TREE_PUBLIC (ctx
))
13797 /* This is a function in a local class in an extern inline
13799 comdat_linkage (decl1
);
13801 /* If this function belongs to an interface, it is public.
13802 If it belongs to someone else's interface, it is also external.
13803 This only affects inlines and template instantiations. */
13804 else if (interface_unknown
== 0
13805 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13806 || flag_alt_external_templates
))
13808 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13809 || processing_template_decl
)
13811 DECL_EXTERNAL (decl1
)
13813 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13814 && !DECL_VINDEX (decl1
)));
13816 /* For WIN32 we also want to put these in linkonce sections. */
13817 maybe_make_one_only (decl1
);
13820 DECL_EXTERNAL (decl1
) = 0;
13821 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13822 DECL_INTERFACE_KNOWN (decl1
) = 1;
13824 else if (interface_unknown
&& interface_only
13825 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13826 || flag_alt_external_templates
))
13828 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13829 interface, we will have interface_only set but not
13830 interface_known. In that case, we don't want to use the normal
13831 heuristics because someone will supply a #pragma implementation
13832 elsewhere, and deducing it here would produce a conflict. */
13833 comdat_linkage (decl1
);
13834 DECL_EXTERNAL (decl1
) = 0;
13835 DECL_INTERFACE_KNOWN (decl1
) = 1;
13836 DECL_DEFER_OUTPUT (decl1
) = 1;
13840 /* This is a definition, not a reference.
13841 So clear DECL_EXTERNAL. */
13842 DECL_EXTERNAL (decl1
) = 0;
13844 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13845 && ! DECL_INTERFACE_KNOWN (decl1
)
13846 /* Don't try to defer nested functions for now. */
13847 && ! decl_function_context (decl1
))
13848 DECL_DEFER_OUTPUT (decl1
) = 1;
13850 DECL_INTERFACE_KNOWN (decl1
) = 1;
13854 current_binding_level
->parm_flag
= 1;
13857 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13859 /* We need to do this even if we aren't expanding yet so that
13860 assemble_external works. */
13861 make_function_rtl (decl1
);
13863 /* Promote the value to int before returning it. */
13864 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13865 restype
= type_promotes_to (restype
);
13867 /* If this fcn was already referenced via a block-scope `extern' decl
13868 (or an implicit decl), propagate certain information about the usage. */
13869 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13870 TREE_ADDRESSABLE (decl1
) = 1;
13872 if (DECL_RESULT (decl1
) == NULL_TREE
)
13874 DECL_RESULT (decl1
)
13875 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13876 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13877 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13882 if (DECL_DESTRUCTOR_P (decl1
))
13884 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13885 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13887 /* Under the old ABI we return `this' from constructors, so we make
13888 ordinary `return' statements in constructors jump to CTOR_LABEL;
13889 from there we return `this'. Under the new ABI, we don't bother
13890 with any of this. By not setting CTOR_LABEL the remainder of the
13891 machinery is automatically disabled. */
13892 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13894 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13895 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13898 store_parm_decls (current_function_parms
);
13903 /* Store the parameter declarations into the current function declaration.
13904 This is called after parsing the parameter declarations, before
13905 digesting the body of the function.
13907 Also install to binding contour return value identifier, if any. */
13910 store_parm_decls (current_function_parms
)
13911 tree current_function_parms
;
13913 register tree fndecl
= current_function_decl
;
13914 register tree parm
;
13915 int parms_have_cleanups
= 0;
13916 tree cleanups
= NULL_TREE
;
13918 /* This is a list of types declared among parms in a prototype. */
13919 tree parmtags
= current_function_parm_tags
;
13921 /* This is a chain of any other decls that came in among the parm
13922 declarations. If a parm is declared with enum {foo, bar} x;
13923 then CONST_DECLs for foo and bar are put here. */
13924 tree nonparms
= NULL_TREE
;
13926 if (current_function_parms
)
13928 /* This case is when the function was defined with an ANSI prototype.
13929 The parms already have decls, so we need not do anything here
13930 except record them as in effect
13931 and complain if any redundant old-style parm decls were written. */
13933 tree specparms
= current_function_parms
;
13936 /* Must clear this because it might contain TYPE_DECLs declared
13938 storedecls (NULL_TREE
);
13940 /* If we're doing semantic analysis, then we'll call pushdecl
13941 for each of these. We must do them in reverse order so that
13942 they end in the correct forward order. */
13943 specparms
= nreverse (specparms
);
13945 for (parm
= specparms
; parm
; parm
= next
)
13947 next
= TREE_CHAIN (parm
);
13948 if (TREE_CODE (parm
) == PARM_DECL
)
13952 if (DECL_NAME (parm
) == NULL_TREE
13953 || TREE_CODE (parm
) != VOID_TYPE
)
13956 cp_error ("parameter `%D' declared void", parm
);
13958 cleanup
= (processing_template_decl
13960 : maybe_build_cleanup (parm
));
13963 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13967 /* If we find an enum constant or a type tag,
13968 put it aside for the moment. */
13969 TREE_CHAIN (parm
) = NULL_TREE
;
13970 nonparms
= chainon (nonparms
, parm
);
13974 /* Get the decls in their original chain order and record in the
13975 function. This is all and only the PARM_DECLs that were
13976 pushed into scope by the loop above. */
13977 DECL_ARGUMENTS (fndecl
) = getdecls ();
13978 storetags (chainon (parmtags
, gettags ()));
13981 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13983 /* Now store the final chain of decls for the arguments
13984 as the decl-chain of the current lexical scope.
13985 Put the enumerators in as well, at the front so that
13986 DECL_ARGUMENTS is not modified. */
13987 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13989 /* Now that we have initialized the parms, we can start their
13990 cleanups. We cannot do this before, since expand_decl_cleanup
13991 should not be called before the parm can be used. */
13994 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13995 TREE_VALUE (cleanups
));
13996 cleanups
= TREE_CHAIN (cleanups
);
13999 /* Create a binding contour which can be used to catch
14000 cleanup-generated temporaries. */
14001 if (parms_have_cleanups
)
14004 /* Do the starting of the exception specifications, if we have any. */
14005 if (flag_exceptions
&& !processing_template_decl
14006 && flag_enforce_eh_specs
14007 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14008 current_eh_spec_try_block
= expand_start_eh_spec ();
14012 /* We have finished doing semantic analysis on DECL, but have not yet
14013 generated RTL for its body. Save away our current state, so that
14014 when we want to generate RTL later we know what to do. */
14017 save_function_data (decl
)
14020 struct cp_language_function
*f
;
14022 /* Save the language-specific per-function data so that we can
14023 get it back when we really expand this function. */
14024 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
14028 f
= ((struct cp_language_function
*)
14029 xmalloc (sizeof (struct cp_language_function
)));
14030 bcopy ((char *) cp_function_chain
, (char *) f
,
14031 sizeof (struct cp_language_function
));
14032 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
14034 /* Clear out the bits we don't need. */
14035 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
14036 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
14037 f
->x_named_label_uses
= NULL
;
14038 f
->bindings
= NULL
;
14040 /* When we get back here again, we will be expanding. */
14041 f
->x_expanding_p
= 1;
14043 /* If we've already decided that we cannot inline this function, we
14044 must remember that fact when we actually go to expand the
14046 f
->cannot_inline
= current_function_cannot_inline
;
14049 /* At the end of every constructor we generate to code to return
14050 `this'. Do that now. */
14053 finish_constructor_body ()
14055 /* Any return from a constructor will end up here. */
14057 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
14059 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
14060 generate the return, rather than a goto to CTOR_LABEL. */
14061 ctor_label
= NULL_TREE
;
14062 /* In check_return_expr we translate an empty return from a
14063 constructor to a return of `this'. */
14064 finish_return_stmt (NULL_TREE
);
14065 /* Mark the end of the constructor. */
14066 add_stmt (build_stmt (CTOR_STMT
));
14069 /* At the end of every destructor we generate code to restore virtual
14070 function tables to the values desired by base classes and to call
14071 to base class destructors. Do that now. */
14074 finish_destructor_body ()
14076 tree compound_stmt
;
14081 /* Create a block to contain all the extra code. */
14082 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
14084 /* Any return from a destructor will end up here. */
14085 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
14087 /* Generate the code to call destructor on base class. If this
14088 destructor belongs to a class with virtual functions, then set
14089 the virtual function table pointer to represent the type of our
14092 /* This side-effect makes call to `build_delete' generate the code
14093 we have to have at the end of this destructor. `build_delete'
14094 will set the flag again. */
14095 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
14097 exprstmt
= build_delete (current_class_type
,
14099 sfk_base_destructor
,
14100 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
14103 if (exprstmt
!= error_mark_node
14104 && (TREE_CODE (exprstmt
) != NOP_EXPR
14105 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
14106 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
14108 if (exprstmt
!= void_zero_node
)
14109 /* Don't call `expand_expr_stmt' if we're not going to do
14110 anything, since -Wall will give a diagnostic. */
14111 finish_expr_stmt (exprstmt
);
14113 /* Run destructors for all virtual baseclasses. */
14114 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14119 if_stmt
= begin_if_stmt ();
14120 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14121 current_in_charge_parm
,
14125 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
14126 /* The CLASSTYPE_VBASECLASSES list is in initialization
14127 order, so we have to march through it in reverse order. */
14128 for (vbases
= nreverse (copy_list (vbases
));
14130 vbases
= TREE_CHAIN (vbases
))
14132 tree vbase
= TREE_VALUE (vbases
);
14134 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
14136 tree vb
= get_vbase
14137 (BINFO_TYPE (vbase
),
14138 TYPE_BINFO (current_class_type
));
14140 (build_scoped_method_call
14141 (current_class_ref
, vb
, base_dtor_identifier
,
14146 finish_then_clause (if_stmt
);
14151 virtual_size
= c_sizeof (current_class_type
);
14153 /* At the end, call delete if that's what's requested. */
14155 /* FDIS sez: At the point of definition of a virtual destructor
14156 (including an implicit definition), non-placement operator delete
14157 shall be looked up in the scope of the destructor's class and if
14158 found shall be accessible and unambiguous.
14160 This is somewhat unclear, but I take it to mean that if the class
14161 only defines placement deletes we don't do anything here. So we
14162 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14163 they ever try to delete one of these. */
14164 exprstmt
= build_op_delete_call
14165 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14166 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14168 if_stmt
= begin_if_stmt ();
14169 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14170 current_in_charge_parm
,
14173 finish_expr_stmt (exprstmt
);
14174 finish_then_clause (if_stmt
);
14177 /* Close the block we started above. */
14178 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
14181 /* Finish up a function declaration and compile that function
14182 all the way to assembler language output. The free the storage
14183 for the function definition.
14185 FLAGS is a bitwise or of the following values:
14187 An extra call to poplevel (and expand_end_bindings) must be
14188 made to take care of the binding contour for the base
14189 initializers. This is only relevant for constructors.
14191 We just finished processing the body of an in-class inline
14192 function definition. (This processing will have taken place
14193 after the class definition is complete.) */
14196 finish_function (flags
)
14199 register tree fndecl
= current_function_decl
;
14200 tree fntype
, ctype
= NULL_TREE
;
14201 int call_poplevel
= (flags
& 1) != 0;
14202 int inclass_inline
= (flags
& 2) != 0;
14205 /* When we get some parse errors, we can end up without a
14206 current_function_decl, so cope. */
14207 if (fndecl
== NULL_TREE
)
14208 return error_mark_node
;
14210 nested
= function_depth
> 1;
14211 fntype
= TREE_TYPE (fndecl
);
14213 /* TREE_READONLY (fndecl) = 1;
14214 This caused &foo to be of type ptr-to-const-function
14215 which then got a warning when stored in a ptr-to-function variable. */
14217 my_friendly_assert (building_stmt_tree (), 20000911);
14219 /* For a cloned function, we've already got all the code we need;
14220 there's no need to add any extra bits. */
14221 if (!DECL_CLONED_FUNCTION_P (fndecl
))
14223 if (DECL_CONSTRUCTOR_P (fndecl
))
14225 finish_constructor_body ();
14229 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
14230 finish_destructor_body ();
14231 else if (DECL_MAIN_P (fndecl
))
14233 /* Make it so that `main' always returns 0 by default. */
14235 finish_return_stmt (integer_one_node
);
14237 finish_return_stmt (integer_zero_node
);
14241 /* Finish dealing with exception specifiers. */
14242 if (flag_exceptions
&& !processing_template_decl
14243 && flag_enforce_eh_specs
14244 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14245 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14246 (TREE_TYPE (current_function_decl
)),
14247 current_eh_spec_try_block
);
14250 /* If we're saving up tree structure, tie off the function now. */
14251 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14253 /* This must come after expand_function_end because cleanups might
14254 have declarations (from inline functions) that need to go into
14255 this function's blocks. */
14256 if (current_binding_level
->parm_flag
!= 1)
14257 my_friendly_abort (122);
14258 poplevel (1, 0, 1);
14260 /* Remember that we were in class scope. */
14261 if (current_class_name
)
14262 ctype
= current_class_type
;
14264 /* Must mark the RESULT_DECL as being in this function. */
14265 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14267 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14268 to the FUNCTION_DECL node itself. */
14269 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14271 /* Save away current state, if appropriate. */
14272 if (!processing_template_decl
)
14273 save_function_data (fndecl
);
14275 /* If this function calls `setjmp' it cannot be inlined. When
14276 `longjmp' is called it is not guaranteed to restore the value of
14277 local variables that have been modified since the call to
14278 `setjmp'. So, if were to inline this function into some caller
14279 `c', then when we `longjmp', we might not restore all variables
14280 in `c'. (It might seem, at first blush, that there's no way for
14281 this function to modify local variables in `c', but their
14282 addresses may have been stored somewhere accessible to this
14284 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14285 DECL_UNINLINABLE (fndecl
) = 1;
14287 /* Clear out memory we no longer need. */
14288 free_after_parsing (cfun
);
14289 /* Since we never call rest_of_compilation, we never clear
14290 CFUN. Do so explicitly. */
14291 free_after_compilation (cfun
);
14294 /* If this is a in-class inline definition, we may have to pop the
14295 bindings for the template parameters that we added in
14296 maybe_begin_member_template_processing when start_function was
14298 if (inclass_inline
)
14299 maybe_end_member_template_processing ();
14301 /* Leave the scope of the class. */
14303 pop_nested_class ();
14309 /* Let the error reporting routines know that we're outside a
14310 function. For a nested function, this value is used in
14311 pop_cp_function_context and then reset via pop_function_context. */
14312 current_function_decl
= NULL_TREE
;
14317 /* Create the FUNCTION_DECL for a function definition.
14318 DECLSPECS and DECLARATOR are the parts of the declaration;
14319 they describe the return type and the name of the function,
14320 but twisted together in a fashion that parallels the syntax of C.
14322 This function creates a binding context for the function body
14323 as well as setting up the FUNCTION_DECL in current_function_decl.
14325 Returns a FUNCTION_DECL on success.
14327 If the DECLARATOR is not suitable for a function (it defines a datum
14328 instead), we return 0, which tells yyparse to report a parse error.
14330 May return void_type_node indicating that this method is actually
14331 a friend. See grokfield for more details.
14333 Came here with a `.pushlevel' .
14335 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14336 CHANGES TO CODE IN `grokfield'. */
14339 start_method (declspecs
, declarator
, attrlist
)
14340 tree declarator
, declspecs
, attrlist
;
14342 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14345 /* Something too ugly to handle. */
14346 if (fndecl
== NULL_TREE
)
14349 /* Pass friends other than inline friend functions back. */
14350 if (fndecl
== void_type_node
)
14353 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14354 /* Not a function, tell parser to report parse error. */
14357 if (DECL_IN_AGGR_P (fndecl
))
14359 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14361 if (DECL_CONTEXT (fndecl
)
14362 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14363 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14364 DECL_CONTEXT (fndecl
));
14366 return void_type_node
;
14369 check_template_shadow (fndecl
);
14371 DECL_THIS_INLINE (fndecl
) = 1;
14373 if (flag_default_inline
)
14374 DECL_INLINE (fndecl
) = 1;
14376 /* We process method specializations in finish_struct_1. */
14377 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14378 fndecl
= push_template_decl (fndecl
);
14380 if (! DECL_FRIEND_P (fndecl
))
14382 if (TREE_CHAIN (fndecl
))
14384 fndecl
= copy_node (fndecl
);
14385 TREE_CHAIN (fndecl
) = NULL_TREE
;
14388 if (DECL_CONSTRUCTOR_P (fndecl
))
14390 if (! grok_ctor_properties (current_class_type
, fndecl
))
14391 return void_type_node
;
14393 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14394 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14397 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14399 /* Make a place for the parms */
14401 current_binding_level
->parm_flag
= 1;
14403 DECL_IN_AGGR_P (fndecl
) = 1;
14407 /* Go through the motions of finishing a function definition.
14408 We don't compile this method until after the whole class has
14411 FINISH_METHOD must return something that looks as though it
14412 came from GROKFIELD (since we are defining a method, after all).
14414 This is called after parsing the body of the function definition.
14415 STMTS is the chain of statements that makes up the function body.
14417 DECL is the ..._DECL that `start_method' provided. */
14420 finish_method (decl
)
14423 register tree fndecl
= decl
;
14426 register tree link
;
14428 if (decl
== void_type_node
)
14431 old_initial
= DECL_INITIAL (fndecl
);
14433 /* Undo the level for the parms (from start_method).
14434 This is like poplevel, but it causes nothing to be
14435 saved. Saving information here confuses symbol-table
14436 output routines. Besides, this information will
14437 be correctly output when this method is actually
14440 /* Clear out the meanings of the local variables of this level;
14441 also record in each decl which block it belongs to. */
14443 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14445 if (DECL_NAME (link
) != NULL_TREE
)
14446 pop_binding (DECL_NAME (link
), link
);
14447 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14448 DECL_CONTEXT (link
) = NULL_TREE
;
14451 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14452 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14453 current_binding_level
->parm_flag
,
14454 current_binding_level
->keep
);
14456 poplevel (0, 0, 0);
14458 DECL_INITIAL (fndecl
) = old_initial
;
14460 /* We used to check if the context of FNDECL was different from
14461 current_class_type as another way to get inside here. This didn't work
14462 for String.cc in libg++. */
14463 if (DECL_FRIEND_P (fndecl
))
14465 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14466 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14467 decl
= void_type_node
;
14473 /* Called when a new struct TYPE is defined.
14474 If this structure or union completes the type of any previous
14475 variable declaration, lay it out and output its rtl. */
14478 hack_incomplete_structures (type
)
14482 struct binding_level
*level
;
14484 if (!type
) /* Don't do this for class templates. */
14487 if (namespace_bindings_p ())
14490 list
= &namespace_scope_incomplete
;
14494 level
= innermost_nonclass_level ();
14495 list
= &level
->incomplete
;
14502 tree decl
= TREE_VALUE (*list
);
14503 if ((decl
&& TREE_TYPE (decl
) == type
)
14504 || (TREE_TYPE (decl
)
14505 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14506 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14508 int toplevel
= toplevel_bindings_p ();
14509 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14510 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14511 layout_type (TREE_TYPE (decl
));
14512 layout_decl (decl
, 0);
14513 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14517 expand_decl (decl
);
14518 cleanup
= maybe_build_cleanup (decl
);
14519 expand_decl_init (decl
);
14520 if (! expand_decl_cleanup (decl
, cleanup
))
14521 cp_error ("parser lost in parsing declaration of `%D'",
14524 *list
= TREE_CHAIN (*list
);
14527 list
= &TREE_CHAIN (*list
);
14530 /* Keep looking through artificial binding levels generated
14531 for local variables. */
14532 if (level
&& level
->keep
== 2)
14534 level
= level
->level_chain
;
14535 list
= &level
->incomplete
;
14542 /* If DECL is of a type which needs a cleanup, build that cleanup
14546 maybe_build_cleanup (decl
)
14549 tree type
= TREE_TYPE (decl
);
14551 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14553 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14556 if (TREE_CODE (type
) == ARRAY_TYPE
)
14560 mark_addressable (decl
);
14561 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14564 /* Optimize for space over speed here. */
14565 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14566 || flag_expensive_optimizations
)
14567 flags
|= LOOKUP_NONVIRTUAL
;
14569 rval
= build_delete (TREE_TYPE (rval
), rval
,
14570 sfk_complete_destructor
, flags
, 0);
14572 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14573 && ! TYPE_HAS_DESTRUCTOR (type
))
14574 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14575 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14582 /* When a stmt has been parsed, this function is called. */
14587 /* Always assume this statement was not an expression statement. If
14588 it actually was an expression statement, its our callers
14589 responsibility to fix this up. */
14590 last_expr_type
= NULL_TREE
;
14593 /* DECL was originally constructed as a non-static member function,
14594 but turned out to be static. Update it accordingly. */
14597 revert_static_member_fn (decl
)
14601 tree function
= TREE_TYPE (decl
);
14602 tree args
= TYPE_ARG_TYPES (function
);
14604 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14605 != TYPE_UNQUALIFIED
)
14606 cp_error ("static member function `%#D' declared with type qualifiers",
14609 args
= TREE_CHAIN (args
);
14610 tmp
= build_function_type (TREE_TYPE (function
), args
);
14611 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14612 tmp
= build_exception_variant (tmp
,
14613 TYPE_RAISES_EXCEPTIONS (function
));
14614 TREE_TYPE (decl
) = tmp
;
14615 if (DECL_ARGUMENTS (decl
))
14616 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14617 DECL_STATIC_FUNCTION_P (decl
) = 1;
14620 /* Initialize the variables used during compilation of a C++
14624 push_cp_function_context (f
)
14625 struct function
*f
;
14627 struct cp_language_function
*p
14628 = ((struct cp_language_function
*)
14629 xcalloc (1, sizeof (struct cp_language_function
)));
14630 f
->language
= (struct language_function
*) p
;
14632 /* It takes an explicit call to expand_body to generate RTL for a
14636 /* Whenever we start a new function, we destroy temporaries in the
14638 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14641 /* Free the language-specific parts of F, now that we've finished
14642 compiling the function. */
14645 pop_cp_function_context (f
)
14646 struct function
*f
;
14649 free (f
->language
);
14653 /* Mark P for GC. */
14656 mark_lang_function (p
)
14657 struct cp_language_function
*p
;
14662 mark_c_language_function (&p
->base
);
14664 ggc_mark_tree (p
->x_ctor_label
);
14665 ggc_mark_tree (p
->x_dtor_label
);
14666 ggc_mark_tree (p
->x_current_class_ptr
);
14667 ggc_mark_tree (p
->x_current_class_ref
);
14668 ggc_mark_tree (p
->x_eh_spec_try_block
);
14670 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14671 mark_binding_level (&p
->bindings
);
14674 /* Mark the language-specific data in F for GC. */
14677 mark_cp_function_context (f
)
14678 struct function
*f
;
14680 mark_lang_function ((struct cp_language_function
*) f
->language
);
14687 enum tree_code code
= TREE_CODE (t
);
14688 if (code
== IDENTIFIER_NODE
)
14690 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14691 struct lang_id2
*li2
= li
->x
;
14692 ggc_mark_tree (li
->namespace_bindings
);
14693 ggc_mark_tree (li
->bindings
);
14694 ggc_mark_tree (li
->class_value
);
14695 ggc_mark_tree (li
->class_template_info
);
14699 ggc_mark_tree (li2
->label_value
);
14700 ggc_mark_tree (li2
->implicit_decl
);
14701 ggc_mark_tree (li2
->error_locus
);
14704 else if (code
== CPLUS_BINDING
)
14706 if (BINDING_HAS_LEVEL_P (t
))
14707 mark_binding_level (&BINDING_LEVEL (t
));
14709 ggc_mark_tree (BINDING_SCOPE (t
));
14710 ggc_mark_tree (BINDING_VALUE (t
));
14712 else if (code
== OVERLOAD
)
14713 ggc_mark_tree (OVL_FUNCTION (t
));
14714 else if (code
== TEMPLATE_PARM_INDEX
)
14715 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14716 else if (TREE_CODE_CLASS (code
) == 'd')
14718 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14723 c_mark_lang_decl (&ld
->decl_flags
.base
);
14724 if (!DECL_GLOBAL_CTOR_P (t
)
14725 && !DECL_GLOBAL_DTOR_P (t
)
14726 && !DECL_THUNK_P (t
))
14727 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14728 else if (DECL_THUNK_P (t
))
14729 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14730 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14731 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14733 mark_binding_level (&NAMESPACE_LEVEL (t
));
14734 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14736 ggc_mark_tree (ld
->befriending_classes
);
14737 ggc_mark_tree (ld
->context
);
14738 ggc_mark_tree (ld
->cloned_function
);
14739 if (!DECL_OVERLOADED_OPERATOR_P (t
))
14740 ggc_mark_tree (ld
->u2
.vtt_parm
);
14741 if (TREE_CODE (t
) == TYPE_DECL
)
14742 ggc_mark_tree (ld
->u
.sorted_fields
);
14743 else if (TREE_CODE (t
) == FUNCTION_DECL
14744 && !DECL_PENDING_INLINE_P (t
))
14745 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14749 else if (TREE_CODE_CLASS (code
) == 't')
14751 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14753 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14754 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14757 ggc_mark_tree (lt
->primary_base
);
14758 ggc_mark_tree (lt
->vfields
);
14759 ggc_mark_tree (lt
->vbases
);
14760 ggc_mark_tree (lt
->tags
);
14761 ggc_mark_tree (lt
->size
);
14762 ggc_mark_tree (lt
->pure_virtuals
);
14763 ggc_mark_tree (lt
->friend_classes
);
14764 ggc_mark_tree (lt
->rtti
);
14765 ggc_mark_tree (lt
->methods
);
14766 ggc_mark_tree (lt
->template_info
);
14767 ggc_mark_tree (lt
->befriending_classes
);
14770 /* In the case of pointer-to-member function types, the
14771 TYPE_LANG_SPECIFIC is really just a tree. */
14772 ggc_mark_tree ((tree
) lt
);