1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-98, 1999 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;
52 extern struct obstack* saveable_obstack;
54 extern int current_class_depth;
56 extern tree static_ctors, static_dtors;
58 extern tree global_namespace;
60 extern int (*valid_lang_attribute) PROTO ((tree, tree, tree, tree));
62 /* Use garbage collection. */
66 /* Obstack used for remembering local class declarations (like
67 enums and static (const) members. */
69 struct obstack decl_obstack;
70 static struct stack_level *decl_stack;
72 #ifndef WCHAR_UNSIGNED
73 #define WCHAR_UNSIGNED 0
76 #ifndef CHAR_TYPE_SIZE
77 #define CHAR_TYPE_SIZE BITS_PER_UNIT
80 #ifndef BOOL_TYPE_SIZE
81 #ifdef SLOW_BYTE_ACCESS
82 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
84 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
88 /* We let tm.h override the types used here, to handle trivial differences
89 such as the choice of unsigned int or long unsigned int for size_t.
90 When machines start needing nontrivial differences in the size type,
91 it would be best to do something here to figure out automatically
92 from other information what type to use. */
95 #define SIZE_TYPE "long unsigned int"
99 #define PTRDIFF_TYPE "long int"
103 #define WCHAR_TYPE "int"
106 static tree grokparms PROTO((tree, int));
107 static const char *redeclaration_error_message PROTO((tree, tree));
109 static struct stack_level *push_decl_level PROTO((struct stack_level *,
111 static void push_binding_level PROTO((struct binding_level *, int,
113 static void pop_binding_level PROTO((void));
114 static void suspend_binding_level PROTO((void));
115 static void resume_binding_level PROTO((struct binding_level *));
116 static struct binding_level *make_binding_level PROTO((void));
117 static void declare_namespace_level PROTO((void));
118 static void signal_catch PROTO((int)) ATTRIBUTE_NORETURN;
119 static void storedecls PROTO((tree));
120 static void require_complete_types_for_parms PROTO((tree));
121 static void push_overloaded_decl_1 PROTO((tree));
122 static int ambi_op_p PROTO((tree));
123 static int unary_op_p PROTO((tree));
124 static tree store_bindings PROTO((tree, tree));
125 static tree lookup_tag_reverse PROTO((tree, tree));
126 static tree obscure_complex_init PROTO((tree, tree));
127 static tree maybe_build_cleanup_1 PROTO((tree, tree));
128 static tree lookup_name_real PROTO((tree, int, int, int));
129 static void warn_extern_redeclared_static PROTO((tree, tree));
130 static void grok_reference_init PROTO((tree, tree, tree));
131 static tree grokfndecl PROTO((tree, tree, tree, tree, int,
132 enum overload_flags, tree,
133 tree, int, int, int, int, int, int, tree));
134 static tree grokvardecl PROTO((tree, tree, RID_BIT_TYPE *, int, int, tree));
135 static tree lookup_tag PROTO((enum tree_code, tree,
136 struct binding_level *, int));
137 static void set_identifier_type_value_with_scope
138 PROTO((tree, tree, struct binding_level *));
139 static void record_builtin_type PROTO((enum rid, const char *, tree));
140 static void record_unknown_type PROTO((tree, const char *));
141 static int member_function_or_else PROTO((tree, tree, const char *));
142 static void bad_specifiers PROTO((tree, const char *, int, int, int, int,
144 static void lang_print_error_function PROTO((const char *));
145 static tree maybe_process_template_type_declaration PROTO((tree, int, struct binding_level*));
146 static void check_for_uninitialized_const_var PROTO((tree));
147 static unsigned long typename_hash PROTO((hash_table_key));
148 static boolean typename_compare PROTO((hash_table_key, hash_table_key));
149 static void push_binding PROTO((tree, tree, struct binding_level*));
150 static int add_binding PROTO((tree, tree));
151 static void pop_binding PROTO((tree, tree));
152 static tree local_variable_p PROTO((tree *));
153 static tree find_binding PROTO((tree, tree));
154 static tree select_decl PROTO((tree, int));
155 static int lookup_flags PROTO((int, int));
156 static tree qualify_lookup PROTO((tree, int));
157 static tree record_builtin_java_type PROTO((const char *, int));
158 static const char *tag_name PROTO((enum tag_types code));
159 static void find_class_binding_level PROTO((void));
160 static struct binding_level *innermost_nonclass_level PROTO((void));
161 static void warn_about_implicit_typename_lookup PROTO((tree, tree));
162 static int walk_namespaces_r PROTO((tree, walk_namespaces_fn, void *));
163 static int walk_globals_r PROTO((tree, void *));
164 static void add_decl_to_level PROTO((tree, struct binding_level *));
165 static tree make_label_decl PROTO((tree, int));
166 static void pop_label PROTO((tree));
167 static void pop_labels PROTO((tree));
168 static void maybe_deduce_size_from_array_init PROTO((tree, tree));
169 static void layout_var_decl PROTO((tree));
170 static void maybe_commonize_var PROTO((tree));
171 static tree check_initializer PROTO((tree, tree));
172 static void make_rtl_for_nonlocal_decl PROTO((tree, tree, const char *));
173 static void push_cp_function_context PROTO((struct function *));
174 static void pop_cp_function_context PROTO((struct function *));
175 static void mark_binding_level PROTO((void *));
176 static void mark_cp_function_context PROTO((struct function *));
177 static void mark_saved_scope PROTO((void *));
178 static void mark_lang_function PROTO((struct language_function *));
179 static void save_function_data PROTO((tree));
180 static void check_function_type PROTO((tree));
181 static void destroy_local_static PROTO((tree));
182 static void destroy_local_var PROTO((tree));
183 static void finish_constructor_body PROTO((void));
184 static void finish_destructor_body PROTO((void));
186 #if defined (DEBUG_CP_BINDING_LEVELS)
187 static void indent PROTO((void));
190 /* Erroneous argument lists can use this *IFF* they do not modify it. */
191 tree error_mark_list;
193 /* The following symbols are subsumed in the cp_global_trees array, and
194 listed here individually for documentation purposes.
197 tree wchar_decl_node;
200 tree vtable_entry_type;
201 tree delta_type_node;
204 tree __baselist_desc_type_node;
205 tree __i_desc_type_node, __m_desc_type_node;
206 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
208 tree __t_desc_type_node;
210 tree __tp_desc_type_node;
212 tree __access_mode_type_node;
213 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
214 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
215 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
217 Not needed yet? May be needed one day?
218 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
219 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
220 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
223 tree class_star_type_node;
224 tree class_type_node, record_type_node, union_type_node, enum_type_node;
225 tree unknown_type_node;
227 Array type `vtable_entry_type[]'
230 tree vtbl_ptr_type_node;
236 A FUNCTION_DECL which can call `abort'. Not necessarily the
237 one that the user will declare, but sufficient to be called
238 by routines that want to abort the program.
242 The FUNCTION_DECL for the default `::operator delete'.
244 tree global_delete_fndecl;
247 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
251 tree cp_global_trees[CPTI_MAX];
253 /* Indicates that there is a type value in some namespace, although
254 that is not necessarily in scope at the moment. */
256 static tree global_type_node;
261 /* Expect only namespace names now. */
262 static int only_namespace_names;
264 /* In a destructor, the last insn emitted after the start of the
265 function and the parms. */
267 #define last_dtor_insn cp_function_chain->x_last_dtor_insn
269 /* In a constructor, the last insn emitted after the start of the
270 function and the parms, the exception specification and any
271 function-try-block. The constructor initializers are emitted after
274 #define last_parm_cleanup_insn cp_function_chain->x_last_parm_cleanup_insn
276 /* If original DECL_RESULT of current function was a register,
277 but due to being an addressable named return value, would up
278 on the stack, this variable holds the named return value's
279 original location. */
281 #define original_result_rtx cp_function_chain->x_result_rtx
283 struct named_label_list
285 struct binding_level *binding_level;
288 const char *filename_o_goto;
290 struct named_label_list *next;
293 /* Used only for jumps to as-yet undefined labels, since jumps to
294 defined labels can have their validity checked by stmt.c. */
296 #define named_label_uses cp_function_chain->x_named_label_uses
298 /* A list of objects which have constructors or destructors
299 which reside in the global scope. The decl is stored in
300 the TREE_VALUE slot and the initializer is stored
301 in the TREE_PURPOSE slot. */
302 tree static_aggregates;
306 /* A node for the integer constants 2, and 3. */
308 tree integer_two_node, integer_three_node;
310 /* While defining an enum type, this is 1 plus the last enumerator
313 static tree enum_next_value;
315 /* Nonzero means that there was overflow computing enum_next_value. */
317 static int enum_overflow;
319 /* Parsing a function declarator leaves here a chain of structure
320 and enum types declared in the parmlist. */
322 static tree last_function_parm_tags;
324 /* Similar, for last_function_parm_tags. */
325 tree last_function_parms;
326 static tree current_function_parm_tags;
328 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
329 that have names. Here so we can clear out their names' definitions
330 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
331 TREE_PURPOSE is the previous binding of the label. */
333 #define named_labels cp_function_chain->x_named_labels
335 /* The FUNCTION_DECL for the function currently being compiled,
336 or 0 if between functions. */
337 tree current_function_decl;
339 /* Set to 0 at beginning of a function definition, and whenever
340 a label (case or named) is defined. Set to value of expression
341 returned from function when that value can be transformed into
342 a named return value. */
344 tree current_function_return_value;
346 /* Nonzero means give `double' the same size as `float'. */
348 extern int flag_short_double;
350 /* Nonzero means don't recognize any builtin functions. */
352 extern int flag_no_builtin;
354 /* Nonzero means don't recognize the non-ANSI builtin functions.
357 extern int flag_no_nonansi_builtin;
359 /* Nonzero means enable obscure ANSI features and disable GNU extensions
360 that might cause ANSI-compliant code to be miscompiled. */
362 extern int flag_ansi;
364 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
366 extern int flag_huge_objects;
368 /* Nonzero if we want to conserve space in the .o files. We do this
369 by putting uninitialized data and runtime initialized data into
370 .common instead of .data at the expense of not flagging multiple
372 extern int flag_conserve_space;
374 /* C and C++ flags are in decl2.c. */
376 /* Flag used when debugging spew.c */
378 extern int spew_debug;
380 /* A expression of value 0 with the same precision as a sizetype
382 tree signed_size_zero_node;
384 /* The name of the anonymous namespace, throughout this translation
386 tree anonymous_namespace_name;
389 /* Allocate a level of searching. */
393 push_decl_level (stack, obstack)
394 struct stack_level *stack;
395 struct obstack *obstack;
397 struct stack_level tem;
400 return push_stack_level (obstack, (char *)&tem, sizeof (tem));
403 /* For each binding contour we allocate a binding_level structure
404 which records the names defined in that contour.
407 1) one for each function definition,
408 where internal declarations of the parameters appear.
409 2) one for each compound statement,
410 to record its declarations.
412 The current meaning of a name can be found by searching the levels
413 from the current one out to the global one.
415 Off to the side, may be the class_binding_level. This exists only
416 to catch class-local declarations. It is otherwise nonexistent.
418 Also there may be binding levels that catch cleanups that must be
419 run when exceptions occur. Thus, to see whether a name is bound in
420 the current scope, it is not enough to look in the
421 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
424 /* Note that the information in the `names' component of the global contour
425 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
429 /* A chain of _DECL nodes for all variables, constants, functions,
430 and typedef types. These are in the reverse of the order
431 supplied. There may be OVERLOADs on this list, too, but they
432 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
435 /* A list of structure, union and enum definitions, for looking up
437 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
438 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
439 or ENUMERAL_TYPE node.
441 C++: the TREE_VALUE nodes can be simple types for
442 component_bindings. */
445 /* A list of USING_DECL nodes. */
448 /* A list of used namespaces. PURPOSE is the namespace,
449 VALUE the common ancestor with this binding_level's namespace. */
450 tree using_directives;
452 /* If this binding level is the binding level for a class, then
453 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
454 is the name of an entity bound in the class; the TREE_VALUE is
455 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
456 when leaving class scope, we can restore the
457 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
458 the DECL bound by this name in the class. */
461 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
462 is used for all binding levels. */
465 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
466 label in this scope. The TREE_PURPOSE is the previous value of
467 the IDENTIFIER_LABEL VALUE. */
468 tree shadowed_labels;
470 /* For each level (except not the global one),
471 a chain of BLOCK nodes for all the levels
472 that were entered and exited one level down. */
475 /* The BLOCK node for this level, if one has been preallocated.
476 If 0, the BLOCK is allocated (if needed) when the level is popped. */
479 /* The binding level which this one is contained in (inherits from). */
480 struct binding_level *level_chain;
482 /* List of decls in `names' that have incomplete
483 structure or union types. */
486 /* List of VAR_DECLS saved from a previous for statement.
487 These would be dead in ANSI-conforming code, but might
488 be referenced in ARM-era code. These are stored in a
489 TREE_LIST; the TREE_VALUE is the actual declaration. */
490 tree dead_vars_from_for;
492 /* 1 for the level that holds the parameters of a function.
493 2 for the level that holds a class declaration.
494 3 for levels that hold parameter declarations. */
495 unsigned parm_flag : 4;
497 /* 1 means make a BLOCK for this level regardless of all else.
498 2 for temporary binding contours created by the compiler. */
501 /* Nonzero if this level "doesn't exist" for tags. */
502 unsigned tag_transparent : 1;
504 /* Nonzero if this level can safely have additional
505 cleanup-needing variables added to it. */
506 unsigned more_cleanups_ok : 1;
507 unsigned have_cleanups : 1;
509 /* Nonzero if this level is for storing the decls for template
510 parameters and generic decls; these decls will be discarded and
511 replaced with a TEMPLATE_DECL. */
512 unsigned pseudo_global : 1;
514 /* This is set for a namespace binding level. */
515 unsigned namespace_p : 1;
517 /* True if this level is that of a for-statement where we need to
518 worry about ambiguous (ARM or ANSI) scope rules. */
519 unsigned is_for_scope : 1;
521 /* True if this level corresponds to an EH region, as for a try block. */
522 unsigned eh_region : 1;
524 /* One bit left for this word. */
526 #if defined(DEBUG_CP_BINDING_LEVELS)
527 /* Binding depth at which this level began. */
528 unsigned binding_depth;
529 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
532 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
534 /* The binding level currently in effect. */
536 #define current_binding_level \
538 ? cp_function_chain->bindings \
539 : scope_chain->bindings)
541 /* The binding level of the current class, if any. */
543 #define class_binding_level scope_chain->class_bindings
545 /* A chain of binding_level structures awaiting reuse. */
547 static struct binding_level *free_binding_level;
549 /* The outermost binding level, for names of file scope.
550 This is created when the compiler is started and exists
551 through the entire run. */
553 static struct binding_level *global_binding_level;
555 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
557 static int keep_next_level_flag;
559 #if defined(DEBUG_CP_BINDING_LEVELS)
560 static int binding_depth = 0;
561 static int is_class_level = 0;
568 for (i = 0; i < binding_depth*2; i++)
571 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
573 static tree pushdecl_with_scope PROTO((tree, struct binding_level *));
576 push_binding_level (newlevel, tag_transparent, keep)
577 struct binding_level *newlevel;
578 int tag_transparent, keep;
580 /* Add this level to the front of the chain (stack) of levels that
582 bzero ((char*) newlevel, sizeof (struct binding_level));
583 newlevel->level_chain = current_binding_level;
584 current_binding_level = newlevel;
585 newlevel->tag_transparent = tag_transparent;
586 newlevel->more_cleanups_ok = 1;
588 /* We are called before expand_start_bindings, but after
589 expand_eh_region_start for a try block; so we check this now,
590 before the EH block is covered up. */
591 newlevel->eh_region = is_eh_region ();
593 newlevel->keep = keep;
594 #if defined(DEBUG_CP_BINDING_LEVELS)
595 newlevel->binding_depth = binding_depth;
597 fprintf (stderr, "push %s level 0x%08x line %d\n",
598 (is_class_level) ? "class" : "block", newlevel, lineno);
601 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
604 /* Find the innermost enclosing class scope, and reset
605 CLASS_BINDING_LEVEL appropriately. */
608 find_class_binding_level ()
610 struct binding_level *level = current_binding_level;
612 while (level && level->parm_flag != 2)
613 level = level->level_chain;
614 if (level && level->parm_flag == 2)
615 class_binding_level = level;
617 class_binding_level = 0;
623 if (global_binding_level)
625 /* Cannot pop a level, if there are none left to pop. */
626 if (current_binding_level == global_binding_level)
627 my_friendly_abort (123);
629 /* Pop the current level, and free the structure for reuse. */
630 #if defined(DEBUG_CP_BINDING_LEVELS)
633 fprintf (stderr, "pop %s level 0x%08x line %d\n",
634 (is_class_level) ? "class" : "block",
635 current_binding_level, lineno);
636 if (is_class_level != (current_binding_level == class_binding_level))
639 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
642 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
644 register struct binding_level *level = current_binding_level;
645 current_binding_level = current_binding_level->level_chain;
646 level->level_chain = free_binding_level;
647 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
648 if (level->binding_depth != binding_depth)
650 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
651 free_binding_level = level;
652 find_class_binding_level ();
657 suspend_binding_level ()
659 if (class_binding_level)
660 current_binding_level = class_binding_level;
662 if (global_binding_level)
664 /* Cannot suspend a level, if there are none left to suspend. */
665 if (current_binding_level == global_binding_level)
666 my_friendly_abort (123);
668 /* Suspend the current level. */
669 #if defined(DEBUG_CP_BINDING_LEVELS)
672 fprintf (stderr, "suspend %s level 0x%08x line %d\n",
673 (is_class_level) ? "class" : "block",
674 current_binding_level, lineno);
675 if (is_class_level != (current_binding_level == class_binding_level))
678 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
681 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
682 current_binding_level = current_binding_level->level_chain;
683 find_class_binding_level ();
687 resume_binding_level (b)
688 struct binding_level *b;
690 /* Resuming binding levels is meant only for namespaces,
691 and those cannot nest into classes. */
692 my_friendly_assert(!class_binding_level, 386);
693 /* Also, resuming a non-directly nested namespace is a no-no. */
694 my_friendly_assert(b->level_chain == current_binding_level, 386);
695 current_binding_level = b;
696 #if defined(DEBUG_CP_BINDING_LEVELS)
697 b->binding_depth = binding_depth;
699 fprintf (stderr, "resume %s level 0x%08x line %d\n",
700 (is_class_level) ? "class" : "block", b, lineno);
703 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
706 /* Create a new `struct binding_level'. */
709 struct binding_level *
710 make_binding_level ()
713 return (struct binding_level *) xmalloc (sizeof (struct binding_level));
716 /* Nonzero if we are currently in the global binding level. */
721 return current_binding_level == global_binding_level;
724 /* Return the innermost binding level that is not for a class scope. */
726 static struct binding_level *
727 innermost_nonclass_level ()
729 struct binding_level *b;
731 b = current_binding_level;
732 while (b->parm_flag == 2)
738 /* Nonzero if we are currently in a toplevel binding level. This
739 means either the global binding level or a namespace in a toplevel
740 binding level. Since there are no non-toplevel namespace levels,
741 this really means any namespace or pseudo-global level. We also
742 include a class whose context is toplevel. */
745 toplevel_bindings_p ()
747 struct binding_level *b = innermost_nonclass_level ();
749 return b->namespace_p || b->pseudo_global;
752 /* Nonzero if this is a namespace scope, or if we are defining a class
753 which is itself at namespace scope, or whose enclosing class is
754 such a class, etc. */
757 namespace_bindings_p ()
759 struct binding_level *b = innermost_nonclass_level ();
761 return b->namespace_p;
764 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
765 unconditionally. Otherwise, use the normal logic to decide whether
766 or not to create a BLOCK. */
769 keep_next_level (keep)
772 keep_next_level_flag = keep;
775 /* Nonzero if the current level needs to have a BLOCK made. */
780 return (current_binding_level->blocks != NULL_TREE
781 || current_binding_level->keep
782 || current_binding_level->names != NULL_TREE
783 || (current_binding_level->tags != NULL_TREE
784 && !current_binding_level->tag_transparent));
788 declare_pseudo_global_level ()
790 current_binding_level->pseudo_global = 1;
794 declare_namespace_level ()
796 current_binding_level->namespace_p = 1;
800 pseudo_global_level_p ()
802 return current_binding_level->pseudo_global;
806 set_class_shadows (shadows)
809 class_binding_level->class_shadowed = shadows;
812 /* Enter a new binding level.
813 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
814 not for that of tags. */
817 pushlevel (tag_transparent)
820 struct binding_level *newlevel;
822 if (current_function && !doing_semantic_analysis_p ())
825 /* Reuse or create a struct for this binding level. */
826 #if defined(DEBUG_CP_BINDING_LEVELS)
828 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
829 if (free_binding_level)
830 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
832 newlevel = free_binding_level;
833 free_binding_level = free_binding_level->level_chain;
836 newlevel = make_binding_level ();
838 push_binding_level (newlevel, tag_transparent, keep_next_level_flag);
839 GNU_xref_start_scope ((HOST_WIDE_INT) newlevel);
840 keep_next_level_flag = 0;
844 note_level_for_for ()
846 current_binding_level->is_for_scope = 1;
850 pushlevel_temporary (tag_transparent)
853 pushlevel (tag_transparent);
854 current_binding_level->keep = 2;
857 /* Note we don't call push_momentary() here. Otherwise, it would cause
858 cleanups to be allocated on the momentary obstack, and they will be
859 overwritten by the next statement. */
861 expand_start_bindings (0);
864 /* For a binding between a name and an entity at a block scope,
865 this is the `struct binding_level' for the block. */
866 #define BINDING_LEVEL(NODE) \
867 (((struct tree_binding*)NODE)->scope.level)
869 /* Make DECL the innermost binding for ID. The LEVEL is the binding
870 level at which this declaration is being bound. */
873 push_binding (id, decl, level)
876 struct binding_level* level;
880 binding = make_node (CPLUS_BINDING);
882 /* Now, fill in the binding information. */
883 BINDING_VALUE (binding) = decl;
884 BINDING_TYPE (binding) = NULL_TREE;
885 BINDING_LEVEL (binding) = level;
886 INHERITED_VALUE_BINDING_P (binding) = 0;
887 LOCAL_BINDING_P (binding) = (level != class_binding_level);
888 BINDING_HAS_LEVEL_P (binding) = 1;
890 /* And put it on the front of the list of bindings for ID. */
891 TREE_CHAIN (binding) = IDENTIFIER_BINDING (id);
892 IDENTIFIER_BINDING (id) = binding;
895 /* ID is already bound in the current scope. But, DECL is an
896 additional binding for ID in the same scope. This is the `struct
897 stat' hack whereby a non-typedef class-name or enum-name can be
898 bound at the same level as some other kind of entity. It's the
899 responsibility of the caller to check that inserting this name is
900 legal here. Returns nonzero if the new binding was successful. */
902 add_binding (id, decl)
906 tree binding = IDENTIFIER_BINDING (id);
909 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
910 /* The new name is the type name. */
911 BINDING_TYPE (binding) = decl;
912 else if (!BINDING_VALUE (binding))
913 /* This situation arises when push_class_level_binding moves an
914 inherited type-binding out of the way to make room for a new
916 BINDING_VALUE (binding) = decl;
917 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
918 && DECL_ARTIFICIAL (BINDING_VALUE (binding)))
920 /* The old binding was a type name. It was placed in
921 BINDING_VALUE because it was thought, at the point it was
922 declared, to be the only entity with such a name. Move the
923 type name into the type slot; it is now hidden by the new
925 BINDING_TYPE (binding) = BINDING_VALUE (binding);
926 BINDING_VALUE (binding) = decl;
927 INHERITED_VALUE_BINDING_P (binding) = 0;
929 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
930 && TREE_CODE (decl) == TYPE_DECL
931 && DECL_NAME (decl) == DECL_NAME (BINDING_VALUE (binding))
932 && same_type_p (TREE_TYPE (decl),
933 TREE_TYPE (BINDING_VALUE (binding))))
934 /* We have two typedef-names, both naming the same type to have
935 the same name. This is OK because of:
939 In a given scope, a typedef specifier can be used to redefine
940 the name of any type declared in that scope to refer to the
941 type to which it already refers. */
945 cp_error ("declaration of `%#D'", decl);
946 cp_error_at ("conflicts with previous declaration `%#D'",
947 BINDING_VALUE (binding));
954 /* Add DECL to the list of things declared in B. */
957 add_decl_to_level (decl, b)
959 struct binding_level *b;
961 /* We build up the list in reverse order, and reverse it later if
963 TREE_CHAIN (decl) = b->names;
967 /* Bind DECL to ID in the current_binding_level, assumed to be a local
968 binding level. If PUSH_USING is set in FLAGS, we know that DECL
969 doesn't really belong to this binding level, that it got here
970 through a using-declaration. */
973 push_local_binding (id, decl, flags)
978 struct binding_level *b;
980 /* Skip over any local classes. This makes sense if we call
981 push_local_binding with a friend decl of a local class. */
982 b = current_binding_level;
983 while (b->parm_flag == 2)
986 if (lookup_name_current_level (id))
988 /* Supplement the existing binding. */
989 if (!add_binding (id, decl))
990 /* It didn't work. Something else must be bound at this
991 level. Do not add DECL to the list of things to pop
996 /* Create a new binding. */
997 push_binding (id, decl, b);
999 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1000 /* We must put the OVERLOAD into a TREE_LIST since the
1001 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1002 decls that got here through a using-declaration. */
1003 decl = build_tree_list (NULL_TREE, decl);
1005 /* And put DECL on the list of things declared by the current
1007 add_decl_to_level (decl, b);
1010 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1011 binding was successful. */
1014 push_class_binding (id, decl)
1019 tree binding = IDENTIFIER_BINDING (id);
1022 /* Note that we declared this value so that we can issue an error if
1023 this an illegal redeclaration of a name already used for some
1025 note_name_declared_in_class (id, decl);
1027 if (binding && BINDING_LEVEL (binding) == class_binding_level)
1028 /* Supplement the existing binding. */
1029 result = add_binding (id, decl);
1031 /* Create a new binding. */
1032 push_binding (id, decl, class_binding_level);
1034 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1035 class-level declaration. Note that we do not use DECL here
1036 because of the possibility of the `struct stat' hack; if DECL is
1037 a class-name or enum-name we might prefer a field-name, or some
1039 IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id));
1041 /* If this is a binding from a base class, mark it as such. */
1042 binding = IDENTIFIER_BINDING (id);
1043 if (BINDING_VALUE (binding) == decl && TREE_CODE (decl) != TREE_LIST)
1045 /* Any implicit typename must be from a base-class. The
1046 context for an implicit typename declaration is always
1047 the derived class in which the lookup was done, so the checks
1048 based on the context of DECL below will not trigger. */
1049 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl))
1050 INHERITED_VALUE_BINDING_P (binding) = 1;
1053 if (TREE_CODE (decl) == OVERLOAD)
1054 context = DECL_REAL_CONTEXT (OVL_CURRENT (decl));
1057 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd',
1059 context = DECL_REAL_CONTEXT (decl);
1062 if (is_properly_derived_from (current_class_type, context))
1063 INHERITED_VALUE_BINDING_P (binding) = 1;
1065 INHERITED_VALUE_BINDING_P (binding) = 0;
1068 else if (BINDING_VALUE (binding) == decl)
1069 /* We only encounter a TREE_LIST when push_class_decls detects an
1070 ambiguity. Such an ambiguity can be overridden by a definition
1072 INHERITED_VALUE_BINDING_P (binding) = 1;
1077 /* Remove the binding for DECL which should be the innermost binding
1081 pop_binding (id, decl)
1087 if (id == NULL_TREE)
1088 /* It's easiest to write the loops that call this function without
1089 checking whether or not the entities involved have names. We
1090 get here for such an entity. */
1093 /* Get the innermost binding for ID. */
1094 binding = IDENTIFIER_BINDING (id);
1096 /* The name should be bound. */
1097 my_friendly_assert (binding != NULL_TREE, 0);
1099 /* The DECL will be either the ordinary binding or the type
1100 binding for this identifier. Remove that binding. */
1101 if (BINDING_VALUE (binding) == decl)
1102 BINDING_VALUE (binding) = NULL_TREE;
1103 else if (BINDING_TYPE (binding) == decl)
1104 BINDING_TYPE (binding) = NULL_TREE;
1106 my_friendly_abort (0);
1108 if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding))
1109 /* We're completely done with the innermost binding for this
1110 identifier. Unhook it from the list of bindings. */
1111 IDENTIFIER_BINDING (id) = TREE_CHAIN (binding);
1114 /* When a label goes out of scope, check to see if that label was used
1115 in a valid manner, and issue any appropriate warnings or errors. */
1121 tree label = TREE_VALUE (link);
1123 if (!processing_template_decl && doing_semantic_analysis_p ())
1125 if (DECL_INITIAL (label) == NULL_TREE)
1127 cp_error_at ("label `%D' used but not defined", label);
1128 /* Avoid crashing later. */
1129 define_label (input_filename, 1, DECL_NAME (label));
1131 else if (warn_unused && !TREE_USED (label))
1132 cp_warning_at ("label `%D' defined but not used", label);
1135 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), TREE_PURPOSE (link));
1138 /* At the end of a function, all labels declared within the fucntion
1139 go out of scope. BLOCK is the top-level block for the
1148 /* Clear out the definitions of all label names, since their scopes
1150 for (link = named_labels; link; link = TREE_CHAIN (link))
1153 /* Put the labels into the "variables" of the top-level block,
1154 so debugger can see them. */
1155 TREE_CHAIN (TREE_VALUE (link)) = BLOCK_VARS (block);
1156 BLOCK_VARS (block) = TREE_VALUE (link);
1159 named_labels = NULL_TREE;
1162 /* Exit a binding level.
1163 Pop the level off, and restore the state of the identifier-decl mappings
1164 that were in effect when this level was entered.
1166 If KEEP == 1, this level had explicit declarations, so
1167 and create a "block" (a BLOCK node) for the level
1168 to record its declarations and subblocks for symbol table output.
1170 If FUNCTIONBODY is nonzero, this level is the body of a function,
1171 so create a block as if KEEP were set and also clear out all
1174 If REVERSE is nonzero, reverse the order of decls before putting
1175 them into the BLOCK. */
1178 poplevel (keep, reverse, functionbody)
1184 /* The chain of decls was accumulated in reverse order.
1185 Put it into forward order, just for cleanliness. */
1187 int tmp = functionbody;
1188 int real_functionbody;
1191 tree block = NULL_TREE;
1193 int block_previously_created;
1194 int leaving_for_scope;
1196 if (current_function && !doing_semantic_analysis_p ())
1199 my_friendly_assert (current_binding_level->parm_flag != 2,
1202 real_functionbody = (current_binding_level->keep == 2
1203 ? ((functionbody = 0), tmp) : functionbody);
1204 tags = functionbody >= 0 ? current_binding_level->tags : 0;
1205 subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1207 my_friendly_assert (!current_binding_level->class_shadowed,
1210 /* We used to use KEEP == 2 to indicate that the new block should go
1211 at the beginning of the list of blocks at this binding level,
1212 rather than the end. This hack is no longer used. */
1213 my_friendly_assert (keep == 0 || keep == 1, 0);
1215 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
1216 (HOST_WIDE_INT) current_binding_level->level_chain,
1217 current_binding_level->parm_flag,
1218 current_binding_level->keep);
1220 if (current_binding_level->keep == 1)
1223 /* Get the decls in the order they were written.
1224 Usually current_binding_level->names is in reverse order.
1225 But parameter decls were previously put in forward order. */
1228 current_binding_level->names
1229 = decls = nreverse (current_binding_level->names);
1231 decls = current_binding_level->names;
1233 /* Output any nested inline functions within this block
1234 if they weren't already output. */
1236 for (decl = decls; decl; decl = TREE_CHAIN (decl))
1237 if (TREE_CODE (decl) == FUNCTION_DECL
1238 && ! TREE_ASM_WRITTEN (decl)
1239 && DECL_INITIAL (decl) != NULL_TREE
1240 && TREE_ADDRESSABLE (decl)
1241 && decl_function_context (decl) == current_function_decl)
1243 /* If this decl was copied from a file-scope decl
1244 on account of a block-scope extern decl,
1245 propagate TREE_ADDRESSABLE to the file-scope decl. */
1246 if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1247 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1250 push_function_context ();
1251 output_inline_function (decl);
1252 pop_function_context ();
1256 /* If there were any declarations or structure tags in that level,
1257 or if this level is a function body,
1258 create a BLOCK to record them for the life of this function. */
1261 block_previously_created = (current_binding_level->this_block != NULL_TREE);
1262 if (block_previously_created)
1263 block = current_binding_level->this_block;
1264 else if (keep == 1 || functionbody)
1265 block = make_node (BLOCK);
1266 if (block != NULL_TREE)
1268 if (block_previously_created)
1270 if (decls || tags || subblocks)
1272 if (BLOCK_VARS (block) || BLOCK_TYPE_TAGS (block))
1273 warning ("internal compiler error: debugging info corrupted");
1275 BLOCK_VARS (block) = decls;
1276 BLOCK_TYPE_TAGS (block) = tags;
1278 /* We can have previous subblocks and new subblocks when
1279 doing fixup_gotos with complex cleanups. We chain the new
1280 subblocks onto the end of any pre-existing subblocks. */
1281 BLOCK_SUBBLOCKS (block) = chainon (BLOCK_SUBBLOCKS (block),
1284 /* If we created the block earlier on, and we are just
1285 diddling it now, then it already should have a proper
1286 BLOCK_END_NOTE value associated with it. */
1290 BLOCK_VARS (block) = decls;
1291 BLOCK_TYPE_TAGS (block) = tags;
1292 BLOCK_SUBBLOCKS (block) = subblocks;
1293 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1295 remember_end_note (block);
1299 /* In each subblock, record that this is its superior. */
1302 for (link = subblocks; link; link = TREE_CHAIN (link))
1303 BLOCK_SUPERCONTEXT (link) = block;
1305 /* We still support the old for-scope rules, whereby the variables
1306 in a for-init statement were in scope after the for-statement
1307 ended. We only use the new rules in flag_new_for_scope is
1310 = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1312 /* Remove declarations for all the DECLs in this level. */
1313 for (link = decls; link; link = TREE_CHAIN (link))
1315 if (leaving_for_scope && TREE_CODE (link) == VAR_DECL)
1318 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1322 ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1324 ns_binding = NULL_TREE;
1327 && (BINDING_LEVEL (outer_binding)
1328 == current_binding_level->level_chain))
1329 /* We have something like:
1334 and we are leaving the `for' scope. There's no reason to
1335 keep the binding of the inner `i' in this case. */
1336 pop_binding (DECL_NAME (link), link);
1337 else if ((outer_binding
1338 && (TREE_CODE (BINDING_VALUE (outer_binding))
1341 && TREE_CODE (ns_binding) == TYPE_DECL))
1342 /* Here, we have something like:
1350 We must pop the for-scope binding so we know what's a
1351 type and what isn't. */
1352 pop_binding (DECL_NAME (link), link);
1355 /* Mark this VAR_DECL as dead so that we can tell we left it
1356 there only for backward compatibility. */
1357 DECL_DEAD_FOR_LOCAL (link) = 1;
1359 /* Keep track of what should of have happenned when we
1360 popped the binding. */
1361 if (outer_binding && BINDING_VALUE (outer_binding))
1362 DECL_SHADOWED_FOR_VAR (link)
1363 = BINDING_VALUE (outer_binding);
1365 /* Add it to the list of dead variables in the next
1366 outermost binding to that we can remove these when we
1367 leave that binding. */
1368 current_binding_level->level_chain->dead_vars_from_for
1369 = tree_cons (NULL_TREE, link,
1370 current_binding_level->level_chain->
1371 dead_vars_from_for);
1373 /* Although we don't pop the CPLUS_BINDING, we do clear
1374 its BINDING_LEVEL since the level is going away now. */
1375 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1381 /* Remove the binding. */
1383 if (TREE_CODE (decl) == TREE_LIST)
1384 decl = TREE_VALUE (decl);
1385 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd')
1386 pop_binding (DECL_NAME (decl), decl);
1387 else if (TREE_CODE (decl) == OVERLOAD)
1388 pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl);
1390 my_friendly_abort (0);
1394 /* Remove declarations for any `for' variables from inner scopes
1395 that we kept around. */
1396 for (link = current_binding_level->dead_vars_from_for;
1397 link; link = TREE_CHAIN (link))
1398 pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1400 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1401 for (link = current_binding_level->type_shadowed;
1402 link; link = TREE_CHAIN (link))
1403 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1405 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1406 for (link = current_binding_level->shadowed_labels;
1408 link = TREE_CHAIN (link))
1411 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1412 list if a `using' declaration put them there. The debugging
1413 back-ends won't understand OVERLOAD, so we remove them here.
1414 Because the BLOCK_VARS are (temporarily) shared with
1415 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1416 popped all the bindings. */
1421 for (d = &BLOCK_VARS (block); *d; )
1423 if (TREE_CODE (*d) == TREE_LIST)
1424 *d = TREE_CHAIN (*d);
1426 d = &TREE_CHAIN (*d);
1430 /* If the level being exited is the top level of a function,
1431 check over all the labels. */
1434 /* Since this is the top level block of a function, the vars are
1435 the function's parameters. Don't leave them in the BLOCK
1436 because they are found in the FUNCTION_DECL instead. */
1437 BLOCK_VARS (block) = 0;
1441 /* Any uses of undefined labels now operate under constraints
1442 of next binding contour. */
1443 if (current_function)
1445 struct binding_level *level_chain;
1446 level_chain = current_binding_level->level_chain;
1449 struct named_label_list *labels;
1450 for (labels = named_label_uses; labels; labels = labels->next)
1451 if (labels->binding_level == current_binding_level)
1453 labels->binding_level = level_chain;
1454 labels->names_in_scope = level_chain->names;
1459 tmp = current_binding_level->keep;
1461 pop_binding_level ();
1463 DECL_INITIAL (current_function_decl) = block;
1466 if (!block_previously_created)
1467 current_binding_level->blocks
1468 = chainon (current_binding_level->blocks, block);
1470 /* If we did not make a block for the level just exited,
1471 any blocks made for inner levels
1472 (since they cannot be recorded as subblocks in that level)
1473 must be carried forward so they will later become subblocks
1474 of something else. */
1476 current_binding_level->blocks
1477 = chainon (current_binding_level->blocks, subblocks);
1479 /* Take care of compiler's internal binding structures. */
1482 expand_end_bindings (getdecls (), keep, 1);
1483 /* Each and every BLOCK node created here in `poplevel' is important
1484 (e.g. for proper debugging information) so if we created one
1485 earlier, mark it as "used". */
1487 TREE_USED (block) = 1;
1488 block = poplevel (keep, reverse, real_functionbody);
1491 /* Each and every BLOCK node created here in `poplevel' is important
1492 (e.g. for proper debugging information) so if we created one
1493 earlier, mark it as "used". */
1495 TREE_USED (block) = 1;
1499 /* Delete the node BLOCK from the current binding level.
1500 This is used for the block inside a stmt expr ({...})
1501 so that the block can be reinserted where appropriate. */
1504 delete_block (block)
1508 if (current_binding_level->blocks == block)
1509 current_binding_level->blocks = TREE_CHAIN (block);
1510 for (t = current_binding_level->blocks; t;)
1512 if (TREE_CHAIN (t) == block)
1513 TREE_CHAIN (t) = TREE_CHAIN (block);
1517 TREE_CHAIN (block) = NULL_TREE;
1518 /* Clear TREE_USED which is always set by poplevel.
1519 The flag is set again if insert_block is called. */
1520 TREE_USED (block) = 0;
1523 /* Insert BLOCK at the end of the list of subblocks of the
1524 current binding level. This is used when a BIND_EXPR is expanded,
1525 to handle the BLOCK node inside the BIND_EXPR. */
1528 insert_block (block)
1531 TREE_USED (block) = 1;
1532 current_binding_level->blocks
1533 = chainon (current_binding_level->blocks, block);
1536 /* Set the BLOCK node for the innermost scope
1537 (the one we are currently in). */
1541 register tree block;
1543 current_binding_level->this_block = block;
1546 /* Do a pushlevel for class declarations. */
1551 register struct binding_level *newlevel;
1553 /* Reuse or create a struct for this binding level. */
1554 #if defined(DEBUG_CP_BINDING_LEVELS)
1556 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1557 if (free_binding_level)
1558 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1560 newlevel = free_binding_level;
1561 free_binding_level = free_binding_level->level_chain;
1564 newlevel = make_binding_level ();
1566 #if defined(DEBUG_CP_BINDING_LEVELS)
1568 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1570 push_binding_level (newlevel, 0, 0);
1572 decl_stack = push_decl_level (decl_stack, &decl_obstack);
1573 class_binding_level = current_binding_level;
1574 class_binding_level->parm_flag = 2;
1577 /* ...and a poplevel for class declarations. */
1582 register struct binding_level *level = class_binding_level;
1585 my_friendly_assert (level != 0, 354);
1587 decl_stack = pop_stack_level (decl_stack);
1588 /* If we're leaving a toplevel class, don't bother to do the setting
1589 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1590 shouldn't even be used when current_class_type isn't set, and second,
1591 if we don't touch it here, we're able to use the cache effect if the
1592 next time we're entering a class scope, it is the same class. */
1593 if (current_class_depth != 1)
1595 struct binding_level* b;
1597 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1598 for (shadowed = level->class_shadowed;
1600 shadowed = TREE_CHAIN (shadowed))
1601 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE;
1603 /* Find the next enclosing class, and recreate
1604 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1605 b = level->level_chain;
1606 while (b && b->parm_flag != 2)
1610 for (shadowed = b->class_shadowed;
1612 shadowed = TREE_CHAIN (shadowed))
1616 t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed));
1617 while (t && BINDING_LEVEL (t) != b)
1621 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed))
1622 = BINDING_VALUE (t);
1626 /* Remember to save what IDENTIFIER's were bound in this scope so we
1627 can recover from cache misses. */
1629 previous_class_type = current_class_type;
1630 previous_class_values = class_binding_level->class_shadowed;
1632 for (shadowed = level->type_shadowed;
1634 shadowed = TREE_CHAIN (shadowed))
1635 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1637 /* Remove the bindings for all of the class-level declarations. */
1638 for (shadowed = level->class_shadowed;
1640 shadowed = TREE_CHAIN (shadowed))
1641 pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1643 GNU_xref_end_scope ((HOST_WIDE_INT) class_binding_level,
1644 (HOST_WIDE_INT) class_binding_level->level_chain,
1645 class_binding_level->parm_flag,
1646 class_binding_level->keep);
1648 /* Now, pop out of the binding level which we created up in the
1649 `pushlevel_class' routine. */
1650 #if defined(DEBUG_CP_BINDING_LEVELS)
1652 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1654 pop_binding_level ();
1657 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1658 for any names in enclosing classes. */
1661 clear_identifier_class_values ()
1665 if (!class_binding_level)
1668 for (t = class_binding_level->class_shadowed;
1671 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
1674 /* Returns non-zero if T is a virtual function table. */
1677 vtable_decl_p (t, data)
1679 void *data ATTRIBUTE_UNUSED;
1681 return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t));
1684 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1688 vtype_decl_p (t, data)
1690 void *data ATTRIBUTE_UNUSED;
1692 return (TREE_CODE (t) == TYPE_DECL
1693 && TREE_TYPE (t) != error_mark_node
1694 && TYPE_LANG_SPECIFIC (TREE_TYPE (t))
1695 && CLASSTYPE_VSIZE (TREE_TYPE (t)));
1698 /* Return the declarations that are members of the namespace NS. */
1701 cp_namespace_decls (ns)
1704 return NAMESPACE_LEVEL (ns)->names;
1707 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1708 itself, calling F for each. The DATA is passed to F as well. */
1711 walk_namespaces_r (namespace, f, data)
1713 walk_namespaces_fn f;
1719 result |= (*f) (namespace, data);
1721 for (current = cp_namespace_decls (namespace);
1723 current = TREE_CHAIN (current))
1725 if (TREE_CODE (current) != NAMESPACE_DECL
1726 || DECL_NAMESPACE_ALIAS (current))
1728 if (!DECL_LANG_SPECIFIC (current))
1731 my_friendly_assert (current == std_node, 393);
1735 /* We found a namespace. */
1736 result |= walk_namespaces_r (current, f, data);
1742 /* Walk all the namespaces, calling F for each. The DATA is passed to
1746 walk_namespaces (f, data)
1747 walk_namespaces_fn f;
1750 return walk_namespaces_r (global_namespace, f, data);
1753 struct walk_globals_data {
1754 walk_globals_pred p;
1759 /* Walk the global declarations in NAMESPACE. Whenever one is found
1760 for which P returns non-zero, call F with its address. If any call
1761 to F returns a non-zero value, return a non-zero value. */
1764 walk_globals_r (namespace, data)
1768 struct walk_globals_data* wgd = (struct walk_globals_data *) data;
1769 walk_globals_pred p = wgd->p;
1770 walk_globals_fn f = wgd->f;
1771 void *d = wgd->data;
1775 t = &NAMESPACE_LEVEL (namespace)->names;
1782 result |= (*f) (t, d);
1784 /* If F changed *T, then *T still points at the next item to
1787 t = &TREE_CHAIN (*t);
1793 /* Walk the global declarations. Whenever one is found for which P
1794 returns non-zero, call F with its address. If any call to F
1795 returns a non-zero value, return a non-zero value. */
1798 walk_globals (p, f, data)
1799 walk_globals_pred p;
1803 struct walk_globals_data wgd;
1808 return walk_namespaces (walk_globals_r, &wgd);
1811 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1812 DATA is non-NULL, this is the last time we will call
1813 wrapup_global_declarations for this NAMESPACE. */
1816 wrapup_globals_for_namespace (namespace, data)
1820 tree globals = cp_namespace_decls (namespace);
1821 int len = list_length (globals);
1822 tree *vec = (tree *) alloca (sizeof (tree) * len);
1826 int last_time = (data != 0);
1828 if (last_time && namespace == global_namespace)
1829 /* Let compile_file handle the global namespace. */
1832 /* Process the decls in reverse order--earliest first.
1833 Put them into VEC from back to front, then take out from front. */
1835 for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl))
1836 vec[len - i - 1] = decl;
1840 check_global_declarations (vec, len);
1844 /* Temporarily mark vtables as external. That prevents
1845 wrapup_global_declarations from writing them out; we must process
1846 them ourselves in finish_vtable_vardecl. */
1847 for (i = 0; i < len; ++i)
1848 if (vtable_decl_p (vec[i], /*data=*/0) && !DECL_EXTERNAL (vec[i]))
1850 DECL_NOT_REALLY_EXTERN (vec[i]) = 1;
1851 DECL_EXTERNAL (vec[i]) = 1;
1854 /* Write out any globals that need to be output. */
1855 result = wrapup_global_declarations (vec, len);
1857 /* Undo the hack to DECL_EXTERNAL above. */
1858 for (i = 0; i < len; ++i)
1859 if (vtable_decl_p (vec[i], /*data=*/0)
1860 && DECL_NOT_REALLY_EXTERN (vec[i]))
1862 DECL_NOT_REALLY_EXTERN (vec[i]) = 0;
1863 DECL_EXTERNAL (vec[i]) = 0;
1870 /* Mark ARG (which is really a struct binding_level **) for GC. */
1873 mark_binding_level (arg)
1876 struct binding_level *lvl = *(struct binding_level **)arg;
1880 ggc_mark_tree (lvl->names);
1881 ggc_mark_tree (lvl->tags);
1882 ggc_mark_tree (lvl->usings);
1883 ggc_mark_tree (lvl->using_directives);
1884 ggc_mark_tree (lvl->class_shadowed);
1885 ggc_mark_tree (lvl->type_shadowed);
1886 ggc_mark_tree (lvl->shadowed_labels);
1887 ggc_mark_tree (lvl->blocks);
1888 ggc_mark_tree (lvl->this_block);
1889 ggc_mark_tree (lvl->incomplete);
1890 ggc_mark_tree (lvl->dead_vars_from_for);
1892 lvl = lvl->level_chain;
1896 /* For debugging. */
1897 static int no_print_functions = 0;
1898 static int no_print_builtins = 0;
1901 print_binding_level (lvl)
1902 struct binding_level *lvl;
1906 fprintf (stderr, " blocks=");
1907 fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks);
1908 fprintf (stderr, " n_incomplete=%d parm_flag=%d keep=%d",
1909 list_length (lvl->incomplete), lvl->parm_flag, lvl->keep);
1910 if (lvl->tag_transparent)
1911 fprintf (stderr, " tag-transparent");
1912 if (lvl->more_cleanups_ok)
1913 fprintf (stderr, " more-cleanups-ok");
1914 if (lvl->have_cleanups)
1915 fprintf (stderr, " have-cleanups");
1916 fprintf (stderr, "\n");
1919 fprintf (stderr, " names:\t");
1920 /* We can probably fit 3 names to a line? */
1921 for (t = lvl->names; t; t = TREE_CHAIN (t))
1923 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
1925 if (no_print_builtins
1926 && (TREE_CODE (t) == TYPE_DECL)
1927 && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
1930 /* Function decls tend to have longer names. */
1931 if (TREE_CODE (t) == FUNCTION_DECL)
1938 fprintf (stderr, "\n\t");
1941 print_node_brief (stderr, "", t, 0);
1942 if (t == error_mark_node)
1946 fprintf (stderr, "\n");
1950 fprintf (stderr, " tags:\t");
1952 for (t = lvl->tags; t; t = TREE_CHAIN (t))
1954 if (TREE_PURPOSE (t) == NULL_TREE)
1956 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1963 fprintf (stderr, "\n\t");
1966 if (TREE_PURPOSE (t) == NULL_TREE)
1968 print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
1969 fprintf (stderr, ">");
1971 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1972 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1975 print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
1976 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1977 fprintf (stderr, ">");
1981 fprintf (stderr, "\n");
1983 if (lvl->class_shadowed)
1985 fprintf (stderr, " class-shadowed:");
1986 for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
1988 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1990 fprintf (stderr, "\n");
1992 if (lvl->type_shadowed)
1994 fprintf (stderr, " type-shadowed:");
1995 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
1997 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1999 fprintf (stderr, "\n");
2004 print_other_binding_stack (stack)
2005 struct binding_level *stack;
2007 struct binding_level *level;
2008 for (level = stack; level != global_binding_level; level = level->level_chain)
2010 fprintf (stderr, "binding level ");
2011 fprintf (stderr, HOST_PTR_PRINTF, level);
2012 fprintf (stderr, "\n");
2013 print_binding_level (level);
2018 print_binding_stack ()
2020 struct binding_level *b;
2021 fprintf (stderr, "current_binding_level=");
2022 fprintf (stderr, HOST_PTR_PRINTF, current_binding_level);
2023 fprintf (stderr, "\nclass_binding_level=");
2024 fprintf (stderr, HOST_PTR_PRINTF, class_binding_level);
2025 fprintf (stderr, "\nglobal_binding_level=");
2026 fprintf (stderr, HOST_PTR_PRINTF, global_binding_level);
2027 fprintf (stderr, "\n");
2028 if (class_binding_level)
2030 for (b = class_binding_level; b; b = b->level_chain)
2031 if (b == current_binding_level)
2034 b = class_binding_level;
2036 b = current_binding_level;
2039 b = current_binding_level;
2040 print_other_binding_stack (b);
2041 fprintf (stderr, "global:\n");
2042 print_binding_level (global_binding_level);
2045 /* Namespace binding access routines: The namespace_bindings field of
2046 the identifier is polymorphic, with three possible values:
2047 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2048 indicating the BINDING_VALUE of global_namespace. */
2050 /* Check whether the a binding for the name to scope is known.
2051 Assumes that the bindings of the name are already a list
2052 of bindings. Returns the binding found, or NULL_TREE. */
2055 find_binding (name, scope)
2059 tree iter, prev = NULL_TREE;
2061 scope = ORIGINAL_NAMESPACE (scope);
2063 for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
2064 iter = TREE_CHAIN (iter))
2066 my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
2067 if (BINDING_SCOPE (iter) == scope)
2069 /* Move binding found to the front of the list, so
2070 subsequent lookups will find it faster. */
2073 TREE_CHAIN (prev) = TREE_CHAIN (iter);
2074 TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
2075 IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
2084 /* Always returns a binding for name in scope. If the
2085 namespace_bindings is not a list, convert it to one first.
2086 If no binding is found, make a new one. */
2089 binding_for_name (name, scope)
2093 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2096 scope = ORIGINAL_NAMESPACE (scope);
2098 if (b && TREE_CODE (b) != CPLUS_BINDING)
2100 /* Get rid of optimization for global scope. */
2101 IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
2102 BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
2103 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2105 if (b && (result = find_binding (name, scope)))
2107 /* Not found, make a new permanent one. */
2108 push_obstacks (&permanent_obstack, &permanent_obstack);
2109 result = make_node (CPLUS_BINDING);
2110 TREE_CHAIN (result) = b;
2111 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
2112 BINDING_SCOPE (result) = scope;
2113 BINDING_TYPE (result) = NULL_TREE;
2114 BINDING_VALUE (result) = NULL_TREE;
2119 /* Return the binding value for name in scope, considering that
2120 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2123 namespace_binding (name, scope)
2127 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2130 if (scope == NULL_TREE)
2131 scope = global_namespace;
2132 if (TREE_CODE (b) != CPLUS_BINDING)
2133 return (scope == global_namespace) ? b : NULL_TREE;
2134 name = find_binding (name,scope);
2135 if (name == NULL_TREE)
2137 return BINDING_VALUE (name);
2140 /* Set the binding value for name in scope. If modifying the binding
2141 of global_namespace is attempted, try to optimize it. */
2144 set_namespace_binding (name, scope, val)
2151 if (scope == NULL_TREE)
2152 scope = global_namespace;
2154 if (scope == global_namespace)
2156 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2157 if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
2159 IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
2163 b = binding_for_name (name, scope);
2164 BINDING_VALUE (b) = val;
2167 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2168 select a name that is unique to this compilation unit. */
2171 push_namespace (name)
2176 int implicit_use = 0;
2178 if (!global_namespace)
2180 /* This must be ::. */
2181 my_friendly_assert (name == get_identifier ("::"), 377);
2186 /* The name of anonymous namespace is unique for the translation
2188 if (!anonymous_namespace_name)
2189 anonymous_namespace_name = get_file_function_name ('N');
2190 name = anonymous_namespace_name;
2191 d = IDENTIFIER_NAMESPACE_VALUE (name);
2193 /* Reopening anonymous namespace. */
2197 else if (current_namespace == global_namespace
2198 && name == DECL_NAME (std_node))
2205 /* Check whether this is an extended namespace definition. */
2206 d = IDENTIFIER_NAMESPACE_VALUE (name);
2207 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2210 if (DECL_NAMESPACE_ALIAS (d))
2212 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2213 d, DECL_NAMESPACE_ALIAS (d));
2214 d = DECL_NAMESPACE_ALIAS (d);
2221 /* Make a new namespace, binding the name to it. */
2222 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2223 /* The global namespace is not pushed, and the global binding
2224 level is set elsewhere. */
2229 declare_namespace_level ();
2230 NAMESPACE_LEVEL (d) = current_binding_level;
2234 resume_binding_level (NAMESPACE_LEVEL (d));
2237 do_using_directive (d);
2238 /* Enter the name space. */
2239 current_namespace = d;
2242 /* Pop from the scope of the current namespace. */
2247 if (current_namespace == global_namespace)
2249 my_friendly_assert (in_std>0, 980421);
2253 current_namespace = CP_DECL_CONTEXT (current_namespace);
2254 /* The binding level is not popped, as it might be re-opened later. */
2255 suspend_binding_level ();
2258 /* Push into the scope of the namespace NS, even if it is deeply
2259 nested within another namespace. */
2262 push_nested_namespace (ns)
2265 if (ns == global_namespace)
2266 push_to_top_level ();
2269 push_nested_namespace (CP_DECL_CONTEXT (ns));
2270 push_namespace (DECL_NAME (ns));
2274 /* Pop back from the scope of the namespace NS, which was previously
2275 entered with push_nested_namespace. */
2278 pop_nested_namespace (ns)
2281 while (ns != global_namespace)
2284 ns = CP_DECL_CONTEXT (ns);
2287 pop_from_top_level ();
2291 /* Subroutines for reverting temporarily to top-level for instantiation
2292 of templates and such. We actually need to clear out the class- and
2293 local-value slots of all identifiers, so that only the global values
2294 are at all visible. Simply setting current_binding_level to the global
2295 scope isn't enough, because more binding levels may be pushed. */
2296 struct saved_scope *scope_chain;
2298 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2301 mark_saved_scope (arg)
2304 struct saved_scope *t = *(struct saved_scope **)arg;
2307 mark_binding_level (&t->class_bindings);
2308 ggc_mark_tree (t->old_bindings);
2309 ggc_mark_tree (t->old_namespace);
2310 ggc_mark_tree (t->class_name);
2311 ggc_mark_tree (t->class_type);
2312 ggc_mark_tree (t->access_specifier);
2313 ggc_mark_tree (t->function_decl);
2315 ggc_mark_tree_varray (t->lang_base);
2316 ggc_mark_tree (t->lang_name);
2317 ggc_mark_tree (t->x_function_parms);
2318 ggc_mark_tree (t->template_parms);
2319 ggc_mark_tree (t->x_previous_class_type);
2320 ggc_mark_tree (t->x_previous_class_values);
2321 mark_binding_level (&t->bindings);
2327 store_bindings (names, old_bindings)
2328 tree names, old_bindings;
2331 for (t = names; t; t = TREE_CHAIN (t))
2333 tree binding, t1, id;
2335 if (TREE_CODE (t) == TREE_LIST)
2336 id = TREE_PURPOSE (t);
2341 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2342 we have no IDENTIFIER_BINDING if we have left the class
2343 scope, but cached the class-level declarations. */
2344 || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2347 for (t1 = old_bindings; t1; t1 = TREE_CHAIN (t1))
2348 if (TREE_VEC_ELT (t1, 0) == id)
2351 binding = make_tree_vec (4);
2355 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2356 TREE_VEC_ELT (binding, 0) = id;
2357 TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2358 TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2359 TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2360 IDENTIFIER_BINDING (id) = NULL_TREE;
2361 IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2363 TREE_CHAIN (binding) = old_bindings;
2364 old_bindings = binding;
2368 return old_bindings;
2372 maybe_push_to_top_level (pseudo)
2375 struct saved_scope *s;
2376 struct binding_level *b;
2380 s = (struct saved_scope *) xcalloc (1, sizeof (struct saved_scope));
2382 b = scope_chain ? current_binding_level : 0;
2384 /* If we're in the middle of some function, save our state. */
2385 if (current_function)
2388 push_function_context_to (NULL_TREE);
2393 old_bindings = NULL_TREE;
2394 if (scope_chain && previous_class_type)
2395 old_bindings = store_bindings (previous_class_values, old_bindings);
2397 /* Have to include global_binding_level, because class-level decls
2398 aren't listed anywhere useful. */
2399 for (; b; b = b->level_chain)
2403 /* Template IDs are inserted into the global level. If they were
2404 inserted into namespace level, finish_file wouldn't find them
2405 when doing pending instantiations. Therefore, don't stop at
2406 namespace level, but continue until :: . */
2407 if (b == global_binding_level || (pseudo && b->pseudo_global))
2410 old_bindings = store_bindings (b->names, old_bindings);
2411 /* We also need to check class_shadowed to save class-level type
2412 bindings, since pushclass doesn't fill in b->names. */
2413 if (b->parm_flag == 2)
2414 old_bindings = store_bindings (b->class_shadowed, old_bindings);
2416 /* Unwind type-value slots back to top level. */
2417 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2418 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2420 s->prev = scope_chain;
2421 s->old_bindings = old_bindings;
2423 s->need_pop_function_context = need_pop;
2424 s->function_decl = current_function_decl;
2427 current_function_decl = NULL_TREE;
2428 VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
2429 current_lang_stack = &VARRAY_TREE (current_lang_base, 0);
2430 current_lang_name = lang_name_cplusplus;
2431 strict_prototype = strict_prototypes_lang_cplusplus;
2432 current_namespace = global_namespace;
2434 push_obstacks (&permanent_obstack, &permanent_obstack);
2438 push_to_top_level ()
2440 maybe_push_to_top_level (0);
2444 pop_from_top_level ()
2446 struct saved_scope *s = scope_chain;
2449 /* Clear out class-level bindings cache. */
2450 if (previous_class_type)
2451 invalidate_class_lookup_cache ();
2455 VARRAY_FREE (current_lang_base);
2457 scope_chain = s->prev;
2458 for (t = s->old_bindings; t; t = TREE_CHAIN (t))
2460 tree id = TREE_VEC_ELT (t, 0);
2463 SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2464 IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2465 IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2469 if (current_lang_name == lang_name_cplusplus)
2470 strict_prototype = strict_prototypes_lang_cplusplus;
2471 else if (current_lang_name == lang_name_c)
2472 strict_prototype = strict_prototypes_lang_c;
2474 /* If we were in the middle of compiling a function, restore our
2476 if (s->need_pop_function_context)
2477 pop_function_context_from (NULL_TREE);
2478 current_function_decl = s->function_decl;
2483 /* Push a definition of struct, union or enum tag "name".
2484 into binding_level "b". "type" should be the type node,
2485 We assume that the tag "name" is not already defined.
2487 Note that the definition may really be just a forward reference.
2488 In that case, the TYPE_SIZE will be a NULL_TREE.
2490 C++ gratuitously puts all these tags in the name space. */
2492 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2493 record the shadowed value for this binding contour. TYPE is
2494 the type that ID maps to. */
2497 set_identifier_type_value_with_scope (id, type, b)
2500 struct binding_level *b;
2502 if (!b->namespace_p)
2504 /* Shadow the marker, not the real thing, so that the marker
2505 gets restored later. */
2506 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2508 = tree_cons (id, old_type_value, b->type_shadowed);
2512 tree binding = binding_for_name (id, current_namespace);
2513 BINDING_TYPE (binding) = type;
2514 /* Store marker instead of real type. */
2515 type = global_type_node;
2517 SET_IDENTIFIER_TYPE_VALUE (id, type);
2520 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2523 set_identifier_type_value (id, type)
2527 set_identifier_type_value_with_scope (id, type, current_binding_level);
2530 /* Return the type associated with id. */
2533 identifier_type_value (id)
2536 /* There is no type with that name, anywhere. */
2537 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2539 /* This is not the type marker, but the real thing. */
2540 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2541 return REAL_IDENTIFIER_TYPE_VALUE (id);
2542 /* Have to search for it. It must be on the global level, now.
2543 Ask lookup_name not to return non-types. */
2544 id = lookup_name_real (id, 2, 1, 0);
2546 return TREE_TYPE (id);
2550 /* Pop off extraneous binding levels left over due to syntax errors.
2552 We don't pop past namespaces, as they might be valid. */
2557 #ifdef DEBUG_CP_BINDING_LEVELS
2558 fprintf (stderr, "XXX entering pop_everything ()\n");
2560 while (!toplevel_bindings_p ())
2562 if (current_binding_level->parm_flag == 2)
2563 pop_nested_class ();
2567 #ifdef DEBUG_CP_BINDING_LEVELS
2568 fprintf (stderr, "XXX leaving pop_everything ()\n");
2572 /* The type TYPE is being declared. If it is a class template, or a
2573 specialization of a class template, do any processing required and
2574 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2575 being declared a friend. B is the binding level at which this TYPE
2578 Returns the TYPE_DECL for TYPE, which may have been altered by this
2582 maybe_process_template_type_declaration (type, globalize, b)
2585 struct binding_level* b;
2587 tree decl = TYPE_NAME (type);
2589 if (processing_template_parmlist)
2590 /* You can't declare a new template type in a template parameter
2591 list. But, you can declare a non-template type:
2593 template <class A*> struct S;
2595 is a forward-declaration of `A'. */
2599 maybe_check_template_type (type);
2601 my_friendly_assert (IS_AGGR_TYPE (type)
2602 || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2605 if (processing_template_decl)
2607 /* This may change after the call to
2608 push_template_decl_real, but we want the original value. */
2609 tree name = DECL_NAME (decl);
2611 decl = push_template_decl_real (decl, globalize);
2612 /* If the current binding level is the binding level for the
2613 template parameters (see the comment in
2614 begin_template_parm_list) and the enclosing level is a class
2615 scope, and we're not looking at a friend, push the
2616 declaration of the member class into the class scope. In the
2617 friend case, push_template_decl will already have put the
2618 friend into global scope, if appropriate. */
2619 if (TREE_CODE (type) != ENUMERAL_TYPE
2620 && !globalize && b->pseudo_global
2621 && b->level_chain->parm_flag == 2)
2623 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2624 /* Put this tag on the list of tags for the class, since
2625 that won't happen below because B is not the class
2626 binding level, but is instead the pseudo-global level. */
2627 b->level_chain->tags =
2628 tree_cons (name, type, b->level_chain->tags);
2629 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2630 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2638 /* In C++, you don't have to write `struct S' to refer to `S'; you
2639 can just use `S'. We accomplish this by creating a TYPE_DECL as
2640 if the user had written `typedef struct S S'. Create and return
2641 the TYPE_DECL for TYPE. */
2644 create_implicit_typedef (name, type)
2650 decl = build_decl (TYPE_DECL, name, type);
2651 SET_DECL_ARTIFICIAL (decl);
2652 /* There are other implicit type declarations, like the one *within*
2653 a class that allows you to write `S::S'. We must distinguish
2655 SET_DECL_IMPLICIT_TYPEDEF_P (decl);
2656 TYPE_NAME (type) = decl;
2661 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2662 Normally put it into the inner-most non-tag-transparent scope,
2663 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2664 The latter is needed for implicit declarations. */
2667 pushtag (name, type, globalize)
2671 register struct binding_level *b;
2673 b = current_binding_level;
2674 while (b->tag_transparent
2675 || (globalize && b->parm_flag == 2))
2678 b->tags = tree_cons (name, type, b->tags);
2682 /* Do C++ gratuitous typedefing. */
2683 if (IDENTIFIER_TYPE_VALUE (name) != type)
2685 register tree d = NULL_TREE;
2687 tree context = TYPE_CONTEXT (type);
2691 tree cs = current_scope ();
2695 else if (cs != NULL_TREE
2696 && TREE_CODE_CLASS (TREE_CODE (cs)) == 't')
2697 /* When declaring a friend class of a local class, we want
2698 to inject the newly named class into the scope
2699 containing the local class, not the namespace scope. */
2700 context = hack_decl_function_context (get_type_decl (cs));
2703 context = current_namespace;
2705 if ((b->pseudo_global && b->level_chain->parm_flag == 2)
2706 || b->parm_flag == 2)
2709 if (current_lang_name == lang_name_java)
2710 TYPE_FOR_JAVA (type) = 1;
2712 d = create_implicit_typedef (name, type);
2713 DECL_CONTEXT (d) = FROB_CONTEXT (context);
2715 set_identifier_type_value_with_scope (name, type, b);
2717 d = maybe_process_template_type_declaration (type,
2720 if (b->parm_flag == 2)
2722 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2723 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2724 class. But if it's a member template class, we
2725 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2727 finish_member_declaration (d);
2729 pushdecl_class_level (d);
2732 d = pushdecl_with_scope (d, b);
2734 if (ANON_AGGRNAME_P (name))
2735 DECL_IGNORED_P (d) = 1;
2737 TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2738 DECL_ASSEMBLER_NAME (d) = DECL_NAME (d);
2739 if (!uses_template_parms (type))
2740 DECL_ASSEMBLER_NAME (d)
2741 = get_identifier (build_overload_name (type, 1, 1));
2743 if (b->parm_flag == 2)
2745 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2746 CLASSTYPE_TAGS (current_class_type) = b->tags;
2750 if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2751 /* Use the canonical TYPE_DECL for this node. */
2752 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2755 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2756 will be the tagged type we just added to the current
2757 binding level. This fake NULL-named TYPE_DECL node helps
2758 dwarfout.c to know when it needs to output a
2759 representation of a tagged type, and it also gives us a
2760 convenient place to record the "scope start" address for
2763 tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2764 TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2768 /* Counter used to create anonymous type names. */
2770 static int anon_cnt = 0;
2772 /* Return an IDENTIFIER which can be used as a name for
2773 anonymous structs and unions. */
2780 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2781 return get_identifier (buf);
2784 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2785 This keeps dbxout from getting confused. */
2790 register struct binding_level *b;
2792 static int last_cnt = 0;
2794 /* Fast out if no new anon names were declared. */
2795 if (last_cnt == anon_cnt)
2798 b = current_binding_level;
2799 while (b->tag_transparent)
2804 /* A NULL purpose means we have already processed all tags
2805 from here to the end of the list. */
2806 if (TREE_PURPOSE (tags) == NULL_TREE)
2808 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2809 TREE_PURPOSE (tags) = NULL_TREE;
2810 tags = TREE_CHAIN (tags);
2812 last_cnt = anon_cnt;
2815 /* Subroutine of duplicate_decls: return truthvalue of whether
2816 or not types of these decls match.
2818 For C++, we must compare the parameter list so that `int' can match
2819 `int&' in a parameter position, but `int&' is not confused with
2823 decls_match (newdecl, olddecl)
2824 tree newdecl, olddecl;
2828 if (newdecl == olddecl)
2831 if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
2832 /* If the two DECLs are not even the same kind of thing, we're not
2833 interested in their types. */
2836 if (TREE_CODE (newdecl) == FUNCTION_DECL)
2838 tree f1 = TREE_TYPE (newdecl);
2839 tree f2 = TREE_TYPE (olddecl);
2840 tree p1 = TYPE_ARG_TYPES (f1);
2841 tree p2 = TYPE_ARG_TYPES (f2);
2843 if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl)
2844 && ! (DECL_LANGUAGE (newdecl) == lang_c
2845 && DECL_LANGUAGE (olddecl) == lang_c))
2848 /* When we parse a static member function definition,
2849 we put together a FUNCTION_DECL which thinks its type
2850 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2852 if (TREE_CODE (f1) == METHOD_TYPE && DECL_STATIC_FUNCTION_P (olddecl))
2853 revert_static_member_fn (&newdecl, &f1, &p1);
2854 else if (TREE_CODE (f2) == METHOD_TYPE
2855 && DECL_STATIC_FUNCTION_P (newdecl))
2856 revert_static_member_fn (&olddecl, &f2, &p2);
2858 /* Here we must take care of the case where new default
2859 parameters are specified. Also, warn if an old
2860 declaration becomes ambiguous because default
2861 parameters may cause the two to be ambiguous. */
2862 if (TREE_CODE (f1) != TREE_CODE (f2))
2864 if (TREE_CODE (f1) == OFFSET_TYPE)
2865 cp_compiler_error ("`%D' redeclared as member function", newdecl);
2867 cp_compiler_error ("`%D' redeclared as non-member function", newdecl);
2871 if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
2873 if (! strict_prototypes_lang_c && DECL_LANGUAGE (olddecl) == lang_c
2876 types_match = self_promoting_args_p (p1);
2877 if (p1 == void_list_node)
2878 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2880 else if (!strict_prototypes_lang_c && DECL_LANGUAGE (olddecl)==lang_c
2881 && DECL_LANGUAGE (newdecl) == lang_c && p1 == NULL_TREE)
2883 types_match = self_promoting_args_p (p2);
2884 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2887 types_match = compparms (p1, p2);
2892 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
2894 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
2895 DECL_TEMPLATE_PARMS (olddecl)))
2898 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
2901 types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
2902 DECL_TEMPLATE_RESULT (newdecl));
2906 if (TREE_TYPE (newdecl) == error_mark_node)
2907 types_match = TREE_TYPE (olddecl) == error_mark_node;
2908 else if (TREE_TYPE (olddecl) == NULL_TREE)
2909 types_match = TREE_TYPE (newdecl) == NULL_TREE;
2910 else if (TREE_TYPE (newdecl) == NULL_TREE)
2913 types_match = comptypes (TREE_TYPE (newdecl),
2914 TREE_TYPE (olddecl),
2915 COMPARE_REDECLARATION);
2921 /* If NEWDECL is `static' and an `extern' was seen previously,
2922 warn about it. OLDDECL is the previous declaration.
2924 Note that this does not apply to the C++ case of declaring
2925 a variable `extern const' and then later `const'.
2927 Don't complain about built-in functions, since they are beyond
2928 the user's control. */
2931 warn_extern_redeclared_static (newdecl, olddecl)
2932 tree newdecl, olddecl;
2934 static const char *explicit_extern_static_warning
2935 = "`%D' was declared `extern' and later `static'";
2936 static const char *implicit_extern_static_warning
2937 = "`%D' was declared implicitly `extern' and later `static'";
2941 if (TREE_CODE (newdecl) == TYPE_DECL)
2944 /* Don't get confused by static member functions; that's a different
2946 if (TREE_CODE (newdecl) == FUNCTION_DECL
2947 && DECL_STATIC_FUNCTION_P (newdecl))
2950 /* If the old declaration was `static', or the new one isn't, then
2951 then everything is OK. */
2952 if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
2955 /* It's OK to declare a builtin function as `static'. */
2956 if (TREE_CODE (olddecl) == FUNCTION_DECL
2957 && DECL_ARTIFICIAL (olddecl))
2960 name = DECL_ASSEMBLER_NAME (newdecl);
2961 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
2962 ? implicit_extern_static_warning
2963 : explicit_extern_static_warning, newdecl);
2964 cp_pedwarn_at ("previous declaration of `%D'", olddecl);
2967 /* Handle when a new declaration NEWDECL has the same name as an old
2968 one OLDDECL in the same binding contour. Prints an error message
2971 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2972 Otherwise, return 0. */
2975 duplicate_decls (newdecl, olddecl)
2976 tree newdecl, olddecl;
2978 unsigned olddecl_uid = DECL_UID (olddecl);
2979 int olddecl_friend = 0, types_match = 0;
2980 int new_defines_function = 0;
2982 if (newdecl == olddecl)
2985 types_match = decls_match (newdecl, olddecl);
2987 /* If either the type of the new decl or the type of the old decl is an
2988 error_mark_node, then that implies that we have already issued an
2989 error (earlier) for some bogus type specification, and in that case,
2990 it is rather pointless to harass the user with yet more error message
2991 about the same declaration, so just pretend the types match here. */
2992 if (TREE_TYPE (newdecl) == error_mark_node
2993 || TREE_TYPE (olddecl) == error_mark_node)
2996 /* Check for redeclaration and other discrepancies. */
2997 if (TREE_CODE (olddecl) == FUNCTION_DECL
2998 && DECL_ARTIFICIAL (olddecl))
3000 if (TREE_CODE (newdecl) != FUNCTION_DECL)
3002 /* If you declare a built-in or predefined function name as static,
3003 the old definition is overridden, but optionally warn this was a
3004 bad choice of name. */
3005 if (! TREE_PUBLIC (newdecl))
3008 cp_warning ("shadowing %s function `%#D'",
3009 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3011 /* Discard the old built-in function. */
3014 /* If the built-in is not ansi, then programs can override
3015 it even globally without an error. */
3016 else if (! DECL_BUILT_IN (olddecl))
3017 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3021 cp_error ("declaration of `%#D'", newdecl);
3022 cp_error ("conflicts with built-in declaration `%#D'",
3027 else if (!types_match)
3029 if ((DECL_LANGUAGE (newdecl) == lang_c
3030 && DECL_LANGUAGE (olddecl) == lang_c)
3031 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3032 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3034 /* A near match; override the builtin. */
3036 if (TREE_PUBLIC (newdecl))
3038 cp_warning ("new declaration `%#D'", newdecl);
3039 cp_warning ("ambiguates built-in declaration `%#D'",
3042 else if (warn_shadow)
3043 cp_warning ("shadowing %s function `%#D'",
3044 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3048 /* Discard the old built-in function. */
3052 if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
3054 /* If a builtin function is redeclared as `static', merge
3055 the declarations, but make the original one static. */
3056 DECL_THIS_STATIC (olddecl) = 1;
3057 TREE_PUBLIC (olddecl) = 0;
3059 /* Make the olddeclaration consistent with the new one so that
3060 all remnants of the builtin-ness of this function will be
3062 DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3063 DECL_RTL (olddecl) = DECL_RTL (newdecl);
3064 DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3065 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl),
3069 else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3071 if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3072 && TREE_CODE (newdecl) != TYPE_DECL
3073 && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3074 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3075 || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3076 && TREE_CODE (olddecl) != TYPE_DECL
3077 && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3078 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3081 /* We do nothing special here, because C++ does such nasty
3082 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3083 get shadowed, and know that if we need to find a TYPE_DECL
3084 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3085 slot of the identifier. */
3089 if ((TREE_CODE (newdecl) == FUNCTION_DECL
3090 && DECL_FUNCTION_TEMPLATE_P (olddecl))
3091 || (TREE_CODE (olddecl) == FUNCTION_DECL
3092 && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3095 cp_error ("`%#D' redeclared as different kind of symbol", newdecl);
3096 if (TREE_CODE (olddecl) == TREE_LIST)
3097 olddecl = TREE_VALUE (olddecl);
3098 cp_error_at ("previous declaration of `%#D'", olddecl);
3100 /* New decl is completely inconsistent with the old one =>
3101 tell caller to replace the old one. */
3105 else if (!types_match)
3107 if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl))
3108 /* These are certainly not duplicate declarations; they're
3109 from different scopes. */
3112 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3114 /* The name of a class template may not be declared to refer to
3115 any other template, class, function, object, namespace, value,
3116 or type in the same scope. */
3117 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3118 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3120 cp_error ("declaration of template `%#D'", newdecl);
3121 cp_error_at ("conflicts with previous declaration `%#D'",
3124 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3125 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3126 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3127 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3128 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3129 DECL_TEMPLATE_PARMS (olddecl)))
3131 cp_error ("new declaration `%#D'", newdecl);
3132 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3136 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3138 if (DECL_LANGUAGE (newdecl) == lang_c
3139 && DECL_LANGUAGE (olddecl) == lang_c)
3141 cp_error ("declaration of C function `%#D' conflicts with",
3143 cp_error_at ("previous declaration `%#D' here", olddecl);
3145 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3146 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3148 cp_error ("new declaration `%#D'", newdecl);
3149 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3155 /* Already complained about this, so don't do so again. */
3156 else if (current_class_type == NULL_TREE
3157 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3159 cp_error ("conflicting types for `%#D'", newdecl);
3160 cp_error_at ("previous declaration as `%#D'", olddecl);
3163 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3164 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3165 && (!DECL_TEMPLATE_INFO (newdecl)
3166 || (DECL_TI_TEMPLATE (newdecl)
3167 != DECL_TI_TEMPLATE (olddecl))))
3168 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3169 && (!DECL_TEMPLATE_INFO (olddecl)
3170 || (DECL_TI_TEMPLATE (olddecl)
3171 != DECL_TI_TEMPLATE (newdecl))))))
3172 /* It's OK to have a template specialization and a non-template
3173 with the same type, or to have specializations of two
3174 different templates with the same type. Note that if one is a
3175 specialization, and the other is an instantiation of the same
3176 template, that we do not exit at this point. That situation
3177 can occur if we instantiate a template class, and then
3178 specialize one of its methods. This situation is legal, but
3179 the declarations must be merged in the usual way. */
3181 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3182 && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3183 && !DECL_USE_TEMPLATE (newdecl))
3184 || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3185 && !DECL_USE_TEMPLATE (olddecl))))
3186 /* One of the declarations is a template instantiation, and the
3187 other is not a template at all. That's OK. */
3189 else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3190 && DECL_NAMESPACE_ALIAS (newdecl)
3191 && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3192 /* Redeclaration of namespace alias, ignore it. */
3196 const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3199 cp_error (errmsg, newdecl);
3200 if (DECL_NAME (olddecl) != NULL_TREE)
3201 cp_error_at ((DECL_INITIAL (olddecl)
3202 && namespace_bindings_p ())
3203 ? "`%#D' previously defined here"
3204 : "`%#D' previously declared here", olddecl);
3206 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3207 && DECL_INITIAL (olddecl) != NULL_TREE
3208 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3209 && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3211 /* Prototype decl follows defn w/o prototype. */
3212 cp_warning_at ("prototype for `%#D'", newdecl);
3213 cp_warning_at ("follows non-prototype definition here", olddecl);
3215 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3216 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3218 /* extern "C" int foo ();
3219 int foo () { bar (); }
3221 if (current_lang_stack
3222 == &VARRAY_TREE (current_lang_base, 0))
3223 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3226 cp_error_at ("previous declaration of `%#D' with %L linkage",
3227 olddecl, DECL_LANGUAGE (olddecl));
3228 cp_error ("conflicts with new declaration with %L linkage",
3229 DECL_LANGUAGE (newdecl));
3233 if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3235 else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3237 tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3238 tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3241 if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3242 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3244 for (; t1 && t1 != void_list_node;
3245 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3246 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3248 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3253 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3255 cp_pedwarn_at ("after previous specification in `%#D'",
3261 cp_error ("default argument given for parameter %d of `%#D'",
3263 cp_error_at ("after previous specification in `%#D'",
3268 if (DECL_THIS_INLINE (newdecl) && ! DECL_THIS_INLINE (olddecl)
3269 && TREE_ADDRESSABLE (olddecl) && warn_inline)
3271 cp_warning ("`%#D' was used before it was declared inline",
3273 cp_warning_at ("previous non-inline declaration here",
3279 /* If new decl is `static' and an `extern' was seen previously,
3281 warn_extern_redeclared_static (newdecl, olddecl);
3283 /* We have committed to returning 1 at this point. */
3284 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3286 /* Now that functions must hold information normally held
3287 by field decls, there is extra work to do so that
3288 declaration information does not get destroyed during
3290 if (DECL_VINDEX (olddecl))
3291 DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3292 if (DECL_CONTEXT (olddecl))
3293 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3294 if (DECL_CLASS_CONTEXT (olddecl))
3295 DECL_CLASS_CONTEXT (newdecl) = DECL_CLASS_CONTEXT (olddecl);
3296 if (DECL_PENDING_INLINE_INFO (newdecl) == (struct pending_inline *)0)
3297 DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3298 DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3299 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3300 DECL_ABSTRACT_VIRTUAL_P (newdecl) |= DECL_ABSTRACT_VIRTUAL_P (olddecl);
3301 DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3302 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3303 DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
3304 new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3306 /* Optionally warn about more than one declaration for the same
3307 name, but don't warn about a function declaration followed by a
3309 if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3310 && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3311 /* Don't warn about extern decl followed by definition. */
3312 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3313 /* Don't warn about friends, let add_friend take care of it. */
3314 && ! DECL_FRIEND_P (newdecl))
3316 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl);
3317 cp_warning_at ("previous declaration of `%D'", olddecl);
3321 /* Deal with C++: must preserve virtual function table size. */
3322 if (TREE_CODE (olddecl) == TYPE_DECL)
3324 register tree newtype = TREE_TYPE (newdecl);
3325 register tree oldtype = TREE_TYPE (olddecl);
3327 if (newtype != error_mark_node && oldtype != error_mark_node
3328 && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3330 CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3331 CLASSTYPE_FRIEND_CLASSES (newtype)
3332 = CLASSTYPE_FRIEND_CLASSES (oldtype);
3336 /* Copy all the DECL_... slots specified in the new decl
3337 except for any that we copy here from the old type. */
3338 DECL_MACHINE_ATTRIBUTES (newdecl)
3339 = merge_machine_decl_attributes (olddecl, newdecl);
3341 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3343 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl),
3344 DECL_TEMPLATE_RESULT (olddecl)))
3345 cp_error ("invalid redeclaration of %D", newdecl);
3346 TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3347 DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3348 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3349 DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3356 /* Automatically handles default parameters. */
3357 tree oldtype = TREE_TYPE (olddecl);
3360 /* Make sure we put the new type in the same obstack as the old one. */
3362 push_obstacks (TYPE_OBSTACK (oldtype), TYPE_OBSTACK (oldtype));
3364 push_permanent_obstack ();
3366 /* Merge the data types specified in the two decls. */
3367 newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3369 if (TREE_CODE (newdecl) == VAR_DECL)
3370 DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3371 /* Do this after calling `common_type' so that default
3372 parameters don't confuse us. */
3373 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3374 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3375 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3377 TREE_TYPE (newdecl) = build_exception_variant (newtype,
3378 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3379 TREE_TYPE (olddecl) = build_exception_variant (newtype,
3380 TYPE_RAISES_EXCEPTIONS (oldtype));
3382 if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3383 && DECL_SOURCE_LINE (olddecl) != 0
3385 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
3386 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
3388 cp_error ("declaration of `%F' throws different exceptions",
3390 cp_error_at ("to previous declaration `%F'", olddecl);
3393 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3395 /* Lay the type out, unless already done. */
3396 if (! same_type_p (newtype, oldtype)
3397 && TREE_TYPE (newdecl) != error_mark_node
3398 && !(processing_template_decl && uses_template_parms (newdecl)))
3399 layout_type (TREE_TYPE (newdecl));
3401 if ((TREE_CODE (newdecl) == VAR_DECL
3402 || TREE_CODE (newdecl) == PARM_DECL
3403 || TREE_CODE (newdecl) == RESULT_DECL
3404 || TREE_CODE (newdecl) == FIELD_DECL
3405 || TREE_CODE (newdecl) == TYPE_DECL)
3406 && !(processing_template_decl && uses_template_parms (newdecl)))
3407 layout_decl (newdecl, 0);
3409 /* Merge the type qualifiers. */
3410 if (TREE_READONLY (newdecl))
3411 TREE_READONLY (olddecl) = 1;
3412 if (TREE_THIS_VOLATILE (newdecl))
3413 TREE_THIS_VOLATILE (olddecl) = 1;
3415 /* Merge the initialization information. */
3416 if (DECL_INITIAL (newdecl) == NULL_TREE
3417 && DECL_INITIAL (olddecl) != NULL_TREE)
3419 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3420 DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3421 DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3422 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
3423 && DECL_LANG_SPECIFIC (newdecl)
3424 && DECL_LANG_SPECIFIC (olddecl))
3425 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3428 /* Merge the section attribute.
3429 We want to issue an error if the sections conflict but that must be
3430 done later in decl_attributes since we are called before attributes
3432 if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3433 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3435 /* Keep the old rtl since we can safely use it. */
3436 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3440 /* If cannot merge, then use the new type and qualifiers,
3441 and don't preserve the old rtl. */
3444 /* Clean out any memory we had of the old declaration. */
3445 tree oldstatic = value_member (olddecl, static_aggregates);
3447 TREE_VALUE (oldstatic) = error_mark_node;
3449 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3450 TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3451 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3452 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3455 /* Merge the storage class information. */
3456 DECL_WEAK (newdecl) |= DECL_WEAK (olddecl);
3457 DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3458 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3459 TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3460 if (! DECL_EXTERNAL (olddecl))
3461 DECL_EXTERNAL (newdecl) = 0;
3463 if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3465 DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3466 DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3467 DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3468 DECL_TEMPLATE_INSTANTIATED (newdecl)
3469 |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3470 /* Don't really know how much of the language-specific
3471 values we should copy from old to new. */
3472 DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3473 DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3474 DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3475 DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3476 olddecl_friend = DECL_FRIEND_P (olddecl);
3478 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3479 if (TREE_CODE (newdecl) == FUNCTION_DECL
3480 || DECL_FUNCTION_TEMPLATE_P (newdecl))
3481 DECL_BEFRIENDING_CLASSES (newdecl)
3482 = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3483 DECL_BEFRIENDING_CLASSES (olddecl));
3486 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3488 if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3489 && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3491 /* If newdecl is not a specialization, then it is not a
3492 template-related function at all. And that means that we
3493 shoud have exited above, returning 0. */
3494 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3497 if (TREE_USED (olddecl))
3498 /* From [temp.expl.spec]:
3500 If a template, a member template or the member of a class
3501 template is explicitly specialized then that
3502 specialization shall be declared before the first use of
3503 that specialization that would cause an implicit
3504 instantiation to take place, in every translation unit in
3505 which such a use occurs. */
3506 cp_error ("explicit specialization of %D after first use",
3509 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3511 DECL_THIS_INLINE (newdecl) |= DECL_THIS_INLINE (olddecl);
3513 /* If either decl says `inline', this fn is inline, unless its
3514 definition was passed already. */
3515 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3516 DECL_INLINE (olddecl) = 1;
3517 DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3521 DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3522 DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3523 DECL_RTL (olddecl) = DECL_RTL (newdecl);
3525 if (! types_match || new_defines_function)
3527 /* These need to be copied so that the names are available.
3528 Note that if the types do match, we'll preserve inline
3529 info and other bits, but if not, we won't. */
3530 DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3531 DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3533 if (new_defines_function)
3534 /* If defining a function declared with other language
3535 linkage, use the previously declared language linkage. */
3536 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3537 else if (types_match)
3539 /* If redeclaring a builtin function, and not a definition,
3540 it stays built in. */
3541 if (DECL_BUILT_IN (olddecl))
3543 DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl);
3544 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3545 /* If we're keeping the built-in definition, keep the rtl,
3546 regardless of declaration matches. */
3547 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3550 DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
3552 DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3553 if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl)))
3554 /* Previously saved insns go together with
3555 the function's previous definition. */
3556 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3557 /* Don't clear out the arguments if we're redefining a function. */
3558 if (DECL_ARGUMENTS (olddecl))
3559 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3561 if (DECL_LANG_SPECIFIC (olddecl))
3562 DECL_MAIN_VARIANT (newdecl) = DECL_MAIN_VARIANT (olddecl);
3565 if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3567 NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3570 /* Now preserve various other info from the definition. */
3571 TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3572 TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3573 DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3574 DECL_ASSEMBLER_NAME (newdecl) = DECL_ASSEMBLER_NAME (olddecl);
3576 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3580 function_size = sizeof (struct tree_decl);
3582 bcopy ((char *) newdecl + sizeof (struct tree_common),
3583 (char *) olddecl + sizeof (struct tree_common),
3584 function_size - sizeof (struct tree_common));
3586 if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3588 /* If newdecl is a template instantiation, it is possible that
3589 the following sequence of events has occurred:
3591 o A friend function was declared in a class template. The
3592 class template was instantiated.
3594 o The instantiation of the friend declaration was
3595 recorded on the instantiation list, and is newdecl.
3597 o Later, however, instantiate_class_template called pushdecl
3598 on the newdecl to perform name injection. But, pushdecl in
3599 turn called duplicate_decls when it discovered that another
3600 declaration of a global function with the same name already
3603 o Here, in duplicate_decls, we decided to clobber newdecl.
3605 If we're going to do that, we'd better make sure that
3606 olddecl, and not newdecl, is on the list of
3607 instantiations so that if we try to do the instantiation
3608 again we won't get the clobbered declaration. */
3610 tree tmpl = DECL_TI_TEMPLATE (newdecl);
3611 tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3613 for (; decls; decls = TREE_CHAIN (decls))
3614 if (TREE_VALUE (decls) == newdecl)
3615 TREE_VALUE (decls) = olddecl;
3620 bcopy ((char *) newdecl + sizeof (struct tree_common),
3621 (char *) olddecl + sizeof (struct tree_common),
3622 sizeof (struct tree_decl) - sizeof (struct tree_common)
3623 + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3626 DECL_UID (olddecl) = olddecl_uid;
3628 DECL_FRIEND_P (olddecl) = 1;
3630 /* NEWDECL contains the merged attribute lists.
3631 Update OLDDECL to be the same. */
3632 DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl);
3637 /* Record a decl-node X as belonging to the current lexical scope.
3638 Check for errors (such as an incompatible declaration for the same
3639 name already seen in the same scope).
3641 Returns either X or an old decl for the same name.
3642 If an old decl is returned, it may have been smashed
3643 to agree with what X says. */
3651 int need_new_binding;
3653 /* We shouldn't be calling pushdecl when we're generating RTL for a
3654 function that we already did semantic analysis on previously. */
3655 my_friendly_assert (!current_function || doing_semantic_analysis_p (),
3658 name = DECL_ASSEMBLER_NAME (x);
3659 need_new_binding = 1;
3661 if (DECL_TEMPLATE_PARM_P (x))
3662 /* Template parameters have no context; they are not X::T even
3663 when declared within a class or namespace. */
3667 if (current_function_decl && x != current_function_decl
3668 /* A local declaration for a function doesn't constitute
3670 && !(TREE_CODE (x) == FUNCTION_DECL && !DECL_INITIAL (x))
3671 /* A local declaration for an `extern' variable is in the
3672 scoped of the current namespace, not the current
3674 && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
3675 /* Don't change DECL_CONTEXT of virtual methods. */
3676 && (TREE_CODE (x) != FUNCTION_DECL || !DECL_VIRTUAL_P (x))
3677 && !DECL_CONTEXT (x))
3678 DECL_CONTEXT (x) = current_function_decl;
3679 if (!DECL_CONTEXT (x))
3680 DECL_CONTEXT (x) = FROB_CONTEXT (current_namespace);
3683 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3684 compiler wants to use. */
3685 if (TREE_CODE (x) == TYPE_DECL || TREE_CODE (x) == VAR_DECL
3686 || TREE_CODE (x) == NAMESPACE_DECL)
3687 name = DECL_NAME (x);
3692 /* Not needed...see below. */
3696 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3697 name = TREE_OPERAND (name, 0);
3699 /* Namespace-scoped variables are not found in the current level. */
3700 if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x))
3701 t = namespace_binding (name, DECL_CONTEXT (x));
3703 t = lookup_name_current_level (name);
3704 if (t == error_mark_node)
3706 /* error_mark_node is 0 for a while during initialization! */
3708 cp_error_at ("`%#D' used prior to declaration", x);
3711 else if (t != NULL_TREE)
3714 /* This is turned off until I have time to do it right (bpk). */
3715 /* With the code below that uses it... */
3716 file = DECL_SOURCE_FILE (t);
3717 line = DECL_SOURCE_LINE (t);
3719 if (TREE_CODE (t) == PARM_DECL)
3721 if (DECL_CONTEXT (t) == NULL_TREE)
3722 fatal ("parse errors have confused me too much");
3724 /* Check for duplicate params. */
3725 if (duplicate_decls (x, t))
3728 else if (((TREE_CODE (x) == FUNCTION_DECL && DECL_LANGUAGE (x) == lang_c)
3729 || DECL_FUNCTION_TEMPLATE_P (x))
3730 && is_overloaded_fn (t))
3731 /* Don't do anything just yet. */;
3732 else if (t == wchar_decl_node)
3734 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3735 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x));
3737 /* Throw away the redeclaration. */
3740 else if (TREE_CODE (t) != TREE_CODE (x))
3742 if (duplicate_decls (x, t))
3745 else if (duplicate_decls (x, t))
3748 /* This is turned off until I have time to do it right (bpk). */
3750 /* Also warn if they did a prototype with `static' on it, but
3751 then later left the `static' off. */
3752 if (! TREE_PUBLIC (name) && TREE_PUBLIC (x))
3754 if (DECL_LANG_SPECIFIC (t) && DECL_FRIEND_P (t))
3759 cp_warning ("`static' missing from declaration of `%D'",
3761 warning_with_file_and_line (file, line,
3762 "previous declaration of `%s'",
3763 decl_as_string (t, 0));
3766 /* Now fix things so it'll do what they expect. */
3767 if (current_function_decl)
3768 TREE_PUBLIC (current_function_decl) = 0;
3770 /* Due to interference in memory reclamation (X may be
3771 obstack-deallocated at this point), we must guard against
3772 one really special case. [jason: This should be handled
3773 by start_function] */
3774 if (current_function_decl == x)
3775 current_function_decl = t;
3777 if (TREE_CODE (t) == TYPE_DECL)
3778 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3779 else if (TREE_CODE (t) == FUNCTION_DECL)
3780 check_default_args (t);
3784 else if (DECL_MAIN_P (x))
3786 /* A redeclaration of main, but not a duplicate of the
3791 This function shall not be overloaded. */
3792 cp_error_at ("invalid redeclaration of `%D'", t);
3793 cp_error ("as `%D'", x);
3794 /* We don't try to push this declaration since that
3800 check_template_shadow (x);
3802 /* If this is a function conjured up by the backend, massage it
3803 so it looks friendly. */
3804 if (TREE_CODE (x) == FUNCTION_DECL
3805 && ! DECL_LANG_SPECIFIC (x))
3807 retrofit_lang_decl (x);
3808 DECL_LANGUAGE (x) = lang_c;
3811 if (TREE_CODE (x) == FUNCTION_DECL && ! DECL_FUNCTION_MEMBER_P (x))
3813 t = push_overloaded_decl (x, PUSH_LOCAL);
3816 if (!namespace_bindings_p ())
3817 /* We do not need to create a binding for this name;
3818 push_overloaded_decl will have already done so if
3820 need_new_binding = 0;
3822 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3824 t = push_overloaded_decl (x, PUSH_GLOBAL);
3826 add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
3830 /* If declaring a type as a typedef, copy the type (unless we're
3831 at line 0), and install this TYPE_DECL as the new type's typedef
3832 name. See the extensive comment in ../c-decl.c (pushdecl). */
3833 if (TREE_CODE (x) == TYPE_DECL)
3835 tree type = TREE_TYPE (x);
3836 if (DECL_SOURCE_LINE (x) == 0)
3838 if (TYPE_NAME (type) == 0)
3839 TYPE_NAME (type) = x;
3841 else if (type != error_mark_node && TYPE_NAME (type) != x
3842 /* We don't want to copy the type when all we're
3843 doing is making a TYPE_DECL for the purposes of
3845 && (!TYPE_NAME (type)
3846 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
3848 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
3850 DECL_ORIGINAL_TYPE (x) = type;
3851 type = build_type_copy (type);
3852 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
3853 TYPE_NAME (type) = x;
3854 TREE_TYPE (x) = type;
3859 if (type != error_mark_node
3861 && TYPE_IDENTIFIER (type))
3862 set_identifier_type_value_with_scope (DECL_NAME (x), type,
3863 current_binding_level);
3867 /* Multiple external decls of the same identifier ought to match.
3869 We get warnings about inline functions where they are defined.
3870 We get warnings about other functions from push_overloaded_decl.
3872 Avoid duplicate warnings where they are used. */
3873 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
3877 if (IDENTIFIER_NAMESPACE_VALUE (name) != NULL_TREE
3878 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name))
3879 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name))))
3880 decl = IDENTIFIER_NAMESPACE_VALUE (name);
3885 /* If different sort of thing, we already gave an error. */
3886 && TREE_CODE (decl) == TREE_CODE (x)
3887 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
3889 cp_pedwarn ("type mismatch with previous external decl", x);
3890 cp_pedwarn_at ("previous external decl of `%#D'", decl);
3894 /* This name is new in its binding level.
3895 Install the new declaration and return it. */
3896 if (namespace_bindings_p ())
3898 /* Install a global value. */
3900 /* If the first global decl has external linkage,
3901 warn if we later see static one. */
3902 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
3903 TREE_PUBLIC (name) = 1;
3905 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
3907 /* For an ordinary function, we create a binding from
3908 the mangled name (i.e., NAME) to the DECL. But, for
3909 an `extern "C"' function, the mangled name and the
3910 ordinary name are the same so we need not do this. */
3911 && !(TREE_CODE (x) == FUNCTION_DECL &&
3912 DECL_LANGUAGE (x) == lang_c))
3914 if (TREE_CODE (x) == FUNCTION_DECL)
3916 ((IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE)
3917 || (IDENTIFIER_GLOBAL_VALUE (name) == x), 378);
3918 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
3921 /* Don't forget if the function was used via an implicit decl. */
3922 if (IDENTIFIER_IMPLICIT_DECL (name)
3923 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
3926 /* Don't forget if its address was taken in that way. */
3927 if (IDENTIFIER_IMPLICIT_DECL (name)
3928 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
3929 TREE_ADDRESSABLE (x) = 1;
3931 /* Warn about mismatches against previous implicit decl. */
3932 if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
3933 /* If this real decl matches the implicit, don't complain. */
3934 && ! (TREE_CODE (x) == FUNCTION_DECL
3935 && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
3937 ("`%D' was previously implicitly declared to return `int'", x);
3939 /* If new decl is `static' and an `extern' was seen previously,
3941 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
3942 warn_extern_redeclared_static (x, t);
3946 /* Here to install a non-global value. */
3947 tree oldlocal = IDENTIFIER_VALUE (name);
3948 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
3950 if (need_new_binding)
3952 push_local_binding (name, x, 0);
3953 /* Because push_local_binding will hook X on to the
3954 current_binding_level's name list, we don't want to
3955 do that again below. */
3956 need_new_binding = 0;
3959 /* If this is a TYPE_DECL, push it into the type value slot. */
3960 if (TREE_CODE (x) == TYPE_DECL)
3961 set_identifier_type_value_with_scope (name, TREE_TYPE (x),
3962 current_binding_level);
3964 /* Clear out any TYPE_DECL shadowed by a namespace so that
3965 we won't think this is a type. The C struct hack doesn't
3966 go through namespaces. */
3967 if (TREE_CODE (x) == NAMESPACE_DECL)
3968 set_identifier_type_value_with_scope (name, NULL_TREE,
3969 current_binding_level);
3971 /* If this is an extern function declaration, see if we
3972 have a global definition or declaration for the function. */
3973 if (oldlocal == NULL_TREE
3974 && DECL_EXTERNAL (x)
3975 && oldglobal != NULL_TREE
3976 && TREE_CODE (x) == FUNCTION_DECL
3977 && TREE_CODE (oldglobal) == FUNCTION_DECL)
3979 /* We have one. Their types must agree. */
3980 if (decls_match (x, oldglobal))
3984 cp_warning ("extern declaration of `%#D' doesn't match", x);
3985 cp_warning_at ("global declaration `%#D'", oldglobal);
3988 /* If we have a local external declaration,
3989 and no file-scope declaration has yet been seen,
3990 then if we later have a file-scope decl it must not be static. */
3991 if (oldlocal == NULL_TREE
3992 && oldglobal == NULL_TREE
3993 && DECL_EXTERNAL (x)
3995 TREE_PUBLIC (name) = 1;
3997 if (DECL_FROM_INLINE (x))
3998 /* Inline decls shadow nothing. */;
4000 /* Warn if shadowing an argument at the top level of the body. */
4001 else if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
4002 && TREE_CODE (oldlocal) == PARM_DECL
4003 /* Don't complain if it's from an enclosing function. */
4004 && DECL_CONTEXT (oldlocal) == current_function_decl
4005 && TREE_CODE (x) != PARM_DECL)
4007 /* Go to where the parms should be and see if we
4009 struct binding_level *b = current_binding_level->level_chain;
4015 if (b->parm_flag == 1)
4016 cp_error ("declaration of `%#D' shadows a parameter", name);
4018 else if (warn_shadow && oldlocal != NULL_TREE
4019 && current_binding_level->is_for_scope
4020 && !DECL_DEAD_FOR_LOCAL (oldlocal))
4022 warning ("variable `%s' shadows local",
4023 IDENTIFIER_POINTER (name));
4024 cp_warning_at (" this is the shadowed declaration", oldlocal);
4026 /* Maybe warn if shadowing something else. */
4027 else if (warn_shadow && !DECL_EXTERNAL (x)
4028 /* No shadow warnings for internally generated vars. */
4029 && ! DECL_ARTIFICIAL (x)
4030 /* No shadow warnings for vars made for inlining. */
4031 && ! DECL_FROM_INLINE (x))
4033 const char *warnstring = NULL;
4035 if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL)
4036 warnstring = "declaration of `%s' shadows a parameter";
4037 else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4038 && current_class_ptr
4039 && !TREE_STATIC (name))
4040 warnstring = "declaration of `%s' shadows a member of `this'";
4041 else if (oldlocal != NULL_TREE)
4042 warnstring = "declaration of `%s' shadows previous local";
4043 else if (oldglobal != NULL_TREE)
4044 /* XXX shadow warnings in outer-more namespaces */
4045 warnstring = "declaration of `%s' shadows global declaration";
4048 warning (warnstring, IDENTIFIER_POINTER (name));
4052 if (TREE_CODE (x) == FUNCTION_DECL)
4053 check_default_args (x);
4055 /* Keep count of variables in this level with incomplete type. */
4056 if (TREE_CODE (x) == VAR_DECL
4057 && TREE_TYPE (x) != error_mark_node
4058 && ((TYPE_SIZE (TREE_TYPE (x)) == NULL_TREE
4059 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE))
4060 /* RTTI TD entries are created while defining the type_info. */
4061 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x))
4062 && TYPE_BEING_DEFINED (TREE_TYPE (x)))))
4063 current_binding_level->incomplete
4064 = tree_cons (NULL_TREE, x, current_binding_level->incomplete);
4067 if (need_new_binding)
4068 add_decl_to_level (x,
4069 DECL_NAMESPACE_SCOPE_P (x)
4070 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
4071 : current_binding_level);
4076 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4077 caller to set DECL_CONTEXT properly. */
4080 pushdecl_with_scope (x, level)
4082 struct binding_level *level;
4084 register struct binding_level *b;
4085 tree function_decl = current_function_decl;
4087 current_function_decl = NULL_TREE;
4088 if (level->parm_flag == 2)
4090 b = class_binding_level;
4091 class_binding_level = level;
4092 pushdecl_class_level (x);
4093 class_binding_level = b;
4097 b = current_binding_level;
4098 current_binding_level = level;
4100 current_binding_level = b;
4102 current_function_decl = function_decl;
4106 /* Like pushdecl, only it places X in the current namespace,
4110 pushdecl_namespace_level (x)
4113 register struct binding_level *b = current_binding_level;
4116 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4118 /* Now, the type_shadowed stack may screw us. Munge it so it does
4120 if (TREE_CODE (x) == TYPE_DECL)
4122 tree name = DECL_NAME (x);
4124 tree *ptr = (tree *)0;
4125 for (; b != global_binding_level; b = b->level_chain)
4127 tree shadowed = b->type_shadowed;
4128 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4129 if (TREE_PURPOSE (shadowed) == name)
4131 ptr = &TREE_VALUE (shadowed);
4132 /* Can't break out of the loop here because sometimes
4133 a binding level will have duplicate bindings for
4134 PT names. It's gross, but I haven't time to fix it. */
4137 newval = TREE_TYPE (x);
4138 if (ptr == (tree *)0)
4140 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4141 up here if this is changed to an assertion. --KR */
4142 SET_IDENTIFIER_TYPE_VALUE (name, newval);
4152 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4156 pushdecl_top_level (x)
4159 push_to_top_level ();
4160 x = pushdecl_namespace_level (x);
4161 pop_from_top_level ();
4165 /* Make the declaration of X appear in CLASS scope. */
4168 pushdecl_class_level (x)
4171 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4172 scope looks for the pre-mangled name. */
4175 if (TREE_CODE (x) == OVERLOAD)
4176 x = OVL_CURRENT (x);
4177 name = DECL_NAME (x);
4181 push_class_level_binding (name, x);
4182 if (TREE_CODE (x) == TYPE_DECL)
4183 set_identifier_type_value (name, TREE_TYPE (x));
4185 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
4189 for (f = TYPE_FIELDS (TREE_TYPE (x));
4192 pushdecl_class_level (f);
4196 /* Enter DECL into the symbol table, if that's appropriate. Returns
4197 DECL, or a modified version thereof. */
4200 maybe_push_decl (decl)
4203 tree type = TREE_TYPE (decl);
4205 /* Add this decl to the current binding level, but not if it comes
4206 from another scope, e.g. a static member variable. TEM may equal
4207 DECL or it may be a previous decl of the same name. */
4208 if ((TREE_CODE (decl) != PARM_DECL
4209 && DECL_CONTEXT (decl) != NULL_TREE
4210 /* Definitions of namespace members outside their namespace are
4212 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
4213 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
4214 || TREE_CODE (type) == UNKNOWN_TYPE
4215 /* The declaration of a template specialization does not affect
4216 the functions available for overload resolution, so we do not
4218 || (TREE_CODE (decl) == FUNCTION_DECL
4219 && DECL_TEMPLATE_SPECIALIZATION (decl)))
4222 return pushdecl (decl);
4226 /* This function is used to push the mangled decls for nested types into
4227 the appropriate scope. Previously pushdecl_top_level was used, but that
4228 is incorrect for members of local classes. */
4231 pushdecl_nonclass_level (x)
4234 struct binding_level *b = current_binding_level;
4236 my_friendly_assert (b->parm_flag != 2, 180);
4239 /* Get out of template binding levels */
4240 while (b->pseudo_global)
4244 pushdecl_with_scope (x, b);
4248 /* Make the declaration(s) of X appear in CLASS scope
4249 under the name NAME. */
4252 push_class_level_binding (name, x)
4257 /* The class_binding_level will be NULL if x is a template
4258 parameter name in a member template. */
4259 if (!class_binding_level)
4262 /* Make sure that this new member does not have the same name
4263 as a template parameter. */
4264 if (TYPE_BEING_DEFINED (current_class_type))
4265 check_template_shadow (x);
4267 /* If this declaration shadows a declaration from an enclosing
4268 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4269 we leave this class. Record the shadowed declaration here. */
4270 binding = IDENTIFIER_BINDING (name);
4272 && ((TREE_CODE (x) == OVERLOAD
4273 && BINDING_VALUE (binding)
4274 && is_overloaded_fn (BINDING_VALUE (binding)))
4275 || INHERITED_VALUE_BINDING_P (binding)))
4280 /* If the old binding was from a base class, and was for a tag
4281 name, slide it over to make room for the new binding. The
4282 old binding is still visible if explicitly qualified with a
4284 if (INHERITED_VALUE_BINDING_P (binding)
4285 && BINDING_VALUE (binding)
4286 && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4287 && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4288 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4290 old_decl = BINDING_TYPE (binding);
4291 BINDING_TYPE (binding) = BINDING_VALUE (binding);
4292 BINDING_VALUE (binding) = NULL_TREE;
4293 INHERITED_VALUE_BINDING_P (binding) = 0;
4296 old_decl = BINDING_VALUE (binding);
4298 /* There was already a binding for X containing fewer
4299 functions than are named in X. Find the previous
4300 declaration of X on the class-shadowed list, and update it. */
4301 for (shadow = class_binding_level->class_shadowed;
4303 shadow = TREE_CHAIN (shadow))
4304 if (TREE_PURPOSE (shadow) == name
4305 && TREE_TYPE (shadow) == old_decl)
4307 BINDING_VALUE (binding) = x;
4308 INHERITED_VALUE_BINDING_P (binding) = 0;
4309 TREE_TYPE (shadow) = x;
4314 /* If we didn't replace an existing binding, put the binding on the
4315 stack of bindings for the identifier, and update
4316 IDENTIFIER_CLASS_VALUE. */
4317 if (push_class_binding (name, x))
4319 push_cache_obstack ();
4320 class_binding_level->class_shadowed
4321 = tree_cons (name, IDENTIFIER_CLASS_VALUE (name),
4322 class_binding_level->class_shadowed);
4324 /* Record the value we are binding NAME to so that we can know
4325 what to pop later. */
4326 TREE_TYPE (class_binding_level->class_shadowed) = x;
4330 /* Insert another USING_DECL into the current binding level,
4331 returning this declaration. If this is a redeclaration,
4332 do nothing and return NULL_TREE. */
4335 push_using_decl (scope, name)
4341 my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4342 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4343 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4344 if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4348 decl = build_lang_decl (USING_DECL, name, void_type_node);
4349 DECL_INITIAL (decl) = scope;
4350 TREE_CHAIN (decl) = current_binding_level->usings;
4351 current_binding_level->usings = decl;
4355 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4356 changed (i.e. there was already a directive), or the fresh
4357 TREE_LIST otherwise. */
4360 push_using_directive (used)
4363 tree ud = current_binding_level->using_directives;
4364 tree iter, ancestor;
4366 /* Check if we already have this. */
4367 if (purpose_member (used, ud) != NULL_TREE)
4370 /* Recursively add all namespaces used. */
4371 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4372 push_using_directive (TREE_PURPOSE (iter));
4374 ancestor = namespace_ancestor (current_decl_namespace (), used);
4375 ud = current_binding_level->using_directives;
4376 ud = tree_cons (used, ancestor, ud);
4377 current_binding_level->using_directives = ud;
4381 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4382 other definitions already in place. We get around this by making
4383 the value of the identifier point to a list of all the things that
4384 want to be referenced by that name. It is then up to the users of
4385 that name to decide what to do with that list.
4387 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4388 slot. It is dealt with the same way.
4390 FLAGS is a bitwise-or of the following values:
4391 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4393 PUSH_USING: DECL is being pushed as the result of a using
4396 The value returned may be a previous declaration if we guessed wrong
4397 about what language DECL should belong to (C or C++). Otherwise,
4398 it's always DECL (and never something that's not a _DECL). */
4401 push_overloaded_decl (decl, flags)
4405 tree name = DECL_NAME (decl);
4408 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4411 old = namespace_binding (name, DECL_CONTEXT (decl));
4413 old = lookup_name_current_level (name);
4417 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4419 tree t = TREE_TYPE (old);
4420 if (IS_AGGR_TYPE (t) && warn_shadow
4421 && (! DECL_IN_SYSTEM_HEADER (decl)
4422 || ! DECL_IN_SYSTEM_HEADER (old)))
4423 cp_warning ("`%#D' hides constructor for `%#T'", decl, t);
4426 else if (is_overloaded_fn (old))
4430 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4432 tree fn = OVL_CURRENT (tmp);
4434 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4435 && !(flags & PUSH_USING)
4436 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4437 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4438 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4441 if (duplicate_decls (decl, fn))
4447 cp_error_at ("previous non-function declaration `%#D'", old);
4448 cp_error ("conflicts with function declaration `%#D'", decl);
4453 if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4455 if (old && TREE_CODE (old) != OVERLOAD)
4456 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4458 new_binding = ovl_cons (decl, old);
4459 if (flags & PUSH_USING)
4460 OVL_USED (new_binding) = 1;
4463 /* NAME is not ambiguous. */
4467 set_namespace_binding (name, current_namespace, new_binding);
4470 /* We only create an OVERLOAD if there was a previous binding at
4471 this level, or if decl is a template. In the former case, we
4472 need to remove the old binding and replace it with the new
4473 binding. We must also run through the NAMES on the binding
4474 level where the name was bound to update the chain. */
4476 if (TREE_CODE (new_binding) == OVERLOAD && old)
4480 for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4482 d = &TREE_CHAIN (*d))
4484 || (TREE_CODE (*d) == TREE_LIST
4485 && TREE_VALUE (*d) == old))
4487 if (TREE_CODE (*d) == TREE_LIST)
4488 /* Just replace the old binding with the new. */
4489 TREE_VALUE (*d) = new_binding;
4491 /* Build a TREE_LIST to wrap the OVERLOAD. */
4492 *d = tree_cons (NULL_TREE, new_binding,
4495 /* And update the CPLUS_BINDING node. */
4496 BINDING_VALUE (IDENTIFIER_BINDING (name))
4501 /* We should always find a previous binding in this case. */
4502 my_friendly_abort (0);
4505 /* Install the new binding. */
4506 push_local_binding (name, new_binding, flags);
4512 /* Generate an implicit declaration for identifier FUNCTIONID
4513 as a function of type int (). Print a warning if appropriate. */
4516 implicitly_declare (functionid)
4520 int temp = allocation_temporary_p ();
4522 push_obstacks_nochange ();
4524 /* Save the decl permanently so we can warn if definition follows.
4525 In ANSI C, warn_implicit is usually false, so the saves little space.
4526 But in C++, it's usually true, hence the extra code. */
4527 if (temp && (! warn_implicit || toplevel_bindings_p ()))
4528 end_temporary_allocation ();
4530 /* We used to reuse an old implicit decl here,
4531 but this loses with inline functions because it can clobber
4532 the saved decl chains. */
4533 decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4535 DECL_EXTERNAL (decl) = 1;
4536 TREE_PUBLIC (decl) = 1;
4538 /* ANSI standard says implicit declarations are in the innermost block.
4539 So we record the decl in the standard fashion. */
4541 rest_of_decl_compilation (decl, NULL_PTR, 0, 0);
4544 /* Only one warning per identifier. */
4545 && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4547 cp_pedwarn ("implicit declaration of function `%#D'", decl);
4550 SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4557 /* Return zero if the declaration NEWDECL is valid
4558 when the declaration OLDDECL (assumed to be for the same name)
4559 has already been seen.
4560 Otherwise return an error message format string with a %s
4561 where the identifier should go. */
4564 redeclaration_error_message (newdecl, olddecl)
4565 tree newdecl, olddecl;
4567 if (TREE_CODE (newdecl) == TYPE_DECL)
4569 /* Because C++ can put things into name space for free,
4570 constructs like "typedef struct foo { ... } foo"
4571 would look like an erroneous redeclaration. */
4572 if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4575 return "redefinition of `%#D'";
4577 else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4579 /* If this is a pure function, its olddecl will actually be
4580 the original initialization to `0' (which we force to call
4581 abort()). Don't complain about redefinition in this case. */
4582 if (DECL_LANG_SPECIFIC (olddecl) && DECL_ABSTRACT_VIRTUAL_P (olddecl))
4585 /* If both functions come from different namespaces, this is not
4586 a redeclaration - this is a conflict with a used function. */
4587 if (DECL_NAMESPACE_SCOPE_P (olddecl)
4588 && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4589 return "`%D' conflicts with used function";
4591 /* We'll complain about linkage mismatches in
4592 warn_extern_redeclared_static. */
4594 /* Defining the same name twice is no good. */
4595 if (DECL_INITIAL (olddecl) != NULL_TREE
4596 && DECL_INITIAL (newdecl) != NULL_TREE)
4598 if (DECL_NAME (olddecl) == NULL_TREE)
4599 return "`%#D' not declared in class";
4601 return "redefinition of `%#D'";
4605 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4607 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4608 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4609 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4610 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4611 && TYPE_SIZE (TREE_TYPE (newdecl))
4612 && TYPE_SIZE (TREE_TYPE (olddecl))))
4613 return "redefinition of `%#D'";
4616 else if (toplevel_bindings_p ())
4618 /* Objects declared at top level: */
4619 /* If at least one is a reference, it's ok. */
4620 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4622 /* Reject two definitions. */
4623 return "redefinition of `%#D'";
4627 /* Objects declared with block scope: */
4628 /* Reject two definitions, and reject a definition
4629 together with an external reference. */
4630 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4631 return "redeclaration of `%#D'";
4636 /* Create a new label, named ID. */
4639 make_label_decl (id, local_p)
4645 decl = build_decl (LABEL_DECL, id, void_type_node);
4647 /* Make sure every label has an rtx. */
4650 DECL_CONTEXT (decl) = current_function_decl;
4651 DECL_MODE (decl) = VOIDmode;
4652 C_DECLARED_LABEL_FLAG (decl) = local_p;
4654 /* Say where one reference is to the label, for the sake of the
4655 error if it is not defined. */
4656 DECL_SOURCE_LINE (decl) = lineno;
4657 DECL_SOURCE_FILE (decl) = input_filename;
4659 /* Record the fact that this identifier is bound to this label. */
4660 SET_IDENTIFIER_LABEL_VALUE (id, decl);
4662 /* Record this label on the list of used labels so that we can check
4663 at the end of the function to see whether or not the label was
4664 actually defined. */
4665 if ((named_label_uses == NULL || named_label_uses->label_decl != decl)
4666 && (named_label_uses == NULL
4667 || named_label_uses->names_in_scope != current_binding_level->names
4668 || named_label_uses->label_decl != decl))
4670 struct named_label_list *new_ent;
4672 = (struct named_label_list*)oballoc (sizeof (struct named_label_list));
4673 new_ent->label_decl = decl;
4674 new_ent->names_in_scope = current_binding_level->names;
4675 new_ent->binding_level = current_binding_level;
4676 new_ent->lineno_o_goto = lineno;
4677 new_ent->filename_o_goto = input_filename;
4678 new_ent->next = named_label_uses;
4679 named_label_uses = new_ent;
4685 /* Look for a label named ID in the current function. If one cannot
4686 be found, create one. (We keep track of used, but undefined,
4687 labels, and complain about them at the end of a function.) */
4695 /* You can't use labels at global scope. */
4696 if (current_function_decl == NULL_TREE)
4698 error ("label `%s' referenced outside of any function",
4699 IDENTIFIER_POINTER (id));
4703 /* See if we've already got this label. */
4704 decl = IDENTIFIER_LABEL_VALUE (id);
4705 if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
4708 /* Record this label on the list of labels used in this function.
4709 We do this before calling make_label_decl so that we get the
4710 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4711 named_labels = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4713 /* We need a new label. */
4714 decl = make_label_decl (id, /*local_p=*/0);
4715 /* Now fill in the information we didn't have before. */
4716 TREE_VALUE (named_labels) = decl;
4721 /* Declare a local label named ID. */
4724 declare_local_label (id)
4729 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4730 this scope we can restore the old value of
4731 IDENTIFIER_TYPE_VALUE. */
4732 current_binding_level->shadowed_labels
4733 = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4734 current_binding_level->shadowed_labels);
4735 /* Look for the label. */
4736 decl = make_label_decl (id, /*local_p=*/1);
4737 /* Now fill in the information we didn't have before. */
4738 TREE_VALUE (current_binding_level->shadowed_labels) = decl;
4743 /* Define a label, specifying the location in the source file.
4744 Return the LABEL_DECL node for the label, if the definition is valid.
4745 Otherwise return 0. */
4748 define_label (filename, line, name)
4753 tree decl = lookup_label (name);
4755 /* After labels, make any new cleanups go into their
4756 own new (temporary) binding contour. */
4757 current_binding_level->more_cleanups_ok = 0;
4759 if (name == get_identifier ("wchar_t"))
4760 cp_pedwarn ("label named wchar_t");
4762 if (DECL_INITIAL (decl) != NULL_TREE)
4764 cp_error ("duplicate label `%D'", decl);
4769 struct named_label_list *uses, *prev;
4773 /* Mark label as having been defined. */
4774 DECL_INITIAL (decl) = error_mark_node;
4775 /* Say where in the source. */
4776 DECL_SOURCE_FILE (decl) = filename;
4777 DECL_SOURCE_LINE (decl) = line;
4780 uses = named_label_uses;
4781 while (uses != NULL)
4782 if (uses->label_decl == decl)
4784 struct binding_level *b = current_binding_level;
4787 tree new_decls = b->names;
4788 tree old_decls = (b == uses->binding_level)
4789 ? uses->names_in_scope : NULL_TREE;
4790 while (new_decls != old_decls)
4792 if (TREE_CODE (new_decls) == VAR_DECL
4793 /* Don't complain about crossing initialization
4794 of internal entities. They can't be accessed,
4795 and they should be cleaned up
4796 by the time we get to the label. */
4797 && ! DECL_ARTIFICIAL (new_decls)
4798 && !(DECL_INITIAL (new_decls) == NULL_TREE
4799 && pod_type_p (TREE_TYPE (new_decls))))
4801 /* This is really only important if we're crossing
4802 an initialization. The POD stuff is just
4803 pedantry; why should it matter if the class
4804 contains a field of pointer to member type? */
4805 int problem = (DECL_INITIAL (new_decls)
4806 || (TYPE_NEEDS_CONSTRUCTING
4807 (TREE_TYPE (new_decls))));
4813 cp_error ("jump to label `%D'", decl);
4814 error_with_file_and_line
4815 (uses->filename_o_goto,
4816 uses->lineno_o_goto, " from here");
4820 cp_pedwarn ("jump to label `%D'", decl);
4821 pedwarn_with_file_and_line
4822 (uses->filename_o_goto,
4823 uses->lineno_o_goto, " from here");
4829 cp_error_at (" crosses initialization of `%#D'",
4832 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4835 new_decls = TREE_CHAIN (new_decls);
4837 if (b == uses->binding_level)
4839 if (b->eh_region && ! saw_eh)
4843 cp_error ("jump to label `%D'", decl);
4844 error_with_file_and_line
4845 (uses->filename_o_goto,
4846 uses->lineno_o_goto, " from here");
4849 error (" enters exception handling block");
4856 prev->next = uses->next;
4858 named_label_uses = uses->next;
4867 current_function_return_value = NULL_TREE;
4874 struct binding_level *level;
4875 struct cp_switch *next;
4878 static struct cp_switch *switch_stack;
4884 = (struct cp_switch *) oballoc (sizeof (struct cp_switch));
4885 p->level = current_binding_level;
4886 p->next = switch_stack;
4893 switch_stack = switch_stack->next;
4896 /* Note that we've seen a definition of a case label, and complain if this
4897 is a bad place for one. */
4900 define_case_label ()
4902 tree cleanup = last_cleanup_this_contour ();
4903 struct binding_level *b = current_binding_level;
4907 /* Don't crash; we'll complain in do_case. */
4912 static int explained = 0;
4913 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup));
4914 warning ("where case label appears here");
4917 warning ("(enclose actions of previous case statements requiring");
4918 warning ("destructors in their own binding contours.)");
4923 for (; b && b != switch_stack->level; b = b->level_chain)
4925 tree new_decls = b->names;
4926 for (; new_decls; new_decls = TREE_CHAIN (new_decls))
4928 if (TREE_CODE (new_decls) == VAR_DECL
4929 /* Don't complain about crossing initialization
4930 of internal entities. They can't be accessed,
4931 and they should be cleaned up
4932 by the time we get to the label. */
4933 && ! DECL_ARTIFICIAL (new_decls)
4934 && ((DECL_INITIAL (new_decls) != NULL_TREE
4935 && DECL_INITIAL (new_decls) != error_mark_node)
4936 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls))))
4939 error ("jump to case label");
4941 cp_error_at (" crosses initialization of `%#D'",
4947 /* After labels, make any new cleanups go into their
4948 own new (temporary) binding contour. */
4950 current_binding_level->more_cleanups_ok = 0;
4951 current_function_return_value = NULL_TREE;
4954 /* Return the list of declarations of the current level.
4955 Note that this list is in reverse order unless/until
4956 you nreverse it; and when you do nreverse it, you must
4957 store the result back using `storedecls' or you will lose. */
4962 return current_binding_level->names;
4965 /* Return the list of type-tags (for structs, etc) of the current level. */
4970 return current_binding_level->tags;
4973 /* Store the list of declarations of the current level.
4974 This is done for the parameter declarations of a function being defined,
4975 after they are modified in the light of any missing parameters. */
4981 current_binding_level->names = decls;
4984 /* Similarly, store the list of tags of the current level. */
4990 current_binding_level->tags = tags;
4993 /* Given NAME, an IDENTIFIER_NODE,
4994 return the structure (or union or enum) definition for that name.
4995 Searches binding levels from BINDING_LEVEL up to the global level.
4996 If THISLEVEL_ONLY is nonzero, searches only the specified context
4997 (but skips any tag-transparent contexts to find one that is
4998 meaningful for tags).
4999 FORM says which kind of type the caller wants;
5000 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5001 If the wrong kind of type is found, and it's not a template, an error is
5005 lookup_tag (form, name, binding_level, thislevel_only)
5006 enum tree_code form;
5008 struct binding_level *binding_level;
5011 register struct binding_level *level;
5012 /* Non-zero if, we should look past a pseudo-global level, even if
5014 int allow_pseudo_global = 1;
5016 for (level = binding_level; level; level = level->level_chain)
5019 if (ANON_AGGRNAME_P (name))
5020 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5022 /* There's no need for error checking here, because
5023 anon names are unique throughout the compilation. */
5024 if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
5025 return TREE_VALUE (tail);
5027 else if (level->namespace_p)
5028 /* Do namespace lookup. */
5029 for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
5031 tree old = binding_for_name (name, tail);
5033 /* If we just skipped past a pseudo global level, even
5034 though THISLEVEL_ONLY, and we find a template class
5035 declaration, then we use the _TYPE node for the
5036 template. See the example below. */
5037 if (thislevel_only && !allow_pseudo_global
5038 && old && BINDING_VALUE (old)
5039 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
5040 old = TREE_TYPE (BINDING_VALUE (old));
5042 old = BINDING_TYPE (old);
5044 /* If it has an original type, it is a typedef, and we
5045 should not return it. */
5046 if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old)))
5048 if (old && TREE_CODE (old) != form
5049 && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL))
5051 cp_error ("`%#D' redeclared as %C", old, form);
5056 if (thislevel_only || tail == global_namespace)
5060 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5062 if (TREE_PURPOSE (tail) == name)
5064 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
5065 /* Should tighten this up; it'll probably permit
5066 UNION_TYPE and a struct template, for example. */
5068 && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL))
5070 /* Definition isn't the kind we were looking for. */
5071 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail),
5075 return TREE_VALUE (tail);
5078 if (thislevel_only && ! level->tag_transparent)
5080 if (level->pseudo_global && allow_pseudo_global)
5082 /* We must deal with cases like this:
5084 template <class T> struct S;
5085 template <class T> struct S {};
5087 When looking up `S', for the second declaration, we
5088 would like to find the first declaration. But, we
5089 are in the pseudo-global level created for the
5090 template parameters, rather than the (surrounding)
5091 namespace level. Thus, we keep going one more level,
5092 even though THISLEVEL_ONLY is non-zero. */
5093 allow_pseudo_global = 0;
5105 set_current_level_tags_transparency (tags_transparent)
5106 int tags_transparent;
5108 current_binding_level->tag_transparent = tags_transparent;
5112 /* Given a type, find the tag that was defined for it and return the tag name.
5113 Otherwise return 0. However, the value can never be 0
5114 in the cases in which this is used.
5116 C++: If NAME is non-zero, this is the new name to install. This is
5117 done when replacing anonymous tags with real tag names. */
5120 lookup_tag_reverse (type, name)
5124 register struct binding_level *level;
5126 for (level = current_binding_level; level; level = level->level_chain)
5129 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5131 if (TREE_VALUE (tail) == type)
5134 TREE_PURPOSE (tail) = name;
5135 return TREE_PURPOSE (tail);
5142 /* Look up NAME in the NAMESPACE. */
5145 lookup_namespace_name (namespace, name)
5146 tree namespace, name;
5149 tree template_id = NULL_TREE;
5151 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5153 if (TREE_CODE (name) == NAMESPACE_DECL)
5154 /* This happens for A::B<int> when B is a namespace. */
5156 else if (TREE_CODE (name) == TEMPLATE_DECL)
5158 /* This happens for A::B where B is a template, and there are no
5159 template arguments. */
5160 cp_error ("invalid use of `%D'", name);
5161 return error_mark_node;
5164 namespace = ORIGINAL_NAMESPACE (namespace);
5166 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5169 name = TREE_OPERAND (name, 0);
5170 if (TREE_CODE (name) == OVERLOAD)
5171 name = DECL_NAME (OVL_CURRENT (name));
5172 else if (TREE_CODE_CLASS (TREE_CODE (name)) == 'd')
5173 name = DECL_NAME (name);
5176 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5178 val = make_node (CPLUS_BINDING);
5179 if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5180 return error_mark_node;
5182 if (BINDING_VALUE (val))
5184 val = BINDING_VALUE (val);
5188 if (DECL_CLASS_TEMPLATE_P (val))
5189 val = lookup_template_class (val,
5190 TREE_OPERAND (template_id, 1),
5191 /*in_decl=*/NULL_TREE,
5192 /*context=*/NULL_TREE,
5193 /*entering_scope=*/0);
5194 else if (DECL_FUNCTION_TEMPLATE_P (val)
5195 || TREE_CODE (val) == OVERLOAD)
5196 val = lookup_template_function (val,
5197 TREE_OPERAND (template_id, 1));
5200 cp_error ("`%D::%D' is not a template",
5202 return error_mark_node;
5206 /* If we have a single function from a using decl, pull it out. */
5207 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5208 val = OVL_FUNCTION (val);
5212 cp_error ("`%D' undeclared in namespace `%D'", name, namespace);
5213 return error_mark_node;
5216 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5218 static unsigned long
5226 hash = (((unsigned long) TYPE_CONTEXT (t))
5227 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5232 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5235 typename_compare (k1, k2)
5246 d1 = TYPE_NAME (t1);
5247 d2 = TYPE_NAME (t2);
5249 return (DECL_NAME (d1) == DECL_NAME (d2)
5250 && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5251 && ((TREE_TYPE (t1) != NULL_TREE)
5252 == (TREE_TYPE (t2) != NULL_TREE))
5253 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5254 && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5257 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5258 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5259 is non-NULL, this type is being created by the implicit typename
5260 extension, and BASE_TYPE is a type named `t' in some base class of
5261 `T' which depends on template parameters.
5263 Returns the new TYPENAME_TYPE. */
5266 build_typename_type (context, name, fullname, base_type)
5274 struct hash_entry* e;
5276 static struct hash_table ht;
5278 push_obstacks (&permanent_obstack, &permanent_obstack);
5282 static struct hash_table *h = &ht;
5283 if (!hash_table_init (&ht, &hash_newfunc, &typename_hash,
5285 fatal ("virtual memory exhausted");
5286 ggc_add_tree_hash_table_root (&h, 1);
5289 /* Build the TYPENAME_TYPE. */
5290 t = make_lang_type (TYPENAME_TYPE);
5291 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5292 TYPENAME_TYPE_FULLNAME (t) = fullname;
5293 TREE_TYPE (t) = base_type;
5295 /* Build the corresponding TYPE_DECL. */
5296 d = build_decl (TYPE_DECL, name, t);
5297 TYPE_NAME (TREE_TYPE (d)) = d;
5298 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5299 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5300 DECL_ARTIFICIAL (d) = 1;
5302 /* See if we already have this type. */
5303 e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5307 /* Insert the type into the table. */
5308 hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5316 make_typename_type (context, name)
5321 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
5323 if (!(TYPE_LANG_SPECIFIC (name)
5324 && (CLASSTYPE_IS_TEMPLATE (name)
5325 || CLASSTYPE_USE_TEMPLATE (name))))
5326 name = TYPE_IDENTIFIER (name);
5328 /* Create a TEMPLATE_ID_EXPR for the type. */
5329 name = build_nt (TEMPLATE_ID_EXPR,
5330 CLASSTYPE_TI_TEMPLATE (name),
5331 CLASSTYPE_TI_ARGS (name));
5333 else if (TREE_CODE (name) == TYPE_DECL)
5334 name = DECL_NAME (name);
5338 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5340 name = TREE_OPERAND (name, 0);
5341 if (TREE_CODE (name) == TEMPLATE_DECL)
5342 name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5344 if (TREE_CODE (name) != IDENTIFIER_NODE)
5345 my_friendly_abort (2000);
5347 if (TREE_CODE (context) == NAMESPACE_DECL)
5349 /* We can get here from typename_sub0 in the explicit_template_type
5350 expansion. Just fail. */
5351 cp_error ("no class template named `%#T' in `%#T'",
5353 return error_mark_node;
5356 if (! uses_template_parms (context)
5357 || currently_open_class (context))
5359 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5361 tree tmpl = NULL_TREE;
5362 if (IS_AGGR_TYPE (context))
5363 tmpl = lookup_field (context, name, 0, 0);
5364 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5366 cp_error ("no class template named `%#T' in `%#T'",
5368 return error_mark_node;
5371 return lookup_template_class (tmpl,
5372 TREE_OPERAND (fullname, 1),
5374 /*entering_scope=*/0);
5380 if (!IS_AGGR_TYPE (context))
5382 cp_error ("no type named `%#T' in `%#T'", name, context);
5383 return error_mark_node;
5386 t = lookup_field (context, name, 0, 1);
5388 return TREE_TYPE (t);
5392 /* If the CONTEXT is not a template type, then either the field is
5393 there now or its never going to be. */
5394 if (!uses_template_parms (context))
5396 cp_error ("no type named `%#T' in `%#T'", name, context);
5397 return error_mark_node;
5401 return build_typename_type (context, name, fullname, NULL_TREE);
5404 /* Select the right _DECL from multiple choices. */
5407 select_decl (binding, flags)
5412 val = BINDING_VALUE (binding);
5413 if (LOOKUP_NAMESPACES_ONLY (flags))
5415 /* We are not interested in types. */
5416 if (val && TREE_CODE (val) == NAMESPACE_DECL)
5421 /* If we could have a type and
5422 we have nothing or we need a type and have none. */
5423 if (BINDING_TYPE (binding)
5424 && (!val || ((flags & LOOKUP_PREFER_TYPES)
5425 && TREE_CODE (val) != TYPE_DECL)))
5426 val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5427 /* Don't return non-types if we really prefer types. */
5428 else if (val && LOOKUP_TYPES_ONLY (flags) && TREE_CODE (val) != TYPE_DECL
5429 && (TREE_CODE (val) != TEMPLATE_DECL
5430 || !DECL_CLASS_TEMPLATE_P (val)))
5436 /* Unscoped lookup of a global: iterate over current namespaces,
5437 considering using-directives. If SPACESP is non-NULL, store a list
5438 of the namespaces we've considered in it. */
5441 unqualified_namespace_lookup (name, flags, spacesp)
5446 tree b = make_node (CPLUS_BINDING);
5447 tree initial = current_decl_namespace();
5448 tree scope = initial;
5450 struct binding_level *level;
5451 tree val = NULL_TREE;
5454 *spacesp = NULL_TREE;
5456 for (; !val; scope = CP_DECL_CONTEXT (scope))
5459 *spacesp = tree_cons (scope, NULL_TREE, *spacesp);
5460 val = binding_for_name (name, scope);
5462 /* Initialize binding for this context. */
5463 BINDING_VALUE (b) = BINDING_VALUE (val);
5464 BINDING_TYPE (b) = BINDING_TYPE (val);
5466 /* Add all _DECLs seen through local using-directives. */
5467 for (level = current_binding_level;
5468 !level->namespace_p;
5469 level = level->level_chain)
5470 if (!lookup_using_namespace (name, b, level->using_directives,
5471 scope, flags, spacesp))
5472 /* Give up because of error. */
5473 return error_mark_node;
5475 /* Add all _DECLs seen through global using-directives. */
5476 /* XXX local and global using lists should work equally. */
5480 if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5481 scope, flags, spacesp))
5482 /* Give up because of error. */
5483 return error_mark_node;
5484 if (siter == scope) break;
5485 siter = CP_DECL_CONTEXT (siter);
5488 val = select_decl (b, flags);
5489 if (scope == global_namespace)
5495 /* Combine prefer_type and namespaces_only into flags. */
5498 lookup_flags (prefer_type, namespaces_only)
5499 int prefer_type, namespaces_only;
5501 if (namespaces_only)
5502 return LOOKUP_PREFER_NAMESPACES;
5503 if (prefer_type > 1)
5504 return LOOKUP_PREFER_TYPES;
5505 if (prefer_type > 0)
5506 return LOOKUP_PREFER_BOTH;
5510 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5511 ignore it or not. Subroutine of lookup_name_real. */
5514 qualify_lookup (val, flags)
5518 if (val == NULL_TREE)
5520 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5522 if ((flags & LOOKUP_PREFER_TYPES)
5523 && (TREE_CODE (val) == TYPE_DECL
5524 || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5525 && DECL_CLASS_TEMPLATE_P (val))))
5527 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5532 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5536 warn_about_implicit_typename_lookup (typename, binding)
5540 tree subtype = TREE_TYPE (TREE_TYPE (typename));
5541 tree name = DECL_NAME (typename);
5543 if (! (TREE_CODE (binding) == TEMPLATE_DECL
5544 && CLASSTYPE_TEMPLATE_INFO (subtype)
5545 && CLASSTYPE_TI_TEMPLATE (subtype) == binding)
5546 && ! (TREE_CODE (binding) == TYPE_DECL
5547 && same_type_p (TREE_TYPE (binding), subtype)))
5549 cp_warning ("lookup of `%D' finds `%#D'",
5551 cp_warning (" instead of `%D' from dependent base class",
5553 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5554 constructor_name (current_class_type), name);
5558 /* Look up NAME in the current binding level and its superiors in the
5559 namespace of variables, functions and typedefs. Return a ..._DECL
5560 node of some kind representing its definition if there is only one
5561 such declaration, or return a TREE_LIST with all the overloaded
5562 definitions if there are many, or return 0 if it is undefined.
5564 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5565 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5566 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5567 Otherwise we prefer non-TYPE_DECLs.
5569 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5570 using IDENTIFIER_CLASS_VALUE. */
5573 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
5575 int prefer_type, nonclass, namespaces_only;
5578 tree val = NULL_TREE;
5580 tree from_obj = NULL_TREE;
5582 int val_is_implicit_typename = 0;
5584 /* Hack: copy flag set by parser, if set. */
5585 if (only_namespace_names)
5586 namespaces_only = 1;
5588 if (prefer_type == -2)
5590 extern int looking_for_typename;
5591 tree type = NULL_TREE;
5594 prefer_type = looking_for_typename;
5596 flags = lookup_flags (prefer_type, namespaces_only);
5597 /* If the next thing is '<', class templates are types. */
5598 if (looking_for_template)
5599 flags |= LOOKUP_TEMPLATES_EXPECTED;
5601 /* std:: becomes :: for now. */
5602 if (got_scope == std_node)
5603 got_scope = void_type_node;
5607 else if (got_object != error_mark_node)
5612 if (type == error_mark_node)
5613 return error_mark_node;
5614 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
5615 type = TREE_TYPE (type);
5618 type = complete_type (type);
5620 if (TREE_CODE (type) == VOID_TYPE)
5621 type = global_namespace;
5622 if (TREE_CODE (type) == NAMESPACE_DECL)
5624 val = make_node (CPLUS_BINDING);
5625 flags |= LOOKUP_COMPLAIN;
5626 if (!qualified_lookup_using_namespace (name, type, val, flags))
5628 val = select_decl (val, flags);
5630 else if (! IS_AGGR_TYPE (type)
5631 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5632 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
5633 || TREE_CODE (type) == TYPENAME_TYPE)
5634 /* Someone else will give an error about this if needed. */
5636 else if (type == current_class_type)
5637 val = IDENTIFIER_CLASS_VALUE (name);
5639 val = lookup_member (type, name, 0, prefer_type);
5646 else if (got_object && val)
5651 flags = lookup_flags (prefer_type, namespaces_only);
5652 /* If we're not parsing, we need to complain. */
5653 flags |= LOOKUP_COMPLAIN;
5656 /* First, look in non-namespace scopes. */
5658 if (current_class_type == NULL_TREE)
5661 for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t))
5665 if (!LOCAL_BINDING_P (t) && nonclass)
5666 /* We're not looking for class-scoped bindings, so keep going. */
5669 /* If this is the kind of thing we're looking for, we're done. */
5670 if (qualify_lookup (BINDING_VALUE (t), flags))
5671 binding = BINDING_VALUE (t);
5672 else if ((flags & LOOKUP_PREFER_TYPES)
5673 && qualify_lookup (BINDING_TYPE (t), flags))
5674 binding = BINDING_TYPE (t);
5676 binding = NULL_TREE;
5679 && (!val || !IMPLICIT_TYPENAME_TYPE_DECL_P (binding)))
5681 if (val_is_implicit_typename && !yylex)
5682 warn_about_implicit_typename_lookup (val, binding);
5684 val_is_implicit_typename
5685 = IMPLICIT_TYPENAME_TYPE_DECL_P (val);
5686 if (!val_is_implicit_typename)
5691 /* Now lookup in namespace scopes. */
5692 if (!val || val_is_implicit_typename)
5694 t = unqualified_namespace_lookup (name, flags, 0);
5697 if (val_is_implicit_typename && !yylex)
5698 warn_about_implicit_typename_lookup (val, t);
5706 /* This should only warn about types used in qualified-ids. */
5707 if (from_obj && from_obj != val)
5709 if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
5710 && TREE_CODE (val) == TYPE_DECL
5711 && TREE_TYPE (from_obj) != TREE_TYPE (val))
5713 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5714 name, got_object, TREE_TYPE (from_obj));
5715 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5719 /* We don't change val to from_obj if got_object depends on
5720 template parms because that breaks implicit typename for
5721 destructor calls. */
5722 if (! uses_template_parms (got_object))
5726 /* If we have a single function from a using decl, pull it out. */
5727 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5728 val = OVL_FUNCTION (val);
5737 lookup_name_nonclass (name)
5740 return lookup_name_real (name, 0, 1, 0);
5744 lookup_function_nonclass (name, args)
5748 return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
5752 lookup_name_namespace_only (name)
5755 /* type-or-namespace, nonclass, namespace_only */
5756 return lookup_name_real (name, 1, 1, 1);
5760 lookup_name (name, prefer_type)
5764 return lookup_name_real (name, prefer_type, 0, 0);
5767 /* Similar to `lookup_name' but look only in the innermost non-class
5771 lookup_name_current_level (name)
5774 struct binding_level *b;
5777 b = current_binding_level;
5778 while (b->parm_flag == 2)
5783 t = IDENTIFIER_NAMESPACE_VALUE (name);
5785 /* extern "C" function() */
5786 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
5789 else if (IDENTIFIER_BINDING (name)
5790 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
5794 if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
5795 return IDENTIFIER_VALUE (name);
5807 /* Like lookup_name_current_level, but for types. */
5810 lookup_type_current_level (name)
5813 register tree t = NULL_TREE;
5815 my_friendly_assert (! current_binding_level->namespace_p, 980716);
5817 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
5818 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
5820 struct binding_level *b = current_binding_level;
5823 if (purpose_member (name, b->type_shadowed))
5824 return REAL_IDENTIFIER_TYPE_VALUE (name);
5836 begin_only_namespace_names ()
5838 only_namespace_names = 1;
5842 end_only_namespace_names ()
5844 only_namespace_names = 0;
5847 /* Arrange for the user to get a source line number, even when the
5848 compiler is going down in flames, so that she at least has a
5849 chance of working around problems in the compiler. We used to
5850 call error(), but that let the segmentation fault continue
5851 through; now, it's much more passive by asking them to send the
5852 maintainers mail about the problem. */
5856 int sig ATTRIBUTE_UNUSED;
5858 signal (SIGSEGV, SIG_DFL);
5860 signal (SIGIOT, SIG_DFL);
5863 signal (SIGILL, SIG_DFL);
5866 signal (SIGABRT, SIG_DFL);
5869 signal (SIGBUS, SIG_DFL);
5871 my_friendly_abort (0);
5874 /* Push the declarations of builtin types into the namespace.
5875 RID_INDEX, if < RID_MAX is the index of the builtin type
5876 in the array RID_POINTERS. NAME is the name used when looking
5877 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5880 record_builtin_type (rid_index, name, type)
5885 tree rname = NULL_TREE, tname = NULL_TREE;
5886 tree tdecl = NULL_TREE;
5888 if ((int) rid_index < (int) RID_MAX)
5889 rname = ridpointers[(int) rid_index];
5891 tname = get_identifier (name);
5893 TYPE_BUILT_IN (type) = 1;
5897 tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
5898 set_identifier_type_value (tname, NULL_TREE);
5899 if ((int) rid_index < (int) RID_MAX)
5900 /* Built-in types live in the global namespace. */
5901 SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
5903 if (rname != NULL_TREE)
5905 if (tname != NULL_TREE)
5907 set_identifier_type_value (rname, NULL_TREE);
5908 SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
5912 tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
5913 set_identifier_type_value (rname, NULL_TREE);
5918 /* Record one of the standard Java types.
5919 * Declare it as having the given NAME.
5920 * If SIZE > 0, it is the size of one of the integral types;
5921 * otherwise it is the negative of the size of one of the other types. */
5924 record_builtin_java_type (name, size)
5930 type = make_signed_type (size);
5931 else if (size > -32)
5932 { /* "__java_char" or ""__java_boolean". */
5933 type = make_unsigned_type (-size);
5934 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5937 { /* "__java_float" or ""__java_double". */
5938 type = make_node (REAL_TYPE);
5939 TYPE_PRECISION (type) = - size;
5942 record_builtin_type (RID_MAX, name, type);
5943 decl = TYPE_NAME (type);
5945 /* Suppress generate debug symbol entries for these types,
5946 since for normal C++ they are just clutter.
5947 However, push_lang_context undoes this if extern "Java" is seen. */
5948 DECL_IGNORED_P (decl) = 1;
5950 TYPE_FOR_JAVA (type) = 1;
5954 /* Push a type into the namespace so that the back-ends ignore it. */
5957 record_unknown_type (type, name)
5961 tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
5962 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5963 DECL_IGNORED_P (decl) = 1;
5964 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
5965 TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
5966 TYPE_ALIGN (type) = 1;
5967 TYPE_MODE (type) = TYPE_MODE (void_type_node);
5970 /* Push overloaded decl, in global scope, with one argument so it
5971 can be used as a callback from define_function. */
5974 push_overloaded_decl_1 (x)
5977 push_overloaded_decl (x, PUSH_GLOBAL);
5984 auto_function (name, type)
5987 return define_function
5988 (IDENTIFIER_POINTER (name), type, push_overloaded_decl_1,
5989 IDENTIFIER_POINTER (build_decl_overload (name, TYPE_ARG_TYPES (type),
5993 /* Create the predefined scalar types of C,
5994 and some nodes representing standard constants (0, 1, (void *)0).
5995 Initialize the global binding level.
5996 Make definitions for built-in primitive functions. */
5999 init_decl_processing ()
6002 int wchar_type_size;
6003 tree array_domain_type;
6005 /* Have to make these distinct before we try using them. */
6006 lang_name_cplusplus = get_identifier ("C++");
6007 lang_name_c = get_identifier ("C");
6008 lang_name_java = get_identifier ("Java");
6010 /* Let the back-end now how to save and restore language-specific
6011 per-function globals. */
6012 init_lang_status = &push_cp_function_context;
6013 free_lang_status = &pop_cp_function_context;
6014 mark_lang_status = &mark_cp_function_context;
6020 /* Create the global variables. */
6021 push_to_top_level ();
6023 /* Enter the global namespace. */
6024 my_friendly_assert (global_namespace == NULL_TREE, 375);
6025 push_namespace (get_identifier ("::"));
6026 global_namespace = current_namespace;
6027 current_lang_name = NULL_TREE;
6029 if (flag_strict_prototype == 2)
6030 flag_strict_prototype = pedantic;
6031 if (! flag_permissive && ! pedantic)
6032 flag_pedantic_errors = 1;
6034 strict_prototypes_lang_c = flag_strict_prototype;
6037 current_lang_name = lang_name_c;
6039 current_function_decl = NULL_TREE;
6040 current_binding_level = NULL_BINDING_LEVEL;
6041 free_binding_level = NULL_BINDING_LEVEL;
6043 /* Because most segmentation signals can be traced back into user
6044 code, catch them and at least give the user a chance of working
6045 around compiler bugs. */
6046 signal (SIGSEGV, signal_catch);
6048 /* We will also catch aborts in the back-end through signal_catch and
6049 give the user a chance to see where the error might be, and to defeat
6050 aborts in the back-end when there have been errors previously in their
6053 signal (SIGIOT, signal_catch);
6056 signal (SIGILL, signal_catch);
6059 signal (SIGABRT, signal_catch);
6062 signal (SIGBUS, signal_catch);
6065 gcc_obstack_init (&decl_obstack);
6067 build_common_tree_nodes (flag_signed_char);
6069 error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6070 TREE_TYPE (error_mark_list) = error_mark_node;
6072 /* Make the binding_level structure for global names. */
6074 global_binding_level = current_binding_level;
6075 /* The global level is the namespace level of ::. */
6076 NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6077 declare_namespace_level ();
6079 this_identifier = get_identifier (THIS_NAME);
6080 in_charge_identifier = get_identifier (IN_CHARGE_NAME);
6081 ctor_identifier = get_identifier (CTOR_NAME);
6082 dtor_identifier = get_identifier (DTOR_NAME);
6083 pfn_identifier = get_identifier (VTABLE_PFN_NAME);
6084 index_identifier = get_identifier (VTABLE_INDEX_NAME);
6085 delta_identifier = get_identifier (VTABLE_DELTA_NAME);
6086 delta2_identifier = get_identifier (VTABLE_DELTA2_NAME);
6087 pfn_or_delta2_identifier = get_identifier ("__pfn_or_delta2");
6089 /* Define `int' and `char' first so that dbx will output them first. */
6090 record_builtin_type (RID_INT, NULL_PTR, integer_type_node);
6091 record_builtin_type (RID_CHAR, "char", char_type_node);
6093 /* `signed' is the same as `int' */
6094 record_builtin_type (RID_SIGNED, NULL_PTR, integer_type_node);
6095 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
6096 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
6097 record_builtin_type (RID_MAX, "long unsigned int", long_unsigned_type_node);
6098 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
6099 record_builtin_type (RID_MAX, "long long int", long_long_integer_type_node);
6100 record_builtin_type (RID_MAX, "long long unsigned int",
6101 long_long_unsigned_type_node);
6102 record_builtin_type (RID_MAX, "long long unsigned",
6103 long_long_unsigned_type_node);
6104 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
6105 record_builtin_type (RID_MAX, "short unsigned int", short_unsigned_type_node);
6106 record_builtin_type (RID_MAX, "unsigned short", short_unsigned_type_node);
6109 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE)));
6111 /* Define both `signed char' and `unsigned char'. */
6112 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
6113 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
6115 /* `unsigned long' is the standard type for sizeof.
6116 Note that stddef.h uses `unsigned long',
6117 and this must agree, even if long and int are the same size. */
6119 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE))));
6121 /* Create the widest literal types. */
6122 widest_integer_literal_type_node = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
6123 pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6124 widest_integer_literal_type_node));
6126 widest_unsigned_literal_type_node = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
6127 pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6128 widest_unsigned_literal_type_node));
6130 /* These are types that type_for_size and type_for_mode use. */
6131 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
6132 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
6133 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
6134 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
6135 #if HOST_BITS_PER_WIDE_INT >= 64
6136 pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node));
6138 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
6139 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
6140 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
6141 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
6142 #if HOST_BITS_PER_WIDE_INT >= 64
6143 pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node));
6146 build_common_tree_nodes_2 (flag_short_double);
6148 java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6149 java_short_type_node = record_builtin_java_type ("__java_short", 16);
6150 java_int_type_node = record_builtin_java_type ("__java_int", 32);
6151 java_long_type_node = record_builtin_java_type ("__java_long", 64);
6152 java_float_type_node = record_builtin_java_type ("__java_float", -32);
6153 java_double_type_node = record_builtin_java_type ("__java_double", -64);
6154 java_char_type_node = record_builtin_java_type ("__java_char", -16);
6155 java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6157 integer_two_node = build_int_2 (2, 0);
6158 TREE_TYPE (integer_two_node) = integer_type_node;
6159 integer_three_node = build_int_2 (3, 0);
6160 TREE_TYPE (integer_three_node) = integer_type_node;
6162 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6163 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6164 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6165 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6166 TYPE_PRECISION (boolean_type_node) = 1;
6167 record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6168 boolean_false_node = build_int_2 (0, 0);
6169 TREE_TYPE (boolean_false_node) = boolean_type_node;
6170 boolean_true_node = build_int_2 (1, 0);
6171 TREE_TYPE (boolean_true_node) = boolean_type_node;
6173 signed_size_zero_node = build_int_2 (0, 0); record_builtin_type (RID_FLOAT, NULL_PTR, float_type_node);
6174 record_builtin_type (RID_DOUBLE, NULL_PTR, double_type_node);
6175 record_builtin_type (RID_MAX, "long double", long_double_type_node);
6177 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
6178 complex_integer_type_node));
6179 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
6180 complex_float_type_node));
6181 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
6182 complex_double_type_node));
6183 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
6184 complex_long_double_type_node));
6186 TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6188 record_builtin_type (RID_VOID, NULL_PTR, void_type_node);
6189 void_list_node = build_tree_list (NULL_TREE, void_type_node);
6190 TREE_PARMLIST (void_list_node) = 1;
6192 /* Used for expressions that do nothing, but are not errors. */
6193 void_zero_node = build_int_2 (0, 0);
6194 TREE_TYPE (void_zero_node) = void_type_node;
6196 string_type_node = build_pointer_type (char_type_node);
6197 const_string_type_node
6198 = build_pointer_type (build_qualified_type (char_type_node,
6200 empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);
6202 record_builtin_type (RID_MAX, NULL_PTR, string_type_node);
6205 /* Make a type to be the domain of a few array types
6206 whose domains don't really matter.
6207 200 is small enough that it always fits in size_t
6208 and large enough that it can hold most function names for the
6209 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6210 array_domain_type = build_index_type (build_int_2 (200, 0));
6212 /* Make a type for arrays of characters.
6213 With luck nothing will ever really depend on the length of this
6215 char_array_type_node
6216 = build_array_type (char_type_node, array_domain_type);
6217 /* Likewise for arrays of ints. */
6219 = build_array_type (integer_type_node, array_domain_type);
6221 /* This is just some anonymous class type. Nobody should ever
6222 need to look inside this envelope. */
6223 class_star_type_node = build_pointer_type (make_lang_type (RECORD_TYPE));
6225 if (flag_huge_objects)
6226 delta_type_node = long_integer_type_node;
6228 delta_type_node = short_integer_type_node;
6230 default_function_type
6231 = build_function_type (integer_type_node, NULL_TREE);
6233 ptr_type_node = build_pointer_type (void_type_node);
6235 = build_pointer_type (build_qualified_type (void_type_node,
6237 c_common_nodes_and_builtins (1, flag_no_builtin, flag_no_nonansi_builtin);
6240 = build_exception_variant (void_ftype_ptr, empty_except_spec);
6242 /* C++ extensions */
6244 unknown_type_node = make_node (UNKNOWN_TYPE);
6245 record_unknown_type (unknown_type_node, "unknown type");
6247 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6248 TREE_TYPE (unknown_type_node) = unknown_type_node;
6250 TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0);
6252 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6254 TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6255 TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6257 /* This is special for C++ so functions can be overloaded. */
6258 wchar_type_node = get_identifier (flag_short_wchar
6259 ? "short unsigned int"
6261 wchar_type_node = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node));
6262 wchar_type_size = TYPE_PRECISION (wchar_type_node);
6263 signed_wchar_type_node = make_signed_type (wchar_type_size);
6264 unsigned_wchar_type_node = make_unsigned_type (wchar_type_size);
6266 = TREE_UNSIGNED (wchar_type_node)
6267 ? unsigned_wchar_type_node
6268 : signed_wchar_type_node;
6269 record_builtin_type (RID_WCHAR, "__wchar_t", wchar_type_node);
6271 /* Artificial declaration of wchar_t -- can be bashed */
6272 wchar_decl_node = build_decl (TYPE_DECL, get_identifier ("wchar_t"),
6274 pushdecl (wchar_decl_node);
6276 /* This is for wide string constants. */
6277 wchar_array_type_node
6278 = build_array_type (wchar_type_node, array_domain_type);
6280 if (flag_vtable_thunks)
6282 /* Make sure we get a unique function type, so we can give
6283 its pointer type a name. (This wins for gdb.) */
6284 tree vfunc_type = make_node (FUNCTION_TYPE);
6285 TREE_TYPE (vfunc_type) = integer_type_node;
6286 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6287 layout_type (vfunc_type);
6289 vtable_entry_type = build_pointer_type (vfunc_type);
6293 vtable_entry_type = make_lang_type (RECORD_TYPE);
6294 fields[0] = build_lang_decl (FIELD_DECL, delta_identifier,
6296 fields[1] = build_lang_decl (FIELD_DECL, index_identifier,
6298 fields[2] = build_lang_decl (FIELD_DECL, pfn_identifier,
6300 finish_builtin_type (vtable_entry_type, VTBL_PTR_TYPE, fields, 2,
6303 /* Make this part of an invisible union. */
6304 fields[3] = copy_node (fields[2]);
6305 TREE_TYPE (fields[3]) = delta_type_node;
6306 DECL_NAME (fields[3]) = delta2_identifier;
6307 DECL_MODE (fields[3]) = TYPE_MODE (delta_type_node);
6308 DECL_SIZE (fields[3]) = TYPE_SIZE (delta_type_node);
6309 TREE_UNSIGNED (fields[3]) = 0;
6310 TREE_CHAIN (fields[2]) = fields[3];
6311 vtable_entry_type = build_qualified_type (vtable_entry_type,
6314 record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6317 = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6318 layout_type (vtbl_type_node);
6319 vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6320 record_builtin_type (RID_MAX, NULL_PTR, vtbl_type_node);
6321 vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6322 layout_type (vtbl_ptr_type_node);
6323 record_builtin_type (RID_MAX, NULL_PTR, vtbl_ptr_type_node);
6325 std_node = build_decl (NAMESPACE_DECL,
6326 get_identifier (flag_honor_std ? "fake std":"std"),
6328 pushdecl (std_node);
6330 global_type_node = make_node (LANG_TYPE);
6331 record_unknown_type (global_type_node, "global type");
6334 current_lang_name = lang_name_cplusplus;
6337 tree bad_alloc_type_node, newtype, deltype;
6339 push_namespace (get_identifier ("std"));
6340 bad_alloc_type_node = xref_tag
6341 (class_type_node, get_identifier ("bad_alloc"), 1);
6344 newtype = build_exception_variant
6345 (ptr_ftype_sizetype, add_exception_specifier (NULL_TREE, bad_alloc_type_node, -1));
6346 deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
6347 auto_function (ansi_opname[(int) NEW_EXPR], newtype);
6348 auto_function (ansi_opname[(int) VEC_NEW_EXPR], newtype);
6349 global_delete_fndecl = auto_function (ansi_opname[(int) DELETE_EXPR],
6351 auto_function (ansi_opname[(int) VEC_DELETE_EXPR], deltype);
6355 = define_function ("__pure_virtual", void_ftype, 0, 0);
6357 /* Perform other language dependent initializations. */
6358 init_class_processing ();
6359 init_init_processing ();
6360 init_search_processing ();
6362 init_rtti_processing ();
6364 if (flag_exceptions)
6365 init_exception_processing ();
6368 flag_inline_functions = 0;
6371 if (! supports_one_only ())
6374 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6375 declare_function_name ();
6377 /* Prepare to check format strings against argument lists. */
6378 init_function_format_info ();
6380 /* Show we use EH for cleanups. */
6381 using_eh_for_cleanups ();
6383 print_error_function = lang_print_error_function;
6384 lang_get_alias_set = &c_get_alias_set;
6385 valid_lang_attribute = cp_valid_lang_attribute;
6387 /* Maintain consistency. Perhaps we should just complain if they
6388 say -fwritable-strings? */
6389 if (flag_writable_strings)
6390 flag_const_strings = 0;
6392 /* Add GC roots for all of our global variables. */
6393 ggc_add_tree_root (c_global_trees, sizeof c_global_trees / sizeof(tree));
6394 ggc_add_tree_root (cp_global_trees, sizeof cp_global_trees / sizeof(tree));
6395 ggc_add_tree_root (&integer_three_node, 1);
6396 ggc_add_tree_root (&integer_two_node, 1);
6397 ggc_add_tree_root (&signed_size_zero_node, 1);
6398 ggc_add_tree_root (&size_one_node, 1);
6399 ggc_add_tree_root (&size_zero_node, 1);
6400 ggc_add_root (&global_binding_level, 1, sizeof global_binding_level,
6401 mark_binding_level);
6402 ggc_add_root (&scope_chain, 1, sizeof scope_chain, &mark_saved_scope);
6403 ggc_add_tree_root (&static_ctors, 1);
6404 ggc_add_tree_root (&static_dtors, 1);
6405 ggc_add_tree_root (&lastiddecl, 1);
6407 ggc_add_tree_root (&enum_next_value, 1);
6408 ggc_add_tree_root (&last_function_parm_tags, 1);
6409 ggc_add_tree_root (¤t_function_return_value, 1);
6410 ggc_add_tree_root (¤t_function_parms, 1);
6411 ggc_add_tree_root (¤t_function_parm_tags, 1);
6412 ggc_add_tree_root (&last_function_parms, 1);
6413 ggc_add_tree_root (&error_mark_list, 1);
6415 ggc_add_tree_root (&global_namespace, 1);
6416 ggc_add_tree_root (&global_type_node, 1);
6417 ggc_add_tree_root (&anonymous_namespace_name, 1);
6419 ggc_add_tree_root (&got_object, 1);
6420 ggc_add_tree_root (&got_scope, 1);
6422 ggc_add_tree_root (¤t_lang_name, 1);
6423 ggc_add_tree_root (&static_aggregates, 1);
6426 /* Function to print any language-specific context for an error message. */
6429 lang_print_error_function (file)
6432 default_print_error_function (file);
6433 maybe_print_template_context ();
6436 /* Make a definition for a builtin function named NAME and whose data type
6437 is TYPE. TYPE should be a function type with argument types.
6439 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6440 the name to be called if we can't opencode the function. */
6443 define_function (name, type, pfn, library_name)
6446 void (*pfn) PROTO((tree));
6447 const char *library_name;
6449 tree decl = build_lang_decl (FUNCTION_DECL, get_identifier (name), type);
6450 DECL_EXTERNAL (decl) = 1;
6451 TREE_PUBLIC (decl) = 1;
6452 DECL_ARTIFICIAL (decl) = 1;
6454 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392);
6455 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
6457 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6458 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6459 function in the namespace. */
6460 if (pfn) (*pfn) (decl);
6462 DECL_ASSEMBLER_NAME (decl) = get_identifier (library_name);
6463 make_function_rtl (decl);
6468 /* Wrapper around define_function, for the benefit of
6469 c_common_nodes_and_builtins.
6470 FUNCTION_CODE tells later passes how to compile calls to this function.
6471 See tree.h for its possible values. */
6474 builtin_function (name, type, code, class, libname)
6478 enum built_in_class class;
6479 const char *libname;
6481 tree decl = define_function (name, type, (void (*) PROTO((tree)))pushdecl,
6483 DECL_BUILT_IN_CLASS (decl) = class;
6484 DECL_FUNCTION_CODE (decl) = code;
6488 /* When we call finish_struct for an anonymous union, we create
6489 default copy constructors and such. But, an anonymous union
6490 shouldn't have such things; this function undoes the damage to the
6491 anonymous union type T.
6493 (The reason that we create the synthesized methods is that we don't
6494 distinguish `union { int i; }' from `typedef union { int i; } U'.
6495 The first is an anonymous union; the second is just an ordinary
6499 fixup_anonymous_aggr (t)
6504 /* Wipe out memory of synthesized methods */
6505 TYPE_HAS_CONSTRUCTOR (t) = 0;
6506 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6507 TYPE_HAS_INIT_REF (t) = 0;
6508 TYPE_HAS_CONST_INIT_REF (t) = 0;
6509 TYPE_HAS_ASSIGN_REF (t) = 0;
6510 TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6512 /* Splice the implicitly generated functions out of the TYPE_METHODS
6514 q = &TYPE_METHODS (t);
6517 if (DECL_ARTIFICIAL (*q))
6518 *q = TREE_CHAIN (*q);
6520 q = &TREE_CHAIN (*q);
6523 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6524 function members. */
6525 if (TYPE_METHODS (t))
6526 error ("an anonymous union cannot have function members");
6529 /* Make sure that a declaration with no declarator is well-formed, i.e.
6530 just defines a tagged type or anonymous union.
6532 Returns the type defined, if any. */
6535 check_tag_decl (declspecs)
6539 tree ob_modifier = NULL_TREE;
6541 register tree t = NULL_TREE;
6543 for (link = declspecs; link; link = TREE_CHAIN (link))
6545 register tree value = TREE_VALUE (link);
6551 if (IS_AGGR_TYPE (value) || TREE_CODE (value) == ENUMERAL_TYPE)
6553 my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
6557 else if (value == ridpointers[(int) RID_FRIEND])
6559 if (current_class_type == NULL_TREE
6560 || current_scope () != current_class_type)
6561 ob_modifier = value;
6563 else if (value == ridpointers[(int) RID_STATIC]
6564 || value == ridpointers[(int) RID_EXTERN]
6565 || value == ridpointers[(int) RID_AUTO]
6566 || value == ridpointers[(int) RID_REGISTER]
6567 || value == ridpointers[(int) RID_INLINE]
6568 || value == ridpointers[(int) RID_VIRTUAL]
6569 || value == ridpointers[(int) RID_CONST]
6570 || value == ridpointers[(int) RID_VOLATILE]
6571 || value == ridpointers[(int) RID_EXPLICIT])
6572 ob_modifier = value;
6576 error ("multiple types in one declaration");
6578 /* Inside a class, we might be in a friend or access declaration.
6579 Until we have a good way of detecting the latter, don't warn. */
6580 if (t == NULL_TREE && ! current_class_type)
6581 pedwarn ("declaration does not declare anything");
6583 /* Check for an anonymous union. We're careful
6584 accessing TYPE_IDENTIFIER because some built-in types, like
6585 pointer-to-member types, do not have TYPE_NAME. */
6586 else if (t && IS_AGGR_TYPE_CODE (TREE_CODE (t))
6588 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
6590 /* Anonymous unions are objects, so they can have specifiers. */;
6591 SET_ANON_AGGR_TYPE_P (t);
6593 if (TREE_CODE (t) != UNION_TYPE && pedantic && ! in_system_header)
6594 pedwarn ("ISO C++ prohibits anonymous structs");
6597 else if (ob_modifier)
6599 if (ob_modifier == ridpointers[(int) RID_INLINE]
6600 || ob_modifier == ridpointers[(int) RID_VIRTUAL])
6601 cp_error ("`%D' can only be specified for functions", ob_modifier);
6602 else if (ob_modifier == ridpointers[(int) RID_FRIEND])
6603 cp_error ("`%D' can only be specified inside a class", ob_modifier);
6604 else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
6605 cp_error ("`%D' can only be specified for constructors",
6608 cp_error ("`%D' can only be specified for objects and functions",
6615 /* Called when a declaration is seen that contains no names to declare.
6616 If its type is a reference to a structure, union or enum inherited
6617 from a containing scope, shadow that tag name for the current scope
6618 with a forward reference.
6619 If its type defines a new named structure or union
6620 or defines an enum, it is valid but we need not do anything here.
6621 Otherwise, it is an error.
6623 C++: may have to grok the declspecs to learn about static,
6624 complain for anonymous unions. */
6627 shadow_tag (declspecs)
6630 tree t = check_tag_decl (declspecs);
6633 maybe_process_partial_specialization (t);
6635 /* This is where the variables in an anonymous union are
6636 declared. An anonymous union declaration looks like:
6638 because there is no declarator after the union, the parser
6639 sends that declaration here. */
6640 if (t && ANON_AGGR_TYPE_P (t))
6642 fixup_anonymous_aggr (t);
6644 if (TYPE_FIELDS (t))
6646 tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
6648 finish_anon_union (decl);
6653 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6656 groktypename (typename)
6659 if (TREE_CODE (typename) != TREE_LIST)
6661 return grokdeclarator (TREE_VALUE (typename),
6662 TREE_PURPOSE (typename),
6663 TYPENAME, 0, NULL_TREE);
6666 /* Decode a declarator in an ordinary declaration or data definition.
6667 This is called as soon as the type information and variable name
6668 have been parsed, before parsing the initializer if any.
6669 Here we create the ..._DECL node, fill in its type,
6670 and put it on the list of decls for the current context.
6671 The ..._DECL node is returned as the value.
6673 Exception: for arrays where the length is not specified,
6674 the type is left null, to be filled in by `cp_finish_decl'.
6676 Function definitions do not come here; they go to start_function
6677 instead. However, external and forward declarations of functions
6678 do go through here. Structure field declarations are done by
6679 grokfield and not through here. */
6681 /* Set this to zero to debug not using the temporary obstack
6682 to parse initializers. */
6683 int debug_temp_inits = 1;
6686 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
6687 tree declarator, declspecs;
6689 tree attributes, prefix_attributes;
6692 register tree type, tem;
6694 extern int have_extern_spec;
6695 extern int used_extern_spec;
6699 /* See code below that used this. */
6700 int init_written = initialized;
6703 /* This should only be done once on the top most decl. */
6704 if (have_extern_spec && !used_extern_spec)
6706 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"),
6708 used_extern_spec = 1;
6711 if (attributes || prefix_attributes)
6712 attrlist = build_scratch_list (attributes, prefix_attributes);
6714 attrlist = NULL_TREE;
6716 decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
6719 if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
6722 type = TREE_TYPE (decl);
6724 if (type == error_mark_node)
6728 = (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
6729 ? DECL_CLASS_CONTEXT (decl)
6730 : DECL_CONTEXT (decl);
6732 if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
6733 && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
6735 /* When parsing the initializer, lookup should use the object's
6737 push_decl_namespace (context);
6740 /* We are only interested in class contexts, later. */
6741 if (context && TREE_CODE (context) == NAMESPACE_DECL)
6742 context = NULL_TREE;
6745 /* Is it valid for this decl to have an initializer at all?
6746 If not, set INITIALIZED to zero, which will indirectly
6747 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6748 switch (TREE_CODE (decl))
6751 /* typedef foo = bar means give foo the same type as bar.
6752 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6753 Any other case of an initialization in a TYPE_DECL is an error. */
6754 if (pedantic || list_length (declspecs) > 1)
6756 cp_error ("typedef `%D' is initialized", decl);
6762 cp_error ("function `%#D' is initialized like a variable", decl);
6772 if (! toplevel_bindings_p ()
6773 && DECL_EXTERNAL (decl))
6774 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6776 DECL_EXTERNAL (decl) = 0;
6777 if (toplevel_bindings_p ())
6778 TREE_STATIC (decl) = 1;
6780 /* Tell `pushdecl' this is an initialized decl
6781 even though we don't yet have the initializer expression.
6782 Also tell `cp_finish_decl' it may store the real initializer. */
6783 DECL_INITIAL (decl) = error_mark_node;
6786 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6787 SET_DEFAULT_DECL_ATTRIBUTES (decl, attributes);
6790 /* Set attributes here so if duplicate decl, will have proper attributes. */
6791 cplus_decl_attributes (decl, attributes, prefix_attributes);
6793 if (context && TYPE_SIZE (complete_type (context)) != NULL_TREE)
6795 push_nested_class (context, 2);
6797 if (TREE_CODE (decl) == VAR_DECL)
6799 tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
6800 if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
6801 cp_error ("`%#D' is not a static member of `%#T'", decl, context);
6804 if (DECL_CONTEXT (field) != context)
6806 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6807 DECL_CONTEXT (field), DECL_NAME (decl),
6808 context, DECL_NAME (decl));
6809 DECL_CONTEXT (decl) = DECL_CONTEXT (field);
6811 /* Static data member are tricky; an in-class initialization
6812 still doesn't provide a definition, so the in-class
6813 declaration will have DECL_EXTERNAL set, but will have an
6814 initialization. Thus, duplicate_decls won't warn
6815 about this situation, and so we check here. */
6816 if (DECL_INITIAL (decl) && DECL_INITIAL (field))
6817 cp_error ("duplicate initialization of %D", decl);
6818 if (duplicate_decls (decl, field))
6824 tree field = check_classfn (context, decl);
6825 if (field && duplicate_decls (decl, field))
6829 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6830 DECL_IN_AGGR_P (decl) = 0;
6831 if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
6832 || CLASSTYPE_USE_TEMPLATE (context))
6834 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
6835 /* [temp.expl.spec] An explicit specialization of a static data
6836 member of a template is a definition if the declaration
6837 includes an initializer; otherwise, it is a declaration.
6839 We check for processing_specialization so this only applies
6840 to the new specialization syntax. */
6841 if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
6842 DECL_EXTERNAL (decl) = 1;
6845 if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
6846 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6850 /* Enter this declaration into the symbol table. */
6851 tem = maybe_push_decl (decl);
6853 if (processing_template_decl)
6855 if (at_function_scope_p ())
6856 push_permanent_obstack ();
6857 tem = push_template_decl (tem);
6858 if (at_function_scope_p ())
6863 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6864 /* Tell the back-end to use or not use .common as appropriate. If we say
6865 -fconserve-space, we want this to save .data space, at the expense of
6866 wrong semantics. If we say -fno-conserve-space, we want this to
6867 produce errors about redefs; to do this we force variables into the
6869 DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
6872 if (! processing_template_decl)
6875 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6876 push_obstacks_nochange ();
6885 tree type = TREE_TYPE (decl);
6886 int initialized = (DECL_INITIAL (decl) != NULL_TREE);
6888 if (type == error_mark_node)
6891 /* If this type of object needs a cleanup, and control may
6892 jump past it, make a new binding level so that it is cleaned
6893 up only when it is initialized first. */
6894 if (TYPE_NEEDS_DESTRUCTOR (type)
6895 && current_binding_level->more_cleanups_ok == 0)
6896 pushlevel_temporary (1);
6899 /* Is it valid for this decl to have an initializer at all?
6900 If not, set INITIALIZED to zero, which will indirectly
6901 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6903 /* Don't allow initializations for incomplete types except for
6904 arrays which might be completed by the initialization. */
6905 if (TYPE_SIZE (complete_type (type)) != NULL_TREE)
6906 ; /* A complete type is ok. */
6907 else if (TREE_CODE (type) != ARRAY_TYPE)
6909 cp_error ("variable `%#D' has initializer but incomplete type",
6912 type = TREE_TYPE (decl) = error_mark_node;
6914 else if (TYPE_SIZE (complete_type (TREE_TYPE (type))) == NULL_TREE)
6916 if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
6917 cp_error ("elements of array `%#D' have incomplete type", decl);
6918 /* else we already gave an error in start_decl. */
6924 && TREE_CODE (decl) != TYPE_DECL
6925 && TREE_CODE (decl) != TEMPLATE_DECL
6926 && IS_AGGR_TYPE (type) && ! DECL_EXTERNAL (decl))
6928 if ((! processing_template_decl || ! uses_template_parms (type))
6929 && TYPE_SIZE (complete_type (type)) == NULL_TREE)
6931 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6933 /* Change the type so that assemble_variable will give
6934 DECL an rtl we can live with: (mem (const_int 0)). */
6935 type = TREE_TYPE (decl) = error_mark_node;
6939 /* If any base type in the hierarchy of TYPE needs a constructor,
6940 then we set initialized to 1. This way any nodes which are
6941 created for the purposes of initializing this aggregate
6942 will live as long as it does. This is necessary for global
6943 aggregates which do not have their initializers processed until
6944 the end of the file. */
6945 initialized = TYPE_NEEDS_CONSTRUCTING (type);
6950 DECL_INITIAL (decl) = NULL_TREE;
6953 /* Handle initialization of references.
6954 These three arguments are from `cp_finish_decl', and have the
6955 same meaning here that they do there.
6957 Quotes on semantics can be found in ARM 8.4.3. */
6960 grok_reference_init (decl, type, init)
6961 tree decl, type, init;
6965 if (init == NULL_TREE)
6967 if ((DECL_LANG_SPECIFIC (decl) == 0
6968 || DECL_IN_AGGR_P (decl) == 0)
6969 && ! DECL_THIS_EXTERN (decl))
6970 cp_error ("`%D' declared as reference but not initialized", decl);
6974 if (init == error_mark_node)
6977 if (TREE_CODE (init) == CONSTRUCTOR)
6979 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl);
6983 if (TREE_CODE (init) == TREE_LIST)
6984 init = build_compound_expr (init);
6986 if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
6987 init = convert_from_reference (init);
6989 if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
6990 && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
6992 /* Note: default conversion is only called in very special cases. */
6993 init = default_conversion (init);
6996 /* Convert INIT to the reference type TYPE. This may involve the
6997 creation of a temporary, whose lifetime must be the same as that
6998 of the reference. If so, a DECL_STMT for the temporary will be
6999 added just after the DECL_STMT for DECL. That's why we don't set
7000 DECL_INITIAL for local references (instead assigning to them
7001 explicitly); we need to allow the temporary to be initialized
7003 tmp = convert_to_reference
7004 (type, init, CONV_IMPLICIT,
7005 LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND, decl);
7007 if (tmp == error_mark_node)
7009 else if (tmp != NULL_TREE)
7012 tmp = save_expr (tmp);
7013 if (building_stmt_tree ())
7015 /* Initialize the declaration. */
7016 tmp = build (INIT_EXPR, TREE_TYPE (decl), decl, tmp);
7017 /* Setting TREE_SIDE_EFFECTS prevents expand_expr from
7018 omitting this expression entirely. */
7019 TREE_SIDE_EFFECTS (tmp) = 1;
7020 finish_expr_stmt (tmp);
7023 DECL_INITIAL (decl) = tmp;
7027 cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
7031 if (TREE_STATIC (decl) && ! TREE_CONSTANT (DECL_INITIAL (decl)))
7033 expand_static_init (decl, DECL_INITIAL (decl));
7034 DECL_INITIAL (decl) = NULL_TREE;
7039 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7040 mucking with forces it does not comprehend (i.e. initialization with a
7041 constructor). If we are at global scope and won't go into COMMON, fill
7042 it in with a dummy CONSTRUCTOR to force the variable into .data;
7043 otherwise we can use error_mark_node. */
7046 obscure_complex_init (decl, init)
7049 if (! flag_no_inline && TREE_STATIC (decl))
7051 if (extract_init (decl, init))
7055 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7056 if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7057 DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7061 DECL_INITIAL (decl) = error_mark_node;
7066 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7067 array until we finish parsing the initializer. If that's the
7068 situation we're in, update DECL accordingly. */
7071 maybe_deduce_size_from_array_init (decl, init)
7075 tree type = TREE_TYPE (decl);
7077 if (TREE_CODE (type) == ARRAY_TYPE
7078 && TYPE_DOMAIN (type) == NULL_TREE
7079 && TREE_CODE (decl) != TYPE_DECL)
7082 = (TREE_STATIC (decl)
7083 /* Even if pedantic, an external linkage array
7084 may have incomplete type at first. */
7085 ? pedantic && ! DECL_EXTERNAL (decl)
7086 : !DECL_EXTERNAL (decl));
7087 tree initializer = init ? init : DECL_INITIAL (decl);
7088 int failure = complete_array_type (type, initializer, do_default);
7091 cp_error ("initializer fails to determine size of `%D'", decl);
7096 cp_error ("array size missing in `%D'", decl);
7097 /* If a `static' var's size isn't known, make it extern as
7098 well as static, so it does not get allocated. If it's not
7099 `static', then don't mark it extern; finish_incomplete_decl
7100 will give it a default size and it will get allocated. */
7101 else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7102 DECL_EXTERNAL (decl) = 1;
7105 if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7106 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7108 cp_error ("zero-size array `%D'", decl);
7110 layout_decl (decl, 0);
7114 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7115 any appropriate error messages regarding the layout. */
7118 layout_var_decl (decl)
7121 tree type = TREE_TYPE (decl);
7122 tree ttype = target_type (type);
7124 /* If we haven't already layed out this declaration, do so now.
7125 Note that we must not call complete type for an external object
7126 because it's type might involve templates that we are not
7127 supposed to isntantiate yet. (And it's perfectly legal to say
7128 `extern X x' for some incomplete type `X'.) */
7129 if (!DECL_EXTERNAL (decl))
7130 complete_type (type);
7131 if (!DECL_SIZE (decl)&& TYPE_SIZE (type))
7132 layout_decl (decl, 0);
7134 if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7136 /* An automatic variable with an incomplete type: that is an error.
7137 Don't talk about array types here, since we took care of that
7138 message in grokdeclarator. */
7139 cp_error ("storage size of `%D' isn't known", decl);
7140 TREE_TYPE (decl) = error_mark_node;
7142 else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7143 /* Let debugger know it should output info for this type. */
7144 note_debug_info_needed (ttype);
7146 if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7147 note_debug_info_needed (DECL_CONTEXT (decl));
7149 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7150 && DECL_SIZE (decl) != NULL_TREE
7151 && ! TREE_CONSTANT (DECL_SIZE (decl)))
7153 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7154 constant_expression_warning (DECL_SIZE (decl));
7156 cp_error ("storage size of `%D' isn't constant", decl);
7160 /* If a local static variable is declared in an inline function, or if
7161 we have a weak definition, we must endeavor to create only one
7162 instance of the variable at link-time. */
7165 maybe_commonize_var (decl)
7168 /* Static data in a function with comdat linkage also has comdat
7170 if (TREE_STATIC (decl)
7171 /* Don't mess with __FUNCTION__. */
7172 && ! TREE_ASM_WRITTEN (decl)
7173 && current_function_decl
7174 && DECL_CONTEXT (decl) == current_function_decl
7175 && (DECL_THIS_INLINE (current_function_decl)
7176 || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7177 && TREE_PUBLIC (current_function_decl))
7179 /* Rather than try to get this right with inlining, we suppress
7180 inlining of such functions. */
7181 current_function_cannot_inline
7182 = "function with static variable cannot be inline";
7184 /* If flag_weak, we don't need to mess with this, as we can just
7185 make the function weak, and let it refer to its unique local
7186 copy. This works because we don't allow the function to be
7190 if (DECL_INTERFACE_KNOWN (current_function_decl))
7192 TREE_PUBLIC (decl) = 1;
7193 DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7195 else if (DECL_INITIAL (decl) == NULL_TREE
7196 || DECL_INITIAL (decl) == error_mark_node)
7198 TREE_PUBLIC (decl) = 1;
7199 DECL_COMMON (decl) = 1;
7201 /* else we lose. We can only do this if we can use common,
7202 which we can't if it has been initialized. */
7204 if (TREE_PUBLIC (decl))
7205 DECL_ASSEMBLER_NAME (decl)
7206 = build_static_name (current_function_decl, DECL_NAME (decl));
7207 else if (! DECL_ARTIFICIAL (decl))
7209 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7210 cp_warning_at (" you can work around this by removing the initializer", decl);
7214 else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
7215 /* Set it up again; we might have set DECL_INITIAL since the last
7217 comdat_linkage (decl);
7220 /* Issue an error message if DECL is an uninitialized const variable. */
7223 check_for_uninitialized_const_var (decl)
7226 tree type = TREE_TYPE (decl);
7228 /* ``Unless explicitly declared extern, a const object does not have
7229 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7231 if (TREE_CODE (decl) == VAR_DECL
7232 && TREE_CODE (type) != REFERENCE_TYPE
7233 && CP_TYPE_CONST_P (type)
7234 && !TYPE_NEEDS_CONSTRUCTING (type)
7235 && !DECL_INITIAL (decl))
7236 cp_error ("uninitialized const `%D'", decl);
7239 /* Verify INIT (the initializer for DECL), and record the
7240 initialization in DECL_INITIAL, if appropriate. Returns a new
7244 check_initializer (decl, init)
7250 if (TREE_CODE (decl) == FIELD_DECL)
7253 type = TREE_TYPE (decl);
7255 /* If `start_decl' didn't like having an initialization, ignore it now. */
7256 if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7259 /* Check the initializer. */
7262 /* Things that are going to be initialized need to have complete
7264 TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));
7266 if (type == error_mark_node)
7267 /* We will have already complained. */
7269 else if (TYPE_SIZE (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
7271 cp_error ("variable-sized object `%D' may not be initialized", decl);
7274 else if (TREE_CODE (type) == ARRAY_TYPE
7275 && !TYPE_SIZE (TREE_TYPE (type)))
7277 cp_error ("elements of array `%#D' have incomplete type", decl);
7280 else if (!TYPE_SIZE (type))
7282 cp_error ("`%D' has incomplete type", decl);
7283 TREE_TYPE (decl) = error_mark_node;
7288 if (TREE_CODE (decl) == CONST_DECL)
7290 my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7292 DECL_INITIAL (decl) = init;
7294 /* This will keep us from needing to worry about our obstacks. */
7295 my_friendly_assert (init != NULL_TREE, 149);
7298 else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
7300 if (TREE_STATIC (decl))
7301 make_decl_rtl (decl, NULL_PTR, toplevel_bindings_p ());
7302 grok_reference_init (decl, type, init);
7307 if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7309 if (TREE_CODE (type) == ARRAY_TYPE)
7310 init = digest_init (type, init, (tree *) 0);
7311 else if (TREE_CODE (init) == CONSTRUCTOR
7312 && TREE_HAS_CONSTRUCTOR (init))
7314 if (TYPE_NON_AGGREGATE_CLASS (type))
7316 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7318 init = error_mark_node;
7321 goto dont_use_constructor;
7326 dont_use_constructor:
7327 if (TREE_CODE (init) != TREE_VEC)
7328 init = store_init_value (decl, init);
7332 /* We must hide the initializer so that expand_decl
7333 won't try to do something it does not understand. */
7334 init = obscure_complex_init (decl, init);
7336 else if (DECL_EXTERNAL (decl))
7338 else if (TREE_CODE_CLASS (TREE_CODE (type)) == 't'
7339 && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7341 tree core_type = strip_array_types (type);
7343 if (! TYPE_NEEDS_CONSTRUCTING (core_type))
7345 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
7346 cp_error ("structure `%D' with uninitialized const members", decl);
7347 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
7348 cp_error ("structure `%D' with uninitialized reference members",
7352 check_for_uninitialized_const_var (decl);
7354 if (TYPE_SIZE (type) != NULL_TREE
7355 && TYPE_NEEDS_CONSTRUCTING (type))
7356 init = obscure_complex_init (decl, NULL_TREE);
7360 check_for_uninitialized_const_var (decl);
7365 /* If DECL is not a local variable, give it RTL. */
7368 make_rtl_for_nonlocal_decl (decl, init, asmspec)
7371 const char *asmspec;
7376 type = TREE_TYPE (decl);
7377 toplev = toplevel_bindings_p ();
7379 /* Handle non-variables up front. */
7380 if (TREE_CODE (decl) != VAR_DECL)
7382 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7386 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7388 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7390 if (DECL_VIRTUAL_P (decl))
7391 make_decl_rtl (decl, NULL_PTR, toplev);
7392 else if (TREE_READONLY (decl)
7393 && DECL_INITIAL (decl) != NULL_TREE
7394 && DECL_INITIAL (decl) != error_mark_node
7395 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
7397 DECL_INITIAL (decl) = save_expr (DECL_INITIAL (decl));
7400 && TREE_STATIC (decl)
7401 && ! TREE_SIDE_EFFECTS (decl)
7402 && ! TREE_PUBLIC (decl)
7403 && ! DECL_EXTERNAL (decl)
7404 && ! TYPE_NEEDS_DESTRUCTOR (type)
7405 && DECL_MODE (decl) != BLKmode)
7407 /* If this variable is really a constant, then fill its DECL_RTL
7408 slot with something which won't take up storage.
7409 If something later should take its address, we can always give
7410 it legitimate RTL at that time. */
7411 DECL_RTL (decl) = gen_reg_rtx (DECL_MODE (decl));
7412 store_expr (DECL_INITIAL (decl), DECL_RTL (decl), 0);
7413 TREE_ASM_WRITTEN (decl) = 1;
7415 else if (toplev && ! TREE_PUBLIC (decl))
7417 /* If this is a static const, change its apparent linkage
7418 if it belongs to a #pragma interface. */
7419 if (!interface_unknown)
7421 TREE_PUBLIC (decl) = 1;
7422 DECL_EXTERNAL (decl) = interface_only;
7424 make_decl_rtl (decl, asmspec, toplev);
7427 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7429 else if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl))
7431 my_friendly_assert (TREE_STATIC (decl), 19990828);
7433 if (init == NULL_TREE
7434 #ifdef DEFAULT_STATIC_DEFS
7435 /* If this code is dead, then users must
7436 explicitly declare static member variables
7437 outside the class def'n as well. */
7438 && TYPE_NEEDS_CONSTRUCTING (type)
7442 DECL_EXTERNAL (decl) = 1;
7443 make_decl_rtl (decl, asmspec, 1);
7446 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7448 else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == NAMESPACE_DECL
7449 || (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl)))
7450 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7453 /* The old ARM scoping rules injected variables declared in the
7454 initialization statement of a for-statement into the surrounding
7455 scope. We support this usage, in order to be backward-compatible.
7456 DECL is a just-declared VAR_DECL; if necessary inject its
7457 declaration into the surrounding scope. */
7460 maybe_inject_for_scope_var (decl)
7463 if (current_binding_level->is_for_scope)
7465 struct binding_level *outer
7466 = current_binding_level->level_chain;
7468 /* Check to see if the same name is already bound at the outer
7469 level, either because it was directly declared, or because a
7470 dead for-decl got preserved. In either case, the code would
7471 not have been valid under the ARM scope rules, so clear
7472 is_for_scope for the current_binding_level.
7474 Otherwise, we need to preserve the temp slot for decl to last
7475 into the outer binding level. */
7478 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
7480 if (outer_binding && BINDING_LEVEL (outer_binding) == outer
7481 && (TREE_CODE (BINDING_VALUE (outer_binding))
7483 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
7485 BINDING_VALUE (outer_binding)
7486 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
7487 current_binding_level->is_for_scope = 0;
7489 else if (DECL_IN_MEMORY_P (decl))
7490 preserve_temp_slots (DECL_RTL (decl));
7494 /* Generate code to initialize DECL (a local variable). */
7497 initialize_local_var (decl, init, flags)
7504 type = complete_type (TREE_TYPE (decl));
7506 if (DECL_SIZE (decl) == NULL_TREE && !TREE_STATIC (decl))
7508 /* If we used it already as memory, it must stay in memory. */
7509 DECL_INITIAL (decl) = NULL_TREE;
7510 TREE_ADDRESSABLE (decl) = TREE_USED (decl);
7513 if (DECL_SIZE (decl) && type != error_mark_node)
7517 /* Compute and store the initial value. */
7518 already_used = TREE_USED (decl) || TREE_USED (type);
7520 if (init || TYPE_NEEDS_CONSTRUCTING (type))
7522 int saved_stmts_are_full_exprs_p;
7524 emit_line_note (DECL_SOURCE_FILE (decl),
7525 DECL_SOURCE_LINE (decl));
7526 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p;
7527 stmts_are_full_exprs_p = 1;
7528 finish_expr_stmt (build_aggr_init (decl, init, flags));
7529 stmts_are_full_exprs_p = saved_stmts_are_full_exprs_p;
7532 /* Set this to 0 so we can tell whether an aggregate which was
7533 initialized was ever used. Don't do this if it has a
7534 destructor, so we don't complain about the 'resource
7535 allocation is initialization' idiom. Now set
7536 attribute((unused)) on types so decls of that type will be
7537 marked used. (see TREE_USED, above.) */
7538 if (TYPE_NEEDS_CONSTRUCTING (type)
7540 && !TYPE_NEEDS_DESTRUCTOR (type)
7541 && DECL_NAME (decl))
7542 TREE_USED (decl) = 0;
7543 else if (already_used)
7544 TREE_USED (decl) = 1;
7548 /* Generate code to destroy DECL (a local variable). */
7551 destroy_local_var (decl)
7554 tree type = TREE_TYPE (decl);
7557 /* Only variables get cleaned up. */
7558 if (TREE_CODE (decl) != VAR_DECL)
7561 /* And only things with destructors need cleaning up. */
7562 if (!TYPE_NEEDS_DESTRUCTOR (type))
7565 if (TREE_CODE (decl) == VAR_DECL &&
7566 (DECL_EXTERNAL (decl) || TREE_STATIC (decl)))
7567 /* We don't clean up things that aren't defined in this
7568 translation unit, or that need a static cleanup. The latter
7569 are handled by finish_file. */
7572 /* Compute the cleanup. */
7573 cleanup = maybe_build_cleanup (decl);
7575 /* Record the cleanup required for this declaration. */
7576 if (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node
7578 finish_decl_cleanup (decl, cleanup);
7581 /* Let the back-end know about DECL. */
7584 emit_local_var (decl)
7587 /* Create RTL for this variable. */
7588 if (DECL_RTL (decl))
7589 /* Only a RESULT_DECL should have non-NULL RTL when
7590 arriving here. All other local variables are
7591 assigned RTL in this function. */
7592 my_friendly_assert (TREE_CODE (decl) == RESULT_DECL,
7596 if (DECL_ASSEMBLER_NAME (decl) != DECL_NAME (decl))
7597 /* The user must have specified an assembler name for this
7598 variable. Set that up now. */
7599 rest_of_decl_compilation
7600 (decl, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)),
7601 /*top_level=*/0, /*at_end=*/0);
7606 /* Actually do the initialization. */
7607 expand_start_target_temps ();
7608 expand_decl_init (decl);
7609 expand_end_target_temps ();
7612 /* Finish processing of a declaration;
7613 install its line number and initial value.
7614 If the length of an array type is not known before,
7615 it must be determined now, from the initial value, or it is an error.
7617 Call `pop_obstacks' iff NEED_POP is nonzero.
7619 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7620 for aggregates that have constructors alive on the permanent obstack,
7621 so that the global initializing functions can be written at the end.
7623 INIT0 holds the value of an initializer that should be allowed to escape
7626 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7627 if the (init) syntax was used.
7629 For functions that take default parameters, DECL points to its
7630 "maximal" instantiation. `cp_finish_decl' must then also declared its
7631 subsequently lower and lower forms of instantiation, checking for
7632 ambiguity as it goes. This can be sped up later. */
7635 cp_finish_decl (decl, init, asmspec_tree, need_pop, flags)
7642 tree ttype = NULL_TREE;
7643 int temporary = allocation_temporary_p ();
7644 const char *asmspec = NULL;
7645 int was_readonly = 0;
7647 /* If this is 0, then we did not change obstacks. */
7651 error ("assignment (not initialization) in declaration");
7655 /* If a name was specified, get the string. */
7657 asmspec = TREE_STRING_POINTER (asmspec_tree);
7659 if (init && TREE_CODE (init) == NAMESPACE_DECL)
7661 cp_error ("Cannot initialize `%D' to namespace `%D'",
7666 if (current_class_type
7667 && DECL_REAL_CONTEXT (decl) == current_class_type
7668 && TYPE_BEING_DEFINED (current_class_type)
7669 && (DECL_INITIAL (decl) || init))
7670 DECL_DEFINED_IN_CLASS_P (decl) = 1;
7672 if (TREE_CODE (decl) == VAR_DECL
7673 && DECL_CONTEXT (decl)
7674 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
7675 && DECL_CONTEXT (decl) != current_namespace
7678 /* Leave the namespace of the object. */
7679 pop_decl_namespace ();
7682 type = TREE_TYPE (decl);
7684 if (type == error_mark_node)
7686 if (toplevel_bindings_p () && temporary)
7687 end_temporary_allocation ();
7692 /* Add this declaration to the statement-tree. */
7693 if (building_stmt_tree ()
7694 && TREE_CODE (current_scope ()) == FUNCTION_DECL)
7695 add_decl_stmt (decl);
7697 if (TYPE_HAS_MUTABLE_P (type))
7698 TREE_READONLY (decl) = 0;
7700 if (processing_template_decl)
7702 if (init && DECL_INITIAL (decl))
7703 DECL_INITIAL (decl) = init;
7707 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7708 my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828);
7710 /* Take care of TYPE_DECLs up front. */
7711 if (TREE_CODE (decl) == TYPE_DECL)
7713 if (init && DECL_INITIAL (decl))
7715 /* typedef foo = bar; store the type of bar as the type of foo. */
7716 TREE_TYPE (decl) = type = TREE_TYPE (init);
7717 DECL_INITIAL (decl) = init = NULL_TREE;
7719 if (type != error_mark_node
7720 && IS_AGGR_TYPE (type) && DECL_NAME (decl))
7722 if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
7723 cp_warning ("shadowing previous type declaration of `%#D'", decl);
7724 set_identifier_type_value (DECL_NAME (decl), type);
7725 CLASSTYPE_GOT_SEMICOLON (type) = 1;
7727 GNU_xref_decl (current_function_decl, decl);
7729 /* If we have installed this as the canonical typedef for this
7730 type, and that type has not been defined yet, delay emitting
7731 the debug information for it, as we will emit it later. */
7732 if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
7733 && TYPE_SIZE (TREE_TYPE (decl)) == NULL_TREE)
7734 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
7736 rest_of_decl_compilation (decl, NULL_PTR,
7737 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
7741 if (TREE_CODE (decl) != FUNCTION_DECL)
7742 ttype = target_type (type);
7744 if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
7745 && TYPE_NEEDS_CONSTRUCTING (type))
7747 /* Currently, GNU C++ puts constants in text space, making them
7748 impossible to initialize. In the future, one would hope for
7749 an operating system which understood the difference between
7750 initialization and the running of a program. */
7752 TREE_READONLY (decl) = 0;
7755 if (TREE_CODE (decl) == FIELD_DECL && asmspec)
7757 /* This must override the asm specifier which was placed by
7758 grokclassfn. Lay this out fresh. */
7759 DECL_RTL (TREE_TYPE (decl)) = NULL_RTX;
7760 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7761 make_decl_rtl (decl, asmspec, 0);
7764 /* Deduce size of array from initialization, if not already known. */
7765 maybe_deduce_size_from_array_init (decl, init);
7766 init = check_initializer (decl, init);
7768 GNU_xref_decl (current_function_decl, decl);
7770 /* For top-level declaration, the initial value was read in
7771 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7772 must go in the permanent obstack; but don't discard the
7773 temporary data yet. */
7775 if (toplevel_bindings_p () && temporary)
7776 end_temporary_allocation ();
7778 if (TREE_CODE (decl) == VAR_DECL)
7779 layout_var_decl (decl);
7781 /* Output the assembler code and/or RTL code for variables and functions,
7782 unless the type is an undefined structure or union.
7783 If not, it will get done when the type is completed. */
7784 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
7785 || TREE_CODE (decl) == RESULT_DECL)
7787 if (TREE_CODE (decl) == VAR_DECL)
7788 maybe_commonize_var (decl);
7790 make_rtl_for_nonlocal_decl (decl, init, asmspec);
7792 if (TREE_CODE (type) == FUNCTION_TYPE
7793 || TREE_CODE (type) == METHOD_TYPE)
7794 abstract_virtuals_error (decl,
7795 strip_array_types (TREE_TYPE (type)));
7797 abstract_virtuals_error (decl, strip_array_types (type));
7799 if (TREE_CODE (decl) == FUNCTION_DECL)
7801 else if (DECL_EXTERNAL (decl)
7802 && ! (DECL_LANG_SPECIFIC (decl)
7803 && DECL_NOT_REALLY_EXTERN (decl)))
7806 DECL_INITIAL (decl) = init;
7808 else if (TREE_STATIC (decl) && type != error_mark_node)
7810 /* Cleanups for static variables are handled by `finish_file'. */
7811 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
7812 || TYPE_NEEDS_DESTRUCTOR (type))
7813 expand_static_init (decl, init);
7815 else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
7817 /* This is a local declaration. */
7818 if (doing_semantic_analysis_p ())
7819 maybe_inject_for_scope_var (decl);
7820 /* Initialize the local variable. But, if we're building a
7821 statement-tree, we'll do the initialization when we
7823 if (processing_template_decl)
7825 if (init || DECL_INITIAL (decl) == error_mark_node)
7826 DECL_INITIAL (decl) = init;
7830 /* If we're not building RTL, then we need to do so
7832 if (!building_stmt_tree ())
7833 emit_local_var (decl);
7834 /* Initialize the variable. */
7835 initialize_local_var (decl, init, flags);
7836 /* Clean up the variable. */
7837 destroy_local_var (decl);
7842 /* Undo call to `pushclass' that was done in `start_decl'
7843 due to initialization of qualified member variable.
7844 I.e., Foo::x = 10; */
7846 tree context = DECL_REAL_CONTEXT (decl);
7848 && TREE_CODE_CLASS (TREE_CODE (context)) == 't'
7849 && (TREE_CODE (decl) == VAR_DECL
7850 /* We also have a pushclass done that we need to undo here
7851 if we're at top level and declare a method. */
7852 || TREE_CODE (decl) == FUNCTION_DECL)
7853 /* If size hasn't been set, we're still defining it,
7854 and therefore inside the class body; don't pop
7855 the binding level.. */
7856 && TYPE_SIZE (context) != NULL_TREE
7857 && context == current_class_type)
7858 pop_nested_class ();
7864 /* If requested, warn about definitions of large data objects. */
7866 if (warn_larger_than
7867 && ! processing_template_decl
7868 && (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
7869 && !DECL_EXTERNAL (decl))
7871 register tree decl_size = DECL_SIZE (decl);
7873 if (decl_size && TREE_CODE (decl_size) == INTEGER_CST)
7875 unsigned units = TREE_INT_CST_LOW (decl_size) / BITS_PER_UNIT;
7877 if (units > larger_than_size)
7878 warning_with_decl (decl, "size of `%s' is %u bytes", units);
7883 /* Resume permanent allocation, if not within a function. The
7884 corresponding push_obstacks_nochange is in start_decl,
7885 start_method, groktypename, and in grokfield. */
7889 TREE_READONLY (decl) = 1;
7892 /* This is here for a midend callback from c-common.c */
7895 finish_decl (decl, init, asmspec_tree)
7899 cp_finish_decl (decl, init, asmspec_tree, 1, 0);
7902 /* Generate code to handle the destruction of the function-scoped
7903 static variable DECL. */
7906 destroy_local_static (decl)
7909 tree cleanup, fcall;
7911 int saved_flag_access_control;
7913 if (atexit_node == 0)
7915 tree atexit_fndecl, PFV, pfvlist;
7916 /* Remember this information until end of file. */
7917 push_obstacks (&permanent_obstack, &permanent_obstack);
7918 PFV = build_pointer_type (build_function_type
7919 (void_type_node, void_list_node));
7921 pfvlist = tree_cons (NULL_TREE, PFV, void_list_node);
7923 push_lang_context (lang_name_c);
7924 /* Note that we do not call pushdecl for this function;
7925 there's no reason that this declaration should be
7926 accessible to anyone. */
7928 = define_function ("atexit",
7929 build_function_type (void_type_node,
7931 /*pfn=*/0, NULL_PTR);
7932 mark_used (atexit_fndecl);
7933 atexit_node = default_conversion (atexit_fndecl);
7934 pop_lang_context ();
7938 /* Call build_cleanup before we enter the anonymous function so that
7939 any access checks will be done relative to the current scope,
7940 rather than the scope of the anonymous function. */
7941 build_cleanup (decl);
7943 /* Now start the function. */
7944 cleanup = start_anon_func ();
7946 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7947 to the original function, rather than the anonymous one. That
7948 will make the back-end think that nested functions are in use,
7949 which causes confusion. */
7950 saved_flag_access_control = flag_access_control;
7951 flag_access_control = 0;
7952 fcall = build_cleanup (decl);
7953 flag_access_control = saved_flag_access_control;
7955 /* Create the body of the anonymous function. */
7956 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
7957 finish_expr_stmt (fcall);
7958 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
7961 /* Call atexit with the cleanup function. */
7962 mark_addressable (cleanup);
7963 cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
7964 fcall = build_function_call (atexit_node,
7965 tree_cons (NULL_TREE,
7968 finish_expr_stmt (fcall);
7972 expand_static_init (decl, init)
7976 tree oldstatic = value_member (decl, static_aggregates);
7980 if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
7981 cp_error ("multiple initializations given for `%D'", decl);
7983 else if (! toplevel_bindings_p ())
7985 /* Emit code to perform this initialization but once. */
7992 /* Remember this information until end of file. */
7993 push_obstacks (&permanent_obstack, &permanent_obstack);
7995 /* Emit code to perform this initialization but once. This code
7998 static int temp = 0;
8000 // Do initialization.
8002 // Register variable for destruction at end of program.
8005 Note that the `temp' variable is only set to 1 *after* the
8006 initialization is complete. This ensures that an exception,
8007 thrown during the construction, will cause the variable to
8008 reinitialized when we pass through this code again, as per:
8012 If the initialization exits by throwing an exception, the
8013 initialization is not complete, so it will be tried again
8014 the next time control enters the declaration.
8016 In theory, this process should be thread-safe, too; multiple
8017 threads should not be able to initialize the variable more
8018 than once. We don't yet attempt to ensure thread-safety. */
8019 temp = get_temp_name (integer_type_node, 1);
8020 rest_of_decl_compilation (temp, NULL_PTR, 0, 0);
8022 /* Begin the conditional initialization. */
8023 if_stmt = begin_if_stmt ();
8024 finish_if_stmt_cond (build_binary_op (EQ_EXPR, temp,
8027 then_clause = begin_compound_stmt (/*has_no_scope=*/0);
8029 /* Do the initialization itself. */
8030 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8031 || (init && TREE_CODE (init) == TREE_LIST))
8032 assignment = build_aggr_init (decl, init, 0);
8035 /* The initialization we're doing here is just a bitwise
8037 assignment = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
8038 TREE_SIDE_EFFECTS (assignment) = 1;
8041 assignment = NULL_TREE;
8043 /* Once the assignment is complete, set TEMP to 1. Since the
8044 construction of the static object is complete at this point,
8045 we want to make sure TEMP is set to 1 even if a temporary
8046 constructed during the initialization throws an exception
8047 when it is destroyed. So, we combine the initialization and
8048 the assignment to TEMP into a single expression, ensuring
8049 that when we call finish_expr_stmt the cleanups will not be
8050 run until after TEMP is set to 1. */
8051 temp_init = build_modify_expr (temp, NOP_EXPR, integer_one_node);
8054 assignment = tree_cons (NULL_TREE, assignment,
8055 build_tree_list (NULL_TREE,
8057 assignment = build_compound_expr (assignment);
8060 assignment = temp_init;
8061 finish_expr_stmt (assignment);
8063 /* Use atexit to register a function for destroying this static
8065 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl)))
8066 destroy_local_static (decl);
8068 finish_compound_stmt (/*has_no_scope=*/0, then_clause);
8069 finish_then_clause (if_stmt);
8072 /* Resume old (possibly temporary) allocation. */
8077 /* This code takes into account memory allocation policy of
8078 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8079 hold for this object, then we must make permanent the storage
8080 currently in the temporary obstack. */
8081 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
8082 preserve_initializer ();
8083 static_aggregates = tree_cons (init, decl, static_aggregates);
8087 /* Finish the declaration of a catch-parameter. */
8090 start_handler_parms (declspecs, declarator)
8097 decl = grokdeclarator (declarator, declspecs, CATCHPARM,
8099 if (decl == NULL_TREE)
8100 error ("invalid catch parameter");
8109 /* Make TYPE a complete type based on INITIAL_VALUE.
8110 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8111 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8114 complete_array_type (type, initial_value, do_default)
8115 tree type, initial_value;
8118 register tree maxindex = NULL_TREE;
8121 /* Allocate on the same obstack as TYPE. */
8122 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
8126 /* Note MAXINDEX is really the maximum index,
8127 one less than the size. */
8128 if (TREE_CODE (initial_value) == STRING_CST)
8131 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8132 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8135 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8137 tree elts = CONSTRUCTOR_ELTS (initial_value);
8138 maxindex = size_binop (MINUS_EXPR, integer_zero_node, size_one_node);
8139 for (; elts; elts = TREE_CHAIN (elts))
8141 if (TREE_PURPOSE (elts))
8142 maxindex = TREE_PURPOSE (elts);
8144 maxindex = size_binop (PLUS_EXPR, maxindex, size_one_node);
8146 maxindex = copy_node (maxindex);
8150 /* Make an error message unless that happened already. */
8151 if (initial_value != error_mark_node)
8154 initial_value = NULL_TREE;
8156 /* Prevent further error messages. */
8157 maxindex = build_int_2 (0, 0);
8164 maxindex = build_int_2 (0, 0);
8173 domain = build_index_type (maxindex);
8174 TYPE_DOMAIN (type) = domain;
8176 if (! TREE_TYPE (maxindex))
8177 TREE_TYPE (maxindex) = domain;
8179 itype = TREE_TYPE (initial_value);
8182 if (itype && !TYPE_DOMAIN (itype))
8183 TYPE_DOMAIN (itype) = domain;
8184 /* The type of the main variant should never be used for arrays
8185 of different sizes. It should only ever be completed with the
8186 size of the array. */
8187 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8188 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain;
8193 /* Lay out the type now that we can get the real answer. */
8200 /* Return zero if something is declared to be a member of type
8201 CTYPE when in the context of CUR_TYPE. STRING is the error
8202 message to print in that case. Otherwise, quietly return 1. */
8205 member_function_or_else (ctype, cur_type, string)
8206 tree ctype, cur_type;
8209 if (ctype && ctype != cur_type)
8211 error (string, TYPE_NAME_STRING (ctype));
8217 /* Subroutine of `grokdeclarator'. */
8219 /* Generate errors possibly applicable for a given set of specifiers.
8220 This is for ARM $7.1.2. */
8223 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8226 int virtualp, quals, friendp, raises, inlinep;
8229 cp_error ("`%D' declared as a `virtual' %s", object, type);
8231 cp_error ("`%D' declared as an `inline' %s", object, type);
8233 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8236 cp_error_at ("`%D' declared as a friend", object);
8238 cp_error_at ("`%D' declared with an exception specification", object);
8241 /* CTYPE is class type, or null if non-class.
8242 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8244 DECLARATOR is the function's name.
8245 VIRTUALP is truthvalue of whether the function is virtual or not.
8246 FLAGS are to be passed through to `grokclassfn'.
8247 QUALS are qualifiers indicating whether the function is `const'
8249 RAISES is a list of exceptions that this function can raise.
8250 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8251 not look, and -1 if we should not call `grokclassfn' at all.
8253 Returns `NULL_TREE' if something goes wrong, after issuing
8254 applicable error messages. */
8257 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8258 raises, check, friendp, publicp, inlinep, funcdef_flag,
8259 template_count, in_namespace)
8262 tree orig_declarator;
8264 enum overload_flags flags;
8266 int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8270 int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8271 int has_default_arg = 0;
8275 cname = TREE_CODE (TYPE_NAME (ctype)) == TYPE_DECL
8276 ? TYPE_IDENTIFIER (ctype) : TYPE_NAME (ctype);
8282 type = build_exception_variant (type, raises);
8285 decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8286 /* Propagate volatile out from type to decl. */
8287 if (TYPE_VOLATILE (type))
8288 TREE_THIS_VOLATILE (decl) = 1;
8290 /* If this decl has namespace scope, set that up. */
8292 set_decl_namespace (decl, in_namespace, friendp);
8293 else if (publicp && ! ctype)
8294 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8296 /* `main' and builtins have implicit 'C' linkage. */
8297 if ((MAIN_NAME_P (declarator)
8298 || (IDENTIFIER_LENGTH (declarator) > 10
8299 && IDENTIFIER_POINTER (declarator)[0] == '_'
8300 && IDENTIFIER_POINTER (declarator)[1] == '_'
8301 && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8302 && current_lang_name == lang_name_cplusplus
8303 && ctype == NULL_TREE
8304 /* NULL_TREE means global namespace. */
8305 && DECL_CONTEXT (decl) == NULL_TREE)
8306 DECL_LANGUAGE (decl) = lang_c;
8308 /* Should probably propagate const out from type to decl I bet (mrs). */
8311 DECL_STATIC_FUNCTION_P (decl) = 1;
8312 DECL_CONTEXT (decl) = ctype;
8316 DECL_CLASS_CONTEXT (decl) = ctype;
8318 if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8320 if (processing_template_decl)
8321 error ("cannot declare `main' to be a template");
8323 error ("cannot declare `main' to be inline");
8325 error ("cannot declare `main' to be static");
8330 /* Members of anonymous types and local classes have no linkage; make
8332 if (ctype && (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype))
8333 || hack_decl_function_context (TYPE_MAIN_DECL (ctype))))
8338 /* [basic.link]: A name with no linkage (notably, the name of a class
8339 or enumeration declared in a local scope) shall not be used to
8340 declare an entity with linkage.
8342 Only check this for public decls for now. */
8343 t = no_linkage_check (TREE_TYPE (decl));
8346 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8348 if (DECL_LANGUAGE (decl) == lang_c)
8349 /* Allow this; it's pretty common in C. */;
8351 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8355 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8360 TREE_PUBLIC (decl) = publicp;
8363 DECL_INTERFACE_KNOWN (decl) = 1;
8364 DECL_NOT_REALLY_EXTERN (decl) = 1;
8368 DECL_THIS_INLINE (decl) = DECL_INLINE (decl) = 1;
8370 DECL_EXTERNAL (decl) = 1;
8371 if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8373 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8374 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8378 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8379 grok_op_properties (decl, virtualp, check < 0);
8381 if (ctype && hack_decl_function_context (decl))
8382 DECL_NO_STATIC_CHAIN (decl) = 1;
8384 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8385 if (TREE_PURPOSE (t)
8386 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8388 has_default_arg = 1;
8393 && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8397 ("defining explicit specialization `%D' in friend declaration",
8401 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8403 /* Something like `template <class T> friend void f<T>()'. */
8404 cp_error ("template-id `%D' in declaration of primary template",
8410 /* A friend declaration of the form friend void f<>(). Record
8411 the information in the TEMPLATE_ID_EXPR. */
8412 SET_DECL_IMPLICIT_INSTANTIATION (decl);
8413 DECL_TEMPLATE_INFO (decl)
8414 = tree_cons (TREE_OPERAND (orig_declarator, 0),
8415 TREE_OPERAND (orig_declarator, 1),
8418 if (has_default_arg)
8420 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8427 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8434 if (has_default_arg)
8435 add_defarg_fn (decl);
8437 /* Plain overloading: will not be grok'd by grokclassfn. */
8438 if (! ctype && ! processing_template_decl
8439 && DECL_LANGUAGE (decl) != lang_c
8440 && (! DECL_USE_TEMPLATE (decl) || name_mangling_version < 1))
8441 set_mangled_name_for_decl (decl);
8444 /* Make the init_value nonzero so pushdecl knows this is not
8445 tentative. error_mark_node is replaced later with the BLOCK. */
8446 DECL_INITIAL (decl) = error_mark_node;
8448 /* Caller will do the rest of this. */
8452 if (check && funcdef_flag)
8453 DECL_INITIAL (decl) = error_mark_node;
8455 if (flags == NO_SPECIAL && ctype && constructor_name (cname) == declarator)
8458 /* Just handle constructors here. We could do this
8459 inside the following if stmt, but I think
8460 that the code is more legible by breaking this
8461 case out. See comments below for what each of
8462 the following calls is supposed to do. */
8463 DECL_CONSTRUCTOR_P (decl) = 1;
8465 grokclassfn (ctype, decl, flags, quals);
8467 decl = check_explicit_specialization (orig_declarator, decl,
8469 2 * (funcdef_flag != 0) +
8470 4 * (friendp != 0));
8471 if (decl == error_mark_node)
8474 if ((! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8477 tmp = check_classfn (ctype, decl);
8479 if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL)
8480 tmp = DECL_TEMPLATE_RESULT(tmp);
8482 if (tmp && DECL_ARTIFICIAL (tmp))
8483 cp_error ("definition of implicitly-declared `%D'", tmp);
8484 if (tmp && duplicate_decls (decl, tmp))
8487 if (! grok_ctor_properties (ctype, decl))
8494 /* Function gets the ugly name, field gets the nice one.
8495 This call may change the type of the function (because
8496 of default parameters)! */
8497 if (ctype != NULL_TREE)
8498 grokclassfn (ctype, decl, flags, quals);
8500 decl = check_explicit_specialization (orig_declarator, decl,
8502 2 * (funcdef_flag != 0) +
8503 4 * (friendp != 0));
8504 if (decl == error_mark_node)
8507 if (ctype != NULL_TREE
8508 && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8511 tmp = check_classfn (ctype, decl);
8513 if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL)
8514 tmp = DECL_TEMPLATE_RESULT (tmp);
8516 if (tmp && DECL_STATIC_FUNCTION_P (tmp)
8517 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
8519 /* Remove the `this' parm added by grokclassfn.
8520 XXX Isn't this done in start_function, too? */
8521 revert_static_member_fn (&decl, NULL, NULL);
8522 last_function_parms = TREE_CHAIN (last_function_parms);
8524 if (tmp && DECL_ARTIFICIAL (tmp))
8525 cp_error ("definition of implicitly-declared `%D'", tmp);
8528 /* Attempt to merge the declarations. This can fail, in
8529 the case of some illegal specialization declarations. */
8530 if (!duplicate_decls (decl, tmp))
8531 cp_error ("no `%#D' member function declared in class `%T'",
8537 if (ctype == NULL_TREE || check)
8542 DECL_VIRTUAL_P (decl) = 1;
8543 if (DECL_VINDEX (decl) == NULL_TREE)
8544 DECL_VINDEX (decl) = error_mark_node;
8545 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
8552 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
8555 RID_BIT_TYPE *specbits_in;
8561 RID_BIT_TYPE specbits;
8563 specbits = *specbits_in;
8565 if (TREE_CODE (type) == OFFSET_TYPE)
8567 /* If you declare a static member so that it
8568 can be initialized, the code will reach here. */
8569 tree basetype = TYPE_OFFSET_BASETYPE (type);
8570 type = TREE_TYPE (type);
8571 decl = build_lang_decl (VAR_DECL, declarator, type);
8572 DECL_CONTEXT (decl) = basetype;
8573 DECL_CLASS_CONTEXT (decl) = basetype;
8574 DECL_ASSEMBLER_NAME (decl) = build_static_name (basetype, declarator);
8581 context = in_namespace;
8582 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
8583 context = current_namespace;
8585 context = NULL_TREE;
8587 if (processing_template_decl)
8589 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8590 we can call push_template_decl. */
8591 push_permanent_obstack ();
8592 decl = build_lang_decl (VAR_DECL, declarator, type);
8596 decl = build_decl (VAR_DECL, declarator, type);
8599 set_decl_namespace (decl, context, 0);
8601 context = DECL_CONTEXT (decl);
8602 if (declarator && context && current_lang_name != lang_name_c)
8603 DECL_ASSEMBLER_NAME (decl) = build_static_name (context, declarator);
8607 set_decl_namespace (decl, in_namespace, 0);
8609 if (RIDBIT_SETP (RID_EXTERN, specbits))
8611 DECL_THIS_EXTERN (decl) = 1;
8612 DECL_EXTERNAL (decl) = !initialized;
8615 /* In class context, static means one per class,
8616 public access, and static storage. */
8617 if (DECL_CLASS_SCOPE_P (decl))
8619 TREE_PUBLIC (decl) = 1;
8620 TREE_STATIC (decl) = 1;
8621 DECL_EXTERNAL (decl) = 0;
8623 /* At top level, either `static' or no s.c. makes a definition
8624 (perhaps tentative), and absence of `static' makes it public. */
8625 else if (toplevel_bindings_p ())
8627 TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
8628 && (DECL_THIS_EXTERN (decl) || ! constp));
8629 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
8631 /* Not at top level, only `static' makes a static definition. */
8634 TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
8635 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
8638 if (TREE_PUBLIC (decl))
8640 /* [basic.link]: A name with no linkage (notably, the name of a class
8641 or enumeration declared in a local scope) shall not be used to
8642 declare an entity with linkage.
8644 Only check this for public decls for now. */
8645 tree t = no_linkage_check (TREE_TYPE (decl));
8648 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8649 /* Ignore for now; `enum { foo } e' is pretty common. */;
8651 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8659 /* Create and return a canonical pointer to member function type, for
8660 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8663 build_ptrmemfunc_type (type)
8669 tree unqualified_variant = NULL_TREE;
8671 /* If a canonical type already exists for this type, use it. We use
8672 this method instead of type_hash_canon, because it only does a
8673 simple equality check on the list of field members. */
8675 if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
8678 /* Make sure that we always have the unqualified pointer-to-member
8680 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
8682 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));
8684 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
8686 u = make_lang_type (UNION_TYPE);
8687 SET_IS_AGGR_TYPE (u, 0);
8688 fields[0] = build_lang_decl (FIELD_DECL, pfn_identifier, type);
8689 fields[1] = build_lang_decl (FIELD_DECL, delta2_identifier,
8691 finish_builtin_type (u, "__ptrmemfunc_type", fields, 1, ptr_type_node);
8692 TYPE_NAME (u) = NULL_TREE;
8694 t = make_lang_type (RECORD_TYPE);
8696 /* Let the front-end know this is a pointer to member function... */
8697 TYPE_PTRMEMFUNC_FLAG (t) = 1;
8698 /* ... and not really an aggregate. */
8699 SET_IS_AGGR_TYPE (t, 0);
8701 fields[0] = build_lang_decl (FIELD_DECL, delta_identifier,
8703 fields[1] = build_lang_decl (FIELD_DECL, index_identifier,
8705 fields[2] = build_lang_decl (FIELD_DECL, pfn_or_delta2_identifier, u);
8706 finish_builtin_type (t, "__ptrmemfunc_type", fields, 2, ptr_type_node);
8710 /* Zap out the name so that the back-end will give us the debugging
8711 information for this anonymous RECORD_TYPE. */
8712 TYPE_NAME (t) = NULL_TREE;
8714 /* If this is not the unqualified form of this pointer-to-member
8715 type, set the TYPE_MAIN_VARIANT for this type to be the
8716 unqualified type. Since they are actually RECORD_TYPEs that are
8717 not variants of each other, we must do this manually. */
8718 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
8720 t = build_qualified_type (t, CP_TYPE_QUALS (type));
8721 TYPE_MAIN_VARIANT (t) = unqualified_variant;
8722 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
8723 TYPE_NEXT_VARIANT (unqualified_variant) = t;
8726 /* Cache this pointer-to-member type so that we can find it again
8728 TYPE_SET_PTRMEMFUNC_TYPE (type, t);
8730 /* Seems to be wanted. */
8731 CLASSTYPE_GOT_SEMICOLON (t) = 1;
8736 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8737 Check to see that the definition is valid. Issue appropriate error
8738 messages. Return 1 if the definition is particularly bad, or 0
8742 check_static_variable_definition (decl, type)
8746 /* Motion 10 at San Diego: If a static const integral data member is
8747 initialized with an integral constant expression, the initializer
8748 may appear either in the declaration (within the class), or in
8749 the definition, but not both. If it appears in the class, the
8750 member is a member constant. The file-scope definition is always
8752 if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
8754 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8756 /* If we just return the declaration, crashes will sometimes
8757 occur. We therefore return void_type_node, as if this was a
8758 friend declaration, to cause callers to completely ignore
8759 this declaration. */
8762 else if (!CP_TYPE_CONST_P (type))
8763 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8765 else if (pedantic && !INTEGRAL_TYPE_P (type))
8766 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
8771 /* Given declspecs and a declarator,
8772 determine the name and type of the object declared
8773 and construct a ..._DECL node for it.
8774 (In one case we can return a ..._TYPE node instead.
8775 For invalid input we sometimes return 0.)
8777 DECLSPECS is a chain of tree_list nodes whose value fields
8778 are the storage classes and type specifiers.
8780 DECL_CONTEXT says which syntactic context this declaration is in:
8781 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8782 FUNCDEF for a function definition. Like NORMAL but a few different
8783 error messages in each case. Return value may be zero meaning
8784 this definition is too screwy to try to parse.
8785 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8786 handle member functions (which have FIELD context).
8787 Return value may be zero meaning this definition is too screwy to
8789 PARM for a parameter declaration (either within a function prototype
8790 or before a function body). Make a PARM_DECL, or return void_type_node.
8791 CATCHPARM for a parameter declaration before a catch clause.
8792 TYPENAME if for a typename (in a cast or sizeof).
8793 Don't make a DECL node; just return the ..._TYPE node.
8794 FIELD for a struct or union field; make a FIELD_DECL.
8795 BITFIELD for a field with specified width.
8796 INITIALIZED is 1 if the decl has an initializer.
8798 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8799 normal attributes in TREE_PURPOSE, or NULL_TREE.
8801 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8802 It may also be so in the PARM case, for a prototype where the
8803 argument type is specified but not the name.
8805 This function is where the complicated C meanings of `static'
8806 and `extern' are interpreted.
8808 For C++, if there is any monkey business to do, the function which
8809 calls this one must do it, i.e., prepending instance variables,
8810 renaming overloaded function names, etc.
8812 Note that for this C++, it is an error to define a method within a class
8813 which does not belong to that class.
8815 Except in the case where SCOPE_REFs are implicitly known (such as
8816 methods within a class being redundantly qualified),
8817 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8818 (class_name::decl_name). The caller must also deal with this.
8820 If a constructor or destructor is seen, and the context is FIELD,
8821 then the type gains the attribute TREE_HAS_x. If such a declaration
8822 is erroneous, NULL_TREE is returned.
8824 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8825 function, these are the qualifiers to give to the `this' pointer.
8827 May return void_type_node if the declarator turned out to be a friend.
8828 See grokfield for details. */
8830 enum return_types { return_normal, return_ctor, return_dtor, return_conversion };
8833 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
8836 enum decl_context decl_context;
8840 RID_BIT_TYPE specbits;
8843 tree type = NULL_TREE;
8849 int virtualp, explicitp, friendp, inlinep, staticp;
8850 int explicit_int = 0;
8851 int explicit_char = 0;
8852 int defaulted_int = 0;
8853 tree typedef_decl = NULL_TREE;
8855 tree typedef_type = NULL_TREE;
8856 int funcdef_flag = 0;
8857 enum tree_code innermost_code = ERROR_MARK;
8860 /* See the code below that used this. */
8861 tree decl_machine_attr = NULL_TREE;
8863 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8864 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8865 tree init = NULL_TREE;
8867 /* Keep track of what sort of function is being processed
8868 so that we can warn about default return values, or explicit
8869 return values which do not match prescribed defaults. */
8870 enum return_types return_type = return_normal;
8872 tree dname = NULL_TREE;
8873 tree ctype = current_class_type;
8874 tree ctor_return_type = NULL_TREE;
8875 enum overload_flags flags = NO_SPECIAL;
8876 tree quals = NULL_TREE;
8877 tree raises = NULL_TREE;
8878 int template_count = 0;
8879 tree in_namespace = NULL_TREE;
8883 RIDBIT_RESET_ALL (specbits);
8884 if (decl_context == FUNCDEF)
8885 funcdef_flag = 1, decl_context = NORMAL;
8886 else if (decl_context == MEMFUNCDEF)
8887 funcdef_flag = -1, decl_context = FIELD;
8888 else if (decl_context == BITFIELD)
8889 bitfield = 1, decl_context = FIELD;
8891 /* Look inside a declarator for the name being declared
8892 and get it as a string, for an error message. */
8894 tree *next = &declarator;
8898 while (next && *next)
8901 switch (TREE_CODE (decl))
8904 /* For attributes. */
8905 next = &TREE_VALUE (decl);
8910 next = &TREE_OPERAND (decl, 0);
8913 case BIT_NOT_EXPR: /* For C++ destructors! */
8915 tree name = TREE_OPERAND (decl, 0);
8916 tree rename = NULL_TREE;
8918 my_friendly_assert (flags == NO_SPECIAL, 152);
8920 return_type = return_dtor;
8921 if (TREE_CODE (name) == TYPE_DECL)
8922 TREE_OPERAND (decl, 0) = name = constructor_name (name);
8923 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
8924 if (ctype == NULL_TREE)
8926 if (current_class_type == NULL_TREE)
8928 error ("destructors must be member functions");
8933 tree t = constructor_name (current_class_name);
8940 tree t = constructor_name (ctype);
8947 cp_error ("destructor `%T' must match class name `%T'",
8949 TREE_OPERAND (decl, 0) = rename;
8955 case ADDR_EXPR: /* C++ reference declaration */
8960 innermost_code = TREE_CODE (decl);
8961 next = &TREE_OPERAND (decl, 0);
8965 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl)))
8967 /* This is actually a variable declaration using
8968 constructor syntax. We need to call start_decl and
8969 cp_finish_decl so we can get the variable
8972 tree attributes, prefix_attributes;
8974 *next = TREE_OPERAND (decl, 0);
8975 init = CALL_DECLARATOR_PARMS (decl);
8979 attributes = TREE_PURPOSE (attrlist);
8980 prefix_attributes = TREE_VALUE (attrlist);
8984 attributes = NULL_TREE;
8985 prefix_attributes = NULL_TREE;
8988 decl = start_decl (declarator, declspecs, 1,
8989 attributes, prefix_attributes);
8992 /* Look for __unused__ attribute */
8993 if (TREE_USED (TREE_TYPE (decl)))
8994 TREE_USED (decl) = 1;
8995 finish_decl (decl, init, NULL_TREE);
8998 cp_error ("invalid declarator");
9001 innermost_code = TREE_CODE (decl);
9002 if (decl_context == FIELD && ctype == NULL_TREE)
9003 ctype = current_class_type;
9005 && TREE_OPERAND (decl, 0)
9006 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9007 && ((DECL_NAME (TREE_OPERAND (decl, 0))
9008 == constructor_name_full (ctype))
9009 || (DECL_NAME (TREE_OPERAND (decl, 0))
9010 == constructor_name (ctype)))))
9011 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9012 next = &TREE_OPERAND (decl, 0);
9014 if (ctype != NULL_TREE
9015 && decl != NULL_TREE && flags != DTOR_FLAG
9016 && decl == constructor_name (ctype))
9018 return_type = return_ctor;
9019 ctor_return_type = ctype;
9024 case TEMPLATE_ID_EXPR:
9026 tree fns = TREE_OPERAND (decl, 0);
9028 if (TREE_CODE (fns) == LOOKUP_EXPR)
9029 fns = TREE_OPERAND (fns, 0);
9032 if (TREE_CODE (dname) == COMPONENT_REF)
9033 dname = TREE_OPERAND (dname, 1);
9034 if (TREE_CODE (dname) != IDENTIFIER_NODE)
9036 my_friendly_assert (is_overloaded_fn (dname),
9038 dname = DECL_NAME (get_first_fn (dname));
9043 case IDENTIFIER_NODE:
9044 if (TREE_CODE (decl) == IDENTIFIER_NODE)
9051 cp_error ("declarator-id missing; using reserved word `%D'",
9053 name = IDENTIFIER_POINTER (dname);
9055 if (! IDENTIFIER_OPNAME_P (dname)
9056 /* GNU/Linux headers use '__op'. Arrgh. */
9057 || (IDENTIFIER_TYPENAME_P (dname) && ! TREE_TYPE (dname)))
9058 name = IDENTIFIER_POINTER (dname);
9061 if (IDENTIFIER_TYPENAME_P (dname))
9063 my_friendly_assert (flags == NO_SPECIAL, 154);
9064 flags = TYPENAME_FLAG;
9065 ctor_return_type = TREE_TYPE (dname);
9066 return_type = return_conversion;
9068 name = operator_name_string (dname);
9075 /* Perform error checking, and decide on a ctype. */
9076 tree cname = TREE_OPERAND (decl, 0);
9077 if (cname == NULL_TREE)
9079 else if (TREE_CODE (cname) == NAMESPACE_DECL)
9082 in_namespace = TREE_OPERAND (decl, 0);
9083 TREE_OPERAND (decl, 0) = NULL_TREE;
9085 else if (! is_aggr_type (cname, 1))
9086 TREE_OPERAND (decl, 0) = NULL_TREE;
9087 /* Must test TREE_OPERAND (decl, 1), in case user gives
9088 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9089 else if (TREE_OPERAND (decl, 1)
9090 && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9092 else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9093 || TREE_CODE (cname) == TEMPLATE_TEMPLATE_PARM)
9095 cp_error ("`%T::%D' is not a valid declarator", cname,
9096 TREE_OPERAND (decl, 1));
9097 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9098 cname, TREE_OPERAND (decl, 1));
9099 return void_type_node;
9101 else if (ctype == NULL_TREE)
9103 else if (TREE_COMPLEXITY (decl) == current_class_depth)
9104 TREE_OPERAND (decl, 0) = ctype;
9107 if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9109 cp_error ("type `%T' is not derived from type `%T'",
9111 TREE_OPERAND (decl, 0) = NULL_TREE;
9117 if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9118 && ((DECL_NAME (TREE_OPERAND (decl, 1))
9119 == constructor_name_full (ctype))
9120 || (DECL_NAME (TREE_OPERAND (decl, 1))
9121 == constructor_name (ctype))))
9122 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9123 next = &TREE_OPERAND (decl, 1);
9127 if (TREE_CODE (decl) == IDENTIFIER_NODE
9128 && constructor_name (ctype) == decl)
9130 return_type = return_ctor;
9131 ctor_return_type = ctype;
9133 else if (TREE_CODE (decl) == BIT_NOT_EXPR
9134 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9135 && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
9136 || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
9138 return_type = return_dtor;
9139 ctor_return_type = ctype;
9141 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9142 next = &TREE_OPERAND (decl, 0);
9153 /* Parse error puts this typespec where
9154 a declarator should go. */
9155 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl));
9156 if (TREE_TYPE (decl) == current_class_type)
9157 cp_error (" perhaps you want `%T' for a constructor",
9158 current_class_name);
9159 dname = DECL_NAME (decl);
9160 name = IDENTIFIER_POINTER (dname);
9162 /* Avoid giving two errors for this. */
9163 IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9165 declspecs = temp_tree_cons (NULL_TREE, integer_type_node,
9172 cp_compiler_error ("`%D' as declarator", decl);
9173 return 0; /* We used to do a 155 abort here. */
9180 /* A function definition's declarator must have the form of
9181 a function declarator. */
9183 if (funcdef_flag && innermost_code != CALL_EXPR)
9186 if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
9187 && innermost_code != CALL_EXPR
9188 && ! (ctype && declspecs == NULL_TREE))
9190 cp_error ("declaration of `%D' as non-function", dname);
9191 return void_type_node;
9194 /* Anything declared one level down from the top level
9195 must be one of the parameters of a function
9196 (because the body is at least two levels down). */
9198 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9199 by not allowing C++ class definitions to specify their parameters
9200 with xdecls (must be spec.d in the parmlist).
9202 Since we now wait to push a class scope until we are sure that
9203 we are in a legitimate method context, we must set oldcname
9204 explicitly (since current_class_name is not yet alive).
9206 We also want to avoid calling this a PARM if it is in a namespace. */
9208 if (decl_context == NORMAL && !toplevel_bindings_p ())
9210 struct binding_level *b = current_binding_level;
9211 current_binding_level = b->level_chain;
9212 if (current_binding_level != 0 && toplevel_bindings_p ())
9213 decl_context = PARM;
9214 current_binding_level = b;
9217 /* Look through the decl specs and record which ones appear.
9218 Some typespecs are defined as built-in typenames.
9219 Others, the ones that are modifiers of other types,
9220 are represented by bits in SPECBITS: set the bits for
9221 the modifiers that appear. Storage class keywords are also in SPECBITS.
9223 If there is a typedef name or a type, store the type in TYPE.
9224 This includes builtin typedefs such as `int'.
9226 Set EXPLICIT_INT if the type is `int' or `char' and did not
9227 come from a user typedef.
9229 Set LONGLONG if `long' is mentioned twice.
9231 For C++, constructors and destructors have their own fast treatment. */
9233 for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
9238 /* Certain parse errors slip through. For example,
9239 `int class;' is not caught by the parser. Try
9240 weakly to recover here. */
9241 if (TREE_CODE (spec) != TREE_LIST)
9244 id = TREE_VALUE (spec);
9246 if (TREE_CODE (id) == IDENTIFIER_NODE)
9248 if (id == ridpointers[(int) RID_INT]
9249 || id == ridpointers[(int) RID_CHAR]
9250 || id == ridpointers[(int) RID_BOOL]
9251 || id == ridpointers[(int) RID_WCHAR])
9255 if (id == ridpointers[(int) RID_BOOL])
9256 error ("`bool' is now a keyword");
9258 cp_error ("extraneous `%T' ignored", id);
9262 if (id == ridpointers[(int) RID_INT])
9264 else if (id == ridpointers[(int) RID_CHAR])
9266 type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
9270 /* C++ aggregate types. */
9271 if (IDENTIFIER_HAS_TYPE_VALUE (id))
9274 cp_error ("multiple declarations `%T' and `%T'", type, id);
9276 type = IDENTIFIER_TYPE_VALUE (id);
9280 for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
9282 if (ridpointers[i] == id)
9284 if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
9286 if (pedantic && ! in_system_header && warn_long_long)
9287 pedwarn ("ANSI C++ does not support `long long'");
9289 error ("`long long long' is too long for GCC");
9293 else if (RIDBIT_SETP (i, specbits))
9294 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
9295 RIDBIT_SET (i, specbits);
9300 /* C++ aggregate types. */
9301 else if (TREE_CODE (id) == TYPE_DECL || TREE_CODE (id) == TEMPLATE_DECL)
9304 cp_error ("multiple declarations `%T' and `%T'", type,
9308 type = TREE_TYPE (id);
9309 TREE_VALUE (spec) = type;
9314 error ("two or more data types in declaration of `%s'", name);
9315 else if (TREE_CODE (id) == IDENTIFIER_NODE)
9317 register tree t = lookup_name (id, 1);
9318 if (!t || TREE_CODE (t) != TYPE_DECL)
9319 error ("`%s' fails to be a typedef or built in type",
9320 IDENTIFIER_POINTER (id));
9323 type = TREE_TYPE (t);
9325 /* See the code below that used this. */
9326 decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id);
9331 else if (id != error_mark_node)
9332 /* Can't change CLASS nodes into RECORD nodes here! */
9338 typedef_type = type;
9340 /* No type at all: default to `int', and set DEFAULTED_INT
9341 because it was not a user-defined typedef. */
9343 if (type == NULL_TREE
9344 && (RIDBIT_SETP (RID_SIGNED, specbits)
9345 || RIDBIT_SETP (RID_UNSIGNED, specbits)
9346 || RIDBIT_SETP (RID_LONG, specbits)
9347 || RIDBIT_SETP (RID_SHORT, specbits)))
9349 /* These imply 'int'. */
9350 type = integer_type_node;
9354 if (type == NULL_TREE)
9357 if (return_type == return_dtor)
9358 type = void_type_node;
9359 else if (return_type == return_ctor)
9360 type = build_pointer_type (ctor_return_type);
9361 else if (return_type == return_conversion)
9362 type = ctor_return_type;
9365 /* We handle `main' specially here, because 'main () { }' is so
9366 common. With no options, it is allowed. With -Wreturn-type,
9367 it is a warning. It is only an error with -pedantic-errors. */
9368 int is_main = (funcdef_flag
9369 && MAIN_NAME_P (dname)
9370 && ctype == NULL_TREE
9371 && in_namespace == NULL_TREE
9372 && current_namespace == global_namespace);
9374 if (in_system_header || flag_ms_extensions)
9375 /* Allow it, sigh. */;
9376 else if (pedantic || ! is_main)
9377 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9379 else if (warn_return_type)
9380 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9383 type = integer_type_node;
9386 else if (return_type == return_dtor)
9388 error ("return type specification for destructor invalid");
9389 type = void_type_node;
9391 else if (return_type == return_ctor)
9393 error ("return type specification for constructor invalid");
9394 type = build_pointer_type (ctor_return_type);
9396 else if (return_type == return_conversion)
9398 if (!same_type_p (type, ctor_return_type))
9399 cp_error ("operator `%T' declared to return `%T'",
9400 ctor_return_type, type);
9402 cp_pedwarn ("return type specified for `operator %T'",
9405 type = ctor_return_type;
9410 /* Now process the modifiers that were specified
9411 and check for invalid combinations. */
9413 /* Long double is a special combination. */
9415 if (RIDBIT_SETP (RID_LONG, specbits)
9416 && TYPE_MAIN_VARIANT (type) == double_type_node)
9418 RIDBIT_RESET (RID_LONG, specbits);
9419 type = build_qualified_type (long_double_type_node,
9420 CP_TYPE_QUALS (type));
9423 /* Check all other uses of type modifiers. */
9425 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9426 || RIDBIT_SETP (RID_SIGNED, specbits)
9427 || RIDBIT_SETP (RID_LONG, specbits)
9428 || RIDBIT_SETP (RID_SHORT, specbits))
9432 if (TREE_CODE (type) == REAL_TYPE)
9433 error ("short, signed or unsigned invalid for `%s'", name);
9434 else if (TREE_CODE (type) != INTEGER_TYPE)
9435 error ("long, short, signed or unsigned invalid for `%s'", name);
9436 else if (RIDBIT_SETP (RID_LONG, specbits)
9437 && RIDBIT_SETP (RID_SHORT, specbits))
9438 error ("long and short specified together for `%s'", name);
9439 else if ((RIDBIT_SETP (RID_LONG, specbits)
9440 || RIDBIT_SETP (RID_SHORT, specbits))
9442 error ("long or short specified with char for `%s'", name);
9443 else if ((RIDBIT_SETP (RID_LONG, specbits)
9444 || RIDBIT_SETP (RID_SHORT, specbits))
9445 && TREE_CODE (type) == REAL_TYPE)
9446 error ("long or short specified with floating type for `%s'", name);
9447 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9448 && RIDBIT_SETP (RID_UNSIGNED, specbits))
9449 error ("signed and unsigned given together for `%s'", name);
9453 if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
9455 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9457 if (flag_pedantic_errors)
9462 /* Discard the type modifiers if they are invalid. */
9465 RIDBIT_RESET (RID_UNSIGNED, specbits);
9466 RIDBIT_RESET (RID_SIGNED, specbits);
9467 RIDBIT_RESET (RID_LONG, specbits);
9468 RIDBIT_RESET (RID_SHORT, specbits);
9473 if (RIDBIT_SETP (RID_COMPLEX, specbits)
9474 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
9476 error ("complex invalid for `%s'", name);
9477 RIDBIT_RESET (RID_COMPLEX, specbits);
9480 /* Decide whether an integer type is signed or not.
9481 Optionally treat bitfields as signed by default. */
9482 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9485 It is implementation-defined whether a plain (neither
9486 explicitly signed or unsigned) char, short, int, or long
9487 bit-field is signed or unsigned.
9489 Naturally, we extend this to long long as well. Note that
9490 this does not include wchar_t. */
9491 || (bitfield && !flag_signed_bitfields
9492 && RIDBIT_NOTSETP (RID_SIGNED, specbits)
9493 /* A typedef for plain `int' without `signed' can be
9494 controlled just like plain `int', but a typedef for
9495 `signed int' cannot be so controlled. */
9497 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
9498 && (TREE_CODE (type) == INTEGER_TYPE
9499 || TREE_CODE (type) == CHAR_TYPE)
9500 && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
9503 type = long_long_unsigned_type_node;
9504 else if (RIDBIT_SETP (RID_LONG, specbits))
9505 type = long_unsigned_type_node;
9506 else if (RIDBIT_SETP (RID_SHORT, specbits))
9507 type = short_unsigned_type_node;
9508 else if (type == char_type_node)
9509 type = unsigned_char_type_node;
9510 else if (typedef_decl)
9511 type = unsigned_type (type);
9513 type = unsigned_type_node;
9515 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9516 && type == char_type_node)
9517 type = signed_char_type_node;
9519 type = long_long_integer_type_node;
9520 else if (RIDBIT_SETP (RID_LONG, specbits))
9521 type = long_integer_type_node;
9522 else if (RIDBIT_SETP (RID_SHORT, specbits))
9523 type = short_integer_type_node;
9525 if (RIDBIT_SETP (RID_COMPLEX, specbits))
9527 /* If we just have "complex", it is equivalent to
9528 "complex double", but if any modifiers at all are specified it is
9529 the complex form of TYPE. E.g, "complex short" is
9530 "complex short int". */
9532 if (defaulted_int && ! longlong
9533 && ! (RIDBIT_SETP (RID_LONG, specbits)
9534 || RIDBIT_SETP (RID_SHORT, specbits)
9535 || RIDBIT_SETP (RID_SIGNED, specbits)
9536 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
9537 type = complex_double_type_node;
9538 else if (type == integer_type_node)
9539 type = complex_integer_type_node;
9540 else if (type == float_type_node)
9541 type = complex_float_type_node;
9542 else if (type == double_type_node)
9543 type = complex_double_type_node;
9544 else if (type == long_double_type_node)
9545 type = complex_long_double_type_node;
9547 type = build_complex_type (type);
9550 if (return_type == return_conversion
9551 && (RIDBIT_SETP (RID_CONST, specbits)
9552 || RIDBIT_SETP (RID_VOLATILE, specbits)
9553 || RIDBIT_SETP (RID_RESTRICT, specbits)))
9554 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9557 /* Set CONSTP if this declaration is `const', whether by
9558 explicit specification or via a typedef.
9559 Likewise for VOLATILEP. */
9561 constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type);
9563 !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type);
9565 !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type);
9566 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
9567 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
9568 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
9569 type = cp_build_qualified_type (type, type_quals);
9571 inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
9572 virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
9573 RIDBIT_RESET (RID_VIRTUAL, specbits);
9574 explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
9575 RIDBIT_RESET (RID_EXPLICIT, specbits);
9577 if (RIDBIT_SETP (RID_STATIC, specbits))
9578 staticp = 1 + (decl_context == FIELD);
9580 if (virtualp && staticp == 2)
9582 cp_error ("member `%D' cannot be declared both virtual and static",
9586 friendp = RIDBIT_SETP (RID_FRIEND, specbits);
9587 RIDBIT_RESET (RID_FRIEND, specbits);
9589 /* $7.1.2, Function specifiers */
9590 if (friendp && explicitp)
9591 error ("only declarations of constructors can be `explicit'");
9593 if (RIDBIT_SETP (RID_MUTABLE, specbits))
9595 if (decl_context == PARM)
9597 error ("non-member `%s' cannot be declared `mutable'", name);
9598 RIDBIT_RESET (RID_MUTABLE, specbits);
9600 else if (friendp || decl_context == TYPENAME)
9602 error ("non-object member `%s' cannot be declared `mutable'", name);
9603 RIDBIT_RESET (RID_MUTABLE, specbits);
9607 /* Warn if two storage classes are given. Default to `auto'. */
9609 if (RIDBIT_ANY_SET (specbits))
9611 if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
9612 if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++;
9613 if (decl_context == PARM && nclasses > 0)
9614 error ("storage class specifiers invalid in parameter declarations");
9615 if (RIDBIT_SETP (RID_TYPEDEF, specbits))
9617 if (decl_context == PARM)
9618 error ("typedef declaration invalid in parameter declaration");
9621 if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
9622 if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
9625 /* Give error if `virtual' is used outside of class declaration. */
9627 && (current_class_name == NULL_TREE || decl_context != FIELD))
9629 error ("virtual outside class declaration");
9632 if (current_class_name == NULL_TREE && RIDBIT_SETP (RID_MUTABLE, specbits))
9634 error ("only members can be declared mutable");
9635 RIDBIT_RESET (RID_MUTABLE, specbits);
9638 /* Static anonymous unions are dealt with here. */
9639 if (staticp && decl_context == TYPENAME
9640 && TREE_CODE (declspecs) == TREE_LIST
9641 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs)))
9642 decl_context = FIELD;
9644 /* Warn about storage classes that are invalid for certain
9645 kinds of declarations (parameters, typenames, etc.). */
9648 error ("multiple storage classes in declaration of `%s'", name);
9649 else if (decl_context != NORMAL && nclasses > 0)
9651 if ((decl_context == PARM || decl_context == CATCHPARM)
9652 && (RIDBIT_SETP (RID_REGISTER, specbits)
9653 || RIDBIT_SETP (RID_AUTO, specbits)))
9655 else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
9657 else if (decl_context == FIELD
9658 /* C++ allows static class elements */
9659 && RIDBIT_SETP (RID_STATIC, specbits))
9660 /* C++ also allows inlines and signed and unsigned elements,
9661 but in those cases we don't come in here. */
9665 if (decl_context == FIELD)
9667 tree tmp = NULL_TREE;
9668 register int op = 0;
9672 /* Avoid trying to get an operand off an identifier node. */
9673 if (TREE_CODE (declarator) == IDENTIFIER_NODE)
9676 tmp = TREE_OPERAND (declarator, 0);
9677 op = IDENTIFIER_OPNAME_P (tmp);
9679 error ("storage class specified for %s `%s'",
9680 op ? "member operator" : "field",
9681 op ? operator_name_string (tmp) : name);
9684 error (((decl_context == PARM || decl_context == CATCHPARM)
9685 ? "storage class specified for parameter `%s'"
9686 : "storage class specified for typename"), name);
9687 RIDBIT_RESET (RID_REGISTER, specbits);
9688 RIDBIT_RESET (RID_AUTO, specbits);
9689 RIDBIT_RESET (RID_EXTERN, specbits);
9692 else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
9694 if (toplevel_bindings_p ())
9696 /* It's common practice (and completely valid) to have a const
9697 be initialized and declared extern. */
9698 if (!(type_quals & TYPE_QUAL_CONST))
9699 warning ("`%s' initialized and declared `extern'", name);
9702 error ("`%s' has both `extern' and initializer", name);
9704 else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
9705 && ! toplevel_bindings_p ())
9706 error ("nested function `%s' declared `extern'", name);
9707 else if (toplevel_bindings_p ())
9709 if (RIDBIT_SETP (RID_AUTO, specbits))
9710 error ("top-level declaration of `%s' specifies `auto'", name);
9713 if (nclasses > 0 && friendp)
9714 error ("storage class specifiers invalid in friend function declarations");
9716 /* Now figure out the structure of the declarator proper.
9717 Descend through it, creating more complex types, until we reach
9718 the declared identifier (or NULL_TREE, in an absolute declarator). */
9720 inner_attrs = NULL_TREE;
9723 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
9724 && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
9726 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9727 an INDIRECT_REF (for *...),
9728 a CALL_EXPR (for ...(...)),
9729 an identifier (for the name being declared)
9730 or a null pointer (for the place in an absolute declarator
9731 where the name was omitted).
9732 For the last two cases, we have just exited the loop.
9734 For C++ it could also be
9735 a SCOPE_REF (for class :: ...). In this case, we have converted
9736 sensible names to types, and those are the values we use to
9737 qualify the member name.
9738 an ADDR_EXPR (for &...),
9739 a BIT_NOT_EXPR (for destructors)
9741 At this point, TYPE is the type of elements of an array,
9742 or for a function to return, or for a pointer to point to.
9743 After this sequence of ifs, TYPE is the type of the
9744 array or function or pointer, and DECLARATOR has had its
9745 outermost layer removed. */
9747 if (type == error_mark_node)
9749 if (TREE_CODE (declarator) == SCOPE_REF)
9750 declarator = TREE_OPERAND (declarator, 1);
9752 declarator = TREE_OPERAND (declarator, 0);
9755 if (quals != NULL_TREE
9756 && (declarator == NULL_TREE
9757 || TREE_CODE (declarator) != SCOPE_REF))
9759 if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
9760 ctype = TYPE_METHOD_BASETYPE (type);
9761 if (ctype != NULL_TREE)
9763 tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
9764 ctype = grok_method_quals (ctype, dummy, quals);
9765 type = TREE_TYPE (dummy);
9770 /* See the comment for the TREE_LIST case, below. */
9773 else if (inner_attrs)
9775 decl_attributes (type, inner_attrs, NULL_TREE);
9776 inner_attrs = NULL_TREE;
9779 switch (TREE_CODE (declarator))
9783 /* We encode a declarator with embedded attributes using
9784 a TREE_LIST. The attributes apply to the declarator
9785 directly inside them, so we have to skip an iteration
9786 before applying them to the type. If the declarator just
9787 inside is the declarator-id, we apply the attrs to the
9789 inner_attrs = TREE_PURPOSE (declarator);
9791 declarator = TREE_VALUE (declarator);
9797 register tree itype = NULL_TREE;
9798 register tree size = TREE_OPERAND (declarator, 1);
9799 /* The index is a signed object `sizetype' bits wide. */
9800 tree index_type = signed_type (sizetype);
9802 declarator = TREE_OPERAND (declarator, 0);
9804 /* Check for some types that there cannot be arrays of. */
9806 if (TREE_CODE (type) == VOID_TYPE)
9808 cp_error ("declaration of `%D' as array of voids", dname);
9809 type = error_mark_node;
9812 if (TREE_CODE (type) == FUNCTION_TYPE)
9814 cp_error ("declaration of `%D' as array of functions", dname);
9815 type = error_mark_node;
9818 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9819 you can't have arrays of references. If we allowed them,
9820 then we'd be saying x[i] is valid for an array x, but
9821 then you'd have to ask: what does `*(x + i)' mean? */
9822 if (TREE_CODE (type) == REFERENCE_TYPE)
9824 if (decl_context == TYPENAME)
9825 cp_error ("cannot make arrays of references");
9827 cp_error ("declaration of `%D' as array of references",
9829 type = error_mark_node;
9832 if (TREE_CODE (type) == OFFSET_TYPE)
9834 cp_error ("declaration of `%D' as array of data members",
9836 type = error_mark_node;
9839 if (TREE_CODE (type) == METHOD_TYPE)
9841 cp_error ("declaration of `%D' as array of function members",
9843 type = error_mark_node;
9846 if (size == error_mark_node)
9847 type = error_mark_node;
9848 else if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9852 the constant expressions that specify the bounds of
9853 the arrays can be omitted only for the first member
9855 cp_error ("declaration of `%D' as multidimensional array",
9857 cp_error ("must have bounds for all dimensions except the first");
9858 type = error_mark_node;
9861 if (type == error_mark_node)
9864 /* VC++ spells a zero-sized array with []. */
9865 if (size == NULL_TREE && decl_context == FIELD && ! staticp
9866 && ! RIDBIT_SETP (RID_TYPEDEF, specbits))
9867 size = integer_zero_node;
9871 /* Must suspend_momentary here because the index
9872 type may need to live until the end of the function.
9873 For example, it is used in the declaration of a
9874 variable which requires destructing at the end of
9875 the function; then build_vec_delete will need this
9877 int yes = suspend_momentary ();
9878 /* Might be a cast. */
9879 if (TREE_CODE (size) == NOP_EXPR
9880 && TREE_TYPE (size) == TREE_TYPE (TREE_OPERAND (size, 0)))
9881 size = TREE_OPERAND (size, 0);
9882 if (TREE_READONLY_DECL_P (size))
9883 size = decl_constant_value (size);
9885 /* If this involves a template parameter, it will be a
9886 constant at instantiation time, but we don't know
9887 what the value is yet. Even if no template
9888 parameters are involved, we may an expression that
9889 is not a constant; we don't even simplify `1 + 2'
9890 when processing a template. */
9891 if (processing_template_decl)
9893 /* Resolve a qualified reference to an enumerator or
9894 static const data member of ours. */
9895 if (TREE_CODE (size) == SCOPE_REF
9896 && TREE_OPERAND (size, 0) == current_class_type)
9898 tree t = lookup_field (current_class_type,
9899 TREE_OPERAND (size, 1), 0, 0);
9904 itype = build_index_type (build_min
9905 (MINUS_EXPR, sizetype, size, integer_one_node));
9906 goto dont_grok_size;
9909 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
9910 && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
9911 && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
9913 cp_error ("size of array `%D' has non-integer type",
9915 size = integer_one_node;
9917 if (pedantic && integer_zerop (size))
9918 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname);
9919 if (TREE_CONSTANT (size))
9921 int old_flag_pedantic_errors = flag_pedantic_errors;
9922 int old_pedantic = pedantic;
9923 pedantic = flag_pedantic_errors = 1;
9924 /* Always give overflow errors on array subscripts. */
9925 constant_expression_warning (size);
9926 pedantic = old_pedantic;
9927 flag_pedantic_errors = old_flag_pedantic_errors;
9928 if (INT_CST_LT (size, integer_zero_node))
9930 cp_error ("size of array `%D' is negative", dname);
9931 size = integer_one_node;
9939 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9942 cp_pedwarn ("ANSI C++ forbids variable-size array");
9947 = fold (build_binary_op (MINUS_EXPR,
9948 cp_convert (index_type, size),
9949 cp_convert (index_type,
9950 integer_one_node)));
9951 if (! TREE_CONSTANT (itype))
9952 itype = variable_size (itype);
9953 else if (TREE_OVERFLOW (itype))
9955 error ("overflow in array dimension");
9956 TREE_OVERFLOW (itype) = 0;
9959 itype = build_index_type (itype);
9962 resume_momentary (yes);
9965 type = build_cplus_array_type (type, itype);
9974 tree inner_parms = CALL_DECLARATOR_PARMS (declarator);
9975 tree inner_decl = TREE_OPERAND (declarator, 0);
9977 /* Declaring a function type.
9978 Make sure we have a valid type for the function to return. */
9980 /* We now know that the TYPE_QUALS don't apply to the
9981 decl, but to its return type. */
9982 type_quals = TYPE_UNQUALIFIED;
9984 /* Warn about some types functions can't return. */
9986 if (TREE_CODE (type) == FUNCTION_TYPE)
9988 error ("`%s' declared as function returning a function", name);
9989 type = integer_type_node;
9991 if (TREE_CODE (type) == ARRAY_TYPE)
9993 error ("`%s' declared as function returning an array", name);
9994 type = integer_type_node;
9997 if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
9998 inner_decl = TREE_OPERAND (inner_decl, 1);
10000 if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10001 inner_decl = dname;
10003 /* Pick up type qualifiers which should be applied to `this'. */
10004 quals = CALL_DECLARATOR_QUALS (declarator);
10006 /* Pick up the exception specifications. */
10007 raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator);
10009 /* Say it's a definition only for the CALL_EXPR
10010 closest to the identifier. */
10013 && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10014 || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10015 || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10017 if (ctype == NULL_TREE
10018 && decl_context == FIELD
10020 && (friendp == 0 || dname == current_class_name))
10021 ctype = current_class_type;
10023 if (ctype && return_type == return_conversion)
10024 TYPE_HAS_CONVERSION (ctype) = 1;
10025 if (ctype && constructor_name (ctype) == dname)
10027 /* We are within a class's scope. If our declarator name
10028 is the same as the class name, and we are defining
10029 a function, then it is a constructor/destructor, and
10030 therefore returns a void type. */
10032 if (flags == DTOR_FLAG)
10034 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10035 not be declared const or volatile. A destructor
10036 may not be static. */
10038 error ("destructor cannot be static member function");
10041 cp_error ("destructors may not be `%s'",
10042 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10045 if (decl_context == FIELD)
10047 if (! member_function_or_else (ctype, current_class_type,
10048 "destructor for alien class `%s' cannot be a member"))
10049 return void_type_node;
10052 else /* It's a constructor. */
10054 if (explicitp == 1)
10056 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10057 not be declared const or volatile. A constructor may
10058 not be virtual. A constructor may not be static. */
10060 error ("constructor cannot be static member function");
10063 pedwarn ("constructors cannot be declared virtual");
10068 cp_error ("constructors may not be `%s'",
10069 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10073 RID_BIT_TYPE tmp_bits;
10074 bcopy ((void*)&specbits, (void*)&tmp_bits, sizeof (RID_BIT_TYPE));
10075 RIDBIT_RESET (RID_INLINE, tmp_bits);
10076 RIDBIT_RESET (RID_STATIC, tmp_bits);
10077 if (RIDBIT_ANY_SET (tmp_bits))
10078 error ("return value type specifier for constructor ignored");
10080 type = build_pointer_type (ctype);
10081 if (decl_context == FIELD)
10083 if (! member_function_or_else (ctype, current_class_type,
10084 "constructor for alien class `%s' cannot be member"))
10085 return void_type_node;
10086 TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10087 if (return_type != return_ctor)
10091 if (decl_context == FIELD)
10097 error ("can't initialize friend function `%s'", name);
10100 /* Cannot be both friend and virtual. */
10101 error ("virtual functions cannot be friends");
10102 RIDBIT_RESET (RID_FRIEND, specbits);
10105 if (decl_context == NORMAL)
10106 error ("friend declaration not in class definition");
10107 if (current_function_decl && funcdef_flag)
10108 cp_error ("can't define friend function `%s' in a local class definition",
10112 /* Construct the function type and go to the next
10113 inner layer of declarator. */
10115 declarator = TREE_OPERAND (declarator, 0);
10117 /* FIXME: This is where default args should be fully
10120 arg_types = grokparms (inner_parms, funcdecl_p ? funcdef_flag : 0);
10122 if (declarator && flags == DTOR_FLAG)
10124 /* A destructor declared in the body of a class will
10125 be represented as a BIT_NOT_EXPR. But, we just
10126 want the underlying IDENTIFIER. */
10127 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10128 declarator = TREE_OPERAND (declarator, 0);
10130 if (strict_prototype == 0 && arg_types == NULL_TREE)
10131 arg_types = void_list_node;
10132 else if (arg_types == NULL_TREE
10133 || arg_types != void_list_node)
10135 cp_error ("destructors may not have parameters");
10136 arg_types = void_list_node;
10137 last_function_parms = NULL_TREE;
10141 /* ANSI says that `const int foo ();'
10142 does not make the function foo const. */
10143 type = build_function_type (type, arg_types);
10147 for (t = arg_types; t; t = TREE_CHAIN (t))
10148 if (TREE_PURPOSE (t)
10149 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10151 add_defarg_fn (type);
10160 /* Filter out pointers-to-references and references-to-references.
10161 We can get these if a TYPE_DECL is used. */
10163 if (TREE_CODE (type) == REFERENCE_TYPE)
10165 error ("cannot declare %s to references",
10166 TREE_CODE (declarator) == ADDR_EXPR
10167 ? "references" : "pointers");
10168 declarator = TREE_OPERAND (declarator, 0);
10172 if (TREE_CODE (type) == OFFSET_TYPE
10173 && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10174 || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10176 cp_error ("cannot declare pointer to `%#T' member",
10178 type = TREE_TYPE (type);
10181 /* Merge any constancy or volatility into the target type
10182 for the pointer. */
10184 /* We now know that the TYPE_QUALS don't apply to the decl,
10185 but to the target of the pointer. */
10186 type_quals = TYPE_UNQUALIFIED;
10188 if (TREE_CODE (declarator) == ADDR_EXPR)
10190 if (TREE_CODE (type) == VOID_TYPE)
10191 error ("invalid type: `void &'");
10193 type = build_reference_type (type);
10195 else if (TREE_CODE (type) == METHOD_TYPE)
10196 type = build_ptrmemfunc_type (build_pointer_type (type));
10198 type = build_pointer_type (type);
10200 /* Process a list of type modifier keywords (such as
10201 const or volatile) that were given inside the `*' or `&'. */
10203 if (TREE_TYPE (declarator))
10205 register tree typemodlist;
10211 for (typemodlist = TREE_TYPE (declarator); typemodlist;
10212 typemodlist = TREE_CHAIN (typemodlist))
10214 tree qualifier = TREE_VALUE (typemodlist);
10216 if (qualifier == ridpointers[(int) RID_CONST])
10218 else if (qualifier == ridpointers[(int) RID_VOLATILE])
10220 else if (qualifier == ridpointers[(int) RID_RESTRICT])
10225 error ("invalid type modifier within pointer declarator");
10229 pedwarn ("duplicate `const'");
10231 pedwarn ("duplicate `volatile'");
10233 pedwarn ("duplicate `restrict'");
10235 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10236 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10237 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10238 if (TREE_CODE (declarator) == ADDR_EXPR
10239 && (constp || volatilep))
10242 pedwarn ("discarding `const' applied to a reference");
10244 pedwarn ("discarding `volatile' applied to a reference");
10245 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
10247 type = cp_build_qualified_type (type, type_quals);
10249 declarator = TREE_OPERAND (declarator, 0);
10255 /* We have converted type names to NULL_TREE if the
10256 name was bogus, or to a _TYPE node, if not.
10258 The variable CTYPE holds the type we will ultimately
10259 resolve to. The code here just needs to build
10260 up appropriate member types. */
10261 tree sname = TREE_OPERAND (declarator, 1);
10264 /* Destructors can have their visibilities changed as well. */
10265 if (TREE_CODE (sname) == BIT_NOT_EXPR)
10266 sname = TREE_OPERAND (sname, 0);
10268 if (TREE_COMPLEXITY (declarator) == 0)
10269 /* This needs to be here, in case we are called
10270 multiple times. */ ;
10271 else if (TREE_COMPLEXITY (declarator) == -1)
10272 /* Namespace member. */
10273 pop_decl_namespace ();
10274 else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
10275 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10276 else if (! IS_AGGR_TYPE_CODE
10277 (TREE_CODE (TREE_OPERAND (declarator, 0))))
10279 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
10281 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10282 that refer to ctype. They couldn't be resolved earlier
10283 because we hadn't pushed into the class yet.
10284 Example: resolve 'B<T>::type' in
10285 'B<typename B<T>::type> B<T>::f () { }'. */
10286 if (current_template_parms
10287 && uses_template_parms (type)
10288 && uses_template_parms (current_class_type))
10290 tree args = current_template_args ();
10291 type = tsubst (type, args, /*complain=*/1, NULL_TREE);
10294 /* This pop_nested_class corresponds to the
10295 push_nested_class used to push into class scope for
10296 parsing the argument list of a function decl, in
10298 pop_nested_class ();
10299 TREE_COMPLEXITY (declarator) = current_class_depth;
10302 my_friendly_abort (16);
10304 if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10306 /* We had a reference to a global decl, or
10307 perhaps we were given a non-aggregate typedef,
10308 in which case we cleared this out, and should just
10309 keep going as though it wasn't there. */
10310 declarator = sname;
10313 ctype = TREE_OPERAND (declarator, 0);
10316 while (t != NULL_TREE && CLASS_TYPE_P (t))
10318 if (CLASSTYPE_TEMPLATE_INFO (t) &&
10319 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10320 template_count += 1;
10321 t = TYPE_MAIN_DECL (t);
10322 if (DECL_LANG_SPECIFIC (t))
10323 t = DECL_CLASS_CONTEXT (t);
10328 if (sname == NULL_TREE)
10331 if (TREE_CODE (sname) == IDENTIFIER_NODE)
10333 /* This is the `standard' use of the scoping operator:
10334 basetype :: member . */
10336 if (ctype == current_class_type)
10342 Is this ill-formed? */
10345 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10348 else if (TREE_CODE (type) == FUNCTION_TYPE)
10350 if (current_class_type == NULL_TREE
10352 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10353 TYPE_ARG_TYPES (type));
10356 cp_error ("cannot declare member function `%T::%s' within `%T'",
10357 ctype, name, current_class_type);
10358 return void_type_node;
10361 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
10362 || TYPE_SIZE (complete_type (ctype)) != NULL_TREE)
10364 /* Have to move this code elsewhere in this function.
10365 this code is used for i.e., typedef int A::M; M *pm;
10367 It is? How? jason 10/2/94 */
10369 if (current_class_type)
10371 cp_error ("cannot declare member `%T::%s' within `%T'",
10372 ctype, name, current_class_type);
10373 return void_type_node;
10375 type = build_offset_type (ctype, type);
10377 else if (uses_template_parms (ctype))
10379 if (TREE_CODE (type) == FUNCTION_TYPE)
10381 = build_cplus_method_type (ctype, TREE_TYPE (type),
10382 TYPE_ARG_TYPES (type));
10386 cp_error ("structure `%T' not yet defined", ctype);
10387 return error_mark_node;
10390 declarator = sname;
10392 else if (TREE_CODE (sname) == SCOPE_REF)
10393 my_friendly_abort (17);
10397 declarator = TREE_OPERAND (declarator, 1);
10398 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
10399 /* In this case, we will deal with it later. */
10403 if (TREE_CODE (type) == FUNCTION_TYPE)
10404 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10405 TYPE_ARG_TYPES (type));
10407 type = build_offset_type (ctype, type);
10414 declarator = TREE_OPERAND (declarator, 0);
10419 case ENUMERAL_TYPE:
10420 declarator = NULL_TREE;
10424 declarator = NULL_TREE;
10428 my_friendly_abort (158);
10432 /* See the comment for the TREE_LIST case, above. */
10435 if (! ignore_attrs)
10436 decl_attributes (type, inner_attrs, NULL_TREE);
10438 TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist));
10440 attrlist = build_decl_list (NULL_TREE, inner_attrs);
10443 /* Now TYPE has the actual type. */
10445 if (explicitp == 1)
10447 error ("only constructors can be declared `explicit'");
10451 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10453 if (type_quals & TYPE_QUAL_CONST)
10455 error ("const `%s' cannot be declared `mutable'", name);
10456 RIDBIT_RESET (RID_MUTABLE, specbits);
10460 error ("static `%s' cannot be declared `mutable'", name);
10461 RIDBIT_RESET (RID_MUTABLE, specbits);
10465 if (declarator == NULL_TREE
10466 || TREE_CODE (declarator) == IDENTIFIER_NODE
10467 || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
10468 && (TREE_CODE (type) == FUNCTION_TYPE
10469 || TREE_CODE (type) == METHOD_TYPE)))
10471 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
10473 cp_error ("template-id `%D' used as a declarator", declarator);
10474 declarator = dname;
10477 /* Unexpected declarator format. */
10478 my_friendly_abort (990210);
10480 /* If this is declaring a typedef name, return a TYPE_DECL. */
10482 if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
10486 /* Note that the grammar rejects storage classes
10487 in typenames, fields or parameters. */
10488 if (current_lang_name == lang_name_java)
10489 TYPE_FOR_JAVA (type) = 1;
10491 if (decl_context == FIELD)
10493 if (declarator == constructor_name (current_class_type))
10494 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10496 decl = build_lang_decl (TYPE_DECL, declarator, type);
10500 /* Make sure this typedef lives as long as its type,
10501 since it might be used as a template parameter. */
10502 if (type != error_mark_node)
10503 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
10504 if (processing_template_decl)
10505 decl = build_lang_decl (TYPE_DECL, declarator, type);
10507 decl = build_decl (TYPE_DECL, declarator, type);
10508 if (type != error_mark_node)
10512 /* If the user declares "typedef struct {...} foo" then the
10513 struct will have an anonymous name. Fill that name in now.
10514 Nothing can refer to it, so nothing needs know about the name
10516 if (type != error_mark_node
10517 && TYPE_NAME (type)
10518 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
10519 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type))
10520 && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED)
10522 tree oldname = TYPE_NAME (type);
10525 /* Replace the anonymous name with the real name everywhere. */
10526 lookup_tag_reverse (type, declarator);
10527 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
10528 if (TYPE_NAME (t) == oldname)
10529 TYPE_NAME (t) = decl;
10531 if (TYPE_LANG_SPECIFIC (type))
10532 TYPE_WAS_ANONYMOUS (type) = 1;
10534 /* If this is a typedef within a template class, the nested
10535 type is a (non-primary) template. The name for the
10536 template needs updating as well. */
10537 if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
10538 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
10539 = TYPE_IDENTIFIER (type);
10541 /* XXX Temporarily set the scope.
10542 When returning, start_decl expects it as NULL_TREE,
10543 and will then then set it using pushdecl. */
10544 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 980404);
10545 if (current_class_type)
10546 DECL_CONTEXT (decl) = current_class_type;
10548 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
10550 DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
10551 DECL_ASSEMBLER_NAME (decl)
10552 = get_identifier (build_overload_name (type, 1, 1));
10553 DECL_CONTEXT (decl) = NULL_TREE;
10555 /* FIXME remangle member functions; member functions of a
10556 type with external linkage have external linkage. */
10559 if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
10561 cp_error_at ("typedef name may not be class-qualified", decl);
10566 if (ctype == NULL_TREE)
10568 if (TREE_CODE (type) != METHOD_TYPE)
10569 cp_error_at ("invalid type qualifier for non-method type", decl);
10571 ctype = TYPE_METHOD_BASETYPE (type);
10573 if (ctype != NULL_TREE)
10574 grok_method_quals (ctype, decl, quals);
10577 if (RIDBIT_SETP (RID_SIGNED, specbits)
10578 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
10579 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
10581 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10582 error ("non-object member `%s' cannot be declared mutable", name);
10584 bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
10585 inlinep, friendp, raises != NULL_TREE);
10588 error ("typedef declaration includes an initializer");
10593 /* Detect the case of an array type of unspecified size
10594 which came, as such, direct from a typedef name.
10595 We must copy the type, so that each identifier gets
10596 a distinct type, so that each identifier's size can be
10597 controlled separately by its own initializer. */
10599 if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE
10600 && TYPE_DOMAIN (type) == NULL_TREE)
10602 type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type));
10605 /* If this is a type name (such as, in a cast or sizeof),
10606 compute the type and return it now. */
10608 if (decl_context == TYPENAME)
10610 /* Note that the grammar rejects storage classes
10611 in typenames, fields or parameters. */
10612 if (type_quals != TYPE_UNQUALIFIED)
10613 type_quals = TYPE_UNQUALIFIED;
10615 /* Special case: "friend class foo" looks like a TYPENAME context. */
10618 if (type_quals != TYPE_UNQUALIFIED)
10620 cp_error ("type qualifiers specified for friend class declaration");
10621 type_quals = TYPE_UNQUALIFIED;
10625 cp_error ("`inline' specified for friend class declaration");
10629 /* Only try to do this stuff if we didn't already give up. */
10630 if (type != integer_type_node)
10632 /* A friendly class? */
10633 if (current_class_type)
10634 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
10636 error ("trying to make class `%s' a friend of global scope",
10637 TYPE_NAME_STRING (type));
10638 type = void_type_node;
10643 tree dummy = build_decl (TYPE_DECL, declarator, type);
10644 if (ctype == NULL_TREE)
10646 my_friendly_assert (TREE_CODE (type) == METHOD_TYPE, 159);
10647 ctype = TYPE_METHOD_BASETYPE (type);
10649 grok_method_quals (ctype, dummy, quals);
10650 type = TREE_TYPE (dummy);
10655 else if (declarator == NULL_TREE && decl_context != PARM
10656 && decl_context != CATCHPARM
10657 && TREE_CODE (type) != UNION_TYPE
10660 cp_error ("abstract declarator `%T' used as declaration", type);
10661 declarator = make_anon_name ();
10664 /* `void' at top level (not within pointer)
10665 is allowed only in typedefs or type names.
10666 We don't complain about parms either, but that is because
10667 a better error message can be made later. */
10669 if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
10672 error ("unnamed variable or field declared void");
10673 else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10675 if (IDENTIFIER_OPNAME_P (declarator))
10676 my_friendly_abort (356);
10678 error ("variable or field `%s' declared void", name);
10681 error ("variable or field declared void");
10682 type = integer_type_node;
10685 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10686 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10688 if (decl_context == PARM || decl_context == CATCHPARM)
10690 if (ctype || in_namespace)
10691 error ("cannot use `::' in parameter declaration");
10693 /* A parameter declared as an array of T is really a pointer to T.
10694 One declared as a function is really a pointer to a function.
10695 One declared as a member is really a pointer to member. */
10697 if (TREE_CODE (type) == ARRAY_TYPE)
10699 /* Transfer const-ness of array into that of type pointed to. */
10700 type = build_pointer_type (TREE_TYPE (type));
10701 type_quals = TYPE_UNQUALIFIED;
10703 else if (TREE_CODE (type) == FUNCTION_TYPE)
10704 type = build_pointer_type (type);
10705 else if (TREE_CODE (type) == OFFSET_TYPE)
10706 type = build_pointer_type (type);
10707 else if (TREE_CODE (type) == VOID_TYPE && declarator)
10709 error ("declaration of `%s' as void", name);
10715 register tree decl;
10717 if (decl_context == PARM)
10719 decl = build_decl (PARM_DECL, declarator, type);
10721 bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
10722 inlinep, friendp, raises != NULL_TREE);
10724 /* Compute the type actually passed in the parmlist,
10725 for the case where there is no prototype.
10726 (For example, shorts and chars are passed as ints.)
10727 When there is a prototype, this is overridden later. */
10729 DECL_ARG_TYPE (decl) = type_promotes_to (type);
10731 else if (decl_context == FIELD)
10733 if (type == error_mark_node)
10735 /* Happens when declaring arrays of sizes which
10736 are error_mark_node, for example. */
10739 else if (in_namespace && !friendp)
10741 /* Something like struct S { int N::j; }; */
10742 cp_error ("invalid use of `::'");
10745 else if (TREE_CODE (type) == FUNCTION_TYPE)
10748 tree function_context;
10750 /* We catch the others as conflicts with the builtin
10752 if (friendp && declarator == ridpointers[(int) RID_SIGNED])
10754 cp_error ("function `%D' cannot be declared friend",
10761 if (ctype == NULL_TREE)
10762 ctype = current_class_type;
10764 if (ctype == NULL_TREE)
10766 cp_error ("can't make `%D' into a method -- not in a class",
10768 return void_type_node;
10771 /* ``A union may [ ... ] not [ have ] virtual functions.''
10773 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
10775 cp_error ("function `%D' declared virtual inside a union",
10777 return void_type_node;
10780 if (declarator == ansi_opname[(int) NEW_EXPR]
10781 || declarator == ansi_opname[(int) VEC_NEW_EXPR]
10782 || declarator == ansi_opname[(int) DELETE_EXPR]
10783 || declarator == ansi_opname[(int) VEC_DELETE_EXPR])
10787 cp_error ("`%D' cannot be declared virtual, since it is always static",
10792 else if (staticp < 2)
10793 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10794 TYPE_ARG_TYPES (type));
10797 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10798 function_context = (ctype != NULL_TREE) ?
10799 hack_decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
10800 publicp = (! friendp || ! staticp)
10801 && function_context == NULL_TREE;
10802 decl = grokfndecl (ctype, type,
10803 TREE_CODE (declarator) != TEMPLATE_ID_EXPR
10804 ? declarator : dname,
10806 virtualp, flags, quals, raises,
10807 friendp ? -1 : 0, friendp, publicp, inlinep,
10808 funcdef_flag, template_count, in_namespace);
10809 if (decl == NULL_TREE)
10812 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10813 /* The decl and setting of decl_machine_attr is also turned off. */
10814 decl = build_decl_attribute_variant (decl, decl_machine_attr);
10817 /* [class.conv.ctor]
10819 A constructor declared without the function-specifier
10820 explicit that can be called with a single parameter
10821 specifies a conversion from the type of its first
10822 parameter to the type of its class. Such a constructor
10823 is called a converting constructor. */
10824 if (explicitp == 2)
10825 DECL_NONCONVERTING_P (decl) = 1;
10826 else if (DECL_CONSTRUCTOR_P (decl))
10828 /* The constructor can be called with exactly one
10829 parameter if there is at least one parameter, and
10830 any subsequent parameters have default arguments.
10831 We don't look at the first parameter, which is
10832 really just the `this' parameter for the new
10835 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)));
10837 /* Skip the `in_chrg' argument too, if present. */
10838 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl)))
10839 arg_types = TREE_CHAIN (arg_types);
10841 if (arg_types == void_list_node
10843 && TREE_CHAIN (arg_types)
10844 && TREE_CHAIN (arg_types) != void_list_node
10845 && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
10846 DECL_NONCONVERTING_P (decl) = 1;
10849 else if (TREE_CODE (type) == METHOD_TYPE)
10851 /* We only get here for friend declarations of
10852 members of other classes. */
10853 /* All method decls are public, so tell grokfndecl to set
10854 TREE_PUBLIC, also. */
10855 decl = grokfndecl (ctype, type, declarator, declarator,
10856 virtualp, flags, quals, raises,
10857 friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
10858 template_count, in_namespace);
10859 if (decl == NULL_TREE)
10862 else if (!staticp && ! processing_template_decl
10863 && TYPE_SIZE (complete_type (type)) == NULL_TREE
10864 && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
10867 cp_error ("field `%D' has incomplete type", declarator);
10869 cp_error ("name `%T' has incomplete type", type);
10871 /* If we're instantiating a template, tell them which
10872 instantiation made the field's type be incomplete. */
10873 if (current_class_type
10874 && TYPE_NAME (current_class_type)
10875 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
10876 && declspecs && TREE_VALUE (declspecs)
10877 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
10878 cp_error (" in instantiation of template `%T'",
10879 current_class_type);
10881 type = error_mark_node;
10888 error ("`%s' is neither function nor method; cannot be declared friend",
10889 IDENTIFIER_POINTER (declarator));
10897 /* Friends are treated specially. */
10898 if (ctype == current_class_type)
10899 warning ("member functions are implicitly friends of their class");
10902 tree t = NULL_TREE;
10903 if (decl && DECL_NAME (decl))
10905 if (template_class_depth (current_class_type) == 0)
10908 = check_explicit_specialization
10910 template_count, 2 * (funcdef_flag != 0) + 4);
10911 if (decl == error_mark_node)
10912 return error_mark_node;
10915 t = do_friend (ctype, declarator, decl,
10916 last_function_parms, attrlist, flags, quals,
10919 if (t && funcdef_flag)
10922 return void_type_node;
10926 /* Structure field. It may not be a function, except for C++ */
10928 if (decl == NULL_TREE)
10934 /* An attempt is being made to initialize a non-static
10935 member. But, from [class.mem]:
10937 4 A member-declarator can contain a
10938 constant-initializer only if it declares a static
10939 member (_class.static_) of integral or enumeration
10940 type, see _class.static.data_.
10942 This used to be relatively common practice, but
10943 the rest of the compiler does not correctly
10944 handle the initialization unless the member is
10945 static so we make it static below. */
10946 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10948 cp_pedwarn ("making `%D' static", declarator);
10952 if (uses_template_parms (type))
10953 /* We'll check at instantiation time. */
10955 else if (check_static_variable_definition (declarator,
10957 /* If we just return the declaration, crashes
10958 will sometimes occur. We therefore return
10959 void_type_node, as if this was a friend
10960 declaration, to cause callers to completely
10961 ignore this declaration. */
10962 return void_type_node;
10965 /* 9.2p13 [class.mem] */
10966 if (declarator == constructor_name (current_class_type)
10967 /* Divergence from the standard: In extern "C", we
10968 allow non-static data members here, because C does
10969 and /usr/include/netinet/in.h uses that. */
10970 && (staticp || ! in_system_header))
10971 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10976 /* C++ allows static class members. All other work
10977 for this is done by grokfield. */
10978 decl = build_lang_decl (VAR_DECL, declarator, type);
10979 TREE_STATIC (decl) = 1;
10980 /* In class context, 'static' means public access. */
10981 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
10985 decl = build_lang_decl (FIELD_DECL, declarator, type);
10986 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10988 DECL_MUTABLE_P (decl) = 1;
10989 RIDBIT_RESET (RID_MUTABLE, specbits);
10993 bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
10994 inlinep, friendp, raises != NULL_TREE);
10997 else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
10999 tree original_name;
11005 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11006 original_name = dname;
11008 original_name = declarator;
11010 if (RIDBIT_SETP (RID_AUTO, specbits))
11011 error ("storage class `auto' invalid for function `%s'", name);
11012 else if (RIDBIT_SETP (RID_REGISTER, specbits))
11013 error ("storage class `register' invalid for function `%s'", name);
11015 /* Function declaration not at top level.
11016 Storage classes other than `extern' are not allowed
11017 and `extern' makes no difference. */
11018 if (! toplevel_bindings_p ()
11019 && (RIDBIT_SETP (RID_STATIC, specbits)
11020 || RIDBIT_SETP (RID_INLINE, specbits))
11023 if (RIDBIT_SETP (RID_STATIC, specbits))
11024 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11026 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11029 if (ctype == NULL_TREE)
11033 error ("virtual non-class function `%s'", name);
11037 else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11038 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11039 TYPE_ARG_TYPES (type));
11041 /* Record presence of `static'. */
11042 publicp = (ctype != NULL_TREE
11043 || RIDBIT_SETP (RID_EXTERN, specbits)
11044 || !RIDBIT_SETP (RID_STATIC, specbits));
11046 decl = grokfndecl (ctype, type, original_name, declarator,
11047 virtualp, flags, quals, raises,
11049 publicp, inlinep, funcdef_flag,
11050 template_count, in_namespace);
11051 if (decl == NULL_TREE)
11056 int illegal_static = 0;
11058 /* Don't allow a static member function in a class, and forbid
11059 declaring main to be static. */
11060 if (TREE_CODE (type) == METHOD_TYPE)
11062 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11063 illegal_static = 1;
11065 else if (current_function_decl)
11067 /* FIXME need arm citation */
11068 error ("cannot declare static function inside another function");
11069 illegal_static = 1;
11072 if (illegal_static)
11075 RIDBIT_RESET (RID_STATIC, specbits);
11081 /* It's a variable. */
11083 /* An uninitialized decl with `extern' is a reference. */
11084 decl = grokvardecl (type, declarator, &specbits,
11086 (type_quals & TYPE_QUAL_CONST) != 0,
11088 bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11089 inlinep, friendp, raises != NULL_TREE);
11093 DECL_CONTEXT (decl) = ctype;
11096 cp_pedwarn ("static member `%D' re-declared as static", decl);
11098 RIDBIT_RESET (RID_STATIC, specbits);
11100 if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11102 cp_error ("static member `%D' declared `register'", decl);
11103 RIDBIT_RESET (RID_REGISTER, specbits);
11105 if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11107 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11109 RIDBIT_RESET (RID_EXTERN, specbits);
11114 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11116 error ("`%s' cannot be declared mutable", name);
11119 /* Record `register' declaration for warnings on &
11120 and in case doing stupid register allocation. */
11122 if (RIDBIT_SETP (RID_REGISTER, specbits))
11123 DECL_REGISTER (decl) = 1;
11125 if (RIDBIT_SETP (RID_EXTERN, specbits))
11126 DECL_THIS_EXTERN (decl) = 1;
11128 if (RIDBIT_SETP (RID_STATIC, specbits))
11129 DECL_THIS_STATIC (decl) = 1;
11131 /* Record constancy and volatility. There's no need to do this
11132 when processing a template; we'll do this for the instantiated
11133 declaration based on the type of DECL. */
11134 if (!processing_template_decl)
11135 c_apply_type_quals_to_decl (type_quals, decl);
11141 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11142 An empty exprlist is a parmlist. An exprlist which
11143 contains only identifiers at the global level
11144 is a parmlist. Otherwise, it is an exprlist. */
11147 parmlist_is_exprlist (exprs)
11150 if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11153 if (toplevel_bindings_p ())
11155 /* At the global level, if these are all identifiers,
11156 then it is a parmlist. */
11159 if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11161 exprs = TREE_CHAIN (exprs);
11168 /* Subroutine of start_function. Ensure that each of the parameter
11169 types (as listed in PARMS) is complete, as is required for a
11170 function definition. */
11173 require_complete_types_for_parms (parms)
11178 tree type = TREE_TYPE (parms);
11179 if (TYPE_SIZE (complete_type (type)) == NULL_TREE)
11181 if (DECL_NAME (parms))
11182 error ("parameter `%s' has incomplete type",
11183 IDENTIFIER_POINTER (DECL_NAME (parms)));
11185 error ("parameter has incomplete type");
11186 TREE_TYPE (parms) = error_mark_node;
11189 layout_decl (parms, 0);
11191 parms = TREE_CHAIN (parms);
11195 /* Returns *TP if *TP is a local variable (or parameter). Returns
11196 NULL_TREE otherwise. */
11199 local_variable_p (tp)
11204 if ((TREE_CODE (t) == VAR_DECL
11205 /* A VAR_DECL with a context that is a _TYPE is a static data
11207 && !TYPE_P (CP_DECL_CONTEXT (t))
11208 /* Any other non-local variable must be at namespace scope. */
11209 && TREE_CODE (CP_DECL_CONTEXT (t)) != NAMESPACE_DECL)
11210 || (TREE_CODE (t) == PARM_DECL))
11216 /* Check that ARG, which is a default-argument expression for a
11217 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11218 something goes wrong. DECL may also be a _TYPE node, rather than a
11219 DECL, if there is no DECL available. */
11222 check_default_argument (decl, arg)
11229 if (TREE_CODE (arg) == DEFAULT_ARG)
11230 /* We get a DEFAULT_ARG when looking at an in-class declaration
11231 with a default argument. Ignore the argument for now; we'll
11232 deal with it after the class is complete. */
11235 if (processing_template_decl || uses_template_parms (arg))
11236 /* We don't do anything checking until instantiation-time. Note
11237 that there may be uninstantiated arguments even for an
11238 instantiated function, since default arguments are not
11239 instantiated until they are needed. */
11248 decl_type = TREE_TYPE (decl);
11250 if (arg == error_mark_node
11251 || decl == error_mark_node
11252 || TREE_TYPE (arg) == error_mark_node
11253 || decl_type == error_mark_node)
11254 /* Something already went wrong. There's no need to check
11256 return error_mark_node;
11258 /* [dcl.fct.default]
11260 A default argument expression is implicitly converted to the
11262 if (!TREE_TYPE (arg)
11263 || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11266 cp_error ("default argument for `%#D' has type `%T'",
11267 decl, TREE_TYPE (arg));
11269 cp_error ("default argument for parameter of type `%T' has type `%T'",
11270 decl_type, TREE_TYPE (arg));
11272 return error_mark_node;
11275 /* [dcl.fct.default]
11277 Local variables shall not be used in default argument
11280 The keyword `this' shall not be used in a default argument of a
11281 member function. */
11282 var = search_tree (&arg, local_variable_p);
11285 cp_error ("default argument `%E' uses local variable `%D'",
11287 return error_mark_node;
11294 /* Decode the list of parameter types for a function type.
11295 Given the list of things declared inside the parens,
11296 return a list of types.
11298 The list we receive can have three kinds of elements:
11299 an IDENTIFIER_NODE for names given without types,
11300 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11301 or void_type_node, to mark the end of an argument list
11302 when additional arguments are not permitted (... was not used).
11304 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11305 a mere declaration. A nonempty identifier-list gets an error message
11306 when FUNCDEF_FLAG is zero.
11307 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11308 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11310 If all elements of the input list contain types,
11311 we return a list of the types.
11312 If all elements contain no type (except perhaps a void_type_node
11313 at the end), we return a null list.
11314 If some have types and some do not, it is an error, and we
11315 return a null list.
11317 Also set last_function_parms to either
11318 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11319 A list of names is converted to a chain of PARM_DECLs
11320 by store_parm_decls so that ultimately it is always a chain of decls.
11322 Note that in C++, parameters can take default values. These default
11323 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11324 an error to specify default values which are followed by parameters
11325 that have no default values, or an ELLIPSES. For simplicities sake,
11326 only parameters which are specified with their types can take on
11330 grokparms (first_parm, funcdef_flag)
11334 tree result = NULL_TREE;
11335 tree decls = NULL_TREE;
11337 if (first_parm != NULL_TREE
11338 && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE)
11340 if (! funcdef_flag)
11341 pedwarn ("parameter names (without types) in function declaration");
11342 last_function_parms = first_parm;
11345 else if (first_parm != NULL_TREE
11346 && TREE_CODE (TREE_VALUE (first_parm)) != TREE_LIST
11347 && TREE_CODE (TREE_VALUE (first_parm)) != VOID_TYPE)
11348 my_friendly_abort (145);
11351 /* Types were specified. This is a list of declarators
11352 each represented as a TREE_LIST node. */
11353 register tree parm, chain;
11354 int any_init = 0, any_error = 0;
11356 if (first_parm != NULL_TREE)
11358 tree last_result = NULL_TREE;
11359 tree last_decl = NULL_TREE;
11361 for (parm = first_parm; parm != NULL_TREE; parm = chain)
11363 tree type = NULL_TREE, list_node = parm;
11364 register tree decl = TREE_VALUE (parm);
11365 tree init = TREE_PURPOSE (parm);
11367 chain = TREE_CHAIN (parm);
11368 /* @@ weak defense against parse errors. */
11369 if (TREE_CODE (decl) != VOID_TYPE
11370 && TREE_CODE (decl) != TREE_LIST)
11372 /* Give various messages as the need arises. */
11373 if (TREE_CODE (decl) == STRING_CST)
11374 cp_error ("invalid string constant `%E'", decl);
11375 else if (TREE_CODE (decl) == INTEGER_CST)
11376 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11380 if (TREE_CODE (decl) != VOID_TYPE)
11382 decl = grokdeclarator (TREE_VALUE (decl),
11383 TREE_PURPOSE (decl),
11384 PARM, init != NULL_TREE,
11386 if (! decl || TREE_TYPE (decl) == error_mark_node)
11389 /* Top-level qualifiers on the parameters are
11390 ignored for function types. */
11391 type = TYPE_MAIN_VARIANT (TREE_TYPE (decl));
11393 if (TREE_CODE (type) == VOID_TYPE)
11394 decl = void_type_node;
11395 else if (TREE_CODE (type) == METHOD_TYPE)
11397 if (DECL_NAME (decl))
11398 /* Cannot use the decl here because
11399 we don't have DECL_CONTEXT set up yet. */
11400 cp_error ("parameter `%D' invalidly declared method type",
11403 error ("parameter invalidly declared method type");
11404 type = build_pointer_type (type);
11405 TREE_TYPE (decl) = type;
11407 else if (TREE_CODE (type) == OFFSET_TYPE)
11409 if (DECL_NAME (decl))
11410 cp_error ("parameter `%D' invalidly declared offset type",
11413 error ("parameter invalidly declared offset type");
11414 type = build_pointer_type (type);
11415 TREE_TYPE (decl) = type;
11417 else if (abstract_virtuals_error (decl, type))
11418 any_error = 1; /* Seems like a good idea. */
11419 else if (POINTER_TYPE_P (type))
11422 while (POINTER_TYPE_P (t)
11423 || (TREE_CODE (t) == ARRAY_TYPE
11424 && TYPE_DOMAIN (t) != NULL_TREE))
11426 if (TREE_CODE (t) == ARRAY_TYPE)
11427 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11429 TYPE_PTR_P (type) ? "pointer" : "reference");
11433 if (TREE_CODE (decl) == VOID_TYPE)
11435 if (result == NULL_TREE)
11437 result = void_list_node;
11438 last_result = result;
11442 TREE_CHAIN (last_result) = void_list_node;
11443 last_result = void_list_node;
11446 && (chain != void_list_node || TREE_CHAIN (chain)))
11447 error ("`void' in parameter list must be entire list");
11451 /* Since there is a prototype, args are passed in their own types. */
11452 DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
11453 if (PROMOTE_PROTOTYPES
11454 && (TREE_CODE (type) == INTEGER_TYPE
11455 || TREE_CODE (type) == ENUMERAL_TYPE)
11456 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
11457 DECL_ARG_TYPE (decl) = integer_type_node;
11458 if (!any_error && init)
11461 init = check_default_argument (decl, init);
11466 if (decls == NULL_TREE)
11473 TREE_CHAIN (last_decl) = decl;
11476 list_node = tree_cons (init, type, NULL_TREE);
11477 if (result == NULL_TREE)
11479 result = list_node;
11480 last_result = result;
11484 TREE_CHAIN (last_result) = list_node;
11485 last_result = list_node;
11489 TREE_CHAIN (last_result) = NULL_TREE;
11490 /* If there are no parameters, and the function does not end
11491 with `...', then last_decl will be NULL_TREE. */
11492 if (last_decl != NULL_TREE)
11493 TREE_CHAIN (last_decl) = NULL_TREE;
11497 last_function_parms = decls;
11502 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11503 FUNCTION_TYPE with the newly parsed version of its default argument, which
11504 was previously digested as text. See snarf_defarg et al in lex.c. */
11507 replace_defarg (arg, init)
11510 if (! processing_template_decl
11511 && ! can_convert_arg (TREE_VALUE (arg), TREE_TYPE (init), init))
11512 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11513 TREE_TYPE (init), TREE_VALUE (arg));
11514 TREE_PURPOSE (arg) = init;
11521 tree t = FUNCTION_ARG_CHAIN (d);
11522 if (DECL_CONSTRUCTOR_P (d)
11523 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d)))
11524 t = TREE_CHAIN (t);
11525 if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
11526 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t)))
11527 == DECL_CLASS_CONTEXT (d))
11528 && (TREE_CHAIN (t) == NULL_TREE
11529 || TREE_CHAIN (t) == void_list_node
11530 || TREE_PURPOSE (TREE_CHAIN (t))))
11535 /* These memoizing functions keep track of special properties which
11536 a class may have. `grok_ctor_properties' notices whether a class
11537 has a constructor of the form X(X&), and also complains
11538 if the class has a constructor of the form X(X).
11539 `grok_op_properties' takes notice of the various forms of
11540 operator= which are defined, as well as what sorts of type conversion
11541 may apply. Both functions take a FUNCTION_DECL as an argument. */
11544 grok_ctor_properties (ctype, decl)
11547 tree parmtypes = FUNCTION_ARG_CHAIN (decl);
11548 tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
11550 /* When a type has virtual baseclasses, a magical first int argument is
11551 added to any ctor so we can tell if the class has been initialized
11552 yet. This could screw things up in this function, so we deliberately
11553 ignore the leading int if we're in that situation. */
11554 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype))
11556 my_friendly_assert (parmtypes
11557 && TREE_VALUE (parmtypes) == integer_type_node,
11559 parmtypes = TREE_CHAIN (parmtypes);
11560 parmtype = TREE_VALUE (parmtypes);
11565 A non-template constructor for class X is a copy constructor if
11566 its first parameter is of type X&, const X&, volatile X& or const
11567 volatile X&, and either there are no other parameters or else all
11568 other parameters have default arguments. */
11569 if (TREE_CODE (parmtype) == REFERENCE_TYPE
11570 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype
11571 && (TREE_CHAIN (parmtypes) == NULL_TREE
11572 || TREE_CHAIN (parmtypes) == void_list_node
11573 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11574 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11575 && is_member_template (DECL_TI_TEMPLATE (decl))))
11577 TYPE_HAS_INIT_REF (ctype) = 1;
11578 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11579 TYPE_HAS_CONST_INIT_REF (ctype) = 1;
11583 A declaration of a constructor for a class X is ill-formed if its
11584 first parameter is of type (optionally cv-qualified) X and either
11585 there are no other parameters or else all other parameters have
11588 We *don't* complain about member template instantiations that
11589 have this form, though; they can occur as we try to decide what
11590 constructor to use during overload resolution. Since overload
11591 resolution will never prefer such a constructor to the
11592 non-template copy constructor (which is either explicitly or
11593 implicitly defined), there's no need to worry about their
11594 existence. Theoretically, they should never even be
11595 instantiated, but that's hard to forestall. */
11596 else if (TYPE_MAIN_VARIANT (parmtype) == ctype
11597 && (TREE_CHAIN (parmtypes) == NULL_TREE
11598 || TREE_CHAIN (parmtypes) == void_list_node
11599 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11600 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11601 && is_member_template (DECL_TI_TEMPLATE (decl))))
11603 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11605 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
11608 else if (TREE_CODE (parmtype) == VOID_TYPE
11609 || TREE_PURPOSE (parmtypes) != NULL_TREE)
11610 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1;
11615 /* An operator with this name can be either unary or binary. */
11621 return (name == ansi_opname [(int) INDIRECT_REF]
11622 || name == ansi_opname [(int) ADDR_EXPR]
11623 || name == ansi_opname [(int) NEGATE_EXPR]
11624 || name == ansi_opname[(int) POSTINCREMENT_EXPR]
11625 || name == ansi_opname[(int) POSTDECREMENT_EXPR]
11626 || name == ansi_opname [(int) CONVERT_EXPR]);
11629 /* An operator with this name can only be unary. */
11635 return (name == ansi_opname [(int) TRUTH_NOT_EXPR]
11636 || name == ansi_opname [(int) BIT_NOT_EXPR]
11637 || name == ansi_opname [(int) COMPONENT_REF]
11638 || IDENTIFIER_TYPENAME_P (name));
11641 /* Do a little sanity-checking on how they declared their operator. */
11644 grok_op_properties (decl, virtualp, friendp)
11646 int virtualp, friendp;
11648 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
11649 int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
11650 tree name = DECL_NAME (decl);
11652 if (current_class_type == NULL_TREE)
11659 A user-declared copy assignment operator X::operator= is a
11660 non-static non-template member function of class X with
11661 exactly one parameter of type X, X&, const X&, volatile X& or
11662 const volatile X&. */
11663 if (name == ansi_opname[(int) MODIFY_EXPR]
11664 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11665 && is_member_template (DECL_TI_TEMPLATE (decl))))
11667 else if (name == ansi_opname[(int) CALL_EXPR])
11668 TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
11669 else if (name == ansi_opname[(int) ARRAY_REF])
11670 TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
11671 else if (name == ansi_opname[(int) COMPONENT_REF]
11672 || name == ansi_opname[(int) MEMBER_REF])
11673 TYPE_OVERLOADS_ARROW (current_class_type) = 1;
11674 else if (name == ansi_opname[(int) NEW_EXPR])
11675 TYPE_GETS_NEW (current_class_type) |= 1;
11676 else if (name == ansi_opname[(int) DELETE_EXPR])
11677 TYPE_GETS_DELETE (current_class_type) |= 1;
11678 else if (name == ansi_opname[(int) VEC_NEW_EXPR])
11679 TYPE_GETS_NEW (current_class_type) |= 2;
11680 else if (name == ansi_opname[(int) VEC_DELETE_EXPR])
11681 TYPE_GETS_DELETE (current_class_type) |= 2;
11684 if (name == ansi_opname[(int) NEW_EXPR]
11685 || name == ansi_opname[(int) VEC_NEW_EXPR])
11687 /* When the compiler encounters the definition of A::operator new, it
11688 doesn't look at the class declaration to find out if it's static. */
11690 revert_static_member_fn (&decl, NULL, NULL);
11692 /* Take care of function decl if we had syntax errors. */
11693 if (argtypes == NULL_TREE)
11695 = build_function_type (ptr_type_node,
11696 hash_tree_chain (integer_type_node,
11699 TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
11701 else if (name == ansi_opname[(int) DELETE_EXPR]
11702 || name == ansi_opname[(int) VEC_DELETE_EXPR])
11705 revert_static_member_fn (&decl, NULL, NULL);
11707 if (argtypes == NULL_TREE)
11709 = build_function_type (void_type_node,
11710 hash_tree_chain (ptr_type_node,
11714 TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
11716 if (! friendp && name == ansi_opname[(int) VEC_DELETE_EXPR]
11717 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)))
11718 != void_list_node))
11719 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type) = 1;
11724 /* An operator function must either be a non-static member function
11725 or have at least one parameter of a class, a reference to a class,
11726 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11727 if (! methodp || DECL_STATIC_FUNCTION_P (decl))
11729 if (IDENTIFIER_TYPENAME_P (name)
11730 || name == ansi_opname[(int) CALL_EXPR]
11731 || name == ansi_opname[(int) MODIFY_EXPR]
11732 || name == ansi_opname[(int) COMPONENT_REF]
11733 || name == ansi_opname[(int) ARRAY_REF])
11734 cp_error ("`%D' must be a nonstatic member function", decl);
11739 if (DECL_STATIC_FUNCTION_P (decl))
11740 cp_error ("`%D' must be either a non-static member function or a non-member function", decl);
11743 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
11745 tree arg = TREE_VALUE (p);
11746 if (TREE_CODE (arg) == REFERENCE_TYPE)
11747 arg = TREE_TYPE (arg);
11749 /* This lets bad template code slip through. */
11750 if (IS_AGGR_TYPE (arg)
11751 || TREE_CODE (arg) == ENUMERAL_TYPE
11752 || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
11753 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
11757 ("`%D' must have an argument of class or enumerated type",
11764 if (name == ansi_opname[(int) CALL_EXPR])
11765 return; /* No restrictions on args. */
11767 if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
11769 tree t = TREE_TYPE (name);
11770 if (TREE_CODE (t) == VOID_TYPE)
11771 pedwarn ("void is not a valid type conversion operator");
11772 else if (! friendp)
11774 int ref = (TREE_CODE (t) == REFERENCE_TYPE);
11775 const char *what = 0;
11777 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
11779 if (t == current_class_type)
11780 what = "the same type";
11781 /* Don't force t to be complete here. */
11782 else if (IS_AGGR_TYPE (t)
11784 && DERIVED_FROM_P (t, current_class_type))
11785 what = "a base class";
11788 warning ("conversion to %s%s will never use a type conversion operator",
11789 ref ? "a reference to " : "", what);
11793 if (name == ansi_opname[(int) MODIFY_EXPR])
11797 if (list_length (argtypes) != 3 && methodp)
11799 cp_error ("`%D' must take exactly one argument", decl);
11802 parmtype = TREE_VALUE (TREE_CHAIN (argtypes));
11804 if (copy_assignment_arg_p (parmtype, virtualp)
11807 TYPE_HAS_ASSIGN_REF (current_class_type) = 1;
11808 if (TREE_CODE (parmtype) != REFERENCE_TYPE
11809 || CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11810 TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1;
11813 else if (name == ansi_opname[(int) COND_EXPR])
11816 cp_error ("ANSI C++ prohibits overloading operator ?:");
11818 else if (ambi_op_p (name))
11820 if (list_length (argtypes) == 2)
11822 else if (list_length (argtypes) == 3)
11824 if ((name == ansi_opname[(int) POSTINCREMENT_EXPR]
11825 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
11826 && ! processing_template_decl
11827 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
11830 cp_error ("postfix `%D' must take `int' as its argument",
11834 ("postfix `%D' must take `int' as its second argument",
11841 cp_error ("`%D' must take either zero or one argument", decl);
11843 cp_error ("`%D' must take either one or two arguments", decl);
11846 /* More Effective C++ rule 6. */
11848 && (name == ansi_opname[(int) POSTINCREMENT_EXPR]
11849 || name == ansi_opname[(int) POSTDECREMENT_EXPR]))
11851 tree arg = TREE_VALUE (argtypes);
11852 tree ret = TREE_TYPE (TREE_TYPE (decl));
11853 if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
11854 arg = TREE_TYPE (arg);
11855 arg = TYPE_MAIN_VARIANT (arg);
11856 if (list_length (argtypes) == 2)
11858 if (TREE_CODE (ret) != REFERENCE_TYPE
11859 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
11861 cp_warning ("prefix `%D' should return `%T'", decl,
11862 build_reference_type (arg));
11866 if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
11867 cp_warning ("postfix `%D' should return `%T'", decl, arg);
11871 else if (unary_op_p (name))
11873 if (list_length (argtypes) != 2)
11876 cp_error ("`%D' must take `void'", decl);
11878 cp_error ("`%D' must take exactly one argument", decl);
11881 else /* if (binary_op_p (name)) */
11883 if (list_length (argtypes) != 3)
11886 cp_error ("`%D' must take exactly one argument", decl);
11888 cp_error ("`%D' must take exactly two arguments", decl);
11891 /* More Effective C++ rule 7. */
11893 && (name == ansi_opname [TRUTH_ANDIF_EXPR]
11894 || name == ansi_opname [TRUTH_ORIF_EXPR]
11895 || name == ansi_opname [COMPOUND_EXPR]))
11896 cp_warning ("user-defined `%D' always evaluates both arguments",
11900 /* Effective C++ rule 23. */
11902 && list_length (argtypes) == 3
11903 && (name == ansi_opname [PLUS_EXPR]
11904 || name == ansi_opname [MINUS_EXPR]
11905 || name == ansi_opname [TRUNC_DIV_EXPR]
11906 || name == ansi_opname [MULT_EXPR])
11907 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
11908 cp_warning ("`%D' should return by value", decl);
11912 for (; argtypes != void_list_node ; argtypes = TREE_CHAIN (argtypes))
11913 if (TREE_PURPOSE (argtypes))
11915 TREE_PURPOSE (argtypes) = NULL_TREE;
11916 if (name == ansi_opname[(int) POSTINCREMENT_EXPR]
11917 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
11920 cp_pedwarn ("`%D' cannot have default arguments", decl);
11923 cp_error ("`%D' cannot have default arguments", decl);
11928 static const char *
11930 enum tag_types code;
11943 my_friendly_abort (981122);
11947 /* Get the struct, enum or union (CODE says which) with tag NAME.
11948 Define the tag as a forward-reference if it is not defined.
11950 C++: If a class derivation is given, process it here, and report
11951 an error if multiple derivation declarations are not identical.
11953 If this is a definition, come in through xref_tag and only look in
11954 the current frame for the name (since C++ allows new names in any
11958 xref_tag (code_type_node, name, globalize)
11959 tree code_type_node;
11963 enum tag_types tag_code;
11964 enum tree_code code;
11966 register tree ref, t;
11967 struct binding_level *b = current_binding_level;
11969 tree attributes = NULL_TREE;
11970 tree context = NULL_TREE;
11972 /* If we are called from the parser, code_type_node will sometimes be a
11973 TREE_LIST. This indicates that the user wrote
11974 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11976 if (TREE_CODE (code_type_node) == TREE_LIST)
11978 attributes = TREE_PURPOSE (code_type_node);
11979 code_type_node = TREE_VALUE (code_type_node);
11982 tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
11987 code = RECORD_TYPE;
11993 code = ENUMERAL_TYPE;
11996 my_friendly_abort (18);
11999 /* If a cross reference is requested, look up the type
12000 already defined for this tag and return it. */
12001 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
12004 name = TYPE_IDENTIFIER (t);
12008 t = IDENTIFIER_TYPE_VALUE (name);
12010 if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12011 && TREE_CODE (t) != TEMPLATE_TEMPLATE_PARM)
12016 /* If we know we are defining this tag, only look it up in
12017 this scope and don't try to find it as a type. */
12018 ref = lookup_tag (code, name, b, 1);
12024 /* [dcl.type.elab] If the identifier resolves to a
12025 typedef-name or a template type-parameter, the
12026 elaborated-type-specifier is ill-formed. */
12027 if (t != TYPE_MAIN_VARIANT (t)
12028 || (CLASS_TYPE_P (t) && TYPE_WAS_ANONYMOUS (t)))
12029 cp_pedwarn ("using typedef-name `%D' after `%s'",
12030 TYPE_NAME (t), tag_name (tag_code));
12031 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
12032 cp_error ("using template type parameter `%T' after `%s'",
12033 t, tag_name (tag_code));
12038 ref = lookup_tag (code, name, b, 0);
12042 /* Try finding it as a type declaration. If that wins,
12044 ref = lookup_name (name, 1);
12046 if (ref != NULL_TREE
12047 && processing_template_decl
12048 && DECL_CLASS_TEMPLATE_P (ref)
12049 && template_class_depth (current_class_type) == 0)
12050 /* Since GLOBALIZE is true, we're declaring a global
12051 template, so we want this type. */
12052 ref = DECL_RESULT (ref);
12054 if (ref && TREE_CODE (ref) == TYPE_DECL
12055 && TREE_CODE (TREE_TYPE (ref)) == code)
12056 ref = TREE_TYPE (ref);
12061 if (ref && current_class_type
12062 && template_class_depth (current_class_type)
12063 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12065 /* Since GLOBALIZE is non-zero, we are not looking at a
12066 definition of this tag. Since, in addition, we are currently
12067 processing a (member) template declaration of a template
12068 class, we must be very careful; consider:
12075 { template <class V>
12076 friend struct S1; };
12078 Here, the S2::S1 declaration should not be confused with the
12079 outer declaration. In particular, the inner version should
12080 have a template parameter of level 2, not level 1. This
12081 would be particularly important if the member declaration
12084 template <class V = U> friend struct S1;
12086 say, when we should tsubst into `U' when instantiating
12087 S2. On the other hand, when presented with:
12097 we must find the inner binding eventually. We
12098 accomplish this by making sure that the new type we
12099 create to represent this declaration has the right
12101 context = TYPE_CONTEXT (ref);
12106 push_obstacks_nochange ();
12110 /* If no such tag is yet defined, create a forward-reference node
12111 and record it as the "definition".
12112 When a real declaration of this type is found,
12113 the forward-reference will be altered into a real type. */
12115 /* In C++, since these migrate into the global scope, we must
12116 build them on the permanent obstack. */
12118 temp = allocation_temporary_p ();
12120 end_temporary_allocation ();
12122 if (code == ENUMERAL_TYPE)
12124 cp_error ("use of enum `%#D' without previous declaration", name);
12126 ref = make_node (ENUMERAL_TYPE);
12128 /* Give the type a default layout like unsigned int
12129 to avoid crashing if it does not get defined. */
12130 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12131 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12132 TREE_UNSIGNED (ref) = 1;
12133 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12134 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12135 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12137 /* Enable us to recognize when a type is created in class context.
12138 To do nested classes correctly, this should probably be cleared
12139 out when we leave this classes scope. Currently this in only
12140 done in `start_enum'. */
12142 pushtag (name, ref, globalize);
12146 struct binding_level *old_b = class_binding_level;
12148 ref = make_lang_type (code);
12149 TYPE_CONTEXT (ref) = context;
12151 #ifdef NONNESTED_CLASSES
12152 /* Class types don't nest the way enums do. */
12153 class_binding_level = (struct binding_level *)0;
12155 pushtag (name, ref, globalize);
12156 class_binding_level = old_b;
12161 /* If it no longer looks like a nested type, make sure it's
12163 If it is not an IDENTIFIER, this is not a declaration */
12164 if (b->namespace_p && !class_binding_level
12165 && TREE_CODE (name) == IDENTIFIER_NODE
12166 && IDENTIFIER_NAMESPACE_VALUE (name) == NULL_TREE)
12167 SET_IDENTIFIER_NAMESPACE_VALUE (name, TYPE_NAME (ref));
12169 if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12170 redeclare_class_template (ref, current_template_parms);
12173 /* Until the type is defined, tentatively accept whatever
12174 structure tag the user hands us. */
12175 if (TYPE_SIZE (ref) == NULL_TREE
12176 && ref != current_class_type
12177 /* Have to check this, in case we have contradictory tag info. */
12178 && IS_AGGR_TYPE_CODE (TREE_CODE (ref)))
12180 if (tag_code == class_type)
12181 CLASSTYPE_DECLARED_CLASS (ref) = 1;
12182 else if (tag_code == record_type)
12183 CLASSTYPE_DECLARED_CLASS (ref) = 0;
12188 TREE_TYPE (ref) = attributes;
12194 xref_tag_from_type (old, id, globalize)
12198 tree code_type_node;
12200 if (TREE_CODE (old) == RECORD_TYPE)
12201 code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12202 ? class_type_node : record_type_node);
12204 code_type_node = union_type_node;
12206 if (id == NULL_TREE)
12207 id = TYPE_IDENTIFIER (old);
12209 return xref_tag (code_type_node, id, globalize);
12212 /* REF is a type (named NAME), for which we have just seen some
12213 baseclasses. BINFO is a list of those baseclasses; the
12214 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12215 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12216 struct, or union. */
12219 xref_basetypes (code_type_node, name, ref, binfo)
12220 tree code_type_node;
12224 /* In the declaration `A : X, Y, ... Z' we mark all the types
12225 (A, X, Y, ..., Z) so we can check for duplicates. */
12230 enum tag_types tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
12232 if (tag_code == union_type)
12234 cp_error ("derived union `%T' invalid", ref);
12238 len = list_length (binfo);
12239 push_obstacks (TYPE_OBSTACK (ref), TYPE_OBSTACK (ref));
12241 /* First, make sure that any templates in base-classes are
12242 instantiated. This ensures that if we call ourselves recursively
12243 we do not get confused about which classes are marked and which
12245 for (base = binfo; base; base = TREE_CHAIN (base))
12246 complete_type (TREE_VALUE (base));
12248 SET_CLASSTYPE_MARKED (ref);
12249 BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
12251 for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
12253 /* The base of a derived struct is public by default. */
12255 = (TREE_PURPOSE (binfo) == access_public_node
12256 || TREE_PURPOSE (binfo) == access_public_virtual_node
12257 || (tag_code != class_type
12258 && (TREE_PURPOSE (binfo) == access_default_node
12259 || TREE_PURPOSE (binfo) == access_default_virtual_node)));
12261 = (TREE_PURPOSE (binfo) == access_protected_node
12262 || TREE_PURPOSE (binfo) == access_protected_virtual_node);
12264 = (TREE_PURPOSE (binfo) == access_private_virtual_node
12265 || TREE_PURPOSE (binfo) == access_protected_virtual_node
12266 || TREE_PURPOSE (binfo) == access_public_virtual_node
12267 || TREE_PURPOSE (binfo) == access_default_virtual_node);
12268 tree basetype = TREE_VALUE (binfo);
12271 if (basetype && TREE_CODE (basetype) == TYPE_DECL)
12272 basetype = TREE_TYPE (basetype);
12274 || (TREE_CODE (basetype) != RECORD_TYPE
12275 && TREE_CODE (basetype) != TYPENAME_TYPE
12276 && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
12277 && TREE_CODE (basetype) != TEMPLATE_TEMPLATE_PARM))
12279 cp_error ("base type `%T' fails to be a struct or class type",
12280 TREE_VALUE (binfo));
12284 GNU_xref_hier (name, basetype, via_public, via_virtual, 0);
12286 /* This code replaces similar code in layout_basetypes.
12287 We put the complete_type first for implicit `typename'. */
12288 if (TYPE_SIZE (basetype) == NULL_TREE
12289 && ! (current_template_parms && uses_template_parms (basetype)))
12291 cp_error ("base class `%T' has incomplete type", basetype);
12296 if (CLASSTYPE_MARKED (basetype))
12298 if (basetype == ref)
12299 cp_error ("recursive type `%T' undefined", basetype);
12301 cp_error ("duplicate base type `%T' invalid", basetype);
12305 if (TYPE_FOR_JAVA (basetype)
12306 && (current_lang_stack
12307 == &VARRAY_TREE (current_lang_base, 0)))
12308 TYPE_FOR_JAVA (ref) = 1;
12310 /* Note that the BINFO records which describe individual
12311 inheritances are *not* shared in the lattice! They
12312 cannot be shared because a given baseclass may be
12313 inherited with different `accessibility' by different
12314 derived classes. (Each BINFO record describing an
12315 individual inheritance contains flags which say what
12316 the `accessibility' of that particular inheritance is.) */
12319 = make_binfo (integer_zero_node, basetype,
12320 CLASS_TYPE_P (basetype)
12321 ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
12322 CLASS_TYPE_P (basetype)
12323 ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
12325 TREE_VEC_ELT (binfos, i) = base_binfo;
12326 TREE_VIA_PUBLIC (base_binfo) = via_public;
12327 TREE_VIA_PROTECTED (base_binfo) = via_protected;
12328 TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
12329 BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
12331 /* We need to unshare the binfos now so that lookups during class
12332 definition work. */
12333 unshare_base_binfos (base_binfo);
12335 SET_CLASSTYPE_MARKED (basetype);
12337 /* We are free to modify these bits because they are meaningless
12338 at top level, and BASETYPE is a top-level type. */
12339 if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
12341 TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
12342 TYPE_USES_COMPLEX_INHERITANCE (ref) = 1;
12345 if (CLASS_TYPE_P (basetype))
12347 TYPE_GETS_NEW (ref) |= TYPE_GETS_NEW (basetype);
12348 TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
12355 TREE_VEC_LENGTH (binfos) = i;
12357 BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
12360 TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
12363 tree basetype = BINFO_TYPE (TREE_VEC_ELT (binfos, 0));
12365 if (CLASS_TYPE_P (basetype))
12366 TYPE_USES_MULTIPLE_INHERITANCE (ref)
12367 = TYPE_USES_MULTIPLE_INHERITANCE (basetype);
12370 if (TYPE_USES_MULTIPLE_INHERITANCE (ref))
12371 TYPE_USES_COMPLEX_INHERITANCE (ref) = 1;
12373 /* Unmark all the types. */
12375 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
12376 CLEAR_CLASSTYPE_MARKED (ref);
12378 /* Now that we know all the base-classes, set up the list of virtual
12380 CLASSTYPE_VBASECLASSES (ref) = get_vbase_types (ref);
12386 /* Begin compiling the definition of an enumeration type.
12387 NAME is its name (or null if anonymous).
12388 Returns the type object, as yet incomplete.
12389 Also records info about it so that build_enumerator
12390 may be used to declare the individual values as they are read. */
12396 register tree enumtype = NULL_TREE;
12397 struct binding_level *b = current_binding_level;
12399 /* We are wasting space here and putting these on the permanent_obstack so
12400 that typeid(local enum) will work correctly. */
12401 push_obstacks (&permanent_obstack, &permanent_obstack);
12403 /* If this is the real definition for a previous forward reference,
12404 fill in the contents in the same object that used to be the
12405 forward reference. */
12407 if (name != NULL_TREE)
12408 enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
12410 if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
12412 cp_error ("multiple definition of `%#T'", enumtype);
12413 cp_error_at ("previous definition here", enumtype);
12417 enumtype = make_node (ENUMERAL_TYPE);
12418 pushtag (name, enumtype, 0);
12421 if (current_class_type)
12422 TREE_ADDRESSABLE (b->tags) = 1;
12424 /* We don't copy this value because build_enumerator needs to do it. */
12425 enum_next_value = integer_zero_node;
12428 GNU_xref_decl (current_function_decl, enumtype);
12432 /* After processing and defining all the values of an enumeration type,
12433 install their decls in the enumeration type and finish it off.
12434 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12435 Returns ENUMTYPE. */
12438 finish_enum (enumtype)
12441 register tree minnode = NULL_TREE, maxnode = NULL_TREE;
12442 /* Calculate the maximum value of any enumerator in this type. */
12444 tree values = TYPE_VALUES (enumtype);
12449 for (pair = values; pair; pair = TREE_CHAIN (pair))
12454 /* The TREE_VALUE is a CONST_DECL for this enumeration
12456 decl = TREE_VALUE (pair);
12458 /* The DECL_INITIAL will be NULL if we are processing a
12459 template declaration and this enumeration constant had no
12460 explicit initializer. */
12461 value = DECL_INITIAL (decl);
12462 if (value && !processing_template_decl)
12464 /* Set the TREE_TYPE for the VALUE as well. That's so
12465 that when we call decl_constant_value we get an
12466 entity of the right type (but with the constant
12467 value). Since we shouldn't ever call
12468 decl_constant_value on a template type, there's no
12469 reason to do that when processing_template_decl.
12470 And, if the expression is something like a
12471 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12472 wreak havoc on the intended type of the expression.
12474 Of course, there's also no point in trying to compute
12475 minimum or maximum values if we're in a template. */
12476 TREE_TYPE (value) = enumtype;
12479 minnode = maxnode = value;
12480 else if (tree_int_cst_lt (maxnode, value))
12482 else if (tree_int_cst_lt (value, minnode))
12486 if (processing_template_decl)
12487 /* If this is just a template, leave the CONST_DECL
12488 alone. That way tsubst_copy will find CONST_DECLs for
12489 CONST_DECLs, and not INTEGER_CSTs. */
12492 /* In the list we're building up, we want the enumeration
12493 values, not the CONST_DECLs. */
12494 TREE_VALUE (pair) = value;
12498 maxnode = minnode = integer_zero_node;
12500 TYPE_VALUES (enumtype) = nreverse (values);
12502 if (processing_template_decl)
12504 tree scope = current_scope ();
12505 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12506 add_tree (build_min (TAG_DEFN, enumtype));
12510 int unsignedp = tree_int_cst_sgn (minnode) >= 0;
12511 int lowprec = min_precision (minnode, unsignedp);
12512 int highprec = min_precision (maxnode, unsignedp);
12513 int precision = MAX (lowprec, highprec);
12516 TYPE_SIZE (enumtype) = NULL_TREE;
12518 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12520 TYPE_PRECISION (enumtype) = precision;
12522 fixup_unsigned_type (enumtype);
12524 fixup_signed_type (enumtype);
12526 if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
12527 /* Use the width of the narrowest normal C type which is wide
12529 TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
12532 TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
12534 TYPE_SIZE (enumtype) = 0;
12535 layout_type (enumtype);
12537 /* Fix up all variant types of this enum type. */
12538 for (tem = TYPE_MAIN_VARIANT (enumtype); tem;
12539 tem = TYPE_NEXT_VARIANT (tem))
12541 TYPE_VALUES (tem) = TYPE_VALUES (enumtype);
12542 TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype);
12543 TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype);
12544 TYPE_SIZE (tem) = TYPE_SIZE (enumtype);
12545 TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype);
12546 TYPE_MODE (tem) = TYPE_MODE (enumtype);
12547 TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype);
12548 TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype);
12549 TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype);
12552 /* Finish debugging output for this type. */
12553 rest_of_type_compilation (enumtype, namespace_bindings_p ());
12556 /* In start_enum we pushed obstacks. Here, we must pop them. */
12562 /* Build and install a CONST_DECL for an enumeration constant of the
12563 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12564 Assignment of sequential values by default is handled here. */
12567 build_enumerator (name, value, type)
12575 /* Remove no-op casts from the value. */
12577 STRIP_TYPE_NOPS (value);
12579 if (! processing_template_decl)
12581 /* Validate and default VALUE. */
12582 if (value != NULL_TREE)
12584 if (TREE_READONLY_DECL_P (value))
12585 value = decl_constant_value (value);
12587 if (TREE_CODE (value) == INTEGER_CST)
12589 value = default_conversion (value);
12590 constant_expression_warning (value);
12594 cp_error ("enumerator value for `%D' not integer constant", name);
12599 /* Default based on previous value. */
12600 if (value == NULL_TREE && ! processing_template_decl)
12602 value = enum_next_value;
12604 cp_error ("overflow in enumeration values at `%D'", name);
12607 /* Remove no-op casts from the value. */
12609 STRIP_TYPE_NOPS (value);
12611 /* To fix MAX_VAL enum consts. (bkoz) */
12612 TREE_TYPE (value) = integer_type_node;
12616 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12617 Even in other cases, we will later (in finish_enum) be setting the
12619 if (value != NULL_TREE)
12620 value = copy_node (value);
12622 /* C++ associates enums with global, function, or class declarations. */
12624 context = current_scope ();
12625 if (context && context == current_class_type)
12626 /* This enum declaration is local to the class. */
12627 decl = build_lang_decl (CONST_DECL, name, type);
12629 /* It's a global enum, or it's local to a function. (Note local to
12630 a function could mean local to a class method. */
12631 decl = build_decl (CONST_DECL, name, type);
12633 DECL_CONTEXT (decl) = FROB_CONTEXT (context);
12634 DECL_INITIAL (decl) = value;
12635 TREE_READONLY (decl) = 1;
12637 if (context && context == current_class_type)
12638 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12639 on the TYPE_FIELDS list for `S'. (That's so that you can say
12640 things like `S::i' later.) */
12641 finish_member_declaration (decl);
12645 GNU_xref_decl (current_function_decl, decl);
12648 if (! processing_template_decl)
12650 /* Set basis for default for next value. */
12651 enum_next_value = build_binary_op_nodefault (PLUS_EXPR, value,
12652 integer_one_node, PLUS_EXPR);
12653 enum_overflow = tree_int_cst_lt (enum_next_value, value);
12656 result = tree_cons (name, decl, NULL_TREE);
12661 static int function_depth;
12663 /* We're defining DECL. Make sure that it's type is OK. */
12666 check_function_type (decl)
12669 tree fntype = TREE_TYPE (decl);
12671 /* In a function definition, arg types must be complete. */
12672 require_complete_types_for_parms (current_function_parms);
12674 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype))) == NULL_TREE)
12676 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype));
12678 /* Make it return void instead, but don't change the
12679 type of the DECL_RESULT, in case we have a named return value. */
12680 if (TREE_CODE (fntype) == METHOD_TYPE)
12682 tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
12684 = build_cplus_method_type (ctype,
12686 FUNCTION_ARG_CHAIN (decl));
12690 = build_function_type (void_type_node,
12691 TYPE_ARG_TYPES (TREE_TYPE (decl)));
12693 = build_exception_variant (fntype,
12694 TYPE_RAISES_EXCEPTIONS (fntype));
12697 abstract_virtuals_error (decl, TREE_TYPE (fntype));
12700 /* Create the FUNCTION_DECL for a function definition.
12701 DECLSPECS and DECLARATOR are the parts of the declaration;
12702 they describe the function's name and the type it returns,
12703 but twisted together in a fashion that parallels the syntax of C.
12705 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12706 DECLARATOR is really the DECL for the function we are about to
12707 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12708 indicating that the function is an inline defined in-class, and
12709 SF_EXPAND indicating that we should generate RTL for this
12712 This function creates a binding context for the function body
12713 as well as setting up the FUNCTION_DECL in current_function_decl.
12715 Returns 1 on success. If the DECLARATOR is not suitable for a function
12716 (it defines a datum instead), we return 0, which tells
12717 yyparse to report a parse error.
12719 For C++, we must first check whether that datum makes any sense.
12720 For example, "class A local_a(1,2);" means that variable local_a
12721 is an aggregate of type A, which should have a constructor
12722 applied to it with the argument list [1, 2]. */
12725 start_function (declspecs, declarator, attrs, flags)
12726 tree declspecs, declarator, attrs;
12730 tree ctype = NULL_TREE;
12733 extern int have_extern_spec;
12734 extern int used_extern_spec;
12735 int doing_friend = 0;
12736 struct binding_level *bl;
12738 /* Sanity check. */
12739 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
12740 my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
12742 /* This should only be done once on the top most decl. */
12743 if (have_extern_spec && !used_extern_spec)
12745 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
12746 used_extern_spec = 1;
12749 if (flags & SF_PRE_PARSED)
12751 decl1 = declarator;
12753 fntype = TREE_TYPE (decl1);
12754 if (TREE_CODE (fntype) == METHOD_TYPE)
12755 ctype = TYPE_METHOD_BASETYPE (fntype);
12757 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12758 class is in the (lexical) scope of the class in which it is
12760 if (!ctype && DECL_FRIEND_P (decl1))
12762 ctype = DECL_CLASS_CONTEXT (decl1);
12764 /* CTYPE could be null here if we're dealing with a template;
12765 for example, `inline friend float foo()' inside a template
12766 will have no CTYPE set. */
12767 if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
12773 last_function_parms = DECL_ARGUMENTS (decl1);
12774 last_function_parm_tags = NULL_TREE;
12778 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE);
12779 /* If the declarator is not suitable for a function definition,
12780 cause a syntax error. */
12781 if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0;
12783 fntype = TREE_TYPE (decl1);
12785 restype = TREE_TYPE (fntype);
12786 if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
12788 cp_error ("semicolon missing after declaration of `%#T'", restype);
12789 shadow_tag (build_expr_list (NULL_TREE, restype));
12790 CLASSTYPE_GOT_SEMICOLON (restype) = 1;
12791 if (TREE_CODE (fntype) == FUNCTION_TYPE)
12792 fntype = build_function_type (integer_type_node,
12793 TYPE_ARG_TYPES (fntype));
12795 fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
12797 TYPE_ARG_TYPES (fntype));
12798 TREE_TYPE (decl1) = fntype;
12801 if (TREE_CODE (fntype) == METHOD_TYPE)
12802 ctype = TYPE_METHOD_BASETYPE (fntype);
12803 else if (DECL_MAIN_P (decl1))
12805 /* If this doesn't return integer_type, complain. */
12806 if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
12808 if (pedantic || warn_return_type)
12809 pedwarn ("return type for `main' changed to `int'");
12810 TREE_TYPE (decl1) = fntype = default_function_type;
12815 /* Sometimes we don't notice that a function is a static member, and
12816 build a METHOD_TYPE for it. Fix that up now. */
12817 if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1)
12818 && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE)
12820 revert_static_member_fn (&decl1, NULL, NULL);
12821 last_function_parms = TREE_CHAIN (last_function_parms);
12825 /* Warn if function was previously implicitly declared
12826 (but not if we warned then). */
12827 if (! warn_implicit
12828 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
12829 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
12831 /* Set up current_class_type, and enter the scope of the class, if
12834 push_nested_class (ctype, 1);
12835 else if (DECL_STATIC_FUNCTION_P (decl1))
12836 push_nested_class (DECL_CONTEXT (decl1), 2);
12838 /* Now that we have entered the scope of the class, we must restore
12839 the bindings for any template parameters surrounding DECL1, if it
12840 is an inline member template. (Order is important; consider the
12841 case where a template parameter has the same name as a field of
12842 the class.) It is not until after this point that
12843 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12844 if (flags & SF_INCLASS_INLINE)
12845 maybe_begin_member_template_processing (decl1);
12847 /* Effective C++ rule 15. See also c_expand_return. */
12849 && DECL_NAME (decl1) == ansi_opname[(int) MODIFY_EXPR]
12850 && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
12851 cp_warning ("`operator=' should return a reference to `*this'");
12853 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12854 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12855 if (!DECL_INITIAL (decl1))
12856 DECL_INITIAL (decl1) = error_mark_node;
12858 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12859 SET_DEFAULT_DECL_ATTRIBUTES (decl1, attrs);
12862 /* This function exists in static storage.
12863 (This does not mean `static' in the C sense!) */
12864 TREE_STATIC (decl1) = 1;
12866 /* We must call push_template_decl after current_class_type is set
12867 up. (If we are processing inline definitions after exiting a
12868 class scope, current_class_type will be NULL_TREE until set above
12869 by push_nested_class.) */
12870 if (processing_template_decl)
12871 decl1 = push_template_decl (decl1);
12873 /* We are now in the scope of the function being defined. */
12874 current_function_decl = decl1;
12876 /* Save the parm names or decls from this function's declarator
12877 where store_parm_decls will find them. */
12878 current_function_parms = last_function_parms;
12879 current_function_parm_tags = last_function_parm_tags;
12881 /* Make sure the parameter and return types are reasonable. When
12882 you declare a function, these types can be incomplete, but they
12883 must be complete when you define the function. */
12884 if (! processing_template_decl)
12885 check_function_type (decl1);
12887 /* Build the return declaration for the function. */
12888 restype = TREE_TYPE (fntype);
12889 if (!processing_template_decl)
12891 if (!DECL_RESULT (decl1))
12893 DECL_RESULT (decl1)
12894 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
12895 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype),
12896 DECL_RESULT (decl1));
12900 /* Just use `void'. Nobody will ever look at this anyhow. */
12901 DECL_RESULT (decl1) = build_decl (RESULT_DECL, 0, void_type_node);
12903 /* Initialize RTL machinery. We cannot do this until
12904 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12905 even when processing a template; this is how we get
12906 CURRENT_FUNCTION set up, and our per-function variables
12908 bl = current_binding_level;
12909 init_function_start (decl1, input_filename, lineno);
12910 current_binding_level = bl;
12911 expanding_p = (flags & SF_EXPAND) != 0;
12913 /* Even though we're inside a function body, we still don't want to
12914 call expand_expr to calculate the size of a variable-sized array.
12915 We haven't necessarily assigned RTL to all variables yet, so it's
12916 not safe to try to expand expressions involving them. */
12917 immediate_size_expand = 0;
12918 current_function->x_dont_save_pending_sizes_p = 1;
12920 /* Let the user know we're compiling this function. */
12921 if (processing_template_decl || !building_stmt_tree ())
12922 announce_function (decl1);
12924 /* Record the decl so that the function name is defined.
12925 If we already have a decl for this name, and it is a FUNCTION_DECL,
12926 use the old decl. */
12927 if (!processing_template_decl && !(flags & SF_PRE_PARSED))
12929 /* A specialization is not used to guide overload resolution. */
12930 if ((flag_guiding_decls
12931 || !DECL_TEMPLATE_SPECIALIZATION (decl1))
12932 && ! DECL_FUNCTION_MEMBER_P (decl1))
12933 decl1 = pushdecl (decl1);
12936 /* We need to set the DECL_CONTEXT. */
12937 if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
12938 DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
12939 /* And make sure we have enough default args. */
12940 check_default_args (decl1);
12942 DECL_MAIN_VARIANT (decl1) = decl1;
12943 fntype = TREE_TYPE (decl1);
12946 /* Reset these in case the call to pushdecl changed them. */
12947 current_function_decl = decl1;
12948 current_function->decl = decl1;
12950 /* Initialize the per-function data. */
12951 if (!DECL_PENDING_INLINE_P (decl1) && DECL_SAVED_FUNCTION_DATA (decl1))
12953 /* If we already parsed this function, and we're just expanding it
12954 now, restore saved state. */
12955 struct binding_level *bl = current_binding_level;
12956 *cp_function_chain = *DECL_SAVED_FUNCTION_DATA (decl1);
12957 current_binding_level = bl;
12959 /* This function is being processed in whole-function mode; we
12960 already did semantic analysis. */
12961 current_function->x_whole_function_mode_p = 1;
12963 /* If we decided that we didn't want to inline this function,
12964 make sure the back-end knows that. */
12965 if (!current_function_cannot_inline)
12966 current_function_cannot_inline = cp_function_chain->cannot_inline;
12968 /* We don't need the saved data anymore. */
12969 free (DECL_SAVED_FUNCTION_DATA (decl1));
12970 DECL_SAVED_FUNCTION_DATA (decl1) = NULL;
12972 else if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1))
12974 /* We know that this was set up by `grokclassfn'. We do not
12975 wait until `store_parm_decls', since evil parse errors may
12976 never get us to that point. Here we keep the consistency
12977 between `current_class_type' and `current_class_ptr'. */
12978 tree t = DECL_ARGUMENTS (decl1);
12980 my_friendly_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL,
12982 my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE,
12985 cp_function_chain->x_current_class_ref
12986 = build_indirect_ref (t, NULL_PTR);
12987 cp_function_chain->x_current_class_ptr = t;
12989 if (DECL_DESTRUCTOR_P (decl1))
12990 current_in_charge_parm = TREE_CHAIN (t);
12993 if (DECL_INTERFACE_KNOWN (decl1))
12995 tree ctx = hack_decl_function_context (decl1);
12997 if (DECL_NOT_REALLY_EXTERN (decl1))
12998 DECL_EXTERNAL (decl1) = 0;
13000 if (ctx != NULL_TREE && DECL_THIS_INLINE (ctx)
13001 && TREE_PUBLIC (ctx))
13002 /* This is a function in a local class in an extern inline
13004 comdat_linkage (decl1);
13006 /* If this function belongs to an interface, it is public.
13007 If it belongs to someone else's interface, it is also external.
13008 This only affects inlines and template instantiations. */
13009 else if (interface_unknown == 0
13010 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13011 || flag_alt_external_templates))
13013 if (DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1)
13014 || processing_template_decl)
13016 DECL_EXTERNAL (decl1)
13018 || (DECL_THIS_INLINE (decl1) && ! flag_implement_inlines
13019 && !DECL_VINDEX (decl1)));
13021 /* For WIN32 we also want to put these in linkonce sections. */
13022 maybe_make_one_only (decl1);
13025 DECL_EXTERNAL (decl1) = 0;
13026 DECL_NOT_REALLY_EXTERN (decl1) = 0;
13027 DECL_INTERFACE_KNOWN (decl1) = 1;
13029 else if (interface_unknown && interface_only
13030 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13031 || flag_alt_external_templates))
13033 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13034 interface, we will have interface_only set but not
13035 interface_known. In that case, we don't want to use the normal
13036 heuristics because someone will supply a #pragma implementation
13037 elsewhere, and deducing it here would produce a conflict. */
13038 comdat_linkage (decl1);
13039 DECL_EXTERNAL (decl1) = 0;
13040 DECL_INTERFACE_KNOWN (decl1) = 1;
13041 DECL_DEFER_OUTPUT (decl1) = 1;
13045 /* This is a definition, not a reference.
13046 So clear DECL_EXTERNAL. */
13047 DECL_EXTERNAL (decl1) = 0;
13049 if ((DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1))
13050 && ! DECL_INTERFACE_KNOWN (decl1)
13051 /* Don't try to defer nested functions for now. */
13052 && ! hack_decl_function_context (decl1))
13053 DECL_DEFER_OUTPUT (decl1) = 1;
13055 DECL_INTERFACE_KNOWN (decl1) = 1;
13058 if (doing_semantic_analysis_p ())
13061 current_binding_level->parm_flag = 1;
13065 cplus_decl_attributes (decl1, NULL_TREE, attrs);
13067 if (!building_stmt_tree ())
13069 GNU_xref_function (decl1, current_function_parms);
13070 make_function_rtl (decl1);
13073 /* Promote the value to int before returning it. */
13074 if (C_PROMOTING_INTEGER_TYPE_P (restype))
13075 restype = type_promotes_to (restype);
13077 /* If this fcn was already referenced via a block-scope `extern' decl
13078 (or an implicit decl), propagate certain information about the usage. */
13079 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1)))
13080 TREE_ADDRESSABLE (decl1) = 1;
13082 if (DECL_RESULT (decl1) == NULL_TREE)
13084 DECL_RESULT (decl1)
13085 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13086 TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype);
13087 TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype);
13090 /* Allocate further tree nodes temporarily during compilation
13091 of this function only. Tiemann moved up here from bottom of fn. */
13092 /* If this is a nested function, then we must continue to allocate RTL
13093 on the permanent obstack in case we need to inline it later. */
13094 if (! hack_decl_function_context (decl1))
13095 temporary_allocation ();
13097 /* Make sure that we always have a momntary obstack while we're in a
13101 if (building_stmt_tree ())
13102 begin_stmt_tree (decl1);
13106 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1))
13107 && DECL_LANGUAGE (decl1) == lang_cplusplus)
13108 dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13109 else if (DECL_CONSTRUCTOR_P (decl1))
13110 ctor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13115 /* Called after store_parm_decls for a function-try-block. We need to update
13116 last_parm_cleanup_insn so that the base initializers for a constructor
13117 are run within this block, not before it. */
13120 expand_start_early_try_stmts ()
13122 expand_start_try_stmts ();
13123 last_parm_cleanup_insn = get_last_insn ();
13126 /* Store the parameter declarations into the current function declaration.
13127 This is called after parsing the parameter declarations, before
13128 digesting the body of the function.
13130 Also install to binding contour return value identifier, if any. */
13133 store_parm_decls ()
13135 register tree fndecl = current_function_decl;
13136 register tree parm;
13137 int parms_have_cleanups = 0;
13138 tree cleanups = NULL_TREE;
13140 /* This is a list of types declared among parms in a prototype. */
13141 tree parmtags = current_function_parm_tags;
13143 /* This is a chain of any other decls that came in among the parm
13144 declarations. If a parm is declared with enum {foo, bar} x;
13145 then CONST_DECLs for foo and bar are put here. */
13146 tree nonparms = NULL_TREE;
13148 /* Create a binding level for the parms. */
13149 if (!building_stmt_tree ())
13150 expand_start_bindings (2);
13152 if (current_function_parms)
13154 /* This case is when the function was defined with an ANSI prototype.
13155 The parms already have decls, so we need not do anything here
13156 except record them as in effect
13157 and complain if any redundant old-style parm decls were written. */
13159 tree specparms = current_function_parms;
13162 if (doing_semantic_analysis_p ())
13164 /* Must clear this because it might contain TYPE_DECLs declared
13166 storedecls (NULL_TREE);
13168 /* If we're doing semantic analysis, then we'll call pushdecl
13169 for each of these. We must do them in reverse order so that
13170 they end in the correct forward order. */
13171 specparms = nreverse (specparms);
13174 for (parm = specparms; parm; parm = next)
13176 next = TREE_CHAIN (parm);
13177 if (TREE_CODE (parm) == PARM_DECL)
13181 if (doing_semantic_analysis_p ())
13183 if (DECL_NAME (parm) == NULL_TREE
13184 || TREE_CODE (TREE_TYPE (parm)) != VOID_TYPE)
13187 cp_error ("parameter `%D' declared void", parm);
13190 if (! building_stmt_tree ()
13191 && (cleanup = maybe_build_cleanup (parm), cleanup))
13193 expand_decl (parm);
13194 parms_have_cleanups = 1;
13196 /* Keep track of the cleanups. */
13197 cleanups = tree_cons (parm, cleanup, cleanups);
13202 /* If we find an enum constant or a type tag,
13203 put it aside for the moment. */
13204 TREE_CHAIN (parm) = NULL_TREE;
13205 nonparms = chainon (nonparms, parm);
13209 if (doing_semantic_analysis_p ())
13211 /* Get the decls in their original chain order
13212 and record in the function. This is all and only the
13213 PARM_DECLs that were pushed into scope by the loop above. */
13214 DECL_ARGUMENTS (fndecl) = getdecls ();
13215 storetags (chainon (parmtags, gettags ()));
13217 /* We built up the cleanups in reversed order. */
13218 cleanups = nreverse (cleanups);
13222 DECL_ARGUMENTS (fndecl) = NULL_TREE;
13224 /* Now store the final chain of decls for the arguments
13225 as the decl-chain of the current lexical scope.
13226 Put the enumerators in as well, at the front so that
13227 DECL_ARGUMENTS is not modified. */
13228 if (doing_semantic_analysis_p ())
13229 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13231 /* Initialize the RTL code for the function. */
13232 DECL_SAVED_INSNS (fndecl) = 0;
13233 if (! building_stmt_tree ())
13234 expand_function_start (fndecl, parms_have_cleanups);
13236 current_function_parms_stored = 1;
13238 /* If this function is `main', emit a call to `__main'
13239 to run global initializers, etc. */
13240 if (DECL_MAIN_P (fndecl) && !building_stmt_tree ())
13241 expand_main_function ();
13243 /* Now that we have initialized the parms, we can start their
13244 cleanups. We cannot do this before, since expand_decl_cleanup
13245 should not be called before the parm can be used. */
13246 if (cleanups && !building_stmt_tree ())
13249 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups),
13250 TREE_VALUE (cleanups)))
13251 cp_error ("parser lost in parsing declaration of `%D'",
13252 TREE_PURPOSE (cleanups));
13254 cleanups = TREE_CHAIN (cleanups);
13257 /* Create a binding contour which can be used to catch
13258 cleanup-generated temporaries. Also, if the return value needs or
13259 has initialization, deal with that now. */
13260 if (parms_have_cleanups)
13263 if (!building_stmt_tree ())
13264 expand_start_bindings (2);
13267 /* Do the starting of the exception specifications, if we have any. */
13268 if (flag_exceptions && !processing_template_decl
13269 && building_stmt_tree ()
13270 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13271 current_eh_spec_try_block = expand_start_eh_spec ();
13273 last_parm_cleanup_insn = get_last_insn ();
13274 last_dtor_insn = get_last_insn ();
13277 /* Bind a name and initialization to the return value of
13278 the current function. */
13281 store_return_init (decl)
13284 /* If this named return value comes in a register, put it in a
13285 pseudo-register. */
13286 if (DECL_REGISTER (decl))
13288 original_result_rtx = DECL_RTL (decl);
13289 DECL_RTL (decl) = gen_reg_rtx (DECL_MODE (decl));
13294 /* We have finished doing semantic analysis on DECL, but have not yet
13295 generated RTL for its body. Save away our current state, so that
13296 when we want to generate RTL later we know what to do. */
13299 save_function_data (decl)
13302 struct language_function *f;
13304 /* Save the language-specific per-function data so that we can
13305 get it back when we really expand this function. */
13306 my_friendly_assert (!DECL_PENDING_INLINE_P (decl),
13310 f = ((struct language_function *)
13311 xmalloc (sizeof (struct language_function)));
13312 bcopy ((char *) cp_function_chain, (char *) f,
13313 sizeof (struct language_function));
13314 DECL_SAVED_FUNCTION_DATA (decl) = f;
13316 /* Clear out the bits we don't need. */
13317 f->x_base_init_list = NULL_TREE;
13318 f->x_member_init_list = NULL_TREE;
13319 f->x_last_tree = NULL_TREE;
13320 f->x_last_expr_type = NULL_TREE;
13321 f->x_last_dtor_insn = NULL_RTX;
13322 f->x_last_parm_cleanup_insn = NULL_RTX;
13323 f->x_result_rtx = NULL_RTX;
13324 f->x_named_label_uses = NULL;
13325 f->bindings = NULL;
13327 /* When we get back here again, we will be expanding. */
13328 f->x_expanding_p = 1;
13330 /* If we've already decided that we cannot inline this function, we
13331 must remember that fact when we actually go to expand the
13333 f->cannot_inline = current_function_cannot_inline;
13336 /* At the end of every constructor we generate to code to return
13337 `this'. Do that now. */
13340 finish_constructor_body ()
13342 /* Any return from a constructor will end up here. */
13343 add_tree (build_min_nt (LABEL_STMT, ctor_label));
13345 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13346 generate the return, rather than a goto to CTOR_LABEL. */
13347 ctor_label = NULL_TREE;
13348 /* In check_return_expr we translate an empty return from a
13349 constructor to a return of `this'. */
13350 finish_return_stmt (NULL_TREE);
13353 /* At the end of every destructor we generate code to restore virtual
13354 function tables to the values desired by base classes and to call
13355 to base class destructors. Do that now. */
13358 finish_destructor_body ()
13360 tree compound_stmt;
13365 /* Create a block to contain all the extra code. */
13366 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
13368 /* Any return from a destructor will end up here. */
13369 add_tree (build_min_nt (LABEL_STMT, dtor_label));
13371 /* Generate the code to call destructor on base class. If this
13372 destructor belongs to a class with virtual functions, then set
13373 the virtual function table pointer to represent the type of our
13376 /* This side-effect makes call to `build_delete' generate the code
13377 we have to have at the end of this destructor. `build_delete'
13378 will set the flag again. */
13379 TYPE_HAS_DESTRUCTOR (current_class_type) = 0;
13381 /* These are two cases where we cannot delegate deletion. */
13382 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)
13383 || TYPE_GETS_REG_DELETE (current_class_type))
13384 in_charge = integer_zero_node;
13386 in_charge = current_in_charge_parm;
13388 exprstmt = build_delete (current_class_type,
13391 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
13394 if (exprstmt != error_mark_node
13395 && (TREE_CODE (exprstmt) != NOP_EXPR
13396 || TREE_OPERAND (exprstmt, 0) != integer_zero_node
13397 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)))
13399 if (exprstmt != void_zero_node)
13400 /* Don't call `expand_expr_stmt' if we're not going to do
13401 anything, since -Wall will give a diagnostic. */
13402 finish_expr_stmt (exprstmt);
13404 /* Run destructors for all virtual baseclasses. */
13405 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13407 tree vbases = nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type)));
13408 tree if_stmt = begin_if_stmt ();
13409 finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
13410 current_in_charge_parm,
13416 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases)))
13418 tree vb = get_vbase
13419 (BINFO_TYPE (vbases),
13420 TYPE_BINFO (current_class_type));
13422 (build_scoped_method_call
13423 (current_class_ref, vb, dtor_identifier,
13424 build_expr_list (NULL_TREE, integer_zero_node)));
13426 vbases = TREE_CHAIN (vbases);
13429 finish_then_clause (if_stmt);
13434 virtual_size = c_sizeof (current_class_type);
13436 /* At the end, call delete if that's what's requested. */
13438 /* FDIS sez: At the point of definition of a virtual destructor
13439 (including an implicit definition), non-placement operator delete
13440 shall be looked up in the scope of the destructor's class and if
13441 found shall be accessible and unambiguous.
13443 This is somewhat unclear, but I take it to mean that if the class
13444 only defines placement deletes we don't do anything here. So we
13445 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13446 they ever try to delete one of these. */
13447 if (TYPE_GETS_REG_DELETE (current_class_type)
13448 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13452 exprstmt = build_op_delete_call
13453 (DELETE_EXPR, current_class_ptr, virtual_size,
13454 LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
13456 if_stmt = begin_if_stmt ();
13457 finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
13458 current_in_charge_parm,
13461 finish_expr_stmt (exprstmt);
13462 finish_then_clause (if_stmt);
13466 /* Close the block we started above. */
13467 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
13470 /* Finish up a function declaration and compile that function
13471 all the way to assembler language output. The free the storage
13472 for the function definition.
13474 This is called after parsing the body of the function definition.
13475 LINENO is the current line number.
13477 FLAGS is a bitwise or of the following values:
13479 An extra call to poplevel (and expand_end_bindings) must be
13480 made to take care of the binding contour for the base
13481 initializers. This is only relevant for constructors.
13483 We just finished processing the body of an in-class inline
13484 function definition. (This processing will have taken place
13485 after the class definition is complete.) */
13488 finish_function (lineno, flags)
13492 register tree fndecl = current_function_decl;
13493 tree fntype, ctype = NULL_TREE;
13494 /* Label to use if this function is supposed to return a value. */
13495 tree no_return_label = NULL_TREE;
13496 int call_poplevel = (flags & 1) != 0;
13497 int inclass_inline = (flags & 2) != 0;
13501 /* When we get some parse errors, we can end up without a
13502 current_function_decl, so cope. */
13503 if (fndecl == NULL_TREE)
13504 return error_mark_node;
13506 nested = function_depth > 1;
13507 fntype = TREE_TYPE (fndecl);
13509 /* TREE_READONLY (fndecl) = 1;
13510 This caused &foo to be of type ptr-to-const-function
13511 which then got a warning when stored in a ptr-to-function variable. */
13513 /* This happens on strange parse errors. */
13514 if (! current_function_parms_stored)
13517 store_parm_decls ();
13520 if (building_stmt_tree ())
13522 if (DECL_CONSTRUCTOR_P (fndecl))
13524 finish_constructor_body ();
13528 else if (DECL_DESTRUCTOR_P (fndecl) && !processing_template_decl)
13529 finish_destructor_body ();
13530 else if (DECL_MAIN_P (fndecl))
13532 /* Make it so that `main' always returns 0 by default. */
13534 finish_return_stmt (integer_one_node);
13536 finish_return_stmt (integer_zero_node);
13540 /* Finish dealing with exception specifiers. */
13541 if (flag_exceptions && !processing_template_decl
13542 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13543 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13544 (TREE_TYPE (current_function_decl)),
13545 current_eh_spec_try_block);
13549 if (write_symbols != NO_DEBUG /*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13551 tree ttype = target_type (fntype);
13554 if (IS_AGGR_TYPE (ttype))
13555 /* Let debugger know it should output info for this type. */
13556 note_debug_info_needed (ttype);
13558 for (parmdecl = DECL_ARGUMENTS (fndecl); parmdecl; parmdecl = TREE_CHAIN (parmdecl))
13560 ttype = target_type (TREE_TYPE (parmdecl));
13561 if (IS_AGGR_TYPE (ttype))
13562 /* Let debugger know it should output info for this type. */
13563 note_debug_info_needed (ttype);
13567 /* Clean house because we will need to reorder insns here. */
13568 do_pending_stack_adjust ();
13572 else if (DECL_CONSTRUCTOR_P (fndecl))
13574 /* All subobjects have been fully constructed at this point. */
13575 end_protect_partials ();
13580 else if (return_label != NULL_RTX
13581 && flag_this_is_variable <= 0
13582 && current_function_return_value == NULL_TREE
13583 && ! DECL_NAME (DECL_RESULT (current_function_decl)))
13584 no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13586 if (flag_exceptions)
13587 expand_exception_blocks ();
13589 /* If this function is supposed to return a value, ensure that
13590 we do not fall into the cleanups by mistake. The end of our
13591 function will look like this:
13593 user code (may have return stmt somewhere)
13594 goto no_return_label
13599 NOTE_INSN_FUNCTION_END
13603 If the user omits a return stmt in the USER CODE section, we
13604 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13605 Otherwise, we won't. */
13606 if (no_return_label)
13608 DECL_CONTEXT (no_return_label) = fndecl;
13609 DECL_INITIAL (no_return_label) = error_mark_node;
13610 DECL_SOURCE_FILE (no_return_label) = input_filename;
13611 DECL_SOURCE_LINE (no_return_label) = lineno;
13612 expand_goto (no_return_label);
13617 /* Remove the binding contour which is used
13618 to catch cleanup-generated temporaries. */
13619 expand_end_bindings (0, 0, 0);
13620 poplevel (0, 0, 0);
13622 /* Emit label at beginning of cleanup code for parameters. */
13623 emit_label (cleanup_label);
13626 /* Get return value into register if that's where it's supposed
13628 if (original_result_rtx)
13629 fixup_result_decl (DECL_RESULT (fndecl), original_result_rtx);
13631 /* Finish building code that will trigger warnings if users forget
13632 to make their functions return values. */
13633 if (no_return_label || cleanup_label)
13634 emit_jump (return_label);
13635 if (no_return_label)
13637 /* We don't need to call `expand_*_return' here because we
13638 don't need any cleanups here--this path of code is only
13639 for error checking purposes. */
13640 expand_label (no_return_label);
13643 /* We hard-wired immediate_size_expand to zero in
13644 start_function. Expand_function_end will decrement this
13645 variable. So, we set the variable to one here, so that after
13646 the decrement it will remain zero. */
13647 immediate_size_expand = 1;
13649 /* Generate rtl for function exit. */
13650 expand_function_end (input_filename, lineno, 1);
13653 /* We have to save this value here in case
13654 maybe_end_member_template_processing decides to pop all the
13655 template parameters. */
13656 expand_p = !building_stmt_tree ();
13658 /* If we're saving up tree structure, tie off the function now. */
13660 finish_stmt_tree (fndecl);
13662 /* This must come after expand_function_end because cleanups might
13663 have declarations (from inline functions) that need to go into
13664 this function's blocks. */
13665 if (doing_semantic_analysis_p ())
13667 if (current_binding_level->parm_flag != 1)
13668 my_friendly_abort (122);
13669 poplevel (1, 0, 1);
13672 /* Remember that we were in class scope. */
13673 if (current_class_name)
13674 ctype = current_class_type;
13676 /* Must mark the RESULT_DECL as being in this function. */
13677 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
13679 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13680 to the FUNCTION_DECL node itself. */
13681 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
13683 /* Undo the call to push_momentary in start_function. */
13686 /* Save away current state, if appropriate. */
13687 if (!expanding_p && !processing_template_decl)
13688 save_function_data (fndecl);
13694 int saved_flag_keep_inline_functions =
13695 flag_keep_inline_functions;
13697 /* So we can tell if jump_optimize sets it to 1. */
13700 if (DECL_CONTEXT (fndecl) != NULL_TREE
13701 && hack_decl_function_context (fndecl))
13702 /* Trick rest_of_compilation into not deferring output of this
13703 function, even if it is inline, since the rtl_obstack for
13704 this function is the function_obstack of the enclosing
13705 function and will be deallocated when the enclosing
13706 function is gone. See save_tree_status. */
13707 flag_keep_inline_functions = 1;
13709 /* Before we call rest_of_compilation (which will pop the
13710 CURRENT_FUNCTION), we must save these values. */
13711 returns_null = current_function_returns_null;
13712 returns_value = current_function_returns_value;
13714 /* If this is a nested function (like a template instantiation
13715 that we're compiling in the midst of compiling something
13716 else), push a new GC context. That will keep local variables
13717 on the stack from being collected while we're doing the
13718 compilation of this function. */
13719 if (function_depth > 1)
13720 ggc_push_context ();
13722 /* Run the optimizers and output the assembler code for this
13724 if (DECL_ARTIFICIAL (fndecl))
13726 /* Do we really *want* to inline this synthesized method? */
13728 int save_fif = flag_inline_functions;
13729 flag_inline_functions = 1;
13731 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13732 will check our size. */
13733 DECL_INLINE (fndecl) = 0;
13735 rest_of_compilation (fndecl);
13736 flag_inline_functions = save_fif;
13739 rest_of_compilation (fndecl);
13741 /* Undo the call to ggc_push_context above. */
13742 if (function_depth > 1)
13743 ggc_pop_context ();
13745 flag_keep_inline_functions = saved_flag_keep_inline_functions;
13747 if (DECL_SAVED_INSNS (fndecl) && ! TREE_ASM_WRITTEN (fndecl))
13749 /* Set DECL_EXTERNAL so that assemble_external will be called as
13750 necessary. We'll clear it again in finish_file. */
13751 if (! DECL_EXTERNAL (fndecl))
13752 DECL_NOT_REALLY_EXTERN (fndecl) = 1;
13753 DECL_EXTERNAL (fndecl) = 1;
13754 mark_inline_for_output (fndecl);
13757 if (ctype && TREE_ASM_WRITTEN (fndecl))
13758 note_debug_info_needed (ctype);
13760 returns_null |= can_reach_end;
13762 /* Since we don't normally go through c_expand_return for constructors,
13763 this normally gets the wrong value.
13764 Also, named return values have their return codes emitted after
13765 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13766 if (DECL_CONSTRUCTOR_P (fndecl)
13767 || DECL_NAME (DECL_RESULT (fndecl)) != NULL_TREE)
13770 if (TREE_THIS_VOLATILE (fndecl) && returns_null)
13771 cp_warning ("`noreturn' function `%D' does return", fndecl);
13772 else if ((warn_return_type || pedantic)
13774 && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE)
13776 /* If this function returns non-void and control can drop through,
13778 cp_warning ("control reaches end of non-void function `%D'", fndecl);
13780 /* With just -W, complain only if function returns both with
13781 and without a value. */
13782 else if (extra_warnings && returns_value && returns_null)
13783 warning ("this function may return with or without a value");
13787 /* Since we never call rest_of_compilation, we never clear
13788 CURRENT_FUNCTION. Do so explicitly. */
13789 free_after_compilation (current_function);
13790 current_function = NULL;
13793 /* If this is a in-class inline definition, we may have to pop the
13794 bindings for the template parameters that we added in
13795 maybe_begin_member_template_processing when start_function was
13797 if (inclass_inline)
13798 maybe_end_member_template_processing ();
13800 /* Leave the scope of the class. */
13802 pop_nested_class ();
13806 /* Free all the tree nodes making up this function. */
13807 /* Switch back to allocating nodes permanently
13808 until we start another function. */
13810 permanent_allocation (1);
13812 if (!DECL_SAVED_INSNS (fndecl) && !DECL_SAVED_FUNCTION_DATA (fndecl))
13816 /* Stop pointing to the local nodes about to be freed. */
13817 /* But DECL_INITIAL must remain nonzero so we know this
13818 was an actual function definition. */
13819 DECL_INITIAL (fndecl) = error_mark_node;
13820 for (t = DECL_ARGUMENTS (fndecl); t; t = TREE_CHAIN (t))
13821 DECL_RTL (t) = DECL_INCOMING_RTL (t) = NULL_RTX;
13824 if (DECL_STATIC_CONSTRUCTOR (fndecl))
13825 static_ctors = tree_cons (NULL_TREE, fndecl, static_ctors);
13826 if (DECL_STATIC_DESTRUCTOR (fndecl))
13827 static_dtors = tree_cons (NULL_TREE, fndecl, static_dtors);
13832 /* Let the error reporting routines know that we're outside a
13833 function. For a nested function, this value is used in
13834 pop_cp_function_context and then reset via pop_function_context. */
13835 current_function_decl = NULL_TREE;
13841 /* Create the FUNCTION_DECL for a function definition.
13842 DECLSPECS and DECLARATOR are the parts of the declaration;
13843 they describe the return type and the name of the function,
13844 but twisted together in a fashion that parallels the syntax of C.
13846 This function creates a binding context for the function body
13847 as well as setting up the FUNCTION_DECL in current_function_decl.
13849 Returns a FUNCTION_DECL on success.
13851 If the DECLARATOR is not suitable for a function (it defines a datum
13852 instead), we return 0, which tells yyparse to report a parse error.
13854 May return void_type_node indicating that this method is actually
13855 a friend. See grokfield for more details.
13857 Came here with a `.pushlevel' .
13859 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13860 CHANGES TO CODE IN `grokfield'. */
13863 start_method (declspecs, declarator, attrlist)
13864 tree declarator, declspecs, attrlist;
13866 tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
13869 /* Something too ugly to handle. */
13870 if (fndecl == NULL_TREE)
13873 /* Pass friends other than inline friend functions back. */
13874 if (fndecl == void_type_node)
13877 if (TREE_CODE (fndecl) != FUNCTION_DECL)
13878 /* Not a function, tell parser to report parse error. */
13881 if (DECL_IN_AGGR_P (fndecl))
13883 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
13885 if (DECL_CONTEXT (fndecl)
13886 && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
13887 cp_error ("`%D' is already defined in class %s", fndecl,
13888 TYPE_NAME_STRING (DECL_CONTEXT (fndecl)));
13890 return void_type_node;
13893 check_template_shadow (fndecl);
13895 DECL_THIS_INLINE (fndecl) = 1;
13897 if (flag_default_inline)
13898 DECL_INLINE (fndecl) = 1;
13900 /* We process method specializations in finish_struct_1. */
13901 if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
13902 fndecl = push_template_decl (fndecl);
13904 /* We read in the parameters on the maybepermanent_obstack,
13905 but we won't be getting back to them until after we
13906 may have clobbered them. So the call to preserve_data
13907 will keep them safe. */
13910 if (! DECL_FRIEND_P (fndecl))
13912 if (TREE_CHAIN (fndecl))
13914 fndecl = copy_node (fndecl);
13915 TREE_CHAIN (fndecl) = NULL_TREE;
13918 if (DECL_CONSTRUCTOR_P (fndecl))
13920 if (! grok_ctor_properties (current_class_type, fndecl))
13921 return void_type_node;
13923 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl)))
13924 grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0);
13927 cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0, 0);
13929 /* Make a place for the parms */
13931 current_binding_level->parm_flag = 1;
13933 DECL_IN_AGGR_P (fndecl) = 1;
13937 /* Go through the motions of finishing a function definition.
13938 We don't compile this method until after the whole class has
13941 FINISH_METHOD must return something that looks as though it
13942 came from GROKFIELD (since we are defining a method, after all).
13944 This is called after parsing the body of the function definition.
13945 STMTS is the chain of statements that makes up the function body.
13947 DECL is the ..._DECL that `start_method' provided. */
13950 finish_method (decl)
13953 register tree fndecl = decl;
13956 register tree link;
13958 if (decl == void_type_node)
13961 old_initial = DECL_INITIAL (fndecl);
13963 /* Undo the level for the parms (from start_method).
13964 This is like poplevel, but it causes nothing to be
13965 saved. Saving information here confuses symbol-table
13966 output routines. Besides, this information will
13967 be correctly output when this method is actually
13970 /* Clear out the meanings of the local variables of this level;
13971 also record in each decl which block it belongs to. */
13973 for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
13975 if (DECL_NAME (link) != NULL_TREE)
13976 pop_binding (DECL_NAME (link), link);
13977 my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
13978 DECL_CONTEXT (link) = NULL_TREE;
13981 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
13982 (HOST_WIDE_INT) current_binding_level->level_chain,
13983 current_binding_level->parm_flag,
13984 current_binding_level->keep);
13986 poplevel (0, 0, 0);
13988 DECL_INITIAL (fndecl) = old_initial;
13990 /* We used to check if the context of FNDECL was different from
13991 current_class_type as another way to get inside here. This didn't work
13992 for String.cc in libg++. */
13993 if (DECL_FRIEND_P (fndecl))
13995 CLASSTYPE_INLINE_FRIENDS (current_class_type)
13996 = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
13997 decl = void_type_node;
14003 /* Called when a new struct TYPE is defined.
14004 If this structure or union completes the type of any previous
14005 variable declaration, lay it out and output its rtl. */
14008 hack_incomplete_structures (type)
14013 if (current_binding_level->incomplete == NULL_TREE)
14016 if (!type) /* Don't do this for class templates. */
14019 for (list = ¤t_binding_level->incomplete; *list; )
14021 tree decl = TREE_VALUE (*list);
14022 if ((decl && TREE_TYPE (decl) == type)
14023 || (TREE_TYPE (decl)
14024 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14025 && TREE_TYPE (TREE_TYPE (decl)) == type))
14027 int toplevel = toplevel_bindings_p ();
14028 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14029 && TREE_TYPE (TREE_TYPE (decl)) == type)
14030 layout_type (TREE_TYPE (decl));
14031 layout_decl (decl, 0);
14032 rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0);
14036 expand_decl (decl);
14037 cleanup = maybe_build_cleanup (decl);
14038 expand_decl_init (decl);
14039 if (! expand_decl_cleanup (decl, cleanup))
14040 cp_error ("parser lost in parsing declaration of `%D'",
14043 *list = TREE_CHAIN (*list);
14046 list = &TREE_CHAIN (*list);
14050 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14051 See build_delete for information about AUTO_DELETE.
14053 Don't build these on the momentary obstack; they must live
14054 the life of the binding contour. */
14057 maybe_build_cleanup_1 (decl, auto_delete)
14058 tree decl, auto_delete;
14060 tree type = TREE_TYPE (decl);
14061 if (type != error_mark_node && TYPE_NEEDS_DESTRUCTOR (type))
14063 int temp = 0, flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14066 if (TREE_CODE (decl) != PARM_DECL)
14067 temp = suspend_momentary ();
14069 if (TREE_CODE (type) == ARRAY_TYPE)
14073 mark_addressable (decl);
14074 rval = build_unary_op (ADDR_EXPR, decl, 0);
14077 /* Optimize for space over speed here. */
14078 if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14079 || flag_expensive_optimizations)
14080 flags |= LOOKUP_NONVIRTUAL;
14082 rval = build_delete (TREE_TYPE (rval), rval, auto_delete, flags, 0);
14084 if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14085 && ! TYPE_HAS_DESTRUCTOR (type))
14086 rval = build_compound_expr (tree_cons (NULL_TREE, rval,
14087 build_expr_list (NULL_TREE, build_vbase_delete (type, decl))));
14089 if (TREE_CODE (decl) != PARM_DECL)
14090 resume_momentary (temp);
14097 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
14100 build_target_expr (decl, value)
14106 t = build (TARGET_EXPR, TREE_TYPE (decl), decl, value,
14107 maybe_build_cleanup (decl), NULL_TREE);
14108 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
14109 ignore the TARGET_EXPR. If there really turn out to be no
14110 side-effects, then the optimizer should be able to get rid of
14111 whatever code is generated anyhow. */
14112 TREE_SIDE_EFFECTS (t) = 1;
14117 /* If DECL is of a type which needs a cleanup, build that cleanup
14118 here. The cleanup does free the storage with a call to delete. */
14121 maybe_build_cleanup_and_delete (decl)
14124 return maybe_build_cleanup_1 (decl, integer_three_node);
14127 /* If DECL is of a type which needs a cleanup, build that cleanup
14128 here. The cleanup does not free the storage with a call a delete. */
14131 maybe_build_cleanup (decl)
14134 return maybe_build_cleanup_1 (decl, integer_two_node);
14137 /* Expand a C++ expression at the statement level.
14138 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14139 The C++ type checker should get all of these out when
14140 expressions are combined with other, type-providing, expressions,
14141 leaving only orphan expressions, such as:
14143 &class::bar; / / takes its address, but does nothing with it. */
14146 cplus_expand_expr_stmt (exp)
14149 if (stmts_are_full_exprs_p)
14150 exp = convert_to_void (exp, "statement");
14153 /* We should do this eventually, but right now this causes regex.o from
14154 libg++ to miscompile, and tString to core dump. */
14155 exp = build1 (CLEANUP_POINT_EXPR, TREE_TYPE (exp), exp);
14158 /* If we don't do this, we end up down inside expand_expr
14159 trying to do TYPE_MODE on the ERROR_MARK, and really
14160 go outside the bounds of the type. */
14161 if (exp != error_mark_node)
14162 expand_expr_stmt (break_out_cleanups (exp));
14165 /* When a stmt has been parsed, this function is called. */
14170 /* Always assume this statement was not an expression statement. If
14171 it actually was an expression statement, its our callers
14172 responsibility to fix this up. */
14173 last_expr_type = NULL_TREE;
14176 /* Change a static member function definition into a FUNCTION_TYPE, instead
14177 of the METHOD_TYPE that we create when it's originally parsed.
14179 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14180 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14181 other decls. Either pass the addresses of local variables or NULL. */
14184 revert_static_member_fn (decl, fn, argtypes)
14185 tree *decl, *fn, *argtypes;
14188 tree function = fn ? *fn : TREE_TYPE (*decl);
14189 tree args = argtypes ? *argtypes : TYPE_ARG_TYPES (function);
14191 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args)))
14192 != TYPE_UNQUALIFIED)
14193 cp_error ("static member function `%#D' declared with type qualifiers",
14196 args = TREE_CHAIN (args);
14197 tmp = build_function_type (TREE_TYPE (function), args);
14198 tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function));
14199 tmp = build_exception_variant (tmp,
14200 TYPE_RAISES_EXCEPTIONS (function));
14201 TREE_TYPE (*decl) = tmp;
14202 if (DECL_ARGUMENTS (*decl))
14203 DECL_ARGUMENTS (*decl) = TREE_CHAIN (DECL_ARGUMENTS (*decl));
14204 DECL_STATIC_FUNCTION_P (*decl) = 1;
14211 /* Initialize the variables used during compilation of a C++
14215 push_cp_function_context (f)
14216 struct function *f;
14218 struct language_function *p
14219 = ((struct language_function *)
14220 xcalloc (1, sizeof (struct language_function)));
14223 /* It takes an explicit call to expand_body to generate RTL for a
14227 /* Whenever we start a new function, we destroy temporaries in the
14229 stmts_are_full_exprs_p = 1;
14232 /* Free the language-specific parts of F, now that we've finished
14233 compiling the function. */
14236 pop_cp_function_context (f)
14237 struct function *f;
14239 free (f->language);
14243 /* Mark P for GC. */
14246 mark_lang_function (p)
14247 struct language_function *p;
14252 ggc_mark_tree (p->x_named_labels);
14253 ggc_mark_tree (p->x_ctor_label);
14254 ggc_mark_tree (p->x_dtor_label);
14255 ggc_mark_tree (p->x_base_init_list);
14256 ggc_mark_tree (p->x_member_init_list);
14257 ggc_mark_tree (p->x_current_class_ptr);
14258 ggc_mark_tree (p->x_current_class_ref);
14259 ggc_mark_tree (p->x_last_tree);
14260 ggc_mark_tree (p->x_last_expr_type);
14261 ggc_mark_tree (p->x_eh_spec_try_block);
14262 ggc_mark_tree (p->x_scope_stmt_stack);
14264 ggc_mark_rtx (p->x_last_dtor_insn);
14265 ggc_mark_rtx (p->x_last_parm_cleanup_insn);
14266 ggc_mark_rtx (p->x_result_rtx);
14268 mark_binding_level (&p->bindings);
14271 /* Mark the language-specific data in F for GC. */
14274 mark_cp_function_context (f)
14275 struct function *f;
14277 mark_lang_function (f->language);
14283 return function_depth != 0;
14288 lang_mark_false_label_stack (l)
14289 struct label_node *l;
14291 /* C++ doesn't use false_label_stack. It better be NULL. */
14292 my_friendly_assert (l == NULL, 19990904);
14299 enum tree_code code = TREE_CODE (t);
14300 if (code == IDENTIFIER_NODE)
14302 struct lang_identifier *li = (struct lang_identifier *) t;
14303 struct lang_id2 *li2 = li->x;
14304 ggc_mark_tree (li->namespace_bindings);
14305 ggc_mark_tree (li->bindings);
14306 ggc_mark_tree (li->class_value);
14307 ggc_mark_tree (li->class_template_info);
14311 ggc_mark_tree (li2->label_value);
14312 ggc_mark_tree (li2->implicit_decl);
14313 ggc_mark_tree (li2->error_locus);
14316 else if (code == CPLUS_BINDING)
14318 if (BINDING_HAS_LEVEL_P (t))
14319 mark_binding_level (&BINDING_LEVEL (t));
14321 ggc_mark_tree (BINDING_SCOPE (t));
14322 ggc_mark_tree (BINDING_VALUE (t));
14324 else if (code == OVERLOAD)
14325 ggc_mark_tree (OVL_FUNCTION (t));
14326 else if (code == TEMPLATE_PARM_INDEX)
14327 ggc_mark_tree (TEMPLATE_PARM_DECL (t));
14328 else if (TREE_CODE_CLASS (code) == 'd')
14330 struct lang_decl *ld = DECL_LANG_SPECIFIC (t);
14335 ggc_mark_tree (ld->decl_flags.access);
14336 ggc_mark_tree (ld->decl_flags.context);
14337 if (TREE_CODE (t) != NAMESPACE_DECL)
14338 ggc_mark_tree (ld->decl_flags.u.template_info);
14339 if (CAN_HAVE_FULL_LANG_DECL_P (t))
14341 ggc_mark_tree (ld->main_decl_variant);
14342 ggc_mark_tree (ld->befriending_classes);
14343 ggc_mark_tree (ld->saved_tree);
14344 if (TREE_CODE (t) == TYPE_DECL)
14345 ggc_mark_tree (ld->u.sorted_fields);
14346 else if (TREE_CODE (t) == FUNCTION_DECL
14347 && !DECL_PENDING_INLINE_P (t))
14348 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t));
14352 else if (TREE_CODE_CLASS (code) == 't')
14354 struct lang_type *lt = TYPE_LANG_SPECIFIC (t);
14356 if (lt && !(TREE_CODE (t) == POINTER_TYPE
14357 && TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE))
14360 ggc_mark_tree (lt->vfields);
14361 ggc_mark_tree (lt->vbases);
14362 ggc_mark_tree (lt->tags);
14363 ggc_mark_tree (lt->search_slot);
14364 ggc_mark_tree (lt->size);
14365 ggc_mark_tree (lt->abstract_virtuals);
14366 ggc_mark_tree (lt->friend_classes);
14367 ggc_mark_tree (lt->rtti);
14368 ggc_mark_tree (lt->methods);
14369 ggc_mark_tree (lt->template_info);
14370 ggc_mark_tree (lt->befriending_classes);
14373 /* In the case of pointer-to-member function types, the
14374 TYPE_LANG_SPECIFIC is really just a tree. */
14375 ggc_mark_tree ((tree) lt);