1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-98, 1999, 2000 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
48 #define obstack_chunk_alloc xmalloc
49 #define obstack_chunk_free free
51 extern struct obstack permanent_obstack;
53 extern int current_class_depth;
55 extern tree static_ctors, static_dtors;
57 extern tree global_namespace;
59 extern int (*valid_lang_attribute) PARAMS ((tree, tree, tree, tree));
61 /* Use garbage collection. */
65 #ifndef WCHAR_UNSIGNED
66 #define WCHAR_UNSIGNED 0
69 #ifndef CHAR_TYPE_SIZE
70 #define CHAR_TYPE_SIZE BITS_PER_UNIT
73 #ifndef BOOL_TYPE_SIZE
74 #ifdef SLOW_BYTE_ACCESS
75 /* In the new ABI, `bool' has size and alignment `1', on all
77 #define BOOL_TYPE_SIZE \
78 ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
80 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
84 /* We let tm.h override the types used here, to handle trivial differences
85 such as the choice of unsigned int or long unsigned int for size_t.
86 When machines start needing nontrivial differences in the size type,
87 it would be best to do something here to figure out automatically
88 from other information what type to use. */
91 #define SIZE_TYPE "long unsigned int"
95 #define PTRDIFF_TYPE "long int"
99 #define WCHAR_TYPE "int"
102 static tree grokparms PARAMS ((tree, int));
103 static const char *redeclaration_error_message PARAMS ((tree, tree));
105 static void push_binding_level PARAMS ((struct binding_level *, int,
107 static void pop_binding_level PARAMS ((void));
108 static void suspend_binding_level PARAMS ((void));
109 static void resume_binding_level PARAMS ((struct binding_level *));
110 static struct binding_level *make_binding_level PARAMS ((void));
111 static void declare_namespace_level PARAMS ((void));
112 static void signal_catch PARAMS ((int)) ATTRIBUTE_NORETURN;
113 static void storedecls PARAMS ((tree));
114 static void require_complete_types_for_parms PARAMS ((tree));
115 static void push_overloaded_decl_1 PARAMS ((tree));
116 static int ambi_op_p PARAMS ((tree));
117 static int unary_op_p PARAMS ((tree));
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 maybe_build_cleanup_1 PARAMS ((tree, tree));
122 static tree lookup_name_real PARAMS ((tree, int, int, int));
123 static void warn_extern_redeclared_static PARAMS ((tree, tree));
124 static void grok_reference_init PARAMS ((tree, tree, tree));
125 static tree grokfndecl PARAMS ((tree, tree, tree, tree, int,
126 enum overload_flags, tree,
127 tree, int, int, int, int, int, int, tree));
128 static tree grokvardecl PARAMS ((tree, tree, RID_BIT_TYPE *, int, int, tree));
129 static tree lookup_tag PARAMS ((enum tree_code, tree,
130 struct binding_level *, int));
131 static void set_identifier_type_value_with_scope
132 PARAMS ((tree, tree, struct binding_level *));
133 static void record_builtin_type PARAMS ((enum rid, const char *, tree));
134 static void record_unknown_type PARAMS ((tree, const char *));
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 void lang_print_error_function PARAMS ((const char *));
139 static tree maybe_process_template_type_declaration PARAMS ((tree, int, struct binding_level*));
140 static void check_for_uninitialized_const_var PARAMS ((tree));
141 static unsigned long typename_hash PARAMS ((hash_table_key));
142 static boolean typename_compare PARAMS ((hash_table_key, hash_table_key));
143 static void push_binding PARAMS ((tree, tree, struct binding_level*));
144 static int add_binding PARAMS ((tree, tree));
145 static void pop_binding PARAMS ((tree, tree));
146 static tree local_variable_p_walkfn PARAMS ((tree *, int *, void *));
147 static tree find_binding PARAMS ((tree, tree));
148 static tree select_decl PARAMS ((tree, int));
149 static int lookup_flags PARAMS ((int, int));
150 static tree qualify_lookup PARAMS ((tree, int));
151 static tree record_builtin_java_type PARAMS ((const char *, int));
152 static const char *tag_name PARAMS ((enum tag_types code));
153 static void find_class_binding_level PARAMS ((void));
154 static struct binding_level *innermost_nonclass_level PARAMS ((void));
155 static void warn_about_implicit_typename_lookup PARAMS ((tree, tree));
156 static int walk_namespaces_r PARAMS ((tree, walk_namespaces_fn, void *));
157 static int walk_globals_r PARAMS ((tree, void *));
158 static void add_decl_to_level PARAMS ((tree, struct binding_level *));
159 static tree make_label_decl PARAMS ((tree, int));
160 static void pop_label PARAMS ((tree));
161 static void pop_labels PARAMS ((tree));
162 static void maybe_deduce_size_from_array_init PARAMS ((tree, tree));
163 static void layout_var_decl PARAMS ((tree));
164 static void maybe_commonize_var PARAMS ((tree));
165 static tree check_initializer PARAMS ((tree, tree));
166 static void make_rtl_for_nonlocal_decl PARAMS ((tree, tree, const char *));
167 static void push_cp_function_context PARAMS ((struct function *));
168 static void pop_cp_function_context PARAMS ((struct function *));
169 static void mark_binding_level PARAMS ((void *));
170 static void mark_cp_function_context PARAMS ((struct function *));
171 static void mark_saved_scope PARAMS ((void *));
172 static void mark_lang_function PARAMS ((struct language_function *));
173 static void mark_stmt_tree PARAMS ((struct stmt_tree *));
174 static void save_function_data PARAMS ((tree));
175 static void check_function_type PARAMS ((tree));
176 static void destroy_local_var PARAMS ((tree));
177 static void finish_constructor_body PARAMS ((void));
178 static void finish_destructor_body PARAMS ((void));
179 static tree create_array_type_for_decl PARAMS ((tree, tree, tree));
180 static tree get_atexit_node PARAMS ((void));
181 static tree get_dso_handle_node PARAMS ((void));
182 static tree start_cleanup_fn PARAMS ((void));
183 static void end_cleanup_fn PARAMS ((void));
185 #if defined (DEBUG_CP_BINDING_LEVELS)
186 static void indent PARAMS ((void));
189 /* Erroneous argument lists can use this *IFF* they do not modify it. */
190 tree error_mark_list;
192 /* The following symbols are subsumed in the cp_global_trees array, and
193 listed here individually for documentation purposes.
196 tree wchar_decl_node;
199 tree vtable_entry_type;
200 tree delta_type_node;
203 tree __baselist_desc_type_node;
204 tree __i_desc_type_node, __m_desc_type_node;
205 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
207 tree __t_desc_type_node;
209 tree __tp_desc_type_node;
211 tree ti_desc_type_node;
212 tree bltn_desc_type_node, ptr_desc_type_node, ref_desc_type_node;
213 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
214 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
215 tree ptmd_desc_type_node;
216 tree base_desc_type_node;
218 Not needed yet? May be needed one day?
219 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
220 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
221 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
224 tree class_star_type_node;
225 tree class_type_node, record_type_node, union_type_node, enum_type_node;
226 tree unknown_type_node;
228 Array type `vtable_entry_type[]'
231 tree vtbl_ptr_type_node;
237 A FUNCTION_DECL which can call `abort'. Not necessarily the
238 one that the user will declare, but sufficient to be called
239 by routines that want to abort the program.
243 The FUNCTION_DECL for the default `::operator delete'.
245 tree global_delete_fndecl;
248 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
253 tree cp_global_trees[CPTI_MAX];
255 /* Indicates that there is a type value in some namespace, although
256 that is not necessarily in scope at the moment. */
258 static tree global_type_node;
263 /* Expect only namespace names now. */
264 static int only_namespace_names;
266 /* If original DECL_RESULT of current function was a register,
267 but due to being an addressable named return value, would up
268 on the stack, this variable holds the named return value's
269 original location. */
271 #define original_result_rtx cp_function_chain->x_result_rtx
273 struct named_label_list
275 struct binding_level *binding_level;
278 const char *filename_o_goto;
280 struct named_label_list *next;
283 /* Used only for jumps to as-yet undefined labels, since jumps to
284 defined labels can have their validity checked by stmt.c. */
286 #define named_label_uses cp_function_chain->x_named_label_uses
288 /* A list of objects which have constructors or destructors
289 which reside in the global scope. The decl is stored in
290 the TREE_VALUE slot and the initializer is stored
291 in the TREE_PURPOSE slot. */
292 tree static_aggregates;
296 /* A node for the integer constants 2, and 3. */
298 tree integer_two_node, integer_three_node;
300 /* Parsing a function declarator leaves here a chain of structure
301 and enum types declared in the parmlist. */
303 static tree last_function_parm_tags;
305 /* Similar, for last_function_parm_tags. */
306 tree last_function_parms;
307 static tree current_function_parm_tags;
309 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
310 that have names. Here so we can clear out their names' definitions
311 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
312 TREE_PURPOSE is the previous binding of the label. */
314 #define named_labels cp_function_chain->x_named_labels
316 /* The FUNCTION_DECL for the function currently being compiled,
317 or 0 if between functions. */
318 tree current_function_decl;
320 /* Set to 0 at beginning of a function definition, and whenever
321 a label (case or named) is defined. Set to value of expression
322 returned from function when that value can be transformed into
323 a named return value. */
325 tree current_function_return_value;
327 /* Nonzero means use the ISO C9x dialect of C. */
331 /* Nonzero means give `double' the same size as `float'. */
333 extern int flag_short_double;
335 /* Nonzero means don't recognize any builtin functions. */
337 extern int flag_no_builtin;
339 /* Nonzero means don't recognize the non-ANSI builtin functions.
342 extern int flag_no_nonansi_builtin;
344 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
346 extern int flag_huge_objects;
348 /* Nonzero if we want to conserve space in the .o files. We do this
349 by putting uninitialized data and runtime initialized data into
350 .common instead of .data at the expense of not flagging multiple
352 extern int flag_conserve_space;
354 /* C and C++ flags are in decl2.c. */
356 /* Flag used when debugging spew.c */
358 extern int spew_debug;
360 /* A expression of value 0 with the same precision as a sizetype
362 tree signed_size_zero_node;
364 /* The name of the anonymous namespace, throughout this translation
366 tree anonymous_namespace_name;
369 /* For each binding contour we allocate a binding_level structure
370 which records the names defined in that contour.
373 1) one for each function definition,
374 where internal declarations of the parameters appear.
375 2) one for each compound statement,
376 to record its declarations.
378 The current meaning of a name can be found by searching the levels
379 from the current one out to the global one.
381 Off to the side, may be the class_binding_level. This exists only
382 to catch class-local declarations. It is otherwise nonexistent.
384 Also there may be binding levels that catch cleanups that must be
385 run when exceptions occur. Thus, to see whether a name is bound in
386 the current scope, it is not enough to look in the
387 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
390 /* Note that the information in the `names' component of the global contour
391 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
395 /* A chain of _DECL nodes for all variables, constants, functions,
396 and typedef types. These are in the reverse of the order
397 supplied. There may be OVERLOADs on this list, too, but they
398 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
401 /* A list of structure, union and enum definitions, for looking up
403 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
404 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
405 or ENUMERAL_TYPE node.
407 C++: the TREE_VALUE nodes can be simple types for
408 component_bindings. */
411 /* A list of USING_DECL nodes. */
414 /* A list of used namespaces. PURPOSE is the namespace,
415 VALUE the common ancestor with this binding_level's namespace. */
416 tree using_directives;
418 /* If this binding level is the binding level for a class, then
419 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
420 is the name of an entity bound in the class; the TREE_VALUE is
421 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
422 when leaving class scope, we can restore the
423 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
424 the DECL bound by this name in the class. */
427 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
428 is used for all binding levels. */
431 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
432 label in this scope. The TREE_PURPOSE is the previous value of
433 the IDENTIFIER_LABEL VALUE. */
434 tree shadowed_labels;
436 /* For each level (except not the global one),
437 a chain of BLOCK nodes for all the levels
438 that were entered and exited one level down. */
441 /* The BLOCK node for this level, if one has been preallocated.
442 If 0, the BLOCK is allocated (if needed) when the level is popped. */
445 /* The binding level which this one is contained in (inherits from). */
446 struct binding_level *level_chain;
448 /* List of decls in `names' that have incomplete
449 structure or union types. */
452 /* List of VAR_DECLS saved from a previous for statement.
453 These would be dead in ANSI-conforming code, but might
454 be referenced in ARM-era code. These are stored in a
455 TREE_LIST; the TREE_VALUE is the actual declaration. */
456 tree dead_vars_from_for;
458 /* 1 for the level that holds the parameters of a function.
459 2 for the level that holds a class declaration.
460 3 for levels that hold parameter declarations. */
461 unsigned parm_flag : 4;
463 /* 1 means make a BLOCK for this level regardless of all else.
464 2 for temporary binding contours created by the compiler. */
467 /* Nonzero if this level "doesn't exist" for tags. */
468 unsigned tag_transparent : 1;
470 /* Nonzero if this level can safely have additional
471 cleanup-needing variables added to it. */
472 unsigned more_cleanups_ok : 1;
473 unsigned have_cleanups : 1;
475 /* Nonzero if this level is for storing the decls for template
476 parameters and generic decls; these decls will be discarded and
477 replaced with a TEMPLATE_DECL. */
478 unsigned pseudo_global : 1;
480 /* This is set for a namespace binding level. */
481 unsigned namespace_p : 1;
483 /* True if this level is that of a for-statement where we need to
484 worry about ambiguous (ARM or ANSI) scope rules. */
485 unsigned is_for_scope : 1;
487 /* True if this level corresponds to an EH region, as for a try block. */
488 unsigned eh_region : 1;
490 /* One bit left for this word. */
492 #if defined(DEBUG_CP_BINDING_LEVELS)
493 /* Binding depth at which this level began. */
494 unsigned binding_depth;
495 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
498 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
500 /* The binding level currently in effect. */
502 #define current_binding_level \
504 ? cp_function_chain->bindings \
505 : scope_chain->bindings)
507 /* The binding level of the current class, if any. */
509 #define class_binding_level scope_chain->class_bindings
511 /* A chain of binding_level structures awaiting reuse. */
513 static struct binding_level *free_binding_level;
515 /* The outermost binding level, for names of file scope.
516 This is created when the compiler is started and exists
517 through the entire run. */
519 static struct binding_level *global_binding_level;
521 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
523 static int keep_next_level_flag;
525 #if defined(DEBUG_CP_BINDING_LEVELS)
526 static int binding_depth = 0;
527 static int is_class_level = 0;
534 for (i = 0; i < binding_depth*2; i++)
537 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
539 static tree pushdecl_with_scope PARAMS ((tree, struct binding_level *));
542 push_binding_level (newlevel, tag_transparent, keep)
543 struct binding_level *newlevel;
544 int tag_transparent, keep;
546 /* Add this level to the front of the chain (stack) of levels that
548 bzero ((char*) newlevel, sizeof (struct binding_level));
549 newlevel->level_chain = current_binding_level;
550 current_binding_level = newlevel;
551 newlevel->tag_transparent = tag_transparent;
552 newlevel->more_cleanups_ok = 1;
554 /* We are called before expand_start_bindings, but after
555 expand_eh_region_start for a try block; so we check this now,
556 before the EH block is covered up. */
557 newlevel->eh_region = is_eh_region ();
559 newlevel->keep = keep;
560 #if defined(DEBUG_CP_BINDING_LEVELS)
561 newlevel->binding_depth = binding_depth;
563 fprintf (stderr, "push %s level 0x%08x line %d\n",
564 (is_class_level) ? "class" : "block", newlevel, lineno);
567 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
570 /* Find the innermost enclosing class scope, and reset
571 CLASS_BINDING_LEVEL appropriately. */
574 find_class_binding_level ()
576 struct binding_level *level = current_binding_level;
578 while (level && level->parm_flag != 2)
579 level = level->level_chain;
580 if (level && level->parm_flag == 2)
581 class_binding_level = level;
583 class_binding_level = 0;
589 if (global_binding_level)
591 /* Cannot pop a level, if there are none left to pop. */
592 if (current_binding_level == global_binding_level)
593 my_friendly_abort (123);
595 /* Pop the current level, and free the structure for reuse. */
596 #if defined(DEBUG_CP_BINDING_LEVELS)
599 fprintf (stderr, "pop %s level 0x%08x line %d\n",
600 (is_class_level) ? "class" : "block",
601 current_binding_level, lineno);
602 if (is_class_level != (current_binding_level == class_binding_level))
605 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
608 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
610 register struct binding_level *level = current_binding_level;
611 current_binding_level = current_binding_level->level_chain;
612 level->level_chain = free_binding_level;
613 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
614 if (level->binding_depth != binding_depth)
616 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
617 free_binding_level = level;
618 find_class_binding_level ();
623 suspend_binding_level ()
625 if (class_binding_level)
626 current_binding_level = class_binding_level;
628 if (global_binding_level)
630 /* Cannot suspend a level, if there are none left to suspend. */
631 if (current_binding_level == global_binding_level)
632 my_friendly_abort (123);
634 /* Suspend the current level. */
635 #if defined(DEBUG_CP_BINDING_LEVELS)
638 fprintf (stderr, "suspend %s level 0x%08x line %d\n",
639 (is_class_level) ? "class" : "block",
640 current_binding_level, lineno);
641 if (is_class_level != (current_binding_level == class_binding_level))
644 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
647 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
648 current_binding_level = current_binding_level->level_chain;
649 find_class_binding_level ();
653 resume_binding_level (b)
654 struct binding_level *b;
656 /* Resuming binding levels is meant only for namespaces,
657 and those cannot nest into classes. */
658 my_friendly_assert(!class_binding_level, 386);
659 /* Also, resuming a non-directly nested namespace is a no-no. */
660 my_friendly_assert(b->level_chain == current_binding_level, 386);
661 current_binding_level = b;
662 #if defined(DEBUG_CP_BINDING_LEVELS)
663 b->binding_depth = binding_depth;
665 fprintf (stderr, "resume %s level 0x%08x line %d\n",
666 (is_class_level) ? "class" : "block", b, lineno);
669 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
672 /* Create a new `struct binding_level'. */
675 struct binding_level *
676 make_binding_level ()
679 return (struct binding_level *) xmalloc (sizeof (struct binding_level));
682 /* Nonzero if we are currently in the global binding level. */
687 return current_binding_level == global_binding_level;
690 /* Return the innermost binding level that is not for a class scope. */
692 static struct binding_level *
693 innermost_nonclass_level ()
695 struct binding_level *b;
697 b = current_binding_level;
698 while (b->parm_flag == 2)
704 /* Nonzero if we are currently in a toplevel binding level. This
705 means either the global binding level or a namespace in a toplevel
706 binding level. Since there are no non-toplevel namespace levels,
707 this really means any namespace or pseudo-global level. We also
708 include a class whose context is toplevel. */
711 toplevel_bindings_p ()
713 struct binding_level *b = innermost_nonclass_level ();
715 return b->namespace_p || b->pseudo_global;
718 /* Nonzero if this is a namespace scope, or if we are defining a class
719 which is itself at namespace scope, or whose enclosing class is
720 such a class, etc. */
723 namespace_bindings_p ()
725 struct binding_level *b = innermost_nonclass_level ();
727 return b->namespace_p;
730 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
731 unconditionally. Otherwise, use the normal logic to decide whether
732 or not to create a BLOCK. */
735 keep_next_level (keep)
738 keep_next_level_flag = keep;
741 /* Nonzero if the current level needs to have a BLOCK made. */
746 return (current_binding_level->blocks != NULL_TREE
747 || current_binding_level->keep
748 || current_binding_level->names != NULL_TREE
749 || (current_binding_level->tags != NULL_TREE
750 && !current_binding_level->tag_transparent));
754 declare_pseudo_global_level ()
756 current_binding_level->pseudo_global = 1;
760 declare_namespace_level ()
762 current_binding_level->namespace_p = 1;
766 pseudo_global_level_p ()
768 return current_binding_level->pseudo_global;
772 set_class_shadows (shadows)
775 class_binding_level->class_shadowed = shadows;
778 /* Enter a new binding level.
779 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
780 not for that of tags. */
783 pushlevel (tag_transparent)
786 struct binding_level *newlevel;
788 if (cfun && !doing_semantic_analysis_p ())
791 /* Reuse or create a struct for this binding level. */
792 #if defined(DEBUG_CP_BINDING_LEVELS)
794 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
795 if (free_binding_level)
796 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
798 newlevel = free_binding_level;
799 free_binding_level = free_binding_level->level_chain;
802 newlevel = make_binding_level ();
804 push_binding_level (newlevel, tag_transparent, keep_next_level_flag);
805 GNU_xref_start_scope ((HOST_WIDE_INT) newlevel);
806 keep_next_level_flag = 0;
810 note_level_for_for ()
812 current_binding_level->is_for_scope = 1;
815 /* For a binding between a name and an entity at a block scope,
816 this is the `struct binding_level' for the block. */
817 #define BINDING_LEVEL(NODE) \
818 (((struct tree_binding*)NODE)->scope.level)
820 /* Make DECL the innermost binding for ID. The LEVEL is the binding
821 level at which this declaration is being bound. */
824 push_binding (id, decl, level)
827 struct binding_level* level;
831 binding = make_node (CPLUS_BINDING);
833 /* Now, fill in the binding information. */
834 BINDING_VALUE (binding) = decl;
835 BINDING_TYPE (binding) = NULL_TREE;
836 BINDING_LEVEL (binding) = level;
837 INHERITED_VALUE_BINDING_P (binding) = 0;
838 LOCAL_BINDING_P (binding) = (level != class_binding_level);
839 BINDING_HAS_LEVEL_P (binding) = 1;
841 /* And put it on the front of the list of bindings for ID. */
842 TREE_CHAIN (binding) = IDENTIFIER_BINDING (id);
843 IDENTIFIER_BINDING (id) = binding;
846 /* ID is already bound in the current scope. But, DECL is an
847 additional binding for ID in the same scope. This is the `struct
848 stat' hack whereby a non-typedef class-name or enum-name can be
849 bound at the same level as some other kind of entity. It's the
850 responsibility of the caller to check that inserting this name is
851 legal here. Returns nonzero if the new binding was successful. */
853 add_binding (id, decl)
857 tree binding = IDENTIFIER_BINDING (id);
860 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
861 /* The new name is the type name. */
862 BINDING_TYPE (binding) = decl;
863 else if (!BINDING_VALUE (binding))
864 /* This situation arises when push_class_level_binding moves an
865 inherited type-binding out of the way to make room for a new
867 BINDING_VALUE (binding) = decl;
868 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
869 && DECL_ARTIFICIAL (BINDING_VALUE (binding)))
871 /* The old binding was a type name. It was placed in
872 BINDING_VALUE because it was thought, at the point it was
873 declared, to be the only entity with such a name. Move the
874 type name into the type slot; it is now hidden by the new
876 BINDING_TYPE (binding) = BINDING_VALUE (binding);
877 BINDING_VALUE (binding) = decl;
878 INHERITED_VALUE_BINDING_P (binding) = 0;
880 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
881 && TREE_CODE (decl) == TYPE_DECL
882 && DECL_NAME (decl) == DECL_NAME (BINDING_VALUE (binding))
883 && same_type_p (TREE_TYPE (decl),
884 TREE_TYPE (BINDING_VALUE (binding))))
885 /* We have two typedef-names, both naming the same type to have
886 the same name. This is OK because of:
890 In a given scope, a typedef specifier can be used to redefine
891 the name of any type declared in that scope to refer to the
892 type to which it already refers. */
896 cp_error ("declaration of `%#D'", decl);
897 cp_error_at ("conflicts with previous declaration `%#D'",
898 BINDING_VALUE (binding));
905 /* Add DECL to the list of things declared in B. */
908 add_decl_to_level (decl, b)
910 struct binding_level *b;
912 /* We build up the list in reverse order, and reverse it later if
914 TREE_CHAIN (decl) = b->names;
918 /* Bind DECL to ID in the current_binding_level, assumed to be a local
919 binding level. If PUSH_USING is set in FLAGS, we know that DECL
920 doesn't really belong to this binding level, that it got here
921 through a using-declaration. */
924 push_local_binding (id, decl, flags)
929 struct binding_level *b;
931 /* Skip over any local classes. This makes sense if we call
932 push_local_binding with a friend decl of a local class. */
933 b = current_binding_level;
934 while (b->parm_flag == 2)
937 if (lookup_name_current_level (id))
939 /* Supplement the existing binding. */
940 if (!add_binding (id, decl))
941 /* It didn't work. Something else must be bound at this
942 level. Do not add DECL to the list of things to pop
947 /* Create a new binding. */
948 push_binding (id, decl, b);
950 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
951 /* We must put the OVERLOAD into a TREE_LIST since the
952 TREE_CHAIN of an OVERLOAD is already used. Similarly for
953 decls that got here through a using-declaration. */
954 decl = build_tree_list (NULL_TREE, decl);
956 /* And put DECL on the list of things declared by the current
958 add_decl_to_level (decl, b);
961 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
962 binding was successful. */
965 push_class_binding (id, decl)
970 tree binding = IDENTIFIER_BINDING (id);
973 /* Note that we declared this value so that we can issue an error if
974 this an illegal redeclaration of a name already used for some
976 note_name_declared_in_class (id, decl);
978 if (binding && BINDING_LEVEL (binding) == class_binding_level)
979 /* Supplement the existing binding. */
980 result = add_binding (id, decl);
982 /* Create a new binding. */
983 push_binding (id, decl, class_binding_level);
985 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
986 class-level declaration. Note that we do not use DECL here
987 because of the possibility of the `struct stat' hack; if DECL is
988 a class-name or enum-name we might prefer a field-name, or some
990 IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id));
992 /* If this is a binding from a base class, mark it as such. */
993 binding = IDENTIFIER_BINDING (id);
994 if (BINDING_VALUE (binding) == decl && TREE_CODE (decl) != TREE_LIST)
996 /* Any implicit typename must be from a base-class. The
997 context for an implicit typename declaration is always
998 the derived class in which the lookup was done, so the checks
999 based on the context of DECL below will not trigger. */
1000 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl))
1001 INHERITED_VALUE_BINDING_P (binding) = 1;
1004 if (TREE_CODE (decl) == OVERLOAD)
1005 context = DECL_REAL_CONTEXT (OVL_CURRENT (decl));
1008 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd',
1010 context = DECL_REAL_CONTEXT (decl);
1013 if (is_properly_derived_from (current_class_type, context))
1014 INHERITED_VALUE_BINDING_P (binding) = 1;
1016 INHERITED_VALUE_BINDING_P (binding) = 0;
1019 else if (BINDING_VALUE (binding) == decl)
1020 /* We only encounter a TREE_LIST when push_class_decls detects an
1021 ambiguity. Such an ambiguity can be overridden by a definition
1023 INHERITED_VALUE_BINDING_P (binding) = 1;
1028 /* Remove the binding for DECL which should be the innermost binding
1032 pop_binding (id, decl)
1038 if (id == NULL_TREE)
1039 /* It's easiest to write the loops that call this function without
1040 checking whether or not the entities involved have names. We
1041 get here for such an entity. */
1044 /* Get the innermost binding for ID. */
1045 binding = IDENTIFIER_BINDING (id);
1047 /* The name should be bound. */
1048 my_friendly_assert (binding != NULL_TREE, 0);
1050 /* The DECL will be either the ordinary binding or the type
1051 binding for this identifier. Remove that binding. */
1052 if (BINDING_VALUE (binding) == decl)
1053 BINDING_VALUE (binding) = NULL_TREE;
1054 else if (BINDING_TYPE (binding) == decl)
1055 BINDING_TYPE (binding) = NULL_TREE;
1057 my_friendly_abort (0);
1059 if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding))
1060 /* We're completely done with the innermost binding for this
1061 identifier. Unhook it from the list of bindings. */
1062 IDENTIFIER_BINDING (id) = TREE_CHAIN (binding);
1065 /* When a label goes out of scope, check to see if that label was used
1066 in a valid manner, and issue any appropriate warnings or errors. */
1072 tree label = TREE_VALUE (link);
1074 if (!processing_template_decl && doing_semantic_analysis_p ())
1076 if (DECL_INITIAL (label) == NULL_TREE)
1078 cp_error_at ("label `%D' used but not defined", label);
1079 /* Avoid crashing later. */
1080 define_label (input_filename, 1, DECL_NAME (label));
1082 else if (warn_unused && !TREE_USED (label))
1083 cp_warning_at ("label `%D' defined but not used", label);
1086 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), TREE_PURPOSE (link));
1089 /* At the end of a function, all labels declared within the fucntion
1090 go out of scope. BLOCK is the top-level block for the
1099 /* Clear out the definitions of all label names, since their scopes
1101 for (link = named_labels; link; link = TREE_CHAIN (link))
1104 /* Put the labels into the "variables" of the top-level block,
1105 so debugger can see them. */
1106 TREE_CHAIN (TREE_VALUE (link)) = BLOCK_VARS (block);
1107 BLOCK_VARS (block) = TREE_VALUE (link);
1110 named_labels = NULL_TREE;
1113 /* Exit a binding level.
1114 Pop the level off, and restore the state of the identifier-decl mappings
1115 that were in effect when this level was entered.
1117 If KEEP == 1, this level had explicit declarations, so
1118 and create a "block" (a BLOCK node) for the level
1119 to record its declarations and subblocks for symbol table output.
1121 If FUNCTIONBODY is nonzero, this level is the body of a function,
1122 so create a block as if KEEP were set and also clear out all
1125 If REVERSE is nonzero, reverse the order of decls before putting
1126 them into the BLOCK. */
1129 poplevel (keep, reverse, functionbody)
1135 /* The chain of decls was accumulated in reverse order.
1136 Put it into forward order, just for cleanliness. */
1138 int tmp = functionbody;
1139 int real_functionbody;
1142 tree block = NULL_TREE;
1144 int block_previously_created;
1145 int leaving_for_scope;
1147 if (cfun && !doing_semantic_analysis_p ())
1150 my_friendly_assert (current_binding_level->parm_flag != 2,
1153 real_functionbody = (current_binding_level->keep == 2
1154 ? ((functionbody = 0), tmp) : functionbody);
1155 tags = functionbody >= 0 ? current_binding_level->tags : 0;
1156 subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1158 my_friendly_assert (!current_binding_level->class_shadowed,
1161 /* We used to use KEEP == 2 to indicate that the new block should go
1162 at the beginning of the list of blocks at this binding level,
1163 rather than the end. This hack is no longer used. */
1164 my_friendly_assert (keep == 0 || keep == 1, 0);
1166 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
1167 (HOST_WIDE_INT) current_binding_level->level_chain,
1168 current_binding_level->parm_flag,
1169 current_binding_level->keep);
1171 if (current_binding_level->keep == 1)
1174 /* Get the decls in the order they were written.
1175 Usually current_binding_level->names is in reverse order.
1176 But parameter decls were previously put in forward order. */
1179 current_binding_level->names
1180 = decls = nreverse (current_binding_level->names);
1182 decls = current_binding_level->names;
1184 /* Output any nested inline functions within this block
1185 if they weren't already output. */
1186 for (decl = decls; decl; decl = TREE_CHAIN (decl))
1187 if (TREE_CODE (decl) == FUNCTION_DECL
1188 && ! TREE_ASM_WRITTEN (decl)
1189 && DECL_INITIAL (decl) != NULL_TREE
1190 && TREE_ADDRESSABLE (decl)
1191 && decl_function_context (decl) == current_function_decl)
1193 /* If this decl was copied from a file-scope decl
1194 on account of a block-scope extern decl,
1195 propagate TREE_ADDRESSABLE to the file-scope decl. */
1196 if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1197 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1200 push_function_context ();
1201 output_inline_function (decl);
1202 pop_function_context ();
1206 /* When not in function-at-a-time mode, expand_end_bindings will
1207 warn about unused variables. But, in function-at-a-time mode
1208 expand_end_bindings is not passed the list of variables in the
1209 current scope, and therefore no warning is emitted. So, we
1210 explicitly warn here. */
1211 if (!processing_template_decl)
1212 warn_about_unused_variables (getdecls ());
1214 /* If there were any declarations or structure tags in that level,
1215 or if this level is a function body,
1216 create a BLOCK to record them for the life of this function. */
1218 block_previously_created = (current_binding_level->this_block != NULL_TREE);
1219 if (block_previously_created)
1220 block = current_binding_level->this_block;
1221 else if (keep == 1 || functionbody)
1222 block = make_node (BLOCK);
1223 if (block != NULL_TREE)
1225 if (block_previously_created)
1227 if (decls || tags || subblocks)
1229 if (BLOCK_VARS (block))
1230 warning ("internal compiler error: debugging info corrupted");
1232 BLOCK_VARS (block) = decls;
1234 /* We can have previous subblocks and new subblocks when
1235 doing fixup_gotos with complex cleanups. We chain the new
1236 subblocks onto the end of any pre-existing subblocks. */
1237 BLOCK_SUBBLOCKS (block) = chainon (BLOCK_SUBBLOCKS (block),
1243 BLOCK_VARS (block) = decls;
1244 BLOCK_SUBBLOCKS (block) = subblocks;
1248 /* In each subblock, record that this is its superior. */
1250 for (link = subblocks; link; link = TREE_CHAIN (link))
1251 BLOCK_SUPERCONTEXT (link) = block;
1253 /* We still support the old for-scope rules, whereby the variables
1254 in a for-init statement were in scope after the for-statement
1255 ended. We only use the new rules in flag_new_for_scope is
1258 = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1260 /* Remove declarations for all the DECLs in this level. */
1261 for (link = decls; link; link = TREE_CHAIN (link))
1263 if (leaving_for_scope && TREE_CODE (link) == VAR_DECL)
1266 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1270 ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1272 ns_binding = NULL_TREE;
1275 && (BINDING_LEVEL (outer_binding)
1276 == current_binding_level->level_chain))
1277 /* We have something like:
1282 and we are leaving the `for' scope. There's no reason to
1283 keep the binding of the inner `i' in this case. */
1284 pop_binding (DECL_NAME (link), link);
1285 else if ((outer_binding
1286 && (TREE_CODE (BINDING_VALUE (outer_binding))
1289 && TREE_CODE (ns_binding) == TYPE_DECL))
1290 /* Here, we have something like:
1298 We must pop the for-scope binding so we know what's a
1299 type and what isn't. */
1300 pop_binding (DECL_NAME (link), link);
1303 /* Mark this VAR_DECL as dead so that we can tell we left it
1304 there only for backward compatibility. */
1305 DECL_DEAD_FOR_LOCAL (link) = 1;
1307 /* Keep track of what should of have happenned when we
1308 popped the binding. */
1309 if (outer_binding && BINDING_VALUE (outer_binding))
1310 DECL_SHADOWED_FOR_VAR (link)
1311 = BINDING_VALUE (outer_binding);
1313 /* Add it to the list of dead variables in the next
1314 outermost binding to that we can remove these when we
1315 leave that binding. */
1316 current_binding_level->level_chain->dead_vars_from_for
1317 = tree_cons (NULL_TREE, link,
1318 current_binding_level->level_chain->
1319 dead_vars_from_for);
1321 /* Although we don't pop the CPLUS_BINDING, we do clear
1322 its BINDING_LEVEL since the level is going away now. */
1323 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1329 /* Remove the binding. */
1331 if (TREE_CODE (decl) == TREE_LIST)
1332 decl = TREE_VALUE (decl);
1333 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd')
1334 pop_binding (DECL_NAME (decl), decl);
1335 else if (TREE_CODE (decl) == OVERLOAD)
1336 pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl);
1338 my_friendly_abort (0);
1342 /* Remove declarations for any `for' variables from inner scopes
1343 that we kept around. */
1344 for (link = current_binding_level->dead_vars_from_for;
1345 link; link = TREE_CHAIN (link))
1346 pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1348 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1349 for (link = current_binding_level->type_shadowed;
1350 link; link = TREE_CHAIN (link))
1351 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1353 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1354 for (link = current_binding_level->shadowed_labels;
1356 link = TREE_CHAIN (link))
1359 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1360 list if a `using' declaration put them there. The debugging
1361 back-ends won't understand OVERLOAD, so we remove them here.
1362 Because the BLOCK_VARS are (temporarily) shared with
1363 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1364 popped all the bindings. */
1369 for (d = &BLOCK_VARS (block); *d; )
1371 if (TREE_CODE (*d) == TREE_LIST)
1372 *d = TREE_CHAIN (*d);
1374 d = &TREE_CHAIN (*d);
1378 /* If the level being exited is the top level of a function,
1379 check over all the labels. */
1382 /* Since this is the top level block of a function, the vars are
1383 the function's parameters. Don't leave them in the BLOCK
1384 because they are found in the FUNCTION_DECL instead. */
1385 BLOCK_VARS (block) = 0;
1389 /* Any uses of undefined labels now operate under constraints
1390 of next binding contour. */
1393 struct binding_level *level_chain;
1394 level_chain = current_binding_level->level_chain;
1397 struct named_label_list *labels;
1398 for (labels = named_label_uses; labels; labels = labels->next)
1399 if (labels->binding_level == current_binding_level)
1401 labels->binding_level = level_chain;
1402 labels->names_in_scope = level_chain->names;
1407 tmp = current_binding_level->keep;
1409 pop_binding_level ();
1411 DECL_INITIAL (current_function_decl) = block;
1414 if (!block_previously_created)
1415 current_binding_level->blocks
1416 = chainon (current_binding_level->blocks, block);
1418 /* If we did not make a block for the level just exited,
1419 any blocks made for inner levels
1420 (since they cannot be recorded as subblocks in that level)
1421 must be carried forward so they will later become subblocks
1422 of something else. */
1424 current_binding_level->blocks
1425 = chainon (current_binding_level->blocks, subblocks);
1427 /* Each and every BLOCK node created here in `poplevel' is important
1428 (e.g. for proper debugging information) so if we created one
1429 earlier, mark it as "used". */
1431 TREE_USED (block) = 1;
1433 /* Take care of compiler's internal binding structures. */
1439 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1442 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts)) = block;
1443 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts)) = block;
1446 block = poplevel (keep, reverse, functionbody);
1452 /* Delete the node BLOCK from the current binding level.
1453 This is used for the block inside a stmt expr ({...})
1454 so that the block can be reinserted where appropriate. */
1457 delete_block (block)
1461 if (current_binding_level->blocks == block)
1462 current_binding_level->blocks = TREE_CHAIN (block);
1463 for (t = current_binding_level->blocks; t;)
1465 if (TREE_CHAIN (t) == block)
1466 TREE_CHAIN (t) = TREE_CHAIN (block);
1470 TREE_CHAIN (block) = NULL_TREE;
1471 /* Clear TREE_USED which is always set by poplevel.
1472 The flag is set again if insert_block is called. */
1473 TREE_USED (block) = 0;
1476 /* Insert BLOCK at the end of the list of subblocks of the
1477 current binding level. This is used when a BIND_EXPR is expanded,
1478 to handle the BLOCK node inside the BIND_EXPR. */
1481 insert_block (block)
1484 TREE_USED (block) = 1;
1485 current_binding_level->blocks
1486 = chainon (current_binding_level->blocks, block);
1489 /* Set the BLOCK node for the innermost scope
1490 (the one we are currently in). */
1494 register tree block;
1496 current_binding_level->this_block = block;
1499 /* Do a pushlevel for class declarations. */
1504 register struct binding_level *newlevel;
1506 /* Reuse or create a struct for this binding level. */
1507 #if defined(DEBUG_CP_BINDING_LEVELS)
1509 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1510 if (free_binding_level)
1511 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1513 newlevel = free_binding_level;
1514 free_binding_level = free_binding_level->level_chain;
1517 newlevel = make_binding_level ();
1519 #if defined(DEBUG_CP_BINDING_LEVELS)
1521 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1523 push_binding_level (newlevel, 0, 0);
1525 class_binding_level = current_binding_level;
1526 class_binding_level->parm_flag = 2;
1529 /* ...and a poplevel for class declarations. */
1534 register struct binding_level *level = class_binding_level;
1537 my_friendly_assert (level != 0, 354);
1539 /* If we're leaving a toplevel class, don't bother to do the setting
1540 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1541 shouldn't even be used when current_class_type isn't set, and second,
1542 if we don't touch it here, we're able to use the cache effect if the
1543 next time we're entering a class scope, it is the same class. */
1544 if (current_class_depth != 1)
1546 struct binding_level* b;
1548 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1549 for (shadowed = level->class_shadowed;
1551 shadowed = TREE_CHAIN (shadowed))
1552 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE;
1554 /* Find the next enclosing class, and recreate
1555 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1556 b = level->level_chain;
1557 while (b && b->parm_flag != 2)
1561 for (shadowed = b->class_shadowed;
1563 shadowed = TREE_CHAIN (shadowed))
1567 t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed));
1568 while (t && BINDING_LEVEL (t) != b)
1572 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed))
1573 = BINDING_VALUE (t);
1577 /* Remember to save what IDENTIFIER's were bound in this scope so we
1578 can recover from cache misses. */
1580 previous_class_type = current_class_type;
1581 previous_class_values = class_binding_level->class_shadowed;
1583 for (shadowed = level->type_shadowed;
1585 shadowed = TREE_CHAIN (shadowed))
1586 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1588 /* Remove the bindings for all of the class-level declarations. */
1589 for (shadowed = level->class_shadowed;
1591 shadowed = TREE_CHAIN (shadowed))
1592 pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1594 GNU_xref_end_scope ((HOST_WIDE_INT) class_binding_level,
1595 (HOST_WIDE_INT) class_binding_level->level_chain,
1596 class_binding_level->parm_flag,
1597 class_binding_level->keep);
1599 /* Now, pop out of the binding level which we created up in the
1600 `pushlevel_class' routine. */
1601 #if defined(DEBUG_CP_BINDING_LEVELS)
1603 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1605 pop_binding_level ();
1608 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1609 for any names in enclosing classes. */
1612 clear_identifier_class_values ()
1616 if (!class_binding_level)
1619 for (t = class_binding_level->class_shadowed;
1622 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
1625 /* Returns non-zero if T is a virtual function table. */
1628 vtable_decl_p (t, data)
1630 void *data ATTRIBUTE_UNUSED;
1632 return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t));
1635 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1639 vtype_decl_p (t, data)
1641 void *data ATTRIBUTE_UNUSED;
1643 return (TREE_CODE (t) == TYPE_DECL
1644 && TREE_TYPE (t) != error_mark_node
1645 && TYPE_LANG_SPECIFIC (TREE_TYPE (t))
1646 && CLASSTYPE_VSIZE (TREE_TYPE (t)));
1649 /* Return the declarations that are members of the namespace NS. */
1652 cp_namespace_decls (ns)
1655 return NAMESPACE_LEVEL (ns)->names;
1658 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1659 itself, calling F for each. The DATA is passed to F as well. */
1662 walk_namespaces_r (namespace, f, data)
1664 walk_namespaces_fn f;
1670 result |= (*f) (namespace, data);
1672 for (current = cp_namespace_decls (namespace);
1674 current = TREE_CHAIN (current))
1676 if (TREE_CODE (current) != NAMESPACE_DECL
1677 || DECL_NAMESPACE_ALIAS (current))
1679 if (!DECL_LANG_SPECIFIC (current))
1682 my_friendly_assert (current == std_node, 393);
1686 /* We found a namespace. */
1687 result |= walk_namespaces_r (current, f, data);
1693 /* Walk all the namespaces, calling F for each. The DATA is passed to
1697 walk_namespaces (f, data)
1698 walk_namespaces_fn f;
1701 return walk_namespaces_r (global_namespace, f, data);
1704 struct walk_globals_data {
1705 walk_globals_pred p;
1710 /* Walk the global declarations in NAMESPACE. Whenever one is found
1711 for which P returns non-zero, call F with its address. If any call
1712 to F returns a non-zero value, return a non-zero value. */
1715 walk_globals_r (namespace, data)
1719 struct walk_globals_data* wgd = (struct walk_globals_data *) data;
1720 walk_globals_pred p = wgd->p;
1721 walk_globals_fn f = wgd->f;
1722 void *d = wgd->data;
1726 t = &NAMESPACE_LEVEL (namespace)->names;
1733 result |= (*f) (t, d);
1735 /* If F changed *T, then *T still points at the next item to
1738 t = &TREE_CHAIN (*t);
1744 /* Walk the global declarations. Whenever one is found for which P
1745 returns non-zero, call F with its address. If any call to F
1746 returns a non-zero value, return a non-zero value. */
1749 walk_globals (p, f, data)
1750 walk_globals_pred p;
1754 struct walk_globals_data wgd;
1759 return walk_namespaces (walk_globals_r, &wgd);
1762 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1763 DATA is non-NULL, this is the last time we will call
1764 wrapup_global_declarations for this NAMESPACE. */
1767 wrapup_globals_for_namespace (namespace, data)
1771 tree globals = cp_namespace_decls (namespace);
1772 int len = list_length (globals);
1773 tree *vec = (tree *) alloca (sizeof (tree) * len);
1777 int last_time = (data != 0);
1779 if (last_time && namespace == global_namespace)
1780 /* Let compile_file handle the global namespace. */
1783 /* Process the decls in reverse order--earliest first.
1784 Put them into VEC from back to front, then take out from front. */
1786 for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl))
1787 vec[len - i - 1] = decl;
1791 check_global_declarations (vec, len);
1795 /* Temporarily mark vtables as external. That prevents
1796 wrapup_global_declarations from writing them out; we must process
1797 them ourselves in finish_vtable_vardecl. */
1798 for (i = 0; i < len; ++i)
1799 if (vtable_decl_p (vec[i], /*data=*/0) && !DECL_EXTERNAL (vec[i]))
1801 DECL_NOT_REALLY_EXTERN (vec[i]) = 1;
1802 DECL_EXTERNAL (vec[i]) = 1;
1805 /* Write out any globals that need to be output. */
1806 result = wrapup_global_declarations (vec, len);
1808 /* Undo the hack to DECL_EXTERNAL above. */
1809 for (i = 0; i < len; ++i)
1810 if (vtable_decl_p (vec[i], /*data=*/0)
1811 && DECL_NOT_REALLY_EXTERN (vec[i]))
1813 DECL_NOT_REALLY_EXTERN (vec[i]) = 0;
1814 DECL_EXTERNAL (vec[i]) = 0;
1821 /* Mark ARG (which is really a struct binding_level **) for GC. */
1824 mark_binding_level (arg)
1827 struct binding_level *lvl = *(struct binding_level **)arg;
1831 ggc_mark_tree (lvl->names);
1832 ggc_mark_tree (lvl->tags);
1833 ggc_mark_tree (lvl->usings);
1834 ggc_mark_tree (lvl->using_directives);
1835 ggc_mark_tree (lvl->class_shadowed);
1836 ggc_mark_tree (lvl->type_shadowed);
1837 ggc_mark_tree (lvl->shadowed_labels);
1838 ggc_mark_tree (lvl->blocks);
1839 ggc_mark_tree (lvl->this_block);
1840 ggc_mark_tree (lvl->incomplete);
1841 ggc_mark_tree (lvl->dead_vars_from_for);
1843 lvl = lvl->level_chain;
1847 /* For debugging. */
1848 static int no_print_functions = 0;
1849 static int no_print_builtins = 0;
1852 print_binding_level (lvl)
1853 struct binding_level *lvl;
1857 fprintf (stderr, " blocks=");
1858 fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks);
1859 fprintf (stderr, " n_incomplete=%d parm_flag=%d keep=%d",
1860 list_length (lvl->incomplete), lvl->parm_flag, lvl->keep);
1861 if (lvl->tag_transparent)
1862 fprintf (stderr, " tag-transparent");
1863 if (lvl->more_cleanups_ok)
1864 fprintf (stderr, " more-cleanups-ok");
1865 if (lvl->have_cleanups)
1866 fprintf (stderr, " have-cleanups");
1867 fprintf (stderr, "\n");
1870 fprintf (stderr, " names:\t");
1871 /* We can probably fit 3 names to a line? */
1872 for (t = lvl->names; t; t = TREE_CHAIN (t))
1874 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
1876 if (no_print_builtins
1877 && (TREE_CODE (t) == TYPE_DECL)
1878 && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
1881 /* Function decls tend to have longer names. */
1882 if (TREE_CODE (t) == FUNCTION_DECL)
1889 fprintf (stderr, "\n\t");
1892 print_node_brief (stderr, "", t, 0);
1893 if (t == error_mark_node)
1897 fprintf (stderr, "\n");
1901 fprintf (stderr, " tags:\t");
1903 for (t = lvl->tags; t; t = TREE_CHAIN (t))
1905 if (TREE_PURPOSE (t) == NULL_TREE)
1907 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1914 fprintf (stderr, "\n\t");
1917 if (TREE_PURPOSE (t) == NULL_TREE)
1919 print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
1920 fprintf (stderr, ">");
1922 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1923 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1926 print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
1927 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1928 fprintf (stderr, ">");
1932 fprintf (stderr, "\n");
1934 if (lvl->class_shadowed)
1936 fprintf (stderr, " class-shadowed:");
1937 for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
1939 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1941 fprintf (stderr, "\n");
1943 if (lvl->type_shadowed)
1945 fprintf (stderr, " type-shadowed:");
1946 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
1948 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1950 fprintf (stderr, "\n");
1955 print_other_binding_stack (stack)
1956 struct binding_level *stack;
1958 struct binding_level *level;
1959 for (level = stack; level != global_binding_level; level = level->level_chain)
1961 fprintf (stderr, "binding level ");
1962 fprintf (stderr, HOST_PTR_PRINTF, level);
1963 fprintf (stderr, "\n");
1964 print_binding_level (level);
1969 print_binding_stack ()
1971 struct binding_level *b;
1972 fprintf (stderr, "current_binding_level=");
1973 fprintf (stderr, HOST_PTR_PRINTF, current_binding_level);
1974 fprintf (stderr, "\nclass_binding_level=");
1975 fprintf (stderr, HOST_PTR_PRINTF, class_binding_level);
1976 fprintf (stderr, "\nglobal_binding_level=");
1977 fprintf (stderr, HOST_PTR_PRINTF, global_binding_level);
1978 fprintf (stderr, "\n");
1979 if (class_binding_level)
1981 for (b = class_binding_level; b; b = b->level_chain)
1982 if (b == current_binding_level)
1985 b = class_binding_level;
1987 b = current_binding_level;
1990 b = current_binding_level;
1991 print_other_binding_stack (b);
1992 fprintf (stderr, "global:\n");
1993 print_binding_level (global_binding_level);
1996 /* Namespace binding access routines: The namespace_bindings field of
1997 the identifier is polymorphic, with three possible values:
1998 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
1999 indicating the BINDING_VALUE of global_namespace. */
2001 /* Check whether the a binding for the name to scope is known.
2002 Assumes that the bindings of the name are already a list
2003 of bindings. Returns the binding found, or NULL_TREE. */
2006 find_binding (name, scope)
2010 tree iter, prev = NULL_TREE;
2012 scope = ORIGINAL_NAMESPACE (scope);
2014 for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
2015 iter = TREE_CHAIN (iter))
2017 my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
2018 if (BINDING_SCOPE (iter) == scope)
2020 /* Move binding found to the front of the list, so
2021 subsequent lookups will find it faster. */
2024 TREE_CHAIN (prev) = TREE_CHAIN (iter);
2025 TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
2026 IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
2035 /* Always returns a binding for name in scope. If the
2036 namespace_bindings is not a list, convert it to one first.
2037 If no binding is found, make a new one. */
2040 binding_for_name (name, scope)
2044 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2047 scope = ORIGINAL_NAMESPACE (scope);
2049 if (b && TREE_CODE (b) != CPLUS_BINDING)
2051 /* Get rid of optimization for global scope. */
2052 IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
2053 BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
2054 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2056 if (b && (result = find_binding (name, scope)))
2058 /* Not found, make a new one. */
2059 result = make_node (CPLUS_BINDING);
2060 TREE_CHAIN (result) = b;
2061 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
2062 BINDING_SCOPE (result) = scope;
2063 BINDING_TYPE (result) = NULL_TREE;
2064 BINDING_VALUE (result) = NULL_TREE;
2068 /* Return the binding value for name in scope, considering that
2069 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2072 namespace_binding (name, scope)
2076 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2079 if (scope == NULL_TREE)
2080 scope = global_namespace;
2081 if (TREE_CODE (b) != CPLUS_BINDING)
2082 return (scope == global_namespace) ? b : NULL_TREE;
2083 name = find_binding (name,scope);
2084 if (name == NULL_TREE)
2086 return BINDING_VALUE (name);
2089 /* Set the binding value for name in scope. If modifying the binding
2090 of global_namespace is attempted, try to optimize it. */
2093 set_namespace_binding (name, scope, val)
2100 if (scope == NULL_TREE)
2101 scope = global_namespace;
2103 if (scope == global_namespace)
2105 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2106 if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
2108 IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
2112 b = binding_for_name (name, scope);
2113 BINDING_VALUE (b) = val;
2116 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2117 select a name that is unique to this compilation unit. */
2120 push_namespace (name)
2125 int implicit_use = 0;
2127 if (!global_namespace)
2129 /* This must be ::. */
2130 my_friendly_assert (name == get_identifier ("::"), 377);
2135 /* The name of anonymous namespace is unique for the translation
2137 if (!anonymous_namespace_name)
2138 anonymous_namespace_name = get_file_function_name ('N');
2139 name = anonymous_namespace_name;
2140 d = IDENTIFIER_NAMESPACE_VALUE (name);
2142 /* Reopening anonymous namespace. */
2146 else if (current_namespace == global_namespace
2147 && name == DECL_NAME (std_node))
2154 /* Check whether this is an extended namespace definition. */
2155 d = IDENTIFIER_NAMESPACE_VALUE (name);
2156 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2159 if (DECL_NAMESPACE_ALIAS (d))
2161 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2162 d, DECL_NAMESPACE_ALIAS (d));
2163 d = DECL_NAMESPACE_ALIAS (d);
2170 /* Make a new namespace, binding the name to it. */
2171 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2172 /* The global namespace is not pushed, and the global binding
2173 level is set elsewhere. */
2178 declare_namespace_level ();
2179 NAMESPACE_LEVEL (d) = current_binding_level;
2183 resume_binding_level (NAMESPACE_LEVEL (d));
2186 do_using_directive (d);
2187 /* Enter the name space. */
2188 current_namespace = d;
2191 /* Pop from the scope of the current namespace. */
2196 if (current_namespace == global_namespace)
2198 my_friendly_assert (in_std>0, 980421);
2202 current_namespace = CP_DECL_CONTEXT (current_namespace);
2203 /* The binding level is not popped, as it might be re-opened later. */
2204 suspend_binding_level ();
2207 /* Push into the scope of the namespace NS, even if it is deeply
2208 nested within another namespace. */
2211 push_nested_namespace (ns)
2214 if (ns == global_namespace)
2215 push_to_top_level ();
2218 push_nested_namespace (CP_DECL_CONTEXT (ns));
2219 push_namespace (DECL_NAME (ns));
2223 /* Pop back from the scope of the namespace NS, which was previously
2224 entered with push_nested_namespace. */
2227 pop_nested_namespace (ns)
2230 while (ns != global_namespace)
2233 ns = CP_DECL_CONTEXT (ns);
2236 pop_from_top_level ();
2240 /* Subroutines for reverting temporarily to top-level for instantiation
2241 of templates and such. We actually need to clear out the class- and
2242 local-value slots of all identifiers, so that only the global values
2243 are at all visible. Simply setting current_binding_level to the global
2244 scope isn't enough, because more binding levels may be pushed. */
2245 struct saved_scope *scope_chain;
2247 /* Mark ST for GC. */
2251 struct stmt_tree *st;
2253 ggc_mark_tree (st->x_last_stmt);
2254 ggc_mark_tree (st->x_last_expr_type);
2257 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2260 mark_saved_scope (arg)
2263 struct saved_scope *t = *(struct saved_scope **)arg;
2266 mark_binding_level (&t->class_bindings);
2267 ggc_mark_tree (t->old_bindings);
2268 ggc_mark_tree (t->old_namespace);
2269 ggc_mark_tree (t->class_name);
2270 ggc_mark_tree (t->class_type);
2271 ggc_mark_tree (t->access_specifier);
2272 ggc_mark_tree (t->function_decl);
2274 ggc_mark_tree_varray (t->lang_base);
2275 ggc_mark_tree (t->lang_name);
2276 ggc_mark_tree (t->x_function_parms);
2277 ggc_mark_tree (t->template_parms);
2278 ggc_mark_tree (t->x_previous_class_type);
2279 ggc_mark_tree (t->x_previous_class_values);
2280 ggc_mark_tree (t->x_saved_tree);
2282 mark_stmt_tree (&t->x_stmt_tree);
2283 mark_binding_level (&t->bindings);
2289 store_bindings (names, old_bindings)
2290 tree names, old_bindings;
2293 for (t = names; t; t = TREE_CHAIN (t))
2295 tree binding, t1, id;
2297 if (TREE_CODE (t) == TREE_LIST)
2298 id = TREE_PURPOSE (t);
2303 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2304 we have no IDENTIFIER_BINDING if we have left the class
2305 scope, but cached the class-level declarations. */
2306 || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2309 for (t1 = old_bindings; t1; t1 = TREE_CHAIN (t1))
2310 if (TREE_VEC_ELT (t1, 0) == id)
2313 binding = make_tree_vec (4);
2317 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2318 TREE_VEC_ELT (binding, 0) = id;
2319 TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2320 TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2321 TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2322 IDENTIFIER_BINDING (id) = NULL_TREE;
2323 IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2325 TREE_CHAIN (binding) = old_bindings;
2326 old_bindings = binding;
2330 return old_bindings;
2334 maybe_push_to_top_level (pseudo)
2337 struct saved_scope *s;
2338 struct binding_level *b;
2342 s = (struct saved_scope *) xcalloc (1, sizeof (struct saved_scope));
2344 b = scope_chain ? current_binding_level : 0;
2346 /* If we're in the middle of some function, save our state. */
2350 push_function_context_to (NULL_TREE);
2355 old_bindings = NULL_TREE;
2356 if (scope_chain && previous_class_type)
2357 old_bindings = store_bindings (previous_class_values, old_bindings);
2359 /* Have to include global_binding_level, because class-level decls
2360 aren't listed anywhere useful. */
2361 for (; b; b = b->level_chain)
2365 /* Template IDs are inserted into the global level. If they were
2366 inserted into namespace level, finish_file wouldn't find them
2367 when doing pending instantiations. Therefore, don't stop at
2368 namespace level, but continue until :: . */
2369 if (b == global_binding_level || (pseudo && b->pseudo_global))
2372 old_bindings = store_bindings (b->names, old_bindings);
2373 /* We also need to check class_shadowed to save class-level type
2374 bindings, since pushclass doesn't fill in b->names. */
2375 if (b->parm_flag == 2)
2376 old_bindings = store_bindings (b->class_shadowed, old_bindings);
2378 /* Unwind type-value slots back to top level. */
2379 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2380 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2382 s->prev = scope_chain;
2383 s->old_bindings = old_bindings;
2385 s->need_pop_function_context = need_pop;
2386 s->function_decl = current_function_decl;
2389 current_function_decl = NULL_TREE;
2390 VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
2391 current_lang_stack = &VARRAY_TREE (current_lang_base, 0);
2392 current_lang_name = lang_name_cplusplus;
2393 strict_prototype = strict_prototypes_lang_cplusplus;
2394 current_namespace = global_namespace;
2398 push_to_top_level ()
2400 maybe_push_to_top_level (0);
2404 pop_from_top_level ()
2406 struct saved_scope *s = scope_chain;
2409 /* Clear out class-level bindings cache. */
2410 if (previous_class_type)
2411 invalidate_class_lookup_cache ();
2413 VARRAY_FREE (current_lang_base);
2415 scope_chain = s->prev;
2416 for (t = s->old_bindings; t; t = TREE_CHAIN (t))
2418 tree id = TREE_VEC_ELT (t, 0);
2421 SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2422 IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2423 IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2427 if (current_lang_name == lang_name_cplusplus)
2428 strict_prototype = strict_prototypes_lang_cplusplus;
2429 else if (current_lang_name == lang_name_c)
2430 strict_prototype = strict_prototypes_lang_c;
2432 /* If we were in the middle of compiling a function, restore our
2434 if (s->need_pop_function_context)
2435 pop_function_context_from (NULL_TREE);
2436 current_function_decl = s->function_decl;
2441 /* Push a definition of struct, union or enum tag "name".
2442 into binding_level "b". "type" should be the type node,
2443 We assume that the tag "name" is not already defined.
2445 Note that the definition may really be just a forward reference.
2446 In that case, the TYPE_SIZE will be a NULL_TREE.
2448 C++ gratuitously puts all these tags in the name space. */
2450 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2451 record the shadowed value for this binding contour. TYPE is
2452 the type that ID maps to. */
2455 set_identifier_type_value_with_scope (id, type, b)
2458 struct binding_level *b;
2460 if (!b->namespace_p)
2462 /* Shadow the marker, not the real thing, so that the marker
2463 gets restored later. */
2464 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2466 = tree_cons (id, old_type_value, b->type_shadowed);
2470 tree binding = binding_for_name (id, current_namespace);
2471 BINDING_TYPE (binding) = type;
2472 /* Store marker instead of real type. */
2473 type = global_type_node;
2475 SET_IDENTIFIER_TYPE_VALUE (id, type);
2478 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2481 set_identifier_type_value (id, type)
2485 set_identifier_type_value_with_scope (id, type, current_binding_level);
2488 /* Return the type associated with id. */
2491 identifier_type_value (id)
2494 /* There is no type with that name, anywhere. */
2495 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2497 /* This is not the type marker, but the real thing. */
2498 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2499 return REAL_IDENTIFIER_TYPE_VALUE (id);
2500 /* Have to search for it. It must be on the global level, now.
2501 Ask lookup_name not to return non-types. */
2502 id = lookup_name_real (id, 2, 1, 0);
2504 return TREE_TYPE (id);
2508 /* Pop off extraneous binding levels left over due to syntax errors.
2510 We don't pop past namespaces, as they might be valid. */
2515 #ifdef DEBUG_CP_BINDING_LEVELS
2516 fprintf (stderr, "XXX entering pop_everything ()\n");
2518 while (!toplevel_bindings_p ())
2520 if (current_binding_level->parm_flag == 2)
2521 pop_nested_class ();
2525 #ifdef DEBUG_CP_BINDING_LEVELS
2526 fprintf (stderr, "XXX leaving pop_everything ()\n");
2530 /* The type TYPE is being declared. If it is a class template, or a
2531 specialization of a class template, do any processing required and
2532 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2533 being declared a friend. B is the binding level at which this TYPE
2536 Returns the TYPE_DECL for TYPE, which may have been altered by this
2540 maybe_process_template_type_declaration (type, globalize, b)
2543 struct binding_level* b;
2545 tree decl = TYPE_NAME (type);
2547 if (processing_template_parmlist)
2548 /* You can't declare a new template type in a template parameter
2549 list. But, you can declare a non-template type:
2551 template <class A*> struct S;
2553 is a forward-declaration of `A'. */
2557 maybe_check_template_type (type);
2559 my_friendly_assert (IS_AGGR_TYPE (type)
2560 || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2563 if (processing_template_decl)
2565 /* This may change after the call to
2566 push_template_decl_real, but we want the original value. */
2567 tree name = DECL_NAME (decl);
2569 decl = push_template_decl_real (decl, globalize);
2570 /* If the current binding level is the binding level for the
2571 template parameters (see the comment in
2572 begin_template_parm_list) and the enclosing level is a class
2573 scope, and we're not looking at a friend, push the
2574 declaration of the member class into the class scope. In the
2575 friend case, push_template_decl will already have put the
2576 friend into global scope, if appropriate. */
2577 if (TREE_CODE (type) != ENUMERAL_TYPE
2578 && !globalize && b->pseudo_global
2579 && b->level_chain->parm_flag == 2)
2581 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2582 /* Put this tag on the list of tags for the class, since
2583 that won't happen below because B is not the class
2584 binding level, but is instead the pseudo-global level. */
2585 b->level_chain->tags =
2586 tree_cons (name, type, b->level_chain->tags);
2587 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2588 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2596 /* In C++, you don't have to write `struct S' to refer to `S'; you
2597 can just use `S'. We accomplish this by creating a TYPE_DECL as
2598 if the user had written `typedef struct S S'. Create and return
2599 the TYPE_DECL for TYPE. */
2602 create_implicit_typedef (name, type)
2608 decl = build_decl (TYPE_DECL, name, type);
2609 SET_DECL_ARTIFICIAL (decl);
2610 /* There are other implicit type declarations, like the one *within*
2611 a class that allows you to write `S::S'. We must distinguish
2613 SET_DECL_IMPLICIT_TYPEDEF_P (decl);
2614 TYPE_NAME (type) = decl;
2619 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2620 Normally put it into the inner-most non-tag-transparent scope,
2621 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2622 The latter is needed for implicit declarations. */
2625 pushtag (name, type, globalize)
2629 register struct binding_level *b;
2631 b = current_binding_level;
2632 while (b->tag_transparent
2633 || (globalize && b->parm_flag == 2))
2636 b->tags = tree_cons (name, type, b->tags);
2640 /* Do C++ gratuitous typedefing. */
2641 if (IDENTIFIER_TYPE_VALUE (name) != type)
2643 register tree d = NULL_TREE;
2645 tree context = TYPE_CONTEXT (type);
2649 tree cs = current_scope ();
2653 else if (cs != NULL_TREE
2654 && TREE_CODE_CLASS (TREE_CODE (cs)) == 't')
2655 /* When declaring a friend class of a local class, we want
2656 to inject the newly named class into the scope
2657 containing the local class, not the namespace scope. */
2658 context = hack_decl_function_context (get_type_decl (cs));
2661 context = current_namespace;
2663 if ((b->pseudo_global && b->level_chain->parm_flag == 2)
2664 || b->parm_flag == 2)
2667 if (current_lang_name == lang_name_java)
2668 TYPE_FOR_JAVA (type) = 1;
2670 d = create_implicit_typedef (name, type);
2671 DECL_CONTEXT (d) = FROB_CONTEXT (context);
2673 set_identifier_type_value_with_scope (name, type, b);
2675 d = maybe_process_template_type_declaration (type,
2678 if (b->parm_flag == 2)
2680 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2681 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2682 class. But if it's a member template class, we
2683 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2685 finish_member_declaration (d);
2687 pushdecl_class_level (d);
2690 d = pushdecl_with_scope (d, b);
2692 if (ANON_AGGRNAME_P (name))
2693 DECL_IGNORED_P (d) = 1;
2695 TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2696 DECL_ASSEMBLER_NAME (d) = DECL_NAME (d);
2697 if (!uses_template_parms (type))
2698 DECL_ASSEMBLER_NAME (d)
2699 = get_identifier (build_overload_name (type, 1, 1));
2701 if (b->parm_flag == 2)
2703 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2704 CLASSTYPE_TAGS (current_class_type) = b->tags;
2708 if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2709 /* Use the canonical TYPE_DECL for this node. */
2710 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2713 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2714 will be the tagged type we just added to the current
2715 binding level. This fake NULL-named TYPE_DECL node helps
2716 dwarfout.c to know when it needs to output a
2717 representation of a tagged type, and it also gives us a
2718 convenient place to record the "scope start" address for
2721 tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2722 TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2726 /* Counter used to create anonymous type names. */
2728 static int anon_cnt = 0;
2730 /* Return an IDENTIFIER which can be used as a name for
2731 anonymous structs and unions. */
2738 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2739 return get_identifier (buf);
2742 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2743 This keeps dbxout from getting confused. */
2748 register struct binding_level *b;
2750 static int last_cnt = 0;
2752 /* Fast out if no new anon names were declared. */
2753 if (last_cnt == anon_cnt)
2756 b = current_binding_level;
2757 while (b->tag_transparent)
2762 /* A NULL purpose means we have already processed all tags
2763 from here to the end of the list. */
2764 if (TREE_PURPOSE (tags) == NULL_TREE)
2766 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2767 TREE_PURPOSE (tags) = NULL_TREE;
2768 tags = TREE_CHAIN (tags);
2770 last_cnt = anon_cnt;
2773 /* Subroutine of duplicate_decls: return truthvalue of whether
2774 or not types of these decls match.
2776 For C++, we must compare the parameter list so that `int' can match
2777 `int&' in a parameter position, but `int&' is not confused with
2781 decls_match (newdecl, olddecl)
2782 tree newdecl, olddecl;
2786 if (newdecl == olddecl)
2789 if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
2790 /* If the two DECLs are not even the same kind of thing, we're not
2791 interested in their types. */
2794 if (TREE_CODE (newdecl) == FUNCTION_DECL)
2796 tree f1 = TREE_TYPE (newdecl);
2797 tree f2 = TREE_TYPE (olddecl);
2798 tree p1 = TYPE_ARG_TYPES (f1);
2799 tree p2 = TYPE_ARG_TYPES (f2);
2801 if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl)
2802 && ! (DECL_LANGUAGE (newdecl) == lang_c
2803 && DECL_LANGUAGE (olddecl) == lang_c))
2806 /* When we parse a static member function definition,
2807 we put together a FUNCTION_DECL which thinks its type
2808 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2810 if (TREE_CODE (f1) == METHOD_TYPE && DECL_STATIC_FUNCTION_P (olddecl))
2811 revert_static_member_fn (&newdecl, &f1, &p1);
2812 else if (TREE_CODE (f2) == METHOD_TYPE
2813 && DECL_STATIC_FUNCTION_P (newdecl))
2814 revert_static_member_fn (&olddecl, &f2, &p2);
2816 /* Here we must take care of the case where new default
2817 parameters are specified. Also, warn if an old
2818 declaration becomes ambiguous because default
2819 parameters may cause the two to be ambiguous. */
2820 if (TREE_CODE (f1) != TREE_CODE (f2))
2822 if (TREE_CODE (f1) == OFFSET_TYPE)
2823 cp_compiler_error ("`%D' redeclared as member function", newdecl);
2825 cp_compiler_error ("`%D' redeclared as non-member function", newdecl);
2829 if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
2831 if (! strict_prototypes_lang_c && DECL_LANGUAGE (olddecl) == lang_c
2834 types_match = self_promoting_args_p (p1);
2835 if (p1 == void_list_node)
2836 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2838 else if (!strict_prototypes_lang_c && DECL_LANGUAGE (olddecl)==lang_c
2839 && DECL_LANGUAGE (newdecl) == lang_c && p1 == NULL_TREE)
2841 types_match = self_promoting_args_p (p2);
2842 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2845 types_match = compparms (p1, p2);
2850 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
2852 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
2853 DECL_TEMPLATE_PARMS (olddecl)))
2856 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
2859 types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
2860 DECL_TEMPLATE_RESULT (newdecl));
2864 if (TREE_TYPE (newdecl) == error_mark_node)
2865 types_match = TREE_TYPE (olddecl) == error_mark_node;
2866 else if (TREE_TYPE (olddecl) == NULL_TREE)
2867 types_match = TREE_TYPE (newdecl) == NULL_TREE;
2868 else if (TREE_TYPE (newdecl) == NULL_TREE)
2871 types_match = comptypes (TREE_TYPE (newdecl),
2872 TREE_TYPE (olddecl),
2873 COMPARE_REDECLARATION);
2879 /* If NEWDECL is `static' and an `extern' was seen previously,
2880 warn about it. OLDDECL is the previous declaration.
2882 Note that this does not apply to the C++ case of declaring
2883 a variable `extern const' and then later `const'.
2885 Don't complain about built-in functions, since they are beyond
2886 the user's control. */
2889 warn_extern_redeclared_static (newdecl, olddecl)
2890 tree newdecl, olddecl;
2892 static const char *explicit_extern_static_warning
2893 = "`%D' was declared `extern' and later `static'";
2894 static const char *implicit_extern_static_warning
2895 = "`%D' was declared implicitly `extern' and later `static'";
2899 if (TREE_CODE (newdecl) == TYPE_DECL
2900 || TREE_CODE (newdecl) == TEMPLATE_DECL)
2903 /* Don't get confused by static member functions; that's a different
2905 if (TREE_CODE (newdecl) == FUNCTION_DECL
2906 && DECL_STATIC_FUNCTION_P (newdecl))
2909 /* If the old declaration was `static', or the new one isn't, then
2910 then everything is OK. */
2911 if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
2914 /* It's OK to declare a builtin function as `static'. */
2915 if (TREE_CODE (olddecl) == FUNCTION_DECL
2916 && DECL_ARTIFICIAL (olddecl))
2919 name = DECL_ASSEMBLER_NAME (newdecl);
2920 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
2921 ? implicit_extern_static_warning
2922 : explicit_extern_static_warning, newdecl);
2923 cp_pedwarn_at ("previous declaration of `%D'", olddecl);
2926 /* Handle when a new declaration NEWDECL has the same name as an old
2927 one OLDDECL in the same binding contour. Prints an error message
2930 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2931 Otherwise, return 0. */
2934 duplicate_decls (newdecl, olddecl)
2935 tree newdecl, olddecl;
2937 unsigned olddecl_uid = DECL_UID (olddecl);
2938 int olddecl_friend = 0, types_match = 0;
2939 int new_defines_function = 0;
2941 if (newdecl == olddecl)
2944 types_match = decls_match (newdecl, olddecl);
2946 /* If either the type of the new decl or the type of the old decl is an
2947 error_mark_node, then that implies that we have already issued an
2948 error (earlier) for some bogus type specification, and in that case,
2949 it is rather pointless to harass the user with yet more error message
2950 about the same declaration, so just pretend the types match here. */
2951 if (TREE_TYPE (newdecl) == error_mark_node
2952 || TREE_TYPE (olddecl) == error_mark_node)
2955 /* Check for redeclaration and other discrepancies. */
2956 if (TREE_CODE (olddecl) == FUNCTION_DECL
2957 && DECL_ARTIFICIAL (olddecl))
2959 if (TREE_CODE (newdecl) != FUNCTION_DECL)
2961 /* If you declare a built-in or predefined function name as static,
2962 the old definition is overridden, but optionally warn this was a
2963 bad choice of name. */
2964 if (! TREE_PUBLIC (newdecl))
2967 cp_warning ("shadowing %s function `%#D'",
2968 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
2970 /* Discard the old built-in function. */
2973 /* If the built-in is not ansi, then programs can override
2974 it even globally without an error. */
2975 else if (! DECL_BUILT_IN (olddecl))
2976 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2980 cp_error ("declaration of `%#D'", newdecl);
2981 cp_error ("conflicts with built-in declaration `%#D'",
2986 else if (!types_match)
2988 if ((DECL_LANGUAGE (newdecl) == lang_c
2989 && DECL_LANGUAGE (olddecl) == lang_c)
2990 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
2991 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
2993 /* A near match; override the builtin. */
2995 if (TREE_PUBLIC (newdecl))
2997 cp_warning ("new declaration `%#D'", newdecl);
2998 cp_warning ("ambiguates built-in declaration `%#D'",
3001 else if (warn_shadow)
3002 cp_warning ("shadowing %s function `%#D'",
3003 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3007 /* Discard the old built-in function. */
3011 if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
3013 /* If a builtin function is redeclared as `static', merge
3014 the declarations, but make the original one static. */
3015 DECL_THIS_STATIC (olddecl) = 1;
3016 TREE_PUBLIC (olddecl) = 0;
3018 /* Make the olddeclaration consistent with the new one so that
3019 all remnants of the builtin-ness of this function will be
3021 DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3022 DECL_RTL (olddecl) = DECL_RTL (newdecl);
3023 DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3024 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl),
3028 else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3030 if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3031 && TREE_CODE (newdecl) != TYPE_DECL
3032 && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3033 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3034 || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3035 && TREE_CODE (olddecl) != TYPE_DECL
3036 && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3037 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3040 /* We do nothing special here, because C++ does such nasty
3041 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3042 get shadowed, and know that if we need to find a TYPE_DECL
3043 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3044 slot of the identifier. */
3048 if ((TREE_CODE (newdecl) == FUNCTION_DECL
3049 && DECL_FUNCTION_TEMPLATE_P (olddecl))
3050 || (TREE_CODE (olddecl) == FUNCTION_DECL
3051 && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3054 cp_error ("`%#D' redeclared as different kind of symbol", newdecl);
3055 if (TREE_CODE (olddecl) == TREE_LIST)
3056 olddecl = TREE_VALUE (olddecl);
3057 cp_error_at ("previous declaration of `%#D'", olddecl);
3059 /* New decl is completely inconsistent with the old one =>
3060 tell caller to replace the old one. */
3064 else if (!types_match)
3066 if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl))
3067 /* These are certainly not duplicate declarations; they're
3068 from different scopes. */
3071 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3073 /* The name of a class template may not be declared to refer to
3074 any other template, class, function, object, namespace, value,
3075 or type in the same scope. */
3076 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3077 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3079 cp_error ("declaration of template `%#D'", newdecl);
3080 cp_error_at ("conflicts with previous declaration `%#D'",
3083 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3084 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3085 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3086 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3087 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3088 DECL_TEMPLATE_PARMS (olddecl)))
3090 cp_error ("new declaration `%#D'", newdecl);
3091 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3095 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3097 if (DECL_LANGUAGE (newdecl) == lang_c
3098 && DECL_LANGUAGE (olddecl) == lang_c)
3100 cp_error ("declaration of C function `%#D' conflicts with",
3102 cp_error_at ("previous declaration `%#D' here", olddecl);
3104 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3105 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3107 cp_error ("new declaration `%#D'", newdecl);
3108 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3114 /* Already complained about this, so don't do so again. */
3115 else if (current_class_type == NULL_TREE
3116 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3118 cp_error ("conflicting types for `%#D'", newdecl);
3119 cp_error_at ("previous declaration as `%#D'", olddecl);
3122 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3123 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3124 && (!DECL_TEMPLATE_INFO (newdecl)
3125 || (DECL_TI_TEMPLATE (newdecl)
3126 != DECL_TI_TEMPLATE (olddecl))))
3127 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3128 && (!DECL_TEMPLATE_INFO (olddecl)
3129 || (DECL_TI_TEMPLATE (olddecl)
3130 != DECL_TI_TEMPLATE (newdecl))))))
3131 /* It's OK to have a template specialization and a non-template
3132 with the same type, or to have specializations of two
3133 different templates with the same type. Note that if one is a
3134 specialization, and the other is an instantiation of the same
3135 template, that we do not exit at this point. That situation
3136 can occur if we instantiate a template class, and then
3137 specialize one of its methods. This situation is legal, but
3138 the declarations must be merged in the usual way. */
3140 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3141 && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3142 && !DECL_USE_TEMPLATE (newdecl))
3143 || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3144 && !DECL_USE_TEMPLATE (olddecl))))
3145 /* One of the declarations is a template instantiation, and the
3146 other is not a template at all. That's OK. */
3148 else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3149 && DECL_NAMESPACE_ALIAS (newdecl)
3150 && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3151 /* Redeclaration of namespace alias, ignore it. */
3155 const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3158 cp_error (errmsg, newdecl);
3159 if (DECL_NAME (olddecl) != NULL_TREE)
3160 cp_error_at ((DECL_INITIAL (olddecl)
3161 && namespace_bindings_p ())
3162 ? "`%#D' previously defined here"
3163 : "`%#D' previously declared here", olddecl);
3165 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3166 && DECL_INITIAL (olddecl) != NULL_TREE
3167 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3168 && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3170 /* Prototype decl follows defn w/o prototype. */
3171 cp_warning_at ("prototype for `%#D'", newdecl);
3172 cp_warning_at ("follows non-prototype definition here", olddecl);
3174 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3175 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3177 /* extern "C" int foo ();
3178 int foo () { bar (); }
3180 if (current_lang_stack
3181 == &VARRAY_TREE (current_lang_base, 0))
3182 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3185 cp_error_at ("previous declaration of `%#D' with %L linkage",
3186 olddecl, DECL_LANGUAGE (olddecl));
3187 cp_error ("conflicts with new declaration with %L linkage",
3188 DECL_LANGUAGE (newdecl));
3192 if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3194 else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3196 tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3197 tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3200 if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3201 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3203 for (; t1 && t1 != void_list_node;
3204 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3205 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3207 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3212 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3214 cp_pedwarn_at ("after previous specification in `%#D'",
3220 cp_error ("default argument given for parameter %d of `%#D'",
3222 cp_error_at ("after previous specification in `%#D'",
3227 if (DECL_THIS_INLINE (newdecl) && ! DECL_THIS_INLINE (olddecl)
3228 && TREE_ADDRESSABLE (olddecl) && warn_inline)
3230 cp_warning ("`%#D' was used before it was declared inline",
3232 cp_warning_at ("previous non-inline declaration here",
3238 /* If new decl is `static' and an `extern' was seen previously,
3240 warn_extern_redeclared_static (newdecl, olddecl);
3242 /* We have committed to returning 1 at this point. */
3243 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3245 /* Now that functions must hold information normally held
3246 by field decls, there is extra work to do so that
3247 declaration information does not get destroyed during
3249 if (DECL_VINDEX (olddecl))
3250 DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3251 if (DECL_CONTEXT (olddecl))
3252 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3253 if (DECL_CLASS_CONTEXT (olddecl))
3254 DECL_CLASS_CONTEXT (newdecl) = DECL_CLASS_CONTEXT (olddecl);
3255 if (DECL_PENDING_INLINE_INFO (newdecl) == (struct pending_inline *)0)
3256 DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3257 DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3258 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3259 DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl);
3260 DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3261 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3262 DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
3263 new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3265 /* Optionally warn about more than one declaration for the same
3266 name, but don't warn about a function declaration followed by a
3268 if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3269 && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3270 /* Don't warn about extern decl followed by definition. */
3271 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3272 /* Don't warn about friends, let add_friend take care of it. */
3273 && ! DECL_FRIEND_P (newdecl))
3275 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl);
3276 cp_warning_at ("previous declaration of `%D'", olddecl);
3280 /* Deal with C++: must preserve virtual function table size. */
3281 if (TREE_CODE (olddecl) == TYPE_DECL)
3283 register tree newtype = TREE_TYPE (newdecl);
3284 register tree oldtype = TREE_TYPE (olddecl);
3286 if (newtype != error_mark_node && oldtype != error_mark_node
3287 && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3289 CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3290 CLASSTYPE_FRIEND_CLASSES (newtype)
3291 = CLASSTYPE_FRIEND_CLASSES (oldtype);
3295 /* Copy all the DECL_... slots specified in the new decl
3296 except for any that we copy here from the old type. */
3297 DECL_MACHINE_ATTRIBUTES (newdecl)
3298 = merge_machine_decl_attributes (olddecl, newdecl);
3300 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3302 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl),
3303 DECL_TEMPLATE_RESULT (olddecl)))
3304 cp_error ("invalid redeclaration of %D", newdecl);
3305 TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3306 DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3307 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3308 DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3315 /* Automatically handles default parameters. */
3316 tree oldtype = TREE_TYPE (olddecl);
3319 /* Merge the data types specified in the two decls. */
3320 newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3322 if (TREE_CODE (newdecl) == VAR_DECL)
3323 DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3324 /* Do this after calling `common_type' so that default
3325 parameters don't confuse us. */
3326 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3327 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3328 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3330 TREE_TYPE (newdecl) = build_exception_variant (newtype,
3331 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3332 TREE_TYPE (olddecl) = build_exception_variant (newtype,
3333 TYPE_RAISES_EXCEPTIONS (oldtype));
3335 if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3336 && DECL_SOURCE_LINE (olddecl) != 0
3338 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
3339 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
3341 cp_error ("declaration of `%F' throws different exceptions",
3343 cp_error_at ("than previous declaration `%F'", olddecl);
3346 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3348 /* Lay the type out, unless already done. */
3349 if (! same_type_p (newtype, oldtype)
3350 && TREE_TYPE (newdecl) != error_mark_node
3351 && !(processing_template_decl && uses_template_parms (newdecl)))
3352 layout_type (TREE_TYPE (newdecl));
3354 if ((TREE_CODE (newdecl) == VAR_DECL
3355 || TREE_CODE (newdecl) == PARM_DECL
3356 || TREE_CODE (newdecl) == RESULT_DECL
3357 || TREE_CODE (newdecl) == FIELD_DECL
3358 || TREE_CODE (newdecl) == TYPE_DECL)
3359 && !(processing_template_decl && uses_template_parms (newdecl)))
3360 layout_decl (newdecl, 0);
3362 /* Merge the type qualifiers. */
3363 if (TREE_READONLY (newdecl))
3364 TREE_READONLY (olddecl) = 1;
3365 if (TREE_THIS_VOLATILE (newdecl))
3366 TREE_THIS_VOLATILE (olddecl) = 1;
3368 /* Merge the initialization information. */
3369 if (DECL_INITIAL (newdecl) == NULL_TREE
3370 && DECL_INITIAL (olddecl) != NULL_TREE)
3372 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3373 DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3374 DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3375 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
3376 && DECL_LANG_SPECIFIC (newdecl)
3377 && DECL_LANG_SPECIFIC (olddecl))
3378 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3381 /* Merge the section attribute.
3382 We want to issue an error if the sections conflict but that must be
3383 done later in decl_attributes since we are called before attributes
3385 if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3386 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3388 /* Keep the old rtl since we can safely use it. */
3389 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3391 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3393 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl)
3394 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl);
3395 DECL_NO_CHECK_MEMORY_USAGE (newdecl)
3396 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl);
3397 DECL_NO_LIMIT_STACK (newdecl)
3398 |= DECL_NO_LIMIT_STACK (olddecl);
3401 /* If cannot merge, then use the new type and qualifiers,
3402 and don't preserve the old rtl. */
3405 /* Clean out any memory we had of the old declaration. */
3406 tree oldstatic = value_member (olddecl, static_aggregates);
3408 TREE_VALUE (oldstatic) = error_mark_node;
3410 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3411 TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3412 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3413 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3416 /* Merge the storage class information. */
3417 DECL_WEAK (newdecl) |= DECL_WEAK (olddecl);
3418 DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3419 DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl);
3420 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3421 TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3422 if (! DECL_EXTERNAL (olddecl))
3423 DECL_EXTERNAL (newdecl) = 0;
3425 if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3427 DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3428 DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3429 DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3430 DECL_TEMPLATE_INSTANTIATED (newdecl)
3431 |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3432 /* Don't really know how much of the language-specific
3433 values we should copy from old to new. */
3434 DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3435 DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3436 DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3437 DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3438 olddecl_friend = DECL_FRIEND_P (olddecl);
3440 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3441 if (TREE_CODE (newdecl) == FUNCTION_DECL
3442 || DECL_FUNCTION_TEMPLATE_P (newdecl))
3443 DECL_BEFRIENDING_CLASSES (newdecl)
3444 = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3445 DECL_BEFRIENDING_CLASSES (olddecl));
3448 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3450 if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3451 && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3453 /* If newdecl is not a specialization, then it is not a
3454 template-related function at all. And that means that we
3455 shoud have exited above, returning 0. */
3456 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3459 if (TREE_USED (olddecl))
3460 /* From [temp.expl.spec]:
3462 If a template, a member template or the member of a class
3463 template is explicitly specialized then that
3464 specialization shall be declared before the first use of
3465 that specialization that would cause an implicit
3466 instantiation to take place, in every translation unit in
3467 which such a use occurs. */
3468 cp_error ("explicit specialization of %D after first use",
3471 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3473 DECL_THIS_INLINE (newdecl) |= DECL_THIS_INLINE (olddecl);
3475 /* If either decl says `inline', this fn is inline, unless its
3476 definition was passed already. */
3477 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3478 DECL_INLINE (olddecl) = 1;
3479 DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3483 DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3484 DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3485 DECL_RTL (olddecl) = DECL_RTL (newdecl);
3487 if (! types_match || new_defines_function)
3489 /* These need to be copied so that the names are available.
3490 Note that if the types do match, we'll preserve inline
3491 info and other bits, but if not, we won't. */
3492 DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3493 DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3495 if (new_defines_function)
3496 /* If defining a function declared with other language
3497 linkage, use the previously declared language linkage. */
3498 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3499 else if (types_match)
3501 /* If redeclaring a builtin function, and not a definition,
3502 it stays built in. */
3503 if (DECL_BUILT_IN (olddecl))
3505 DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl);
3506 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3507 /* If we're keeping the built-in definition, keep the rtl,
3508 regardless of declaration matches. */
3509 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3512 DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
3514 DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3515 if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl)))
3516 /* Previously saved insns go together with
3517 the function's previous definition. */
3518 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3519 /* Don't clear out the arguments if we're redefining a function. */
3520 if (DECL_ARGUMENTS (olddecl))
3521 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3523 if (DECL_LANG_SPECIFIC (olddecl))
3524 DECL_MAIN_VARIANT (newdecl) = DECL_MAIN_VARIANT (olddecl);
3527 if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3529 NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3532 /* Now preserve various other info from the definition. */
3533 TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3534 TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3535 DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3536 DECL_ASSEMBLER_NAME (newdecl) = DECL_ASSEMBLER_NAME (olddecl);
3538 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3542 function_size = sizeof (struct tree_decl);
3544 bcopy ((char *) newdecl + sizeof (struct tree_common),
3545 (char *) olddecl + sizeof (struct tree_common),
3546 function_size - sizeof (struct tree_common));
3548 if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3550 /* If newdecl is a template instantiation, it is possible that
3551 the following sequence of events has occurred:
3553 o A friend function was declared in a class template. The
3554 class template was instantiated.
3556 o The instantiation of the friend declaration was
3557 recorded on the instantiation list, and is newdecl.
3559 o Later, however, instantiate_class_template called pushdecl
3560 on the newdecl to perform name injection. But, pushdecl in
3561 turn called duplicate_decls when it discovered that another
3562 declaration of a global function with the same name already
3565 o Here, in duplicate_decls, we decided to clobber newdecl.
3567 If we're going to do that, we'd better make sure that
3568 olddecl, and not newdecl, is on the list of
3569 instantiations so that if we try to do the instantiation
3570 again we won't get the clobbered declaration. */
3572 tree tmpl = DECL_TI_TEMPLATE (newdecl);
3573 tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3575 for (; decls; decls = TREE_CHAIN (decls))
3576 if (TREE_VALUE (decls) == newdecl)
3577 TREE_VALUE (decls) = olddecl;
3582 bcopy ((char *) newdecl + sizeof (struct tree_common),
3583 (char *) olddecl + sizeof (struct tree_common),
3584 sizeof (struct tree_decl) - sizeof (struct tree_common)
3585 + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3588 DECL_UID (olddecl) = olddecl_uid;
3590 DECL_FRIEND_P (olddecl) = 1;
3592 /* NEWDECL contains the merged attribute lists.
3593 Update OLDDECL to be the same. */
3594 DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl);
3599 /* Record a decl-node X as belonging to the current lexical scope.
3600 Check for errors (such as an incompatible declaration for the same
3601 name already seen in the same scope).
3603 Returns either X or an old decl for the same name.
3604 If an old decl is returned, it may have been smashed
3605 to agree with what X says. */
3613 int need_new_binding;
3615 /* We shouldn't be calling pushdecl when we're generating RTL for a
3616 function that we already did semantic analysis on previously. */
3617 my_friendly_assert (!cfun || doing_semantic_analysis_p (),
3620 name = DECL_ASSEMBLER_NAME (x);
3621 need_new_binding = 1;
3623 if (DECL_TEMPLATE_PARM_P (x))
3624 /* Template parameters have no context; they are not X::T even
3625 when declared within a class or namespace. */
3629 if (current_function_decl && x != current_function_decl
3630 /* A local declaration for a function doesn't constitute
3632 && !(TREE_CODE (x) == FUNCTION_DECL && !DECL_INITIAL (x))
3633 /* A local declaration for an `extern' variable is in the
3634 scoped of the current namespace, not the current
3636 && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
3637 /* Don't change DECL_CONTEXT of virtual methods. */
3638 && (TREE_CODE (x) != FUNCTION_DECL || !DECL_VIRTUAL_P (x))
3639 && !DECL_CONTEXT (x))
3640 DECL_CONTEXT (x) = current_function_decl;
3641 if (!DECL_CONTEXT (x))
3642 DECL_CONTEXT (x) = FROB_CONTEXT (current_namespace);
3644 /* If this is the declaration for a namespace-scope function,
3645 but the declaration itself is in a local scope, mark the
3647 if (TREE_CODE (x) == FUNCTION_DECL
3648 && DECL_NAMESPACE_SCOPE_P (x)
3649 && current_function_decl
3650 && x != current_function_decl)
3651 DECL_LOCAL_FUNCTION_P (x) = 1;
3654 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3655 compiler wants to use. */
3656 if (TREE_CODE (x) == TYPE_DECL || TREE_CODE (x) == VAR_DECL
3657 || TREE_CODE (x) == NAMESPACE_DECL)
3658 name = DECL_NAME (x);
3663 /* Not needed...see below. */
3667 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3668 name = TREE_OPERAND (name, 0);
3670 /* Namespace-scoped variables are not found in the current level. */
3671 if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x))
3672 t = namespace_binding (name, DECL_CONTEXT (x));
3674 t = lookup_name_current_level (name);
3675 if (t == error_mark_node)
3677 /* error_mark_node is 0 for a while during initialization! */
3679 cp_error_at ("`%#D' used prior to declaration", x);
3682 else if (t != NULL_TREE)
3685 /* This is turned off until I have time to do it right (bpk). */
3686 /* With the code below that uses it... */
3687 file = DECL_SOURCE_FILE (t);
3688 line = DECL_SOURCE_LINE (t);
3690 if (TREE_CODE (t) == PARM_DECL)
3692 if (DECL_CONTEXT (t) == NULL_TREE)
3693 fatal ("parse errors have confused me too much");
3695 /* Check for duplicate params. */
3696 if (duplicate_decls (x, t))
3699 else if (((TREE_CODE (x) == FUNCTION_DECL && DECL_LANGUAGE (x) == lang_c)
3700 || DECL_FUNCTION_TEMPLATE_P (x))
3701 && is_overloaded_fn (t))
3702 /* Don't do anything just yet. */;
3703 else if (t == wchar_decl_node)
3705 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3706 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x));
3708 /* Throw away the redeclaration. */
3711 else if (TREE_CODE (t) != TREE_CODE (x))
3713 if (duplicate_decls (x, t))
3716 else if (duplicate_decls (x, t))
3719 /* This is turned off until I have time to do it right (bpk). */
3721 /* Also warn if they did a prototype with `static' on it, but
3722 then later left the `static' off. */
3723 if (! TREE_PUBLIC (name) && TREE_PUBLIC (x))
3725 if (DECL_LANG_SPECIFIC (t) && DECL_FRIEND_P (t))
3730 cp_warning ("`static' missing from declaration of `%D'",
3732 warning_with_file_and_line (file, line,
3733 "previous declaration of `%s'",
3734 decl_as_string (t, 0));
3737 /* Now fix things so it'll do what they expect. */
3738 if (current_function_decl)
3739 TREE_PUBLIC (current_function_decl) = 0;
3741 /* Due to interference in memory reclamation (X may be
3742 obstack-deallocated at this point), we must guard against
3743 one really special case. [jason: This should be handled
3744 by start_function] */
3745 if (current_function_decl == x)
3746 current_function_decl = t;
3748 if (TREE_CODE (t) == TYPE_DECL)
3749 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3750 else if (TREE_CODE (t) == FUNCTION_DECL)
3751 check_default_args (t);
3755 else if (DECL_MAIN_P (x))
3757 /* A redeclaration of main, but not a duplicate of the
3762 This function shall not be overloaded. */
3763 cp_error_at ("invalid redeclaration of `%D'", t);
3764 cp_error ("as `%D'", x);
3765 /* We don't try to push this declaration since that
3771 check_template_shadow (x);
3773 /* If this is a function conjured up by the backend, massage it
3774 so it looks friendly. */
3775 if (TREE_CODE (x) == FUNCTION_DECL
3776 && ! DECL_LANG_SPECIFIC (x))
3778 retrofit_lang_decl (x);
3779 DECL_LANGUAGE (x) = lang_c;
3782 if (TREE_CODE (x) == FUNCTION_DECL && ! DECL_FUNCTION_MEMBER_P (x))
3784 t = push_overloaded_decl (x, PUSH_LOCAL);
3787 if (!namespace_bindings_p ())
3788 /* We do not need to create a binding for this name;
3789 push_overloaded_decl will have already done so if
3791 need_new_binding = 0;
3793 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3795 t = push_overloaded_decl (x, PUSH_GLOBAL);
3797 add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
3801 /* If declaring a type as a typedef, copy the type (unless we're
3802 at line 0), and install this TYPE_DECL as the new type's typedef
3803 name. See the extensive comment in ../c-decl.c (pushdecl). */
3804 if (TREE_CODE (x) == TYPE_DECL)
3806 tree type = TREE_TYPE (x);
3807 if (DECL_SOURCE_LINE (x) == 0)
3809 if (TYPE_NAME (type) == 0)
3810 TYPE_NAME (type) = x;
3812 else if (type != error_mark_node && TYPE_NAME (type) != x
3813 /* We don't want to copy the type when all we're
3814 doing is making a TYPE_DECL for the purposes of
3816 && (!TYPE_NAME (type)
3817 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
3819 DECL_ORIGINAL_TYPE (x) = type;
3820 type = build_type_copy (type);
3821 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
3822 TYPE_NAME (type) = x;
3823 TREE_TYPE (x) = type;
3826 if (type != error_mark_node
3828 && TYPE_IDENTIFIER (type))
3829 set_identifier_type_value_with_scope (DECL_NAME (x), type,
3830 current_binding_level);
3834 /* Multiple external decls of the same identifier ought to match.
3836 We get warnings about inline functions where they are defined.
3837 We get warnings about other functions from push_overloaded_decl.
3839 Avoid duplicate warnings where they are used. */
3840 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
3844 if (IDENTIFIER_NAMESPACE_VALUE (name) != NULL_TREE
3845 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name))
3846 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name))))
3847 decl = IDENTIFIER_NAMESPACE_VALUE (name);
3852 /* If different sort of thing, we already gave an error. */
3853 && TREE_CODE (decl) == TREE_CODE (x)
3854 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
3856 cp_pedwarn ("type mismatch with previous external decl", x);
3857 cp_pedwarn_at ("previous external decl of `%#D'", decl);
3861 /* This name is new in its binding level.
3862 Install the new declaration and return it. */
3863 if (namespace_bindings_p ())
3865 /* Install a global value. */
3867 /* If the first global decl has external linkage,
3868 warn if we later see static one. */
3869 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
3870 TREE_PUBLIC (name) = 1;
3872 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
3874 /* For an ordinary function, we create a binding from
3875 the mangled name (i.e., NAME) to the DECL. But, for
3876 an `extern "C"' function, the mangled name and the
3877 ordinary name are the same so we need not do this. */
3878 && !(TREE_CODE (x) == FUNCTION_DECL &&
3879 DECL_LANGUAGE (x) == lang_c))
3881 if (TREE_CODE (x) == FUNCTION_DECL)
3883 ((IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE)
3884 || (IDENTIFIER_GLOBAL_VALUE (name) == x), 378);
3885 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
3888 /* Don't forget if the function was used via an implicit decl. */
3889 if (IDENTIFIER_IMPLICIT_DECL (name)
3890 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
3893 /* Don't forget if its address was taken in that way. */
3894 if (IDENTIFIER_IMPLICIT_DECL (name)
3895 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
3896 TREE_ADDRESSABLE (x) = 1;
3898 /* Warn about mismatches against previous implicit decl. */
3899 if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
3900 /* If this real decl matches the implicit, don't complain. */
3901 && ! (TREE_CODE (x) == FUNCTION_DECL
3902 && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
3904 ("`%D' was previously implicitly declared to return `int'", x);
3906 /* If new decl is `static' and an `extern' was seen previously,
3908 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
3909 warn_extern_redeclared_static (x, t);
3913 /* Here to install a non-global value. */
3914 tree oldlocal = IDENTIFIER_VALUE (name);
3915 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
3917 if (need_new_binding)
3919 push_local_binding (name, x, 0);
3920 /* Because push_local_binding will hook X on to the
3921 current_binding_level's name list, we don't want to
3922 do that again below. */
3923 need_new_binding = 0;
3926 /* If this is a TYPE_DECL, push it into the type value slot. */
3927 if (TREE_CODE (x) == TYPE_DECL)
3928 set_identifier_type_value_with_scope (name, TREE_TYPE (x),
3929 current_binding_level);
3931 /* Clear out any TYPE_DECL shadowed by a namespace so that
3932 we won't think this is a type. The C struct hack doesn't
3933 go through namespaces. */
3934 if (TREE_CODE (x) == NAMESPACE_DECL)
3935 set_identifier_type_value_with_scope (name, NULL_TREE,
3936 current_binding_level);
3941 while (oldlocal && DECL_DEAD_FOR_LOCAL (oldlocal))
3943 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
3945 if (oldlocal == NULL_TREE)
3946 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
3949 /* If this is an extern function declaration, see if we
3950 have a global definition or declaration for the function. */
3951 if (oldlocal == NULL_TREE
3952 && DECL_EXTERNAL (x)
3953 && oldglobal != NULL_TREE
3954 && TREE_CODE (x) == FUNCTION_DECL
3955 && TREE_CODE (oldglobal) == FUNCTION_DECL)
3957 /* We have one. Their types must agree. */
3958 if (decls_match (x, oldglobal))
3962 cp_warning ("extern declaration of `%#D' doesn't match", x);
3963 cp_warning_at ("global declaration `%#D'", oldglobal);
3966 /* If we have a local external declaration,
3967 and no file-scope declaration has yet been seen,
3968 then if we later have a file-scope decl it must not be static. */
3969 if (oldlocal == NULL_TREE
3970 && oldglobal == NULL_TREE
3971 && DECL_EXTERNAL (x)
3973 TREE_PUBLIC (name) = 1;
3975 /* Warn if shadowing an argument at the top level of the body. */
3976 if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
3977 /* Inline decls shadow nothing. */
3978 && !DECL_FROM_INLINE (x)
3979 && TREE_CODE (oldlocal) == PARM_DECL
3980 /* Don't complain if it's from an enclosing function. */
3981 && DECL_CONTEXT (oldlocal) == current_function_decl
3982 && TREE_CODE (x) != PARM_DECL)
3984 /* Go to where the parms should be and see if we
3986 struct binding_level *b = current_binding_level->level_chain;
3992 if (b->parm_flag == 1)
3993 cp_error ("declaration of `%#D' shadows a parameter", name);
3996 /* Maybe warn if shadowing something else. */
3997 if (warn_shadow && !DECL_EXTERNAL (x)
3998 /* Inline decls shadow nothing. */
3999 && !DECL_FROM_INLINE (x)
4000 /* No shadow warnings for internally generated vars. */
4001 && ! DECL_ARTIFICIAL (x)
4002 /* No shadow warnings for vars made for inlining. */
4003 && ! DECL_FROM_INLINE (x))
4005 if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL)
4006 warning ("declaration of `%s' shadows a parameter",
4007 IDENTIFIER_POINTER (name));
4008 else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4009 && current_class_ptr
4010 && !TREE_STATIC (name))
4011 warning ("declaration of `%s' shadows a member of `this'",
4012 IDENTIFIER_POINTER (name));
4013 else if (oldlocal != NULL_TREE)
4014 warning ("declaration of `%s' shadows previous local",
4015 IDENTIFIER_POINTER (name));
4016 else if (oldglobal != NULL_TREE)
4017 /* XXX shadow warnings in outer-more namespaces */
4018 warning ("declaration of `%s' shadows global declaration",
4019 IDENTIFIER_POINTER (name));
4023 if (TREE_CODE (x) == FUNCTION_DECL)
4024 check_default_args (x);
4026 /* Keep count of variables in this level with incomplete type. */
4027 if (TREE_CODE (x) == VAR_DECL
4028 && TREE_TYPE (x) != error_mark_node
4029 && ((TYPE_SIZE (TREE_TYPE (x)) == NULL_TREE
4030 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE))
4031 /* RTTI TD entries are created while defining the type_info. */
4032 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x))
4033 && TYPE_BEING_DEFINED (TREE_TYPE (x)))))
4034 current_binding_level->incomplete
4035 = tree_cons (NULL_TREE, x, current_binding_level->incomplete);
4038 if (need_new_binding)
4039 add_decl_to_level (x,
4040 DECL_NAMESPACE_SCOPE_P (x)
4041 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
4042 : current_binding_level);
4047 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4048 caller to set DECL_CONTEXT properly. */
4051 pushdecl_with_scope (x, level)
4053 struct binding_level *level;
4055 register struct binding_level *b;
4056 tree function_decl = current_function_decl;
4058 current_function_decl = NULL_TREE;
4059 if (level->parm_flag == 2)
4061 b = class_binding_level;
4062 class_binding_level = level;
4063 pushdecl_class_level (x);
4064 class_binding_level = b;
4068 b = current_binding_level;
4069 current_binding_level = level;
4071 current_binding_level = b;
4073 current_function_decl = function_decl;
4077 /* Like pushdecl, only it places X in the current namespace,
4081 pushdecl_namespace_level (x)
4084 register struct binding_level *b = current_binding_level;
4087 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4089 /* Now, the type_shadowed stack may screw us. Munge it so it does
4091 if (TREE_CODE (x) == TYPE_DECL)
4093 tree name = DECL_NAME (x);
4095 tree *ptr = (tree *)0;
4096 for (; b != global_binding_level; b = b->level_chain)
4098 tree shadowed = b->type_shadowed;
4099 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4100 if (TREE_PURPOSE (shadowed) == name)
4102 ptr = &TREE_VALUE (shadowed);
4103 /* Can't break out of the loop here because sometimes
4104 a binding level will have duplicate bindings for
4105 PT names. It's gross, but I haven't time to fix it. */
4108 newval = TREE_TYPE (x);
4109 if (ptr == (tree *)0)
4111 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4112 up here if this is changed to an assertion. --KR */
4113 SET_IDENTIFIER_TYPE_VALUE (name, newval);
4123 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4127 pushdecl_top_level (x)
4130 push_to_top_level ();
4131 x = pushdecl_namespace_level (x);
4132 pop_from_top_level ();
4136 /* Make the declaration of X appear in CLASS scope. */
4139 pushdecl_class_level (x)
4142 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4143 scope looks for the pre-mangled name. */
4146 if (TREE_CODE (x) == OVERLOAD)
4147 x = OVL_CURRENT (x);
4148 name = DECL_NAME (x);
4152 push_class_level_binding (name, x);
4153 if (TREE_CODE (x) == TYPE_DECL)
4154 set_identifier_type_value (name, TREE_TYPE (x));
4156 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
4160 for (f = TYPE_FIELDS (TREE_TYPE (x));
4163 pushdecl_class_level (f);
4167 /* Enter DECL into the symbol table, if that's appropriate. Returns
4168 DECL, or a modified version thereof. */
4171 maybe_push_decl (decl)
4174 tree type = TREE_TYPE (decl);
4176 /* Add this decl to the current binding level, but not if it comes
4177 from another scope, e.g. a static member variable. TEM may equal
4178 DECL or it may be a previous decl of the same name. */
4179 if (decl == error_mark_node
4180 || (TREE_CODE (decl) != PARM_DECL
4181 && DECL_CONTEXT (decl) != NULL_TREE
4182 /* Definitions of namespace members outside their namespace are
4184 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
4185 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
4186 || TREE_CODE (type) == UNKNOWN_TYPE
4187 /* The declaration of a template specialization does not affect
4188 the functions available for overload resolution, so we do not
4190 || (TREE_CODE (decl) == FUNCTION_DECL
4191 && DECL_TEMPLATE_SPECIALIZATION (decl)))
4194 return pushdecl (decl);
4198 /* This function is used to push the mangled decls for nested types into
4199 the appropriate scope. Previously pushdecl_top_level was used, but that
4200 is incorrect for members of local classes. */
4203 pushdecl_nonclass_level (x)
4206 struct binding_level *b = current_binding_level;
4208 my_friendly_assert (b->parm_flag != 2, 180);
4211 /* Get out of template binding levels */
4212 while (b->pseudo_global)
4216 pushdecl_with_scope (x, b);
4220 /* Make the declaration(s) of X appear in CLASS scope
4221 under the name NAME. */
4224 push_class_level_binding (name, x)
4229 /* The class_binding_level will be NULL if x is a template
4230 parameter name in a member template. */
4231 if (!class_binding_level)
4234 /* Make sure that this new member does not have the same name
4235 as a template parameter. */
4236 if (TYPE_BEING_DEFINED (current_class_type))
4237 check_template_shadow (x);
4239 /* If this declaration shadows a declaration from an enclosing
4240 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4241 we leave this class. Record the shadowed declaration here. */
4242 binding = IDENTIFIER_BINDING (name);
4244 && ((TREE_CODE (x) == OVERLOAD
4245 && BINDING_VALUE (binding)
4246 && is_overloaded_fn (BINDING_VALUE (binding)))
4247 || INHERITED_VALUE_BINDING_P (binding)))
4252 /* If the old binding was from a base class, and was for a tag
4253 name, slide it over to make room for the new binding. The
4254 old binding is still visible if explicitly qualified with a
4256 if (INHERITED_VALUE_BINDING_P (binding)
4257 && BINDING_VALUE (binding)
4258 && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4259 && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4260 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4262 old_decl = BINDING_TYPE (binding);
4263 BINDING_TYPE (binding) = BINDING_VALUE (binding);
4264 BINDING_VALUE (binding) = NULL_TREE;
4265 INHERITED_VALUE_BINDING_P (binding) = 0;
4268 old_decl = BINDING_VALUE (binding);
4270 /* There was already a binding for X containing fewer
4271 functions than are named in X. Find the previous
4272 declaration of X on the class-shadowed list, and update it. */
4273 for (shadow = class_binding_level->class_shadowed;
4275 shadow = TREE_CHAIN (shadow))
4276 if (TREE_PURPOSE (shadow) == name
4277 && TREE_TYPE (shadow) == old_decl)
4279 BINDING_VALUE (binding) = x;
4280 INHERITED_VALUE_BINDING_P (binding) = 0;
4281 TREE_TYPE (shadow) = x;
4286 /* If we didn't replace an existing binding, put the binding on the
4287 stack of bindings for the identifier, and update
4288 IDENTIFIER_CLASS_VALUE. */
4289 if (push_class_binding (name, x))
4291 class_binding_level->class_shadowed
4292 = tree_cons (name, IDENTIFIER_CLASS_VALUE (name),
4293 class_binding_level->class_shadowed);
4294 /* Record the value we are binding NAME to so that we can know
4295 what to pop later. */
4296 TREE_TYPE (class_binding_level->class_shadowed) = x;
4300 /* Insert another USING_DECL into the current binding level,
4301 returning this declaration. If this is a redeclaration,
4302 do nothing and return NULL_TREE. */
4305 push_using_decl (scope, name)
4311 my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4312 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4313 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4314 if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4318 decl = build_lang_decl (USING_DECL, name, void_type_node);
4319 DECL_INITIAL (decl) = scope;
4320 TREE_CHAIN (decl) = current_binding_level->usings;
4321 current_binding_level->usings = decl;
4325 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4326 changed (i.e. there was already a directive), or the fresh
4327 TREE_LIST otherwise. */
4330 push_using_directive (used)
4333 tree ud = current_binding_level->using_directives;
4334 tree iter, ancestor;
4336 /* Check if we already have this. */
4337 if (purpose_member (used, ud) != NULL_TREE)
4340 /* Recursively add all namespaces used. */
4341 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4342 push_using_directive (TREE_PURPOSE (iter));
4344 ancestor = namespace_ancestor (current_decl_namespace (), used);
4345 ud = current_binding_level->using_directives;
4346 ud = tree_cons (used, ancestor, ud);
4347 current_binding_level->using_directives = ud;
4351 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4352 other definitions already in place. We get around this by making
4353 the value of the identifier point to a list of all the things that
4354 want to be referenced by that name. It is then up to the users of
4355 that name to decide what to do with that list.
4357 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4358 slot. It is dealt with the same way.
4360 FLAGS is a bitwise-or of the following values:
4361 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4363 PUSH_USING: DECL is being pushed as the result of a using
4366 The value returned may be a previous declaration if we guessed wrong
4367 about what language DECL should belong to (C or C++). Otherwise,
4368 it's always DECL (and never something that's not a _DECL). */
4371 push_overloaded_decl (decl, flags)
4375 tree name = DECL_NAME (decl);
4378 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4381 old = namespace_binding (name, DECL_CONTEXT (decl));
4383 old = lookup_name_current_level (name);
4387 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4389 tree t = TREE_TYPE (old);
4390 if (IS_AGGR_TYPE (t) && warn_shadow
4391 && (! DECL_IN_SYSTEM_HEADER (decl)
4392 || ! DECL_IN_SYSTEM_HEADER (old)))
4393 cp_warning ("`%#D' hides constructor for `%#T'", decl, t);
4396 else if (is_overloaded_fn (old))
4400 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4402 tree fn = OVL_CURRENT (tmp);
4404 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4405 && !(flags & PUSH_USING)
4406 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4407 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4408 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4411 if (duplicate_decls (decl, fn))
4417 cp_error_at ("previous non-function declaration `%#D'", old);
4418 cp_error ("conflicts with function declaration `%#D'", decl);
4423 if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4425 if (old && TREE_CODE (old) != OVERLOAD)
4426 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4428 new_binding = ovl_cons (decl, old);
4429 if (flags & PUSH_USING)
4430 OVL_USED (new_binding) = 1;
4433 /* NAME is not ambiguous. */
4437 set_namespace_binding (name, current_namespace, new_binding);
4440 /* We only create an OVERLOAD if there was a previous binding at
4441 this level, or if decl is a template. In the former case, we
4442 need to remove the old binding and replace it with the new
4443 binding. We must also run through the NAMES on the binding
4444 level where the name was bound to update the chain. */
4446 if (TREE_CODE (new_binding) == OVERLOAD && old)
4450 for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4452 d = &TREE_CHAIN (*d))
4454 || (TREE_CODE (*d) == TREE_LIST
4455 && TREE_VALUE (*d) == old))
4457 if (TREE_CODE (*d) == TREE_LIST)
4458 /* Just replace the old binding with the new. */
4459 TREE_VALUE (*d) = new_binding;
4461 /* Build a TREE_LIST to wrap the OVERLOAD. */
4462 *d = tree_cons (NULL_TREE, new_binding,
4465 /* And update the CPLUS_BINDING node. */
4466 BINDING_VALUE (IDENTIFIER_BINDING (name))
4471 /* We should always find a previous binding in this case. */
4472 my_friendly_abort (0);
4475 /* Install the new binding. */
4476 push_local_binding (name, new_binding, flags);
4482 /* Generate an implicit declaration for identifier FUNCTIONID
4483 as a function of type int (). Print a warning if appropriate. */
4486 implicitly_declare (functionid)
4491 /* We used to reuse an old implicit decl here,
4492 but this loses with inline functions because it can clobber
4493 the saved decl chains. */
4494 decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4496 DECL_EXTERNAL (decl) = 1;
4497 TREE_PUBLIC (decl) = 1;
4499 /* ANSI standard says implicit declarations are in the innermost block.
4500 So we record the decl in the standard fashion. */
4502 rest_of_decl_compilation (decl, NULL_PTR, 0, 0);
4505 /* Only one warning per identifier. */
4506 && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4508 cp_pedwarn ("implicit declaration of function `%#D'", decl);
4511 SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4516 /* Return zero if the declaration NEWDECL is valid
4517 when the declaration OLDDECL (assumed to be for the same name)
4518 has already been seen.
4519 Otherwise return an error message format string with a %s
4520 where the identifier should go. */
4523 redeclaration_error_message (newdecl, olddecl)
4524 tree newdecl, olddecl;
4526 if (TREE_CODE (newdecl) == TYPE_DECL)
4528 /* Because C++ can put things into name space for free,
4529 constructs like "typedef struct foo { ... } foo"
4530 would look like an erroneous redeclaration. */
4531 if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4534 return "redefinition of `%#D'";
4536 else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4538 /* If this is a pure function, its olddecl will actually be
4539 the original initialization to `0' (which we force to call
4540 abort()). Don't complain about redefinition in this case. */
4541 if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl))
4544 /* If both functions come from different namespaces, this is not
4545 a redeclaration - this is a conflict with a used function. */
4546 if (DECL_NAMESPACE_SCOPE_P (olddecl)
4547 && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4548 return "`%D' conflicts with used function";
4550 /* We'll complain about linkage mismatches in
4551 warn_extern_redeclared_static. */
4553 /* Defining the same name twice is no good. */
4554 if (DECL_INITIAL (olddecl) != NULL_TREE
4555 && DECL_INITIAL (newdecl) != NULL_TREE)
4557 if (DECL_NAME (olddecl) == NULL_TREE)
4558 return "`%#D' not declared in class";
4560 return "redefinition of `%#D'";
4564 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4566 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4567 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4568 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4569 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4570 && TYPE_SIZE (TREE_TYPE (newdecl))
4571 && TYPE_SIZE (TREE_TYPE (olddecl))))
4572 return "redefinition of `%#D'";
4575 else if (toplevel_bindings_p ())
4577 /* Objects declared at top level: */
4578 /* If at least one is a reference, it's ok. */
4579 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4581 /* Reject two definitions. */
4582 return "redefinition of `%#D'";
4586 /* Objects declared with block scope: */
4587 /* Reject two definitions, and reject a definition
4588 together with an external reference. */
4589 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4590 return "redeclaration of `%#D'";
4595 /* Create a new label, named ID. */
4598 make_label_decl (id, local_p)
4604 decl = build_decl (LABEL_DECL, id, void_type_node);
4606 /* Make sure every label has an rtx. */
4609 DECL_CONTEXT (decl) = current_function_decl;
4610 DECL_MODE (decl) = VOIDmode;
4611 C_DECLARED_LABEL_FLAG (decl) = local_p;
4613 /* Say where one reference is to the label, for the sake of the
4614 error if it is not defined. */
4615 DECL_SOURCE_LINE (decl) = lineno;
4616 DECL_SOURCE_FILE (decl) = input_filename;
4618 /* Record the fact that this identifier is bound to this label. */
4619 SET_IDENTIFIER_LABEL_VALUE (id, decl);
4621 /* Record this label on the list of used labels so that we can check
4622 at the end of the function to see whether or not the label was
4623 actually defined. */
4624 if ((named_label_uses == NULL || named_label_uses->label_decl != decl)
4625 && (named_label_uses == NULL
4626 || named_label_uses->names_in_scope != current_binding_level->names
4627 || named_label_uses->label_decl != decl))
4629 struct named_label_list *new_ent;
4631 = (struct named_label_list*)oballoc (sizeof (struct named_label_list));
4632 new_ent->label_decl = decl;
4633 new_ent->names_in_scope = current_binding_level->names;
4634 new_ent->binding_level = current_binding_level;
4635 new_ent->lineno_o_goto = lineno;
4636 new_ent->filename_o_goto = input_filename;
4637 new_ent->next = named_label_uses;
4638 named_label_uses = new_ent;
4644 /* Look for a label named ID in the current function. If one cannot
4645 be found, create one. (We keep track of used, but undefined,
4646 labels, and complain about them at the end of a function.) */
4654 /* You can't use labels at global scope. */
4655 if (current_function_decl == NULL_TREE)
4657 error ("label `%s' referenced outside of any function",
4658 IDENTIFIER_POINTER (id));
4662 /* See if we've already got this label. */
4663 decl = IDENTIFIER_LABEL_VALUE (id);
4664 if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
4667 /* Record this label on the list of labels used in this function.
4668 We do this before calling make_label_decl so that we get the
4669 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4670 named_labels = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4672 /* We need a new label. */
4673 decl = make_label_decl (id, /*local_p=*/0);
4674 /* Now fill in the information we didn't have before. */
4675 TREE_VALUE (named_labels) = decl;
4680 /* Declare a local label named ID. */
4683 declare_local_label (id)
4688 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4689 this scope we can restore the old value of
4690 IDENTIFIER_TYPE_VALUE. */
4691 current_binding_level->shadowed_labels
4692 = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4693 current_binding_level->shadowed_labels);
4694 /* Look for the label. */
4695 decl = make_label_decl (id, /*local_p=*/1);
4696 /* Now fill in the information we didn't have before. */
4697 TREE_VALUE (current_binding_level->shadowed_labels) = decl;
4702 /* Define a label, specifying the location in the source file.
4703 Return the LABEL_DECL node for the label, if the definition is valid.
4704 Otherwise return 0. */
4707 define_label (filename, line, name)
4712 tree decl = lookup_label (name);
4714 /* After labels, make any new cleanups go into their
4715 own new (temporary) binding contour. */
4716 current_binding_level->more_cleanups_ok = 0;
4718 if (name == get_identifier ("wchar_t"))
4719 cp_pedwarn ("label named wchar_t");
4721 if (DECL_INITIAL (decl) != NULL_TREE)
4723 cp_error ("duplicate label `%D'", decl);
4728 struct named_label_list *uses, *prev;
4732 /* Mark label as having been defined. */
4733 DECL_INITIAL (decl) = error_mark_node;
4734 /* Say where in the source. */
4735 DECL_SOURCE_FILE (decl) = filename;
4736 DECL_SOURCE_LINE (decl) = line;
4739 uses = named_label_uses;
4740 while (uses != NULL)
4741 if (uses->label_decl == decl)
4743 struct binding_level *b = current_binding_level;
4746 tree new_decls = b->names;
4747 tree old_decls = (b == uses->binding_level)
4748 ? uses->names_in_scope : NULL_TREE;
4749 while (new_decls != old_decls)
4751 if (TREE_CODE (new_decls) == VAR_DECL
4752 /* Don't complain about crossing initialization
4753 of internal entities. They can't be accessed,
4754 and they should be cleaned up
4755 by the time we get to the label. */
4756 && ! DECL_ARTIFICIAL (new_decls)
4757 && !(DECL_INITIAL (new_decls) == NULL_TREE
4758 && pod_type_p (TREE_TYPE (new_decls))))
4760 /* This is really only important if we're crossing
4761 an initialization. The POD stuff is just
4762 pedantry; why should it matter if the class
4763 contains a field of pointer to member type? */
4764 int problem = (DECL_INITIAL (new_decls)
4765 || (TYPE_NEEDS_CONSTRUCTING
4766 (TREE_TYPE (new_decls))));
4772 cp_error ("jump to label `%D'", decl);
4773 error_with_file_and_line
4774 (uses->filename_o_goto,
4775 uses->lineno_o_goto, " from here");
4779 cp_pedwarn ("jump to label `%D'", decl);
4780 pedwarn_with_file_and_line
4781 (uses->filename_o_goto,
4782 uses->lineno_o_goto, " from here");
4788 cp_error_at (" crosses initialization of `%#D'",
4791 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4794 new_decls = TREE_CHAIN (new_decls);
4796 if (b == uses->binding_level)
4798 if (b->eh_region && ! saw_eh)
4802 cp_error ("jump to label `%D'", decl);
4803 error_with_file_and_line
4804 (uses->filename_o_goto,
4805 uses->lineno_o_goto, " from here");
4808 error (" enters exception handling block");
4815 prev->next = uses->next;
4817 named_label_uses = uses->next;
4826 current_function_return_value = NULL_TREE;
4833 struct binding_level *level;
4834 struct cp_switch *next;
4837 static struct cp_switch *switch_stack;
4843 = (struct cp_switch *) oballoc (sizeof (struct cp_switch));
4844 p->level = current_binding_level;
4845 p->next = switch_stack;
4852 switch_stack = switch_stack->next;
4855 /* Note that we've seen a definition of a case label, and complain if this
4856 is a bad place for one. */
4859 define_case_label ()
4861 tree cleanup = last_cleanup_this_contour ();
4862 struct binding_level *b = current_binding_level;
4866 /* Don't crash; we'll complain in do_case. */
4871 static int explained = 0;
4872 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup));
4873 warning ("where case label appears here");
4876 warning ("(enclose actions of previous case statements requiring");
4877 warning ("destructors in their own binding contours.)");
4882 for (; b && b != switch_stack->level; b = b->level_chain)
4884 tree new_decls = b->names;
4885 for (; new_decls; new_decls = TREE_CHAIN (new_decls))
4887 if (TREE_CODE (new_decls) == VAR_DECL
4888 /* Don't complain about crossing initialization
4889 of internal entities. They can't be accessed,
4890 and they should be cleaned up
4891 by the time we get to the label. */
4892 && ! DECL_ARTIFICIAL (new_decls)
4893 && ((DECL_INITIAL (new_decls) != NULL_TREE
4894 && DECL_INITIAL (new_decls) != error_mark_node)
4895 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls))))
4898 error ("jump to case label");
4900 cp_error_at (" crosses initialization of `%#D'",
4906 /* After labels, make any new cleanups go into their
4907 own new (temporary) binding contour. */
4909 current_binding_level->more_cleanups_ok = 0;
4910 current_function_return_value = NULL_TREE;
4913 /* Return the list of declarations of the current level.
4914 Note that this list is in reverse order unless/until
4915 you nreverse it; and when you do nreverse it, you must
4916 store the result back using `storedecls' or you will lose. */
4921 return current_binding_level->names;
4924 /* Return the list of type-tags (for structs, etc) of the current level. */
4929 return current_binding_level->tags;
4932 /* Store the list of declarations of the current level.
4933 This is done for the parameter declarations of a function being defined,
4934 after they are modified in the light of any missing parameters. */
4940 current_binding_level->names = decls;
4943 /* Similarly, store the list of tags of the current level. */
4949 current_binding_level->tags = tags;
4952 /* Given NAME, an IDENTIFIER_NODE,
4953 return the structure (or union or enum) definition for that name.
4954 Searches binding levels from BINDING_LEVEL up to the global level.
4955 If THISLEVEL_ONLY is nonzero, searches only the specified context
4956 (but skips any tag-transparent contexts to find one that is
4957 meaningful for tags).
4958 FORM says which kind of type the caller wants;
4959 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4960 If the wrong kind of type is found, and it's not a template, an error is
4964 lookup_tag (form, name, binding_level, thislevel_only)
4965 enum tree_code form;
4967 struct binding_level *binding_level;
4970 register struct binding_level *level;
4971 /* Non-zero if, we should look past a pseudo-global level, even if
4973 int allow_pseudo_global = 1;
4975 for (level = binding_level; level; level = level->level_chain)
4978 if (ANON_AGGRNAME_P (name))
4979 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
4981 /* There's no need for error checking here, because
4982 anon names are unique throughout the compilation. */
4983 if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
4984 return TREE_VALUE (tail);
4986 else if (level->namespace_p)
4987 /* Do namespace lookup. */
4988 for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
4990 tree old = binding_for_name (name, tail);
4992 /* If we just skipped past a pseudo global level, even
4993 though THISLEVEL_ONLY, and we find a template class
4994 declaration, then we use the _TYPE node for the
4995 template. See the example below. */
4996 if (thislevel_only && !allow_pseudo_global
4997 && old && BINDING_VALUE (old)
4998 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
4999 old = TREE_TYPE (BINDING_VALUE (old));
5001 old = BINDING_TYPE (old);
5003 /* If it has an original type, it is a typedef, and we
5004 should not return it. */
5005 if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old)))
5007 if (old && TREE_CODE (old) != form
5008 && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL))
5010 cp_error ("`%#D' redeclared as %C", old, form);
5015 if (thislevel_only || tail == global_namespace)
5019 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5021 if (TREE_PURPOSE (tail) == name)
5023 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
5024 /* Should tighten this up; it'll probably permit
5025 UNION_TYPE and a struct template, for example. */
5027 && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL))
5029 /* Definition isn't the kind we were looking for. */
5030 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail),
5034 return TREE_VALUE (tail);
5037 if (thislevel_only && ! level->tag_transparent)
5039 if (level->pseudo_global && allow_pseudo_global)
5041 /* We must deal with cases like this:
5043 template <class T> struct S;
5044 template <class T> struct S {};
5046 When looking up `S', for the second declaration, we
5047 would like to find the first declaration. But, we
5048 are in the pseudo-global level created for the
5049 template parameters, rather than the (surrounding)
5050 namespace level. Thus, we keep going one more level,
5051 even though THISLEVEL_ONLY is non-zero. */
5052 allow_pseudo_global = 0;
5064 set_current_level_tags_transparency (tags_transparent)
5065 int tags_transparent;
5067 current_binding_level->tag_transparent = tags_transparent;
5071 /* Given a type, find the tag that was defined for it and return the tag name.
5072 Otherwise return 0. However, the value can never be 0
5073 in the cases in which this is used.
5075 C++: If NAME is non-zero, this is the new name to install. This is
5076 done when replacing anonymous tags with real tag names. */
5079 lookup_tag_reverse (type, name)
5083 register struct binding_level *level;
5085 for (level = current_binding_level; level; level = level->level_chain)
5088 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5090 if (TREE_VALUE (tail) == type)
5093 TREE_PURPOSE (tail) = name;
5094 return TREE_PURPOSE (tail);
5101 /* Look up NAME in the NAMESPACE. */
5104 lookup_namespace_name (namespace, name)
5105 tree namespace, name;
5108 tree template_id = NULL_TREE;
5110 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5112 if (TREE_CODE (name) == NAMESPACE_DECL)
5113 /* This happens for A::B<int> when B is a namespace. */
5115 else if (TREE_CODE (name) == TEMPLATE_DECL)
5117 /* This happens for A::B where B is a template, and there are no
5118 template arguments. */
5119 cp_error ("invalid use of `%D'", name);
5120 return error_mark_node;
5123 namespace = ORIGINAL_NAMESPACE (namespace);
5125 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5128 name = TREE_OPERAND (name, 0);
5129 if (TREE_CODE (name) == OVERLOAD)
5130 name = DECL_NAME (OVL_CURRENT (name));
5131 else if (TREE_CODE_CLASS (TREE_CODE (name)) == 'd')
5132 name = DECL_NAME (name);
5135 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5137 val = make_node (CPLUS_BINDING);
5138 if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5139 return error_mark_node;
5141 if (BINDING_VALUE (val))
5143 val = BINDING_VALUE (val);
5147 if (DECL_CLASS_TEMPLATE_P (val))
5148 val = lookup_template_class (val,
5149 TREE_OPERAND (template_id, 1),
5150 /*in_decl=*/NULL_TREE,
5151 /*context=*/NULL_TREE,
5152 /*entering_scope=*/0);
5153 else if (DECL_FUNCTION_TEMPLATE_P (val)
5154 || TREE_CODE (val) == OVERLOAD)
5155 val = lookup_template_function (val,
5156 TREE_OPERAND (template_id, 1));
5159 cp_error ("`%D::%D' is not a template",
5161 return error_mark_node;
5165 /* If we have a single function from a using decl, pull it out. */
5166 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5167 val = OVL_FUNCTION (val);
5171 cp_error ("`%D' undeclared in namespace `%D'", name, namespace);
5172 return error_mark_node;
5175 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5177 static unsigned long
5185 hash = (((unsigned long) TYPE_CONTEXT (t))
5186 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5191 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5194 typename_compare (k1, k2)
5205 d1 = TYPE_NAME (t1);
5206 d2 = TYPE_NAME (t2);
5208 return (DECL_NAME (d1) == DECL_NAME (d2)
5209 && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5210 && ((TREE_TYPE (t1) != NULL_TREE)
5211 == (TREE_TYPE (t2) != NULL_TREE))
5212 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5213 && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5216 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5217 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5218 is non-NULL, this type is being created by the implicit typename
5219 extension, and BASE_TYPE is a type named `t' in some base class of
5220 `T' which depends on template parameters.
5222 Returns the new TYPENAME_TYPE. */
5225 build_typename_type (context, name, fullname, base_type)
5233 struct hash_entry* e;
5235 static struct hash_table ht;
5239 static struct hash_table *h = &ht;
5240 if (!hash_table_init (&ht, &hash_newfunc, &typename_hash,
5242 fatal ("virtual memory exhausted");
5243 ggc_add_tree_hash_table_root (&h, 1);
5246 /* Build the TYPENAME_TYPE. */
5247 t = make_aggr_type (TYPENAME_TYPE);
5248 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5249 TYPENAME_TYPE_FULLNAME (t) = fullname;
5250 TREE_TYPE (t) = base_type;
5252 /* Build the corresponding TYPE_DECL. */
5253 d = build_decl (TYPE_DECL, name, t);
5254 TYPE_NAME (TREE_TYPE (d)) = d;
5255 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5256 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5257 DECL_ARTIFICIAL (d) = 1;
5259 /* See if we already have this type. */
5260 e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5264 /* Insert the type into the table. */
5265 hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5270 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5271 unless an error occurs, in which case error_mark_node is returned.
5272 If COMPLAIN zero, don't complain about any errors that occur. */
5275 make_typename_type (context, name, complain)
5281 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
5283 if (!(TYPE_LANG_SPECIFIC (name)
5284 && (CLASSTYPE_IS_TEMPLATE (name)
5285 || CLASSTYPE_USE_TEMPLATE (name))))
5286 name = TYPE_IDENTIFIER (name);
5288 /* Create a TEMPLATE_ID_EXPR for the type. */
5289 name = build_nt (TEMPLATE_ID_EXPR,
5290 CLASSTYPE_TI_TEMPLATE (name),
5291 CLASSTYPE_TI_ARGS (name));
5293 else if (TREE_CODE (name) == TYPE_DECL)
5294 name = DECL_NAME (name);
5298 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5300 name = TREE_OPERAND (name, 0);
5301 if (TREE_CODE (name) == TEMPLATE_DECL)
5302 name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5304 if (TREE_CODE (name) != IDENTIFIER_NODE)
5305 my_friendly_abort (2000);
5307 if (TREE_CODE (context) == NAMESPACE_DECL)
5309 /* We can get here from typename_sub0 in the explicit_template_type
5310 expansion. Just fail. */
5312 cp_error ("no class template named `%#T' in `%#T'",
5314 return error_mark_node;
5317 if (! uses_template_parms (context)
5318 || currently_open_class (context))
5320 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5322 tree tmpl = NULL_TREE;
5323 if (IS_AGGR_TYPE (context))
5324 tmpl = lookup_field (context, name, 0, 0);
5325 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5328 cp_error ("no class template named `%#T' in `%#T'",
5330 return error_mark_node;
5333 return lookup_template_class (tmpl,
5334 TREE_OPERAND (fullname, 1),
5336 /*entering_scope=*/0);
5342 if (!IS_AGGR_TYPE (context))
5345 cp_error ("no type named `%#T' in `%#T'", name, context);
5346 return error_mark_node;
5349 t = lookup_field (context, name, 0, 1);
5351 return TREE_TYPE (t);
5355 /* If the CONTEXT is not a template type, then either the field is
5356 there now or its never going to be. */
5357 if (!uses_template_parms (context))
5360 cp_error ("no type named `%#T' in `%#T'", name, context);
5361 return error_mark_node;
5365 return build_typename_type (context, name, fullname, NULL_TREE);
5368 /* Select the right _DECL from multiple choices. */
5371 select_decl (binding, flags)
5376 val = BINDING_VALUE (binding);
5377 if (LOOKUP_NAMESPACES_ONLY (flags))
5379 /* We are not interested in types. */
5380 if (val && TREE_CODE (val) == NAMESPACE_DECL)
5385 /* If we could have a type and
5386 we have nothing or we need a type and have none. */
5387 if (BINDING_TYPE (binding)
5388 && (!val || ((flags & LOOKUP_PREFER_TYPES)
5389 && TREE_CODE (val) != TYPE_DECL)))
5390 val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5391 /* Don't return non-types if we really prefer types. */
5392 else if (val && LOOKUP_TYPES_ONLY (flags) && TREE_CODE (val) != TYPE_DECL
5393 && (TREE_CODE (val) != TEMPLATE_DECL
5394 || !DECL_CLASS_TEMPLATE_P (val)))
5400 /* Unscoped lookup of a global: iterate over current namespaces,
5401 considering using-directives. If SPACESP is non-NULL, store a list
5402 of the namespaces we've considered in it. */
5405 unqualified_namespace_lookup (name, flags, spacesp)
5410 tree b = make_node (CPLUS_BINDING);
5411 tree initial = current_decl_namespace();
5412 tree scope = initial;
5414 struct binding_level *level;
5415 tree val = NULL_TREE;
5418 *spacesp = NULL_TREE;
5420 for (; !val; scope = CP_DECL_CONTEXT (scope))
5423 *spacesp = tree_cons (scope, NULL_TREE, *spacesp);
5424 val = binding_for_name (name, scope);
5426 /* Initialize binding for this context. */
5427 BINDING_VALUE (b) = BINDING_VALUE (val);
5428 BINDING_TYPE (b) = BINDING_TYPE (val);
5430 /* Add all _DECLs seen through local using-directives. */
5431 for (level = current_binding_level;
5432 !level->namespace_p;
5433 level = level->level_chain)
5434 if (!lookup_using_namespace (name, b, level->using_directives,
5435 scope, flags, spacesp))
5436 /* Give up because of error. */
5437 return error_mark_node;
5439 /* Add all _DECLs seen through global using-directives. */
5440 /* XXX local and global using lists should work equally. */
5444 if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5445 scope, flags, spacesp))
5446 /* Give up because of error. */
5447 return error_mark_node;
5448 if (siter == scope) break;
5449 siter = CP_DECL_CONTEXT (siter);
5452 val = select_decl (b, flags);
5453 if (scope == global_namespace)
5459 /* Combine prefer_type and namespaces_only into flags. */
5462 lookup_flags (prefer_type, namespaces_only)
5463 int prefer_type, namespaces_only;
5465 if (namespaces_only)
5466 return LOOKUP_PREFER_NAMESPACES;
5467 if (prefer_type > 1)
5468 return LOOKUP_PREFER_TYPES;
5469 if (prefer_type > 0)
5470 return LOOKUP_PREFER_BOTH;
5474 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5475 ignore it or not. Subroutine of lookup_name_real. */
5478 qualify_lookup (val, flags)
5482 if (val == NULL_TREE)
5484 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5486 if ((flags & LOOKUP_PREFER_TYPES)
5487 && (TREE_CODE (val) == TYPE_DECL
5488 || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5489 && DECL_CLASS_TEMPLATE_P (val))))
5491 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5496 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5500 warn_about_implicit_typename_lookup (typename, binding)
5504 tree subtype = TREE_TYPE (TREE_TYPE (typename));
5505 tree name = DECL_NAME (typename);
5507 if (! (TREE_CODE (binding) == TEMPLATE_DECL
5508 && CLASSTYPE_TEMPLATE_INFO (subtype)
5509 && CLASSTYPE_TI_TEMPLATE (subtype) == binding)
5510 && ! (TREE_CODE (binding) == TYPE_DECL
5511 && same_type_p (TREE_TYPE (binding), subtype)))
5513 cp_warning ("lookup of `%D' finds `%#D'",
5515 cp_warning (" instead of `%D' from dependent base class",
5517 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5518 constructor_name (current_class_type), name);
5522 /* Look up NAME in the current binding level and its superiors in the
5523 namespace of variables, functions and typedefs. Return a ..._DECL
5524 node of some kind representing its definition if there is only one
5525 such declaration, or return a TREE_LIST with all the overloaded
5526 definitions if there are many, or return 0 if it is undefined.
5528 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5529 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5530 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5531 Otherwise we prefer non-TYPE_DECLs.
5533 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5534 using IDENTIFIER_CLASS_VALUE. */
5537 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
5539 int prefer_type, nonclass, namespaces_only;
5542 tree val = NULL_TREE;
5544 tree from_obj = NULL_TREE;
5546 int val_is_implicit_typename = 0;
5548 /* Hack: copy flag set by parser, if set. */
5549 if (only_namespace_names)
5550 namespaces_only = 1;
5552 if (prefer_type == -2)
5554 extern int looking_for_typename;
5555 tree type = NULL_TREE;
5558 prefer_type = looking_for_typename;
5560 flags = lookup_flags (prefer_type, namespaces_only);
5561 /* If the next thing is '<', class templates are types. */
5562 if (looking_for_template)
5563 flags |= LOOKUP_TEMPLATES_EXPECTED;
5565 /* std:: becomes :: for now. */
5566 if (got_scope == std_node)
5567 got_scope = void_type_node;
5571 else if (got_object != error_mark_node)
5576 if (type == error_mark_node)
5577 return error_mark_node;
5578 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
5579 type = TREE_TYPE (type);
5582 type = complete_type (type);
5584 if (TREE_CODE (type) == VOID_TYPE)
5585 type = global_namespace;
5586 if (TREE_CODE (type) == NAMESPACE_DECL)
5588 val = make_node (CPLUS_BINDING);
5589 flags |= LOOKUP_COMPLAIN;
5590 if (!qualified_lookup_using_namespace (name, type, val, flags))
5592 val = select_decl (val, flags);
5594 else if (! IS_AGGR_TYPE (type)
5595 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5596 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
5597 || TREE_CODE (type) == TYPENAME_TYPE)
5598 /* Someone else will give an error about this if needed. */
5600 else if (type == current_class_type)
5601 val = IDENTIFIER_CLASS_VALUE (name);
5603 val = lookup_member (type, name, 0, prefer_type);
5610 else if (got_object && val)
5615 flags = lookup_flags (prefer_type, namespaces_only);
5616 /* If we're not parsing, we need to complain. */
5617 flags |= LOOKUP_COMPLAIN;
5620 /* First, look in non-namespace scopes. */
5622 if (current_class_type == NULL_TREE)
5625 for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t))
5629 if (!LOCAL_BINDING_P (t) && nonclass)
5630 /* We're not looking for class-scoped bindings, so keep going. */
5633 /* If this is the kind of thing we're looking for, we're done. */
5634 if (qualify_lookup (BINDING_VALUE (t), flags))
5635 binding = BINDING_VALUE (t);
5636 else if ((flags & LOOKUP_PREFER_TYPES)
5637 && qualify_lookup (BINDING_TYPE (t), flags))
5638 binding = BINDING_TYPE (t);
5640 binding = NULL_TREE;
5643 && (!val || !IMPLICIT_TYPENAME_TYPE_DECL_P (binding)))
5645 if (val_is_implicit_typename && !yylex)
5646 warn_about_implicit_typename_lookup (val, binding);
5648 val_is_implicit_typename
5649 = IMPLICIT_TYPENAME_TYPE_DECL_P (val);
5650 if (!val_is_implicit_typename)
5655 /* Now lookup in namespace scopes. */
5656 if (!val || val_is_implicit_typename)
5658 t = unqualified_namespace_lookup (name, flags, 0);
5661 if (val_is_implicit_typename && !yylex)
5662 warn_about_implicit_typename_lookup (val, t);
5670 /* This should only warn about types used in qualified-ids. */
5671 if (from_obj && from_obj != val)
5673 if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
5674 && TREE_CODE (val) == TYPE_DECL
5675 && TREE_TYPE (from_obj) != TREE_TYPE (val))
5677 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5678 name, got_object, TREE_TYPE (from_obj));
5679 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5683 /* We don't change val to from_obj if got_object depends on
5684 template parms because that breaks implicit typename for
5685 destructor calls. */
5686 if (! uses_template_parms (got_object))
5690 /* If we have a single function from a using decl, pull it out. */
5691 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5692 val = OVL_FUNCTION (val);
5701 lookup_name_nonclass (name)
5704 return lookup_name_real (name, 0, 1, 0);
5708 lookup_function_nonclass (name, args)
5712 return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
5716 lookup_name_namespace_only (name)
5719 /* type-or-namespace, nonclass, namespace_only */
5720 return lookup_name_real (name, 1, 1, 1);
5724 lookup_name (name, prefer_type)
5728 return lookup_name_real (name, prefer_type, 0, 0);
5731 /* Similar to `lookup_name' but look only in the innermost non-class
5735 lookup_name_current_level (name)
5738 struct binding_level *b;
5741 b = current_binding_level;
5742 while (b->parm_flag == 2)
5747 t = IDENTIFIER_NAMESPACE_VALUE (name);
5749 /* extern "C" function() */
5750 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
5753 else if (IDENTIFIER_BINDING (name)
5754 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
5758 if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
5759 return IDENTIFIER_VALUE (name);
5771 /* Like lookup_name_current_level, but for types. */
5774 lookup_type_current_level (name)
5777 register tree t = NULL_TREE;
5779 my_friendly_assert (! current_binding_level->namespace_p, 980716);
5781 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
5782 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
5784 struct binding_level *b = current_binding_level;
5787 if (purpose_member (name, b->type_shadowed))
5788 return REAL_IDENTIFIER_TYPE_VALUE (name);
5800 begin_only_namespace_names ()
5802 only_namespace_names = 1;
5806 end_only_namespace_names ()
5808 only_namespace_names = 0;
5811 /* Arrange for the user to get a source line number, even when the
5812 compiler is going down in flames, so that she at least has a
5813 chance of working around problems in the compiler. We used to
5814 call error(), but that let the segmentation fault continue
5815 through; now, it's much more passive by asking them to send the
5816 maintainers mail about the problem. */
5820 int sig ATTRIBUTE_UNUSED;
5822 signal (SIGSEGV, SIG_DFL);
5824 signal (SIGIOT, SIG_DFL);
5827 signal (SIGILL, SIG_DFL);
5830 signal (SIGABRT, SIG_DFL);
5833 signal (SIGBUS, SIG_DFL);
5835 my_friendly_abort (0);
5838 /* Push the declarations of builtin types into the namespace.
5839 RID_INDEX, if < RID_MAX is the index of the builtin type
5840 in the array RID_POINTERS. NAME is the name used when looking
5841 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5844 record_builtin_type (rid_index, name, type)
5849 tree rname = NULL_TREE, tname = NULL_TREE;
5850 tree tdecl = NULL_TREE;
5852 if ((int) rid_index < (int) RID_MAX)
5853 rname = ridpointers[(int) rid_index];
5855 tname = get_identifier (name);
5857 TYPE_BUILT_IN (type) = 1;
5861 tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
5862 set_identifier_type_value (tname, NULL_TREE);
5863 if ((int) rid_index < (int) RID_MAX)
5864 /* Built-in types live in the global namespace. */
5865 SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
5867 if (rname != NULL_TREE)
5869 if (tname != NULL_TREE)
5871 set_identifier_type_value (rname, NULL_TREE);
5872 SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
5876 tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
5877 set_identifier_type_value (rname, NULL_TREE);
5882 /* Record one of the standard Java types.
5883 * Declare it as having the given NAME.
5884 * If SIZE > 0, it is the size of one of the integral types;
5885 * otherwise it is the negative of the size of one of the other types. */
5888 record_builtin_java_type (name, size)
5894 type = make_signed_type (size);
5895 else if (size > -32)
5896 { /* "__java_char" or ""__java_boolean". */
5897 type = make_unsigned_type (-size);
5898 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5901 { /* "__java_float" or ""__java_double". */
5902 type = make_node (REAL_TYPE);
5903 TYPE_PRECISION (type) = - size;
5906 record_builtin_type (RID_MAX, name, type);
5907 decl = TYPE_NAME (type);
5909 /* Suppress generate debug symbol entries for these types,
5910 since for normal C++ they are just clutter.
5911 However, push_lang_context undoes this if extern "Java" is seen. */
5912 DECL_IGNORED_P (decl) = 1;
5914 TYPE_FOR_JAVA (type) = 1;
5918 /* Push a type into the namespace so that the back-ends ignore it. */
5921 record_unknown_type (type, name)
5925 tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
5926 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5927 DECL_IGNORED_P (decl) = 1;
5928 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
5929 TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
5930 TYPE_ALIGN (type) = 1;
5931 TYPE_MODE (type) = TYPE_MODE (void_type_node);
5934 /* Push overloaded decl, in global scope, with one argument so it
5935 can be used as a callback from define_function. */
5938 push_overloaded_decl_1 (x)
5945 auto_function (name, type)
5948 return define_function
5949 (IDENTIFIER_POINTER (name), type, push_overloaded_decl_1,
5950 IDENTIFIER_POINTER (build_decl_overload (name, TYPE_ARG_TYPES (type),
5954 /* Create the predefined scalar types of C,
5955 and some nodes representing standard constants (0, 1, (void *)0).
5956 Initialize the global binding level.
5957 Make definitions for built-in primitive functions. */
5960 init_decl_processing ()
5963 int wchar_type_size;
5964 tree array_domain_type;
5966 /* Check to see that the user did not specify an invalid combination
5967 of command-line options. */
5968 if (flag_new_abi && !flag_vtable_thunks)
5969 fatal ("the new ABI requires vtable thunks");
5971 /* Have to make these distinct before we try using them. */
5972 lang_name_cplusplus = get_identifier ("C++");
5973 lang_name_c = get_identifier ("C");
5974 lang_name_java = get_identifier ("Java");
5976 /* Let the back-end now how to save and restore language-specific
5977 per-function globals. */
5978 init_lang_status = &push_cp_function_context;
5979 free_lang_status = &pop_cp_function_context;
5980 mark_lang_status = &mark_cp_function_context;
5986 /* Create the global variables. */
5987 push_to_top_level ();
5989 /* Enter the global namespace. */
5990 my_friendly_assert (global_namespace == NULL_TREE, 375);
5991 push_namespace (get_identifier ("::"));
5992 global_namespace = current_namespace;
5993 current_lang_name = NULL_TREE;
5995 /* Adjust various flags based on command-line settings. */
5996 if (flag_strict_prototype == 2)
5997 flag_strict_prototype = pedantic;
5998 if (! flag_permissive && ! pedantic)
5999 flag_pedantic_errors = 1;
6000 if (!flag_no_inline)
6001 flag_inline_trees = 1;
6003 strict_prototypes_lang_c = flag_strict_prototype;
6006 current_lang_name = lang_name_c;
6008 current_function_decl = NULL_TREE;
6009 current_binding_level = NULL_BINDING_LEVEL;
6010 free_binding_level = NULL_BINDING_LEVEL;
6012 /* Because most segmentation signals can be traced back into user
6013 code, catch them and at least give the user a chance of working
6014 around compiler bugs. */
6015 signal (SIGSEGV, signal_catch);
6017 /* We will also catch aborts in the back-end through signal_catch and
6018 give the user a chance to see where the error might be, and to defeat
6019 aborts in the back-end when there have been errors previously in their
6022 signal (SIGIOT, signal_catch);
6025 signal (SIGILL, signal_catch);
6028 signal (SIGABRT, signal_catch);
6031 signal (SIGBUS, signal_catch);
6034 build_common_tree_nodes (flag_signed_char);
6036 error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6037 TREE_TYPE (error_mark_list) = error_mark_node;
6039 /* Make the binding_level structure for global names. */
6041 global_binding_level = current_binding_level;
6042 /* The global level is the namespace level of ::. */
6043 NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6044 declare_namespace_level ();
6046 this_identifier = get_identifier (THIS_NAME);
6047 in_charge_identifier = get_identifier (IN_CHARGE_NAME);
6048 ctor_identifier = get_identifier (CTOR_NAME);
6049 dtor_identifier = get_identifier (DTOR_NAME);
6050 pfn_identifier = get_identifier (VTABLE_PFN_NAME);
6051 index_identifier = get_identifier (VTABLE_INDEX_NAME);
6052 delta_identifier = get_identifier (VTABLE_DELTA_NAME);
6053 delta2_identifier = get_identifier (VTABLE_DELTA2_NAME);
6054 pfn_or_delta2_identifier = get_identifier ("__pfn_or_delta2");
6056 /* Define `int' and `char' first so that dbx will output them first. */
6057 record_builtin_type (RID_INT, NULL_PTR, integer_type_node);
6058 record_builtin_type (RID_CHAR, "char", char_type_node);
6060 /* `signed' is the same as `int' */
6061 record_builtin_type (RID_SIGNED, NULL_PTR, integer_type_node);
6062 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
6063 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
6064 record_builtin_type (RID_MAX, "long unsigned int", long_unsigned_type_node);
6065 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
6066 record_builtin_type (RID_MAX, "long long int", long_long_integer_type_node);
6067 record_builtin_type (RID_MAX, "long long unsigned int",
6068 long_long_unsigned_type_node);
6069 record_builtin_type (RID_MAX, "long long unsigned",
6070 long_long_unsigned_type_node);
6071 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
6072 record_builtin_type (RID_MAX, "short unsigned int", short_unsigned_type_node);
6073 record_builtin_type (RID_MAX, "unsigned short", short_unsigned_type_node);
6076 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE)));
6078 /* Define both `signed char' and `unsigned char'. */
6079 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
6080 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
6082 /* `unsigned long' is the standard type for sizeof.
6083 Note that stddef.h uses `unsigned long',
6084 and this must agree, even if long and int are the same size. */
6086 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE))));
6088 /* Create the widest literal types. */
6089 widest_integer_literal_type_node = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
6090 pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6091 widest_integer_literal_type_node));
6093 widest_unsigned_literal_type_node = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
6094 pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6095 widest_unsigned_literal_type_node));
6097 /* These are types that type_for_size and type_for_mode use. */
6098 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
6099 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
6100 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
6101 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
6102 #if HOST_BITS_PER_WIDE_INT >= 64
6103 pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node));
6105 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
6106 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
6107 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
6108 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
6109 #if HOST_BITS_PER_WIDE_INT >= 64
6110 pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node));
6113 build_common_tree_nodes_2 (flag_short_double);
6115 java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6116 java_short_type_node = record_builtin_java_type ("__java_short", 16);
6117 java_int_type_node = record_builtin_java_type ("__java_int", 32);
6118 java_long_type_node = record_builtin_java_type ("__java_long", 64);
6119 java_float_type_node = record_builtin_java_type ("__java_float", -32);
6120 java_double_type_node = record_builtin_java_type ("__java_double", -64);
6121 java_char_type_node = record_builtin_java_type ("__java_char", -16);
6122 java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6124 integer_two_node = build_int_2 (2, 0);
6125 TREE_TYPE (integer_two_node) = integer_type_node;
6126 integer_three_node = build_int_2 (3, 0);
6127 TREE_TYPE (integer_three_node) = integer_type_node;
6129 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6130 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6131 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6132 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6133 TYPE_PRECISION (boolean_type_node) = 1;
6134 record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6135 boolean_false_node = build_int_2 (0, 0);
6136 TREE_TYPE (boolean_false_node) = boolean_type_node;
6137 boolean_true_node = build_int_2 (1, 0);
6138 TREE_TYPE (boolean_true_node) = boolean_type_node;
6140 signed_size_zero_node = build_int_2 (0, 0); record_builtin_type (RID_FLOAT, NULL_PTR, float_type_node);
6141 record_builtin_type (RID_DOUBLE, NULL_PTR, double_type_node);
6142 record_builtin_type (RID_MAX, "long double", long_double_type_node);
6144 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
6145 complex_integer_type_node));
6146 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
6147 complex_float_type_node));
6148 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
6149 complex_double_type_node));
6150 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
6151 complex_long_double_type_node));
6153 TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6155 record_builtin_type (RID_VOID, NULL_PTR, void_type_node);
6156 void_list_node = build_tree_list (NULL_TREE, void_type_node);
6157 TREE_PARMLIST (void_list_node) = 1;
6159 /* Used for expressions that do nothing, but are not errors. */
6160 void_zero_node = build_int_2 (0, 0);
6161 TREE_TYPE (void_zero_node) = void_type_node;
6163 string_type_node = build_pointer_type (char_type_node);
6164 const_string_type_node
6165 = build_pointer_type (build_qualified_type (char_type_node,
6167 empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);
6169 record_builtin_type (RID_MAX, NULL_PTR, string_type_node);
6172 /* Make a type to be the domain of a few array types
6173 whose domains don't really matter.
6174 200 is small enough that it always fits in size_t
6175 and large enough that it can hold most function names for the
6176 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6177 array_domain_type = build_index_type (build_int_2 (200, 0));
6179 /* Make a type for arrays of characters.
6180 With luck nothing will ever really depend on the length of this
6182 char_array_type_node
6183 = build_array_type (char_type_node, array_domain_type);
6184 /* Likewise for arrays of ints. */
6186 = build_array_type (integer_type_node, array_domain_type);
6188 /* This is just some anonymous class type. Nobody should ever
6189 need to look inside this envelope. */
6190 class_star_type_node = build_pointer_type (make_aggr_type (RECORD_TYPE));
6192 if (flag_huge_objects)
6193 delta_type_node = long_integer_type_node;
6195 delta_type_node = short_integer_type_node;
6197 default_function_type
6198 = build_function_type (integer_type_node, NULL_TREE);
6200 ptr_type_node = build_pointer_type (void_type_node);
6202 = build_pointer_type (build_qualified_type (void_type_node,
6204 c_common_nodes_and_builtins (1, flag_no_builtin, flag_no_nonansi_builtin);
6205 lang_type_promotes_to = convert_type_from_ellipsis;
6208 = build_exception_variant (void_ftype_ptr, empty_except_spec);
6210 /* C++ extensions */
6212 unknown_type_node = make_node (UNKNOWN_TYPE);
6213 record_unknown_type (unknown_type_node, "unknown type");
6215 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6216 TREE_TYPE (unknown_type_node) = unknown_type_node;
6218 TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0);
6220 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6222 TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6223 TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6225 /* This is special for C++ so functions can be overloaded. */
6226 wchar_type_node = get_identifier (flag_short_wchar
6227 ? "short unsigned int"
6229 wchar_type_node = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node));
6230 wchar_type_size = TYPE_PRECISION (wchar_type_node);
6231 signed_wchar_type_node = make_signed_type (wchar_type_size);
6232 unsigned_wchar_type_node = make_unsigned_type (wchar_type_size);
6234 = TREE_UNSIGNED (wchar_type_node)
6235 ? unsigned_wchar_type_node
6236 : signed_wchar_type_node;
6237 record_builtin_type (RID_WCHAR, "__wchar_t", wchar_type_node);
6239 /* Artificial declaration of wchar_t -- can be bashed */
6240 wchar_decl_node = build_decl (TYPE_DECL, get_identifier ("wchar_t"),
6242 pushdecl (wchar_decl_node);
6244 /* This is for wide string constants. */
6245 wchar_array_type_node
6246 = build_array_type (wchar_type_node, array_domain_type);
6248 if (flag_vtable_thunks)
6250 /* Make sure we get a unique function type, so we can give
6251 its pointer type a name. (This wins for gdb.) */
6252 tree vfunc_type = make_node (FUNCTION_TYPE);
6253 TREE_TYPE (vfunc_type) = integer_type_node;
6254 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6255 layout_type (vfunc_type);
6257 vtable_entry_type = build_pointer_type (vfunc_type);
6261 vtable_entry_type = make_aggr_type (RECORD_TYPE);
6262 fields[0] = build_lang_decl (FIELD_DECL, delta_identifier,
6264 fields[1] = build_lang_decl (FIELD_DECL, index_identifier,
6266 fields[2] = build_lang_decl (FIELD_DECL, pfn_identifier,
6268 finish_builtin_type (vtable_entry_type, VTBL_PTR_TYPE, fields, 2,
6271 /* Make this part of an invisible union. */
6272 fields[3] = copy_node (fields[2]);
6273 TREE_TYPE (fields[3]) = delta_type_node;
6274 DECL_NAME (fields[3]) = delta2_identifier;
6275 DECL_MODE (fields[3]) = TYPE_MODE (delta_type_node);
6276 DECL_SIZE (fields[3]) = TYPE_SIZE (delta_type_node);
6277 TREE_UNSIGNED (fields[3]) = 0;
6278 TREE_CHAIN (fields[2]) = fields[3];
6279 vtable_entry_type = build_qualified_type (vtable_entry_type,
6282 record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6285 = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6286 layout_type (vtbl_type_node);
6287 vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6288 record_builtin_type (RID_MAX, NULL_PTR, vtbl_type_node);
6289 vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6290 layout_type (vtbl_ptr_type_node);
6291 record_builtin_type (RID_MAX, NULL_PTR, vtbl_ptr_type_node);
6293 std_node = build_decl (NAMESPACE_DECL,
6294 get_identifier (flag_honor_std ? "fake std":"std"),
6296 pushdecl (std_node);
6298 global_type_node = make_node (LANG_TYPE);
6299 record_unknown_type (global_type_node, "global type");
6302 current_lang_name = lang_name_cplusplus;
6305 tree bad_alloc_type_node, newtype, deltype;
6307 push_namespace (get_identifier ("std"));
6308 bad_alloc_type_node = xref_tag
6309 (class_type_node, get_identifier ("bad_alloc"), 1);
6312 newtype = build_exception_variant
6313 (ptr_ftype_sizetype, add_exception_specifier (NULL_TREE, bad_alloc_type_node, -1));
6314 deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
6315 auto_function (ansi_opname[(int) NEW_EXPR], newtype);
6316 auto_function (ansi_opname[(int) VEC_NEW_EXPR], newtype);
6317 global_delete_fndecl = auto_function (ansi_opname[(int) DELETE_EXPR],
6319 auto_function (ansi_opname[(int) VEC_DELETE_EXPR], deltype);
6323 = define_function ("__pure_virtual", void_ftype, 0, 0);
6325 /* Perform other language dependent initializations. */
6326 init_class_processing ();
6327 init_init_processing ();
6328 init_search_processing ();
6329 init_rtti_processing ();
6331 if (flag_exceptions)
6332 init_exception_processing ();
6335 flag_inline_functions = 0;
6338 if (! supports_one_only ())
6341 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6342 declare_function_name ();
6344 /* Prepare to check format strings against argument lists. */
6345 init_function_format_info ();
6347 /* Show we use EH for cleanups. */
6348 using_eh_for_cleanups ();
6350 print_error_function = lang_print_error_function;
6351 lang_get_alias_set = &c_get_alias_set;
6352 valid_lang_attribute = cp_valid_lang_attribute;
6354 /* Maintain consistency. Perhaps we should just complain if they
6355 say -fwritable-strings? */
6356 if (flag_writable_strings)
6357 flag_const_strings = 0;
6359 /* Add GC roots for all of our global variables. */
6360 ggc_add_tree_root (c_global_trees, sizeof c_global_trees / sizeof(tree));
6361 ggc_add_tree_root (cp_global_trees, sizeof cp_global_trees / sizeof(tree));
6362 ggc_add_tree_root (&integer_three_node, 1);
6363 ggc_add_tree_root (&integer_two_node, 1);
6364 ggc_add_tree_root (&signed_size_zero_node, 1);
6365 ggc_add_tree_root (&size_one_node, 1);
6366 ggc_add_tree_root (&size_zero_node, 1);
6367 ggc_add_root (&global_binding_level, 1, sizeof global_binding_level,
6368 mark_binding_level);
6369 ggc_add_root (&scope_chain, 1, sizeof scope_chain, &mark_saved_scope);
6370 ggc_add_tree_root (&static_ctors, 1);
6371 ggc_add_tree_root (&static_dtors, 1);
6372 ggc_add_tree_root (&lastiddecl, 1);
6374 ggc_add_tree_root (&last_function_parm_tags, 1);
6375 ggc_add_tree_root (¤t_function_return_value, 1);
6376 ggc_add_tree_root (¤t_function_parms, 1);
6377 ggc_add_tree_root (¤t_function_parm_tags, 1);
6378 ggc_add_tree_root (&last_function_parms, 1);
6379 ggc_add_tree_root (&error_mark_list, 1);
6381 ggc_add_tree_root (&global_namespace, 1);
6382 ggc_add_tree_root (&global_type_node, 1);
6383 ggc_add_tree_root (&anonymous_namespace_name, 1);
6385 ggc_add_tree_root (&got_object, 1);
6386 ggc_add_tree_root (&got_scope, 1);
6388 ggc_add_tree_root (¤t_lang_name, 1);
6389 ggc_add_tree_root (&static_aggregates, 1);
6392 /* Function to print any language-specific context for an error message. */
6395 lang_print_error_function (file)
6398 default_print_error_function (file);
6399 maybe_print_template_context ();
6402 /* Make a definition for a builtin function named NAME and whose data type
6403 is TYPE. TYPE should be a function type with argument types.
6405 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6406 the name to be called if we can't opencode the function. */
6409 define_function (name, type, pfn, library_name)
6412 void (*pfn) PARAMS ((tree));
6413 const char *library_name;
6415 tree decl = build_lang_decl (FUNCTION_DECL, get_identifier (name), type);
6416 DECL_EXTERNAL (decl) = 1;
6417 TREE_PUBLIC (decl) = 1;
6418 DECL_ARTIFICIAL (decl) = 1;
6420 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392);
6421 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
6423 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6424 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6425 function in the namespace. */
6426 if (pfn) (*pfn) (decl);
6428 DECL_ASSEMBLER_NAME (decl) = get_identifier (library_name);
6429 make_function_rtl (decl);
6434 /* Wrapper around define_function, for the benefit of
6435 c_common_nodes_and_builtins.
6436 FUNCTION_CODE tells later passes how to compile calls to this function.
6437 See tree.h for its possible values. */
6440 builtin_function (name, type, code, class, libname)
6444 enum built_in_class class;
6445 const char *libname;
6447 tree decl = define_function (name, type, (void (*) PARAMS ((tree)))pushdecl,
6449 DECL_BUILT_IN_CLASS (decl) = class;
6450 DECL_FUNCTION_CODE (decl) = code;
6454 /* When we call finish_struct for an anonymous union, we create
6455 default copy constructors and such. But, an anonymous union
6456 shouldn't have such things; this function undoes the damage to the
6457 anonymous union type T.
6459 (The reason that we create the synthesized methods is that we don't
6460 distinguish `union { int i; }' from `typedef union { int i; } U'.
6461 The first is an anonymous union; the second is just an ordinary
6465 fixup_anonymous_aggr (t)
6470 /* Wipe out memory of synthesized methods */
6471 TYPE_HAS_CONSTRUCTOR (t) = 0;
6472 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6473 TYPE_HAS_INIT_REF (t) = 0;
6474 TYPE_HAS_CONST_INIT_REF (t) = 0;
6475 TYPE_HAS_ASSIGN_REF (t) = 0;
6476 TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6478 /* Splice the implicitly generated functions out of the TYPE_METHODS
6480 q = &TYPE_METHODS (t);
6483 if (DECL_ARTIFICIAL (*q))
6484 *q = TREE_CHAIN (*q);
6486 q = &TREE_CHAIN (*q);
6489 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6490 function members. */
6491 if (TYPE_METHODS (t))
6492 error ("an anonymous union cannot have function members");
6495 /* Make sure that a declaration with no declarator is well-formed, i.e.
6496 just defines a tagged type or anonymous union.
6498 Returns the type defined, if any. */
6501 check_tag_decl (declspecs)
6505 tree ob_modifier = NULL_TREE;
6507 register tree t = NULL_TREE;
6509 for (link = declspecs; link; link = TREE_CHAIN (link))
6511 register tree value = TREE_VALUE (link);
6517 if (IS_AGGR_TYPE (value) || TREE_CODE (value) == ENUMERAL_TYPE)
6519 my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
6523 else if (value == ridpointers[(int) RID_FRIEND])
6525 if (current_class_type == NULL_TREE
6526 || current_scope () != current_class_type)
6527 ob_modifier = value;
6529 else if (value == ridpointers[(int) RID_STATIC]
6530 || value == ridpointers[(int) RID_EXTERN]
6531 || value == ridpointers[(int) RID_AUTO]
6532 || value == ridpointers[(int) RID_REGISTER]
6533 || value == ridpointers[(int) RID_INLINE]
6534 || value == ridpointers[(int) RID_VIRTUAL]
6535 || value == ridpointers[(int) RID_CONST]
6536 || value == ridpointers[(int) RID_VOLATILE]
6537 || value == ridpointers[(int) RID_EXPLICIT])
6538 ob_modifier = value;
6542 error ("multiple types in one declaration");
6544 /* Inside a class, we might be in a friend or access declaration.
6545 Until we have a good way of detecting the latter, don't warn. */
6546 if (t == NULL_TREE && ! current_class_type)
6547 pedwarn ("declaration does not declare anything");
6549 /* Check for an anonymous union. We're careful
6550 accessing TYPE_IDENTIFIER because some built-in types, like
6551 pointer-to-member types, do not have TYPE_NAME. */
6552 else if (t && IS_AGGR_TYPE_CODE (TREE_CODE (t))
6554 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
6556 /* Anonymous unions are objects, so they can have specifiers. */;
6557 SET_ANON_AGGR_TYPE_P (t);
6559 if (TREE_CODE (t) != UNION_TYPE && pedantic && ! in_system_header)
6560 pedwarn ("ISO C++ prohibits anonymous structs");
6563 else if (ob_modifier)
6565 if (ob_modifier == ridpointers[(int) RID_INLINE]
6566 || ob_modifier == ridpointers[(int) RID_VIRTUAL])
6567 cp_error ("`%D' can only be specified for functions", ob_modifier);
6568 else if (ob_modifier == ridpointers[(int) RID_FRIEND])
6569 cp_error ("`%D' can only be specified inside a class", ob_modifier);
6570 else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
6571 cp_error ("`%D' can only be specified for constructors",
6574 cp_error ("`%D' can only be specified for objects and functions",
6581 /* Called when a declaration is seen that contains no names to declare.
6582 If its type is a reference to a structure, union or enum inherited
6583 from a containing scope, shadow that tag name for the current scope
6584 with a forward reference.
6585 If its type defines a new named structure or union
6586 or defines an enum, it is valid but we need not do anything here.
6587 Otherwise, it is an error.
6589 C++: may have to grok the declspecs to learn about static,
6590 complain for anonymous unions. */
6593 shadow_tag (declspecs)
6596 tree t = check_tag_decl (declspecs);
6599 maybe_process_partial_specialization (t);
6601 /* This is where the variables in an anonymous union are
6602 declared. An anonymous union declaration looks like:
6604 because there is no declarator after the union, the parser
6605 sends that declaration here. */
6606 if (t && ANON_AGGR_TYPE_P (t))
6608 fixup_anonymous_aggr (t);
6610 if (TYPE_FIELDS (t))
6612 tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
6614 finish_anon_union (decl);
6619 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6622 groktypename (typename)
6625 if (TREE_CODE (typename) != TREE_LIST)
6627 return grokdeclarator (TREE_VALUE (typename),
6628 TREE_PURPOSE (typename),
6629 TYPENAME, 0, NULL_TREE);
6632 /* Decode a declarator in an ordinary declaration or data definition.
6633 This is called as soon as the type information and variable name
6634 have been parsed, before parsing the initializer if any.
6635 Here we create the ..._DECL node, fill in its type,
6636 and put it on the list of decls for the current context.
6637 The ..._DECL node is returned as the value.
6639 Exception: for arrays where the length is not specified,
6640 the type is left null, to be filled in by `cp_finish_decl'.
6642 Function definitions do not come here; they go to start_function
6643 instead. However, external and forward declarations of functions
6644 do go through here. Structure field declarations are done by
6645 grokfield and not through here. */
6647 /* Set this to zero to debug not using the temporary obstack
6648 to parse initializers. */
6649 int debug_temp_inits = 1;
6652 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
6653 tree declarator, declspecs;
6655 tree attributes, prefix_attributes;
6658 register tree type, tem;
6660 extern int have_extern_spec;
6661 extern int used_extern_spec;
6665 /* See code below that used this. */
6666 int init_written = initialized;
6669 /* This should only be done once on the top most decl. */
6670 if (have_extern_spec && !used_extern_spec)
6672 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"),
6674 used_extern_spec = 1;
6677 if (attributes || prefix_attributes)
6678 attrlist = build_tree_list (attributes, prefix_attributes);
6680 attrlist = NULL_TREE;
6682 decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
6685 if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
6688 type = TREE_TYPE (decl);
6690 if (type == error_mark_node)
6694 = (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
6695 ? DECL_CLASS_CONTEXT (decl)
6696 : DECL_CONTEXT (decl);
6698 if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
6699 && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
6701 /* When parsing the initializer, lookup should use the object's
6703 push_decl_namespace (context);
6706 /* We are only interested in class contexts, later. */
6707 if (context && TREE_CODE (context) == NAMESPACE_DECL)
6708 context = NULL_TREE;
6711 /* Is it valid for this decl to have an initializer at all?
6712 If not, set INITIALIZED to zero, which will indirectly
6713 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6714 switch (TREE_CODE (decl))
6717 /* typedef foo = bar means give foo the same type as bar.
6718 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6719 Any other case of an initialization in a TYPE_DECL is an error. */
6720 if (pedantic || list_length (declspecs) > 1)
6722 cp_error ("typedef `%D' is initialized", decl);
6728 cp_error ("function `%#D' is initialized like a variable", decl);
6738 if (! toplevel_bindings_p ()
6739 && DECL_EXTERNAL (decl))
6740 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6742 DECL_EXTERNAL (decl) = 0;
6743 if (toplevel_bindings_p ())
6744 TREE_STATIC (decl) = 1;
6746 /* Tell `pushdecl' this is an initialized decl
6747 even though we don't yet have the initializer expression.
6748 Also tell `cp_finish_decl' it may store the real initializer. */
6749 DECL_INITIAL (decl) = error_mark_node;
6752 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6753 SET_DEFAULT_DECL_ATTRIBUTES (decl, attributes);
6756 /* Set attributes here so if duplicate decl, will have proper attributes. */
6757 cplus_decl_attributes (decl, attributes, prefix_attributes);
6759 if (context && TYPE_SIZE (complete_type (context)) != NULL_TREE)
6761 push_nested_class (context, 2);
6763 if (TREE_CODE (decl) == VAR_DECL)
6765 tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
6766 if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
6767 cp_error ("`%#D' is not a static member of `%#T'", decl, context);
6770 if (DECL_CONTEXT (field) != context)
6772 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6773 DECL_CONTEXT (field), DECL_NAME (decl),
6774 context, DECL_NAME (decl));
6775 DECL_CONTEXT (decl) = DECL_CONTEXT (field);
6777 /* Static data member are tricky; an in-class initialization
6778 still doesn't provide a definition, so the in-class
6779 declaration will have DECL_EXTERNAL set, but will have an
6780 initialization. Thus, duplicate_decls won't warn
6781 about this situation, and so we check here. */
6782 if (DECL_INITIAL (decl) && DECL_INITIAL (field))
6783 cp_error ("duplicate initialization of %D", decl);
6784 if (duplicate_decls (decl, field))
6790 tree field = check_classfn (context, decl);
6791 if (field && duplicate_decls (decl, field))
6795 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6796 DECL_IN_AGGR_P (decl) = 0;
6797 if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
6798 || CLASSTYPE_USE_TEMPLATE (context))
6800 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
6801 /* [temp.expl.spec] An explicit specialization of a static data
6802 member of a template is a definition if the declaration
6803 includes an initializer; otherwise, it is a declaration.
6805 We check for processing_specialization so this only applies
6806 to the new specialization syntax. */
6807 if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
6808 DECL_EXTERNAL (decl) = 1;
6811 if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
6812 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6816 /* Enter this declaration into the symbol table. */
6817 tem = maybe_push_decl (decl);
6819 if (processing_template_decl)
6820 tem = push_template_decl (tem);
6822 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6823 /* Tell the back-end to use or not use .common as appropriate. If we say
6824 -fconserve-space, we want this to save .data space, at the expense of
6825 wrong semantics. If we say -fno-conserve-space, we want this to
6826 produce errors about redefs; to do this we force variables into the
6828 DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
6831 if (! processing_template_decl)
6841 tree type = TREE_TYPE (decl);
6842 int initialized = (DECL_INITIAL (decl) != NULL_TREE);
6844 if (type == error_mark_node)
6847 /* If this type of object needs a cleanup, but we're not allowed to
6848 add any more objects with cleanups to the current scope, create a
6849 new binding level. */
6850 if (TYPE_NEEDS_DESTRUCTOR (type)
6851 && current_binding_level->more_cleanups_ok == 0)
6853 keep_next_level (2);
6856 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
6860 /* Is it valid for this decl to have an initializer at all?
6861 If not, set INITIALIZED to zero, which will indirectly
6862 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6864 /* Don't allow initializations for incomplete types except for
6865 arrays which might be completed by the initialization. */
6866 if (TYPE_SIZE (complete_type (type)) != NULL_TREE)
6867 ; /* A complete type is ok. */
6868 else if (TREE_CODE (type) != ARRAY_TYPE)
6870 cp_error ("variable `%#D' has initializer but incomplete type",
6873 type = TREE_TYPE (decl) = error_mark_node;
6875 else if (TYPE_SIZE (complete_type (TREE_TYPE (type))) == NULL_TREE)
6877 if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
6878 cp_error ("elements of array `%#D' have incomplete type", decl);
6879 /* else we already gave an error in start_decl. */
6885 && TREE_CODE (decl) != TYPE_DECL
6886 && TREE_CODE (decl) != TEMPLATE_DECL
6887 && type != error_mark_node
6888 && IS_AGGR_TYPE (type)
6889 && ! DECL_EXTERNAL (decl))
6891 if ((! processing_template_decl || ! uses_template_parms (type))
6892 && TYPE_SIZE (complete_type (type)) == NULL_TREE)
6894 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6896 /* Change the type so that assemble_variable will give
6897 DECL an rtl we can live with: (mem (const_int 0)). */
6898 type = TREE_TYPE (decl) = error_mark_node;
6902 /* If any base type in the hierarchy of TYPE needs a constructor,
6903 then we set initialized to 1. This way any nodes which are
6904 created for the purposes of initializing this aggregate
6905 will live as long as it does. This is necessary for global
6906 aggregates which do not have their initializers processed until
6907 the end of the file. */
6908 initialized = TYPE_NEEDS_CONSTRUCTING (type);
6913 DECL_INITIAL (decl) = NULL_TREE;
6916 /* Handle initialization of references.
6917 These three arguments are from `cp_finish_decl', and have the
6918 same meaning here that they do there.
6920 Quotes on semantics can be found in ARM 8.4.3. */
6923 grok_reference_init (decl, type, init)
6924 tree decl, type, init;
6928 if (init == NULL_TREE)
6930 if ((DECL_LANG_SPECIFIC (decl) == 0
6931 || DECL_IN_AGGR_P (decl) == 0)
6932 && ! DECL_THIS_EXTERN (decl))
6933 cp_error ("`%D' declared as reference but not initialized", decl);
6937 if (init == error_mark_node)
6940 if (TREE_CODE (init) == CONSTRUCTOR)
6942 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl);
6946 if (TREE_CODE (init) == TREE_LIST)
6947 init = build_compound_expr (init);
6949 if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
6950 init = convert_from_reference (init);
6952 if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
6953 && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
6955 /* Note: default conversion is only called in very special cases. */
6956 init = default_conversion (init);
6959 /* Convert INIT to the reference type TYPE. This may involve the
6960 creation of a temporary, whose lifetime must be the same as that
6961 of the reference. If so, a DECL_STMT for the temporary will be
6962 added just after the DECL_STMT for DECL. That's why we don't set
6963 DECL_INITIAL for local references (instead assigning to them
6964 explicitly); we need to allow the temporary to be initialized
6966 tmp = convert_to_reference
6967 (type, init, CONV_IMPLICIT,
6968 LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND, decl);
6970 if (tmp == error_mark_node)
6972 else if (tmp != NULL_TREE)
6975 tmp = save_expr (tmp);
6976 if (building_stmt_tree ())
6978 /* Initialize the declaration. */
6979 tmp = build (INIT_EXPR, TREE_TYPE (decl), decl, tmp);
6980 finish_expr_stmt (tmp);
6983 DECL_INITIAL (decl) = tmp;
6987 cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
6991 if (TREE_STATIC (decl) && ! TREE_CONSTANT (DECL_INITIAL (decl)))
6993 expand_static_init (decl, DECL_INITIAL (decl));
6994 DECL_INITIAL (decl) = NULL_TREE;
6999 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7000 mucking with forces it does not comprehend (i.e. initialization with a
7001 constructor). If we are at global scope and won't go into COMMON, fill
7002 it in with a dummy CONSTRUCTOR to force the variable into .data;
7003 otherwise we can use error_mark_node. */
7006 obscure_complex_init (decl, init)
7009 if (! flag_no_inline && TREE_STATIC (decl))
7011 if (extract_init (decl, init))
7015 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7016 if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7017 DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7021 DECL_INITIAL (decl) = error_mark_node;
7026 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7027 array until we finish parsing the initializer. If that's the
7028 situation we're in, update DECL accordingly. */
7031 maybe_deduce_size_from_array_init (decl, init)
7035 tree type = TREE_TYPE (decl);
7037 if (TREE_CODE (type) == ARRAY_TYPE
7038 && TYPE_DOMAIN (type) == NULL_TREE
7039 && TREE_CODE (decl) != TYPE_DECL)
7042 = (TREE_STATIC (decl)
7043 /* Even if pedantic, an external linkage array
7044 may have incomplete type at first. */
7045 ? pedantic && ! DECL_EXTERNAL (decl)
7046 : !DECL_EXTERNAL (decl));
7047 tree initializer = init ? init : DECL_INITIAL (decl);
7048 int failure = complete_array_type (type, initializer, do_default);
7051 cp_error ("initializer fails to determine size of `%D'", decl);
7056 cp_error ("array size missing in `%D'", decl);
7057 /* If a `static' var's size isn't known, make it extern as
7058 well as static, so it does not get allocated. If it's not
7059 `static', then don't mark it extern; finish_incomplete_decl
7060 will give it a default size and it will get allocated. */
7061 else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7062 DECL_EXTERNAL (decl) = 1;
7065 if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7066 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7068 cp_error ("zero-size array `%D'", decl);
7070 layout_decl (decl, 0);
7074 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7075 any appropriate error messages regarding the layout. */
7078 layout_var_decl (decl)
7081 tree type = TREE_TYPE (decl);
7083 tree ttype = target_type (type);
7086 /* If we haven't already layed out this declaration, do so now.
7087 Note that we must not call complete type for an external object
7088 because it's type might involve templates that we are not
7089 supposed to isntantiate yet. (And it's perfectly legal to say
7090 `extern X x' for some incomplete type `X'.) */
7091 if (!DECL_EXTERNAL (decl))
7092 complete_type (type);
7093 if (!DECL_SIZE (decl)&& TYPE_SIZE (type))
7094 layout_decl (decl, 0);
7096 if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7098 /* An automatic variable with an incomplete type: that is an error.
7099 Don't talk about array types here, since we took care of that
7100 message in grokdeclarator. */
7101 cp_error ("storage size of `%D' isn't known", decl);
7102 TREE_TYPE (decl) = error_mark_node;
7105 /* Keep this code around in case we later want to control debug info
7106 based on whether a type is "used". (jason 1999-11-11) */
7108 else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7109 /* Let debugger know it should output info for this type. */
7110 note_debug_info_needed (ttype);
7112 if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7113 note_debug_info_needed (DECL_CONTEXT (decl));
7116 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7117 && DECL_SIZE (decl) != NULL_TREE
7118 && ! TREE_CONSTANT (DECL_SIZE (decl)))
7120 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7121 constant_expression_warning (DECL_SIZE (decl));
7123 cp_error ("storage size of `%D' isn't constant", decl);
7127 /* If a local static variable is declared in an inline function, or if
7128 we have a weak definition, we must endeavor to create only one
7129 instance of the variable at link-time. */
7132 maybe_commonize_var (decl)
7135 /* Static data in a function with comdat linkage also has comdat
7137 if (TREE_STATIC (decl)
7138 /* Don't mess with __FUNCTION__. */
7139 && ! TREE_ASM_WRITTEN (decl)
7140 && current_function_decl
7141 && DECL_CONTEXT (decl) == current_function_decl
7142 && (DECL_THIS_INLINE (current_function_decl)
7143 || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7144 && TREE_PUBLIC (current_function_decl))
7146 /* Rather than try to get this right with inlining, we suppress
7147 inlining of such functions. */
7148 current_function_cannot_inline
7149 = "function with static variable cannot be inline";
7151 /* If flag_weak, we don't need to mess with this, as we can just
7152 make the function weak, and let it refer to its unique local
7153 copy. This works because we don't allow the function to be
7157 if (DECL_INTERFACE_KNOWN (current_function_decl))
7159 TREE_PUBLIC (decl) = 1;
7160 DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7162 else if (DECL_INITIAL (decl) == NULL_TREE
7163 || DECL_INITIAL (decl) == error_mark_node)
7165 TREE_PUBLIC (decl) = 1;
7166 DECL_COMMON (decl) = 1;
7168 /* else we lose. We can only do this if we can use common,
7169 which we can't if it has been initialized. */
7171 if (TREE_PUBLIC (decl))
7172 DECL_ASSEMBLER_NAME (decl)
7173 = build_static_name (current_function_decl, DECL_NAME (decl));
7174 else if (! DECL_ARTIFICIAL (decl))
7176 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7177 cp_warning_at (" you can work around this by removing the initializer", decl);
7181 else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
7182 /* Set it up again; we might have set DECL_INITIAL since the last
7184 comdat_linkage (decl);
7187 /* Issue an error message if DECL is an uninitialized const variable. */
7190 check_for_uninitialized_const_var (decl)
7193 tree type = TREE_TYPE (decl);
7195 /* ``Unless explicitly declared extern, a const object does not have
7196 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7198 if (TREE_CODE (decl) == VAR_DECL
7199 && TREE_CODE (type) != REFERENCE_TYPE
7200 && CP_TYPE_CONST_P (type)
7201 && !TYPE_NEEDS_CONSTRUCTING (type)
7202 && !DECL_INITIAL (decl))
7203 cp_error ("uninitialized const `%D'", decl);
7206 /* Verify INIT (the initializer for DECL), and record the
7207 initialization in DECL_INITIAL, if appropriate. Returns a new
7211 check_initializer (decl, init)
7217 if (TREE_CODE (decl) == FIELD_DECL)
7220 type = TREE_TYPE (decl);
7222 /* If `start_decl' didn't like having an initialization, ignore it now. */
7223 if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7226 /* Check the initializer. */
7229 /* Things that are going to be initialized need to have complete
7231 TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));
7233 if (type == error_mark_node)
7234 /* We will have already complained. */
7236 else if (TYPE_SIZE (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
7238 cp_error ("variable-sized object `%D' may not be initialized", decl);
7241 else if (TREE_CODE (type) == ARRAY_TYPE
7242 && !TYPE_SIZE (TREE_TYPE (type)))
7244 cp_error ("elements of array `%#D' have incomplete type", decl);
7247 else if (!TYPE_SIZE (type))
7249 cp_error ("`%D' has incomplete type", decl);
7250 TREE_TYPE (decl) = error_mark_node;
7255 if (TREE_CODE (decl) == CONST_DECL)
7257 my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7259 DECL_INITIAL (decl) = init;
7261 /* This will keep us from needing to worry about our obstacks. */
7262 my_friendly_assert (init != NULL_TREE, 149);
7265 else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
7267 if (TREE_STATIC (decl))
7268 make_decl_rtl (decl, NULL_PTR, toplevel_bindings_p ());
7269 grok_reference_init (decl, type, init);
7274 if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7276 if (TREE_CODE (type) == ARRAY_TYPE)
7277 init = digest_init (type, init, (tree *) 0);
7278 else if (TREE_CODE (init) == CONSTRUCTOR
7279 && TREE_HAS_CONSTRUCTOR (init))
7281 if (TYPE_NON_AGGREGATE_CLASS (type))
7283 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7285 init = error_mark_node;
7288 goto dont_use_constructor;
7293 dont_use_constructor:
7294 if (TREE_CODE (init) != TREE_VEC)
7295 init = store_init_value (decl, init);
7299 /* We must hide the initializer so that expand_decl
7300 won't try to do something it does not understand. */
7301 init = obscure_complex_init (decl, init);
7303 else if (DECL_EXTERNAL (decl))
7305 else if (TREE_CODE_CLASS (TREE_CODE (type)) == 't'
7306 && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7308 tree core_type = strip_array_types (type);
7310 if (! TYPE_NEEDS_CONSTRUCTING (core_type))
7312 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
7313 cp_error ("structure `%D' with uninitialized const members", decl);
7314 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
7315 cp_error ("structure `%D' with uninitialized reference members",
7319 check_for_uninitialized_const_var (decl);
7321 if (TYPE_SIZE (type) != NULL_TREE
7322 && TYPE_NEEDS_CONSTRUCTING (type))
7323 init = obscure_complex_init (decl, NULL_TREE);
7327 check_for_uninitialized_const_var (decl);
7332 /* If DECL is not a local variable, give it RTL. */
7335 make_rtl_for_nonlocal_decl (decl, init, asmspec)
7338 const char *asmspec;
7343 type = TREE_TYPE (decl);
7344 toplev = toplevel_bindings_p ();
7346 /* Handle non-variables up front. */
7347 if (TREE_CODE (decl) != VAR_DECL)
7349 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7353 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7355 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7357 if (DECL_VIRTUAL_P (decl))
7358 make_decl_rtl (decl, NULL_PTR, toplev);
7359 else if (TREE_READONLY (decl)
7360 && DECL_INITIAL (decl) != NULL_TREE
7361 && DECL_INITIAL (decl) != error_mark_node
7362 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
7364 DECL_INITIAL (decl) = save_expr (DECL_INITIAL (decl));
7366 if (toplev && ! TREE_PUBLIC (decl))
7368 /* If this is a static const, change its apparent linkage
7369 if it belongs to a #pragma interface. */
7370 if (!interface_unknown)
7372 TREE_PUBLIC (decl) = 1;
7373 DECL_EXTERNAL (decl) = interface_only;
7375 make_decl_rtl (decl, asmspec, toplev);
7378 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7380 else if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl))
7382 my_friendly_assert (TREE_STATIC (decl), 19990828);
7384 if (init == NULL_TREE
7385 #ifdef DEFAULT_STATIC_DEFS
7386 /* If this code is dead, then users must
7387 explicitly declare static member variables
7388 outside the class def'n as well. */
7389 && TYPE_NEEDS_CONSTRUCTING (type)
7393 DECL_EXTERNAL (decl) = 1;
7394 make_decl_rtl (decl, asmspec, 1);
7397 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7399 else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == NAMESPACE_DECL
7400 || (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl)))
7401 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7404 /* Create RTL for the local static variable DECL. */
7407 make_rtl_for_local_static (decl)
7410 const char *asmspec = NULL;
7412 /* If we inlined this variable, we could see it's declaration
7414 if (DECL_RTL (decl))
7417 if (DECL_ASSEMBLER_NAME (decl) != DECL_NAME (decl))
7419 /* The only way this situaton can occur is if the
7420 user specified a name for this DECL using the
7421 `attribute' syntax. */
7422 asmspec = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
7423 DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
7426 rest_of_decl_compilation (decl, asmspec, /*top_level=*/0, /*at_end=*/0);
7429 /* The old ARM scoping rules injected variables declared in the
7430 initialization statement of a for-statement into the surrounding
7431 scope. We support this usage, in order to be backward-compatible.
7432 DECL is a just-declared VAR_DECL; if necessary inject its
7433 declaration into the surrounding scope. */
7436 maybe_inject_for_scope_var (decl)
7439 if (current_binding_level->is_for_scope)
7441 struct binding_level *outer
7442 = current_binding_level->level_chain;
7444 /* Check to see if the same name is already bound at the outer
7445 level, either because it was directly declared, or because a
7446 dead for-decl got preserved. In either case, the code would
7447 not have been valid under the ARM scope rules, so clear
7448 is_for_scope for the current_binding_level.
7450 Otherwise, we need to preserve the temp slot for decl to last
7451 into the outer binding level. */
7454 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
7456 if (outer_binding && BINDING_LEVEL (outer_binding) == outer
7457 && (TREE_CODE (BINDING_VALUE (outer_binding))
7459 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
7461 BINDING_VALUE (outer_binding)
7462 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
7463 current_binding_level->is_for_scope = 0;
7465 else if (DECL_IN_MEMORY_P (decl))
7466 preserve_temp_slots (DECL_RTL (decl));
7470 /* Generate code to initialize DECL (a local variable). */
7473 initialize_local_var (decl, init, flags)
7478 tree type = TREE_TYPE (decl);
7480 /* If the type is bogus, don't bother initializing the variable. */
7481 if (type == error_mark_node)
7484 if (DECL_SIZE (decl) == NULL_TREE && !TREE_STATIC (decl))
7486 /* If we used it already as memory, it must stay in memory. */
7487 DECL_INITIAL (decl) = NULL_TREE;
7488 TREE_ADDRESSABLE (decl) = TREE_USED (decl);
7491 /* Local statics are handled differently from ordinary automatic
7493 if (TREE_STATIC (decl))
7495 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
7496 || TYPE_NEEDS_DESTRUCTOR (type))
7497 expand_static_init (decl, init);
7501 if (DECL_SIZE (decl) && type != error_mark_node)
7505 /* Compute and store the initial value. */
7506 already_used = TREE_USED (decl) || TREE_USED (type);
7508 if (init || TYPE_NEEDS_CONSTRUCTING (type))
7510 int saved_stmts_are_full_exprs_p;
7512 emit_line_note (DECL_SOURCE_FILE (decl),
7513 DECL_SOURCE_LINE (decl));
7514 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p;
7515 stmts_are_full_exprs_p = 1;
7516 finish_expr_stmt (build_aggr_init (decl, init, flags));
7517 stmts_are_full_exprs_p = saved_stmts_are_full_exprs_p;
7520 /* Set this to 0 so we can tell whether an aggregate which was
7521 initialized was ever used. Don't do this if it has a
7522 destructor, so we don't complain about the 'resource
7523 allocation is initialization' idiom. Now set
7524 attribute((unused)) on types so decls of that type will be
7525 marked used. (see TREE_USED, above.) */
7526 if (TYPE_NEEDS_CONSTRUCTING (type)
7528 && !TYPE_NEEDS_DESTRUCTOR (type)
7529 && DECL_NAME (decl))
7530 TREE_USED (decl) = 0;
7531 else if (already_used)
7532 TREE_USED (decl) = 1;
7536 /* Generate code to destroy DECL (a local variable). */
7539 destroy_local_var (decl)
7542 tree type = TREE_TYPE (decl);
7545 /* Only variables get cleaned up. */
7546 if (TREE_CODE (decl) != VAR_DECL)
7549 /* And only things with destructors need cleaning up. */
7550 if (!TYPE_NEEDS_DESTRUCTOR (type))
7553 if (TREE_CODE (decl) == VAR_DECL &&
7554 (DECL_EXTERNAL (decl) || TREE_STATIC (decl)))
7555 /* We don't clean up things that aren't defined in this
7556 translation unit, or that need a static cleanup. The latter
7557 are handled by finish_file. */
7560 /* Compute the cleanup. */
7561 cleanup = maybe_build_cleanup (decl);
7563 /* Record the cleanup required for this declaration. */
7564 if (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node
7566 finish_decl_cleanup (decl, cleanup);
7569 /* Let the back-end know about DECL. */
7572 emit_local_var (decl)
7575 /* Create RTL for this variable. */
7576 if (DECL_RTL (decl))
7577 /* Only a RESULT_DECL should have non-NULL RTL when arriving here.
7578 All other local variables are assigned RTL in this function. */
7579 my_friendly_assert (TREE_CODE (decl) == RESULT_DECL,
7583 if (DECL_ASSEMBLER_NAME (decl) != DECL_NAME (decl))
7584 /* The user must have specified an assembler name for this
7585 variable. Set that up now. */
7586 rest_of_decl_compilation
7587 (decl, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)),
7588 /*top_level=*/0, /*at_end=*/0);
7593 /* Actually do the initialization. */
7594 expand_start_target_temps ();
7595 expand_decl_init (decl);
7596 expand_end_target_temps ();
7599 /* Finish processing of a declaration;
7600 install its line number and initial value.
7601 If the length of an array type is not known before,
7602 it must be determined now, from the initial value, or it is an error.
7604 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7605 for aggregates that have constructors alive on the permanent obstack,
7606 so that the global initializing functions can be written at the end.
7608 INIT0 holds the value of an initializer that should be allowed to escape
7611 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7612 if the (init) syntax was used.
7614 For functions that take default parameters, DECL points to its
7615 "maximal" instantiation. `cp_finish_decl' must then also declared its
7616 subsequently lower and lower forms of instantiation, checking for
7617 ambiguity as it goes. This can be sped up later. */
7620 cp_finish_decl (decl, init, asmspec_tree, flags)
7626 tree ttype = NULL_TREE;
7627 const char *asmspec = NULL;
7628 int was_readonly = 0;
7630 /* If this is 0, then we did not change obstacks. */
7634 error ("assignment (not initialization) in declaration");
7638 /* Handling __FUNCTION__ and its ilk in a template-function requires
7639 some special processing because we are called from
7640 language-independent code. */
7641 if (cfun && processing_template_decl
7642 && current_function_name_declared == 2)
7644 /* Since we're in a template function, we need to
7645 push_template_decl. The language-independent code in
7646 declare_hidden_char_array doesn't know to do this. */
7647 retrofit_lang_decl (decl);
7648 decl = push_template_decl (decl);
7650 if (strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
7651 "__PRETTY_FUNCTION__") == 0)
7653 init = build (FUNCTION_NAME, const_string_type_node);
7654 DECL_PRETTY_FUNCTION_P (decl) = 1;
7658 /* If a name was specified, get the string. */
7660 asmspec = TREE_STRING_POINTER (asmspec_tree);
7662 if (init && TREE_CODE (init) == NAMESPACE_DECL)
7664 cp_error ("Cannot initialize `%D' to namespace `%D'",
7669 if (current_class_type
7670 && DECL_REAL_CONTEXT (decl) == current_class_type
7671 && TYPE_BEING_DEFINED (current_class_type)
7672 && (DECL_INITIAL (decl) || init))
7673 DECL_DEFINED_IN_CLASS_P (decl) = 1;
7675 if (TREE_CODE (decl) == VAR_DECL
7676 && DECL_CONTEXT (decl)
7677 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
7678 && DECL_CONTEXT (decl) != current_namespace
7681 /* Leave the namespace of the object. */
7682 pop_decl_namespace ();
7685 type = TREE_TYPE (decl);
7687 if (type == error_mark_node)
7690 /* Add this declaration to the statement-tree. */
7691 if (building_stmt_tree () && at_function_scope_p ())
7692 add_decl_stmt (decl);
7694 if (TYPE_HAS_MUTABLE_P (type))
7695 TREE_READONLY (decl) = 0;
7697 if (processing_template_decl)
7699 if (init && DECL_INITIAL (decl))
7700 DECL_INITIAL (decl) = init;
7704 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7705 my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828);
7707 /* Take care of TYPE_DECLs up front. */
7708 if (TREE_CODE (decl) == TYPE_DECL)
7710 if (init && DECL_INITIAL (decl))
7712 /* typedef foo = bar; store the type of bar as the type of foo. */
7713 TREE_TYPE (decl) = type = TREE_TYPE (init);
7714 DECL_INITIAL (decl) = init = NULL_TREE;
7716 if (type != error_mark_node
7717 && IS_AGGR_TYPE (type) && DECL_NAME (decl))
7719 if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
7720 cp_warning ("shadowing previous type declaration of `%#D'", decl);
7721 set_identifier_type_value (DECL_NAME (decl), type);
7722 CLASSTYPE_GOT_SEMICOLON (type) = 1;
7724 GNU_xref_decl (current_function_decl, decl);
7726 /* If we have installed this as the canonical typedef for this
7727 type, and that type has not been defined yet, delay emitting
7728 the debug information for it, as we will emit it later. */
7729 if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
7730 && TYPE_SIZE (TREE_TYPE (decl)) == NULL_TREE)
7731 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
7733 rest_of_decl_compilation (decl, NULL_PTR,
7734 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
7738 if (TREE_CODE (decl) != FUNCTION_DECL)
7739 ttype = target_type (type);
7741 if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
7742 && TYPE_NEEDS_CONSTRUCTING (type))
7744 /* Currently, GNU C++ puts constants in text space, making them
7745 impossible to initialize. In the future, one would hope for
7746 an operating system which understood the difference between
7747 initialization and the running of a program. */
7749 TREE_READONLY (decl) = 0;
7752 if (TREE_CODE (decl) == FIELD_DECL && asmspec)
7754 /* This must override the asm specifier which was placed by
7755 grokclassfn. Lay this out fresh. */
7756 DECL_RTL (TREE_TYPE (decl)) = NULL_RTX;
7757 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7758 make_decl_rtl (decl, asmspec, 0);
7761 /* Deduce size of array from initialization, if not already known. */
7762 maybe_deduce_size_from_array_init (decl, init);
7763 init = check_initializer (decl, init);
7765 GNU_xref_decl (current_function_decl, decl);
7767 if (TREE_CODE (decl) == VAR_DECL)
7768 layout_var_decl (decl);
7770 /* Output the assembler code and/or RTL code for variables and functions,
7771 unless the type is an undefined structure or union.
7772 If not, it will get done when the type is completed. */
7773 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
7774 || TREE_CODE (decl) == RESULT_DECL)
7776 if (TREE_CODE (decl) == VAR_DECL)
7777 maybe_commonize_var (decl);
7779 make_rtl_for_nonlocal_decl (decl, init, asmspec);
7781 if (TREE_CODE (type) == FUNCTION_TYPE
7782 || TREE_CODE (type) == METHOD_TYPE)
7783 abstract_virtuals_error (decl,
7784 strip_array_types (TREE_TYPE (type)));
7786 abstract_virtuals_error (decl, strip_array_types (type));
7788 if (TREE_CODE (decl) == FUNCTION_DECL)
7790 else if (DECL_EXTERNAL (decl)
7791 && ! (DECL_LANG_SPECIFIC (decl)
7792 && DECL_NOT_REALLY_EXTERN (decl)))
7795 DECL_INITIAL (decl) = init;
7797 else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
7799 /* This is a local declaration. */
7800 if (doing_semantic_analysis_p ())
7801 maybe_inject_for_scope_var (decl);
7802 /* Initialize the local variable. But, if we're building a
7803 statement-tree, we'll do the initialization when we
7805 if (processing_template_decl)
7807 if (init || DECL_INITIAL (decl) == error_mark_node)
7808 DECL_INITIAL (decl) = init;
7812 /* If we're not building RTL, then we need to do so
7814 if (!building_stmt_tree ())
7815 emit_local_var (decl);
7816 /* Initialize the variable. */
7817 initialize_local_var (decl, init, flags);
7818 /* Clean up the variable. */
7819 destroy_local_var (decl);
7822 else if (TREE_STATIC (decl) && type != error_mark_node)
7824 /* Cleanups for static variables are handled by `finish_file'. */
7825 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
7826 || TYPE_NEEDS_DESTRUCTOR (type))
7827 expand_static_init (decl, init);
7831 /* Undo call to `pushclass' that was done in `start_decl'
7832 due to initialization of qualified member variable.
7833 I.e., Foo::x = 10; */
7835 tree context = DECL_REAL_CONTEXT (decl);
7837 && TREE_CODE_CLASS (TREE_CODE (context)) == 't'
7838 && (TREE_CODE (decl) == VAR_DECL
7839 /* We also have a pushclass done that we need to undo here
7840 if we're at top level and declare a method. */
7841 || TREE_CODE (decl) == FUNCTION_DECL)
7842 /* If size hasn't been set, we're still defining it,
7843 and therefore inside the class body; don't pop
7844 the binding level.. */
7845 && TYPE_SIZE (context) != NULL_TREE
7846 && context == current_class_type)
7847 pop_nested_class ();
7853 /* If requested, warn about definitions of large data objects. */
7855 if (warn_larger_than
7856 && ! processing_template_decl
7857 && (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
7858 && !DECL_EXTERNAL (decl))
7860 register tree decl_size = DECL_SIZE (decl);
7862 if (decl_size && TREE_CODE (decl_size) == INTEGER_CST)
7864 unsigned units = TREE_INT_CST_LOW (decl_size) / BITS_PER_UNIT;
7866 if (units > larger_than_size)
7867 warning_with_decl (decl, "size of `%s' is %u bytes", units);
7872 TREE_READONLY (decl) = 1;
7875 /* This is here for a midend callback from c-common.c */
7878 finish_decl (decl, init, asmspec_tree)
7882 cp_finish_decl (decl, init, asmspec_tree, 0);
7885 /* Returns a declaration for a VAR_DECL as if:
7887 extern "C" TYPE NAME;
7889 had been seen. Used to create compiler-generated global
7893 declare_global_var (name, type)
7899 push_to_top_level ();
7900 decl = build_decl (VAR_DECL, name, type);
7901 TREE_PUBLIC (decl) = 1;
7902 DECL_EXTERNAL (decl) = 1;
7903 DECL_ARTIFICIAL (decl) = 1;
7905 cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
7906 pop_from_top_level ();
7911 /* Returns a pointer to the `atexit' function. Note that if
7912 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
7913 `__cxa_atexit' function specified in the IA64 C++ ABI. */
7927 if (flag_use_cxa_atexit)
7929 /* The declaration for `__cxa_atexit' is:
7931 int __cxa_atexit (void (*)(void *), void *, void *)
7933 We build up the argument types and then then function type
7936 /* First, build the pointer-to-function type for the first
7938 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7939 fn_type = build_function_type (void_type_node, arg_types);
7940 fn_ptr_type = build_pointer_type (fn_type);
7941 /* Then, build the rest of the argument types. */
7942 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7943 arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
7944 arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types);
7945 /* And the final __cxa_atexit type. */
7946 fn_type = build_function_type (integer_type_node, arg_types);
7947 fn_ptr_type = build_pointer_type (fn_type);
7948 name = "__cxa_atexit";
7952 /* The declaration for `atexit' is:
7954 int atexit (void (*)());
7956 We build up the argument types and then then function type
7958 fn_type = build_function_type (void_type_node, void_list_node);
7959 fn_ptr_type = build_pointer_type (fn_type);
7960 arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node);
7961 /* Build the final atexit type. */
7962 fn_type = build_function_type (integer_type_node, arg_types);
7966 /* Now, build the function declaration. */
7967 push_lang_context (lang_name_c);
7968 atexit_fndecl = define_function (name, fn_type, /*pfn=*/0, NULL_PTR);
7969 mark_used (atexit_fndecl);
7970 pop_lang_context ();
7971 atexit_node = default_conversion (atexit_fndecl);
7976 /* Returns the __dso_handle VAR_DECL. */
7979 get_dso_handle_node ()
7981 if (dso_handle_node)
7982 return dso_handle_node;
7984 /* Declare the variable. */
7985 dso_handle_node = declare_global_var (get_identifier ("__dso_handle"),
7988 return dso_handle_node;
7991 /* Begin a new function with internal linkage whose job will be simply
7992 to destroy some particular variable. */
7997 static int counter = 0;
7998 int old_interface_unknown = interface_unknown;
8004 push_to_top_level ();
8006 /* No need to mangle this. */
8007 push_lang_context (lang_name_c);
8009 interface_unknown = 1;
8011 /* Build the parameter-types. */
8012 parmtypes = void_list_node;
8013 /* Functions passed to __cxa_atexit take an additional parameter.
8014 We'll just ignore it. After we implement the new calling
8015 convention for destructors, we can eliminate the use of
8016 additional cleanup functions entirely in the -fnew-abi case. */
8017 if (flag_use_cxa_atexit)
8018 parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes);
8019 /* Build the function type itself. */
8020 fntype = build_function_type (void_type_node, parmtypes);
8021 /* Build the name of the function. */
8022 sprintf (name, "__tcf_%d", counter++);
8023 /* Build the function declaration. */
8024 fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype);
8025 /* It's a function with internal linkage, generated by the
8027 TREE_PUBLIC (fndecl) = 0;
8028 DECL_ARTIFICIAL (fndecl) = 1;
8029 /* Build the parameter. */
8030 if (flag_use_cxa_atexit)
8034 parmdecl = build_decl (PARM_DECL, NULL_TREE, ptr_type_node);
8035 DECL_CONTEXT (parmdecl) = fndecl;
8036 DECL_ARG_TYPE (parmdecl) = ptr_type_node;
8037 TREE_USED (parmdecl) = 1;
8038 DECL_ARGUMENTS (fndecl) = parmdecl;
8042 start_function (/*specs=*/NULL_TREE, fndecl, NULL_TREE, SF_PRE_PARSED);
8045 interface_unknown = old_interface_unknown;
8047 pop_lang_context ();
8049 return current_function_decl;
8052 /* Finish the cleanup function begun by start_cleanup_fn. */
8059 expand_body (finish_function (lineno, 0));
8061 pop_from_top_level ();
8064 /* Generate code to handle the destruction of DECL, an object with
8065 static storage duration. */
8068 register_dtor_fn (decl)
8076 int saved_flag_access_control;
8078 if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl)))
8081 /* Call build_cleanup before we enter the anonymous function so that
8082 any access checks will be done relative to the current scope,
8083 rather than the scope of the anonymous function. */
8084 build_cleanup (decl);
8086 /* Now start the function. */
8087 cleanup = start_cleanup_fn ();
8089 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8090 to the original function, rather than the anonymous one. That
8091 will make the back-end think that nested functions are in use,
8092 which causes confusion. */
8093 saved_flag_access_control = flag_access_control;
8094 flag_access_control = 0;
8095 fcall = build_cleanup (decl);
8096 flag_access_control = saved_flag_access_control;
8098 /* Create the body of the anonymous function. */
8099 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
8100 finish_expr_stmt (fcall);
8101 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
8104 /* Call atexit with the cleanup function. */
8105 mark_addressable (cleanup);
8106 cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
8107 if (flag_use_cxa_atexit)
8109 args = tree_cons (NULL_TREE, get_dso_handle_node (), NULL_TREE);
8110 args = tree_cons (NULL_TREE, null_pointer_node, args);
8111 args = tree_cons (NULL_TREE, cleanup, args);
8114 args = tree_cons (NULL_TREE, cleanup, NULL_TREE);
8115 finish_expr_stmt (build_function_call (get_atexit_node (), args));
8119 expand_static_init (decl, init)
8123 tree oldstatic = value_member (decl, static_aggregates);
8127 if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
8128 cp_error ("multiple initializations given for `%D'", decl);
8130 else if (! toplevel_bindings_p ())
8132 /* Emit code to perform this initialization but once. */
8139 /* Emit code to perform this initialization but once. This code
8142 static int temp = 0;
8144 // Do initialization.
8146 // Register variable for destruction at end of program.
8149 Note that the `temp' variable is only set to 1 *after* the
8150 initialization is complete. This ensures that an exception,
8151 thrown during the construction, will cause the variable to
8152 reinitialized when we pass through this code again, as per:
8156 If the initialization exits by throwing an exception, the
8157 initialization is not complete, so it will be tried again
8158 the next time control enters the declaration.
8160 In theory, this process should be thread-safe, too; multiple
8161 threads should not be able to initialize the variable more
8162 than once. We don't yet attempt to ensure thread-safety. */
8163 temp = get_temp_name (integer_type_node, 1);
8164 rest_of_decl_compilation (temp, NULL_PTR, 0, 0);
8166 /* Begin the conditional initialization. */
8167 if_stmt = begin_if_stmt ();
8168 finish_if_stmt_cond (build_binary_op (EQ_EXPR, temp,
8171 then_clause = begin_compound_stmt (/*has_no_scope=*/0);
8173 /* Do the initialization itself. */
8174 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8175 || (init && TREE_CODE (init) == TREE_LIST))
8176 assignment = build_aggr_init (decl, init, 0);
8178 /* The initialization we're doing here is just a bitwise
8180 assignment = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
8182 assignment = NULL_TREE;
8184 /* Once the assignment is complete, set TEMP to 1. Since the
8185 construction of the static object is complete at this point,
8186 we want to make sure TEMP is set to 1 even if a temporary
8187 constructed during the initialization throws an exception
8188 when it is destroyed. So, we combine the initialization and
8189 the assignment to TEMP into a single expression, ensuring
8190 that when we call finish_expr_stmt the cleanups will not be
8191 run until after TEMP is set to 1. */
8192 temp_init = build_modify_expr (temp, NOP_EXPR, integer_one_node);
8195 assignment = tree_cons (NULL_TREE, assignment,
8196 build_tree_list (NULL_TREE,
8198 assignment = build_compound_expr (assignment);
8201 assignment = temp_init;
8202 finish_expr_stmt (assignment);
8204 /* Use atexit to register a function for destroying this static
8206 register_dtor_fn (decl);
8208 finish_compound_stmt (/*has_no_scope=*/0, then_clause);
8209 finish_then_clause (if_stmt);
8213 static_aggregates = tree_cons (init, decl, static_aggregates);
8216 /* Finish the declaration of a catch-parameter. */
8219 start_handler_parms (declspecs, declarator)
8226 decl = grokdeclarator (declarator, declspecs, CATCHPARM,
8228 if (decl == NULL_TREE)
8229 error ("invalid catch parameter");
8238 /* Make TYPE a complete type based on INITIAL_VALUE.
8239 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8240 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8243 complete_array_type (type, initial_value, do_default)
8244 tree type, initial_value;
8247 register tree maxindex = NULL_TREE;
8252 /* Note MAXINDEX is really the maximum index,
8253 one less than the size. */
8254 if (TREE_CODE (initial_value) == STRING_CST)
8257 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8258 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8261 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8263 tree elts = CONSTRUCTOR_ELTS (initial_value);
8264 maxindex = size_binop (MINUS_EXPR, integer_zero_node, size_one_node);
8265 for (; elts; elts = TREE_CHAIN (elts))
8267 if (TREE_PURPOSE (elts))
8268 maxindex = TREE_PURPOSE (elts);
8270 maxindex = size_binop (PLUS_EXPR, maxindex, size_one_node);
8272 maxindex = copy_node (maxindex);
8276 /* Make an error message unless that happened already. */
8277 if (initial_value != error_mark_node)
8280 initial_value = NULL_TREE;
8282 /* Prevent further error messages. */
8283 maxindex = build_int_2 (0, 0);
8290 maxindex = build_int_2 (0, 0);
8299 domain = build_index_type (maxindex);
8300 TYPE_DOMAIN (type) = domain;
8302 if (! TREE_TYPE (maxindex))
8303 TREE_TYPE (maxindex) = domain;
8305 itype = TREE_TYPE (initial_value);
8308 if (itype && !TYPE_DOMAIN (itype))
8309 TYPE_DOMAIN (itype) = domain;
8310 /* The type of the main variant should never be used for arrays
8311 of different sizes. It should only ever be completed with the
8312 size of the array. */
8313 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8314 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain;
8317 /* Lay out the type now that we can get the real answer. */
8324 /* Return zero if something is declared to be a member of type
8325 CTYPE when in the context of CUR_TYPE. STRING is the error
8326 message to print in that case. Otherwise, quietly return 1. */
8329 member_function_or_else (ctype, cur_type, flags)
8330 tree ctype, cur_type;
8331 enum overload_flags flags;
8333 if (ctype && ctype != cur_type)
8335 if (flags == DTOR_FLAG)
8336 error ("destructor for alien class `%s' cannot be a member",
8337 TYPE_NAME_STRING (ctype));
8339 error ("constructor for alien class `%s' cannot be a member",
8340 TYPE_NAME_STRING (ctype));
8346 /* Subroutine of `grokdeclarator'. */
8348 /* Generate errors possibly applicable for a given set of specifiers.
8349 This is for ARM $7.1.2. */
8352 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8355 int virtualp, quals, friendp, raises, inlinep;
8358 cp_error ("`%D' declared as a `virtual' %s", object, type);
8360 cp_error ("`%D' declared as an `inline' %s", object, type);
8362 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8365 cp_error_at ("`%D' declared as a friend", object);
8367 cp_error_at ("`%D' declared with an exception specification", object);
8370 /* CTYPE is class type, or null if non-class.
8371 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8373 DECLARATOR is the function's name.
8374 VIRTUALP is truthvalue of whether the function is virtual or not.
8375 FLAGS are to be passed through to `grokclassfn'.
8376 QUALS are qualifiers indicating whether the function is `const'
8378 RAISES is a list of exceptions that this function can raise.
8379 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8380 not look, and -1 if we should not call `grokclassfn' at all.
8382 Returns `NULL_TREE' if something goes wrong, after issuing
8383 applicable error messages. */
8386 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8387 raises, check, friendp, publicp, inlinep, funcdef_flag,
8388 template_count, in_namespace)
8391 tree orig_declarator;
8393 enum overload_flags flags;
8395 int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8399 int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8400 int has_default_arg = 0;
8404 cname = TREE_CODE (TYPE_NAME (ctype)) == TYPE_DECL
8405 ? TYPE_IDENTIFIER (ctype) : TYPE_NAME (ctype);
8411 type = build_exception_variant (type, raises);
8414 decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8415 /* Propagate volatile out from type to decl. */
8416 if (TYPE_VOLATILE (type))
8417 TREE_THIS_VOLATILE (decl) = 1;
8419 /* If this decl has namespace scope, set that up. */
8421 set_decl_namespace (decl, in_namespace, friendp);
8422 else if (publicp && ! ctype)
8423 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8425 /* `main' and builtins have implicit 'C' linkage. */
8426 if ((MAIN_NAME_P (declarator)
8427 || (IDENTIFIER_LENGTH (declarator) > 10
8428 && IDENTIFIER_POINTER (declarator)[0] == '_'
8429 && IDENTIFIER_POINTER (declarator)[1] == '_'
8430 && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8431 && current_lang_name == lang_name_cplusplus
8432 && ctype == NULL_TREE
8433 /* NULL_TREE means global namespace. */
8434 && DECL_CONTEXT (decl) == NULL_TREE)
8435 DECL_LANGUAGE (decl) = lang_c;
8437 /* Should probably propagate const out from type to decl I bet (mrs). */
8440 DECL_STATIC_FUNCTION_P (decl) = 1;
8441 DECL_CONTEXT (decl) = ctype;
8445 DECL_CLASS_CONTEXT (decl) = ctype;
8447 if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8449 if (processing_template_decl)
8450 error ("cannot declare `main' to be a template");
8452 error ("cannot declare `main' to be inline");
8454 error ("cannot declare `main' to be static");
8459 /* Members of anonymous types and local classes have no linkage; make
8461 if (ctype && (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype))
8462 || hack_decl_function_context (TYPE_MAIN_DECL (ctype))))
8467 /* [basic.link]: A name with no linkage (notably, the name of a class
8468 or enumeration declared in a local scope) shall not be used to
8469 declare an entity with linkage.
8471 Only check this for public decls for now. */
8472 t = no_linkage_check (TREE_TYPE (decl));
8475 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8477 if (DECL_LANGUAGE (decl) == lang_c)
8478 /* Allow this; it's pretty common in C. */;
8480 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8484 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8489 TREE_PUBLIC (decl) = publicp;
8492 DECL_INTERFACE_KNOWN (decl) = 1;
8493 DECL_NOT_REALLY_EXTERN (decl) = 1;
8497 DECL_THIS_INLINE (decl) = DECL_INLINE (decl) = 1;
8499 DECL_EXTERNAL (decl) = 1;
8500 if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8502 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8503 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8507 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8508 grok_op_properties (decl, virtualp, check < 0);
8510 if (ctype && hack_decl_function_context (decl))
8511 DECL_NO_STATIC_CHAIN (decl) = 1;
8513 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8514 if (TREE_PURPOSE (t)
8515 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8517 has_default_arg = 1;
8522 && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8526 ("defining explicit specialization `%D' in friend declaration",
8530 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8532 /* Something like `template <class T> friend void f<T>()'. */
8533 cp_error ("template-id `%D' in declaration of primary template",
8539 /* A friend declaration of the form friend void f<>(). Record
8540 the information in the TEMPLATE_ID_EXPR. */
8541 SET_DECL_IMPLICIT_INSTANTIATION (decl);
8542 DECL_TEMPLATE_INFO (decl)
8543 = tree_cons (TREE_OPERAND (orig_declarator, 0),
8544 TREE_OPERAND (orig_declarator, 1),
8547 if (has_default_arg)
8549 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8556 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8563 if (has_default_arg)
8564 add_defarg_fn (decl);
8566 /* Plain overloading: will not be grok'd by grokclassfn. */
8567 if (! ctype && ! processing_template_decl
8568 && DECL_LANGUAGE (decl) != lang_c
8569 && (! DECL_USE_TEMPLATE (decl) || name_mangling_version < 1))
8570 set_mangled_name_for_decl (decl);
8573 /* Make the init_value nonzero so pushdecl knows this is not
8574 tentative. error_mark_node is replaced later with the BLOCK. */
8575 DECL_INITIAL (decl) = error_mark_node;
8577 /* Caller will do the rest of this. */
8581 if (flags == NO_SPECIAL && ctype && constructor_name (cname) == declarator)
8584 /* Just handle constructors here. We could do this
8585 inside the following if stmt, but I think
8586 that the code is more legible by breaking this
8587 case out. See comments below for what each of
8588 the following calls is supposed to do. */
8589 DECL_CONSTRUCTOR_P (decl) = 1;
8591 grokclassfn (ctype, decl, flags, quals);
8593 decl = check_explicit_specialization (orig_declarator, decl,
8595 2 * (funcdef_flag != 0) +
8596 4 * (friendp != 0));
8597 if (decl == error_mark_node)
8600 if ((! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8603 tmp = check_classfn (ctype, decl);
8605 if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL)
8606 tmp = DECL_TEMPLATE_RESULT(tmp);
8608 if (tmp && DECL_ARTIFICIAL (tmp))
8609 cp_error ("definition of implicitly-declared `%D'", tmp);
8610 if (tmp && duplicate_decls (decl, tmp))
8613 if (! grok_ctor_properties (ctype, decl))
8620 /* Function gets the ugly name, field gets the nice one.
8621 This call may change the type of the function (because
8622 of default parameters)! */
8623 if (ctype != NULL_TREE)
8624 grokclassfn (ctype, decl, flags, quals);
8626 decl = check_explicit_specialization (orig_declarator, decl,
8628 2 * (funcdef_flag != 0) +
8629 4 * (friendp != 0));
8630 if (decl == error_mark_node)
8633 if (ctype != NULL_TREE
8634 && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8637 tmp = check_classfn (ctype, decl);
8639 if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL)
8640 tmp = DECL_TEMPLATE_RESULT (tmp);
8642 if (tmp && DECL_STATIC_FUNCTION_P (tmp)
8643 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
8645 /* Remove the `this' parm added by grokclassfn.
8646 XXX Isn't this done in start_function, too? */
8647 revert_static_member_fn (&decl, NULL, NULL);
8648 last_function_parms = TREE_CHAIN (last_function_parms);
8650 if (tmp && DECL_ARTIFICIAL (tmp))
8651 cp_error ("definition of implicitly-declared `%D'", tmp);
8654 /* Attempt to merge the declarations. This can fail, in
8655 the case of some illegal specialization declarations. */
8656 if (!duplicate_decls (decl, tmp))
8657 cp_error ("no `%#D' member function declared in class `%T'",
8663 if (ctype == NULL_TREE || check)
8668 DECL_VIRTUAL_P (decl) = 1;
8669 if (DECL_VINDEX (decl) == NULL_TREE)
8670 DECL_VINDEX (decl) = error_mark_node;
8671 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
8678 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
8681 RID_BIT_TYPE *specbits_in;
8687 RID_BIT_TYPE specbits;
8689 specbits = *specbits_in;
8691 if (TREE_CODE (type) == OFFSET_TYPE)
8693 /* If you declare a static member so that it
8694 can be initialized, the code will reach here. */
8695 tree basetype = TYPE_OFFSET_BASETYPE (type);
8696 type = TREE_TYPE (type);
8697 decl = build_lang_decl (VAR_DECL, declarator, type);
8698 DECL_CONTEXT (decl) = basetype;
8699 DECL_CLASS_CONTEXT (decl) = basetype;
8700 DECL_ASSEMBLER_NAME (decl) = build_static_name (basetype, declarator);
8707 context = in_namespace;
8708 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
8709 context = current_namespace;
8711 context = NULL_TREE;
8713 if (processing_template_decl)
8714 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8715 we can call push_template_decl. */
8716 decl = build_lang_decl (VAR_DECL, declarator, type);
8718 decl = build_decl (VAR_DECL, declarator, type);
8721 set_decl_namespace (decl, context, 0);
8723 context = DECL_CONTEXT (decl);
8724 if (declarator && context && current_lang_name != lang_name_c)
8725 DECL_ASSEMBLER_NAME (decl) = build_static_name (context, declarator);
8729 set_decl_namespace (decl, in_namespace, 0);
8731 if (RIDBIT_SETP (RID_EXTERN, specbits))
8733 DECL_THIS_EXTERN (decl) = 1;
8734 DECL_EXTERNAL (decl) = !initialized;
8737 /* In class context, static means one per class,
8738 public access, and static storage. */
8739 if (DECL_CLASS_SCOPE_P (decl))
8741 TREE_PUBLIC (decl) = 1;
8742 TREE_STATIC (decl) = 1;
8743 DECL_EXTERNAL (decl) = 0;
8745 /* At top level, either `static' or no s.c. makes a definition
8746 (perhaps tentative), and absence of `static' makes it public. */
8747 else if (toplevel_bindings_p ())
8749 TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
8750 && (DECL_THIS_EXTERN (decl) || ! constp));
8751 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
8753 /* Not at top level, only `static' makes a static definition. */
8756 TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
8757 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
8760 if (TREE_PUBLIC (decl))
8762 /* [basic.link]: A name with no linkage (notably, the name of a class
8763 or enumeration declared in a local scope) shall not be used to
8764 declare an entity with linkage.
8766 Only check this for public decls for now. */
8767 tree t = no_linkage_check (TREE_TYPE (decl));
8770 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8771 /* Ignore for now; `enum { foo } e' is pretty common. */;
8773 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8781 /* Create and return a canonical pointer to member function type, for
8782 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8785 build_ptrmemfunc_type (type)
8791 tree unqualified_variant = NULL_TREE;
8793 /* If a canonical type already exists for this type, use it. We use
8794 this method instead of type_hash_canon, because it only does a
8795 simple equality check on the list of field members. */
8797 if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
8800 /* Make sure that we always have the unqualified pointer-to-member
8802 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
8804 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));
8806 u = make_aggr_type (UNION_TYPE);
8807 SET_IS_AGGR_TYPE (u, 0);
8808 fields[0] = build_lang_decl (FIELD_DECL, pfn_identifier, type);
8809 fields[1] = build_lang_decl (FIELD_DECL, delta2_identifier,
8811 finish_builtin_type (u, "__ptrmemfunc_type", fields, 1, ptr_type_node);
8812 TYPE_NAME (u) = NULL_TREE;
8814 t = make_aggr_type (RECORD_TYPE);
8816 /* Let the front-end know this is a pointer to member function... */
8817 TYPE_PTRMEMFUNC_FLAG (t) = 1;
8818 /* ... and not really an aggregate. */
8819 SET_IS_AGGR_TYPE (t, 0);
8821 fields[0] = build_lang_decl (FIELD_DECL, delta_identifier,
8823 fields[1] = build_lang_decl (FIELD_DECL, index_identifier,
8825 fields[2] = build_lang_decl (FIELD_DECL, pfn_or_delta2_identifier, u);
8826 finish_builtin_type (t, "__ptrmemfunc_type", fields, 2, ptr_type_node);
8828 /* Zap out the name so that the back-end will give us the debugging
8829 information for this anonymous RECORD_TYPE. */
8830 TYPE_NAME (t) = NULL_TREE;
8832 /* If this is not the unqualified form of this pointer-to-member
8833 type, set the TYPE_MAIN_VARIANT for this type to be the
8834 unqualified type. Since they are actually RECORD_TYPEs that are
8835 not variants of each other, we must do this manually. */
8836 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
8838 t = build_qualified_type (t, CP_TYPE_QUALS (type));
8839 TYPE_MAIN_VARIANT (t) = unqualified_variant;
8840 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
8841 TYPE_NEXT_VARIANT (unqualified_variant) = t;
8844 /* Cache this pointer-to-member type so that we can find it again
8846 TYPE_SET_PTRMEMFUNC_TYPE (type, t);
8848 /* Seems to be wanted. */
8849 CLASSTYPE_GOT_SEMICOLON (t) = 1;
8854 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8855 Check to see that the definition is valid. Issue appropriate error
8856 messages. Return 1 if the definition is particularly bad, or 0
8860 check_static_variable_definition (decl, type)
8864 /* Motion 10 at San Diego: If a static const integral data member is
8865 initialized with an integral constant expression, the initializer
8866 may appear either in the declaration (within the class), or in
8867 the definition, but not both. If it appears in the class, the
8868 member is a member constant. The file-scope definition is always
8870 if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
8872 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8874 /* If we just return the declaration, crashes will sometimes
8875 occur. We therefore return void_type_node, as if this was a
8876 friend declaration, to cause callers to completely ignore
8877 this declaration. */
8880 else if (!CP_TYPE_CONST_P (type))
8881 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8883 else if (pedantic && !INTEGRAL_TYPE_P (type))
8884 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
8889 /* Given the SIZE (i.e., number of elements) in an array, compute an
8890 appropriate index type for the array. If non-NULL, NAME is the
8891 name of the thing being declared. */
8894 compute_array_index_type (name, size)
8900 /* The size might be the result of a cast. */
8901 STRIP_TYPE_NOPS (size);
8903 /* It might be a const variable or enumeration constant. */
8904 if (TREE_READONLY_DECL_P (size))
8905 size = decl_constant_value (size);
8907 /* If this involves a template parameter, it will be a constant at
8908 instantiation time, but we don't know what the value is yet.
8909 Even if no template parameters are involved, we may an expression
8910 that is not a constant; we don't even simplify `1 + 2' when
8911 processing a template. */
8912 if (processing_template_decl)
8914 /* Resolve a qualified reference to an enumerator or static
8915 const data member of ours. */
8916 if (TREE_CODE (size) == SCOPE_REF
8917 && TREE_OPERAND (size, 0) == current_class_type)
8919 tree t = lookup_field (current_class_type,
8920 TREE_OPERAND (size, 1), 0, 0);
8925 return build_index_type (build_min (MINUS_EXPR, sizetype,
8926 size, integer_one_node));
8929 /* The array bound must be an integer type. */
8930 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
8931 && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
8932 && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
8935 cp_error ("size of array `%D' has non-integer type", name);
8937 cp_error ("size of array has non-integer type");
8938 size = integer_one_node;
8941 /* Normally, the array-bound will be a constant. */
8942 if (TREE_CONSTANT (size))
8944 /* Check to see if the array bound overflowed. Make that an
8945 error, no matter how generous we're being. */
8946 int old_flag_pedantic_errors = flag_pedantic_errors;
8947 int old_pedantic = pedantic;
8948 pedantic = flag_pedantic_errors = 1;
8949 constant_expression_warning (size);
8950 pedantic = old_pedantic;
8951 flag_pedantic_errors = old_flag_pedantic_errors;
8953 /* An array must have a positive number of elements. */
8954 if (INT_CST_LT (size, integer_zero_node))
8957 cp_error ("size of array `%D' is negative", name);
8959 cp_error ("size of array is negative");
8960 size = integer_one_node;
8962 /* Except that an extension we allow zero-sized arrays. We
8963 always allow them in system headers because glibc uses
8965 else if (integer_zerop (size) && pedantic && !in_system_header)
8968 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", name);
8970 cp_pedwarn ("ANSI C++ forbids zero-size array");
8974 /* Compute the index of the largest element in the array. It is
8975 one less than the number of elements in the array. */
8977 = fold (build_binary_op (MINUS_EXPR,
8978 cp_convert (ssizetype, size),
8979 cp_convert (ssizetype,
8980 integer_one_node)));
8982 /* Check for variable-sized arrays. We allow such things as an
8983 extension, even though they are not allowed in ANSI/ISO C++. */
8984 if (!TREE_CONSTANT (itype))
8989 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
8992 cp_pedwarn ("ANSI C++ forbids variable-size array");
8995 /* Create a variable-sized array index type. */
8996 itype = variable_size (itype);
8998 /* Make sure that there was no overflow when creating to a signed
8999 index type. (For example, on a 32-bit machine, an array with
9000 size 2^32 - 1 is too big.) */
9001 else if (TREE_OVERFLOW (itype))
9003 error ("overflow in array dimension");
9004 TREE_OVERFLOW (itype) = 0;
9007 /* Create and return the appropriate index type. */
9008 return build_index_type (itype);
9011 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9012 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9016 create_array_type_for_decl (name, type, size)
9021 tree itype = NULL_TREE;
9022 const char* error_msg;
9024 /* If things have already gone awry, bail now. */
9025 if (type == error_mark_node || size == error_mark_node)
9026 return error_mark_node;
9028 /* Assume that everything will go OK. */
9031 /* There are some types which cannot be array elements. */
9032 switch (TREE_CODE (type))
9035 error_msg = "array of void";
9039 error_msg = "array of functions";
9042 case REFERENCE_TYPE:
9043 error_msg = "array of references";
9047 error_msg = "array of data members";
9051 error_msg = "array of function members";
9058 /* If something went wrong, issue an error-message and return. */
9062 cp_error ("declaration of `%D' as %s", name, error_msg);
9064 cp_error ("creating %s", error_msg);
9066 return error_mark_node;
9071 The constant expressions that specify the bounds of the arrays
9072 can be omitted only for the first member of the sequence. */
9073 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9075 cp_error ("declaration of `%D' as multidimensional array",
9077 cp_error ("must have bounds for all dimensions except the first");
9079 return error_mark_node;
9082 /* Figure out the index type for the array. */
9084 itype = compute_array_index_type (name, size);
9086 return build_cplus_array_type (type, itype);
9089 /* Given declspecs and a declarator,
9090 determine the name and type of the object declared
9091 and construct a ..._DECL node for it.
9092 (In one case we can return a ..._TYPE node instead.
9093 For invalid input we sometimes return 0.)
9095 DECLSPECS is a chain of tree_list nodes whose value fields
9096 are the storage classes and type specifiers.
9098 DECL_CONTEXT says which syntactic context this declaration is in:
9099 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9100 FUNCDEF for a function definition. Like NORMAL but a few different
9101 error messages in each case. Return value may be zero meaning
9102 this definition is too screwy to try to parse.
9103 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9104 handle member functions (which have FIELD context).
9105 Return value may be zero meaning this definition is too screwy to
9107 PARM for a parameter declaration (either within a function prototype
9108 or before a function body). Make a PARM_DECL, or return void_type_node.
9109 CATCHPARM for a parameter declaration before a catch clause.
9110 TYPENAME if for a typename (in a cast or sizeof).
9111 Don't make a DECL node; just return the ..._TYPE node.
9112 FIELD for a struct or union field; make a FIELD_DECL.
9113 BITFIELD for a field with specified width.
9114 INITIALIZED is 1 if the decl has an initializer.
9116 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9117 normal attributes in TREE_PURPOSE, or NULL_TREE.
9119 In the TYPENAME case, DECLARATOR is really an absolute declarator.
9120 It may also be so in the PARM case, for a prototype where the
9121 argument type is specified but not the name.
9123 This function is where the complicated C meanings of `static'
9124 and `extern' are interpreted.
9126 For C++, if there is any monkey business to do, the function which
9127 calls this one must do it, i.e., prepending instance variables,
9128 renaming overloaded function names, etc.
9130 Note that for this C++, it is an error to define a method within a class
9131 which does not belong to that class.
9133 Except in the case where SCOPE_REFs are implicitly known (such as
9134 methods within a class being redundantly qualified),
9135 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9136 (class_name::decl_name). The caller must also deal with this.
9138 If a constructor or destructor is seen, and the context is FIELD,
9139 then the type gains the attribute TREE_HAS_x. If such a declaration
9140 is erroneous, NULL_TREE is returned.
9142 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9143 function, these are the qualifiers to give to the `this' pointer. We
9144 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9146 May return void_type_node if the declarator turned out to be a friend.
9147 See grokfield for details. */
9149 enum return_types { return_normal, return_ctor, return_dtor, return_conversion };
9152 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
9155 enum decl_context decl_context;
9159 RID_BIT_TYPE specbits;
9162 tree type = NULL_TREE;
9168 int virtualp, explicitp, friendp, inlinep, staticp;
9169 int explicit_int = 0;
9170 int explicit_char = 0;
9171 int defaulted_int = 0;
9172 tree typedef_decl = NULL_TREE;
9174 tree typedef_type = NULL_TREE;
9175 int funcdef_flag = 0;
9176 enum tree_code innermost_code = ERROR_MARK;
9179 /* See the code below that used this. */
9180 tree decl_machine_attr = NULL_TREE;
9182 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9183 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9184 tree init = NULL_TREE;
9186 /* Keep track of what sort of function is being processed
9187 so that we can warn about default return values, or explicit
9188 return values which do not match prescribed defaults. */
9189 enum return_types return_type = return_normal;
9191 tree dname = NULL_TREE;
9192 tree ctype = current_class_type;
9193 tree ctor_return_type = NULL_TREE;
9194 enum overload_flags flags = NO_SPECIAL;
9195 tree quals = NULL_TREE;
9196 tree raises = NULL_TREE;
9197 int template_count = 0;
9198 tree in_namespace = NULL_TREE;
9202 RIDBIT_RESET_ALL (specbits);
9203 if (decl_context == FUNCDEF)
9204 funcdef_flag = 1, decl_context = NORMAL;
9205 else if (decl_context == MEMFUNCDEF)
9206 funcdef_flag = -1, decl_context = FIELD;
9207 else if (decl_context == BITFIELD)
9208 bitfield = 1, decl_context = FIELD;
9210 /* Look inside a declarator for the name being declared
9211 and get it as a string, for an error message. */
9213 tree *next = &declarator;
9217 while (next && *next)
9220 switch (TREE_CODE (decl))
9223 /* For attributes. */
9224 next = &TREE_VALUE (decl);
9229 next = &TREE_OPERAND (decl, 0);
9232 case BIT_NOT_EXPR: /* For C++ destructors! */
9234 tree name = TREE_OPERAND (decl, 0);
9235 tree rename = NULL_TREE;
9237 my_friendly_assert (flags == NO_SPECIAL, 152);
9239 return_type = return_dtor;
9240 if (TREE_CODE (name) == TYPE_DECL)
9241 TREE_OPERAND (decl, 0) = name = constructor_name (name);
9242 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
9243 if (ctype == NULL_TREE)
9245 if (current_class_type == NULL_TREE)
9247 error ("destructors must be member functions");
9252 tree t = constructor_name (current_class_name);
9259 tree t = constructor_name (ctype);
9266 cp_error ("destructor `%T' must match class name `%T'",
9268 TREE_OPERAND (decl, 0) = rename;
9274 case ADDR_EXPR: /* C++ reference declaration */
9279 innermost_code = TREE_CODE (decl);
9280 next = &TREE_OPERAND (decl, 0);
9284 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl)))
9286 /* This is actually a variable declaration using
9287 constructor syntax. We need to call start_decl and
9288 cp_finish_decl so we can get the variable
9291 tree attributes, prefix_attributes;
9293 *next = TREE_OPERAND (decl, 0);
9294 init = CALL_DECLARATOR_PARMS (decl);
9298 attributes = TREE_PURPOSE (attrlist);
9299 prefix_attributes = TREE_VALUE (attrlist);
9303 attributes = NULL_TREE;
9304 prefix_attributes = NULL_TREE;
9307 decl = start_decl (declarator, declspecs, 1,
9308 attributes, prefix_attributes);
9311 /* Look for __unused__ attribute */
9312 if (TREE_USED (TREE_TYPE (decl)))
9313 TREE_USED (decl) = 1;
9314 finish_decl (decl, init, NULL_TREE);
9317 cp_error ("invalid declarator");
9320 innermost_code = TREE_CODE (decl);
9321 if (decl_context == FIELD && ctype == NULL_TREE)
9322 ctype = current_class_type;
9324 && TREE_OPERAND (decl, 0)
9325 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9326 && ((DECL_NAME (TREE_OPERAND (decl, 0))
9327 == constructor_name_full (ctype))
9328 || (DECL_NAME (TREE_OPERAND (decl, 0))
9329 == constructor_name (ctype)))))
9330 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9331 next = &TREE_OPERAND (decl, 0);
9333 if (ctype != NULL_TREE
9334 && decl != NULL_TREE && flags != DTOR_FLAG
9335 && decl == constructor_name (ctype))
9337 return_type = return_ctor;
9338 ctor_return_type = ctype;
9343 case TEMPLATE_ID_EXPR:
9345 tree fns = TREE_OPERAND (decl, 0);
9347 if (TREE_CODE (fns) == LOOKUP_EXPR)
9348 fns = TREE_OPERAND (fns, 0);
9351 if (TREE_CODE (dname) == COMPONENT_REF)
9352 dname = TREE_OPERAND (dname, 1);
9353 if (TREE_CODE (dname) != IDENTIFIER_NODE)
9355 my_friendly_assert (is_overloaded_fn (dname),
9357 dname = DECL_NAME (get_first_fn (dname));
9362 case IDENTIFIER_NODE:
9363 if (TREE_CODE (decl) == IDENTIFIER_NODE)
9370 cp_error ("declarator-id missing; using reserved word `%D'",
9372 name = IDENTIFIER_POINTER (dname);
9374 if (! IDENTIFIER_OPNAME_P (dname)
9375 /* GNU/Linux headers use '__op'. Arrgh. */
9376 || (IDENTIFIER_TYPENAME_P (dname) && ! TREE_TYPE (dname)))
9377 name = IDENTIFIER_POINTER (dname);
9380 if (IDENTIFIER_TYPENAME_P (dname))
9382 my_friendly_assert (flags == NO_SPECIAL, 154);
9383 flags = TYPENAME_FLAG;
9384 ctor_return_type = TREE_TYPE (dname);
9385 return_type = return_conversion;
9387 name = operator_name_string (dname);
9394 /* Perform error checking, and decide on a ctype. */
9395 tree cname = TREE_OPERAND (decl, 0);
9396 if (cname == NULL_TREE)
9398 else if (TREE_CODE (cname) == NAMESPACE_DECL)
9401 in_namespace = TREE_OPERAND (decl, 0);
9402 TREE_OPERAND (decl, 0) = NULL_TREE;
9404 else if (! is_aggr_type (cname, 1))
9405 TREE_OPERAND (decl, 0) = NULL_TREE;
9406 /* Must test TREE_OPERAND (decl, 1), in case user gives
9407 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9408 else if (TREE_OPERAND (decl, 1)
9409 && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9411 else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9412 || TREE_CODE (cname) == TEMPLATE_TEMPLATE_PARM)
9414 cp_error ("`%T::%D' is not a valid declarator", cname,
9415 TREE_OPERAND (decl, 1));
9416 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9417 cname, TREE_OPERAND (decl, 1));
9418 return void_type_node;
9420 else if (ctype == NULL_TREE)
9422 else if (TREE_COMPLEXITY (decl) == current_class_depth)
9423 TREE_OPERAND (decl, 0) = ctype;
9426 if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9428 cp_error ("type `%T' is not derived from type `%T'",
9430 TREE_OPERAND (decl, 0) = NULL_TREE;
9436 if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9437 && ((DECL_NAME (TREE_OPERAND (decl, 1))
9438 == constructor_name_full (ctype))
9439 || (DECL_NAME (TREE_OPERAND (decl, 1))
9440 == constructor_name (ctype))))
9441 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9442 next = &TREE_OPERAND (decl, 1);
9446 if (TREE_CODE (decl) == IDENTIFIER_NODE
9447 && constructor_name (ctype) == decl)
9449 return_type = return_ctor;
9450 ctor_return_type = ctype;
9452 else if (TREE_CODE (decl) == BIT_NOT_EXPR
9453 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9454 && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
9455 || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
9457 return_type = return_dtor;
9458 ctor_return_type = ctype;
9460 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9461 next = &TREE_OPERAND (decl, 0);
9472 /* Parse error puts this typespec where
9473 a declarator should go. */
9474 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl));
9475 if (TREE_TYPE (decl) == current_class_type)
9476 cp_error (" perhaps you want `%T' for a constructor",
9477 current_class_name);
9478 dname = DECL_NAME (decl);
9479 name = IDENTIFIER_POINTER (dname);
9481 /* Avoid giving two errors for this. */
9482 IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9484 declspecs = tree_cons (NULL_TREE, integer_type_node, declspecs);
9490 cp_compiler_error ("`%D' as declarator", decl);
9491 return 0; /* We used to do a 155 abort here. */
9496 /* A function definition's declarator must have the form of
9497 a function declarator. */
9499 if (funcdef_flag && innermost_code != CALL_EXPR)
9502 if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
9503 && innermost_code != CALL_EXPR
9504 && ! (ctype && declspecs == NULL_TREE))
9506 cp_error ("declaration of `%D' as non-function", dname);
9507 return void_type_node;
9510 /* Anything declared one level down from the top level
9511 must be one of the parameters of a function
9512 (because the body is at least two levels down). */
9514 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9515 by not allowing C++ class definitions to specify their parameters
9516 with xdecls (must be spec.d in the parmlist).
9518 Since we now wait to push a class scope until we are sure that
9519 we are in a legitimate method context, we must set oldcname
9520 explicitly (since current_class_name is not yet alive).
9522 We also want to avoid calling this a PARM if it is in a namespace. */
9524 if (decl_context == NORMAL && !toplevel_bindings_p ())
9526 struct binding_level *b = current_binding_level;
9527 current_binding_level = b->level_chain;
9528 if (current_binding_level != 0 && toplevel_bindings_p ())
9529 decl_context = PARM;
9530 current_binding_level = b;
9534 name = decl_context == PARM ? "parameter" : "type name";
9536 /* Look through the decl specs and record which ones appear.
9537 Some typespecs are defined as built-in typenames.
9538 Others, the ones that are modifiers of other types,
9539 are represented by bits in SPECBITS: set the bits for
9540 the modifiers that appear. Storage class keywords are also in SPECBITS.
9542 If there is a typedef name or a type, store the type in TYPE.
9543 This includes builtin typedefs such as `int'.
9545 Set EXPLICIT_INT if the type is `int' or `char' and did not
9546 come from a user typedef.
9548 Set LONGLONG if `long' is mentioned twice.
9550 For C++, constructors and destructors have their own fast treatment. */
9552 for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
9557 /* Certain parse errors slip through. For example,
9558 `int class;' is not caught by the parser. Try
9559 weakly to recover here. */
9560 if (TREE_CODE (spec) != TREE_LIST)
9563 id = TREE_VALUE (spec);
9565 if (TREE_CODE (id) == IDENTIFIER_NODE)
9567 if (id == ridpointers[(int) RID_INT]
9568 || id == ridpointers[(int) RID_CHAR]
9569 || id == ridpointers[(int) RID_BOOL]
9570 || id == ridpointers[(int) RID_WCHAR])
9574 if (id == ridpointers[(int) RID_BOOL])
9575 error ("`bool' is now a keyword");
9577 cp_error ("extraneous `%T' ignored", id);
9581 if (id == ridpointers[(int) RID_INT])
9583 else if (id == ridpointers[(int) RID_CHAR])
9585 type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
9589 /* C++ aggregate types. */
9590 if (IDENTIFIER_HAS_TYPE_VALUE (id))
9593 cp_error ("multiple declarations `%T' and `%T'", type, id);
9595 type = IDENTIFIER_TYPE_VALUE (id);
9599 for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
9601 if (ridpointers[i] == id)
9603 if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
9605 if (pedantic && ! in_system_header && warn_long_long)
9606 pedwarn ("ANSI C++ does not support `long long'");
9608 error ("`long long long' is too long for GCC");
9612 else if (RIDBIT_SETP (i, specbits))
9613 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
9614 RIDBIT_SET (i, specbits);
9619 /* C++ aggregate types. */
9620 else if (TREE_CODE (id) == TYPE_DECL || TREE_CODE (id) == TEMPLATE_DECL)
9623 cp_error ("multiple declarations `%T' and `%T'", type,
9627 type = TREE_TYPE (id);
9628 TREE_VALUE (spec) = type;
9633 error ("two or more data types in declaration of `%s'", name);
9634 else if (TREE_CODE (id) == IDENTIFIER_NODE)
9636 register tree t = lookup_name (id, 1);
9637 if (!t || TREE_CODE (t) != TYPE_DECL)
9638 error ("`%s' fails to be a typedef or built in type",
9639 IDENTIFIER_POINTER (id));
9642 type = TREE_TYPE (t);
9644 /* See the code below that used this. */
9645 decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id);
9650 else if (id != error_mark_node)
9651 /* Can't change CLASS nodes into RECORD nodes here! */
9657 typedef_type = type;
9659 /* No type at all: default to `int', and set DEFAULTED_INT
9660 because it was not a user-defined typedef. */
9662 if (type == NULL_TREE
9663 && (RIDBIT_SETP (RID_SIGNED, specbits)
9664 || RIDBIT_SETP (RID_UNSIGNED, specbits)
9665 || RIDBIT_SETP (RID_LONG, specbits)
9666 || RIDBIT_SETP (RID_SHORT, specbits)))
9668 /* These imply 'int'. */
9669 type = integer_type_node;
9673 if (type == NULL_TREE)
9676 if (return_type == return_dtor)
9677 type = void_type_node;
9678 else if (return_type == return_ctor)
9679 type = build_pointer_type (ctor_return_type);
9680 else if (return_type == return_conversion)
9681 type = ctor_return_type;
9684 /* We handle `main' specially here, because 'main () { }' is so
9685 common. With no options, it is allowed. With -Wreturn-type,
9686 it is a warning. It is only an error with -pedantic-errors. */
9687 int is_main = (funcdef_flag
9688 && MAIN_NAME_P (dname)
9689 && ctype == NULL_TREE
9690 && in_namespace == NULL_TREE
9691 && current_namespace == global_namespace);
9693 if (in_system_header || flag_ms_extensions)
9694 /* Allow it, sigh. */;
9695 else if (pedantic || ! is_main)
9696 cp_pedwarn ("ANSI C++ forbids declaration of `%s' with no type",
9698 else if (warn_return_type)
9699 cp_warning ("ANSI C++ forbids declaration of `%s' with no type",
9702 type = integer_type_node;
9705 else if (return_type == return_dtor)
9707 error ("return type specification for destructor invalid");
9708 type = void_type_node;
9710 else if (return_type == return_ctor)
9712 error ("return type specification for constructor invalid");
9713 type = build_pointer_type (ctor_return_type);
9715 else if (return_type == return_conversion)
9717 if (!same_type_p (type, ctor_return_type))
9718 cp_error ("operator `%T' declared to return `%T'",
9719 ctor_return_type, type);
9721 cp_pedwarn ("return type specified for `operator %T'",
9724 type = ctor_return_type;
9729 /* Now process the modifiers that were specified
9730 and check for invalid combinations. */
9732 /* Long double is a special combination. */
9734 if (RIDBIT_SETP (RID_LONG, specbits)
9735 && TYPE_MAIN_VARIANT (type) == double_type_node)
9737 RIDBIT_RESET (RID_LONG, specbits);
9738 type = build_qualified_type (long_double_type_node,
9739 CP_TYPE_QUALS (type));
9742 /* Check all other uses of type modifiers. */
9744 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9745 || RIDBIT_SETP (RID_SIGNED, specbits)
9746 || RIDBIT_SETP (RID_LONG, specbits)
9747 || RIDBIT_SETP (RID_SHORT, specbits))
9751 if (TREE_CODE (type) == REAL_TYPE)
9752 error ("short, signed or unsigned invalid for `%s'", name);
9753 else if (TREE_CODE (type) != INTEGER_TYPE)
9754 error ("long, short, signed or unsigned invalid for `%s'", name);
9755 else if (RIDBIT_SETP (RID_LONG, specbits)
9756 && RIDBIT_SETP (RID_SHORT, specbits))
9757 error ("long and short specified together for `%s'", name);
9758 else if ((RIDBIT_SETP (RID_LONG, specbits)
9759 || RIDBIT_SETP (RID_SHORT, specbits))
9761 error ("long or short specified with char for `%s'", name);
9762 else if ((RIDBIT_SETP (RID_LONG, specbits)
9763 || RIDBIT_SETP (RID_SHORT, specbits))
9764 && TREE_CODE (type) == REAL_TYPE)
9765 error ("long or short specified with floating type for `%s'", name);
9766 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9767 && RIDBIT_SETP (RID_UNSIGNED, specbits))
9768 error ("signed and unsigned given together for `%s'", name);
9772 if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
9774 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9776 if (flag_pedantic_errors)
9781 /* Discard the type modifiers if they are invalid. */
9784 RIDBIT_RESET (RID_UNSIGNED, specbits);
9785 RIDBIT_RESET (RID_SIGNED, specbits);
9786 RIDBIT_RESET (RID_LONG, specbits);
9787 RIDBIT_RESET (RID_SHORT, specbits);
9792 if (RIDBIT_SETP (RID_COMPLEX, specbits)
9793 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
9795 error ("complex invalid for `%s'", name);
9796 RIDBIT_RESET (RID_COMPLEX, specbits);
9799 /* Decide whether an integer type is signed or not.
9800 Optionally treat bitfields as signed by default. */
9801 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9804 It is implementation-defined whether a plain (neither
9805 explicitly signed or unsigned) char, short, int, or long
9806 bit-field is signed or unsigned.
9808 Naturally, we extend this to long long as well. Note that
9809 this does not include wchar_t. */
9810 || (bitfield && !flag_signed_bitfields
9811 && RIDBIT_NOTSETP (RID_SIGNED, specbits)
9812 /* A typedef for plain `int' without `signed' can be
9813 controlled just like plain `int', but a typedef for
9814 `signed int' cannot be so controlled. */
9816 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
9817 && (TREE_CODE (type) == INTEGER_TYPE
9818 || TREE_CODE (type) == CHAR_TYPE)
9819 && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
9822 type = long_long_unsigned_type_node;
9823 else if (RIDBIT_SETP (RID_LONG, specbits))
9824 type = long_unsigned_type_node;
9825 else if (RIDBIT_SETP (RID_SHORT, specbits))
9826 type = short_unsigned_type_node;
9827 else if (type == char_type_node)
9828 type = unsigned_char_type_node;
9829 else if (typedef_decl)
9830 type = unsigned_type (type);
9832 type = unsigned_type_node;
9834 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9835 && type == char_type_node)
9836 type = signed_char_type_node;
9838 type = long_long_integer_type_node;
9839 else if (RIDBIT_SETP (RID_LONG, specbits))
9840 type = long_integer_type_node;
9841 else if (RIDBIT_SETP (RID_SHORT, specbits))
9842 type = short_integer_type_node;
9844 if (RIDBIT_SETP (RID_COMPLEX, specbits))
9846 /* If we just have "complex", it is equivalent to
9847 "complex double", but if any modifiers at all are specified it is
9848 the complex form of TYPE. E.g, "complex short" is
9849 "complex short int". */
9851 if (defaulted_int && ! longlong
9852 && ! (RIDBIT_SETP (RID_LONG, specbits)
9853 || RIDBIT_SETP (RID_SHORT, specbits)
9854 || RIDBIT_SETP (RID_SIGNED, specbits)
9855 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
9856 type = complex_double_type_node;
9857 else if (type == integer_type_node)
9858 type = complex_integer_type_node;
9859 else if (type == float_type_node)
9860 type = complex_float_type_node;
9861 else if (type == double_type_node)
9862 type = complex_double_type_node;
9863 else if (type == long_double_type_node)
9864 type = complex_long_double_type_node;
9866 type = build_complex_type (type);
9869 if (return_type == return_conversion
9870 && (RIDBIT_SETP (RID_CONST, specbits)
9871 || RIDBIT_SETP (RID_VOLATILE, specbits)
9872 || RIDBIT_SETP (RID_RESTRICT, specbits)))
9873 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9876 /* Set CONSTP if this declaration is `const', whether by
9877 explicit specification or via a typedef.
9878 Likewise for VOLATILEP. */
9880 constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type);
9882 !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type);
9884 !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type);
9885 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
9886 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
9887 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
9888 type = cp_build_qualified_type (type, type_quals);
9890 inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
9891 virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
9892 RIDBIT_RESET (RID_VIRTUAL, specbits);
9893 explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
9894 RIDBIT_RESET (RID_EXPLICIT, specbits);
9896 if (RIDBIT_SETP (RID_STATIC, specbits))
9897 staticp = 1 + (decl_context == FIELD);
9899 if (virtualp && staticp == 2)
9901 cp_error ("member `%D' cannot be declared both virtual and static",
9905 friendp = RIDBIT_SETP (RID_FRIEND, specbits);
9906 RIDBIT_RESET (RID_FRIEND, specbits);
9908 /* Warn if two storage classes are given. Default to `auto'. */
9910 if (RIDBIT_ANY_SET (specbits))
9912 if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
9913 if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++;
9914 if (decl_context == PARM && nclasses > 0)
9915 error ("storage class specifiers invalid in parameter declarations");
9916 if (RIDBIT_SETP (RID_TYPEDEF, specbits))
9918 if (decl_context == PARM)
9919 error ("typedef declaration invalid in parameter declaration");
9922 if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
9923 if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
9926 /* Give error if `virtual' is used outside of class declaration. */
9928 && (current_class_name == NULL_TREE || decl_context != FIELD))
9930 error ("virtual outside class declaration");
9934 /* Static anonymous unions are dealt with here. */
9935 if (staticp && decl_context == TYPENAME
9936 && TREE_CODE (declspecs) == TREE_LIST
9937 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs)))
9938 decl_context = FIELD;
9940 /* Warn about storage classes that are invalid for certain
9941 kinds of declarations (parameters, typenames, etc.). */
9944 error ("multiple storage classes in declaration of `%s'", name);
9945 else if (decl_context != NORMAL && nclasses > 0)
9947 if ((decl_context == PARM || decl_context == CATCHPARM)
9948 && (RIDBIT_SETP (RID_REGISTER, specbits)
9949 || RIDBIT_SETP (RID_AUTO, specbits)))
9951 else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
9953 else if (decl_context == FIELD
9954 /* C++ allows static class elements */
9955 && RIDBIT_SETP (RID_STATIC, specbits))
9956 /* C++ also allows inlines and signed and unsigned elements,
9957 but in those cases we don't come in here. */
9961 if (decl_context == FIELD)
9963 tree tmp = NULL_TREE;
9964 register int op = 0;
9968 /* Avoid trying to get an operand off an identifier node. */
9969 if (TREE_CODE (declarator) == IDENTIFIER_NODE)
9972 tmp = TREE_OPERAND (declarator, 0);
9973 op = IDENTIFIER_OPNAME_P (tmp);
9975 error ("storage class specified for %s `%s'",
9976 op ? "member operator" : "field",
9977 op ? operator_name_string (tmp) : name);
9981 if (decl_context == PARM || decl_context == CATCHPARM)
9982 error ("storage class specified for parameter `%s'", name);
9984 error ("storage class specified for typename");
9986 RIDBIT_RESET (RID_REGISTER, specbits);
9987 RIDBIT_RESET (RID_AUTO, specbits);
9988 RIDBIT_RESET (RID_EXTERN, specbits);
9991 else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
9993 if (toplevel_bindings_p ())
9995 /* It's common practice (and completely valid) to have a const
9996 be initialized and declared extern. */
9997 if (!(type_quals & TYPE_QUAL_CONST))
9998 warning ("`%s' initialized and declared `extern'", name);
10001 error ("`%s' has both `extern' and initializer", name);
10003 else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
10004 && ! toplevel_bindings_p ())
10005 error ("nested function `%s' declared `extern'", name);
10006 else if (toplevel_bindings_p ())
10008 if (RIDBIT_SETP (RID_AUTO, specbits))
10009 error ("top-level declaration of `%s' specifies `auto'", name);
10012 if (nclasses > 0 && friendp)
10013 error ("storage class specifiers invalid in friend function declarations");
10015 /* Now figure out the structure of the declarator proper.
10016 Descend through it, creating more complex types, until we reach
10017 the declared identifier (or NULL_TREE, in an absolute declarator). */
10019 inner_attrs = NULL_TREE;
10022 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
10023 && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
10025 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10026 an INDIRECT_REF (for *...),
10027 a CALL_EXPR (for ...(...)),
10028 an identifier (for the name being declared)
10029 or a null pointer (for the place in an absolute declarator
10030 where the name was omitted).
10031 For the last two cases, we have just exited the loop.
10033 For C++ it could also be
10034 a SCOPE_REF (for class :: ...). In this case, we have converted
10035 sensible names to types, and those are the values we use to
10036 qualify the member name.
10037 an ADDR_EXPR (for &...),
10038 a BIT_NOT_EXPR (for destructors)
10040 At this point, TYPE is the type of elements of an array,
10041 or for a function to return, or for a pointer to point to.
10042 After this sequence of ifs, TYPE is the type of the
10043 array or function or pointer, and DECLARATOR has had its
10044 outermost layer removed. */
10046 if (type == error_mark_node)
10048 if (TREE_CODE (declarator) == SCOPE_REF)
10049 declarator = TREE_OPERAND (declarator, 1);
10051 declarator = TREE_OPERAND (declarator, 0);
10054 if (quals != NULL_TREE
10055 && (declarator == NULL_TREE
10056 || TREE_CODE (declarator) != SCOPE_REF))
10058 if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
10059 ctype = TYPE_METHOD_BASETYPE (type);
10060 if (ctype != NULL_TREE)
10062 tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
10063 grok_method_quals (ctype, dummy, quals);
10064 type = TREE_TYPE (dummy);
10065 ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
10070 /* See the comment for the TREE_LIST case, below. */
10073 else if (inner_attrs)
10075 decl_attributes (type, inner_attrs, NULL_TREE);
10076 inner_attrs = NULL_TREE;
10079 switch (TREE_CODE (declarator))
10083 /* We encode a declarator with embedded attributes using
10084 a TREE_LIST. The attributes apply to the declarator
10085 directly inside them, so we have to skip an iteration
10086 before applying them to the type. If the declarator just
10087 inside is the declarator-id, we apply the attrs to the
10089 inner_attrs = TREE_PURPOSE (declarator);
10091 declarator = TREE_VALUE (declarator);
10097 register tree size;
10099 size = TREE_OPERAND (declarator, 1);
10101 /* VC++ spells a zero-sized array with []. */
10102 if (size == NULL_TREE && decl_context == FIELD && ! staticp
10103 && ! RIDBIT_SETP (RID_TYPEDEF, specbits))
10104 size = integer_zero_node;
10106 declarator = TREE_OPERAND (declarator, 0);
10108 type = create_array_type_for_decl (dname, type, size);
10117 tree inner_parms = CALL_DECLARATOR_PARMS (declarator);
10118 tree inner_decl = TREE_OPERAND (declarator, 0);
10120 /* Declaring a function type.
10121 Make sure we have a valid type for the function to return. */
10123 /* We now know that the TYPE_QUALS don't apply to the
10124 decl, but to its return type. */
10125 type_quals = TYPE_UNQUALIFIED;
10127 /* Warn about some types functions can't return. */
10129 if (TREE_CODE (type) == FUNCTION_TYPE)
10131 error ("`%s' declared as function returning a function", name);
10132 type = integer_type_node;
10134 if (TREE_CODE (type) == ARRAY_TYPE)
10136 error ("`%s' declared as function returning an array", name);
10137 type = integer_type_node;
10140 if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
10141 inner_decl = TREE_OPERAND (inner_decl, 1);
10143 if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10144 inner_decl = dname;
10146 /* Pick up type qualifiers which should be applied to `this'. */
10147 quals = CALL_DECLARATOR_QUALS (declarator);
10149 /* Pick up the exception specifications. */
10150 raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator);
10152 /* Say it's a definition only for the CALL_EXPR
10153 closest to the identifier. */
10156 && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10157 || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10158 || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10160 if (ctype == NULL_TREE
10161 && decl_context == FIELD
10163 && (friendp == 0 || dname == current_class_name))
10164 ctype = current_class_type;
10166 if (ctype && return_type == return_conversion)
10167 TYPE_HAS_CONVERSION (ctype) = 1;
10168 if (ctype && constructor_name (ctype) == dname)
10170 /* We are within a class's scope. If our declarator name
10171 is the same as the class name, and we are defining
10172 a function, then it is a constructor/destructor, and
10173 therefore returns a void type. */
10175 if (flags == DTOR_FLAG)
10177 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10178 not be declared const or volatile. A destructor
10179 may not be static. */
10181 error ("destructor cannot be static member function");
10184 cp_error ("destructors may not be `%s'",
10185 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10188 if (decl_context == FIELD)
10190 if (! member_function_or_else (ctype,
10191 current_class_type,
10193 return void_type_node;
10196 else /* It's a constructor. */
10198 if (explicitp == 1)
10200 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10201 not be declared const or volatile. A constructor may
10202 not be virtual. A constructor may not be static. */
10204 error ("constructor cannot be static member function");
10207 pedwarn ("constructors cannot be declared virtual");
10212 cp_error ("constructors may not be `%s'",
10213 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10217 RID_BIT_TYPE tmp_bits;
10218 bcopy ((void*)&specbits, (void*)&tmp_bits, sizeof (RID_BIT_TYPE));
10219 RIDBIT_RESET (RID_INLINE, tmp_bits);
10220 RIDBIT_RESET (RID_STATIC, tmp_bits);
10221 if (RIDBIT_ANY_SET (tmp_bits))
10222 error ("return value type specifier for constructor ignored");
10224 type = build_pointer_type (ctype);
10225 if (decl_context == FIELD)
10227 if (! member_function_or_else (ctype,
10228 current_class_type,
10230 return void_type_node;
10231 TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10232 if (return_type != return_ctor)
10236 if (decl_context == FIELD)
10242 error ("can't initialize friend function `%s'", name);
10245 /* Cannot be both friend and virtual. */
10246 error ("virtual functions cannot be friends");
10247 RIDBIT_RESET (RID_FRIEND, specbits);
10250 if (decl_context == NORMAL)
10251 error ("friend declaration not in class definition");
10252 if (current_function_decl && funcdef_flag)
10253 cp_error ("can't define friend function `%s' in a local class definition",
10257 /* Construct the function type and go to the next
10258 inner layer of declarator. */
10260 declarator = TREE_OPERAND (declarator, 0);
10262 /* FIXME: This is where default args should be fully
10265 arg_types = grokparms (inner_parms, funcdecl_p ? funcdef_flag : 0);
10267 if (declarator && flags == DTOR_FLAG)
10269 /* A destructor declared in the body of a class will
10270 be represented as a BIT_NOT_EXPR. But, we just
10271 want the underlying IDENTIFIER. */
10272 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10273 declarator = TREE_OPERAND (declarator, 0);
10275 if (strict_prototype == 0 && arg_types == NULL_TREE)
10276 arg_types = void_list_node;
10277 else if (arg_types == NULL_TREE
10278 || arg_types != void_list_node)
10280 cp_error ("destructors may not have parameters");
10281 arg_types = void_list_node;
10282 last_function_parms = NULL_TREE;
10286 /* ANSI says that `const int foo ();'
10287 does not make the function foo const. */
10288 type = build_function_type (type, arg_types);
10292 for (t = arg_types; t; t = TREE_CHAIN (t))
10293 if (TREE_PURPOSE (t)
10294 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10296 add_defarg_fn (type);
10305 /* Filter out pointers-to-references and references-to-references.
10306 We can get these if a TYPE_DECL is used. */
10308 if (TREE_CODE (type) == REFERENCE_TYPE)
10310 error ("cannot declare %s to references",
10311 TREE_CODE (declarator) == ADDR_EXPR
10312 ? "references" : "pointers");
10313 declarator = TREE_OPERAND (declarator, 0);
10317 if (TREE_CODE (type) == OFFSET_TYPE
10318 && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10319 || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10321 cp_error ("cannot declare pointer to `%#T' member",
10323 type = TREE_TYPE (type);
10326 /* Merge any constancy or volatility into the target type
10327 for the pointer. */
10329 /* We now know that the TYPE_QUALS don't apply to the decl,
10330 but to the target of the pointer. */
10331 type_quals = TYPE_UNQUALIFIED;
10333 if (TREE_CODE (declarator) == ADDR_EXPR)
10335 if (TREE_CODE (type) == VOID_TYPE)
10336 error ("invalid type: `void &'");
10338 type = build_reference_type (type);
10340 else if (TREE_CODE (type) == METHOD_TYPE)
10341 type = build_ptrmemfunc_type (build_pointer_type (type));
10343 type = build_pointer_type (type);
10345 /* Process a list of type modifier keywords (such as
10346 const or volatile) that were given inside the `*' or `&'. */
10348 if (TREE_TYPE (declarator))
10350 register tree typemodlist;
10356 for (typemodlist = TREE_TYPE (declarator); typemodlist;
10357 typemodlist = TREE_CHAIN (typemodlist))
10359 tree qualifier = TREE_VALUE (typemodlist);
10361 if (qualifier == ridpointers[(int) RID_CONST])
10363 else if (qualifier == ridpointers[(int) RID_VOLATILE])
10365 else if (qualifier == ridpointers[(int) RID_RESTRICT])
10370 error ("invalid type modifier within pointer declarator");
10374 pedwarn ("duplicate `const'");
10376 pedwarn ("duplicate `volatile'");
10378 pedwarn ("duplicate `restrict'");
10380 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10381 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10382 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10383 if (TREE_CODE (declarator) == ADDR_EXPR
10384 && (constp || volatilep))
10387 pedwarn ("discarding `const' applied to a reference");
10389 pedwarn ("discarding `volatile' applied to a reference");
10390 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
10392 type = cp_build_qualified_type (type, type_quals);
10394 declarator = TREE_OPERAND (declarator, 0);
10400 /* We have converted type names to NULL_TREE if the
10401 name was bogus, or to a _TYPE node, if not.
10403 The variable CTYPE holds the type we will ultimately
10404 resolve to. The code here just needs to build
10405 up appropriate member types. */
10406 tree sname = TREE_OPERAND (declarator, 1);
10409 /* Destructors can have their visibilities changed as well. */
10410 if (TREE_CODE (sname) == BIT_NOT_EXPR)
10411 sname = TREE_OPERAND (sname, 0);
10413 if (TREE_COMPLEXITY (declarator) == 0)
10414 /* This needs to be here, in case we are called
10415 multiple times. */ ;
10416 else if (TREE_COMPLEXITY (declarator) == -1)
10417 /* Namespace member. */
10418 pop_decl_namespace ();
10419 else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
10420 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10421 else if (! IS_AGGR_TYPE_CODE
10422 (TREE_CODE (TREE_OPERAND (declarator, 0))))
10424 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
10426 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10427 that refer to ctype. They couldn't be resolved earlier
10428 because we hadn't pushed into the class yet.
10429 Example: resolve 'B<T>::type' in
10430 'B<typename B<T>::type> B<T>::f () { }'. */
10431 if (current_template_parms
10432 && uses_template_parms (type)
10433 && uses_template_parms (current_class_type))
10435 tree args = current_template_args ();
10436 type = tsubst (type, args, /*complain=*/1, NULL_TREE);
10439 /* This pop_nested_class corresponds to the
10440 push_nested_class used to push into class scope for
10441 parsing the argument list of a function decl, in
10443 pop_nested_class ();
10444 TREE_COMPLEXITY (declarator) = current_class_depth;
10447 my_friendly_abort (16);
10449 if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10451 /* We had a reference to a global decl, or
10452 perhaps we were given a non-aggregate typedef,
10453 in which case we cleared this out, and should just
10454 keep going as though it wasn't there. */
10455 declarator = sname;
10458 ctype = TREE_OPERAND (declarator, 0);
10461 while (t != NULL_TREE && CLASS_TYPE_P (t))
10463 if (CLASSTYPE_TEMPLATE_INFO (t) &&
10464 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10465 template_count += 1;
10466 t = TYPE_MAIN_DECL (t);
10467 if (DECL_LANG_SPECIFIC (t))
10468 t = DECL_CLASS_CONTEXT (t);
10473 if (sname == NULL_TREE)
10476 if (TREE_CODE (sname) == IDENTIFIER_NODE)
10478 /* This is the `standard' use of the scoping operator:
10479 basetype :: member . */
10481 if (ctype == current_class_type)
10487 Is this ill-formed? */
10490 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10493 else if (TREE_CODE (type) == FUNCTION_TYPE)
10495 if (current_class_type == NULL_TREE
10497 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10498 TYPE_ARG_TYPES (type));
10501 cp_error ("cannot declare member function `%T::%s' within `%T'",
10502 ctype, name, current_class_type);
10503 return void_type_node;
10506 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
10507 || TYPE_SIZE (complete_type (ctype)) != NULL_TREE)
10509 /* Have to move this code elsewhere in this function.
10510 this code is used for i.e., typedef int A::M; M *pm;
10512 It is? How? jason 10/2/94 */
10514 if (current_class_type)
10516 cp_error ("cannot declare member `%T::%s' within `%T'",
10517 ctype, name, current_class_type);
10518 return void_type_node;
10520 type = build_offset_type (ctype, type);
10522 else if (uses_template_parms (ctype))
10524 if (TREE_CODE (type) == FUNCTION_TYPE)
10526 = build_cplus_method_type (ctype, TREE_TYPE (type),
10527 TYPE_ARG_TYPES (type));
10531 cp_error ("structure `%T' not yet defined", ctype);
10532 return error_mark_node;
10535 declarator = sname;
10537 else if (TREE_CODE (sname) == SCOPE_REF)
10538 my_friendly_abort (17);
10542 declarator = TREE_OPERAND (declarator, 1);
10543 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
10544 /* In this case, we will deal with it later. */
10548 if (TREE_CODE (type) == FUNCTION_TYPE)
10549 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10550 TYPE_ARG_TYPES (type));
10552 type = build_offset_type (ctype, type);
10559 declarator = TREE_OPERAND (declarator, 0);
10564 case ENUMERAL_TYPE:
10565 declarator = NULL_TREE;
10569 declarator = NULL_TREE;
10573 my_friendly_abort (158);
10577 /* See the comment for the TREE_LIST case, above. */
10580 if (! ignore_attrs)
10581 decl_attributes (type, inner_attrs, NULL_TREE);
10583 TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist));
10585 attrlist = build_decl_list (NULL_TREE, inner_attrs);
10588 /* Now TYPE has the actual type. */
10590 if (explicitp == 1 || (explicitp && friendp))
10592 /* [dcl.fct.spec] The explicit specifier shall only be used in
10593 declarations of constructors within a class definition. */
10594 error ("only declarations of constructors can be `explicit'");
10598 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10600 if (current_class_name == NULL_TREE || decl_context == PARM || friendp)
10602 error ("non-member `%s' cannot be declared `mutable'", name);
10603 RIDBIT_RESET (RID_MUTABLE, specbits);
10605 else if (decl_context == TYPENAME || RIDBIT_SETP (RID_TYPEDEF, specbits))
10607 error ("non-object member `%s' cannot be declared `mutable'", name);
10608 RIDBIT_RESET (RID_MUTABLE, specbits);
10610 else if (TREE_CODE (type) == FUNCTION_TYPE
10611 || TREE_CODE (type) == METHOD_TYPE)
10613 error ("function `%s' cannot be declared `mutable'", name);
10614 RIDBIT_RESET (RID_MUTABLE, specbits);
10618 error ("static `%s' cannot be declared `mutable'", name);
10619 RIDBIT_RESET (RID_MUTABLE, specbits);
10621 else if (type_quals & TYPE_QUAL_CONST)
10623 error ("const `%s' cannot be declared `mutable'", name);
10624 RIDBIT_RESET (RID_MUTABLE, specbits);
10628 if (declarator == NULL_TREE
10629 || TREE_CODE (declarator) == IDENTIFIER_NODE
10630 || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
10631 && (TREE_CODE (type) == FUNCTION_TYPE
10632 || TREE_CODE (type) == METHOD_TYPE)))
10634 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
10636 cp_error ("template-id `%D' used as a declarator", declarator);
10637 declarator = dname;
10640 /* Unexpected declarator format. */
10641 my_friendly_abort (990210);
10643 /* If this is declaring a typedef name, return a TYPE_DECL. */
10645 if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
10649 /* Note that the grammar rejects storage classes
10650 in typenames, fields or parameters. */
10651 if (current_lang_name == lang_name_java)
10652 TYPE_FOR_JAVA (type) = 1;
10654 if (decl_context == FIELD)
10656 if (declarator == constructor_name (current_class_type))
10657 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10659 decl = build_lang_decl (TYPE_DECL, declarator, type);
10663 /* Make sure this typedef lives as long as its type,
10664 since it might be used as a template parameter. */
10665 if (processing_template_decl)
10666 decl = build_lang_decl (TYPE_DECL, declarator, type);
10668 decl = build_decl (TYPE_DECL, declarator, type);
10671 /* If the user declares "typedef struct {...} foo" then the
10672 struct will have an anonymous name. Fill that name in now.
10673 Nothing can refer to it, so nothing needs know about the name
10675 if (type != error_mark_node
10676 && TYPE_NAME (type)
10677 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
10678 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type))
10679 && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED)
10681 tree oldname = TYPE_NAME (type);
10684 /* Replace the anonymous name with the real name everywhere. */
10685 lookup_tag_reverse (type, declarator);
10686 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
10687 if (TYPE_NAME (t) == oldname)
10688 TYPE_NAME (t) = decl;
10690 if (TYPE_LANG_SPECIFIC (type))
10691 TYPE_WAS_ANONYMOUS (type) = 1;
10693 /* If this is a typedef within a template class, the nested
10694 type is a (non-primary) template. The name for the
10695 template needs updating as well. */
10696 if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
10697 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
10698 = TYPE_IDENTIFIER (type);
10700 /* XXX Temporarily set the scope.
10701 When returning, start_decl expects it as NULL_TREE,
10702 and will then then set it using pushdecl. */
10703 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 980404);
10704 if (current_class_type)
10705 DECL_CONTEXT (decl) = current_class_type;
10707 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
10709 DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
10710 DECL_ASSEMBLER_NAME (decl)
10711 = get_identifier (build_overload_name (type, 1, 1));
10712 DECL_CONTEXT (decl) = NULL_TREE;
10714 /* FIXME remangle member functions; member functions of a
10715 type with external linkage have external linkage. */
10718 if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
10720 cp_error_at ("typedef name may not be class-qualified", decl);
10725 if (ctype == NULL_TREE)
10727 if (TREE_CODE (type) != METHOD_TYPE)
10728 cp_error_at ("invalid type qualifier for non-method type", decl);
10730 ctype = TYPE_METHOD_BASETYPE (type);
10732 if (ctype != NULL_TREE)
10733 grok_method_quals (ctype, decl, quals);
10736 if (RIDBIT_SETP (RID_SIGNED, specbits)
10737 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
10738 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
10740 bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
10741 inlinep, friendp, raises != NULL_TREE);
10744 error ("typedef declaration includes an initializer");
10749 /* Detect the case of an array type of unspecified size
10750 which came, as such, direct from a typedef name.
10751 We must copy the type, so that each identifier gets
10752 a distinct type, so that each identifier's size can be
10753 controlled separately by its own initializer. */
10755 if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE
10756 && TYPE_DOMAIN (type) == NULL_TREE)
10758 type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type));
10761 /* If this is a type name (such as, in a cast or sizeof),
10762 compute the type and return it now. */
10764 if (decl_context == TYPENAME)
10766 /* Note that the grammar rejects storage classes
10767 in typenames, fields or parameters. */
10768 if (type_quals != TYPE_UNQUALIFIED)
10769 type_quals = TYPE_UNQUALIFIED;
10771 /* Special case: "friend class foo" looks like a TYPENAME context. */
10774 if (type_quals != TYPE_UNQUALIFIED)
10776 cp_error ("type qualifiers specified for friend class declaration");
10777 type_quals = TYPE_UNQUALIFIED;
10781 cp_error ("`inline' specified for friend class declaration");
10785 /* Only try to do this stuff if we didn't already give up. */
10786 if (type != integer_type_node)
10788 /* A friendly class? */
10789 if (current_class_type)
10790 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
10792 error ("trying to make class `%s' a friend of global scope",
10793 TYPE_NAME_STRING (type));
10794 type = void_type_node;
10799 tree dummy = build_decl (TYPE_DECL, declarator, type);
10800 if (ctype == NULL_TREE)
10802 my_friendly_assert (TREE_CODE (type) == METHOD_TYPE, 159);
10803 ctype = TYPE_METHOD_BASETYPE (type);
10805 grok_method_quals (ctype, dummy, quals);
10806 type = TREE_TYPE (dummy);
10811 else if (declarator == NULL_TREE && decl_context != PARM
10812 && decl_context != CATCHPARM
10813 && TREE_CODE (type) != UNION_TYPE
10816 cp_error ("abstract declarator `%T' used as declaration", type);
10817 declarator = make_anon_name ();
10820 /* `void' at top level (not within pointer)
10821 is allowed only in typedefs or type names.
10822 We don't complain about parms either, but that is because
10823 a better error message can be made later. */
10825 if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
10828 error ("unnamed variable or field declared void");
10829 else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10831 if (IDENTIFIER_OPNAME_P (declarator))
10832 my_friendly_abort (356);
10834 error ("variable or field `%s' declared void", name);
10837 error ("variable or field declared void");
10838 type = integer_type_node;
10841 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10842 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10844 if (decl_context == PARM || decl_context == CATCHPARM)
10846 if (ctype || in_namespace)
10847 error ("cannot use `::' in parameter declaration");
10849 /* A parameter declared as an array of T is really a pointer to T.
10850 One declared as a function is really a pointer to a function.
10851 One declared as a member is really a pointer to member. */
10853 if (TREE_CODE (type) == ARRAY_TYPE)
10855 /* Transfer const-ness of array into that of type pointed to. */
10856 type = build_pointer_type (TREE_TYPE (type));
10857 type_quals = TYPE_UNQUALIFIED;
10859 else if (TREE_CODE (type) == FUNCTION_TYPE)
10860 type = build_pointer_type (type);
10861 else if (TREE_CODE (type) == OFFSET_TYPE)
10862 type = build_pointer_type (type);
10863 else if (TREE_CODE (type) == VOID_TYPE && declarator)
10865 error ("declaration of `%s' as void", name);
10871 register tree decl;
10873 if (decl_context == PARM)
10875 decl = build_decl (PARM_DECL, declarator, type);
10877 bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
10878 inlinep, friendp, raises != NULL_TREE);
10880 /* Compute the type actually passed in the parmlist,
10881 for the case where there is no prototype.
10882 (For example, shorts and chars are passed as ints.)
10883 When there is a prototype, this is overridden later. */
10885 DECL_ARG_TYPE (decl) = type_promotes_to (type);
10887 else if (decl_context == FIELD)
10889 if (type == error_mark_node)
10891 /* Happens when declaring arrays of sizes which
10892 are error_mark_node, for example. */
10895 else if (in_namespace && !friendp)
10897 /* Something like struct S { int N::j; }; */
10898 cp_error ("invalid use of `::'");
10901 else if (TREE_CODE (type) == FUNCTION_TYPE)
10904 tree function_context;
10906 /* We catch the others as conflicts with the builtin
10908 if (friendp && declarator == ridpointers[(int) RID_SIGNED])
10910 cp_error ("function `%D' cannot be declared friend",
10917 if (ctype == NULL_TREE)
10918 ctype = current_class_type;
10920 if (ctype == NULL_TREE)
10922 cp_error ("can't make `%D' into a method -- not in a class",
10924 return void_type_node;
10927 /* ``A union may [ ... ] not [ have ] virtual functions.''
10929 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
10931 cp_error ("function `%D' declared virtual inside a union",
10933 return void_type_node;
10936 if (declarator == ansi_opname[(int) NEW_EXPR]
10937 || declarator == ansi_opname[(int) VEC_NEW_EXPR]
10938 || declarator == ansi_opname[(int) DELETE_EXPR]
10939 || declarator == ansi_opname[(int) VEC_DELETE_EXPR])
10943 cp_error ("`%D' cannot be declared virtual, since it is always static",
10948 else if (staticp < 2)
10949 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10950 TYPE_ARG_TYPES (type));
10953 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10954 function_context = (ctype != NULL_TREE) ?
10955 hack_decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
10956 publicp = (! friendp || ! staticp)
10957 && function_context == NULL_TREE;
10958 decl = grokfndecl (ctype, type,
10959 TREE_CODE (declarator) != TEMPLATE_ID_EXPR
10960 ? declarator : dname,
10962 virtualp, flags, quals, raises,
10963 friendp ? -1 : 0, friendp, publicp, inlinep,
10964 funcdef_flag, template_count, in_namespace);
10965 if (decl == NULL_TREE)
10968 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10969 /* The decl and setting of decl_machine_attr is also turned off. */
10970 decl = build_decl_attribute_variant (decl, decl_machine_attr);
10973 /* [class.conv.ctor]
10975 A constructor declared without the function-specifier
10976 explicit that can be called with a single parameter
10977 specifies a conversion from the type of its first
10978 parameter to the type of its class. Such a constructor
10979 is called a converting constructor. */
10980 if (explicitp == 2)
10981 DECL_NONCONVERTING_P (decl) = 1;
10982 else if (DECL_CONSTRUCTOR_P (decl))
10984 /* The constructor can be called with exactly one
10985 parameter if there is at least one parameter, and
10986 any subsequent parameters have default arguments.
10987 We don't look at the first parameter, which is
10988 really just the `this' parameter for the new
10991 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)));
10993 /* Skip the `in_chrg' argument too, if present. */
10994 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl)))
10995 arg_types = TREE_CHAIN (arg_types);
10997 if (arg_types == void_list_node
10999 && TREE_CHAIN (arg_types)
11000 && TREE_CHAIN (arg_types) != void_list_node
11001 && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
11002 DECL_NONCONVERTING_P (decl) = 1;
11005 else if (TREE_CODE (type) == METHOD_TYPE)
11007 /* We only get here for friend declarations of
11008 members of other classes. */
11009 /* All method decls are public, so tell grokfndecl to set
11010 TREE_PUBLIC, also. */
11011 decl = grokfndecl (ctype, type, declarator, declarator,
11012 virtualp, flags, quals, raises,
11013 friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
11014 template_count, in_namespace);
11015 if (decl == NULL_TREE)
11018 else if (!staticp && ! processing_template_decl
11019 && TYPE_SIZE (complete_type (type)) == NULL_TREE
11020 && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
11023 cp_error ("field `%D' has incomplete type", declarator);
11025 cp_error ("name `%T' has incomplete type", type);
11027 /* If we're instantiating a template, tell them which
11028 instantiation made the field's type be incomplete. */
11029 if (current_class_type
11030 && TYPE_NAME (current_class_type)
11031 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
11032 && declspecs && TREE_VALUE (declspecs)
11033 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
11034 cp_error (" in instantiation of template `%T'",
11035 current_class_type);
11037 type = error_mark_node;
11044 error ("`%s' is neither function nor method; cannot be declared friend",
11045 IDENTIFIER_POINTER (declarator));
11053 /* Friends are treated specially. */
11054 if (ctype == current_class_type)
11055 warning ("member functions are implicitly friends of their class");
11058 tree t = NULL_TREE;
11059 if (decl && DECL_NAME (decl))
11061 if (template_class_depth (current_class_type) == 0)
11064 = check_explicit_specialization
11066 template_count, 2 * (funcdef_flag != 0) + 4);
11067 if (decl == error_mark_node)
11068 return error_mark_node;
11071 t = do_friend (ctype, declarator, decl,
11072 last_function_parms, attrlist, flags, quals,
11075 if (t && funcdef_flag)
11078 return void_type_node;
11082 /* Structure field. It may not be a function, except for C++ */
11084 if (decl == NULL_TREE)
11090 /* An attempt is being made to initialize a non-static
11091 member. But, from [class.mem]:
11093 4 A member-declarator can contain a
11094 constant-initializer only if it declares a static
11095 member (_class.static_) of integral or enumeration
11096 type, see _class.static.data_.
11098 This used to be relatively common practice, but
11099 the rest of the compiler does not correctly
11100 handle the initialization unless the member is
11101 static so we make it static below. */
11102 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
11104 cp_pedwarn ("making `%D' static", declarator);
11108 if (uses_template_parms (type))
11109 /* We'll check at instantiation time. */
11111 else if (check_static_variable_definition (declarator,
11113 /* If we just return the declaration, crashes
11114 will sometimes occur. We therefore return
11115 void_type_node, as if this was a friend
11116 declaration, to cause callers to completely
11117 ignore this declaration. */
11118 return void_type_node;
11121 /* 9.2p13 [class.mem] */
11122 if (declarator == constructor_name (current_class_type)
11123 /* Divergence from the standard: In extern "C", we
11124 allow non-static data members here, because C does
11125 and /usr/include/netinet/in.h uses that. */
11126 && (staticp || ! in_system_header))
11127 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
11132 /* C++ allows static class members. All other work
11133 for this is done by grokfield. */
11134 decl = build_lang_decl (VAR_DECL, declarator, type);
11135 TREE_STATIC (decl) = 1;
11136 /* In class context, 'static' means public access. */
11137 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
11141 decl = build_lang_decl (FIELD_DECL, declarator, type);
11142 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11144 DECL_MUTABLE_P (decl) = 1;
11145 RIDBIT_RESET (RID_MUTABLE, specbits);
11149 bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
11150 inlinep, friendp, raises != NULL_TREE);
11153 else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
11155 tree original_name;
11161 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11162 original_name = dname;
11164 original_name = declarator;
11166 if (RIDBIT_SETP (RID_AUTO, specbits))
11167 error ("storage class `auto' invalid for function `%s'", name);
11168 else if (RIDBIT_SETP (RID_REGISTER, specbits))
11169 error ("storage class `register' invalid for function `%s'", name);
11171 /* Function declaration not at top level.
11172 Storage classes other than `extern' are not allowed
11173 and `extern' makes no difference. */
11174 if (! toplevel_bindings_p ()
11175 && (RIDBIT_SETP (RID_STATIC, specbits)
11176 || RIDBIT_SETP (RID_INLINE, specbits))
11179 if (RIDBIT_SETP (RID_STATIC, specbits))
11180 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11182 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11185 if (ctype == NULL_TREE)
11189 error ("virtual non-class function `%s'", name);
11193 else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11194 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11195 TYPE_ARG_TYPES (type));
11197 /* Record presence of `static'. */
11198 publicp = (ctype != NULL_TREE
11199 || RIDBIT_SETP (RID_EXTERN, specbits)
11200 || !RIDBIT_SETP (RID_STATIC, specbits));
11202 decl = grokfndecl (ctype, type, original_name, declarator,
11203 virtualp, flags, quals, raises,
11205 publicp, inlinep, funcdef_flag,
11206 template_count, in_namespace);
11207 if (decl == NULL_TREE)
11212 int illegal_static = 0;
11214 /* Don't allow a static member function in a class, and forbid
11215 declaring main to be static. */
11216 if (TREE_CODE (type) == METHOD_TYPE)
11218 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11219 illegal_static = 1;
11221 else if (current_function_decl)
11223 /* FIXME need arm citation */
11224 error ("cannot declare static function inside another function");
11225 illegal_static = 1;
11228 if (illegal_static)
11231 RIDBIT_RESET (RID_STATIC, specbits);
11237 /* It's a variable. */
11239 /* An uninitialized decl with `extern' is a reference. */
11240 decl = grokvardecl (type, declarator, &specbits,
11242 (type_quals & TYPE_QUAL_CONST) != 0,
11244 bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11245 inlinep, friendp, raises != NULL_TREE);
11249 DECL_CONTEXT (decl) = ctype;
11252 cp_pedwarn ("static member `%D' re-declared as static", decl);
11254 RIDBIT_RESET (RID_STATIC, specbits);
11256 if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11258 cp_error ("static member `%D' declared `register'", decl);
11259 RIDBIT_RESET (RID_REGISTER, specbits);
11261 if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11263 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11265 RIDBIT_RESET (RID_EXTERN, specbits);
11270 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE, specbits), 19990927);
11272 /* Record `register' declaration for warnings on &
11273 and in case doing stupid register allocation. */
11275 if (RIDBIT_SETP (RID_REGISTER, specbits))
11276 DECL_REGISTER (decl) = 1;
11278 if (RIDBIT_SETP (RID_EXTERN, specbits))
11279 DECL_THIS_EXTERN (decl) = 1;
11281 if (RIDBIT_SETP (RID_STATIC, specbits))
11282 DECL_THIS_STATIC (decl) = 1;
11284 /* Record constancy and volatility. There's no need to do this
11285 when processing a template; we'll do this for the instantiated
11286 declaration based on the type of DECL. */
11287 if (!processing_template_decl)
11288 c_apply_type_quals_to_decl (type_quals, decl);
11294 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11295 An empty exprlist is a parmlist. An exprlist which
11296 contains only identifiers at the global level
11297 is a parmlist. Otherwise, it is an exprlist. */
11300 parmlist_is_exprlist (exprs)
11303 if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11306 if (toplevel_bindings_p ())
11308 /* At the global level, if these are all identifiers,
11309 then it is a parmlist. */
11312 if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11314 exprs = TREE_CHAIN (exprs);
11321 /* Subroutine of start_function. Ensure that each of the parameter
11322 types (as listed in PARMS) is complete, as is required for a
11323 function definition. */
11326 require_complete_types_for_parms (parms)
11329 for (; parms; parms = TREE_CHAIN (parms))
11331 tree type = TREE_TYPE (parms);
11333 /* Try to complete the TYPE. */
11334 type = complete_type (type);
11336 if (type == error_mark_node)
11339 if (TYPE_SIZE (type) == NULL_TREE)
11341 if (DECL_NAME (parms))
11342 error ("parameter `%s' has incomplete type",
11343 IDENTIFIER_POINTER (DECL_NAME (parms)));
11345 error ("parameter has incomplete type");
11346 TREE_TYPE (parms) = error_mark_node;
11349 layout_decl (parms, 0);
11353 /* Returns non-zero if T is a local variable. */
11356 local_variable_p (t)
11359 if ((TREE_CODE (t) == VAR_DECL
11360 /* A VAR_DECL with a context that is a _TYPE is a static data
11362 && !TYPE_P (CP_DECL_CONTEXT (t))
11363 /* Any other non-local variable must be at namespace scope. */
11364 && !DECL_NAMESPACE_SCOPE_P (t))
11365 || (TREE_CODE (t) == PARM_DECL))
11371 /* Returns non-zero if T is an automatic local variable or a label.
11372 (These are the declarations that need to be remapped when the code
11373 containing them is duplicated.) */
11376 nonstatic_local_decl_p (t)
11379 return ((local_variable_p (t) && !TREE_STATIC (t))
11380 || TREE_CODE (t) == LABEL_DECL
11381 || TREE_CODE (t) == RESULT_DECL);
11384 /* Like local_variable_p, but suitable for use as a tree-walking
11388 local_variable_p_walkfn (tp, walk_subtrees, data)
11390 int *walk_subtrees ATTRIBUTE_UNUSED;
11391 void *data ATTRIBUTE_UNUSED;
11393 return ((local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp))
11394 ? *tp : NULL_TREE);
11397 /* Check that ARG, which is a default-argument expression for a
11398 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11399 something goes wrong. DECL may also be a _TYPE node, rather than a
11400 DECL, if there is no DECL available. */
11403 check_default_argument (decl, arg)
11410 if (TREE_CODE (arg) == DEFAULT_ARG)
11411 /* We get a DEFAULT_ARG when looking at an in-class declaration
11412 with a default argument. Ignore the argument for now; we'll
11413 deal with it after the class is complete. */
11416 if (processing_template_decl || uses_template_parms (arg))
11417 /* We don't do anything checking until instantiation-time. Note
11418 that there may be uninstantiated arguments even for an
11419 instantiated function, since default arguments are not
11420 instantiated until they are needed. */
11429 decl_type = TREE_TYPE (decl);
11431 if (arg == error_mark_node
11432 || decl == error_mark_node
11433 || TREE_TYPE (arg) == error_mark_node
11434 || decl_type == error_mark_node)
11435 /* Something already went wrong. There's no need to check
11437 return error_mark_node;
11439 /* [dcl.fct.default]
11441 A default argument expression is implicitly converted to the
11443 if (!TREE_TYPE (arg)
11444 || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11447 cp_error ("default argument for `%#D' has type `%T'",
11448 decl, TREE_TYPE (arg));
11450 cp_error ("default argument for parameter of type `%T' has type `%T'",
11451 decl_type, TREE_TYPE (arg));
11453 return error_mark_node;
11456 /* [dcl.fct.default]
11458 Local variables shall not be used in default argument
11461 The keyword `this' shall not be used in a default argument of a
11462 member function. */
11463 var = walk_tree (&arg, local_variable_p_walkfn, NULL);
11466 cp_error ("default argument `%E' uses local variable `%D'",
11468 return error_mark_node;
11475 /* Decode the list of parameter types for a function type.
11476 Given the list of things declared inside the parens,
11477 return a list of types.
11479 The list we receive can have three kinds of elements:
11480 an IDENTIFIER_NODE for names given without types,
11481 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11482 or void_type_node, to mark the end of an argument list
11483 when additional arguments are not permitted (... was not used).
11485 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11486 a mere declaration. A nonempty identifier-list gets an error message
11487 when FUNCDEF_FLAG is zero.
11488 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11489 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11491 If all elements of the input list contain types,
11492 we return a list of the types.
11493 If all elements contain no type (except perhaps a void_type_node
11494 at the end), we return a null list.
11495 If some have types and some do not, it is an error, and we
11496 return a null list.
11498 Also set last_function_parms to either
11499 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11500 A list of names is converted to a chain of PARM_DECLs
11501 by store_parm_decls so that ultimately it is always a chain of decls.
11503 Note that in C++, parameters can take default values. These default
11504 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11505 an error to specify default values which are followed by parameters
11506 that have no default values, or an ELLIPSES. For simplicities sake,
11507 only parameters which are specified with their types can take on
11511 grokparms (first_parm, funcdef_flag)
11515 tree result = NULL_TREE;
11516 tree decls = NULL_TREE;
11518 if (first_parm != NULL_TREE
11519 && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE)
11521 if (! funcdef_flag)
11522 pedwarn ("parameter names (without types) in function declaration");
11523 last_function_parms = first_parm;
11526 else if (first_parm != NULL_TREE
11527 && TREE_CODE (TREE_VALUE (first_parm)) != TREE_LIST
11528 && TREE_CODE (TREE_VALUE (first_parm)) != VOID_TYPE)
11529 my_friendly_abort (145);
11532 /* Types were specified. This is a list of declarators
11533 each represented as a TREE_LIST node. */
11534 register tree parm, chain;
11535 int any_init = 0, any_error = 0;
11537 if (first_parm != NULL_TREE)
11539 tree last_result = NULL_TREE;
11540 tree last_decl = NULL_TREE;
11542 for (parm = first_parm; parm != NULL_TREE; parm = chain)
11544 tree type = NULL_TREE, list_node = parm;
11545 register tree decl = TREE_VALUE (parm);
11546 tree init = TREE_PURPOSE (parm);
11548 chain = TREE_CHAIN (parm);
11549 /* @@ weak defense against parse errors. */
11550 if (TREE_CODE (decl) != VOID_TYPE
11551 && TREE_CODE (decl) != TREE_LIST)
11553 /* Give various messages as the need arises. */
11554 if (TREE_CODE (decl) == STRING_CST)
11555 cp_error ("invalid string constant `%E'", decl);
11556 else if (TREE_CODE (decl) == INTEGER_CST)
11557 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11561 if (TREE_CODE (decl) != VOID_TYPE)
11563 decl = grokdeclarator (TREE_VALUE (decl),
11564 TREE_PURPOSE (decl),
11565 PARM, init != NULL_TREE,
11567 if (! decl || TREE_TYPE (decl) == error_mark_node)
11570 /* Top-level qualifiers on the parameters are
11571 ignored for function types. */
11572 type = TYPE_MAIN_VARIANT (TREE_TYPE (decl));
11574 if (TREE_CODE (type) == VOID_TYPE)
11575 decl = void_type_node;
11576 else if (TREE_CODE (type) == METHOD_TYPE)
11578 if (DECL_NAME (decl))
11579 /* Cannot use the decl here because
11580 we don't have DECL_CONTEXT set up yet. */
11581 cp_error ("parameter `%D' invalidly declared method type",
11584 error ("parameter invalidly declared method type");
11585 type = build_pointer_type (type);
11586 TREE_TYPE (decl) = type;
11588 else if (TREE_CODE (type) == OFFSET_TYPE)
11590 if (DECL_NAME (decl))
11591 cp_error ("parameter `%D' invalidly declared offset type",
11594 error ("parameter invalidly declared offset type");
11595 type = build_pointer_type (type);
11596 TREE_TYPE (decl) = type;
11598 else if (abstract_virtuals_error (decl, type))
11599 any_error = 1; /* Seems like a good idea. */
11600 else if (POINTER_TYPE_P (type))
11603 while (POINTER_TYPE_P (t)
11604 || (TREE_CODE (t) == ARRAY_TYPE
11605 && TYPE_DOMAIN (t) != NULL_TREE))
11607 if (TREE_CODE (t) == ARRAY_TYPE)
11608 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11610 TYPE_PTR_P (type) ? "pointer" : "reference");
11614 if (TREE_CODE (decl) == VOID_TYPE)
11616 if (result == NULL_TREE)
11618 result = void_list_node;
11619 last_result = result;
11623 TREE_CHAIN (last_result) = void_list_node;
11624 last_result = void_list_node;
11627 && (chain != void_list_node || TREE_CHAIN (chain)))
11628 error ("`void' in parameter list must be entire list");
11632 /* Since there is a prototype, args are passed in their own types. */
11633 DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
11634 if (PROMOTE_PROTOTYPES
11635 && (TREE_CODE (type) == INTEGER_TYPE
11636 || TREE_CODE (type) == ENUMERAL_TYPE)
11637 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
11638 DECL_ARG_TYPE (decl) = integer_type_node;
11639 if (!any_error && init)
11642 init = check_default_argument (decl, init);
11647 if (decls == NULL_TREE)
11654 TREE_CHAIN (last_decl) = decl;
11657 list_node = tree_cons (init, type, NULL_TREE);
11658 if (result == NULL_TREE)
11660 result = list_node;
11661 last_result = result;
11665 TREE_CHAIN (last_result) = list_node;
11666 last_result = list_node;
11670 TREE_CHAIN (last_result) = NULL_TREE;
11671 /* If there are no parameters, and the function does not end
11672 with `...', then last_decl will be NULL_TREE. */
11673 if (last_decl != NULL_TREE)
11674 TREE_CHAIN (last_decl) = NULL_TREE;
11678 last_function_parms = decls;
11683 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11684 FUNCTION_TYPE with the newly parsed version of its default argument, which
11685 was previously digested as text. See snarf_defarg et al in lex.c. */
11688 replace_defarg (arg, init)
11691 if (! processing_template_decl
11692 && ! can_convert_arg (TREE_VALUE (arg), TREE_TYPE (init), init))
11693 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11694 TREE_TYPE (init), TREE_VALUE (arg));
11695 TREE_PURPOSE (arg) = init;
11702 tree t = FUNCTION_ARG_CHAIN (d);
11703 if (DECL_CONSTRUCTOR_P (d)
11704 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d)))
11705 t = TREE_CHAIN (t);
11706 if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
11707 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t)))
11708 == DECL_CLASS_CONTEXT (d))
11709 && (TREE_CHAIN (t) == NULL_TREE
11710 || TREE_CHAIN (t) == void_list_node
11711 || TREE_PURPOSE (TREE_CHAIN (t))))
11716 /* These memoizing functions keep track of special properties which
11717 a class may have. `grok_ctor_properties' notices whether a class
11718 has a constructor of the form X(X&), and also complains
11719 if the class has a constructor of the form X(X).
11720 `grok_op_properties' takes notice of the various forms of
11721 operator= which are defined, as well as what sorts of type conversion
11722 may apply. Both functions take a FUNCTION_DECL as an argument. */
11725 grok_ctor_properties (ctype, decl)
11728 tree parmtypes = FUNCTION_ARG_CHAIN (decl);
11729 tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
11731 /* When a type has virtual baseclasses, a magical first int argument is
11732 added to any ctor so we can tell if the class has been initialized
11733 yet. This could screw things up in this function, so we deliberately
11734 ignore the leading int if we're in that situation. */
11735 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype))
11737 my_friendly_assert (parmtypes
11738 && TREE_VALUE (parmtypes) == integer_type_node,
11740 parmtypes = TREE_CHAIN (parmtypes);
11741 parmtype = TREE_VALUE (parmtypes);
11746 A non-template constructor for class X is a copy constructor if
11747 its first parameter is of type X&, const X&, volatile X& or const
11748 volatile X&, and either there are no other parameters or else all
11749 other parameters have default arguments. */
11750 if (TREE_CODE (parmtype) == REFERENCE_TYPE
11751 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype
11752 && (TREE_CHAIN (parmtypes) == NULL_TREE
11753 || TREE_CHAIN (parmtypes) == void_list_node
11754 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11755 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11756 && is_member_template (DECL_TI_TEMPLATE (decl))))
11758 TYPE_HAS_INIT_REF (ctype) = 1;
11759 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11760 TYPE_HAS_CONST_INIT_REF (ctype) = 1;
11764 A declaration of a constructor for a class X is ill-formed if its
11765 first parameter is of type (optionally cv-qualified) X and either
11766 there are no other parameters or else all other parameters have
11769 We *don't* complain about member template instantiations that
11770 have this form, though; they can occur as we try to decide what
11771 constructor to use during overload resolution. Since overload
11772 resolution will never prefer such a constructor to the
11773 non-template copy constructor (which is either explicitly or
11774 implicitly defined), there's no need to worry about their
11775 existence. Theoretically, they should never even be
11776 instantiated, but that's hard to forestall. */
11777 else if (TYPE_MAIN_VARIANT (parmtype) == ctype
11778 && (TREE_CHAIN (parmtypes) == NULL_TREE
11779 || TREE_CHAIN (parmtypes) == void_list_node
11780 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11781 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11782 && is_member_template (DECL_TI_TEMPLATE (decl))))
11784 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11786 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
11789 else if (TREE_CODE (parmtype) == VOID_TYPE
11790 || TREE_PURPOSE (parmtypes) != NULL_TREE)
11791 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1;
11796 /* An operator with this name can be either unary or binary. */
11802 return (name == ansi_opname [(int) INDIRECT_REF]
11803 || name == ansi_opname [(int) ADDR_EXPR]
11804 || name == ansi_opname [(int) NEGATE_EXPR]
11805 || name == ansi_opname[(int) POSTINCREMENT_EXPR]
11806 || name == ansi_opname[(int) POSTDECREMENT_EXPR]
11807 || name == ansi_opname [(int) CONVERT_EXPR]);
11810 /* An operator with this name can only be unary. */
11816 return (name == ansi_opname [(int) TRUTH_NOT_EXPR]
11817 || name == ansi_opname [(int) BIT_NOT_EXPR]
11818 || name == ansi_opname [(int) COMPONENT_REF]
11819 || IDENTIFIER_TYPENAME_P (name));
11822 /* Do a little sanity-checking on how they declared their operator. */
11825 grok_op_properties (decl, virtualp, friendp)
11827 int virtualp, friendp;
11829 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
11830 int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
11831 tree name = DECL_NAME (decl);
11833 if (current_class_type == NULL_TREE)
11840 A user-declared copy assignment operator X::operator= is a
11841 non-static non-template member function of class X with
11842 exactly one parameter of type X, X&, const X&, volatile X& or
11843 const volatile X&. */
11844 if (name == ansi_opname[(int) MODIFY_EXPR]
11845 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11846 && is_member_template (DECL_TI_TEMPLATE (decl))))
11848 else if (name == ansi_opname[(int) CALL_EXPR])
11849 TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
11850 else if (name == ansi_opname[(int) ARRAY_REF])
11851 TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
11852 else if (name == ansi_opname[(int) COMPONENT_REF]
11853 || name == ansi_opname[(int) MEMBER_REF])
11854 TYPE_OVERLOADS_ARROW (current_class_type) = 1;
11855 else if (name == ansi_opname[(int) NEW_EXPR])
11856 TYPE_GETS_NEW (current_class_type) |= 1;
11857 else if (name == ansi_opname[(int) DELETE_EXPR])
11858 TYPE_GETS_DELETE (current_class_type) |= 1;
11859 else if (name == ansi_opname[(int) VEC_NEW_EXPR])
11860 TYPE_GETS_NEW (current_class_type) |= 2;
11861 else if (name == ansi_opname[(int) VEC_DELETE_EXPR])
11862 TYPE_GETS_DELETE (current_class_type) |= 2;
11865 if (name == ansi_opname[(int) NEW_EXPR]
11866 || name == ansi_opname[(int) VEC_NEW_EXPR])
11868 /* When the compiler encounters the definition of A::operator new, it
11869 doesn't look at the class declaration to find out if it's static. */
11871 revert_static_member_fn (&decl, NULL, NULL);
11873 /* Take care of function decl if we had syntax errors. */
11874 if (argtypes == NULL_TREE)
11876 = build_function_type (ptr_type_node,
11877 hash_tree_chain (integer_type_node,
11880 TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
11882 else if (name == ansi_opname[(int) DELETE_EXPR]
11883 || name == ansi_opname[(int) VEC_DELETE_EXPR])
11886 revert_static_member_fn (&decl, NULL, NULL);
11888 if (argtypes == NULL_TREE)
11890 = build_function_type (void_type_node,
11891 hash_tree_chain (ptr_type_node,
11895 TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
11897 if (! friendp && name == ansi_opname[(int) VEC_DELETE_EXPR]
11898 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)))
11899 != void_list_node))
11900 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type) = 1;
11905 /* An operator function must either be a non-static member function
11906 or have at least one parameter of a class, a reference to a class,
11907 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11908 if (! methodp || DECL_STATIC_FUNCTION_P (decl))
11910 if (IDENTIFIER_TYPENAME_P (name)
11911 || name == ansi_opname[(int) CALL_EXPR]
11912 || name == ansi_opname[(int) MODIFY_EXPR]
11913 || name == ansi_opname[(int) COMPONENT_REF]
11914 || name == ansi_opname[(int) ARRAY_REF])
11915 cp_error ("`%D' must be a nonstatic member function", decl);
11920 if (DECL_STATIC_FUNCTION_P (decl))
11921 cp_error ("`%D' must be either a non-static member function or a non-member function", decl);
11924 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
11926 tree arg = TREE_VALUE (p);
11927 if (TREE_CODE (arg) == REFERENCE_TYPE)
11928 arg = TREE_TYPE (arg);
11930 /* This lets bad template code slip through. */
11931 if (IS_AGGR_TYPE (arg)
11932 || TREE_CODE (arg) == ENUMERAL_TYPE
11933 || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
11934 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
11938 ("`%D' must have an argument of class or enumerated type",
11945 if (name == ansi_opname[(int) CALL_EXPR])
11946 return; /* No restrictions on args. */
11948 if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
11950 tree t = TREE_TYPE (name);
11951 if (TREE_CODE (t) == VOID_TYPE)
11952 pedwarn ("void is not a valid type conversion operator");
11953 else if (! friendp)
11955 int ref = (TREE_CODE (t) == REFERENCE_TYPE);
11956 const char *what = 0;
11958 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
11960 if (t == current_class_type)
11961 what = "the same type";
11962 /* Don't force t to be complete here. */
11963 else if (IS_AGGR_TYPE (t)
11965 && DERIVED_FROM_P (t, current_class_type))
11966 what = "a base class";
11969 warning ("conversion to %s%s will never use a type conversion operator",
11970 ref ? "a reference to " : "", what);
11974 if (name == ansi_opname[(int) MODIFY_EXPR])
11978 if (list_length (argtypes) != 3 && methodp)
11980 cp_error ("`%D' must take exactly one argument", decl);
11983 parmtype = TREE_VALUE (TREE_CHAIN (argtypes));
11985 if (copy_assignment_arg_p (parmtype, virtualp)
11988 TYPE_HAS_ASSIGN_REF (current_class_type) = 1;
11989 if (TREE_CODE (parmtype) != REFERENCE_TYPE
11990 || CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11991 TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1;
11994 else if (name == ansi_opname[(int) COND_EXPR])
11997 cp_error ("ANSI C++ prohibits overloading operator ?:");
11999 else if (ambi_op_p (name))
12001 if (list_length (argtypes) == 2)
12003 else if (list_length (argtypes) == 3)
12005 if ((name == ansi_opname[(int) POSTINCREMENT_EXPR]
12006 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
12007 && ! processing_template_decl
12008 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
12011 cp_error ("postfix `%D' must take `int' as its argument",
12015 ("postfix `%D' must take `int' as its second argument",
12022 cp_error ("`%D' must take either zero or one argument", decl);
12024 cp_error ("`%D' must take either one or two arguments", decl);
12027 /* More Effective C++ rule 6. */
12029 && (name == ansi_opname[(int) POSTINCREMENT_EXPR]
12030 || name == ansi_opname[(int) POSTDECREMENT_EXPR]))
12032 tree arg = TREE_VALUE (argtypes);
12033 tree ret = TREE_TYPE (TREE_TYPE (decl));
12034 if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
12035 arg = TREE_TYPE (arg);
12036 arg = TYPE_MAIN_VARIANT (arg);
12037 if (list_length (argtypes) == 2)
12039 if (TREE_CODE (ret) != REFERENCE_TYPE
12040 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
12042 cp_warning ("prefix `%D' should return `%T'", decl,
12043 build_reference_type (arg));
12047 if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
12048 cp_warning ("postfix `%D' should return `%T'", decl, arg);
12052 else if (unary_op_p (name))
12054 if (list_length (argtypes) != 2)
12057 cp_error ("`%D' must take `void'", decl);
12059 cp_error ("`%D' must take exactly one argument", decl);
12062 else /* if (binary_op_p (name)) */
12064 if (list_length (argtypes) != 3)
12067 cp_error ("`%D' must take exactly one argument", decl);
12069 cp_error ("`%D' must take exactly two arguments", decl);
12072 /* More Effective C++ rule 7. */
12074 && (name == ansi_opname [TRUTH_ANDIF_EXPR]
12075 || name == ansi_opname [TRUTH_ORIF_EXPR]
12076 || name == ansi_opname [COMPOUND_EXPR]))
12077 cp_warning ("user-defined `%D' always evaluates both arguments",
12081 /* Effective C++ rule 23. */
12083 && list_length (argtypes) == 3
12084 && (name == ansi_opname [PLUS_EXPR]
12085 || name == ansi_opname [MINUS_EXPR]
12086 || name == ansi_opname [TRUNC_DIV_EXPR]
12087 || name == ansi_opname [MULT_EXPR])
12088 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
12089 cp_warning ("`%D' should return by value", decl);
12093 for (; argtypes != void_list_node ; argtypes = TREE_CHAIN (argtypes))
12094 if (TREE_PURPOSE (argtypes))
12096 TREE_PURPOSE (argtypes) = NULL_TREE;
12097 if (name == ansi_opname[(int) POSTINCREMENT_EXPR]
12098 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
12101 cp_pedwarn ("`%D' cannot have default arguments", decl);
12104 cp_error ("`%D' cannot have default arguments", decl);
12109 static const char *
12111 enum tag_types code;
12124 my_friendly_abort (981122);
12128 /* Get the struct, enum or union (CODE says which) with tag NAME.
12129 Define the tag as a forward-reference if it is not defined.
12131 C++: If a class derivation is given, process it here, and report
12132 an error if multiple derivation declarations are not identical.
12134 If this is a definition, come in through xref_tag and only look in
12135 the current frame for the name (since C++ allows new names in any
12139 xref_tag (code_type_node, name, globalize)
12140 tree code_type_node;
12144 enum tag_types tag_code;
12145 enum tree_code code;
12146 register tree ref, t;
12147 struct binding_level *b = current_binding_level;
12149 tree attributes = NULL_TREE;
12150 tree context = NULL_TREE;
12152 /* If we are called from the parser, code_type_node will sometimes be a
12153 TREE_LIST. This indicates that the user wrote
12154 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12156 if (TREE_CODE (code_type_node) == TREE_LIST)
12158 attributes = TREE_PURPOSE (code_type_node);
12159 code_type_node = TREE_VALUE (code_type_node);
12162 tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
12167 code = RECORD_TYPE;
12173 code = ENUMERAL_TYPE;
12176 my_friendly_abort (18);
12179 /* If a cross reference is requested, look up the type
12180 already defined for this tag and return it. */
12181 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
12184 name = TYPE_IDENTIFIER (t);
12188 t = IDENTIFIER_TYPE_VALUE (name);
12190 if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12191 && TREE_CODE (t) != TEMPLATE_TEMPLATE_PARM)
12196 /* If we know we are defining this tag, only look it up in
12197 this scope and don't try to find it as a type. */
12198 ref = lookup_tag (code, name, b, 1);
12204 /* [dcl.type.elab] If the identifier resolves to a
12205 typedef-name or a template type-parameter, the
12206 elaborated-type-specifier is ill-formed. */
12207 if (t != TYPE_MAIN_VARIANT (t)
12208 || (CLASS_TYPE_P (t) && TYPE_WAS_ANONYMOUS (t)))
12209 cp_pedwarn ("using typedef-name `%D' after `%s'",
12210 TYPE_NAME (t), tag_name (tag_code));
12211 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
12212 cp_error ("using template type parameter `%T' after `%s'",
12213 t, tag_name (tag_code));
12218 ref = lookup_tag (code, name, b, 0);
12222 /* Try finding it as a type declaration. If that wins,
12224 ref = lookup_name (name, 1);
12226 if (ref != NULL_TREE
12227 && processing_template_decl
12228 && DECL_CLASS_TEMPLATE_P (ref)
12229 && template_class_depth (current_class_type) == 0)
12230 /* Since GLOBALIZE is true, we're declaring a global
12231 template, so we want this type. */
12232 ref = DECL_RESULT (ref);
12234 if (ref && TREE_CODE (ref) == TYPE_DECL
12235 && TREE_CODE (TREE_TYPE (ref)) == code)
12236 ref = TREE_TYPE (ref);
12241 if (ref && current_class_type
12242 && template_class_depth (current_class_type)
12243 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12245 /* Since GLOBALIZE is non-zero, we are not looking at a
12246 definition of this tag. Since, in addition, we are currently
12247 processing a (member) template declaration of a template
12248 class, we must be very careful; consider:
12255 { template <class V>
12256 friend struct S1; };
12258 Here, the S2::S1 declaration should not be confused with the
12259 outer declaration. In particular, the inner version should
12260 have a template parameter of level 2, not level 1. This
12261 would be particularly important if the member declaration
12264 template <class V = U> friend struct S1;
12266 say, when we should tsubst into `U' when instantiating
12267 S2. On the other hand, when presented with:
12277 we must find the inner binding eventually. We
12278 accomplish this by making sure that the new type we
12279 create to represent this declaration has the right
12281 context = TYPE_CONTEXT (ref);
12288 /* If no such tag is yet defined, create a forward-reference node
12289 and record it as the "definition".
12290 When a real declaration of this type is found,
12291 the forward-reference will be altered into a real type. */
12292 if (code == ENUMERAL_TYPE)
12294 cp_error ("use of enum `%#D' without previous declaration", name);
12296 ref = make_node (ENUMERAL_TYPE);
12298 /* Give the type a default layout like unsigned int
12299 to avoid crashing if it does not get defined. */
12300 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12301 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12302 TREE_UNSIGNED (ref) = 1;
12303 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12304 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12305 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12307 /* Enable us to recognize when a type is created in class context.
12308 To do nested classes correctly, this should probably be cleared
12309 out when we leave this classes scope. Currently this in only
12310 done in `start_enum'. */
12312 pushtag (name, ref, globalize);
12316 struct binding_level *old_b = class_binding_level;
12318 ref = make_aggr_type (code);
12319 TYPE_CONTEXT (ref) = context;
12321 #ifdef NONNESTED_CLASSES
12322 /* Class types don't nest the way enums do. */
12323 class_binding_level = (struct binding_level *)0;
12325 pushtag (name, ref, globalize);
12326 class_binding_level = old_b;
12331 /* If it no longer looks like a nested type, make sure it's
12333 If it is not an IDENTIFIER, this is not a declaration */
12334 if (b->namespace_p && !class_binding_level
12335 && TREE_CODE (name) == IDENTIFIER_NODE
12336 && IDENTIFIER_NAMESPACE_VALUE (name) == NULL_TREE)
12337 SET_IDENTIFIER_NAMESPACE_VALUE (name, TYPE_NAME (ref));
12339 if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12340 redeclare_class_template (ref, current_template_parms);
12343 /* Until the type is defined, tentatively accept whatever
12344 structure tag the user hands us. */
12345 if (TYPE_SIZE (ref) == NULL_TREE
12346 && ref != current_class_type
12347 /* Have to check this, in case we have contradictory tag info. */
12348 && IS_AGGR_TYPE_CODE (TREE_CODE (ref)))
12350 if (tag_code == class_type)
12351 CLASSTYPE_DECLARED_CLASS (ref) = 1;
12352 else if (tag_code == record_type)
12353 CLASSTYPE_DECLARED_CLASS (ref) = 0;
12356 TREE_TYPE (ref) = attributes;
12362 xref_tag_from_type (old, id, globalize)
12366 tree code_type_node;
12368 if (TREE_CODE (old) == RECORD_TYPE)
12369 code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12370 ? class_type_node : record_type_node);
12372 code_type_node = union_type_node;
12374 if (id == NULL_TREE)
12375 id = TYPE_IDENTIFIER (old);
12377 return xref_tag (code_type_node, id, globalize);
12380 /* REF is a type (named NAME), for which we have just seen some
12381 baseclasses. BINFO is a list of those baseclasses; the
12382 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12383 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12384 struct, or union. */
12387 xref_basetypes (code_type_node, name, ref, binfo)
12388 tree code_type_node;
12392 /* In the declaration `A : X, Y, ... Z' we mark all the types
12393 (A, X, Y, ..., Z) so we can check for duplicates. */
12398 enum tag_types tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
12400 if (tag_code == union_type)
12402 cp_error ("derived union `%T' invalid", ref);
12406 len = list_length (binfo);
12408 /* First, make sure that any templates in base-classes are
12409 instantiated. This ensures that if we call ourselves recursively
12410 we do not get confused about which classes are marked and which
12412 for (base = binfo; base; base = TREE_CHAIN (base))
12413 complete_type (TREE_VALUE (base));
12415 SET_CLASSTYPE_MARKED (ref);
12416 BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
12418 for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
12420 /* The base of a derived struct is public by default. */
12422 = (TREE_PURPOSE (binfo) == access_public_node
12423 || TREE_PURPOSE (binfo) == access_public_virtual_node
12424 || (tag_code != class_type
12425 && (TREE_PURPOSE (binfo) == access_default_node
12426 || TREE_PURPOSE (binfo) == access_default_virtual_node)));
12428 = (TREE_PURPOSE (binfo) == access_protected_node
12429 || TREE_PURPOSE (binfo) == access_protected_virtual_node);
12431 = (TREE_PURPOSE (binfo) == access_private_virtual_node
12432 || TREE_PURPOSE (binfo) == access_protected_virtual_node
12433 || TREE_PURPOSE (binfo) == access_public_virtual_node
12434 || TREE_PURPOSE (binfo) == access_default_virtual_node);
12435 tree basetype = TREE_VALUE (binfo);
12438 if (basetype && TREE_CODE (basetype) == TYPE_DECL)
12439 basetype = TREE_TYPE (basetype);
12441 || (TREE_CODE (basetype) != RECORD_TYPE
12442 && TREE_CODE (basetype) != TYPENAME_TYPE
12443 && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
12444 && TREE_CODE (basetype) != TEMPLATE_TEMPLATE_PARM))
12446 cp_error ("base type `%T' fails to be a struct or class type",
12447 TREE_VALUE (binfo));
12451 GNU_xref_hier (name, basetype, via_public, via_virtual, 0);
12453 /* This code replaces similar code in layout_basetypes.
12454 We put the complete_type first for implicit `typename'. */
12455 if (TYPE_SIZE (basetype) == NULL_TREE
12456 && ! (current_template_parms && uses_template_parms (basetype)))
12458 cp_error ("base class `%T' has incomplete type", basetype);
12463 if (CLASSTYPE_MARKED (basetype))
12465 if (basetype == ref)
12466 cp_error ("recursive type `%T' undefined", basetype);
12468 cp_error ("duplicate base type `%T' invalid", basetype);
12472 if (TYPE_FOR_JAVA (basetype)
12473 && (current_lang_stack
12474 == &VARRAY_TREE (current_lang_base, 0)))
12475 TYPE_FOR_JAVA (ref) = 1;
12477 /* Note that the BINFO records which describe individual
12478 inheritances are *not* shared in the lattice! They
12479 cannot be shared because a given baseclass may be
12480 inherited with different `accessibility' by different
12481 derived classes. (Each BINFO record describing an
12482 individual inheritance contains flags which say what
12483 the `accessibility' of that particular inheritance is.) */
12486 = make_binfo (integer_zero_node, basetype,
12487 CLASS_TYPE_P (basetype)
12488 ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
12489 CLASS_TYPE_P (basetype)
12490 ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
12492 TREE_VEC_ELT (binfos, i) = base_binfo;
12493 TREE_VIA_PUBLIC (base_binfo) = via_public;
12494 TREE_VIA_PROTECTED (base_binfo) = via_protected;
12495 TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
12496 BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
12498 /* We need to unshare the binfos now so that lookups during class
12499 definition work. */
12500 unshare_base_binfos (base_binfo);
12502 SET_CLASSTYPE_MARKED (basetype);
12504 /* We are free to modify these bits because they are meaningless
12505 at top level, and BASETYPE is a top-level type. */
12506 if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
12508 TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
12509 /* Converting to a virtual base class requires looking
12510 up the offset of the virtual base. */
12511 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
12514 if (CLASS_TYPE_P (basetype))
12516 TYPE_GETS_NEW (ref) |= TYPE_GETS_NEW (basetype);
12517 TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
12518 /* If the base-class uses multiple inheritance, so do we. */
12519 TYPE_USES_MULTIPLE_INHERITANCE (ref)
12520 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype);
12521 /* Likewise, if converting to a base of the base may require
12522 code, then we may need to generate code to convert to a
12524 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref)
12525 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype);
12532 TREE_VEC_LENGTH (binfos) = i;
12534 BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
12538 TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
12539 /* If there is more than one non-empty they cannot be at the same
12541 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
12544 /* Unmark all the types. */
12546 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
12547 CLEAR_CLASSTYPE_MARKED (ref);
12549 /* Now that we know all the base-classes, set up the list of virtual
12551 get_vbase_types (ref);
12555 /* Begin compiling the definition of an enumeration type.
12556 NAME is its name (or null if anonymous).
12557 Returns the type object, as yet incomplete.
12558 Also records info about it so that build_enumerator
12559 may be used to declare the individual values as they are read. */
12565 register tree enumtype = NULL_TREE;
12566 struct binding_level *b = current_binding_level;
12568 /* If this is the real definition for a previous forward reference,
12569 fill in the contents in the same object that used to be the
12570 forward reference. */
12572 if (name != NULL_TREE)
12573 enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
12575 if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
12577 cp_error ("multiple definition of `%#T'", enumtype);
12578 cp_error_at ("previous definition here", enumtype);
12579 /* Clear out TYPE_VALUES, and start again. */
12580 TYPE_VALUES (enumtype) = NULL_TREE;
12584 enumtype = make_node (ENUMERAL_TYPE);
12585 pushtag (name, enumtype, 0);
12588 if (current_class_type)
12589 TREE_ADDRESSABLE (b->tags) = 1;
12591 GNU_xref_decl (current_function_decl, enumtype);
12595 /* After processing and defining all the values of an enumeration type,
12596 install their decls in the enumeration type and finish it off.
12597 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12598 Returns ENUMTYPE. */
12601 finish_enum (enumtype)
12604 register tree minnode = NULL_TREE, maxnode = NULL_TREE;
12605 /* Calculate the maximum value of any enumerator in this type. */
12607 tree values = TYPE_VALUES (enumtype);
12612 for (pair = values; pair; pair = TREE_CHAIN (pair))
12617 /* The TREE_VALUE is a CONST_DECL for this enumeration
12619 decl = TREE_VALUE (pair);
12623 Following the closing brace of an enum-specifier, each
12624 enumerator has the type of its enumeration. Prior to the
12625 closing brace, the type of each enumerator is the type of
12626 its initializing value. */
12627 TREE_TYPE (decl) = enumtype;
12629 /* The DECL_INITIAL will be NULL if we are processing a
12630 template declaration and this enumeration constant had no
12631 explicit initializer. */
12632 value = DECL_INITIAL (decl);
12633 if (value && !processing_template_decl)
12635 /* Set the TREE_TYPE for the VALUE as well. That's so
12636 that when we call decl_constant_value we get an
12637 entity of the right type (but with the constant
12638 value). Since we shouldn't ever call
12639 decl_constant_value on a template type, there's no
12640 reason to do that when processing_template_decl.
12641 And, if the expression is something like a
12642 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12643 wreak havoc on the intended type of the expression.
12645 Of course, there's also no point in trying to compute
12646 minimum or maximum values if we're in a template. */
12647 TREE_TYPE (value) = enumtype;
12650 minnode = maxnode = value;
12651 else if (tree_int_cst_lt (maxnode, value))
12653 else if (tree_int_cst_lt (value, minnode))
12657 if (processing_template_decl)
12658 /* If this is just a template, leave the CONST_DECL
12659 alone. That way tsubst_copy will find CONST_DECLs for
12660 CONST_DECLs, and not INTEGER_CSTs. */
12663 /* In the list we're building up, we want the enumeration
12664 values, not the CONST_DECLs. */
12665 TREE_VALUE (pair) = value;
12669 maxnode = minnode = integer_zero_node;
12671 TYPE_VALUES (enumtype) = nreverse (values);
12673 if (processing_template_decl)
12675 tree scope = current_scope ();
12676 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12677 add_tree (build_min (TAG_DEFN, enumtype));
12681 int unsignedp = tree_int_cst_sgn (minnode) >= 0;
12682 int lowprec = min_precision (minnode, unsignedp);
12683 int highprec = min_precision (maxnode, unsignedp);
12684 int precision = MAX (lowprec, highprec);
12687 TYPE_SIZE (enumtype) = NULL_TREE;
12689 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12691 TYPE_PRECISION (enumtype) = precision;
12693 fixup_unsigned_type (enumtype);
12695 fixup_signed_type (enumtype);
12697 if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
12698 /* Use the width of the narrowest normal C type which is wide
12700 TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
12703 TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
12705 TYPE_SIZE (enumtype) = 0;
12706 layout_type (enumtype);
12708 /* Fix up all variant types of this enum type. */
12709 for (tem = TYPE_MAIN_VARIANT (enumtype); tem;
12710 tem = TYPE_NEXT_VARIANT (tem))
12712 TYPE_VALUES (tem) = TYPE_VALUES (enumtype);
12713 TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype);
12714 TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype);
12715 TYPE_SIZE (tem) = TYPE_SIZE (enumtype);
12716 TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype);
12717 TYPE_MODE (tem) = TYPE_MODE (enumtype);
12718 TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype);
12719 TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype);
12720 TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype);
12723 /* Finish debugging output for this type. */
12724 rest_of_type_compilation (enumtype, namespace_bindings_p ());
12730 /* Build and install a CONST_DECL for an enumeration constant of the
12731 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
12732 Assignment of sequential values by default is handled here. */
12735 build_enumerator (name, value, enumtype)
12745 /* Remove no-op casts from the value. */
12747 STRIP_TYPE_NOPS (value);
12749 if (! processing_template_decl)
12751 /* Validate and default VALUE. */
12752 if (value != NULL_TREE)
12754 if (TREE_READONLY_DECL_P (value))
12755 value = decl_constant_value (value);
12757 if (TREE_CODE (value) == INTEGER_CST)
12759 value = default_conversion (value);
12760 constant_expression_warning (value);
12764 cp_error ("enumerator value for `%D' not integer constant", name);
12769 /* Default based on previous value. */
12770 if (value == NULL_TREE && ! processing_template_decl)
12774 if (TYPE_VALUES (enumtype))
12776 /* The next value is the previous value ... */
12777 prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype)));
12778 /* ... plus one. */
12779 value = build_binary_op_nodefault (PLUS_EXPR,
12784 if (tree_int_cst_lt (value, prev_value))
12785 cp_error ("overflow in enumeration values at `%D'", name);
12788 value = integer_zero_node;
12791 /* Remove no-op casts from the value. */
12793 STRIP_TYPE_NOPS (value);
12795 /* To fix MAX_VAL enum consts. (bkoz) */
12796 TREE_TYPE (value) = integer_type_node;
12800 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12801 Even in other cases, we will later (in finish_enum) be setting
12802 the type of VALUE. But, we don't need to make a copy if this
12803 VALUE is one of the enumeration constants for this same
12804 enumeration type. */
12805 for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values))
12806 if (TREE_VALUE (values) == value)
12808 /* If we didn't break out of the loop, then we do need a copy. */
12809 if (!values && value)
12810 value = copy_node (value);
12812 /* C++ associates enums with global, function, or class declarations. */
12813 context = current_scope ();
12815 /* Build the actual enumeration constant. Note that the enumeration
12816 constants have the type of their initializers until the
12817 enumeration is complete:
12821 Following the closing brace of an enum-specifier, each enumer-
12822 ator has the type of its enumeration. Prior to the closing
12823 brace, the type of each enumerator is the type of its
12824 initializing value.
12826 In finish_enum we will reset the type. Of course, if we're
12827 processing a template, there may be no value. */
12828 type = value ? TREE_TYPE (value) : NULL_TREE;
12830 if (context && context == current_class_type)
12831 /* This enum declaration is local to the class. We need the full
12832 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
12833 decl = build_lang_decl (CONST_DECL, name, type);
12835 /* It's a global enum, or it's local to a function. (Note local to
12836 a function could mean local to a class method. */
12837 decl = build_decl (CONST_DECL, name, type);
12839 DECL_CONTEXT (decl) = FROB_CONTEXT (context);
12840 DECL_INITIAL (decl) = value;
12841 TREE_READONLY (decl) = 1;
12843 if (context && context == current_class_type)
12844 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12845 on the TYPE_FIELDS list for `S'. (That's so that you can say
12846 things like `S::i' later.) */
12847 finish_member_declaration (decl);
12851 GNU_xref_decl (current_function_decl, decl);
12854 /* Add this enumeration constant to the list for this type. */
12855 TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype));
12859 static int function_depth;
12861 /* We're defining DECL. Make sure that it's type is OK. */
12864 check_function_type (decl)
12867 tree fntype = TREE_TYPE (decl);
12869 /* In a function definition, arg types must be complete. */
12870 require_complete_types_for_parms (current_function_parms);
12872 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype))) == NULL_TREE)
12874 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype));
12876 /* Make it return void instead, but don't change the
12877 type of the DECL_RESULT, in case we have a named return value. */
12878 if (TREE_CODE (fntype) == METHOD_TYPE)
12880 tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
12882 = build_cplus_method_type (ctype,
12884 FUNCTION_ARG_CHAIN (decl));
12888 = build_function_type (void_type_node,
12889 TYPE_ARG_TYPES (TREE_TYPE (decl)));
12891 = build_exception_variant (fntype,
12892 TYPE_RAISES_EXCEPTIONS (fntype));
12895 abstract_virtuals_error (decl, TREE_TYPE (fntype));
12898 /* Create the FUNCTION_DECL for a function definition.
12899 DECLSPECS and DECLARATOR are the parts of the declaration;
12900 they describe the function's name and the type it returns,
12901 but twisted together in a fashion that parallels the syntax of C.
12903 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12904 DECLARATOR is really the DECL for the function we are about to
12905 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12906 indicating that the function is an inline defined in-class, and
12907 SF_EXPAND indicating that we should generate RTL for this
12910 This function creates a binding context for the function body
12911 as well as setting up the FUNCTION_DECL in current_function_decl.
12913 Returns 1 on success. If the DECLARATOR is not suitable for a function
12914 (it defines a datum instead), we return 0, which tells
12915 yyparse to report a parse error.
12917 For C++, we must first check whether that datum makes any sense.
12918 For example, "class A local_a(1,2);" means that variable local_a
12919 is an aggregate of type A, which should have a constructor
12920 applied to it with the argument list [1, 2]. */
12923 start_function (declspecs, declarator, attrs, flags)
12924 tree declspecs, declarator, attrs;
12928 tree ctype = NULL_TREE;
12931 extern int have_extern_spec;
12932 extern int used_extern_spec;
12933 int doing_friend = 0;
12934 struct binding_level *bl;
12936 /* Sanity check. */
12937 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
12938 my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
12940 /* This should only be done once on the top most decl. */
12941 if (have_extern_spec && !used_extern_spec)
12943 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
12944 used_extern_spec = 1;
12947 if (flags & SF_PRE_PARSED)
12949 decl1 = declarator;
12951 fntype = TREE_TYPE (decl1);
12952 if (TREE_CODE (fntype) == METHOD_TYPE)
12953 ctype = TYPE_METHOD_BASETYPE (fntype);
12955 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12956 class is in the (lexical) scope of the class in which it is
12958 if (!ctype && DECL_FRIEND_P (decl1))
12960 ctype = DECL_CLASS_CONTEXT (decl1);
12962 /* CTYPE could be null here if we're dealing with a template;
12963 for example, `inline friend float foo()' inside a template
12964 will have no CTYPE set. */
12965 if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
12971 last_function_parms = DECL_ARGUMENTS (decl1);
12972 last_function_parm_tags = NULL_TREE;
12976 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE);
12977 /* If the declarator is not suitable for a function definition,
12978 cause a syntax error. */
12979 if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0;
12981 fntype = TREE_TYPE (decl1);
12983 restype = TREE_TYPE (fntype);
12984 if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
12986 cp_error ("semicolon missing after declaration of `%#T'", restype);
12987 shadow_tag (build_tree_list (NULL_TREE, restype));
12988 CLASSTYPE_GOT_SEMICOLON (restype) = 1;
12989 if (TREE_CODE (fntype) == FUNCTION_TYPE)
12990 fntype = build_function_type (integer_type_node,
12991 TYPE_ARG_TYPES (fntype));
12993 fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
12995 TYPE_ARG_TYPES (fntype));
12996 TREE_TYPE (decl1) = fntype;
12999 if (TREE_CODE (fntype) == METHOD_TYPE)
13000 ctype = TYPE_METHOD_BASETYPE (fntype);
13001 else if (DECL_MAIN_P (decl1))
13003 /* If this doesn't return integer_type, complain. */
13004 if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
13006 if (pedantic || warn_return_type)
13007 pedwarn ("return type for `main' changed to `int'");
13008 TREE_TYPE (decl1) = fntype = default_function_type;
13013 /* Sometimes we don't notice that a function is a static member, and
13014 build a METHOD_TYPE for it. Fix that up now. */
13015 if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1)
13016 && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE)
13018 revert_static_member_fn (&decl1, NULL, NULL);
13019 last_function_parms = TREE_CHAIN (last_function_parms);
13023 /* Warn if function was previously implicitly declared
13024 (but not if we warned then). */
13025 if (! warn_implicit
13026 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
13027 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
13029 /* Set up current_class_type, and enter the scope of the class, if
13032 push_nested_class (ctype, 1);
13033 else if (DECL_STATIC_FUNCTION_P (decl1))
13034 push_nested_class (DECL_CONTEXT (decl1), 2);
13036 /* Now that we have entered the scope of the class, we must restore
13037 the bindings for any template parameters surrounding DECL1, if it
13038 is an inline member template. (Order is important; consider the
13039 case where a template parameter has the same name as a field of
13040 the class.) It is not until after this point that
13041 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13042 if (flags & SF_INCLASS_INLINE)
13043 maybe_begin_member_template_processing (decl1);
13045 /* Effective C++ rule 15. See also c_expand_return. */
13047 && DECL_NAME (decl1) == ansi_opname[(int) MODIFY_EXPR]
13048 && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
13049 cp_warning ("`operator=' should return a reference to `*this'");
13051 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13052 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13053 if (!DECL_INITIAL (decl1))
13054 DECL_INITIAL (decl1) = error_mark_node;
13056 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13057 SET_DEFAULT_DECL_ATTRIBUTES (decl1, attrs);
13060 /* This function exists in static storage.
13061 (This does not mean `static' in the C sense!) */
13062 TREE_STATIC (decl1) = 1;
13064 /* We must call push_template_decl after current_class_type is set
13065 up. (If we are processing inline definitions after exiting a
13066 class scope, current_class_type will be NULL_TREE until set above
13067 by push_nested_class.) */
13068 if (processing_template_decl)
13069 decl1 = push_template_decl (decl1);
13071 /* We are now in the scope of the function being defined. */
13072 current_function_decl = decl1;
13074 /* Save the parm names or decls from this function's declarator
13075 where store_parm_decls will find them. */
13076 current_function_parms = last_function_parms;
13077 current_function_parm_tags = last_function_parm_tags;
13079 /* Make sure the parameter and return types are reasonable. When
13080 you declare a function, these types can be incomplete, but they
13081 must be complete when you define the function. */
13082 if (! processing_template_decl)
13083 check_function_type (decl1);
13085 /* Build the return declaration for the function. */
13086 restype = TREE_TYPE (fntype);
13087 if (!processing_template_decl)
13089 if (!DECL_RESULT (decl1))
13091 DECL_RESULT (decl1)
13092 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13093 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype),
13094 DECL_RESULT (decl1));
13098 /* Just use `void'. Nobody will ever look at this anyhow. */
13099 DECL_RESULT (decl1) = build_decl (RESULT_DECL, 0, void_type_node);
13101 /* Initialize RTL machinery. We cannot do this until
13102 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13103 even when processing a template; this is how we get
13104 CFUN set up, and our per-function variables initialized. */
13105 bl = current_binding_level;
13106 init_function_start (decl1, input_filename, lineno);
13107 current_binding_level = bl;
13108 expanding_p = (flags & SF_EXPAND) != 0;
13110 /* Even though we're inside a function body, we still don't want to
13111 call expand_expr to calculate the size of a variable-sized array.
13112 We haven't necessarily assigned RTL to all variables yet, so it's
13113 not safe to try to expand expressions involving them. */
13114 immediate_size_expand = 0;
13115 cfun->x_dont_save_pending_sizes_p = 1;
13117 /* If we're building a statement-tree, start the tree now. */
13118 if (processing_template_decl || !expanding_p)
13119 begin_stmt_tree (&DECL_SAVED_TREE (decl1));
13121 /* Let the user know we're compiling this function. */
13122 if (processing_template_decl || !building_stmt_tree ())
13123 announce_function (decl1);
13125 /* Record the decl so that the function name is defined.
13126 If we already have a decl for this name, and it is a FUNCTION_DECL,
13127 use the old decl. */
13128 if (!processing_template_decl && !(flags & SF_PRE_PARSED))
13130 /* A specialization is not used to guide overload resolution. */
13131 if ((flag_guiding_decls
13132 || !DECL_TEMPLATE_SPECIALIZATION (decl1))
13133 && ! DECL_FUNCTION_MEMBER_P (decl1))
13134 decl1 = pushdecl (decl1);
13137 /* We need to set the DECL_CONTEXT. */
13138 if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
13139 DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
13140 /* And make sure we have enough default args. */
13141 check_default_args (decl1);
13143 DECL_MAIN_VARIANT (decl1) = decl1;
13144 fntype = TREE_TYPE (decl1);
13147 /* Reset these in case the call to pushdecl changed them. */
13148 current_function_decl = decl1;
13149 cfun->decl = decl1;
13151 /* Initialize the per-function data. */
13152 if (!DECL_PENDING_INLINE_P (decl1) && DECL_SAVED_FUNCTION_DATA (decl1))
13154 /* If we already parsed this function, and we're just expanding it
13155 now, restore saved state. */
13156 struct binding_level *bl = current_binding_level;
13157 *cp_function_chain = *DECL_SAVED_FUNCTION_DATA (decl1);
13158 current_binding_level = bl;
13160 /* This function is being processed in whole-function mode; we
13161 already did semantic analysis. */
13162 cfun->x_whole_function_mode_p = 1;
13164 /* If we decided that we didn't want to inline this function,
13165 make sure the back-end knows that. */
13166 if (!current_function_cannot_inline)
13167 current_function_cannot_inline = cp_function_chain->cannot_inline;
13169 /* We don't need the saved data anymore. */
13170 free (DECL_SAVED_FUNCTION_DATA (decl1));
13171 DECL_SAVED_FUNCTION_DATA (decl1) = NULL;
13173 else if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1))
13175 /* We know that this was set up by `grokclassfn'. We do not
13176 wait until `store_parm_decls', since evil parse errors may
13177 never get us to that point. Here we keep the consistency
13178 between `current_class_type' and `current_class_ptr'. */
13179 tree t = DECL_ARGUMENTS (decl1);
13181 my_friendly_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL,
13183 my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE,
13186 cp_function_chain->x_current_class_ref
13187 = build_indirect_ref (t, NULL_PTR);
13188 cp_function_chain->x_current_class_ptr = t;
13190 /* Constructors and destructors need to know whether they're "in
13191 charge" of initializing virtual base classes. */
13192 if (DECL_DESTRUCTOR_P (decl1))
13193 current_in_charge_parm = TREE_CHAIN (t);
13194 else if (DECL_CONSTRUCTOR_P (decl1)
13196 && DECL_ARTIFICIAL (TREE_CHAIN (t))
13197 && (DECL_NAME (TREE_CHAIN (t))
13198 == in_charge_identifier))
13199 current_in_charge_parm = TREE_CHAIN (t);
13202 if (DECL_INTERFACE_KNOWN (decl1))
13204 tree ctx = hack_decl_function_context (decl1);
13206 if (DECL_NOT_REALLY_EXTERN (decl1))
13207 DECL_EXTERNAL (decl1) = 0;
13209 if (ctx != NULL_TREE && DECL_THIS_INLINE (ctx)
13210 && TREE_PUBLIC (ctx))
13211 /* This is a function in a local class in an extern inline
13213 comdat_linkage (decl1);
13215 /* If this function belongs to an interface, it is public.
13216 If it belongs to someone else's interface, it is also external.
13217 This only affects inlines and template instantiations. */
13218 else if (interface_unknown == 0
13219 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13220 || flag_alt_external_templates))
13222 if (DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1)
13223 || processing_template_decl)
13225 DECL_EXTERNAL (decl1)
13227 || (DECL_THIS_INLINE (decl1) && ! flag_implement_inlines
13228 && !DECL_VINDEX (decl1)));
13230 /* For WIN32 we also want to put these in linkonce sections. */
13231 maybe_make_one_only (decl1);
13234 DECL_EXTERNAL (decl1) = 0;
13235 DECL_NOT_REALLY_EXTERN (decl1) = 0;
13236 DECL_INTERFACE_KNOWN (decl1) = 1;
13238 else if (interface_unknown && interface_only
13239 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13240 || flag_alt_external_templates))
13242 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13243 interface, we will have interface_only set but not
13244 interface_known. In that case, we don't want to use the normal
13245 heuristics because someone will supply a #pragma implementation
13246 elsewhere, and deducing it here would produce a conflict. */
13247 comdat_linkage (decl1);
13248 DECL_EXTERNAL (decl1) = 0;
13249 DECL_INTERFACE_KNOWN (decl1) = 1;
13250 DECL_DEFER_OUTPUT (decl1) = 1;
13254 /* This is a definition, not a reference.
13255 So clear DECL_EXTERNAL. */
13256 DECL_EXTERNAL (decl1) = 0;
13258 if ((DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1))
13259 && ! DECL_INTERFACE_KNOWN (decl1)
13260 /* Don't try to defer nested functions for now. */
13261 && ! hack_decl_function_context (decl1))
13262 DECL_DEFER_OUTPUT (decl1) = 1;
13264 DECL_INTERFACE_KNOWN (decl1) = 1;
13267 if (doing_semantic_analysis_p ())
13270 current_binding_level->parm_flag = 1;
13274 cplus_decl_attributes (decl1, NULL_TREE, attrs);
13276 if (!building_stmt_tree ())
13278 GNU_xref_function (decl1, current_function_parms);
13279 make_function_rtl (decl1);
13282 /* Promote the value to int before returning it. */
13283 if (C_PROMOTING_INTEGER_TYPE_P (restype))
13284 restype = type_promotes_to (restype);
13286 /* If this fcn was already referenced via a block-scope `extern' decl
13287 (or an implicit decl), propagate certain information about the usage. */
13288 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1)))
13289 TREE_ADDRESSABLE (decl1) = 1;
13291 if (DECL_RESULT (decl1) == NULL_TREE)
13293 DECL_RESULT (decl1)
13294 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13295 TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype);
13296 TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype);
13301 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1))
13302 && DECL_LANGUAGE (decl1) == lang_cplusplus)
13304 dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13305 DECL_CONTEXT (dtor_label) = current_function_decl;
13307 else if (DECL_CONSTRUCTOR_P (decl1))
13309 ctor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13310 DECL_CONTEXT (ctor_label) = current_function_decl;
13316 /* Called after store_parm_decls for a function-try-block. */
13319 expand_start_early_try_stmts ()
13321 expand_start_try_stmts ();
13324 /* Store the parameter declarations into the current function declaration.
13325 This is called after parsing the parameter declarations, before
13326 digesting the body of the function.
13328 Also install to binding contour return value identifier, if any. */
13331 store_parm_decls ()
13333 register tree fndecl = current_function_decl;
13334 register tree parm;
13335 int parms_have_cleanups = 0;
13336 tree cleanups = NULL_TREE;
13338 /* This is a list of types declared among parms in a prototype. */
13339 tree parmtags = current_function_parm_tags;
13341 /* This is a chain of any other decls that came in among the parm
13342 declarations. If a parm is declared with enum {foo, bar} x;
13343 then CONST_DECLs for foo and bar are put here. */
13344 tree nonparms = NULL_TREE;
13346 /* Create a binding level for the parms. */
13347 if (!building_stmt_tree ())
13348 expand_start_bindings (2);
13350 if (current_function_parms)
13352 /* This case is when the function was defined with an ANSI prototype.
13353 The parms already have decls, so we need not do anything here
13354 except record them as in effect
13355 and complain if any redundant old-style parm decls were written. */
13357 tree specparms = current_function_parms;
13360 if (doing_semantic_analysis_p ())
13362 /* Must clear this because it might contain TYPE_DECLs declared
13364 storedecls (NULL_TREE);
13366 /* If we're doing semantic analysis, then we'll call pushdecl
13367 for each of these. We must do them in reverse order so that
13368 they end in the correct forward order. */
13369 specparms = nreverse (specparms);
13372 for (parm = specparms; parm; parm = next)
13374 next = TREE_CHAIN (parm);
13375 if (TREE_CODE (parm) == PARM_DECL)
13377 tree type = TREE_TYPE (parm);
13379 if (doing_semantic_analysis_p ())
13383 if (DECL_NAME (parm) == NULL_TREE
13384 || TREE_CODE (parm) != VOID_TYPE)
13387 cp_error ("parameter `%D' declared void", parm);
13389 cleanup = maybe_build_cleanup (parm);
13392 cleanups = tree_cons (parm, cleanup, cleanups);
13394 else if (type != error_mark_node
13395 && TYPE_NEEDS_DESTRUCTOR (type))
13396 parms_have_cleanups = 1;
13400 /* If we find an enum constant or a type tag,
13401 put it aside for the moment. */
13402 TREE_CHAIN (parm) = NULL_TREE;
13403 nonparms = chainon (nonparms, parm);
13407 if (doing_semantic_analysis_p ())
13409 /* Get the decls in their original chain order
13410 and record in the function. This is all and only the
13411 PARM_DECLs that were pushed into scope by the loop above. */
13412 DECL_ARGUMENTS (fndecl) = getdecls ();
13413 storetags (chainon (parmtags, gettags ()));
13417 DECL_ARGUMENTS (fndecl) = NULL_TREE;
13419 /* Now store the final chain of decls for the arguments
13420 as the decl-chain of the current lexical scope.
13421 Put the enumerators in as well, at the front so that
13422 DECL_ARGUMENTS is not modified. */
13423 if (doing_semantic_analysis_p ())
13424 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13426 /* Initialize the RTL code for the function. */
13427 DECL_SAVED_INSNS (fndecl) = 0;
13428 if (! building_stmt_tree ())
13429 expand_function_start (fndecl, parms_have_cleanups);
13431 current_function_parms_stored = 1;
13433 /* If this function is `main', emit a call to `__main'
13434 to run global initializers, etc. */
13435 if (DECL_MAIN_P (fndecl) && !building_stmt_tree ())
13436 expand_main_function ();
13438 /* Now that we have initialized the parms, we can start their
13439 cleanups. We cannot do this before, since expand_decl_cleanup
13440 should not be called before the parm can be used. */
13443 finish_decl_cleanup (TREE_PURPOSE (cleanups),
13444 TREE_VALUE (cleanups));
13445 cleanups = TREE_CHAIN (cleanups);
13448 /* Create a binding contour which can be used to catch
13449 cleanup-generated temporaries. Also, if the return value needs or
13450 has initialization, deal with that now. */
13451 if (parms_have_cleanups)
13454 if (!building_stmt_tree ())
13455 expand_start_bindings (2);
13458 /* Do the starting of the exception specifications, if we have any. */
13459 if (flag_exceptions && !processing_template_decl
13460 && building_stmt_tree ()
13461 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13462 current_eh_spec_try_block = expand_start_eh_spec ();
13465 /* Bind a name and initialization to the return value of
13466 the current function. */
13469 store_return_init (decl)
13472 /* If this named return value comes in a register, put it in a
13473 pseudo-register. */
13474 if (DECL_REGISTER (decl))
13476 original_result_rtx = DECL_RTL (decl);
13477 /* Note that the mode of the old DECL_RTL may be wider than the
13478 mode of DECL_RESULT, depending on the calling conventions for
13479 the processor. For example, on the Alpha, a 32-bit integer
13480 is returned in a DImode register -- the DECL_RESULT has
13481 SImode but the DECL_RTL for the DECL_RESULT has DImode. So,
13482 here, we use the mode the back-end has already assigned for
13483 the return value. */
13484 DECL_RTL (decl) = gen_reg_rtx (GET_MODE (original_result_rtx));
13489 /* We have finished doing semantic analysis on DECL, but have not yet
13490 generated RTL for its body. Save away our current state, so that
13491 when we want to generate RTL later we know what to do. */
13494 save_function_data (decl)
13497 struct language_function *f;
13499 /* Save the language-specific per-function data so that we can
13500 get it back when we really expand this function. */
13501 my_friendly_assert (!DECL_PENDING_INLINE_P (decl),
13505 f = ((struct language_function *)
13506 xmalloc (sizeof (struct language_function)));
13507 bcopy ((char *) cp_function_chain, (char *) f,
13508 sizeof (struct language_function));
13509 DECL_SAVED_FUNCTION_DATA (decl) = f;
13511 /* Clear out the bits we don't need. */
13512 f->x_base_init_list = NULL_TREE;
13513 f->x_member_init_list = NULL_TREE;
13514 f->x_stmt_tree.x_last_stmt = NULL_TREE;
13515 f->x_stmt_tree.x_last_expr_type = NULL_TREE;
13516 f->x_result_rtx = NULL_RTX;
13517 f->x_named_label_uses = NULL;
13518 f->bindings = NULL;
13520 /* When we get back here again, we will be expanding. */
13521 f->x_expanding_p = 1;
13523 /* If we've already decided that we cannot inline this function, we
13524 must remember that fact when we actually go to expand the
13526 f->cannot_inline = current_function_cannot_inline;
13529 /* At the end of every constructor we generate to code to return
13530 `this'. Do that now. */
13533 finish_constructor_body ()
13535 /* Any return from a constructor will end up here. */
13536 add_tree (build_min_nt (LABEL_STMT, ctor_label));
13538 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13539 generate the return, rather than a goto to CTOR_LABEL. */
13540 ctor_label = NULL_TREE;
13541 /* In check_return_expr we translate an empty return from a
13542 constructor to a return of `this'. */
13543 finish_return_stmt (NULL_TREE);
13544 /* Mark the end of the constructor. */
13545 add_tree (build_min_nt (CTOR_STMT));
13548 /* At the end of every destructor we generate code to restore virtual
13549 function tables to the values desired by base classes and to call
13550 to base class destructors. Do that now. */
13553 finish_destructor_body ()
13555 tree compound_stmt;
13560 /* Create a block to contain all the extra code. */
13561 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
13563 /* Any return from a destructor will end up here. */
13564 add_tree (build_min_nt (LABEL_STMT, dtor_label));
13566 /* Generate the code to call destructor on base class. If this
13567 destructor belongs to a class with virtual functions, then set
13568 the virtual function table pointer to represent the type of our
13571 /* This side-effect makes call to `build_delete' generate the code
13572 we have to have at the end of this destructor. `build_delete'
13573 will set the flag again. */
13574 TYPE_HAS_DESTRUCTOR (current_class_type) = 0;
13576 /* These are two cases where we cannot delegate deletion. */
13577 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)
13578 || TYPE_GETS_REG_DELETE (current_class_type))
13579 in_charge = integer_zero_node;
13581 in_charge = current_in_charge_parm;
13583 exprstmt = build_delete (current_class_type,
13586 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
13589 if (exprstmt != error_mark_node
13590 && (TREE_CODE (exprstmt) != NOP_EXPR
13591 || TREE_OPERAND (exprstmt, 0) != integer_zero_node
13592 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)))
13594 if (exprstmt != void_zero_node)
13595 /* Don't call `expand_expr_stmt' if we're not going to do
13596 anything, since -Wall will give a diagnostic. */
13597 finish_expr_stmt (exprstmt);
13599 /* Run destructors for all virtual baseclasses. */
13600 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13602 tree vbases = nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type)));
13603 tree if_stmt = begin_if_stmt ();
13604 finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
13605 current_in_charge_parm,
13611 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases)))
13613 tree vb = get_vbase
13614 (BINFO_TYPE (vbases),
13615 TYPE_BINFO (current_class_type));
13617 (build_scoped_method_call
13618 (current_class_ref, vb, dtor_identifier,
13619 build_tree_list (NULL_TREE, integer_zero_node)));
13621 vbases = TREE_CHAIN (vbases);
13624 finish_then_clause (if_stmt);
13629 virtual_size = c_sizeof (current_class_type);
13631 /* At the end, call delete if that's what's requested. */
13633 /* FDIS sez: At the point of definition of a virtual destructor
13634 (including an implicit definition), non-placement operator delete
13635 shall be looked up in the scope of the destructor's class and if
13636 found shall be accessible and unambiguous.
13638 This is somewhat unclear, but I take it to mean that if the class
13639 only defines placement deletes we don't do anything here. So we
13640 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13641 they ever try to delete one of these. */
13642 if (TYPE_GETS_REG_DELETE (current_class_type)
13643 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13647 exprstmt = build_op_delete_call
13648 (DELETE_EXPR, current_class_ptr, virtual_size,
13649 LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
13651 if_stmt = begin_if_stmt ();
13652 finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
13653 current_in_charge_parm,
13656 finish_expr_stmt (exprstmt);
13657 finish_then_clause (if_stmt);
13661 /* Close the block we started above. */
13662 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
13665 /* Finish up a function declaration and compile that function
13666 all the way to assembler language output. The free the storage
13667 for the function definition.
13669 This is called after parsing the body of the function definition.
13670 LINENO is the current line number.
13672 FLAGS is a bitwise or of the following values:
13674 An extra call to poplevel (and expand_end_bindings) must be
13675 made to take care of the binding contour for the base
13676 initializers. This is only relevant for constructors.
13678 We just finished processing the body of an in-class inline
13679 function definition. (This processing will have taken place
13680 after the class definition is complete.) */
13683 finish_function (lineno, flags)
13687 register tree fndecl = current_function_decl;
13688 tree fntype, ctype = NULL_TREE;
13689 /* Label to use if this function is supposed to return a value. */
13690 tree no_return_label = NULL_TREE;
13691 int call_poplevel = (flags & 1) != 0;
13692 int inclass_inline = (flags & 2) != 0;
13696 /* When we get some parse errors, we can end up without a
13697 current_function_decl, so cope. */
13698 if (fndecl == NULL_TREE)
13699 return error_mark_node;
13701 nested = function_depth > 1;
13702 fntype = TREE_TYPE (fndecl);
13704 /* TREE_READONLY (fndecl) = 1;
13705 This caused &foo to be of type ptr-to-const-function
13706 which then got a warning when stored in a ptr-to-function variable. */
13708 /* This happens on strange parse errors. */
13709 if (! current_function_parms_stored)
13712 store_parm_decls ();
13715 if (building_stmt_tree ())
13717 if (DECL_CONSTRUCTOR_P (fndecl))
13719 finish_constructor_body ();
13723 else if (DECL_DESTRUCTOR_P (fndecl) && !processing_template_decl)
13724 finish_destructor_body ();
13725 else if (DECL_MAIN_P (fndecl))
13727 /* Make it so that `main' always returns 0 by default. */
13729 finish_return_stmt (integer_one_node);
13731 finish_return_stmt (integer_zero_node);
13735 /* Finish dealing with exception specifiers. */
13736 if (flag_exceptions && !processing_template_decl
13737 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13738 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13739 (TREE_TYPE (current_function_decl)),
13740 current_eh_spec_try_block);
13745 if (write_symbols != NO_DEBUG /*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13747 /* Keep this code around in case we later want to control debug info
13748 based on whether a type is "used". (jason 1999-11-11) */
13750 tree ttype = target_type (fntype);
13753 if (IS_AGGR_TYPE (ttype))
13754 /* Let debugger know it should output info for this type. */
13755 note_debug_info_needed (ttype);
13757 for (parmdecl = DECL_ARGUMENTS (fndecl); parmdecl; parmdecl = TREE_CHAIN (parmdecl))
13759 ttype = target_type (TREE_TYPE (parmdecl));
13760 if (IS_AGGR_TYPE (ttype))
13761 /* Let debugger know it should output info for this type. */
13762 note_debug_info_needed (ttype);
13767 /* Clean house because we will need to reorder insns here. */
13768 do_pending_stack_adjust ();
13772 else if (DECL_CONSTRUCTOR_P (fndecl))
13777 else if (return_label != NULL_RTX
13778 && flag_this_is_variable <= 0
13779 && current_function_return_value == NULL_TREE
13780 && ! DECL_NAME (DECL_RESULT (current_function_decl)))
13781 no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13783 if (flag_exceptions)
13784 expand_exception_blocks ();
13786 /* If this function is supposed to return a value, ensure that
13787 we do not fall into the cleanups by mistake. The end of our
13788 function will look like this:
13790 user code (may have return stmt somewhere)
13791 goto no_return_label
13796 NOTE_INSN_FUNCTION_END
13800 If the user omits a return stmt in the USER CODE section, we
13801 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13802 Otherwise, we won't. */
13803 if (no_return_label)
13805 DECL_CONTEXT (no_return_label) = fndecl;
13806 DECL_INITIAL (no_return_label) = error_mark_node;
13807 DECL_SOURCE_FILE (no_return_label) = input_filename;
13808 DECL_SOURCE_LINE (no_return_label) = lineno;
13809 expand_goto (no_return_label);
13814 /* Remove the binding contour which is used
13815 to catch cleanup-generated temporaries. */
13816 expand_end_bindings (0, 0, 0);
13817 poplevel (0, 0, 0);
13819 /* Emit label at beginning of cleanup code for parameters. */
13820 emit_label (cleanup_label);
13823 /* Get return value into register if that's where it's supposed
13825 if (original_result_rtx)
13826 fixup_result_decl (DECL_RESULT (fndecl), original_result_rtx);
13828 /* Finish building code that will trigger warnings if users forget
13829 to make their functions return values. */
13830 if (no_return_label || cleanup_label)
13831 emit_jump (return_label);
13832 if (no_return_label)
13834 /* We don't need to call `expand_*_return' here because we
13835 don't need any cleanups here--this path of code is only
13836 for error checking purposes. */
13837 expand_label (no_return_label);
13840 /* We hard-wired immediate_size_expand to zero in
13841 start_function. Expand_function_end will decrement this
13842 variable. So, we set the variable to one here, so that after
13843 the decrement it will remain zero. */
13844 immediate_size_expand = 1;
13846 /* Generate rtl for function exit. */
13847 expand_function_end (input_filename, lineno, 1);
13850 /* We have to save this value here in case
13851 maybe_end_member_template_processing decides to pop all the
13852 template parameters. */
13853 expand_p = !building_stmt_tree ();
13855 /* If we're saving up tree structure, tie off the function now. */
13857 finish_stmt_tree (&DECL_SAVED_TREE (fndecl));
13859 /* This must come after expand_function_end because cleanups might
13860 have declarations (from inline functions) that need to go into
13861 this function's blocks. */
13862 if (doing_semantic_analysis_p ())
13864 if (current_binding_level->parm_flag != 1)
13865 my_friendly_abort (122);
13866 poplevel (1, 0, 1);
13869 /* Remember that we were in class scope. */
13870 if (current_class_name)
13871 ctype = current_class_type;
13873 /* Must mark the RESULT_DECL as being in this function. */
13874 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
13876 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13877 to the FUNCTION_DECL node itself. */
13878 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
13880 /* Save away current state, if appropriate. */
13881 if (!expanding_p && !processing_template_decl)
13882 save_function_data (fndecl);
13884 /* If this function calls `setjmp' it cannot be inlined. When
13885 `longjmp' is called it is not guaranteed to restore the value of
13886 local variables that have been modified since the call to
13887 `setjmp'. So, if were to inline this function into some caller
13888 `c', then when we `longjmp', we might not restore all variables
13889 in `c'. (It might seem, at first blush, that there's no way for
13890 this function to modify local variables in `c', but their
13891 addresses may have been stored somewhere accessible to this
13893 if (!expanding_p && !processing_template_decl && calls_setjmp_p (fndecl))
13894 DECL_UNINLINABLE (fndecl) = 1;
13900 int saved_flag_keep_inline_functions =
13901 flag_keep_inline_functions;
13903 /* So we can tell if jump_optimize sets it to 1. */
13906 if (DECL_CONTEXT (fndecl) != NULL_TREE
13907 && hack_decl_function_context (fndecl))
13908 /* Trick rest_of_compilation into not deferring output of this
13909 function, even if it is inline, since the rtl_obstack for
13910 this function is the function_obstack of the enclosing
13911 function and will be deallocated when the enclosing
13912 function is gone. See save_tree_status. */
13913 flag_keep_inline_functions = 1;
13915 /* Before we call rest_of_compilation (which will pop the
13916 CURRENT_FUNCTION), we must save these values. */
13917 returns_null = current_function_returns_null;
13918 returns_value = current_function_returns_value;
13920 /* If this is a nested function (like a template instantiation
13921 that we're compiling in the midst of compiling something
13922 else), push a new GC context. That will keep local variables
13923 on the stack from being collected while we're doing the
13924 compilation of this function. */
13925 if (function_depth > 1)
13926 ggc_push_context ();
13928 /* Run the optimizers and output the assembler code for this
13930 if (DECL_ARTIFICIAL (fndecl))
13932 /* Do we really *want* to inline this synthesized method? */
13934 int save_fif = flag_inline_functions;
13935 flag_inline_functions = 1;
13937 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13938 will check our size. */
13939 DECL_INLINE (fndecl) = 0;
13941 rest_of_compilation (fndecl);
13942 flag_inline_functions = save_fif;
13945 rest_of_compilation (fndecl);
13947 /* Undo the call to ggc_push_context above. */
13948 if (function_depth > 1)
13949 ggc_pop_context ();
13951 flag_keep_inline_functions = saved_flag_keep_inline_functions;
13953 if (DECL_SAVED_INSNS (fndecl) && ! TREE_ASM_WRITTEN (fndecl))
13955 /* Set DECL_EXTERNAL so that assemble_external will be called as
13956 necessary. We'll clear it again in finish_file. */
13957 if (! DECL_EXTERNAL (fndecl))
13958 DECL_NOT_REALLY_EXTERN (fndecl) = 1;
13959 DECL_EXTERNAL (fndecl) = 1;
13960 mark_inline_for_output (fndecl);
13964 /* Keep this code around in case we later want to control debug info
13965 based on whether a type is "used". (jason 1999-11-11) */
13967 if (ctype && TREE_ASM_WRITTEN (fndecl))
13968 note_debug_info_needed (ctype);
13971 returns_null |= can_reach_end;
13973 /* Since we don't normally go through c_expand_return for constructors,
13974 this normally gets the wrong value.
13975 Also, named return values have their return codes emitted after
13976 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13977 if (DECL_CONSTRUCTOR_P (fndecl)
13978 || DECL_NAME (DECL_RESULT (fndecl)) != NULL_TREE)
13981 if (TREE_THIS_VOLATILE (fndecl) && returns_null)
13982 cp_warning ("`noreturn' function `%D' does return", fndecl);
13983 else if ((warn_return_type || pedantic)
13985 && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE)
13987 /* If this function returns non-void and control can drop through,
13989 cp_warning ("control reaches end of non-void function `%D'", fndecl);
13991 /* With just -W, complain only if function returns both with
13992 and without a value. */
13993 else if (extra_warnings && returns_value && returns_null)
13994 warning ("this function may return with or without a value");
13998 /* Clear out memory we no longer need. */
13999 free_after_parsing (cfun);
14000 /* Since we never call rest_of_compilation, we never clear
14001 CFUN. Do so explicitly. */
14002 free_after_compilation (cfun);
14006 /* If this is a in-class inline definition, we may have to pop the
14007 bindings for the template parameters that we added in
14008 maybe_begin_member_template_processing when start_function was
14010 if (inclass_inline)
14011 maybe_end_member_template_processing ();
14013 /* Leave the scope of the class. */
14015 pop_nested_class ();
14019 if (!DECL_SAVED_INSNS (fndecl) && !DECL_SAVED_FUNCTION_DATA (fndecl)
14020 && !(flag_inline_trees && DECL_INLINE (fndecl)))
14024 /* Stop pointing to the local nodes about to be freed. */
14025 /* But DECL_INITIAL must remain nonzero so we know this
14026 was an actual function definition. */
14027 DECL_INITIAL (fndecl) = error_mark_node;
14028 for (t = DECL_ARGUMENTS (fndecl); t; t = TREE_CHAIN (t))
14029 DECL_RTL (t) = DECL_INCOMING_RTL (t) = NULL_RTX;
14032 if (DECL_STATIC_CONSTRUCTOR (fndecl))
14033 static_ctors = tree_cons (NULL_TREE, fndecl, static_ctors);
14034 if (DECL_STATIC_DESTRUCTOR (fndecl))
14035 static_dtors = tree_cons (NULL_TREE, fndecl, static_dtors);
14040 /* Let the error reporting routines know that we're outside a
14041 function. For a nested function, this value is used in
14042 pop_cp_function_context and then reset via pop_function_context. */
14043 current_function_decl = NULL_TREE;
14044 /* We don't really care about obstacks, but the middle-end
14045 sometimes cares on what obstck things are located. */
14046 permanent_allocation (1);
14052 /* Create the FUNCTION_DECL for a function definition.
14053 DECLSPECS and DECLARATOR are the parts of the declaration;
14054 they describe the return type and the name of the function,
14055 but twisted together in a fashion that parallels the syntax of C.
14057 This function creates a binding context for the function body
14058 as well as setting up the FUNCTION_DECL in current_function_decl.
14060 Returns a FUNCTION_DECL on success.
14062 If the DECLARATOR is not suitable for a function (it defines a datum
14063 instead), we return 0, which tells yyparse to report a parse error.
14065 May return void_type_node indicating that this method is actually
14066 a friend. See grokfield for more details.
14068 Came here with a `.pushlevel' .
14070 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14071 CHANGES TO CODE IN `grokfield'. */
14074 start_method (declspecs, declarator, attrlist)
14075 tree declarator, declspecs, attrlist;
14077 tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
14080 /* Something too ugly to handle. */
14081 if (fndecl == NULL_TREE)
14084 /* Pass friends other than inline friend functions back. */
14085 if (fndecl == void_type_node)
14088 if (TREE_CODE (fndecl) != FUNCTION_DECL)
14089 /* Not a function, tell parser to report parse error. */
14092 if (DECL_IN_AGGR_P (fndecl))
14094 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
14096 if (DECL_CONTEXT (fndecl)
14097 && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
14098 cp_error ("`%D' is already defined in class %s", fndecl,
14099 TYPE_NAME_STRING (DECL_CONTEXT (fndecl)));
14101 return void_type_node;
14104 check_template_shadow (fndecl);
14106 DECL_THIS_INLINE (fndecl) = 1;
14108 if (flag_default_inline)
14109 DECL_INLINE (fndecl) = 1;
14111 /* We process method specializations in finish_struct_1. */
14112 if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
14113 fndecl = push_template_decl (fndecl);
14115 /* We read in the parameters on the maybepermanent_obstack,
14116 but we won't be getting back to them until after we
14117 may have clobbered them. So the call to preserve_data
14118 will keep them safe. */
14121 if (! DECL_FRIEND_P (fndecl))
14123 if (TREE_CHAIN (fndecl))
14125 fndecl = copy_node (fndecl);
14126 TREE_CHAIN (fndecl) = NULL_TREE;
14129 if (DECL_CONSTRUCTOR_P (fndecl))
14131 if (! grok_ctor_properties (current_class_type, fndecl))
14132 return void_type_node;
14134 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl)))
14135 grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0);
14138 cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0);
14140 /* Make a place for the parms */
14142 current_binding_level->parm_flag = 1;
14144 DECL_IN_AGGR_P (fndecl) = 1;
14148 /* Go through the motions of finishing a function definition.
14149 We don't compile this method until after the whole class has
14152 FINISH_METHOD must return something that looks as though it
14153 came from GROKFIELD (since we are defining a method, after all).
14155 This is called after parsing the body of the function definition.
14156 STMTS is the chain of statements that makes up the function body.
14158 DECL is the ..._DECL that `start_method' provided. */
14161 finish_method (decl)
14164 register tree fndecl = decl;
14167 register tree link;
14169 if (decl == void_type_node)
14172 old_initial = DECL_INITIAL (fndecl);
14174 /* Undo the level for the parms (from start_method).
14175 This is like poplevel, but it causes nothing to be
14176 saved. Saving information here confuses symbol-table
14177 output routines. Besides, this information will
14178 be correctly output when this method is actually
14181 /* Clear out the meanings of the local variables of this level;
14182 also record in each decl which block it belongs to. */
14184 for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14186 if (DECL_NAME (link) != NULL_TREE)
14187 pop_binding (DECL_NAME (link), link);
14188 my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14189 DECL_CONTEXT (link) = NULL_TREE;
14192 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
14193 (HOST_WIDE_INT) current_binding_level->level_chain,
14194 current_binding_level->parm_flag,
14195 current_binding_level->keep);
14197 poplevel (0, 0, 0);
14199 DECL_INITIAL (fndecl) = old_initial;
14201 /* We used to check if the context of FNDECL was different from
14202 current_class_type as another way to get inside here. This didn't work
14203 for String.cc in libg++. */
14204 if (DECL_FRIEND_P (fndecl))
14206 CLASSTYPE_INLINE_FRIENDS (current_class_type)
14207 = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14208 decl = void_type_node;
14214 /* Called when a new struct TYPE is defined.
14215 If this structure or union completes the type of any previous
14216 variable declaration, lay it out and output its rtl. */
14219 hack_incomplete_structures (type)
14224 if (current_binding_level->incomplete == NULL_TREE)
14227 if (!type) /* Don't do this for class templates. */
14230 for (list = ¤t_binding_level->incomplete; *list; )
14232 tree decl = TREE_VALUE (*list);
14233 if ((decl && TREE_TYPE (decl) == type)
14234 || (TREE_TYPE (decl)
14235 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14236 && TREE_TYPE (TREE_TYPE (decl)) == type))
14238 int toplevel = toplevel_bindings_p ();
14239 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14240 && TREE_TYPE (TREE_TYPE (decl)) == type)
14241 layout_type (TREE_TYPE (decl));
14242 layout_decl (decl, 0);
14243 rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0);
14247 expand_decl (decl);
14248 cleanup = maybe_build_cleanup (decl);
14249 expand_decl_init (decl);
14250 if (! expand_decl_cleanup (decl, cleanup))
14251 cp_error ("parser lost in parsing declaration of `%D'",
14254 *list = TREE_CHAIN (*list);
14257 list = &TREE_CHAIN (*list);
14261 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14262 See build_delete for information about AUTO_DELETE.
14264 Don't build these on the momentary obstack; they must live
14265 the life of the binding contour. */
14268 maybe_build_cleanup_1 (decl, auto_delete)
14269 tree decl, auto_delete;
14271 tree type = TREE_TYPE (decl);
14272 if (type != error_mark_node && TYPE_NEEDS_DESTRUCTOR (type))
14274 int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14277 if (TREE_CODE (type) == ARRAY_TYPE)
14281 mark_addressable (decl);
14282 rval = build_unary_op (ADDR_EXPR, decl, 0);
14285 /* Optimize for space over speed here. */
14286 if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14287 || flag_expensive_optimizations)
14288 flags |= LOOKUP_NONVIRTUAL;
14290 rval = build_delete (TREE_TYPE (rval), rval, auto_delete, flags, 0);
14292 if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14293 && ! TYPE_HAS_DESTRUCTOR (type))
14294 rval = build_compound_expr (tree_cons (NULL_TREE, rval,
14295 build_tree_list (NULL_TREE, build_vbase_delete (type, decl))));
14302 /* If DECL is of a type which needs a cleanup, build that cleanup
14303 here. The cleanup does free the storage with a call to delete. */
14306 maybe_build_cleanup_and_delete (decl)
14309 return maybe_build_cleanup_1 (decl, integer_three_node);
14312 /* If DECL is of a type which needs a cleanup, build that cleanup
14313 here. The cleanup does not free the storage with a call a delete. */
14316 maybe_build_cleanup (decl)
14319 return maybe_build_cleanup_1 (decl, integer_two_node);
14322 /* Expand a C++ expression at the statement level.
14323 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14324 The C++ type checker should get all of these out when
14325 expressions are combined with other, type-providing, expressions,
14326 leaving only orphan expressions, such as:
14328 &class::bar; / / takes its address, but does nothing with it. */
14331 cplus_expand_expr_stmt (exp)
14334 if (stmts_are_full_exprs_p)
14335 exp = convert_to_void (exp, "statement");
14338 /* We should do this eventually, but right now this causes regex.o from
14339 libg++ to miscompile, and tString to core dump. */
14340 exp = build1 (CLEANUP_POINT_EXPR, TREE_TYPE (exp), exp);
14343 /* If we don't do this, we end up down inside expand_expr
14344 trying to do TYPE_MODE on the ERROR_MARK, and really
14345 go outside the bounds of the type. */
14346 if (exp != error_mark_node)
14347 expand_expr_stmt (exp);
14350 /* When a stmt has been parsed, this function is called. */
14355 /* Always assume this statement was not an expression statement. If
14356 it actually was an expression statement, its our callers
14357 responsibility to fix this up. */
14358 last_expr_type = NULL_TREE;
14361 /* Change a static member function definition into a FUNCTION_TYPE, instead
14362 of the METHOD_TYPE that we create when it's originally parsed.
14364 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14365 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14366 other decls. Either pass the addresses of local variables or NULL. */
14369 revert_static_member_fn (decl, fn, argtypes)
14370 tree *decl, *fn, *argtypes;
14373 tree function = fn ? *fn : TREE_TYPE (*decl);
14374 tree args = argtypes ? *argtypes : TYPE_ARG_TYPES (function);
14376 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args)))
14377 != TYPE_UNQUALIFIED)
14378 cp_error ("static member function `%#D' declared with type qualifiers",
14381 args = TREE_CHAIN (args);
14382 tmp = build_function_type (TREE_TYPE (function), args);
14383 tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function));
14384 tmp = build_exception_variant (tmp,
14385 TYPE_RAISES_EXCEPTIONS (function));
14386 TREE_TYPE (*decl) = tmp;
14387 if (DECL_ARGUMENTS (*decl))
14388 DECL_ARGUMENTS (*decl) = TREE_CHAIN (DECL_ARGUMENTS (*decl));
14389 DECL_STATIC_FUNCTION_P (*decl) = 1;
14396 /* Initialize the variables used during compilation of a C++
14400 push_cp_function_context (f)
14401 struct function *f;
14403 struct language_function *p
14404 = ((struct language_function *)
14405 xcalloc (1, sizeof (struct language_function)));
14408 /* It takes an explicit call to expand_body to generate RTL for a
14412 /* Whenever we start a new function, we destroy temporaries in the
14414 stmts_are_full_exprs_p = 1;
14417 /* Free the language-specific parts of F, now that we've finished
14418 compiling the function. */
14421 pop_cp_function_context (f)
14422 struct function *f;
14425 free (f->language);
14429 /* Mark P for GC. */
14432 mark_lang_function (p)
14433 struct language_function *p;
14438 ggc_mark_tree (p->x_named_labels);
14439 ggc_mark_tree (p->x_ctor_label);
14440 ggc_mark_tree (p->x_dtor_label);
14441 ggc_mark_tree (p->x_base_init_list);
14442 ggc_mark_tree (p->x_member_init_list);
14443 ggc_mark_tree (p->x_current_class_ptr);
14444 ggc_mark_tree (p->x_current_class_ref);
14445 ggc_mark_tree (p->x_eh_spec_try_block);
14446 ggc_mark_tree (p->x_scope_stmt_stack);
14448 ggc_mark_rtx (p->x_result_rtx);
14450 mark_stmt_tree (&p->x_stmt_tree);
14451 mark_binding_level (&p->bindings);
14454 /* Mark the language-specific data in F for GC. */
14457 mark_cp_function_context (f)
14458 struct function *f;
14460 mark_lang_function (f->language);
14466 return function_depth != 0;
14471 lang_mark_false_label_stack (l)
14472 struct label_node *l;
14474 /* C++ doesn't use false_label_stack. It better be NULL. */
14475 my_friendly_assert (l == NULL, 19990904);
14482 enum tree_code code = TREE_CODE (t);
14483 if (code == IDENTIFIER_NODE)
14485 struct lang_identifier *li = (struct lang_identifier *) t;
14486 struct lang_id2 *li2 = li->x;
14487 ggc_mark_tree (li->namespace_bindings);
14488 ggc_mark_tree (li->bindings);
14489 ggc_mark_tree (li->class_value);
14490 ggc_mark_tree (li->class_template_info);
14494 ggc_mark_tree (li2->label_value);
14495 ggc_mark_tree (li2->implicit_decl);
14496 ggc_mark_tree (li2->error_locus);
14499 else if (code == CPLUS_BINDING)
14501 if (BINDING_HAS_LEVEL_P (t))
14502 mark_binding_level (&BINDING_LEVEL (t));
14504 ggc_mark_tree (BINDING_SCOPE (t));
14505 ggc_mark_tree (BINDING_VALUE (t));
14507 else if (code == OVERLOAD)
14508 ggc_mark_tree (OVL_FUNCTION (t));
14509 else if (code == TEMPLATE_PARM_INDEX)
14510 ggc_mark_tree (TEMPLATE_PARM_DECL (t));
14511 else if (TREE_CODE_CLASS (code) == 'd')
14513 struct lang_decl *ld = DECL_LANG_SPECIFIC (t);
14518 if (!DECL_GLOBAL_CTOR_P (t) && !DECL_GLOBAL_DTOR_P (t))
14519 ggc_mark_tree (ld->decl_flags.u2.access);
14520 ggc_mark_tree (ld->decl_flags.context);
14521 if (TREE_CODE (t) != NAMESPACE_DECL)
14522 ggc_mark_tree (ld->decl_flags.u.template_info);
14524 mark_binding_level (&NAMESPACE_LEVEL (t));
14525 if (CAN_HAVE_FULL_LANG_DECL_P (t))
14527 ggc_mark_tree (ld->main_decl_variant);
14528 ggc_mark_tree (ld->befriending_classes);
14529 ggc_mark_tree (ld->saved_tree);
14530 if (TREE_CODE (t) == TYPE_DECL)
14531 ggc_mark_tree (ld->u.sorted_fields);
14532 else if (TREE_CODE (t) == FUNCTION_DECL
14533 && !DECL_PENDING_INLINE_P (t))
14534 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t));
14538 else if (TREE_CODE_CLASS (code) == 't')
14540 struct lang_type *lt = TYPE_LANG_SPECIFIC (t);
14542 if (lt && !(TREE_CODE (t) == POINTER_TYPE
14543 && TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE))
14546 ggc_mark_tree (lt->vfields);
14547 ggc_mark_tree (lt->vbases);
14548 ggc_mark_tree (lt->tags);
14549 ggc_mark_tree (lt->search_slot);
14550 ggc_mark_tree (lt->size);
14551 ggc_mark_tree (lt->pure_virtuals);
14552 ggc_mark_tree (lt->friend_classes);
14553 ggc_mark_tree (lt->rtti);
14554 ggc_mark_tree (lt->methods);
14555 ggc_mark_tree (lt->template_info);
14556 ggc_mark_tree (lt->befriending_classes);
14559 /* In the case of pointer-to-member function types, the
14560 TYPE_LANG_SPECIFIC is really just a tree. */
14561 ggc_mark_tree ((tree) lt);