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. */
46 #define obstack_chunk_alloc xmalloc
47 #define obstack_chunk_free free
49 extern tree builtin_return_address_fndecl;
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 int static_labelno;
60 extern tree current_namespace;
61 extern tree global_namespace;
63 extern void (*print_error_function) PROTO((char *));
65 /* Stack of places to restore the search obstack back to. */
67 /* Obstack used for remembering local class declarations (like
68 enums and static (const) members. */
70 struct obstack decl_obstack;
71 static struct stack_level *decl_stack;
73 #ifndef CHAR_TYPE_SIZE
74 #define CHAR_TYPE_SIZE BITS_PER_UNIT
77 #ifndef SHORT_TYPE_SIZE
78 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
82 #define INT_TYPE_SIZE BITS_PER_WORD
85 #ifndef LONG_TYPE_SIZE
86 #define LONG_TYPE_SIZE BITS_PER_WORD
89 #ifndef LONG_LONG_TYPE_SIZE
90 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
93 #ifndef WCHAR_UNSIGNED
94 #define WCHAR_UNSIGNED 0
97 #ifndef FLOAT_TYPE_SIZE
98 #define FLOAT_TYPE_SIZE BITS_PER_WORD
101 #ifndef DOUBLE_TYPE_SIZE
102 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
105 #ifndef LONG_DOUBLE_TYPE_SIZE
106 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
109 #ifndef BOOL_TYPE_SIZE
110 #ifdef SLOW_BYTE_ACCESS
111 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
113 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
117 /* We let tm.h override the types used here, to handle trivial differences
118 such as the choice of unsigned int or long unsigned int for size_t.
119 When machines start needing nontrivial differences in the size type,
120 it would be best to do something here to figure out automatically
121 from other information what type to use. */
124 #define SIZE_TYPE "long unsigned int"
128 #define PTRDIFF_TYPE "long int"
132 #define WCHAR_TYPE "int"
135 static tree grokparms PROTO((tree, int));
136 static tree lookup_nested_type PROTO((tree, tree));
137 static char *redeclaration_error_message PROTO((tree, tree));
139 static struct stack_level *push_decl_level PROTO((struct stack_level *,
141 static void push_binding_level PROTO((struct binding_level *, int,
143 static void pop_binding_level PROTO((void));
144 static void suspend_binding_level PROTO((void));
145 static void resume_binding_level PROTO((struct binding_level *));
146 static struct binding_level *make_binding_level PROTO((void));
147 static void declare_namespace_level PROTO((void));
148 static void signal_catch PROTO((int)) ATTRIBUTE_NORETURN;
149 static void storedecls PROTO((tree));
150 static void storetags PROTO((tree));
151 static void require_complete_types_for_parms PROTO((tree));
152 static void push_overloaded_decl_1 PROTO((tree));
153 static int ambi_op_p PROTO((tree));
154 static int unary_op_p PROTO((tree));
155 static tree store_bindings PROTO((tree, tree));
156 static tree lookup_tag_reverse PROTO((tree, tree));
157 static tree obscure_complex_init PROTO((tree, tree));
158 static tree maybe_build_cleanup_1 PROTO((tree, tree));
159 static tree lookup_name_real PROTO((tree, int, int, int));
160 static void warn_extern_redeclared_static PROTO((tree, tree));
161 static void grok_reference_init PROTO((tree, tree, tree));
162 static tree grokfndecl PROTO((tree, tree, tree, tree, int,
163 enum overload_flags, tree,
164 tree, tree, int, int, int, int, int, int, tree));
165 static tree grokvardecl PROTO((tree, tree, RID_BIT_TYPE *, int, int, tree));
166 static tree lookup_tag PROTO((enum tree_code, tree,
167 struct binding_level *, int));
168 static void set_identifier_type_value_with_scope
169 PROTO((tree, tree, struct binding_level *));
170 static void record_builtin_type PROTO((enum rid, char *, tree));
171 static void record_unknown_type PROTO((tree, char *));
172 static int member_function_or_else PROTO((tree, tree, char *));
173 static void bad_specifiers PROTO((tree, char *, int, int, int, int,
175 static void lang_print_error_function PROTO((char *));
176 static tree maybe_process_template_type_declaration PROTO((tree, int, struct binding_level*));
177 static void check_for_uninitialized_const_var PROTO((tree));
178 static unsigned long typename_hash PROTO((hash_table_key));
179 static boolean typename_compare PROTO((hash_table_key, hash_table_key));
180 static void push_binding PROTO((tree, tree, struct binding_level*));
181 static void add_binding PROTO((tree, tree));
182 static void pop_binding PROTO((tree, tree));
183 static tree local_variable_p PROTO((tree));
185 #if defined (DEBUG_CP_BINDING_LEVELS)
186 static void indent PROTO((void));
189 /* A node which has tree code ERROR_MARK, and whose type is itself.
190 All erroneous expressions are replaced with this node. All functions
191 that accept nodes as arguments should avoid generating error messages
192 if this node is one of the arguments, since it is undesirable to get
193 multiple error messages from one error in the input. */
195 tree error_mark_node;
197 /* Erroneous argument lists can use this *IFF* they do not modify it. */
198 tree error_mark_list;
200 /* INTEGER_TYPE and REAL_TYPE nodes for the standard data types */
202 tree short_integer_type_node;
203 tree integer_type_node;
204 tree long_integer_type_node;
205 tree long_long_integer_type_node;
207 tree short_unsigned_type_node;
208 tree unsigned_type_node;
209 tree long_unsigned_type_node;
210 tree long_long_unsigned_type_node;
212 tree ptrdiff_type_node;
214 tree unsigned_char_type_node;
215 tree signed_char_type_node;
217 tree wchar_type_node;
218 tree signed_wchar_type_node;
219 tree unsigned_wchar_type_node;
221 tree wchar_decl_node;
223 tree float_type_node;
224 tree double_type_node;
225 tree long_double_type_node;
227 tree complex_integer_type_node;
228 tree complex_float_type_node;
229 tree complex_double_type_node;
230 tree complex_long_double_type_node;
232 tree intQI_type_node;
233 tree intHI_type_node;
234 tree intSI_type_node;
235 tree intDI_type_node;
236 #if HOST_BITS_PER_WIDE_INT >= 64
237 tree intTI_type_node;
240 tree unsigned_intQI_type_node;
241 tree unsigned_intHI_type_node;
242 tree unsigned_intSI_type_node;
243 tree unsigned_intDI_type_node;
244 #if HOST_BITS_PER_WIDE_INT >= 64
245 tree unsigned_intTI_type_node;
248 tree java_byte_type_node;
249 tree java_short_type_node;
250 tree java_int_type_node;
251 tree java_long_type_node;
252 tree java_float_type_node;
253 tree java_double_type_node;
254 tree java_char_type_node;
255 tree java_boolean_type_node;
257 /* A VOID_TYPE node, and the same, packaged in a TREE_LIST. */
259 tree void_type_node, void_list_node;
262 /* Nodes for types `void *' and `const void *'. */
265 tree const_ptr_type_node;
267 /* Nodes for types `char *' and `const char *'. */
269 tree string_type_node, const_string_type_node;
271 /* Type `char[256]' or something like it.
272 Used when an array of char is needed and the size is irrelevant. */
274 tree char_array_type_node;
276 /* Type `int[256]' or something like it.
277 Used when an array of int needed and the size is irrelevant. */
279 tree int_array_type_node;
281 /* Type `wchar_t[256]' or something like it.
282 Used when a wide string literal is created. */
284 tree wchar_array_type_node;
286 /* The bool data type, and constants */
287 tree boolean_type_node, boolean_true_node, boolean_false_node;
289 /* Type `int ()' -- used for implicit declaration of functions. */
291 tree default_function_type;
293 /* Function types `double (double)' and `double (double, double)', etc. */
295 static tree double_ftype_double, double_ftype_double_double;
296 static tree int_ftype_int, long_ftype_long;
297 static tree float_ftype_float;
298 static tree ldouble_ftype_ldouble;
300 /* Function type `int (const void *, const void *, size_t)' */
301 static tree int_ftype_cptr_cptr_sizet;
304 tree vtable_entry_type;
305 tree delta_type_node;
307 /* Old rtti stuff. */
308 tree __baselist_desc_type_node;
309 tree __i_desc_type_node, __m_desc_type_node;
310 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
312 tree __t_desc_type_node;
314 tree __tp_desc_type_node;
316 tree __access_mode_type_node;
317 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
318 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
319 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
321 /* Not needed yet? May be needed one day? */
322 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
323 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
324 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
327 /* Indicates that there is a type value in some namespace, although
328 that is not necessarily in scope at the moment. */
330 static tree global_type_node;
332 tree class_star_type_node;
333 tree class_type_node, record_type_node, union_type_node, enum_type_node;
334 tree unknown_type_node;
335 tree opaque_type_node, signature_type_node;
336 tree sigtable_entry_type;
338 /* Array type `vtable_entry_type[]' */
340 tree vtbl_ptr_type_node;
346 /* Expect only namespace names now. */
347 static int only_namespace_names;
349 /* In a destructor, the point at which all derived class destroying
350 has been done, just before any base class destroying will be done. */
354 /* In a destructor, the last insn emitted after the start of the
355 function and the parms. */
357 static rtx last_dtor_insn;
359 /* In a constructor, the last insn emitted after the start of the
360 function and the parms, the exception specification and any
361 function-try-block. The constructor initializers are emitted after
364 static rtx last_parm_cleanup_insn;
366 /* In a constructor, the point at which we are ready to return
367 the pointer to the initialized object. */
371 /* A FUNCTION_DECL which can call `abort'. Not necessarily the
372 one that the user will declare, but sufficient to be called
373 by routines that want to abort the program. */
377 /* A FUNCTION_DECL for the default `::operator delete'. */
379 tree global_delete_fndecl;
381 extern rtx cleanup_label, return_label;
383 /* If original DECL_RESULT of current function was a register,
384 but due to being an addressable named return value, would up
385 on the stack, this variable holds the named return value's
386 original location. */
387 static rtx original_result_rtx;
389 /* Sequence of insns which represents base initialization. */
392 /* C++: Keep these around to reduce calls to `get_identifier'.
393 Identifiers for `this' in member functions and the auto-delete
394 parameter for destructors. */
395 tree this_identifier, in_charge_identifier;
396 tree ctor_identifier, dtor_identifier;
397 /* Used in pointer to member functions, in vtables, and in sigtables. */
398 tree pfn_identifier, index_identifier, delta_identifier, delta2_identifier;
399 tree pfn_or_delta2_identifier, tag_identifier;
400 tree vt_off_identifier;
402 struct named_label_list
404 struct binding_level *binding_level;
407 char *filename_o_goto;
409 struct named_label_list *next;
412 /* A list (chain of TREE_LIST nodes) of named label uses.
413 The TREE_PURPOSE field is the list of variables defined
414 in the label's scope defined at the point of use.
415 The TREE_VALUE field is the LABEL_DECL used.
416 The TREE_TYPE field holds `current_binding_level' at the
417 point of the label's use.
419 BWAHAHAAHAHahhahahahaah. No, no, no, said the little chicken.
421 Look at the pretty struct named_label_list. See the pretty struct
422 with the pretty named fields that describe what they do. See the
423 pretty lack of gratuitous casts. Notice the code got a lot cleaner.
425 Used only for jumps to as-yet undefined labels, since
426 jumps to defined labels can have their validity checked
429 static struct named_label_list *named_label_uses = NULL;
431 /* A list of objects which have constructors or destructors
432 which reside in the global scope. The decl is stored in
433 the TREE_VALUE slot and the initializer is stored
434 in the TREE_PURPOSE slot. */
435 tree static_aggregates;
439 /* Two expressions that are constants with value zero.
440 The first is of type `int', the second of type `void *'. */
442 tree integer_zero_node;
443 tree null_pointer_node;
445 /* The value for __null (NULL), namely, a zero of an integer type with
446 the same number of bits as a pointer. */
449 /* A node for the integer constants 1, 2, and 3. */
451 tree integer_one_node, integer_two_node, integer_three_node;
453 /* While defining an enum type, this is 1 plus the last enumerator
456 static tree enum_next_value;
458 /* Nonzero means that there was overflow computing enum_next_value. */
460 static int enum_overflow;
462 /* Parsing a function declarator leaves a list of parameter names
463 or a chain or parameter decls here. */
465 tree last_function_parms;
467 /* Parsing a function declarator leaves here a chain of structure
468 and enum types declared in the parmlist. */
470 static tree last_function_parm_tags;
472 /* After parsing the declarator that starts a function definition,
473 `start_function' puts here the list of parameter names or chain of decls.
474 `store_parm_decls' finds it here. */
476 static tree current_function_parms;
478 /* Similar, for last_function_parm_tags. */
479 static tree current_function_parm_tags;
481 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
482 that have names. Here so we can clear out their names' definitions
483 at the end of the function. */
485 static tree named_labels;
487 /* A list of LABEL_DECLs from outer contexts that are currently shadowed. */
489 static tree shadowed_labels;
491 /* The FUNCTION_DECL for the function currently being compiled,
492 or 0 if between functions. */
493 tree current_function_decl;
495 /* Set to 0 at beginning of a function definition, set to 1 if
496 a return statement that specifies a return value is seen. */
498 int current_function_returns_value;
500 /* Set to 0 at beginning of a function definition, set to 1 if
501 a return statement with no argument is seen. */
503 int current_function_returns_null;
505 /* Set to 0 at beginning of a function definition, and whenever
506 a label (case or named) is defined. Set to value of expression
507 returned from function when that value can be transformed into
508 a named return value. */
510 tree current_function_return_value;
512 /* Nonzero means give `double' the same size as `float'. */
514 extern int flag_short_double;
516 /* Nonzero means don't recognize any builtin functions. */
518 extern int flag_no_builtin;
520 /* Nonzero means don't recognize the non-ANSI builtin functions.
523 extern int flag_no_nonansi_builtin;
525 /* Nonzero means enable obscure ANSI features and disable GNU extensions
526 that might cause ANSI-compliant code to be miscompiled. */
528 extern int flag_ansi;
530 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
532 extern int flag_huge_objects;
534 /* Nonzero if we want to conserve space in the .o files. We do this
535 by putting uninitialized data and runtime initialized data into
536 .common instead of .data at the expense of not flagging multiple
538 extern int flag_conserve_space;
540 /* Pointers to the base and current top of the language name stack. */
542 extern tree *current_lang_base, *current_lang_stack;
544 /* C and C++ flags are in decl2.c. */
546 /* Set to 0 at beginning of a constructor, set to 1
547 if that function does an allocation before referencing its
548 instance variable. */
549 static int current_function_assigns_this;
550 int current_function_just_assigned_this;
552 /* Set to 0 at beginning of a function. Set non-zero when
553 store_parm_decls is called. Don't call store_parm_decls
554 if this flag is non-zero! */
555 int current_function_parms_stored;
557 /* Flag used when debugging spew.c */
559 extern int spew_debug;
561 /* This is a copy of the class_shadowed list of the previous class binding
562 contour when at global scope. It's used to reset IDENTIFIER_CLASS_VALUEs
563 when entering another class scope (i.e. a cache miss). */
564 extern tree previous_class_values;
566 /* A expression of value 0 with the same precision as a sizetype
568 tree signed_size_zero_node;
570 /* The name of the anonymous namespace, throughout this translation
572 tree anonymous_namespace_name;
575 /* Allocate a level of searching. */
579 push_decl_level (stack, obstack)
580 struct stack_level *stack;
581 struct obstack *obstack;
583 struct stack_level tem;
586 return push_stack_level (obstack, (char *)&tem, sizeof (tem));
589 /* For each binding contour we allocate a binding_level structure
590 which records the names defined in that contour.
593 1) one for each function definition,
594 where internal declarations of the parameters appear.
595 2) one for each compound statement,
596 to record its declarations.
598 The current meaning of a name can be found by searching the levels
599 from the current one out to the global one.
601 Off to the side, may be the class_binding_level. This exists only
602 to catch class-local declarations. It is otherwise nonexistent.
604 Also there may be binding levels that catch cleanups that must be
605 run when exceptions occur. Thus, to see whether a name is bound in
606 the current scope, it is not enough to look in the
607 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
610 /* Note that the information in the `names' component of the global contour
611 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
615 /* A chain of _DECL nodes for all variables, constants, functions,
616 and typedef types. These are in the reverse of the order
617 supplied. There may be OVERLOADs on this list, too, but they
618 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
621 /* A list of structure, union and enum definitions, for looking up
623 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
624 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
625 or ENUMERAL_TYPE node.
627 C++: the TREE_VALUE nodes can be simple types for
628 component_bindings. */
631 /* A list of USING_DECL nodes. */
634 /* A list of used namespaces. PURPOSE is the namespace,
635 VALUE the common ancestor with this binding_level's namespace. */
636 tree using_directives;
638 /* If this binding level is the binding level for a class, then
639 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
640 is the name of an entity bound in the class; the TREE_VALUE is
641 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
642 when leaving class scope, we can restore the
643 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
644 the DECL bound by this name in the class. */
647 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
648 is used for all binding levels. */
651 /* For each level (except not the global one),
652 a chain of BLOCK nodes for all the levels
653 that were entered and exited one level down. */
656 /* The BLOCK node for this level, if one has been preallocated.
657 If 0, the BLOCK is allocated (if needed) when the level is popped. */
660 /* The binding level which this one is contained in (inherits from). */
661 struct binding_level *level_chain;
663 /* List of decls in `names' that have incomplete
664 structure or union types. */
667 /* List of VAR_DECLS saved from a previous for statement.
668 These would be dead in ANSI-conforming code, but might
669 be referenced in ARM-era code. These are stored in a
670 TREE_LIST; the TREE_VALUE is the actual declaration. */
671 tree dead_vars_from_for;
673 /* 1 for the level that holds the parameters of a function.
674 2 for the level that holds a class declaration.
675 3 for levels that hold parameter declarations. */
676 unsigned parm_flag : 4;
678 /* 1 means make a BLOCK for this level regardless of all else.
679 2 for temporary binding contours created by the compiler. */
682 /* Nonzero if this level "doesn't exist" for tags. */
683 unsigned tag_transparent : 1;
685 /* Nonzero if this level can safely have additional
686 cleanup-needing variables added to it. */
687 unsigned more_cleanups_ok : 1;
688 unsigned have_cleanups : 1;
690 /* Nonzero if this level is for storing the decls for template
691 parameters and generic decls; these decls will be discarded and
692 replaced with a TEMPLATE_DECL. */
693 unsigned pseudo_global : 1;
695 /* This is set for a namespace binding level. */
696 unsigned namespace_p : 1;
698 /* True if this level is that of a for-statement where we need to
699 worry about ambiguous (ARM or ANSI) scope rules. */
700 unsigned is_for_scope : 1;
702 /* Two bits left for this word. */
704 #if defined(DEBUG_CP_BINDING_LEVELS)
705 /* Binding depth at which this level began. */
706 unsigned binding_depth;
707 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
710 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
712 /* The (non-class) binding level currently in effect. */
714 static struct binding_level *current_binding_level;
716 /* The binding level of the current class, if any. */
718 static struct binding_level *class_binding_level;
720 /* The current (class or non-class) binding level currently in effect. */
722 #define inner_binding_level \
723 (class_binding_level ? class_binding_level : current_binding_level)
725 /* A chain of binding_level structures awaiting reuse. */
727 static struct binding_level *free_binding_level;
729 /* The outermost binding level, for names of file scope.
730 This is created when the compiler is started and exists
731 through the entire run. */
733 static struct binding_level *global_binding_level;
735 /* Binding level structures are initialized by copying this one. */
737 static struct binding_level clear_binding_level;
739 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
741 static int keep_next_level_flag;
743 #if defined(DEBUG_CP_BINDING_LEVELS)
744 static int binding_depth = 0;
745 static int is_class_level = 0;
752 for (i = 0; i < binding_depth*2; i++)
755 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
757 static tree pushdecl_with_scope PROTO((tree, struct binding_level *));
760 push_binding_level (newlevel, tag_transparent, keep)
761 struct binding_level *newlevel;
762 int tag_transparent, keep;
764 /* Add this level to the front of the chain (stack) of levels that
766 *newlevel = clear_binding_level;
767 if (class_binding_level)
769 newlevel->level_chain = class_binding_level;
770 class_binding_level = (struct binding_level *)0;
774 newlevel->level_chain = current_binding_level;
776 current_binding_level = newlevel;
777 newlevel->tag_transparent = tag_transparent;
778 newlevel->more_cleanups_ok = 1;
779 newlevel->keep = keep;
780 #if defined(DEBUG_CP_BINDING_LEVELS)
781 newlevel->binding_depth = binding_depth;
783 fprintf (stderr, "push %s level 0x%08x line %d\n",
784 (is_class_level) ? "class" : "block", newlevel, lineno);
787 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
793 if (class_binding_level)
794 current_binding_level = class_binding_level;
796 if (global_binding_level)
798 /* Cannot pop a level, if there are none left to pop. */
799 if (current_binding_level == global_binding_level)
800 my_friendly_abort (123);
802 /* Pop the current level, and free the structure for reuse. */
803 #if defined(DEBUG_CP_BINDING_LEVELS)
806 fprintf (stderr, "pop %s level 0x%08x line %d\n",
807 (is_class_level) ? "class" : "block",
808 current_binding_level, lineno);
809 if (is_class_level != (current_binding_level == class_binding_level))
812 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
815 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
817 register struct binding_level *level = current_binding_level;
818 current_binding_level = current_binding_level->level_chain;
819 level->level_chain = free_binding_level;
820 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
821 if (level->binding_depth != binding_depth)
823 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
824 free_binding_level = level;
826 class_binding_level = current_binding_level;
827 if (class_binding_level->parm_flag != 2)
828 class_binding_level = 0;
829 while (current_binding_level->parm_flag == 2)
830 current_binding_level = current_binding_level->level_chain;
835 suspend_binding_level ()
837 if (class_binding_level)
838 current_binding_level = class_binding_level;
840 if (global_binding_level)
842 /* Cannot suspend a level, if there are none left to suspend. */
843 if (current_binding_level == global_binding_level)
844 my_friendly_abort (123);
846 /* Suspend the current level. */
847 #if defined(DEBUG_CP_BINDING_LEVELS)
850 fprintf (stderr, "suspend %s level 0x%08x line %d\n",
851 (is_class_level) ? "class" : "block",
852 current_binding_level, lineno);
853 if (is_class_level != (current_binding_level == class_binding_level))
856 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
859 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
861 current_binding_level = current_binding_level->level_chain;
862 class_binding_level = current_binding_level;
863 if (class_binding_level->parm_flag != 2)
864 class_binding_level = 0;
865 while (current_binding_level->parm_flag == 2)
866 current_binding_level = current_binding_level->level_chain;
871 resume_binding_level (b)
872 struct binding_level *b;
874 /* Resuming binding levels is meant only for namespaces,
875 and those cannot nest into classes. */
876 my_friendly_assert(!class_binding_level, 386);
877 /* Also, resuming a non-directly nested namespace is a no-no. */
878 my_friendly_assert(b->level_chain == current_binding_level, 386);
879 current_binding_level = b;
880 #if defined(DEBUG_CP_BINDING_LEVELS)
881 b->binding_depth = binding_depth;
883 fprintf (stderr, "resume %s level 0x%08x line %d\n",
884 (is_class_level) ? "class" : "block", b, lineno);
887 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
890 /* Create a new `struct binding_level'. */
893 struct binding_level *
894 make_binding_level ()
897 return (struct binding_level *) xmalloc (sizeof (struct binding_level));
900 /* Nonzero if we are currently in the global binding level. */
905 return current_binding_level == global_binding_level;
908 /* Nonzero if we are currently in a toplevel binding level. This
909 means either the global binding level or a namespace in a toplevel
911 Since there are no non-toplevel namespace levels, this really
912 means any namespace or pseudo-global level. */
915 toplevel_bindings_p ()
917 return current_binding_level->namespace_p
918 || current_binding_level->pseudo_global;
921 /* Nonzero if this is a namespace scope. */
924 namespace_bindings_p ()
926 return current_binding_level->namespace_p;
932 keep_next_level_flag = 1;
935 /* Nonzero if the current level needs to have a BLOCK made. */
940 return (current_binding_level->blocks != NULL_TREE
941 || current_binding_level->keep
942 || current_binding_level->names != NULL_TREE
943 || (current_binding_level->tags != NULL_TREE
944 && !current_binding_level->tag_transparent));
947 /* Identify this binding level as a level of parameters. */
950 declare_parm_level ()
952 current_binding_level->parm_flag = 1;
956 declare_pseudo_global_level ()
958 current_binding_level->pseudo_global = 1;
962 declare_namespace_level ()
964 current_binding_level->namespace_p = 1;
968 pseudo_global_level_p ()
970 return current_binding_level->pseudo_global;
974 set_class_shadows (shadows)
977 class_binding_level->class_shadowed = shadows;
980 /* Enter a new binding level.
981 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
982 not for that of tags. */
985 pushlevel (tag_transparent)
988 register struct binding_level *newlevel = NULL_BINDING_LEVEL;
990 /* If this is the top level of a function,
991 just make sure that NAMED_LABELS is 0.
992 They should have been set to 0 at the end of the previous function. */
994 if (current_binding_level == global_binding_level)
995 my_friendly_assert (named_labels == NULL_TREE, 134);
997 /* Reuse or create a struct for this binding level. */
999 #if defined(DEBUG_CP_BINDING_LEVELS)
1001 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1002 if (free_binding_level)
1003 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1005 newlevel = free_binding_level;
1006 free_binding_level = free_binding_level->level_chain;
1010 newlevel = make_binding_level ();
1013 push_binding_level (newlevel, tag_transparent, keep_next_level_flag);
1014 GNU_xref_start_scope ((HOST_WIDE_INT) newlevel);
1015 keep_next_level_flag = 0;
1019 note_level_for_for ()
1021 current_binding_level->is_for_scope = 1;
1025 pushlevel_temporary (tag_transparent)
1026 int tag_transparent;
1028 pushlevel (tag_transparent);
1029 current_binding_level->keep = 2;
1032 /* Note we don't call push_momentary() here. Otherwise, it would cause
1033 cleanups to be allocated on the momentary obstack, and they will be
1034 overwritten by the next statement. */
1036 expand_start_bindings (0);
1039 /* For a binding between a name and an entity at a block scope,
1040 this is the `struct binding_level' for the block. */
1041 #define BINDING_LEVEL(NODE) \
1042 ((struct binding_level*) ((struct tree_binding*)NODE)->scope)
1044 /* These are currently unused, but permanent, CPLUS_BINDING nodes.
1045 They are kept here because they are allocated from the permanent
1046 obstack and cannot be easily freed. */
1047 static tree free_binding_nodes;
1049 /* Make DECL the innermost binding for ID. The LEVEL is the binding
1050 level at which this declaration is being bound. */
1053 push_binding (id, decl, level)
1056 struct binding_level* level;
1060 if (!free_binding_nodes)
1062 /* There are no free nodes, so we must build one here. */
1063 push_obstacks_nochange ();
1064 end_temporary_allocation ();
1065 binding = make_node (CPLUS_BINDING);
1070 /* There are nodes on the free list. Grab the first one. */
1071 binding = free_binding_nodes;
1073 /* And update the free list. */
1074 free_binding_nodes = TREE_CHAIN (free_binding_nodes);
1077 /* Now, fill in the binding information. */
1078 BINDING_VALUE (binding) = decl;
1079 BINDING_TYPE (binding) = NULL_TREE;
1080 BINDING_LEVEL (binding) = level;
1081 LOCAL_BINDING_P (binding) = (level != class_binding_level);
1083 /* And put it on the front of the ilst of bindings for ID. */
1084 TREE_CHAIN (binding) = IDENTIFIER_BINDING (id);
1085 IDENTIFIER_BINDING (id) = binding;
1088 /* ID is already bound in the current scope. But, DECL is an
1089 additional binding for ID in the same scope. This is the `struct
1090 stat' hack whereby a non-typedef class-name or enum-name can be
1091 bound at the same level as some other kind of entity. It's the
1092 responsibility of the caller to check that inserting this name is
1095 add_binding (id, decl)
1099 tree binding = IDENTIFIER_BINDING (id);
1101 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
1102 /* The new name is the type name. */
1103 BINDING_TYPE (binding) = decl;
1106 /* The old name must be the type name. It was placed in
1107 IDENTIFIER_VALUE because it was thought, at the point it
1108 was declared, to be the only entity with such a name. */
1109 my_friendly_assert (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
1110 && DECL_ARTIFICIAL (BINDING_VALUE (binding)),
1113 /* Move the type name into the type slot; it is now hidden by
1115 BINDING_TYPE (binding) = BINDING_VALUE (binding);
1116 BINDING_VALUE (binding) = decl;
1120 /* Bind DECL to ID in the current_binding_level. */
1123 push_local_binding (id, decl)
1129 if (TREE_CODE (decl) == OVERLOAD)
1130 /* We must put the OVERLOAD into a TREE_LIST since the
1131 TREE_CHAIN of an OVERLOAD is already used. */
1132 decl = build_tree_list (NULL_TREE, decl);
1134 if (lookup_name_current_level (id))
1135 /* Supplement the existing binding. */
1136 add_binding (id, decl);
1138 /* Create a new binding. */
1139 push_binding (id, d, current_binding_level);
1141 /* And put DECL on the list of things declared by the current
1143 TREE_CHAIN (decl) = current_binding_level->names;
1144 current_binding_level->names = decl;
1147 /* Bind DECL to ID in the class_binding_level. */
1150 push_class_binding (id, decl)
1154 if (IDENTIFIER_BINDING (id)
1155 && BINDING_LEVEL (IDENTIFIER_BINDING (id)) == class_binding_level)
1156 /* Supplement the existing binding. */
1157 add_binding (id, decl);
1159 /* Create a new binding. */
1160 push_binding (id, decl, class_binding_level);
1162 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1163 class-level declaration. Note that we do not use DECL here
1164 because of the possibility of the `struct stat' hack; if DECL is
1165 a class-name or enum-name we might prefer a field-name, or some
1167 IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id));
1170 /* Remove the binding for DECL which should be the innermost binding
1174 pop_binding (id, decl)
1180 if (id == NULL_TREE)
1181 /* It's easiest to write the loops that call this function without
1182 checking whether or not the entities involved have names. We
1183 get here for such an entity. */
1186 /* Get the innermost binding for ID. */
1187 binding = IDENTIFIER_BINDING (id);
1189 /* The name should be bound. */
1190 my_friendly_assert (binding != NULL_TREE, 0);
1192 /* The DECL will be either the ordinary binding or the type
1193 binding for this identifier. Remove that binding. */
1194 if (BINDING_VALUE (binding) == decl)
1195 BINDING_VALUE (binding) = NULL_TREE;
1196 else if (BINDING_TYPE (binding) == decl)
1197 BINDING_TYPE (binding) = NULL_TREE;
1199 my_friendly_abort (0);
1201 if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding))
1203 /* We're completely done with the innermost binding for this
1204 identifier. Unhook it from the list of bindings. */
1205 IDENTIFIER_BINDING (id) = TREE_CHAIN (binding);
1207 /* And place it on the free list. */
1208 TREE_CHAIN (binding) = free_binding_nodes;
1209 free_binding_nodes = binding;
1213 /* Exit a binding level.
1214 Pop the level off, and restore the state of the identifier-decl mappings
1215 that were in effect when this level was entered.
1217 If KEEP == 1, this level had explicit declarations, so
1218 and create a "block" (a BLOCK node) for the level
1219 to record its declarations and subblocks for symbol table output.
1221 If FUNCTIONBODY is nonzero, this level is the body of a function,
1222 so create a block as if KEEP were set and also clear out all
1225 If REVERSE is nonzero, reverse the order of decls before putting
1226 them into the BLOCK. */
1229 poplevel (keep, reverse, functionbody)
1235 /* The chain of decls was accumulated in reverse order.
1236 Put it into forward order, just for cleanliness. */
1238 int tmp = functionbody;
1239 int real_functionbody = current_binding_level->keep == 2
1240 ? ((functionbody = 0), tmp) : functionbody;
1241 tree tags = functionbody >= 0 ? current_binding_level->tags : 0;
1242 tree subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1243 tree block = NULL_TREE;
1245 int block_previously_created;
1246 int leaving_for_scope;
1248 if (current_binding_level->parm_flag == 2
1249 || current_binding_level->class_shadowed)
1250 /* We should not be using poplevel to pop a class binding level.
1251 Use poplevel_class instead. */
1252 my_friendly_abort (0);
1254 /* We used to use KEEP == 2 to indicate that the new block should go
1255 at the beginning of the list of blocks at this binding level,
1256 rather than the end. This hack is no longer used. */
1257 my_friendly_assert (keep == 0 || keep == 1, 0);
1259 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
1260 (HOST_WIDE_INT) current_binding_level->level_chain,
1261 current_binding_level->parm_flag,
1262 current_binding_level->keep);
1264 if (current_binding_level->keep == 1)
1267 /* Get the decls in the order they were written.
1268 Usually current_binding_level->names is in reverse order.
1269 But parameter decls were previously put in forward order. */
1272 current_binding_level->names
1273 = decls = nreverse (current_binding_level->names);
1275 decls = current_binding_level->names;
1277 /* Output any nested inline functions within this block
1278 if they weren't already output. */
1280 for (decl = decls; decl; decl = TREE_CHAIN (decl))
1281 if (TREE_CODE (decl) == FUNCTION_DECL
1282 && ! TREE_ASM_WRITTEN (decl)
1283 && DECL_INITIAL (decl) != NULL_TREE
1284 && TREE_ADDRESSABLE (decl)
1285 && decl_function_context (decl) == current_function_decl)
1287 /* If this decl was copied from a file-scope decl
1288 on account of a block-scope extern decl,
1289 propagate TREE_ADDRESSABLE to the file-scope decl. */
1290 if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1291 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1294 push_function_context ();
1295 output_inline_function (decl);
1296 pop_function_context ();
1300 /* If there were any declarations or structure tags in that level,
1301 or if this level is a function body,
1302 create a BLOCK to record them for the life of this function. */
1305 block_previously_created = (current_binding_level->this_block != NULL_TREE);
1306 if (block_previously_created)
1307 block = current_binding_level->this_block;
1308 else if (keep == 1 || functionbody)
1309 block = make_node (BLOCK);
1310 if (block != NULL_TREE)
1312 if (block_previously_created)
1314 if (decls || tags || subblocks)
1316 if (BLOCK_VARS (block) || BLOCK_TYPE_TAGS (block))
1317 warning ("internal compiler error: debugging info corrupted");
1319 BLOCK_VARS (block) = decls;
1320 BLOCK_TYPE_TAGS (block) = tags;
1322 /* We can have previous subblocks and new subblocks when
1323 doing fixup_gotos with complex cleanups. We chain the new
1324 subblocks onto the end of any pre-existing subblocks. */
1325 BLOCK_SUBBLOCKS (block) = chainon (BLOCK_SUBBLOCKS (block),
1328 /* If we created the block earlier on, and we are just
1329 diddling it now, then it already should have a proper
1330 BLOCK_END_NOTE value associated with it. */
1334 BLOCK_VARS (block) = decls;
1335 BLOCK_TYPE_TAGS (block) = tags;
1336 BLOCK_SUBBLOCKS (block) = subblocks;
1337 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1339 remember_end_note (block);
1343 /* In each subblock, record that this is its superior. */
1346 for (link = subblocks; link; link = TREE_CHAIN (link))
1347 BLOCK_SUPERCONTEXT (link) = block;
1349 /* We still support the old for-scope rules, whereby the variables
1350 in a for-init statement were in scope after the for-statement
1351 ended. We only use the new rules in flag_new_for_scope is
1354 = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1356 /* Remove declarations for all the DECLs in this level. */
1357 for (link = decls; link; link = TREE_CHAIN (link))
1359 if (leaving_for_scope && TREE_CODE (link) == VAR_DECL)
1362 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1366 ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1368 ns_binding = NULL_TREE;
1371 && (BINDING_LEVEL (outer_binding)
1372 == current_binding_level->level_chain))
1373 /* We have something like:
1378 and we are leaving the `for' scope. There's no reason to
1379 keep the binding of the inner `i' in this case. */
1380 pop_binding (DECL_NAME (link), link);
1381 else if ((outer_binding
1382 && (TREE_CODE (BINDING_VALUE (outer_binding))
1385 && TREE_CODE (ns_binding) == TYPE_DECL))
1386 /* Here, we have something like:
1394 We must pop the for-scope binding so we know what's a
1395 type and what isn't. */
1396 pop_binding (DECL_NAME (link), link);
1399 /* Mark this VAR_DECL as dead so that we can tell we left it
1400 there only for backward compatibility. */
1401 DECL_DEAD_FOR_LOCAL (link) = 1;
1403 /* Keep track of what should of have happenned when we
1404 popped the binding. */
1405 if (outer_binding && BINDING_VALUE (outer_binding))
1406 DECL_SHADOWED_FOR_VAR (link)
1407 = BINDING_VALUE (outer_binding);
1409 /* Add it to the list of dead variables in the next
1410 outermost binding to that we can remove these when we
1411 leave that binding. */
1412 current_binding_level->level_chain->dead_vars_from_for
1413 = tree_cons (NULL_TREE, link,
1414 current_binding_level->level_chain->
1415 dead_vars_from_for);
1417 /* Although we don't pop the CPLUS_BINDING, we do clear
1418 its BINDING_LEVEL since the level is going away now. */
1419 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1425 /* Remove the binding. */
1426 if (TREE_CODE_CLASS (TREE_CODE (link)) == 'd')
1427 pop_binding (DECL_NAME (link), link);
1428 else if (TREE_CODE (link) == TREE_LIST)
1429 pop_binding (DECL_NAME (OVL_FUNCTION (TREE_VALUE (link))),
1432 my_friendly_abort (0);
1436 /* Remove declarations for any `for' variables from inner scopes
1437 that we kept around. */
1438 for (link = current_binding_level->dead_vars_from_for;
1439 link; link = TREE_CHAIN (link))
1440 pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1442 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1443 for (link = current_binding_level->type_shadowed;
1444 link; link = TREE_CHAIN (link))
1445 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1447 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1448 list if a `using' declaration put them there. The debugging
1449 back-ends won't understand OVERLOAD, so we remove them here.
1450 Because the BLOCK_VARS are (temporarily) shared with
1451 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1452 popped all the bindings. */
1457 for (d = &BLOCK_VARS (block);
1459 d = *d ? &TREE_CHAIN (*d) : d)
1460 if (TREE_CODE (*d) == TREE_LIST)
1461 *d = TREE_CHAIN (*d);
1464 /* If the level being exited is the top level of a function,
1465 check over all the labels. */
1469 /* If this is the top level block of a function,
1470 the vars are the function's parameters.
1471 Don't leave them in the BLOCK because they are
1472 found in the FUNCTION_DECL instead. */
1474 BLOCK_VARS (block) = 0;
1476 /* Clear out the definitions of all label names,
1477 since their scopes end here. */
1479 for (link = named_labels; link; link = TREE_CHAIN (link))
1481 register tree label = TREE_VALUE (link);
1483 if (DECL_INITIAL (label) == NULL_TREE)
1485 cp_error_at ("label `%D' used but not defined", label);
1486 /* Avoid crashing later. */
1487 define_label (input_filename, 1, DECL_NAME (label));
1489 else if (warn_unused && !TREE_USED (label))
1490 cp_warning_at ("label `%D' defined but not used", label);
1491 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), NULL_TREE);
1493 /* Put the labels into the "variables" of the
1494 top-level block, so debugger can see them. */
1495 TREE_CHAIN (label) = BLOCK_VARS (block);
1496 BLOCK_VARS (block) = label;
1499 named_labels = NULL_TREE;
1502 /* Any uses of undefined labels now operate under constraints
1503 of next binding contour. */
1505 struct binding_level *level_chain;
1506 level_chain = current_binding_level->level_chain;
1509 struct named_label_list *labels;
1510 for (labels = named_label_uses; labels; labels = labels->next)
1511 if (labels->binding_level == current_binding_level)
1513 labels->binding_level = level_chain;
1514 labels->names_in_scope = level_chain->names;
1519 tmp = current_binding_level->keep;
1521 pop_binding_level ();
1523 DECL_INITIAL (current_function_decl) = block;
1526 if (!block_previously_created)
1527 current_binding_level->blocks
1528 = chainon (current_binding_level->blocks, block);
1530 /* If we did not make a block for the level just exited,
1531 any blocks made for inner levels
1532 (since they cannot be recorded as subblocks in that level)
1533 must be carried forward so they will later become subblocks
1534 of something else. */
1536 current_binding_level->blocks
1537 = chainon (current_binding_level->blocks, subblocks);
1539 /* Take care of compiler's internal binding structures. */
1542 expand_end_bindings (getdecls (), keep, 1);
1543 /* Each and every BLOCK node created here in `poplevel' is important
1544 (e.g. for proper debugging information) so if we created one
1545 earlier, mark it as "used". */
1547 TREE_USED (block) = 1;
1548 block = poplevel (keep, reverse, real_functionbody);
1551 /* Each and every BLOCK node created here in `poplevel' is important
1552 (e.g. for proper debugging information) so if we created one
1553 earlier, mark it as "used". */
1555 TREE_USED (block) = 1;
1559 /* Delete the node BLOCK from the current binding level.
1560 This is used for the block inside a stmt expr ({...})
1561 so that the block can be reinserted where appropriate. */
1564 delete_block (block)
1568 if (current_binding_level->blocks == block)
1569 current_binding_level->blocks = TREE_CHAIN (block);
1570 for (t = current_binding_level->blocks; t;)
1572 if (TREE_CHAIN (t) == block)
1573 TREE_CHAIN (t) = TREE_CHAIN (block);
1577 TREE_CHAIN (block) = NULL_TREE;
1578 /* Clear TREE_USED which is always set by poplevel.
1579 The flag is set again if insert_block is called. */
1580 TREE_USED (block) = 0;
1583 /* Insert BLOCK at the end of the list of subblocks of the
1584 current binding level. This is used when a BIND_EXPR is expanded,
1585 to handle the BLOCK node inside the BIND_EXPR. */
1588 insert_block (block)
1591 TREE_USED (block) = 1;
1592 current_binding_level->blocks
1593 = chainon (current_binding_level->blocks, block);
1596 /* Set the BLOCK node for the innermost scope
1597 (the one we are currently in). */
1601 register tree block;
1603 current_binding_level->this_block = block;
1606 /* Do a pushlevel for class declarations. */
1611 register struct binding_level *newlevel;
1613 /* Reuse or create a struct for this binding level. */
1614 #if defined(DEBUG_CP_BINDING_LEVELS)
1616 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1617 if (free_binding_level)
1618 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1620 newlevel = free_binding_level;
1621 free_binding_level = free_binding_level->level_chain;
1624 newlevel = make_binding_level ();
1626 #if defined(DEBUG_CP_BINDING_LEVELS)
1628 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1630 push_binding_level (newlevel, 0, 0);
1632 decl_stack = push_decl_level (decl_stack, &decl_obstack);
1633 class_binding_level = current_binding_level;
1634 class_binding_level->parm_flag = 2;
1635 /* We have just pushed into a new binding level. Now, fake out the rest
1636 of the compiler. Set the `current_binding_level' back to point to
1637 the most closely containing non-class binding level. */
1640 current_binding_level = current_binding_level->level_chain;
1642 while (current_binding_level->parm_flag == 2);
1645 /* ...and a poplevel for class declarations. FORCE is used to force
1646 clearing out of CLASS_VALUEs after a class definition. */
1649 poplevel_class (force)
1652 register struct binding_level *level = class_binding_level;
1653 tree block = NULL_TREE;
1656 my_friendly_assert (level != 0, 354);
1658 decl_stack = pop_stack_level (decl_stack);
1659 /* If we're leaving a toplevel class, don't bother to do the setting
1660 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1661 shouldn't even be used when current_class_type isn't set, and second,
1662 if we don't touch it here, we're able to use the cache effect if the
1663 next time we're entering a class scope, it is the same class. */
1664 if (current_class_depth != 1 || force)
1665 for (shadowed = level->class_shadowed;
1667 shadowed = TREE_CHAIN (shadowed))
1668 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = TREE_VALUE (shadowed);
1670 /* Remember to save what IDENTIFIER's were bound in this scope so we
1671 can recover from cache misses. */
1673 previous_class_type = current_class_type;
1674 previous_class_values = class_binding_level->class_shadowed;
1676 for (shadowed = level->type_shadowed;
1678 shadowed = TREE_CHAIN (shadowed))
1679 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1681 /* Remove the bindings for all of the class-level declarations. */
1682 for (shadowed = level->class_shadowed;
1684 shadowed = TREE_CHAIN (shadowed))
1685 pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1687 GNU_xref_end_scope ((HOST_WIDE_INT) class_binding_level,
1688 (HOST_WIDE_INT) class_binding_level->level_chain,
1689 class_binding_level->parm_flag,
1690 class_binding_level->keep);
1692 if (class_binding_level->parm_flag != 2)
1693 class_binding_level = (struct binding_level *)0;
1695 /* Now, pop out of the binding level which we created up in the
1696 `pushlevel_class' routine. */
1697 #if defined(DEBUG_CP_BINDING_LEVELS)
1699 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1701 pop_binding_level ();
1706 /* For debugging. */
1707 static int no_print_functions = 0;
1708 static int no_print_builtins = 0;
1711 print_binding_level (lvl)
1712 struct binding_level *lvl;
1716 fprintf (stderr, " blocks=");
1717 fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks);
1718 fprintf (stderr, " n_incomplete=%d parm_flag=%d keep=%d",
1719 list_length (lvl->incomplete), lvl->parm_flag, lvl->keep);
1720 if (lvl->tag_transparent)
1721 fprintf (stderr, " tag-transparent");
1722 if (lvl->more_cleanups_ok)
1723 fprintf (stderr, " more-cleanups-ok");
1724 if (lvl->have_cleanups)
1725 fprintf (stderr, " have-cleanups");
1726 fprintf (stderr, "\n");
1729 fprintf (stderr, " names:\t");
1730 /* We can probably fit 3 names to a line? */
1731 for (t = lvl->names; t; t = TREE_CHAIN (t))
1733 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
1735 if (no_print_builtins
1736 && (TREE_CODE (t) == TYPE_DECL)
1737 && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
1740 /* Function decls tend to have longer names. */
1741 if (TREE_CODE (t) == FUNCTION_DECL)
1748 fprintf (stderr, "\n\t");
1751 print_node_brief (stderr, "", t, 0);
1752 if (t == error_mark_node)
1756 fprintf (stderr, "\n");
1760 fprintf (stderr, " tags:\t");
1762 for (t = lvl->tags; t; t = TREE_CHAIN (t))
1764 if (TREE_PURPOSE (t) == NULL_TREE)
1766 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1773 fprintf (stderr, "\n\t");
1776 if (TREE_PURPOSE (t) == NULL_TREE)
1778 print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
1779 fprintf (stderr, ">");
1781 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1782 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1785 print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
1786 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1787 fprintf (stderr, ">");
1791 fprintf (stderr, "\n");
1793 if (lvl->class_shadowed)
1795 fprintf (stderr, " class-shadowed:");
1796 for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
1798 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1800 fprintf (stderr, "\n");
1802 if (lvl->type_shadowed)
1804 fprintf (stderr, " type-shadowed:");
1805 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
1807 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1809 fprintf (stderr, "\n");
1814 print_other_binding_stack (stack)
1815 struct binding_level *stack;
1817 struct binding_level *level;
1818 for (level = stack; level != global_binding_level; level = level->level_chain)
1820 fprintf (stderr, "binding level ");
1821 fprintf (stderr, HOST_PTR_PRINTF, level);
1822 fprintf (stderr, "\n");
1823 print_binding_level (level);
1828 print_binding_stack ()
1830 struct binding_level *b;
1831 fprintf (stderr, "current_binding_level=");
1832 fprintf (stderr, HOST_PTR_PRINTF, current_binding_level);
1833 fprintf (stderr, "\nclass_binding_level=");
1834 fprintf (stderr, HOST_PTR_PRINTF, class_binding_level);
1835 fprintf (stderr, "\nglobal_binding_level=");
1836 fprintf (stderr, HOST_PTR_PRINTF, global_binding_level);
1837 fprintf (stderr, "\n");
1838 if (class_binding_level)
1840 for (b = class_binding_level; b; b = b->level_chain)
1841 if (b == current_binding_level)
1844 b = class_binding_level;
1846 b = current_binding_level;
1849 b = current_binding_level;
1850 print_other_binding_stack (b);
1851 fprintf (stderr, "global:\n");
1852 print_binding_level (global_binding_level);
1855 /* Namespace binding access routines: The namespace_bindings field of
1856 the identifier is polymorphic, with three possible values:
1857 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
1858 indicating the BINDING_VALUE of global_namespace. */
1860 /* Check whether the a binding for the name to scope is known.
1861 Assumes that the bindings of the name are already a list
1862 of bindings. Returns the binding found, or NULL_TREE. */
1865 find_binding (name, scope)
1869 tree iter, prev = NULL_TREE;
1871 scope = ORIGINAL_NAMESPACE (scope);
1873 for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
1874 iter = TREE_CHAIN (iter))
1876 my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
1877 if (BINDING_SCOPE (iter) == scope)
1879 /* Move binding found to the fron of the list, so
1880 subsequent lookups will find it faster. */
1883 TREE_CHAIN (prev) = TREE_CHAIN (iter);
1884 TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
1885 IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
1894 /* Always returns a binding for name in scope. If the
1895 namespace_bindings is not a list, convert it to one first.
1896 If no binding is found, make a new one. */
1899 binding_for_name (name, scope)
1903 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
1906 scope = ORIGINAL_NAMESPACE (scope);
1908 if (b && TREE_CODE (b) != CPLUS_BINDING)
1910 /* Get rid of optimization for global scope. */
1911 IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
1912 BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
1913 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
1915 if (b && (result = find_binding (name, scope)))
1917 /* Not found, make a new permanent one. */
1918 push_obstacks (&permanent_obstack, &permanent_obstack);
1919 result = make_node (CPLUS_BINDING);
1920 TREE_CHAIN (result) = b;
1921 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
1922 BINDING_SCOPE (result) = scope;
1923 BINDING_TYPE (result) = NULL_TREE;
1924 BINDING_VALUE (result) = NULL_TREE;
1929 /* Return the binding value for name in scope, considering that
1930 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
1933 namespace_binding (name, scope)
1937 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
1940 if (scope == NULL_TREE)
1941 scope = global_namespace;
1942 if (TREE_CODE (b) != CPLUS_BINDING)
1943 return (scope == global_namespace) ? b : NULL_TREE;
1944 name = find_binding (name,scope);
1945 if (name == NULL_TREE)
1947 return BINDING_VALUE (name);
1950 /* Set the binding value for name in scope. If modifying the binding
1951 of global_namespace is attempted, try to optimize it. */
1954 set_namespace_binding (name, scope, val)
1961 if (scope == NULL_TREE)
1962 scope = global_namespace;
1964 if (scope == global_namespace)
1966 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
1967 if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
1969 IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
1973 b = binding_for_name (name, scope);
1974 BINDING_VALUE (b) = val;
1977 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
1978 select a name that is unique to this compilation unit. */
1981 push_namespace (name)
1986 int implicit_use = 0;
1988 if (!global_namespace)
1990 /* This must be ::. */
1991 my_friendly_assert (name == get_identifier ("::"), 377);
1996 /* The name of anonymous namespace is unique for the translation
1998 if (!anonymous_namespace_name)
1999 anonymous_namespace_name = get_file_function_name ('N');
2000 name = anonymous_namespace_name;
2001 d = IDENTIFIER_NAMESPACE_VALUE (name);
2003 /* Reopening anonymous namespace. */
2007 else if (current_namespace == global_namespace
2008 && name == DECL_NAME (std_node))
2015 /* Check whether this is an extended namespace definition. */
2016 d = IDENTIFIER_NAMESPACE_VALUE (name);
2017 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2020 if (DECL_NAMESPACE_ALIAS (d))
2022 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2023 d, DECL_NAMESPACE_ALIAS (d));
2024 d = DECL_NAMESPACE_ALIAS (d);
2031 /* Make a new namespace, binding the name to it. */
2032 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2033 /* The global namespace is not pushed, and the global binding
2034 level is set elsewhere. */
2039 declare_namespace_level ();
2040 NAMESPACE_LEVEL (d) = current_binding_level;
2044 resume_binding_level (NAMESPACE_LEVEL (d));
2047 do_using_directive (d);
2048 /* Enter the name space. */
2049 current_namespace = d;
2052 /* Pop from the scope of the current namespace. */
2057 if (current_namespace == global_namespace)
2059 my_friendly_assert (in_std>0, 980421);
2063 current_namespace = CP_DECL_CONTEXT (current_namespace);
2064 /* The binding level is not popped, as it might be re-opened later. */
2065 suspend_binding_level ();
2068 /* Concatenate the binding levels of all namespaces. */
2071 cat_namespace_levels()
2075 struct binding_level *b;
2077 last = NAMESPACE_LEVEL (global_namespace) -> names;
2078 /* The nested namespaces appear in the names list of their ancestors. */
2079 for (current = last; current; current = TREE_CHAIN (current))
2081 if (TREE_CODE (current) != NAMESPACE_DECL
2082 || DECL_NAMESPACE_ALIAS (current))
2084 if (!DECL_LANG_SPECIFIC (current))
2087 my_friendly_assert (current == std_node, 393);
2090 b = NAMESPACE_LEVEL (current);
2091 while (TREE_CHAIN (last))
2092 last = TREE_CHAIN (last);
2093 TREE_CHAIN (last) = NAMESPACE_LEVEL (current) -> names;
2097 /* Subroutines for reverting temporarily to top-level for instantiation
2098 of templates and such. We actually need to clear out the class- and
2099 local-value slots of all identifiers, so that only the global values
2100 are at all visible. Simply setting current_binding_level to the global
2101 scope isn't enough, because more binding levels may be pushed. */
2102 struct saved_scope {
2103 struct binding_level *old_binding_level;
2106 struct saved_scope *prev;
2107 tree class_name, class_type;
2108 tree access_specifier;
2110 struct binding_level *class_bindings;
2111 tree *lang_base, *lang_stack, lang_name;
2113 int minimal_parse_mode;
2114 tree last_function_parms;
2115 tree template_parms;
2116 HOST_WIDE_INT processing_template_decl;
2117 tree previous_class_type, previous_class_values;
2118 int processing_specialization;
2119 int processing_explicit_instantiation;
2121 static struct saved_scope *current_saved_scope;
2123 /* A chain of the binding vecs created by store_bindings. We create a
2124 whole bunch of these during compilation, on permanent_obstack, so we
2125 can't just throw them away. */
2126 static tree free_binding_vecs;
2129 store_bindings (names, old_bindings)
2130 tree names, old_bindings;
2133 for (t = names; t; t = TREE_CHAIN (t))
2135 tree binding, t1, id;
2137 if (TREE_CODE (t) == TREE_LIST)
2138 id = TREE_PURPOSE (t);
2143 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2144 we have no IDENTIFIER_BINDING if we have left the class
2145 scope, but cached the class-level declarations. */
2146 || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2149 for (t1 = old_bindings; t1; t1 = TREE_CHAIN (t1))
2150 if (TREE_VEC_ELT (t1, 0) == id)
2153 if (free_binding_vecs)
2155 binding = free_binding_vecs;
2156 free_binding_vecs = TREE_CHAIN (free_binding_vecs);
2159 binding = make_tree_vec (4);
2163 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2164 TREE_VEC_ELT (binding, 0) = id;
2165 TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2166 TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2167 TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2168 IDENTIFIER_BINDING (id) = NULL_TREE;
2169 IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2171 TREE_CHAIN (binding) = old_bindings;
2172 old_bindings = binding;
2176 return old_bindings;
2180 maybe_push_to_top_level (pseudo)
2183 extern int current_lang_stacksize;
2184 struct saved_scope *s
2185 = (struct saved_scope *) xmalloc (sizeof (struct saved_scope));
2186 struct binding_level *b = inner_binding_level;
2187 tree old_bindings = NULL_TREE;
2189 if (current_function_decl)
2190 push_cp_function_context (NULL_TREE);
2192 if (previous_class_type)
2193 old_bindings = store_bindings (previous_class_values, old_bindings);
2195 /* Have to include global_binding_level, because class-level decls
2196 aren't listed anywhere useful. */
2197 for (; b; b = b->level_chain)
2201 /* Template IDs are inserted into the global level. If they were
2202 inserted into namespace level, finish_file wouldn't find them
2203 when doing pending instantiations. Therefore, don't stop at
2204 namespace level, but continue until :: . */
2205 if (b == global_binding_level || (pseudo && b->pseudo_global))
2208 old_bindings = store_bindings (b->names, old_bindings);
2209 /* We also need to check class_shadowed to save class-level type
2210 bindings, since pushclass doesn't fill in b->names. */
2211 if (b->parm_flag == 2)
2212 old_bindings = store_bindings (b->class_shadowed, old_bindings);
2214 /* Unwind type-value slots back to top level. */
2215 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2216 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2219 s->old_binding_level = current_binding_level;
2220 current_binding_level = b;
2222 s->old_namespace = current_namespace;
2223 s->class_name = current_class_name;
2224 s->class_type = current_class_type;
2225 s->access_specifier = current_access_specifier;
2226 s->function_decl = current_function_decl;
2227 s->class_bindings = class_binding_level;
2228 s->lang_stack = current_lang_stack;
2229 s->lang_base = current_lang_base;
2230 s->lang_stacksize = current_lang_stacksize;
2231 s->lang_name = current_lang_name;
2232 s->minimal_parse_mode = minimal_parse_mode;
2233 s->last_function_parms = last_function_parms;
2234 s->template_parms = current_template_parms;
2235 s->processing_template_decl = processing_template_decl;
2236 s->previous_class_type = previous_class_type;
2237 s->previous_class_values = previous_class_values;
2238 s->processing_specialization = processing_specialization;
2239 s->processing_explicit_instantiation = processing_explicit_instantiation;
2241 current_class_name = current_class_type = NULL_TREE;
2242 current_function_decl = NULL_TREE;
2243 class_binding_level = (struct binding_level *)0;
2244 current_lang_stacksize = 10;
2245 current_lang_stack = current_lang_base
2246 = (tree *) xmalloc (current_lang_stacksize * sizeof (tree));
2247 current_lang_name = lang_name_cplusplus;
2248 strict_prototype = strict_prototypes_lang_cplusplus;
2249 named_labels = NULL_TREE;
2250 shadowed_labels = NULL_TREE;
2251 minimal_parse_mode = 0;
2252 previous_class_type = previous_class_values = NULL_TREE;
2253 processing_specialization = 0;
2254 processing_explicit_instantiation = 0;
2255 current_template_parms = NULL_TREE;
2256 processing_template_decl = 0;
2257 current_namespace = global_namespace;
2259 s->prev = current_saved_scope;
2260 s->old_bindings = old_bindings;
2261 current_saved_scope = s;
2263 push_obstacks (&permanent_obstack, &permanent_obstack);
2267 push_to_top_level ()
2269 maybe_push_to_top_level (0);
2273 pop_from_top_level ()
2275 extern int current_lang_stacksize;
2276 struct saved_scope *s = current_saved_scope;
2279 /* Clear out class-level bindings cache. */
2280 if (previous_class_type)
2283 previous_class_type = NULL_TREE;
2288 current_binding_level = s->old_binding_level;
2289 current_saved_scope = s->prev;
2290 for (t = s->old_bindings; t; )
2293 tree id = TREE_VEC_ELT (t, 0);
2296 SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2297 IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2298 IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2301 TREE_CHAIN (save) = free_binding_vecs;
2302 free_binding_vecs = save;
2304 current_namespace = s->old_namespace;
2305 current_class_name = s->class_name;
2306 current_class_type = s->class_type;
2307 current_access_specifier = s->access_specifier;
2308 current_function_decl = s->function_decl;
2309 class_binding_level = s->class_bindings;
2310 free (current_lang_base);
2311 current_lang_base = s->lang_base;
2312 current_lang_stack = s->lang_stack;
2313 current_lang_name = s->lang_name;
2314 current_lang_stacksize = s->lang_stacksize;
2315 if (current_lang_name == lang_name_cplusplus)
2316 strict_prototype = strict_prototypes_lang_cplusplus;
2317 else if (current_lang_name == lang_name_c)
2318 strict_prototype = strict_prototypes_lang_c;
2319 minimal_parse_mode = s->minimal_parse_mode;
2320 last_function_parms = s->last_function_parms;
2321 current_template_parms = s->template_parms;
2322 processing_template_decl = s->processing_template_decl;
2323 previous_class_type = s->previous_class_type;
2324 previous_class_values = s->previous_class_values;
2325 processing_specialization = s->processing_specialization;
2326 processing_explicit_instantiation = s->processing_explicit_instantiation;
2330 if (current_function_decl)
2331 pop_cp_function_context (NULL_TREE);
2334 /* Push a definition of struct, union or enum tag "name".
2335 into binding_level "b". "type" should be the type node,
2336 We assume that the tag "name" is not already defined.
2338 Note that the definition may really be just a forward reference.
2339 In that case, the TYPE_SIZE will be a NULL_TREE.
2341 C++ gratuitously puts all these tags in the name space. */
2343 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2344 record the shadowed value for this binding contour. TYPE is
2345 the type that ID maps to. */
2348 set_identifier_type_value_with_scope (id, type, b)
2351 struct binding_level *b;
2353 if (!b->namespace_p)
2355 /* Shadow the marker, not the real thing, so that the marker
2356 gets restored later. */
2357 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2359 = tree_cons (id, old_type_value, b->type_shadowed);
2363 tree binding = binding_for_name (id, current_namespace);
2364 BINDING_TYPE (binding) = type;
2365 /* Store marker instead of real type. */
2366 type = global_type_node;
2368 SET_IDENTIFIER_TYPE_VALUE (id, type);
2371 /* As set_identifier_type_value_with_scope, but using inner_binding_level. */
2374 set_identifier_type_value (id, type)
2378 set_identifier_type_value_with_scope (id, type, inner_binding_level);
2381 /* Return the type associated with id. */
2384 identifier_type_value (id)
2387 /* There is no type with that name, anywhere. */
2388 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2390 /* This is not the type marker, but the real thing. */
2391 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2392 return REAL_IDENTIFIER_TYPE_VALUE (id);
2393 /* Have to search for it. It must be on the global level, now.
2394 Ask lookup_name not to return non-types. */
2395 id = lookup_name_real (id, 2, 1, 0);
2397 return TREE_TYPE (id);
2401 /* Pop off extraneous binding levels left over due to syntax errors.
2403 We don't pop past namespaces, as they might be valid. */
2408 #ifdef DEBUG_CP_BINDING_LEVELS
2409 fprintf (stderr, "XXX entering pop_everything ()\n");
2411 while (! toplevel_bindings_p () && ! pseudo_global_level_p ())
2413 if (class_binding_level)
2414 pop_nested_class (1);
2418 #ifdef DEBUG_CP_BINDING_LEVELS
2419 fprintf (stderr, "XXX leaving pop_everything ()\n");
2423 /* The type TYPE is being declared. If it is a class template, or a
2424 specialization of a class template, do any processing required and
2425 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2426 being declared a friend. B is the binding level at which this TYPE
2429 Returns the TYPE_DECL for TYPE, which may have been altered by this
2433 maybe_process_template_type_declaration (type, globalize, b)
2436 struct binding_level* b;
2438 tree decl = TYPE_NAME (type);
2440 if (processing_template_parmlist)
2441 /* You can't declare a new template type in a template parameter
2442 list. But, you can declare a non-template type:
2444 template <class A*> struct S;
2446 is a forward-declaration of `A'. */
2450 maybe_check_template_type (type);
2452 my_friendly_assert (IS_AGGR_TYPE (type)
2453 || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2456 if (/* If !GLOBALIZE then we are looking at a definition.
2457 It may not be a primary template. (For example, in:
2460 struct S1 { class S2 {}; }
2462 we have to push_template_decl for S2.) */
2463 (processing_template_decl && !globalize)
2464 /* If we are declaring a friend template class, we will
2465 have GLOBALIZE set, since something like:
2473 declares S2 to be at global scope. */
2474 || PROCESSING_REAL_TEMPLATE_DECL_P ())
2476 /* This may change after the call to
2477 push_template_decl_real, but we want the original value. */
2478 tree name = DECL_NAME (decl);
2480 decl = push_template_decl_real (decl, globalize);
2481 /* If the current binding level is the binding level for the
2482 template parameters (see the comment in
2483 begin_template_parm_list) and the enclosing level is a class
2484 scope, and we're not looking at a friend, push the
2485 declaration of the member class into the class scope. In the
2486 friend case, push_template_decl will already have put the
2487 friend into global scope, if appropriate. */
2488 if (TREE_CODE (type) != ENUMERAL_TYPE
2489 && !globalize && b->pseudo_global
2490 && b->level_chain->parm_flag == 2)
2492 pushdecl_with_scope (CLASSTYPE_TI_TEMPLATE (type),
2494 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2495 /* Put this tag on the list of tags for the class, since
2496 that won't happen below because B is not the class
2497 binding level, but is instead the pseudo-global level. */
2498 b->level_chain->tags =
2499 saveable_tree_cons (name, type, b->level_chain->tags);
2500 TREE_NONLOCAL_FLAG (type) = 1;
2501 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2502 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2510 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2511 Normally put it into the inner-most non-tag-transparent scope,
2512 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2513 The latter is needed for implicit declarations. */
2516 pushtag (name, type, globalize)
2520 register struct binding_level *b;
2524 b = inner_binding_level;
2525 while (b->tag_transparent
2526 || (globalize && b->parm_flag == 2))
2529 if (toplevel_bindings_p ())
2530 b->tags = perm_tree_cons (name, type, b->tags);
2532 b->tags = saveable_tree_cons (name, type, b->tags);
2536 context = type ? TYPE_CONTEXT (type) : NULL_TREE;
2539 tree cs = current_scope ();
2543 else if (cs != NULL_TREE
2544 && TREE_CODE_CLASS (TREE_CODE (cs)) == 't')
2545 /* When declaring a friend class of a local class, we want
2546 to inject the newly named class into the scope
2547 containing the local class, not the namespace scope. */
2548 context = hack_decl_function_context (get_type_decl (cs));
2551 c_decl = TREE_CODE (context) == FUNCTION_DECL
2552 ? context : TYPE_MAIN_DECL (context);
2555 context = current_namespace;
2557 /* Do C++ gratuitous typedefing. */
2558 if (IDENTIFIER_TYPE_VALUE (name) != type)
2560 register tree d = NULL_TREE;
2561 int newdecl = 0, in_class = 0;
2563 if ((b->pseudo_global && b->level_chain->parm_flag == 2)
2564 || b->parm_flag == 2)
2567 d = lookup_nested_type (type, c_decl);
2572 d = build_decl (TYPE_DECL, name, type);
2573 if (current_lang_name == lang_name_java)
2574 TYPE_FOR_JAVA (type) = 1;
2575 SET_DECL_ARTIFICIAL (d);
2577 set_identifier_type_value_with_scope (name, type, b);
2580 d = TYPE_MAIN_DECL (d);
2582 TYPE_NAME (type) = d;
2583 DECL_CONTEXT (d) = FROB_CONTEXT (context);
2585 d = maybe_process_template_type_declaration (type,
2588 if (b->parm_flag == 2)
2590 pushdecl_class_level (d);
2591 if (newdecl && !PROCESSING_REAL_TEMPLATE_DECL_P ())
2592 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2593 class. But if it's a member template class, we
2594 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2596 finish_member_declaration (d);
2599 d = pushdecl_with_scope (d, b);
2603 if (ANON_AGGRNAME_P (name))
2604 DECL_IGNORED_P (d) = 1;
2606 TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2607 DECL_ASSEMBLER_NAME (d) = DECL_NAME (d);
2608 if (!uses_template_parms (type))
2609 DECL_ASSEMBLER_NAME (d)
2610 = get_identifier (build_overload_name (type, 1, 1));
2613 if (b->parm_flag == 2)
2615 TREE_NONLOCAL_FLAG (type) = 1;
2616 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2617 CLASSTYPE_TAGS (current_class_type) = b->tags;
2621 if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2622 /* Use the canonical TYPE_DECL for this node. */
2623 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2626 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2627 will be the tagged type we just added to the current
2628 binding level. This fake NULL-named TYPE_DECL node helps
2629 dwarfout.c to know when it needs to output a
2630 representation of a tagged type, and it also gives us a
2631 convenient place to record the "scope start" address for
2634 tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2635 TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2639 /* Counter used to create anonymous type names. */
2641 static int anon_cnt = 0;
2643 /* Return an IDENTIFIER which can be used as a name for
2644 anonymous structs and unions. */
2651 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2652 return get_identifier (buf);
2655 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2656 This keeps dbxout from getting confused. */
2661 register struct binding_level *b;
2663 static int last_cnt = 0;
2665 /* Fast out if no new anon names were declared. */
2666 if (last_cnt == anon_cnt)
2669 b = current_binding_level;
2670 while (b->tag_transparent)
2675 /* A NULL purpose means we have already processed all tags
2676 from here to the end of the list. */
2677 if (TREE_PURPOSE (tags) == NULL_TREE)
2679 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2680 TREE_PURPOSE (tags) = NULL_TREE;
2681 tags = TREE_CHAIN (tags);
2683 last_cnt = anon_cnt;
2686 /* Subroutine of duplicate_decls: return truthvalue of whether
2687 or not types of these decls match.
2689 For C++, we must compare the parameter list so that `int' can match
2690 `int&' in a parameter position, but `int&' is not confused with
2694 decls_match (newdecl, olddecl)
2695 tree newdecl, olddecl;
2699 if (newdecl == olddecl)
2702 if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
2703 /* If the two DECLs are not even the same kind of thing, we're not
2704 interested in their types. */
2707 if (TREE_CODE (newdecl) == FUNCTION_DECL)
2709 tree f1 = TREE_TYPE (newdecl);
2710 tree f2 = TREE_TYPE (olddecl);
2711 tree p1 = TYPE_ARG_TYPES (f1);
2712 tree p2 = TYPE_ARG_TYPES (f2);
2714 if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl)
2715 && ! (DECL_LANGUAGE (newdecl) == lang_c
2716 && DECL_LANGUAGE (olddecl) == lang_c))
2719 /* When we parse a static member function definition,
2720 we put together a FUNCTION_DECL which thinks its type
2721 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2723 if (TREE_CODE (f1) == METHOD_TYPE && DECL_STATIC_FUNCTION_P (olddecl))
2724 revert_static_member_fn (&newdecl, &f1, &p1);
2725 else if (TREE_CODE (f2) == METHOD_TYPE
2726 && DECL_STATIC_FUNCTION_P (newdecl))
2727 revert_static_member_fn (&olddecl, &f2, &p2);
2729 /* Here we must take care of the case where new default
2730 parameters are specified. Also, warn if an old
2731 declaration becomes ambiguous because default
2732 parameters may cause the two to be ambiguous. */
2733 if (TREE_CODE (f1) != TREE_CODE (f2))
2735 if (TREE_CODE (f1) == OFFSET_TYPE)
2736 cp_compiler_error ("`%D' redeclared as member function", newdecl);
2738 cp_compiler_error ("`%D' redeclared as non-member function", newdecl);
2742 if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
2744 if (! strict_prototypes_lang_c && DECL_LANGUAGE (olddecl) == lang_c
2747 types_match = self_promoting_args_p (p1);
2748 if (p1 == void_list_node)
2749 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2751 else if (!strict_prototypes_lang_c && DECL_LANGUAGE (olddecl)==lang_c
2752 && DECL_LANGUAGE (newdecl) == lang_c && p1 == NULL_TREE)
2754 types_match = self_promoting_args_p (p2);
2755 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2758 types_match = compparms (p1, p2);
2763 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
2765 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
2766 DECL_TEMPLATE_PARMS (olddecl)))
2769 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
2772 types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
2773 DECL_TEMPLATE_RESULT (newdecl));
2777 if (TREE_TYPE (newdecl) == error_mark_node)
2778 types_match = TREE_TYPE (olddecl) == error_mark_node;
2779 else if (TREE_TYPE (olddecl) == NULL_TREE)
2780 types_match = TREE_TYPE (newdecl) == NULL_TREE;
2781 else if (TREE_TYPE (newdecl) == NULL_TREE)
2784 types_match = comptypes (TREE_TYPE (newdecl),
2785 TREE_TYPE (olddecl),
2786 COMPARE_REDECLARATION);
2792 /* If NEWDECL is `static' and an `extern' was seen previously,
2793 warn about it. (OLDDECL may be NULL_TREE; NAME contains
2794 information about previous usage as an `extern'.)
2796 Note that this does not apply to the C++ case of declaring
2797 a variable `extern const' and then later `const'.
2799 Don't complain about built-in functions, since they are beyond
2800 the user's control. */
2803 warn_extern_redeclared_static (newdecl, olddecl)
2804 tree newdecl, olddecl;
2808 static char *explicit_extern_static_warning
2809 = "`%D' was declared `extern' and later `static'";
2810 static char *implicit_extern_static_warning
2811 = "`%D' was declared implicitly `extern' and later `static'";
2813 if (TREE_CODE (newdecl) == TYPE_DECL)
2816 name = DECL_ASSEMBLER_NAME (newdecl);
2817 if (TREE_PUBLIC (name) && DECL_THIS_STATIC (newdecl))
2819 /* It's okay to redeclare an ANSI built-in function as static,
2820 or to declare a non-ANSI built-in function as anything. */
2821 if (! (TREE_CODE (newdecl) == FUNCTION_DECL
2822 && olddecl != NULL_TREE
2823 && TREE_CODE (olddecl) == FUNCTION_DECL
2824 && (DECL_BUILT_IN (olddecl)
2825 || DECL_BUILT_IN_NONANSI (olddecl))))
2827 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
2828 ? implicit_extern_static_warning
2829 : explicit_extern_static_warning, newdecl);
2830 if (olddecl != NULL_TREE)
2831 cp_pedwarn_at ("previous declaration of `%D'", olddecl);
2836 /* Handle when a new declaration NEWDECL has the same name as an old
2837 one OLDDECL in the same binding contour. Prints an error message
2840 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2841 Otherwise, return 0. */
2844 duplicate_decls (newdecl, olddecl)
2845 tree newdecl, olddecl;
2847 extern struct obstack permanent_obstack;
2848 unsigned olddecl_uid = DECL_UID (olddecl);
2849 int olddecl_friend = 0, types_match = 0;
2850 int new_defines_function = 0;
2852 if (newdecl == olddecl)
2855 types_match = decls_match (newdecl, olddecl);
2857 /* If either the type of the new decl or the type of the old decl is an
2858 error_mark_node, then that implies that we have already issued an
2859 error (earlier) for some bogus type specification, and in that case,
2860 it is rather pointless to harass the user with yet more error message
2861 about the same declaration, so just pretend the types match here. */
2862 if (TREE_TYPE (newdecl) == error_mark_node
2863 || TREE_TYPE (olddecl) == error_mark_node)
2866 /* Check for redeclaration and other discrepancies. */
2867 if (TREE_CODE (olddecl) == FUNCTION_DECL
2868 && DECL_ARTIFICIAL (olddecl)
2869 && (DECL_BUILT_IN (olddecl) || DECL_BUILT_IN_NONANSI (olddecl)))
2871 /* If you declare a built-in or predefined function name as static,
2872 the old definition is overridden, but optionally warn this was a
2873 bad choice of name. Ditto for overloads. */
2874 if (! TREE_PUBLIC (newdecl)
2875 || (TREE_CODE (newdecl) == FUNCTION_DECL
2876 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl)))
2879 cp_warning ("shadowing %s function `%#D'",
2880 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
2882 /* Discard the old built-in function. */
2885 else if (! types_match)
2887 if (TREE_CODE (newdecl) != FUNCTION_DECL)
2889 /* If the built-in is not ansi, then programs can override
2890 it even globally without an error. */
2891 if (! DECL_BUILT_IN (olddecl))
2892 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2896 cp_error ("declaration of `%#D'", newdecl);
2897 cp_error ("conflicts with built-in declaration `%#D'",
2903 cp_warning ("declaration of `%#D'", newdecl);
2904 cp_warning ("conflicts with built-in declaration `%#D'",
2908 else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
2910 if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
2911 && TREE_CODE (newdecl) != TYPE_DECL
2912 && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
2913 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
2914 || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
2915 && TREE_CODE (olddecl) != TYPE_DECL
2916 && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
2917 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
2920 /* We do nothing special here, because C++ does such nasty
2921 things with TYPE_DECLs. Instead, just let the TYPE_DECL
2922 get shadowed, and know that if we need to find a TYPE_DECL
2923 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
2924 slot of the identifier. */
2928 if ((TREE_CODE (newdecl) == FUNCTION_DECL
2929 && DECL_FUNCTION_TEMPLATE_P (olddecl))
2930 || (TREE_CODE (olddecl) == FUNCTION_DECL
2931 && DECL_FUNCTION_TEMPLATE_P (newdecl)))
2934 cp_error ("`%#D' redeclared as different kind of symbol", newdecl);
2935 if (TREE_CODE (olddecl) == TREE_LIST)
2936 olddecl = TREE_VALUE (olddecl);
2937 cp_error_at ("previous declaration of `%#D'", olddecl);
2939 /* New decl is completely inconsistent with the old one =>
2940 tell caller to replace the old one. */
2944 else if (!types_match)
2946 if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl))
2947 /* These are certainly not duplicate declarations; they're
2948 from different scopes. */
2951 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
2953 /* The name of a class template may not be declared to refer to
2954 any other template, class, function, object, namespace, value,
2955 or type in the same scope. */
2956 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
2957 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
2959 cp_error ("declaration of template `%#D'", newdecl);
2960 cp_error_at ("conflicts with previous declaration `%#D'",
2963 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
2964 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
2965 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
2966 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
2967 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
2968 DECL_TEMPLATE_PARMS (olddecl)))
2970 cp_error ("new declaration `%#D'", newdecl);
2971 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
2975 if (TREE_CODE (newdecl) == FUNCTION_DECL)
2977 if (DECL_LANGUAGE (newdecl) == lang_c
2978 && DECL_LANGUAGE (olddecl) == lang_c)
2980 cp_error ("declaration of C function `%#D' conflicts with",
2982 cp_error_at ("previous declaration `%#D' here", olddecl);
2984 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
2985 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
2987 cp_error ("new declaration `%#D'", newdecl);
2988 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
2994 /* Already complained about this, so don't do so again. */
2995 else if (current_class_type == NULL_TREE
2996 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
2998 cp_error ("conflicting types for `%#D'", newdecl);
2999 cp_error_at ("previous declaration as `%#D'", olddecl);
3002 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3003 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3004 && (!DECL_TEMPLATE_INFO (newdecl)
3005 || (DECL_TI_TEMPLATE (newdecl)
3006 != DECL_TI_TEMPLATE (olddecl))))
3007 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3008 && (!DECL_TEMPLATE_INFO (olddecl)
3009 || (DECL_TI_TEMPLATE (olddecl)
3010 != DECL_TI_TEMPLATE (newdecl))))))
3011 /* It's OK to have a template specialization and a non-template
3012 with the same type, or to have specializations of two
3013 different templates with the same type. Note that if one is a
3014 specialization, and the other is an instantiation of the same
3015 template, that we do not exit at this point. That situation
3016 can occur if we instantiate a template class, and then
3017 specialize one of its methods. This situation is legal, but
3018 the declarations must be merged in the usual way. */
3020 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3021 && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3022 && !DECL_USE_TEMPLATE (newdecl))
3023 || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3024 && !DECL_USE_TEMPLATE (olddecl))))
3025 /* One of the declarations is a template instantiation, and the
3026 other is not a template at all. That's OK. */
3028 else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3029 && DECL_NAMESPACE_ALIAS (newdecl)
3030 && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3031 /* Redeclaration of namespace alias, ignore it. */
3035 char *errmsg = redeclaration_error_message (newdecl, olddecl);
3038 cp_error (errmsg, newdecl);
3039 if (DECL_NAME (olddecl) != NULL_TREE)
3040 cp_error_at ((DECL_INITIAL (olddecl)
3041 && namespace_bindings_p ())
3042 ? "`%#D' previously defined here"
3043 : "`%#D' previously declared here", olddecl);
3045 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3046 && DECL_INITIAL (olddecl) != NULL_TREE
3047 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3048 && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3050 /* Prototype decl follows defn w/o prototype. */
3051 cp_warning_at ("prototype for `%#D'", newdecl);
3052 cp_warning_at ("follows non-prototype definition here", olddecl);
3054 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3055 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3057 /* extern "C" int foo ();
3058 int foo () { bar (); }
3060 if (current_lang_stack == current_lang_base)
3061 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3064 cp_error_at ("previous declaration of `%#D' with %L linkage",
3065 olddecl, DECL_LANGUAGE (olddecl));
3066 cp_error ("conflicts with new declaration with %L linkage",
3067 DECL_LANGUAGE (newdecl));
3071 if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3073 else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3075 tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3076 tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3079 if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3080 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3082 for (; t1 && t1 != void_list_node;
3083 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3084 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3086 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3091 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3093 cp_pedwarn_at ("after previous specification in `%#D'",
3099 cp_error ("default argument given for parameter %d of `%#D'",
3101 cp_error_at ("after previous specification in `%#D'",
3106 if (DECL_THIS_INLINE (newdecl) && ! DECL_THIS_INLINE (olddecl)
3107 && TREE_ADDRESSABLE (olddecl) && warn_inline)
3109 cp_warning ("`%#D' was used before it was declared inline",
3111 cp_warning_at ("previous non-inline declaration here",
3117 /* If new decl is `static' and an `extern' was seen previously,
3119 warn_extern_redeclared_static (newdecl, olddecl);
3121 /* We have committed to returning 1 at this point. */
3122 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3124 /* Now that functions must hold information normally held
3125 by field decls, there is extra work to do so that
3126 declaration information does not get destroyed during
3128 if (DECL_VINDEX (olddecl))
3129 DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3130 if (DECL_CONTEXT (olddecl))
3131 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3132 if (DECL_CLASS_CONTEXT (olddecl))
3133 DECL_CLASS_CONTEXT (newdecl) = DECL_CLASS_CONTEXT (olddecl);
3134 if (DECL_PENDING_INLINE_INFO (newdecl) == (struct pending_inline *)0)
3135 DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3136 DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3137 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3138 DECL_ABSTRACT_VIRTUAL_P (newdecl) |= DECL_ABSTRACT_VIRTUAL_P (olddecl);
3139 DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3140 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3141 new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3143 /* Optionally warn about more than one declaration for the same
3144 name, but don't warn about a function declaration followed by a
3146 if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3147 && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3148 /* Don't warn about extern decl followed by definition. */
3149 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3150 /* Don't warn about friends, let add_friend take care of it. */
3151 && ! DECL_FRIEND_P (newdecl))
3153 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl);
3154 cp_warning_at ("previous declaration of `%D'", olddecl);
3158 /* Deal with C++: must preserve virtual function table size. */
3159 if (TREE_CODE (olddecl) == TYPE_DECL)
3161 register tree newtype = TREE_TYPE (newdecl);
3162 register tree oldtype = TREE_TYPE (olddecl);
3164 if (newtype != error_mark_node && oldtype != error_mark_node
3165 && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3167 CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3168 CLASSTYPE_FRIEND_CLASSES (newtype)
3169 = CLASSTYPE_FRIEND_CLASSES (oldtype);
3173 /* Copy all the DECL_... slots specified in the new decl
3174 except for any that we copy here from the old type. */
3175 DECL_MACHINE_ATTRIBUTES (newdecl)
3176 = merge_machine_decl_attributes (olddecl, newdecl);
3178 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3180 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl),
3181 DECL_TEMPLATE_RESULT (olddecl)))
3182 cp_error ("invalid redeclaration of %D", newdecl);
3183 TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3184 DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3185 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3186 DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3193 /* Automatically handles default parameters. */
3194 tree oldtype = TREE_TYPE (olddecl);
3197 /* Make sure we put the new type in the same obstack as the old one. */
3199 push_obstacks (TYPE_OBSTACK (oldtype), TYPE_OBSTACK (oldtype));
3202 push_obstacks_nochange ();
3203 end_temporary_allocation ();
3206 /* Merge the data types specified in the two decls. */
3207 newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3209 if (TREE_CODE (newdecl) == VAR_DECL)
3210 DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3211 /* Do this after calling `common_type' so that default
3212 parameters don't confuse us. */
3213 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3214 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3215 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3217 TREE_TYPE (newdecl) = build_exception_variant (newtype,
3218 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3219 TREE_TYPE (olddecl) = build_exception_variant (newtype,
3220 TYPE_RAISES_EXCEPTIONS (oldtype));
3222 if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3223 && DECL_SOURCE_LINE (olddecl) != 0
3225 && ! compexcepttypes (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
3227 cp_pedwarn ("declaration of `%D' throws different exceptions",
3229 cp_pedwarn_at ("previous declaration here", olddecl);
3232 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3234 /* Lay the type out, unless already done. */
3235 if (newtype != canonical_type_variant (oldtype)
3236 && TREE_TYPE (newdecl) != error_mark_node
3237 && !(processing_template_decl && uses_template_parms (newdecl)))
3238 layout_type (TREE_TYPE (newdecl));
3240 if ((TREE_CODE (newdecl) == VAR_DECL
3241 || TREE_CODE (newdecl) == PARM_DECL
3242 || TREE_CODE (newdecl) == RESULT_DECL
3243 || TREE_CODE (newdecl) == FIELD_DECL
3244 || TREE_CODE (newdecl) == TYPE_DECL)
3245 && !(processing_template_decl && uses_template_parms (newdecl)))
3246 layout_decl (newdecl, 0);
3248 /* Merge the type qualifiers. */
3249 if (TREE_READONLY (newdecl))
3250 TREE_READONLY (olddecl) = 1;
3251 if (TREE_THIS_VOLATILE (newdecl))
3252 TREE_THIS_VOLATILE (olddecl) = 1;
3254 /* Merge the initialization information. */
3255 if (DECL_INITIAL (newdecl) == NULL_TREE
3256 && DECL_INITIAL (olddecl) != NULL_TREE)
3258 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3259 DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3260 DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3261 if (DECL_LANG_SPECIFIC (newdecl)
3262 && DECL_LANG_SPECIFIC (olddecl))
3263 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3266 /* Merge the section attribute.
3267 We want to issue an error if the sections conflict but that must be
3268 done later in decl_attributes since we are called before attributes
3270 if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3271 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3273 /* Keep the old rtl since we can safely use it, unless it's the
3274 call to abort() used for abstract virtuals. */
3275 if ((DECL_LANG_SPECIFIC (olddecl)
3276 && !DECL_ABSTRACT_VIRTUAL_P (olddecl))
3277 || DECL_RTL (olddecl) != DECL_RTL (abort_fndecl))
3278 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3282 /* If cannot merge, then use the new type and qualifiers,
3283 and don't preserve the old rtl. */
3286 /* Clean out any memory we had of the old declaration. */
3287 tree oldstatic = value_member (olddecl, static_aggregates);
3289 TREE_VALUE (oldstatic) = error_mark_node;
3291 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3292 TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3293 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3294 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3297 /* Merge the storage class information. */
3298 DECL_WEAK (newdecl) |= DECL_WEAK (olddecl);
3299 DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3300 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3301 TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3302 if (! DECL_EXTERNAL (olddecl))
3303 DECL_EXTERNAL (newdecl) = 0;
3305 if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3307 DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3308 DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3309 DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3310 /* Don't really know how much of the language-specific
3311 values we should copy from old to new. */
3312 DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3313 DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3314 DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3315 DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3316 olddecl_friend = DECL_FRIEND_P (olddecl);
3319 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3321 if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3322 && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3324 /* If newdecl is not a specialization, then it is not a
3325 template-related function at all. And that means that we
3326 shoud have exited above, returning 0. */
3327 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3330 if (TREE_USED (olddecl))
3331 /* From [temp.expl.spec]:
3333 If a template, a member template or the member of a class
3334 template is explicitly specialized then that
3335 specialization shall be declared before the first use of
3336 that specialization that would cause an implicit
3337 instantiation to take place, in every translation unit in
3338 which such a use occurs. */
3339 cp_error ("explicit specialization of %D after first use",
3342 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3344 DECL_THIS_INLINE (newdecl) |= DECL_THIS_INLINE (olddecl);
3346 /* If either decl says `inline', this fn is inline, unless its
3347 definition was passed already. */
3348 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3349 DECL_INLINE (olddecl) = 1;
3350 DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3354 DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3355 DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3356 DECL_RTL (olddecl) = DECL_RTL (newdecl);
3358 if (! types_match || new_defines_function)
3360 /* These need to be copied so that the names are available. */
3361 DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3362 DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3364 if (new_defines_function)
3365 /* If defining a function declared with other language
3366 linkage, use the previously declared language linkage. */
3367 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3370 /* If redeclaring a builtin function, and not a definition,
3371 it stays built in. */
3372 if (DECL_BUILT_IN (olddecl))
3374 DECL_BUILT_IN (newdecl) = 1;
3375 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3376 /* If we're keeping the built-in definition, keep the rtl,
3377 regardless of declaration matches. */
3378 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3381 DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
3383 DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3384 if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl)))
3385 /* Previously saved insns go together with
3386 the function's previous definition. */
3387 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3388 /* Don't clear out the arguments if we're redefining a function. */
3389 if (DECL_ARGUMENTS (olddecl))
3390 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3392 if (DECL_LANG_SPECIFIC (olddecl))
3393 DECL_MAIN_VARIANT (newdecl) = DECL_MAIN_VARIANT (olddecl);
3396 if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3398 NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3401 /* Now preserve various other info from the definition. */
3402 TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3403 TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3404 DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3405 DECL_ASSEMBLER_NAME (newdecl) = DECL_ASSEMBLER_NAME (olddecl);
3407 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3410 struct lang_decl *ol = DECL_LANG_SPECIFIC (olddecl);
3411 struct lang_decl *nl = DECL_LANG_SPECIFIC (newdecl);
3413 function_size = sizeof (struct tree_decl);
3415 bcopy ((char *) newdecl + sizeof (struct tree_common),
3416 (char *) olddecl + sizeof (struct tree_common),
3417 function_size - sizeof (struct tree_common));
3419 /* Can we safely free the storage used by newdecl? */
3421 #define ROUND(x) ((x + obstack_alignment_mask (&permanent_obstack)) \
3422 & ~ obstack_alignment_mask (&permanent_obstack))
3424 if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3426 /* If newdecl is a template instantiation, it is possible that
3427 the following sequence of events has occurred:
3429 o A friend function was declared in a class template. The
3430 class template was instantiated.
3432 o The instantiation of the friend declaration was
3433 recorded on the instantiation list, and is newdecl.
3435 o Later, however, instantiate_class_template called pushdecl
3436 on the newdecl to perform name injection. But, pushdecl in
3437 turn called duplicate_decls when it discovered that another
3438 declaration of a global function with the same name already
3441 o Here, in duplicate_decls, we decided to clobber newdecl.
3443 If we're going to do that, we'd better make sure that
3444 olddecl, and not newdecl, is on the list of
3445 instantiations so that if we try to do the instantiation
3446 again we won't get the clobbered declaration. */
3448 tree tmpl = DECL_TI_TEMPLATE (newdecl);
3449 tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3451 for (; decls; decls = TREE_CHAIN (decls))
3452 if (TREE_VALUE (decls) == newdecl)
3453 TREE_VALUE (decls) = olddecl;
3456 if (((char *)newdecl + ROUND (function_size) == (char *)nl
3457 && ((char *)newdecl + ROUND (function_size)
3458 + ROUND (sizeof (struct lang_decl))
3459 == obstack_next_free (&permanent_obstack)))
3460 || ((char *)newdecl + ROUND (function_size)
3461 == obstack_next_free (&permanent_obstack)))
3463 DECL_MAIN_VARIANT (newdecl) = olddecl;
3464 DECL_LANG_SPECIFIC (olddecl) = ol;
3465 bcopy ((char *)nl, (char *)ol, sizeof (struct lang_decl));
3467 obstack_free (&permanent_obstack, newdecl);
3469 else if (LANG_DECL_PERMANENT (ol) && ol != nl)
3471 if (DECL_MAIN_VARIANT (olddecl) == olddecl)
3473 /* Save these lang_decls that would otherwise be lost. */
3474 extern tree free_lang_decl_chain;
3475 tree free_lang_decl = (tree) ol;
3477 if (DECL_LANG_SPECIFIC (olddecl) == ol)
3480 TREE_CHAIN (free_lang_decl) = free_lang_decl_chain;
3481 free_lang_decl_chain = free_lang_decl;
3485 /* Storage leak. */;
3491 bcopy ((char *) newdecl + sizeof (struct tree_common),
3492 (char *) olddecl + sizeof (struct tree_common),
3493 sizeof (struct tree_decl) - sizeof (struct tree_common)
3494 + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3497 DECL_UID (olddecl) = olddecl_uid;
3499 DECL_FRIEND_P (olddecl) = 1;
3501 /* NEWDECL contains the merged attribute lists.
3502 Update OLDDECL to be the same. */
3503 DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl);
3508 /* Record a decl-node X as belonging to the current lexical scope.
3509 Check for errors (such as an incompatible declaration for the same
3510 name already seen in the same scope).
3512 Returns either X or an old decl for the same name.
3513 If an old decl is returned, it may have been smashed
3514 to agree with what X says. */
3521 register tree name = DECL_ASSEMBLER_NAME (x);
3522 int need_new_binding = 1;
3524 if (DECL_TEMPLATE_PARM_P (x))
3525 /* Template parameters have no context; they are not X::T even
3526 when declared within a class or namespace. */
3530 if (current_function_decl && x != current_function_decl
3531 /* A local declaration for a function doesn't constitute
3533 && (TREE_CODE (x) != FUNCTION_DECL || DECL_INITIAL (x))
3534 /* Don't change DECL_CONTEXT of virtual methods. */
3535 && (TREE_CODE (x) != FUNCTION_DECL || !DECL_VIRTUAL_P (x))
3536 && !DECL_CONTEXT (x))
3537 DECL_CONTEXT (x) = current_function_decl;
3538 if (!DECL_CONTEXT (x))
3539 DECL_CONTEXT (x) = FROB_CONTEXT (current_namespace);
3542 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3543 compiler wants to use. */
3544 if (TREE_CODE (x) == TYPE_DECL || TREE_CODE (x) == VAR_DECL
3545 || TREE_CODE (x) == NAMESPACE_DECL || TREE_CODE (x) == TEMPLATE_TYPE_PARM
3546 || TREE_CODE (x) == TEMPLATE_TEMPLATE_PARM)
3547 name = DECL_NAME (x);
3552 /* Not needed...see below. */
3556 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3557 name = TREE_OPERAND (name, 0);
3559 /* Namespace-scoped variables are not found in the current level. */
3560 if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x))
3561 t = namespace_binding (name, DECL_CONTEXT (x));
3563 t = lookup_name_current_level (name);
3564 if (t == error_mark_node)
3566 /* error_mark_node is 0 for a while during initialization! */
3568 cp_error_at ("`%#D' used prior to declaration", x);
3571 else if (t != NULL_TREE)
3574 /* This is turned off until I have time to do it right (bpk). */
3575 /* With the code below that uses it... */
3576 file = DECL_SOURCE_FILE (t);
3577 line = DECL_SOURCE_LINE (t);
3579 if (TREE_CODE (t) == PARM_DECL)
3581 if (DECL_CONTEXT (t) == NULL_TREE)
3582 fatal ("parse errors have confused me too much");
3584 /* Check for duplicate params. */
3585 if (duplicate_decls (x, t))
3588 else if (((TREE_CODE (x) == FUNCTION_DECL && DECL_LANGUAGE (x) == lang_c)
3589 || DECL_FUNCTION_TEMPLATE_P (x))
3590 && is_overloaded_fn (t))
3591 /* Don't do anything just yet. */;
3592 else if (t == wchar_decl_node)
3594 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3595 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x));
3597 /* Throw away the redeclaration. */
3600 else if (TREE_CODE (t) != TREE_CODE (x))
3602 if (duplicate_decls (x, t))
3605 else if (duplicate_decls (x, t))
3608 /* This is turned off until I have time to do it right (bpk). */
3610 /* Also warn if they did a prototype with `static' on it, but
3611 then later left the `static' off. */
3612 if (! TREE_PUBLIC (name) && TREE_PUBLIC (x))
3614 if (DECL_LANG_SPECIFIC (t) && DECL_FRIEND_P (t))
3619 cp_warning ("`static' missing from declaration of `%D'",
3621 warning_with_file_and_line (file, line,
3622 "previous declaration of `%s'",
3623 decl_as_string (t, 0));
3626 /* Now fix things so it'll do what they expect. */
3627 if (current_function_decl)
3628 TREE_PUBLIC (current_function_decl) = 0;
3630 /* Due to interference in memory reclamation (X may be
3631 obstack-deallocated at this point), we must guard against
3632 one really special case. [jason: This should be handled
3633 by start_function] */
3634 if (current_function_decl == x)
3635 current_function_decl = t;
3637 if (TREE_CODE (t) == TYPE_DECL)
3638 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3639 else if (TREE_CODE (t) == FUNCTION_DECL)
3640 check_default_args (t);
3644 else if (DECL_MAIN_P (x))
3646 /* A redeclaration of main, but not a duplicate of the
3651 This function shall not be overloaded. */
3652 cp_error_at ("invalid redeclaration of `%D'", t);
3653 cp_error ("as `%D'", x);
3654 /* We don't try to push this declaration since that
3660 check_template_shadow (x);
3662 if (TREE_CODE (x) == FUNCTION_DECL && ! DECL_FUNCTION_MEMBER_P (x))
3664 t = push_overloaded_decl (x, PUSH_LOCAL);
3665 if (t != x || DECL_LANGUAGE (x) == lang_c)
3667 if (!namespace_bindings_p ())
3668 /* We do not need to create a binding for this name;
3669 push_overloaded_decl will have already done so if
3671 need_new_binding = 0;
3673 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3674 return push_overloaded_decl (x, PUSH_GLOBAL);
3676 /* If declaring a type as a typedef, copy the type (unless we're
3677 at line 0), and install this TYPE_DECL as the new type's typedef
3678 name. See the extensive comment in ../c-decl.c (pushdecl). */
3679 if (TREE_CODE (x) == TYPE_DECL)
3681 tree type = TREE_TYPE (x);
3682 if (DECL_SOURCE_LINE (x) == 0)
3684 if (TYPE_NAME (type) == 0)
3685 TYPE_NAME (type) = x;
3687 else if (type != error_mark_node && TYPE_NAME (type) != x
3688 /* We don't want to copy the type when all we're
3689 doing is making a TYPE_DECL for the purposes of
3691 && (!TYPE_NAME (type)
3692 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
3694 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
3696 DECL_ORIGINAL_TYPE (x) = type;
3697 type = build_type_copy (type);
3698 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
3699 TYPE_NAME (type) = x;
3700 TREE_TYPE (x) = type;
3705 if (type != error_mark_node
3707 && TYPE_IDENTIFIER (type))
3708 set_identifier_type_value_with_scope (DECL_NAME (x), type,
3709 current_binding_level);
3713 /* Multiple external decls of the same identifier ought to match.
3715 We get warnings about inline functions where they are defined.
3716 We get warnings about other functions from push_overloaded_decl.
3718 Avoid duplicate warnings where they are used. */
3719 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
3723 if (IDENTIFIER_NAMESPACE_VALUE (name) != NULL_TREE
3724 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name))
3725 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name))))
3726 decl = IDENTIFIER_NAMESPACE_VALUE (name);
3731 /* If different sort of thing, we already gave an error. */
3732 && TREE_CODE (decl) == TREE_CODE (x)
3733 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
3735 cp_pedwarn ("type mismatch with previous external decl", x);
3736 cp_pedwarn_at ("previous external decl of `%#D'", decl);
3740 /* This name is new in its binding level.
3741 Install the new declaration and return it. */
3742 if (namespace_bindings_p ())
3744 /* Install a global value. */
3746 /* If the first global decl has external linkage,
3747 warn if we later see static one. */
3748 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
3749 TREE_PUBLIC (name) = 1;
3751 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
3754 if (TREE_CODE (x) == FUNCTION_DECL)
3756 ((IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE)
3757 || (IDENTIFIER_GLOBAL_VALUE (name) == x), 378);
3758 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
3761 /* Don't forget if the function was used via an implicit decl. */
3762 if (IDENTIFIER_IMPLICIT_DECL (name)
3763 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
3766 /* Don't forget if its address was taken in that way. */
3767 if (IDENTIFIER_IMPLICIT_DECL (name)
3768 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
3769 TREE_ADDRESSABLE (x) = 1;
3771 /* Warn about mismatches against previous implicit decl. */
3772 if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
3773 /* If this real decl matches the implicit, don't complain. */
3774 && ! (TREE_CODE (x) == FUNCTION_DECL
3775 && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
3777 ("`%D' was previously implicitly declared to return `int'", x);
3779 /* If new decl is `static' and an `extern' was seen previously,
3781 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
3782 warn_extern_redeclared_static (x, t);
3786 /* Here to install a non-global value. */
3787 tree oldlocal = IDENTIFIER_VALUE (name);
3788 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
3790 if (need_new_binding)
3792 push_local_binding (name, x);
3793 /* Because push_local_binding will hook X on to the
3794 current_binding_level's name list, we don't want to
3795 do that again below. */
3796 need_new_binding = 0;
3799 /* If this is a TYPE_DECL, push it into the type value slot. */
3800 if (TREE_CODE (x) == TYPE_DECL)
3801 set_identifier_type_value_with_scope (name, TREE_TYPE (x),
3802 current_binding_level);
3804 /* Clear out any TYPE_DECL shadowed by a namespace so that
3805 we won't think this is a type. The C struct hack doesn't
3806 go through namespaces. */
3807 if (TREE_CODE (x) == NAMESPACE_DECL)
3808 set_identifier_type_value_with_scope (name, NULL_TREE,
3809 current_binding_level);
3811 /* If this is an extern function declaration, see if we
3812 have a global definition or declaration for the function. */
3813 if (oldlocal == NULL_TREE
3814 && DECL_EXTERNAL (x)
3815 && oldglobal != NULL_TREE
3816 && TREE_CODE (x) == FUNCTION_DECL
3817 && TREE_CODE (oldglobal) == FUNCTION_DECL)
3819 /* We have one. Their types must agree. */
3820 if (decls_match (x, oldglobal))
3824 cp_warning ("extern declaration of `%#D' doesn't match", x);
3825 cp_warning_at ("global declaration `%#D'", oldglobal);
3828 /* If we have a local external declaration,
3829 and no file-scope declaration has yet been seen,
3830 then if we later have a file-scope decl it must not be static. */
3831 if (oldlocal == NULL_TREE
3832 && oldglobal == NULL_TREE
3833 && DECL_EXTERNAL (x)
3835 TREE_PUBLIC (name) = 1;
3837 if (DECL_FROM_INLINE (x))
3838 /* Inline decls shadow nothing. */;
3840 /* Warn if shadowing an argument at the top level of the body. */
3841 else if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
3842 && TREE_CODE (oldlocal) == PARM_DECL
3843 && TREE_CODE (x) != PARM_DECL)
3845 /* Go to where the parms should be and see if we
3847 struct binding_level *b = current_binding_level->level_chain;
3853 if (b->parm_flag == 1)
3854 cp_error ("declaration of `%#D' shadows a parameter", name);
3856 else if (warn_shadow && oldlocal != NULL_TREE
3857 && current_binding_level->is_for_scope
3858 && !DECL_DEAD_FOR_LOCAL (oldlocal))
3860 warning ("variable `%s' shadows local",
3861 IDENTIFIER_POINTER (name));
3862 cp_warning_at (" this is the shadowed declaration", oldlocal);
3864 /* Maybe warn if shadowing something else. */
3865 else if (warn_shadow && !DECL_EXTERNAL (x)
3866 /* No shadow warnings for internally generated vars. */
3867 && ! DECL_ARTIFICIAL (x)
3868 /* No shadow warnings for vars made for inlining. */
3869 && ! DECL_FROM_INLINE (x))
3871 char *warnstring = NULL;
3873 if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL)
3874 warnstring = "declaration of `%s' shadows a parameter";
3875 else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
3876 && current_class_ptr
3877 && !TREE_STATIC (name))
3878 warnstring = "declaration of `%s' shadows a member of `this'";
3879 else if (oldlocal != NULL_TREE)
3880 warnstring = "declaration of `%s' shadows previous local";
3881 else if (oldglobal != NULL_TREE)
3882 /* XXX shadow warnings in outer-more namespaces */
3883 warnstring = "declaration of `%s' shadows global declaration";
3886 warning (warnstring, IDENTIFIER_POINTER (name));
3890 if (TREE_CODE (x) == FUNCTION_DECL)
3891 check_default_args (x);
3893 /* Keep count of variables in this level with incomplete type. */
3894 if (TREE_CODE (x) == VAR_DECL
3895 && TREE_TYPE (x) != error_mark_node
3896 && ((TYPE_SIZE (TREE_TYPE (x)) == NULL_TREE
3897 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE))
3898 /* RTTI TD entries are created while defining the type_info. */
3899 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x))
3900 && TYPE_BEING_DEFINED (TREE_TYPE (x)))))
3901 current_binding_level->incomplete
3902 = tree_cons (NULL_TREE, x, current_binding_level->incomplete);
3905 if (need_new_binding)
3907 /* Put decls on list in reverse order.
3908 We will reverse them later if necessary. */
3909 TREE_CHAIN (x) = current_binding_level->names;
3910 current_binding_level->names = x;
3911 if (! (current_binding_level != global_binding_level
3912 || TREE_PERMANENT (x)))
3913 my_friendly_abort (124);
3919 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
3920 caller to set DECL_CONTEXT properly. */
3923 pushdecl_with_scope (x, level)
3925 struct binding_level *level;
3927 register struct binding_level *b;
3928 tree function_decl = current_function_decl;
3930 current_function_decl = NULL_TREE;
3931 if (level->parm_flag == 2)
3933 b = class_binding_level;
3934 class_binding_level = level;
3935 pushdecl_class_level (x);
3936 class_binding_level = b;
3940 b = current_binding_level;
3941 current_binding_level = level;
3943 current_binding_level = b;
3945 current_function_decl = function_decl;
3949 /* Like pushdecl, only it places X in the current namespace,
3953 pushdecl_namespace_level (x)
3956 register struct binding_level *b = inner_binding_level;
3959 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
3961 /* Now, the type_shadowed stack may screw us. Munge it so it does
3963 if (TREE_CODE (x) == TYPE_DECL)
3965 tree name = DECL_NAME (x);
3967 tree *ptr = (tree *)0;
3968 for (; b != global_binding_level; b = b->level_chain)
3970 tree shadowed = b->type_shadowed;
3971 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
3972 if (TREE_PURPOSE (shadowed) == name)
3974 ptr = &TREE_VALUE (shadowed);
3975 /* Can't break out of the loop here because sometimes
3976 a binding level will have duplicate bindings for
3977 PT names. It's gross, but I haven't time to fix it. */
3980 newval = TREE_TYPE (x);
3981 if (ptr == (tree *)0)
3983 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3984 up here if this is changed to an assertion. --KR */
3985 SET_IDENTIFIER_TYPE_VALUE (name, newval);
3995 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
3999 pushdecl_top_level (x)
4002 tree cur_namespace = current_namespace;
4003 current_namespace = global_namespace;
4004 x = pushdecl_namespace_level (x);
4005 current_namespace = cur_namespace;
4009 /* Make the declaration of X appear in CLASS scope. */
4012 pushdecl_class_level (x)
4015 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4016 scope looks for the pre-mangled name. */
4017 register tree name = DECL_NAME (x);
4021 if (TYPE_BEING_DEFINED (current_class_type))
4023 /* A name N used in a class S shall refer to the same declaration
4024 in its context and when re-evaluated in the completed scope of S.
4025 Types, enums, and static vars are checked here; other
4026 members are checked in finish_struct. */
4027 tree icv = IDENTIFIER_CLASS_VALUE (name);
4029 /* This should match check_member_decl_is_same_in_complete_scope. */
4031 && flag_optional_diags
4032 /* Don't complain about inherited names. */
4033 && id_in_current_class (name)
4034 /* Or shadowed tags. */
4035 && !(DECL_DECLARES_TYPE_P (icv)
4036 && DECL_CONTEXT (icv) == current_class_type))
4038 cp_pedwarn ("declaration of identifier `%D' as `%#D'", name, x);
4039 cp_pedwarn_at ("conflicts with previous use in class as `%#D'",
4043 check_template_shadow (x);
4046 push_class_level_binding (name, x);
4047 if (TREE_CODE (x) == TYPE_DECL)
4048 set_identifier_type_value (name, TREE_TYPE (x));
4053 /* This function is used to push the mangled decls for nested types into
4054 the appropriate scope. Previously pushdecl_top_level was used, but that
4055 is incorrect for members of local classes. */
4058 pushdecl_nonclass_level (x)
4061 struct binding_level *b = current_binding_level;
4063 my_friendly_assert (b->parm_flag != 2, 180);
4066 /* Get out of template binding levels */
4067 while (b->pseudo_global)
4071 pushdecl_with_scope (x, b);
4075 /* Make the declaration(s) of X appear in CLASS scope
4076 under the name NAME. */
4079 push_class_level_binding (name, x)
4083 /* The class_binding_level will be NULL if x is a template
4084 parameter name in a member template. */
4085 if (!class_binding_level)
4088 /* If this declaration shadows a declaration from an enclosing
4089 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4090 we leave this class. Record the shadowed declaration here. */
4091 maybe_push_cache_obstack ();
4092 class_binding_level->class_shadowed
4093 = tree_cons (name, IDENTIFIER_CLASS_VALUE (name),
4094 class_binding_level->class_shadowed);
4095 TREE_TYPE (class_binding_level->class_shadowed)
4099 /* Put the binding on the stack of bindings for the identifier, and
4100 update IDENTIFIER_CLASS_VALUE. */
4101 push_class_binding (name, x);
4103 obstack_ptr_grow (&decl_obstack, x);
4106 /* Insert another USING_DECL into the current binding level,
4107 returning this declaration. If this is a redeclaration,
4108 do nothing and return NULL_TREE. */
4111 push_using_decl (scope, name)
4117 my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4118 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4119 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4120 if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4124 decl = build_lang_decl (USING_DECL, name, void_type_node);
4125 DECL_INITIAL (decl) = scope;
4126 TREE_CHAIN (decl) = current_binding_level->usings;
4127 current_binding_level->usings = decl;
4131 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4132 changed (i.e. there was already a directive), or the fresh
4133 TREE_LIST otherwise. */
4136 push_using_directive (used)
4139 tree ud = current_binding_level->using_directives;
4140 tree iter, ancestor;
4142 /* Check if we already have this. */
4143 if (purpose_member (used, ud) != NULL_TREE)
4146 /* Recursively add all namespaces used. */
4147 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4148 push_using_directive (TREE_PURPOSE (iter));
4150 ancestor = namespace_ancestor (current_decl_namespace (), used);
4151 ud = current_binding_level->using_directives;
4152 ud = perm_tree_cons (used, ancestor, ud);
4153 current_binding_level->using_directives = ud;
4157 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4158 other definitions already in place. We get around this by making
4159 the value of the identifier point to a list of all the things that
4160 want to be referenced by that name. It is then up to the users of
4161 that name to decide what to do with that list.
4163 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4164 slot. It is dealt with the same way.
4166 FLAGS is a bitwise-or of the following values:
4167 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4169 PUSH_USING: DECL is being pushed as the result of a using
4172 The value returned may be a previous declaration if we guessed wrong
4173 about what language DECL should belong to (C or C++). Otherwise,
4174 it's always DECL (and never something that's not a _DECL). */
4177 push_overloaded_decl (decl, flags)
4181 tree name = DECL_NAME (decl);
4184 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4188 old = namespace_binding (name, DECL_CONTEXT (decl));
4189 if (old && TREE_CODE (old) == FUNCTION_DECL
4190 && DECL_ARTIFICIAL (old)
4191 && (DECL_BUILT_IN (old) || DECL_BUILT_IN_NONANSI (old)))
4193 if (duplicate_decls (decl, old))
4199 old = lookup_name_current_level (name);
4203 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4205 tree t = TREE_TYPE (old);
4206 if (IS_AGGR_TYPE (t) && warn_shadow
4207 && (! DECL_IN_SYSTEM_HEADER (decl)
4208 || ! DECL_IN_SYSTEM_HEADER (old)))
4209 cp_warning ("`%#D' hides constructor for `%#T'", decl, t);
4212 else if (is_overloaded_fn (old))
4216 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4218 tree fn = OVL_CURRENT (tmp);
4220 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4221 && !(flags & PUSH_USING)
4222 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4223 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4224 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4227 if (duplicate_decls (decl, fn))
4233 cp_error_at ("previous non-function declaration `%#D'", old);
4234 cp_error ("conflicts with function declaration `%#D'", decl);
4239 if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4241 if (old && TREE_CODE (old) != OVERLOAD)
4242 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4244 new_binding = ovl_cons (decl, old);
4245 if (flags & PUSH_USING)
4246 OVL_USED (new_binding) = 1;
4249 /* NAME is not ambiguous. */
4253 set_namespace_binding (name, current_namespace, new_binding);
4256 /* We only create an OVERLOAD if there was a previous binding at
4257 this level. In that case, we need to remove the old binding
4258 and replace it with the new binding. We must also run
4259 through the NAMES on the binding level where the name was
4260 bound to update the chain. */
4261 if (TREE_CODE (new_binding) == OVERLOAD)
4265 for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4267 d = &TREE_CHAIN (*d))
4269 || (TREE_CODE (*d) == TREE_LIST
4270 && TREE_VALUE (*d) == old))
4272 if (TREE_CODE (*d) == TREE_LIST)
4273 /* Just replace the old binding with the new. */
4274 TREE_VALUE (*d) = new_binding;
4276 /* Build a TREE_LIST to wrap the OVERLOAD. */
4277 *d = build_tree_list (NULL_TREE, new_binding);
4279 /* And update the CPLUS_BINDING node. */
4280 BINDING_VALUE (IDENTIFIER_BINDING (name))
4285 /* We should always find a previous binding in this case. */
4286 my_friendly_abort (0);
4289 /* Install the new binding. */
4290 push_local_binding (name, new_binding);
4296 /* Generate an implicit declaration for identifier FUNCTIONID
4297 as a function of type int (). Print a warning if appropriate. */
4300 implicitly_declare (functionid)
4304 int temp = allocation_temporary_p ();
4306 push_obstacks_nochange ();
4308 /* Save the decl permanently so we can warn if definition follows.
4309 In ANSI C, warn_implicit is usually false, so the saves little space.
4310 But in C++, it's usually true, hence the extra code. */
4311 if (temp && (! warn_implicit || toplevel_bindings_p ()))
4312 end_temporary_allocation ();
4314 /* We used to reuse an old implicit decl here,
4315 but this loses with inline functions because it can clobber
4316 the saved decl chains. */
4317 decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4319 DECL_EXTERNAL (decl) = 1;
4320 TREE_PUBLIC (decl) = 1;
4322 /* ANSI standard says implicit declarations are in the innermost block.
4323 So we record the decl in the standard fashion. */
4325 rest_of_decl_compilation (decl, NULL_PTR, 0, 0);
4328 /* Only one warning per identifier. */
4329 && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4331 cp_pedwarn ("implicit declaration of function `%#D'", decl);
4334 SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4341 /* Return zero if the declaration NEWDECL is valid
4342 when the declaration OLDDECL (assumed to be for the same name)
4343 has already been seen.
4344 Otherwise return an error message format string with a %s
4345 where the identifier should go. */
4348 redeclaration_error_message (newdecl, olddecl)
4349 tree newdecl, olddecl;
4351 if (TREE_CODE (newdecl) == TYPE_DECL)
4353 /* Because C++ can put things into name space for free,
4354 constructs like "typedef struct foo { ... } foo"
4355 would look like an erroneous redeclaration. */
4356 if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4359 return "redefinition of `%#D'";
4361 else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4363 /* If this is a pure function, its olddecl will actually be
4364 the original initialization to `0' (which we force to call
4365 abort()). Don't complain about redefinition in this case. */
4366 if (DECL_LANG_SPECIFIC (olddecl) && DECL_ABSTRACT_VIRTUAL_P (olddecl))
4369 /* If both functions come from different namespaces, this is not
4370 a redeclaration - this is a conflict with a used function. */
4371 if (DECL_NAMESPACE_SCOPE_P (olddecl)
4372 && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4373 return "`%D' conflicts with used function";
4375 /* We'll complain about linkage mismatches in
4376 warn_extern_redeclared_static. */
4378 /* Defining the same name twice is no good. */
4379 if (DECL_INITIAL (olddecl) != NULL_TREE
4380 && DECL_INITIAL (newdecl) != NULL_TREE)
4382 if (DECL_NAME (olddecl) == NULL_TREE)
4383 return "`%#D' not declared in class";
4385 return "redefinition of `%#D'";
4389 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4391 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4392 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4393 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4394 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4395 && TYPE_SIZE (TREE_TYPE (newdecl))
4396 && TYPE_SIZE (TREE_TYPE (olddecl))))
4397 return "redefinition of `%#D'";
4400 else if (toplevel_bindings_p ())
4402 /* Objects declared at top level: */
4403 /* If at least one is a reference, it's ok. */
4404 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4406 /* Reject two definitions. */
4407 return "redefinition of `%#D'";
4411 /* Objects declared with block scope: */
4412 /* Reject two definitions, and reject a definition
4413 together with an external reference. */
4414 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4415 return "redeclaration of `%#D'";
4420 /* Get the LABEL_DECL corresponding to identifier ID as a label.
4421 Create one if none exists so far for the current function.
4422 This function is called for both label definitions and label references. */
4428 register tree decl = IDENTIFIER_LABEL_VALUE (id);
4430 if (current_function_decl == NULL_TREE)
4432 error ("label `%s' referenced outside of any function",
4433 IDENTIFIER_POINTER (id));
4437 if ((decl == NULL_TREE
4438 || DECL_SOURCE_LINE (decl) == 0)
4439 && (named_label_uses == NULL
4440 || named_label_uses->names_in_scope != current_binding_level->names
4441 || named_label_uses->label_decl != decl))
4443 struct named_label_list *new_ent;
4445 = (struct named_label_list*)oballoc (sizeof (struct named_label_list));
4446 new_ent->label_decl = decl;
4447 new_ent->names_in_scope = current_binding_level->names;
4448 new_ent->binding_level = current_binding_level;
4449 new_ent->lineno_o_goto = lineno;
4450 new_ent->filename_o_goto = input_filename;
4451 new_ent->next = named_label_uses;
4452 named_label_uses = new_ent;
4455 /* Use a label already defined or ref'd with this name. */
4456 if (decl != NULL_TREE)
4458 /* But not if it is inherited and wasn't declared to be inheritable. */
4459 if (DECL_CONTEXT (decl) != current_function_decl
4460 && ! C_DECLARED_LABEL_FLAG (decl))
4461 return shadow_label (id);
4465 decl = build_decl (LABEL_DECL, id, void_type_node);
4467 /* Make sure every label has an rtx. */
4470 /* A label not explicitly declared must be local to where it's ref'd. */
4471 DECL_CONTEXT (decl) = current_function_decl;
4473 DECL_MODE (decl) = VOIDmode;
4475 /* Say where one reference is to the label,
4476 for the sake of the error if it is not defined. */
4477 DECL_SOURCE_LINE (decl) = lineno;
4478 DECL_SOURCE_FILE (decl) = input_filename;
4480 SET_IDENTIFIER_LABEL_VALUE (id, decl);
4482 named_labels = tree_cons (NULL_TREE, decl, named_labels);
4483 named_label_uses->label_decl = decl;
4488 /* Make a label named NAME in the current function,
4489 shadowing silently any that may be inherited from containing functions
4490 or containing scopes.
4492 Note that valid use, if the label being shadowed
4493 comes from another scope in the same function,
4494 requires calling declare_nonlocal_label right away. */
4500 register tree decl = IDENTIFIER_LABEL_VALUE (name);
4502 if (decl != NULL_TREE)
4504 shadowed_labels = tree_cons (NULL_TREE, decl, shadowed_labels);
4505 SET_IDENTIFIER_LABEL_VALUE (name, NULL_TREE);
4508 return lookup_label (name);
4511 /* Define a label, specifying the location in the source file.
4512 Return the LABEL_DECL node for the label, if the definition is valid.
4513 Otherwise return 0. */
4516 define_label (filename, line, name)
4523 if (minimal_parse_mode)
4525 push_obstacks (&permanent_obstack, &permanent_obstack);
4526 decl = build_decl (LABEL_DECL, name, void_type_node);
4528 DECL_SOURCE_LINE (decl) = line;
4529 DECL_SOURCE_FILE (decl) = filename;
4534 decl = lookup_label (name);
4536 /* After labels, make any new cleanups go into their
4537 own new (temporary) binding contour. */
4538 current_binding_level->more_cleanups_ok = 0;
4540 /* If label with this name is known from an outer context, shadow it. */
4541 if (decl != NULL_TREE && DECL_CONTEXT (decl) != current_function_decl)
4543 shadowed_labels = tree_cons (NULL_TREE, decl, shadowed_labels);
4544 SET_IDENTIFIER_LABEL_VALUE (name, NULL_TREE);
4545 decl = lookup_label (name);
4548 if (name == get_identifier ("wchar_t"))
4549 cp_pedwarn ("label named wchar_t");
4551 if (DECL_INITIAL (decl) != NULL_TREE)
4553 cp_error ("duplicate label `%D'", decl);
4558 struct named_label_list *uses, *prev;
4561 /* Mark label as having been defined. */
4562 DECL_INITIAL (decl) = error_mark_node;
4563 /* Say where in the source. */
4564 DECL_SOURCE_FILE (decl) = filename;
4565 DECL_SOURCE_LINE (decl) = line;
4568 uses = named_label_uses;
4569 while (uses != NULL)
4570 if (uses->label_decl == decl)
4572 struct binding_level *b = current_binding_level;
4575 tree new_decls = b->names;
4576 tree old_decls = (b == uses->binding_level)
4577 ? uses->names_in_scope : NULL_TREE;
4578 while (new_decls != old_decls)
4580 if (TREE_CODE (new_decls) == VAR_DECL
4581 /* Don't complain about crossing initialization
4582 of internal entities. They can't be accessed,
4583 and they should be cleaned up
4584 by the time we get to the label. */
4585 && ! DECL_ARTIFICIAL (new_decls)
4586 && !(DECL_INITIAL (new_decls) == NULL_TREE
4587 && pod_type_p (TREE_TYPE (new_decls))))
4591 cp_error ("jump to label `%D'", decl);
4592 error_with_file_and_line (uses->filename_o_goto,
4593 uses->lineno_o_goto,
4597 if (DECL_INITIAL (new_decls)
4598 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls)))
4599 cp_error_at (" crosses initialization of `%#D'",
4602 cp_error_at (" enters scope of non-POD `%#D'",
4605 new_decls = TREE_CHAIN (new_decls);
4607 if (b == uses->binding_level)
4613 prev->next = uses->next;
4615 named_label_uses = uses->next;
4624 current_function_return_value = NULL_TREE;
4631 struct binding_level *level;
4632 struct cp_switch *next;
4635 static struct cp_switch *switch_stack;
4641 = (struct cp_switch *) oballoc (sizeof (struct cp_switch));
4642 p->level = current_binding_level;
4643 p->next = switch_stack;
4650 switch_stack = switch_stack->next;
4653 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4654 /* XXX Note decl is never actually used. (bpk) */
4657 define_case_label ()
4659 tree cleanup = last_cleanup_this_contour ();
4660 struct binding_level *b = current_binding_level;
4665 static int explained = 0;
4666 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup));
4667 warning ("where case label appears here");
4670 warning ("(enclose actions of previous case statements requiring");
4671 warning ("destructors in their own binding contours.)");
4676 for (; b && b != switch_stack->level; b = b->level_chain)
4678 tree new_decls = b->names;
4679 for (; new_decls; new_decls = TREE_CHAIN (new_decls))
4681 if (TREE_CODE (new_decls) == VAR_DECL
4682 /* Don't complain about crossing initialization
4683 of internal entities. They can't be accessed,
4684 and they should be cleaned up
4685 by the time we get to the label. */
4686 && ! DECL_ARTIFICIAL (new_decls)
4687 && ((DECL_INITIAL (new_decls) != NULL_TREE
4688 && DECL_INITIAL (new_decls) != error_mark_node)
4689 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls))))
4692 error ("jump to case label");
4694 cp_error_at (" crosses initialization of `%#D'",
4700 /* After labels, make any new cleanups go into their
4701 own new (temporary) binding contour. */
4703 current_binding_level->more_cleanups_ok = 0;
4704 current_function_return_value = NULL_TREE;
4707 /* Return the list of declarations of the current level.
4708 Note that this list is in reverse order unless/until
4709 you nreverse it; and when you do nreverse it, you must
4710 store the result back using `storedecls' or you will lose. */
4715 return current_binding_level->names;
4718 /* Return the list of type-tags (for structs, etc) of the current level. */
4723 return current_binding_level->tags;
4726 /* Store the list of declarations of the current level.
4727 This is done for the parameter declarations of a function being defined,
4728 after they are modified in the light of any missing parameters. */
4734 current_binding_level->names = decls;
4737 /* Similarly, store the list of tags of the current level. */
4743 current_binding_level->tags = tags;
4746 /* Given NAME, an IDENTIFIER_NODE,
4747 return the structure (or union or enum) definition for that name.
4748 Searches binding levels from BINDING_LEVEL up to the global level.
4749 If THISLEVEL_ONLY is nonzero, searches only the specified context
4750 (but skips any tag-transparent contexts to find one that is
4751 meaningful for tags).
4752 FORM says which kind of type the caller wants;
4753 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4754 If the wrong kind of type is found, and it's not a template, an error is
4758 lookup_tag (form, name, binding_level, thislevel_only)
4759 enum tree_code form;
4761 struct binding_level *binding_level;
4764 register struct binding_level *level;
4765 /* Non-zero if, we should look past a pseudo-global level, even if
4767 int allow_pseudo_global = 1;
4769 for (level = binding_level; level; level = level->level_chain)
4772 if (ANON_AGGRNAME_P (name))
4773 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
4775 /* There's no need for error checking here, because
4776 anon names are unique throughout the compilation. */
4777 if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
4778 return TREE_VALUE (tail);
4780 else if (level->namespace_p)
4781 /* Do namespace lookup. */
4782 for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
4784 tree old = binding_for_name (name, tail);
4786 /* If we just skipped past a pseudo global level, even
4787 though THISLEVEL_ONLY, and we find a template class
4788 declaration, then we use the _TYPE node for the
4789 template. See the example below. */
4790 if (thislevel_only && !allow_pseudo_global
4791 && old && BINDING_VALUE (old)
4792 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
4793 old = TREE_TYPE (BINDING_VALUE (old));
4795 old = BINDING_TYPE (old);
4797 /* If it has an original type, it is a typedef, and we
4798 should not return it. */
4799 if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old)))
4801 if (old && TREE_CODE (old) != form
4802 && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL))
4804 cp_error ("`%#D' redeclared as %C", old, form);
4809 if (thislevel_only || tail == global_namespace)
4813 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
4815 if (TREE_PURPOSE (tail) == name)
4817 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
4818 /* Should tighten this up; it'll probably permit
4819 UNION_TYPE and a struct template, for example. */
4821 && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL))
4823 /* Definition isn't the kind we were looking for. */
4824 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail),
4828 return TREE_VALUE (tail);
4831 if (thislevel_only && ! level->tag_transparent)
4833 if (level->pseudo_global && allow_pseudo_global)
4835 /* We must deal with cases like this:
4837 template <class T> struct S;
4838 template <class T> struct S {};
4840 When looking up `S', for the second declaration, we
4841 would like to find the first declaration. But, we
4842 are in the pseudo-global level created for the
4843 template parameters, rather than the (surrounding)
4844 namespace level. Thus, we keep going one more level,
4845 even though THISLEVEL_ONLY is non-zero. */
4846 allow_pseudo_global = 0;
4852 if (current_class_type && level->level_chain->namespace_p)
4854 /* Try looking in this class's tags before heading into
4855 global binding level. */
4856 tree context = current_class_type;
4859 switch (TREE_CODE_CLASS (TREE_CODE (context)))
4863 these_tags = CLASSTYPE_TAGS (context);
4864 if (ANON_AGGRNAME_P (name))
4867 if (TYPE_IDENTIFIER (TREE_VALUE (these_tags))
4869 return TREE_VALUE (tail);
4870 these_tags = TREE_CHAIN (these_tags);
4875 if (TREE_PURPOSE (these_tags) == name)
4877 if (TREE_CODE (TREE_VALUE (these_tags)) != form)
4879 cp_error ("`%#D' redeclared as %C in class scope",
4880 TREE_VALUE (tail), form);
4883 return TREE_VALUE (tail);
4885 these_tags = TREE_CHAIN (these_tags);
4887 /* If this type is not yet complete, then don't
4888 look at its context. */
4889 if (TYPE_SIZE (context) == NULL_TREE)
4891 /* Go to next enclosing type, if any. */
4892 context = DECL_CONTEXT (TYPE_MAIN_DECL (context));
4895 context = DECL_CONTEXT (context);
4898 my_friendly_abort (10);
4911 set_current_level_tags_transparency (tags_transparent)
4912 int tags_transparent;
4914 current_binding_level->tag_transparent = tags_transparent;
4918 /* Given a type, find the tag that was defined for it and return the tag name.
4919 Otherwise return 0. However, the value can never be 0
4920 in the cases in which this is used.
4922 C++: If NAME is non-zero, this is the new name to install. This is
4923 done when replacing anonymous tags with real tag names. */
4926 lookup_tag_reverse (type, name)
4930 register struct binding_level *level;
4932 for (level = current_binding_level; level; level = level->level_chain)
4935 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
4937 if (TREE_VALUE (tail) == type)
4940 TREE_PURPOSE (tail) = name;
4941 return TREE_PURPOSE (tail);
4948 /* Lookup TYPE in CONTEXT (a chain of nested types or a FUNCTION_DECL).
4949 Return the type value, or NULL_TREE if not found. */
4952 lookup_nested_type (type, context)
4956 if (context == NULL_TREE)
4960 switch (TREE_CODE (context))
4964 tree ctype = TREE_TYPE (context);
4965 tree match = value_member (type, CLASSTYPE_TAGS (ctype));
4967 return TREE_VALUE (match);
4968 context = DECL_CONTEXT (context);
4970 /* When we have a nested class whose member functions have
4971 local types (e.g., a set of enums), we'll arrive here
4972 with the DECL_CONTEXT as the actual RECORD_TYPE node for
4973 the enclosing class. Instead, we want to make sure we
4974 come back in here with the TYPE_DECL, not the RECORD_TYPE. */
4975 if (context && TREE_CODE (context) == RECORD_TYPE)
4976 context = TREE_CHAIN (context);
4980 if (TYPE_NAME (type) && TYPE_IDENTIFIER (type))
4981 return lookup_name (TYPE_IDENTIFIER (type), 1);
4984 my_friendly_abort (12);
4990 /* Look up NAME in the NAMESPACE. */
4993 lookup_namespace_name (namespace, name)
4994 tree namespace, name;
4996 struct tree_binding _b;
4999 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5001 if (TREE_CODE (name) == NAMESPACE_DECL)
5002 /* This happens for A::B<int> when B is a namespace. */
5004 else if (TREE_CODE (name) == TEMPLATE_DECL)
5006 /* This happens for A::B where B is a template, and there are no
5007 template arguments. */
5008 cp_error ("invalid use of `%D'", name);
5009 return error_mark_node;
5012 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5014 val = binding_init (&_b);
5015 if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5016 return error_mark_node;
5018 if (BINDING_VALUE (val))
5020 val = BINDING_VALUE (val);
5022 /* If we have a single function from a using decl, pull it out. */
5023 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5024 val = OVL_FUNCTION (val);
5028 cp_error ("`%D' undeclared in namespace `%D'", name, namespace);
5029 return error_mark_node;
5032 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5034 static unsigned long
5042 hash = (((unsigned long) TYPE_CONTEXT (t))
5043 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5048 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5051 typename_compare (k1, k2)
5062 d1 = TYPE_NAME (t1);
5063 d2 = TYPE_NAME (t2);
5065 return (DECL_NAME (d1) == DECL_NAME (d2)
5066 && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5067 && ((TREE_TYPE (t1) != NULL_TREE)
5068 == (TREE_TYPE (t2) != NULL_TREE))
5069 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5070 && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5073 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5074 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5075 is non-NULL, this type is being created by the implicit typename
5076 extension, and BASE_TYPE is a type named `t' in some base class of
5077 `T' which depends on template parameters.
5079 Returns the new TYPENAME_TYPE. */
5082 build_typename_type (context, name, fullname, base_type)
5090 struct hash_entry* e;
5092 static struct hash_table ht;
5094 push_obstacks (&permanent_obstack, &permanent_obstack);
5097 && !hash_table_init (&ht, &hash_newfunc, &typename_hash,
5099 fatal ("virtual memory exhausted");
5101 /* Build the TYPENAME_TYPE. */
5102 t = make_lang_type (TYPENAME_TYPE);
5103 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5104 TYPENAME_TYPE_FULLNAME (t) = fullname;
5105 TREE_TYPE (t) = base_type;
5107 /* Build the corresponding TYPE_DECL. */
5108 d = build_decl (TYPE_DECL, name, t);
5109 TYPE_NAME (TREE_TYPE (d)) = d;
5110 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5111 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5112 DECL_ARTIFICIAL (d) = 1;
5114 /* See if we already have this type. */
5115 e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5118 /* This will free not only TREE_TYPE, but the lang-specific data
5119 and the TYPE_DECL as well. */
5120 obstack_free (&permanent_obstack, t);
5124 /* Insert the type into the table. */
5125 hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5133 make_typename_type (context, name)
5139 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
5140 name = TYPE_IDENTIFIER (name);
5141 else if (TREE_CODE (name) == TYPE_DECL)
5142 name = DECL_NAME (name);
5146 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5148 name = TREE_OPERAND (name, 0);
5149 if (TREE_CODE (name) == TEMPLATE_DECL)
5150 name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5152 if (TREE_CODE (name) != IDENTIFIER_NODE)
5153 my_friendly_abort (2000);
5155 if (TREE_CODE (context) == NAMESPACE_DECL)
5157 /* We can get here from typename_sub0 in the explicit_template_type
5158 expansion. Just fail. */
5159 cp_error ("no class template named `%#T' in `%#T'",
5161 return error_mark_node;
5164 if (! uses_template_parms (context)
5165 || currently_open_class (context))
5167 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5169 if (IS_AGGR_TYPE (context))
5170 t = lookup_field (context, name, 0, 0);
5174 if (t == NULL_TREE || TREE_CODE (t) != TEMPLATE_DECL
5175 || TREE_CODE (DECL_RESULT (t)) != TYPE_DECL)
5177 cp_error ("no class template named `%#T' in `%#T'",
5179 return error_mark_node;
5182 return lookup_template_class (t, TREE_OPERAND (fullname, 1),
5184 /*entering_scope=*/0);
5188 if (IS_AGGR_TYPE (context))
5189 t = lookup_field (context, name, 0, 1);
5195 cp_error ("no type named `%#T' in `%#T'", name, context);
5196 return error_mark_node;
5199 return TREE_TYPE (t);
5203 return build_typename_type (context, name, fullname, NULL_TREE);
5206 /* Select the right _DECL from multiple choices. */
5209 select_decl (binding, flags)
5214 val = BINDING_VALUE (binding);
5215 if (LOOKUP_NAMESPACES_ONLY (flags))
5217 /* We are not interested in types. */
5218 if (val && TREE_CODE (val) == NAMESPACE_DECL)
5223 /* If we could have a type and
5224 we have nothing or we need a type and have none. */
5225 if (BINDING_TYPE (binding)
5226 && (!val || ((flags & LOOKUP_PREFER_TYPES)
5227 && TREE_CODE (val) != TYPE_DECL)))
5228 val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5229 /* Don't return non-types if we really prefer types. */
5230 else if (val && LOOKUP_TYPES_ONLY (flags) && TREE_CODE (val) != TYPE_DECL
5231 && (!looking_for_template || TREE_CODE (val) != TEMPLATE_DECL))
5237 /* Unscoped lookup of a global, iterate over namespaces, considering
5238 using namespace statements. */
5241 unqualified_namespace_lookup (name, flags)
5245 struct tree_binding _binding;
5246 tree b = binding_init (&_binding);
5247 tree initial = current_decl_namespace();
5248 tree scope = initial;
5250 struct binding_level *level;
5251 tree val = NULL_TREE;
5255 val = binding_for_name (name, scope);
5257 /* Initialize binding for this context. */
5258 BINDING_VALUE (b) = BINDING_VALUE (val);
5259 BINDING_TYPE (b) = BINDING_TYPE (val);
5261 /* Add all _DECLs seen through local using-directives. */
5262 for (level = current_binding_level;
5263 !level->namespace_p;
5264 level = level->level_chain)
5265 if (!lookup_using_namespace (name, b, level->using_directives,
5267 /* Give up because of error. */
5270 /* Add all _DECLs seen through global using-directives. */
5271 /* XXX local and global using lists should work equally. */
5275 if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5277 /* Give up because of error. */
5279 if (siter == scope) break;
5280 siter = CP_DECL_CONTEXT (siter);
5283 val = select_decl (b, flags);
5284 if (scope == global_namespace)
5286 scope = CP_DECL_CONTEXT (scope);
5291 /* Combine prefer_type and namespaces_only into flags. */
5294 lookup_flags (prefer_type, namespaces_only)
5295 int prefer_type, namespaces_only;
5297 if (namespaces_only)
5298 return LOOKUP_PREFER_NAMESPACES;
5299 if (prefer_type > 1)
5300 return LOOKUP_PREFER_TYPES;
5301 if (prefer_type > 0)
5302 return LOOKUP_PREFER_BOTH;
5306 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5307 ignore it or not. Subroutine of lookup_name_real. */
5310 qualify_lookup (val, flags)
5314 if (val == NULL_TREE)
5316 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5318 if ((flags & LOOKUP_PREFER_TYPES)
5319 && (TREE_CODE (val) == TYPE_DECL
5320 || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5321 && DECL_CLASS_TEMPLATE_P (val))))
5323 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5328 /* Look up NAME in the current binding level and its superiors in the
5329 namespace of variables, functions and typedefs. Return a ..._DECL
5330 node of some kind representing its definition if there is only one
5331 such declaration, or return a TREE_LIST with all the overloaded
5332 definitions if there are many, or return 0 if it is undefined.
5334 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5335 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5336 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5337 Otherwise we prefer non-TYPE_DECLs.
5339 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5340 using IDENTIFIER_CLASS_VALUE. */
5343 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
5345 int prefer_type, nonclass, namespaces_only;
5349 tree from_obj = NULL_TREE;
5352 /* Hack: copy flag set by parser, if set. */
5353 if (only_namespace_names)
5354 namespaces_only = 1;
5356 if (prefer_type == -2)
5358 extern int looking_for_typename;
5359 tree type = NULL_TREE;
5362 prefer_type = looking_for_typename;
5364 flags = lookup_flags (prefer_type, namespaces_only);
5365 /* During parsing, we need to complain. */
5366 flags |= LOOKUP_COMPLAIN;
5367 /* If the next thing is '<', class templates are types. */
5368 if (looking_for_template)
5369 flags |= LOOKUP_TEMPLATES_EXPECTED;
5371 /* std:: becomes :: for now. */
5372 if (got_scope == std_node)
5373 got_scope = void_type_node;
5377 else if (got_object != error_mark_node)
5382 if (type == error_mark_node)
5383 return error_mark_node;
5384 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
5385 type = TREE_TYPE (type);
5388 type = complete_type (type);
5390 if (TREE_CODE (type) == VOID_TYPE)
5391 type = global_namespace;
5392 if (TREE_CODE (type) == NAMESPACE_DECL)
5394 struct tree_binding b;
5395 val = binding_init (&b);
5396 if (!qualified_lookup_using_namespace (name, type, val, flags))
5398 val = select_decl (val, flags);
5400 else if (! IS_AGGR_TYPE (type)
5401 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5402 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
5403 || TREE_CODE (type) == TYPENAME_TYPE)
5404 /* Someone else will give an error about this if needed. */
5406 else if (TYPE_BEING_DEFINED (type))
5408 val = IDENTIFIER_CLASS_VALUE (name);
5409 if (val && DECL_CONTEXT (val) != type)
5411 struct binding_level *b = class_binding_level;
5412 for (val = NULL_TREE; b; b = b->level_chain)
5414 tree t = purpose_member (name, b->class_shadowed);
5415 if (t && TREE_VALUE (t)
5416 && DECL_CONTEXT (TREE_VALUE (t)) == type)
5418 val = TREE_VALUE (t);
5423 if (val == NULL_TREE)
5424 val = lookup_field (type, name, 0, 1);
5426 else if (type == current_class_type)
5427 val = IDENTIFIER_CLASS_VALUE (name);
5429 val = lookup_member (type, name, 0, prefer_type);
5436 else if (got_object && val)
5440 flags = lookup_flags (prefer_type, namespaces_only);
5442 /* First, look in non-namespace scopes. */
5443 for (val = IDENTIFIER_BINDING (name); val; val = TREE_CHAIN (val))
5445 if (!LOCAL_BINDING_P (val) && nonclass)
5446 /* We're not looking for class-scoped bindings, so keep going. */
5449 /* If this is the kind of thing we're looking for, we're done. */
5450 if (qualify_lookup (BINDING_VALUE (val), flags))
5452 val = BINDING_VALUE (val);
5455 else if ((flags & LOOKUP_PREFER_TYPES)
5456 && qualify_lookup (BINDING_TYPE (val), flags))
5458 val = BINDING_TYPE (val);
5463 /* If VAL is a type from a dependent base, we're not really supposed
5464 to be able to see it; the fact that we can is the "implicit
5465 typename" extension. We call lookup_field here to turn VAL into
5466 a TYPE_DECL for a TYPENAME_TYPE. */
5467 if (processing_template_decl && val
5468 && val == IDENTIFIER_CLASS_VALUE (name)
5469 && TREE_CODE (val) == TYPE_DECL
5470 && !currently_open_class (DECL_CONTEXT (val))
5471 && uses_template_parms (current_class_type))
5472 val = lookup_field (current_class_type, name, 0, 1);
5474 /* We don't put names from baseclasses onto the IDENTIFIER_BINDING
5475 list when we're defining a type. It would probably be simpler to
5476 do this, but we don't. So, we must lookup names from base
5477 classes explicitly. */
5478 if (!val && !nonclass
5479 && current_class_type && TYPE_BEING_DEFINED (current_class_type))
5481 val = qualify_lookup (lookup_field (current_class_type, name, 0, 0),
5484 val = qualify_lookup (lookup_nested_field (name, !yylex),
5488 /* If we found a type from a dependent base class (using the
5489 implicit typename extension) make sure that there's not some
5490 global name which should be chosen instead. */
5491 if (val && TREE_CODE (val) == TYPE_DECL
5492 && IMPLICIT_TYPENAME_P (TREE_TYPE (val)))
5496 /* Any other name takes precedence over an implicit typename. Warn the
5497 user about this potentially confusing lookup. */
5498 global_val = unqualified_namespace_lookup (name, flags);
5504 /* Only warn when not lexing; we don't want to warn if they
5505 use this name as a declarator. */
5506 subtype = TREE_TYPE (TREE_TYPE (val));
5508 && ! (TREE_CODE (global_val) == TEMPLATE_DECL
5509 && CLASSTYPE_TEMPLATE_INFO (subtype)
5510 && CLASSTYPE_TI_TEMPLATE (subtype) == global_val)
5511 && ! (TREE_CODE (global_val) == TYPE_DECL
5512 && same_type_p (TREE_TYPE (global_val), subtype)))
5514 cp_warning ("lookup of `%D' finds `%#D'", name, global_val);
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);
5521 /* Use the global value instead of the implicit typename. */
5526 /* No local, or class-scoped binding. Look for a namespace-scope
5528 val = unqualified_namespace_lookup (name, flags);
5533 /* This should only warn about types used in qualified-ids. */
5534 if (from_obj && from_obj != val)
5536 if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
5537 && TREE_CODE (val) == TYPE_DECL
5538 && TREE_TYPE (from_obj) != TREE_TYPE (val))
5540 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5541 name, got_object, TREE_TYPE (from_obj));
5542 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5546 /* We don't change val to from_obj if got_object depends on
5547 template parms because that breaks implicit typename for
5548 destructor calls. */
5549 if (! uses_template_parms (got_object))
5553 /* If we have a single function from a using decl, pull it out. */
5554 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5555 val = OVL_FUNCTION (val);
5564 lookup_name_nonclass (name)
5567 return lookup_name_real (name, 0, 1, 0);
5571 lookup_function_nonclass (name, args)
5575 return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
5579 lookup_name_namespace_only (name)
5582 /* type-or-namespace, nonclass, namespace_only */
5583 return lookup_name_real (name, 1, 1, 1);
5587 lookup_name (name, prefer_type)
5591 return lookup_name_real (name, prefer_type, 0, 0);
5594 /* Similar to `lookup_name' but look only at current binding level. */
5597 lookup_name_current_level (name)
5600 register tree t = NULL_TREE;
5602 if (current_binding_level->namespace_p)
5604 t = IDENTIFIER_NAMESPACE_VALUE (name);
5606 /* extern "C" function() */
5607 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
5610 else if (IDENTIFIER_BINDING (name)
5611 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
5613 struct binding_level *b = current_binding_level;
5617 if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
5618 return IDENTIFIER_VALUE (name);
5630 /* Like lookup_name_current_level, but for types. */
5633 lookup_type_current_level (name)
5636 register tree t = NULL_TREE;
5638 my_friendly_assert (! current_binding_level->namespace_p, 980716);
5640 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
5641 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
5643 struct binding_level *b = current_binding_level;
5646 if (purpose_member (name, b->type_shadowed))
5647 return REAL_IDENTIFIER_TYPE_VALUE (name);
5659 begin_only_namespace_names ()
5661 only_namespace_names = 1;
5665 end_only_namespace_names ()
5667 only_namespace_names = 0;
5670 /* Arrange for the user to get a source line number, even when the
5671 compiler is going down in flames, so that she at least has a
5672 chance of working around problems in the compiler. We used to
5673 call error(), but that let the segmentation fault continue
5674 through; now, it's much more passive by asking them to send the
5675 maintainers mail about the problem. */
5679 int sig ATTRIBUTE_UNUSED;
5681 signal (SIGSEGV, SIG_DFL);
5683 signal (SIGIOT, SIG_DFL);
5686 signal (SIGILL, SIG_DFL);
5689 signal (SIGABRT, SIG_DFL);
5692 signal (SIGBUS, SIG_DFL);
5694 my_friendly_abort (0);
5698 /* Unused -- brendan 970107 */
5699 /* Array for holding types considered "built-in". These types
5700 are output in the module in which `main' is defined. */
5701 static tree *builtin_type_tdescs_arr;
5702 static int builtin_type_tdescs_len, builtin_type_tdescs_max;
5705 /* Push the declarations of builtin types into the namespace.
5706 RID_INDEX, if < RID_MAX is the index of the builtin type
5707 in the array RID_POINTERS. NAME is the name used when looking
5708 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5711 record_builtin_type (rid_index, name, type)
5716 tree rname = NULL_TREE, tname = NULL_TREE;
5717 tree tdecl = NULL_TREE;
5719 if ((int) rid_index < (int) RID_MAX)
5720 rname = ridpointers[(int) rid_index];
5722 tname = get_identifier (name);
5724 TYPE_BUILT_IN (type) = 1;
5728 tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
5729 set_identifier_type_value (tname, NULL_TREE);
5730 if ((int) rid_index < (int) RID_MAX)
5731 /* Built-in types live in the global namespace. */
5732 SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
5734 if (rname != NULL_TREE)
5736 if (tname != NULL_TREE)
5738 set_identifier_type_value (rname, NULL_TREE);
5739 SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
5743 tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
5744 set_identifier_type_value (rname, NULL_TREE);
5749 /* Record one of the standard Java types.
5750 * Declare it as having the given NAME.
5751 * If SIZE > 0, it is the size of one of the integral types;
5752 * otherwise it is the negative of the size of one of the other types. */
5755 record_builtin_java_type (name, size)
5761 type = make_signed_type (size);
5762 else if (size > -32)
5763 { /* "__java_char" or ""__java_boolean". */
5764 type = make_unsigned_type (-size);
5765 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5768 { /* "__java_float" or ""__java_double". */
5769 type = make_node (REAL_TYPE);
5770 TYPE_PRECISION (type) = - size;
5773 record_builtin_type (RID_MAX, name, type);
5774 decl = TYPE_NAME (type);
5775 DECL_IGNORED_P (decl) = 1;
5776 TYPE_FOR_JAVA (type) = 1;
5780 /* Push a type into the namespace so that the back-ends ignore it. */
5783 record_unknown_type (type, name)
5787 tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
5788 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5789 DECL_IGNORED_P (decl) = 1;
5790 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
5791 TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
5792 TYPE_ALIGN (type) = 1;
5793 TYPE_MODE (type) = TYPE_MODE (void_type_node);
5796 /* Push overloaded decl, in global scope, with one argument so it
5797 can be used as a callback from define_function. */
5800 push_overloaded_decl_1 (x)
5803 push_overloaded_decl (x, PUSH_GLOBAL);
5810 auto_function (name, type, code)
5812 enum built_in_function code;
5814 return define_function
5815 (IDENTIFIER_POINTER (name), type, code, push_overloaded_decl_1,
5816 IDENTIFIER_POINTER (build_decl_overload (name, TYPE_ARG_TYPES (type),
5820 /* Create the predefined scalar types of C,
5821 and some nodes representing standard constants (0, 1, (void *)0).
5822 Initialize the global binding level.
5823 Make definitions for built-in primitive functions. */
5826 init_decl_processing ()
5828 register tree endlink, int_endlink, double_endlink, unsigned_endlink;
5830 /* Data type of memcpy. */
5831 tree memcpy_ftype, strlen_ftype;
5832 int wchar_type_size;
5834 tree array_domain_type;
5835 tree vb_off_identifier = NULL_TREE;
5836 /* Function type `char *(char *, char *)' and similar ones */
5837 tree string_ftype_ptr_ptr, int_ftype_string_string;
5838 tree sizetype_endlink;
5839 tree ptr_ftype, ptr_ftype_unsigned, ptr_ftype_sizetype;
5840 tree void_ftype, void_ftype_int, void_ftype_ptr;
5842 /* Have to make these distinct before we try using them. */
5843 lang_name_cplusplus = get_identifier ("C++");
5844 lang_name_c = get_identifier ("C");
5845 lang_name_java = get_identifier ("Java");
5847 /* Enter the global namespace. */
5848 my_friendly_assert (global_namespace == NULL_TREE, 375);
5849 my_friendly_assert (current_lang_name == NULL_TREE, 375);
5850 current_lang_name = lang_name_cplusplus;
5851 push_namespace (get_identifier ("::"));
5852 global_namespace = current_namespace;
5853 current_lang_name = NULL_TREE;
5855 if (flag_strict_prototype == 2)
5856 flag_strict_prototype = pedantic;
5857 if (! flag_permissive && ! pedantic)
5858 flag_pedantic_errors = 1;
5860 strict_prototypes_lang_c = flag_strict_prototype;
5863 current_lang_name = lang_name_c;
5865 current_function_decl = NULL_TREE;
5866 named_labels = NULL_TREE;
5867 named_label_uses = NULL;
5868 current_binding_level = NULL_BINDING_LEVEL;
5869 free_binding_level = NULL_BINDING_LEVEL;
5871 /* Because most segmentation signals can be traced back into user
5872 code, catch them and at least give the user a chance of working
5873 around compiler bugs. */
5874 signal (SIGSEGV, signal_catch);
5876 /* We will also catch aborts in the back-end through signal_catch and
5877 give the user a chance to see where the error might be, and to defeat
5878 aborts in the back-end when there have been errors previously in their
5881 signal (SIGIOT, signal_catch);
5884 signal (SIGILL, signal_catch);
5887 signal (SIGABRT, signal_catch);
5890 signal (SIGBUS, signal_catch);
5893 gcc_obstack_init (&decl_obstack);
5895 /* Must lay these out before anything else gets laid out. */
5896 error_mark_node = make_node (ERROR_MARK);
5897 TREE_PERMANENT (error_mark_node) = 1;
5898 TREE_TYPE (error_mark_node) = error_mark_node;
5899 error_mark_list = build_tree_list (error_mark_node, error_mark_node);
5900 TREE_TYPE (error_mark_list) = error_mark_node;
5902 /* Make the binding_level structure for global names. */
5904 global_binding_level = current_binding_level;
5905 /* The global level is the namespace level of ::. */
5906 NAMESPACE_LEVEL (global_namespace) = global_binding_level;
5907 declare_namespace_level ();
5909 this_identifier = get_identifier (THIS_NAME);
5910 in_charge_identifier = get_identifier (IN_CHARGE_NAME);
5911 ctor_identifier = get_identifier (CTOR_NAME);
5912 dtor_identifier = get_identifier (DTOR_NAME);
5913 pfn_identifier = get_identifier (VTABLE_PFN_NAME);
5914 index_identifier = get_identifier (VTABLE_INDEX_NAME);
5915 delta_identifier = get_identifier (VTABLE_DELTA_NAME);
5916 delta2_identifier = get_identifier (VTABLE_DELTA2_NAME);
5917 pfn_or_delta2_identifier = get_identifier ("__pfn_or_delta2");
5918 if (flag_handle_signatures)
5920 tag_identifier = get_identifier (SIGTABLE_TAG_NAME);
5921 vb_off_identifier = get_identifier (SIGTABLE_VB_OFF_NAME);
5922 vt_off_identifier = get_identifier (SIGTABLE_VT_OFF_NAME);
5925 /* Define `int' and `char' first so that dbx will output them first. */
5927 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5928 record_builtin_type (RID_INT, NULL_PTR, integer_type_node);
5930 /* Define `char', which is like either `signed char' or `unsigned char'
5931 but not the same as either. */
5935 ? make_signed_type (CHAR_TYPE_SIZE)
5936 : make_unsigned_type (CHAR_TYPE_SIZE));
5937 record_builtin_type (RID_CHAR, "char", char_type_node);
5939 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5940 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
5942 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5943 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
5945 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5946 record_builtin_type (RID_MAX, "long unsigned int", long_unsigned_type_node);
5947 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
5949 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5950 record_builtin_type (RID_MAX, "long long int", long_long_integer_type_node);
5952 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5953 record_builtin_type (RID_MAX, "long long unsigned int",
5954 long_long_unsigned_type_node);
5955 record_builtin_type (RID_MAX, "long long unsigned",
5956 long_long_unsigned_type_node);
5958 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5959 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
5960 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5961 record_builtin_type (RID_MAX, "short unsigned int", short_unsigned_type_node);
5962 record_builtin_type (RID_MAX, "unsigned short", short_unsigned_type_node);
5964 /* `unsigned long' is the standard type for sizeof.
5965 Note that stddef.h uses `unsigned long',
5966 and this must agree, even if long and int are the same size. */
5968 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE))));
5971 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE)));
5973 /* Define both `signed char' and `unsigned char'. */
5974 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5975 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
5976 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5977 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
5979 /* These are types that type_for_size and type_for_mode use. */
5980 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
5981 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
5982 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
5983 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
5984 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
5985 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
5986 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
5987 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
5988 #if HOST_BITS_PER_WIDE_INT >= 64
5989 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
5990 pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node));
5992 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
5993 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
5994 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
5995 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
5996 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
5997 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
5998 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
5999 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
6000 #if HOST_BITS_PER_WIDE_INT >= 64
6001 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
6002 pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node));
6005 float_type_node = make_node (REAL_TYPE);
6006 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6007 record_builtin_type (RID_FLOAT, NULL_PTR, float_type_node);
6008 layout_type (float_type_node);
6010 double_type_node = make_node (REAL_TYPE);
6011 if (flag_short_double)
6012 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6014 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6015 record_builtin_type (RID_DOUBLE, NULL_PTR, double_type_node);
6016 layout_type (double_type_node);
6018 long_double_type_node = make_node (REAL_TYPE);
6019 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6020 record_builtin_type (RID_MAX, "long double", long_double_type_node);
6021 layout_type (long_double_type_node);
6023 complex_integer_type_node = make_node (COMPLEX_TYPE);
6024 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
6025 complex_integer_type_node));
6026 TREE_TYPE (complex_integer_type_node) = integer_type_node;
6027 layout_type (complex_integer_type_node);
6029 complex_float_type_node = make_node (COMPLEX_TYPE);
6030 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
6031 complex_float_type_node));
6032 TREE_TYPE (complex_float_type_node) = float_type_node;
6033 layout_type (complex_float_type_node);
6035 complex_double_type_node = make_node (COMPLEX_TYPE);
6036 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
6037 complex_double_type_node));
6038 TREE_TYPE (complex_double_type_node) = double_type_node;
6039 layout_type (complex_double_type_node);
6041 complex_long_double_type_node = make_node (COMPLEX_TYPE);
6042 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
6043 complex_long_double_type_node));
6044 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
6045 layout_type (complex_long_double_type_node);
6047 java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6048 java_short_type_node = record_builtin_java_type ("__java_short", 16);
6049 java_int_type_node = record_builtin_java_type ("__java_int", 32);
6050 java_long_type_node = record_builtin_java_type ("__java_long", 64);
6051 java_float_type_node = record_builtin_java_type ("__java_float", -32);
6052 java_double_type_node = record_builtin_java_type ("__java_double", -64);
6053 java_char_type_node = record_builtin_java_type ("__java_char", -16);
6054 java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6056 integer_zero_node = build_int_2 (0, 0);
6057 TREE_TYPE (integer_zero_node) = integer_type_node;
6058 integer_one_node = build_int_2 (1, 0);
6059 TREE_TYPE (integer_one_node) = integer_type_node;
6060 integer_two_node = build_int_2 (2, 0);
6061 TREE_TYPE (integer_two_node) = integer_type_node;
6062 integer_three_node = build_int_2 (3, 0);
6063 TREE_TYPE (integer_three_node) = integer_type_node;
6065 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6066 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6067 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6068 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6069 TYPE_PRECISION (boolean_type_node) = 1;
6070 record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6071 boolean_false_node = build_int_2 (0, 0);
6072 TREE_TYPE (boolean_false_node) = boolean_type_node;
6073 boolean_true_node = build_int_2 (1, 0);
6074 TREE_TYPE (boolean_true_node) = boolean_type_node;
6076 /* These are needed by stor-layout.c. */
6077 size_zero_node = size_int (0);
6078 size_one_node = size_int (1);
6080 signed_size_zero_node = build_int_2 (0, 0);
6081 TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6083 void_type_node = make_node (VOID_TYPE);
6084 record_builtin_type (RID_VOID, NULL_PTR, void_type_node);
6085 layout_type (void_type_node); /* Uses integer_zero_node. */
6086 void_list_node = build_tree_list (NULL_TREE, void_type_node);
6087 TREE_PARMLIST (void_list_node) = 1;
6089 null_pointer_node = build_int_2 (0, 0);
6090 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
6091 layout_type (TREE_TYPE (null_pointer_node));
6093 /* Used for expressions that do nothing, but are not errors. */
6094 void_zero_node = build_int_2 (0, 0);
6095 TREE_TYPE (void_zero_node) = void_type_node;
6097 string_type_node = build_pointer_type (char_type_node);
6098 const_string_type_node
6099 = build_pointer_type (build_qualified_type (char_type_node,
6102 record_builtin_type (RID_MAX, NULL_PTR, string_type_node);
6105 /* Make a type to be the domain of a few array types
6106 whose domains don't really matter.
6107 200 is small enough that it always fits in size_t
6108 and large enough that it can hold most function names for the
6109 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6110 array_domain_type = build_index_type (build_int_2 (200, 0));
6112 /* Make a type for arrays of characters.
6113 With luck nothing will ever really depend on the length of this
6115 char_array_type_node
6116 = build_array_type (char_type_node, array_domain_type);
6117 /* Likewise for arrays of ints. */
6119 = build_array_type (integer_type_node, array_domain_type);
6121 /* This is just some anonymous class type. Nobody should ever
6122 need to look inside this envelope. */
6123 class_star_type_node = build_pointer_type (make_lang_type (RECORD_TYPE));
6125 default_function_type
6126 = build_function_type (integer_type_node, NULL_TREE);
6128 ptr_type_node = build_pointer_type (void_type_node);
6130 = build_pointer_type (build_qualified_type (void_type_node,
6133 record_builtin_type (RID_MAX, NULL_PTR, ptr_type_node);
6135 endlink = void_list_node;
6136 int_endlink = tree_cons (NULL_TREE, integer_type_node, endlink);
6137 double_endlink = tree_cons (NULL_TREE, double_type_node, endlink);
6138 unsigned_endlink = tree_cons (NULL_TREE, unsigned_type_node, endlink);
6140 ptr_ftype = build_function_type (ptr_type_node, NULL_TREE);
6141 ptr_ftype_unsigned = build_function_type (ptr_type_node, unsigned_endlink);
6142 sizetype_endlink = tree_cons (NULL_TREE, sizetype, endlink);
6143 /* We realloc here because sizetype could be int or unsigned. S'ok. */
6144 ptr_ftype_sizetype = build_function_type (ptr_type_node, sizetype_endlink);
6146 void_ftype = build_function_type (void_type_node, endlink);
6147 void_ftype_int = build_function_type (void_type_node, int_endlink);
6149 = build_function_type (void_type_node,
6150 tree_cons (NULL_TREE, ptr_type_node, endlink));
6152 = build_exception_variant (void_ftype_ptr,
6153 tree_cons (NULL_TREE, NULL_TREE, NULL_TREE));
6156 = build_function_type (float_type_node,
6157 tree_cons (NULL_TREE, float_type_node, endlink));
6160 = build_function_type (double_type_node, double_endlink);
6162 ldouble_ftype_ldouble
6163 = build_function_type (long_double_type_node,
6164 tree_cons (NULL_TREE, long_double_type_node,
6167 double_ftype_double_double
6168 = build_function_type (double_type_node,
6169 tree_cons (NULL_TREE, double_type_node,
6173 = build_function_type (integer_type_node, int_endlink);
6176 = build_function_type (long_integer_type_node,
6177 tree_cons (NULL_TREE, long_integer_type_node,
6180 int_ftype_cptr_cptr_sizet
6181 = build_function_type (integer_type_node,
6182 tree_cons (NULL_TREE, const_ptr_type_node,
6183 tree_cons (NULL_TREE, const_ptr_type_node,
6184 tree_cons (NULL_TREE,
6188 string_ftype_ptr_ptr /* strcpy prototype */
6189 = build_function_type (string_type_node,
6190 tree_cons (NULL_TREE, string_type_node,
6191 tree_cons (NULL_TREE,
6192 const_string_type_node,
6195 int_ftype_string_string /* strcmp prototype */
6196 = build_function_type (integer_type_node,
6197 tree_cons (NULL_TREE, const_string_type_node,
6198 tree_cons (NULL_TREE,
6199 const_string_type_node,
6202 strlen_ftype /* strlen prototype */
6203 = build_function_type (sizetype,
6204 tree_cons (NULL_TREE, const_string_type_node,
6207 memcpy_ftype /* memcpy prototype */
6208 = build_function_type (ptr_type_node,
6209 tree_cons (NULL_TREE, ptr_type_node,
6210 tree_cons (NULL_TREE, const_ptr_type_node,
6211 sizetype_endlink)));
6213 if (flag_huge_objects)
6214 delta_type_node = long_integer_type_node;
6216 delta_type_node = short_integer_type_node;
6218 builtin_function ("__builtin_constant_p", default_function_type,
6219 BUILT_IN_CONSTANT_P, NULL_PTR);
6221 builtin_return_address_fndecl
6222 = builtin_function ("__builtin_return_address", ptr_ftype_unsigned,
6223 BUILT_IN_RETURN_ADDRESS, NULL_PTR);
6225 builtin_function ("__builtin_frame_address", ptr_ftype_unsigned,
6226 BUILT_IN_FRAME_ADDRESS, NULL_PTR);
6228 builtin_function ("__builtin_alloca", ptr_ftype_sizetype,
6229 BUILT_IN_ALLOCA, "alloca");
6230 builtin_function ("__builtin_ffs", int_ftype_int, BUILT_IN_FFS, NULL_PTR);
6231 /* Define alloca, ffs as builtins.
6232 Declare _exit just to mark it as volatile. */
6233 if (! flag_no_builtin && !flag_no_nonansi_builtin)
6235 temp = builtin_function ("alloca", ptr_ftype_sizetype,
6236 BUILT_IN_ALLOCA, NULL_PTR);
6237 /* Suppress error if redefined as a non-function. */
6238 DECL_BUILT_IN_NONANSI (temp) = 1;
6239 temp = builtin_function ("ffs", int_ftype_int, BUILT_IN_FFS, NULL_PTR);
6240 /* Suppress error if redefined as a non-function. */
6241 DECL_BUILT_IN_NONANSI (temp) = 1;
6242 temp = builtin_function ("_exit", void_ftype_int,
6243 NOT_BUILT_IN, NULL_PTR);
6244 TREE_THIS_VOLATILE (temp) = 1;
6245 TREE_SIDE_EFFECTS (temp) = 1;
6246 /* Suppress error if redefined as a non-function. */
6247 DECL_BUILT_IN_NONANSI (temp) = 1;
6250 builtin_function ("__builtin_abs", int_ftype_int, BUILT_IN_ABS, NULL_PTR);
6251 builtin_function ("__builtin_fabsf", float_ftype_float, BUILT_IN_FABS,
6253 builtin_function ("__builtin_fabs", double_ftype_double, BUILT_IN_FABS,
6255 builtin_function ("__builtin_fabsl", ldouble_ftype_ldouble, BUILT_IN_FABS,
6257 builtin_function ("__builtin_labs", long_ftype_long,
6258 BUILT_IN_LABS, NULL_PTR);
6259 builtin_function ("__builtin_saveregs", ptr_ftype,
6260 BUILT_IN_SAVEREGS, NULL_PTR);
6261 builtin_function ("__builtin_classify_type", default_function_type,
6262 BUILT_IN_CLASSIFY_TYPE, NULL_PTR);
6263 builtin_function ("__builtin_next_arg", ptr_ftype,
6264 BUILT_IN_NEXT_ARG, NULL_PTR);
6265 builtin_function ("__builtin_args_info", int_ftype_int,
6266 BUILT_IN_ARGS_INFO, NULL_PTR);
6267 builtin_function ("__builtin_setjmp",
6268 build_function_type (integer_type_node,
6269 tree_cons (NULL_TREE, ptr_type_node,
6271 BUILT_IN_SETJMP, NULL_PTR);
6272 builtin_function ("__builtin_longjmp",
6273 build_function_type (integer_type_node,
6274 tree_cons (NULL_TREE, ptr_type_node,
6275 tree_cons (NULL_TREE,
6278 BUILT_IN_LONGJMP, NULL_PTR);
6280 /* Untyped call and return. */
6281 builtin_function ("__builtin_apply_args", ptr_ftype,
6282 BUILT_IN_APPLY_ARGS, NULL_PTR);
6284 temp = tree_cons (NULL_TREE,
6285 build_pointer_type (build_function_type (void_type_node,
6287 tree_cons (NULL_TREE, ptr_ftype_sizetype, NULL_TREE));
6288 builtin_function ("__builtin_apply",
6289 build_function_type (ptr_type_node, temp),
6290 BUILT_IN_APPLY, NULL_PTR);
6291 builtin_function ("__builtin_return", void_ftype_ptr,
6292 BUILT_IN_RETURN, NULL_PTR);
6294 /* Currently under experimentation. */
6295 builtin_function ("__builtin_memcpy", memcpy_ftype,
6296 BUILT_IN_MEMCPY, "memcpy");
6297 builtin_function ("__builtin_memcmp", int_ftype_cptr_cptr_sizet,
6298 BUILT_IN_MEMCMP, "memcmp");
6299 builtin_function ("__builtin_strcmp", int_ftype_string_string,
6300 BUILT_IN_STRCMP, "strcmp");
6301 builtin_function ("__builtin_strcpy", string_ftype_ptr_ptr,
6302 BUILT_IN_STRCPY, "strcpy");
6303 builtin_function ("__builtin_strlen", strlen_ftype,
6304 BUILT_IN_STRLEN, "strlen");
6305 builtin_function ("__builtin_sqrtf", float_ftype_float,
6306 BUILT_IN_FSQRT, "sqrtf");
6307 builtin_function ("__builtin_fsqrt", double_ftype_double,
6308 BUILT_IN_FSQRT, NULL_PTR);
6309 builtin_function ("__builtin_sqrtl", ldouble_ftype_ldouble,
6310 BUILT_IN_FSQRT, "sqrtl");
6311 builtin_function ("__builtin_sinf", float_ftype_float,
6312 BUILT_IN_SIN, "sinf");
6313 builtin_function ("__builtin_sin", double_ftype_double,
6314 BUILT_IN_SIN, "sin");
6315 builtin_function ("__builtin_sinl", ldouble_ftype_ldouble,
6316 BUILT_IN_SIN, "sinl");
6317 builtin_function ("__builtin_cosf", float_ftype_float,
6318 BUILT_IN_COS, "cosf");
6319 builtin_function ("__builtin_cos", double_ftype_double,
6320 BUILT_IN_COS, "cos");
6321 builtin_function ("__builtin_cosl", ldouble_ftype_ldouble,
6322 BUILT_IN_COS, "cosl");
6324 if (!flag_no_builtin)
6326 builtin_function ("abs", int_ftype_int, BUILT_IN_ABS, NULL_PTR);
6327 builtin_function ("fabs", double_ftype_double, BUILT_IN_FABS, NULL_PTR);
6328 builtin_function ("labs", long_ftype_long, BUILT_IN_LABS, NULL_PTR);
6329 builtin_function ("fabsf", float_ftype_float, BUILT_IN_FABS, NULL_PTR);
6330 builtin_function ("fabsl", ldouble_ftype_ldouble, BUILT_IN_FABS,
6332 builtin_function ("memcpy", memcpy_ftype, BUILT_IN_MEMCPY, NULL_PTR);
6333 builtin_function ("memcmp", int_ftype_cptr_cptr_sizet, BUILT_IN_MEMCMP,
6335 builtin_function ("strcmp", int_ftype_string_string, BUILT_IN_STRCMP,
6337 builtin_function ("strcpy", string_ftype_ptr_ptr, BUILT_IN_STRCPY,
6339 builtin_function ("strlen", strlen_ftype, BUILT_IN_STRLEN, NULL_PTR);
6340 builtin_function ("sqrtf", float_ftype_float, BUILT_IN_FSQRT, NULL_PTR);
6341 builtin_function ("sqrt", double_ftype_double, BUILT_IN_FSQRT, NULL_PTR);
6342 builtin_function ("sqrtl", ldouble_ftype_ldouble, BUILT_IN_FSQRT,
6344 builtin_function ("sinf", float_ftype_float, BUILT_IN_SIN, NULL_PTR);
6345 builtin_function ("sin", double_ftype_double, BUILT_IN_SIN, NULL_PTR);
6346 builtin_function ("sinl", ldouble_ftype_ldouble, BUILT_IN_SIN, NULL_PTR);
6347 builtin_function ("cosf", float_ftype_float, BUILT_IN_COS, NULL_PTR);
6348 builtin_function ("cos", double_ftype_double, BUILT_IN_COS, NULL_PTR);
6349 builtin_function ("cosl", ldouble_ftype_ldouble, BUILT_IN_COS, NULL_PTR);
6351 /* Declare these functions volatile
6352 to avoid spurious "control drops through" warnings. */
6353 temp = builtin_function ("abort", void_ftype,
6354 NOT_BUILT_IN, NULL_PTR);
6355 TREE_THIS_VOLATILE (temp) = 1;
6356 TREE_SIDE_EFFECTS (temp) = 1;
6357 /* Well, these are actually ANSI, but we can't set DECL_BUILT_IN on
6359 DECL_BUILT_IN_NONANSI (temp) = 1;
6360 temp = builtin_function ("exit", void_ftype_int,
6361 NOT_BUILT_IN, NULL_PTR);
6362 TREE_THIS_VOLATILE (temp) = 1;
6363 TREE_SIDE_EFFECTS (temp) = 1;
6364 DECL_BUILT_IN_NONANSI (temp) = 1;
6368 /* Support for these has not been written in either expand_builtin
6369 or build_function_call. */
6370 builtin_function ("__builtin_div", default_ftype, BUILT_IN_DIV, NULL_PTR);
6371 builtin_function ("__builtin_ldiv", default_ftype, BUILT_IN_LDIV, NULL_PTR);
6372 builtin_function ("__builtin_ffloor", double_ftype_double, BUILT_IN_FFLOOR,
6374 builtin_function ("__builtin_fceil", double_ftype_double, BUILT_IN_FCEIL,
6376 builtin_function ("__builtin_fmod", double_ftype_double_double,
6377 BUILT_IN_FMOD, NULL_PTR);
6378 builtin_function ("__builtin_frem", double_ftype_double_double,
6379 BUILT_IN_FREM, NULL_PTR);
6380 builtin_function ("__builtin_memset", ptr_ftype_ptr_int_int,
6381 BUILT_IN_MEMSET, NULL_PTR);
6382 builtin_function ("__builtin_getexp", double_ftype_double, BUILT_IN_GETEXP,
6384 builtin_function ("__builtin_getman", double_ftype_double, BUILT_IN_GETMAN,
6388 /* C++ extensions */
6390 unknown_type_node = make_node (UNKNOWN_TYPE);
6391 record_unknown_type (unknown_type_node, "unknown type");
6393 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6394 TREE_TYPE (unknown_type_node) = unknown_type_node;
6396 TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0);
6398 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6400 TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6401 TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6403 /* This is for handling opaque types in signatures. */
6404 opaque_type_node = copy_node (ptr_type_node);
6405 TYPE_MAIN_VARIANT (opaque_type_node) = opaque_type_node;
6406 record_builtin_type (RID_MAX, 0, opaque_type_node);
6408 /* This is special for C++ so functions can be overloaded. */
6410 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE)));
6411 wchar_type_size = TYPE_PRECISION (wchar_type_node);
6412 signed_wchar_type_node = make_signed_type (wchar_type_size);
6413 unsigned_wchar_type_node = make_unsigned_type (wchar_type_size);
6415 = TREE_UNSIGNED (wchar_type_node)
6416 ? unsigned_wchar_type_node
6417 : signed_wchar_type_node;
6418 record_builtin_type (RID_WCHAR, "__wchar_t", wchar_type_node);
6420 /* Artificial declaration of wchar_t -- can be bashed */
6421 wchar_decl_node = build_decl (TYPE_DECL, get_identifier ("wchar_t"),
6423 pushdecl (wchar_decl_node);
6425 /* This is for wide string constants. */
6426 wchar_array_type_node
6427 = build_array_type (wchar_type_node, array_domain_type);
6429 if (flag_vtable_thunks)
6431 /* Make sure we get a unique function type, so we can give
6432 its pointer type a name. (This wins for gdb.) */
6433 tree vfunc_type = make_node (FUNCTION_TYPE);
6434 TREE_TYPE (vfunc_type) = integer_type_node;
6435 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6436 layout_type (vfunc_type);
6438 vtable_entry_type = build_pointer_type (vfunc_type);
6442 vtable_entry_type = make_lang_type (RECORD_TYPE);
6443 fields[0] = build_lang_field_decl (FIELD_DECL, delta_identifier,
6445 fields[1] = build_lang_field_decl (FIELD_DECL, index_identifier,
6447 fields[2] = build_lang_field_decl (FIELD_DECL, pfn_identifier,
6449 finish_builtin_type (vtable_entry_type, VTBL_PTR_TYPE, fields, 2,
6452 /* Make this part of an invisible union. */
6453 fields[3] = copy_node (fields[2]);
6454 TREE_TYPE (fields[3]) = delta_type_node;
6455 DECL_NAME (fields[3]) = delta2_identifier;
6456 DECL_MODE (fields[3]) = TYPE_MODE (delta_type_node);
6457 DECL_SIZE (fields[3]) = TYPE_SIZE (delta_type_node);
6458 TREE_UNSIGNED (fields[3]) = 0;
6459 TREE_CHAIN (fields[2]) = fields[3];
6460 vtable_entry_type = build_qualified_type (vtable_entry_type,
6463 record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6466 = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6467 layout_type (vtbl_type_node);
6468 vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6469 record_builtin_type (RID_MAX, NULL_PTR, vtbl_type_node);
6470 vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6471 layout_type (vtbl_ptr_type_node);
6472 record_builtin_type (RID_MAX, NULL_PTR, vtbl_ptr_type_node);
6474 /* Simplify life by making a "sigtable_entry_type". Give its
6475 fields names so that the debugger can use them. */
6477 if (flag_handle_signatures)
6479 sigtable_entry_type = make_lang_type (RECORD_TYPE);
6480 fields[0] = build_lang_field_decl (FIELD_DECL, tag_identifier,
6482 fields[1] = build_lang_field_decl (FIELD_DECL, vb_off_identifier,
6484 fields[2] = build_lang_field_decl (FIELD_DECL, delta_identifier,
6486 fields[3] = build_lang_field_decl (FIELD_DECL, index_identifier,
6488 fields[4] = build_lang_field_decl (FIELD_DECL, pfn_identifier,
6491 /* Set the alignment to the max of the alignment of ptr_type_node and
6492 delta_type_node. Double alignment wastes a word on the Sparc. */
6493 finish_builtin_type (sigtable_entry_type, SIGTABLE_PTR_TYPE, fields, 4,
6494 (TYPE_ALIGN (ptr_type_node) > TYPE_ALIGN (delta_type_node))
6498 /* Make this part of an invisible union. */
6499 fields[5] = copy_node (fields[4]);
6500 TREE_TYPE (fields[5]) = delta_type_node;
6501 DECL_NAME (fields[5]) = vt_off_identifier;
6502 DECL_MODE (fields[5]) = TYPE_MODE (delta_type_node);
6503 DECL_SIZE (fields[5]) = TYPE_SIZE (delta_type_node);
6504 TREE_UNSIGNED (fields[5]) = 0;
6505 TREE_CHAIN (fields[4]) = fields[5];
6507 sigtable_entry_type = build_qualified_type (sigtable_entry_type,
6509 record_builtin_type (RID_MAX, SIGTABLE_PTR_TYPE, sigtable_entry_type);
6512 std_node = build_decl (NAMESPACE_DECL,
6513 get_identifier (flag_honor_std ? "fake std":"std"),
6515 pushdecl (std_node);
6517 global_type_node = make_node (LANG_TYPE);
6518 record_unknown_type (global_type_node, "global type");
6521 current_lang_name = lang_name_cplusplus;
6524 tree bad_alloc_type_node, newtype, deltype;
6526 push_namespace (get_identifier ("std"));
6527 bad_alloc_type_node = xref_tag
6528 (class_type_node, get_identifier ("bad_alloc"), 1);
6531 newtype = build_exception_variant
6532 (ptr_ftype_sizetype, build_tree_list (NULL_TREE, bad_alloc_type_node));
6533 deltype = build_exception_variant
6534 (void_ftype_ptr, build_tree_list (NULL_TREE, NULL_TREE));
6535 auto_function (ansi_opname[(int) NEW_EXPR], newtype, NOT_BUILT_IN);
6536 auto_function (ansi_opname[(int) VEC_NEW_EXPR], newtype, NOT_BUILT_IN);
6537 global_delete_fndecl
6538 = auto_function (ansi_opname[(int) DELETE_EXPR], deltype, NOT_BUILT_IN);
6539 auto_function (ansi_opname[(int) VEC_DELETE_EXPR], deltype, NOT_BUILT_IN);
6543 = define_function ("__pure_virtual", void_ftype,
6544 NOT_BUILT_IN, 0, 0);
6546 /* Perform other language dependent initializations. */
6547 init_class_processing ();
6548 init_init_processing ();
6549 init_search_processing ();
6551 init_rtti_processing ();
6553 if (flag_exceptions)
6554 init_exception_processing ();
6557 flag_inline_functions = 0;
6560 if (! supports_one_only ())
6563 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6564 declare_function_name ();
6566 /* Prepare to check format strings against argument lists. */
6567 init_function_format_info ();
6569 /* Show we use EH for cleanups. */
6570 using_eh_for_cleanups ();
6572 print_error_function = lang_print_error_function;
6573 lang_get_alias_set = &c_get_alias_set;
6575 /* Maintain consistency. Perhaps we should just complain if they
6576 say -fwritable-strings? */
6577 if (flag_writable_strings)
6578 flag_const_strings = 0;
6581 /* Function to print any language-specific context for an error message. */
6584 lang_print_error_function (file)
6587 default_print_error_function (file);
6588 maybe_print_template_context ();
6591 /* Make a definition for a builtin function named NAME and whose data type
6592 is TYPE. TYPE should be a function type with argument types.
6593 FUNCTION_CODE tells later passes how to compile calls to this function.
6594 See tree.h for its possible values.
6596 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6597 the name to be called if we can't opencode the function. */
6600 define_function (name, type, function_code, pfn, library_name)
6603 enum built_in_function function_code;
6604 void (*pfn) PROTO((tree));
6607 tree decl = build_lang_decl (FUNCTION_DECL, get_identifier (name), type);
6608 DECL_EXTERNAL (decl) = 1;
6609 TREE_PUBLIC (decl) = 1;
6610 DECL_ARTIFICIAL (decl) = 1;
6612 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392);
6613 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
6615 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6616 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6617 function in the namespace. */
6618 if (pfn) (*pfn) (decl);
6620 DECL_ASSEMBLER_NAME (decl) = get_identifier (library_name);
6621 make_function_rtl (decl);
6622 if (function_code != NOT_BUILT_IN)
6624 DECL_BUILT_IN (decl) = 1;
6625 DECL_FUNCTION_CODE (decl) = function_code;
6630 /* When we call finish_struct for an anonymous union, we create
6631 default copy constructors and such. But, an anonymous union
6632 shouldn't have such things; this function undoes the damage to the
6633 anonymous union type T.
6635 (The reason that we create the synthesized methods is that we don't
6636 distinguish `union { int i; }' from `typedef union { int i; } U'.
6637 The first is an anonymous union; the second is just an ordinary
6641 fixup_anonymous_union (t)
6646 /* Wipe out memory of synthesized methods */
6647 TYPE_HAS_CONSTRUCTOR (t) = 0;
6648 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6649 TYPE_HAS_INIT_REF (t) = 0;
6650 TYPE_HAS_CONST_INIT_REF (t) = 0;
6651 TYPE_HAS_ASSIGN_REF (t) = 0;
6652 TYPE_HAS_ASSIGNMENT (t) = 0;
6653 TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6655 /* Splice the implicitly generated functions out of the TYPE_METHODS
6657 q = &TYPE_METHODS (t);
6660 if (DECL_ARTIFICIAL (*q))
6661 *q = TREE_CHAIN (*q);
6663 q = &TREE_CHAIN (*q);
6666 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6667 function members. */
6668 if (TYPE_METHODS (t))
6669 error ("an anonymous union cannot have function members");
6672 /* Make sure that a declaration with no declarator is well-formed, i.e.
6673 just defines a tagged type or anonymous union.
6675 Returns the type defined, if any. */
6678 check_tag_decl (declspecs)
6682 tree ob_modifier = NULL_TREE;
6684 register tree t = NULL_TREE;
6686 for (link = declspecs; link; link = TREE_CHAIN (link))
6688 register tree value = TREE_VALUE (link);
6694 if (IS_AGGR_TYPE (value) || TREE_CODE (value) == ENUMERAL_TYPE)
6696 my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
6700 else if (value == ridpointers[(int) RID_FRIEND])
6702 if (current_class_type == NULL_TREE
6703 || current_scope () != current_class_type)
6704 ob_modifier = value;
6706 else if (value == ridpointers[(int) RID_STATIC]
6707 || value == ridpointers[(int) RID_EXTERN]
6708 || value == ridpointers[(int) RID_AUTO]
6709 || value == ridpointers[(int) RID_REGISTER]
6710 || value == ridpointers[(int) RID_INLINE]
6711 || value == ridpointers[(int) RID_VIRTUAL]
6712 || value == ridpointers[(int) RID_CONST]
6713 || value == ridpointers[(int) RID_VOLATILE]
6714 || value == ridpointers[(int) RID_EXPLICIT])
6715 ob_modifier = value;
6719 error ("multiple types in one declaration");
6721 /* Inside a class, we might be in a friend or access declaration.
6722 Until we have a good way of detecting the latter, don't warn. */
6723 if (t == NULL_TREE && ! current_class_type)
6724 pedwarn ("declaration does not declare anything");
6725 else if (t && ANON_UNION_TYPE_P (t))
6726 /* Anonymous unions are objects, so they can have specifiers. */;
6727 else if (ob_modifier)
6729 if (ob_modifier == ridpointers[(int) RID_INLINE]
6730 || ob_modifier == ridpointers[(int) RID_VIRTUAL])
6731 cp_error ("`%D' can only be specified for functions", ob_modifier);
6732 else if (ob_modifier == ridpointers[(int) RID_FRIEND])
6733 cp_error ("`%D' can only be specified inside a class", ob_modifier);
6734 else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
6735 cp_error ("`%D' can only be specified for constructors",
6738 cp_error ("`%D' can only be specified for objects and functions",
6745 /* Called when a declaration is seen that contains no names to declare.
6746 If its type is a reference to a structure, union or enum inherited
6747 from a containing scope, shadow that tag name for the current scope
6748 with a forward reference.
6749 If its type defines a new named structure or union
6750 or defines an enum, it is valid but we need not do anything here.
6751 Otherwise, it is an error.
6753 C++: may have to grok the declspecs to learn about static,
6754 complain for anonymous unions. */
6757 shadow_tag (declspecs)
6760 tree t = check_tag_decl (declspecs);
6763 maybe_process_partial_specialization (t);
6765 /* This is where the variables in an anonymous union are
6766 declared. An anonymous union declaration looks like:
6768 because there is no declarator after the union, the parser
6769 sends that declaration here. */
6770 if (t && ANON_UNION_TYPE_P (t))
6772 fixup_anonymous_union (t);
6774 if (TYPE_FIELDS (t))
6776 tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
6778 finish_anon_union (decl);
6783 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6786 groktypename (typename)
6789 if (TREE_CODE (typename) != TREE_LIST)
6791 return grokdeclarator (TREE_VALUE (typename),
6792 TREE_PURPOSE (typename),
6793 TYPENAME, 0, NULL_TREE);
6796 /* Decode a declarator in an ordinary declaration or data definition.
6797 This is called as soon as the type information and variable name
6798 have been parsed, before parsing the initializer if any.
6799 Here we create the ..._DECL node, fill in its type,
6800 and put it on the list of decls for the current context.
6801 The ..._DECL node is returned as the value.
6803 Exception: for arrays where the length is not specified,
6804 the type is left null, to be filled in by `cp_finish_decl'.
6806 Function definitions do not come here; they go to start_function
6807 instead. However, external and forward declarations of functions
6808 do go through here. Structure field declarations are done by
6809 grokfield and not through here. */
6811 /* Set this to zero to debug not using the temporary obstack
6812 to parse initializers. */
6813 int debug_temp_inits = 1;
6816 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
6817 tree declarator, declspecs;
6819 tree attributes, prefix_attributes;
6822 register tree type, tem;
6824 extern int have_extern_spec;
6825 extern int used_extern_spec;
6828 /* See code below that used this. */
6829 int init_written = initialized;
6832 /* This should only be done once on the top most decl. */
6833 if (have_extern_spec && !used_extern_spec)
6835 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"),
6837 used_extern_spec = 1;
6840 decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
6842 if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
6845 type = TREE_TYPE (decl);
6847 /* Don't lose if destructors must be executed at file-level. */
6848 if (! processing_template_decl && TREE_STATIC (decl)
6849 && TYPE_NEEDS_DESTRUCTOR (complete_type (type))
6850 && !TREE_PERMANENT (decl))
6852 push_obstacks (&permanent_obstack, &permanent_obstack);
6853 decl = copy_node (decl);
6854 if (TREE_CODE (type) == ARRAY_TYPE)
6856 tree itype = TYPE_DOMAIN (type);
6857 if (itype && ! TREE_PERMANENT (itype))
6859 itype = build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype)));
6860 type = build_cplus_array_type (TREE_TYPE (type), itype);
6861 TREE_TYPE (decl) = type;
6868 = (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
6869 ? DECL_CLASS_CONTEXT (decl)
6870 : DECL_CONTEXT (decl);
6872 if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
6873 && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
6875 /* When parsing the initializer, lookup should use the object's
6877 push_decl_namespace (context);
6880 /* We are only interested in class contexts, later. */
6881 if (context && TREE_CODE (context) == NAMESPACE_DECL)
6882 context = NULL_TREE;
6885 /* Is it valid for this decl to have an initializer at all?
6886 If not, set INITIALIZED to zero, which will indirectly
6887 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6888 switch (TREE_CODE (decl))
6891 /* typedef foo = bar means give foo the same type as bar.
6892 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6893 Any other case of an initialization in a TYPE_DECL is an error. */
6894 if (pedantic || list_length (declspecs) > 1)
6896 cp_error ("typedef `%D' is initialized", decl);
6902 cp_error ("function `%#D' is initialized like a variable", decl);
6907 if (! processing_template_decl)
6909 if (type != error_mark_node)
6911 if (TYPE_SIZE (type) != NULL_TREE
6912 && ! TREE_CONSTANT (TYPE_SIZE (type)))
6915 ("variable-sized object `%D' may not be initialized",
6920 if (TREE_CODE (type) == ARRAY_TYPE
6921 && TYPE_SIZE (complete_type (TREE_TYPE (type))) == NULL_TREE)
6924 ("elements of array `%#D' have incomplete type", decl);
6933 if (! toplevel_bindings_p ()
6934 && DECL_EXTERNAL (decl))
6935 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6937 DECL_EXTERNAL (decl) = 0;
6938 if (toplevel_bindings_p ())
6939 TREE_STATIC (decl) = 1;
6941 /* Tell `pushdecl' this is an initialized decl
6942 even though we don't yet have the initializer expression.
6943 Also tell `cp_finish_decl' it may store the real initializer. */
6944 DECL_INITIAL (decl) = error_mark_node;
6947 if (context && TYPE_SIZE (complete_type (context)) != NULL_TREE)
6949 pushclass (context, 2);
6951 if (TREE_CODE (decl) == VAR_DECL)
6953 tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
6954 if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
6955 cp_error ("`%#D' is not a static member of `%#T'", decl, context);
6958 if (DECL_CONTEXT (field) != context)
6960 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6961 DECL_CONTEXT (field), DECL_NAME (decl),
6962 context, DECL_NAME (decl));
6963 DECL_CONTEXT (decl) = DECL_CONTEXT (field);
6965 /* Static data member are tricky; an in-class initialization
6966 still doesn't provide a definition, so the in-class
6967 declaration will have DECL_EXTERNAL set, but will have an
6968 initialization. Thus, duplicate_decls won't warn
6969 about this situation, and so we check here. */
6970 if (DECL_INITIAL (decl) && DECL_INITIAL (field))
6971 cp_error ("duplicate initialization of %D", decl);
6972 if (duplicate_decls (decl, field))
6978 tree field = check_classfn (context, decl);
6979 if (field && duplicate_decls (decl, field))
6983 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6984 DECL_IN_AGGR_P (decl) = 0;
6985 if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
6986 || CLASSTYPE_USE_TEMPLATE (context))
6988 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
6989 /* [temp.expl.spec] An explicit specialization of a static data
6990 member of a template is a definition if the declaration
6991 includes an initializer; otherwise, it is a declaration.
6993 We check for processing_specialization so this only applies
6994 to the new specialization syntax. */
6995 if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
6996 DECL_EXTERNAL (decl) = 1;
6999 if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
7000 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7004 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7005 SET_DEFAULT_DECL_ATTRIBUTES (decl, attributes);
7008 /* Set attributes here so if duplicate decl, will have proper attributes. */
7009 cplus_decl_attributes (decl, attributes, prefix_attributes);
7011 /* Add this decl to the current binding level, but not if it
7012 comes from another scope, e.g. a static member variable.
7013 TEM may equal DECL or it may be a previous decl of the same name. */
7015 if ((TREE_CODE (decl) != PARM_DECL && DECL_CONTEXT (decl) != NULL_TREE
7016 /* Definitions of namespace members outside their namespace are
7018 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
7019 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
7020 || TREE_CODE (type) == LANG_TYPE
7021 /* The declaration of template specializations does not affect
7022 the functions available for overload resolution, so we do not
7024 || (TREE_CODE (decl) == FUNCTION_DECL
7025 && DECL_TEMPLATE_SPECIALIZATION (decl)))
7028 tem = pushdecl (decl);
7030 if (processing_template_decl)
7032 if (! current_function_decl)
7033 tem = push_template_decl (tem);
7034 else if (minimal_parse_mode)
7036 = build_min_nt (DECL_STMT, copy_to_permanent (declarator),
7037 copy_to_permanent (declspecs),
7042 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7043 /* Tell the back-end to use or not use .common as appropriate. If we say
7044 -fconserve-space, we want this to save .data space, at the expense of
7045 wrong semantics. If we say -fno-conserve-space, we want this to
7046 produce errors about redefs; to do this we force variables into the
7048 DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
7051 if (! processing_template_decl)
7054 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
7055 push_obstacks_nochange ();
7058 /* We have no way of knowing whether the initializer will need to be
7059 evaluated at run-time or not until we've parsed it, so let's just put
7060 it in the permanent obstack. (jason) */
7062 && ! (TREE_CODE (tem) == PARM_DECL
7063 || (TREE_READONLY (tem)
7064 && (TREE_CODE (tem) == VAR_DECL
7065 || TREE_CODE (tem) == FIELD_DECL))))
7067 /* When parsing and digesting the initializer,
7068 use temporary storage. Do this even if we will ignore the value. */
7069 if (toplevel_bindings_p () && debug_temp_inits)
7071 if (processing_template_decl
7072 || TYPE_NEEDS_CONSTRUCTING (type)
7073 || TREE_CODE (type) == REFERENCE_TYPE)
7074 /* In this case, the initializer must lay down in permanent
7075 storage, since it will be saved until `finish_file' is run. */
7078 temporary_allocation ();
7090 tree type = TREE_TYPE (decl);
7091 int initialized = (DECL_INITIAL (decl) != NULL_TREE);
7093 /* If this type of object needs a cleanup, and control may
7094 jump past it, make a new binding level so that it is cleaned
7095 up only when it is initialized first. */
7096 if (TYPE_NEEDS_DESTRUCTOR (type)
7097 && current_binding_level->more_cleanups_ok == 0)
7098 pushlevel_temporary (1);
7101 /* Is it valid for this decl to have an initializer at all?
7102 If not, set INITIALIZED to zero, which will indirectly
7103 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7105 /* Don't allow initializations for incomplete types except for
7106 arrays which might be completed by the initialization. */
7107 if (type == error_mark_node)
7108 ; /* Don't complain again. */
7109 else if (TYPE_SIZE (complete_type (type)) != NULL_TREE)
7110 ; /* A complete type is ok. */
7111 else if (TREE_CODE (type) != ARRAY_TYPE)
7113 cp_error ("variable `%#D' has initializer but incomplete type",
7116 type = TREE_TYPE (decl) = error_mark_node;
7118 else if (TYPE_SIZE (complete_type (TREE_TYPE (type))) == NULL_TREE)
7120 if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
7121 cp_error ("elements of array `%#D' have incomplete type", decl);
7122 /* else we already gave an error in start_decl. */
7128 && TREE_CODE (decl) != TYPE_DECL
7129 && TREE_CODE (decl) != TEMPLATE_DECL
7130 && IS_AGGR_TYPE (type) && ! DECL_EXTERNAL (decl))
7132 if ((! processing_template_decl || ! uses_template_parms (type))
7133 && TYPE_SIZE (complete_type (type)) == NULL_TREE)
7135 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7137 /* Change the type so that assemble_variable will give
7138 DECL an rtl we can live with: (mem (const_int 0)). */
7139 type = TREE_TYPE (decl) = error_mark_node;
7143 /* If any base type in the hierarchy of TYPE needs a constructor,
7144 then we set initialized to 1. This way any nodes which are
7145 created for the purposes of initializing this aggregate
7146 will live as long as it does. This is necessary for global
7147 aggregates which do not have their initializers processed until
7148 the end of the file. */
7149 initialized = TYPE_NEEDS_CONSTRUCTING (type);
7154 /* We don't do this yet for GNU C++. */
7155 /* For a local variable, define the RTL now. */
7156 if (! toplevel_bindings_p ()
7157 /* But not if this is a duplicate decl
7158 and we preserved the rtl from the previous one
7159 (which may or may not happen). */
7160 && DECL_RTL (tem) == NULL_RTX)
7162 if (TYPE_SIZE (TREE_TYPE (tem)) != NULL_TREE)
7164 else if (TREE_CODE (TREE_TYPE (tem)) == ARRAY_TYPE
7165 && DECL_INITIAL (tem) != NULL_TREE)
7171 DECL_INITIAL (decl) = NULL_TREE;
7174 /* Handle initialization of references.
7175 These three arguments are from `cp_finish_decl', and have the
7176 same meaning here that they do there.
7178 Quotes on semantics can be found in ARM 8.4.3. */
7181 grok_reference_init (decl, type, init)
7182 tree decl, type, init;
7186 if (init == NULL_TREE)
7188 if ((DECL_LANG_SPECIFIC (decl) == 0
7189 || DECL_IN_AGGR_P (decl) == 0)
7190 && ! DECL_THIS_EXTERN (decl))
7192 cp_error ("`%D' declared as reference but not initialized", decl);
7193 if (TREE_CODE (decl) == VAR_DECL)
7194 SET_DECL_REFERENCE_SLOT (decl, error_mark_node);
7199 if (init == error_mark_node)
7202 if (TREE_CODE (type) == REFERENCE_TYPE
7203 && TREE_CODE (init) == CONSTRUCTOR)
7205 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl);
7209 if (TREE_CODE (init) == TREE_LIST)
7210 init = build_compound_expr (init);
7212 if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
7213 init = convert_from_reference (init);
7215 if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
7216 && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
7218 /* Note: default conversion is only called in very special cases. */
7219 init = default_conversion (init);
7222 tmp = convert_to_reference
7223 (type, init, CONV_IMPLICIT,
7224 LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND, decl);
7226 if (tmp == error_mark_node)
7228 else if (tmp != NULL_TREE)
7231 DECL_INITIAL (decl) = save_expr (init);
7235 cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
7239 /* ?? Can this be optimized in some cases to
7240 hand back the DECL_INITIAL slot?? */
7241 if (TYPE_SIZE (TREE_TYPE (type)))
7243 init = convert_from_reference (decl);
7244 if (TREE_PERMANENT (decl))
7245 init = copy_to_permanent (init);
7246 SET_DECL_REFERENCE_SLOT (decl, init);
7249 if (TREE_STATIC (decl) && ! TREE_CONSTANT (DECL_INITIAL (decl)))
7251 expand_static_init (decl, DECL_INITIAL (decl));
7252 DECL_INITIAL (decl) = NULL_TREE;
7257 if (TREE_CODE (decl) == VAR_DECL)
7258 SET_DECL_REFERENCE_SLOT (decl, error_mark_node);
7262 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7263 mucking with forces it does not comprehend (i.e. initialization with a
7264 constructor). If we are at global scope and won't go into COMMON, fill
7265 it in with a dummy CONSTRUCTOR to force the variable into .data;
7266 otherwise we can use error_mark_node. */
7269 obscure_complex_init (decl, init)
7272 if (! flag_no_inline && TREE_STATIC (decl))
7274 if (extract_init (decl, init))
7278 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7279 if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7280 DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7284 DECL_INITIAL (decl) = error_mark_node;
7289 /* Issue an error message if DECL is an uninitialized const variable. */
7292 check_for_uninitialized_const_var (decl)
7295 tree type = TREE_TYPE (decl);
7297 /* ``Unless explicitly declared extern, a const object does not have
7298 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7300 if (TREE_CODE (decl) == VAR_DECL
7301 && TREE_CODE (type) != REFERENCE_TYPE
7302 && CP_TYPE_CONST_P (type)
7303 && !TYPE_NEEDS_CONSTRUCTING (type)
7304 && !DECL_INITIAL (decl))
7305 cp_error ("uninitialized const `%D'", decl);
7308 /* Finish processing of a declaration;
7309 install its line number and initial value.
7310 If the length of an array type is not known before,
7311 it must be determined now, from the initial value, or it is an error.
7313 Call `pop_obstacks' iff NEED_POP is nonzero.
7315 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7316 for aggregates that have constructors alive on the permanent obstack,
7317 so that the global initializing functions can be written at the end.
7319 INIT0 holds the value of an initializer that should be allowed to escape
7322 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7323 if the (init) syntax was used.
7325 For functions that take default parameters, DECL points to its
7326 "maximal" instantiation. `cp_finish_decl' must then also declared its
7327 subsequently lower and lower forms of instantiation, checking for
7328 ambiguity as it goes. This can be sped up later. */
7331 cp_finish_decl (decl, init, asmspec_tree, need_pop, flags)
7338 tree cleanup = NULL_TREE, ttype = NULL_TREE;
7340 int temporary = allocation_temporary_p ();
7341 char *asmspec = NULL;
7342 int was_readonly = 0;
7343 int already_used = 0;
7345 /* If this is 0, then we did not change obstacks. */
7349 error ("assignment (not initialization) in declaration");
7353 /* If a name was specified, get the string. */
7355 asmspec = TREE_STRING_POINTER (asmspec_tree);
7357 if (init && TREE_CODE (init) == NAMESPACE_DECL)
7359 cp_error ("Cannot initialize `%D' to namespace `%D'",
7364 if (current_class_type
7365 && DECL_REAL_CONTEXT (decl) == current_class_type
7366 && TYPE_BEING_DEFINED (current_class_type)
7367 && (DECL_INITIAL (decl) || init))
7368 DECL_DEFINED_IN_CLASS_P (decl) = 1;
7370 if (TREE_CODE (decl) == VAR_DECL
7371 && DECL_CONTEXT (decl)
7372 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
7373 && DECL_CONTEXT (decl) != current_namespace
7376 /* Leave the namespace of the object. */
7377 pop_decl_namespace ();
7380 /* If the type of the thing we are declaring either has
7381 a constructor, or has a virtual function table pointer,
7382 AND its initialization was accepted by `start_decl',
7383 then we stayed on the permanent obstack through the
7384 declaration, otherwise, changed obstacks as GCC would. */
7386 type = TREE_TYPE (decl);
7388 if (type == error_mark_node)
7390 if (toplevel_bindings_p () && temporary)
7391 end_temporary_allocation ();
7396 if (TYPE_HAS_MUTABLE_P (type))
7397 TREE_READONLY (decl) = 0;
7399 if (processing_template_decl)
7401 if (init && DECL_INITIAL (decl))
7402 DECL_INITIAL (decl) = init;
7403 if (minimal_parse_mode && ! DECL_ARTIFICIAL (decl))
7405 tree stmt = DECL_VINDEX (decl);
7406 /* If the decl is declaring a member of a local class (in a
7407 template function), the DECL_VINDEX will either be NULL,
7408 or it will be an actual virtual function index, not a
7410 if (stmt != NULL_TREE && TREE_CODE (stmt) == DECL_STMT)
7412 DECL_VINDEX (decl) = NULL_TREE;
7413 TREE_OPERAND (stmt, 2) = copy_to_permanent (init);
7420 /* Take care of TYPE_DECLs up front. */
7421 if (TREE_CODE (decl) == TYPE_DECL)
7423 if (init && DECL_INITIAL (decl))
7425 /* typedef foo = bar; store the type of bar as the type of foo. */
7426 TREE_TYPE (decl) = type = TREE_TYPE (init);
7427 DECL_INITIAL (decl) = init = NULL_TREE;
7429 if (type != error_mark_node
7430 && IS_AGGR_TYPE (type) && DECL_NAME (decl))
7432 if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
7433 cp_warning ("shadowing previous type declaration of `%#D'", decl);
7434 set_identifier_type_value (DECL_NAME (decl), type);
7435 CLASSTYPE_GOT_SEMICOLON (type) = 1;
7437 GNU_xref_decl (current_function_decl, decl);
7439 /* If we have installed this as the canonical typedef for this
7440 type, and that type has not been defined yet, delay emitting
7441 the debug information for it, as we will emit it later. */
7442 if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
7443 && TYPE_SIZE (TREE_TYPE (decl)) == NULL_TREE)
7444 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
7446 rest_of_decl_compilation (decl, NULL_PTR,
7447 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
7450 if (TREE_CODE (decl) != FUNCTION_DECL)
7452 ttype = target_type (type);
7455 if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
7456 && TYPE_NEEDS_CONSTRUCTING (type))
7459 /* Currently, GNU C++ puts constants in text space, making them
7460 impossible to initialize. In the future, one would hope for
7461 an operating system which understood the difference between
7462 initialization and the running of a program. */
7464 TREE_READONLY (decl) = 0;
7467 if (TREE_CODE (decl) == FIELD_DECL)
7469 if (init && init != error_mark_node)
7470 my_friendly_assert (TREE_PERMANENT (init), 147);
7474 /* This must override the asm specifier which was placed
7475 by grokclassfn. Lay this out fresh. */
7476 DECL_RTL (TREE_TYPE (decl)) = NULL_RTX;
7477 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7478 make_decl_rtl (decl, asmspec, 0);
7481 /* If `start_decl' didn't like having an initialization, ignore it now. */
7482 else if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7484 else if (DECL_EXTERNAL (decl))
7486 else if (TREE_CODE (type) == REFERENCE_TYPE
7487 || (TYPE_LANG_SPECIFIC (type) && IS_SIGNATURE_REFERENCE (type)))
7489 if (TREE_STATIC (decl))
7490 make_decl_rtl (decl, NULL_PTR,
7491 toplevel_bindings_p ()
7492 || pseudo_global_level_p ());
7493 grok_reference_init (decl, type, init);
7497 GNU_xref_decl (current_function_decl, decl);
7499 if (TREE_CODE (decl) == FIELD_DECL)
7501 else if (TREE_CODE (decl) == CONST_DECL)
7503 my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7505 DECL_INITIAL (decl) = init;
7507 /* This will keep us from needing to worry about our obstacks. */
7508 my_friendly_assert (init != NULL_TREE, 149);
7513 if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7515 if (TREE_CODE (type) == ARRAY_TYPE)
7516 init = digest_init (type, init, (tree *) 0);
7517 else if (TREE_CODE (init) == CONSTRUCTOR
7518 && TREE_HAS_CONSTRUCTOR (init))
7520 if (TYPE_NON_AGGREGATE_CLASS (type))
7522 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7524 init = error_mark_node;
7527 goto dont_use_constructor;
7532 dont_use_constructor:
7533 if (TREE_CODE (init) != TREE_VEC)
7534 init = store_init_value (decl, init);
7538 /* We must hide the initializer so that expand_decl
7539 won't try to do something it does not understand. */
7540 init = obscure_complex_init (decl, init);
7542 else if (DECL_EXTERNAL (decl))
7544 else if (TREE_CODE_CLASS (TREE_CODE (type)) == 't'
7545 && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7548 while (TREE_CODE (ctype) == ARRAY_TYPE)
7549 ctype = TREE_TYPE (ctype);
7550 if (! TYPE_NEEDS_CONSTRUCTING (ctype))
7552 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (ctype))
7553 cp_error ("structure `%D' with uninitialized const members", decl);
7554 if (CLASSTYPE_REF_FIELDS_NEED_INIT (ctype))
7555 cp_error ("structure `%D' with uninitialized reference members",
7559 check_for_uninitialized_const_var (decl);
7561 if (TYPE_SIZE (type) != NULL_TREE
7562 && TYPE_NEEDS_CONSTRUCTING (type))
7563 init = obscure_complex_init (decl, NULL_TREE);
7567 check_for_uninitialized_const_var (decl);
7569 /* For top-level declaration, the initial value was read in
7570 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7571 must go in the permanent obstack; but don't discard the
7572 temporary data yet. */
7574 if (toplevel_bindings_p () && temporary)
7575 end_temporary_allocation ();
7577 /* Deduce size of array from initialization, if not already known. */
7579 if (TREE_CODE (type) == ARRAY_TYPE
7580 && TYPE_DOMAIN (type) == NULL_TREE
7581 && TREE_CODE (decl) != TYPE_DECL)
7584 = (TREE_STATIC (decl)
7585 /* Even if pedantic, an external linkage array
7586 may have incomplete type at first. */
7587 ? pedantic && ! DECL_EXTERNAL (decl)
7588 : !DECL_EXTERNAL (decl));
7589 tree initializer = init ? init : DECL_INITIAL (decl);
7590 int failure = complete_array_type (type, initializer, do_default);
7593 cp_error ("initializer fails to determine size of `%D'", decl);
7598 cp_error ("array size missing in `%D'", decl);
7599 /* If a `static' var's size isn't known, make it extern as
7600 well as static, so it does not get allocated. If it's not
7601 `static', then don't mark it extern; finish_incomplete_decl
7602 will give it a default size and it will get allocated. */
7603 else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7604 DECL_EXTERNAL (decl) = 1;
7607 if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7608 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7610 cp_error ("zero-size array `%D'", decl);
7612 layout_decl (decl, 0);
7615 if (TREE_CODE (decl) == VAR_DECL)
7617 if (DECL_SIZE (decl) == NULL_TREE
7618 && TYPE_SIZE (complete_type (TREE_TYPE (decl))) != NULL_TREE)
7619 layout_decl (decl, 0);
7621 if (TREE_STATIC (decl) && DECL_SIZE (decl) == NULL_TREE)
7623 /* A static variable with an incomplete type:
7624 that is an error if it is initialized.
7625 Otherwise, let it through, but if it is not `extern'
7626 then it may cause an error message later. */
7627 if (DECL_INITIAL (decl) != NULL_TREE)
7628 cp_error ("storage size of `%D' isn't known", decl);
7631 else if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7633 /* An automatic variable with an incomplete type: that is an error.
7634 Don't talk about array types here, since we took care of that
7635 message in grokdeclarator. */
7636 cp_error ("storage size of `%D' isn't known", decl);
7637 TREE_TYPE (decl) = error_mark_node;
7639 else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7640 /* Let debugger know it should output info for this type. */
7641 note_debug_info_needed (ttype);
7643 if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7644 note_debug_info_needed (DECL_CONTEXT (decl));
7646 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7647 && DECL_SIZE (decl) != NULL_TREE
7648 && ! TREE_CONSTANT (DECL_SIZE (decl)))
7650 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7651 constant_expression_warning (DECL_SIZE (decl));
7653 cp_error ("storage size of `%D' isn't constant", decl);
7656 if (! DECL_EXTERNAL (decl) && TYPE_NEEDS_DESTRUCTOR (type)
7657 /* Cleanups for static variables are handled by `finish_file'. */
7658 && ! TREE_STATIC (decl))
7660 int yes = suspend_momentary ();
7661 cleanup = maybe_build_cleanup (decl);
7662 resume_momentary (yes);
7665 /* PARM_DECLs get cleanups, too. */
7666 else if (TREE_CODE (decl) == PARM_DECL && TYPE_NEEDS_DESTRUCTOR (type))
7669 end_temporary_allocation ();
7670 cleanup = maybe_build_cleanup (decl);
7672 resume_temporary_allocation ();
7675 /* Output the assembler code and/or RTL code for variables and functions,
7676 unless the type is an undefined structure or union.
7677 If not, it will get done when the type is completed. */
7679 was_incomplete = (DECL_SIZE (decl) == NULL_TREE);
7681 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
7682 || TREE_CODE (decl) == RESULT_DECL)
7684 /* ??? FIXME: What about nested classes? */
7685 int toplev = toplevel_bindings_p () || pseudo_global_level_p ();
7687 = (TREE_STATIC (decl) && TYPE_NEEDS_DESTRUCTOR (type)
7688 && allocation_temporary_p ());
7691 end_temporary_allocation ();
7693 /* Static data in a function with comdat linkage also has comdat
7695 if (TREE_CODE (decl) == VAR_DECL
7696 && TREE_STATIC (decl)
7697 /* Don't mess with __FUNCTION__. */
7698 && ! TREE_ASM_WRITTEN (decl)
7699 && current_function_decl
7700 && DECL_CONTEXT (decl) == current_function_decl
7701 && (DECL_THIS_INLINE (current_function_decl)
7702 || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7703 && TREE_PUBLIC (current_function_decl))
7705 /* Rather than try to get this right with inlining, we suppress
7706 inlining of such functions. */
7707 current_function_cannot_inline
7708 = "function with static variable cannot be inline";
7710 /* If flag_weak, we don't need to mess with this, as we can just
7711 make the function weak, and let it refer to its unique local
7712 copy. This works because we don't allow the function to be
7716 if (DECL_INTERFACE_KNOWN (current_function_decl))
7718 TREE_PUBLIC (decl) = 1;
7719 DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7721 else if (DECL_INITIAL (decl) == NULL_TREE
7722 || DECL_INITIAL (decl) == error_mark_node)
7724 TREE_PUBLIC (decl) = 1;
7725 DECL_COMMON (decl) = 1;
7727 /* else we lose. We can only do this if we can use common,
7728 which we can't if it has been initialized. */
7730 if (TREE_PUBLIC (decl))
7731 DECL_ASSEMBLER_NAME (decl)
7732 = build_static_name (current_function_decl, DECL_NAME (decl));
7733 else if (! DECL_ARTIFICIAL (decl))
7735 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7736 cp_warning_at (" you can work around this by removing the initializer"), decl;
7741 else if (TREE_CODE (decl) == VAR_DECL
7742 && DECL_LANG_SPECIFIC (decl)
7743 && DECL_COMDAT (decl))
7745 /* Dynamically initialized vars go into common. */
7746 if (DECL_INITIAL (decl) == NULL_TREE
7747 || DECL_INITIAL (decl) == error_mark_node)
7748 DECL_COMMON (decl) = 1;
7749 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
7751 DECL_COMMON (decl) = 1;
7752 DECL_INITIAL (decl) = error_mark_node;
7756 /* Statically initialized vars are weak or comdat, if
7759 make_decl_one_only (decl);
7762 /* We can't do anything useful; leave vars for explicit
7764 DECL_EXTERNAL (decl) = 1;
7765 DECL_NOT_REALLY_EXTERN (decl) = 0;
7770 if (TREE_CODE (decl) == VAR_DECL && DECL_VIRTUAL_P (decl))
7771 make_decl_rtl (decl, NULL_PTR, toplev);
7772 else if (TREE_CODE (decl) == VAR_DECL
7773 && TREE_READONLY (decl)
7774 && DECL_INITIAL (decl) != NULL_TREE
7775 && DECL_INITIAL (decl) != error_mark_node
7776 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
7778 DECL_INITIAL (decl) = save_expr (DECL_INITIAL (decl));
7781 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7784 && TREE_STATIC (decl)
7785 && ! TREE_SIDE_EFFECTS (decl)
7786 && ! TREE_PUBLIC (decl)
7787 && ! DECL_EXTERNAL (decl)
7788 && ! TYPE_NEEDS_DESTRUCTOR (type)
7789 && DECL_MODE (decl) != BLKmode)
7791 /* If this variable is really a constant, then fill its DECL_RTL
7792 slot with something which won't take up storage.
7793 If something later should take its address, we can always give
7794 it legitimate RTL at that time. */
7795 DECL_RTL (decl) = gen_reg_rtx (DECL_MODE (decl));
7796 store_expr (DECL_INITIAL (decl), DECL_RTL (decl), 0);
7797 TREE_ASM_WRITTEN (decl) = 1;
7799 else if (toplev && ! TREE_PUBLIC (decl))
7801 /* If this is a static const, change its apparent linkage
7802 if it belongs to a #pragma interface. */
7803 if (!interface_unknown)
7805 TREE_PUBLIC (decl) = 1;
7806 DECL_EXTERNAL (decl) = interface_only;
7808 make_decl_rtl (decl, asmspec, toplev);
7811 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7813 else if (TREE_CODE (decl) == VAR_DECL
7814 && DECL_LANG_SPECIFIC (decl)
7815 && DECL_IN_AGGR_P (decl))
7817 if (TREE_STATIC (decl))
7819 if (init == NULL_TREE
7820 #ifdef DEFAULT_STATIC_DEFS
7821 /* If this code is dead, then users must
7822 explicitly declare static member variables
7823 outside the class def'n as well. */
7824 && TYPE_NEEDS_CONSTRUCTING (type)
7828 DECL_EXTERNAL (decl) = 1;
7829 make_decl_rtl (decl, asmspec, 1);
7832 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7835 /* Just a constant field. Should not need any rtl. */
7839 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7842 resume_temporary_allocation ();
7844 if (type != error_mark_node
7845 && TYPE_LANG_SPECIFIC (type)
7846 && CLASSTYPE_ABSTRACT_VIRTUALS (type))
7847 abstract_virtuals_error (decl, type);
7848 else if ((TREE_CODE (type) == FUNCTION_TYPE
7849 || TREE_CODE (type) == METHOD_TYPE)
7850 && TYPE_LANG_SPECIFIC (TREE_TYPE (type))
7851 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (type)))
7852 abstract_virtuals_error (decl, TREE_TYPE (type));
7854 if (TYPE_LANG_SPECIFIC (type) && IS_SIGNATURE (type))
7855 signature_error (decl, type);
7856 else if ((TREE_CODE (type) == FUNCTION_TYPE
7857 || TREE_CODE (type) == METHOD_TYPE)
7858 && TYPE_LANG_SPECIFIC (TREE_TYPE (type))
7859 && IS_SIGNATURE (TREE_TYPE (type)))
7860 signature_error (decl, TREE_TYPE (type));
7862 if (TREE_CODE (decl) == FUNCTION_DECL)
7864 else if (DECL_EXTERNAL (decl)
7865 && ! (DECL_LANG_SPECIFIC (decl)
7866 && DECL_NOT_REALLY_EXTERN (decl)))
7869 DECL_INITIAL (decl) = init;
7871 else if (TREE_STATIC (decl) && type != error_mark_node)
7873 /* Cleanups for static variables are handled by `finish_file'. */
7874 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
7875 || TYPE_NEEDS_DESTRUCTOR (type))
7876 expand_static_init (decl, init);
7880 /* This is a declared decl which must live until the
7881 end of the binding contour. It may need a cleanup. */
7883 /* Recompute the RTL of a local array now
7884 if it used to be an incomplete type. */
7885 if (was_incomplete && ! TREE_STATIC (decl))
7887 /* If we used it already as memory, it must stay in memory. */
7888 TREE_ADDRESSABLE (decl) = TREE_USED (decl);
7889 /* If it's still incomplete now, no init will save it. */
7890 if (DECL_SIZE (decl) == NULL_TREE)
7891 DECL_INITIAL (decl) = NULL_TREE;
7894 else if (! TREE_ASM_WRITTEN (decl)
7895 && (TYPE_SIZE (type) != NULL_TREE
7896 || TREE_CODE (type) == ARRAY_TYPE))
7898 /* Do this here, because we did not expand this decl's
7899 rtl in start_decl. */
7900 if (DECL_RTL (decl) == NULL_RTX)
7904 /* XXX: Why don't we use decl here? */
7905 /* Ans: Because it was already expanded? */
7906 if (! expand_decl_cleanup (NULL_TREE, cleanup))
7907 cp_error ("parser lost in parsing declaration of `%D'",
7909 /* Cleanup used up here. */
7910 cleanup = NULL_TREE;
7914 if (current_binding_level->is_for_scope)
7916 struct binding_level *outer
7917 = current_binding_level->level_chain;
7919 /* Check to see if the same name is already bound at
7920 the outer level, either because it was directly declared,
7921 or because a dead for-decl got preserved. In either case,
7922 the code would not have been valid under the ARM
7923 scope rules, so clear is_for_scope for the
7924 current_binding_level.
7926 Otherwise, we need to preserve the temp slot for decl
7927 to last into the outer binding level. */
7930 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
7932 if (outer_binding && BINDING_LEVEL (outer_binding) == outer
7933 && (TREE_CODE (BINDING_VALUE (outer_binding))
7935 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
7937 BINDING_VALUE (outer_binding)
7938 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
7939 current_binding_level->is_for_scope = 0;
7941 else if (DECL_IN_MEMORY_P (decl))
7942 preserve_temp_slots (DECL_RTL (decl));
7945 expand_start_target_temps ();
7947 if (DECL_SIZE (decl) && type != error_mark_node)
7949 /* Compute and store the initial value. */
7950 expand_decl_init (decl);
7951 already_used = TREE_USED (decl) || TREE_USED (type);
7953 if (init || TYPE_NEEDS_CONSTRUCTING (type))
7955 emit_line_note (DECL_SOURCE_FILE (decl),
7956 DECL_SOURCE_LINE (decl));
7957 expand_aggr_init (decl, init, flags);
7960 /* Set this to 0 so we can tell whether an aggregate which
7961 was initialized was ever used. Don't do this if it has a
7962 destructor, so we don't complain about the 'resource
7963 allocation is initialization' idiom. */
7964 /* Now set attribute((unused)) on types so decls of
7965 that type will be marked used. (see TREE_USED, above.)
7966 This avoids the warning problems this particular code
7967 tried to work around. */
7969 if (TYPE_NEEDS_CONSTRUCTING (type)
7971 && cleanup == NULL_TREE
7972 && DECL_NAME (decl))
7973 TREE_USED (decl) = 0;
7976 TREE_USED (decl) = 1;
7979 /* Cleanup any temporaries needed for the initial value. */
7980 expand_end_target_temps ();
7982 if (DECL_SIZE (decl) && type != error_mark_node)
7984 /* Store the cleanup, if there was one. */
7987 if (! expand_decl_cleanup (decl, cleanup))
7988 cp_error ("parser lost in parsing declaration of `%D'",
7995 /* Undo call to `pushclass' that was done in `start_decl'
7996 due to initialization of qualified member variable.
7997 I.e., Foo::x = 10; */
7999 tree context = DECL_REAL_CONTEXT (decl);
8001 && TREE_CODE_CLASS (TREE_CODE (context)) == 't'
8002 && (TREE_CODE (decl) == VAR_DECL
8003 /* We also have a pushclass done that we need to undo here
8004 if we're at top level and declare a method. */
8005 || TREE_CODE (decl) == FUNCTION_DECL)
8006 /* If size hasn't been set, we're still defining it,
8007 and therefore inside the class body; don't pop
8008 the binding level.. */
8009 && TYPE_SIZE (context) != NULL_TREE
8010 && context == current_class_type)
8017 /* If requested, warn about definitions of large data objects. */
8019 if (warn_larger_than
8020 && ! processing_template_decl
8021 && (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
8022 && !DECL_EXTERNAL (decl))
8024 register tree decl_size = DECL_SIZE (decl);
8026 if (decl_size && TREE_CODE (decl_size) == INTEGER_CST)
8028 unsigned units = TREE_INT_CST_LOW (decl_size) / BITS_PER_UNIT;
8030 if (units > larger_than_size)
8031 warning_with_decl (decl, "size of `%s' is %u bytes", units);
8037 /* Resume permanent allocation, if not within a function. */
8038 /* The corresponding push_obstacks_nochange is in start_decl,
8039 start_method, groktypename, and in grokfield. */
8044 TREE_READONLY (decl) = 1;
8047 /* This is here for a midend callback from c-common.c */
8050 finish_decl (decl, init, asmspec_tree)
8054 cp_finish_decl (decl, init, asmspec_tree, 1, 0);
8058 expand_static_init (decl, init)
8062 tree oldstatic = value_member (decl, static_aggregates);
8066 if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
8067 cp_error ("multiple initializations given for `%D'", decl);
8069 else if (! toplevel_bindings_p () && ! pseudo_global_level_p ())
8071 /* Emit code to perform this initialization but once. */
8074 /* Remember this information until end of file. */
8075 push_obstacks (&permanent_obstack, &permanent_obstack);
8077 /* Emit code to perform this initialization but once. This code
8080 static int temp = 0;
8082 // Do initialization.
8084 // Register variable for destruction at end of program.
8087 Note that the `temp' variable is only set to 1 *after* the
8088 initialization is complete. This ensures that an exception,
8089 thrown during the construction, will cause the variable to
8090 reinitialized when we pass through this code again, as per:
8094 If the initialization exits by throwing an exception, the
8095 initialization is not complete, so it will be tried again
8096 the next time control enters the declaration.
8098 In theory, this process should be thread-safe, too; multiple
8099 threads should not be able to initialize the variable more
8100 than once. We don't yet attempt to ensure thread-safety. */
8101 temp = get_temp_name (integer_type_node, 1);
8102 rest_of_decl_compilation (temp, NULL_PTR, 0, 0);
8104 /* Begin the conditional initialization. */
8105 expand_start_cond (build_binary_op (EQ_EXPR, temp,
8106 integer_zero_node, 1), 0);
8107 expand_start_target_temps ();
8109 /* Do the initialization itself. */
8110 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8111 || (init && TREE_CODE (init) == TREE_LIST))
8113 expand_aggr_init (decl, init, 0);
8114 do_pending_stack_adjust ();
8117 expand_assignment (decl, init, 0, 0);
8119 /* Set TEMP to 1. */
8120 expand_assignment (temp, integer_one_node, 0, 0);
8122 /* Cleanup any temporaries needed for the initial value. If
8123 destroying one of the temporaries causes an exception to be
8124 thrown, then the object itself has still been fully
8126 expand_end_target_temps ();
8128 /* Use atexit to register a function for destroying this static
8130 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl)))
8132 tree cleanup, fcall;
8133 static tree Atexit = 0;
8136 tree atexit_fndecl, PFV, pfvlist;
8137 /* Remember this information until end of file. */
8138 push_obstacks (&permanent_obstack, &permanent_obstack);
8139 PFV = build_pointer_type (build_function_type
8140 (void_type_node, void_list_node));
8142 pfvlist = tree_cons (NULL_TREE, PFV, void_list_node);
8144 push_lang_context (lang_name_c);
8146 = builtin_function ("atexit",
8147 build_function_type (void_type_node,
8149 NOT_BUILT_IN, NULL_PTR);
8150 assemble_external (atexit_fndecl);
8151 Atexit = default_conversion (atexit_fndecl);
8152 pop_lang_context ();
8156 /* Call build_cleanup before we enter the anonymous function
8157 so that any access checks will be done relative to the
8158 current scope, rather than the scope of the anonymous
8160 fcall = build_cleanup (decl);
8161 cleanup = start_anon_func ();
8162 expand_expr_stmt (fcall);
8164 mark_addressable (cleanup);
8165 cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
8166 fcall = build_function_call (Atexit, expr_tree_cons (NULL_TREE, cleanup, NULL_TREE));
8167 expand_expr_stmt (fcall);
8171 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl)))
8173 static_aggregates = perm_tree_cons (temp, decl, static_aggregates);
8174 TREE_STATIC (static_aggregates) = 1;
8177 /* Resume old (possibly temporary) allocation. */
8182 /* This code takes into account memory allocation
8183 policy of `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING
8184 does not hold for this object, then we must make permanent
8185 the storage currently in the temporary obstack. */
8186 if (! TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
8187 preserve_initializer ();
8188 static_aggregates = perm_tree_cons (init, decl, static_aggregates);
8192 /* Make TYPE a complete type based on INITIAL_VALUE.
8193 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8194 2 if there was no information (in which case assume 1 if DO_DEFAULT). */
8197 complete_array_type (type, initial_value, do_default)
8198 tree type, initial_value;
8201 register tree maxindex = NULL_TREE;
8206 /* Note MAXINDEX is really the maximum index,
8207 one less than the size. */
8208 if (TREE_CODE (initial_value) == STRING_CST)
8211 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8212 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8215 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8217 tree elts = CONSTRUCTOR_ELTS (initial_value);
8218 maxindex = size_binop (MINUS_EXPR, integer_zero_node, size_one_node);
8219 for (; elts; elts = TREE_CHAIN (elts))
8221 if (TREE_PURPOSE (elts))
8222 maxindex = TREE_PURPOSE (elts);
8224 maxindex = size_binop (PLUS_EXPR, maxindex, size_one_node);
8226 maxindex = copy_node (maxindex);
8230 /* Make an error message unless that happened already. */
8231 if (initial_value != error_mark_node)
8234 /* Prevent further error messages. */
8235 maxindex = build_int_2 (0, 0);
8242 maxindex = build_int_2 (0, 0);
8250 TYPE_DOMAIN (type) = build_index_type (maxindex);
8251 if (! TREE_TYPE (maxindex))
8252 TREE_TYPE (maxindex) = TYPE_DOMAIN (type);
8254 itype = TREE_TYPE (initial_value);
8257 if (itype && !TYPE_DOMAIN (itype))
8258 TYPE_DOMAIN (itype) = TYPE_DOMAIN (type);
8259 /* The type of the main variant should never be used for arrays
8260 of different sizes. It should only ever be completed with the
8261 size of the array. */
8262 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8263 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = TYPE_DOMAIN (type);
8266 /* Lay out the type now that we can get the real answer. */
8273 /* Return zero if something is declared to be a member of type
8274 CTYPE when in the context of CUR_TYPE. STRING is the error
8275 message to print in that case. Otherwise, quietly return 1. */
8278 member_function_or_else (ctype, cur_type, string)
8279 tree ctype, cur_type;
8282 if (ctype && ctype != cur_type)
8284 error (string, TYPE_NAME_STRING (ctype));
8290 /* Subroutine of `grokdeclarator'. */
8292 /* Generate errors possibly applicable for a given set of specifiers.
8293 This is for ARM $7.1.2. */
8296 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8299 int virtualp, quals, friendp, raises, inlinep;
8302 cp_error ("`%D' declared as a `virtual' %s", object, type);
8304 cp_error ("`%D' declared as an `inline' %s", object, type);
8306 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8309 cp_error_at ("invalid friend declaration", object);
8311 cp_error_at ("invalid exception specifications", object);
8314 /* CTYPE is class type, or null if non-class.
8315 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8317 DECLARATOR is the function's name.
8318 VIRTUALP is truthvalue of whether the function is virtual or not.
8319 FLAGS are to be passed through to `grokclassfn'.
8320 QUALS are qualifiers indicating whether the function is `const'
8322 RAISES is a list of exceptions that this function can raise.
8323 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8324 not look, and -1 if we should not call `grokclassfn' at all.
8326 Returns `error_mark_node' if something goes wrong, after issuing
8327 applicable error messages. */
8330 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8331 raises, attrlist, check, friendp, publicp, inlinep, funcdef_flag,
8332 template_count, in_namespace)
8335 tree orig_declarator;
8337 enum overload_flags flags;
8338 tree quals, raises, attrlist;
8339 int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8343 int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8347 cname = TREE_CODE (TYPE_NAME (ctype)) == TYPE_DECL
8348 ? TYPE_IDENTIFIER (ctype) : TYPE_NAME (ctype);
8354 type = build_exception_variant (type, raises);
8357 decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8358 /* Propagate volatile out from type to decl. */
8359 if (TYPE_VOLATILE (type))
8360 TREE_THIS_VOLATILE (decl) = 1;
8362 /* If this decl has namespace scope, set that up. */
8364 set_decl_namespace (decl, in_namespace);
8365 else if (publicp && ! ctype)
8366 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8368 /* `main' and builtins have implicit 'C' linkage. */
8369 if ((MAIN_NAME_P (declarator)
8370 || (IDENTIFIER_LENGTH (declarator) > 10
8371 && IDENTIFIER_POINTER (declarator)[0] == '_'
8372 && IDENTIFIER_POINTER (declarator)[1] == '_'
8373 && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8374 && current_lang_name == lang_name_cplusplus
8375 && ctype == NULL_TREE
8376 /* NULL_TREE means global namespace. */
8377 && DECL_CONTEXT (decl) == NULL_TREE)
8378 DECL_LANGUAGE (decl) = lang_c;
8380 /* Should probably propagate const out from type to decl I bet (mrs). */
8383 DECL_STATIC_FUNCTION_P (decl) = 1;
8384 DECL_CONTEXT (decl) = ctype;
8388 DECL_CLASS_CONTEXT (decl) = ctype;
8390 if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8392 if (processing_template_decl)
8393 error ("cannot declare `main' to be a template");
8395 error ("cannot declare `main' to be inline");
8397 error ("cannot declare `main' to be static");
8402 /* Members of anonymous types and local classes have no linkage; make
8404 if (ctype && (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype))
8405 || hack_decl_function_context (TYPE_MAIN_DECL (ctype))))
8410 /* [basic.link]: A name with no linkage (notably, the name of a class
8411 or enumeration declared in a local scope) shall not be used to
8412 declare an entity with linkage.
8414 Only check this for public decls for now. */
8415 t = no_linkage_check (TREE_TYPE (decl));
8418 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8420 if (DECL_LANGUAGE (decl) == lang_c)
8421 /* Allow this; it's pretty common in C. */;
8423 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8427 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8432 TREE_PUBLIC (decl) = publicp;
8435 DECL_INTERFACE_KNOWN (decl) = 1;
8436 DECL_NOT_REALLY_EXTERN (decl) = 1;
8440 DECL_THIS_INLINE (decl) = DECL_INLINE (decl) = 1;
8442 DECL_EXTERNAL (decl) = 1;
8443 if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8445 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8446 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8450 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8451 grok_op_properties (decl, virtualp, check < 0);
8453 if (ctype && hack_decl_function_context (decl))
8454 DECL_NO_STATIC_CHAIN (decl) = 1;
8456 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8457 if (TREE_PURPOSE (t)
8458 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8460 add_defarg_fn (decl);
8465 && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8469 ("defining explicit specialization `%D' in friend declaration",
8473 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8475 /* Something like `template <class T> friend void f<T>()'. */
8476 cp_error ("template-id `%D' in declaration of primary template",
8478 return error_mark_node;
8481 /* A friend declaration of the form friend void f<>(). Record
8482 the information in the TEMPLATE_ID_EXPR. */
8483 SET_DECL_IMPLICIT_INSTANTIATION (decl);
8484 DECL_TEMPLATE_INFO (decl)
8485 = perm_tree_cons (TREE_OPERAND (orig_declarator, 0),
8486 TREE_OPERAND (orig_declarator, 1),
8491 /* Plain overloading: will not be grok'd by grokclassfn. */
8492 if (! ctype && ! processing_template_decl
8493 && DECL_LANGUAGE (decl) != lang_c
8494 && (! DECL_USE_TEMPLATE (decl) || name_mangling_version < 1))
8495 set_mangled_name_for_decl (decl);
8498 /* Make the init_value nonzero so pushdecl knows this is not
8499 tentative. error_mark_node is replaced later with the BLOCK. */
8500 DECL_INITIAL (decl) = error_mark_node;
8502 /* Caller will do the rest of this. */
8506 if (check && funcdef_flag)
8507 DECL_INITIAL (decl) = error_mark_node;
8509 if (flags == NO_SPECIAL && ctype && constructor_name (cname) == declarator)
8512 /* Just handle constructors here. We could do this
8513 inside the following if stmt, but I think
8514 that the code is more legible by breaking this
8515 case out. See comments below for what each of
8516 the following calls is supposed to do. */
8517 DECL_CONSTRUCTOR_P (decl) = 1;
8519 grokclassfn (ctype, decl, flags, quals);
8521 decl = check_explicit_specialization (orig_declarator, decl,
8523 2 * (funcdef_flag != 0) +
8524 4 * (friendp != 0));
8525 if (decl == error_mark_node)
8526 return error_mark_node;
8528 if ((! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8531 tmp = check_classfn (ctype, decl);
8533 if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL)
8534 tmp = DECL_TEMPLATE_RESULT(tmp);
8536 if (tmp && DECL_ARTIFICIAL (tmp))
8537 cp_error ("definition of implicitly-declared `%D'", tmp);
8538 if (tmp && duplicate_decls (decl, tmp))
8541 if (! grok_ctor_properties (ctype, decl))
8542 return error_mark_node;
8548 /* Function gets the ugly name, field gets the nice one.
8549 This call may change the type of the function (because
8550 of default parameters)! */
8551 if (ctype != NULL_TREE)
8552 grokclassfn (ctype, decl, flags, quals);
8554 decl = check_explicit_specialization (orig_declarator, decl,
8556 2 * (funcdef_flag != 0) +
8557 4 * (friendp != 0));
8558 if (decl == error_mark_node)
8559 return error_mark_node;
8561 if (ctype != NULL_TREE
8562 && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8565 tmp = check_classfn (ctype, decl);
8567 if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL)
8568 tmp = DECL_TEMPLATE_RESULT (tmp);
8570 if (tmp && DECL_STATIC_FUNCTION_P (tmp)
8571 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
8573 /* Remove the `this' parm added by grokclassfn.
8574 XXX Isn't this done in start_function, too? */
8575 revert_static_member_fn (&decl, NULL, NULL);
8576 last_function_parms = TREE_CHAIN (last_function_parms);
8578 if (tmp && DECL_ARTIFICIAL (tmp))
8579 cp_error ("definition of implicitly-declared `%D'", tmp);
8582 if (!duplicate_decls (decl, tmp))
8583 my_friendly_abort (892);
8588 if (ctype == NULL_TREE || check)
8592 cplus_decl_attributes (decl, TREE_PURPOSE (attrlist),
8593 TREE_VALUE (attrlist));
8594 make_decl_rtl (decl, NULL_PTR, 1);
8598 DECL_VIRTUAL_P (decl) = 1;
8599 if (DECL_VINDEX (decl) == NULL_TREE)
8600 DECL_VINDEX (decl) = error_mark_node;
8601 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
8608 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
8611 RID_BIT_TYPE *specbits_in;
8617 RID_BIT_TYPE specbits;
8619 specbits = *specbits_in;
8621 if (TREE_CODE (type) == OFFSET_TYPE)
8623 /* If you declare a static member so that it
8624 can be initialized, the code will reach here. */
8625 tree basetype = TYPE_OFFSET_BASETYPE (type);
8626 type = TREE_TYPE (type);
8627 decl = build_lang_field_decl (VAR_DECL, declarator, type);
8628 DECL_CONTEXT (decl) = basetype;
8629 DECL_CLASS_CONTEXT (decl) = basetype;
8630 DECL_ASSEMBLER_NAME (decl) = build_static_name (basetype, declarator);
8637 context = in_namespace;
8638 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
8639 context = current_namespace;
8641 context = NULL_TREE;
8643 decl = build_decl (VAR_DECL, declarator, complete_type (type));
8646 set_decl_namespace (decl, context);
8648 context = DECL_CONTEXT (decl);
8649 if (declarator && context && current_lang_name != lang_name_c)
8650 DECL_ASSEMBLER_NAME (decl) = build_static_name (context, declarator);
8654 set_decl_namespace (decl, in_namespace);
8656 if (RIDBIT_SETP (RID_EXTERN, specbits))
8658 DECL_THIS_EXTERN (decl) = 1;
8659 DECL_EXTERNAL (decl) = !initialized;
8662 /* In class context, static means one per class,
8663 public access, and static storage. */
8664 if (DECL_CLASS_SCOPE_P (decl))
8666 TREE_PUBLIC (decl) = 1;
8667 TREE_STATIC (decl) = 1;
8668 DECL_EXTERNAL (decl) = 0;
8670 /* At top level, either `static' or no s.c. makes a definition
8671 (perhaps tentative), and absence of `static' makes it public. */
8672 else if (toplevel_bindings_p ())
8674 TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
8675 && (DECL_THIS_EXTERN (decl) || ! constp));
8676 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
8678 /* Not at top level, only `static' makes a static definition. */
8681 TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
8682 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
8685 if (TREE_PUBLIC (decl))
8687 /* [basic.link]: A name with no linkage (notably, the name of a class
8688 or enumeration declared in a local scope) shall not be used to
8689 declare an entity with linkage.
8691 Only check this for public decls for now. */
8692 tree t = no_linkage_check (TREE_TYPE (decl));
8695 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8696 /* Ignore for now; `enum { foo } e' is pretty common. */;
8698 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8706 /* Create and return a canonical pointer to member function type, for
8707 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8710 build_ptrmemfunc_type (type)
8717 /* If a canonical type already exists for this type, use it. We use
8718 this method instead of type_hash_canon, because it only does a
8719 simple equality check on the list of field members. */
8721 if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
8724 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
8726 u = make_lang_type (UNION_TYPE);
8727 SET_IS_AGGR_TYPE (u, 0);
8728 fields[0] = build_lang_field_decl (FIELD_DECL, pfn_identifier, type);
8729 fields[1] = build_lang_field_decl (FIELD_DECL, delta2_identifier,
8731 finish_builtin_type (u, "__ptrmemfunc_type", fields, 1, ptr_type_node);
8732 TYPE_NAME (u) = NULL_TREE;
8734 t = make_lang_type (RECORD_TYPE);
8736 /* Let the front-end know this is a pointer to member function... */
8737 TYPE_PTRMEMFUNC_FLAG (t) = 1;
8738 /* ... and not really an aggregate. */
8739 SET_IS_AGGR_TYPE (t, 0);
8741 fields[0] = build_lang_field_decl (FIELD_DECL, delta_identifier,
8743 fields[1] = build_lang_field_decl (FIELD_DECL, index_identifier,
8745 fields[2] = build_lang_field_decl (FIELD_DECL, pfn_or_delta2_identifier, u);
8746 finish_builtin_type (t, "__ptrmemfunc_type", fields, 2, ptr_type_node);
8750 /* Zap out the name so that the back-end will give us the debugging
8751 information for this anonymous RECORD_TYPE. */
8752 TYPE_NAME (t) = NULL_TREE;
8754 TYPE_SET_PTRMEMFUNC_TYPE (type, t);
8756 /* Seems to be wanted. */
8757 CLASSTYPE_GOT_SEMICOLON (t) = 1;
8761 /* Given declspecs and a declarator,
8762 determine the name and type of the object declared
8763 and construct a ..._DECL node for it.
8764 (In one case we can return a ..._TYPE node instead.
8765 For invalid input we sometimes return 0.)
8767 DECLSPECS is a chain of tree_list nodes whose value fields
8768 are the storage classes and type specifiers.
8770 DECL_CONTEXT says which syntactic context this declaration is in:
8771 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8772 FUNCDEF for a function definition. Like NORMAL but a few different
8773 error messages in each case. Return value may be zero meaning
8774 this definition is too screwy to try to parse.
8775 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8776 handle member functions (which have FIELD context).
8777 Return value may be zero meaning this definition is too screwy to
8779 PARM for a parameter declaration (either within a function prototype
8780 or before a function body). Make a PARM_DECL, or return void_type_node.
8781 CATCHPARM for a parameter declaration before a catch clause.
8782 TYPENAME if for a typename (in a cast or sizeof).
8783 Don't make a DECL node; just return the ..._TYPE node.
8784 FIELD for a struct or union field; make a FIELD_DECL.
8785 BITFIELD for a field with specified width.
8786 INITIALIZED is 1 if the decl has an initializer.
8788 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8789 It may also be so in the PARM case, for a prototype where the
8790 argument type is specified but not the name.
8792 This function is where the complicated C meanings of `static'
8793 and `extern' are interpreted.
8795 For C++, if there is any monkey business to do, the function which
8796 calls this one must do it, i.e., prepending instance variables,
8797 renaming overloaded function names, etc.
8799 Note that for this C++, it is an error to define a method within a class
8800 which does not belong to that class.
8802 Except in the case where SCOPE_REFs are implicitly known (such as
8803 methods within a class being redundantly qualified),
8804 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8805 (class_name::decl_name). The caller must also deal with this.
8807 If a constructor or destructor is seen, and the context is FIELD,
8808 then the type gains the attribute TREE_HAS_x. If such a declaration
8809 is erroneous, NULL_TREE is returned.
8811 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8812 function, these are the qualifiers to give to the `this' pointer.
8814 May return void_type_node if the declarator turned out to be a friend.
8815 See grokfield for details. */
8817 enum return_types { return_normal, return_ctor, return_dtor, return_conversion };
8819 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8820 Check to see that the definition is valid. Issue appropriate error
8821 messages. Return 1 if the definition is particularly bad, or 0
8825 check_static_variable_definition (decl, type)
8829 /* Motion 10 at San Diego: If a static const integral data member is
8830 initialized with an integral constant expression, the initializer
8831 may appear either in the declaration (within the class), or in
8832 the definition, but not both. If it appears in the class, the
8833 member is a member constant. The file-scope definition is always
8835 if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
8837 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8839 /* If we just return the declaration, crashes will sometimes
8840 occur. We therefore return void_type_node, as if this was a
8841 friend declaration, to cause callers to completely ignore
8842 this declaration. */
8845 else if (!CP_TYPE_CONST_P (type))
8846 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8848 else if (pedantic && !INTEGRAL_TYPE_P (type))
8849 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
8855 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
8858 enum decl_context decl_context;
8862 RID_BIT_TYPE specbits;
8865 tree type = NULL_TREE;
8871 int virtualp, explicitp, friendp, inlinep, staticp;
8872 int explicit_int = 0;
8873 int explicit_char = 0;
8874 int defaulted_int = 0;
8875 int opaque_typedef = 0;
8876 tree typedef_decl = NULL_TREE;
8878 tree typedef_type = NULL_TREE;
8879 int funcdef_flag = 0;
8880 enum tree_code innermost_code = ERROR_MARK;
8883 /* See the code below that used this. */
8884 tree decl_machine_attr = NULL_TREE;
8886 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8887 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8888 tree init = NULL_TREE;
8890 /* Keep track of what sort of function is being processed
8891 so that we can warn about default return values, or explicit
8892 return values which do not match prescribed defaults. */
8893 enum return_types return_type = return_normal;
8895 tree dname = NULL_TREE;
8896 tree ctype = current_class_type;
8897 tree ctor_return_type = NULL_TREE;
8898 enum overload_flags flags = NO_SPECIAL;
8899 tree quals = NULL_TREE;
8900 tree raises = NULL_TREE;
8901 int template_count = 0;
8902 tree in_namespace = NULL_TREE;
8906 RIDBIT_RESET_ALL (specbits);
8907 if (decl_context == FUNCDEF)
8908 funcdef_flag = 1, decl_context = NORMAL;
8909 else if (decl_context == MEMFUNCDEF)
8910 funcdef_flag = -1, decl_context = FIELD;
8911 else if (decl_context == BITFIELD)
8912 bitfield = 1, decl_context = FIELD;
8914 /* Look inside a declarator for the name being declared
8915 and get it as a string, for an error message. */
8917 tree *next = &declarator;
8921 while (next && *next)
8924 switch (TREE_CODE (decl))
8927 /* For attributes. */
8928 next = &TREE_VALUE (decl);
8933 next = &TREE_OPERAND (decl, 0);
8936 case BIT_NOT_EXPR: /* For C++ destructors! */
8938 tree name = TREE_OPERAND (decl, 0);
8939 tree rename = NULL_TREE;
8941 my_friendly_assert (flags == NO_SPECIAL, 152);
8943 return_type = return_dtor;
8944 if (TREE_CODE (name) == TYPE_DECL)
8945 TREE_OPERAND (decl, 0) = name = constructor_name (name);
8946 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
8947 if (ctype == NULL_TREE)
8949 if (current_class_type == NULL_TREE)
8951 error ("destructors must be member functions");
8956 tree t = constructor_name (current_class_name);
8963 tree t = constructor_name (ctype);
8970 cp_error ("destructor `%T' must match class name `%T'",
8972 TREE_OPERAND (decl, 0) = rename;
8978 case ADDR_EXPR: /* C++ reference declaration */
8983 innermost_code = TREE_CODE (decl);
8984 next = &TREE_OPERAND (decl, 0);
8988 if (parmlist_is_exprlist (TREE_OPERAND (decl, 1)))
8990 /* This is actually a variable declaration using constructor
8991 syntax. We need to call start_decl and cp_finish_decl so we
8992 can get the variable initialized... */
8994 *next = TREE_OPERAND (decl, 0);
8995 init = TREE_OPERAND (decl, 1);
8997 decl = start_decl (declarator, declspecs, 1, NULL_TREE, NULL_TREE);
9000 /* Look for __unused__ attribute */
9001 if (TREE_USED (TREE_TYPE (decl)))
9002 TREE_USED (decl) = 1;
9003 finish_decl (decl, init, NULL_TREE);
9006 cp_error ("invalid declarator");
9009 innermost_code = TREE_CODE (decl);
9010 if (decl_context == FIELD && ctype == NULL_TREE)
9011 ctype = current_class_type;
9013 && TREE_OPERAND (decl, 0)
9014 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9015 && ((DECL_NAME (TREE_OPERAND (decl, 0))
9016 == constructor_name_full (ctype))
9017 || (DECL_NAME (TREE_OPERAND (decl, 0))
9018 == constructor_name (ctype)))))
9019 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9020 next = &TREE_OPERAND (decl, 0);
9022 if (ctype != NULL_TREE
9023 && decl != NULL_TREE && flags != DTOR_FLAG
9024 && decl == constructor_name (ctype))
9026 return_type = return_ctor;
9027 ctor_return_type = ctype;
9032 case TEMPLATE_ID_EXPR:
9034 tree fns = TREE_OPERAND (decl, 0);
9036 if (TREE_CODE (fns) == LOOKUP_EXPR)
9037 fns = TREE_OPERAND (fns, 0);
9039 if (TREE_CODE (fns) == IDENTIFIER_NODE)
9041 else if (is_overloaded_fn (fns))
9042 dname = DECL_NAME (get_first_fn (fns));
9044 my_friendly_abort (0);
9048 case IDENTIFIER_NODE:
9049 if (TREE_CODE (decl) == IDENTIFIER_NODE)
9056 cp_error ("declarator-id missing; using reserved word `%D'",
9058 name = IDENTIFIER_POINTER (dname);
9060 if (! IDENTIFIER_OPNAME_P (dname)
9061 /* GNU/Linux headers use '__op'. Arrgh. */
9062 || (IDENTIFIER_TYPENAME_P (dname) && ! TREE_TYPE (dname)))
9063 name = IDENTIFIER_POINTER (dname);
9066 if (IDENTIFIER_TYPENAME_P (dname))
9068 my_friendly_assert (flags == NO_SPECIAL, 154);
9069 flags = TYPENAME_FLAG;
9070 ctor_return_type = TREE_TYPE (dname);
9071 return_type = return_conversion;
9073 name = operator_name_string (dname);
9080 /* Perform error checking, and decide on a ctype. */
9081 tree cname = TREE_OPERAND (decl, 0);
9082 if (cname == NULL_TREE)
9084 else if (TREE_CODE (cname) == NAMESPACE_DECL)
9087 in_namespace = TREE_OPERAND (decl, 0);
9088 TREE_OPERAND (decl, 0) = NULL_TREE;
9090 else if (! is_aggr_type (cname, 1))
9091 TREE_OPERAND (decl, 0) = NULL_TREE;
9092 /* Must test TREE_OPERAND (decl, 1), in case user gives
9093 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9094 else if (TREE_OPERAND (decl, 1)
9095 && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9097 else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9098 || TREE_CODE (cname) == TEMPLATE_TEMPLATE_PARM)
9100 cp_error ("`%T::%D' is not a valid declarator", cname,
9101 TREE_OPERAND (decl, 1));
9102 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9103 cname, TREE_OPERAND (decl, 1));
9104 return void_type_node;
9106 else if (ctype == NULL_TREE)
9108 else if (TREE_COMPLEXITY (decl) == current_class_depth)
9109 TREE_OPERAND (decl, 0) = ctype;
9112 if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9114 cp_error ("type `%T' is not derived from type `%T'",
9116 TREE_OPERAND (decl, 0) = NULL_TREE;
9122 if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9123 && ((DECL_NAME (TREE_OPERAND (decl, 1))
9124 == constructor_name_full (ctype))
9125 || (DECL_NAME (TREE_OPERAND (decl, 1))
9126 == constructor_name (ctype))))
9127 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9128 next = &TREE_OPERAND (decl, 1);
9132 if (TREE_CODE (decl) == IDENTIFIER_NODE
9133 && constructor_name (ctype) == decl)
9135 return_type = return_ctor;
9136 ctor_return_type = ctype;
9138 else if (TREE_CODE (decl) == BIT_NOT_EXPR
9139 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9140 && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
9141 || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
9143 return_type = return_dtor;
9144 ctor_return_type = ctype;
9146 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9147 next = &TREE_OPERAND (decl, 0);
9158 /* Parse error puts this typespec where
9159 a declarator should go. */
9160 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl));
9161 if (TREE_TYPE (decl) == current_class_type)
9162 cp_error (" perhaps you want `%T' for a constructor",
9163 current_class_name);
9164 dname = DECL_NAME (decl);
9165 name = IDENTIFIER_POINTER (dname);
9167 /* Avoid giving two errors for this. */
9168 IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9170 declspecs = temp_tree_cons (NULL_TREE, integer_type_node,
9177 cp_compiler_error ("`%D' as declarator", decl);
9178 return 0; /* We used to do a 155 abort here. */
9185 /* A function definition's declarator must have the form of
9186 a function declarator. */
9188 if (funcdef_flag && innermost_code != CALL_EXPR)
9191 if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
9192 && innermost_code != CALL_EXPR
9193 && ! (ctype && declspecs == NULL_TREE))
9195 cp_error ("declaration of `%D' as non-function", dname);
9196 return void_type_node;
9199 /* Anything declared one level down from the top level
9200 must be one of the parameters of a function
9201 (because the body is at least two levels down). */
9203 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9204 by not allowing C++ class definitions to specify their parameters
9205 with xdecls (must be spec.d in the parmlist).
9207 Since we now wait to push a class scope until we are sure that
9208 we are in a legitimate method context, we must set oldcname
9209 explicitly (since current_class_name is not yet alive).
9211 We also want to avoid calling this a PARM if it is in a namespace. */
9213 if (decl_context == NORMAL && ! namespace_bindings_p ()
9214 && ! pseudo_global_level_p ())
9216 struct binding_level *b = current_binding_level;
9217 current_binding_level = b->level_chain;
9218 if (current_binding_level != 0 && toplevel_bindings_p ())
9219 decl_context = PARM;
9220 current_binding_level = b;
9223 /* Look through the decl specs and record which ones appear.
9224 Some typespecs are defined as built-in typenames.
9225 Others, the ones that are modifiers of other types,
9226 are represented by bits in SPECBITS: set the bits for
9227 the modifiers that appear. Storage class keywords are also in SPECBITS.
9229 If there is a typedef name or a type, store the type in TYPE.
9230 This includes builtin typedefs such as `int'.
9232 Set EXPLICIT_INT if the type is `int' or `char' and did not
9233 come from a user typedef.
9235 Set LONGLONG if `long' is mentioned twice.
9237 For C++, constructors and destructors have their own fast treatment. */
9239 for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
9244 /* Certain parse errors slip through. For example,
9245 `int class;' is not caught by the parser. Try
9246 weakly to recover here. */
9247 if (TREE_CODE (spec) != TREE_LIST)
9250 id = TREE_VALUE (spec);
9252 if (TREE_CODE (id) == IDENTIFIER_NODE)
9254 if (id == ridpointers[(int) RID_INT]
9255 || id == ridpointers[(int) RID_CHAR]
9256 || id == ridpointers[(int) RID_BOOL]
9257 || id == ridpointers[(int) RID_WCHAR])
9261 if (id == ridpointers[(int) RID_BOOL])
9262 error ("`bool' is now a keyword");
9264 cp_error ("extraneous `%T' ignored", id);
9268 if (id == ridpointers[(int) RID_INT])
9270 else if (id == ridpointers[(int) RID_CHAR])
9272 type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
9276 /* C++ aggregate types. */
9277 if (IDENTIFIER_HAS_TYPE_VALUE (id))
9280 cp_error ("multiple declarations `%T' and `%T'", type, id);
9282 type = IDENTIFIER_TYPE_VALUE (id);
9286 for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
9288 if (ridpointers[i] == id)
9290 if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
9292 if (pedantic && ! in_system_header && warn_long_long)
9293 pedwarn ("ANSI C++ does not support `long long'");
9295 error ("`long long long' is too long for GCC");
9299 else if (RIDBIT_SETP (i, specbits))
9300 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
9301 RIDBIT_SET (i, specbits);
9306 /* C++ aggregate types. */
9307 else if (TREE_CODE (id) == TYPE_DECL || TREE_CODE (id) == TEMPLATE_DECL)
9310 cp_error ("multiple declarations `%T' and `%T'", type,
9314 type = TREE_TYPE (id);
9315 TREE_VALUE (spec) = type;
9320 error ("two or more data types in declaration of `%s'", name);
9321 else if (TREE_CODE (id) == IDENTIFIER_NODE)
9323 register tree t = lookup_name (id, 1);
9324 if (!t || TREE_CODE (t) != TYPE_DECL)
9325 error ("`%s' fails to be a typedef or built in type",
9326 IDENTIFIER_POINTER (id));
9329 type = TREE_TYPE (t);
9331 /* See the code below that used this. */
9332 decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id);
9337 else if (id != error_mark_node)
9338 /* Can't change CLASS nodes into RECORD nodes here! */
9344 typedef_type = type;
9346 /* No type at all: default to `int', and set DEFAULTED_INT
9347 because it was not a user-defined typedef.
9348 Except when we have a `typedef' inside a signature, in
9349 which case the type defaults to `unknown type' and is
9350 instantiated when assigning to a signature pointer or ref. */
9352 if (type == NULL_TREE
9353 && (RIDBIT_SETP (RID_SIGNED, specbits)
9354 || RIDBIT_SETP (RID_UNSIGNED, specbits)
9355 || RIDBIT_SETP (RID_LONG, specbits)
9356 || RIDBIT_SETP (RID_SHORT, specbits)))
9358 /* These imply 'int'. */
9359 type = integer_type_node;
9363 if (type == NULL_TREE)
9366 if (return_type == return_dtor)
9367 type = void_type_node;
9368 else if (return_type == return_ctor)
9369 type = build_pointer_type (ctor_return_type);
9370 else if (return_type == return_conversion)
9371 type = ctor_return_type;
9372 else if (current_class_type
9373 && IS_SIGNATURE (current_class_type)
9374 && RIDBIT_SETP (RID_TYPEDEF, specbits)
9375 && (decl_context == FIELD || decl_context == NORMAL))
9379 type = copy_node (opaque_type_node);
9383 /* We handle `main' specially here, because 'main () { }' is so
9384 common. With no options, it is allowed. With -Wreturn-type,
9385 it is a warning. It is only an error with -pedantic-errors. */
9386 int is_main = (funcdef_flag
9387 && MAIN_NAME_P (dname)
9388 && ctype == NULL_TREE
9389 && in_namespace == NULL_TREE
9390 && current_namespace == global_namespace);
9392 if (in_system_header)
9393 /* Allow it, sigh. */;
9394 else if (pedantic || ! is_main)
9395 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9397 else if (warn_return_type)
9398 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9401 type = integer_type_node;
9404 else if (return_type == return_dtor)
9406 error ("return type specification for destructor invalid");
9407 type = void_type_node;
9409 else if (return_type == return_ctor)
9411 error ("return type specification for constructor invalid");
9412 type = build_pointer_type (ctor_return_type);
9414 else if (return_type == return_conversion)
9416 if (!same_type_p (type, ctor_return_type))
9417 cp_error ("operator `%T' declared to return `%T'",
9418 ctor_return_type, type);
9420 cp_pedwarn ("return type specified for `operator %T'",
9423 type = ctor_return_type;
9428 /* Now process the modifiers that were specified
9429 and check for invalid combinations. */
9431 /* Long double is a special combination. */
9433 if (RIDBIT_SETP (RID_LONG, specbits)
9434 && TYPE_MAIN_VARIANT (type) == double_type_node)
9436 RIDBIT_RESET (RID_LONG, specbits);
9437 type = build_qualified_type (long_double_type_node,
9438 CP_TYPE_QUALS (type));
9441 /* Check all other uses of type modifiers. */
9443 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9444 || RIDBIT_SETP (RID_SIGNED, specbits)
9445 || RIDBIT_SETP (RID_LONG, specbits)
9446 || RIDBIT_SETP (RID_SHORT, specbits))
9450 if (TREE_CODE (type) == REAL_TYPE)
9451 error ("short, signed or unsigned invalid for `%s'", name);
9452 else if (TREE_CODE (type) != INTEGER_TYPE)
9453 error ("long, short, signed or unsigned invalid for `%s'", name);
9454 else if (RIDBIT_SETP (RID_LONG, specbits)
9455 && RIDBIT_SETP (RID_SHORT, specbits))
9456 error ("long and short specified together for `%s'", name);
9457 else if ((RIDBIT_SETP (RID_LONG, specbits)
9458 || RIDBIT_SETP (RID_SHORT, specbits))
9460 error ("long or short specified with char for `%s'", name);
9461 else if ((RIDBIT_SETP (RID_LONG, specbits)
9462 || RIDBIT_SETP (RID_SHORT, specbits))
9463 && TREE_CODE (type) == REAL_TYPE)
9464 error ("long or short specified with floating type for `%s'", name);
9465 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9466 && RIDBIT_SETP (RID_UNSIGNED, specbits))
9467 error ("signed and unsigned given together for `%s'", name);
9471 if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
9473 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9475 if (flag_pedantic_errors)
9480 /* Discard the type modifiers if they are invalid. */
9483 RIDBIT_RESET (RID_UNSIGNED, specbits);
9484 RIDBIT_RESET (RID_SIGNED, specbits);
9485 RIDBIT_RESET (RID_LONG, specbits);
9486 RIDBIT_RESET (RID_SHORT, specbits);
9491 if (RIDBIT_SETP (RID_COMPLEX, specbits)
9492 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
9494 error ("complex invalid for `%s'", name);
9495 RIDBIT_RESET (RID_COMPLEX, specbits);
9498 /* Decide whether an integer type is signed or not.
9499 Optionally treat bitfields as signed by default. */
9500 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9501 || (bitfield && ! flag_signed_bitfields
9502 && (explicit_int || defaulted_int || explicit_char
9503 /* A typedef for plain `int' without `signed'
9504 can be controlled just like plain `int'. */
9505 || ! (typedef_decl != NULL_TREE
9506 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
9507 && TREE_CODE (type) != ENUMERAL_TYPE
9508 && RIDBIT_NOTSETP (RID_SIGNED, specbits)))
9511 type = long_long_unsigned_type_node;
9512 else if (RIDBIT_SETP (RID_LONG, specbits))
9513 type = long_unsigned_type_node;
9514 else if (RIDBIT_SETP (RID_SHORT, specbits))
9515 type = short_unsigned_type_node;
9516 else if (type == char_type_node)
9517 type = unsigned_char_type_node;
9518 else if (typedef_decl)
9519 type = unsigned_type (type);
9521 type = unsigned_type_node;
9523 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9524 && type == char_type_node)
9525 type = signed_char_type_node;
9527 type = long_long_integer_type_node;
9528 else if (RIDBIT_SETP (RID_LONG, specbits))
9529 type = long_integer_type_node;
9530 else if (RIDBIT_SETP (RID_SHORT, specbits))
9531 type = short_integer_type_node;
9533 if (RIDBIT_SETP (RID_COMPLEX, specbits))
9535 /* If we just have "complex", it is equivalent to
9536 "complex double", but if any modifiers at all are specified it is
9537 the complex form of TYPE. E.g, "complex short" is
9538 "complex short int". */
9540 if (defaulted_int && ! longlong
9541 && ! (RIDBIT_SETP (RID_LONG, specbits)
9542 || RIDBIT_SETP (RID_SHORT, specbits)
9543 || RIDBIT_SETP (RID_SIGNED, specbits)
9544 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
9545 type = complex_double_type_node;
9546 else if (type == integer_type_node)
9547 type = complex_integer_type_node;
9548 else if (type == float_type_node)
9549 type = complex_float_type_node;
9550 else if (type == double_type_node)
9551 type = complex_double_type_node;
9552 else if (type == long_double_type_node)
9553 type = complex_long_double_type_node;
9555 type = build_complex_type (type);
9558 if (return_type == return_conversion
9559 && (RIDBIT_SETP (RID_CONST, specbits)
9560 || RIDBIT_SETP (RID_VOLATILE, specbits)
9561 || RIDBIT_SETP (RID_RESTRICT, specbits)))
9562 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9565 /* Set CONSTP if this declaration is `const', whether by
9566 explicit specification or via a typedef.
9567 Likewise for VOLATILEP. */
9569 constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type);
9571 !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type);
9573 !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type);
9574 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
9575 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
9576 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
9577 type = cp_build_qualified_type (type, type_quals);
9579 inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
9580 virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
9581 RIDBIT_RESET (RID_VIRTUAL, specbits);
9582 explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
9583 RIDBIT_RESET (RID_EXPLICIT, specbits);
9585 if (RIDBIT_SETP (RID_STATIC, specbits))
9586 staticp = 1 + (decl_context == FIELD);
9588 if (virtualp && staticp == 2)
9590 cp_error ("member `%D' cannot be declared both virtual and static",
9594 friendp = RIDBIT_SETP (RID_FRIEND, specbits);
9595 RIDBIT_RESET (RID_FRIEND, specbits);
9597 /* $7.1.2, Function specifiers */
9598 if (friendp && explicitp)
9599 error ("only declarations of constructors can be `explicit'");
9601 if (RIDBIT_SETP (RID_MUTABLE, specbits))
9603 if (decl_context == PARM)
9605 error ("non-member `%s' cannot be declared `mutable'", name);
9606 RIDBIT_RESET (RID_MUTABLE, specbits);
9608 else if (friendp || decl_context == TYPENAME)
9610 error ("non-object member `%s' cannot be declared `mutable'", name);
9611 RIDBIT_RESET (RID_MUTABLE, specbits);
9615 /* Warn if two storage classes are given. Default to `auto'. */
9617 if (RIDBIT_ANY_SET (specbits))
9619 if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
9620 if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++;
9621 if (decl_context == PARM && nclasses > 0)
9622 error ("storage class specifiers invalid in parameter declarations");
9623 if (RIDBIT_SETP (RID_TYPEDEF, specbits))
9625 if (decl_context == PARM)
9626 error ("typedef declaration invalid in parameter declaration");
9629 if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
9630 if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
9633 /* Give error if `virtual' is used outside of class declaration. */
9635 && (current_class_name == NULL_TREE || decl_context != FIELD))
9637 error ("virtual outside class declaration");
9640 if (current_class_name == NULL_TREE && RIDBIT_SETP (RID_MUTABLE, specbits))
9642 error ("only members can be declared mutable");
9643 RIDBIT_RESET (RID_MUTABLE, specbits);
9646 /* Static anonymous unions are dealt with here. */
9647 if (staticp && decl_context == TYPENAME
9648 && TREE_CODE (declspecs) == TREE_LIST
9649 && ANON_UNION_TYPE_P (TREE_VALUE (declspecs)))
9650 decl_context = FIELD;
9652 /* Give error if `const,' `volatile,' `inline,' `friend,' or `virtual'
9653 is used in a signature member function declaration. */
9654 if (decl_context == FIELD
9655 && IS_SIGNATURE (current_class_type)
9656 && RIDBIT_NOTSETP (RID_TYPEDEF, specbits))
9658 if (type_quals != TYPE_UNQUALIFIED)
9660 error ("type qualifiers specified for signature member function `%s'", name);
9661 type_quals = TYPE_UNQUALIFIED;
9665 error ("`inline' specified for signature member function `%s'", name);
9666 /* Later, we'll make signature member functions inline. */
9671 error ("`friend' declaration in signature definition");
9676 error ("`virtual' specified for signature member function `%s'",
9678 /* Later, we'll make signature member functions virtual. */
9683 /* Warn about storage classes that are invalid for certain
9684 kinds of declarations (parameters, typenames, etc.). */
9687 error ("multiple storage classes in declaration of `%s'", name);
9688 else if (decl_context != NORMAL && nclasses > 0)
9690 if ((decl_context == PARM || decl_context == CATCHPARM)
9691 && (RIDBIT_SETP (RID_REGISTER, specbits)
9692 || RIDBIT_SETP (RID_AUTO, specbits)))
9694 else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
9696 else if (decl_context == FIELD
9697 && ! IS_SIGNATURE (current_class_type)
9698 /* C++ allows static class elements */
9699 && RIDBIT_SETP (RID_STATIC, specbits))
9700 /* C++ also allows inlines and signed and unsigned elements,
9701 but in those cases we don't come in here. */
9705 if (decl_context == FIELD)
9707 tree tmp = NULL_TREE;
9708 register int op = 0;
9712 /* Avoid trying to get an operand off an identifier node. */
9713 if (TREE_CODE (declarator) == IDENTIFIER_NODE)
9716 tmp = TREE_OPERAND (declarator, 0);
9717 op = IDENTIFIER_OPNAME_P (tmp);
9719 error ("storage class specified for %s `%s'",
9720 IS_SIGNATURE (current_class_type)
9722 ? "signature member operator"
9723 : "signature member function")
9724 : (op ? "member operator" : "field"),
9725 op ? operator_name_string (tmp) : name);
9728 error (((decl_context == PARM || decl_context == CATCHPARM)
9729 ? "storage class specified for parameter `%s'"
9730 : "storage class specified for typename"), name);
9731 RIDBIT_RESET (RID_REGISTER, specbits);
9732 RIDBIT_RESET (RID_AUTO, specbits);
9733 RIDBIT_RESET (RID_EXTERN, specbits);
9735 if (decl_context == FIELD && IS_SIGNATURE (current_class_type))
9737 RIDBIT_RESET (RID_STATIC, specbits);
9742 else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
9744 if (toplevel_bindings_p ())
9746 /* It's common practice (and completely valid) to have a const
9747 be initialized and declared extern. */
9748 if (!(type_quals & TYPE_QUAL_CONST))
9749 warning ("`%s' initialized and declared `extern'", name);
9752 error ("`%s' has both `extern' and initializer", name);
9754 else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
9755 && ! toplevel_bindings_p ())
9756 error ("nested function `%s' declared `extern'", name);
9757 else if (toplevel_bindings_p ())
9759 if (RIDBIT_SETP (RID_AUTO, specbits))
9760 error ("top-level declaration of `%s' specifies `auto'", name);
9763 if (nclasses > 0 && friendp)
9764 error ("storage class specifiers invalid in friend function declarations");
9766 /* Now figure out the structure of the declarator proper.
9767 Descend through it, creating more complex types, until we reach
9768 the declared identifier (or NULL_TREE, in an absolute declarator). */
9770 inner_attrs = NULL_TREE;
9773 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
9774 && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
9776 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9777 an INDIRECT_REF (for *...),
9778 a CALL_EXPR (for ...(...)),
9779 an identifier (for the name being declared)
9780 or a null pointer (for the place in an absolute declarator
9781 where the name was omitted).
9782 For the last two cases, we have just exited the loop.
9784 For C++ it could also be
9785 a SCOPE_REF (for class :: ...). In this case, we have converted
9786 sensible names to types, and those are the values we use to
9787 qualify the member name.
9788 an ADDR_EXPR (for &...),
9789 a BIT_NOT_EXPR (for destructors)
9791 At this point, TYPE is the type of elements of an array,
9792 or for a function to return, or for a pointer to point to.
9793 After this sequence of ifs, TYPE is the type of the
9794 array or function or pointer, and DECLARATOR has had its
9795 outermost layer removed. */
9797 if (type == error_mark_node)
9799 if (TREE_CODE (declarator) == SCOPE_REF)
9800 declarator = TREE_OPERAND (declarator, 1);
9802 declarator = TREE_OPERAND (declarator, 0);
9805 if (quals != NULL_TREE
9806 && (declarator == NULL_TREE
9807 || TREE_CODE (declarator) != SCOPE_REF))
9809 if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
9810 ctype = TYPE_METHOD_BASETYPE (type);
9811 if (ctype != NULL_TREE)
9813 tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
9814 ctype = grok_method_quals (ctype, dummy, quals);
9815 type = TREE_TYPE (dummy);
9820 /* See the comment for the TREE_LIST case, below. */
9823 else if (inner_attrs)
9825 decl_attributes (type, inner_attrs, NULL_TREE);
9826 inner_attrs = NULL_TREE;
9829 switch (TREE_CODE (declarator))
9833 /* We encode a declarator with embedded attributes using
9834 a TREE_LIST. The attributes apply to the declarator
9835 directly inside them, so we have to skip an iteration
9836 before applying them to the type. If the declarator just
9837 inside is the declarator-id, we apply the attrs to the
9839 inner_attrs = TREE_PURPOSE (declarator);
9841 declarator = TREE_VALUE (declarator);
9847 register tree itype = NULL_TREE;
9848 register tree size = TREE_OPERAND (declarator, 1);
9849 /* The index is a signed object `sizetype' bits wide. */
9850 tree index_type = signed_type (sizetype);
9852 declarator = TREE_OPERAND (declarator, 0);
9854 /* Check for some types that there cannot be arrays of. */
9856 if (TREE_CODE (type) == VOID_TYPE)
9858 cp_error ("declaration of `%D' as array of voids", dname);
9859 type = error_mark_node;
9862 if (TREE_CODE (type) == FUNCTION_TYPE)
9864 cp_error ("declaration of `%D' as array of functions", dname);
9865 type = error_mark_node;
9868 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9869 you can't have arrays of references. If we allowed them,
9870 then we'd be saying x[i] is valid for an array x, but
9871 then you'd have to ask: what does `*(x + i)' mean? */
9872 if (TREE_CODE (type) == REFERENCE_TYPE)
9874 if (decl_context == TYPENAME)
9875 cp_error ("cannot make arrays of references");
9877 cp_error ("declaration of `%D' as array of references",
9879 type = error_mark_node;
9882 if (TREE_CODE (type) == OFFSET_TYPE)
9884 cp_error ("declaration of `%D' as array of data members",
9886 type = error_mark_node;
9889 if (TREE_CODE (type) == METHOD_TYPE)
9891 cp_error ("declaration of `%D' as array of function members",
9893 type = error_mark_node;
9896 if (size == error_mark_node)
9897 type = error_mark_node;
9898 else if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9902 the constant expressions that specify the bounds of
9903 the arrays can be omitted only for the first member
9905 cp_error ("declaration of `%D' as multidimensional array",
9907 cp_error ("must have bounds for all dimensions except the first");
9908 type = error_mark_node;
9911 if (type == error_mark_node)
9916 /* Must suspend_momentary here because the index
9917 type may need to live until the end of the function.
9918 For example, it is used in the declaration of a
9919 variable which requires destructing at the end of
9920 the function; then build_vec_delete will need this
9922 int yes = suspend_momentary ();
9923 /* Might be a cast. */
9924 if (TREE_CODE (size) == NOP_EXPR
9925 && TREE_TYPE (size) == TREE_TYPE (TREE_OPERAND (size, 0)))
9926 size = TREE_OPERAND (size, 0);
9928 /* If this involves a template parameter, it will be a
9929 constant at instantiation time, but we don't know
9930 what the value is yet. Even if no template
9931 parameters are involved, we may an expression that
9932 is not a constant; we don't even simplify `1 + 2'
9933 when processing a template. */
9934 if (processing_template_decl)
9936 /* Resolve a qualified reference to an enumerator or
9937 static const data member of ours. */
9938 if (TREE_CODE (size) == SCOPE_REF
9939 && TREE_OPERAND (size, 0) == current_class_type)
9941 tree t = lookup_field (current_class_type,
9942 TREE_OPERAND (size, 1), 0, 0);
9947 itype = make_node (INTEGER_TYPE);
9948 TYPE_MIN_VALUE (itype) = size_zero_node;
9949 TYPE_MAX_VALUE (itype) = build_min
9950 (MINUS_EXPR, sizetype, size, integer_one_node);
9951 goto dont_grok_size;
9954 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
9955 && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
9956 && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
9958 cp_error ("size of array `%D' has non-integer type",
9960 size = integer_one_node;
9962 if (TREE_READONLY_DECL_P (size))
9963 size = decl_constant_value (size);
9964 if (pedantic && integer_zerop (size))
9965 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname);
9966 if (TREE_CONSTANT (size))
9968 int old_flag_pedantic_errors = flag_pedantic_errors;
9969 int old_pedantic = pedantic;
9970 pedantic = flag_pedantic_errors = 1;
9971 /* Always give overflow errors on array subscripts. */
9972 constant_expression_warning (size);
9973 pedantic = old_pedantic;
9974 flag_pedantic_errors = old_flag_pedantic_errors;
9975 if (INT_CST_LT (size, integer_zero_node))
9977 cp_error ("size of array `%D' is negative", dname);
9978 size = integer_one_node;
9986 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9989 cp_pedwarn ("ANSI C++ forbids variable-size array");
9994 = fold (build_binary_op (MINUS_EXPR,
9995 cp_convert (index_type, size),
9996 cp_convert (index_type,
9997 integer_one_node), 1));
9998 if (! TREE_CONSTANT (itype))
9999 itype = variable_size (itype);
10000 else if (TREE_OVERFLOW (itype))
10002 error ("overflow in array dimension");
10003 TREE_OVERFLOW (itype) = 0;
10006 /* If we're a parm, we need to have a permanent type so
10007 mangling checks for re-use will work right. If both the
10008 element and index types are permanent, the array type
10010 if (decl_context == PARM
10011 && allocation_temporary_p () && TREE_PERMANENT (type))
10013 push_obstacks (&permanent_obstack, &permanent_obstack);
10014 itype = build_index_type (itype);
10018 itype = build_index_type (itype);
10021 resume_momentary (yes);
10024 type = build_cplus_array_type (type, itype);
10033 tree inner_parms = TREE_OPERAND (declarator, 1);
10034 tree inner_decl = TREE_OPERAND (declarator, 0);
10036 /* Declaring a function type.
10037 Make sure we have a valid type for the function to return. */
10039 /* We now know that the TYPE_QUALS don't apply to the
10040 decl, but to its return type. */
10041 type_quals = TYPE_UNQUALIFIED;
10043 /* Warn about some types functions can't return. */
10045 if (TREE_CODE (type) == FUNCTION_TYPE)
10047 error ("`%s' declared as function returning a function", name);
10048 type = integer_type_node;
10050 if (TREE_CODE (type) == ARRAY_TYPE)
10052 error ("`%s' declared as function returning an array", name);
10053 type = integer_type_node;
10056 if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
10057 inner_decl = TREE_OPERAND (inner_decl, 1);
10059 if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10060 inner_decl = dname;
10062 /* Pick up type qualifiers which should be applied to `this'. */
10063 quals = TREE_OPERAND (declarator, 2);
10065 /* Pick up the exception specifications. */
10066 raises = TREE_TYPE (declarator);
10068 /* Say it's a definition only for the CALL_EXPR
10069 closest to the identifier. */
10072 && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10073 || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10074 || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10076 if (ctype == NULL_TREE
10077 && decl_context == FIELD
10079 && (friendp == 0 || dname == current_class_name))
10080 ctype = current_class_type;
10082 if (ctype && return_type == return_conversion)
10083 TYPE_HAS_CONVERSION (ctype) = 1;
10084 if (ctype && constructor_name (ctype) == dname)
10086 /* We are within a class's scope. If our declarator name
10087 is the same as the class name, and we are defining
10088 a function, then it is a constructor/destructor, and
10089 therefore returns a void type. */
10091 if (flags == DTOR_FLAG)
10093 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10094 not be declared const or volatile. A destructor
10095 may not be static. */
10097 error ("destructor cannot be static member function");
10100 cp_error ("destructors may not be `%s'",
10101 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10104 if (decl_context == FIELD)
10106 if (! member_function_or_else (ctype, current_class_type,
10107 "destructor for alien class `%s' cannot be a member"))
10108 return void_type_node;
10111 else /* It's a constructor. */
10113 if (explicitp == 1)
10115 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10116 not be declared const or volatile. A constructor may
10117 not be virtual. A constructor may not be static. */
10119 error ("constructor cannot be static member function");
10122 pedwarn ("constructors cannot be declared virtual");
10127 cp_error ("constructors may not be `%s'",
10128 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10132 RID_BIT_TYPE tmp_bits;
10133 bcopy ((void*)&specbits, (void*)&tmp_bits, sizeof (RID_BIT_TYPE));
10134 RIDBIT_RESET (RID_INLINE, tmp_bits);
10135 RIDBIT_RESET (RID_STATIC, tmp_bits);
10136 if (RIDBIT_ANY_SET (tmp_bits))
10137 error ("return value type specifier for constructor ignored");
10139 type = build_pointer_type (ctype);
10140 if (decl_context == FIELD
10141 && IS_SIGNATURE (current_class_type))
10143 error ("constructor not allowed in signature");
10144 return void_type_node;
10146 else if (decl_context == FIELD)
10148 if (! member_function_or_else (ctype, current_class_type,
10149 "constructor for alien class `%s' cannot be member"))
10150 return void_type_node;
10151 TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10152 if (return_type != return_ctor)
10156 if (decl_context == FIELD)
10162 error ("can't initialize friend function `%s'", name);
10165 /* Cannot be both friend and virtual. */
10166 error ("virtual functions cannot be friends");
10167 RIDBIT_RESET (RID_FRIEND, specbits);
10170 if (decl_context == NORMAL)
10171 error ("friend declaration not in class definition");
10172 if (current_function_decl && funcdef_flag)
10173 cp_error ("can't define friend function `%s' in a local class definition",
10177 /* Construct the function type and go to the next
10178 inner layer of declarator. */
10180 declarator = TREE_OPERAND (declarator, 0);
10182 /* FIXME: This is where default args should be fully
10185 arg_types = grokparms (inner_parms, funcdecl_p ? funcdef_flag : 0);
10187 if (declarator && flags == DTOR_FLAG)
10189 /* A destructor declared in the body of a class will
10190 be represented as a BIT_NOT_EXPR. But, we just
10191 want the underlying IDENTIFIER. */
10192 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10193 declarator = TREE_OPERAND (declarator, 0);
10195 if (strict_prototype == 0 && arg_types == NULL_TREE)
10196 arg_types = void_list_node;
10197 else if (arg_types == NULL_TREE
10198 || arg_types != void_list_node)
10200 cp_error ("destructors may not have parameters");
10201 arg_types = void_list_node;
10202 last_function_parms = NULL_TREE;
10206 /* ANSI says that `const int foo ();'
10207 does not make the function foo const. */
10208 type = build_function_type (type, arg_types);
10212 for (t = arg_types; t; t = TREE_CHAIN (t))
10213 if (TREE_PURPOSE (t)
10214 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10216 add_defarg_fn (type);
10225 /* Filter out pointers-to-references and references-to-references.
10226 We can get these if a TYPE_DECL is used. */
10228 if (TREE_CODE (type) == REFERENCE_TYPE)
10230 error ("cannot declare %s to references",
10231 TREE_CODE (declarator) == ADDR_EXPR
10232 ? "references" : "pointers");
10233 declarator = TREE_OPERAND (declarator, 0);
10237 if (TREE_CODE (type) == OFFSET_TYPE
10238 && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10239 || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10241 cp_error ("cannot declare pointer to `%#T' member",
10243 type = TREE_TYPE (type);
10246 /* Merge any constancy or volatility into the target type
10247 for the pointer. */
10249 /* We now know that the TYPE_QUALS don't apply to the decl,
10250 but to the target of the pointer. */
10251 type_quals = TYPE_UNQUALIFIED;
10253 if (IS_SIGNATURE (type))
10255 if (TREE_CODE (declarator) == ADDR_EXPR)
10257 if (CLASSTYPE_METHOD_VEC (type) == NULL_TREE
10258 && TYPE_SIZE (type))
10259 cp_warning ("empty signature `%T' used in signature reference declaration",
10262 type = build_signature_reference_type (type);
10264 sorry ("signature reference");
10270 if (CLASSTYPE_METHOD_VEC (type) == NULL_TREE
10271 && TYPE_SIZE (type))
10272 cp_warning ("empty signature `%T' used in signature pointer declaration",
10274 type = build_signature_pointer_type (type);
10277 else if (TREE_CODE (declarator) == ADDR_EXPR)
10279 if (TREE_CODE (type) == VOID_TYPE)
10280 error ("invalid type: `void &'");
10282 type = build_reference_type (type);
10284 else if (TREE_CODE (type) == METHOD_TYPE)
10285 type = build_ptrmemfunc_type (build_pointer_type (type));
10287 type = build_pointer_type (type);
10289 /* Process a list of type modifier keywords (such as
10290 const or volatile) that were given inside the `*' or `&'. */
10292 if (TREE_TYPE (declarator))
10294 register tree typemodlist;
10300 for (typemodlist = TREE_TYPE (declarator); typemodlist;
10301 typemodlist = TREE_CHAIN (typemodlist))
10303 tree qualifier = TREE_VALUE (typemodlist);
10305 if (qualifier == ridpointers[(int) RID_CONST])
10307 else if (qualifier == ridpointers[(int) RID_VOLATILE])
10309 else if (qualifier == ridpointers[(int) RID_RESTRICT])
10314 error ("invalid type modifier within pointer declarator");
10318 pedwarn ("duplicate `const'");
10320 pedwarn ("duplicate `volatile'");
10322 pedwarn ("duplicate `restrict'");
10324 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10325 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10326 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10327 if (TREE_CODE (declarator) == ADDR_EXPR
10328 && (constp || volatilep))
10331 pedwarn ("discarding `const' applied to a reference");
10333 pedwarn ("discarding `volatile' applied to a reference");
10334 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
10336 type = cp_build_qualified_type (type, type_quals);
10338 declarator = TREE_OPERAND (declarator, 0);
10344 /* We have converted type names to NULL_TREE if the
10345 name was bogus, or to a _TYPE node, if not.
10347 The variable CTYPE holds the type we will ultimately
10348 resolve to. The code here just needs to build
10349 up appropriate member types. */
10350 tree sname = TREE_OPERAND (declarator, 1);
10353 /* Destructors can have their visibilities changed as well. */
10354 if (TREE_CODE (sname) == BIT_NOT_EXPR)
10355 sname = TREE_OPERAND (sname, 0);
10357 if (TREE_COMPLEXITY (declarator) == 0)
10358 /* This needs to be here, in case we are called
10359 multiple times. */ ;
10360 else if (TREE_COMPLEXITY (declarator) == -1)
10361 /* Namespace member. */
10362 pop_decl_namespace ();
10363 else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
10364 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10365 else if (! IS_AGGR_TYPE_CODE
10366 (TREE_CODE (TREE_OPERAND (declarator, 0))))
10368 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
10370 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10371 that refer to ctype. They couldn't be resolved earlier
10372 because we hadn't pushed into the class yet.
10373 Example: resolve 'B<T>::type' in
10374 'B<typename B<T>::type> B<T>::f () { }'. */
10375 if (current_template_parms
10376 && uses_template_parms (type)
10377 && uses_template_parms (current_class_type))
10379 tree args = current_template_args ();
10380 type = tsubst (type, args, NULL_TREE);
10383 /* This pop_nested_class corresponds to the
10384 push_nested_class used to push into class scope for
10385 parsing the argument list of a function decl, in
10387 pop_nested_class (1);
10388 TREE_COMPLEXITY (declarator) = current_class_depth;
10391 my_friendly_abort (16);
10393 if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10395 /* We had a reference to a global decl, or
10396 perhaps we were given a non-aggregate typedef,
10397 in which case we cleared this out, and should just
10398 keep going as though it wasn't there. */
10399 declarator = sname;
10402 ctype = TREE_OPERAND (declarator, 0);
10405 while (t != NULL_TREE && CLASS_TYPE_P (t))
10407 if (CLASSTYPE_TEMPLATE_INFO (t) &&
10408 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10409 template_count += 1;
10410 t = TYPE_MAIN_DECL (t);
10411 if (DECL_LANG_SPECIFIC (t))
10412 t = DECL_CLASS_CONTEXT (t);
10417 if (sname == NULL_TREE)
10420 if (TREE_CODE (sname) == IDENTIFIER_NODE)
10422 /* This is the `standard' use of the scoping operator:
10423 basetype :: member . */
10425 if (ctype == current_class_type)
10431 Is this ill-formed? */
10434 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10437 else if (TREE_CODE (type) == FUNCTION_TYPE)
10439 if (current_class_type == NULL_TREE
10441 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10442 TYPE_ARG_TYPES (type));
10445 cp_error ("cannot declare member function `%T::%s' within `%T'",
10446 ctype, name, current_class_type);
10447 return void_type_node;
10450 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
10451 || TYPE_SIZE (complete_type (ctype)) != NULL_TREE)
10453 /* Have to move this code elsewhere in this function.
10454 this code is used for i.e., typedef int A::M; M *pm;
10456 It is? How? jason 10/2/94 */
10458 if (current_class_type)
10460 cp_error ("cannot declare member `%T::%s' within `%T'",
10461 ctype, name, current_class_type);
10462 return void_type_node;
10464 type = build_offset_type (ctype, type);
10466 else if (uses_template_parms (ctype))
10468 if (TREE_CODE (type) == FUNCTION_TYPE)
10470 = build_cplus_method_type (ctype, TREE_TYPE (type),
10471 TYPE_ARG_TYPES (type));
10475 cp_error ("structure `%T' not yet defined", ctype);
10476 return error_mark_node;
10479 declarator = sname;
10481 else if (TREE_CODE (sname) == SCOPE_REF)
10482 my_friendly_abort (17);
10486 declarator = TREE_OPERAND (declarator, 1);
10487 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
10488 /* In this case, we will deal with it later. */
10492 if (TREE_CODE (type) == FUNCTION_TYPE)
10493 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10494 TYPE_ARG_TYPES (type));
10496 type = build_offset_type (ctype, type);
10503 declarator = TREE_OPERAND (declarator, 0);
10508 case ENUMERAL_TYPE:
10509 declarator = NULL_TREE;
10513 declarator = NULL_TREE;
10517 my_friendly_abort (158);
10521 /* See the comment for the TREE_LIST case, above. */
10524 if (! ignore_attrs)
10525 decl_attributes (type, inner_attrs, NULL_TREE);
10527 TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist));
10529 attrlist = build_decl_list (NULL_TREE, inner_attrs);
10532 if (explicitp == 1)
10534 error ("only constructors can be declared `explicit'");
10538 /* Now TYPE has the actual type. */
10540 /* If this is declaring a typedef name, return a TYPE_DECL. */
10542 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10544 if (type_quals & TYPE_QUAL_CONST)
10546 error ("const `%s' cannot be declared `mutable'", name);
10547 RIDBIT_RESET (RID_MUTABLE, specbits);
10551 error ("static `%s' cannot be declared `mutable'", name);
10552 RIDBIT_RESET (RID_MUTABLE, specbits);
10556 if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
10560 /* Note that the grammar rejects storage classes
10561 in typenames, fields or parameters. */
10562 if (current_lang_name == lang_name_java)
10563 TYPE_FOR_JAVA (type) = 1;
10565 if (decl_context == FIELD)
10567 if (declarator == constructor_name (current_class_type))
10568 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10570 decl = build_lang_decl (TYPE_DECL, declarator, type);
10571 if (IS_SIGNATURE (current_class_type) && opaque_typedef)
10572 SIGNATURE_HAS_OPAQUE_TYPEDECLS (current_class_type) = 1;
10576 /* Make sure this typedef lives as long as its type,
10577 since it might be used as a template parameter. */
10578 if (type != error_mark_node)
10579 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
10580 decl = build_decl (TYPE_DECL, declarator, type);
10581 if (type != error_mark_node)
10585 /* If the user declares "struct {...} foo" then `foo' will have
10586 an anonymous name. Fill that name in now. Nothing can
10587 refer to it, so nothing needs know about the name change.
10588 The TYPE_NAME field was filled in by build_struct_xref. */
10589 if (type != error_mark_node
10590 && TYPE_NAME (type)
10591 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
10592 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type)))
10594 /* FIXME: This is bogus; we should not be doing this for
10595 cv-qualified types. */
10597 /* For anonymous structs that are cv-qualified, need to use
10598 TYPE_MAIN_VARIANT so that name will mangle correctly. As
10599 type not referenced after this block, don't bother
10600 resetting type to original type, ie. TREE_TYPE (decl). */
10601 type = TYPE_MAIN_VARIANT (type);
10603 /* Replace the anonymous name with the real name everywhere. */
10604 lookup_tag_reverse (type, declarator);
10605 TYPE_NAME (type) = decl;
10607 if (TYPE_LANG_SPECIFIC (type))
10608 TYPE_WAS_ANONYMOUS (type) = 1;
10610 /* If this is a typedef within a template class, the nested
10611 type is a (non-primary) template. The name for the
10612 template needs updating as well. */
10613 if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
10614 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
10615 = TYPE_IDENTIFIER (type);
10617 /* XXX Temporarily set the scope.
10618 When returning, start_decl expects it as NULL_TREE,
10619 and will then then set it using pushdecl. */
10620 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 980404);
10621 if (current_class_type)
10622 DECL_CONTEXT (decl) = current_class_type;
10624 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
10626 DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
10627 DECL_ASSEMBLER_NAME (decl)
10628 = get_identifier (build_overload_name (type, 1, 1));
10629 DECL_CONTEXT (decl) = NULL_TREE;
10631 /* FIXME remangle member functions; member functions of a
10632 type with external linkage have external linkage. */
10635 if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
10637 cp_error_at ("typedef name may not be class-qualified", decl);
10642 if (ctype == NULL_TREE)
10644 if (TREE_CODE (type) != METHOD_TYPE)
10645 cp_error_at ("invalid type qualifier for non-method type", decl);
10647 ctype = TYPE_METHOD_BASETYPE (type);
10649 if (ctype != NULL_TREE)
10650 grok_method_quals (ctype, decl, quals);
10653 if (RIDBIT_SETP (RID_SIGNED, specbits)
10654 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
10655 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
10657 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10658 error ("non-object member `%s' cannot be declared mutable", name);
10660 bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
10661 inlinep, friendp, raises != NULL_TREE);
10664 error ("typedef declaration includes an initializer");
10669 /* Detect the case of an array type of unspecified size
10670 which came, as such, direct from a typedef name.
10671 We must copy the type, so that each identifier gets
10672 a distinct type, so that each identifier's size can be
10673 controlled separately by its own initializer. */
10675 if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE
10676 && TYPE_DOMAIN (type) == NULL_TREE)
10678 type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type));
10681 /* If this is a type name (such as, in a cast or sizeof),
10682 compute the type and return it now. */
10684 if (decl_context == TYPENAME)
10686 /* Note that the grammar rejects storage classes
10687 in typenames, fields or parameters. */
10688 if (type_quals != TYPE_UNQUALIFIED)
10690 if (IS_SIGNATURE (type))
10691 error ("type qualifiers specified for signature type");
10692 type_quals = TYPE_UNQUALIFIED;
10695 /* Special case: "friend class foo" looks like a TYPENAME context. */
10698 if (type_quals != TYPE_UNQUALIFIED)
10700 cp_error ("type qualifiers specified for friend class declaration");
10701 type_quals = TYPE_UNQUALIFIED;
10705 cp_error ("`inline' specified for friend class declaration");
10709 /* Only try to do this stuff if we didn't already give up. */
10710 if (type != integer_type_node)
10712 /* A friendly class? */
10713 if (current_class_type)
10714 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
10716 error ("trying to make class `%s' a friend of global scope",
10717 TYPE_NAME_STRING (type));
10718 type = void_type_node;
10723 tree dummy = build_decl (TYPE_DECL, declarator, type);
10724 if (ctype == NULL_TREE)
10726 my_friendly_assert (TREE_CODE (type) == METHOD_TYPE, 159);
10727 ctype = TYPE_METHOD_BASETYPE (type);
10729 grok_method_quals (ctype, dummy, quals);
10730 type = TREE_TYPE (dummy);
10735 else if (declarator == NULL_TREE && decl_context != PARM
10736 && decl_context != CATCHPARM
10737 && TREE_CODE (type) != UNION_TYPE
10740 cp_error ("abstract declarator `%T' used as declaration", type);
10741 declarator = make_anon_name ();
10744 /* `void' at top level (not within pointer)
10745 is allowed only in typedefs or type names.
10746 We don't complain about parms either, but that is because
10747 a better error message can be made later. */
10749 if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
10752 error ("unnamed variable or field declared void");
10753 else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10755 if (IDENTIFIER_OPNAME_P (declarator))
10756 my_friendly_abort (356);
10758 error ("variable or field `%s' declared void", name);
10761 error ("variable or field declared void");
10762 type = integer_type_node;
10765 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10766 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10768 if (decl_context == PARM || decl_context == CATCHPARM)
10770 if (ctype || in_namespace)
10771 error ("cannot use `::' in parameter declaration");
10773 /* A parameter declared as an array of T is really a pointer to T.
10774 One declared as a function is really a pointer to a function.
10775 One declared as a member is really a pointer to member. */
10777 if (TREE_CODE (type) == ARRAY_TYPE)
10779 /* Transfer const-ness of array into that of type pointed to. */
10780 type = build_pointer_type (TREE_TYPE (type));
10781 type_quals = TYPE_UNQUALIFIED;
10783 else if (TREE_CODE (type) == FUNCTION_TYPE)
10784 type = build_pointer_type (type);
10785 else if (TREE_CODE (type) == OFFSET_TYPE)
10786 type = build_pointer_type (type);
10787 else if (TREE_CODE (type) == VOID_TYPE && declarator)
10789 error ("declaration of `%s' as void", name);
10795 register tree decl;
10797 if (decl_context == PARM)
10799 decl = build_decl (PARM_DECL, declarator, type);
10801 bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
10802 inlinep, friendp, raises != NULL_TREE);
10803 if (current_class_type
10804 && IS_SIGNATURE (current_class_type))
10807 error ("parameter of signature member function declared `inline'");
10808 if (RIDBIT_SETP (RID_AUTO, specbits))
10809 error ("parameter of signature member function declared `auto'");
10810 if (RIDBIT_SETP (RID_REGISTER, specbits))
10811 error ("parameter of signature member function declared `register'");
10814 /* Compute the type actually passed in the parmlist,
10815 for the case where there is no prototype.
10816 (For example, shorts and chars are passed as ints.)
10817 When there is a prototype, this is overridden later. */
10819 DECL_ARG_TYPE (decl) = type_promotes_to (type);
10821 else if (decl_context == FIELD)
10823 if (type == error_mark_node)
10825 /* Happens when declaring arrays of sizes which
10826 are error_mark_node, for example. */
10829 else if (in_namespace && !friendp)
10831 /* Something like struct S { int N::j; }; */
10832 cp_error ("invalid use of `::'");
10835 else if (TREE_CODE (type) == FUNCTION_TYPE)
10838 tree function_context;
10840 /* We catch the others as conflicts with the builtin
10842 if (friendp && declarator == ridpointers[(int) RID_SIGNED])
10844 cp_error ("function `%D' cannot be declared friend",
10851 if (ctype == NULL_TREE)
10852 ctype = current_class_type;
10854 if (ctype == NULL_TREE)
10856 cp_error ("can't make `%D' into a method -- not in a class",
10858 return void_type_node;
10861 /* ``A union may [ ... ] not [ have ] virtual functions.''
10863 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
10865 cp_error ("function `%D' declared virtual inside a union",
10867 return void_type_node;
10870 if (declarator == ansi_opname[(int) NEW_EXPR]
10871 || declarator == ansi_opname[(int) VEC_NEW_EXPR]
10872 || declarator == ansi_opname[(int) DELETE_EXPR]
10873 || declarator == ansi_opname[(int) VEC_DELETE_EXPR])
10877 cp_error ("`%D' cannot be declared virtual, since it is always static",
10882 else if (staticp < 2)
10883 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10884 TYPE_ARG_TYPES (type));
10887 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10888 function_context = (ctype != NULL_TREE) ?
10889 hack_decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
10890 publicp = (! friendp || ! staticp)
10891 && function_context == NULL_TREE;
10892 decl = grokfndecl (ctype, type,
10893 TREE_CODE (declarator) != TEMPLATE_ID_EXPR
10894 ? declarator : dname,
10896 virtualp, flags, quals, raises, attrlist,
10897 friendp ? -1 : 0, friendp, publicp, inlinep,
10898 funcdef_flag, template_count, in_namespace);
10899 if (decl == NULL_TREE || decl == error_mark_node)
10902 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10903 /* The decl and setting of decl_machine_attr is also turned off. */
10904 decl = build_decl_attribute_variant (decl, decl_machine_attr);
10907 /* [class.conv.ctor]
10909 A constructor declared without the function-specifier
10910 explicit that can be called with a single parameter
10911 specifies a conversion from the type of its first
10912 parameter to the type of its class. Such a constructor
10913 is called a converting constructor. */
10914 if (explicitp == 2)
10915 DECL_NONCONVERTING_P (decl) = 1;
10916 else if (DECL_CONSTRUCTOR_P (decl))
10918 /* The constructor can be called with exactly one
10919 parameter if there is at least one parameter, and
10920 any subsequent parameters have default arguments.
10921 We don't look at the first parameter, which is
10922 really just the `this' parameter for the new
10925 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)));
10927 /* Skip the `in_chrg' argument too, if present. */
10928 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl)))
10929 arg_types = TREE_CHAIN (arg_types);
10931 if (arg_types == void_list_node
10933 && TREE_CHAIN (arg_types)
10934 && TREE_CHAIN (arg_types) != void_list_node
10935 && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
10936 DECL_NONCONVERTING_P (decl) = 1;
10939 else if (TREE_CODE (type) == METHOD_TYPE)
10941 /* We only get here for friend declarations of
10942 members of other classes. */
10943 /* All method decls are public, so tell grokfndecl to set
10944 TREE_PUBLIC, also. */
10945 decl = grokfndecl (ctype, type, declarator, declarator,
10946 virtualp, flags, quals, raises, attrlist,
10947 friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
10948 template_count, in_namespace);
10949 if (decl == NULL_TREE)
10952 else if (!staticp && ! processing_template_decl
10953 && TYPE_SIZE (complete_type (type)) == NULL_TREE
10954 && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
10957 cp_error ("field `%D' has incomplete type", declarator);
10959 cp_error ("name `%T' has incomplete type", type);
10961 /* If we're instantiating a template, tell them which
10962 instantiation made the field's type be incomplete. */
10963 if (current_class_type
10964 && TYPE_NAME (current_class_type)
10965 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
10966 && declspecs && TREE_VALUE (declspecs)
10967 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
10968 cp_error (" in instantiation of template `%T'",
10969 current_class_type);
10971 type = error_mark_node;
10978 error ("`%s' is neither function nor method; cannot be declared friend",
10979 IDENTIFIER_POINTER (declarator));
10987 /* Friends are treated specially. */
10988 if (ctype == current_class_type)
10989 warning ("member functions are implicitly friends of their class");
10992 tree t = NULL_TREE;
10993 if (decl && DECL_NAME (decl))
10995 if (template_class_depth (current_class_type) == 0)
10998 = check_explicit_specialization
11000 template_count, 2 * (funcdef_flag != 0) + 4);
11001 if (decl == error_mark_node)
11002 return error_mark_node;
11005 t = do_friend (ctype, declarator, decl,
11006 last_function_parms, flags, quals,
11009 if (t && funcdef_flag)
11012 return void_type_node;
11016 /* Structure field. It may not be a function, except for C++ */
11018 if (decl == NULL_TREE)
11024 /* An attempt is being made to initialize a non-static
11025 member. But, from [class.mem]:
11027 4 A member-declarator can contain a
11028 constant-initializer only if it declares a static
11029 member (_class.static_) of integral or enumeration
11030 type, see _class.static.data_.
11032 This used to be relatively common practice, but
11033 the rest of the compiler does not correctly
11034 handle the initialization unless the member is
11035 static so we make it static below. */
11036 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
11038 cp_pedwarn ("making `%D' static", declarator);
11042 if (uses_template_parms (type))
11043 /* We'll check at instantiation time. */
11045 else if (check_static_variable_definition (declarator,
11047 /* If we just return the declaration, crashes
11048 will sometimes occur. We therefore return
11049 void_type_node, as if this was a friend
11050 declaration, to cause callers to completely
11051 ignore this declaration. */
11052 return void_type_node;
11055 /* 9.2p13 [class.mem] */
11056 if (declarator == constructor_name (current_class_type)
11057 /* Divergence from the standard: In extern "C", we
11058 allow non-static data members here, because C does
11059 and /usr/include/netinet/in.h uses that. */
11060 && (staticp || ! in_system_header))
11061 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
11066 /* C++ allows static class members.
11067 All other work for this is done by grokfield.
11068 This VAR_DCL is built by build_lang_field_decl.
11069 All other VAR_DECLs are built by build_decl. */
11070 decl = build_lang_field_decl (VAR_DECL, declarator, type);
11071 TREE_STATIC (decl) = 1;
11072 /* In class context, 'static' means public access. */
11073 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
11077 decl = build_lang_field_decl (FIELD_DECL, declarator, type);
11078 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11080 DECL_MUTABLE_P (decl) = 1;
11081 RIDBIT_RESET (RID_MUTABLE, specbits);
11085 bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
11086 inlinep, friendp, raises != NULL_TREE);
11089 else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
11091 tree original_name;
11097 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11098 original_name = dname;
11100 original_name = declarator;
11102 if (RIDBIT_SETP (RID_AUTO, specbits))
11103 error ("storage class `auto' invalid for function `%s'", name);
11104 else if (RIDBIT_SETP (RID_REGISTER, specbits))
11105 error ("storage class `register' invalid for function `%s'", name);
11107 /* Function declaration not at top level.
11108 Storage classes other than `extern' are not allowed
11109 and `extern' makes no difference. */
11110 if (! toplevel_bindings_p ()
11111 && (RIDBIT_SETP (RID_STATIC, specbits)
11112 || RIDBIT_SETP (RID_INLINE, specbits))
11115 if (RIDBIT_SETP (RID_STATIC, specbits))
11116 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11118 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11121 if (ctype == NULL_TREE)
11125 error ("virtual non-class function `%s'", name);
11129 else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11130 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11131 TYPE_ARG_TYPES (type));
11133 /* Record presence of `static'. */
11134 publicp = (ctype != NULL_TREE
11135 || RIDBIT_SETP (RID_EXTERN, specbits)
11136 || !RIDBIT_SETP (RID_STATIC, specbits));
11138 decl = grokfndecl (ctype, type, original_name, declarator,
11139 virtualp, flags, quals, raises, attrlist,
11141 publicp, inlinep, funcdef_flag,
11142 template_count, in_namespace);
11143 if (decl == NULL_TREE)
11146 /* Among other times, could occur from check_explicit_specialization
11147 returning an error_mark_node. */
11148 if (decl == error_mark_node)
11149 return error_mark_node;
11153 int illegal_static = 0;
11155 /* Don't allow a static member function in a class, and forbid
11156 declaring main to be static. */
11157 if (TREE_CODE (type) == METHOD_TYPE)
11159 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11160 illegal_static = 1;
11162 else if (current_function_decl)
11164 /* FIXME need arm citation */
11165 error ("cannot declare static function inside another function");
11166 illegal_static = 1;
11169 if (illegal_static)
11172 RIDBIT_RESET (RID_STATIC, specbits);
11178 /* It's a variable. */
11180 /* An uninitialized decl with `extern' is a reference. */
11181 decl = grokvardecl (type, declarator, &specbits,
11183 (type_quals & TYPE_QUAL_CONST) != 0,
11185 bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11186 inlinep, friendp, raises != NULL_TREE);
11190 DECL_CONTEXT (decl) = ctype;
11193 cp_pedwarn ("static member `%D' re-declared as static", decl);
11195 RIDBIT_RESET (RID_STATIC, specbits);
11197 if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11199 cp_error ("static member `%D' declared `register'", decl);
11200 RIDBIT_RESET (RID_REGISTER, specbits);
11202 if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11204 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11206 RIDBIT_RESET (RID_EXTERN, specbits);
11211 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11213 error ("`%s' cannot be declared mutable", name);
11216 /* Record `register' declaration for warnings on &
11217 and in case doing stupid register allocation. */
11219 if (RIDBIT_SETP (RID_REGISTER, specbits))
11220 DECL_REGISTER (decl) = 1;
11222 if (RIDBIT_SETP (RID_EXTERN, specbits))
11223 DECL_THIS_EXTERN (decl) = 1;
11225 if (RIDBIT_SETP (RID_STATIC, specbits))
11226 DECL_THIS_STATIC (decl) = 1;
11228 /* Record constancy and volatility. */
11229 /* FIXME: Disallow `restrict' pointer-to-member declarations. */
11230 c_apply_type_quals_to_decl (type_quals, decl);
11236 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11237 An empty exprlist is a parmlist. An exprlist which
11238 contains only identifiers at the global level
11239 is a parmlist. Otherwise, it is an exprlist. */
11242 parmlist_is_exprlist (exprs)
11245 if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11248 if (toplevel_bindings_p ())
11250 /* At the global level, if these are all identifiers,
11251 then it is a parmlist. */
11254 if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11256 exprs = TREE_CHAIN (exprs);
11263 /* Subroutine of start_function. Ensure that each of the parameter
11264 types (as listed in PARMS) is complete, as is required for a
11265 function definition. */
11268 require_complete_types_for_parms (parms)
11273 tree type = TREE_TYPE (parms);
11274 if (TYPE_SIZE (complete_type (type)) == NULL_TREE)
11276 if (DECL_NAME (parms))
11277 error ("parameter `%s' has incomplete type",
11278 IDENTIFIER_POINTER (DECL_NAME (parms)));
11280 error ("parameter has incomplete type");
11281 TREE_TYPE (parms) = error_mark_node;
11284 layout_decl (parms, 0);
11286 parms = TREE_CHAIN (parms);
11290 /* Returns DECL if DECL is a local variable (or parameter). Returns
11291 NULL_TREE otherwise. */
11294 local_variable_p (t)
11297 if ((TREE_CODE (t) == VAR_DECL
11298 /* A VAR_DECL with a context that is a _TYPE is a static data
11300 && !TYPE_P (CP_DECL_CONTEXT (t))
11301 /* Any other non-local variable must be at namespace scope. */
11302 && TREE_CODE (CP_DECL_CONTEXT (t)) != NAMESPACE_DECL)
11303 || (TREE_CODE (t) == PARM_DECL))
11309 /* Check that ARG, which is a default-argument expression for a
11310 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11311 something goes wrong. DECL may also be a _TYPE node, rather than a
11312 DECL, if there is no DECL available. */
11315 check_default_argument (decl, arg)
11322 if (TREE_CODE (arg) == DEFAULT_ARG)
11323 /* We get a DEFAULT_ARG when looking at an in-class declaration
11324 with a default argument. Ignore the argument for now; we'll
11325 deal with it after the class is complete. */
11328 if (processing_template_decl || uses_template_parms (arg))
11329 /* We don't do anything checking until instantiation-time. Note
11330 that there may be uninstantiated arguments even for an
11331 instantiated function, since default arguments are not
11332 instantiated until they are needed. */
11341 decl_type = TREE_TYPE (decl);
11343 if (arg == error_mark_node
11344 || decl == error_mark_node
11345 || TREE_TYPE (arg) == error_mark_node
11346 || decl_type == error_mark_node)
11347 /* Something already went wrong. There's no need to check
11349 return error_mark_node;
11351 /* [dcl.fct.default]
11353 A default argument expression is implicitly converted to the
11355 if (!TREE_TYPE (arg)
11356 || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11359 cp_error ("default argument for `%#D' has type `%T'",
11360 decl, TREE_TYPE (arg));
11362 cp_error ("default argument for paramter of type `%T' has type `%T'",
11363 decl_type, TREE_TYPE (arg));
11365 return error_mark_node;
11368 /* [dcl.fct.default]
11370 Local variables shall not be used in default argument
11373 The keyword `this' shall not be used in a default argument of a
11374 member function. */
11375 var = search_tree (arg, local_variable_p);
11378 cp_error ("default argument `%E' uses local variable `%D'",
11380 return error_mark_node;
11387 /* Decode the list of parameter types for a function type.
11388 Given the list of things declared inside the parens,
11389 return a list of types.
11391 The list we receive can have three kinds of elements:
11392 an IDENTIFIER_NODE for names given without types,
11393 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11394 or void_type_node, to mark the end of an argument list
11395 when additional arguments are not permitted (... was not used).
11397 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11398 a mere declaration. A nonempty identifier-list gets an error message
11399 when FUNCDEF_FLAG is zero.
11400 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11401 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11403 If all elements of the input list contain types,
11404 we return a list of the types.
11405 If all elements contain no type (except perhaps a void_type_node
11406 at the end), we return a null list.
11407 If some have types and some do not, it is an error, and we
11408 return a null list.
11410 Also set last_function_parms to either
11411 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11412 A list of names is converted to a chain of PARM_DECLs
11413 by store_parm_decls so that ultimately it is always a chain of decls.
11415 Note that in C++, parameters can take default values. These default
11416 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11417 an error to specify default values which are followed by parameters
11418 that have no default values, or an ELLIPSES. For simplicities sake,
11419 only parameters which are specified with their types can take on
11423 grokparms (first_parm, funcdef_flag)
11427 tree result = NULL_TREE;
11428 tree decls = NULL_TREE;
11430 if (first_parm != NULL_TREE
11431 && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE)
11433 if (! funcdef_flag)
11434 pedwarn ("parameter names (without types) in function declaration");
11435 last_function_parms = first_parm;
11438 else if (first_parm != NULL_TREE
11439 && TREE_CODE (TREE_VALUE (first_parm)) != TREE_LIST
11440 && TREE_CODE (TREE_VALUE (first_parm)) != VOID_TYPE)
11441 my_friendly_abort (145);
11444 /* Types were specified. This is a list of declarators
11445 each represented as a TREE_LIST node. */
11446 register tree parm, chain;
11447 int any_init = 0, any_error = 0;
11449 if (first_parm != NULL_TREE)
11451 tree last_result = NULL_TREE;
11452 tree last_decl = NULL_TREE;
11454 for (parm = first_parm; parm != NULL_TREE; parm = chain)
11456 tree type = NULL_TREE, list_node = parm;
11457 register tree decl = TREE_VALUE (parm);
11458 tree init = TREE_PURPOSE (parm);
11460 chain = TREE_CHAIN (parm);
11461 /* @@ weak defense against parse errors. */
11462 if (TREE_CODE (decl) != VOID_TYPE
11463 && TREE_CODE (decl) != TREE_LIST)
11465 /* Give various messages as the need arises. */
11466 if (TREE_CODE (decl) == STRING_CST)
11467 cp_error ("invalid string constant `%E'", decl);
11468 else if (TREE_CODE (decl) == INTEGER_CST)
11469 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11473 if (TREE_CODE (decl) != VOID_TYPE)
11475 decl = grokdeclarator (TREE_VALUE (decl),
11476 TREE_PURPOSE (decl),
11477 PARM, init != NULL_TREE,
11479 if (! decl || TREE_TYPE (decl) == error_mark_node)
11482 /* Top-level qualifiers on the parameters are
11483 ignored for function types. */
11484 type = TYPE_MAIN_VARIANT (TREE_TYPE (decl));
11486 if (TREE_CODE (type) == VOID_TYPE)
11487 decl = void_type_node;
11488 else if (TREE_CODE (type) == METHOD_TYPE)
11490 if (DECL_NAME (decl))
11491 /* Cannot use the decl here because
11492 we don't have DECL_CONTEXT set up yet. */
11493 cp_error ("parameter `%D' invalidly declared method type",
11496 error ("parameter invalidly declared method type");
11497 type = build_pointer_type (type);
11498 TREE_TYPE (decl) = type;
11500 else if (TREE_CODE (type) == OFFSET_TYPE)
11502 if (DECL_NAME (decl))
11503 cp_error ("parameter `%D' invalidly declared offset type",
11506 error ("parameter invalidly declared offset type");
11507 type = build_pointer_type (type);
11508 TREE_TYPE (decl) = type;
11510 else if (TREE_CODE (type) == RECORD_TYPE
11511 && TYPE_LANG_SPECIFIC (type)
11512 && CLASSTYPE_ABSTRACT_VIRTUALS (type))
11514 abstract_virtuals_error (decl, type);
11515 any_error = 1; /* Seems like a good idea. */
11517 else if (TREE_CODE (type) == RECORD_TYPE
11518 && TYPE_LANG_SPECIFIC (type)
11519 && IS_SIGNATURE (type))
11521 signature_error (decl, type);
11522 any_error = 1; /* Seems like a good idea. */
11524 else if (POINTER_TYPE_P (type))
11527 while (POINTER_TYPE_P (t)
11528 || (TREE_CODE (t) == ARRAY_TYPE
11529 && TYPE_DOMAIN (t) != NULL_TREE))
11531 if (TREE_CODE (t) == ARRAY_TYPE)
11532 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11534 TYPE_PTR_P (type) ? "pointer" : "reference");
11538 if (TREE_CODE (decl) == VOID_TYPE)
11540 if (result == NULL_TREE)
11542 result = void_list_node;
11543 last_result = result;
11547 TREE_CHAIN (last_result) = void_list_node;
11548 last_result = void_list_node;
11551 && (chain != void_list_node || TREE_CHAIN (chain)))
11552 error ("`void' in parameter list must be entire list");
11556 /* Since there is a prototype, args are passed in their own types. */
11557 DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
11558 #ifdef PROMOTE_PROTOTYPES
11559 if ((TREE_CODE (type) == INTEGER_TYPE
11560 || TREE_CODE (type) == ENUMERAL_TYPE)
11561 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
11562 DECL_ARG_TYPE (decl) = integer_type_node;
11564 if (!any_error && init)
11567 init = check_default_argument (decl, init);
11572 if (decls == NULL_TREE)
11579 TREE_CHAIN (last_decl) = decl;
11582 if (! current_function_decl && TREE_PERMANENT (list_node))
11584 TREE_PURPOSE (list_node) = init;
11585 TREE_VALUE (list_node) = type;
11586 TREE_CHAIN (list_node) = NULL_TREE;
11589 list_node = saveable_tree_cons (init, type, NULL_TREE);
11590 if (result == NULL_TREE)
11592 result = list_node;
11593 last_result = result;
11597 TREE_CHAIN (last_result) = list_node;
11598 last_result = list_node;
11602 TREE_CHAIN (last_result) = NULL_TREE;
11603 /* If there are no parameters, and the function does not end
11604 with `...', then last_decl will be NULL_TREE. */
11605 if (last_decl != NULL_TREE)
11606 TREE_CHAIN (last_decl) = NULL_TREE;
11610 last_function_parms = decls;
11615 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11616 FUNCTION_TYPE with the newly parsed version of its default argument, which
11617 was previously digested as text. See snarf_defarg et al in lex.c. */
11620 replace_defarg (arg, init)
11623 if (! processing_template_decl
11624 && ! can_convert_arg (TREE_VALUE (arg), TREE_TYPE (init), init))
11625 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11626 TREE_TYPE (init), TREE_VALUE (arg));
11627 TREE_PURPOSE (arg) = init;
11634 tree t = FUNCTION_ARG_CHAIN (d);
11635 if (DECL_CONSTRUCTOR_P (d)
11636 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d)))
11637 t = TREE_CHAIN (t);
11638 if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
11639 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t)))
11640 == DECL_CLASS_CONTEXT (d))
11641 && (TREE_CHAIN (t) == NULL_TREE
11642 || TREE_CHAIN (t) == void_list_node
11643 || TREE_PURPOSE (TREE_CHAIN (t))))
11648 /* These memoizing functions keep track of special properties which
11649 a class may have. `grok_ctor_properties' notices whether a class
11650 has a constructor of the form X(X&), and also complains
11651 if the class has a constructor of the form X(X).
11652 `grok_op_properties' takes notice of the various forms of
11653 operator= which are defined, as well as what sorts of type conversion
11654 may apply. Both functions take a FUNCTION_DECL as an argument. */
11657 grok_ctor_properties (ctype, decl)
11660 tree parmtypes = FUNCTION_ARG_CHAIN (decl);
11661 tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
11663 /* When a type has virtual baseclasses, a magical first int argument is
11664 added to any ctor so we can tell if the class has been initialized
11665 yet. This could screw things up in this function, so we deliberately
11666 ignore the leading int if we're in that situation. */
11667 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype))
11669 my_friendly_assert (parmtypes
11670 && TREE_VALUE (parmtypes) == integer_type_node,
11672 parmtypes = TREE_CHAIN (parmtypes);
11673 parmtype = TREE_VALUE (parmtypes);
11678 A non-template constructor for class X is a copy constructor if
11679 its first parameter is of type X&, const X&, volatile X& or const
11680 volatile X&, and either there are no other parameters or else all
11681 other parameters have default arguments. */
11682 if (TREE_CODE (parmtype) == REFERENCE_TYPE
11683 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype
11684 && (TREE_CHAIN (parmtypes) == NULL_TREE
11685 || TREE_CHAIN (parmtypes) == void_list_node
11686 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11687 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11688 && is_member_template (DECL_TI_TEMPLATE (decl))))
11690 TYPE_HAS_INIT_REF (ctype) = 1;
11691 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11692 TYPE_HAS_CONST_INIT_REF (ctype) = 1;
11696 A declaration of a constructor for a class X is ill-formed if its
11697 first parameter is of type (optionally cv-qualified) X and either
11698 there are no other parameters or else all other parameters have
11701 We *don't* complain about member template instantiations that
11702 have this form, though; they can occur as we try to decide what
11703 constructor to use during overload resolution. Since overload
11704 resolution will never prefer such a constructor to the
11705 non-template copy constructor (which is either explicitly or
11706 implicitly defined), there's no need to worry about their
11707 existence. Theoretically, they should never even be
11708 instantiated, but that's hard to forestall. */
11709 else if (TYPE_MAIN_VARIANT (parmtype) == ctype
11710 && (TREE_CHAIN (parmtypes) == NULL_TREE
11711 || TREE_CHAIN (parmtypes) == void_list_node
11712 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11713 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11714 && is_member_template (DECL_TI_TEMPLATE (decl))))
11716 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11718 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
11721 else if (TREE_CODE (parmtype) == VOID_TYPE
11722 || TREE_PURPOSE (parmtypes) != NULL_TREE)
11723 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1;
11728 /* An operator with this name can be either unary or binary. */
11734 return (name == ansi_opname [(int) INDIRECT_REF]
11735 || name == ansi_opname [(int) ADDR_EXPR]
11736 || name == ansi_opname [(int) NEGATE_EXPR]
11737 || name == ansi_opname[(int) POSTINCREMENT_EXPR]
11738 || name == ansi_opname[(int) POSTDECREMENT_EXPR]
11739 || name == ansi_opname [(int) CONVERT_EXPR]);
11742 /* An operator with this name can only be unary. */
11748 return (name == ansi_opname [(int) TRUTH_NOT_EXPR]
11749 || name == ansi_opname [(int) BIT_NOT_EXPR]
11750 || name == ansi_opname [(int) COMPONENT_REF]
11751 || IDENTIFIER_TYPENAME_P (name));
11754 /* Do a little sanity-checking on how they declared their operator. */
11757 grok_op_properties (decl, virtualp, friendp)
11759 int virtualp, friendp;
11761 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
11762 int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
11763 tree name = DECL_NAME (decl);
11765 if (current_class_type == NULL_TREE)
11772 A user-declared copy assignment operator X::operator= is a
11773 non-static non-template member function of class X with
11774 exactly one parameter of type X, X&, const X&, volatile X& or
11775 const volatile X&. */
11776 if (name == ansi_opname[(int) MODIFY_EXPR]
11777 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11778 && is_member_template (DECL_TI_TEMPLATE (decl))))
11779 TYPE_HAS_ASSIGNMENT (current_class_type) = 1;
11780 else if (name == ansi_opname[(int) CALL_EXPR])
11781 TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
11782 else if (name == ansi_opname[(int) ARRAY_REF])
11783 TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
11784 else if (name == ansi_opname[(int) COMPONENT_REF]
11785 || name == ansi_opname[(int) MEMBER_REF])
11786 TYPE_OVERLOADS_ARROW (current_class_type) = 1;
11787 else if (name == ansi_opname[(int) NEW_EXPR])
11788 TYPE_GETS_NEW (current_class_type) |= 1;
11789 else if (name == ansi_opname[(int) DELETE_EXPR])
11790 TYPE_GETS_DELETE (current_class_type) |= 1;
11791 else if (name == ansi_opname[(int) VEC_NEW_EXPR])
11792 TYPE_GETS_NEW (current_class_type) |= 2;
11793 else if (name == ansi_opname[(int) VEC_DELETE_EXPR])
11794 TYPE_GETS_DELETE (current_class_type) |= 2;
11797 if (name == ansi_opname[(int) NEW_EXPR]
11798 || name == ansi_opname[(int) VEC_NEW_EXPR])
11800 /* When the compiler encounters the definition of A::operator new, it
11801 doesn't look at the class declaration to find out if it's static. */
11803 revert_static_member_fn (&decl, NULL, NULL);
11805 /* Take care of function decl if we had syntax errors. */
11806 if (argtypes == NULL_TREE)
11808 = build_function_type (ptr_type_node,
11809 hash_tree_chain (integer_type_node,
11812 TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
11814 else if (name == ansi_opname[(int) DELETE_EXPR]
11815 || name == ansi_opname[(int) VEC_DELETE_EXPR])
11818 revert_static_member_fn (&decl, NULL, NULL);
11820 if (argtypes == NULL_TREE)
11822 = build_function_type (void_type_node,
11823 hash_tree_chain (ptr_type_node,
11827 TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
11829 if (! friendp && name == ansi_opname[(int) VEC_DELETE_EXPR]
11830 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)))
11831 != void_list_node))
11832 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type) = 1;
11837 /* An operator function must either be a non-static member function
11838 or have at least one parameter of a class, a reference to a class,
11839 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11840 if (! methodp || DECL_STATIC_FUNCTION_P (decl))
11842 if (IDENTIFIER_TYPENAME_P (name)
11843 || name == ansi_opname[(int) CALL_EXPR]
11844 || name == ansi_opname[(int) MODIFY_EXPR]
11845 || name == ansi_opname[(int) COMPONENT_REF]
11846 || name == ansi_opname[(int) ARRAY_REF])
11847 cp_error ("`%D' must be a nonstatic member function", decl);
11852 if (DECL_STATIC_FUNCTION_P (decl))
11853 cp_error ("`%D' must be either a non-static member function or a non-member function", decl);
11856 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
11858 tree arg = TREE_VALUE (p);
11859 if (TREE_CODE (arg) == REFERENCE_TYPE)
11860 arg = TREE_TYPE (arg);
11862 /* This lets bad template code slip through. */
11863 if (IS_AGGR_TYPE (arg)
11864 || TREE_CODE (arg) == ENUMERAL_TYPE
11865 || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
11866 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
11870 ("`%D' must have an argument of class or enumerated type",
11877 if (name == ansi_opname[(int) CALL_EXPR])
11878 return; /* No restrictions on args. */
11880 if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
11882 tree t = TREE_TYPE (name);
11883 if (TREE_CODE (t) == VOID_TYPE)
11884 pedwarn ("void is not a valid type conversion operator");
11885 else if (! friendp)
11887 int ref = (TREE_CODE (t) == REFERENCE_TYPE);
11890 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
11892 if (t == current_class_type)
11893 what = "the same type";
11894 /* Don't force t to be complete here. */
11895 else if (IS_AGGR_TYPE (t)
11897 && DERIVED_FROM_P (t, current_class_type))
11898 what = "a base class";
11901 warning ("conversion to %s%s will never use a type conversion operator",
11902 ref ? "a reference to " : "", what);
11906 if (name == ansi_opname[(int) MODIFY_EXPR])
11910 if (list_length (argtypes) != 3 && methodp)
11912 cp_error ("`%D' must take exactly one argument", decl);
11915 parmtype = TREE_VALUE (TREE_CHAIN (argtypes));
11917 if (copy_assignment_arg_p (parmtype, virtualp)
11920 TYPE_HAS_ASSIGN_REF (current_class_type) = 1;
11921 if (TREE_CODE (parmtype) != REFERENCE_TYPE
11922 || CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11923 TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1;
11926 else if (name == ansi_opname[(int) COND_EXPR])
11929 pedwarn ("ANSI C++ prohibits overloading operator ?:");
11930 if (list_length (argtypes) != 4)
11931 cp_error ("`%D' must take exactly three arguments", decl);
11933 else if (ambi_op_p (name))
11935 if (list_length (argtypes) == 2)
11937 else if (list_length (argtypes) == 3)
11939 if ((name == ansi_opname[(int) POSTINCREMENT_EXPR]
11940 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
11941 && ! processing_template_decl
11942 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
11945 cp_error ("postfix `%D' must take `int' as its argument",
11949 ("postfix `%D' must take `int' as its second argument",
11956 cp_error ("`%D' must take either zero or one argument", decl);
11958 cp_error ("`%D' must take either one or two arguments", decl);
11961 /* More Effective C++ rule 6. */
11963 && (name == ansi_opname[(int) POSTINCREMENT_EXPR]
11964 || name == ansi_opname[(int) POSTDECREMENT_EXPR]))
11966 tree arg = TREE_VALUE (argtypes);
11967 tree ret = TREE_TYPE (TREE_TYPE (decl));
11968 if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
11969 arg = TREE_TYPE (arg);
11970 arg = TYPE_MAIN_VARIANT (arg);
11971 if (list_length (argtypes) == 2)
11973 if (TREE_CODE (ret) != REFERENCE_TYPE
11974 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
11976 cp_warning ("prefix `%D' should return `%T'", decl,
11977 build_reference_type (arg));
11981 if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
11982 cp_warning ("postfix `%D' should return `%T'", decl, arg);
11986 else if (unary_op_p (name))
11988 if (list_length (argtypes) != 2)
11991 cp_error ("`%D' must take `void'", decl);
11993 cp_error ("`%D' must take exactly one argument", decl);
11996 else /* if (binary_op_p (name)) */
11998 if (list_length (argtypes) != 3)
12001 cp_error ("`%D' must take exactly one argument", decl);
12003 cp_error ("`%D' must take exactly two arguments", decl);
12006 /* More Effective C++ rule 7. */
12008 && (name == ansi_opname [TRUTH_ANDIF_EXPR]
12009 || name == ansi_opname [TRUTH_ORIF_EXPR]
12010 || name == ansi_opname [COMPOUND_EXPR]))
12011 cp_warning ("user-defined `%D' always evaluates both arguments",
12015 /* Effective C++ rule 23. */
12017 && list_length (argtypes) == 3
12018 && (name == ansi_opname [PLUS_EXPR]
12019 || name == ansi_opname [MINUS_EXPR]
12020 || name == ansi_opname [TRUNC_DIV_EXPR]
12021 || name == ansi_opname [MULT_EXPR])
12022 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
12023 cp_warning ("`%D' should return by value", decl);
12027 for (; argtypes != void_list_node ; argtypes = TREE_CHAIN (argtypes))
12028 if (TREE_PURPOSE (argtypes))
12030 TREE_PURPOSE (argtypes) = NULL_TREE;
12031 if (name == ansi_opname[(int) POSTINCREMENT_EXPR]
12032 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
12035 cp_pedwarn ("`%D' cannot have default arguments", decl);
12038 cp_error ("`%D' cannot have default arguments", decl);
12045 enum tag_types code;
12057 case signature_type:
12058 return "signature";
12060 my_friendly_abort (981122);
12064 /* Get the struct, enum or union (CODE says which) with tag NAME.
12065 Define the tag as a forward-reference if it is not defined.
12067 C++: If a class derivation is given, process it here, and report
12068 an error if multiple derivation declarations are not identical.
12070 If this is a definition, come in through xref_tag and only look in
12071 the current frame for the name (since C++ allows new names in any
12075 xref_tag (code_type_node, name, globalize)
12076 tree code_type_node;
12080 enum tag_types tag_code;
12081 enum tree_code code;
12083 register tree ref, t;
12084 struct binding_level *b = inner_binding_level;
12086 tree attributes = NULL_TREE;
12088 /* If we are called from the parser, code_type_node will sometimes be a
12089 TREE_LIST. This indicates that the user wrote
12090 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12092 if (TREE_CODE (code_type_node) == TREE_LIST)
12094 attributes = TREE_PURPOSE (code_type_node);
12095 code_type_node = TREE_VALUE (code_type_node);
12098 tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
12103 case signature_type:
12104 code = RECORD_TYPE;
12110 code = ENUMERAL_TYPE;
12113 my_friendly_abort (18);
12116 /* If a cross reference is requested, look up the type
12117 already defined for this tag and return it. */
12118 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
12121 name = TYPE_IDENTIFIER (t);
12125 t = IDENTIFIER_TYPE_VALUE (name);
12127 if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12128 && TREE_CODE (t) != TEMPLATE_TEMPLATE_PARM)
12133 /* If we know we are defining this tag, only look it up in
12134 this scope and don't try to find it as a type. */
12135 ref = lookup_tag (code, name, b, 1);
12139 if (current_class_type
12140 && template_class_depth (current_class_type)
12141 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12142 /* Since GLOBALIZE is non-zero, we are not looking at a
12143 definition of this tag. Since, in addition, we are currently
12144 processing a (member) template declaration of a template
12145 class, we don't want to do any lookup at all; consider:
12152 { template <class V>
12153 friend struct S1; };
12155 Here, the S2::S1 declaration should not be confused with the
12156 outer declaration. In particular, the inner version should
12157 have a template parameter of level 2, not level 1. This
12158 would be particularly important if the member declaration
12161 template <class V = U> friend struct S1;
12163 say, when we should tsubst into `U' when instantiating S2. */
12169 if (t != TYPE_MAIN_VARIANT (t))
12170 cp_pedwarn ("using typedef-name `%D' after `%s'",
12171 TYPE_NAME (t), tag_name (tag_code));
12175 ref = lookup_tag (code, name, b, 0);
12179 /* Try finding it as a type declaration. If that wins,
12181 ref = lookup_name (name, 1);
12183 if (ref != NULL_TREE
12184 && processing_template_decl
12185 && DECL_CLASS_TEMPLATE_P (ref)
12186 && template_class_depth (current_class_type) == 0)
12187 /* Since GLOBALIZE is true, we're declaring a global
12188 template, so we want this type. */
12189 ref = DECL_RESULT (ref);
12191 if (ref && TREE_CODE (ref) == TYPE_DECL
12192 && TREE_CODE (TREE_TYPE (ref)) == code)
12193 ref = TREE_TYPE (ref);
12200 push_obstacks_nochange ();
12204 /* If no such tag is yet defined, create a forward-reference node
12205 and record it as the "definition".
12206 When a real declaration of this type is found,
12207 the forward-reference will be altered into a real type. */
12209 /* In C++, since these migrate into the global scope, we must
12210 build them on the permanent obstack. */
12212 temp = allocation_temporary_p ();
12214 end_temporary_allocation ();
12216 if (code == ENUMERAL_TYPE)
12218 cp_error ("use of enum `%#D' without previous declaration", name);
12220 ref = make_node (ENUMERAL_TYPE);
12222 /* Give the type a default layout like unsigned int
12223 to avoid crashing if it does not get defined. */
12224 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12225 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12226 TREE_UNSIGNED (ref) = 1;
12227 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12228 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12229 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12231 /* Enable us to recognize when a type is created in class context.
12232 To do nested classes correctly, this should probably be cleared
12233 out when we leave this classes scope. Currently this in only
12234 done in `start_enum'. */
12236 pushtag (name, ref, globalize);
12240 struct binding_level *old_b = class_binding_level;
12242 ref = make_lang_type (code);
12244 if (tag_code == signature_type)
12246 SET_SIGNATURE (ref);
12247 /* Since a signature type will be turned into the type
12248 of signature tables, it's not only an interface. */
12249 CLASSTYPE_INTERFACE_ONLY (ref) = 0;
12250 SET_CLASSTYPE_INTERFACE_KNOWN (ref);
12251 /* A signature doesn't have a vtable. */
12252 CLASSTYPE_VTABLE_NEEDS_WRITING (ref) = 0;
12255 #ifdef NONNESTED_CLASSES
12256 /* Class types don't nest the way enums do. */
12257 class_binding_level = (struct binding_level *)0;
12259 pushtag (name, ref, globalize);
12260 class_binding_level = old_b;
12265 /* If it no longer looks like a nested type, make sure it's
12267 If it is not an IDENTIFIER, this is not a declaration */
12268 if (b->namespace_p && !class_binding_level
12269 && TREE_CODE (name) == IDENTIFIER_NODE)
12271 if (IDENTIFIER_NAMESPACE_VALUE (name) == NULL_TREE)
12272 SET_IDENTIFIER_NAMESPACE_VALUE (name, TYPE_NAME (ref));
12275 if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12276 redeclare_class_template (ref, current_template_parms);
12279 /* Until the type is defined, tentatively accept whatever
12280 structure tag the user hands us. */
12281 if (TYPE_SIZE (ref) == NULL_TREE
12282 && ref != current_class_type
12283 /* Have to check this, in case we have contradictory tag info. */
12284 && IS_AGGR_TYPE_CODE (TREE_CODE (ref)))
12286 if (tag_code == class_type)
12287 CLASSTYPE_DECLARED_CLASS (ref) = 1;
12288 else if (tag_code == record_type || tag_code == signature_type)
12289 CLASSTYPE_DECLARED_CLASS (ref) = 0;
12294 TREE_TYPE (ref) = attributes;
12296 if (ref && TYPE_P (ref))
12300 If the identifier resolves to a typedef-name or a template
12301 type-parameter, the elaborated-type-specifier is
12303 if (TYPE_LANG_SPECIFIC (ref) && TYPE_WAS_ANONYMOUS (ref))
12304 cp_error ("`%T' is a typedef name", ref);
12305 else if (TREE_CODE (ref) == TEMPLATE_TYPE_PARM)
12306 cp_error ("`%T' is a template type paramter", ref);
12313 xref_tag_from_type (old, id, globalize)
12317 tree code_type_node;
12319 if (TREE_CODE (old) == RECORD_TYPE)
12320 code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12321 ? class_type_node : record_type_node);
12323 code_type_node = union_type_node;
12325 if (id == NULL_TREE)
12326 id = TYPE_IDENTIFIER (old);
12328 return xref_tag (code_type_node, id, globalize);
12332 xref_basetypes (code_type_node, name, ref, binfo)
12333 tree code_type_node;
12337 /* In the declaration `A : X, Y, ... Z' we mark all the types
12338 (A, X, Y, ..., Z) so we can check for duplicates. */
12341 enum tag_types tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
12343 if (tag_code == union_type)
12345 cp_error ("derived union `%T' invalid", ref);
12349 len = list_length (binfo);
12350 push_obstacks (TYPE_OBSTACK (ref), TYPE_OBSTACK (ref));
12352 SET_CLASSTYPE_MARKED (ref);
12353 BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
12355 for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
12357 /* The base of a derived struct is public by default. */
12359 = (TREE_PURPOSE (binfo) == access_public_node
12360 || TREE_PURPOSE (binfo) == access_public_virtual_node
12361 || (tag_code != class_type
12362 && (TREE_PURPOSE (binfo) == access_default_node
12363 || TREE_PURPOSE (binfo) == access_default_virtual_node)));
12365 = (TREE_PURPOSE (binfo) == access_protected_node
12366 || TREE_PURPOSE (binfo) == access_protected_virtual_node);
12368 = (TREE_PURPOSE (binfo) == access_private_virtual_node
12369 || TREE_PURPOSE (binfo) == access_protected_virtual_node
12370 || TREE_PURPOSE (binfo) == access_public_virtual_node
12371 || TREE_PURPOSE (binfo) == access_default_virtual_node);
12372 tree basetype = TREE_VALUE (binfo);
12375 if (basetype && TREE_CODE (basetype) == TYPE_DECL)
12376 basetype = TREE_TYPE (basetype);
12378 || (TREE_CODE (basetype) != RECORD_TYPE
12379 && TREE_CODE (basetype) != TYPENAME_TYPE
12380 && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
12381 && TREE_CODE (basetype) != TEMPLATE_TEMPLATE_PARM))
12383 cp_error ("base type `%T' fails to be a struct or class type",
12384 TREE_VALUE (binfo));
12388 GNU_xref_hier (name, basetype, via_public, via_virtual, 0);
12391 /* This code replaces similar code in layout_basetypes.
12392 We put the complete_type first for implicit `typename'. */
12393 if (TYPE_SIZE (complete_type (basetype)) == NULL_TREE
12394 && ! (current_template_parms && uses_template_parms (basetype)))
12396 cp_error ("base class `%T' has incomplete type", basetype);
12402 if (CLASSTYPE_MARKED (basetype))
12404 if (basetype == ref)
12405 cp_error ("recursive type `%T' undefined", basetype);
12407 cp_error ("duplicate base type `%T' invalid", basetype);
12411 if (TYPE_FOR_JAVA (basetype)
12412 && current_lang_stack == current_lang_base)
12413 TYPE_FOR_JAVA (ref) = 1;
12415 /* Note that the BINFO records which describe individual
12416 inheritances are *not* shared in the lattice! They
12417 cannot be shared because a given baseclass may be
12418 inherited with different `accessibility' by different
12419 derived classes. (Each BINFO record describing an
12420 individual inheritance contains flags which say what
12421 the `accessibility' of that particular inheritance is.) */
12424 = make_binfo (integer_zero_node, basetype,
12425 CLASS_TYPE_P (basetype)
12426 ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
12427 CLASS_TYPE_P (basetype)
12428 ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
12430 TREE_VEC_ELT (binfos, i) = base_binfo;
12431 TREE_VIA_PUBLIC (base_binfo) = via_public;
12432 TREE_VIA_PROTECTED (base_binfo) = via_protected;
12433 TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
12434 BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
12436 /* We need to unshare the binfos now so that lookups during class
12437 definition work. */
12438 unshare_base_binfos (base_binfo);
12440 SET_CLASSTYPE_MARKED (basetype);
12442 /* We are free to modify these bits because they are meaningless
12443 at top level, and BASETYPE is a top-level type. */
12444 if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
12446 TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
12447 TYPE_USES_COMPLEX_INHERITANCE (ref) = 1;
12450 if (CLASS_TYPE_P (basetype))
12452 TYPE_GETS_NEW (ref) |= TYPE_GETS_NEW (basetype);
12453 TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
12460 TREE_VEC_LENGTH (binfos) = i;
12462 BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
12465 TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
12468 tree basetype = BINFO_TYPE (TREE_VEC_ELT (binfos, 0));
12470 if (CLASS_TYPE_P (basetype))
12471 TYPE_USES_MULTIPLE_INHERITANCE (ref)
12472 = TYPE_USES_MULTIPLE_INHERITANCE (basetype);
12475 if (TYPE_USES_MULTIPLE_INHERITANCE (ref))
12476 TYPE_USES_COMPLEX_INHERITANCE (ref) = 1;
12478 /* Unmark all the types. */
12480 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
12481 CLEAR_CLASSTYPE_MARKED (ref);
12487 /* Begin compiling the definition of an enumeration type.
12488 NAME is its name (or null if anonymous).
12489 Returns the type object, as yet incomplete.
12490 Also records info about it so that build_enumerator
12491 may be used to declare the individual values as they are read. */
12497 register tree enumtype = NULL_TREE;
12498 struct binding_level *b = inner_binding_level;
12500 /* We are wasting space here and putting these on the permanent_obstack so
12501 that typeid(local enum) will work correctly. */
12502 push_obstacks (&permanent_obstack, &permanent_obstack);
12504 /* If this is the real definition for a previous forward reference,
12505 fill in the contents in the same object that used to be the
12506 forward reference. */
12508 if (name != NULL_TREE)
12509 enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
12511 if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
12512 cp_error ("multiple definition of `%#T'", enumtype);
12515 enumtype = make_node (ENUMERAL_TYPE);
12516 pushtag (name, enumtype, 0);
12519 if (current_class_type)
12520 TREE_ADDRESSABLE (b->tags) = 1;
12522 /* We don't copy this value because build_enumerator needs to do it. */
12523 enum_next_value = integer_zero_node;
12526 GNU_xref_decl (current_function_decl, enumtype);
12530 /* After processing and defining all the values of an enumeration type,
12531 install their decls in the enumeration type and finish it off.
12532 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12533 Returns ENUMTYPE. */
12536 finish_enum (enumtype)
12539 register tree minnode = NULL_TREE, maxnode = NULL_TREE;
12540 /* Calculate the maximum value of any enumerator in this type. */
12542 tree values = TYPE_VALUES (enumtype);
12547 for (pair = values; pair; pair = TREE_CHAIN (pair))
12552 /* The TREE_VALUE is a CONST_DECL for this enumeration
12554 decl = TREE_VALUE (pair);
12556 /* The DECL_INITIAL will be NULL if we are processing a
12557 template declaration and this enumeration constant had no
12558 explicit initializer. */
12559 value = DECL_INITIAL (decl);
12560 if (value && !processing_template_decl)
12562 /* Set the TREE_TYPE for the VALUE as well. That's so
12563 that when we call decl_constant_value we get an
12564 entity of the right type (but with the constant
12565 value). Since we shouldn't ever call
12566 decl_constant_value on a template type, there's no
12567 reason to do that when processing_template_decl.
12568 And, if the expression is something like a
12569 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12570 wreak havoc on the intended type of the expression.
12572 Of course, there's also no point in trying to compute
12573 minimum or maximum values if we're in a template. */
12574 TREE_TYPE (value) = enumtype;
12577 minnode = maxnode = value;
12578 else if (tree_int_cst_lt (maxnode, value))
12580 else if (tree_int_cst_lt (value, minnode))
12584 if (processing_template_decl)
12585 /* If this is just a template, leave the CONST_DECL
12586 alone. That way tsubst_copy will find CONST_DECLs for
12587 CONST_DECLs, and not INTEGER_CSTs. */
12590 /* In the list we're building up, we want the enumeration
12591 values, not the CONST_DECLs. */
12592 TREE_VALUE (pair) = value;
12596 maxnode = minnode = integer_zero_node;
12598 TYPE_VALUES (enumtype) = nreverse (values);
12600 if (processing_template_decl)
12602 tree scope = current_scope ();
12603 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12604 add_tree (build_min (TAG_DEFN, enumtype));
12608 int unsignedp = tree_int_cst_sgn (minnode) >= 0;
12609 int lowprec = min_precision (minnode, unsignedp);
12610 int highprec = min_precision (maxnode, unsignedp);
12611 int precision = MAX (lowprec, highprec);
12614 TYPE_SIZE (enumtype) = NULL_TREE;
12616 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12618 TYPE_PRECISION (enumtype) = precision;
12620 fixup_unsigned_type (enumtype);
12622 fixup_signed_type (enumtype);
12624 if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
12625 /* Use the width of the narrowest normal C type which is wide
12627 TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
12630 TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
12632 TYPE_SIZE (enumtype) = 0;
12633 layout_type (enumtype);
12635 /* Fix up all variant types of this enum type. */
12636 for (tem = TYPE_MAIN_VARIANT (enumtype); tem;
12637 tem = TYPE_NEXT_VARIANT (tem))
12639 TYPE_VALUES (tem) = TYPE_VALUES (enumtype);
12640 TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype);
12641 TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype);
12642 TYPE_SIZE (tem) = TYPE_SIZE (enumtype);
12643 TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype);
12644 TYPE_MODE (tem) = TYPE_MODE (enumtype);
12645 TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype);
12646 TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype);
12647 TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype);
12650 /* Finish debugging output for this type. */
12651 rest_of_type_compilation (enumtype, namespace_bindings_p ());
12654 /* In start_enum we pushed obstacks. Here, we must pop them. */
12660 /* Build and install a CONST_DECL for an enumeration constant of the
12661 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12662 Assignment of sequential values by default is handled here. */
12665 build_enumerator (name, value, type)
12673 /* Remove no-op casts from the value. */
12675 STRIP_TYPE_NOPS (value);
12677 if (! processing_template_decl)
12679 /* Validate and default VALUE. */
12680 if (value != NULL_TREE)
12682 if (TREE_READONLY_DECL_P (value))
12683 value = decl_constant_value (value);
12685 if (TREE_CODE (value) == INTEGER_CST)
12687 value = default_conversion (value);
12688 constant_expression_warning (value);
12692 cp_error ("enumerator value for `%D' not integer constant", name);
12697 /* Default based on previous value. */
12698 if (value == NULL_TREE && ! processing_template_decl)
12700 value = enum_next_value;
12702 cp_error ("overflow in enumeration values at `%D'", name);
12705 /* Remove no-op casts from the value. */
12707 STRIP_TYPE_NOPS (value);
12709 /* To fix MAX_VAL enum consts. (bkoz) */
12710 TREE_TYPE (value) = integer_type_node;
12714 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12715 Even in other cases, we will later (in finish_enum) be setting the
12717 if (value != NULL_TREE)
12718 value = copy_node (value);
12720 /* C++ associates enums with global, function, or class declarations. */
12722 context = current_scope ();
12723 if (context && context == current_class_type)
12724 /* This enum declaration is local to the class. */
12725 decl = build_lang_field_decl (CONST_DECL, name, type);
12727 /* It's a global enum, or it's local to a function. (Note local to
12728 a function could mean local to a class method. */
12729 decl = build_decl (CONST_DECL, name, type);
12731 DECL_CONTEXT (decl) = FROB_CONTEXT (context);
12732 DECL_INITIAL (decl) = value;
12733 TREE_READONLY (decl) = 1;
12735 if (context && context == current_class_type)
12737 pushdecl_class_level (decl);
12738 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12739 on the TYPE_FIELDS list for `S'. (That's so that you can say
12740 things like `S::i' later.) */
12741 finish_member_declaration (decl);
12746 GNU_xref_decl (current_function_decl, decl);
12749 if (! processing_template_decl)
12751 /* Set basis for default for next value. */
12752 enum_next_value = build_binary_op_nodefault (PLUS_EXPR, value,
12753 integer_one_node, PLUS_EXPR);
12754 enum_overflow = tree_int_cst_lt (enum_next_value, value);
12757 result = saveable_tree_cons (name, decl, NULL_TREE);
12762 static int function_depth;
12764 /* Create the FUNCTION_DECL for a function definition.
12765 DECLSPECS and DECLARATOR are the parts of the declaration;
12766 they describe the function's name and the type it returns,
12767 but twisted together in a fashion that parallels the syntax of C.
12769 If PRE_PARSED_P is non-zero then DECLARATOR is really the DECL for
12770 the function we are about to process; DECLSPECS are ignored. For
12771 example, we set PRE_PARSED_P when processing the definition of
12772 inline function that was defined in-class; the definition is
12773 actually processed when the class is complete. In this case,
12774 PRE_PARSED_P is 2. We also set PRE_PARSED_P when instanting the
12775 body of a template function, and when constructing thunk functions
12776 and such; in these cases PRE_PARSED_P is 1.
12778 This function creates a binding context for the function body
12779 as well as setting up the FUNCTION_DECL in current_function_decl.
12781 Returns 1 on success. If the DECLARATOR is not suitable for a function
12782 (it defines a datum instead), we return 0, which tells
12783 yyparse to report a parse error.
12785 For C++, we must first check whether that datum makes any sense.
12786 For example, "class A local_a(1,2);" means that variable local_a
12787 is an aggregate of type A, which should have a constructor
12788 applied to it with the argument list [1, 2].
12790 @@ There is currently no way to retrieve the storage
12791 @@ allocated to FUNCTION (or all of its parms) if we return
12792 @@ something we had previously. */
12795 start_function (declspecs, declarator, attrs, pre_parsed_p)
12796 tree declspecs, declarator, attrs;
12800 tree ctype = NULL_TREE;
12803 extern int have_extern_spec;
12804 extern int used_extern_spec;
12805 int doing_friend = 0;
12807 /* Sanity check. */
12808 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
12809 my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
12811 /* Assume, until we see it does. */
12812 current_function_returns_value = 0;
12813 current_function_returns_null = 0;
12815 shadowed_labels = 0;
12816 current_function_assigns_this = 0;
12817 current_function_just_assigned_this = 0;
12818 current_function_parms_stored = 0;
12819 original_result_rtx = NULL_RTX;
12820 base_init_expr = NULL_TREE;
12821 current_base_init_list = NULL_TREE;
12822 current_member_init_list = NULL_TREE;
12823 ctor_label = dtor_label = NULL_TREE;
12824 static_labelno = 0;
12826 clear_temp_name ();
12828 /* This should only be done once on the top most decl. */
12829 if (have_extern_spec && !used_extern_spec)
12831 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
12832 used_extern_spec = 1;
12837 decl1 = declarator;
12840 /* What was this testing for, exactly? */
12841 if (! DECL_ARGUMENTS (decl1)
12842 && !DECL_STATIC_FUNCTION_P (decl1)
12843 && !DECL_ARTIFICIAL (decl1)
12844 && DECL_CLASS_SCOPE_P (decl1)
12845 && TYPE_IDENTIFIER (DECL_CONTEXT (decl1))
12846 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (DECL_CONTEXT (decl1))))
12848 tree binding = binding_for_name (DECL_NAME (decl1),
12849 current_namespace);
12850 cp_error ("redeclaration of `%#D'", decl1);
12851 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1)))
12852 cp_error_at ("previous declaration here", IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1)));
12853 else if (BINDING_VALUE (binding))
12854 cp_error_at ("previous declaration here", BINDING_VALUE (binding));
12858 fntype = TREE_TYPE (decl1);
12859 if (TREE_CODE (fntype) == METHOD_TYPE)
12860 ctype = TYPE_METHOD_BASETYPE (fntype);
12862 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12863 class is in the (lexical) scope of the class in which it is
12865 if (!ctype && DECL_FRIEND_P (decl1))
12867 ctype = DECL_CLASS_CONTEXT (decl1);
12869 /* CTYPE could be null here if we're dealing with a template;
12870 for example, `inline friend float foo()' inside a template
12871 will have no CTYPE set. */
12872 if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
12878 last_function_parms = DECL_ARGUMENTS (decl1);
12879 last_function_parm_tags = NULL_TREE;
12883 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE);
12884 /* If the declarator is not suitable for a function definition,
12885 cause a syntax error. */
12886 if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0;
12888 fntype = TREE_TYPE (decl1);
12890 restype = TREE_TYPE (fntype);
12891 if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
12893 cp_error ("semicolon missing after declaration of `%#T'", restype);
12894 shadow_tag (build_expr_list (NULL_TREE, restype));
12895 CLASSTYPE_GOT_SEMICOLON (restype) = 1;
12896 if (TREE_CODE (fntype) == FUNCTION_TYPE)
12897 fntype = build_function_type (integer_type_node,
12898 TYPE_ARG_TYPES (fntype));
12900 fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
12902 TYPE_ARG_TYPES (fntype));
12903 TREE_TYPE (decl1) = fntype;
12906 if (TREE_CODE (fntype) == METHOD_TYPE)
12907 ctype = TYPE_METHOD_BASETYPE (fntype);
12908 else if (DECL_MAIN_P (decl1))
12910 /* If this doesn't return integer_type, complain. */
12911 if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
12913 if (pedantic || warn_return_type)
12914 pedwarn ("return type for `main' changed to `int'");
12915 TREE_TYPE (decl1) = fntype = default_function_type;
12920 /* Warn if function was previously implicitly declared
12921 (but not if we warned then). */
12922 if (! warn_implicit
12923 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
12924 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
12926 announce_function (decl1);
12928 /* Set up current_class_type, and enter the scope of the class, if
12931 push_nested_class (ctype, 1);
12932 else if (DECL_STATIC_FUNCTION_P (decl1))
12933 push_nested_class (DECL_CONTEXT (decl1), 2);
12935 /* Now that we have entered the scope of the class, we must restore
12936 the bindings for any template parameters surrounding DECL1, if it
12937 is an inline member template. (Order is important; consider the
12938 case where a template parameter has the same name as a field of
12939 the class.) It is not until after this point that
12940 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12941 if (pre_parsed_p == 2)
12942 maybe_begin_member_template_processing (decl1);
12944 /* We are now in the scope of the function being defined. */
12945 current_function_decl = decl1;
12947 /* Save the parm names or decls from this function's declarator
12948 where store_parm_decls will find them. */
12949 current_function_parms = last_function_parms;
12950 current_function_parm_tags = last_function_parm_tags;
12952 if (! processing_template_decl)
12954 /* In a function definition, arg types must be complete. */
12955 require_complete_types_for_parms (current_function_parms);
12957 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype))) == NULL_TREE)
12959 cp_error ("return-type `%#T' is an incomplete type",
12960 TREE_TYPE (fntype));
12962 /* Make it return void instead, but don't change the
12963 type of the DECL_RESULT, in case we have a named return value. */
12966 = build_cplus_method_type (build_type_variant (ctype,
12967 TREE_READONLY (decl1),
12968 TREE_SIDE_EFFECTS (decl1)),
12970 FUNCTION_ARG_CHAIN (decl1));
12973 = build_function_type (void_type_node,
12974 TYPE_ARG_TYPES (TREE_TYPE (decl1)));
12975 DECL_RESULT (decl1)
12976 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype)));
12977 TREE_READONLY (DECL_RESULT (decl1))
12978 = CP_TYPE_CONST_P (TREE_TYPE (fntype));
12979 TREE_THIS_VOLATILE (DECL_RESULT (decl1))
12980 = CP_TYPE_VOLATILE_P (TREE_TYPE (fntype));
12983 if (TYPE_LANG_SPECIFIC (TREE_TYPE (fntype))
12984 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (fntype)))
12985 abstract_virtuals_error (decl1, TREE_TYPE (fntype));
12988 /* Effective C++ rule 15. See also c_expand_return. */
12990 && DECL_NAME (decl1) == ansi_opname[(int) MODIFY_EXPR]
12991 && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
12992 cp_warning ("`operator=' should return a reference to `*this'");
12994 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12995 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12996 DECL_INITIAL (decl1) = error_mark_node;
12998 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12999 SET_DEFAULT_DECL_ATTRIBUTES (decl1, attrs);
13002 /* This function exists in static storage.
13003 (This does not mean `static' in the C sense!) */
13004 TREE_STATIC (decl1) = 1;
13006 /* We must call push_template_decl after current_class_type is set
13007 up. (If we are processing inline definitions after exiting a
13008 class scope, current_class_type will be NULL_TREE until set above
13009 by push_nested_class.) */
13010 if (processing_template_decl)
13011 decl1 = push_template_decl (decl1);
13013 /* Record the decl so that the function name is defined.
13014 If we already have a decl for this name, and it is a FUNCTION_DECL,
13015 use the old decl. */
13016 if (!processing_template_decl && pre_parsed_p == 0)
13018 /* A specialization is not used to guide overload resolution. */
13019 if ((flag_guiding_decls
13020 || !DECL_TEMPLATE_SPECIALIZATION (decl1))
13021 && ! DECL_FUNCTION_MEMBER_P (decl1))
13022 decl1 = pushdecl (decl1);
13025 /* We need to set the DECL_CONTEXT. */
13026 if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
13027 DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
13028 /* And make sure we have enough default args. */
13029 check_default_args (decl1);
13031 DECL_MAIN_VARIANT (decl1) = decl1;
13032 fntype = TREE_TYPE (decl1);
13035 current_function_decl = decl1;
13037 if (DECL_INTERFACE_KNOWN (decl1))
13039 tree ctx = hack_decl_function_context (decl1);
13041 if (DECL_NOT_REALLY_EXTERN (decl1))
13042 DECL_EXTERNAL (decl1) = 0;
13044 if (ctx != NULL_TREE && DECL_THIS_INLINE (ctx)
13045 && TREE_PUBLIC (ctx))
13046 /* This is a function in a local class in an extern inline
13048 comdat_linkage (decl1);
13050 /* If this function belongs to an interface, it is public.
13051 If it belongs to someone else's interface, it is also external.
13052 This only affects inlines and template instantiations. */
13053 else if (interface_unknown == 0
13054 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13055 || flag_alt_external_templates))
13057 if (DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1)
13058 || processing_template_decl)
13060 DECL_EXTERNAL (decl1)
13062 || (DECL_THIS_INLINE (decl1) && ! flag_implement_inlines));
13064 /* For WIN32 we also want to put these in linkonce sections. */
13065 maybe_make_one_only (decl1);
13068 DECL_EXTERNAL (decl1) = 0;
13069 DECL_NOT_REALLY_EXTERN (decl1) = 0;
13070 DECL_INTERFACE_KNOWN (decl1) = 1;
13074 /* This is a definition, not a reference.
13075 So clear DECL_EXTERNAL. */
13076 DECL_EXTERNAL (decl1) = 0;
13078 if ((DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1))
13079 && ! DECL_INTERFACE_KNOWN (decl1)
13080 /* Don't try to defer nested functions for now. */
13081 && ! hack_decl_function_context (decl1))
13082 DECL_DEFER_OUTPUT (decl1) = 1;
13084 DECL_INTERFACE_KNOWN (decl1) = 1;
13087 if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1))
13089 if (TREE_CODE (fntype) == METHOD_TYPE)
13090 TREE_TYPE (decl1) = fntype
13091 = build_function_type (TREE_TYPE (fntype),
13092 TREE_CHAIN (TYPE_ARG_TYPES (fntype)));
13093 current_function_parms = TREE_CHAIN (current_function_parms);
13094 DECL_ARGUMENTS (decl1) = current_function_parms;
13097 restype = TREE_TYPE (fntype);
13101 /* If we're compiling a friend function, neither of the variables
13102 current_class_ptr nor current_class_type will have values. */
13103 if (! doing_friend)
13105 /* We know that this was set up by `grokclassfn'.
13106 We do not wait until `store_parm_decls', since evil
13107 parse errors may never get us to that point. Here
13108 we keep the consistency between `current_class_type'
13109 and `current_class_ptr'. */
13110 tree t = current_function_parms;
13112 my_friendly_assert (t != NULL_TREE
13113 && TREE_CODE (t) == PARM_DECL, 162);
13115 if (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE)
13119 if (! hack_decl_function_context (decl1))
13120 temporary_allocation ();
13121 i = suspend_momentary ();
13123 /* Normally, build_indirect_ref returns
13124 current_class_ref whenever current_class_ptr is
13125 dereferenced. This time, however, we want it to
13126 *create* current_class_ref, so we temporarily clear
13127 current_class_ptr to fool it. */
13128 current_class_ptr = NULL_TREE;
13129 current_class_ref = build_indirect_ref (t, NULL_PTR);
13130 current_class_ptr = t;
13132 resume_momentary (i);
13133 if (! hack_decl_function_context (decl1))
13134 end_temporary_allocation ();
13137 /* We're having a signature pointer here. */
13138 current_class_ref = current_class_ptr = t;
13143 current_class_ptr = current_class_ref = NULL_TREE;
13146 current_binding_level->parm_flag = 1;
13148 GNU_xref_function (decl1, current_function_parms);
13151 cplus_decl_attributes (decl1, NULL_TREE, attrs);
13153 make_function_rtl (decl1);
13155 /* Promote the value to int before returning it. */
13156 if (C_PROMOTING_INTEGER_TYPE_P (restype))
13157 restype = type_promotes_to (restype);
13159 /* If this fcn was already referenced via a block-scope `extern' decl
13160 (or an implicit decl), propagate certain information about the usage. */
13161 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1)))
13162 TREE_ADDRESSABLE (decl1) = 1;
13164 if (DECL_RESULT (decl1) == NULL_TREE)
13166 DECL_RESULT (decl1)
13167 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13168 TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype);
13169 TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype);
13172 /* Allocate further tree nodes temporarily during compilation
13173 of this function only. Tiemann moved up here from bottom of fn. */
13174 /* If this is a nested function, then we must continue to allocate RTL
13175 on the permanent obstack in case we need to inline it later. */
13176 if (! hack_decl_function_context (decl1))
13177 temporary_allocation ();
13179 if (processing_template_decl)
13181 ++minimal_parse_mode;
13182 last_tree = DECL_SAVED_TREE (decl1)
13183 = build_nt (EXPR_STMT, void_zero_node);
13188 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1))
13189 && DECL_LANGUAGE (decl1) == lang_cplusplus)
13191 dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13192 ctor_label = NULL_TREE;
13196 dtor_label = NULL_TREE;
13197 if (DECL_CONSTRUCTOR_P (decl1))
13198 ctor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13204 /* Called after store_parm_decls for a function-try-block. We need to update
13205 last_parm_cleanup_insn so that the base initializers for a constructor
13206 are run within this block, not before it. */
13209 expand_start_early_try_stmts ()
13211 expand_start_try_stmts ();
13212 last_parm_cleanup_insn = get_last_insn ();
13215 /* Store the parameter declarations into the current function declaration.
13216 This is called after parsing the parameter declarations, before
13217 digesting the body of the function.
13219 Also install to binding contour return value identifier, if any. */
13222 store_parm_decls ()
13224 register tree fndecl = current_function_decl;
13225 register tree parm;
13226 int parms_have_cleanups = 0;
13227 tree cleanups = NULL_TREE;
13229 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13230 tree specparms = current_function_parms;
13232 /* This is a list of types declared among parms in a prototype. */
13233 tree parmtags = current_function_parm_tags;
13235 /* This is a chain of any other decls that came in among the parm
13236 declarations. If a parm is declared with enum {foo, bar} x;
13237 then CONST_DECLs for foo and bar are put here. */
13238 tree nonparms = NULL_TREE;
13240 if (toplevel_bindings_p ())
13241 fatal ("parse errors have confused me too much");
13243 /* Initialize RTL machinery. */
13244 init_function_start (fndecl, input_filename, lineno);
13246 /* Create a binding level for the parms. */
13247 expand_start_bindings (0);
13249 if (specparms != NULL_TREE)
13251 /* This case is when the function was defined with an ANSI prototype.
13252 The parms already have decls, so we need not do anything here
13253 except record them as in effect
13254 and complain if any redundant old-style parm decls were written. */
13256 register tree next;
13258 /* Must clear this because it might contain TYPE_DECLs declared
13260 storedecls (NULL_TREE);
13262 for (parm = nreverse (specparms); parm; parm = next)
13264 next = TREE_CHAIN (parm);
13265 if (TREE_CODE (parm) == PARM_DECL)
13268 if (DECL_NAME (parm) == NULL_TREE)
13272 else if (TREE_CODE (TREE_TYPE (parm)) == VOID_TYPE)
13273 cp_error ("parameter `%D' declared void", parm);
13276 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
13277 A parameter is assumed not to have any side effects.
13278 If this should change for any reason, then this
13279 will have to wrap the bashed reference type in a save_expr.
13281 Also, if the parameter type is declared to be an X
13282 and there is an X(X&) constructor, we cannot lay it
13283 into the stack (any more), so we make this parameter
13284 look like it is really of reference type. Functions
13285 which pass parameters to this function will know to
13286 create a temporary in their frame, and pass a reference
13289 if (TREE_CODE (TREE_TYPE (parm)) == REFERENCE_TYPE
13290 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm))))
13291 SET_DECL_REFERENCE_SLOT (parm, convert_from_reference (parm));
13295 if (! processing_template_decl
13296 && (cleanup = maybe_build_cleanup (parm), cleanup))
13298 expand_decl (parm);
13299 parms_have_cleanups = 1;
13301 /* Keep track of the cleanups. */
13302 cleanups = tree_cons (parm, cleanup, cleanups);
13307 /* If we find an enum constant or a type tag,
13308 put it aside for the moment. */
13309 TREE_CHAIN (parm) = NULL_TREE;
13310 nonparms = chainon (nonparms, parm);
13314 /* Get the decls in their original chain order
13315 and record in the function. This is all and only the
13316 PARM_DECLs that were pushed into scope by the loop above. */
13317 DECL_ARGUMENTS (fndecl) = getdecls ();
13319 storetags (chainon (parmtags, gettags ()));
13322 DECL_ARGUMENTS (fndecl) = NULL_TREE;
13324 /* Now store the final chain of decls for the arguments
13325 as the decl-chain of the current lexical scope.
13326 Put the enumerators in as well, at the front so that
13327 DECL_ARGUMENTS is not modified. */
13329 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13331 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
13332 declare_function_name ();
13334 /* Initialize the RTL code for the function. */
13335 DECL_SAVED_INSNS (fndecl) = NULL_RTX;
13336 if (! processing_template_decl)
13337 expand_function_start (fndecl, parms_have_cleanups);
13339 current_function_parms_stored = 1;
13341 /* If this function is `main', emit a call to `__main'
13342 to run global initializers, etc. */
13343 if (DECL_MAIN_P (fndecl))
13344 expand_main_function ();
13346 /* Now that we have initialized the parms, we can start their
13347 cleanups. We cannot do this before, since expand_decl_cleanup
13348 should not be called before the parm can be used. */
13350 && ! processing_template_decl)
13352 for (cleanups = nreverse (cleanups); cleanups; cleanups = TREE_CHAIN (cleanups))
13354 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups), TREE_VALUE (cleanups)))
13355 cp_error ("parser lost in parsing declaration of `%D'",
13356 TREE_PURPOSE (cleanups));
13360 /* Create a binding contour which can be used to catch
13361 cleanup-generated temporaries. Also, if the return value needs or
13362 has initialization, deal with that now. */
13363 if (parms_have_cleanups)
13366 expand_start_bindings (0);
13369 if (! processing_template_decl && flag_exceptions)
13371 /* Do the starting of the exception specifications, if we have any. */
13372 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13373 expand_start_eh_spec ();
13376 last_parm_cleanup_insn = get_last_insn ();
13377 last_dtor_insn = get_last_insn ();
13380 /* Bind a name and initialization to the return value of
13381 the current function. */
13384 store_return_init (return_id, init)
13385 tree return_id, init;
13387 tree decl = DECL_RESULT (current_function_decl);
13390 /* Give this error as many times as there are occurrences,
13391 so that users can use Emacs compilation buffers to find
13392 and fix all such places. */
13393 pedwarn ("ANSI C++ does not permit named return values");
13395 if (return_id != NULL_TREE)
13397 if (DECL_NAME (decl) == NULL_TREE)
13399 DECL_NAME (decl) = return_id;
13400 DECL_ASSEMBLER_NAME (decl) = return_id;
13403 cp_error ("return identifier `%D' already in place", decl);
13406 /* Can't let this happen for constructors. */
13407 if (DECL_CONSTRUCTOR_P (current_function_decl))
13409 error ("can't redefine default return value for constructors");
13413 /* If we have a named return value, put that in our scope as well. */
13414 if (DECL_NAME (decl) != NULL_TREE)
13416 /* If this named return value comes in a register,
13417 put it in a pseudo-register. */
13418 if (DECL_REGISTER (decl))
13420 original_result_rtx = DECL_RTL (decl);
13421 DECL_RTL (decl) = gen_reg_rtx (DECL_MODE (decl));
13424 /* Let `cp_finish_decl' know that this initializer is ok. */
13425 DECL_INITIAL (decl) = init;
13428 if (minimal_parse_mode)
13429 add_tree (build_min_nt (RETURN_INIT, return_id,
13430 copy_to_permanent (init)));
13432 cp_finish_decl (decl, init, NULL_TREE, 0, 0);
13437 /* Finish up a function declaration and compile that function
13438 all the way to assembler language output. The free the storage
13439 for the function definition.
13441 This is called after parsing the body of the function definition.
13442 LINENO is the current line number.
13444 FLAGS is a bitwise or of the following values:
13446 An extra call to poplevel (and expand_end_bindings) must be
13447 made to take care of the binding contour for the base
13448 initializers. This is only relevant for constructors.
13450 We just finished processing the body of an in-class inline
13451 function definition. (This processing will have taken place
13452 after the class definition is complete.)
13454 NESTED is nonzero if we were in the middle of compiling another function
13455 when we started on this one. */
13458 finish_function (lineno, flags, nested)
13463 register tree fndecl = current_function_decl;
13464 tree fntype, ctype = NULL_TREE;
13465 rtx last_parm_insn, insns;
13466 /* Label to use if this function is supposed to return a value. */
13467 tree no_return_label = NULL_TREE;
13468 tree decls = NULL_TREE;
13469 int call_poplevel = (flags & 1) != 0;
13470 int inclass_inline = (flags & 2) != 0;
13473 /* When we get some parse errors, we can end up without a
13474 current_function_decl, so cope. */
13475 if (fndecl == NULL_TREE)
13478 if (! nested && function_depth > 1)
13481 fntype = TREE_TYPE (fndecl);
13483 /* TREE_READONLY (fndecl) = 1;
13484 This caused &foo to be of type ptr-to-const-function
13485 which then got a warning when stored in a ptr-to-function variable. */
13487 /* This happens on strange parse errors. */
13488 if (! current_function_parms_stored)
13491 store_parm_decls ();
13494 if (processing_template_decl)
13496 if (DECL_CONSTRUCTOR_P (fndecl) && call_poplevel)
13498 decls = getdecls ();
13499 expand_end_bindings (decls, decls != NULL_TREE, 0);
13500 poplevel (decls != NULL_TREE, 0, 0);
13505 if (write_symbols != NO_DEBUG /*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13507 tree ttype = target_type (fntype);
13510 if (IS_AGGR_TYPE (ttype))
13511 /* Let debugger know it should output info for this type. */
13512 note_debug_info_needed (ttype);
13514 for (parmdecl = DECL_ARGUMENTS (fndecl); parmdecl; parmdecl = TREE_CHAIN (parmdecl))
13516 ttype = target_type (TREE_TYPE (parmdecl));
13517 if (IS_AGGR_TYPE (ttype))
13518 /* Let debugger know it should output info for this type. */
13519 note_debug_info_needed (ttype);
13523 /* Clean house because we will need to reorder insns here. */
13524 do_pending_stack_adjust ();
13528 tree binfo = TYPE_BINFO (current_class_type);
13529 tree cond = integer_one_node;
13531 tree in_charge_node = lookup_name (in_charge_identifier, 0);
13533 int ok_to_optimize_dtor = 0;
13534 int empty_dtor = get_last_insn () == last_dtor_insn;
13536 if (current_function_assigns_this)
13537 cond = build (NE_EXPR, boolean_type_node,
13538 current_class_ptr, integer_zero_node);
13541 int n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
13543 /* If this destructor is empty, then we don't need to check
13544 whether `this' is NULL in some cases. */
13545 if ((flag_this_is_variable & 1) == 0)
13546 ok_to_optimize_dtor = 1;
13547 else if (empty_dtor)
13548 ok_to_optimize_dtor
13549 = (n_baseclasses == 0
13550 || (n_baseclasses == 1
13551 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type, 0))));
13554 /* These initializations might go inline. Protect
13555 the binding level of the parms. */
13557 expand_start_bindings (0);
13559 if (current_function_assigns_this)
13561 current_function_assigns_this = 0;
13562 current_function_just_assigned_this = 0;
13565 /* Generate the code to call destructor on base class.
13566 If this destructor belongs to a class with virtual
13567 functions, then set the virtual function table
13568 pointer to represent the type of our base class. */
13570 /* This side-effect makes call to `build_delete' generate the
13571 code we have to have at the end of this destructor.
13572 `build_delete' will set the flag again. */
13573 TYPE_HAS_DESTRUCTOR (current_class_type) = 0;
13575 /* These are two cases where we cannot delegate deletion. */
13576 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)
13577 || TYPE_GETS_REG_DELETE (current_class_type))
13578 exprstmt = build_delete (current_class_type, current_class_ref, integer_zero_node,
13579 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL, 0);
13581 exprstmt = build_delete (current_class_type, current_class_ref, in_charge_node,
13582 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL, 0);
13584 /* If we did not assign to this, then `this' is non-zero at
13585 the end of a destructor. As a special optimization, don't
13586 emit test if this is an empty destructor. If it does nothing,
13587 it does nothing. If it calls a base destructor, the base
13588 destructor will perform the test. */
13590 if (exprstmt != error_mark_node
13591 && (TREE_CODE (exprstmt) != NOP_EXPR
13592 || TREE_OPERAND (exprstmt, 0) != integer_zero_node
13593 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)))
13595 expand_label (dtor_label);
13596 if (cond != integer_one_node)
13597 expand_start_cond (cond, 0);
13598 if (exprstmt != void_zero_node)
13599 /* Don't call `expand_expr_stmt' if we're not going to do
13600 anything, since -Wall will give a diagnostic. */
13601 expand_expr_stmt (exprstmt);
13603 /* Run destructor on all virtual baseclasses. */
13604 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13606 tree vbases = nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type)));
13607 expand_start_cond (build (BIT_AND_EXPR, integer_type_node,
13608 in_charge_node, integer_two_node), 0);
13611 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases)))
13613 tree vb = get_vbase
13614 (BINFO_TYPE (vbases),
13615 TYPE_BINFO (current_class_type));
13617 (build_scoped_method_call
13618 (current_class_ref, vb, dtor_identifier,
13619 build_expr_list (NULL_TREE, integer_zero_node)));
13621 vbases = TREE_CHAIN (vbases);
13623 expand_end_cond ();
13626 do_pending_stack_adjust ();
13627 if (cond != integer_one_node)
13628 expand_end_cond ();
13631 virtual_size = c_sizeof (current_class_type);
13633 /* At the end, call delete if that's what's requested. */
13635 /* FDIS sez: At the point of definition of a virtual destructor
13636 (including an implicit definition), non-placement operator
13637 delete shall be looked up in the scope of the destructor's
13638 class and if found shall be accessible and unambiguous.
13640 This is somewhat unclear, but I take it to mean that if the
13641 class only defines placement deletes we don't do anything here.
13642 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13643 for us if they ever try to delete one of these. */
13645 if (TYPE_GETS_REG_DELETE (current_class_type)
13646 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13647 exprstmt = build_op_delete_call
13648 (DELETE_EXPR, current_class_ptr, virtual_size,
13649 LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
13651 exprstmt = NULL_TREE;
13655 cond = build (BIT_AND_EXPR, integer_type_node,
13656 in_charge_node, integer_one_node);
13657 expand_start_cond (cond, 0);
13658 expand_expr_stmt (exprstmt);
13659 expand_end_cond ();
13662 /* End of destructor. */
13663 expand_end_bindings (NULL_TREE, getdecls () != NULL_TREE, 0);
13664 poplevel (getdecls () != NULL_TREE, 0, 0);
13666 /* Back to the top of destructor. */
13667 /* Don't execute destructor code if `this' is NULL. */
13671 /* If the dtor is empty, and we know there is not possible way we
13672 could use any vtable entries, before they are possibly set by
13673 a base class dtor, we don't have to setup the vtables, as we
13674 know that any base class dtoring will set up any vtables it
13675 needs. We avoid MI, because one base class dtor can do a
13676 virtual dispatch to an overridden function that would need to
13677 have a non-related vtable set up, we cannot avoid setting up
13678 vtables in that case. We could change this to see if there is
13679 just one vtable. */
13680 if (! empty_dtor || TYPE_USES_COMPLEX_INHERITANCE (current_class_type))
13682 /* Make all virtual function table pointers in non-virtual base
13683 classes point to CURRENT_CLASS_TYPE's virtual function
13685 expand_direct_vtbls_init (binfo, binfo, 1, 0, current_class_ptr);
13687 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13688 expand_indirect_vtbls_init (binfo, current_class_ref, current_class_ptr);
13691 if (! ok_to_optimize_dtor)
13693 cond = build_binary_op (NE_EXPR,
13694 current_class_ptr, integer_zero_node, 1);
13695 expand_start_cond (cond, 0);
13698 insns = get_insns ();
13701 last_parm_insn = get_first_nonparm_insn ();
13702 if (last_parm_insn == NULL_RTX)
13703 last_parm_insn = get_last_insn ();
13705 last_parm_insn = previous_insn (last_parm_insn);
13707 emit_insns_after (insns, last_parm_insn);
13709 if (! ok_to_optimize_dtor)
13710 expand_end_cond ();
13712 else if (current_function_assigns_this)
13714 /* Does not need to call emit_base_init, because
13715 that is done (if needed) just after assignment to this
13718 if (DECL_CONSTRUCTOR_P (current_function_decl))
13720 end_protect_partials ();
13721 expand_label (ctor_label);
13722 ctor_label = NULL_TREE;
13726 decls = getdecls ();
13727 expand_end_bindings (decls, decls != NULL_TREE, 0);
13728 poplevel (decls != NULL_TREE, 0, 0);
13730 /* c_expand_return knows to return 'this' from a constructor. */
13731 c_expand_return (NULL_TREE);
13733 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl))) != VOID_TYPE
13734 && return_label != NULL_RTX)
13735 no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13737 current_function_assigns_this = 0;
13738 current_function_just_assigned_this = 0;
13739 base_init_expr = NULL_TREE;
13741 else if (DECL_CONSTRUCTOR_P (fndecl))
13743 tree cond = NULL_TREE, thenclause = NULL_TREE;
13744 /* Allow constructor for a type to get a new instance of the object
13745 using `build_new'. */
13746 tree abstract_virtuals = CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type);
13747 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type) = NULL_TREE;
13749 DECL_RETURNS_FIRST_ARG (fndecl) = 1;
13751 if (flag_this_is_variable > 0)
13753 cond = build_binary_op (EQ_EXPR,
13754 current_class_ptr, integer_zero_node, 1);
13755 thenclause = build_modify_expr (current_class_ptr, NOP_EXPR,
13756 build_new (NULL_TREE, current_class_type, void_type_node, 0));
13759 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type) = abstract_virtuals;
13763 if (flag_this_is_variable > 0)
13765 expand_start_cond (cond, 0);
13766 expand_expr_stmt (thenclause);
13767 expand_end_cond ();
13770 /* Emit insns from `emit_base_init' which sets up virtual
13771 function table pointer(s). */
13772 if (base_init_expr)
13774 expand_expr_stmt (base_init_expr);
13775 base_init_expr = NULL_TREE;
13778 insns = get_insns ();
13781 /* This is where the body of the constructor begins. */
13783 emit_insns_after (insns, last_parm_cleanup_insn);
13785 end_protect_partials ();
13787 /* This is where the body of the constructor ends. */
13788 expand_label (ctor_label);
13789 ctor_label = NULL_TREE;
13793 decls = getdecls ();
13794 expand_end_bindings (decls, decls != NULL_TREE, 0);
13795 poplevel (decls != NULL_TREE, 1, 0);
13798 /* c_expand_return knows to return 'this' from a constructor. */
13799 c_expand_return (NULL_TREE);
13801 current_function_assigns_this = 0;
13802 current_function_just_assigned_this = 0;
13804 else if (DECL_MAIN_P (fndecl))
13806 /* Make it so that `main' always returns 0 by default. */
13808 c_expand_return (integer_one_node);
13810 c_expand_return (integer_zero_node);
13813 else if (return_label != NULL_RTX
13814 && current_function_return_value == NULL_TREE
13815 && ! DECL_NAME (DECL_RESULT (current_function_decl)))
13816 no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13818 if (flag_exceptions)
13819 expand_exception_blocks ();
13821 /* If this function is supposed to return a value, ensure that
13822 we do not fall into the cleanups by mistake. The end of our
13823 function will look like this:
13825 user code (may have return stmt somewhere)
13826 goto no_return_label
13831 NOTE_INSN_FUNCTION_END
13835 If the user omits a return stmt in the USER CODE section, we
13836 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13837 Otherwise, we won't. */
13838 if (no_return_label)
13840 DECL_CONTEXT (no_return_label) = fndecl;
13841 DECL_INITIAL (no_return_label) = error_mark_node;
13842 DECL_SOURCE_FILE (no_return_label) = input_filename;
13843 DECL_SOURCE_LINE (no_return_label) = lineno;
13844 expand_goto (no_return_label);
13849 /* Remove the binding contour which is used
13850 to catch cleanup-generated temporaries. */
13851 expand_end_bindings (0, 0, 0);
13852 poplevel (0, 0, 0);
13854 /* Emit label at beginning of cleanup code for parameters. */
13855 emit_label (cleanup_label);
13858 /* Get return value into register if that's where it's supposed to be. */
13859 if (original_result_rtx)
13860 fixup_result_decl (DECL_RESULT (fndecl), original_result_rtx);
13862 /* Finish building code that will trigger warnings if users forget
13863 to make their functions return values. */
13864 if (no_return_label || cleanup_label)
13865 emit_jump (return_label);
13866 if (no_return_label)
13868 /* We don't need to call `expand_*_return' here because we
13869 don't need any cleanups here--this path of code is only
13870 for error checking purposes. */
13871 expand_label (no_return_label);
13874 /* Generate rtl for function exit. */
13875 expand_function_end (input_filename, lineno, 1);
13878 /* If we're processing a template, squirrel away the definition
13879 until we do an instantiation. */
13880 if (processing_template_decl)
13882 --minimal_parse_mode;
13883 DECL_SAVED_TREE (fndecl) = TREE_CHAIN (DECL_SAVED_TREE (fndecl));
13884 /* We have to save this value here in case
13885 maybe_end_member_template_processing decides to pop all the
13886 template parameters. */
13892 /* This must come after expand_function_end because cleanups might
13893 have declarations (from inline functions) that need to go into
13894 this function's blocks. */
13895 if (current_binding_level->parm_flag != 1)
13896 my_friendly_abort (122);
13897 poplevel (1, 0, 1);
13899 /* If this is a in-class inline definition, we may have to pop the
13900 bindings for the template parameters that we added in
13901 maybe_begin_member_template_processing when start_function was
13903 if (inclass_inline)
13904 maybe_end_member_template_processing ();
13906 /* Reset scope for C++: if we were in the scope of a class,
13907 then when we finish this function, we are not longer so.
13908 This cannot be done until we know for sure that no more
13909 class members will ever be referenced in this function
13910 (i.e., calls to destructors). */
13911 if (current_class_name)
13913 ctype = current_class_type;
13914 pop_nested_class (1);
13917 /* Must mark the RESULT_DECL as being in this function. */
13918 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
13920 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13921 to the FUNCTION_DECL node itself. */
13922 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
13926 int saved_flag_keep_inline_functions =
13927 flag_keep_inline_functions;
13929 /* So we can tell if jump_optimize sets it to 1. */
13932 if (DECL_CONTEXT (fndecl) != NULL_TREE
13933 && hack_decl_function_context (fndecl))
13934 /* Trick rest_of_compilation into not deferring output of this
13935 function, even if it is inline, since the rtl_obstack for
13936 this function is the function_obstack of the enclosing
13937 function and will be deallocated when the enclosing
13938 function is gone. See save_tree_status. */
13939 flag_keep_inline_functions = 1;
13941 /* Run the optimizers and output the assembler code for this
13944 if (DECL_ARTIFICIAL (fndecl))
13946 /* Do we really *want* to inline this synthesized method? */
13948 int save_fif = flag_inline_functions;
13949 flag_inline_functions = 1;
13951 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13952 will check our size. */
13953 DECL_INLINE (fndecl) = 0;
13955 rest_of_compilation (fndecl);
13956 flag_inline_functions = save_fif;
13959 rest_of_compilation (fndecl);
13961 flag_keep_inline_functions = saved_flag_keep_inline_functions;
13963 if (DECL_SAVED_INSNS (fndecl) && ! TREE_ASM_WRITTEN (fndecl))
13965 /* Set DECL_EXTERNAL so that assemble_external will be called as
13966 necessary. We'll clear it again in finish_file. */
13967 if (! DECL_EXTERNAL (fndecl))
13968 DECL_NOT_REALLY_EXTERN (fndecl) = 1;
13969 DECL_EXTERNAL (fndecl) = 1;
13970 mark_inline_for_output (fndecl);
13973 if (ctype && TREE_ASM_WRITTEN (fndecl))
13974 note_debug_info_needed (ctype);
13976 current_function_returns_null |= can_reach_end;
13978 /* Since we don't normally go through c_expand_return for constructors,
13979 this normally gets the wrong value.
13980 Also, named return values have their return codes emitted after
13981 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13982 if (DECL_CONSTRUCTOR_P (fndecl)
13983 || DECL_NAME (DECL_RESULT (fndecl)) != NULL_TREE)
13984 current_function_returns_null = 0;
13986 if (TREE_THIS_VOLATILE (fndecl) && current_function_returns_null)
13987 cp_warning ("`noreturn' function `%D' does return", fndecl);
13988 else if ((warn_return_type || pedantic)
13989 && current_function_returns_null
13990 && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE)
13992 /* If this function returns non-void and control can drop through,
13994 cp_warning ("control reaches end of non-void function `%D'", fndecl);
13996 /* With just -W, complain only if function returns both with
13997 and without a value. */
13998 else if (extra_warnings
13999 && current_function_returns_value && current_function_returns_null)
14000 warning ("this function may return with or without a value");
14005 /* Free all the tree nodes making up this function. */
14006 /* Switch back to allocating nodes permanently
14007 until we start another function. */
14009 permanent_allocation (1);
14011 if (DECL_SAVED_INSNS (fndecl) == NULL_RTX)
14015 /* Stop pointing to the local nodes about to be freed. */
14016 /* But DECL_INITIAL must remain nonzero so we know this
14017 was an actual function definition. */
14018 DECL_INITIAL (fndecl) = error_mark_node;
14019 for (t = DECL_ARGUMENTS (fndecl); t; t = TREE_CHAIN (t))
14020 DECL_RTL (t) = DECL_INCOMING_RTL (t) = NULL_RTX;
14023 if (DECL_STATIC_CONSTRUCTOR (fndecl))
14024 static_ctors = perm_tree_cons (NULL_TREE, fndecl, static_ctors);
14025 if (DECL_STATIC_DESTRUCTOR (fndecl))
14026 static_dtors = perm_tree_cons (NULL_TREE, fndecl, static_dtors);
14030 /* Let the error reporting routines know that we're outside a
14031 function. For a nested function, this value is used in
14032 pop_cp_function_context and then reset via pop_function_context. */
14033 current_function_decl = NULL_TREE;
14036 named_label_uses = NULL;
14037 current_class_ptr = NULL_TREE;
14038 current_class_ref = NULL_TREE;
14041 /* Create the FUNCTION_DECL for a function definition.
14042 DECLSPECS and DECLARATOR are the parts of the declaration;
14043 they describe the return type and the name of the function,
14044 but twisted together in a fashion that parallels the syntax of C.
14046 This function creates a binding context for the function body
14047 as well as setting up the FUNCTION_DECL in current_function_decl.
14049 Returns a FUNCTION_DECL on success.
14051 If the DECLARATOR is not suitable for a function (it defines a datum
14052 instead), we return 0, which tells yyparse to report a parse error.
14054 May return void_type_node indicating that this method is actually
14055 a friend. See grokfield for more details.
14057 Came here with a `.pushlevel' .
14059 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14060 CHANGES TO CODE IN `grokfield'. */
14063 start_method (declspecs, declarator, attrlist)
14064 tree declarator, declspecs, attrlist;
14066 tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
14069 /* Something too ugly to handle. */
14070 if (fndecl == NULL_TREE)
14073 /* Pass friends other than inline friend functions back. */
14074 if (fndecl == void_type_node)
14077 if (TREE_CODE (fndecl) != FUNCTION_DECL)
14078 /* Not a function, tell parser to report parse error. */
14081 if (IS_SIGNATURE (current_class_type))
14082 IS_DEFAULT_IMPLEMENTATION (fndecl) = 1;
14084 if (DECL_IN_AGGR_P (fndecl))
14086 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
14088 if (DECL_CONTEXT (fndecl)
14089 && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
14090 cp_error ("`%D' is already defined in class %s", fndecl,
14091 TYPE_NAME_STRING (DECL_CONTEXT (fndecl)));
14093 return void_type_node;
14096 check_template_shadow (fndecl);
14098 DECL_THIS_INLINE (fndecl) = 1;
14100 if (flag_default_inline)
14101 DECL_INLINE (fndecl) = 1;
14103 /* We process method specializations in finish_struct_1. */
14104 if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
14105 fndecl = push_template_decl (fndecl);
14107 /* We read in the parameters on the maybepermanent_obstack,
14108 but we won't be getting back to them until after we
14109 may have clobbered them. So the call to preserve_data
14110 will keep them safe. */
14113 if (! DECL_FRIEND_P (fndecl))
14115 if (TREE_CHAIN (fndecl))
14117 fndecl = copy_node (fndecl);
14118 TREE_CHAIN (fndecl) = NULL_TREE;
14121 if (DECL_CONSTRUCTOR_P (fndecl))
14123 if (! grok_ctor_properties (current_class_type, fndecl))
14124 return void_type_node;
14126 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl)))
14127 grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0);
14130 cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0, 0);
14132 /* Make a place for the parms */
14134 current_binding_level->parm_flag = 1;
14136 DECL_IN_AGGR_P (fndecl) = 1;
14140 /* Go through the motions of finishing a function definition.
14141 We don't compile this method until after the whole class has
14144 FINISH_METHOD must return something that looks as though it
14145 came from GROKFIELD (since we are defining a method, after all).
14147 This is called after parsing the body of the function definition.
14148 STMTS is the chain of statements that makes up the function body.
14150 DECL is the ..._DECL that `start_method' provided. */
14153 finish_method (decl)
14156 register tree fndecl = decl;
14159 register tree link;
14161 if (decl == void_type_node)
14164 old_initial = DECL_INITIAL (fndecl);
14166 /* Undo the level for the parms (from start_method).
14167 This is like poplevel, but it causes nothing to be
14168 saved. Saving information here confuses symbol-table
14169 output routines. Besides, this information will
14170 be correctly output when this method is actually
14173 /* Clear out the meanings of the local variables of this level;
14174 also record in each decl which block it belongs to. */
14176 for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14178 if (DECL_NAME (link) != NULL_TREE)
14179 pop_binding (DECL_NAME (link), link);
14180 my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14181 DECL_CONTEXT (link) = NULL_TREE;
14184 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
14185 (HOST_WIDE_INT) current_binding_level->level_chain,
14186 current_binding_level->parm_flag,
14187 current_binding_level->keep);
14189 poplevel (0, 0, 0);
14191 DECL_INITIAL (fndecl) = old_initial;
14193 /* We used to check if the context of FNDECL was different from
14194 current_class_type as another way to get inside here. This didn't work
14195 for String.cc in libg++. */
14196 if (DECL_FRIEND_P (fndecl))
14198 CLASSTYPE_INLINE_FRIENDS (current_class_type)
14199 = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14200 decl = void_type_node;
14206 /* Called when a new struct TYPE is defined.
14207 If this structure or union completes the type of any previous
14208 variable declaration, lay it out and output its rtl. */
14211 hack_incomplete_structures (type)
14216 if (current_binding_level->incomplete == NULL_TREE)
14219 if (!type) /* Don't do this for class templates. */
14222 for (list = ¤t_binding_level->incomplete; *list; )
14224 tree decl = TREE_VALUE (*list);
14225 if ((decl && TREE_TYPE (decl) == type)
14226 || (TREE_TYPE (decl)
14227 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14228 && TREE_TYPE (TREE_TYPE (decl)) == type))
14230 int toplevel = toplevel_bindings_p ();
14231 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14232 && TREE_TYPE (TREE_TYPE (decl)) == type)
14233 layout_type (TREE_TYPE (decl));
14234 layout_decl (decl, 0);
14235 rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0);
14239 expand_decl (decl);
14240 cleanup = maybe_build_cleanup (decl);
14241 expand_decl_init (decl);
14242 if (! expand_decl_cleanup (decl, cleanup))
14243 cp_error ("parser lost in parsing declaration of `%D'",
14246 *list = TREE_CHAIN (*list);
14249 list = &TREE_CHAIN (*list);
14253 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14254 See build_delete for information about AUTO_DELETE.
14256 Don't build these on the momentary obstack; they must live
14257 the life of the binding contour. */
14260 maybe_build_cleanup_1 (decl, auto_delete)
14261 tree decl, auto_delete;
14263 tree type = TREE_TYPE (decl);
14264 if (TYPE_NEEDS_DESTRUCTOR (type))
14266 int temp = 0, flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14269 if (TREE_CODE (decl) != PARM_DECL)
14270 temp = suspend_momentary ();
14272 if (TREE_CODE (type) == ARRAY_TYPE)
14276 mark_addressable (decl);
14277 rval = build_unary_op (ADDR_EXPR, decl, 0);
14280 /* Optimize for space over speed here. */
14281 if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14282 || flag_expensive_optimizations)
14283 flags |= LOOKUP_NONVIRTUAL;
14285 rval = build_delete (TREE_TYPE (rval), rval, auto_delete, flags, 0);
14287 if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14288 && ! TYPE_HAS_DESTRUCTOR (type))
14289 rval = build_compound_expr (expr_tree_cons (NULL_TREE, rval,
14290 build_expr_list (NULL_TREE, build_vbase_delete (type, decl))));
14292 if (TREE_CODE (decl) != PARM_DECL)
14293 resume_momentary (temp);
14300 /* If DECL is of a type which needs a cleanup, build that cleanup
14301 here. The cleanup does free the storage with a call to delete. */
14304 maybe_build_cleanup_and_delete (decl)
14307 return maybe_build_cleanup_1 (decl, integer_three_node);
14310 /* If DECL is of a type which needs a cleanup, build that cleanup
14311 here. The cleanup does not free the storage with a call a delete. */
14314 maybe_build_cleanup (decl)
14317 return maybe_build_cleanup_1 (decl, integer_two_node);
14320 /* Expand a C++ expression at the statement level.
14321 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14322 The C++ type checker should get all of these out when
14323 expressions are combined with other, type-providing, expressions,
14324 leaving only orphan expressions, such as:
14326 &class::bar; / / takes its address, but does nothing with it. */
14329 cplus_expand_expr_stmt (exp)
14332 if (processing_template_decl)
14334 add_tree (build_min_nt (EXPR_STMT, exp));
14338 /* Arrange for all temps to disappear. */
14339 expand_start_target_temps ();
14341 if (TREE_TYPE (exp) == unknown_type_node)
14343 if (TREE_CODE (exp) == COMPONENT_REF)
14344 error ("invalid reference to a member function name, did you forget the ()?");
14346 error ("address of overloaded function with no contextual type information");
14350 if (TREE_CODE (exp) == FUNCTION_DECL)
14352 cp_warning ("reference, not call, to function `%D'", exp);
14353 warning ("at this point in file");
14357 /* We should do this eventually, but right now this causes regex.o from
14358 libg++ to miscompile, and tString to core dump. */
14359 exp = build1 (CLEANUP_POINT_EXPR, TREE_TYPE (exp), exp);
14362 /* Strip unused implicit INDIRECT_REFs of references. */
14363 if (TREE_CODE (exp) == INDIRECT_REF
14364 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == REFERENCE_TYPE)
14365 exp = TREE_OPERAND (exp, 0);
14367 /* If we don't do this, we end up down inside expand_expr
14368 trying to do TYPE_MODE on the ERROR_MARK, and really
14369 go outside the bounds of the type. */
14370 if (exp != error_mark_node)
14371 expand_expr_stmt (break_out_cleanups (exp));
14374 /* Clean up any pending cleanups. This happens when a function call
14375 returns a cleanup-needing value that nobody uses. */
14376 expand_end_target_temps ();
14379 /* When a stmt has been parsed, this function is called.
14381 Currently, this function only does something within a
14382 constructor's scope: if a stmt has just assigned to this,
14383 and we are in a derived class, we call `emit_base_init'. */
14388 extern struct nesting *cond_stack, *loop_stack, *case_stack;
14391 if (current_function_assigns_this
14392 || ! current_function_just_assigned_this)
14394 if (DECL_CONSTRUCTOR_P (current_function_decl))
14396 /* Constructors must wait until we are out of control
14397 zones before calling base constructors. */
14398 if (cond_stack || loop_stack || case_stack)
14400 expand_expr_stmt (base_init_expr);
14401 check_base_init (current_class_type);
14403 current_function_assigns_this = 1;
14406 /* Change a static member function definition into a FUNCTION_TYPE, instead
14407 of the METHOD_TYPE that we create when it's originally parsed.
14409 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14410 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14411 other decls. Either pass the addresses of local variables or NULL. */
14414 revert_static_member_fn (decl, fn, argtypes)
14415 tree *decl, *fn, *argtypes;
14418 tree function = fn ? *fn : TREE_TYPE (*decl);
14419 tree args = argtypes ? *argtypes : TYPE_ARG_TYPES (function);
14421 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args)))
14422 != TYPE_UNQUALIFIED)
14423 cp_error ("static member function `%#D' declared with type qualifiers",
14426 args = TREE_CHAIN (args);
14427 tmp = build_function_type (TREE_TYPE (function), args);
14428 tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function));
14429 tmp = build_exception_variant (tmp,
14430 TYPE_RAISES_EXCEPTIONS (function));
14431 TREE_TYPE (*decl) = tmp;
14432 if (DECL_ARGUMENTS (*decl))
14433 DECL_ARGUMENTS (*decl) = TREE_CHAIN (DECL_ARGUMENTS (*decl));
14434 DECL_STATIC_FUNCTION_P (*decl) = 1;
14442 id_in_current_class (id)
14445 return !!purpose_member (id, class_binding_level->class_shadowed);
14453 int just_assigned_this;
14455 int temp_name_counter;
14457 struct named_label_list *named_label_uses;
14458 tree shadowed_labels;
14461 rtx last_dtor_insn;
14462 rtx last_parm_cleanup_insn;
14463 tree base_init_list;
14464 tree member_init_list;
14465 tree base_init_expr;
14466 tree current_class_ptr;
14467 tree current_class_ref;
14469 struct cp_function *next;
14470 struct binding_level *binding_level;
14471 int static_labelno;
14474 static struct cp_function *cp_function_chain;
14476 extern int temp_name_counter;
14478 /* Save and reinitialize the variables
14479 used during compilation of a C++ function. */
14482 push_cp_function_context (context)
14485 struct cp_function *p
14486 = (struct cp_function *) xmalloc (sizeof (struct cp_function));
14488 push_function_context_to (context);
14490 p->next = cp_function_chain;
14491 cp_function_chain = p;
14493 p->named_labels = named_labels;
14494 p->named_label_uses = named_label_uses;
14495 p->shadowed_labels = shadowed_labels;
14496 p->returns_value = current_function_returns_value;
14497 p->returns_null = current_function_returns_null;
14498 p->binding_level = current_binding_level;
14499 p->ctor_label = ctor_label;
14500 p->dtor_label = dtor_label;
14501 p->last_dtor_insn = last_dtor_insn;
14502 p->last_parm_cleanup_insn = last_parm_cleanup_insn;
14503 p->assigns_this = current_function_assigns_this;
14504 p->just_assigned_this = current_function_just_assigned_this;
14505 p->parms_stored = current_function_parms_stored;
14506 p->result_rtx = original_result_rtx;
14507 p->base_init_expr = base_init_expr;
14508 p->temp_name_counter = temp_name_counter;
14509 p->base_init_list = current_base_init_list;
14510 p->member_init_list = current_member_init_list;
14511 p->current_class_ptr = current_class_ptr;
14512 p->current_class_ref = current_class_ref;
14513 p->static_labelno = static_labelno;
14516 /* Restore the variables used during compilation of a C++ function. */
14519 pop_cp_function_context (context)
14522 struct cp_function *p = cp_function_chain;
14525 /* Bring back all the labels that were shadowed. */
14526 for (link = shadowed_labels; link; link = TREE_CHAIN (link))
14527 if (DECL_NAME (TREE_VALUE (link)) != 0)
14528 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link)),
14529 TREE_VALUE (link));
14531 pop_function_context_from (context);
14533 cp_function_chain = p->next;
14535 named_labels = p->named_labels;
14536 named_label_uses = p->named_label_uses;
14537 shadowed_labels = p->shadowed_labels;
14538 current_function_returns_value = p->returns_value;
14539 current_function_returns_null = p->returns_null;
14540 current_binding_level = p->binding_level;
14541 ctor_label = p->ctor_label;
14542 dtor_label = p->dtor_label;
14543 last_dtor_insn = p->last_dtor_insn;
14544 last_parm_cleanup_insn = p->last_parm_cleanup_insn;
14545 current_function_assigns_this = p->assigns_this;
14546 current_function_just_assigned_this = p->just_assigned_this;
14547 current_function_parms_stored = p->parms_stored;
14548 original_result_rtx = p->result_rtx;
14549 base_init_expr = p->base_init_expr;
14550 temp_name_counter = p->temp_name_counter;
14551 current_base_init_list = p->base_init_list;
14552 current_member_init_list = p->member_init_list;
14553 current_class_ptr = p->current_class_ptr;
14554 current_class_ref = p->current_class_ref;
14555 static_labelno = p->static_labelno;
14563 return function_depth != 0;