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 tree layout_var_decl PROTO((tree, 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));
184 #if defined (DEBUG_CP_BINDING_LEVELS)
185 static void indent PROTO((void));
188 /* Erroneous argument lists can use this *IFF* they do not modify it. */
189 tree error_mark_list;
191 /* The following symbols are subsumed in the cp_global_trees array, and
192 listed here individually for documentation purposes.
195 tree wchar_decl_node;
198 tree vtable_entry_type;
199 tree delta_type_node;
202 tree __baselist_desc_type_node;
203 tree __i_desc_type_node, __m_desc_type_node;
204 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
206 tree __t_desc_type_node;
208 tree __tp_desc_type_node;
210 tree __access_mode_type_node;
211 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
212 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
213 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
215 Not needed yet? May be needed one day?
216 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
217 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
218 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
221 tree class_star_type_node;
222 tree class_type_node, record_type_node, union_type_node, enum_type_node;
223 tree unknown_type_node;
225 Array type `vtable_entry_type[]'
228 tree vtbl_ptr_type_node;
234 A FUNCTION_DECL which can call `abort'. Not necessarily the
235 one that the user will declare, but sufficient to be called
236 by routines that want to abort the program.
240 The FUNCTION_DECL for the default `::operator delete'.
242 tree global_delete_fndecl;
245 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
249 tree cp_global_trees[CPTI_MAX];
251 /* Indicates that there is a type value in some namespace, although
252 that is not necessarily in scope at the moment. */
254 static tree global_type_node;
259 /* Expect only namespace names now. */
260 static int only_namespace_names;
262 /* In a destructor, the last insn emitted after the start of the
263 function and the parms. */
265 #define last_dtor_insn cp_function_chain->x_last_dtor_insn
267 /* In a constructor, the last insn emitted after the start of the
268 function and the parms, the exception specification and any
269 function-try-block. The constructor initializers are emitted after
272 #define last_parm_cleanup_insn cp_function_chain->x_last_parm_cleanup_insn
274 /* If original DECL_RESULT of current function was a register,
275 but due to being an addressable named return value, would up
276 on the stack, this variable holds the named return value's
277 original location. */
279 #define original_result_rtx cp_function_chain->x_result_rtx
281 struct named_label_list
283 struct binding_level *binding_level;
286 const char *filename_o_goto;
288 struct named_label_list *next;
291 /* Used only for jumps to as-yet undefined labels, since jumps to
292 defined labels can have their validity checked by stmt.c. */
294 #define named_label_uses cp_function_chain->x_named_label_uses
296 /* A list of objects which have constructors or destructors
297 which reside in the global scope. The decl is stored in
298 the TREE_VALUE slot and the initializer is stored
299 in the TREE_PURPOSE slot. */
300 tree static_aggregates;
304 /* A node for the integer constants 2, and 3. */
306 tree integer_two_node, integer_three_node;
308 /* While defining an enum type, this is 1 plus the last enumerator
311 static tree enum_next_value;
313 /* Nonzero means that there was overflow computing enum_next_value. */
315 static int enum_overflow;
317 /* Parsing a function declarator leaves here a chain of structure
318 and enum types declared in the parmlist. */
320 static tree last_function_parm_tags;
322 /* Similar, for last_function_parm_tags. */
323 tree last_function_parms;
324 static tree current_function_parm_tags;
326 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
327 that have names. Here so we can clear out their names' definitions
328 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
329 TREE_PURPOSE is the previous binding of the label. */
331 #define named_labels cp_function_chain->x_named_labels
333 /* The FUNCTION_DECL for the function currently being compiled,
334 or 0 if between functions. */
335 tree current_function_decl;
337 /* Set to 0 at beginning of a function definition, and whenever
338 a label (case or named) is defined. Set to value of expression
339 returned from function when that value can be transformed into
340 a named return value. */
342 tree current_function_return_value;
344 /* Nonzero means give `double' the same size as `float'. */
346 extern int flag_short_double;
348 /* Nonzero means don't recognize any builtin functions. */
350 extern int flag_no_builtin;
352 /* Nonzero means don't recognize the non-ANSI builtin functions.
355 extern int flag_no_nonansi_builtin;
357 /* Nonzero means enable obscure ANSI features and disable GNU extensions
358 that might cause ANSI-compliant code to be miscompiled. */
360 extern int flag_ansi;
362 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
364 extern int flag_huge_objects;
366 /* Nonzero if we want to conserve space in the .o files. We do this
367 by putting uninitialized data and runtime initialized data into
368 .common instead of .data at the expense of not flagging multiple
370 extern int flag_conserve_space;
372 /* C and C++ flags are in decl2.c. */
374 /* Set to 0 at beginning of a constructor, set to 1
375 if that function does an allocation before referencing its
376 instance variable. */
377 #define current_function_assigns_this cp_function_chain->assigns_this
378 #define current_function_just_assigned_this \
379 cp_function_chain->just_assigned_this
381 /* Flag used when debugging spew.c */
383 extern int spew_debug;
385 /* A expression of value 0 with the same precision as a sizetype
387 tree signed_size_zero_node;
389 /* The name of the anonymous namespace, throughout this translation
391 tree anonymous_namespace_name;
394 /* Allocate a level of searching. */
398 push_decl_level (stack, obstack)
399 struct stack_level *stack;
400 struct obstack *obstack;
402 struct stack_level tem;
405 return push_stack_level (obstack, (char *)&tem, sizeof (tem));
408 /* For each binding contour we allocate a binding_level structure
409 which records the names defined in that contour.
412 1) one for each function definition,
413 where internal declarations of the parameters appear.
414 2) one for each compound statement,
415 to record its declarations.
417 The current meaning of a name can be found by searching the levels
418 from the current one out to the global one.
420 Off to the side, may be the class_binding_level. This exists only
421 to catch class-local declarations. It is otherwise nonexistent.
423 Also there may be binding levels that catch cleanups that must be
424 run when exceptions occur. Thus, to see whether a name is bound in
425 the current scope, it is not enough to look in the
426 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
429 /* Note that the information in the `names' component of the global contour
430 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
434 /* A chain of _DECL nodes for all variables, constants, functions,
435 and typedef types. These are in the reverse of the order
436 supplied. There may be OVERLOADs on this list, too, but they
437 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
440 /* A list of structure, union and enum definitions, for looking up
442 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
443 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
444 or ENUMERAL_TYPE node.
446 C++: the TREE_VALUE nodes can be simple types for
447 component_bindings. */
450 /* A list of USING_DECL nodes. */
453 /* A list of used namespaces. PURPOSE is the namespace,
454 VALUE the common ancestor with this binding_level's namespace. */
455 tree using_directives;
457 /* If this binding level is the binding level for a class, then
458 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
459 is the name of an entity bound in the class; the TREE_VALUE is
460 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
461 when leaving class scope, we can restore the
462 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
463 the DECL bound by this name in the class. */
466 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
467 is used for all binding levels. */
470 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
471 label in this scope. The TREE_PURPOSE is the previous value of
472 the IDENTIFIER_LABEL VALUE. */
473 tree shadowed_labels;
475 /* For each level (except not the global one),
476 a chain of BLOCK nodes for all the levels
477 that were entered and exited one level down. */
480 /* The BLOCK node for this level, if one has been preallocated.
481 If 0, the BLOCK is allocated (if needed) when the level is popped. */
484 /* The binding level which this one is contained in (inherits from). */
485 struct binding_level *level_chain;
487 /* List of decls in `names' that have incomplete
488 structure or union types. */
491 /* List of VAR_DECLS saved from a previous for statement.
492 These would be dead in ANSI-conforming code, but might
493 be referenced in ARM-era code. These are stored in a
494 TREE_LIST; the TREE_VALUE is the actual declaration. */
495 tree dead_vars_from_for;
497 /* 1 for the level that holds the parameters of a function.
498 2 for the level that holds a class declaration.
499 3 for levels that hold parameter declarations. */
500 unsigned parm_flag : 4;
502 /* 1 means make a BLOCK for this level regardless of all else.
503 2 for temporary binding contours created by the compiler. */
506 /* Nonzero if this level "doesn't exist" for tags. */
507 unsigned tag_transparent : 1;
509 /* Nonzero if this level can safely have additional
510 cleanup-needing variables added to it. */
511 unsigned more_cleanups_ok : 1;
512 unsigned have_cleanups : 1;
514 /* Nonzero if this level is for storing the decls for template
515 parameters and generic decls; these decls will be discarded and
516 replaced with a TEMPLATE_DECL. */
517 unsigned pseudo_global : 1;
519 /* This is set for a namespace binding level. */
520 unsigned namespace_p : 1;
522 /* True if this level is that of a for-statement where we need to
523 worry about ambiguous (ARM or ANSI) scope rules. */
524 unsigned is_for_scope : 1;
526 /* True if this level corresponds to an EH region, as for a try block. */
527 unsigned eh_region : 1;
529 /* One bit left for this word. */
531 #if defined(DEBUG_CP_BINDING_LEVELS)
532 /* Binding depth at which this level began. */
533 unsigned binding_depth;
534 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
537 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
539 /* The binding level currently in effect. */
541 #define current_binding_level \
543 ? cp_function_chain->bindings \
544 : scope_chain->bindings)
546 /* The binding level of the current class, if any. */
548 #define class_binding_level scope_chain->class_bindings
550 /* A chain of binding_level structures awaiting reuse. */
552 static struct binding_level *free_binding_level;
554 /* The outermost binding level, for names of file scope.
555 This is created when the compiler is started and exists
556 through the entire run. */
558 static struct binding_level *global_binding_level;
560 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
562 static int keep_next_level_flag;
564 #if defined(DEBUG_CP_BINDING_LEVELS)
565 static int binding_depth = 0;
566 static int is_class_level = 0;
573 for (i = 0; i < binding_depth*2; i++)
576 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
578 static tree pushdecl_with_scope PROTO((tree, struct binding_level *));
581 push_binding_level (newlevel, tag_transparent, keep)
582 struct binding_level *newlevel;
583 int tag_transparent, keep;
585 /* Add this level to the front of the chain (stack) of levels that
587 bzero ((char*) newlevel, sizeof (struct binding_level));
588 newlevel->level_chain = current_binding_level;
589 current_binding_level = newlevel;
590 newlevel->tag_transparent = tag_transparent;
591 newlevel->more_cleanups_ok = 1;
593 /* We are called before expand_start_bindings, but after
594 expand_eh_region_start for a try block; so we check this now,
595 before the EH block is covered up. */
596 newlevel->eh_region = is_eh_region ();
598 newlevel->keep = keep;
599 #if defined(DEBUG_CP_BINDING_LEVELS)
600 newlevel->binding_depth = binding_depth;
602 fprintf (stderr, "push %s level 0x%08x line %d\n",
603 (is_class_level) ? "class" : "block", newlevel, lineno);
606 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
609 /* Find the innermost enclosing class scope, and reset
610 CLASS_BINDING_LEVEL appropriately. */
613 find_class_binding_level ()
615 struct binding_level *level = current_binding_level;
617 while (level && level->parm_flag != 2)
618 level = level->level_chain;
619 if (level && level->parm_flag == 2)
620 class_binding_level = level;
622 class_binding_level = 0;
628 if (global_binding_level)
630 /* Cannot pop a level, if there are none left to pop. */
631 if (current_binding_level == global_binding_level)
632 my_friendly_abort (123);
634 /* Pop the current level, and free the structure for reuse. */
635 #if defined(DEBUG_CP_BINDING_LEVELS)
638 fprintf (stderr, "pop %s level 0x%08x line %d\n",
639 (is_class_level) ? "class" : "block",
640 current_binding_level, lineno);
641 if (is_class_level != (current_binding_level == class_binding_level))
644 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
647 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
649 register struct binding_level *level = current_binding_level;
650 current_binding_level = current_binding_level->level_chain;
651 level->level_chain = free_binding_level;
652 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
653 if (level->binding_depth != binding_depth)
655 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
656 free_binding_level = level;
657 find_class_binding_level ();
662 suspend_binding_level ()
664 if (class_binding_level)
665 current_binding_level = class_binding_level;
667 if (global_binding_level)
669 /* Cannot suspend a level, if there are none left to suspend. */
670 if (current_binding_level == global_binding_level)
671 my_friendly_abort (123);
673 /* Suspend the current level. */
674 #if defined(DEBUG_CP_BINDING_LEVELS)
677 fprintf (stderr, "suspend %s level 0x%08x line %d\n",
678 (is_class_level) ? "class" : "block",
679 current_binding_level, lineno);
680 if (is_class_level != (current_binding_level == class_binding_level))
683 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
686 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
687 current_binding_level = current_binding_level->level_chain;
688 find_class_binding_level ();
692 resume_binding_level (b)
693 struct binding_level *b;
695 /* Resuming binding levels is meant only for namespaces,
696 and those cannot nest into classes. */
697 my_friendly_assert(!class_binding_level, 386);
698 /* Also, resuming a non-directly nested namespace is a no-no. */
699 my_friendly_assert(b->level_chain == current_binding_level, 386);
700 current_binding_level = b;
701 #if defined(DEBUG_CP_BINDING_LEVELS)
702 b->binding_depth = binding_depth;
704 fprintf (stderr, "resume %s level 0x%08x line %d\n",
705 (is_class_level) ? "class" : "block", b, lineno);
708 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
711 /* Create a new `struct binding_level'. */
714 struct binding_level *
715 make_binding_level ()
718 return (struct binding_level *) xmalloc (sizeof (struct binding_level));
721 /* Nonzero if we are currently in the global binding level. */
726 return current_binding_level == global_binding_level;
729 /* Return the innermost binding level that is not for a class scope. */
731 static struct binding_level *
732 innermost_nonclass_level ()
734 struct binding_level *b;
736 b = current_binding_level;
737 while (b->parm_flag == 2)
743 /* Nonzero if we are currently in a toplevel binding level. This
744 means either the global binding level or a namespace in a toplevel
745 binding level. Since there are no non-toplevel namespace levels,
746 this really means any namespace or pseudo-global level. We also
747 include a class whose context is toplevel. */
750 toplevel_bindings_p ()
752 struct binding_level *b = innermost_nonclass_level ();
754 return b->namespace_p || b->pseudo_global;
757 /* Nonzero if this is a namespace scope, or if we are defining a class
758 which is itself at namespace scope, or whose enclosing class is
759 such a class, etc. */
762 namespace_bindings_p ()
764 struct binding_level *b = innermost_nonclass_level ();
766 return b->namespace_p;
769 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
770 unconditionally. Otherwise, use the normal logic to decide whether
771 or not to create a BLOCK. */
774 keep_next_level (keep)
777 keep_next_level_flag = keep;
780 /* Nonzero if the current level needs to have a BLOCK made. */
785 return (current_binding_level->blocks != NULL_TREE
786 || current_binding_level->keep
787 || current_binding_level->names != NULL_TREE
788 || (current_binding_level->tags != NULL_TREE
789 && !current_binding_level->tag_transparent));
793 declare_pseudo_global_level ()
795 current_binding_level->pseudo_global = 1;
799 declare_namespace_level ()
801 current_binding_level->namespace_p = 1;
805 pseudo_global_level_p ()
807 return current_binding_level->pseudo_global;
811 set_class_shadows (shadows)
814 class_binding_level->class_shadowed = shadows;
817 /* Enter a new binding level.
818 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
819 not for that of tags. */
822 pushlevel (tag_transparent)
825 register struct binding_level *newlevel = NULL_BINDING_LEVEL;
827 /* Reuse or create a struct for this binding level. */
829 #if defined(DEBUG_CP_BINDING_LEVELS)
831 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
832 if (free_binding_level)
833 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
835 newlevel = free_binding_level;
836 free_binding_level = free_binding_level->level_chain;
839 newlevel = make_binding_level ();
841 push_binding_level (newlevel, tag_transparent, keep_next_level_flag);
842 GNU_xref_start_scope ((HOST_WIDE_INT) newlevel);
843 keep_next_level_flag = 0;
847 note_level_for_for ()
849 current_binding_level->is_for_scope = 1;
853 pushlevel_temporary (tag_transparent)
856 pushlevel (tag_transparent);
857 current_binding_level->keep = 2;
860 /* Note we don't call push_momentary() here. Otherwise, it would cause
861 cleanups to be allocated on the momentary obstack, and they will be
862 overwritten by the next statement. */
864 expand_start_bindings (0);
867 /* For a binding between a name and an entity at a block scope,
868 this is the `struct binding_level' for the block. */
869 #define BINDING_LEVEL(NODE) \
870 (((struct tree_binding*)NODE)->scope.level)
872 /* Make DECL the innermost binding for ID. The LEVEL is the binding
873 level at which this declaration is being bound. */
876 push_binding (id, decl, level)
879 struct binding_level* level;
883 binding = make_node (CPLUS_BINDING);
885 /* Now, fill in the binding information. */
886 BINDING_VALUE (binding) = decl;
887 BINDING_TYPE (binding) = NULL_TREE;
888 BINDING_LEVEL (binding) = level;
889 INHERITED_VALUE_BINDING_P (binding) = 0;
890 LOCAL_BINDING_P (binding) = (level != class_binding_level);
891 BINDING_HAS_LEVEL_P (binding) = 1;
893 /* And put it on the front of the list of bindings for ID. */
894 TREE_CHAIN (binding) = IDENTIFIER_BINDING (id);
895 IDENTIFIER_BINDING (id) = binding;
898 /* ID is already bound in the current scope. But, DECL is an
899 additional binding for ID in the same scope. This is the `struct
900 stat' hack whereby a non-typedef class-name or enum-name can be
901 bound at the same level as some other kind of entity. It's the
902 responsibility of the caller to check that inserting this name is
903 legal here. Returns nonzero if the new binding was successful. */
905 add_binding (id, decl)
909 tree binding = IDENTIFIER_BINDING (id);
912 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
913 /* The new name is the type name. */
914 BINDING_TYPE (binding) = decl;
915 else if (!BINDING_VALUE (binding))
916 /* This situation arises when push_class_level_binding moves an
917 inherited type-binding out of the way to make room for a new
919 BINDING_VALUE (binding) = decl;
920 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
921 && DECL_ARTIFICIAL (BINDING_VALUE (binding)))
923 /* The old binding was a type name. It was placed in
924 BINDING_VALUE because it was thought, at the point it was
925 declared, to be the only entity with such a name. Move the
926 type name into the type slot; it is now hidden by the new
928 BINDING_TYPE (binding) = BINDING_VALUE (binding);
929 BINDING_VALUE (binding) = decl;
930 INHERITED_VALUE_BINDING_P (binding) = 0;
932 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
933 && TREE_CODE (decl) == TYPE_DECL
934 && DECL_NAME (decl) == DECL_NAME (BINDING_VALUE (binding))
935 && same_type_p (TREE_TYPE (decl),
936 TREE_TYPE (BINDING_VALUE (binding))))
937 /* We have two typedef-names, both naming the same type to have
938 the same name. This is OK because of:
942 In a given scope, a typedef specifier can be used to redefine
943 the name of any type declared in that scope to refer to the
944 type to which it already refers. */
948 cp_error ("declaration of `%#D'", decl);
949 cp_error_at ("conflicts with previous declaration `%#D'",
950 BINDING_VALUE (binding));
957 /* Add DECL to the list of things declared in B. */
960 add_decl_to_level (decl, b)
962 struct binding_level *b;
964 /* We build up the list in reverse order, and reverse it later if
966 TREE_CHAIN (decl) = b->names;
970 /* Bind DECL to ID in the current_binding_level, assumed to be a local
971 binding level. If PUSH_USING is set in FLAGS, we know that DECL
972 doesn't really belong to this binding level, that it got here
973 through a using-declaration. */
976 push_local_binding (id, decl, flags)
981 struct binding_level *b;
983 /* Skip over any local classes. This makes sense if we call
984 push_local_binding with a friend decl of a local class. */
985 b = current_binding_level;
986 while (b->parm_flag == 2)
989 if (lookup_name_current_level (id))
991 /* Supplement the existing binding. */
992 if (!add_binding (id, decl))
993 /* It didn't work. Something else must be bound at this
994 level. Do not add DECL to the list of things to pop
999 /* Create a new binding. */
1000 push_binding (id, decl, b);
1002 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1003 /* We must put the OVERLOAD into a TREE_LIST since the
1004 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1005 decls that got here through a using-declaration. */
1006 decl = build_tree_list (NULL_TREE, decl);
1008 /* And put DECL on the list of things declared by the current
1010 add_decl_to_level (decl, b);
1013 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1014 binding was successful. */
1017 push_class_binding (id, decl)
1022 tree binding = IDENTIFIER_BINDING (id);
1025 /* Note that we declared this value so that we can issue an error if
1026 this an illegal redeclaration of a name already used for some
1028 note_name_declared_in_class (id, decl);
1030 if (binding && BINDING_LEVEL (binding) == class_binding_level)
1031 /* Supplement the existing binding. */
1032 result = add_binding (id, decl);
1034 /* Create a new binding. */
1035 push_binding (id, decl, class_binding_level);
1037 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1038 class-level declaration. Note that we do not use DECL here
1039 because of the possibility of the `struct stat' hack; if DECL is
1040 a class-name or enum-name we might prefer a field-name, or some
1042 IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id));
1044 /* If this is a binding from a base class, mark it as such. */
1045 binding = IDENTIFIER_BINDING (id);
1046 if (BINDING_VALUE (binding) == decl && TREE_CODE (decl) != TREE_LIST)
1048 /* Any implicit typename must be from a base-class. The
1049 context for an implicit typename declaration is always
1050 the derived class in which the lookup was done, so the checks
1051 based on the context of DECL below will not trigger. */
1052 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl))
1053 INHERITED_VALUE_BINDING_P (binding) = 1;
1056 if (TREE_CODE (decl) == OVERLOAD)
1057 context = DECL_REAL_CONTEXT (OVL_CURRENT (decl));
1060 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd',
1062 context = DECL_REAL_CONTEXT (decl);
1065 if (is_properly_derived_from (current_class_type, context))
1066 INHERITED_VALUE_BINDING_P (binding) = 1;
1068 INHERITED_VALUE_BINDING_P (binding) = 0;
1071 else if (BINDING_VALUE (binding) == decl)
1072 /* We only encounter a TREE_LIST when push_class_decls detects an
1073 ambiguity. Such an ambiguity can be overridden by a definition
1075 INHERITED_VALUE_BINDING_P (binding) = 1;
1080 /* Remove the binding for DECL which should be the innermost binding
1084 pop_binding (id, decl)
1090 if (id == NULL_TREE)
1091 /* It's easiest to write the loops that call this function without
1092 checking whether or not the entities involved have names. We
1093 get here for such an entity. */
1096 /* Get the innermost binding for ID. */
1097 binding = IDENTIFIER_BINDING (id);
1099 /* The name should be bound. */
1100 my_friendly_assert (binding != NULL_TREE, 0);
1102 /* The DECL will be either the ordinary binding or the type
1103 binding for this identifier. Remove that binding. */
1104 if (BINDING_VALUE (binding) == decl)
1105 BINDING_VALUE (binding) = NULL_TREE;
1106 else if (BINDING_TYPE (binding) == decl)
1107 BINDING_TYPE (binding) = NULL_TREE;
1109 my_friendly_abort (0);
1111 if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding))
1112 /* We're completely done with the innermost binding for this
1113 identifier. Unhook it from the list of bindings. */
1114 IDENTIFIER_BINDING (id) = TREE_CHAIN (binding);
1117 /* When a label goes out of scope, check to see if that label was used
1118 in a valid manner, and issue any appropriate warnings or errors. */
1124 tree label = TREE_VALUE (link);
1126 if (DECL_INITIAL (label) == NULL_TREE)
1128 cp_error_at ("label `%D' used but not defined", label);
1129 /* Avoid crashing later. */
1130 define_label (input_filename, 1, DECL_NAME (label));
1132 else if (warn_unused && !TREE_USED (label))
1133 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 = current_binding_level->keep == 2
1189 ? ((functionbody = 0), tmp) : functionbody;
1190 tree tags = functionbody >= 0 ? current_binding_level->tags : 0;
1191 tree subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1192 tree block = NULL_TREE;
1194 int block_previously_created;
1195 int leaving_for_scope;
1197 my_friendly_assert (current_binding_level->parm_flag != 2,
1200 my_friendly_assert (!current_binding_level->class_shadowed,
1203 /* We used to use KEEP == 2 to indicate that the new block should go
1204 at the beginning of the list of blocks at this binding level,
1205 rather than the end. This hack is no longer used. */
1206 my_friendly_assert (keep == 0 || keep == 1, 0);
1208 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
1209 (HOST_WIDE_INT) current_binding_level->level_chain,
1210 current_binding_level->parm_flag,
1211 current_binding_level->keep);
1213 if (current_binding_level->keep == 1)
1216 /* Get the decls in the order they were written.
1217 Usually current_binding_level->names is in reverse order.
1218 But parameter decls were previously put in forward order. */
1221 current_binding_level->names
1222 = decls = nreverse (current_binding_level->names);
1224 decls = current_binding_level->names;
1226 /* Output any nested inline functions within this block
1227 if they weren't already output. */
1229 for (decl = decls; decl; decl = TREE_CHAIN (decl))
1230 if (TREE_CODE (decl) == FUNCTION_DECL
1231 && ! TREE_ASM_WRITTEN (decl)
1232 && DECL_INITIAL (decl) != NULL_TREE
1233 && TREE_ADDRESSABLE (decl)
1234 && decl_function_context (decl) == current_function_decl)
1236 /* If this decl was copied from a file-scope decl
1237 on account of a block-scope extern decl,
1238 propagate TREE_ADDRESSABLE to the file-scope decl. */
1239 if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1240 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1243 push_function_context ();
1244 output_inline_function (decl);
1245 pop_function_context ();
1249 /* If there were any declarations or structure tags in that level,
1250 or if this level is a function body,
1251 create a BLOCK to record them for the life of this function. */
1254 block_previously_created = (current_binding_level->this_block != NULL_TREE);
1255 if (block_previously_created)
1256 block = current_binding_level->this_block;
1257 else if (keep == 1 || functionbody)
1258 block = make_node (BLOCK);
1259 if (block != NULL_TREE)
1261 if (block_previously_created)
1263 if (decls || tags || subblocks)
1265 if (BLOCK_VARS (block) || BLOCK_TYPE_TAGS (block))
1266 warning ("internal compiler error: debugging info corrupted");
1268 BLOCK_VARS (block) = decls;
1269 BLOCK_TYPE_TAGS (block) = tags;
1271 /* We can have previous subblocks and new subblocks when
1272 doing fixup_gotos with complex cleanups. We chain the new
1273 subblocks onto the end of any pre-existing subblocks. */
1274 BLOCK_SUBBLOCKS (block) = chainon (BLOCK_SUBBLOCKS (block),
1277 /* If we created the block earlier on, and we are just
1278 diddling it now, then it already should have a proper
1279 BLOCK_END_NOTE value associated with it. */
1283 BLOCK_VARS (block) = decls;
1284 BLOCK_TYPE_TAGS (block) = tags;
1285 BLOCK_SUBBLOCKS (block) = subblocks;
1286 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1288 remember_end_note (block);
1292 /* In each subblock, record that this is its superior. */
1295 for (link = subblocks; link; link = TREE_CHAIN (link))
1296 BLOCK_SUPERCONTEXT (link) = block;
1298 /* We still support the old for-scope rules, whereby the variables
1299 in a for-init statement were in scope after the for-statement
1300 ended. We only use the new rules in flag_new_for_scope is
1303 = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1305 /* Remove declarations for all the DECLs in this level. */
1306 for (link = decls; link; link = TREE_CHAIN (link))
1308 if (leaving_for_scope && TREE_CODE (link) == VAR_DECL)
1311 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1315 ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1317 ns_binding = NULL_TREE;
1320 && (BINDING_LEVEL (outer_binding)
1321 == current_binding_level->level_chain))
1322 /* We have something like:
1327 and we are leaving the `for' scope. There's no reason to
1328 keep the binding of the inner `i' in this case. */
1329 pop_binding (DECL_NAME (link), link);
1330 else if ((outer_binding
1331 && (TREE_CODE (BINDING_VALUE (outer_binding))
1334 && TREE_CODE (ns_binding) == TYPE_DECL))
1335 /* Here, we have something like:
1343 We must pop the for-scope binding so we know what's a
1344 type and what isn't. */
1345 pop_binding (DECL_NAME (link), link);
1348 /* Mark this VAR_DECL as dead so that we can tell we left it
1349 there only for backward compatibility. */
1350 DECL_DEAD_FOR_LOCAL (link) = 1;
1352 /* Keep track of what should of have happenned when we
1353 popped the binding. */
1354 if (outer_binding && BINDING_VALUE (outer_binding))
1355 DECL_SHADOWED_FOR_VAR (link)
1356 = BINDING_VALUE (outer_binding);
1358 /* Add it to the list of dead variables in the next
1359 outermost binding to that we can remove these when we
1360 leave that binding. */
1361 current_binding_level->level_chain->dead_vars_from_for
1362 = tree_cons (NULL_TREE, link,
1363 current_binding_level->level_chain->
1364 dead_vars_from_for);
1366 /* Although we don't pop the CPLUS_BINDING, we do clear
1367 its BINDING_LEVEL since the level is going away now. */
1368 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1374 /* Remove the binding. */
1376 if (TREE_CODE (decl) == TREE_LIST)
1377 decl = TREE_VALUE (decl);
1378 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd')
1379 pop_binding (DECL_NAME (decl), decl);
1380 else if (TREE_CODE (decl) == OVERLOAD)
1381 pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl);
1383 my_friendly_abort (0);
1387 /* Remove declarations for any `for' variables from inner scopes
1388 that we kept around. */
1389 for (link = current_binding_level->dead_vars_from_for;
1390 link; link = TREE_CHAIN (link))
1391 pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1393 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1394 for (link = current_binding_level->type_shadowed;
1395 link; link = TREE_CHAIN (link))
1396 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1398 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1399 for (link = current_binding_level->shadowed_labels;
1401 link = TREE_CHAIN (link))
1404 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1405 list if a `using' declaration put them there. The debugging
1406 back-ends won't understand OVERLOAD, so we remove them here.
1407 Because the BLOCK_VARS are (temporarily) shared with
1408 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1409 popped all the bindings. */
1414 for (d = &BLOCK_VARS (block); *d; )
1416 if (TREE_CODE (*d) == TREE_LIST)
1417 *d = TREE_CHAIN (*d);
1419 d = &TREE_CHAIN (*d);
1423 /* If the level being exited is the top level of a function,
1424 check over all the labels. */
1427 /* Since this is the top level block of a function, the vars are
1428 the function's parameters. Don't leave them in the BLOCK
1429 because they are found in the FUNCTION_DECL instead. */
1430 BLOCK_VARS (block) = 0;
1434 /* Any uses of undefined labels now operate under constraints
1435 of next binding contour. */
1436 if (current_function)
1438 struct binding_level *level_chain;
1439 level_chain = current_binding_level->level_chain;
1442 struct named_label_list *labels;
1443 for (labels = named_label_uses; labels; labels = labels->next)
1444 if (labels->binding_level == current_binding_level)
1446 labels->binding_level = level_chain;
1447 labels->names_in_scope = level_chain->names;
1452 tmp = current_binding_level->keep;
1454 pop_binding_level ();
1456 DECL_INITIAL (current_function_decl) = block;
1459 if (!block_previously_created)
1460 current_binding_level->blocks
1461 = chainon (current_binding_level->blocks, block);
1463 /* If we did not make a block for the level just exited,
1464 any blocks made for inner levels
1465 (since they cannot be recorded as subblocks in that level)
1466 must be carried forward so they will later become subblocks
1467 of something else. */
1469 current_binding_level->blocks
1470 = chainon (current_binding_level->blocks, subblocks);
1472 /* Take care of compiler's internal binding structures. */
1475 expand_end_bindings (getdecls (), keep, 1);
1476 /* Each and every BLOCK node created here in `poplevel' is important
1477 (e.g. for proper debugging information) so if we created one
1478 earlier, mark it as "used". */
1480 TREE_USED (block) = 1;
1481 block = poplevel (keep, reverse, real_functionbody);
1484 /* Each and every BLOCK node created here in `poplevel' is important
1485 (e.g. for proper debugging information) so if we created one
1486 earlier, mark it as "used". */
1488 TREE_USED (block) = 1;
1492 /* Delete the node BLOCK from the current binding level.
1493 This is used for the block inside a stmt expr ({...})
1494 so that the block can be reinserted where appropriate. */
1497 delete_block (block)
1501 if (current_binding_level->blocks == block)
1502 current_binding_level->blocks = TREE_CHAIN (block);
1503 for (t = current_binding_level->blocks; t;)
1505 if (TREE_CHAIN (t) == block)
1506 TREE_CHAIN (t) = TREE_CHAIN (block);
1510 TREE_CHAIN (block) = NULL_TREE;
1511 /* Clear TREE_USED which is always set by poplevel.
1512 The flag is set again if insert_block is called. */
1513 TREE_USED (block) = 0;
1516 /* Insert BLOCK at the end of the list of subblocks of the
1517 current binding level. This is used when a BIND_EXPR is expanded,
1518 to handle the BLOCK node inside the BIND_EXPR. */
1521 insert_block (block)
1524 TREE_USED (block) = 1;
1525 current_binding_level->blocks
1526 = chainon (current_binding_level->blocks, block);
1529 /* Set the BLOCK node for the innermost scope
1530 (the one we are currently in). */
1534 register tree block;
1536 current_binding_level->this_block = block;
1539 /* Do a pushlevel for class declarations. */
1544 register struct binding_level *newlevel;
1546 /* Reuse or create a struct for this binding level. */
1547 #if defined(DEBUG_CP_BINDING_LEVELS)
1549 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1550 if (free_binding_level)
1551 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1553 newlevel = free_binding_level;
1554 free_binding_level = free_binding_level->level_chain;
1557 newlevel = make_binding_level ();
1559 #if defined(DEBUG_CP_BINDING_LEVELS)
1561 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1563 push_binding_level (newlevel, 0, 0);
1565 decl_stack = push_decl_level (decl_stack, &decl_obstack);
1566 class_binding_level = current_binding_level;
1567 class_binding_level->parm_flag = 2;
1570 /* ...and a poplevel for class declarations. */
1575 register struct binding_level *level = class_binding_level;
1578 my_friendly_assert (level != 0, 354);
1580 decl_stack = pop_stack_level (decl_stack);
1581 /* If we're leaving a toplevel class, don't bother to do the setting
1582 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1583 shouldn't even be used when current_class_type isn't set, and second,
1584 if we don't touch it here, we're able to use the cache effect if the
1585 next time we're entering a class scope, it is the same class. */
1586 if (current_class_depth != 1)
1588 struct binding_level* b;
1590 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1591 for (shadowed = level->class_shadowed;
1593 shadowed = TREE_CHAIN (shadowed))
1594 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE;
1596 /* Find the next enclosing class, and recreate
1597 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1598 b = level->level_chain;
1599 while (b && b->parm_flag != 2)
1603 for (shadowed = b->class_shadowed;
1605 shadowed = TREE_CHAIN (shadowed))
1609 t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed));
1610 while (t && BINDING_LEVEL (t) != b)
1614 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed))
1615 = BINDING_VALUE (t);
1619 /* Remember to save what IDENTIFIER's were bound in this scope so we
1620 can recover from cache misses. */
1622 previous_class_type = current_class_type;
1623 previous_class_values = class_binding_level->class_shadowed;
1625 for (shadowed = level->type_shadowed;
1627 shadowed = TREE_CHAIN (shadowed))
1628 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1630 /* Remove the bindings for all of the class-level declarations. */
1631 for (shadowed = level->class_shadowed;
1633 shadowed = TREE_CHAIN (shadowed))
1634 pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1636 GNU_xref_end_scope ((HOST_WIDE_INT) class_binding_level,
1637 (HOST_WIDE_INT) class_binding_level->level_chain,
1638 class_binding_level->parm_flag,
1639 class_binding_level->keep);
1641 /* Now, pop out of the binding level which we created up in the
1642 `pushlevel_class' routine. */
1643 #if defined(DEBUG_CP_BINDING_LEVELS)
1645 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1647 pop_binding_level ();
1650 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1651 for any names in enclosing classes. */
1654 clear_identifier_class_values ()
1658 if (!class_binding_level)
1661 for (t = class_binding_level->class_shadowed;
1664 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
1667 /* Returns non-zero if T is a virtual function table. */
1670 vtable_decl_p (t, data)
1672 void *data ATTRIBUTE_UNUSED;
1674 return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t));
1677 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1681 vtype_decl_p (t, data)
1683 void *data ATTRIBUTE_UNUSED;
1685 return (TREE_CODE (t) == TYPE_DECL
1686 && TREE_TYPE (t) != error_mark_node
1687 && TYPE_LANG_SPECIFIC (TREE_TYPE (t))
1688 && CLASSTYPE_VSIZE (TREE_TYPE (t)));
1691 /* Return the declarations that are members of the namespace NS. */
1694 cp_namespace_decls (ns)
1697 return NAMESPACE_LEVEL (ns)->names;
1700 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1701 itself, calling F for each. The DATA is passed to F as well. */
1704 walk_namespaces_r (namespace, f, data)
1706 walk_namespaces_fn f;
1712 result |= (*f) (namespace, data);
1714 for (current = cp_namespace_decls (namespace);
1716 current = TREE_CHAIN (current))
1718 if (TREE_CODE (current) != NAMESPACE_DECL
1719 || DECL_NAMESPACE_ALIAS (current))
1721 if (!DECL_LANG_SPECIFIC (current))
1724 my_friendly_assert (current == std_node, 393);
1728 /* We found a namespace. */
1729 result |= walk_namespaces_r (current, f, data);
1735 /* Walk all the namespaces, calling F for each. The DATA is passed to
1739 walk_namespaces (f, data)
1740 walk_namespaces_fn f;
1743 return walk_namespaces_r (global_namespace, f, data);
1746 struct walk_globals_data {
1747 walk_globals_pred p;
1752 /* Walk the global declarations in NAMESPACE. Whenever one is found
1753 for which P returns non-zero, call F with its address. If any call
1754 to F returns a non-zero value, return a non-zero value. */
1757 walk_globals_r (namespace, data)
1761 struct walk_globals_data* wgd = (struct walk_globals_data *) data;
1762 walk_globals_pred p = wgd->p;
1763 walk_globals_fn f = wgd->f;
1764 void *d = wgd->data;
1768 t = &NAMESPACE_LEVEL (namespace)->names;
1775 result |= (*f) (t, d);
1777 /* If F changed *T, then *T still points at the next item to
1780 t = &TREE_CHAIN (*t);
1786 /* Walk the global declarations. Whenever one is found for which P
1787 returns non-zero, call F with its address. If any call to F
1788 returns a non-zero value, return a non-zero value. */
1791 walk_globals (p, f, data)
1792 walk_globals_pred p;
1796 struct walk_globals_data wgd;
1801 return walk_namespaces (walk_globals_r, &wgd);
1804 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1805 DATA is non-NULL, this is the last time we will call
1806 wrapup_global_declarations for this NAMESPACE. */
1809 wrapup_globals_for_namespace (namespace, data)
1813 tree globals = cp_namespace_decls (namespace);
1814 int len = list_length (globals);
1815 tree *vec = (tree *) alloca (sizeof (tree) * len);
1819 int last_time = (data != 0);
1821 if (last_time && namespace == global_namespace)
1822 /* Let compile_file handle the global namespace. */
1825 /* Process the decls in reverse order--earliest first.
1826 Put them into VEC from back to front, then take out from front. */
1828 for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl))
1829 vec[len - i - 1] = decl;
1833 check_global_declarations (vec, len);
1837 /* Temporarily mark vtables as external. That prevents
1838 wrapup_global_declarations from writing them out; we must process
1839 them ourselves in finish_vtable_vardecl. */
1840 for (i = 0; i < len; ++i)
1841 if (vtable_decl_p (vec[i], /*data=*/0) && !DECL_EXTERNAL (vec[i]))
1843 DECL_NOT_REALLY_EXTERN (vec[i]) = 1;
1844 DECL_EXTERNAL (vec[i]) = 1;
1847 /* Write out any globals that need to be output. */
1848 result = wrapup_global_declarations (vec, len);
1850 /* Undo the hack to DECL_EXTERNAL above. */
1851 for (i = 0; i < len; ++i)
1852 if (vtable_decl_p (vec[i], /*data=*/0)
1853 && DECL_NOT_REALLY_EXTERN (vec[i]))
1855 DECL_NOT_REALLY_EXTERN (vec[i]) = 0;
1856 DECL_EXTERNAL (vec[i]) = 0;
1863 /* Mark ARG (which is really a struct binding_level **) for GC. */
1866 mark_binding_level (arg)
1869 struct binding_level *lvl = *(struct binding_level **)arg;
1873 ggc_mark_tree (lvl->names);
1874 ggc_mark_tree (lvl->tags);
1875 ggc_mark_tree (lvl->usings);
1876 ggc_mark_tree (lvl->using_directives);
1877 ggc_mark_tree (lvl->class_shadowed);
1878 ggc_mark_tree (lvl->type_shadowed);
1879 ggc_mark_tree (lvl->shadowed_labels);
1880 ggc_mark_tree (lvl->blocks);
1881 ggc_mark_tree (lvl->this_block);
1882 ggc_mark_tree (lvl->incomplete);
1883 ggc_mark_tree (lvl->dead_vars_from_for);
1885 lvl = lvl->level_chain;
1889 /* For debugging. */
1890 static int no_print_functions = 0;
1891 static int no_print_builtins = 0;
1894 print_binding_level (lvl)
1895 struct binding_level *lvl;
1899 fprintf (stderr, " blocks=");
1900 fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks);
1901 fprintf (stderr, " n_incomplete=%d parm_flag=%d keep=%d",
1902 list_length (lvl->incomplete), lvl->parm_flag, lvl->keep);
1903 if (lvl->tag_transparent)
1904 fprintf (stderr, " tag-transparent");
1905 if (lvl->more_cleanups_ok)
1906 fprintf (stderr, " more-cleanups-ok");
1907 if (lvl->have_cleanups)
1908 fprintf (stderr, " have-cleanups");
1909 fprintf (stderr, "\n");
1912 fprintf (stderr, " names:\t");
1913 /* We can probably fit 3 names to a line? */
1914 for (t = lvl->names; t; t = TREE_CHAIN (t))
1916 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
1918 if (no_print_builtins
1919 && (TREE_CODE (t) == TYPE_DECL)
1920 && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
1923 /* Function decls tend to have longer names. */
1924 if (TREE_CODE (t) == FUNCTION_DECL)
1931 fprintf (stderr, "\n\t");
1934 print_node_brief (stderr, "", t, 0);
1935 if (t == error_mark_node)
1939 fprintf (stderr, "\n");
1943 fprintf (stderr, " tags:\t");
1945 for (t = lvl->tags; t; t = TREE_CHAIN (t))
1947 if (TREE_PURPOSE (t) == NULL_TREE)
1949 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1956 fprintf (stderr, "\n\t");
1959 if (TREE_PURPOSE (t) == NULL_TREE)
1961 print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
1962 fprintf (stderr, ">");
1964 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1965 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1968 print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
1969 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1970 fprintf (stderr, ">");
1974 fprintf (stderr, "\n");
1976 if (lvl->class_shadowed)
1978 fprintf (stderr, " class-shadowed:");
1979 for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
1981 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1983 fprintf (stderr, "\n");
1985 if (lvl->type_shadowed)
1987 fprintf (stderr, " type-shadowed:");
1988 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
1990 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1992 fprintf (stderr, "\n");
1997 print_other_binding_stack (stack)
1998 struct binding_level *stack;
2000 struct binding_level *level;
2001 for (level = stack; level != global_binding_level; level = level->level_chain)
2003 fprintf (stderr, "binding level ");
2004 fprintf (stderr, HOST_PTR_PRINTF, level);
2005 fprintf (stderr, "\n");
2006 print_binding_level (level);
2011 print_binding_stack ()
2013 struct binding_level *b;
2014 fprintf (stderr, "current_binding_level=");
2015 fprintf (stderr, HOST_PTR_PRINTF, current_binding_level);
2016 fprintf (stderr, "\nclass_binding_level=");
2017 fprintf (stderr, HOST_PTR_PRINTF, class_binding_level);
2018 fprintf (stderr, "\nglobal_binding_level=");
2019 fprintf (stderr, HOST_PTR_PRINTF, global_binding_level);
2020 fprintf (stderr, "\n");
2021 if (class_binding_level)
2023 for (b = class_binding_level; b; b = b->level_chain)
2024 if (b == current_binding_level)
2027 b = class_binding_level;
2029 b = current_binding_level;
2032 b = current_binding_level;
2033 print_other_binding_stack (b);
2034 fprintf (stderr, "global:\n");
2035 print_binding_level (global_binding_level);
2038 /* Namespace binding access routines: The namespace_bindings field of
2039 the identifier is polymorphic, with three possible values:
2040 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2041 indicating the BINDING_VALUE of global_namespace. */
2043 /* Check whether the a binding for the name to scope is known.
2044 Assumes that the bindings of the name are already a list
2045 of bindings. Returns the binding found, or NULL_TREE. */
2048 find_binding (name, scope)
2052 tree iter, prev = NULL_TREE;
2054 scope = ORIGINAL_NAMESPACE (scope);
2056 for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
2057 iter = TREE_CHAIN (iter))
2059 my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
2060 if (BINDING_SCOPE (iter) == scope)
2062 /* Move binding found to the front of the list, so
2063 subsequent lookups will find it faster. */
2066 TREE_CHAIN (prev) = TREE_CHAIN (iter);
2067 TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
2068 IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
2077 /* Always returns a binding for name in scope. If the
2078 namespace_bindings is not a list, convert it to one first.
2079 If no binding is found, make a new one. */
2082 binding_for_name (name, scope)
2086 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2089 scope = ORIGINAL_NAMESPACE (scope);
2091 if (b && TREE_CODE (b) != CPLUS_BINDING)
2093 /* Get rid of optimization for global scope. */
2094 IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
2095 BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
2096 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2098 if (b && (result = find_binding (name, scope)))
2100 /* Not found, make a new permanent one. */
2101 push_obstacks (&permanent_obstack, &permanent_obstack);
2102 result = make_node (CPLUS_BINDING);
2103 TREE_CHAIN (result) = b;
2104 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
2105 BINDING_SCOPE (result) = scope;
2106 BINDING_TYPE (result) = NULL_TREE;
2107 BINDING_VALUE (result) = NULL_TREE;
2112 /* Return the binding value for name in scope, considering that
2113 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2116 namespace_binding (name, scope)
2120 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2123 if (scope == NULL_TREE)
2124 scope = global_namespace;
2125 if (TREE_CODE (b) != CPLUS_BINDING)
2126 return (scope == global_namespace) ? b : NULL_TREE;
2127 name = find_binding (name,scope);
2128 if (name == NULL_TREE)
2130 return BINDING_VALUE (name);
2133 /* Set the binding value for name in scope. If modifying the binding
2134 of global_namespace is attempted, try to optimize it. */
2137 set_namespace_binding (name, scope, val)
2144 if (scope == NULL_TREE)
2145 scope = global_namespace;
2147 if (scope == global_namespace)
2149 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2150 if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
2152 IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
2156 b = binding_for_name (name, scope);
2157 BINDING_VALUE (b) = val;
2160 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2161 select a name that is unique to this compilation unit. */
2164 push_namespace (name)
2169 int implicit_use = 0;
2171 if (!global_namespace)
2173 /* This must be ::. */
2174 my_friendly_assert (name == get_identifier ("::"), 377);
2179 /* The name of anonymous namespace is unique for the translation
2181 if (!anonymous_namespace_name)
2182 anonymous_namespace_name = get_file_function_name ('N');
2183 name = anonymous_namespace_name;
2184 d = IDENTIFIER_NAMESPACE_VALUE (name);
2186 /* Reopening anonymous namespace. */
2190 else if (current_namespace == global_namespace
2191 && name == DECL_NAME (std_node))
2198 /* Check whether this is an extended namespace definition. */
2199 d = IDENTIFIER_NAMESPACE_VALUE (name);
2200 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2203 if (DECL_NAMESPACE_ALIAS (d))
2205 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2206 d, DECL_NAMESPACE_ALIAS (d));
2207 d = DECL_NAMESPACE_ALIAS (d);
2214 /* Make a new namespace, binding the name to it. */
2215 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2216 /* The global namespace is not pushed, and the global binding
2217 level is set elsewhere. */
2222 declare_namespace_level ();
2223 NAMESPACE_LEVEL (d) = current_binding_level;
2227 resume_binding_level (NAMESPACE_LEVEL (d));
2230 do_using_directive (d);
2231 /* Enter the name space. */
2232 current_namespace = d;
2235 /* Pop from the scope of the current namespace. */
2240 if (current_namespace == global_namespace)
2242 my_friendly_assert (in_std>0, 980421);
2246 current_namespace = CP_DECL_CONTEXT (current_namespace);
2247 /* The binding level is not popped, as it might be re-opened later. */
2248 suspend_binding_level ();
2251 /* Push into the scope of the namespace NS, even if it is deeply
2252 nested within another namespace. */
2255 push_nested_namespace (ns)
2258 if (ns == global_namespace)
2259 push_to_top_level ();
2262 push_nested_namespace (CP_DECL_CONTEXT (ns));
2263 push_namespace (DECL_NAME (ns));
2267 /* Pop back from the scope of the namespace NS, which was previously
2268 entered with push_nested_namespace. */
2271 pop_nested_namespace (ns)
2274 while (ns != global_namespace)
2277 ns = CP_DECL_CONTEXT (ns);
2280 pop_from_top_level ();
2284 /* Subroutines for reverting temporarily to top-level for instantiation
2285 of templates and such. We actually need to clear out the class- and
2286 local-value slots of all identifiers, so that only the global values
2287 are at all visible. Simply setting current_binding_level to the global
2288 scope isn't enough, because more binding levels may be pushed. */
2289 struct saved_scope *scope_chain;
2291 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2294 mark_saved_scope (arg)
2297 struct saved_scope *t = *(struct saved_scope **)arg;
2300 mark_binding_level (&t->class_bindings);
2301 ggc_mark_tree (t->old_bindings);
2302 ggc_mark_tree (t->old_namespace);
2303 ggc_mark_tree (t->class_name);
2304 ggc_mark_tree (t->class_type);
2305 ggc_mark_tree (t->access_specifier);
2306 ggc_mark_tree (t->function_decl);
2308 ggc_mark_tree_varray (t->lang_base);
2309 ggc_mark_tree (t->lang_name);
2310 ggc_mark_tree (t->x_function_parms);
2311 ggc_mark_tree (t->template_parms);
2312 ggc_mark_tree (t->x_previous_class_type);
2313 ggc_mark_tree (t->x_previous_class_values);
2314 mark_binding_level (&t->bindings);
2320 store_bindings (names, old_bindings)
2321 tree names, old_bindings;
2324 for (t = names; t; t = TREE_CHAIN (t))
2326 tree binding, t1, id;
2328 if (TREE_CODE (t) == TREE_LIST)
2329 id = TREE_PURPOSE (t);
2334 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2335 we have no IDENTIFIER_BINDING if we have left the class
2336 scope, but cached the class-level declarations. */
2337 || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2340 for (t1 = old_bindings; t1; t1 = TREE_CHAIN (t1))
2341 if (TREE_VEC_ELT (t1, 0) == id)
2344 binding = make_tree_vec (4);
2348 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2349 TREE_VEC_ELT (binding, 0) = id;
2350 TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2351 TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2352 TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2353 IDENTIFIER_BINDING (id) = NULL_TREE;
2354 IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2356 TREE_CHAIN (binding) = old_bindings;
2357 old_bindings = binding;
2361 return old_bindings;
2365 maybe_push_to_top_level (pseudo)
2368 struct saved_scope *s;
2369 struct binding_level *b;
2373 s = (struct saved_scope *) xcalloc (1, sizeof (struct saved_scope));
2375 b = scope_chain ? current_binding_level : 0;
2377 /* If we're in the middle of some function, save our state. */
2378 if (current_function)
2381 push_function_context_to (NULL_TREE);
2386 old_bindings = NULL_TREE;
2387 if (scope_chain && previous_class_type)
2388 old_bindings = store_bindings (previous_class_values, old_bindings);
2390 /* Have to include global_binding_level, because class-level decls
2391 aren't listed anywhere useful. */
2392 for (; b; b = b->level_chain)
2396 /* Template IDs are inserted into the global level. If they were
2397 inserted into namespace level, finish_file wouldn't find them
2398 when doing pending instantiations. Therefore, don't stop at
2399 namespace level, but continue until :: . */
2400 if (b == global_binding_level || (pseudo && b->pseudo_global))
2403 old_bindings = store_bindings (b->names, old_bindings);
2404 /* We also need to check class_shadowed to save class-level type
2405 bindings, since pushclass doesn't fill in b->names. */
2406 if (b->parm_flag == 2)
2407 old_bindings = store_bindings (b->class_shadowed, old_bindings);
2409 /* Unwind type-value slots back to top level. */
2410 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2411 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2413 s->prev = scope_chain;
2414 s->old_bindings = old_bindings;
2416 s->need_pop_function_context = need_pop;
2417 s->function_decl = current_function_decl;
2420 current_function_decl = NULL_TREE;
2421 VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
2422 current_lang_stack = &VARRAY_TREE (current_lang_base, 0);
2423 current_lang_name = lang_name_cplusplus;
2424 strict_prototype = strict_prototypes_lang_cplusplus;
2425 current_namespace = global_namespace;
2427 push_obstacks (&permanent_obstack, &permanent_obstack);
2431 push_to_top_level ()
2433 maybe_push_to_top_level (0);
2437 pop_from_top_level ()
2439 struct saved_scope *s = scope_chain;
2442 /* Clear out class-level bindings cache. */
2443 if (previous_class_type)
2444 invalidate_class_lookup_cache ();
2448 VARRAY_FREE (current_lang_base);
2450 scope_chain = s->prev;
2451 for (t = s->old_bindings; t; t = TREE_CHAIN (t))
2453 tree id = TREE_VEC_ELT (t, 0);
2456 SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2457 IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2458 IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2462 if (current_lang_name == lang_name_cplusplus)
2463 strict_prototype = strict_prototypes_lang_cplusplus;
2464 else if (current_lang_name == lang_name_c)
2465 strict_prototype = strict_prototypes_lang_c;
2467 /* If we were in the middle of compiling a function, restore our
2469 if (s->need_pop_function_context)
2470 pop_function_context_from (NULL_TREE);
2471 current_function_decl = s->function_decl;
2476 /* Push a definition of struct, union or enum tag "name".
2477 into binding_level "b". "type" should be the type node,
2478 We assume that the tag "name" is not already defined.
2480 Note that the definition may really be just a forward reference.
2481 In that case, the TYPE_SIZE will be a NULL_TREE.
2483 C++ gratuitously puts all these tags in the name space. */
2485 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2486 record the shadowed value for this binding contour. TYPE is
2487 the type that ID maps to. */
2490 set_identifier_type_value_with_scope (id, type, b)
2493 struct binding_level *b;
2495 if (!b->namespace_p)
2497 /* Shadow the marker, not the real thing, so that the marker
2498 gets restored later. */
2499 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2501 = tree_cons (id, old_type_value, b->type_shadowed);
2505 tree binding = binding_for_name (id, current_namespace);
2506 BINDING_TYPE (binding) = type;
2507 /* Store marker instead of real type. */
2508 type = global_type_node;
2510 SET_IDENTIFIER_TYPE_VALUE (id, type);
2513 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2516 set_identifier_type_value (id, type)
2520 set_identifier_type_value_with_scope (id, type, current_binding_level);
2523 /* Return the type associated with id. */
2526 identifier_type_value (id)
2529 /* There is no type with that name, anywhere. */
2530 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2532 /* This is not the type marker, but the real thing. */
2533 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2534 return REAL_IDENTIFIER_TYPE_VALUE (id);
2535 /* Have to search for it. It must be on the global level, now.
2536 Ask lookup_name not to return non-types. */
2537 id = lookup_name_real (id, 2, 1, 0);
2539 return TREE_TYPE (id);
2543 /* Pop off extraneous binding levels left over due to syntax errors.
2545 We don't pop past namespaces, as they might be valid. */
2550 #ifdef DEBUG_CP_BINDING_LEVELS
2551 fprintf (stderr, "XXX entering pop_everything ()\n");
2553 while (!toplevel_bindings_p ())
2555 if (current_binding_level->parm_flag == 2)
2556 pop_nested_class ();
2560 #ifdef DEBUG_CP_BINDING_LEVELS
2561 fprintf (stderr, "XXX leaving pop_everything ()\n");
2565 /* The type TYPE is being declared. If it is a class template, or a
2566 specialization of a class template, do any processing required and
2567 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2568 being declared a friend. B is the binding level at which this TYPE
2571 Returns the TYPE_DECL for TYPE, which may have been altered by this
2575 maybe_process_template_type_declaration (type, globalize, b)
2578 struct binding_level* b;
2580 tree decl = TYPE_NAME (type);
2582 if (processing_template_parmlist)
2583 /* You can't declare a new template type in a template parameter
2584 list. But, you can declare a non-template type:
2586 template <class A*> struct S;
2588 is a forward-declaration of `A'. */
2592 maybe_check_template_type (type);
2594 my_friendly_assert (IS_AGGR_TYPE (type)
2595 || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2598 if (processing_template_decl)
2600 /* This may change after the call to
2601 push_template_decl_real, but we want the original value. */
2602 tree name = DECL_NAME (decl);
2604 decl = push_template_decl_real (decl, globalize);
2605 /* If the current binding level is the binding level for the
2606 template parameters (see the comment in
2607 begin_template_parm_list) and the enclosing level is a class
2608 scope, and we're not looking at a friend, push the
2609 declaration of the member class into the class scope. In the
2610 friend case, push_template_decl will already have put the
2611 friend into global scope, if appropriate. */
2612 if (TREE_CODE (type) != ENUMERAL_TYPE
2613 && !globalize && b->pseudo_global
2614 && b->level_chain->parm_flag == 2)
2616 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2617 /* Put this tag on the list of tags for the class, since
2618 that won't happen below because B is not the class
2619 binding level, but is instead the pseudo-global level. */
2620 b->level_chain->tags =
2621 tree_cons (name, type, b->level_chain->tags);
2622 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2623 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2631 /* In C++, you don't have to write `struct S' to refer to `S'; you
2632 can just use `S'. We accomplish this by creating a TYPE_DECL as
2633 if the user had written `typedef struct S S'. Create and return
2634 the TYPE_DECL for TYPE. */
2637 create_implicit_typedef (name, type)
2643 decl = build_decl (TYPE_DECL, name, type);
2644 SET_DECL_ARTIFICIAL (decl);
2645 /* There are other implicit type declarations, like the one *within*
2646 a class that allows you to write `S::S'. We must distinguish
2648 SET_DECL_IMPLICIT_TYPEDEF_P (decl);
2649 TYPE_NAME (type) = decl;
2654 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2655 Normally put it into the inner-most non-tag-transparent scope,
2656 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2657 The latter is needed for implicit declarations. */
2660 pushtag (name, type, globalize)
2664 register struct binding_level *b;
2666 b = current_binding_level;
2667 while (b->tag_transparent
2668 || (globalize && b->parm_flag == 2))
2671 b->tags = tree_cons (name, type, b->tags);
2675 /* Do C++ gratuitous typedefing. */
2676 if (IDENTIFIER_TYPE_VALUE (name) != type)
2678 register tree d = NULL_TREE;
2680 tree context = TYPE_CONTEXT (type);
2684 tree cs = current_scope ();
2688 else if (cs != NULL_TREE
2689 && TREE_CODE_CLASS (TREE_CODE (cs)) == 't')
2690 /* When declaring a friend class of a local class, we want
2691 to inject the newly named class into the scope
2692 containing the local class, not the namespace scope. */
2693 context = hack_decl_function_context (get_type_decl (cs));
2696 context = current_namespace;
2698 if ((b->pseudo_global && b->level_chain->parm_flag == 2)
2699 || b->parm_flag == 2)
2702 if (current_lang_name == lang_name_java)
2703 TYPE_FOR_JAVA (type) = 1;
2705 d = create_implicit_typedef (name, type);
2706 DECL_CONTEXT (d) = FROB_CONTEXT (context);
2708 set_identifier_type_value_with_scope (name, type, b);
2710 d = maybe_process_template_type_declaration (type,
2713 if (b->parm_flag == 2)
2715 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2716 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2717 class. But if it's a member template class, we
2718 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2720 finish_member_declaration (d);
2722 pushdecl_class_level (d);
2725 d = pushdecl_with_scope (d, b);
2727 if (ANON_AGGRNAME_P (name))
2728 DECL_IGNORED_P (d) = 1;
2730 TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2731 DECL_ASSEMBLER_NAME (d) = DECL_NAME (d);
2732 if (!uses_template_parms (type))
2733 DECL_ASSEMBLER_NAME (d)
2734 = get_identifier (build_overload_name (type, 1, 1));
2736 if (b->parm_flag == 2)
2738 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2739 CLASSTYPE_TAGS (current_class_type) = b->tags;
2743 if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2744 /* Use the canonical TYPE_DECL for this node. */
2745 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2748 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2749 will be the tagged type we just added to the current
2750 binding level. This fake NULL-named TYPE_DECL node helps
2751 dwarfout.c to know when it needs to output a
2752 representation of a tagged type, and it also gives us a
2753 convenient place to record the "scope start" address for
2756 tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2757 TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2761 /* Counter used to create anonymous type names. */
2763 static int anon_cnt = 0;
2765 /* Return an IDENTIFIER which can be used as a name for
2766 anonymous structs and unions. */
2773 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2774 return get_identifier (buf);
2777 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2778 This keeps dbxout from getting confused. */
2783 register struct binding_level *b;
2785 static int last_cnt = 0;
2787 /* Fast out if no new anon names were declared. */
2788 if (last_cnt == anon_cnt)
2791 b = current_binding_level;
2792 while (b->tag_transparent)
2797 /* A NULL purpose means we have already processed all tags
2798 from here to the end of the list. */
2799 if (TREE_PURPOSE (tags) == NULL_TREE)
2801 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2802 TREE_PURPOSE (tags) = NULL_TREE;
2803 tags = TREE_CHAIN (tags);
2805 last_cnt = anon_cnt;
2808 /* Subroutine of duplicate_decls: return truthvalue of whether
2809 or not types of these decls match.
2811 For C++, we must compare the parameter list so that `int' can match
2812 `int&' in a parameter position, but `int&' is not confused with
2816 decls_match (newdecl, olddecl)
2817 tree newdecl, olddecl;
2821 if (newdecl == olddecl)
2824 if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
2825 /* If the two DECLs are not even the same kind of thing, we're not
2826 interested in their types. */
2829 if (TREE_CODE (newdecl) == FUNCTION_DECL)
2831 tree f1 = TREE_TYPE (newdecl);
2832 tree f2 = TREE_TYPE (olddecl);
2833 tree p1 = TYPE_ARG_TYPES (f1);
2834 tree p2 = TYPE_ARG_TYPES (f2);
2836 if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl)
2837 && ! (DECL_LANGUAGE (newdecl) == lang_c
2838 && DECL_LANGUAGE (olddecl) == lang_c))
2841 /* When we parse a static member function definition,
2842 we put together a FUNCTION_DECL which thinks its type
2843 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2845 if (TREE_CODE (f1) == METHOD_TYPE && DECL_STATIC_FUNCTION_P (olddecl))
2846 revert_static_member_fn (&newdecl, &f1, &p1);
2847 else if (TREE_CODE (f2) == METHOD_TYPE
2848 && DECL_STATIC_FUNCTION_P (newdecl))
2849 revert_static_member_fn (&olddecl, &f2, &p2);
2851 /* Here we must take care of the case where new default
2852 parameters are specified. Also, warn if an old
2853 declaration becomes ambiguous because default
2854 parameters may cause the two to be ambiguous. */
2855 if (TREE_CODE (f1) != TREE_CODE (f2))
2857 if (TREE_CODE (f1) == OFFSET_TYPE)
2858 cp_compiler_error ("`%D' redeclared as member function", newdecl);
2860 cp_compiler_error ("`%D' redeclared as non-member function", newdecl);
2864 if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
2866 if (! strict_prototypes_lang_c && DECL_LANGUAGE (olddecl) == lang_c
2869 types_match = self_promoting_args_p (p1);
2870 if (p1 == void_list_node)
2871 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2873 else if (!strict_prototypes_lang_c && DECL_LANGUAGE (olddecl)==lang_c
2874 && DECL_LANGUAGE (newdecl) == lang_c && p1 == NULL_TREE)
2876 types_match = self_promoting_args_p (p2);
2877 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2880 types_match = compparms (p1, p2);
2885 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
2887 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
2888 DECL_TEMPLATE_PARMS (olddecl)))
2891 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
2894 types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
2895 DECL_TEMPLATE_RESULT (newdecl));
2899 if (TREE_TYPE (newdecl) == error_mark_node)
2900 types_match = TREE_TYPE (olddecl) == error_mark_node;
2901 else if (TREE_TYPE (olddecl) == NULL_TREE)
2902 types_match = TREE_TYPE (newdecl) == NULL_TREE;
2903 else if (TREE_TYPE (newdecl) == NULL_TREE)
2906 types_match = comptypes (TREE_TYPE (newdecl),
2907 TREE_TYPE (olddecl),
2908 COMPARE_REDECLARATION);
2914 /* If NEWDECL is `static' and an `extern' was seen previously,
2915 warn about it. OLDDECL is the previous declaration.
2917 Note that this does not apply to the C++ case of declaring
2918 a variable `extern const' and then later `const'.
2920 Don't complain about built-in functions, since they are beyond
2921 the user's control. */
2924 warn_extern_redeclared_static (newdecl, olddecl)
2925 tree newdecl, olddecl;
2927 static const char *explicit_extern_static_warning
2928 = "`%D' was declared `extern' and later `static'";
2929 static const char *implicit_extern_static_warning
2930 = "`%D' was declared implicitly `extern' and later `static'";
2934 if (TREE_CODE (newdecl) == TYPE_DECL)
2937 /* Don't get confused by static member functions; that's a different
2939 if (TREE_CODE (newdecl) == FUNCTION_DECL
2940 && DECL_STATIC_FUNCTION_P (newdecl))
2943 /* If the old declaration was `static', or the new one isn't, then
2944 then everything is OK. */
2945 if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
2948 /* It's OK to declare a builtin function as `static'. */
2949 if (TREE_CODE (olddecl) == FUNCTION_DECL
2950 && DECL_ARTIFICIAL (olddecl))
2953 name = DECL_ASSEMBLER_NAME (newdecl);
2954 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
2955 ? implicit_extern_static_warning
2956 : explicit_extern_static_warning, newdecl);
2957 cp_pedwarn_at ("previous declaration of `%D'", olddecl);
2960 /* Handle when a new declaration NEWDECL has the same name as an old
2961 one OLDDECL in the same binding contour. Prints an error message
2964 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2965 Otherwise, return 0. */
2968 duplicate_decls (newdecl, olddecl)
2969 tree newdecl, olddecl;
2971 unsigned olddecl_uid = DECL_UID (olddecl);
2972 int olddecl_friend = 0, types_match = 0;
2973 int new_defines_function = 0;
2975 if (newdecl == olddecl)
2978 types_match = decls_match (newdecl, olddecl);
2980 /* If either the type of the new decl or the type of the old decl is an
2981 error_mark_node, then that implies that we have already issued an
2982 error (earlier) for some bogus type specification, and in that case,
2983 it is rather pointless to harass the user with yet more error message
2984 about the same declaration, so just pretend the types match here. */
2985 if (TREE_TYPE (newdecl) == error_mark_node
2986 || TREE_TYPE (olddecl) == error_mark_node)
2989 /* Check for redeclaration and other discrepancies. */
2990 if (TREE_CODE (olddecl) == FUNCTION_DECL
2991 && DECL_ARTIFICIAL (olddecl))
2993 if (TREE_CODE (newdecl) != FUNCTION_DECL)
2995 /* If you declare a built-in or predefined function name as static,
2996 the old definition is overridden, but optionally warn this was a
2997 bad choice of name. */
2998 if (! TREE_PUBLIC (newdecl))
3001 cp_warning ("shadowing %s function `%#D'",
3002 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3004 /* Discard the old built-in function. */
3007 /* If the built-in is not ansi, then programs can override
3008 it even globally without an error. */
3009 else if (! DECL_BUILT_IN (olddecl))
3010 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3014 cp_error ("declaration of `%#D'", newdecl);
3015 cp_error ("conflicts with built-in declaration `%#D'",
3020 else if (!types_match)
3022 if ((DECL_LANGUAGE (newdecl) == lang_c
3023 && DECL_LANGUAGE (olddecl) == lang_c)
3024 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3025 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3027 /* A near match; override the builtin. */
3029 if (TREE_PUBLIC (newdecl))
3031 cp_warning ("new declaration `%#D'", newdecl);
3032 cp_warning ("ambiguates built-in declaration `%#D'",
3035 else if (warn_shadow)
3036 cp_warning ("shadowing %s function `%#D'",
3037 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3041 /* Discard the old built-in function. */
3045 if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
3047 /* If a builtin function is redeclared as `static', merge
3048 the declarations, but make the original one static. */
3049 DECL_THIS_STATIC (olddecl) = 1;
3050 TREE_PUBLIC (olddecl) = 0;
3053 else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3055 if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3056 && TREE_CODE (newdecl) != TYPE_DECL
3057 && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3058 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3059 || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3060 && TREE_CODE (olddecl) != TYPE_DECL
3061 && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3062 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3065 /* We do nothing special here, because C++ does such nasty
3066 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3067 get shadowed, and know that if we need to find a TYPE_DECL
3068 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3069 slot of the identifier. */
3073 if ((TREE_CODE (newdecl) == FUNCTION_DECL
3074 && DECL_FUNCTION_TEMPLATE_P (olddecl))
3075 || (TREE_CODE (olddecl) == FUNCTION_DECL
3076 && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3079 cp_error ("`%#D' redeclared as different kind of symbol", newdecl);
3080 if (TREE_CODE (olddecl) == TREE_LIST)
3081 olddecl = TREE_VALUE (olddecl);
3082 cp_error_at ("previous declaration of `%#D'", olddecl);
3084 /* New decl is completely inconsistent with the old one =>
3085 tell caller to replace the old one. */
3089 else if (!types_match)
3091 if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl))
3092 /* These are certainly not duplicate declarations; they're
3093 from different scopes. */
3096 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3098 /* The name of a class template may not be declared to refer to
3099 any other template, class, function, object, namespace, value,
3100 or type in the same scope. */
3101 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3102 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3104 cp_error ("declaration of template `%#D'", newdecl);
3105 cp_error_at ("conflicts with previous declaration `%#D'",
3108 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3109 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3110 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3111 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3112 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3113 DECL_TEMPLATE_PARMS (olddecl)))
3115 cp_error ("new declaration `%#D'", newdecl);
3116 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3120 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3122 if (DECL_LANGUAGE (newdecl) == lang_c
3123 && DECL_LANGUAGE (olddecl) == lang_c)
3125 cp_error ("declaration of C function `%#D' conflicts with",
3127 cp_error_at ("previous declaration `%#D' here", olddecl);
3129 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3130 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3132 cp_error ("new declaration `%#D'", newdecl);
3133 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3139 /* Already complained about this, so don't do so again. */
3140 else if (current_class_type == NULL_TREE
3141 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3143 cp_error ("conflicting types for `%#D'", newdecl);
3144 cp_error_at ("previous declaration as `%#D'", olddecl);
3147 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3148 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3149 && (!DECL_TEMPLATE_INFO (newdecl)
3150 || (DECL_TI_TEMPLATE (newdecl)
3151 != DECL_TI_TEMPLATE (olddecl))))
3152 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3153 && (!DECL_TEMPLATE_INFO (olddecl)
3154 || (DECL_TI_TEMPLATE (olddecl)
3155 != DECL_TI_TEMPLATE (newdecl))))))
3156 /* It's OK to have a template specialization and a non-template
3157 with the same type, or to have specializations of two
3158 different templates with the same type. Note that if one is a
3159 specialization, and the other is an instantiation of the same
3160 template, that we do not exit at this point. That situation
3161 can occur if we instantiate a template class, and then
3162 specialize one of its methods. This situation is legal, but
3163 the declarations must be merged in the usual way. */
3165 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3166 && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3167 && !DECL_USE_TEMPLATE (newdecl))
3168 || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3169 && !DECL_USE_TEMPLATE (olddecl))))
3170 /* One of the declarations is a template instantiation, and the
3171 other is not a template at all. That's OK. */
3173 else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3174 && DECL_NAMESPACE_ALIAS (newdecl)
3175 && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3176 /* Redeclaration of namespace alias, ignore it. */
3180 const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3183 cp_error (errmsg, newdecl);
3184 if (DECL_NAME (olddecl) != NULL_TREE)
3185 cp_error_at ((DECL_INITIAL (olddecl)
3186 && namespace_bindings_p ())
3187 ? "`%#D' previously defined here"
3188 : "`%#D' previously declared here", olddecl);
3190 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3191 && DECL_INITIAL (olddecl) != NULL_TREE
3192 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3193 && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3195 /* Prototype decl follows defn w/o prototype. */
3196 cp_warning_at ("prototype for `%#D'", newdecl);
3197 cp_warning_at ("follows non-prototype definition here", olddecl);
3199 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3200 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3202 /* extern "C" int foo ();
3203 int foo () { bar (); }
3205 if (current_lang_stack
3206 == &VARRAY_TREE (current_lang_base, 0))
3207 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3210 cp_error_at ("previous declaration of `%#D' with %L linkage",
3211 olddecl, DECL_LANGUAGE (olddecl));
3212 cp_error ("conflicts with new declaration with %L linkage",
3213 DECL_LANGUAGE (newdecl));
3217 if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3219 else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3221 tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3222 tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3225 if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3226 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3228 for (; t1 && t1 != void_list_node;
3229 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3230 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3232 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3237 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3239 cp_pedwarn_at ("after previous specification in `%#D'",
3245 cp_error ("default argument given for parameter %d of `%#D'",
3247 cp_error_at ("after previous specification in `%#D'",
3252 if (DECL_THIS_INLINE (newdecl) && ! DECL_THIS_INLINE (olddecl)
3253 && TREE_ADDRESSABLE (olddecl) && warn_inline)
3255 cp_warning ("`%#D' was used before it was declared inline",
3257 cp_warning_at ("previous non-inline declaration here",
3263 /* If new decl is `static' and an `extern' was seen previously,
3265 warn_extern_redeclared_static (newdecl, olddecl);
3267 /* We have committed to returning 1 at this point. */
3268 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3270 /* Now that functions must hold information normally held
3271 by field decls, there is extra work to do so that
3272 declaration information does not get destroyed during
3274 if (DECL_VINDEX (olddecl))
3275 DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3276 if (DECL_CONTEXT (olddecl))
3277 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3278 if (DECL_CLASS_CONTEXT (olddecl))
3279 DECL_CLASS_CONTEXT (newdecl) = DECL_CLASS_CONTEXT (olddecl);
3280 if (DECL_PENDING_INLINE_INFO (newdecl) == (struct pending_inline *)0)
3281 DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3282 DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3283 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3284 DECL_ABSTRACT_VIRTUAL_P (newdecl) |= DECL_ABSTRACT_VIRTUAL_P (olddecl);
3285 DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3286 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3287 DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
3288 new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3290 /* Optionally warn about more than one declaration for the same
3291 name, but don't warn about a function declaration followed by a
3293 if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3294 && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3295 /* Don't warn about extern decl followed by definition. */
3296 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3297 /* Don't warn about friends, let add_friend take care of it. */
3298 && ! DECL_FRIEND_P (newdecl))
3300 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl);
3301 cp_warning_at ("previous declaration of `%D'", olddecl);
3305 /* Deal with C++: must preserve virtual function table size. */
3306 if (TREE_CODE (olddecl) == TYPE_DECL)
3308 register tree newtype = TREE_TYPE (newdecl);
3309 register tree oldtype = TREE_TYPE (olddecl);
3311 if (newtype != error_mark_node && oldtype != error_mark_node
3312 && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3314 CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3315 CLASSTYPE_FRIEND_CLASSES (newtype)
3316 = CLASSTYPE_FRIEND_CLASSES (oldtype);
3320 /* Copy all the DECL_... slots specified in the new decl
3321 except for any that we copy here from the old type. */
3322 DECL_MACHINE_ATTRIBUTES (newdecl)
3323 = merge_machine_decl_attributes (olddecl, newdecl);
3325 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3327 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl),
3328 DECL_TEMPLATE_RESULT (olddecl)))
3329 cp_error ("invalid redeclaration of %D", newdecl);
3330 TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3331 DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3332 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3333 DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3340 /* Automatically handles default parameters. */
3341 tree oldtype = TREE_TYPE (olddecl);
3344 /* Make sure we put the new type in the same obstack as the old one. */
3346 push_obstacks (TYPE_OBSTACK (oldtype), TYPE_OBSTACK (oldtype));
3348 push_permanent_obstack ();
3350 /* Merge the data types specified in the two decls. */
3351 newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3353 if (TREE_CODE (newdecl) == VAR_DECL)
3354 DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3355 /* Do this after calling `common_type' so that default
3356 parameters don't confuse us. */
3357 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3358 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3359 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3361 TREE_TYPE (newdecl) = build_exception_variant (newtype,
3362 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3363 TREE_TYPE (olddecl) = build_exception_variant (newtype,
3364 TYPE_RAISES_EXCEPTIONS (oldtype));
3366 if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3367 && DECL_SOURCE_LINE (olddecl) != 0
3369 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
3370 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
3372 cp_error ("declaration of `%F' throws different exceptions",
3374 cp_error_at ("to previous declaration `%F'", olddecl);
3377 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3379 /* Lay the type out, unless already done. */
3380 if (! same_type_p (newtype, oldtype)
3381 && TREE_TYPE (newdecl) != error_mark_node
3382 && !(processing_template_decl && uses_template_parms (newdecl)))
3383 layout_type (TREE_TYPE (newdecl));
3385 if ((TREE_CODE (newdecl) == VAR_DECL
3386 || TREE_CODE (newdecl) == PARM_DECL
3387 || TREE_CODE (newdecl) == RESULT_DECL
3388 || TREE_CODE (newdecl) == FIELD_DECL
3389 || TREE_CODE (newdecl) == TYPE_DECL)
3390 && !(processing_template_decl && uses_template_parms (newdecl)))
3391 layout_decl (newdecl, 0);
3393 /* Merge the type qualifiers. */
3394 if (TREE_READONLY (newdecl))
3395 TREE_READONLY (olddecl) = 1;
3396 if (TREE_THIS_VOLATILE (newdecl))
3397 TREE_THIS_VOLATILE (olddecl) = 1;
3399 /* Merge the initialization information. */
3400 if (DECL_INITIAL (newdecl) == NULL_TREE
3401 && DECL_INITIAL (olddecl) != NULL_TREE)
3403 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3404 DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3405 DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3406 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
3407 && DECL_LANG_SPECIFIC (newdecl)
3408 && DECL_LANG_SPECIFIC (olddecl))
3409 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3412 /* Merge the section attribute.
3413 We want to issue an error if the sections conflict but that must be
3414 done later in decl_attributes since we are called before attributes
3416 if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3417 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3419 /* Keep the old rtl since we can safely use it. */
3420 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3424 /* If cannot merge, then use the new type and qualifiers,
3425 and don't preserve the old rtl. */
3428 /* Clean out any memory we had of the old declaration. */
3429 tree oldstatic = value_member (olddecl, static_aggregates);
3431 TREE_VALUE (oldstatic) = error_mark_node;
3433 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3434 TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3435 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3436 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3439 /* Merge the storage class information. */
3440 DECL_WEAK (newdecl) |= DECL_WEAK (olddecl);
3441 DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3442 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3443 TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3444 if (! DECL_EXTERNAL (olddecl))
3445 DECL_EXTERNAL (newdecl) = 0;
3447 if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3449 DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3450 DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3451 DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3452 DECL_TEMPLATE_INSTANTIATED (newdecl)
3453 |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3454 /* Don't really know how much of the language-specific
3455 values we should copy from old to new. */
3456 DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3457 DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3458 DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3459 DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3460 olddecl_friend = DECL_FRIEND_P (olddecl);
3462 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3463 if (TREE_CODE (newdecl) == FUNCTION_DECL
3464 || DECL_FUNCTION_TEMPLATE_P (newdecl))
3465 DECL_BEFRIENDING_CLASSES (newdecl)
3466 = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3467 DECL_BEFRIENDING_CLASSES (olddecl));
3470 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3472 if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3473 && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3475 /* If newdecl is not a specialization, then it is not a
3476 template-related function at all. And that means that we
3477 shoud have exited above, returning 0. */
3478 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3481 if (TREE_USED (olddecl))
3482 /* From [temp.expl.spec]:
3484 If a template, a member template or the member of a class
3485 template is explicitly specialized then that
3486 specialization shall be declared before the first use of
3487 that specialization that would cause an implicit
3488 instantiation to take place, in every translation unit in
3489 which such a use occurs. */
3490 cp_error ("explicit specialization of %D after first use",
3493 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3495 DECL_THIS_INLINE (newdecl) |= DECL_THIS_INLINE (olddecl);
3497 /* If either decl says `inline', this fn is inline, unless its
3498 definition was passed already. */
3499 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3500 DECL_INLINE (olddecl) = 1;
3501 DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3505 DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3506 DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3507 DECL_RTL (olddecl) = DECL_RTL (newdecl);
3509 if (! types_match || new_defines_function)
3511 /* These need to be copied so that the names are available.
3512 Note that if the types do match, we'll preserve inline
3513 info and other bits, but if not, we won't. */
3514 DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3515 DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3517 if (new_defines_function)
3518 /* If defining a function declared with other language
3519 linkage, use the previously declared language linkage. */
3520 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3521 else if (types_match)
3523 /* If redeclaring a builtin function, and not a definition,
3524 it stays built in. */
3525 if (DECL_BUILT_IN (olddecl))
3527 DECL_BUILT_IN (newdecl) = 1;
3528 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3529 /* If we're keeping the built-in definition, keep the rtl,
3530 regardless of declaration matches. */
3531 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3534 DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
3536 DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3537 if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl)))
3538 /* Previously saved insns go together with
3539 the function's previous definition. */
3540 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3541 /* Don't clear out the arguments if we're redefining a function. */
3542 if (DECL_ARGUMENTS (olddecl))
3543 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3545 if (DECL_LANG_SPECIFIC (olddecl))
3546 DECL_MAIN_VARIANT (newdecl) = DECL_MAIN_VARIANT (olddecl);
3549 if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3551 NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3554 /* Now preserve various other info from the definition. */
3555 TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3556 TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3557 DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3558 DECL_ASSEMBLER_NAME (newdecl) = DECL_ASSEMBLER_NAME (olddecl);
3560 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3564 function_size = sizeof (struct tree_decl);
3566 bcopy ((char *) newdecl + sizeof (struct tree_common),
3567 (char *) olddecl + sizeof (struct tree_common),
3568 function_size - sizeof (struct tree_common));
3570 if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3572 /* If newdecl is a template instantiation, it is possible that
3573 the following sequence of events has occurred:
3575 o A friend function was declared in a class template. The
3576 class template was instantiated.
3578 o The instantiation of the friend declaration was
3579 recorded on the instantiation list, and is newdecl.
3581 o Later, however, instantiate_class_template called pushdecl
3582 on the newdecl to perform name injection. But, pushdecl in
3583 turn called duplicate_decls when it discovered that another
3584 declaration of a global function with the same name already
3587 o Here, in duplicate_decls, we decided to clobber newdecl.
3589 If we're going to do that, we'd better make sure that
3590 olddecl, and not newdecl, is on the list of
3591 instantiations so that if we try to do the instantiation
3592 again we won't get the clobbered declaration. */
3594 tree tmpl = DECL_TI_TEMPLATE (newdecl);
3595 tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3597 for (; decls; decls = TREE_CHAIN (decls))
3598 if (TREE_VALUE (decls) == newdecl)
3599 TREE_VALUE (decls) = olddecl;
3604 bcopy ((char *) newdecl + sizeof (struct tree_common),
3605 (char *) olddecl + sizeof (struct tree_common),
3606 sizeof (struct tree_decl) - sizeof (struct tree_common)
3607 + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3610 DECL_UID (olddecl) = olddecl_uid;
3612 DECL_FRIEND_P (olddecl) = 1;
3614 /* NEWDECL contains the merged attribute lists.
3615 Update OLDDECL to be the same. */
3616 DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl);
3621 /* Record a decl-node X as belonging to the current lexical scope.
3622 Check for errors (such as an incompatible declaration for the same
3623 name already seen in the same scope).
3625 Returns either X or an old decl for the same name.
3626 If an old decl is returned, it may have been smashed
3627 to agree with what X says. */
3634 register tree name = DECL_ASSEMBLER_NAME (x);
3635 int need_new_binding = 1;
3637 if (DECL_TEMPLATE_PARM_P (x))
3638 /* Template parameters have no context; they are not X::T even
3639 when declared within a class or namespace. */
3643 if (current_function_decl && x != current_function_decl
3644 /* A local declaration for a function doesn't constitute
3646 && (TREE_CODE (x) != FUNCTION_DECL || DECL_INITIAL (x))
3647 /* Don't change DECL_CONTEXT of virtual methods. */
3648 && (TREE_CODE (x) != FUNCTION_DECL || !DECL_VIRTUAL_P (x))
3649 && !DECL_CONTEXT (x))
3650 DECL_CONTEXT (x) = current_function_decl;
3651 if (!DECL_CONTEXT (x))
3652 DECL_CONTEXT (x) = FROB_CONTEXT (current_namespace);
3655 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3656 compiler wants to use. */
3657 if (TREE_CODE (x) == TYPE_DECL || TREE_CODE (x) == VAR_DECL
3658 || TREE_CODE (x) == NAMESPACE_DECL)
3659 name = DECL_NAME (x);
3664 /* Not needed...see below. */
3668 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3669 name = TREE_OPERAND (name, 0);
3671 /* Namespace-scoped variables are not found in the current level. */
3672 if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x))
3673 t = namespace_binding (name, DECL_CONTEXT (x));
3675 t = lookup_name_current_level (name);
3676 if (t == error_mark_node)
3678 /* error_mark_node is 0 for a while during initialization! */
3680 cp_error_at ("`%#D' used prior to declaration", x);
3683 else if (t != NULL_TREE)
3686 /* This is turned off until I have time to do it right (bpk). */
3687 /* With the code below that uses it... */
3688 file = DECL_SOURCE_FILE (t);
3689 line = DECL_SOURCE_LINE (t);
3691 if (TREE_CODE (t) == PARM_DECL)
3693 if (DECL_CONTEXT (t) == NULL_TREE)
3694 fatal ("parse errors have confused me too much");
3696 /* Check for duplicate params. */
3697 if (duplicate_decls (x, t))
3700 else if (((TREE_CODE (x) == FUNCTION_DECL && DECL_LANGUAGE (x) == lang_c)
3701 || DECL_FUNCTION_TEMPLATE_P (x))
3702 && is_overloaded_fn (t))
3703 /* Don't do anything just yet. */;
3704 else if (t == wchar_decl_node)
3706 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3707 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x));
3709 /* Throw away the redeclaration. */
3712 else if (TREE_CODE (t) != TREE_CODE (x))
3714 if (duplicate_decls (x, t))
3717 else if (duplicate_decls (x, t))
3720 /* This is turned off until I have time to do it right (bpk). */
3722 /* Also warn if they did a prototype with `static' on it, but
3723 then later left the `static' off. */
3724 if (! TREE_PUBLIC (name) && TREE_PUBLIC (x))
3726 if (DECL_LANG_SPECIFIC (t) && DECL_FRIEND_P (t))
3731 cp_warning ("`static' missing from declaration of `%D'",
3733 warning_with_file_and_line (file, line,
3734 "previous declaration of `%s'",
3735 decl_as_string (t, 0));
3738 /* Now fix things so it'll do what they expect. */
3739 if (current_function_decl)
3740 TREE_PUBLIC (current_function_decl) = 0;
3742 /* Due to interference in memory reclamation (X may be
3743 obstack-deallocated at this point), we must guard against
3744 one really special case. [jason: This should be handled
3745 by start_function] */
3746 if (current_function_decl == x)
3747 current_function_decl = t;
3749 if (TREE_CODE (t) == TYPE_DECL)
3750 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3751 else if (TREE_CODE (t) == FUNCTION_DECL)
3752 check_default_args (t);
3756 else if (DECL_MAIN_P (x))
3758 /* A redeclaration of main, but not a duplicate of the
3763 This function shall not be overloaded. */
3764 cp_error_at ("invalid redeclaration of `%D'", t);
3765 cp_error ("as `%D'", x);
3766 /* We don't try to push this declaration since that
3772 check_template_shadow (x);
3774 /* If this is a function conjured up by the backend, massage it
3775 so it looks friendly. */
3776 if (TREE_CODE (x) == FUNCTION_DECL
3777 && ! DECL_LANG_SPECIFIC (x))
3779 retrofit_lang_decl (x);
3780 DECL_LANGUAGE (x) = lang_c;
3783 if (TREE_CODE (x) == FUNCTION_DECL && ! DECL_FUNCTION_MEMBER_P (x))
3785 t = push_overloaded_decl (x, PUSH_LOCAL);
3786 if (t != x || DECL_LANGUAGE (x) == lang_c)
3788 if (!namespace_bindings_p ())
3789 /* We do not need to create a binding for this name;
3790 push_overloaded_decl will have already done so if
3792 need_new_binding = 0;
3794 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3796 t = push_overloaded_decl (x, PUSH_GLOBAL);
3798 add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
3802 /* If declaring a type as a typedef, copy the type (unless we're
3803 at line 0), and install this TYPE_DECL as the new type's typedef
3804 name. See the extensive comment in ../c-decl.c (pushdecl). */
3805 if (TREE_CODE (x) == TYPE_DECL)
3807 tree type = TREE_TYPE (x);
3808 if (DECL_SOURCE_LINE (x) == 0)
3810 if (TYPE_NAME (type) == 0)
3811 TYPE_NAME (type) = x;
3813 else if (type != error_mark_node && TYPE_NAME (type) != x
3814 /* We don't want to copy the type when all we're
3815 doing is making a TYPE_DECL for the purposes of
3817 && (!TYPE_NAME (type)
3818 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
3820 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
3822 DECL_ORIGINAL_TYPE (x) = type;
3823 type = build_type_copy (type);
3824 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
3825 TYPE_NAME (type) = x;
3826 TREE_TYPE (x) = type;
3831 if (type != error_mark_node
3833 && TYPE_IDENTIFIER (type))
3834 set_identifier_type_value_with_scope (DECL_NAME (x), type,
3835 current_binding_level);
3839 /* Multiple external decls of the same identifier ought to match.
3841 We get warnings about inline functions where they are defined.
3842 We get warnings about other functions from push_overloaded_decl.
3844 Avoid duplicate warnings where they are used. */
3845 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
3849 if (IDENTIFIER_NAMESPACE_VALUE (name) != NULL_TREE
3850 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name))
3851 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name))))
3852 decl = IDENTIFIER_NAMESPACE_VALUE (name);
3857 /* If different sort of thing, we already gave an error. */
3858 && TREE_CODE (decl) == TREE_CODE (x)
3859 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
3861 cp_pedwarn ("type mismatch with previous external decl", x);
3862 cp_pedwarn_at ("previous external decl of `%#D'", decl);
3866 /* This name is new in its binding level.
3867 Install the new declaration and return it. */
3868 if (namespace_bindings_p ())
3870 /* Install a global value. */
3872 /* If the first global decl has external linkage,
3873 warn if we later see static one. */
3874 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
3875 TREE_PUBLIC (name) = 1;
3877 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
3880 if (TREE_CODE (x) == FUNCTION_DECL)
3882 ((IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE)
3883 || (IDENTIFIER_GLOBAL_VALUE (name) == x), 378);
3884 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
3887 /* Don't forget if the function was used via an implicit decl. */
3888 if (IDENTIFIER_IMPLICIT_DECL (name)
3889 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
3892 /* Don't forget if its address was taken in that way. */
3893 if (IDENTIFIER_IMPLICIT_DECL (name)
3894 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
3895 TREE_ADDRESSABLE (x) = 1;
3897 /* Warn about mismatches against previous implicit decl. */
3898 if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
3899 /* If this real decl matches the implicit, don't complain. */
3900 && ! (TREE_CODE (x) == FUNCTION_DECL
3901 && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
3903 ("`%D' was previously implicitly declared to return `int'", x);
3905 /* If new decl is `static' and an `extern' was seen previously,
3907 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
3908 warn_extern_redeclared_static (x, t);
3912 /* Here to install a non-global value. */
3913 tree oldlocal = IDENTIFIER_VALUE (name);
3914 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
3916 if (need_new_binding)
3918 push_local_binding (name, x, 0);
3919 /* Because push_local_binding will hook X on to the
3920 current_binding_level's name list, we don't want to
3921 do that again below. */
3922 need_new_binding = 0;
3925 /* If this is a TYPE_DECL, push it into the type value slot. */
3926 if (TREE_CODE (x) == TYPE_DECL)
3927 set_identifier_type_value_with_scope (name, TREE_TYPE (x),
3928 current_binding_level);
3930 /* Clear out any TYPE_DECL shadowed by a namespace so that
3931 we won't think this is a type. The C struct hack doesn't
3932 go through namespaces. */
3933 if (TREE_CODE (x) == NAMESPACE_DECL)
3934 set_identifier_type_value_with_scope (name, NULL_TREE,
3935 current_binding_level);
3937 /* If this is an extern function declaration, see if we
3938 have a global definition or declaration for the function. */
3939 if (oldlocal == NULL_TREE
3940 && DECL_EXTERNAL (x)
3941 && oldglobal != NULL_TREE
3942 && TREE_CODE (x) == FUNCTION_DECL
3943 && TREE_CODE (oldglobal) == FUNCTION_DECL)
3945 /* We have one. Their types must agree. */
3946 if (decls_match (x, oldglobal))
3950 cp_warning ("extern declaration of `%#D' doesn't match", x);
3951 cp_warning_at ("global declaration `%#D'", oldglobal);
3954 /* If we have a local external declaration,
3955 and no file-scope declaration has yet been seen,
3956 then if we later have a file-scope decl it must not be static. */
3957 if (oldlocal == NULL_TREE
3958 && oldglobal == NULL_TREE
3959 && DECL_EXTERNAL (x)
3961 TREE_PUBLIC (name) = 1;
3963 if (DECL_FROM_INLINE (x))
3964 /* Inline decls shadow nothing. */;
3966 /* Warn if shadowing an argument at the top level of the body. */
3967 else if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
3968 && TREE_CODE (oldlocal) == PARM_DECL
3969 /* Don't complain if it's from an enclosing function. */
3970 && DECL_CONTEXT (oldlocal) == current_function_decl
3971 && TREE_CODE (x) != PARM_DECL)
3973 /* Go to where the parms should be and see if we
3975 struct binding_level *b = current_binding_level->level_chain;
3981 if (b->parm_flag == 1)
3982 cp_error ("declaration of `%#D' shadows a parameter", name);
3984 else if (warn_shadow && oldlocal != NULL_TREE
3985 && current_binding_level->is_for_scope
3986 && !DECL_DEAD_FOR_LOCAL (oldlocal))
3988 warning ("variable `%s' shadows local",
3989 IDENTIFIER_POINTER (name));
3990 cp_warning_at (" this is the shadowed declaration", oldlocal);
3992 /* Maybe warn if shadowing something else. */
3993 else if (warn_shadow && !DECL_EXTERNAL (x)
3994 /* No shadow warnings for internally generated vars. */
3995 && ! DECL_ARTIFICIAL (x)
3996 /* No shadow warnings for vars made for inlining. */
3997 && ! DECL_FROM_INLINE (x))
3999 const char *warnstring = NULL;
4001 if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL)
4002 warnstring = "declaration of `%s' shadows a parameter";
4003 else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4004 && current_class_ptr
4005 && !TREE_STATIC (name))
4006 warnstring = "declaration of `%s' shadows a member of `this'";
4007 else if (oldlocal != NULL_TREE)
4008 warnstring = "declaration of `%s' shadows previous local";
4009 else if (oldglobal != NULL_TREE)
4010 /* XXX shadow warnings in outer-more namespaces */
4011 warnstring = "declaration of `%s' shadows global declaration";
4014 warning (warnstring, IDENTIFIER_POINTER (name));
4018 if (TREE_CODE (x) == FUNCTION_DECL)
4019 check_default_args (x);
4021 /* Keep count of variables in this level with incomplete type. */
4022 if (TREE_CODE (x) == VAR_DECL
4023 && TREE_TYPE (x) != error_mark_node
4024 && ((TYPE_SIZE (TREE_TYPE (x)) == NULL_TREE
4025 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE))
4026 /* RTTI TD entries are created while defining the type_info. */
4027 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x))
4028 && TYPE_BEING_DEFINED (TREE_TYPE (x)))))
4029 current_binding_level->incomplete
4030 = tree_cons (NULL_TREE, x, current_binding_level->incomplete);
4033 if (need_new_binding)
4034 add_decl_to_level (x, current_binding_level);
4039 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4040 caller to set DECL_CONTEXT properly. */
4043 pushdecl_with_scope (x, level)
4045 struct binding_level *level;
4047 register struct binding_level *b;
4048 tree function_decl = current_function_decl;
4050 current_function_decl = NULL_TREE;
4051 if (level->parm_flag == 2)
4053 b = class_binding_level;
4054 class_binding_level = level;
4055 pushdecl_class_level (x);
4056 class_binding_level = b;
4060 b = current_binding_level;
4061 current_binding_level = level;
4063 current_binding_level = b;
4065 current_function_decl = function_decl;
4069 /* Like pushdecl, only it places X in the current namespace,
4073 pushdecl_namespace_level (x)
4076 register struct binding_level *b = current_binding_level;
4079 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4081 /* Now, the type_shadowed stack may screw us. Munge it so it does
4083 if (TREE_CODE (x) == TYPE_DECL)
4085 tree name = DECL_NAME (x);
4087 tree *ptr = (tree *)0;
4088 for (; b != global_binding_level; b = b->level_chain)
4090 tree shadowed = b->type_shadowed;
4091 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4092 if (TREE_PURPOSE (shadowed) == name)
4094 ptr = &TREE_VALUE (shadowed);
4095 /* Can't break out of the loop here because sometimes
4096 a binding level will have duplicate bindings for
4097 PT names. It's gross, but I haven't time to fix it. */
4100 newval = TREE_TYPE (x);
4101 if (ptr == (tree *)0)
4103 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4104 up here if this is changed to an assertion. --KR */
4105 SET_IDENTIFIER_TYPE_VALUE (name, newval);
4115 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4119 pushdecl_top_level (x)
4122 tree cur_namespace = current_namespace;
4123 current_namespace = global_namespace;
4124 x = pushdecl_namespace_level (x);
4125 current_namespace = cur_namespace;
4129 /* Make the declaration of X appear in CLASS scope. */
4132 pushdecl_class_level (x)
4135 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4136 scope looks for the pre-mangled name. */
4139 if (TREE_CODE (x) == OVERLOAD)
4140 x = OVL_CURRENT (x);
4141 name = DECL_NAME (x);
4145 push_class_level_binding (name, x);
4146 if (TREE_CODE (x) == TYPE_DECL)
4147 set_identifier_type_value (name, TREE_TYPE (x));
4149 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
4153 for (f = TYPE_FIELDS (TREE_TYPE (x));
4156 pushdecl_class_level (f);
4160 /* Enter DECL into the symbol table, if that's appropriate. Returns
4161 DECL, or a modified version thereof. */
4164 maybe_push_decl (decl)
4167 tree type = TREE_TYPE (decl);
4169 /* Add this decl to the current binding level, but not if it comes
4170 from another scope, e.g. a static member variable. TEM may equal
4171 DECL or it may be a previous decl of the same name. */
4172 if ((TREE_CODE (decl) != PARM_DECL
4173 && DECL_CONTEXT (decl) != NULL_TREE
4174 /* Definitions of namespace members outside their namespace are
4176 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
4177 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
4178 || TREE_CODE (type) == UNKNOWN_TYPE
4179 /* The declaration of a template specialization does not affect
4180 the functions available for overload resolution, so we do not
4182 || (TREE_CODE (decl) == FUNCTION_DECL
4183 && DECL_TEMPLATE_SPECIALIZATION (decl)))
4186 return pushdecl (decl);
4190 /* This function is used to push the mangled decls for nested types into
4191 the appropriate scope. Previously pushdecl_top_level was used, but that
4192 is incorrect for members of local classes. */
4195 pushdecl_nonclass_level (x)
4198 struct binding_level *b = current_binding_level;
4200 my_friendly_assert (b->parm_flag != 2, 180);
4203 /* Get out of template binding levels */
4204 while (b->pseudo_global)
4208 pushdecl_with_scope (x, b);
4212 /* Make the declaration(s) of X appear in CLASS scope
4213 under the name NAME. */
4216 push_class_level_binding (name, x)
4221 /* The class_binding_level will be NULL if x is a template
4222 parameter name in a member template. */
4223 if (!class_binding_level)
4226 /* Make sure that this new member does not have the same name
4227 as a template parameter. */
4228 if (TYPE_BEING_DEFINED (current_class_type))
4229 check_template_shadow (x);
4231 /* If this declaration shadows a declaration from an enclosing
4232 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4233 we leave this class. Record the shadowed declaration here. */
4234 binding = IDENTIFIER_BINDING (name);
4236 && ((TREE_CODE (x) == OVERLOAD
4237 && BINDING_VALUE (binding)
4238 && is_overloaded_fn (BINDING_VALUE (binding)))
4239 || INHERITED_VALUE_BINDING_P (binding)))
4244 /* If the old binding was from a base class, and was for a tag
4245 name, slide it over to make room for the new binding. The
4246 old binding is still visible if explicitly qualified with a
4248 if (INHERITED_VALUE_BINDING_P (binding)
4249 && BINDING_VALUE (binding)
4250 && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4251 && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4252 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4254 old_decl = BINDING_TYPE (binding);
4255 BINDING_TYPE (binding) = BINDING_VALUE (binding);
4256 BINDING_VALUE (binding) = NULL_TREE;
4257 INHERITED_VALUE_BINDING_P (binding) = 0;
4260 old_decl = BINDING_VALUE (binding);
4262 /* There was already a binding for X containing fewer
4263 functions than are named in X. Find the previous
4264 declaration of X on the class-shadowed list, and update it. */
4265 for (shadow = class_binding_level->class_shadowed;
4267 shadow = TREE_CHAIN (shadow))
4268 if (TREE_PURPOSE (shadow) == name
4269 && TREE_TYPE (shadow) == old_decl)
4271 BINDING_VALUE (binding) = x;
4272 INHERITED_VALUE_BINDING_P (binding) = 0;
4273 TREE_TYPE (shadow) = x;
4278 /* If we didn't replace an existing binding, put the binding on the
4279 stack of bindings for the identifier, and update
4280 IDENTIFIER_CLASS_VALUE. */
4281 if (push_class_binding (name, x))
4283 push_cache_obstack ();
4284 class_binding_level->class_shadowed
4285 = tree_cons (name, IDENTIFIER_CLASS_VALUE (name),
4286 class_binding_level->class_shadowed);
4288 /* Record the value we are binding NAME to so that we can know
4289 what to pop later. */
4290 TREE_TYPE (class_binding_level->class_shadowed) = x;
4294 /* Insert another USING_DECL into the current binding level,
4295 returning this declaration. If this is a redeclaration,
4296 do nothing and return NULL_TREE. */
4299 push_using_decl (scope, name)
4305 my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4306 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4307 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4308 if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4312 decl = build_lang_decl (USING_DECL, name, void_type_node);
4313 DECL_INITIAL (decl) = scope;
4314 TREE_CHAIN (decl) = current_binding_level->usings;
4315 current_binding_level->usings = decl;
4319 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4320 changed (i.e. there was already a directive), or the fresh
4321 TREE_LIST otherwise. */
4324 push_using_directive (used)
4327 tree ud = current_binding_level->using_directives;
4328 tree iter, ancestor;
4330 /* Check if we already have this. */
4331 if (purpose_member (used, ud) != NULL_TREE)
4334 /* Recursively add all namespaces used. */
4335 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4336 push_using_directive (TREE_PURPOSE (iter));
4338 ancestor = namespace_ancestor (current_decl_namespace (), used);
4339 ud = current_binding_level->using_directives;
4340 ud = tree_cons (used, ancestor, ud);
4341 current_binding_level->using_directives = ud;
4345 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4346 other definitions already in place. We get around this by making
4347 the value of the identifier point to a list of all the things that
4348 want to be referenced by that name. It is then up to the users of
4349 that name to decide what to do with that list.
4351 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4352 slot. It is dealt with the same way.
4354 FLAGS is a bitwise-or of the following values:
4355 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4357 PUSH_USING: DECL is being pushed as the result of a using
4360 The value returned may be a previous declaration if we guessed wrong
4361 about what language DECL should belong to (C or C++). Otherwise,
4362 it's always DECL (and never something that's not a _DECL). */
4365 push_overloaded_decl (decl, flags)
4369 tree name = DECL_NAME (decl);
4372 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4375 old = namespace_binding (name, DECL_CONTEXT (decl));
4377 old = lookup_name_current_level (name);
4381 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4383 tree t = TREE_TYPE (old);
4384 if (IS_AGGR_TYPE (t) && warn_shadow
4385 && (! DECL_IN_SYSTEM_HEADER (decl)
4386 || ! DECL_IN_SYSTEM_HEADER (old)))
4387 cp_warning ("`%#D' hides constructor for `%#T'", decl, t);
4390 else if (is_overloaded_fn (old))
4394 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4396 tree fn = OVL_CURRENT (tmp);
4398 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4399 && !(flags & PUSH_USING)
4400 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4401 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4402 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4405 if (duplicate_decls (decl, fn))
4411 cp_error_at ("previous non-function declaration `%#D'", old);
4412 cp_error ("conflicts with function declaration `%#D'", decl);
4417 if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4419 if (old && TREE_CODE (old) != OVERLOAD)
4420 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4422 new_binding = ovl_cons (decl, old);
4423 if (flags & PUSH_USING)
4424 OVL_USED (new_binding) = 1;
4427 /* NAME is not ambiguous. */
4431 set_namespace_binding (name, current_namespace, new_binding);
4434 /* We only create an OVERLOAD if there was a previous binding at
4435 this level, or if decl is a template. In the former case, we
4436 need to remove the old binding and replace it with the new
4437 binding. We must also run through the NAMES on the binding
4438 level where the name was bound to update the chain. */
4440 if (TREE_CODE (new_binding) == OVERLOAD && old)
4444 for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4446 d = &TREE_CHAIN (*d))
4448 || (TREE_CODE (*d) == TREE_LIST
4449 && TREE_VALUE (*d) == old))
4451 if (TREE_CODE (*d) == TREE_LIST)
4452 /* Just replace the old binding with the new. */
4453 TREE_VALUE (*d) = new_binding;
4455 /* Build a TREE_LIST to wrap the OVERLOAD. */
4456 *d = tree_cons (NULL_TREE, new_binding,
4459 /* And update the CPLUS_BINDING node. */
4460 BINDING_VALUE (IDENTIFIER_BINDING (name))
4465 /* We should always find a previous binding in this case. */
4466 my_friendly_abort (0);
4469 /* Install the new binding. */
4470 push_local_binding (name, new_binding, flags);
4476 /* Generate an implicit declaration for identifier FUNCTIONID
4477 as a function of type int (). Print a warning if appropriate. */
4480 implicitly_declare (functionid)
4484 int temp = allocation_temporary_p ();
4486 push_obstacks_nochange ();
4488 /* Save the decl permanently so we can warn if definition follows.
4489 In ANSI C, warn_implicit is usually false, so the saves little space.
4490 But in C++, it's usually true, hence the extra code. */
4491 if (temp && (! warn_implicit || toplevel_bindings_p ()))
4492 end_temporary_allocation ();
4494 /* We used to reuse an old implicit decl here,
4495 but this loses with inline functions because it can clobber
4496 the saved decl chains. */
4497 decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4499 DECL_EXTERNAL (decl) = 1;
4500 TREE_PUBLIC (decl) = 1;
4502 /* ANSI standard says implicit declarations are in the innermost block.
4503 So we record the decl in the standard fashion. */
4505 rest_of_decl_compilation (decl, NULL_PTR, 0, 0);
4508 /* Only one warning per identifier. */
4509 && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4511 cp_pedwarn ("implicit declaration of function `%#D'", decl);
4514 SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4521 /* Return zero if the declaration NEWDECL is valid
4522 when the declaration OLDDECL (assumed to be for the same name)
4523 has already been seen.
4524 Otherwise return an error message format string with a %s
4525 where the identifier should go. */
4528 redeclaration_error_message (newdecl, olddecl)
4529 tree newdecl, olddecl;
4531 if (TREE_CODE (newdecl) == TYPE_DECL)
4533 /* Because C++ can put things into name space for free,
4534 constructs like "typedef struct foo { ... } foo"
4535 would look like an erroneous redeclaration. */
4536 if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4539 return "redefinition of `%#D'";
4541 else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4543 /* If this is a pure function, its olddecl will actually be
4544 the original initialization to `0' (which we force to call
4545 abort()). Don't complain about redefinition in this case. */
4546 if (DECL_LANG_SPECIFIC (olddecl) && DECL_ABSTRACT_VIRTUAL_P (olddecl))
4549 /* If both functions come from different namespaces, this is not
4550 a redeclaration - this is a conflict with a used function. */
4551 if (DECL_NAMESPACE_SCOPE_P (olddecl)
4552 && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4553 return "`%D' conflicts with used function";
4555 /* We'll complain about linkage mismatches in
4556 warn_extern_redeclared_static. */
4558 /* Defining the same name twice is no good. */
4559 if (DECL_INITIAL (olddecl) != NULL_TREE
4560 && DECL_INITIAL (newdecl) != NULL_TREE)
4562 if (DECL_NAME (olddecl) == NULL_TREE)
4563 return "`%#D' not declared in class";
4565 return "redefinition of `%#D'";
4569 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4571 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4572 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4573 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4574 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4575 && TYPE_SIZE (TREE_TYPE (newdecl))
4576 && TYPE_SIZE (TREE_TYPE (olddecl))))
4577 return "redefinition of `%#D'";
4580 else if (toplevel_bindings_p ())
4582 /* Objects declared at top level: */
4583 /* If at least one is a reference, it's ok. */
4584 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4586 /* Reject two definitions. */
4587 return "redefinition of `%#D'";
4591 /* Objects declared with block scope: */
4592 /* Reject two definitions, and reject a definition
4593 together with an external reference. */
4594 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4595 return "redeclaration of `%#D'";
4600 /* Create a new label, named ID. */
4603 make_label_decl (id, local_p)
4609 if (building_stmt_tree ())
4610 push_permanent_obstack ();
4611 decl = build_decl (LABEL_DECL, id, void_type_node);
4612 if (building_stmt_tree ())
4615 /* Make sure every label has an rtx. */
4618 DECL_CONTEXT (decl) = current_function_decl;
4619 DECL_MODE (decl) = VOIDmode;
4620 C_DECLARED_LABEL_FLAG (decl) = local_p;
4622 /* Say where one reference is to the label, for the sake of the
4623 error if it is not defined. */
4624 DECL_SOURCE_LINE (decl) = lineno;
4625 DECL_SOURCE_FILE (decl) = input_filename;
4627 /* Record the fact that this identifier is bound to this label. */
4628 SET_IDENTIFIER_LABEL_VALUE (id, decl);
4630 /* Record this label on the list of used labels so that we can check
4631 at the end of the function to see whether or not the label was
4632 actually defined. */
4633 if ((named_label_uses == NULL || named_label_uses->label_decl != decl)
4634 && (named_label_uses == NULL
4635 || named_label_uses->names_in_scope != current_binding_level->names
4636 || named_label_uses->label_decl != decl))
4638 struct named_label_list *new_ent;
4640 = (struct named_label_list*)oballoc (sizeof (struct named_label_list));
4641 new_ent->label_decl = decl;
4642 new_ent->names_in_scope = current_binding_level->names;
4643 new_ent->binding_level = current_binding_level;
4644 new_ent->lineno_o_goto = lineno;
4645 new_ent->filename_o_goto = input_filename;
4646 new_ent->next = named_label_uses;
4647 named_label_uses = new_ent;
4653 /* Look for a label named ID in the current function. If one cannot
4654 be found, create one. (We keep track of used, but undefined,
4655 labels, and complain about them at the end of a function.) */
4663 /* You can't use labels at global scope. */
4664 if (current_function_decl == NULL_TREE)
4666 error ("label `%s' referenced outside of any function",
4667 IDENTIFIER_POINTER (id));
4671 /* See if we've already got this label. */
4672 decl = IDENTIFIER_LABEL_VALUE (id);
4673 if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
4676 /* Record this label on the list of labels used in this function.
4677 We do this before calling make_label_decl so that we get the
4678 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4679 named_labels = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4681 /* We need a new label. */
4682 decl = make_label_decl (id, /*local_p=*/0);
4683 /* Now fill in the information we didn't have before. */
4684 TREE_VALUE (named_labels) = decl;
4689 /* Declare a local label named ID. */
4692 declare_local_label (id)
4697 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4698 this scope we can restore the old value of
4699 IDENTIFIER_TYPE_VALUE. */
4700 current_binding_level->shadowed_labels
4701 = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4702 current_binding_level->shadowed_labels);
4703 /* Look for the label. */
4704 decl = make_label_decl (id, /*local_p=*/1);
4705 /* Now fill in the information we didn't have before. */
4706 TREE_VALUE (current_binding_level->shadowed_labels) = decl;
4711 /* Define a label, specifying the location in the source file.
4712 Return the LABEL_DECL node for the label, if the definition is valid.
4713 Otherwise return 0. */
4716 define_label (filename, line, name)
4721 tree decl = lookup_label (name);
4723 /* After labels, make any new cleanups go into their
4724 own new (temporary) binding contour. */
4725 current_binding_level->more_cleanups_ok = 0;
4727 if (name == get_identifier ("wchar_t"))
4728 cp_pedwarn ("label named wchar_t");
4730 if (DECL_INITIAL (decl) != NULL_TREE)
4732 cp_error ("duplicate label `%D'", decl);
4737 struct named_label_list *uses, *prev;
4741 /* Mark label as having been defined. */
4742 DECL_INITIAL (decl) = error_mark_node;
4743 /* Say where in the source. */
4744 DECL_SOURCE_FILE (decl) = filename;
4745 DECL_SOURCE_LINE (decl) = line;
4748 uses = named_label_uses;
4749 while (uses != NULL)
4750 if (uses->label_decl == decl)
4752 struct binding_level *b = current_binding_level;
4755 tree new_decls = b->names;
4756 tree old_decls = (b == uses->binding_level)
4757 ? uses->names_in_scope : NULL_TREE;
4758 while (new_decls != old_decls)
4760 if (TREE_CODE (new_decls) == VAR_DECL
4761 /* Don't complain about crossing initialization
4762 of internal entities. They can't be accessed,
4763 and they should be cleaned up
4764 by the time we get to the label. */
4765 && ! DECL_ARTIFICIAL (new_decls)
4766 && !(DECL_INITIAL (new_decls) == NULL_TREE
4767 && pod_type_p (TREE_TYPE (new_decls))))
4769 /* This is really only important if we're crossing
4770 an initialization. The POD stuff is just
4771 pedantry; why should it matter if the class
4772 contains a field of pointer to member type? */
4773 int problem = (DECL_INITIAL (new_decls)
4774 || (TYPE_NEEDS_CONSTRUCTING
4775 (TREE_TYPE (new_decls))));
4781 cp_error ("jump to label `%D'", decl);
4782 error_with_file_and_line
4783 (uses->filename_o_goto,
4784 uses->lineno_o_goto, " from here");
4788 cp_pedwarn ("jump to label `%D'", decl);
4789 pedwarn_with_file_and_line
4790 (uses->filename_o_goto,
4791 uses->lineno_o_goto, " from here");
4797 cp_error_at (" crosses initialization of `%#D'",
4800 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4803 new_decls = TREE_CHAIN (new_decls);
4805 if (b == uses->binding_level)
4807 if (b->eh_region && ! saw_eh)
4811 cp_error ("jump to label `%D'", decl);
4812 error_with_file_and_line
4813 (uses->filename_o_goto,
4814 uses->lineno_o_goto, " from here");
4817 error (" enters exception handling block");
4824 prev->next = uses->next;
4826 named_label_uses = uses->next;
4835 current_function_return_value = NULL_TREE;
4842 struct binding_level *level;
4843 struct cp_switch *next;
4846 static struct cp_switch *switch_stack;
4852 = (struct cp_switch *) oballoc (sizeof (struct cp_switch));
4853 p->level = current_binding_level;
4854 p->next = switch_stack;
4861 switch_stack = switch_stack->next;
4864 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4865 /* XXX Note decl is never actually used. (bpk) */
4868 define_case_label ()
4870 tree cleanup = last_cleanup_this_contour ();
4871 struct binding_level *b = current_binding_level;
4876 static int explained = 0;
4877 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup));
4878 warning ("where case label appears here");
4881 warning ("(enclose actions of previous case statements requiring");
4882 warning ("destructors in their own binding contours.)");
4887 for (; b && b != switch_stack->level; b = b->level_chain)
4889 tree new_decls = b->names;
4890 for (; new_decls; new_decls = TREE_CHAIN (new_decls))
4892 if (TREE_CODE (new_decls) == VAR_DECL
4893 /* Don't complain about crossing initialization
4894 of internal entities. They can't be accessed,
4895 and they should be cleaned up
4896 by the time we get to the label. */
4897 && ! DECL_ARTIFICIAL (new_decls)
4898 && ((DECL_INITIAL (new_decls) != NULL_TREE
4899 && DECL_INITIAL (new_decls) != error_mark_node)
4900 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls))))
4903 error ("jump to case label");
4905 cp_error_at (" crosses initialization of `%#D'",
4911 /* After labels, make any new cleanups go into their
4912 own new (temporary) binding contour. */
4914 current_binding_level->more_cleanups_ok = 0;
4915 current_function_return_value = NULL_TREE;
4918 /* Return the list of declarations of the current level.
4919 Note that this list is in reverse order unless/until
4920 you nreverse it; and when you do nreverse it, you must
4921 store the result back using `storedecls' or you will lose. */
4926 return current_binding_level->names;
4929 /* Return the list of type-tags (for structs, etc) of the current level. */
4934 return current_binding_level->tags;
4937 /* Store the list of declarations of the current level.
4938 This is done for the parameter declarations of a function being defined,
4939 after they are modified in the light of any missing parameters. */
4945 current_binding_level->names = decls;
4948 /* Similarly, store the list of tags of the current level. */
4954 current_binding_level->tags = tags;
4957 /* Given NAME, an IDENTIFIER_NODE,
4958 return the structure (or union or enum) definition for that name.
4959 Searches binding levels from BINDING_LEVEL up to the global level.
4960 If THISLEVEL_ONLY is nonzero, searches only the specified context
4961 (but skips any tag-transparent contexts to find one that is
4962 meaningful for tags).
4963 FORM says which kind of type the caller wants;
4964 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4965 If the wrong kind of type is found, and it's not a template, an error is
4969 lookup_tag (form, name, binding_level, thislevel_only)
4970 enum tree_code form;
4972 struct binding_level *binding_level;
4975 register struct binding_level *level;
4976 /* Non-zero if, we should look past a pseudo-global level, even if
4978 int allow_pseudo_global = 1;
4980 for (level = binding_level; level; level = level->level_chain)
4983 if (ANON_AGGRNAME_P (name))
4984 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
4986 /* There's no need for error checking here, because
4987 anon names are unique throughout the compilation. */
4988 if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
4989 return TREE_VALUE (tail);
4991 else if (level->namespace_p)
4992 /* Do namespace lookup. */
4993 for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
4995 tree old = binding_for_name (name, tail);
4997 /* If we just skipped past a pseudo global level, even
4998 though THISLEVEL_ONLY, and we find a template class
4999 declaration, then we use the _TYPE node for the
5000 template. See the example below. */
5001 if (thislevel_only && !allow_pseudo_global
5002 && old && BINDING_VALUE (old)
5003 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
5004 old = TREE_TYPE (BINDING_VALUE (old));
5006 old = BINDING_TYPE (old);
5008 /* If it has an original type, it is a typedef, and we
5009 should not return it. */
5010 if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old)))
5012 if (old && TREE_CODE (old) != form
5013 && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL))
5015 cp_error ("`%#D' redeclared as %C", old, form);
5020 if (thislevel_only || tail == global_namespace)
5024 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5026 if (TREE_PURPOSE (tail) == name)
5028 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
5029 /* Should tighten this up; it'll probably permit
5030 UNION_TYPE and a struct template, for example. */
5032 && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL))
5034 /* Definition isn't the kind we were looking for. */
5035 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail),
5039 return TREE_VALUE (tail);
5042 if (thislevel_only && ! level->tag_transparent)
5044 if (level->pseudo_global && allow_pseudo_global)
5046 /* We must deal with cases like this:
5048 template <class T> struct S;
5049 template <class T> struct S {};
5051 When looking up `S', for the second declaration, we
5052 would like to find the first declaration. But, we
5053 are in the pseudo-global level created for the
5054 template parameters, rather than the (surrounding)
5055 namespace level. Thus, we keep going one more level,
5056 even though THISLEVEL_ONLY is non-zero. */
5057 allow_pseudo_global = 0;
5069 set_current_level_tags_transparency (tags_transparent)
5070 int tags_transparent;
5072 current_binding_level->tag_transparent = tags_transparent;
5076 /* Given a type, find the tag that was defined for it and return the tag name.
5077 Otherwise return 0. However, the value can never be 0
5078 in the cases in which this is used.
5080 C++: If NAME is non-zero, this is the new name to install. This is
5081 done when replacing anonymous tags with real tag names. */
5084 lookup_tag_reverse (type, name)
5088 register struct binding_level *level;
5090 for (level = current_binding_level; level; level = level->level_chain)
5093 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5095 if (TREE_VALUE (tail) == type)
5098 TREE_PURPOSE (tail) = name;
5099 return TREE_PURPOSE (tail);
5106 /* Look up NAME in the NAMESPACE. */
5109 lookup_namespace_name (namespace, name)
5110 tree namespace, name;
5113 tree template_id = NULL_TREE;
5115 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5117 if (TREE_CODE (name) == NAMESPACE_DECL)
5118 /* This happens for A::B<int> when B is a namespace. */
5120 else if (TREE_CODE (name) == TEMPLATE_DECL)
5122 /* This happens for A::B where B is a template, and there are no
5123 template arguments. */
5124 cp_error ("invalid use of `%D'", name);
5125 return error_mark_node;
5128 namespace = ORIGINAL_NAMESPACE (namespace);
5130 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5133 name = TREE_OPERAND (name, 0);
5134 if (TREE_CODE (name) == OVERLOAD)
5135 name = DECL_NAME (OVL_CURRENT (name));
5136 else if (TREE_CODE_CLASS (TREE_CODE (name)) == 'd')
5137 name = DECL_NAME (name);
5140 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5142 val = make_node (CPLUS_BINDING);
5143 if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5144 return error_mark_node;
5146 if (BINDING_VALUE (val))
5148 val = BINDING_VALUE (val);
5152 if (DECL_CLASS_TEMPLATE_P (val))
5153 val = lookup_template_class (val,
5154 TREE_OPERAND (template_id, 1),
5155 /*in_decl=*/NULL_TREE,
5156 /*context=*/NULL_TREE,
5157 /*entering_scope=*/0);
5158 else if (DECL_FUNCTION_TEMPLATE_P (val)
5159 || TREE_CODE (val) == OVERLOAD)
5160 val = lookup_template_function (val,
5161 TREE_OPERAND (template_id, 1));
5164 cp_error ("`%D::%D' is not a template",
5166 return error_mark_node;
5170 /* If we have a single function from a using decl, pull it out. */
5171 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5172 val = OVL_FUNCTION (val);
5176 cp_error ("`%D' undeclared in namespace `%D'", name, namespace);
5177 return error_mark_node;
5180 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5182 static unsigned long
5190 hash = (((unsigned long) TYPE_CONTEXT (t))
5191 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5196 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5199 typename_compare (k1, k2)
5210 d1 = TYPE_NAME (t1);
5211 d2 = TYPE_NAME (t2);
5213 return (DECL_NAME (d1) == DECL_NAME (d2)
5214 && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5215 && ((TREE_TYPE (t1) != NULL_TREE)
5216 == (TREE_TYPE (t2) != NULL_TREE))
5217 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5218 && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5221 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5222 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5223 is non-NULL, this type is being created by the implicit typename
5224 extension, and BASE_TYPE is a type named `t' in some base class of
5225 `T' which depends on template parameters.
5227 Returns the new TYPENAME_TYPE. */
5230 build_typename_type (context, name, fullname, base_type)
5238 struct hash_entry* e;
5240 static struct hash_table ht;
5242 push_obstacks (&permanent_obstack, &permanent_obstack);
5246 static struct hash_table *h = &ht;
5247 if (!hash_table_init (&ht, &hash_newfunc, &typename_hash,
5249 fatal ("virtual memory exhausted");
5250 ggc_add_tree_hash_table_root (&h, 1);
5253 /* Build the TYPENAME_TYPE. */
5254 t = make_lang_type (TYPENAME_TYPE);
5255 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5256 TYPENAME_TYPE_FULLNAME (t) = fullname;
5257 TREE_TYPE (t) = base_type;
5259 /* Build the corresponding TYPE_DECL. */
5260 d = build_decl (TYPE_DECL, name, t);
5261 TYPE_NAME (TREE_TYPE (d)) = d;
5262 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5263 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5264 DECL_ARTIFICIAL (d) = 1;
5266 /* See if we already have this type. */
5267 e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5271 /* Insert the type into the table. */
5272 hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5280 make_typename_type (context, name)
5285 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
5287 if (!(TYPE_LANG_SPECIFIC (name)
5288 && (CLASSTYPE_IS_TEMPLATE (name)
5289 || CLASSTYPE_USE_TEMPLATE (name))))
5290 name = TYPE_IDENTIFIER (name);
5292 /* Create a TEMPLATE_ID_EXPR for the type. */
5293 name = build_nt (TEMPLATE_ID_EXPR,
5294 CLASSTYPE_TI_TEMPLATE (name),
5295 CLASSTYPE_TI_ARGS (name));
5297 else if (TREE_CODE (name) == TYPE_DECL)
5298 name = DECL_NAME (name);
5302 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5304 name = TREE_OPERAND (name, 0);
5305 if (TREE_CODE (name) == TEMPLATE_DECL)
5306 name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5308 if (TREE_CODE (name) != IDENTIFIER_NODE)
5309 my_friendly_abort (2000);
5311 if (TREE_CODE (context) == NAMESPACE_DECL)
5313 /* We can get here from typename_sub0 in the explicit_template_type
5314 expansion. Just fail. */
5315 cp_error ("no class template named `%#T' in `%#T'",
5317 return error_mark_node;
5320 if (! uses_template_parms (context)
5321 || currently_open_class (context))
5323 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5325 tree tmpl = NULL_TREE;
5326 if (IS_AGGR_TYPE (context))
5327 tmpl = lookup_field (context, name, 0, 0);
5328 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5330 cp_error ("no class template named `%#T' in `%#T'",
5332 return error_mark_node;
5335 return lookup_template_class (tmpl,
5336 TREE_OPERAND (fullname, 1),
5338 /*entering_scope=*/0);
5344 if (!IS_AGGR_TYPE (context))
5346 cp_error ("no type named `%#T' in `%#T'", name, context);
5347 return error_mark_node;
5350 t = lookup_field (context, name, 0, 1);
5352 return TREE_TYPE (t);
5356 /* If the CONTEXT is not a template type, then either the field is
5357 there now or its never going to be. */
5358 if (!uses_template_parms (context))
5360 cp_error ("no type named `%#T' in `%#T'", name, context);
5361 return error_mark_node;
5365 return build_typename_type (context, name, fullname, NULL_TREE);
5368 /* Select the right _DECL from multiple choices. */
5371 select_decl (binding, flags)
5376 val = BINDING_VALUE (binding);
5377 if (LOOKUP_NAMESPACES_ONLY (flags))
5379 /* We are not interested in types. */
5380 if (val && TREE_CODE (val) == NAMESPACE_DECL)
5385 /* If we could have a type and
5386 we have nothing or we need a type and have none. */
5387 if (BINDING_TYPE (binding)
5388 && (!val || ((flags & LOOKUP_PREFER_TYPES)
5389 && TREE_CODE (val) != TYPE_DECL)))
5390 val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5391 /* Don't return non-types if we really prefer types. */
5392 else if (val && LOOKUP_TYPES_ONLY (flags) && TREE_CODE (val) != TYPE_DECL
5393 && (TREE_CODE (val) != TEMPLATE_DECL
5394 || !DECL_CLASS_TEMPLATE_P (val)))
5400 /* Unscoped lookup of a global: iterate over current namespaces,
5401 considering using-directives. If SPACESP is non-NULL, store a list
5402 of the namespaces we've considered in it. */
5405 unqualified_namespace_lookup (name, flags, spacesp)
5410 tree b = make_node (CPLUS_BINDING);
5411 tree initial = current_decl_namespace();
5412 tree scope = initial;
5414 struct binding_level *level;
5415 tree val = NULL_TREE;
5418 *spacesp = NULL_TREE;
5420 for (; !val; scope = CP_DECL_CONTEXT (scope))
5423 *spacesp = tree_cons (scope, NULL_TREE, *spacesp);
5424 val = binding_for_name (name, scope);
5426 /* Initialize binding for this context. */
5427 BINDING_VALUE (b) = BINDING_VALUE (val);
5428 BINDING_TYPE (b) = BINDING_TYPE (val);
5430 /* Add all _DECLs seen through local using-directives. */
5431 for (level = current_binding_level;
5432 !level->namespace_p;
5433 level = level->level_chain)
5434 if (!lookup_using_namespace (name, b, level->using_directives,
5435 scope, flags, spacesp))
5436 /* Give up because of error. */
5437 return error_mark_node;
5439 /* Add all _DECLs seen through global using-directives. */
5440 /* XXX local and global using lists should work equally. */
5444 if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5445 scope, flags, spacesp))
5446 /* Give up because of error. */
5447 return error_mark_node;
5448 if (siter == scope) break;
5449 siter = CP_DECL_CONTEXT (siter);
5452 val = select_decl (b, flags);
5453 if (scope == global_namespace)
5459 /* Combine prefer_type and namespaces_only into flags. */
5462 lookup_flags (prefer_type, namespaces_only)
5463 int prefer_type, namespaces_only;
5465 if (namespaces_only)
5466 return LOOKUP_PREFER_NAMESPACES;
5467 if (prefer_type > 1)
5468 return LOOKUP_PREFER_TYPES;
5469 if (prefer_type > 0)
5470 return LOOKUP_PREFER_BOTH;
5474 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5475 ignore it or not. Subroutine of lookup_name_real. */
5478 qualify_lookup (val, flags)
5482 if (val == NULL_TREE)
5484 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5486 if ((flags & LOOKUP_PREFER_TYPES)
5487 && (TREE_CODE (val) == TYPE_DECL
5488 || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5489 && DECL_CLASS_TEMPLATE_P (val))))
5491 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5496 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5500 warn_about_implicit_typename_lookup (typename, binding)
5504 tree subtype = TREE_TYPE (TREE_TYPE (typename));
5505 tree name = DECL_NAME (typename);
5507 if (! (TREE_CODE (binding) == TEMPLATE_DECL
5508 && CLASSTYPE_TEMPLATE_INFO (subtype)
5509 && CLASSTYPE_TI_TEMPLATE (subtype) == binding)
5510 && ! (TREE_CODE (binding) == TYPE_DECL
5511 && same_type_p (TREE_TYPE (binding), subtype)))
5513 cp_warning ("lookup of `%D' finds `%#D'",
5515 cp_warning (" instead of `%D' from dependent base class",
5517 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5518 constructor_name (current_class_type), name);
5522 /* Look up NAME in the current binding level and its superiors in the
5523 namespace of variables, functions and typedefs. Return a ..._DECL
5524 node of some kind representing its definition if there is only one
5525 such declaration, or return a TREE_LIST with all the overloaded
5526 definitions if there are many, or return 0 if it is undefined.
5528 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5529 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5530 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5531 Otherwise we prefer non-TYPE_DECLs.
5533 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5534 using IDENTIFIER_CLASS_VALUE. */
5537 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
5539 int prefer_type, nonclass, namespaces_only;
5542 tree val = NULL_TREE;
5544 tree from_obj = NULL_TREE;
5546 int val_is_implicit_typename = 0;
5548 /* Hack: copy flag set by parser, if set. */
5549 if (only_namespace_names)
5550 namespaces_only = 1;
5552 if (prefer_type == -2)
5554 extern int looking_for_typename;
5555 tree type = NULL_TREE;
5558 prefer_type = looking_for_typename;
5560 flags = lookup_flags (prefer_type, namespaces_only);
5561 /* If the next thing is '<', class templates are types. */
5562 if (looking_for_template)
5563 flags |= LOOKUP_TEMPLATES_EXPECTED;
5565 /* std:: becomes :: for now. */
5566 if (got_scope == std_node)
5567 got_scope = void_type_node;
5571 else if (got_object != error_mark_node)
5576 if (type == error_mark_node)
5577 return error_mark_node;
5578 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
5579 type = TREE_TYPE (type);
5582 type = complete_type (type);
5584 if (TREE_CODE (type) == VOID_TYPE)
5585 type = global_namespace;
5586 if (TREE_CODE (type) == NAMESPACE_DECL)
5588 val = make_node (CPLUS_BINDING);
5589 flags |= LOOKUP_COMPLAIN;
5590 if (!qualified_lookup_using_namespace (name, type, val, flags))
5592 val = select_decl (val, flags);
5594 else if (! IS_AGGR_TYPE (type)
5595 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5596 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
5597 || TREE_CODE (type) == TYPENAME_TYPE)
5598 /* Someone else will give an error about this if needed. */
5600 else if (type == current_class_type)
5601 val = IDENTIFIER_CLASS_VALUE (name);
5603 val = lookup_member (type, name, 0, prefer_type);
5610 else if (got_object && val)
5615 flags = lookup_flags (prefer_type, namespaces_only);
5616 /* If we're not parsing, we need to complain. */
5617 flags |= LOOKUP_COMPLAIN;
5620 /* First, look in non-namespace scopes. */
5622 if (current_class_type == NULL_TREE)
5625 for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t))
5629 if (!LOCAL_BINDING_P (t) && nonclass)
5630 /* We're not looking for class-scoped bindings, so keep going. */
5633 /* If this is the kind of thing we're looking for, we're done. */
5634 if (qualify_lookup (BINDING_VALUE (t), flags))
5635 binding = BINDING_VALUE (t);
5636 else if ((flags & LOOKUP_PREFER_TYPES)
5637 && qualify_lookup (BINDING_TYPE (t), flags))
5638 binding = BINDING_TYPE (t);
5640 binding = NULL_TREE;
5643 && (!val || !IMPLICIT_TYPENAME_TYPE_DECL_P (binding)))
5645 if (val_is_implicit_typename && !yylex)
5646 warn_about_implicit_typename_lookup (val, binding);
5648 val_is_implicit_typename
5649 = IMPLICIT_TYPENAME_TYPE_DECL_P (val);
5650 if (!val_is_implicit_typename)
5655 /* Now lookup in namespace scopes. */
5656 if (!val || val_is_implicit_typename)
5658 t = unqualified_namespace_lookup (name, flags, 0);
5661 if (val_is_implicit_typename && !yylex)
5662 warn_about_implicit_typename_lookup (val, t);
5670 /* This should only warn about types used in qualified-ids. */
5671 if (from_obj && from_obj != val)
5673 if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
5674 && TREE_CODE (val) == TYPE_DECL
5675 && TREE_TYPE (from_obj) != TREE_TYPE (val))
5677 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5678 name, got_object, TREE_TYPE (from_obj));
5679 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5683 /* We don't change val to from_obj if got_object depends on
5684 template parms because that breaks implicit typename for
5685 destructor calls. */
5686 if (! uses_template_parms (got_object))
5690 /* If we have a single function from a using decl, pull it out. */
5691 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5692 val = OVL_FUNCTION (val);
5701 lookup_name_nonclass (name)
5704 return lookup_name_real (name, 0, 1, 0);
5708 lookup_function_nonclass (name, args)
5712 return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
5716 lookup_name_namespace_only (name)
5719 /* type-or-namespace, nonclass, namespace_only */
5720 return lookup_name_real (name, 1, 1, 1);
5724 lookup_name (name, prefer_type)
5728 return lookup_name_real (name, prefer_type, 0, 0);
5731 /* Similar to `lookup_name' but look only in the innermost non-class
5735 lookup_name_current_level (name)
5738 struct binding_level *b;
5741 b = current_binding_level;
5742 while (b->parm_flag == 2)
5747 t = IDENTIFIER_NAMESPACE_VALUE (name);
5749 /* extern "C" function() */
5750 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
5753 else if (IDENTIFIER_BINDING (name)
5754 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
5758 if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
5759 return IDENTIFIER_VALUE (name);
5771 /* Like lookup_name_current_level, but for types. */
5774 lookup_type_current_level (name)
5777 register tree t = NULL_TREE;
5779 my_friendly_assert (! current_binding_level->namespace_p, 980716);
5781 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
5782 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
5784 struct binding_level *b = current_binding_level;
5787 if (purpose_member (name, b->type_shadowed))
5788 return REAL_IDENTIFIER_TYPE_VALUE (name);
5800 begin_only_namespace_names ()
5802 only_namespace_names = 1;
5806 end_only_namespace_names ()
5808 only_namespace_names = 0;
5811 /* Arrange for the user to get a source line number, even when the
5812 compiler is going down in flames, so that she at least has a
5813 chance of working around problems in the compiler. We used to
5814 call error(), but that let the segmentation fault continue
5815 through; now, it's much more passive by asking them to send the
5816 maintainers mail about the problem. */
5820 int sig ATTRIBUTE_UNUSED;
5822 signal (SIGSEGV, SIG_DFL);
5824 signal (SIGIOT, SIG_DFL);
5827 signal (SIGILL, SIG_DFL);
5830 signal (SIGABRT, SIG_DFL);
5833 signal (SIGBUS, SIG_DFL);
5835 my_friendly_abort (0);
5838 /* Push the declarations of builtin types into the namespace.
5839 RID_INDEX, if < RID_MAX is the index of the builtin type
5840 in the array RID_POINTERS. NAME is the name used when looking
5841 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5844 record_builtin_type (rid_index, name, type)
5849 tree rname = NULL_TREE, tname = NULL_TREE;
5850 tree tdecl = NULL_TREE;
5852 if ((int) rid_index < (int) RID_MAX)
5853 rname = ridpointers[(int) rid_index];
5855 tname = get_identifier (name);
5857 TYPE_BUILT_IN (type) = 1;
5861 tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
5862 set_identifier_type_value (tname, NULL_TREE);
5863 if ((int) rid_index < (int) RID_MAX)
5864 /* Built-in types live in the global namespace. */
5865 SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
5867 if (rname != NULL_TREE)
5869 if (tname != NULL_TREE)
5871 set_identifier_type_value (rname, NULL_TREE);
5872 SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
5876 tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
5877 set_identifier_type_value (rname, NULL_TREE);
5882 /* Record one of the standard Java types.
5883 * Declare it as having the given NAME.
5884 * If SIZE > 0, it is the size of one of the integral types;
5885 * otherwise it is the negative of the size of one of the other types. */
5888 record_builtin_java_type (name, size)
5894 type = make_signed_type (size);
5895 else if (size > -32)
5896 { /* "__java_char" or ""__java_boolean". */
5897 type = make_unsigned_type (-size);
5898 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5901 { /* "__java_float" or ""__java_double". */
5902 type = make_node (REAL_TYPE);
5903 TYPE_PRECISION (type) = - size;
5906 record_builtin_type (RID_MAX, name, type);
5907 decl = TYPE_NAME (type);
5909 /* Suppress generate debug symbol entries for these types,
5910 since for normal C++ they are just clutter.
5911 However, push_lang_context undoes this if extern "Java" is seen. */
5912 DECL_IGNORED_P (decl) = 1;
5914 TYPE_FOR_JAVA (type) = 1;
5918 /* Push a type into the namespace so that the back-ends ignore it. */
5921 record_unknown_type (type, name)
5925 tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
5926 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5927 DECL_IGNORED_P (decl) = 1;
5928 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
5929 TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
5930 TYPE_ALIGN (type) = 1;
5931 TYPE_MODE (type) = TYPE_MODE (void_type_node);
5934 /* Push overloaded decl, in global scope, with one argument so it
5935 can be used as a callback from define_function. */
5938 push_overloaded_decl_1 (x)
5941 push_overloaded_decl (x, PUSH_GLOBAL);
5948 auto_function (name, type)
5951 return define_function
5952 (IDENTIFIER_POINTER (name), type, push_overloaded_decl_1,
5953 IDENTIFIER_POINTER (build_decl_overload (name, TYPE_ARG_TYPES (type),
5957 /* Create the predefined scalar types of C,
5958 and some nodes representing standard constants (0, 1, (void *)0).
5959 Initialize the global binding level.
5960 Make definitions for built-in primitive functions. */
5963 init_decl_processing ()
5966 int wchar_type_size;
5967 tree array_domain_type;
5969 /* Have to make these distinct before we try using them. */
5970 lang_name_cplusplus = get_identifier ("C++");
5971 lang_name_c = get_identifier ("C");
5972 lang_name_java = get_identifier ("Java");
5974 /* Let the back-end now how to save and restore language-specific
5975 per-function globals. */
5976 init_lang_status = &push_cp_function_context;
5977 free_lang_status = &pop_cp_function_context;
5978 mark_lang_status = &mark_cp_function_context;
5984 /* Create the global variables. */
5985 push_to_top_level ();
5987 /* Enter the global namespace. */
5988 my_friendly_assert (global_namespace == NULL_TREE, 375);
5989 push_namespace (get_identifier ("::"));
5990 global_namespace = current_namespace;
5991 current_lang_name = NULL_TREE;
5993 if (flag_strict_prototype == 2)
5994 flag_strict_prototype = pedantic;
5995 if (! flag_permissive && ! pedantic)
5996 flag_pedantic_errors = 1;
5998 strict_prototypes_lang_c = flag_strict_prototype;
6001 current_lang_name = lang_name_c;
6003 current_function_decl = NULL_TREE;
6004 current_binding_level = NULL_BINDING_LEVEL;
6005 free_binding_level = NULL_BINDING_LEVEL;
6007 /* Because most segmentation signals can be traced back into user
6008 code, catch them and at least give the user a chance of working
6009 around compiler bugs. */
6010 signal (SIGSEGV, signal_catch);
6012 /* We will also catch aborts in the back-end through signal_catch and
6013 give the user a chance to see where the error might be, and to defeat
6014 aborts in the back-end when there have been errors previously in their
6017 signal (SIGIOT, signal_catch);
6020 signal (SIGILL, signal_catch);
6023 signal (SIGABRT, signal_catch);
6026 signal (SIGBUS, signal_catch);
6029 gcc_obstack_init (&decl_obstack);
6031 build_common_tree_nodes (flag_signed_char);
6033 error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6034 TREE_TYPE (error_mark_list) = error_mark_node;
6036 /* Make the binding_level structure for global names. */
6038 global_binding_level = current_binding_level;
6039 /* The global level is the namespace level of ::. */
6040 NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6041 declare_namespace_level ();
6043 this_identifier = get_identifier (THIS_NAME);
6044 in_charge_identifier = get_identifier (IN_CHARGE_NAME);
6045 ctor_identifier = get_identifier (CTOR_NAME);
6046 dtor_identifier = get_identifier (DTOR_NAME);
6047 pfn_identifier = get_identifier (VTABLE_PFN_NAME);
6048 index_identifier = get_identifier (VTABLE_INDEX_NAME);
6049 delta_identifier = get_identifier (VTABLE_DELTA_NAME);
6050 delta2_identifier = get_identifier (VTABLE_DELTA2_NAME);
6051 pfn_or_delta2_identifier = get_identifier ("__pfn_or_delta2");
6053 /* Define `int' and `char' first so that dbx will output them first. */
6054 record_builtin_type (RID_INT, NULL_PTR, integer_type_node);
6055 record_builtin_type (RID_CHAR, "char", char_type_node);
6057 /* `signed' is the same as `int' */
6058 record_builtin_type (RID_SIGNED, NULL_PTR, integer_type_node);
6059 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
6060 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
6061 record_builtin_type (RID_MAX, "long unsigned int", long_unsigned_type_node);
6062 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
6063 record_builtin_type (RID_MAX, "long long int", long_long_integer_type_node);
6064 record_builtin_type (RID_MAX, "long long unsigned int",
6065 long_long_unsigned_type_node);
6066 record_builtin_type (RID_MAX, "long long unsigned",
6067 long_long_unsigned_type_node);
6068 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
6069 record_builtin_type (RID_MAX, "short unsigned int", short_unsigned_type_node);
6070 record_builtin_type (RID_MAX, "unsigned short", short_unsigned_type_node);
6073 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE)));
6075 /* Define both `signed char' and `unsigned char'. */
6076 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
6077 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
6079 /* `unsigned long' is the standard type for sizeof.
6080 Note that stddef.h uses `unsigned long',
6081 and this must agree, even if long and int are the same size. */
6083 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE))));
6085 /* Create the widest literal types. */
6086 widest_integer_literal_type_node = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
6087 pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6088 widest_integer_literal_type_node));
6090 widest_unsigned_literal_type_node = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
6091 pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6092 widest_unsigned_literal_type_node));
6094 /* These are types that type_for_size and type_for_mode use. */
6095 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
6096 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
6097 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
6098 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
6099 #if HOST_BITS_PER_WIDE_INT >= 64
6100 pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node));
6102 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
6103 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
6104 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
6105 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
6106 #if HOST_BITS_PER_WIDE_INT >= 64
6107 pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node));
6110 build_common_tree_nodes_2 (flag_short_double);
6112 java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6113 java_short_type_node = record_builtin_java_type ("__java_short", 16);
6114 java_int_type_node = record_builtin_java_type ("__java_int", 32);
6115 java_long_type_node = record_builtin_java_type ("__java_long", 64);
6116 java_float_type_node = record_builtin_java_type ("__java_float", -32);
6117 java_double_type_node = record_builtin_java_type ("__java_double", -64);
6118 java_char_type_node = record_builtin_java_type ("__java_char", -16);
6119 java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6121 integer_two_node = build_int_2 (2, 0);
6122 TREE_TYPE (integer_two_node) = integer_type_node;
6123 integer_three_node = build_int_2 (3, 0);
6124 TREE_TYPE (integer_three_node) = integer_type_node;
6126 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6127 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6128 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6129 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6130 TYPE_PRECISION (boolean_type_node) = 1;
6131 record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6132 boolean_false_node = build_int_2 (0, 0);
6133 TREE_TYPE (boolean_false_node) = boolean_type_node;
6134 boolean_true_node = build_int_2 (1, 0);
6135 TREE_TYPE (boolean_true_node) = boolean_type_node;
6137 signed_size_zero_node = build_int_2 (0, 0); record_builtin_type (RID_FLOAT, NULL_PTR, float_type_node);
6138 record_builtin_type (RID_DOUBLE, NULL_PTR, double_type_node);
6139 record_builtin_type (RID_MAX, "long double", long_double_type_node);
6141 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
6142 complex_integer_type_node));
6143 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
6144 complex_float_type_node));
6145 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
6146 complex_double_type_node));
6147 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
6148 complex_long_double_type_node));
6150 TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6152 record_builtin_type (RID_VOID, NULL_PTR, void_type_node);
6153 void_list_node = build_tree_list (NULL_TREE, void_type_node);
6154 TREE_PARMLIST (void_list_node) = 1;
6156 /* Used for expressions that do nothing, but are not errors. */
6157 void_zero_node = build_int_2 (0, 0);
6158 TREE_TYPE (void_zero_node) = void_type_node;
6160 string_type_node = build_pointer_type (char_type_node);
6161 const_string_type_node
6162 = build_pointer_type (build_qualified_type (char_type_node,
6164 empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);
6166 record_builtin_type (RID_MAX, NULL_PTR, string_type_node);
6169 /* Make a type to be the domain of a few array types
6170 whose domains don't really matter.
6171 200 is small enough that it always fits in size_t
6172 and large enough that it can hold most function names for the
6173 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6174 array_domain_type = build_index_type (build_int_2 (200, 0));
6176 /* Make a type for arrays of characters.
6177 With luck nothing will ever really depend on the length of this
6179 char_array_type_node
6180 = build_array_type (char_type_node, array_domain_type);
6181 /* Likewise for arrays of ints. */
6183 = build_array_type (integer_type_node, array_domain_type);
6185 /* This is just some anonymous class type. Nobody should ever
6186 need to look inside this envelope. */
6187 class_star_type_node = build_pointer_type (make_lang_type (RECORD_TYPE));
6189 if (flag_huge_objects)
6190 delta_type_node = long_integer_type_node;
6192 delta_type_node = short_integer_type_node;
6194 default_function_type
6195 = build_function_type (integer_type_node, NULL_TREE);
6197 ptr_type_node = build_pointer_type (void_type_node);
6199 = build_pointer_type (build_qualified_type (void_type_node,
6201 c_common_nodes_and_builtins (1, flag_no_builtin, flag_no_nonansi_builtin);
6204 = build_exception_variant (void_ftype_ptr, empty_except_spec);
6206 /* C++ extensions */
6208 unknown_type_node = make_node (UNKNOWN_TYPE);
6209 record_unknown_type (unknown_type_node, "unknown type");
6211 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6212 TREE_TYPE (unknown_type_node) = unknown_type_node;
6214 TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0);
6216 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6218 TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6219 TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6221 /* This is special for C++ so functions can be overloaded. */
6223 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE)));
6224 wchar_type_size = TYPE_PRECISION (wchar_type_node);
6225 signed_wchar_type_node = make_signed_type (wchar_type_size);
6226 unsigned_wchar_type_node = make_unsigned_type (wchar_type_size);
6228 = TREE_UNSIGNED (wchar_type_node)
6229 ? unsigned_wchar_type_node
6230 : signed_wchar_type_node;
6231 record_builtin_type (RID_WCHAR, "__wchar_t", wchar_type_node);
6233 /* Artificial declaration of wchar_t -- can be bashed */
6234 wchar_decl_node = build_decl (TYPE_DECL, get_identifier ("wchar_t"),
6236 pushdecl (wchar_decl_node);
6238 /* This is for wide string constants. */
6239 wchar_array_type_node
6240 = build_array_type (wchar_type_node, array_domain_type);
6242 if (flag_vtable_thunks)
6244 /* Make sure we get a unique function type, so we can give
6245 its pointer type a name. (This wins for gdb.) */
6246 tree vfunc_type = make_node (FUNCTION_TYPE);
6247 TREE_TYPE (vfunc_type) = integer_type_node;
6248 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6249 layout_type (vfunc_type);
6251 vtable_entry_type = build_pointer_type (vfunc_type);
6255 vtable_entry_type = make_lang_type (RECORD_TYPE);
6256 fields[0] = build_lang_decl (FIELD_DECL, delta_identifier,
6258 fields[1] = build_lang_decl (FIELD_DECL, index_identifier,
6260 fields[2] = build_lang_decl (FIELD_DECL, pfn_identifier,
6262 finish_builtin_type (vtable_entry_type, VTBL_PTR_TYPE, fields, 2,
6265 /* Make this part of an invisible union. */
6266 fields[3] = copy_node (fields[2]);
6267 TREE_TYPE (fields[3]) = delta_type_node;
6268 DECL_NAME (fields[3]) = delta2_identifier;
6269 DECL_MODE (fields[3]) = TYPE_MODE (delta_type_node);
6270 DECL_SIZE (fields[3]) = TYPE_SIZE (delta_type_node);
6271 TREE_UNSIGNED (fields[3]) = 0;
6272 TREE_CHAIN (fields[2]) = fields[3];
6273 vtable_entry_type = build_qualified_type (vtable_entry_type,
6276 record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6279 = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6280 layout_type (vtbl_type_node);
6281 vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6282 record_builtin_type (RID_MAX, NULL_PTR, vtbl_type_node);
6283 vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6284 layout_type (vtbl_ptr_type_node);
6285 record_builtin_type (RID_MAX, NULL_PTR, vtbl_ptr_type_node);
6287 std_node = build_decl (NAMESPACE_DECL,
6288 get_identifier (flag_honor_std ? "fake std":"std"),
6290 pushdecl (std_node);
6292 global_type_node = make_node (LANG_TYPE);
6293 record_unknown_type (global_type_node, "global type");
6296 current_lang_name = lang_name_cplusplus;
6299 tree bad_alloc_type_node, newtype, deltype;
6301 push_namespace (get_identifier ("std"));
6302 bad_alloc_type_node = xref_tag
6303 (class_type_node, get_identifier ("bad_alloc"), 1);
6306 newtype = build_exception_variant
6307 (ptr_ftype_sizetype, add_exception_specifier (NULL_TREE, bad_alloc_type_node, -1));
6308 deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
6309 auto_function (ansi_opname[(int) NEW_EXPR], newtype);
6310 auto_function (ansi_opname[(int) VEC_NEW_EXPR], newtype);
6311 global_delete_fndecl = auto_function (ansi_opname[(int) DELETE_EXPR],
6313 auto_function (ansi_opname[(int) VEC_DELETE_EXPR], deltype);
6317 = define_function ("__pure_virtual", void_ftype, 0, 0);
6319 /* Perform other language dependent initializations. */
6320 init_class_processing ();
6321 init_init_processing ();
6322 init_search_processing ();
6324 init_rtti_processing ();
6326 if (flag_exceptions)
6327 init_exception_processing ();
6330 flag_inline_functions = 0;
6333 if (! supports_one_only ())
6336 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6337 declare_function_name ();
6339 /* Prepare to check format strings against argument lists. */
6340 init_function_format_info ();
6342 /* Show we use EH for cleanups. */
6343 using_eh_for_cleanups ();
6345 print_error_function = lang_print_error_function;
6346 lang_get_alias_set = &c_get_alias_set;
6347 valid_lang_attribute = cp_valid_lang_attribute;
6349 /* Maintain consistency. Perhaps we should just complain if they
6350 say -fwritable-strings? */
6351 if (flag_writable_strings)
6352 flag_const_strings = 0;
6354 /* Add GC roots for all of our global variables. */
6355 ggc_add_tree_root (c_global_trees, sizeof c_global_trees / sizeof(tree));
6356 ggc_add_tree_root (cp_global_trees, sizeof cp_global_trees / sizeof(tree));
6357 ggc_add_tree_root (&integer_three_node, 1);
6358 ggc_add_tree_root (&integer_two_node, 1);
6359 ggc_add_tree_root (&signed_size_zero_node, 1);
6360 ggc_add_tree_root (&size_one_node, 1);
6361 ggc_add_tree_root (&size_zero_node, 1);
6362 ggc_add_root (&global_binding_level, 1, sizeof global_binding_level,
6363 mark_binding_level);
6364 ggc_add_root (&scope_chain, 1, sizeof scope_chain, &mark_saved_scope);
6365 ggc_add_tree_root (&static_ctors, 1);
6366 ggc_add_tree_root (&static_dtors, 1);
6367 ggc_add_tree_root (&lastiddecl, 1);
6369 ggc_add_tree_root (&enum_next_value, 1);
6370 ggc_add_tree_root (&last_function_parm_tags, 1);
6371 ggc_add_tree_root (¤t_function_return_value, 1);
6372 ggc_add_tree_root (¤t_function_parms, 1);
6373 ggc_add_tree_root (¤t_function_parm_tags, 1);
6374 ggc_add_tree_root (&last_function_parms, 1);
6375 ggc_add_tree_root (&error_mark_list, 1);
6377 ggc_add_tree_root (&global_namespace, 1);
6378 ggc_add_tree_root (&global_type_node, 1);
6379 ggc_add_tree_root (&anonymous_namespace_name, 1);
6381 ggc_add_tree_root (&got_object, 1);
6382 ggc_add_tree_root (&got_scope, 1);
6384 ggc_add_tree_root (¤t_lang_name, 1);
6385 ggc_add_tree_root (&static_aggregates, 1);
6388 /* Function to print any language-specific context for an error message. */
6391 lang_print_error_function (file)
6394 default_print_error_function (file);
6395 maybe_print_template_context ();
6398 /* Make a definition for a builtin function named NAME and whose data type
6399 is TYPE. TYPE should be a function type with argument types.
6401 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6402 the name to be called if we can't opencode the function. */
6405 define_function (name, type, pfn, library_name)
6408 void (*pfn) PROTO((tree));
6409 const char *library_name;
6411 tree decl = build_lang_decl (FUNCTION_DECL, get_identifier (name), type);
6412 DECL_EXTERNAL (decl) = 1;
6413 TREE_PUBLIC (decl) = 1;
6414 DECL_ARTIFICIAL (decl) = 1;
6416 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392);
6417 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
6419 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6420 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6421 function in the namespace. */
6422 if (pfn) (*pfn) (decl);
6424 DECL_ASSEMBLER_NAME (decl) = get_identifier (library_name);
6425 make_function_rtl (decl);
6430 /* Wrapper around define_function, for the benefit of
6431 c_common_nodes_and_builtins.
6432 FUNCTION_CODE tells later passes how to compile calls to this function.
6433 See tree.h for its possible values. */
6436 builtin_function (name, type, code, libname)
6439 enum built_in_function code;
6440 const char *libname;
6442 tree decl = define_function (name, type, (void (*) PROTO((tree)))pushdecl,
6444 if (code != NOT_BUILT_IN)
6446 DECL_BUILT_IN (decl) = 1;
6447 DECL_FUNCTION_CODE (decl) = code;
6452 /* When we call finish_struct for an anonymous union, we create
6453 default copy constructors and such. But, an anonymous union
6454 shouldn't have such things; this function undoes the damage to the
6455 anonymous union type T.
6457 (The reason that we create the synthesized methods is that we don't
6458 distinguish `union { int i; }' from `typedef union { int i; } U'.
6459 The first is an anonymous union; the second is just an ordinary
6463 fixup_anonymous_aggr (t)
6468 /* Wipe out memory of synthesized methods */
6469 TYPE_HAS_CONSTRUCTOR (t) = 0;
6470 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6471 TYPE_HAS_INIT_REF (t) = 0;
6472 TYPE_HAS_CONST_INIT_REF (t) = 0;
6473 TYPE_HAS_ASSIGN_REF (t) = 0;
6474 TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6476 /* Splice the implicitly generated functions out of the TYPE_METHODS
6478 q = &TYPE_METHODS (t);
6481 if (DECL_ARTIFICIAL (*q))
6482 *q = TREE_CHAIN (*q);
6484 q = &TREE_CHAIN (*q);
6487 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6488 function members. */
6489 if (TYPE_METHODS (t))
6490 error ("an anonymous union cannot have function members");
6493 /* Make sure that a declaration with no declarator is well-formed, i.e.
6494 just defines a tagged type or anonymous union.
6496 Returns the type defined, if any. */
6499 check_tag_decl (declspecs)
6503 tree ob_modifier = NULL_TREE;
6505 register tree t = NULL_TREE;
6507 for (link = declspecs; link; link = TREE_CHAIN (link))
6509 register tree value = TREE_VALUE (link);
6515 if (IS_AGGR_TYPE (value) || TREE_CODE (value) == ENUMERAL_TYPE)
6517 my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
6521 else if (value == ridpointers[(int) RID_FRIEND])
6523 if (current_class_type == NULL_TREE
6524 || current_scope () != current_class_type)
6525 ob_modifier = value;
6527 else if (value == ridpointers[(int) RID_STATIC]
6528 || value == ridpointers[(int) RID_EXTERN]
6529 || value == ridpointers[(int) RID_AUTO]
6530 || value == ridpointers[(int) RID_REGISTER]
6531 || value == ridpointers[(int) RID_INLINE]
6532 || value == ridpointers[(int) RID_VIRTUAL]
6533 || value == ridpointers[(int) RID_CONST]
6534 || value == ridpointers[(int) RID_VOLATILE]
6535 || value == ridpointers[(int) RID_EXPLICIT])
6536 ob_modifier = value;
6540 error ("multiple types in one declaration");
6542 /* Inside a class, we might be in a friend or access declaration.
6543 Until we have a good way of detecting the latter, don't warn. */
6544 if (t == NULL_TREE && ! current_class_type)
6545 pedwarn ("declaration does not declare anything");
6547 /* Check for an anonymous union. We're careful
6548 accessing TYPE_IDENTIFIER because some built-in types, like
6549 pointer-to-member types, do not have TYPE_NAME. */
6550 else if (t && IS_AGGR_TYPE_CODE (TREE_CODE (t))
6552 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
6554 /* Anonymous unions are objects, so they can have specifiers. */;
6555 SET_ANON_AGGR_TYPE_P (t);
6557 if (TREE_CODE (t) != UNION_TYPE && pedantic && ! in_system_header)
6558 pedwarn ("ISO C++ prohibits anonymous structs");
6561 else if (ob_modifier)
6563 if (ob_modifier == ridpointers[(int) RID_INLINE]
6564 || ob_modifier == ridpointers[(int) RID_VIRTUAL])
6565 cp_error ("`%D' can only be specified for functions", ob_modifier);
6566 else if (ob_modifier == ridpointers[(int) RID_FRIEND])
6567 cp_error ("`%D' can only be specified inside a class", ob_modifier);
6568 else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
6569 cp_error ("`%D' can only be specified for constructors",
6572 cp_error ("`%D' can only be specified for objects and functions",
6579 /* Called when a declaration is seen that contains no names to declare.
6580 If its type is a reference to a structure, union or enum inherited
6581 from a containing scope, shadow that tag name for the current scope
6582 with a forward reference.
6583 If its type defines a new named structure or union
6584 or defines an enum, it is valid but we need not do anything here.
6585 Otherwise, it is an error.
6587 C++: may have to grok the declspecs to learn about static,
6588 complain for anonymous unions. */
6591 shadow_tag (declspecs)
6594 tree t = check_tag_decl (declspecs);
6597 maybe_process_partial_specialization (t);
6599 /* This is where the variables in an anonymous union are
6600 declared. An anonymous union declaration looks like:
6602 because there is no declarator after the union, the parser
6603 sends that declaration here. */
6604 if (t && ANON_AGGR_TYPE_P (t))
6606 fixup_anonymous_aggr (t);
6608 if (TYPE_FIELDS (t))
6610 tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
6612 finish_anon_union (decl);
6617 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6620 groktypename (typename)
6623 if (TREE_CODE (typename) != TREE_LIST)
6625 return grokdeclarator (TREE_VALUE (typename),
6626 TREE_PURPOSE (typename),
6627 TYPENAME, 0, NULL_TREE);
6630 /* Decode a declarator in an ordinary declaration or data definition.
6631 This is called as soon as the type information and variable name
6632 have been parsed, before parsing the initializer if any.
6633 Here we create the ..._DECL node, fill in its type,
6634 and put it on the list of decls for the current context.
6635 The ..._DECL node is returned as the value.
6637 Exception: for arrays where the length is not specified,
6638 the type is left null, to be filled in by `cp_finish_decl'.
6640 Function definitions do not come here; they go to start_function
6641 instead. However, external and forward declarations of functions
6642 do go through here. Structure field declarations are done by
6643 grokfield and not through here. */
6645 /* Set this to zero to debug not using the temporary obstack
6646 to parse initializers. */
6647 int debug_temp_inits = 1;
6650 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
6651 tree declarator, declspecs;
6653 tree attributes, prefix_attributes;
6656 register tree type, tem;
6658 extern int have_extern_spec;
6659 extern int used_extern_spec;
6663 /* See code below that used this. */
6664 int init_written = initialized;
6667 /* This should only be done once on the top most decl. */
6668 if (have_extern_spec && !used_extern_spec)
6670 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"),
6672 used_extern_spec = 1;
6675 if (attributes || prefix_attributes)
6676 attrlist = build_scratch_list (attributes, prefix_attributes);
6678 attrlist = NULL_TREE;
6680 decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
6683 if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
6686 type = TREE_TYPE (decl);
6688 if (type == error_mark_node)
6692 = (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
6693 ? DECL_CLASS_CONTEXT (decl)
6694 : DECL_CONTEXT (decl);
6696 if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
6697 && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
6699 /* When parsing the initializer, lookup should use the object's
6701 push_decl_namespace (context);
6704 /* We are only interested in class contexts, later. */
6705 if (context && TREE_CODE (context) == NAMESPACE_DECL)
6706 context = NULL_TREE;
6709 /* Is it valid for this decl to have an initializer at all?
6710 If not, set INITIALIZED to zero, which will indirectly
6711 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6712 switch (TREE_CODE (decl))
6715 /* typedef foo = bar means give foo the same type as bar.
6716 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6717 Any other case of an initialization in a TYPE_DECL is an error. */
6718 if (pedantic || list_length (declspecs) > 1)
6720 cp_error ("typedef `%D' is initialized", decl);
6726 cp_error ("function `%#D' is initialized like a variable", decl);
6736 if (! toplevel_bindings_p ()
6737 && DECL_EXTERNAL (decl))
6738 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6740 DECL_EXTERNAL (decl) = 0;
6741 if (toplevel_bindings_p ())
6742 TREE_STATIC (decl) = 1;
6744 /* Tell `pushdecl' this is an initialized decl
6745 even though we don't yet have the initializer expression.
6746 Also tell `cp_finish_decl' it may store the real initializer. */
6747 DECL_INITIAL (decl) = error_mark_node;
6750 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6751 SET_DEFAULT_DECL_ATTRIBUTES (decl, attributes);
6754 /* Set attributes here so if duplicate decl, will have proper attributes. */
6755 cplus_decl_attributes (decl, attributes, prefix_attributes);
6757 if (context && TYPE_SIZE (complete_type (context)) != NULL_TREE)
6759 push_nested_class (context, 2);
6761 if (TREE_CODE (decl) == VAR_DECL)
6763 tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
6764 if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
6765 cp_error ("`%#D' is not a static member of `%#T'", decl, context);
6768 if (DECL_CONTEXT (field) != context)
6770 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6771 DECL_CONTEXT (field), DECL_NAME (decl),
6772 context, DECL_NAME (decl));
6773 DECL_CONTEXT (decl) = DECL_CONTEXT (field);
6775 /* Static data member are tricky; an in-class initialization
6776 still doesn't provide a definition, so the in-class
6777 declaration will have DECL_EXTERNAL set, but will have an
6778 initialization. Thus, duplicate_decls won't warn
6779 about this situation, and so we check here. */
6780 if (DECL_INITIAL (decl) && DECL_INITIAL (field))
6781 cp_error ("duplicate initialization of %D", decl);
6782 if (duplicate_decls (decl, field))
6788 tree field = check_classfn (context, decl);
6789 if (field && duplicate_decls (decl, field))
6793 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6794 DECL_IN_AGGR_P (decl) = 0;
6795 if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
6796 || CLASSTYPE_USE_TEMPLATE (context))
6798 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
6799 /* [temp.expl.spec] An explicit specialization of a static data
6800 member of a template is a definition if the declaration
6801 includes an initializer; otherwise, it is a declaration.
6803 We check for processing_specialization so this only applies
6804 to the new specialization syntax. */
6805 if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
6806 DECL_EXTERNAL (decl) = 1;
6809 if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
6810 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6814 /* Enter this declaration into the symbol table. */
6815 tem = maybe_push_decl (decl);
6817 if (processing_template_decl)
6819 if (at_function_scope_p ())
6820 push_permanent_obstack ();
6821 tem = push_template_decl (tem);
6822 if (at_function_scope_p ())
6827 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6828 /* Tell the back-end to use or not use .common as appropriate. If we say
6829 -fconserve-space, we want this to save .data space, at the expense of
6830 wrong semantics. If we say -fno-conserve-space, we want this to
6831 produce errors about redefs; to do this we force variables into the
6833 DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
6836 if (! processing_template_decl)
6839 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6840 push_obstacks_nochange ();
6849 tree type = TREE_TYPE (decl);
6850 int initialized = (DECL_INITIAL (decl) != NULL_TREE);
6852 if (type == error_mark_node)
6855 /* If this type of object needs a cleanup, and control may
6856 jump past it, make a new binding level so that it is cleaned
6857 up only when it is initialized first. */
6858 if (TYPE_NEEDS_DESTRUCTOR (type)
6859 && current_binding_level->more_cleanups_ok == 0)
6860 pushlevel_temporary (1);
6863 /* Is it valid for this decl to have an initializer at all?
6864 If not, set INITIALIZED to zero, which will indirectly
6865 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6867 /* Don't allow initializations for incomplete types except for
6868 arrays which might be completed by the initialization. */
6869 if (TYPE_SIZE (complete_type (type)) != NULL_TREE)
6870 ; /* A complete type is ok. */
6871 else if (TREE_CODE (type) != ARRAY_TYPE)
6873 cp_error ("variable `%#D' has initializer but incomplete type",
6876 type = TREE_TYPE (decl) = error_mark_node;
6878 else if (TYPE_SIZE (complete_type (TREE_TYPE (type))) == NULL_TREE)
6880 if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
6881 cp_error ("elements of array `%#D' have incomplete type", decl);
6882 /* else we already gave an error in start_decl. */
6888 && TREE_CODE (decl) != TYPE_DECL
6889 && TREE_CODE (decl) != TEMPLATE_DECL
6890 && IS_AGGR_TYPE (type) && ! DECL_EXTERNAL (decl))
6892 if ((! processing_template_decl || ! uses_template_parms (type))
6893 && TYPE_SIZE (complete_type (type)) == NULL_TREE)
6895 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6897 /* Change the type so that assemble_variable will give
6898 DECL an rtl we can live with: (mem (const_int 0)). */
6899 type = TREE_TYPE (decl) = error_mark_node;
6903 /* If any base type in the hierarchy of TYPE needs a constructor,
6904 then we set initialized to 1. This way any nodes which are
6905 created for the purposes of initializing this aggregate
6906 will live as long as it does. This is necessary for global
6907 aggregates which do not have their initializers processed until
6908 the end of the file. */
6909 initialized = TYPE_NEEDS_CONSTRUCTING (type);
6914 DECL_INITIAL (decl) = NULL_TREE;
6917 /* Handle initialization of references.
6918 These three arguments are from `cp_finish_decl', and have the
6919 same meaning here that they do there.
6921 Quotes on semantics can be found in ARM 8.4.3. */
6924 grok_reference_init (decl, type, init)
6925 tree decl, type, init;
6929 if (init == NULL_TREE)
6931 if ((DECL_LANG_SPECIFIC (decl) == 0
6932 || DECL_IN_AGGR_P (decl) == 0)
6933 && ! DECL_THIS_EXTERN (decl))
6934 cp_error ("`%D' declared as reference but not initialized", decl);
6938 if (init == error_mark_node)
6941 if (TREE_CODE (init) == CONSTRUCTOR)
6943 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl);
6947 if (TREE_CODE (init) == TREE_LIST)
6948 init = build_compound_expr (init);
6950 if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
6951 init = convert_from_reference (init);
6953 if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
6954 && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
6956 /* Note: default conversion is only called in very special cases. */
6957 init = default_conversion (init);
6960 /* Convert INIT to the reference type TYPE. This may involve the
6961 creation of a temporary, whose lifetime must be the same as that
6962 of the reference. If so, a DECL_STMT for the temporary will be
6963 added just after the DECL_STMT for DECL. That's why we don't set
6964 DECL_INITIAL for local references (instead assigning to them
6965 explicitly); we need to allow the temporary to be initialized
6967 tmp = convert_to_reference
6968 (type, init, CONV_IMPLICIT,
6969 LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND, decl);
6971 if (tmp == error_mark_node)
6973 else if (tmp != NULL_TREE)
6976 tmp = save_expr (tmp);
6977 if (building_stmt_tree ())
6979 /* Initialize the declaration. */
6980 tmp = build (INIT_EXPR, TREE_TYPE (decl), decl, tmp);
6981 /* Setting TREE_SIDE_EFFECTS prevents expand_expr from
6982 omitting this expression entirely. */
6983 TREE_SIDE_EFFECTS (tmp) = 1;
6984 finish_expr_stmt (tmp);
6987 DECL_INITIAL (decl) = tmp;
6991 cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
6995 if (TREE_STATIC (decl) && ! TREE_CONSTANT (DECL_INITIAL (decl)))
6997 expand_static_init (decl, DECL_INITIAL (decl));
6998 DECL_INITIAL (decl) = NULL_TREE;
7003 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7004 mucking with forces it does not comprehend (i.e. initialization with a
7005 constructor). If we are at global scope and won't go into COMMON, fill
7006 it in with a dummy CONSTRUCTOR to force the variable into .data;
7007 otherwise we can use error_mark_node. */
7010 obscure_complex_init (decl, init)
7013 if (! flag_no_inline && TREE_STATIC (decl))
7015 if (extract_init (decl, init))
7019 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7020 if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7021 DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7025 DECL_INITIAL (decl) = error_mark_node;
7030 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7031 array until we finish parsing the initializer. If that's the
7032 situation we're in, update DECL accordingly. */
7035 maybe_deduce_size_from_array_init (decl, init)
7039 tree type = TREE_TYPE (decl);
7041 if (TREE_CODE (type) == ARRAY_TYPE
7042 && TYPE_DOMAIN (type) == NULL_TREE
7043 && TREE_CODE (decl) != TYPE_DECL)
7046 = (TREE_STATIC (decl)
7047 /* Even if pedantic, an external linkage array
7048 may have incomplete type at first. */
7049 ? pedantic && ! DECL_EXTERNAL (decl)
7050 : !DECL_EXTERNAL (decl));
7051 tree initializer = init ? init : DECL_INITIAL (decl);
7052 int failure = complete_array_type (type, initializer, do_default);
7055 cp_error ("initializer fails to determine size of `%D'", decl);
7060 cp_error ("array size missing in `%D'", decl);
7061 /* If a `static' var's size isn't known, make it extern as
7062 well as static, so it does not get allocated. If it's not
7063 `static', then don't mark it extern; finish_incomplete_decl
7064 will give it a default size and it will get allocated. */
7065 else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7066 DECL_EXTERNAL (decl) = 1;
7069 if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7070 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7072 cp_error ("zero-size array `%D'", decl);
7074 layout_decl (decl, 0);
7078 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7079 any appropriate error messages regarding the layout. INIT is a
7080 the initializer for DECL; returns a modified version. */
7083 layout_var_decl (decl, init)
7087 tree ttype = target_type (TREE_TYPE (decl));
7089 /* If we haven't already layed out this declaration, and we know its
7090 type, do so now. Note that we must not call complete type for an
7091 external object because it's type might involve templates that we
7092 are not supposed to isntantiate yet. */
7093 if (!DECL_EXTERNAL (decl)
7094 && DECL_SIZE (decl) == NULL_TREE
7095 && TYPE_SIZE (complete_type (TREE_TYPE (decl))) != NULL_TREE)
7096 layout_decl (decl, 0);
7098 if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7100 /* An automatic variable with an incomplete type: that is an error.
7101 Don't talk about array types here, since we took care of that
7102 message in grokdeclarator. */
7103 cp_error ("storage size of `%D' isn't known", decl);
7104 TREE_TYPE (decl) = error_mark_node;
7106 else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7107 /* Let debugger know it should output info for this type. */
7108 note_debug_info_needed (ttype);
7110 if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7111 note_debug_info_needed (DECL_CONTEXT (decl));
7113 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7114 && DECL_SIZE (decl) != NULL_TREE
7115 && ! TREE_CONSTANT (DECL_SIZE (decl)))
7117 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7118 constant_expression_warning (DECL_SIZE (decl));
7120 cp_error ("storage size of `%D' isn't constant", decl);
7126 /* If a local static variable is declared in an inline function, or if
7127 we have a weak definition, we must endeavor to create only one
7128 instance of the variable at link-time. */
7131 maybe_commonize_var (decl)
7134 /* Static data in a function with comdat linkage also has comdat
7136 if (TREE_STATIC (decl)
7137 /* Don't mess with __FUNCTION__. */
7138 && ! TREE_ASM_WRITTEN (decl)
7139 && current_function_decl
7140 && DECL_CONTEXT (decl) == current_function_decl
7141 && (DECL_THIS_INLINE (current_function_decl)
7142 || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7143 && TREE_PUBLIC (current_function_decl))
7145 /* Rather than try to get this right with inlining, we suppress
7146 inlining of such functions. */
7147 current_function_cannot_inline
7148 = "function with static variable cannot be inline";
7150 /* If flag_weak, we don't need to mess with this, as we can just
7151 make the function weak, and let it refer to its unique local
7152 copy. This works because we don't allow the function to be
7156 if (DECL_INTERFACE_KNOWN (current_function_decl))
7158 TREE_PUBLIC (decl) = 1;
7159 DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7161 else if (DECL_INITIAL (decl) == NULL_TREE
7162 || DECL_INITIAL (decl) == error_mark_node)
7164 TREE_PUBLIC (decl) = 1;
7165 DECL_COMMON (decl) = 1;
7167 /* else we lose. We can only do this if we can use common,
7168 which we can't if it has been initialized. */
7170 if (TREE_PUBLIC (decl))
7171 DECL_ASSEMBLER_NAME (decl)
7172 = build_static_name (current_function_decl, DECL_NAME (decl));
7173 else if (! DECL_ARTIFICIAL (decl))
7175 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7176 cp_warning_at (" you can work around this by removing the initializer", decl);
7180 else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
7181 /* Set it up again; we might have set DECL_INITIAL since the last
7183 comdat_linkage (decl);
7186 /* Issue an error message if DECL is an uninitialized const variable. */
7189 check_for_uninitialized_const_var (decl)
7192 tree type = TREE_TYPE (decl);
7194 /* ``Unless explicitly declared extern, a const object does not have
7195 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7197 if (TREE_CODE (decl) == VAR_DECL
7198 && TREE_CODE (type) != REFERENCE_TYPE
7199 && CP_TYPE_CONST_P (type)
7200 && !TYPE_NEEDS_CONSTRUCTING (type)
7201 && !DECL_INITIAL (decl))
7202 cp_error ("uninitialized const `%D'", decl);
7205 /* Verify INIT (the initializer for DECL), and record the
7206 initialization in DECL_INITIAL, if appropriate. Returns a new
7210 check_initializer (decl, init)
7216 if (TREE_CODE (decl) == FIELD_DECL)
7219 type = TREE_TYPE (decl);
7221 /* If `start_decl' didn't like having an initialization, ignore it now. */
7222 if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7225 /* Check the initializer. */
7228 /* Things that are going to be initialized need to have complete
7230 TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));
7232 if (type == error_mark_node)
7233 /* We will have already complained. */
7235 else if (TYPE_SIZE (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
7237 cp_error ("variable-sized object `%D' may not be initialized", decl);
7240 else if (TREE_CODE (type) == ARRAY_TYPE
7241 && !TYPE_SIZE (TREE_TYPE (type)))
7243 cp_error ("elements of array `%#D' have incomplete type", decl);
7246 else if (!TYPE_SIZE (type))
7248 cp_error ("`%D' has incomplete type", decl);
7249 TREE_TYPE (decl) = error_mark_node;
7254 if (TREE_CODE (decl) == CONST_DECL)
7256 my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7258 DECL_INITIAL (decl) = init;
7260 /* This will keep us from needing to worry about our obstacks. */
7261 my_friendly_assert (init != NULL_TREE, 149);
7264 else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
7266 if (TREE_STATIC (decl))
7267 make_decl_rtl (decl, NULL_PTR, toplevel_bindings_p ());
7268 grok_reference_init (decl, type, init);
7273 if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7275 if (TREE_CODE (type) == ARRAY_TYPE)
7276 init = digest_init (type, init, (tree *) 0);
7277 else if (TREE_CODE (init) == CONSTRUCTOR
7278 && TREE_HAS_CONSTRUCTOR (init))
7280 if (TYPE_NON_AGGREGATE_CLASS (type))
7282 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7284 init = error_mark_node;
7287 goto dont_use_constructor;
7292 dont_use_constructor:
7293 if (TREE_CODE (init) != TREE_VEC)
7294 init = store_init_value (decl, init);
7298 /* We must hide the initializer so that expand_decl
7299 won't try to do something it does not understand. */
7300 init = obscure_complex_init (decl, init);
7302 else if (DECL_EXTERNAL (decl))
7304 else if (TREE_CODE_CLASS (TREE_CODE (type)) == 't'
7305 && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7307 tree core_type = strip_array_types (type);
7309 if (! TYPE_NEEDS_CONSTRUCTING (core_type))
7311 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
7312 cp_error ("structure `%D' with uninitialized const members", decl);
7313 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
7314 cp_error ("structure `%D' with uninitialized reference members",
7318 check_for_uninitialized_const_var (decl);
7320 if (TYPE_SIZE (type) != NULL_TREE
7321 && TYPE_NEEDS_CONSTRUCTING (type))
7322 init = obscure_complex_init (decl, NULL_TREE);
7326 check_for_uninitialized_const_var (decl);
7331 /* If DECL is not a local variable, give it RTL. */
7334 make_rtl_for_nonlocal_decl (decl, init, asmspec)
7337 const char *asmspec;
7342 type = TREE_TYPE (decl);
7343 toplev = toplevel_bindings_p ();
7344 push_obstacks_nochange ();
7345 if (TREE_STATIC (decl)
7346 && TYPE_NEEDS_DESTRUCTOR (type)
7347 && allocation_temporary_p ())
7348 end_temporary_allocation ();
7350 if (TREE_CODE (decl) == VAR_DECL && DECL_VIRTUAL_P (decl))
7351 make_decl_rtl (decl, NULL_PTR, toplev);
7352 else if (TREE_CODE (decl) == VAR_DECL
7353 && TREE_READONLY (decl)
7354 && DECL_INITIAL (decl) != NULL_TREE
7355 && DECL_INITIAL (decl) != error_mark_node
7356 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
7358 DECL_INITIAL (decl) = save_expr (DECL_INITIAL (decl));
7361 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7364 && TREE_STATIC (decl)
7365 && ! TREE_SIDE_EFFECTS (decl)
7366 && ! TREE_PUBLIC (decl)
7367 && ! DECL_EXTERNAL (decl)
7368 && ! TYPE_NEEDS_DESTRUCTOR (type)
7369 && DECL_MODE (decl) != BLKmode)
7371 /* If this variable is really a constant, then fill its DECL_RTL
7372 slot with something which won't take up storage.
7373 If something later should take its address, we can always give
7374 it legitimate RTL at that time. */
7375 DECL_RTL (decl) = gen_reg_rtx (DECL_MODE (decl));
7376 store_expr (DECL_INITIAL (decl), DECL_RTL (decl), 0);
7377 TREE_ASM_WRITTEN (decl) = 1;
7379 else if (toplev && ! TREE_PUBLIC (decl))
7381 /* If this is a static const, change its apparent linkage
7382 if it belongs to a #pragma interface. */
7383 if (!interface_unknown)
7385 TREE_PUBLIC (decl) = 1;
7386 DECL_EXTERNAL (decl) = interface_only;
7388 make_decl_rtl (decl, asmspec, toplev);
7391 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7393 else if (TREE_CODE (decl) == VAR_DECL
7394 && DECL_LANG_SPECIFIC (decl)
7395 && DECL_IN_AGGR_P (decl))
7397 my_friendly_assert (TREE_STATIC (decl), 19990828);
7399 if (init == NULL_TREE
7400 #ifdef DEFAULT_STATIC_DEFS
7401 /* If this code is dead, then users must
7402 explicitly declare static member variables
7403 outside the class def'n as well. */
7404 && TYPE_NEEDS_CONSTRUCTING (type)
7408 DECL_EXTERNAL (decl) = 1;
7409 make_decl_rtl (decl, asmspec, 1);
7412 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7415 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7420 /* The old ARM scoping rules injected variables declared in the
7421 initialization statement of a for-statement into the surrounding
7422 scope. We support this usage, in order to be backward-compatible.
7423 DECL is a just-declared VAR_DECL; if necessary inject its
7424 declaration into the surrounding scope. */
7427 maybe_inject_for_scope_var (decl)
7430 if (current_binding_level->is_for_scope)
7432 struct binding_level *outer
7433 = current_binding_level->level_chain;
7435 /* Check to see if the same name is already bound at the outer
7436 level, either because it was directly declared, or because a
7437 dead for-decl got preserved. In either case, the code would
7438 not have been valid under the ARM scope rules, so clear
7439 is_for_scope for the current_binding_level.
7441 Otherwise, we need to preserve the temp slot for decl to last
7442 into the outer binding level. */
7445 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
7447 if (outer_binding && BINDING_LEVEL (outer_binding) == outer
7448 && (TREE_CODE (BINDING_VALUE (outer_binding))
7450 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
7452 BINDING_VALUE (outer_binding)
7453 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
7454 current_binding_level->is_for_scope = 0;
7456 else if (DECL_IN_MEMORY_P (decl))
7457 preserve_temp_slots (DECL_RTL (decl));
7461 /* Generate code to initialize DECL (a local variable). */
7464 initialize_local_var (decl, init, flags)
7471 type = complete_type (TREE_TYPE (decl));
7473 if (DECL_SIZE (decl) == NULL_TREE && !TREE_STATIC (decl))
7475 /* If we used it already as memory, it must stay in memory. */
7476 DECL_INITIAL (decl) = NULL_TREE;
7477 TREE_ADDRESSABLE (decl) = TREE_USED (decl);
7480 if (DECL_SIZE (decl) && type != error_mark_node)
7484 /* Compute and store the initial value. */
7485 already_used = TREE_USED (decl) || TREE_USED (type);
7487 if (init || TYPE_NEEDS_CONSTRUCTING (type))
7489 int saved_stmts_are_full_exprs_p;
7491 emit_line_note (DECL_SOURCE_FILE (decl),
7492 DECL_SOURCE_LINE (decl));
7493 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p;
7494 stmts_are_full_exprs_p = 1;
7495 finish_expr_stmt (build_aggr_init (decl, init, flags));
7496 stmts_are_full_exprs_p = saved_stmts_are_full_exprs_p;
7499 /* Set this to 0 so we can tell whether an aggregate which was
7500 initialized was ever used. Don't do this if it has a
7501 destructor, so we don't complain about the 'resource
7502 allocation is initialization' idiom. Now set
7503 attribute((unused)) on types so decls of that type will be
7504 marked used. (see TREE_USED, above.) */
7505 if (TYPE_NEEDS_CONSTRUCTING (type)
7507 && !TYPE_NEEDS_DESTRUCTOR (type)
7508 && DECL_NAME (decl))
7509 TREE_USED (decl) = 0;
7510 else if (already_used)
7511 TREE_USED (decl) = 1;
7515 /* Generate code to destroy DECL (a local variable). */
7518 destroy_local_var (decl)
7521 tree type = TREE_TYPE (decl);
7524 /* Only variables get cleaned up. */
7525 if (TREE_CODE (decl) != VAR_DECL)
7528 /* And only things with destructors need cleaning up. */
7529 if (!TYPE_NEEDS_DESTRUCTOR (type))
7532 if (TREE_CODE (decl) == VAR_DECL &&
7533 (DECL_EXTERNAL (decl) || TREE_STATIC (decl)))
7534 /* We don't clean up things that aren't defined in this
7535 translation unit, or that need a static cleanup. The latter
7536 are handled by finish_file. */
7539 /* Compute the cleanup. */
7540 cleanup = maybe_build_cleanup (decl);
7542 /* Record the cleanup required for this declaration. */
7543 if (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node
7545 finish_decl_cleanup (decl, cleanup);
7548 /* Let the back-end know about DECL. */
7551 emit_local_var (decl)
7554 /* Create RTL for this variable. */
7555 if (DECL_RTL (decl))
7556 /* Only a RESULT_DECL should have non-NULL RTL when
7557 arriving here. All other local variables are
7558 assigned RTL in this function. */
7559 my_friendly_assert (TREE_CODE (decl) == RESULT_DECL,
7564 /* Actually do the initialization. */
7565 expand_start_target_temps ();
7566 expand_decl_init (decl);
7567 expand_end_target_temps ();
7570 /* Finish processing of a declaration;
7571 install its line number and initial value.
7572 If the length of an array type is not known before,
7573 it must be determined now, from the initial value, or it is an error.
7575 Call `pop_obstacks' iff NEED_POP is nonzero.
7577 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7578 for aggregates that have constructors alive on the permanent obstack,
7579 so that the global initializing functions can be written at the end.
7581 INIT0 holds the value of an initializer that should be allowed to escape
7584 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7585 if the (init) syntax was used.
7587 For functions that take default parameters, DECL points to its
7588 "maximal" instantiation. `cp_finish_decl' must then also declared its
7589 subsequently lower and lower forms of instantiation, checking for
7590 ambiguity as it goes. This can be sped up later. */
7593 cp_finish_decl (decl, init, asmspec_tree, need_pop, flags)
7600 tree ttype = NULL_TREE;
7601 int temporary = allocation_temporary_p ();
7602 const char *asmspec = NULL;
7603 int was_readonly = 0;
7605 /* If this is 0, then we did not change obstacks. */
7609 error ("assignment (not initialization) in declaration");
7613 /* If a name was specified, get the string. */
7615 asmspec = TREE_STRING_POINTER (asmspec_tree);
7617 if (init && TREE_CODE (init) == NAMESPACE_DECL)
7619 cp_error ("Cannot initialize `%D' to namespace `%D'",
7624 if (current_class_type
7625 && DECL_REAL_CONTEXT (decl) == current_class_type
7626 && TYPE_BEING_DEFINED (current_class_type)
7627 && (DECL_INITIAL (decl) || init))
7628 DECL_DEFINED_IN_CLASS_P (decl) = 1;
7630 if (TREE_CODE (decl) == VAR_DECL
7631 && DECL_CONTEXT (decl)
7632 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
7633 && DECL_CONTEXT (decl) != current_namespace
7636 /* Leave the namespace of the object. */
7637 pop_decl_namespace ();
7640 type = TREE_TYPE (decl);
7642 if (type == error_mark_node)
7644 if (toplevel_bindings_p () && temporary)
7645 end_temporary_allocation ();
7650 /* Add this declaration to the statement-tree. */
7651 if (building_stmt_tree ()
7652 && TREE_CODE (current_scope ()) == FUNCTION_DECL)
7653 add_decl_stmt (decl);
7655 if (TYPE_HAS_MUTABLE_P (type))
7656 TREE_READONLY (decl) = 0;
7658 if (processing_template_decl)
7660 if (init && DECL_INITIAL (decl))
7661 DECL_INITIAL (decl) = init;
7665 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7666 my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828);
7668 /* Take care of TYPE_DECLs up front. */
7669 if (TREE_CODE (decl) == TYPE_DECL)
7671 if (init && DECL_INITIAL (decl))
7673 /* typedef foo = bar; store the type of bar as the type of foo. */
7674 TREE_TYPE (decl) = type = TREE_TYPE (init);
7675 DECL_INITIAL (decl) = init = NULL_TREE;
7677 if (type != error_mark_node
7678 && IS_AGGR_TYPE (type) && DECL_NAME (decl))
7680 if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
7681 cp_warning ("shadowing previous type declaration of `%#D'", decl);
7682 set_identifier_type_value (DECL_NAME (decl), type);
7683 CLASSTYPE_GOT_SEMICOLON (type) = 1;
7685 GNU_xref_decl (current_function_decl, decl);
7687 /* If we have installed this as the canonical typedef for this
7688 type, and that type has not been defined yet, delay emitting
7689 the debug information for it, as we will emit it later. */
7690 if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
7691 && TYPE_SIZE (TREE_TYPE (decl)) == NULL_TREE)
7692 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
7694 rest_of_decl_compilation (decl, NULL_PTR,
7695 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
7699 if (TREE_CODE (decl) != FUNCTION_DECL)
7700 ttype = target_type (type);
7702 if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
7703 && TYPE_NEEDS_CONSTRUCTING (type))
7705 /* Currently, GNU C++ puts constants in text space, making them
7706 impossible to initialize. In the future, one would hope for
7707 an operating system which understood the difference between
7708 initialization and the running of a program. */
7710 TREE_READONLY (decl) = 0;
7713 if (TREE_CODE (decl) == FIELD_DECL && asmspec)
7715 /* This must override the asm specifier which was placed by
7716 grokclassfn. Lay this out fresh. */
7717 DECL_RTL (TREE_TYPE (decl)) = NULL_RTX;
7718 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7719 make_decl_rtl (decl, asmspec, 0);
7722 /* Deduce size of array from initialization, if not already known. */
7723 maybe_deduce_size_from_array_init (decl, init);
7724 init = check_initializer (decl, init);
7726 GNU_xref_decl (current_function_decl, decl);
7728 /* For top-level declaration, the initial value was read in
7729 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7730 must go in the permanent obstack; but don't discard the
7731 temporary data yet. */
7733 if (toplevel_bindings_p () && temporary)
7734 end_temporary_allocation ();
7736 if (TREE_CODE (decl) == VAR_DECL)
7737 init = layout_var_decl (decl, init);
7739 /* Output the assembler code and/or RTL code for variables and functions,
7740 unless the type is an undefined structure or union.
7741 If not, it will get done when the type is completed. */
7742 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
7743 || TREE_CODE (decl) == RESULT_DECL)
7745 /* ??? FIXME: What about nested classes? */
7746 int toplev = toplevel_bindings_p ();
7748 if (TREE_CODE (decl) == VAR_DECL)
7749 maybe_commonize_var (decl);
7751 make_rtl_for_nonlocal_decl (decl, init, asmspec);
7753 if (TREE_CODE (type) == FUNCTION_TYPE
7754 || TREE_CODE (type) == METHOD_TYPE)
7755 abstract_virtuals_error (decl,
7756 strip_array_types (TREE_TYPE (type)));
7758 abstract_virtuals_error (decl, strip_array_types (type));
7760 if (TREE_CODE (decl) == FUNCTION_DECL)
7762 else if (DECL_EXTERNAL (decl)
7763 && ! (DECL_LANG_SPECIFIC (decl)
7764 && DECL_NOT_REALLY_EXTERN (decl)))
7767 DECL_INITIAL (decl) = init;
7769 else if (TREE_STATIC (decl) && type != error_mark_node)
7771 /* Cleanups for static variables are handled by `finish_file'. */
7772 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
7773 || TYPE_NEEDS_DESTRUCTOR (type))
7774 expand_static_init (decl, init);
7778 /* This is a local declaration. */
7779 maybe_inject_for_scope_var (decl);
7780 /* Initialize the local variable. But, if we're building a
7781 statement-tree, we'll do the initialization when we
7783 if (processing_template_decl)
7785 if (init || DECL_INITIAL (decl) == error_mark_node)
7786 DECL_INITIAL (decl) = init;
7790 if (!building_stmt_tree ())
7791 emit_local_var (decl);
7792 initialize_local_var (decl, init, flags);
7793 /* Clean up the variable. */
7794 destroy_local_var (decl);
7799 /* Undo call to `pushclass' that was done in `start_decl'
7800 due to initialization of qualified member variable.
7801 I.e., Foo::x = 10; */
7803 tree context = DECL_REAL_CONTEXT (decl);
7805 && TREE_CODE_CLASS (TREE_CODE (context)) == 't'
7806 && (TREE_CODE (decl) == VAR_DECL
7807 /* We also have a pushclass done that we need to undo here
7808 if we're at top level and declare a method. */
7809 || TREE_CODE (decl) == FUNCTION_DECL)
7810 /* If size hasn't been set, we're still defining it,
7811 and therefore inside the class body; don't pop
7812 the binding level.. */
7813 && TYPE_SIZE (context) != NULL_TREE
7814 && context == current_class_type)
7815 pop_nested_class ();
7821 /* If requested, warn about definitions of large data objects. */
7823 if (warn_larger_than
7824 && ! processing_template_decl
7825 && (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
7826 && !DECL_EXTERNAL (decl))
7828 register tree decl_size = DECL_SIZE (decl);
7830 if (decl_size && TREE_CODE (decl_size) == INTEGER_CST)
7832 unsigned units = TREE_INT_CST_LOW (decl_size) / BITS_PER_UNIT;
7834 if (units > larger_than_size)
7835 warning_with_decl (decl, "size of `%s' is %u bytes", units);
7840 /* Resume permanent allocation, if not within a function. The
7841 corresponding push_obstacks_nochange is in start_decl,
7842 start_method, groktypename, and in grokfield. */
7846 TREE_READONLY (decl) = 1;
7849 /* This is here for a midend callback from c-common.c */
7852 finish_decl (decl, init, asmspec_tree)
7856 cp_finish_decl (decl, init, asmspec_tree, 1, 0);
7859 /* Generate code to handle the destruction of the function-scoped
7860 static variable DECL. */
7863 destroy_local_static (decl)
7866 tree cleanup, fcall;
7868 int saved_flag_access_control;
7870 if (atexit_node == 0)
7872 tree atexit_fndecl, PFV, pfvlist;
7873 /* Remember this information until end of file. */
7874 push_obstacks (&permanent_obstack, &permanent_obstack);
7875 PFV = build_pointer_type (build_function_type
7876 (void_type_node, void_list_node));
7878 pfvlist = tree_cons (NULL_TREE, PFV, void_list_node);
7880 push_lang_context (lang_name_c);
7881 /* Note that we do not call pushdecl for this function;
7882 there's no reason that this declaration should be
7883 accessible to anyone. */
7885 = define_function ("atexit",
7886 build_function_type (void_type_node,
7888 /*pfn=*/0, NULL_PTR);
7889 mark_used (atexit_fndecl);
7890 atexit_node = default_conversion (atexit_fndecl);
7891 pop_lang_context ();
7895 /* Call build_cleanup before we enter the anonymous function so that
7896 any access checks will be done relative to the current scope,
7897 rather than the scope of the anonymous function. */
7898 build_cleanup (decl);
7900 /* Now start the function. */
7901 cleanup = start_anon_func ();
7903 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7904 to the original function, rather than the anonymous one. That
7905 will make the back-end think that nested functions are in use,
7906 which causes confusion. */
7907 saved_flag_access_control = flag_access_control;
7908 flag_access_control = 0;
7909 fcall = build_cleanup (decl);
7910 flag_access_control = saved_flag_access_control;
7912 /* Create the body of the anonymous function. */
7913 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
7914 finish_expr_stmt (fcall);
7915 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
7918 /* Call atexit with the cleanup function. */
7919 mark_addressable (cleanup);
7920 cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
7921 fcall = build_function_call (atexit_node,
7922 tree_cons (NULL_TREE,
7925 finish_expr_stmt (fcall);
7929 expand_static_init (decl, init)
7933 tree oldstatic = value_member (decl, static_aggregates);
7937 if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
7938 cp_error ("multiple initializations given for `%D'", decl);
7940 else if (! toplevel_bindings_p ())
7942 /* Emit code to perform this initialization but once. */
7949 /* Remember this information until end of file. */
7950 push_obstacks (&permanent_obstack, &permanent_obstack);
7952 /* Emit code to perform this initialization but once. This code
7955 static int temp = 0;
7957 // Do initialization.
7959 // Register variable for destruction at end of program.
7962 Note that the `temp' variable is only set to 1 *after* the
7963 initialization is complete. This ensures that an exception,
7964 thrown during the construction, will cause the variable to
7965 reinitialized when we pass through this code again, as per:
7969 If the initialization exits by throwing an exception, the
7970 initialization is not complete, so it will be tried again
7971 the next time control enters the declaration.
7973 In theory, this process should be thread-safe, too; multiple
7974 threads should not be able to initialize the variable more
7975 than once. We don't yet attempt to ensure thread-safety. */
7976 temp = get_temp_name (integer_type_node, 1);
7977 rest_of_decl_compilation (temp, NULL_PTR, 0, 0);
7979 /* Begin the conditional initialization. */
7980 if_stmt = begin_if_stmt ();
7981 finish_if_stmt_cond (build_binary_op (EQ_EXPR, temp,
7984 then_clause = begin_compound_stmt (/*has_no_scope=*/0);
7986 /* Do the initialization itself. */
7987 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
7988 || (init && TREE_CODE (init) == TREE_LIST))
7989 assignment = build_aggr_init (decl, init, 0);
7992 /* The initialization we're doing here is just a bitwise
7994 assignment = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
7995 TREE_SIDE_EFFECTS (assignment) = 1;
7998 assignment = NULL_TREE;
8000 /* Once the assignment is complete, set TEMP to 1. Since the
8001 construction of the static object is complete at this point,
8002 we want to make sure TEMP is set to 1 even if a temporary
8003 constructed during the initialization throws an exception
8004 when it is destroyed. So, we combine the initialization and
8005 the assignment to TEMP into a single expression, ensuring
8006 that when we call finish_expr_stmt the cleanups will not be
8007 run until after TEMP is set to 1. */
8008 temp_init = build_modify_expr (temp, NOP_EXPR, integer_one_node);
8011 assignment = tree_cons (NULL_TREE, assignment,
8012 build_tree_list (NULL_TREE,
8014 assignment = build_compound_expr (assignment);
8017 assignment = temp_init;
8018 finish_expr_stmt (assignment);
8020 /* Use atexit to register a function for destroying this static
8022 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl)))
8023 destroy_local_static (decl);
8025 finish_compound_stmt (/*has_no_scope=*/0, then_clause);
8026 finish_then_clause (if_stmt);
8029 /* Resume old (possibly temporary) allocation. */
8034 /* This code takes into account memory allocation policy of
8035 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8036 hold for this object, then we must make permanent the storage
8037 currently in the temporary obstack. */
8038 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
8039 preserve_initializer ();
8040 static_aggregates = tree_cons (init, decl, static_aggregates);
8044 /* Finish the declaration of a catch-parameter. */
8047 start_handler_parms (declspecs, declarator)
8054 decl = grokdeclarator (declarator, declspecs, CATCHPARM,
8056 if (decl == NULL_TREE)
8057 error ("invalid catch parameter");
8061 expand_start_catch_block (decl);
8065 /* Make TYPE a complete type based on INITIAL_VALUE.
8066 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8067 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8070 complete_array_type (type, initial_value, do_default)
8071 tree type, initial_value;
8074 register tree maxindex = NULL_TREE;
8077 /* Allocate on the same obstack as TYPE. */
8078 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
8082 /* Note MAXINDEX is really the maximum index,
8083 one less than the size. */
8084 if (TREE_CODE (initial_value) == STRING_CST)
8087 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8088 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8091 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8093 tree elts = CONSTRUCTOR_ELTS (initial_value);
8094 maxindex = size_binop (MINUS_EXPR, integer_zero_node, size_one_node);
8095 for (; elts; elts = TREE_CHAIN (elts))
8097 if (TREE_PURPOSE (elts))
8098 maxindex = TREE_PURPOSE (elts);
8100 maxindex = size_binop (PLUS_EXPR, maxindex, size_one_node);
8102 maxindex = copy_node (maxindex);
8106 /* Make an error message unless that happened already. */
8107 if (initial_value != error_mark_node)
8110 initial_value = NULL_TREE;
8112 /* Prevent further error messages. */
8113 maxindex = build_int_2 (0, 0);
8120 maxindex = build_int_2 (0, 0);
8129 domain = build_index_type (maxindex);
8130 TYPE_DOMAIN (type) = domain;
8132 if (! TREE_TYPE (maxindex))
8133 TREE_TYPE (maxindex) = domain;
8135 itype = TREE_TYPE (initial_value);
8138 if (itype && !TYPE_DOMAIN (itype))
8139 TYPE_DOMAIN (itype) = domain;
8140 /* The type of the main variant should never be used for arrays
8141 of different sizes. It should only ever be completed with the
8142 size of the array. */
8143 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8144 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain;
8149 /* Lay out the type now that we can get the real answer. */
8156 /* Return zero if something is declared to be a member of type
8157 CTYPE when in the context of CUR_TYPE. STRING is the error
8158 message to print in that case. Otherwise, quietly return 1. */
8161 member_function_or_else (ctype, cur_type, string)
8162 tree ctype, cur_type;
8165 if (ctype && ctype != cur_type)
8167 error (string, TYPE_NAME_STRING (ctype));
8173 /* Subroutine of `grokdeclarator'. */
8175 /* Generate errors possibly applicable for a given set of specifiers.
8176 This is for ARM $7.1.2. */
8179 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8182 int virtualp, quals, friendp, raises, inlinep;
8185 cp_error ("`%D' declared as a `virtual' %s", object, type);
8187 cp_error ("`%D' declared as an `inline' %s", object, type);
8189 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8192 cp_error_at ("`%D' declared as a friend", object);
8194 cp_error_at ("`%D' declared with an exception specification", object);
8197 /* CTYPE is class type, or null if non-class.
8198 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8200 DECLARATOR is the function's name.
8201 VIRTUALP is truthvalue of whether the function is virtual or not.
8202 FLAGS are to be passed through to `grokclassfn'.
8203 QUALS are qualifiers indicating whether the function is `const'
8205 RAISES is a list of exceptions that this function can raise.
8206 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8207 not look, and -1 if we should not call `grokclassfn' at all.
8209 Returns `NULL_TREE' if something goes wrong, after issuing
8210 applicable error messages. */
8213 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8214 raises, check, friendp, publicp, inlinep, funcdef_flag,
8215 template_count, in_namespace)
8218 tree orig_declarator;
8220 enum overload_flags flags;
8222 int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8226 int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8227 int has_default_arg = 0;
8231 cname = TREE_CODE (TYPE_NAME (ctype)) == TYPE_DECL
8232 ? TYPE_IDENTIFIER (ctype) : TYPE_NAME (ctype);
8238 type = build_exception_variant (type, raises);
8241 decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8242 /* Propagate volatile out from type to decl. */
8243 if (TYPE_VOLATILE (type))
8244 TREE_THIS_VOLATILE (decl) = 1;
8246 /* If this decl has namespace scope, set that up. */
8248 set_decl_namespace (decl, in_namespace, friendp);
8249 else if (publicp && ! ctype)
8250 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8252 /* `main' and builtins have implicit 'C' linkage. */
8253 if ((MAIN_NAME_P (declarator)
8254 || (IDENTIFIER_LENGTH (declarator) > 10
8255 && IDENTIFIER_POINTER (declarator)[0] == '_'
8256 && IDENTIFIER_POINTER (declarator)[1] == '_'
8257 && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8258 && current_lang_name == lang_name_cplusplus
8259 && ctype == NULL_TREE
8260 /* NULL_TREE means global namespace. */
8261 && DECL_CONTEXT (decl) == NULL_TREE)
8262 DECL_LANGUAGE (decl) = lang_c;
8264 /* Should probably propagate const out from type to decl I bet (mrs). */
8267 DECL_STATIC_FUNCTION_P (decl) = 1;
8268 DECL_CONTEXT (decl) = ctype;
8272 DECL_CLASS_CONTEXT (decl) = ctype;
8274 if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8276 if (processing_template_decl)
8277 error ("cannot declare `main' to be a template");
8279 error ("cannot declare `main' to be inline");
8281 error ("cannot declare `main' to be static");
8286 /* Members of anonymous types and local classes have no linkage; make
8288 if (ctype && (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype))
8289 || hack_decl_function_context (TYPE_MAIN_DECL (ctype))))
8294 /* [basic.link]: A name with no linkage (notably, the name of a class
8295 or enumeration declared in a local scope) shall not be used to
8296 declare an entity with linkage.
8298 Only check this for public decls for now. */
8299 t = no_linkage_check (TREE_TYPE (decl));
8302 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8304 if (DECL_LANGUAGE (decl) == lang_c)
8305 /* Allow this; it's pretty common in C. */;
8307 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8311 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8316 TREE_PUBLIC (decl) = publicp;
8319 DECL_INTERFACE_KNOWN (decl) = 1;
8320 DECL_NOT_REALLY_EXTERN (decl) = 1;
8324 DECL_THIS_INLINE (decl) = DECL_INLINE (decl) = 1;
8326 DECL_EXTERNAL (decl) = 1;
8327 if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8329 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8330 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8334 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8335 grok_op_properties (decl, virtualp, check < 0);
8337 if (ctype && hack_decl_function_context (decl))
8338 DECL_NO_STATIC_CHAIN (decl) = 1;
8340 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8341 if (TREE_PURPOSE (t)
8342 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8344 has_default_arg = 1;
8349 && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8353 ("defining explicit specialization `%D' in friend declaration",
8357 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8359 /* Something like `template <class T> friend void f<T>()'. */
8360 cp_error ("template-id `%D' in declaration of primary template",
8366 /* A friend declaration of the form friend void f<>(). Record
8367 the information in the TEMPLATE_ID_EXPR. */
8368 SET_DECL_IMPLICIT_INSTANTIATION (decl);
8369 DECL_TEMPLATE_INFO (decl)
8370 = tree_cons (TREE_OPERAND (orig_declarator, 0),
8371 TREE_OPERAND (orig_declarator, 1),
8374 if (has_default_arg)
8376 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8383 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8390 if (has_default_arg)
8391 add_defarg_fn (decl);
8393 /* Plain overloading: will not be grok'd by grokclassfn. */
8394 if (! ctype && ! processing_template_decl
8395 && DECL_LANGUAGE (decl) != lang_c
8396 && (! DECL_USE_TEMPLATE (decl) || name_mangling_version < 1))
8397 set_mangled_name_for_decl (decl);
8400 /* Make the init_value nonzero so pushdecl knows this is not
8401 tentative. error_mark_node is replaced later with the BLOCK. */
8402 DECL_INITIAL (decl) = error_mark_node;
8404 /* Caller will do the rest of this. */
8408 if (check && funcdef_flag)
8409 DECL_INITIAL (decl) = error_mark_node;
8411 if (flags == NO_SPECIAL && ctype && constructor_name (cname) == declarator)
8414 /* Just handle constructors here. We could do this
8415 inside the following if stmt, but I think
8416 that the code is more legible by breaking this
8417 case out. See comments below for what each of
8418 the following calls is supposed to do. */
8419 DECL_CONSTRUCTOR_P (decl) = 1;
8421 grokclassfn (ctype, decl, flags, quals);
8423 decl = check_explicit_specialization (orig_declarator, decl,
8425 2 * (funcdef_flag != 0) +
8426 4 * (friendp != 0));
8427 if (decl == error_mark_node)
8430 if ((! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8433 tmp = check_classfn (ctype, decl);
8435 if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL)
8436 tmp = DECL_TEMPLATE_RESULT(tmp);
8438 if (tmp && DECL_ARTIFICIAL (tmp))
8439 cp_error ("definition of implicitly-declared `%D'", tmp);
8440 if (tmp && duplicate_decls (decl, tmp))
8443 if (! grok_ctor_properties (ctype, decl))
8450 /* Function gets the ugly name, field gets the nice one.
8451 This call may change the type of the function (because
8452 of default parameters)! */
8453 if (ctype != NULL_TREE)
8454 grokclassfn (ctype, decl, flags, quals);
8456 decl = check_explicit_specialization (orig_declarator, decl,
8458 2 * (funcdef_flag != 0) +
8459 4 * (friendp != 0));
8460 if (decl == error_mark_node)
8463 if (ctype != NULL_TREE
8464 && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8467 tmp = check_classfn (ctype, decl);
8469 if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL)
8470 tmp = DECL_TEMPLATE_RESULT (tmp);
8472 if (tmp && DECL_STATIC_FUNCTION_P (tmp)
8473 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
8475 /* Remove the `this' parm added by grokclassfn.
8476 XXX Isn't this done in start_function, too? */
8477 revert_static_member_fn (&decl, NULL, NULL);
8478 last_function_parms = TREE_CHAIN (last_function_parms);
8480 if (tmp && DECL_ARTIFICIAL (tmp))
8481 cp_error ("definition of implicitly-declared `%D'", tmp);
8484 /* Attempt to merge the declarations. This can fail, in
8485 the case of some illegal specialization declarations. */
8486 if (!duplicate_decls (decl, tmp))
8487 cp_error ("no `%#D' member function declared in class `%T'",
8493 if (ctype == NULL_TREE || check)
8498 DECL_VIRTUAL_P (decl) = 1;
8499 if (DECL_VINDEX (decl) == NULL_TREE)
8500 DECL_VINDEX (decl) = error_mark_node;
8501 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
8508 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
8511 RID_BIT_TYPE *specbits_in;
8517 RID_BIT_TYPE specbits;
8519 specbits = *specbits_in;
8521 if (TREE_CODE (type) == OFFSET_TYPE)
8523 /* If you declare a static member so that it
8524 can be initialized, the code will reach here. */
8525 tree basetype = TYPE_OFFSET_BASETYPE (type);
8526 type = TREE_TYPE (type);
8527 decl = build_lang_decl (VAR_DECL, declarator, type);
8528 DECL_CONTEXT (decl) = basetype;
8529 DECL_CLASS_CONTEXT (decl) = basetype;
8530 DECL_ASSEMBLER_NAME (decl) = build_static_name (basetype, declarator);
8537 context = in_namespace;
8538 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
8539 context = current_namespace;
8541 context = NULL_TREE;
8543 if (processing_template_decl)
8545 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8546 we can call push_template_decl. */
8547 push_permanent_obstack ();
8548 decl = build_lang_decl (VAR_DECL, declarator, type);
8552 decl = build_decl (VAR_DECL, declarator, type);
8555 set_decl_namespace (decl, context, 0);
8557 context = DECL_CONTEXT (decl);
8558 if (declarator && context && current_lang_name != lang_name_c)
8559 DECL_ASSEMBLER_NAME (decl) = build_static_name (context, declarator);
8563 set_decl_namespace (decl, in_namespace, 0);
8565 if (RIDBIT_SETP (RID_EXTERN, specbits))
8567 DECL_THIS_EXTERN (decl) = 1;
8568 DECL_EXTERNAL (decl) = !initialized;
8571 /* In class context, static means one per class,
8572 public access, and static storage. */
8573 if (DECL_CLASS_SCOPE_P (decl))
8575 TREE_PUBLIC (decl) = 1;
8576 TREE_STATIC (decl) = 1;
8577 DECL_EXTERNAL (decl) = 0;
8579 /* At top level, either `static' or no s.c. makes a definition
8580 (perhaps tentative), and absence of `static' makes it public. */
8581 else if (toplevel_bindings_p ())
8583 TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
8584 && (DECL_THIS_EXTERN (decl) || ! constp));
8585 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
8587 /* Not at top level, only `static' makes a static definition. */
8590 TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
8591 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
8594 if (TREE_PUBLIC (decl))
8596 /* [basic.link]: A name with no linkage (notably, the name of a class
8597 or enumeration declared in a local scope) shall not be used to
8598 declare an entity with linkage.
8600 Only check this for public decls for now. */
8601 tree t = no_linkage_check (TREE_TYPE (decl));
8604 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8605 /* Ignore for now; `enum { foo } e' is pretty common. */;
8607 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8615 /* Create and return a canonical pointer to member function type, for
8616 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8619 build_ptrmemfunc_type (type)
8625 tree unqualified_variant = NULL_TREE;
8627 /* If a canonical type already exists for this type, use it. We use
8628 this method instead of type_hash_canon, because it only does a
8629 simple equality check on the list of field members. */
8631 if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
8634 /* Make sure that we always have the unqualified pointer-to-member
8636 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
8638 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));
8640 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
8642 u = make_lang_type (UNION_TYPE);
8643 SET_IS_AGGR_TYPE (u, 0);
8644 fields[0] = build_lang_decl (FIELD_DECL, pfn_identifier, type);
8645 fields[1] = build_lang_decl (FIELD_DECL, delta2_identifier,
8647 finish_builtin_type (u, "__ptrmemfunc_type", fields, 1, ptr_type_node);
8648 TYPE_NAME (u) = NULL_TREE;
8650 t = make_lang_type (RECORD_TYPE);
8652 /* Let the front-end know this is a pointer to member function... */
8653 TYPE_PTRMEMFUNC_FLAG (t) = 1;
8654 /* ... and not really an aggregate. */
8655 SET_IS_AGGR_TYPE (t, 0);
8657 fields[0] = build_lang_decl (FIELD_DECL, delta_identifier,
8659 fields[1] = build_lang_decl (FIELD_DECL, index_identifier,
8661 fields[2] = build_lang_decl (FIELD_DECL, pfn_or_delta2_identifier, u);
8662 finish_builtin_type (t, "__ptrmemfunc_type", fields, 2, ptr_type_node);
8666 /* Zap out the name so that the back-end will give us the debugging
8667 information for this anonymous RECORD_TYPE. */
8668 TYPE_NAME (t) = NULL_TREE;
8670 /* If this is not the unqualified form of this pointer-to-member
8671 type, set the TYPE_MAIN_VARIANT for this type to be the
8672 unqualified type. Since they are actually RECORD_TYPEs that are
8673 not variants of each other, we must do this manually. */
8674 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
8676 t = build_qualified_type (t, CP_TYPE_QUALS (type));
8677 TYPE_MAIN_VARIANT (t) = unqualified_variant;
8678 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
8679 TYPE_NEXT_VARIANT (unqualified_variant) = t;
8682 /* Cache this pointer-to-member type so that we can find it again
8684 TYPE_SET_PTRMEMFUNC_TYPE (type, t);
8686 /* Seems to be wanted. */
8687 CLASSTYPE_GOT_SEMICOLON (t) = 1;
8692 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8693 Check to see that the definition is valid. Issue appropriate error
8694 messages. Return 1 if the definition is particularly bad, or 0
8698 check_static_variable_definition (decl, type)
8702 /* Motion 10 at San Diego: If a static const integral data member is
8703 initialized with an integral constant expression, the initializer
8704 may appear either in the declaration (within the class), or in
8705 the definition, but not both. If it appears in the class, the
8706 member is a member constant. The file-scope definition is always
8708 if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
8710 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8712 /* If we just return the declaration, crashes will sometimes
8713 occur. We therefore return void_type_node, as if this was a
8714 friend declaration, to cause callers to completely ignore
8715 this declaration. */
8718 else if (!CP_TYPE_CONST_P (type))
8719 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8721 else if (pedantic && !INTEGRAL_TYPE_P (type))
8722 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
8727 /* Given declspecs and a declarator,
8728 determine the name and type of the object declared
8729 and construct a ..._DECL node for it.
8730 (In one case we can return a ..._TYPE node instead.
8731 For invalid input we sometimes return 0.)
8733 DECLSPECS is a chain of tree_list nodes whose value fields
8734 are the storage classes and type specifiers.
8736 DECL_CONTEXT says which syntactic context this declaration is in:
8737 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8738 FUNCDEF for a function definition. Like NORMAL but a few different
8739 error messages in each case. Return value may be zero meaning
8740 this definition is too screwy to try to parse.
8741 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8742 handle member functions (which have FIELD context).
8743 Return value may be zero meaning this definition is too screwy to
8745 PARM for a parameter declaration (either within a function prototype
8746 or before a function body). Make a PARM_DECL, or return void_type_node.
8747 CATCHPARM for a parameter declaration before a catch clause.
8748 TYPENAME if for a typename (in a cast or sizeof).
8749 Don't make a DECL node; just return the ..._TYPE node.
8750 FIELD for a struct or union field; make a FIELD_DECL.
8751 BITFIELD for a field with specified width.
8752 INITIALIZED is 1 if the decl has an initializer.
8754 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8755 normal attributes in TREE_PURPOSE, or NULL_TREE.
8757 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8758 It may also be so in the PARM case, for a prototype where the
8759 argument type is specified but not the name.
8761 This function is where the complicated C meanings of `static'
8762 and `extern' are interpreted.
8764 For C++, if there is any monkey business to do, the function which
8765 calls this one must do it, i.e., prepending instance variables,
8766 renaming overloaded function names, etc.
8768 Note that for this C++, it is an error to define a method within a class
8769 which does not belong to that class.
8771 Except in the case where SCOPE_REFs are implicitly known (such as
8772 methods within a class being redundantly qualified),
8773 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8774 (class_name::decl_name). The caller must also deal with this.
8776 If a constructor or destructor is seen, and the context is FIELD,
8777 then the type gains the attribute TREE_HAS_x. If such a declaration
8778 is erroneous, NULL_TREE is returned.
8780 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8781 function, these are the qualifiers to give to the `this' pointer.
8783 May return void_type_node if the declarator turned out to be a friend.
8784 See grokfield for details. */
8786 enum return_types { return_normal, return_ctor, return_dtor, return_conversion };
8789 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
8792 enum decl_context decl_context;
8796 RID_BIT_TYPE specbits;
8799 tree type = NULL_TREE;
8805 int virtualp, explicitp, friendp, inlinep, staticp;
8806 int explicit_int = 0;
8807 int explicit_char = 0;
8808 int defaulted_int = 0;
8809 tree typedef_decl = NULL_TREE;
8811 tree typedef_type = NULL_TREE;
8812 int funcdef_flag = 0;
8813 enum tree_code innermost_code = ERROR_MARK;
8816 /* See the code below that used this. */
8817 tree decl_machine_attr = NULL_TREE;
8819 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8820 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8821 tree init = NULL_TREE;
8823 /* Keep track of what sort of function is being processed
8824 so that we can warn about default return values, or explicit
8825 return values which do not match prescribed defaults. */
8826 enum return_types return_type = return_normal;
8828 tree dname = NULL_TREE;
8829 tree ctype = current_class_type;
8830 tree ctor_return_type = NULL_TREE;
8831 enum overload_flags flags = NO_SPECIAL;
8832 tree quals = NULL_TREE;
8833 tree raises = NULL_TREE;
8834 int template_count = 0;
8835 tree in_namespace = NULL_TREE;
8839 RIDBIT_RESET_ALL (specbits);
8840 if (decl_context == FUNCDEF)
8841 funcdef_flag = 1, decl_context = NORMAL;
8842 else if (decl_context == MEMFUNCDEF)
8843 funcdef_flag = -1, decl_context = FIELD;
8844 else if (decl_context == BITFIELD)
8845 bitfield = 1, decl_context = FIELD;
8847 /* Look inside a declarator for the name being declared
8848 and get it as a string, for an error message. */
8850 tree *next = &declarator;
8854 while (next && *next)
8857 switch (TREE_CODE (decl))
8860 /* For attributes. */
8861 next = &TREE_VALUE (decl);
8866 next = &TREE_OPERAND (decl, 0);
8869 case BIT_NOT_EXPR: /* For C++ destructors! */
8871 tree name = TREE_OPERAND (decl, 0);
8872 tree rename = NULL_TREE;
8874 my_friendly_assert (flags == NO_SPECIAL, 152);
8876 return_type = return_dtor;
8877 if (TREE_CODE (name) == TYPE_DECL)
8878 TREE_OPERAND (decl, 0) = name = constructor_name (name);
8879 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
8880 if (ctype == NULL_TREE)
8882 if (current_class_type == NULL_TREE)
8884 error ("destructors must be member functions");
8889 tree t = constructor_name (current_class_name);
8896 tree t = constructor_name (ctype);
8903 cp_error ("destructor `%T' must match class name `%T'",
8905 TREE_OPERAND (decl, 0) = rename;
8911 case ADDR_EXPR: /* C++ reference declaration */
8916 innermost_code = TREE_CODE (decl);
8917 next = &TREE_OPERAND (decl, 0);
8921 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl)))
8923 /* This is actually a variable declaration using
8924 constructor syntax. We need to call start_decl and
8925 cp_finish_decl so we can get the variable
8928 tree attributes, prefix_attributes;
8930 *next = TREE_OPERAND (decl, 0);
8931 init = CALL_DECLARATOR_PARMS (decl);
8935 attributes = TREE_PURPOSE (attrlist);
8936 prefix_attributes = TREE_VALUE (attrlist);
8940 attributes = NULL_TREE;
8941 prefix_attributes = NULL_TREE;
8944 decl = start_decl (declarator, declspecs, 1,
8945 attributes, prefix_attributes);
8948 /* Look for __unused__ attribute */
8949 if (TREE_USED (TREE_TYPE (decl)))
8950 TREE_USED (decl) = 1;
8951 finish_decl (decl, init, NULL_TREE);
8954 cp_error ("invalid declarator");
8957 innermost_code = TREE_CODE (decl);
8958 if (decl_context == FIELD && ctype == NULL_TREE)
8959 ctype = current_class_type;
8961 && TREE_OPERAND (decl, 0)
8962 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
8963 && ((DECL_NAME (TREE_OPERAND (decl, 0))
8964 == constructor_name_full (ctype))
8965 || (DECL_NAME (TREE_OPERAND (decl, 0))
8966 == constructor_name (ctype)))))
8967 TREE_OPERAND (decl, 0) = constructor_name (ctype);
8968 next = &TREE_OPERAND (decl, 0);
8970 if (ctype != NULL_TREE
8971 && decl != NULL_TREE && flags != DTOR_FLAG
8972 && decl == constructor_name (ctype))
8974 return_type = return_ctor;
8975 ctor_return_type = ctype;
8980 case TEMPLATE_ID_EXPR:
8982 tree fns = TREE_OPERAND (decl, 0);
8984 if (TREE_CODE (fns) == LOOKUP_EXPR)
8985 fns = TREE_OPERAND (fns, 0);
8988 if (TREE_CODE (dname) == COMPONENT_REF)
8989 dname = TREE_OPERAND (dname, 1);
8990 if (TREE_CODE (dname) != IDENTIFIER_NODE)
8992 my_friendly_assert (is_overloaded_fn (dname),
8994 dname = DECL_NAME (get_first_fn (dname));
8999 case IDENTIFIER_NODE:
9000 if (TREE_CODE (decl) == IDENTIFIER_NODE)
9007 cp_error ("declarator-id missing; using reserved word `%D'",
9009 name = IDENTIFIER_POINTER (dname);
9011 if (! IDENTIFIER_OPNAME_P (dname)
9012 /* GNU/Linux headers use '__op'. Arrgh. */
9013 || (IDENTIFIER_TYPENAME_P (dname) && ! TREE_TYPE (dname)))
9014 name = IDENTIFIER_POINTER (dname);
9017 if (IDENTIFIER_TYPENAME_P (dname))
9019 my_friendly_assert (flags == NO_SPECIAL, 154);
9020 flags = TYPENAME_FLAG;
9021 ctor_return_type = TREE_TYPE (dname);
9022 return_type = return_conversion;
9024 name = operator_name_string (dname);
9031 /* Perform error checking, and decide on a ctype. */
9032 tree cname = TREE_OPERAND (decl, 0);
9033 if (cname == NULL_TREE)
9035 else if (TREE_CODE (cname) == NAMESPACE_DECL)
9038 in_namespace = TREE_OPERAND (decl, 0);
9039 TREE_OPERAND (decl, 0) = NULL_TREE;
9041 else if (! is_aggr_type (cname, 1))
9042 TREE_OPERAND (decl, 0) = NULL_TREE;
9043 /* Must test TREE_OPERAND (decl, 1), in case user gives
9044 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9045 else if (TREE_OPERAND (decl, 1)
9046 && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9048 else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9049 || TREE_CODE (cname) == TEMPLATE_TEMPLATE_PARM)
9051 cp_error ("`%T::%D' is not a valid declarator", cname,
9052 TREE_OPERAND (decl, 1));
9053 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9054 cname, TREE_OPERAND (decl, 1));
9055 return void_type_node;
9057 else if (ctype == NULL_TREE)
9059 else if (TREE_COMPLEXITY (decl) == current_class_depth)
9060 TREE_OPERAND (decl, 0) = ctype;
9063 if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9065 cp_error ("type `%T' is not derived from type `%T'",
9067 TREE_OPERAND (decl, 0) = NULL_TREE;
9073 if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9074 && ((DECL_NAME (TREE_OPERAND (decl, 1))
9075 == constructor_name_full (ctype))
9076 || (DECL_NAME (TREE_OPERAND (decl, 1))
9077 == constructor_name (ctype))))
9078 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9079 next = &TREE_OPERAND (decl, 1);
9083 if (TREE_CODE (decl) == IDENTIFIER_NODE
9084 && constructor_name (ctype) == decl)
9086 return_type = return_ctor;
9087 ctor_return_type = ctype;
9089 else if (TREE_CODE (decl) == BIT_NOT_EXPR
9090 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9091 && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
9092 || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
9094 return_type = return_dtor;
9095 ctor_return_type = ctype;
9097 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9098 next = &TREE_OPERAND (decl, 0);
9109 /* Parse error puts this typespec where
9110 a declarator should go. */
9111 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl));
9112 if (TREE_TYPE (decl) == current_class_type)
9113 cp_error (" perhaps you want `%T' for a constructor",
9114 current_class_name);
9115 dname = DECL_NAME (decl);
9116 name = IDENTIFIER_POINTER (dname);
9118 /* Avoid giving two errors for this. */
9119 IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9121 declspecs = temp_tree_cons (NULL_TREE, integer_type_node,
9128 cp_compiler_error ("`%D' as declarator", decl);
9129 return 0; /* We used to do a 155 abort here. */
9136 /* A function definition's declarator must have the form of
9137 a function declarator. */
9139 if (funcdef_flag && innermost_code != CALL_EXPR)
9142 if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
9143 && innermost_code != CALL_EXPR
9144 && ! (ctype && declspecs == NULL_TREE))
9146 cp_error ("declaration of `%D' as non-function", dname);
9147 return void_type_node;
9150 /* Anything declared one level down from the top level
9151 must be one of the parameters of a function
9152 (because the body is at least two levels down). */
9154 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9155 by not allowing C++ class definitions to specify their parameters
9156 with xdecls (must be spec.d in the parmlist).
9158 Since we now wait to push a class scope until we are sure that
9159 we are in a legitimate method context, we must set oldcname
9160 explicitly (since current_class_name is not yet alive).
9162 We also want to avoid calling this a PARM if it is in a namespace. */
9164 if (decl_context == NORMAL && !toplevel_bindings_p ())
9166 struct binding_level *b = current_binding_level;
9167 current_binding_level = b->level_chain;
9168 if (current_binding_level != 0 && toplevel_bindings_p ())
9169 decl_context = PARM;
9170 current_binding_level = b;
9173 /* Look through the decl specs and record which ones appear.
9174 Some typespecs are defined as built-in typenames.
9175 Others, the ones that are modifiers of other types,
9176 are represented by bits in SPECBITS: set the bits for
9177 the modifiers that appear. Storage class keywords are also in SPECBITS.
9179 If there is a typedef name or a type, store the type in TYPE.
9180 This includes builtin typedefs such as `int'.
9182 Set EXPLICIT_INT if the type is `int' or `char' and did not
9183 come from a user typedef.
9185 Set LONGLONG if `long' is mentioned twice.
9187 For C++, constructors and destructors have their own fast treatment. */
9189 for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
9194 /* Certain parse errors slip through. For example,
9195 `int class;' is not caught by the parser. Try
9196 weakly to recover here. */
9197 if (TREE_CODE (spec) != TREE_LIST)
9200 id = TREE_VALUE (spec);
9202 if (TREE_CODE (id) == IDENTIFIER_NODE)
9204 if (id == ridpointers[(int) RID_INT]
9205 || id == ridpointers[(int) RID_CHAR]
9206 || id == ridpointers[(int) RID_BOOL]
9207 || id == ridpointers[(int) RID_WCHAR])
9211 if (id == ridpointers[(int) RID_BOOL])
9212 error ("`bool' is now a keyword");
9214 cp_error ("extraneous `%T' ignored", id);
9218 if (id == ridpointers[(int) RID_INT])
9220 else if (id == ridpointers[(int) RID_CHAR])
9222 type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
9226 /* C++ aggregate types. */
9227 if (IDENTIFIER_HAS_TYPE_VALUE (id))
9230 cp_error ("multiple declarations `%T' and `%T'", type, id);
9232 type = IDENTIFIER_TYPE_VALUE (id);
9236 for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
9238 if (ridpointers[i] == id)
9240 if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
9242 if (pedantic && ! in_system_header && warn_long_long)
9243 pedwarn ("ANSI C++ does not support `long long'");
9245 error ("`long long long' is too long for GCC");
9249 else if (RIDBIT_SETP (i, specbits))
9250 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
9251 RIDBIT_SET (i, specbits);
9256 /* C++ aggregate types. */
9257 else if (TREE_CODE (id) == TYPE_DECL || TREE_CODE (id) == TEMPLATE_DECL)
9260 cp_error ("multiple declarations `%T' and `%T'", type,
9264 type = TREE_TYPE (id);
9265 TREE_VALUE (spec) = type;
9270 error ("two or more data types in declaration of `%s'", name);
9271 else if (TREE_CODE (id) == IDENTIFIER_NODE)
9273 register tree t = lookup_name (id, 1);
9274 if (!t || TREE_CODE (t) != TYPE_DECL)
9275 error ("`%s' fails to be a typedef or built in type",
9276 IDENTIFIER_POINTER (id));
9279 type = TREE_TYPE (t);
9281 /* See the code below that used this. */
9282 decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id);
9287 else if (id != error_mark_node)
9288 /* Can't change CLASS nodes into RECORD nodes here! */
9294 typedef_type = type;
9296 /* No type at all: default to `int', and set DEFAULTED_INT
9297 because it was not a user-defined typedef. */
9299 if (type == NULL_TREE
9300 && (RIDBIT_SETP (RID_SIGNED, specbits)
9301 || RIDBIT_SETP (RID_UNSIGNED, specbits)
9302 || RIDBIT_SETP (RID_LONG, specbits)
9303 || RIDBIT_SETP (RID_SHORT, specbits)))
9305 /* These imply 'int'. */
9306 type = integer_type_node;
9310 if (type == NULL_TREE)
9313 if (return_type == return_dtor)
9314 type = void_type_node;
9315 else if (return_type == return_ctor)
9316 type = build_pointer_type (ctor_return_type);
9317 else if (return_type == return_conversion)
9318 type = ctor_return_type;
9321 /* We handle `main' specially here, because 'main () { }' is so
9322 common. With no options, it is allowed. With -Wreturn-type,
9323 it is a warning. It is only an error with -pedantic-errors. */
9324 int is_main = (funcdef_flag
9325 && MAIN_NAME_P (dname)
9326 && ctype == NULL_TREE
9327 && in_namespace == NULL_TREE
9328 && current_namespace == global_namespace);
9330 if (in_system_header || flag_ms_extensions)
9331 /* Allow it, sigh. */;
9332 else if (pedantic || ! is_main)
9333 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9335 else if (warn_return_type)
9336 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9339 type = integer_type_node;
9342 else if (return_type == return_dtor)
9344 error ("return type specification for destructor invalid");
9345 type = void_type_node;
9347 else if (return_type == return_ctor)
9349 error ("return type specification for constructor invalid");
9350 type = build_pointer_type (ctor_return_type);
9352 else if (return_type == return_conversion)
9354 if (!same_type_p (type, ctor_return_type))
9355 cp_error ("operator `%T' declared to return `%T'",
9356 ctor_return_type, type);
9358 cp_pedwarn ("return type specified for `operator %T'",
9361 type = ctor_return_type;
9366 /* Now process the modifiers that were specified
9367 and check for invalid combinations. */
9369 /* Long double is a special combination. */
9371 if (RIDBIT_SETP (RID_LONG, specbits)
9372 && TYPE_MAIN_VARIANT (type) == double_type_node)
9374 RIDBIT_RESET (RID_LONG, specbits);
9375 type = build_qualified_type (long_double_type_node,
9376 CP_TYPE_QUALS (type));
9379 /* Check all other uses of type modifiers. */
9381 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9382 || RIDBIT_SETP (RID_SIGNED, specbits)
9383 || RIDBIT_SETP (RID_LONG, specbits)
9384 || RIDBIT_SETP (RID_SHORT, specbits))
9388 if (TREE_CODE (type) == REAL_TYPE)
9389 error ("short, signed or unsigned invalid for `%s'", name);
9390 else if (TREE_CODE (type) != INTEGER_TYPE)
9391 error ("long, short, signed or unsigned invalid for `%s'", name);
9392 else if (RIDBIT_SETP (RID_LONG, specbits)
9393 && RIDBIT_SETP (RID_SHORT, specbits))
9394 error ("long and short specified together for `%s'", name);
9395 else if ((RIDBIT_SETP (RID_LONG, specbits)
9396 || RIDBIT_SETP (RID_SHORT, specbits))
9398 error ("long or short specified with char for `%s'", name);
9399 else if ((RIDBIT_SETP (RID_LONG, specbits)
9400 || RIDBIT_SETP (RID_SHORT, specbits))
9401 && TREE_CODE (type) == REAL_TYPE)
9402 error ("long or short specified with floating type for `%s'", name);
9403 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9404 && RIDBIT_SETP (RID_UNSIGNED, specbits))
9405 error ("signed and unsigned given together for `%s'", name);
9409 if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
9411 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9413 if (flag_pedantic_errors)
9418 /* Discard the type modifiers if they are invalid. */
9421 RIDBIT_RESET (RID_UNSIGNED, specbits);
9422 RIDBIT_RESET (RID_SIGNED, specbits);
9423 RIDBIT_RESET (RID_LONG, specbits);
9424 RIDBIT_RESET (RID_SHORT, specbits);
9429 if (RIDBIT_SETP (RID_COMPLEX, specbits)
9430 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
9432 error ("complex invalid for `%s'", name);
9433 RIDBIT_RESET (RID_COMPLEX, specbits);
9436 /* Decide whether an integer type is signed or not.
9437 Optionally treat bitfields as signed by default. */
9438 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9441 It is implementation-defined whether a plain (neither
9442 explicitly signed or unsigned) char, short, int, or long
9443 bit-field is signed or unsigned.
9445 Naturally, we extend this to long long as well. Note that
9446 this does not include wchar_t. */
9447 || (bitfield && !flag_signed_bitfields
9448 && RIDBIT_NOTSETP (RID_SIGNED, specbits)
9449 /* A typedef for plain `int' without `signed' can be
9450 controlled just like plain `int', but a typedef for
9451 `signed int' cannot be so controlled. */
9453 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
9454 && (TREE_CODE (type) == INTEGER_TYPE
9455 || TREE_CODE (type) == CHAR_TYPE)
9456 && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
9459 type = long_long_unsigned_type_node;
9460 else if (RIDBIT_SETP (RID_LONG, specbits))
9461 type = long_unsigned_type_node;
9462 else if (RIDBIT_SETP (RID_SHORT, specbits))
9463 type = short_unsigned_type_node;
9464 else if (type == char_type_node)
9465 type = unsigned_char_type_node;
9466 else if (typedef_decl)
9467 type = unsigned_type (type);
9469 type = unsigned_type_node;
9471 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9472 && type == char_type_node)
9473 type = signed_char_type_node;
9475 type = long_long_integer_type_node;
9476 else if (RIDBIT_SETP (RID_LONG, specbits))
9477 type = long_integer_type_node;
9478 else if (RIDBIT_SETP (RID_SHORT, specbits))
9479 type = short_integer_type_node;
9481 if (RIDBIT_SETP (RID_COMPLEX, specbits))
9483 /* If we just have "complex", it is equivalent to
9484 "complex double", but if any modifiers at all are specified it is
9485 the complex form of TYPE. E.g, "complex short" is
9486 "complex short int". */
9488 if (defaulted_int && ! longlong
9489 && ! (RIDBIT_SETP (RID_LONG, specbits)
9490 || RIDBIT_SETP (RID_SHORT, specbits)
9491 || RIDBIT_SETP (RID_SIGNED, specbits)
9492 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
9493 type = complex_double_type_node;
9494 else if (type == integer_type_node)
9495 type = complex_integer_type_node;
9496 else if (type == float_type_node)
9497 type = complex_float_type_node;
9498 else if (type == double_type_node)
9499 type = complex_double_type_node;
9500 else if (type == long_double_type_node)
9501 type = complex_long_double_type_node;
9503 type = build_complex_type (type);
9506 if (return_type == return_conversion
9507 && (RIDBIT_SETP (RID_CONST, specbits)
9508 || RIDBIT_SETP (RID_VOLATILE, specbits)
9509 || RIDBIT_SETP (RID_RESTRICT, specbits)))
9510 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9513 /* Set CONSTP if this declaration is `const', whether by
9514 explicit specification or via a typedef.
9515 Likewise for VOLATILEP. */
9517 constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type);
9519 !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type);
9521 !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type);
9522 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
9523 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
9524 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
9525 type = cp_build_qualified_type (type, type_quals);
9527 inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
9528 virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
9529 RIDBIT_RESET (RID_VIRTUAL, specbits);
9530 explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
9531 RIDBIT_RESET (RID_EXPLICIT, specbits);
9533 if (RIDBIT_SETP (RID_STATIC, specbits))
9534 staticp = 1 + (decl_context == FIELD);
9536 if (virtualp && staticp == 2)
9538 cp_error ("member `%D' cannot be declared both virtual and static",
9542 friendp = RIDBIT_SETP (RID_FRIEND, specbits);
9543 RIDBIT_RESET (RID_FRIEND, specbits);
9545 /* $7.1.2, Function specifiers */
9546 if (friendp && explicitp)
9547 error ("only declarations of constructors can be `explicit'");
9549 if (RIDBIT_SETP (RID_MUTABLE, specbits))
9551 if (decl_context == PARM)
9553 error ("non-member `%s' cannot be declared `mutable'", name);
9554 RIDBIT_RESET (RID_MUTABLE, specbits);
9556 else if (friendp || decl_context == TYPENAME)
9558 error ("non-object member `%s' cannot be declared `mutable'", name);
9559 RIDBIT_RESET (RID_MUTABLE, specbits);
9563 /* Warn if two storage classes are given. Default to `auto'. */
9565 if (RIDBIT_ANY_SET (specbits))
9567 if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
9568 if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++;
9569 if (decl_context == PARM && nclasses > 0)
9570 error ("storage class specifiers invalid in parameter declarations");
9571 if (RIDBIT_SETP (RID_TYPEDEF, specbits))
9573 if (decl_context == PARM)
9574 error ("typedef declaration invalid in parameter declaration");
9577 if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
9578 if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
9581 /* Give error if `virtual' is used outside of class declaration. */
9583 && (current_class_name == NULL_TREE || decl_context != FIELD))
9585 error ("virtual outside class declaration");
9588 if (current_class_name == NULL_TREE && RIDBIT_SETP (RID_MUTABLE, specbits))
9590 error ("only members can be declared mutable");
9591 RIDBIT_RESET (RID_MUTABLE, specbits);
9594 /* Static anonymous unions are dealt with here. */
9595 if (staticp && decl_context == TYPENAME
9596 && TREE_CODE (declspecs) == TREE_LIST
9597 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs)))
9598 decl_context = FIELD;
9600 /* Warn about storage classes that are invalid for certain
9601 kinds of declarations (parameters, typenames, etc.). */
9604 error ("multiple storage classes in declaration of `%s'", name);
9605 else if (decl_context != NORMAL && nclasses > 0)
9607 if ((decl_context == PARM || decl_context == CATCHPARM)
9608 && (RIDBIT_SETP (RID_REGISTER, specbits)
9609 || RIDBIT_SETP (RID_AUTO, specbits)))
9611 else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
9613 else if (decl_context == FIELD
9614 /* C++ allows static class elements */
9615 && RIDBIT_SETP (RID_STATIC, specbits))
9616 /* C++ also allows inlines and signed and unsigned elements,
9617 but in those cases we don't come in here. */
9621 if (decl_context == FIELD)
9623 tree tmp = NULL_TREE;
9624 register int op = 0;
9628 /* Avoid trying to get an operand off an identifier node. */
9629 if (TREE_CODE (declarator) == IDENTIFIER_NODE)
9632 tmp = TREE_OPERAND (declarator, 0);
9633 op = IDENTIFIER_OPNAME_P (tmp);
9635 error ("storage class specified for %s `%s'",
9636 op ? "member operator" : "field",
9637 op ? operator_name_string (tmp) : name);
9640 error (((decl_context == PARM || decl_context == CATCHPARM)
9641 ? "storage class specified for parameter `%s'"
9642 : "storage class specified for typename"), name);
9643 RIDBIT_RESET (RID_REGISTER, specbits);
9644 RIDBIT_RESET (RID_AUTO, specbits);
9645 RIDBIT_RESET (RID_EXTERN, specbits);
9648 else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
9650 if (toplevel_bindings_p ())
9652 /* It's common practice (and completely valid) to have a const
9653 be initialized and declared extern. */
9654 if (!(type_quals & TYPE_QUAL_CONST))
9655 warning ("`%s' initialized and declared `extern'", name);
9658 error ("`%s' has both `extern' and initializer", name);
9660 else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
9661 && ! toplevel_bindings_p ())
9662 error ("nested function `%s' declared `extern'", name);
9663 else if (toplevel_bindings_p ())
9665 if (RIDBIT_SETP (RID_AUTO, specbits))
9666 error ("top-level declaration of `%s' specifies `auto'", name);
9669 if (nclasses > 0 && friendp)
9670 error ("storage class specifiers invalid in friend function declarations");
9672 /* Now figure out the structure of the declarator proper.
9673 Descend through it, creating more complex types, until we reach
9674 the declared identifier (or NULL_TREE, in an absolute declarator). */
9676 inner_attrs = NULL_TREE;
9679 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
9680 && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
9682 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9683 an INDIRECT_REF (for *...),
9684 a CALL_EXPR (for ...(...)),
9685 an identifier (for the name being declared)
9686 or a null pointer (for the place in an absolute declarator
9687 where the name was omitted).
9688 For the last two cases, we have just exited the loop.
9690 For C++ it could also be
9691 a SCOPE_REF (for class :: ...). In this case, we have converted
9692 sensible names to types, and those are the values we use to
9693 qualify the member name.
9694 an ADDR_EXPR (for &...),
9695 a BIT_NOT_EXPR (for destructors)
9697 At this point, TYPE is the type of elements of an array,
9698 or for a function to return, or for a pointer to point to.
9699 After this sequence of ifs, TYPE is the type of the
9700 array or function or pointer, and DECLARATOR has had its
9701 outermost layer removed. */
9703 if (type == error_mark_node)
9705 if (TREE_CODE (declarator) == SCOPE_REF)
9706 declarator = TREE_OPERAND (declarator, 1);
9708 declarator = TREE_OPERAND (declarator, 0);
9711 if (quals != NULL_TREE
9712 && (declarator == NULL_TREE
9713 || TREE_CODE (declarator) != SCOPE_REF))
9715 if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
9716 ctype = TYPE_METHOD_BASETYPE (type);
9717 if (ctype != NULL_TREE)
9719 tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
9720 ctype = grok_method_quals (ctype, dummy, quals);
9721 type = TREE_TYPE (dummy);
9726 /* See the comment for the TREE_LIST case, below. */
9729 else if (inner_attrs)
9731 decl_attributes (type, inner_attrs, NULL_TREE);
9732 inner_attrs = NULL_TREE;
9735 switch (TREE_CODE (declarator))
9739 /* We encode a declarator with embedded attributes using
9740 a TREE_LIST. The attributes apply to the declarator
9741 directly inside them, so we have to skip an iteration
9742 before applying them to the type. If the declarator just
9743 inside is the declarator-id, we apply the attrs to the
9745 inner_attrs = TREE_PURPOSE (declarator);
9747 declarator = TREE_VALUE (declarator);
9753 register tree itype = NULL_TREE;
9754 register tree size = TREE_OPERAND (declarator, 1);
9755 /* The index is a signed object `sizetype' bits wide. */
9756 tree index_type = signed_type (sizetype);
9758 declarator = TREE_OPERAND (declarator, 0);
9760 /* Check for some types that there cannot be arrays of. */
9762 if (TREE_CODE (type) == VOID_TYPE)
9764 cp_error ("declaration of `%D' as array of voids", dname);
9765 type = error_mark_node;
9768 if (TREE_CODE (type) == FUNCTION_TYPE)
9770 cp_error ("declaration of `%D' as array of functions", dname);
9771 type = error_mark_node;
9774 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9775 you can't have arrays of references. If we allowed them,
9776 then we'd be saying x[i] is valid for an array x, but
9777 then you'd have to ask: what does `*(x + i)' mean? */
9778 if (TREE_CODE (type) == REFERENCE_TYPE)
9780 if (decl_context == TYPENAME)
9781 cp_error ("cannot make arrays of references");
9783 cp_error ("declaration of `%D' as array of references",
9785 type = error_mark_node;
9788 if (TREE_CODE (type) == OFFSET_TYPE)
9790 cp_error ("declaration of `%D' as array of data members",
9792 type = error_mark_node;
9795 if (TREE_CODE (type) == METHOD_TYPE)
9797 cp_error ("declaration of `%D' as array of function members",
9799 type = error_mark_node;
9802 if (size == error_mark_node)
9803 type = error_mark_node;
9804 else if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9808 the constant expressions that specify the bounds of
9809 the arrays can be omitted only for the first member
9811 cp_error ("declaration of `%D' as multidimensional array",
9813 cp_error ("must have bounds for all dimensions except the first");
9814 type = error_mark_node;
9817 if (type == error_mark_node)
9820 /* VC++ spells a zero-sized array with []. */
9821 if (size == NULL_TREE && decl_context == FIELD && ! staticp
9822 && ! RIDBIT_SETP (RID_TYPEDEF, specbits))
9823 size = integer_zero_node;
9827 /* Must suspend_momentary here because the index
9828 type may need to live until the end of the function.
9829 For example, it is used in the declaration of a
9830 variable which requires destructing at the end of
9831 the function; then build_vec_delete will need this
9833 int yes = suspend_momentary ();
9834 /* Might be a cast. */
9835 if (TREE_CODE (size) == NOP_EXPR
9836 && TREE_TYPE (size) == TREE_TYPE (TREE_OPERAND (size, 0)))
9837 size = TREE_OPERAND (size, 0);
9838 if (TREE_READONLY_DECL_P (size))
9839 size = decl_constant_value (size);
9841 /* If this involves a template parameter, it will be a
9842 constant at instantiation time, but we don't know
9843 what the value is yet. Even if no template
9844 parameters are involved, we may an expression that
9845 is not a constant; we don't even simplify `1 + 2'
9846 when processing a template. */
9847 if (processing_template_decl)
9849 /* Resolve a qualified reference to an enumerator or
9850 static const data member of ours. */
9851 if (TREE_CODE (size) == SCOPE_REF
9852 && TREE_OPERAND (size, 0) == current_class_type)
9854 tree t = lookup_field (current_class_type,
9855 TREE_OPERAND (size, 1), 0, 0);
9860 itype = build_index_type (build_min
9861 (MINUS_EXPR, sizetype, size, integer_one_node));
9862 goto dont_grok_size;
9865 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
9866 && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
9867 && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
9869 cp_error ("size of array `%D' has non-integer type",
9871 size = integer_one_node;
9873 if (pedantic && integer_zerop (size))
9874 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname);
9875 if (TREE_CONSTANT (size))
9877 int old_flag_pedantic_errors = flag_pedantic_errors;
9878 int old_pedantic = pedantic;
9879 pedantic = flag_pedantic_errors = 1;
9880 /* Always give overflow errors on array subscripts. */
9881 constant_expression_warning (size);
9882 pedantic = old_pedantic;
9883 flag_pedantic_errors = old_flag_pedantic_errors;
9884 if (INT_CST_LT (size, integer_zero_node))
9886 cp_error ("size of array `%D' is negative", dname);
9887 size = integer_one_node;
9895 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9898 cp_pedwarn ("ANSI C++ forbids variable-size array");
9903 = fold (build_binary_op (MINUS_EXPR,
9904 cp_convert (index_type, size),
9905 cp_convert (index_type,
9906 integer_one_node)));
9907 if (! TREE_CONSTANT (itype))
9908 itype = variable_size (itype);
9909 else if (TREE_OVERFLOW (itype))
9911 error ("overflow in array dimension");
9912 TREE_OVERFLOW (itype) = 0;
9915 itype = build_index_type (itype);
9918 resume_momentary (yes);
9921 type = build_cplus_array_type (type, itype);
9930 tree inner_parms = CALL_DECLARATOR_PARMS (declarator);
9931 tree inner_decl = TREE_OPERAND (declarator, 0);
9933 /* Declaring a function type.
9934 Make sure we have a valid type for the function to return. */
9936 /* We now know that the TYPE_QUALS don't apply to the
9937 decl, but to its return type. */
9938 type_quals = TYPE_UNQUALIFIED;
9940 /* Warn about some types functions can't return. */
9942 if (TREE_CODE (type) == FUNCTION_TYPE)
9944 error ("`%s' declared as function returning a function", name);
9945 type = integer_type_node;
9947 if (TREE_CODE (type) == ARRAY_TYPE)
9949 error ("`%s' declared as function returning an array", name);
9950 type = integer_type_node;
9953 if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
9954 inner_decl = TREE_OPERAND (inner_decl, 1);
9956 if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
9959 /* Pick up type qualifiers which should be applied to `this'. */
9960 quals = CALL_DECLARATOR_QUALS (declarator);
9962 /* Pick up the exception specifications. */
9963 raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator);
9965 /* Say it's a definition only for the CALL_EXPR
9966 closest to the identifier. */
9969 && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
9970 || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
9971 || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
9973 if (ctype == NULL_TREE
9974 && decl_context == FIELD
9976 && (friendp == 0 || dname == current_class_name))
9977 ctype = current_class_type;
9979 if (ctype && return_type == return_conversion)
9980 TYPE_HAS_CONVERSION (ctype) = 1;
9981 if (ctype && constructor_name (ctype) == dname)
9983 /* We are within a class's scope. If our declarator name
9984 is the same as the class name, and we are defining
9985 a function, then it is a constructor/destructor, and
9986 therefore returns a void type. */
9988 if (flags == DTOR_FLAG)
9990 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9991 not be declared const or volatile. A destructor
9992 may not be static. */
9994 error ("destructor cannot be static member function");
9997 cp_error ("destructors may not be `%s'",
9998 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10001 if (decl_context == FIELD)
10003 if (! member_function_or_else (ctype, current_class_type,
10004 "destructor for alien class `%s' cannot be a member"))
10005 return void_type_node;
10008 else /* It's a constructor. */
10010 if (explicitp == 1)
10012 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10013 not be declared const or volatile. A constructor may
10014 not be virtual. A constructor may not be static. */
10016 error ("constructor cannot be static member function");
10019 pedwarn ("constructors cannot be declared virtual");
10024 cp_error ("constructors may not be `%s'",
10025 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10029 RID_BIT_TYPE tmp_bits;
10030 bcopy ((void*)&specbits, (void*)&tmp_bits, sizeof (RID_BIT_TYPE));
10031 RIDBIT_RESET (RID_INLINE, tmp_bits);
10032 RIDBIT_RESET (RID_STATIC, tmp_bits);
10033 if (RIDBIT_ANY_SET (tmp_bits))
10034 error ("return value type specifier for constructor ignored");
10036 type = build_pointer_type (ctype);
10037 if (decl_context == FIELD)
10039 if (! member_function_or_else (ctype, current_class_type,
10040 "constructor for alien class `%s' cannot be member"))
10041 return void_type_node;
10042 TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10043 if (return_type != return_ctor)
10047 if (decl_context == FIELD)
10053 error ("can't initialize friend function `%s'", name);
10056 /* Cannot be both friend and virtual. */
10057 error ("virtual functions cannot be friends");
10058 RIDBIT_RESET (RID_FRIEND, specbits);
10061 if (decl_context == NORMAL)
10062 error ("friend declaration not in class definition");
10063 if (current_function_decl && funcdef_flag)
10064 cp_error ("can't define friend function `%s' in a local class definition",
10068 /* Construct the function type and go to the next
10069 inner layer of declarator. */
10071 declarator = TREE_OPERAND (declarator, 0);
10073 /* FIXME: This is where default args should be fully
10076 arg_types = grokparms (inner_parms, funcdecl_p ? funcdef_flag : 0);
10078 if (declarator && flags == DTOR_FLAG)
10080 /* A destructor declared in the body of a class will
10081 be represented as a BIT_NOT_EXPR. But, we just
10082 want the underlying IDENTIFIER. */
10083 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10084 declarator = TREE_OPERAND (declarator, 0);
10086 if (strict_prototype == 0 && arg_types == NULL_TREE)
10087 arg_types = void_list_node;
10088 else if (arg_types == NULL_TREE
10089 || arg_types != void_list_node)
10091 cp_error ("destructors may not have parameters");
10092 arg_types = void_list_node;
10093 last_function_parms = NULL_TREE;
10097 /* ANSI says that `const int foo ();'
10098 does not make the function foo const. */
10099 type = build_function_type (type, arg_types);
10103 for (t = arg_types; t; t = TREE_CHAIN (t))
10104 if (TREE_PURPOSE (t)
10105 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10107 add_defarg_fn (type);
10116 /* Filter out pointers-to-references and references-to-references.
10117 We can get these if a TYPE_DECL is used. */
10119 if (TREE_CODE (type) == REFERENCE_TYPE)
10121 error ("cannot declare %s to references",
10122 TREE_CODE (declarator) == ADDR_EXPR
10123 ? "references" : "pointers");
10124 declarator = TREE_OPERAND (declarator, 0);
10128 if (TREE_CODE (type) == OFFSET_TYPE
10129 && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10130 || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10132 cp_error ("cannot declare pointer to `%#T' member",
10134 type = TREE_TYPE (type);
10137 /* Merge any constancy or volatility into the target type
10138 for the pointer. */
10140 /* We now know that the TYPE_QUALS don't apply to the decl,
10141 but to the target of the pointer. */
10142 type_quals = TYPE_UNQUALIFIED;
10144 if (TREE_CODE (declarator) == ADDR_EXPR)
10146 if (TREE_CODE (type) == VOID_TYPE)
10147 error ("invalid type: `void &'");
10149 type = build_reference_type (type);
10151 else if (TREE_CODE (type) == METHOD_TYPE)
10152 type = build_ptrmemfunc_type (build_pointer_type (type));
10154 type = build_pointer_type (type);
10156 /* Process a list of type modifier keywords (such as
10157 const or volatile) that were given inside the `*' or `&'. */
10159 if (TREE_TYPE (declarator))
10161 register tree typemodlist;
10167 for (typemodlist = TREE_TYPE (declarator); typemodlist;
10168 typemodlist = TREE_CHAIN (typemodlist))
10170 tree qualifier = TREE_VALUE (typemodlist);
10172 if (qualifier == ridpointers[(int) RID_CONST])
10174 else if (qualifier == ridpointers[(int) RID_VOLATILE])
10176 else if (qualifier == ridpointers[(int) RID_RESTRICT])
10181 error ("invalid type modifier within pointer declarator");
10185 pedwarn ("duplicate `const'");
10187 pedwarn ("duplicate `volatile'");
10189 pedwarn ("duplicate `restrict'");
10191 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10192 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10193 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10194 if (TREE_CODE (declarator) == ADDR_EXPR
10195 && (constp || volatilep))
10198 pedwarn ("discarding `const' applied to a reference");
10200 pedwarn ("discarding `volatile' applied to a reference");
10201 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
10203 type = cp_build_qualified_type (type, type_quals);
10205 declarator = TREE_OPERAND (declarator, 0);
10211 /* We have converted type names to NULL_TREE if the
10212 name was bogus, or to a _TYPE node, if not.
10214 The variable CTYPE holds the type we will ultimately
10215 resolve to. The code here just needs to build
10216 up appropriate member types. */
10217 tree sname = TREE_OPERAND (declarator, 1);
10220 /* Destructors can have their visibilities changed as well. */
10221 if (TREE_CODE (sname) == BIT_NOT_EXPR)
10222 sname = TREE_OPERAND (sname, 0);
10224 if (TREE_COMPLEXITY (declarator) == 0)
10225 /* This needs to be here, in case we are called
10226 multiple times. */ ;
10227 else if (TREE_COMPLEXITY (declarator) == -1)
10228 /* Namespace member. */
10229 pop_decl_namespace ();
10230 else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
10231 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10232 else if (! IS_AGGR_TYPE_CODE
10233 (TREE_CODE (TREE_OPERAND (declarator, 0))))
10235 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
10237 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10238 that refer to ctype. They couldn't be resolved earlier
10239 because we hadn't pushed into the class yet.
10240 Example: resolve 'B<T>::type' in
10241 'B<typename B<T>::type> B<T>::f () { }'. */
10242 if (current_template_parms
10243 && uses_template_parms (type)
10244 && uses_template_parms (current_class_type))
10246 tree args = current_template_args ();
10247 type = tsubst (type, args, /*complain=*/1, NULL_TREE);
10250 /* This pop_nested_class corresponds to the
10251 push_nested_class used to push into class scope for
10252 parsing the argument list of a function decl, in
10254 pop_nested_class ();
10255 TREE_COMPLEXITY (declarator) = current_class_depth;
10258 my_friendly_abort (16);
10260 if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10262 /* We had a reference to a global decl, or
10263 perhaps we were given a non-aggregate typedef,
10264 in which case we cleared this out, and should just
10265 keep going as though it wasn't there. */
10266 declarator = sname;
10269 ctype = TREE_OPERAND (declarator, 0);
10272 while (t != NULL_TREE && CLASS_TYPE_P (t))
10274 if (CLASSTYPE_TEMPLATE_INFO (t) &&
10275 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10276 template_count += 1;
10277 t = TYPE_MAIN_DECL (t);
10278 if (DECL_LANG_SPECIFIC (t))
10279 t = DECL_CLASS_CONTEXT (t);
10284 if (sname == NULL_TREE)
10287 if (TREE_CODE (sname) == IDENTIFIER_NODE)
10289 /* This is the `standard' use of the scoping operator:
10290 basetype :: member . */
10292 if (ctype == current_class_type)
10298 Is this ill-formed? */
10301 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10304 else if (TREE_CODE (type) == FUNCTION_TYPE)
10306 if (current_class_type == NULL_TREE
10308 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10309 TYPE_ARG_TYPES (type));
10312 cp_error ("cannot declare member function `%T::%s' within `%T'",
10313 ctype, name, current_class_type);
10314 return void_type_node;
10317 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
10318 || TYPE_SIZE (complete_type (ctype)) != NULL_TREE)
10320 /* Have to move this code elsewhere in this function.
10321 this code is used for i.e., typedef int A::M; M *pm;
10323 It is? How? jason 10/2/94 */
10325 if (current_class_type)
10327 cp_error ("cannot declare member `%T::%s' within `%T'",
10328 ctype, name, current_class_type);
10329 return void_type_node;
10331 type = build_offset_type (ctype, type);
10333 else if (uses_template_parms (ctype))
10335 if (TREE_CODE (type) == FUNCTION_TYPE)
10337 = build_cplus_method_type (ctype, TREE_TYPE (type),
10338 TYPE_ARG_TYPES (type));
10342 cp_error ("structure `%T' not yet defined", ctype);
10343 return error_mark_node;
10346 declarator = sname;
10348 else if (TREE_CODE (sname) == SCOPE_REF)
10349 my_friendly_abort (17);
10353 declarator = TREE_OPERAND (declarator, 1);
10354 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
10355 /* In this case, we will deal with it later. */
10359 if (TREE_CODE (type) == FUNCTION_TYPE)
10360 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10361 TYPE_ARG_TYPES (type));
10363 type = build_offset_type (ctype, type);
10370 declarator = TREE_OPERAND (declarator, 0);
10375 case ENUMERAL_TYPE:
10376 declarator = NULL_TREE;
10380 declarator = NULL_TREE;
10384 my_friendly_abort (158);
10388 /* See the comment for the TREE_LIST case, above. */
10391 if (! ignore_attrs)
10392 decl_attributes (type, inner_attrs, NULL_TREE);
10394 TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist));
10396 attrlist = build_decl_list (NULL_TREE, inner_attrs);
10399 /* Now TYPE has the actual type. */
10401 if (explicitp == 1)
10403 error ("only constructors can be declared `explicit'");
10407 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10409 if (type_quals & TYPE_QUAL_CONST)
10411 error ("const `%s' cannot be declared `mutable'", name);
10412 RIDBIT_RESET (RID_MUTABLE, specbits);
10416 error ("static `%s' cannot be declared `mutable'", name);
10417 RIDBIT_RESET (RID_MUTABLE, specbits);
10421 if (declarator == NULL_TREE
10422 || TREE_CODE (declarator) == IDENTIFIER_NODE
10423 || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
10424 && (TREE_CODE (type) == FUNCTION_TYPE
10425 || TREE_CODE (type) == METHOD_TYPE)))
10427 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
10429 cp_error ("template-id `%D' used as a declarator", declarator);
10430 declarator = dname;
10433 /* Unexpected declarator format. */
10434 my_friendly_abort (990210);
10436 /* If this is declaring a typedef name, return a TYPE_DECL. */
10438 if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
10442 /* Note that the grammar rejects storage classes
10443 in typenames, fields or parameters. */
10444 if (current_lang_name == lang_name_java)
10445 TYPE_FOR_JAVA (type) = 1;
10447 if (decl_context == FIELD)
10449 if (declarator == constructor_name (current_class_type))
10450 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10452 decl = build_lang_decl (TYPE_DECL, declarator, type);
10456 /* Make sure this typedef lives as long as its type,
10457 since it might be used as a template parameter. */
10458 if (type != error_mark_node)
10459 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
10460 if (processing_template_decl)
10461 decl = build_lang_decl (TYPE_DECL, declarator, type);
10463 decl = build_decl (TYPE_DECL, declarator, type);
10464 if (type != error_mark_node)
10468 /* If the user declares "typedef struct {...} foo" then the
10469 struct will have an anonymous name. Fill that name in now.
10470 Nothing can refer to it, so nothing needs know about the name
10472 if (type != error_mark_node
10473 && TYPE_NAME (type)
10474 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
10475 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type))
10476 && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED)
10478 tree oldname = TYPE_NAME (type);
10481 /* Replace the anonymous name with the real name everywhere. */
10482 lookup_tag_reverse (type, declarator);
10483 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
10484 if (TYPE_NAME (t) == oldname)
10485 TYPE_NAME (t) = decl;
10487 if (TYPE_LANG_SPECIFIC (type))
10488 TYPE_WAS_ANONYMOUS (type) = 1;
10490 /* If this is a typedef within a template class, the nested
10491 type is a (non-primary) template. The name for the
10492 template needs updating as well. */
10493 if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
10494 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
10495 = TYPE_IDENTIFIER (type);
10497 /* XXX Temporarily set the scope.
10498 When returning, start_decl expects it as NULL_TREE,
10499 and will then then set it using pushdecl. */
10500 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 980404);
10501 if (current_class_type)
10502 DECL_CONTEXT (decl) = current_class_type;
10504 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
10506 DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
10507 DECL_ASSEMBLER_NAME (decl)
10508 = get_identifier (build_overload_name (type, 1, 1));
10509 DECL_CONTEXT (decl) = NULL_TREE;
10511 /* FIXME remangle member functions; member functions of a
10512 type with external linkage have external linkage. */
10515 if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
10517 cp_error_at ("typedef name may not be class-qualified", decl);
10522 if (ctype == NULL_TREE)
10524 if (TREE_CODE (type) != METHOD_TYPE)
10525 cp_error_at ("invalid type qualifier for non-method type", decl);
10527 ctype = TYPE_METHOD_BASETYPE (type);
10529 if (ctype != NULL_TREE)
10530 grok_method_quals (ctype, decl, quals);
10533 if (RIDBIT_SETP (RID_SIGNED, specbits)
10534 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
10535 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
10537 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10538 error ("non-object member `%s' cannot be declared mutable", name);
10540 bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
10541 inlinep, friendp, raises != NULL_TREE);
10544 error ("typedef declaration includes an initializer");
10549 /* Detect the case of an array type of unspecified size
10550 which came, as such, direct from a typedef name.
10551 We must copy the type, so that each identifier gets
10552 a distinct type, so that each identifier's size can be
10553 controlled separately by its own initializer. */
10555 if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE
10556 && TYPE_DOMAIN (type) == NULL_TREE)
10558 type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type));
10561 /* If this is a type name (such as, in a cast or sizeof),
10562 compute the type and return it now. */
10564 if (decl_context == TYPENAME)
10566 /* Note that the grammar rejects storage classes
10567 in typenames, fields or parameters. */
10568 if (type_quals != TYPE_UNQUALIFIED)
10569 type_quals = TYPE_UNQUALIFIED;
10571 /* Special case: "friend class foo" looks like a TYPENAME context. */
10574 if (type_quals != TYPE_UNQUALIFIED)
10576 cp_error ("type qualifiers specified for friend class declaration");
10577 type_quals = TYPE_UNQUALIFIED;
10581 cp_error ("`inline' specified for friend class declaration");
10585 /* Only try to do this stuff if we didn't already give up. */
10586 if (type != integer_type_node)
10588 /* A friendly class? */
10589 if (current_class_type)
10590 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
10592 error ("trying to make class `%s' a friend of global scope",
10593 TYPE_NAME_STRING (type));
10594 type = void_type_node;
10599 tree dummy = build_decl (TYPE_DECL, declarator, type);
10600 if (ctype == NULL_TREE)
10602 my_friendly_assert (TREE_CODE (type) == METHOD_TYPE, 159);
10603 ctype = TYPE_METHOD_BASETYPE (type);
10605 grok_method_quals (ctype, dummy, quals);
10606 type = TREE_TYPE (dummy);
10611 else if (declarator == NULL_TREE && decl_context != PARM
10612 && decl_context != CATCHPARM
10613 && TREE_CODE (type) != UNION_TYPE
10616 cp_error ("abstract declarator `%T' used as declaration", type);
10617 declarator = make_anon_name ();
10620 /* `void' at top level (not within pointer)
10621 is allowed only in typedefs or type names.
10622 We don't complain about parms either, but that is because
10623 a better error message can be made later. */
10625 if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
10628 error ("unnamed variable or field declared void");
10629 else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10631 if (IDENTIFIER_OPNAME_P (declarator))
10632 my_friendly_abort (356);
10634 error ("variable or field `%s' declared void", name);
10637 error ("variable or field declared void");
10638 type = integer_type_node;
10641 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10642 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10644 if (decl_context == PARM || decl_context == CATCHPARM)
10646 if (ctype || in_namespace)
10647 error ("cannot use `::' in parameter declaration");
10649 /* A parameter declared as an array of T is really a pointer to T.
10650 One declared as a function is really a pointer to a function.
10651 One declared as a member is really a pointer to member. */
10653 if (TREE_CODE (type) == ARRAY_TYPE)
10655 /* Transfer const-ness of array into that of type pointed to. */
10656 type = build_pointer_type (TREE_TYPE (type));
10657 type_quals = TYPE_UNQUALIFIED;
10659 else if (TREE_CODE (type) == FUNCTION_TYPE)
10660 type = build_pointer_type (type);
10661 else if (TREE_CODE (type) == OFFSET_TYPE)
10662 type = build_pointer_type (type);
10663 else if (TREE_CODE (type) == VOID_TYPE && declarator)
10665 error ("declaration of `%s' as void", name);
10671 register tree decl;
10673 if (decl_context == PARM)
10675 decl = build_decl (PARM_DECL, declarator, type);
10677 bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
10678 inlinep, friendp, raises != NULL_TREE);
10680 /* Compute the type actually passed in the parmlist,
10681 for the case where there is no prototype.
10682 (For example, shorts and chars are passed as ints.)
10683 When there is a prototype, this is overridden later. */
10685 DECL_ARG_TYPE (decl) = type_promotes_to (type);
10687 else if (decl_context == FIELD)
10689 if (type == error_mark_node)
10691 /* Happens when declaring arrays of sizes which
10692 are error_mark_node, for example. */
10695 else if (in_namespace && !friendp)
10697 /* Something like struct S { int N::j; }; */
10698 cp_error ("invalid use of `::'");
10701 else if (TREE_CODE (type) == FUNCTION_TYPE)
10704 tree function_context;
10706 /* We catch the others as conflicts with the builtin
10708 if (friendp && declarator == ridpointers[(int) RID_SIGNED])
10710 cp_error ("function `%D' cannot be declared friend",
10717 if (ctype == NULL_TREE)
10718 ctype = current_class_type;
10720 if (ctype == NULL_TREE)
10722 cp_error ("can't make `%D' into a method -- not in a class",
10724 return void_type_node;
10727 /* ``A union may [ ... ] not [ have ] virtual functions.''
10729 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
10731 cp_error ("function `%D' declared virtual inside a union",
10733 return void_type_node;
10736 if (declarator == ansi_opname[(int) NEW_EXPR]
10737 || declarator == ansi_opname[(int) VEC_NEW_EXPR]
10738 || declarator == ansi_opname[(int) DELETE_EXPR]
10739 || declarator == ansi_opname[(int) VEC_DELETE_EXPR])
10743 cp_error ("`%D' cannot be declared virtual, since it is always static",
10748 else if (staticp < 2)
10749 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10750 TYPE_ARG_TYPES (type));
10753 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10754 function_context = (ctype != NULL_TREE) ?
10755 hack_decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
10756 publicp = (! friendp || ! staticp)
10757 && function_context == NULL_TREE;
10758 decl = grokfndecl (ctype, type,
10759 TREE_CODE (declarator) != TEMPLATE_ID_EXPR
10760 ? declarator : dname,
10762 virtualp, flags, quals, raises,
10763 friendp ? -1 : 0, friendp, publicp, inlinep,
10764 funcdef_flag, template_count, in_namespace);
10765 if (decl == NULL_TREE)
10768 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10769 /* The decl and setting of decl_machine_attr is also turned off. */
10770 decl = build_decl_attribute_variant (decl, decl_machine_attr);
10773 /* [class.conv.ctor]
10775 A constructor declared without the function-specifier
10776 explicit that can be called with a single parameter
10777 specifies a conversion from the type of its first
10778 parameter to the type of its class. Such a constructor
10779 is called a converting constructor. */
10780 if (explicitp == 2)
10781 DECL_NONCONVERTING_P (decl) = 1;
10782 else if (DECL_CONSTRUCTOR_P (decl))
10784 /* The constructor can be called with exactly one
10785 parameter if there is at least one parameter, and
10786 any subsequent parameters have default arguments.
10787 We don't look at the first parameter, which is
10788 really just the `this' parameter for the new
10791 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)));
10793 /* Skip the `in_chrg' argument too, if present. */
10794 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl)))
10795 arg_types = TREE_CHAIN (arg_types);
10797 if (arg_types == void_list_node
10799 && TREE_CHAIN (arg_types)
10800 && TREE_CHAIN (arg_types) != void_list_node
10801 && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
10802 DECL_NONCONVERTING_P (decl) = 1;
10805 else if (TREE_CODE (type) == METHOD_TYPE)
10807 /* We only get here for friend declarations of
10808 members of other classes. */
10809 /* All method decls are public, so tell grokfndecl to set
10810 TREE_PUBLIC, also. */
10811 decl = grokfndecl (ctype, type, declarator, declarator,
10812 virtualp, flags, quals, raises,
10813 friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
10814 template_count, in_namespace);
10815 if (decl == NULL_TREE)
10818 else if (!staticp && ! processing_template_decl
10819 && TYPE_SIZE (complete_type (type)) == NULL_TREE
10820 && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
10823 cp_error ("field `%D' has incomplete type", declarator);
10825 cp_error ("name `%T' has incomplete type", type);
10827 /* If we're instantiating a template, tell them which
10828 instantiation made the field's type be incomplete. */
10829 if (current_class_type
10830 && TYPE_NAME (current_class_type)
10831 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
10832 && declspecs && TREE_VALUE (declspecs)
10833 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
10834 cp_error (" in instantiation of template `%T'",
10835 current_class_type);
10837 type = error_mark_node;
10844 error ("`%s' is neither function nor method; cannot be declared friend",
10845 IDENTIFIER_POINTER (declarator));
10853 /* Friends are treated specially. */
10854 if (ctype == current_class_type)
10855 warning ("member functions are implicitly friends of their class");
10858 tree t = NULL_TREE;
10859 if (decl && DECL_NAME (decl))
10861 if (template_class_depth (current_class_type) == 0)
10864 = check_explicit_specialization
10866 template_count, 2 * (funcdef_flag != 0) + 4);
10867 if (decl == error_mark_node)
10868 return error_mark_node;
10871 t = do_friend (ctype, declarator, decl,
10872 last_function_parms, attrlist, flags, quals,
10875 if (t && funcdef_flag)
10878 return void_type_node;
10882 /* Structure field. It may not be a function, except for C++ */
10884 if (decl == NULL_TREE)
10890 /* An attempt is being made to initialize a non-static
10891 member. But, from [class.mem]:
10893 4 A member-declarator can contain a
10894 constant-initializer only if it declares a static
10895 member (_class.static_) of integral or enumeration
10896 type, see _class.static.data_.
10898 This used to be relatively common practice, but
10899 the rest of the compiler does not correctly
10900 handle the initialization unless the member is
10901 static so we make it static below. */
10902 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10904 cp_pedwarn ("making `%D' static", declarator);
10908 if (uses_template_parms (type))
10909 /* We'll check at instantiation time. */
10911 else if (check_static_variable_definition (declarator,
10913 /* If we just return the declaration, crashes
10914 will sometimes occur. We therefore return
10915 void_type_node, as if this was a friend
10916 declaration, to cause callers to completely
10917 ignore this declaration. */
10918 return void_type_node;
10921 /* 9.2p13 [class.mem] */
10922 if (declarator == constructor_name (current_class_type)
10923 /* Divergence from the standard: In extern "C", we
10924 allow non-static data members here, because C does
10925 and /usr/include/netinet/in.h uses that. */
10926 && (staticp || ! in_system_header))
10927 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10932 /* C++ allows static class members. All other work
10933 for this is done by grokfield. */
10934 decl = build_lang_decl (VAR_DECL, declarator, type);
10935 TREE_STATIC (decl) = 1;
10936 /* In class context, 'static' means public access. */
10937 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
10941 decl = build_lang_decl (FIELD_DECL, declarator, type);
10942 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10944 DECL_MUTABLE_P (decl) = 1;
10945 RIDBIT_RESET (RID_MUTABLE, specbits);
10949 bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
10950 inlinep, friendp, raises != NULL_TREE);
10953 else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
10955 tree original_name;
10961 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
10962 original_name = dname;
10964 original_name = declarator;
10966 if (RIDBIT_SETP (RID_AUTO, specbits))
10967 error ("storage class `auto' invalid for function `%s'", name);
10968 else if (RIDBIT_SETP (RID_REGISTER, specbits))
10969 error ("storage class `register' invalid for function `%s'", name);
10971 /* Function declaration not at top level.
10972 Storage classes other than `extern' are not allowed
10973 and `extern' makes no difference. */
10974 if (! toplevel_bindings_p ()
10975 && (RIDBIT_SETP (RID_STATIC, specbits)
10976 || RIDBIT_SETP (RID_INLINE, specbits))
10979 if (RIDBIT_SETP (RID_STATIC, specbits))
10980 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
10982 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
10985 if (ctype == NULL_TREE)
10989 error ("virtual non-class function `%s'", name);
10993 else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
10994 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10995 TYPE_ARG_TYPES (type));
10997 /* Record presence of `static'. */
10998 publicp = (ctype != NULL_TREE
10999 || RIDBIT_SETP (RID_EXTERN, specbits)
11000 || !RIDBIT_SETP (RID_STATIC, specbits));
11002 decl = grokfndecl (ctype, type, original_name, declarator,
11003 virtualp, flags, quals, raises,
11005 publicp, inlinep, funcdef_flag,
11006 template_count, in_namespace);
11007 if (decl == NULL_TREE)
11012 int illegal_static = 0;
11014 /* Don't allow a static member function in a class, and forbid
11015 declaring main to be static. */
11016 if (TREE_CODE (type) == METHOD_TYPE)
11018 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11019 illegal_static = 1;
11021 else if (current_function_decl)
11023 /* FIXME need arm citation */
11024 error ("cannot declare static function inside another function");
11025 illegal_static = 1;
11028 if (illegal_static)
11031 RIDBIT_RESET (RID_STATIC, specbits);
11037 /* It's a variable. */
11039 /* An uninitialized decl with `extern' is a reference. */
11040 decl = grokvardecl (type, declarator, &specbits,
11042 (type_quals & TYPE_QUAL_CONST) != 0,
11044 bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11045 inlinep, friendp, raises != NULL_TREE);
11049 DECL_CONTEXT (decl) = ctype;
11052 cp_pedwarn ("static member `%D' re-declared as static", decl);
11054 RIDBIT_RESET (RID_STATIC, specbits);
11056 if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11058 cp_error ("static member `%D' declared `register'", decl);
11059 RIDBIT_RESET (RID_REGISTER, specbits);
11061 if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11063 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11065 RIDBIT_RESET (RID_EXTERN, specbits);
11070 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11072 error ("`%s' cannot be declared mutable", name);
11075 /* Record `register' declaration for warnings on &
11076 and in case doing stupid register allocation. */
11078 if (RIDBIT_SETP (RID_REGISTER, specbits))
11079 DECL_REGISTER (decl) = 1;
11081 if (RIDBIT_SETP (RID_EXTERN, specbits))
11082 DECL_THIS_EXTERN (decl) = 1;
11084 if (RIDBIT_SETP (RID_STATIC, specbits))
11085 DECL_THIS_STATIC (decl) = 1;
11087 /* Record constancy and volatility. There's no need to do this
11088 when processing a template; we'll do this for the instantiated
11089 declaration based on the type of DECL. */
11090 if (!processing_template_decl)
11091 c_apply_type_quals_to_decl (type_quals, decl);
11097 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11098 An empty exprlist is a parmlist. An exprlist which
11099 contains only identifiers at the global level
11100 is a parmlist. Otherwise, it is an exprlist. */
11103 parmlist_is_exprlist (exprs)
11106 if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11109 if (toplevel_bindings_p ())
11111 /* At the global level, if these are all identifiers,
11112 then it is a parmlist. */
11115 if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11117 exprs = TREE_CHAIN (exprs);
11124 /* Subroutine of start_function. Ensure that each of the parameter
11125 types (as listed in PARMS) is complete, as is required for a
11126 function definition. */
11129 require_complete_types_for_parms (parms)
11134 tree type = TREE_TYPE (parms);
11135 if (TYPE_SIZE (complete_type (type)) == NULL_TREE)
11137 if (DECL_NAME (parms))
11138 error ("parameter `%s' has incomplete type",
11139 IDENTIFIER_POINTER (DECL_NAME (parms)));
11141 error ("parameter has incomplete type");
11142 TREE_TYPE (parms) = error_mark_node;
11145 layout_decl (parms, 0);
11147 parms = TREE_CHAIN (parms);
11151 /* Returns DECL if DECL is a local variable (or parameter). Returns
11152 NULL_TREE otherwise. */
11155 local_variable_p (t)
11158 if ((TREE_CODE (t) == VAR_DECL
11159 /* A VAR_DECL with a context that is a _TYPE is a static data
11161 && !TYPE_P (CP_DECL_CONTEXT (t))
11162 /* Any other non-local variable must be at namespace scope. */
11163 && TREE_CODE (CP_DECL_CONTEXT (t)) != NAMESPACE_DECL)
11164 || (TREE_CODE (t) == PARM_DECL))
11170 /* Check that ARG, which is a default-argument expression for a
11171 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11172 something goes wrong. DECL may also be a _TYPE node, rather than a
11173 DECL, if there is no DECL available. */
11176 check_default_argument (decl, arg)
11183 if (TREE_CODE (arg) == DEFAULT_ARG)
11184 /* We get a DEFAULT_ARG when looking at an in-class declaration
11185 with a default argument. Ignore the argument for now; we'll
11186 deal with it after the class is complete. */
11189 if (processing_template_decl || uses_template_parms (arg))
11190 /* We don't do anything checking until instantiation-time. Note
11191 that there may be uninstantiated arguments even for an
11192 instantiated function, since default arguments are not
11193 instantiated until they are needed. */
11202 decl_type = TREE_TYPE (decl);
11204 if (arg == error_mark_node
11205 || decl == error_mark_node
11206 || TREE_TYPE (arg) == error_mark_node
11207 || decl_type == error_mark_node)
11208 /* Something already went wrong. There's no need to check
11210 return error_mark_node;
11212 /* [dcl.fct.default]
11214 A default argument expression is implicitly converted to the
11216 if (!TREE_TYPE (arg)
11217 || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11220 cp_error ("default argument for `%#D' has type `%T'",
11221 decl, TREE_TYPE (arg));
11223 cp_error ("default argument for parameter of type `%T' has type `%T'",
11224 decl_type, TREE_TYPE (arg));
11226 return error_mark_node;
11229 /* [dcl.fct.default]
11231 Local variables shall not be used in default argument
11234 The keyword `this' shall not be used in a default argument of a
11235 member function. */
11236 var = search_tree (arg, local_variable_p);
11239 cp_error ("default argument `%E' uses local variable `%D'",
11241 return error_mark_node;
11248 /* Decode the list of parameter types for a function type.
11249 Given the list of things declared inside the parens,
11250 return a list of types.
11252 The list we receive can have three kinds of elements:
11253 an IDENTIFIER_NODE for names given without types,
11254 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11255 or void_type_node, to mark the end of an argument list
11256 when additional arguments are not permitted (... was not used).
11258 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11259 a mere declaration. A nonempty identifier-list gets an error message
11260 when FUNCDEF_FLAG is zero.
11261 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11262 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11264 If all elements of the input list contain types,
11265 we return a list of the types.
11266 If all elements contain no type (except perhaps a void_type_node
11267 at the end), we return a null list.
11268 If some have types and some do not, it is an error, and we
11269 return a null list.
11271 Also set last_function_parms to either
11272 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11273 A list of names is converted to a chain of PARM_DECLs
11274 by store_parm_decls so that ultimately it is always a chain of decls.
11276 Note that in C++, parameters can take default values. These default
11277 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11278 an error to specify default values which are followed by parameters
11279 that have no default values, or an ELLIPSES. For simplicities sake,
11280 only parameters which are specified with their types can take on
11284 grokparms (first_parm, funcdef_flag)
11288 tree result = NULL_TREE;
11289 tree decls = NULL_TREE;
11291 if (first_parm != NULL_TREE
11292 && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE)
11294 if (! funcdef_flag)
11295 pedwarn ("parameter names (without types) in function declaration");
11296 last_function_parms = first_parm;
11299 else if (first_parm != NULL_TREE
11300 && TREE_CODE (TREE_VALUE (first_parm)) != TREE_LIST
11301 && TREE_CODE (TREE_VALUE (first_parm)) != VOID_TYPE)
11302 my_friendly_abort (145);
11305 /* Types were specified. This is a list of declarators
11306 each represented as a TREE_LIST node. */
11307 register tree parm, chain;
11308 int any_init = 0, any_error = 0;
11310 if (first_parm != NULL_TREE)
11312 tree last_result = NULL_TREE;
11313 tree last_decl = NULL_TREE;
11315 for (parm = first_parm; parm != NULL_TREE; parm = chain)
11317 tree type = NULL_TREE, list_node = parm;
11318 register tree decl = TREE_VALUE (parm);
11319 tree init = TREE_PURPOSE (parm);
11321 chain = TREE_CHAIN (parm);
11322 /* @@ weak defense against parse errors. */
11323 if (TREE_CODE (decl) != VOID_TYPE
11324 && TREE_CODE (decl) != TREE_LIST)
11326 /* Give various messages as the need arises. */
11327 if (TREE_CODE (decl) == STRING_CST)
11328 cp_error ("invalid string constant `%E'", decl);
11329 else if (TREE_CODE (decl) == INTEGER_CST)
11330 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11334 if (TREE_CODE (decl) != VOID_TYPE)
11336 decl = grokdeclarator (TREE_VALUE (decl),
11337 TREE_PURPOSE (decl),
11338 PARM, init != NULL_TREE,
11340 if (! decl || TREE_TYPE (decl) == error_mark_node)
11343 /* Top-level qualifiers on the parameters are
11344 ignored for function types. */
11345 type = TYPE_MAIN_VARIANT (TREE_TYPE (decl));
11347 if (TREE_CODE (type) == VOID_TYPE)
11348 decl = void_type_node;
11349 else if (TREE_CODE (type) == METHOD_TYPE)
11351 if (DECL_NAME (decl))
11352 /* Cannot use the decl here because
11353 we don't have DECL_CONTEXT set up yet. */
11354 cp_error ("parameter `%D' invalidly declared method type",
11357 error ("parameter invalidly declared method type");
11358 type = build_pointer_type (type);
11359 TREE_TYPE (decl) = type;
11361 else if (TREE_CODE (type) == OFFSET_TYPE)
11363 if (DECL_NAME (decl))
11364 cp_error ("parameter `%D' invalidly declared offset type",
11367 error ("parameter invalidly declared offset type");
11368 type = build_pointer_type (type);
11369 TREE_TYPE (decl) = type;
11371 else if (abstract_virtuals_error (decl, type))
11372 any_error = 1; /* Seems like a good idea. */
11373 else if (POINTER_TYPE_P (type))
11376 while (POINTER_TYPE_P (t)
11377 || (TREE_CODE (t) == ARRAY_TYPE
11378 && TYPE_DOMAIN (t) != NULL_TREE))
11380 if (TREE_CODE (t) == ARRAY_TYPE)
11381 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11383 TYPE_PTR_P (type) ? "pointer" : "reference");
11387 if (TREE_CODE (decl) == VOID_TYPE)
11389 if (result == NULL_TREE)
11391 result = void_list_node;
11392 last_result = result;
11396 TREE_CHAIN (last_result) = void_list_node;
11397 last_result = void_list_node;
11400 && (chain != void_list_node || TREE_CHAIN (chain)))
11401 error ("`void' in parameter list must be entire list");
11405 /* Since there is a prototype, args are passed in their own types. */
11406 DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
11407 if (PROMOTE_PROTOTYPES
11408 && (TREE_CODE (type) == INTEGER_TYPE
11409 || TREE_CODE (type) == ENUMERAL_TYPE)
11410 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
11411 DECL_ARG_TYPE (decl) = integer_type_node;
11412 if (!any_error && init)
11415 init = check_default_argument (decl, init);
11420 if (decls == NULL_TREE)
11427 TREE_CHAIN (last_decl) = decl;
11430 list_node = tree_cons (init, type, NULL_TREE);
11431 if (result == NULL_TREE)
11433 result = list_node;
11434 last_result = result;
11438 TREE_CHAIN (last_result) = list_node;
11439 last_result = list_node;
11443 TREE_CHAIN (last_result) = NULL_TREE;
11444 /* If there are no parameters, and the function does not end
11445 with `...', then last_decl will be NULL_TREE. */
11446 if (last_decl != NULL_TREE)
11447 TREE_CHAIN (last_decl) = NULL_TREE;
11451 last_function_parms = decls;
11456 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11457 FUNCTION_TYPE with the newly parsed version of its default argument, which
11458 was previously digested as text. See snarf_defarg et al in lex.c. */
11461 replace_defarg (arg, init)
11464 if (! processing_template_decl
11465 && ! can_convert_arg (TREE_VALUE (arg), TREE_TYPE (init), init))
11466 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11467 TREE_TYPE (init), TREE_VALUE (arg));
11468 TREE_PURPOSE (arg) = init;
11475 tree t = FUNCTION_ARG_CHAIN (d);
11476 if (DECL_CONSTRUCTOR_P (d)
11477 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d)))
11478 t = TREE_CHAIN (t);
11479 if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
11480 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t)))
11481 == DECL_CLASS_CONTEXT (d))
11482 && (TREE_CHAIN (t) == NULL_TREE
11483 || TREE_CHAIN (t) == void_list_node
11484 || TREE_PURPOSE (TREE_CHAIN (t))))
11489 /* These memoizing functions keep track of special properties which
11490 a class may have. `grok_ctor_properties' notices whether a class
11491 has a constructor of the form X(X&), and also complains
11492 if the class has a constructor of the form X(X).
11493 `grok_op_properties' takes notice of the various forms of
11494 operator= which are defined, as well as what sorts of type conversion
11495 may apply. Both functions take a FUNCTION_DECL as an argument. */
11498 grok_ctor_properties (ctype, decl)
11501 tree parmtypes = FUNCTION_ARG_CHAIN (decl);
11502 tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
11504 /* When a type has virtual baseclasses, a magical first int argument is
11505 added to any ctor so we can tell if the class has been initialized
11506 yet. This could screw things up in this function, so we deliberately
11507 ignore the leading int if we're in that situation. */
11508 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype))
11510 my_friendly_assert (parmtypes
11511 && TREE_VALUE (parmtypes) == integer_type_node,
11513 parmtypes = TREE_CHAIN (parmtypes);
11514 parmtype = TREE_VALUE (parmtypes);
11519 A non-template constructor for class X is a copy constructor if
11520 its first parameter is of type X&, const X&, volatile X& or const
11521 volatile X&, and either there are no other parameters or else all
11522 other parameters have default arguments. */
11523 if (TREE_CODE (parmtype) == REFERENCE_TYPE
11524 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype
11525 && (TREE_CHAIN (parmtypes) == NULL_TREE
11526 || TREE_CHAIN (parmtypes) == void_list_node
11527 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11528 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11529 && is_member_template (DECL_TI_TEMPLATE (decl))))
11531 TYPE_HAS_INIT_REF (ctype) = 1;
11532 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11533 TYPE_HAS_CONST_INIT_REF (ctype) = 1;
11537 A declaration of a constructor for a class X is ill-formed if its
11538 first parameter is of type (optionally cv-qualified) X and either
11539 there are no other parameters or else all other parameters have
11542 We *don't* complain about member template instantiations that
11543 have this form, though; they can occur as we try to decide what
11544 constructor to use during overload resolution. Since overload
11545 resolution will never prefer such a constructor to the
11546 non-template copy constructor (which is either explicitly or
11547 implicitly defined), there's no need to worry about their
11548 existence. Theoretically, they should never even be
11549 instantiated, but that's hard to forestall. */
11550 else if (TYPE_MAIN_VARIANT (parmtype) == ctype
11551 && (TREE_CHAIN (parmtypes) == NULL_TREE
11552 || TREE_CHAIN (parmtypes) == void_list_node
11553 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11554 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11555 && is_member_template (DECL_TI_TEMPLATE (decl))))
11557 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11559 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
11562 else if (TREE_CODE (parmtype) == VOID_TYPE
11563 || TREE_PURPOSE (parmtypes) != NULL_TREE)
11564 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1;
11569 /* An operator with this name can be either unary or binary. */
11575 return (name == ansi_opname [(int) INDIRECT_REF]
11576 || name == ansi_opname [(int) ADDR_EXPR]
11577 || name == ansi_opname [(int) NEGATE_EXPR]
11578 || name == ansi_opname[(int) POSTINCREMENT_EXPR]
11579 || name == ansi_opname[(int) POSTDECREMENT_EXPR]
11580 || name == ansi_opname [(int) CONVERT_EXPR]);
11583 /* An operator with this name can only be unary. */
11589 return (name == ansi_opname [(int) TRUTH_NOT_EXPR]
11590 || name == ansi_opname [(int) BIT_NOT_EXPR]
11591 || name == ansi_opname [(int) COMPONENT_REF]
11592 || IDENTIFIER_TYPENAME_P (name));
11595 /* Do a little sanity-checking on how they declared their operator. */
11598 grok_op_properties (decl, virtualp, friendp)
11600 int virtualp, friendp;
11602 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
11603 int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
11604 tree name = DECL_NAME (decl);
11606 if (current_class_type == NULL_TREE)
11613 A user-declared copy assignment operator X::operator= is a
11614 non-static non-template member function of class X with
11615 exactly one parameter of type X, X&, const X&, volatile X& or
11616 const volatile X&. */
11617 if (name == ansi_opname[(int) MODIFY_EXPR]
11618 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11619 && is_member_template (DECL_TI_TEMPLATE (decl))))
11621 else if (name == ansi_opname[(int) CALL_EXPR])
11622 TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
11623 else if (name == ansi_opname[(int) ARRAY_REF])
11624 TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
11625 else if (name == ansi_opname[(int) COMPONENT_REF]
11626 || name == ansi_opname[(int) MEMBER_REF])
11627 TYPE_OVERLOADS_ARROW (current_class_type) = 1;
11628 else if (name == ansi_opname[(int) NEW_EXPR])
11629 TYPE_GETS_NEW (current_class_type) |= 1;
11630 else if (name == ansi_opname[(int) DELETE_EXPR])
11631 TYPE_GETS_DELETE (current_class_type) |= 1;
11632 else if (name == ansi_opname[(int) VEC_NEW_EXPR])
11633 TYPE_GETS_NEW (current_class_type) |= 2;
11634 else if (name == ansi_opname[(int) VEC_DELETE_EXPR])
11635 TYPE_GETS_DELETE (current_class_type) |= 2;
11638 if (name == ansi_opname[(int) NEW_EXPR]
11639 || name == ansi_opname[(int) VEC_NEW_EXPR])
11641 /* When the compiler encounters the definition of A::operator new, it
11642 doesn't look at the class declaration to find out if it's static. */
11644 revert_static_member_fn (&decl, NULL, NULL);
11646 /* Take care of function decl if we had syntax errors. */
11647 if (argtypes == NULL_TREE)
11649 = build_function_type (ptr_type_node,
11650 hash_tree_chain (integer_type_node,
11653 TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
11655 else if (name == ansi_opname[(int) DELETE_EXPR]
11656 || name == ansi_opname[(int) VEC_DELETE_EXPR])
11659 revert_static_member_fn (&decl, NULL, NULL);
11661 if (argtypes == NULL_TREE)
11663 = build_function_type (void_type_node,
11664 hash_tree_chain (ptr_type_node,
11668 TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
11670 if (! friendp && name == ansi_opname[(int) VEC_DELETE_EXPR]
11671 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)))
11672 != void_list_node))
11673 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type) = 1;
11678 /* An operator function must either be a non-static member function
11679 or have at least one parameter of a class, a reference to a class,
11680 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11681 if (! methodp || DECL_STATIC_FUNCTION_P (decl))
11683 if (IDENTIFIER_TYPENAME_P (name)
11684 || name == ansi_opname[(int) CALL_EXPR]
11685 || name == ansi_opname[(int) MODIFY_EXPR]
11686 || name == ansi_opname[(int) COMPONENT_REF]
11687 || name == ansi_opname[(int) ARRAY_REF])
11688 cp_error ("`%D' must be a nonstatic member function", decl);
11693 if (DECL_STATIC_FUNCTION_P (decl))
11694 cp_error ("`%D' must be either a non-static member function or a non-member function", decl);
11697 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
11699 tree arg = TREE_VALUE (p);
11700 if (TREE_CODE (arg) == REFERENCE_TYPE)
11701 arg = TREE_TYPE (arg);
11703 /* This lets bad template code slip through. */
11704 if (IS_AGGR_TYPE (arg)
11705 || TREE_CODE (arg) == ENUMERAL_TYPE
11706 || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
11707 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
11711 ("`%D' must have an argument of class or enumerated type",
11718 if (name == ansi_opname[(int) CALL_EXPR])
11719 return; /* No restrictions on args. */
11721 if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
11723 tree t = TREE_TYPE (name);
11724 if (TREE_CODE (t) == VOID_TYPE)
11725 pedwarn ("void is not a valid type conversion operator");
11726 else if (! friendp)
11728 int ref = (TREE_CODE (t) == REFERENCE_TYPE);
11729 const char *what = 0;
11731 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
11733 if (t == current_class_type)
11734 what = "the same type";
11735 /* Don't force t to be complete here. */
11736 else if (IS_AGGR_TYPE (t)
11738 && DERIVED_FROM_P (t, current_class_type))
11739 what = "a base class";
11742 warning ("conversion to %s%s will never use a type conversion operator",
11743 ref ? "a reference to " : "", what);
11747 if (name == ansi_opname[(int) MODIFY_EXPR])
11751 if (list_length (argtypes) != 3 && methodp)
11753 cp_error ("`%D' must take exactly one argument", decl);
11756 parmtype = TREE_VALUE (TREE_CHAIN (argtypes));
11758 if (copy_assignment_arg_p (parmtype, virtualp)
11761 TYPE_HAS_ASSIGN_REF (current_class_type) = 1;
11762 if (TREE_CODE (parmtype) != REFERENCE_TYPE
11763 || CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11764 TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1;
11767 else if (name == ansi_opname[(int) COND_EXPR])
11770 cp_error ("ANSI C++ prohibits overloading operator ?:");
11772 else if (ambi_op_p (name))
11774 if (list_length (argtypes) == 2)
11776 else if (list_length (argtypes) == 3)
11778 if ((name == ansi_opname[(int) POSTINCREMENT_EXPR]
11779 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
11780 && ! processing_template_decl
11781 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
11784 cp_error ("postfix `%D' must take `int' as its argument",
11788 ("postfix `%D' must take `int' as its second argument",
11795 cp_error ("`%D' must take either zero or one argument", decl);
11797 cp_error ("`%D' must take either one or two arguments", decl);
11800 /* More Effective C++ rule 6. */
11802 && (name == ansi_opname[(int) POSTINCREMENT_EXPR]
11803 || name == ansi_opname[(int) POSTDECREMENT_EXPR]))
11805 tree arg = TREE_VALUE (argtypes);
11806 tree ret = TREE_TYPE (TREE_TYPE (decl));
11807 if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
11808 arg = TREE_TYPE (arg);
11809 arg = TYPE_MAIN_VARIANT (arg);
11810 if (list_length (argtypes) == 2)
11812 if (TREE_CODE (ret) != REFERENCE_TYPE
11813 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
11815 cp_warning ("prefix `%D' should return `%T'", decl,
11816 build_reference_type (arg));
11820 if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
11821 cp_warning ("postfix `%D' should return `%T'", decl, arg);
11825 else if (unary_op_p (name))
11827 if (list_length (argtypes) != 2)
11830 cp_error ("`%D' must take `void'", decl);
11832 cp_error ("`%D' must take exactly one argument", decl);
11835 else /* if (binary_op_p (name)) */
11837 if (list_length (argtypes) != 3)
11840 cp_error ("`%D' must take exactly one argument", decl);
11842 cp_error ("`%D' must take exactly two arguments", decl);
11845 /* More Effective C++ rule 7. */
11847 && (name == ansi_opname [TRUTH_ANDIF_EXPR]
11848 || name == ansi_opname [TRUTH_ORIF_EXPR]
11849 || name == ansi_opname [COMPOUND_EXPR]))
11850 cp_warning ("user-defined `%D' always evaluates both arguments",
11854 /* Effective C++ rule 23. */
11856 && list_length (argtypes) == 3
11857 && (name == ansi_opname [PLUS_EXPR]
11858 || name == ansi_opname [MINUS_EXPR]
11859 || name == ansi_opname [TRUNC_DIV_EXPR]
11860 || name == ansi_opname [MULT_EXPR])
11861 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
11862 cp_warning ("`%D' should return by value", decl);
11866 for (; argtypes != void_list_node ; argtypes = TREE_CHAIN (argtypes))
11867 if (TREE_PURPOSE (argtypes))
11869 TREE_PURPOSE (argtypes) = NULL_TREE;
11870 if (name == ansi_opname[(int) POSTINCREMENT_EXPR]
11871 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
11874 cp_pedwarn ("`%D' cannot have default arguments", decl);
11877 cp_error ("`%D' cannot have default arguments", decl);
11882 static const char *
11884 enum tag_types code;
11897 my_friendly_abort (981122);
11901 /* Get the struct, enum or union (CODE says which) with tag NAME.
11902 Define the tag as a forward-reference if it is not defined.
11904 C++: If a class derivation is given, process it here, and report
11905 an error if multiple derivation declarations are not identical.
11907 If this is a definition, come in through xref_tag and only look in
11908 the current frame for the name (since C++ allows new names in any
11912 xref_tag (code_type_node, name, globalize)
11913 tree code_type_node;
11917 enum tag_types tag_code;
11918 enum tree_code code;
11920 register tree ref, t;
11921 struct binding_level *b = current_binding_level;
11923 tree attributes = NULL_TREE;
11924 tree context = NULL_TREE;
11926 /* If we are called from the parser, code_type_node will sometimes be a
11927 TREE_LIST. This indicates that the user wrote
11928 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11930 if (TREE_CODE (code_type_node) == TREE_LIST)
11932 attributes = TREE_PURPOSE (code_type_node);
11933 code_type_node = TREE_VALUE (code_type_node);
11936 tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
11941 code = RECORD_TYPE;
11947 code = ENUMERAL_TYPE;
11950 my_friendly_abort (18);
11953 /* If a cross reference is requested, look up the type
11954 already defined for this tag and return it. */
11955 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
11958 name = TYPE_IDENTIFIER (t);
11962 t = IDENTIFIER_TYPE_VALUE (name);
11964 if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
11965 && TREE_CODE (t) != TEMPLATE_TEMPLATE_PARM)
11970 /* If we know we are defining this tag, only look it up in
11971 this scope and don't try to find it as a type. */
11972 ref = lookup_tag (code, name, b, 1);
11978 /* [dcl.type.elab] If the identifier resolves to a
11979 typedef-name or a template type-parameter, the
11980 elaborated-type-specifier is ill-formed. */
11981 if (t != TYPE_MAIN_VARIANT (t)
11982 || (CLASS_TYPE_P (t) && TYPE_WAS_ANONYMOUS (t)))
11983 cp_pedwarn ("using typedef-name `%D' after `%s'",
11984 TYPE_NAME (t), tag_name (tag_code));
11985 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
11986 cp_error ("using template type parameter `%T' after `%s'",
11987 t, tag_name (tag_code));
11992 ref = lookup_tag (code, name, b, 0);
11996 /* Try finding it as a type declaration. If that wins,
11998 ref = lookup_name (name, 1);
12000 if (ref != NULL_TREE
12001 && processing_template_decl
12002 && DECL_CLASS_TEMPLATE_P (ref)
12003 && template_class_depth (current_class_type) == 0)
12004 /* Since GLOBALIZE is true, we're declaring a global
12005 template, so we want this type. */
12006 ref = DECL_RESULT (ref);
12008 if (ref && TREE_CODE (ref) == TYPE_DECL
12009 && TREE_CODE (TREE_TYPE (ref)) == code)
12010 ref = TREE_TYPE (ref);
12015 if (ref && current_class_type
12016 && template_class_depth (current_class_type)
12017 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12019 /* Since GLOBALIZE is non-zero, we are not looking at a
12020 definition of this tag. Since, in addition, we are currently
12021 processing a (member) template declaration of a template
12022 class, we must be very careful; consider:
12029 { template <class V>
12030 friend struct S1; };
12032 Here, the S2::S1 declaration should not be confused with the
12033 outer declaration. In particular, the inner version should
12034 have a template parameter of level 2, not level 1. This
12035 would be particularly important if the member declaration
12038 template <class V = U> friend struct S1;
12040 say, when we should tsubst into `U' when instantiating
12041 S2. On the other hand, when presented with:
12051 we must find the inner binding eventually. We
12052 accomplish this by making sure that the new type we
12053 create to represent this declaration has the right
12055 context = TYPE_CONTEXT (ref);
12060 push_obstacks_nochange ();
12064 /* If no such tag is yet defined, create a forward-reference node
12065 and record it as the "definition".
12066 When a real declaration of this type is found,
12067 the forward-reference will be altered into a real type. */
12069 /* In C++, since these migrate into the global scope, we must
12070 build them on the permanent obstack. */
12072 temp = allocation_temporary_p ();
12074 end_temporary_allocation ();
12076 if (code == ENUMERAL_TYPE)
12078 cp_error ("use of enum `%#D' without previous declaration", name);
12080 ref = make_node (ENUMERAL_TYPE);
12082 /* Give the type a default layout like unsigned int
12083 to avoid crashing if it does not get defined. */
12084 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12085 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12086 TREE_UNSIGNED (ref) = 1;
12087 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12088 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12089 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12091 /* Enable us to recognize when a type is created in class context.
12092 To do nested classes correctly, this should probably be cleared
12093 out when we leave this classes scope. Currently this in only
12094 done in `start_enum'. */
12096 pushtag (name, ref, globalize);
12100 struct binding_level *old_b = class_binding_level;
12102 ref = make_lang_type (code);
12103 TYPE_CONTEXT (ref) = context;
12105 #ifdef NONNESTED_CLASSES
12106 /* Class types don't nest the way enums do. */
12107 class_binding_level = (struct binding_level *)0;
12109 pushtag (name, ref, globalize);
12110 class_binding_level = old_b;
12115 /* If it no longer looks like a nested type, make sure it's
12117 If it is not an IDENTIFIER, this is not a declaration */
12118 if (b->namespace_p && !class_binding_level
12119 && TREE_CODE (name) == IDENTIFIER_NODE)
12121 if (IDENTIFIER_NAMESPACE_VALUE (name) == NULL_TREE)
12122 SET_IDENTIFIER_NAMESPACE_VALUE (name, TYPE_NAME (ref));
12125 if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12126 redeclare_class_template (ref, current_template_parms);
12129 /* Until the type is defined, tentatively accept whatever
12130 structure tag the user hands us. */
12131 if (TYPE_SIZE (ref) == NULL_TREE
12132 && ref != current_class_type
12133 /* Have to check this, in case we have contradictory tag info. */
12134 && IS_AGGR_TYPE_CODE (TREE_CODE (ref)))
12136 if (tag_code == class_type)
12137 CLASSTYPE_DECLARED_CLASS (ref) = 1;
12138 else if (tag_code == record_type)
12139 CLASSTYPE_DECLARED_CLASS (ref) = 0;
12144 TREE_TYPE (ref) = attributes;
12150 xref_tag_from_type (old, id, globalize)
12154 tree code_type_node;
12156 if (TREE_CODE (old) == RECORD_TYPE)
12157 code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12158 ? class_type_node : record_type_node);
12160 code_type_node = union_type_node;
12162 if (id == NULL_TREE)
12163 id = TYPE_IDENTIFIER (old);
12165 return xref_tag (code_type_node, id, globalize);
12168 /* REF is a type (named NAME), for which we have just seen some
12169 baseclasses. BINFO is a list of those baseclasses; the
12170 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12171 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12172 struct, or union. */
12175 xref_basetypes (code_type_node, name, ref, binfo)
12176 tree code_type_node;
12180 /* In the declaration `A : X, Y, ... Z' we mark all the types
12181 (A, X, Y, ..., Z) so we can check for duplicates. */
12186 enum tag_types tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
12188 if (tag_code == union_type)
12190 cp_error ("derived union `%T' invalid", ref);
12194 len = list_length (binfo);
12195 push_obstacks (TYPE_OBSTACK (ref), TYPE_OBSTACK (ref));
12197 /* First, make sure that any templates in base-classes are
12198 instantiated. This ensures that if we call ourselves recursively
12199 we do not get confused about which classes are marked and which
12201 for (base = binfo; base; base = TREE_CHAIN (base))
12202 complete_type (TREE_VALUE (base));
12204 SET_CLASSTYPE_MARKED (ref);
12205 BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
12207 for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
12209 /* The base of a derived struct is public by default. */
12211 = (TREE_PURPOSE (binfo) == access_public_node
12212 || TREE_PURPOSE (binfo) == access_public_virtual_node
12213 || (tag_code != class_type
12214 && (TREE_PURPOSE (binfo) == access_default_node
12215 || TREE_PURPOSE (binfo) == access_default_virtual_node)));
12217 = (TREE_PURPOSE (binfo) == access_protected_node
12218 || TREE_PURPOSE (binfo) == access_protected_virtual_node);
12220 = (TREE_PURPOSE (binfo) == access_private_virtual_node
12221 || TREE_PURPOSE (binfo) == access_protected_virtual_node
12222 || TREE_PURPOSE (binfo) == access_public_virtual_node
12223 || TREE_PURPOSE (binfo) == access_default_virtual_node);
12224 tree basetype = TREE_VALUE (binfo);
12227 if (basetype && TREE_CODE (basetype) == TYPE_DECL)
12228 basetype = TREE_TYPE (basetype);
12230 || (TREE_CODE (basetype) != RECORD_TYPE
12231 && TREE_CODE (basetype) != TYPENAME_TYPE
12232 && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
12233 && TREE_CODE (basetype) != TEMPLATE_TEMPLATE_PARM))
12235 cp_error ("base type `%T' fails to be a struct or class type",
12236 TREE_VALUE (binfo));
12240 GNU_xref_hier (name, basetype, via_public, via_virtual, 0);
12242 /* This code replaces similar code in layout_basetypes.
12243 We put the complete_type first for implicit `typename'. */
12244 if (TYPE_SIZE (basetype) == NULL_TREE
12245 && ! (current_template_parms && uses_template_parms (basetype)))
12247 cp_error ("base class `%T' has incomplete type", basetype);
12252 if (CLASSTYPE_MARKED (basetype))
12254 if (basetype == ref)
12255 cp_error ("recursive type `%T' undefined", basetype);
12257 cp_error ("duplicate base type `%T' invalid", basetype);
12261 if (TYPE_FOR_JAVA (basetype)
12262 && (current_lang_stack
12263 == &VARRAY_TREE (current_lang_base, 0)))
12264 TYPE_FOR_JAVA (ref) = 1;
12266 /* Note that the BINFO records which describe individual
12267 inheritances are *not* shared in the lattice! They
12268 cannot be shared because a given baseclass may be
12269 inherited with different `accessibility' by different
12270 derived classes. (Each BINFO record describing an
12271 individual inheritance contains flags which say what
12272 the `accessibility' of that particular inheritance is.) */
12275 = make_binfo (integer_zero_node, basetype,
12276 CLASS_TYPE_P (basetype)
12277 ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
12278 CLASS_TYPE_P (basetype)
12279 ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
12281 TREE_VEC_ELT (binfos, i) = base_binfo;
12282 TREE_VIA_PUBLIC (base_binfo) = via_public;
12283 TREE_VIA_PROTECTED (base_binfo) = via_protected;
12284 TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
12285 BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
12287 /* We need to unshare the binfos now so that lookups during class
12288 definition work. */
12289 unshare_base_binfos (base_binfo);
12291 SET_CLASSTYPE_MARKED (basetype);
12293 /* We are free to modify these bits because they are meaningless
12294 at top level, and BASETYPE is a top-level type. */
12295 if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
12297 TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
12298 TYPE_USES_COMPLEX_INHERITANCE (ref) = 1;
12301 if (CLASS_TYPE_P (basetype))
12303 TYPE_GETS_NEW (ref) |= TYPE_GETS_NEW (basetype);
12304 TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
12311 TREE_VEC_LENGTH (binfos) = i;
12313 BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
12316 TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
12319 tree basetype = BINFO_TYPE (TREE_VEC_ELT (binfos, 0));
12321 if (CLASS_TYPE_P (basetype))
12322 TYPE_USES_MULTIPLE_INHERITANCE (ref)
12323 = TYPE_USES_MULTIPLE_INHERITANCE (basetype);
12326 if (TYPE_USES_MULTIPLE_INHERITANCE (ref))
12327 TYPE_USES_COMPLEX_INHERITANCE (ref) = 1;
12329 /* Unmark all the types. */
12331 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
12332 CLEAR_CLASSTYPE_MARKED (ref);
12334 /* Now that we know all the base-classes, set up the list of virtual
12336 CLASSTYPE_VBASECLASSES (ref) = get_vbase_types (ref);
12342 /* Begin compiling the definition of an enumeration type.
12343 NAME is its name (or null if anonymous).
12344 Returns the type object, as yet incomplete.
12345 Also records info about it so that build_enumerator
12346 may be used to declare the individual values as they are read. */
12352 register tree enumtype = NULL_TREE;
12353 struct binding_level *b = current_binding_level;
12355 /* We are wasting space here and putting these on the permanent_obstack so
12356 that typeid(local enum) will work correctly. */
12357 push_obstacks (&permanent_obstack, &permanent_obstack);
12359 /* If this is the real definition for a previous forward reference,
12360 fill in the contents in the same object that used to be the
12361 forward reference. */
12363 if (name != NULL_TREE)
12364 enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
12366 if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
12368 cp_error ("multiple definition of `%#T'", enumtype);
12369 cp_error_at ("previous definition here", enumtype);
12373 enumtype = make_node (ENUMERAL_TYPE);
12374 pushtag (name, enumtype, 0);
12377 if (current_class_type)
12378 TREE_ADDRESSABLE (b->tags) = 1;
12380 /* We don't copy this value because build_enumerator needs to do it. */
12381 enum_next_value = integer_zero_node;
12384 GNU_xref_decl (current_function_decl, enumtype);
12388 /* After processing and defining all the values of an enumeration type,
12389 install their decls in the enumeration type and finish it off.
12390 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12391 Returns ENUMTYPE. */
12394 finish_enum (enumtype)
12397 register tree minnode = NULL_TREE, maxnode = NULL_TREE;
12398 /* Calculate the maximum value of any enumerator in this type. */
12400 tree values = TYPE_VALUES (enumtype);
12405 for (pair = values; pair; pair = TREE_CHAIN (pair))
12410 /* The TREE_VALUE is a CONST_DECL for this enumeration
12412 decl = TREE_VALUE (pair);
12414 /* The DECL_INITIAL will be NULL if we are processing a
12415 template declaration and this enumeration constant had no
12416 explicit initializer. */
12417 value = DECL_INITIAL (decl);
12418 if (value && !processing_template_decl)
12420 /* Set the TREE_TYPE for the VALUE as well. That's so
12421 that when we call decl_constant_value we get an
12422 entity of the right type (but with the constant
12423 value). Since we shouldn't ever call
12424 decl_constant_value on a template type, there's no
12425 reason to do that when processing_template_decl.
12426 And, if the expression is something like a
12427 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12428 wreak havoc on the intended type of the expression.
12430 Of course, there's also no point in trying to compute
12431 minimum or maximum values if we're in a template. */
12432 TREE_TYPE (value) = enumtype;
12435 minnode = maxnode = value;
12436 else if (tree_int_cst_lt (maxnode, value))
12438 else if (tree_int_cst_lt (value, minnode))
12442 if (processing_template_decl)
12443 /* If this is just a template, leave the CONST_DECL
12444 alone. That way tsubst_copy will find CONST_DECLs for
12445 CONST_DECLs, and not INTEGER_CSTs. */
12448 /* In the list we're building up, we want the enumeration
12449 values, not the CONST_DECLs. */
12450 TREE_VALUE (pair) = value;
12454 maxnode = minnode = integer_zero_node;
12456 TYPE_VALUES (enumtype) = nreverse (values);
12458 if (processing_template_decl)
12460 tree scope = current_scope ();
12461 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12462 add_tree (build_min (TAG_DEFN, enumtype));
12466 int unsignedp = tree_int_cst_sgn (minnode) >= 0;
12467 int lowprec = min_precision (minnode, unsignedp);
12468 int highprec = min_precision (maxnode, unsignedp);
12469 int precision = MAX (lowprec, highprec);
12472 TYPE_SIZE (enumtype) = NULL_TREE;
12474 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12476 TYPE_PRECISION (enumtype) = precision;
12478 fixup_unsigned_type (enumtype);
12480 fixup_signed_type (enumtype);
12482 if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
12483 /* Use the width of the narrowest normal C type which is wide
12485 TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
12488 TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
12490 TYPE_SIZE (enumtype) = 0;
12491 layout_type (enumtype);
12493 /* Fix up all variant types of this enum type. */
12494 for (tem = TYPE_MAIN_VARIANT (enumtype); tem;
12495 tem = TYPE_NEXT_VARIANT (tem))
12497 TYPE_VALUES (tem) = TYPE_VALUES (enumtype);
12498 TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype);
12499 TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype);
12500 TYPE_SIZE (tem) = TYPE_SIZE (enumtype);
12501 TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype);
12502 TYPE_MODE (tem) = TYPE_MODE (enumtype);
12503 TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype);
12504 TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype);
12505 TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype);
12508 /* Finish debugging output for this type. */
12509 rest_of_type_compilation (enumtype, namespace_bindings_p ());
12512 /* In start_enum we pushed obstacks. Here, we must pop them. */
12518 /* Build and install a CONST_DECL for an enumeration constant of the
12519 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12520 Assignment of sequential values by default is handled here. */
12523 build_enumerator (name, value, type)
12531 /* Remove no-op casts from the value. */
12533 STRIP_TYPE_NOPS (value);
12535 if (! processing_template_decl)
12537 /* Validate and default VALUE. */
12538 if (value != NULL_TREE)
12540 if (TREE_READONLY_DECL_P (value))
12541 value = decl_constant_value (value);
12543 if (TREE_CODE (value) == INTEGER_CST)
12545 value = default_conversion (value);
12546 constant_expression_warning (value);
12550 cp_error ("enumerator value for `%D' not integer constant", name);
12555 /* Default based on previous value. */
12556 if (value == NULL_TREE && ! processing_template_decl)
12558 value = enum_next_value;
12560 cp_error ("overflow in enumeration values at `%D'", name);
12563 /* Remove no-op casts from the value. */
12565 STRIP_TYPE_NOPS (value);
12567 /* To fix MAX_VAL enum consts. (bkoz) */
12568 TREE_TYPE (value) = integer_type_node;
12572 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12573 Even in other cases, we will later (in finish_enum) be setting the
12575 if (value != NULL_TREE)
12576 value = copy_node (value);
12578 /* C++ associates enums with global, function, or class declarations. */
12580 context = current_scope ();
12581 if (context && context == current_class_type)
12582 /* This enum declaration is local to the class. */
12583 decl = build_lang_decl (CONST_DECL, name, type);
12585 /* It's a global enum, or it's local to a function. (Note local to
12586 a function could mean local to a class method. */
12587 decl = build_decl (CONST_DECL, name, type);
12589 DECL_CONTEXT (decl) = FROB_CONTEXT (context);
12590 DECL_INITIAL (decl) = value;
12591 TREE_READONLY (decl) = 1;
12593 if (context && context == current_class_type)
12594 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12595 on the TYPE_FIELDS list for `S'. (That's so that you can say
12596 things like `S::i' later.) */
12597 finish_member_declaration (decl);
12601 GNU_xref_decl (current_function_decl, decl);
12604 if (! processing_template_decl)
12606 /* Set basis for default for next value. */
12607 enum_next_value = build_binary_op_nodefault (PLUS_EXPR, value,
12608 integer_one_node, PLUS_EXPR);
12609 enum_overflow = tree_int_cst_lt (enum_next_value, value);
12612 result = tree_cons (name, decl, NULL_TREE);
12617 static int function_depth;
12619 /* We're defining DECL. Make sure that it's type is OK. */
12622 check_function_type (decl)
12625 tree fntype = TREE_TYPE (decl);
12627 /* In a function definition, arg types must be complete. */
12628 require_complete_types_for_parms (current_function_parms);
12630 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype))) == NULL_TREE)
12632 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype));
12634 /* Make it return void instead, but don't change the
12635 type of the DECL_RESULT, in case we have a named return value. */
12636 if (TREE_CODE (fntype) == METHOD_TYPE)
12638 tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
12640 = build_cplus_method_type (ctype,
12642 FUNCTION_ARG_CHAIN (decl));
12646 = build_function_type (void_type_node,
12647 TYPE_ARG_TYPES (TREE_TYPE (decl)));
12649 = build_exception_variant (fntype,
12650 TYPE_RAISES_EXCEPTIONS (fntype));
12653 abstract_virtuals_error (decl, TREE_TYPE (fntype));
12656 /* Create the FUNCTION_DECL for a function definition.
12657 DECLSPECS and DECLARATOR are the parts of the declaration;
12658 they describe the function's name and the type it returns,
12659 but twisted together in a fashion that parallels the syntax of C.
12661 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12662 DECLARATOR is really the DECL for the function we are about to
12663 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12664 indicating that the function is an inline defined in-class, and
12665 SF_EXPAND indicating that we should generate RTL for this
12668 This function creates a binding context for the function body
12669 as well as setting up the FUNCTION_DECL in current_function_decl.
12671 Returns 1 on success. If the DECLARATOR is not suitable for a function
12672 (it defines a datum instead), we return 0, which tells
12673 yyparse to report a parse error.
12675 For C++, we must first check whether that datum makes any sense.
12676 For example, "class A local_a(1,2);" means that variable local_a
12677 is an aggregate of type A, which should have a constructor
12678 applied to it with the argument list [1, 2]. */
12681 start_function (declspecs, declarator, attrs, flags)
12682 tree declspecs, declarator, attrs;
12686 tree ctype = NULL_TREE;
12689 extern int have_extern_spec;
12690 extern int used_extern_spec;
12691 int doing_friend = 0;
12692 struct binding_level *bl;
12694 /* Sanity check. */
12695 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
12696 my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
12698 /* This should only be done once on the top most decl. */
12699 if (have_extern_spec && !used_extern_spec)
12701 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
12702 used_extern_spec = 1;
12705 if (flags & SF_PRE_PARSED)
12707 decl1 = declarator;
12709 fntype = TREE_TYPE (decl1);
12710 if (TREE_CODE (fntype) == METHOD_TYPE)
12711 ctype = TYPE_METHOD_BASETYPE (fntype);
12713 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12714 class is in the (lexical) scope of the class in which it is
12716 if (!ctype && DECL_FRIEND_P (decl1))
12718 ctype = DECL_CLASS_CONTEXT (decl1);
12720 /* CTYPE could be null here if we're dealing with a template;
12721 for example, `inline friend float foo()' inside a template
12722 will have no CTYPE set. */
12723 if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
12729 last_function_parms = DECL_ARGUMENTS (decl1);
12730 last_function_parm_tags = NULL_TREE;
12734 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE);
12735 /* If the declarator is not suitable for a function definition,
12736 cause a syntax error. */
12737 if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0;
12739 fntype = TREE_TYPE (decl1);
12741 restype = TREE_TYPE (fntype);
12742 if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
12744 cp_error ("semicolon missing after declaration of `%#T'", restype);
12745 shadow_tag (build_expr_list (NULL_TREE, restype));
12746 CLASSTYPE_GOT_SEMICOLON (restype) = 1;
12747 if (TREE_CODE (fntype) == FUNCTION_TYPE)
12748 fntype = build_function_type (integer_type_node,
12749 TYPE_ARG_TYPES (fntype));
12751 fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
12753 TYPE_ARG_TYPES (fntype));
12754 TREE_TYPE (decl1) = fntype;
12757 if (TREE_CODE (fntype) == METHOD_TYPE)
12758 ctype = TYPE_METHOD_BASETYPE (fntype);
12759 else if (DECL_MAIN_P (decl1))
12761 /* If this doesn't return integer_type, complain. */
12762 if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
12764 if (pedantic || warn_return_type)
12765 pedwarn ("return type for `main' changed to `int'");
12766 TREE_TYPE (decl1) = fntype = default_function_type;
12771 /* Warn if function was previously implicitly declared
12772 (but not if we warned then). */
12773 if (! warn_implicit
12774 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
12775 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
12777 /* Set up current_class_type, and enter the scope of the class, if
12780 push_nested_class (ctype, 1);
12781 else if (DECL_STATIC_FUNCTION_P (decl1))
12782 push_nested_class (DECL_CONTEXT (decl1), 2);
12784 /* Now that we have entered the scope of the class, we must restore
12785 the bindings for any template parameters surrounding DECL1, if it
12786 is an inline member template. (Order is important; consider the
12787 case where a template parameter has the same name as a field of
12788 the class.) It is not until after this point that
12789 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12790 if (flags & SF_INCLASS_INLINE)
12791 maybe_begin_member_template_processing (decl1);
12793 /* Effective C++ rule 15. See also c_expand_return. */
12795 && DECL_NAME (decl1) == ansi_opname[(int) MODIFY_EXPR]
12796 && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
12797 cp_warning ("`operator=' should return a reference to `*this'");
12799 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12800 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12801 DECL_INITIAL (decl1) = error_mark_node;
12803 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12804 SET_DEFAULT_DECL_ATTRIBUTES (decl1, attrs);
12807 /* This function exists in static storage.
12808 (This does not mean `static' in the C sense!) */
12809 TREE_STATIC (decl1) = 1;
12811 /* We must call push_template_decl after current_class_type is set
12812 up. (If we are processing inline definitions after exiting a
12813 class scope, current_class_type will be NULL_TREE until set above
12814 by push_nested_class.) */
12815 if (processing_template_decl)
12816 decl1 = push_template_decl (decl1);
12818 /* We are now in the scope of the function being defined. */
12819 current_function_decl = decl1;
12821 /* Save the parm names or decls from this function's declarator
12822 where store_parm_decls will find them. */
12823 current_function_parms = last_function_parms;
12824 current_function_parm_tags = last_function_parm_tags;
12826 /* Make sure the parameter and return types are reasonable. When
12827 you declare a function, these types can be incomplete, but they
12828 must be complete when you define the function. */
12829 if (! processing_template_decl)
12830 check_function_type (decl1);
12832 /* Build the return declaration for the function. */
12833 restype = TREE_TYPE (fntype);
12834 if (!processing_template_decl)
12836 if (!DECL_RESULT (decl1))
12838 DECL_RESULT (decl1)
12839 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
12840 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype),
12841 DECL_RESULT (decl1));
12845 /* Just use `void'. Nobody will ever look at this anyhow. */
12846 DECL_RESULT (decl1) = build_decl (RESULT_DECL, 0, void_type_node);
12848 /* Initialize RTL machinery. We cannot do this until
12849 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12850 even when processing a template; this is how we get
12851 CURRENT_FUNCTION set up, and our per-function variables
12853 bl = current_binding_level;
12854 init_function_start (decl1, input_filename, lineno);
12855 current_binding_level = bl;
12856 expanding_p = (flags & SF_EXPAND) != 0;
12858 /* Even though we're inside a function body, we still don't want to
12859 call expand_expr to calculate the size of a variable-sized array.
12860 We haven't necessarily assigned RTL to all variables yet, so it's
12861 not safe to try to expand expressions involving them. */
12862 immediate_size_expand = 0;
12863 get_pending_sizes ();
12865 /* Let the user know we're compiling this function. */
12866 if (processing_template_decl || !building_stmt_tree ())
12867 announce_function (decl1);
12869 /* Record the decl so that the function name is defined.
12870 If we already have a decl for this name, and it is a FUNCTION_DECL,
12871 use the old decl. */
12872 if (!processing_template_decl && !(flags & SF_PRE_PARSED))
12874 /* A specialization is not used to guide overload resolution. */
12875 if ((flag_guiding_decls
12876 || !DECL_TEMPLATE_SPECIALIZATION (decl1))
12877 && ! DECL_FUNCTION_MEMBER_P (decl1))
12878 decl1 = pushdecl (decl1);
12881 /* We need to set the DECL_CONTEXT. */
12882 if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
12883 DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
12884 /* And make sure we have enough default args. */
12885 check_default_args (decl1);
12887 DECL_MAIN_VARIANT (decl1) = decl1;
12888 fntype = TREE_TYPE (decl1);
12891 /* Reset these in case the call to pushdecl changed them. */
12892 current_function_decl = decl1;
12893 current_function->decl = decl1;
12895 if (DECL_INTERFACE_KNOWN (decl1))
12897 tree ctx = hack_decl_function_context (decl1);
12899 if (DECL_NOT_REALLY_EXTERN (decl1))
12900 DECL_EXTERNAL (decl1) = 0;
12902 if (ctx != NULL_TREE && DECL_THIS_INLINE (ctx)
12903 && TREE_PUBLIC (ctx))
12904 /* This is a function in a local class in an extern inline
12906 comdat_linkage (decl1);
12908 /* If this function belongs to an interface, it is public.
12909 If it belongs to someone else's interface, it is also external.
12910 This only affects inlines and template instantiations. */
12911 else if (interface_unknown == 0
12912 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
12913 || flag_alt_external_templates))
12915 if (DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1)
12916 || processing_template_decl)
12918 DECL_EXTERNAL (decl1)
12920 || (DECL_THIS_INLINE (decl1) && ! flag_implement_inlines
12921 && !DECL_VINDEX (decl1)));
12923 /* For WIN32 we also want to put these in linkonce sections. */
12924 maybe_make_one_only (decl1);
12927 DECL_EXTERNAL (decl1) = 0;
12928 DECL_NOT_REALLY_EXTERN (decl1) = 0;
12929 DECL_INTERFACE_KNOWN (decl1) = 1;
12931 else if (interface_unknown && interface_only
12932 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
12933 || flag_alt_external_templates))
12935 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
12936 interface, we will have interface_only set but not
12937 interface_known. In that case, we don't want to use the normal
12938 heuristics because someone will supply a #pragma implementation
12939 elsewhere, and deducing it here would produce a conflict. */
12940 comdat_linkage (decl1);
12941 DECL_EXTERNAL (decl1) = 0;
12942 DECL_INTERFACE_KNOWN (decl1) = 1;
12943 DECL_DEFER_OUTPUT (decl1) = 1;
12947 /* This is a definition, not a reference.
12948 So clear DECL_EXTERNAL. */
12949 DECL_EXTERNAL (decl1) = 0;
12951 if ((DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1))
12952 && ! DECL_INTERFACE_KNOWN (decl1)
12953 /* Don't try to defer nested functions for now. */
12954 && ! hack_decl_function_context (decl1))
12955 DECL_DEFER_OUTPUT (decl1) = 1;
12957 DECL_INTERFACE_KNOWN (decl1) = 1;
12960 if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1))
12962 if (TREE_CODE (fntype) == METHOD_TYPE)
12963 TREE_TYPE (decl1) = fntype
12964 = build_function_type (TREE_TYPE (fntype),
12965 TREE_CHAIN (TYPE_ARG_TYPES (fntype)));
12966 current_function_parms = TREE_CHAIN (current_function_parms);
12967 DECL_ARGUMENTS (decl1) = current_function_parms;
12971 my_friendly_assert (current_class_ptr == NULL_TREE, 19990908);
12972 my_friendly_assert (current_class_ref == NULL_TREE, 19990908);
12975 /* If we're compiling a friend function, neither of the variables
12976 current_class_ptr nor current_class_type will have values. */
12977 if (! doing_friend)
12979 /* We know that this was set up by `grokclassfn'.
12980 We do not wait until `store_parm_decls', since evil
12981 parse errors may never get us to that point. Here
12982 we keep the consistency between `current_class_type'
12983 and `current_class_ptr'. */
12984 tree t = current_function_parms;
12987 my_friendly_assert (t != NULL_TREE
12988 && TREE_CODE (t) == PARM_DECL, 162);
12989 my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE,
12992 if (! hack_decl_function_context (decl1))
12993 temporary_allocation ();
12994 i = suspend_momentary ();
12996 /* Normally, build_indirect_ref returns current_class_ref
12997 whenever current_class_ptr is dereferenced. This time,
12998 however, we want it to *create* current_class_ref, so we
12999 temporarily clear current_class_ptr to fool it. */
13000 cp_function_chain->x_current_class_ref
13001 = build_indirect_ref (t, NULL_PTR);
13002 cp_function_chain->x_current_class_ptr = t;
13004 if (DECL_DESTRUCTOR_P (decl1))
13005 current_in_charge_parm = TREE_CHAIN (t);
13007 resume_momentary (i);
13008 if (! hack_decl_function_context (decl1))
13009 end_temporary_allocation ();
13014 current_binding_level->parm_flag = 1;
13017 cplus_decl_attributes (decl1, NULL_TREE, attrs);
13019 if (!building_stmt_tree ())
13021 GNU_xref_function (decl1, current_function_parms);
13022 make_function_rtl (decl1);
13025 /* Promote the value to int before returning it. */
13026 if (C_PROMOTING_INTEGER_TYPE_P (restype))
13027 restype = type_promotes_to (restype);
13029 /* If this fcn was already referenced via a block-scope `extern' decl
13030 (or an implicit decl), propagate certain information about the usage. */
13031 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1)))
13032 TREE_ADDRESSABLE (decl1) = 1;
13034 if (DECL_RESULT (decl1) == NULL_TREE)
13036 DECL_RESULT (decl1)
13037 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13038 TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype);
13039 TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype);
13042 /* Allocate further tree nodes temporarily during compilation
13043 of this function only. Tiemann moved up here from bottom of fn. */
13044 /* If this is a nested function, then we must continue to allocate RTL
13045 on the permanent obstack in case we need to inline it later. */
13046 if (! hack_decl_function_context (decl1))
13047 temporary_allocation ();
13049 /* Make sure that we always have a momntary obstack while we're in a
13053 if (building_stmt_tree ())
13054 begin_stmt_tree (decl1);
13058 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1))
13059 && DECL_LANGUAGE (decl1) == lang_cplusplus)
13061 dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13062 ctor_label = NULL_TREE;
13066 dtor_label = NULL_TREE;
13067 if (DECL_CONSTRUCTOR_P (decl1))
13068 ctor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13074 /* Called after store_parm_decls for a function-try-block. We need to update
13075 last_parm_cleanup_insn so that the base initializers for a constructor
13076 are run within this block, not before it. */
13079 expand_start_early_try_stmts ()
13081 expand_start_try_stmts ();
13082 last_parm_cleanup_insn = get_last_insn ();
13085 /* Store the parameter declarations into the current function declaration.
13086 This is called after parsing the parameter declarations, before
13087 digesting the body of the function.
13089 Also install to binding contour return value identifier, if any. */
13092 store_parm_decls ()
13094 register tree fndecl = current_function_decl;
13095 register tree parm;
13096 int parms_have_cleanups = 0;
13097 tree cleanups = NULL_TREE;
13099 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13100 tree specparms = current_function_parms;
13102 /* This is a list of types declared among parms in a prototype. */
13103 tree parmtags = current_function_parm_tags;
13105 /* This is a chain of any other decls that came in among the parm
13106 declarations. If a parm is declared with enum {foo, bar} x;
13107 then CONST_DECLs for foo and bar are put here. */
13108 tree nonparms = NULL_TREE;
13110 if (toplevel_bindings_p ())
13111 fatal ("parse errors have confused me too much");
13113 /* Create a binding level for the parms. */
13114 expand_start_bindings (0);
13116 if (specparms != NULL_TREE)
13118 /* This case is when the function was defined with an ANSI prototype.
13119 The parms already have decls, so we need not do anything here
13120 except record them as in effect
13121 and complain if any redundant old-style parm decls were written. */
13123 register tree next;
13125 /* Must clear this because it might contain TYPE_DECLs declared
13127 storedecls (NULL_TREE);
13129 for (parm = nreverse (specparms); parm; parm = next)
13131 next = TREE_CHAIN (parm);
13132 if (TREE_CODE (parm) == PARM_DECL)
13135 if (DECL_NAME (parm) == NULL_TREE)
13139 else if (TREE_CODE (TREE_TYPE (parm)) == VOID_TYPE)
13140 cp_error ("parameter `%D' declared void", parm);
13143 if (! building_stmt_tree ()
13144 && (cleanup = maybe_build_cleanup (parm), cleanup))
13146 expand_decl (parm);
13147 parms_have_cleanups = 1;
13149 /* Keep track of the cleanups. */
13150 cleanups = tree_cons (parm, cleanup, cleanups);
13155 /* If we find an enum constant or a type tag,
13156 put it aside for the moment. */
13157 TREE_CHAIN (parm) = NULL_TREE;
13158 nonparms = chainon (nonparms, parm);
13162 /* Get the decls in their original chain order
13163 and record in the function. This is all and only the
13164 PARM_DECLs that were pushed into scope by the loop above. */
13165 DECL_ARGUMENTS (fndecl) = getdecls ();
13167 storetags (chainon (parmtags, gettags ()));
13170 DECL_ARGUMENTS (fndecl) = NULL_TREE;
13172 /* Now store the final chain of decls for the arguments
13173 as the decl-chain of the current lexical scope.
13174 Put the enumerators in as well, at the front so that
13175 DECL_ARGUMENTS is not modified. */
13177 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13179 /* Initialize the RTL code for the function. */
13180 DECL_SAVED_INSNS (fndecl) = 0;
13181 if (! building_stmt_tree ())
13182 expand_function_start (fndecl, parms_have_cleanups);
13184 current_function_parms_stored = 1;
13186 /* If this function is `main', emit a call to `__main'
13187 to run global initializers, etc. */
13188 if (DECL_MAIN_P (fndecl) && !building_stmt_tree ())
13189 expand_main_function ();
13191 /* Now that we have initialized the parms, we can start their
13192 cleanups. We cannot do this before, since expand_decl_cleanup
13193 should not be called before the parm can be used. */
13194 if (cleanups && !building_stmt_tree ())
13196 for (cleanups = nreverse (cleanups);
13198 cleanups = TREE_CHAIN (cleanups))
13200 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups),
13201 TREE_VALUE (cleanups)))
13202 cp_error ("parser lost in parsing declaration of `%D'",
13203 TREE_PURPOSE (cleanups));
13207 /* Create a binding contour which can be used to catch
13208 cleanup-generated temporaries. Also, if the return value needs or
13209 has initialization, deal with that now. */
13210 if (parms_have_cleanups)
13213 if (!building_stmt_tree ())
13214 expand_start_bindings (0);
13217 if (! building_stmt_tree () && flag_exceptions)
13219 /* Do the starting of the exception specifications, if we have any. */
13220 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13221 expand_start_eh_spec ();
13224 last_parm_cleanup_insn = get_last_insn ();
13225 last_dtor_insn = get_last_insn ();
13228 /* Bind a name and initialization to the return value of
13229 the current function. */
13232 store_return_init (decl)
13235 /* If this named return value comes in a register, put it in a
13236 pseudo-register. */
13237 if (DECL_REGISTER (decl))
13239 original_result_rtx = DECL_RTL (decl);
13240 DECL_RTL (decl) = gen_reg_rtx (DECL_MODE (decl));
13245 /* We have finished doing semantic analysis on DECL, but have not yet
13246 generated RTL for its body. Save away our current state, so that
13247 when we want to generate RTL later we know what to do. */
13250 save_function_data (decl)
13253 struct language_function *f;
13255 /* Save the language-specific per-function data so that we can
13256 get it back when we really expand this function. */
13257 my_friendly_assert (!DECL_PENDING_INLINE_P (decl),
13261 f = ((struct language_function *)
13262 xmalloc (sizeof (struct language_function)));
13263 bcopy ((char *) cp_function_chain, (char *) f,
13264 sizeof (struct language_function));
13265 DECL_SAVED_FUNCTION_DATA (decl) = f;
13267 /* Clear out the bits we don't need. */
13268 f->x_base_init_list = NULL_TREE;
13269 f->x_member_init_list = NULL_TREE;
13270 f->x_last_tree = NULL_TREE;
13271 f->x_last_expr_type = NULL_TREE;
13272 f->x_last_dtor_insn = NULL_RTX;
13273 f->x_last_parm_cleanup_insn = NULL_RTX;
13274 f->x_result_rtx = NULL_RTX;
13275 f->x_named_label_uses = NULL;
13276 f->bindings = NULL;
13278 /* When we get back here again, we will be expanding. */
13279 f->x_expanding_p = 1;
13282 /* Finish up a function declaration and compile that function
13283 all the way to assembler language output. The free the storage
13284 for the function definition.
13286 This is called after parsing the body of the function definition.
13287 LINENO is the current line number.
13289 FLAGS is a bitwise or of the following values:
13291 An extra call to poplevel (and expand_end_bindings) must be
13292 made to take care of the binding contour for the base
13293 initializers. This is only relevant for constructors.
13295 We just finished processing the body of an in-class inline
13296 function definition. (This processing will have taken place
13297 after the class definition is complete.) */
13300 finish_function (lineno, flags)
13304 register tree fndecl = current_function_decl;
13305 tree fntype, ctype = NULL_TREE;
13306 rtx fn_last_parm_insn, insns;
13307 /* Label to use if this function is supposed to return a value. */
13308 tree no_return_label = NULL_TREE;
13309 tree decls = NULL_TREE;
13310 int call_poplevel = (flags & 1) != 0;
13311 int inclass_inline = (flags & 2) != 0;
13315 /* When we get some parse errors, we can end up without a
13316 current_function_decl, so cope. */
13317 if (fndecl == NULL_TREE)
13318 return error_mark_node;
13320 nested = function_depth > 1;
13321 fntype = TREE_TYPE (fndecl);
13323 /* TREE_READONLY (fndecl) = 1;
13324 This caused &foo to be of type ptr-to-const-function
13325 which then got a warning when stored in a ptr-to-function variable. */
13327 /* This happens on strange parse errors. */
13328 if (! current_function_parms_stored)
13331 store_parm_decls ();
13334 if (building_stmt_tree ())
13336 if (DECL_CONSTRUCTOR_P (fndecl) && call_poplevel)
13338 decls = getdecls ();
13339 expand_end_bindings (decls, decls != NULL_TREE, 0);
13340 poplevel (decls != NULL_TREE, 0, 0);
13343 /* Because we do not call expand_function_end, we won't call
13344 expand_end_bindings to match the call to
13345 expand_start_bindings we did in store_parm_decls. Therefore,
13346 we explicitly call expand_end_bindings here. However, we
13347 really shouldn't be calling expand_start_bindings at all when
13348 building_stmt_tree; it's conceptually an RTL-generation
13349 function, rather than a front-end function. */
13350 expand_end_bindings (0, 0, 0);
13354 if (write_symbols != NO_DEBUG /*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13356 tree ttype = target_type (fntype);
13359 if (IS_AGGR_TYPE (ttype))
13360 /* Let debugger know it should output info for this type. */
13361 note_debug_info_needed (ttype);
13363 for (parmdecl = DECL_ARGUMENTS (fndecl); parmdecl; parmdecl = TREE_CHAIN (parmdecl))
13365 ttype = target_type (TREE_TYPE (parmdecl));
13366 if (IS_AGGR_TYPE (ttype))
13367 /* Let debugger know it should output info for this type. */
13368 note_debug_info_needed (ttype);
13372 /* Clean house because we will need to reorder insns here. */
13373 do_pending_stack_adjust ();
13377 tree binfo = TYPE_BINFO (current_class_type);
13378 tree cond = integer_one_node;
13381 int ok_to_optimize_dtor = 0;
13382 int empty_dtor = get_last_insn () == last_dtor_insn;
13384 if (current_function_assigns_this)
13385 cond = build (NE_EXPR, boolean_type_node,
13386 current_class_ptr, integer_zero_node);
13389 int n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
13391 /* If this destructor is empty, then we don't need to check
13392 whether `this' is NULL in some cases. */
13393 if ((flag_this_is_variable & 1) == 0)
13394 ok_to_optimize_dtor = 1;
13395 else if (empty_dtor)
13396 ok_to_optimize_dtor
13397 = (n_baseclasses == 0
13398 || (n_baseclasses == 1
13399 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type, 0))));
13402 /* These initializations might go inline. Protect
13403 the binding level of the parms. */
13405 expand_start_bindings (0);
13407 if (current_function_assigns_this)
13409 current_function_assigns_this = 0;
13410 current_function_just_assigned_this = 0;
13413 /* Generate the code to call destructor on base class.
13414 If this destructor belongs to a class with virtual
13415 functions, then set the virtual function table
13416 pointer to represent the type of our base class. */
13418 /* This side-effect makes call to `build_delete' generate the
13419 code we have to have at the end of this destructor.
13420 `build_delete' will set the flag again. */
13421 TYPE_HAS_DESTRUCTOR (current_class_type) = 0;
13423 /* These are two cases where we cannot delegate deletion. */
13424 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)
13425 || TYPE_GETS_REG_DELETE (current_class_type))
13426 exprstmt = build_delete (current_class_type, current_class_ref, integer_zero_node,
13427 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL, 0);
13429 exprstmt = build_delete (current_class_type,
13431 current_in_charge_parm,
13432 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL, 0);
13434 /* If we did not assign to this, then `this' is non-zero at
13435 the end of a destructor. As a special optimization, don't
13436 emit test if this is an empty destructor. If it does nothing,
13437 it does nothing. If it calls a base destructor, the base
13438 destructor will perform the test. */
13440 if (exprstmt != error_mark_node
13441 && (TREE_CODE (exprstmt) != NOP_EXPR
13442 || TREE_OPERAND (exprstmt, 0) != integer_zero_node
13443 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)))
13445 expand_label (dtor_label);
13446 if (cond != integer_one_node)
13447 expand_start_cond (cond, 0);
13448 if (exprstmt != void_zero_node)
13449 /* Don't call `expand_expr_stmt' if we're not going to do
13450 anything, since -Wall will give a diagnostic. */
13451 expand_expr_stmt (exprstmt);
13453 /* Run destructor on all virtual baseclasses. */
13454 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13456 tree vbases = nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type)));
13457 expand_start_cond (build (BIT_AND_EXPR, integer_type_node,
13458 current_in_charge_parm,
13459 integer_two_node), 0);
13462 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases)))
13464 tree vb = get_vbase
13465 (BINFO_TYPE (vbases),
13466 TYPE_BINFO (current_class_type));
13468 (build_scoped_method_call
13469 (current_class_ref, vb, dtor_identifier,
13470 build_expr_list (NULL_TREE, integer_zero_node)));
13472 vbases = TREE_CHAIN (vbases);
13474 expand_end_cond ();
13477 do_pending_stack_adjust ();
13478 if (cond != integer_one_node)
13479 expand_end_cond ();
13482 virtual_size = c_sizeof (current_class_type);
13484 /* At the end, call delete if that's what's requested. */
13486 /* FDIS sez: At the point of definition of a virtual destructor
13487 (including an implicit definition), non-placement operator
13488 delete shall be looked up in the scope of the destructor's
13489 class and if found shall be accessible and unambiguous.
13491 This is somewhat unclear, but I take it to mean that if the
13492 class only defines placement deletes we don't do anything here.
13493 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13494 for us if they ever try to delete one of these. */
13496 if (TYPE_GETS_REG_DELETE (current_class_type)
13497 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13498 exprstmt = build_op_delete_call
13499 (DELETE_EXPR, current_class_ptr, virtual_size,
13500 LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
13502 exprstmt = NULL_TREE;
13506 cond = build (BIT_AND_EXPR, integer_type_node,
13507 current_in_charge_parm, integer_one_node);
13508 expand_start_cond (cond, 0);
13509 expand_expr_stmt (exprstmt);
13510 expand_end_cond ();
13513 /* End of destructor. */
13514 expand_end_bindings (NULL_TREE, getdecls () != NULL_TREE, 0);
13515 poplevel (getdecls () != NULL_TREE, 0, 0);
13517 /* Back to the top of destructor. */
13518 /* Don't execute destructor code if `this' is NULL. */
13522 /* If the dtor is empty, and we know there is not possible way we
13523 could use any vtable entries, before they are possibly set by
13524 a base class dtor, we don't have to setup the vtables, as we
13525 know that any base class dtoring will set up any vtables it
13526 needs. We avoid MI, because one base class dtor can do a
13527 virtual dispatch to an overridden function that would need to
13528 have a non-related vtable set up, we cannot avoid setting up
13529 vtables in that case. We could change this to see if there is
13530 just one vtable. */
13531 if (! empty_dtor || TYPE_USES_COMPLEX_INHERITANCE (current_class_type))
13533 /* Make all virtual function table pointers in non-virtual base
13534 classes point to CURRENT_CLASS_TYPE's virtual function
13536 expand_direct_vtbls_init (binfo, binfo, 1, 0, current_class_ptr);
13538 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13539 expand_indirect_vtbls_init (binfo, current_class_ref, current_class_ptr);
13542 if (! ok_to_optimize_dtor)
13544 cond = build_binary_op (NE_EXPR,
13545 current_class_ptr, integer_zero_node);
13546 expand_start_cond (cond, 0);
13549 insns = get_insns ();
13552 fn_last_parm_insn = get_first_nonparm_insn ();
13553 if (fn_last_parm_insn == NULL_RTX)
13554 fn_last_parm_insn = get_last_insn ();
13556 fn_last_parm_insn = previous_insn (fn_last_parm_insn);
13558 emit_insns_after (insns, fn_last_parm_insn);
13560 if (! ok_to_optimize_dtor)
13561 expand_end_cond ();
13563 else if (current_function_assigns_this)
13565 /* Does not need to call emit_base_init, because
13566 that is done (if needed) just after assignment to this
13569 if (DECL_CONSTRUCTOR_P (current_function_decl))
13571 end_protect_partials ();
13572 expand_label (ctor_label);
13573 ctor_label = NULL_TREE;
13577 decls = getdecls ();
13578 expand_end_bindings (decls, decls != NULL_TREE, 0);
13579 poplevel (decls != NULL_TREE, 0, 0);
13581 /* c_expand_return knows to return 'this' from a constructor. */
13582 c_expand_return (NULL_TREE);
13584 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl))) != VOID_TYPE
13585 && return_label != NULL_RTX)
13586 no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13588 current_function_assigns_this = 0;
13589 current_function_just_assigned_this = 0;
13590 base_init_expr = NULL_TREE;
13592 else if (DECL_CONSTRUCTOR_P (fndecl))
13594 tree cond = NULL_TREE, thenclause = NULL_TREE;
13595 /* Allow constructor for a type to get a new instance of the object
13596 using `build_new'. */
13597 tree abstract_virtuals = CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type);
13598 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type) = NULL_TREE;
13600 if (flag_this_is_variable > 0)
13602 cond = build_binary_op (EQ_EXPR,
13603 current_class_ptr, integer_zero_node);
13604 thenclause = build_modify_expr (current_class_ptr, NOP_EXPR,
13605 build_new (NULL_TREE, current_class_type, void_type_node, 0));
13608 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type) = abstract_virtuals;
13612 if (flag_this_is_variable > 0)
13614 expand_start_cond (cond, 0);
13615 expand_expr_stmt (thenclause);
13616 expand_end_cond ();
13619 /* Emit insns from `emit_base_init' which sets up virtual
13620 function table pointer(s). */
13621 if (base_init_expr)
13623 expand_expr_stmt (base_init_expr);
13624 base_init_expr = NULL_TREE;
13627 insns = get_insns ();
13630 /* This is where the body of the constructor begins. */
13632 emit_insns_after (insns, last_parm_cleanup_insn);
13634 end_protect_partials ();
13636 /* This is where the body of the constructor ends. */
13637 expand_label (ctor_label);
13638 ctor_label = NULL_TREE;
13642 decls = getdecls ();
13643 expand_end_bindings (decls, decls != NULL_TREE, 0);
13644 poplevel (decls != NULL_TREE, 1, 0);
13647 /* c_expand_return knows to return 'this' from a constructor. */
13648 c_expand_return (NULL_TREE);
13650 current_function_assigns_this = 0;
13651 current_function_just_assigned_this = 0;
13653 else if (DECL_MAIN_P (fndecl))
13655 /* Make it so that `main' always returns 0 by default. */
13657 c_expand_return (integer_one_node);
13659 c_expand_return (integer_zero_node);
13662 else if (return_label != NULL_RTX
13663 && current_function_return_value == NULL_TREE
13664 && ! DECL_NAME (DECL_RESULT (current_function_decl)))
13665 no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13667 if (flag_exceptions)
13668 expand_exception_blocks ();
13670 /* If this function is supposed to return a value, ensure that
13671 we do not fall into the cleanups by mistake. The end of our
13672 function will look like this:
13674 user code (may have return stmt somewhere)
13675 goto no_return_label
13680 NOTE_INSN_FUNCTION_END
13684 If the user omits a return stmt in the USER CODE section, we
13685 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13686 Otherwise, we won't. */
13687 if (no_return_label)
13689 DECL_CONTEXT (no_return_label) = fndecl;
13690 DECL_INITIAL (no_return_label) = error_mark_node;
13691 DECL_SOURCE_FILE (no_return_label) = input_filename;
13692 DECL_SOURCE_LINE (no_return_label) = lineno;
13693 expand_goto (no_return_label);
13698 /* Remove the binding contour which is used
13699 to catch cleanup-generated temporaries. */
13700 expand_end_bindings (0, 0, 0);
13701 poplevel (0, 0, 0);
13703 /* Emit label at beginning of cleanup code for parameters. */
13704 emit_label (cleanup_label);
13707 /* Get return value into register if that's where it's supposed
13709 if (original_result_rtx)
13710 fixup_result_decl (DECL_RESULT (fndecl), original_result_rtx);
13712 /* Finish building code that will trigger warnings if users forget
13713 to make their functions return values. */
13714 if (no_return_label || cleanup_label)
13715 emit_jump (return_label);
13716 if (no_return_label)
13718 /* We don't need to call `expand_*_return' here because we
13719 don't need any cleanups here--this path of code is only
13720 for error checking purposes. */
13721 expand_label (no_return_label);
13724 /* We hard-wired immediate_size_expand to zero in
13725 start_function. Expand_function_end will decrement this
13726 variable. So, we set the variable to one here, so that after
13727 the decrement it will remain zero. */
13728 immediate_size_expand = 1;
13730 /* Generate rtl for function exit. */
13731 expand_function_end (input_filename, lineno, 1);
13734 /* We have to save this value here in case
13735 maybe_end_member_template_processing decides to pop all the
13736 template parameters. */
13737 expand_p = !building_stmt_tree ();
13739 /* If we're saving up tree structure, tie off the function now. */
13741 finish_stmt_tree (fndecl);
13743 /* This must come after expand_function_end because cleanups might
13744 have declarations (from inline functions) that need to go into
13745 this function's blocks. */
13746 if (current_binding_level->parm_flag != 1)
13747 my_friendly_abort (122);
13748 poplevel (1, 0, 1);
13750 /* Remember that we were in class scope. */
13751 if (current_class_name)
13752 ctype = current_class_type;
13754 /* Must mark the RESULT_DECL as being in this function. */
13755 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
13757 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13758 to the FUNCTION_DECL node itself. */
13759 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
13761 /* Undo the call to push_momentary in start_function. */
13764 /* Save away current state, if appropriate. */
13765 if (!expanding_p && !processing_template_decl)
13766 save_function_data (fndecl);
13772 int saved_flag_keep_inline_functions =
13773 flag_keep_inline_functions;
13775 /* So we can tell if jump_optimize sets it to 1. */
13778 if (DECL_CONTEXT (fndecl) != NULL_TREE
13779 && hack_decl_function_context (fndecl))
13780 /* Trick rest_of_compilation into not deferring output of this
13781 function, even if it is inline, since the rtl_obstack for
13782 this function is the function_obstack of the enclosing
13783 function and will be deallocated when the enclosing
13784 function is gone. See save_tree_status. */
13785 flag_keep_inline_functions = 1;
13787 /* Before we call rest_of_compilation (which will pop the
13788 CURRENT_FUNCTION), we must save these values. */
13789 returns_null = current_function_returns_null;
13790 returns_value = current_function_returns_value;
13792 /* If this is a nested function (like a template instantiation
13793 that we're compiling in the midst of compiling something
13794 else), push a new GC context. That will keep local variables
13795 on the stack from being collected while we're doing the
13796 compilation of this function. */
13797 if (function_depth > 1)
13798 ggc_push_context ();
13800 /* Run the optimizers and output the assembler code for this
13802 if (DECL_ARTIFICIAL (fndecl))
13804 /* Do we really *want* to inline this synthesized method? */
13806 int save_fif = flag_inline_functions;
13807 flag_inline_functions = 1;
13809 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13810 will check our size. */
13811 DECL_INLINE (fndecl) = 0;
13813 rest_of_compilation (fndecl);
13814 flag_inline_functions = save_fif;
13817 rest_of_compilation (fndecl);
13819 /* Undo the call to ggc_push_context above. */
13820 if (function_depth > 1)
13821 ggc_pop_context ();
13823 flag_keep_inline_functions = saved_flag_keep_inline_functions;
13825 if (DECL_SAVED_INSNS (fndecl) && ! TREE_ASM_WRITTEN (fndecl))
13827 /* Set DECL_EXTERNAL so that assemble_external will be called as
13828 necessary. We'll clear it again in finish_file. */
13829 if (! DECL_EXTERNAL (fndecl))
13830 DECL_NOT_REALLY_EXTERN (fndecl) = 1;
13831 DECL_EXTERNAL (fndecl) = 1;
13832 mark_inline_for_output (fndecl);
13835 if (ctype && TREE_ASM_WRITTEN (fndecl))
13836 note_debug_info_needed (ctype);
13838 returns_null |= can_reach_end;
13840 /* Since we don't normally go through c_expand_return for constructors,
13841 this normally gets the wrong value.
13842 Also, named return values have their return codes emitted after
13843 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13844 if (DECL_CONSTRUCTOR_P (fndecl)
13845 || DECL_NAME (DECL_RESULT (fndecl)) != NULL_TREE)
13848 if (TREE_THIS_VOLATILE (fndecl) && returns_null)
13849 cp_warning ("`noreturn' function `%D' does return", fndecl);
13850 else if ((warn_return_type || pedantic)
13852 && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE)
13854 /* If this function returns non-void and control can drop through,
13856 cp_warning ("control reaches end of non-void function `%D'", fndecl);
13858 /* With just -W, complain only if function returns both with
13859 and without a value. */
13860 else if (extra_warnings && returns_value && returns_null)
13861 warning ("this function may return with or without a value");
13865 /* Since we never call rest_of_compilation, we never clear
13866 CURRENT_FUNCTION. Do so explicitly. */
13867 free_after_compilation (current_function);
13868 current_function = NULL;
13871 /* If this is a in-class inline definition, we may have to pop the
13872 bindings for the template parameters that we added in
13873 maybe_begin_member_template_processing when start_function was
13875 if (inclass_inline)
13876 maybe_end_member_template_processing ();
13878 /* Leave the scope of the class. */
13880 pop_nested_class ();
13884 /* Free all the tree nodes making up this function. */
13885 /* Switch back to allocating nodes permanently
13886 until we start another function. */
13888 permanent_allocation (1);
13890 if (DECL_SAVED_INSNS (fndecl) == 0)
13894 /* Stop pointing to the local nodes about to be freed. */
13895 /* But DECL_INITIAL must remain nonzero so we know this
13896 was an actual function definition. */
13897 DECL_INITIAL (fndecl) = error_mark_node;
13898 for (t = DECL_ARGUMENTS (fndecl); t; t = TREE_CHAIN (t))
13899 DECL_RTL (t) = DECL_INCOMING_RTL (t) = NULL_RTX;
13902 if (DECL_STATIC_CONSTRUCTOR (fndecl))
13903 static_ctors = tree_cons (NULL_TREE, fndecl, static_ctors);
13904 if (DECL_STATIC_DESTRUCTOR (fndecl))
13905 static_dtors = tree_cons (NULL_TREE, fndecl, static_dtors);
13910 /* Let the error reporting routines know that we're outside a
13911 function. For a nested function, this value is used in
13912 pop_cp_function_context and then reset via pop_function_context. */
13913 current_function_decl = NULL_TREE;
13919 /* Create the FUNCTION_DECL for a function definition.
13920 DECLSPECS and DECLARATOR are the parts of the declaration;
13921 they describe the return type and the name of the function,
13922 but twisted together in a fashion that parallels the syntax of C.
13924 This function creates a binding context for the function body
13925 as well as setting up the FUNCTION_DECL in current_function_decl.
13927 Returns a FUNCTION_DECL on success.
13929 If the DECLARATOR is not suitable for a function (it defines a datum
13930 instead), we return 0, which tells yyparse to report a parse error.
13932 May return void_type_node indicating that this method is actually
13933 a friend. See grokfield for more details.
13935 Came here with a `.pushlevel' .
13937 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13938 CHANGES TO CODE IN `grokfield'. */
13941 start_method (declspecs, declarator, attrlist)
13942 tree declarator, declspecs, attrlist;
13944 tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
13947 /* Something too ugly to handle. */
13948 if (fndecl == NULL_TREE)
13951 /* Pass friends other than inline friend functions back. */
13952 if (fndecl == void_type_node)
13955 if (TREE_CODE (fndecl) != FUNCTION_DECL)
13956 /* Not a function, tell parser to report parse error. */
13959 if (DECL_IN_AGGR_P (fndecl))
13961 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
13963 if (DECL_CONTEXT (fndecl)
13964 && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
13965 cp_error ("`%D' is already defined in class %s", fndecl,
13966 TYPE_NAME_STRING (DECL_CONTEXT (fndecl)));
13968 return void_type_node;
13971 check_template_shadow (fndecl);
13973 DECL_THIS_INLINE (fndecl) = 1;
13975 if (flag_default_inline)
13976 DECL_INLINE (fndecl) = 1;
13978 /* We process method specializations in finish_struct_1. */
13979 if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
13980 fndecl = push_template_decl (fndecl);
13982 /* We read in the parameters on the maybepermanent_obstack,
13983 but we won't be getting back to them until after we
13984 may have clobbered them. So the call to preserve_data
13985 will keep them safe. */
13988 if (! DECL_FRIEND_P (fndecl))
13990 if (TREE_CHAIN (fndecl))
13992 fndecl = copy_node (fndecl);
13993 TREE_CHAIN (fndecl) = NULL_TREE;
13996 if (DECL_CONSTRUCTOR_P (fndecl))
13998 if (! grok_ctor_properties (current_class_type, fndecl))
13999 return void_type_node;
14001 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl)))
14002 grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0);
14005 cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0, 0);
14007 /* Make a place for the parms */
14009 current_binding_level->parm_flag = 1;
14011 DECL_IN_AGGR_P (fndecl) = 1;
14015 /* Go through the motions of finishing a function definition.
14016 We don't compile this method until after the whole class has
14019 FINISH_METHOD must return something that looks as though it
14020 came from GROKFIELD (since we are defining a method, after all).
14022 This is called after parsing the body of the function definition.
14023 STMTS is the chain of statements that makes up the function body.
14025 DECL is the ..._DECL that `start_method' provided. */
14028 finish_method (decl)
14031 register tree fndecl = decl;
14034 register tree link;
14036 if (decl == void_type_node)
14039 old_initial = DECL_INITIAL (fndecl);
14041 /* Undo the level for the parms (from start_method).
14042 This is like poplevel, but it causes nothing to be
14043 saved. Saving information here confuses symbol-table
14044 output routines. Besides, this information will
14045 be correctly output when this method is actually
14048 /* Clear out the meanings of the local variables of this level;
14049 also record in each decl which block it belongs to. */
14051 for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14053 if (DECL_NAME (link) != NULL_TREE)
14054 pop_binding (DECL_NAME (link), link);
14055 my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14056 DECL_CONTEXT (link) = NULL_TREE;
14059 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
14060 (HOST_WIDE_INT) current_binding_level->level_chain,
14061 current_binding_level->parm_flag,
14062 current_binding_level->keep);
14064 poplevel (0, 0, 0);
14066 DECL_INITIAL (fndecl) = old_initial;
14068 /* We used to check if the context of FNDECL was different from
14069 current_class_type as another way to get inside here. This didn't work
14070 for String.cc in libg++. */
14071 if (DECL_FRIEND_P (fndecl))
14073 CLASSTYPE_INLINE_FRIENDS (current_class_type)
14074 = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14075 decl = void_type_node;
14081 /* Called when a new struct TYPE is defined.
14082 If this structure or union completes the type of any previous
14083 variable declaration, lay it out and output its rtl. */
14086 hack_incomplete_structures (type)
14091 if (current_binding_level->incomplete == NULL_TREE)
14094 if (!type) /* Don't do this for class templates. */
14097 for (list = ¤t_binding_level->incomplete; *list; )
14099 tree decl = TREE_VALUE (*list);
14100 if ((decl && TREE_TYPE (decl) == type)
14101 || (TREE_TYPE (decl)
14102 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14103 && TREE_TYPE (TREE_TYPE (decl)) == type))
14105 int toplevel = toplevel_bindings_p ();
14106 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14107 && TREE_TYPE (TREE_TYPE (decl)) == type)
14108 layout_type (TREE_TYPE (decl));
14109 layout_decl (decl, 0);
14110 rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0);
14114 expand_decl (decl);
14115 cleanup = maybe_build_cleanup (decl);
14116 expand_decl_init (decl);
14117 if (! expand_decl_cleanup (decl, cleanup))
14118 cp_error ("parser lost in parsing declaration of `%D'",
14121 *list = TREE_CHAIN (*list);
14124 list = &TREE_CHAIN (*list);
14128 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14129 See build_delete for information about AUTO_DELETE.
14131 Don't build these on the momentary obstack; they must live
14132 the life of the binding contour. */
14135 maybe_build_cleanup_1 (decl, auto_delete)
14136 tree decl, auto_delete;
14138 tree type = TREE_TYPE (decl);
14139 if (type != error_mark_node && TYPE_NEEDS_DESTRUCTOR (type))
14141 int temp = 0, flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14144 if (TREE_CODE (decl) != PARM_DECL)
14145 temp = suspend_momentary ();
14147 if (TREE_CODE (type) == ARRAY_TYPE)
14151 mark_addressable (decl);
14152 rval = build_unary_op (ADDR_EXPR, decl, 0);
14155 /* Optimize for space over speed here. */
14156 if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14157 || flag_expensive_optimizations)
14158 flags |= LOOKUP_NONVIRTUAL;
14160 rval = build_delete (TREE_TYPE (rval), rval, auto_delete, flags, 0);
14162 if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14163 && ! TYPE_HAS_DESTRUCTOR (type))
14164 rval = build_compound_expr (tree_cons (NULL_TREE, rval,
14165 build_expr_list (NULL_TREE, build_vbase_delete (type, decl))));
14167 if (TREE_CODE (decl) != PARM_DECL)
14168 resume_momentary (temp);
14175 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
14178 build_target_expr (decl, value)
14184 t = build (TARGET_EXPR, TREE_TYPE (decl), decl, value,
14185 maybe_build_cleanup (decl), NULL_TREE);
14186 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
14187 ignore the TARGET_EXPR. If there really turn out to be no
14188 side-effects, then the optimizer should be able to get rid of
14189 whatever code is generated anyhow. */
14190 TREE_SIDE_EFFECTS (t) = 1;
14195 /* If DECL is of a type which needs a cleanup, build that cleanup
14196 here. The cleanup does free the storage with a call to delete. */
14199 maybe_build_cleanup_and_delete (decl)
14202 return maybe_build_cleanup_1 (decl, integer_three_node);
14205 /* If DECL is of a type which needs a cleanup, build that cleanup
14206 here. The cleanup does not free the storage with a call a delete. */
14209 maybe_build_cleanup (decl)
14212 return maybe_build_cleanup_1 (decl, integer_two_node);
14215 /* Expand a C++ expression at the statement level.
14216 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14217 The C++ type checker should get all of these out when
14218 expressions are combined with other, type-providing, expressions,
14219 leaving only orphan expressions, such as:
14221 &class::bar; / / takes its address, but does nothing with it. */
14224 cplus_expand_expr_stmt (exp)
14227 if (stmts_are_full_exprs_p)
14228 exp = convert_to_void (exp, "statement");
14231 /* We should do this eventually, but right now this causes regex.o from
14232 libg++ to miscompile, and tString to core dump. */
14233 exp = build1 (CLEANUP_POINT_EXPR, TREE_TYPE (exp), exp);
14236 /* If we don't do this, we end up down inside expand_expr
14237 trying to do TYPE_MODE on the ERROR_MARK, and really
14238 go outside the bounds of the type. */
14239 if (exp != error_mark_node)
14240 expand_expr_stmt (break_out_cleanups (exp));
14243 /* When a stmt has been parsed, this function is called. */
14248 if (!current_function_assigns_this
14249 && current_function_just_assigned_this)
14251 if (DECL_CONSTRUCTOR_P (current_function_decl)
14252 && !building_stmt_tree ())
14254 /* Constructors must wait until we are out of control
14255 zones before calling base constructors. */
14256 if (in_control_zone_p ())
14258 expand_expr_stmt (base_init_expr);
14259 check_base_init (current_class_type);
14261 current_function_assigns_this = 1;
14264 /* Always assume this statement was not an expression statement. If
14265 it actually was an expression statement, its our callers
14266 responsibility to fix this up. */
14267 last_expr_type = NULL_TREE;
14270 /* Change a static member function definition into a FUNCTION_TYPE, instead
14271 of the METHOD_TYPE that we create when it's originally parsed.
14273 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14274 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14275 other decls. Either pass the addresses of local variables or NULL. */
14278 revert_static_member_fn (decl, fn, argtypes)
14279 tree *decl, *fn, *argtypes;
14282 tree function = fn ? *fn : TREE_TYPE (*decl);
14283 tree args = argtypes ? *argtypes : TYPE_ARG_TYPES (function);
14285 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args)))
14286 != TYPE_UNQUALIFIED)
14287 cp_error ("static member function `%#D' declared with type qualifiers",
14290 args = TREE_CHAIN (args);
14291 tmp = build_function_type (TREE_TYPE (function), args);
14292 tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function));
14293 tmp = build_exception_variant (tmp,
14294 TYPE_RAISES_EXCEPTIONS (function));
14295 TREE_TYPE (*decl) = tmp;
14296 if (DECL_ARGUMENTS (*decl))
14297 DECL_ARGUMENTS (*decl) = TREE_CHAIN (DECL_ARGUMENTS (*decl));
14298 DECL_STATIC_FUNCTION_P (*decl) = 1;
14305 /* Initialize the variables used during compilation of a C++
14309 push_cp_function_context (f)
14310 struct function *f;
14312 struct language_function *p
14313 = ((struct language_function *)
14314 xcalloc (1, sizeof (struct language_function)));
14317 /* For now, we always assume we're expanding all the way to RTL
14318 unless we're explicitly doing otherwise. */
14321 /* Whenever we start a new function, we destroy temporaries in the
14323 stmts_are_full_exprs_p = 1;
14326 /* Free the language-specific parts of F, now that we've finished
14327 compiling the function. */
14330 pop_cp_function_context (f)
14331 struct function *f;
14333 free (f->language);
14337 /* Mark P for GC. */
14340 mark_lang_function (p)
14341 struct language_function *p;
14346 ggc_mark_tree (p->x_named_labels);
14347 ggc_mark_tree (p->x_ctor_label);
14348 ggc_mark_tree (p->x_dtor_label);
14349 ggc_mark_tree (p->x_base_init_list);
14350 ggc_mark_tree (p->x_member_init_list);
14351 ggc_mark_tree (p->x_base_init_expr);
14352 ggc_mark_tree (p->x_current_class_ptr);
14353 ggc_mark_tree (p->x_current_class_ref);
14354 ggc_mark_tree (p->x_last_tree);
14355 ggc_mark_tree (p->x_last_expr_type);
14357 ggc_mark_rtx (p->x_last_dtor_insn);
14358 ggc_mark_rtx (p->x_last_parm_cleanup_insn);
14359 ggc_mark_rtx (p->x_result_rtx);
14361 mark_binding_level (&p->bindings);
14364 /* Mark the language-specific data in F for GC. */
14367 mark_cp_function_context (f)
14368 struct function *f;
14370 mark_lang_function (f->language);
14376 return function_depth != 0;
14381 lang_mark_false_label_stack (l)
14382 struct label_node *l;
14384 /* C++ doesn't use false_label_stack. It better be NULL. */
14385 my_friendly_assert (l == NULL, 19990904);
14392 enum tree_code code = TREE_CODE (t);
14393 if (code == IDENTIFIER_NODE)
14395 struct lang_identifier *li = (struct lang_identifier *) t;
14396 struct lang_id2 *li2 = li->x;
14397 ggc_mark_tree (li->namespace_bindings);
14398 ggc_mark_tree (li->bindings);
14399 ggc_mark_tree (li->class_value);
14400 ggc_mark_tree (li->class_template_info);
14404 ggc_mark_tree (li2->label_value);
14405 ggc_mark_tree (li2->implicit_decl);
14406 ggc_mark_tree (li2->error_locus);
14409 else if (code == CPLUS_BINDING)
14411 if (BINDING_HAS_LEVEL_P (t))
14412 mark_binding_level (&BINDING_LEVEL (t));
14414 ggc_mark_tree (BINDING_SCOPE (t));
14415 ggc_mark_tree (BINDING_VALUE (t));
14417 else if (code == OVERLOAD)
14418 ggc_mark_tree (OVL_FUNCTION (t));
14419 else if (code == TEMPLATE_PARM_INDEX)
14420 ggc_mark_tree (TEMPLATE_PARM_DECL (t));
14421 else if (TREE_CODE_CLASS (code) == 'd')
14423 struct lang_decl *ld = DECL_LANG_SPECIFIC (t);
14428 ggc_mark_tree (ld->decl_flags.access);
14429 ggc_mark_tree (ld->decl_flags.context);
14430 if (TREE_CODE (t) != NAMESPACE_DECL)
14431 ggc_mark_tree (ld->decl_flags.u.template_info);
14432 if (CAN_HAVE_FULL_LANG_DECL_P (t))
14434 ggc_mark_tree (ld->main_decl_variant);
14435 ggc_mark_tree (ld->befriending_classes);
14436 ggc_mark_tree (ld->saved_tree);
14437 if (TREE_CODE (t) == TYPE_DECL)
14438 ggc_mark_tree (ld->u.sorted_fields);
14439 else if (TREE_CODE (t) == FUNCTION_DECL
14440 && !DECL_PENDING_INLINE_P (t))
14441 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t));
14445 else if (TREE_CODE_CLASS (code) == 't')
14447 struct lang_type *lt = TYPE_LANG_SPECIFIC (t);
14449 if (lt && !(TREE_CODE (t) == POINTER_TYPE
14450 && TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE))
14453 ggc_mark_tree (lt->vfields);
14454 ggc_mark_tree (lt->vbases);
14455 ggc_mark_tree (lt->tags);
14456 ggc_mark_tree (lt->search_slot);
14457 ggc_mark_tree (lt->size);
14458 ggc_mark_tree (lt->abstract_virtuals);
14459 ggc_mark_tree (lt->friend_classes);
14460 ggc_mark_tree (lt->rtti);
14461 ggc_mark_tree (lt->methods);
14462 ggc_mark_tree (lt->template_info);
14463 ggc_mark_tree (lt->befriending_classes);
14466 /* In the case of pointer-to-member function types, the
14467 TYPE_LANG_SPECIFIC is really just a tree. */
14468 ggc_mark_tree ((tree) lt);