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 const 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, const char *, tree));
171 static void record_unknown_type PROTO((tree, const char *));
172 static int member_function_or_else PROTO((tree, tree, const char *));
173 static void bad_specifiers PROTO((tree, const 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 int add_binding PROTO((tree, tree));
182 static void pop_binding PROTO((tree, tree));
183 static tree local_variable_p PROTO((tree));
184 static tree find_binding PROTO((tree, tree));
185 static tree select_decl PROTO((tree, int));
186 static tree unqualified_namespace_lookup PROTO((tree, int));
187 static int lookup_flags PROTO((int, int));
188 static tree qualify_lookup PROTO((tree, int));
189 static tree record_builtin_java_type PROTO((const char *, int));
190 static const char *tag_name PROTO((enum tag_types code));
191 static void find_class_binding_level PROTO((void));
192 static struct binding_level *innermost_nonclass_level PROTO((void));
194 #if defined (DEBUG_CP_BINDING_LEVELS)
195 static void indent PROTO((void));
198 /* A node which has tree code ERROR_MARK, and whose type is itself.
199 All erroneous expressions are replaced with this node. All functions
200 that accept nodes as arguments should avoid generating error messages
201 if this node is one of the arguments, since it is undesirable to get
202 multiple error messages from one error in the input. */
204 tree error_mark_node;
206 /* Erroneous argument lists can use this *IFF* they do not modify it. */
207 tree error_mark_list;
209 /* INTEGER_TYPE and REAL_TYPE nodes for the standard data types */
211 tree short_integer_type_node;
212 tree integer_type_node;
213 tree long_integer_type_node;
214 tree long_long_integer_type_node;
216 tree short_unsigned_type_node;
217 tree unsigned_type_node;
218 tree long_unsigned_type_node;
219 tree long_long_unsigned_type_node;
221 tree ptrdiff_type_node;
223 tree unsigned_char_type_node;
224 tree signed_char_type_node;
226 tree wchar_type_node;
227 tree signed_wchar_type_node;
228 tree unsigned_wchar_type_node;
230 tree wchar_decl_node;
232 tree float_type_node;
233 tree double_type_node;
234 tree long_double_type_node;
236 tree complex_integer_type_node;
237 tree complex_float_type_node;
238 tree complex_double_type_node;
239 tree complex_long_double_type_node;
241 tree intQI_type_node;
242 tree intHI_type_node;
243 tree intSI_type_node;
244 tree intDI_type_node;
245 #if HOST_BITS_PER_WIDE_INT >= 64
246 tree intTI_type_node;
249 tree unsigned_intQI_type_node;
250 tree unsigned_intHI_type_node;
251 tree unsigned_intSI_type_node;
252 tree unsigned_intDI_type_node;
253 #if HOST_BITS_PER_WIDE_INT >= 64
254 tree unsigned_intTI_type_node;
257 tree java_byte_type_node;
258 tree java_short_type_node;
259 tree java_int_type_node;
260 tree java_long_type_node;
261 tree java_float_type_node;
262 tree java_double_type_node;
263 tree java_char_type_node;
264 tree java_boolean_type_node;
266 /* A VOID_TYPE node, and the same, packaged in a TREE_LIST. */
268 tree void_type_node, void_list_node;
271 /* Nodes for types `void *' and `const void *'. */
274 tree const_ptr_type_node;
276 /* Nodes for types `char *' and `const char *'. */
278 tree string_type_node, const_string_type_node;
280 /* Type `char[256]' or something like it.
281 Used when an array of char is needed and the size is irrelevant. */
283 tree char_array_type_node;
285 /* Type `int[256]' or something like it.
286 Used when an array of int needed and the size is irrelevant. */
288 tree int_array_type_node;
290 /* Type `wchar_t[256]' or something like it.
291 Used when a wide string literal is created. */
293 tree wchar_array_type_node;
295 /* The bool data type, and constants */
296 tree boolean_type_node, boolean_true_node, boolean_false_node;
298 /* Type `int ()' -- used for implicit declaration of functions. */
300 tree default_function_type;
302 /* Function types `double (double)' and `double (double, double)', etc. */
304 static tree double_ftype_double, double_ftype_double_double;
305 static tree int_ftype_int, long_ftype_long;
306 static tree float_ftype_float;
307 static tree ldouble_ftype_ldouble;
309 /* Function type `int (const void *, const void *, size_t)' */
310 static tree int_ftype_cptr_cptr_sizet;
313 tree vtable_entry_type;
314 tree delta_type_node;
316 /* Old rtti stuff. */
317 tree __baselist_desc_type_node;
318 tree __i_desc_type_node, __m_desc_type_node;
319 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
321 tree __t_desc_type_node;
323 tree __tp_desc_type_node;
325 tree __access_mode_type_node;
326 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
327 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
328 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
330 /* Not needed yet? May be needed one day? */
331 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
332 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
333 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
336 /* Indicates that there is a type value in some namespace, although
337 that is not necessarily in scope at the moment. */
339 static tree global_type_node;
341 tree class_star_type_node;
342 tree class_type_node, record_type_node, union_type_node, enum_type_node;
343 tree unknown_type_node;
344 tree opaque_type_node, signature_type_node;
345 tree sigtable_entry_type;
347 /* Array type `vtable_entry_type[]' */
349 tree vtbl_ptr_type_node;
355 /* Expect only namespace names now. */
356 static int only_namespace_names;
358 /* In a destructor, the point at which all derived class destroying
359 has been done, just before any base class destroying will be done. */
363 /* In a destructor, the last insn emitted after the start of the
364 function and the parms. */
366 static rtx last_dtor_insn;
368 /* In a constructor, the last insn emitted after the start of the
369 function and the parms, the exception specification and any
370 function-try-block. The constructor initializers are emitted after
373 static rtx last_parm_cleanup_insn;
375 /* In a constructor, the point at which we are ready to return
376 the pointer to the initialized object. */
380 /* A FUNCTION_DECL which can call `abort'. Not necessarily the
381 one that the user will declare, but sufficient to be called
382 by routines that want to abort the program. */
386 /* A FUNCTION_DECL for the default `::operator delete'. */
388 tree global_delete_fndecl;
390 extern rtx cleanup_label, return_label;
392 /* If original DECL_RESULT of current function was a register,
393 but due to being an addressable named return value, would up
394 on the stack, this variable holds the named return value's
395 original location. */
396 static rtx original_result_rtx;
398 /* Sequence of insns which represents base initialization. */
401 /* C++: Keep these around to reduce calls to `get_identifier'.
402 Identifiers for `this' in member functions and the auto-delete
403 parameter for destructors. */
404 tree this_identifier, in_charge_identifier;
405 tree ctor_identifier, dtor_identifier;
406 /* Used in pointer to member functions, in vtables, and in sigtables. */
407 tree pfn_identifier, index_identifier, delta_identifier, delta2_identifier;
408 tree pfn_or_delta2_identifier, tag_identifier;
409 tree vt_off_identifier;
411 struct named_label_list
413 struct binding_level *binding_level;
416 char *filename_o_goto;
418 struct named_label_list *next;
421 /* A list (chain of TREE_LIST nodes) of named label uses.
422 The TREE_PURPOSE field is the list of variables defined
423 in the label's scope defined at the point of use.
424 The TREE_VALUE field is the LABEL_DECL used.
425 The TREE_TYPE field holds `current_binding_level' at the
426 point of the label's use.
428 BWAHAHAAHAHahhahahahaah. No, no, no, said the little chicken.
430 Look at the pretty struct named_label_list. See the pretty struct
431 with the pretty named fields that describe what they do. See the
432 pretty lack of gratuitous casts. Notice the code got a lot cleaner.
434 Used only for jumps to as-yet undefined labels, since
435 jumps to defined labels can have their validity checked
438 static struct named_label_list *named_label_uses = NULL;
440 /* A list of objects which have constructors or destructors
441 which reside in the global scope. The decl is stored in
442 the TREE_VALUE slot and the initializer is stored
443 in the TREE_PURPOSE slot. */
444 tree static_aggregates;
448 /* Two expressions that are constants with value zero.
449 The first is of type `int', the second of type `void *'. */
451 tree integer_zero_node;
452 tree null_pointer_node;
454 /* The value for __null (NULL), namely, a zero of an integer type with
455 the same number of bits as a pointer. */
458 /* A node for the integer constants 1, 2, and 3. */
460 tree integer_one_node, integer_two_node, integer_three_node;
462 /* While defining an enum type, this is 1 plus the last enumerator
465 static tree enum_next_value;
467 /* Nonzero means that there was overflow computing enum_next_value. */
469 static int enum_overflow;
471 /* Parsing a function declarator leaves a list of parameter names
472 or a chain or parameter decls here. */
474 tree last_function_parms;
476 /* Parsing a function declarator leaves here a chain of structure
477 and enum types declared in the parmlist. */
479 static tree last_function_parm_tags;
481 /* After parsing the declarator that starts a function definition,
482 `start_function' puts here the list of parameter names or chain of decls.
483 `store_parm_decls' finds it here. */
485 static tree current_function_parms;
487 /* Similar, for last_function_parm_tags. */
488 static tree current_function_parm_tags;
490 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
491 that have names. Here so we can clear out their names' definitions
492 at the end of the function. */
494 static tree named_labels;
496 /* A list of LABEL_DECLs from outer contexts that are currently shadowed. */
498 static tree shadowed_labels;
500 /* The FUNCTION_DECL for the function currently being compiled,
501 or 0 if between functions. */
502 tree current_function_decl;
504 /* Set to 0 at beginning of a function definition, set to 1 if
505 a return statement that specifies a return value is seen. */
507 int current_function_returns_value;
509 /* Set to 0 at beginning of a function definition, set to 1 if
510 a return statement with no argument is seen. */
512 int current_function_returns_null;
514 /* Set to 0 at beginning of a function definition, and whenever
515 a label (case or named) is defined. Set to value of expression
516 returned from function when that value can be transformed into
517 a named return value. */
519 tree current_function_return_value;
521 /* Nonzero means give `double' the same size as `float'. */
523 extern int flag_short_double;
525 /* Nonzero means don't recognize any builtin functions. */
527 extern int flag_no_builtin;
529 /* Nonzero means don't recognize the non-ANSI builtin functions.
532 extern int flag_no_nonansi_builtin;
534 /* Nonzero means enable obscure ANSI features and disable GNU extensions
535 that might cause ANSI-compliant code to be miscompiled. */
537 extern int flag_ansi;
539 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
541 extern int flag_huge_objects;
543 /* Nonzero if we want to conserve space in the .o files. We do this
544 by putting uninitialized data and runtime initialized data into
545 .common instead of .data at the expense of not flagging multiple
547 extern int flag_conserve_space;
549 /* Pointers to the base and current top of the language name stack. */
551 extern tree *current_lang_base, *current_lang_stack;
553 /* C and C++ flags are in decl2.c. */
555 /* Set to 0 at beginning of a constructor, set to 1
556 if that function does an allocation before referencing its
557 instance variable. */
558 static int current_function_assigns_this;
559 int current_function_just_assigned_this;
561 /* Set to 0 at beginning of a function. Set non-zero when
562 store_parm_decls is called. Don't call store_parm_decls
563 if this flag is non-zero! */
564 int current_function_parms_stored;
566 /* Flag used when debugging spew.c */
568 extern int spew_debug;
570 /* This is a copy of the class_shadowed list of the previous class binding
571 contour when at global scope. It's used to reset IDENTIFIER_CLASS_VALUEs
572 when entering another class scope (i.e. a cache miss). */
573 extern tree previous_class_values;
575 /* A expression of value 0 with the same precision as a sizetype
577 tree signed_size_zero_node;
579 /* The name of the anonymous namespace, throughout this translation
581 tree anonymous_namespace_name;
584 /* Allocate a level of searching. */
588 push_decl_level (stack, obstack)
589 struct stack_level *stack;
590 struct obstack *obstack;
592 struct stack_level tem;
595 return push_stack_level (obstack, (char *)&tem, sizeof (tem));
598 /* For each binding contour we allocate a binding_level structure
599 which records the names defined in that contour.
602 1) one for each function definition,
603 where internal declarations of the parameters appear.
604 2) one for each compound statement,
605 to record its declarations.
607 The current meaning of a name can be found by searching the levels
608 from the current one out to the global one.
610 Off to the side, may be the class_binding_level. This exists only
611 to catch class-local declarations. It is otherwise nonexistent.
613 Also there may be binding levels that catch cleanups that must be
614 run when exceptions occur. Thus, to see whether a name is bound in
615 the current scope, it is not enough to look in the
616 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
619 /* Note that the information in the `names' component of the global contour
620 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
624 /* A chain of _DECL nodes for all variables, constants, functions,
625 and typedef types. These are in the reverse of the order
626 supplied. There may be OVERLOADs on this list, too, but they
627 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
630 /* A list of structure, union and enum definitions, for looking up
632 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
633 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
634 or ENUMERAL_TYPE node.
636 C++: the TREE_VALUE nodes can be simple types for
637 component_bindings. */
640 /* A list of USING_DECL nodes. */
643 /* A list of used namespaces. PURPOSE is the namespace,
644 VALUE the common ancestor with this binding_level's namespace. */
645 tree using_directives;
647 /* If this binding level is the binding level for a class, then
648 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
649 is the name of an entity bound in the class; the TREE_VALUE is
650 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
651 when leaving class scope, we can restore the
652 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
653 the DECL bound by this name in the class. */
656 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
657 is used for all binding levels. */
660 /* For each level (except not the global one),
661 a chain of BLOCK nodes for all the levels
662 that were entered and exited one level down. */
665 /* The BLOCK node for this level, if one has been preallocated.
666 If 0, the BLOCK is allocated (if needed) when the level is popped. */
669 /* The binding level which this one is contained in (inherits from). */
670 struct binding_level *level_chain;
672 /* List of decls in `names' that have incomplete
673 structure or union types. */
676 /* List of VAR_DECLS saved from a previous for statement.
677 These would be dead in ANSI-conforming code, but might
678 be referenced in ARM-era code. These are stored in a
679 TREE_LIST; the TREE_VALUE is the actual declaration. */
680 tree dead_vars_from_for;
682 /* 1 for the level that holds the parameters of a function.
683 2 for the level that holds a class declaration.
684 3 for levels that hold parameter declarations. */
685 unsigned parm_flag : 4;
687 /* 1 means make a BLOCK for this level regardless of all else.
688 2 for temporary binding contours created by the compiler. */
691 /* Nonzero if this level "doesn't exist" for tags. */
692 unsigned tag_transparent : 1;
694 /* Nonzero if this level can safely have additional
695 cleanup-needing variables added to it. */
696 unsigned more_cleanups_ok : 1;
697 unsigned have_cleanups : 1;
699 /* Nonzero if this level is for storing the decls for template
700 parameters and generic decls; these decls will be discarded and
701 replaced with a TEMPLATE_DECL. */
702 unsigned pseudo_global : 1;
704 /* This is set for a namespace binding level. */
705 unsigned namespace_p : 1;
707 /* True if this level is that of a for-statement where we need to
708 worry about ambiguous (ARM or ANSI) scope rules. */
709 unsigned is_for_scope : 1;
711 /* Two bits left for this word. */
713 #if defined(DEBUG_CP_BINDING_LEVELS)
714 /* Binding depth at which this level began. */
715 unsigned binding_depth;
716 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
719 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
721 /* The binding level currently in effect. */
723 static struct binding_level *current_binding_level;
725 /* The binding level of the current class, if any. */
727 static struct binding_level *class_binding_level;
729 /* A chain of binding_level structures awaiting reuse. */
731 static struct binding_level *free_binding_level;
733 /* The outermost binding level, for names of file scope.
734 This is created when the compiler is started and exists
735 through the entire run. */
737 static struct binding_level *global_binding_level;
739 /* Binding level structures are initialized by copying this one. */
741 static struct binding_level clear_binding_level;
743 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
745 static int keep_next_level_flag;
747 #if defined(DEBUG_CP_BINDING_LEVELS)
748 static int binding_depth = 0;
749 static int is_class_level = 0;
756 for (i = 0; i < binding_depth*2; i++)
759 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
761 static tree pushdecl_with_scope PROTO((tree, struct binding_level *));
764 push_binding_level (newlevel, tag_transparent, keep)
765 struct binding_level *newlevel;
766 int tag_transparent, keep;
768 /* Add this level to the front of the chain (stack) of levels that
770 *newlevel = clear_binding_level;
771 newlevel->level_chain = current_binding_level;
772 current_binding_level = newlevel;
773 newlevel->tag_transparent = tag_transparent;
774 newlevel->more_cleanups_ok = 1;
775 newlevel->keep = keep;
776 #if defined(DEBUG_CP_BINDING_LEVELS)
777 newlevel->binding_depth = binding_depth;
779 fprintf (stderr, "push %s level 0x%08x line %d\n",
780 (is_class_level) ? "class" : "block", newlevel, lineno);
783 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
786 /* Find the innermost enclosing class scope, and reset
787 CLASS_BINDING_LEVEL appropriately. */
790 find_class_binding_level ()
792 struct binding_level *level = current_binding_level;
794 while (level && level->parm_flag != 2)
795 level = level->level_chain;
796 if (level && level->parm_flag == 2)
797 class_binding_level = level;
799 class_binding_level = 0;
805 if (global_binding_level)
807 /* Cannot pop a level, if there are none left to pop. */
808 if (current_binding_level == global_binding_level)
809 my_friendly_abort (123);
811 /* Pop the current level, and free the structure for reuse. */
812 #if defined(DEBUG_CP_BINDING_LEVELS)
815 fprintf (stderr, "pop %s level 0x%08x line %d\n",
816 (is_class_level) ? "class" : "block",
817 current_binding_level, lineno);
818 if (is_class_level != (current_binding_level == class_binding_level))
821 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
824 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
826 register struct binding_level *level = current_binding_level;
827 current_binding_level = current_binding_level->level_chain;
828 level->level_chain = free_binding_level;
829 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
830 if (level->binding_depth != binding_depth)
832 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
833 free_binding_level = level;
834 find_class_binding_level ();
839 suspend_binding_level ()
841 if (class_binding_level)
842 current_binding_level = class_binding_level;
844 if (global_binding_level)
846 /* Cannot suspend a level, if there are none left to suspend. */
847 if (current_binding_level == global_binding_level)
848 my_friendly_abort (123);
850 /* Suspend the current level. */
851 #if defined(DEBUG_CP_BINDING_LEVELS)
854 fprintf (stderr, "suspend %s level 0x%08x line %d\n",
855 (is_class_level) ? "class" : "block",
856 current_binding_level, lineno);
857 if (is_class_level != (current_binding_level == class_binding_level))
860 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
863 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
864 current_binding_level = current_binding_level->level_chain;
865 find_class_binding_level ();
869 resume_binding_level (b)
870 struct binding_level *b;
872 /* Resuming binding levels is meant only for namespaces,
873 and those cannot nest into classes. */
874 my_friendly_assert(!class_binding_level, 386);
875 /* Also, resuming a non-directly nested namespace is a no-no. */
876 my_friendly_assert(b->level_chain == current_binding_level, 386);
877 current_binding_level = b;
878 #if defined(DEBUG_CP_BINDING_LEVELS)
879 b->binding_depth = binding_depth;
881 fprintf (stderr, "resume %s level 0x%08x line %d\n",
882 (is_class_level) ? "class" : "block", b, lineno);
885 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
888 /* Create a new `struct binding_level'. */
891 struct binding_level *
892 make_binding_level ()
895 return (struct binding_level *) xmalloc (sizeof (struct binding_level));
898 /* Nonzero if we are currently in the global binding level. */
903 return current_binding_level == global_binding_level;
906 /* Return the innermost binding level that is not for a class scope. */
908 static struct binding_level *
909 innermost_nonclass_level ()
911 struct binding_level *b;
913 b = current_binding_level;
914 while (b->parm_flag == 2)
920 /* Nonzero if we are currently in a toplevel binding level. This
921 means either the global binding level or a namespace in a toplevel
922 binding level. Since there are no non-toplevel namespace levels,
923 this really means any namespace or pseudo-global level. We also
924 include a class whose context is toplevel. */
927 toplevel_bindings_p ()
929 struct binding_level *b = innermost_nonclass_level ();
931 return b->namespace_p || b->pseudo_global;
934 /* Nonzero if this is a namespace scope, or if we are defining a class
935 which is itself at namespace scope, or whose enclosing class is
936 such a class, etc. */
939 namespace_bindings_p ()
941 struct binding_level *b = innermost_nonclass_level ();
943 return b->namespace_p;
949 keep_next_level_flag = 1;
952 /* Nonzero if the current level needs to have a BLOCK made. */
957 return (current_binding_level->blocks != NULL_TREE
958 || current_binding_level->keep
959 || current_binding_level->names != NULL_TREE
960 || (current_binding_level->tags != NULL_TREE
961 && !current_binding_level->tag_transparent));
964 /* Identify this binding level as a level of parameters. */
967 declare_parm_level ()
969 current_binding_level->parm_flag = 1;
973 declare_pseudo_global_level ()
975 current_binding_level->pseudo_global = 1;
979 declare_namespace_level ()
981 current_binding_level->namespace_p = 1;
985 pseudo_global_level_p ()
987 struct binding_level *b = innermost_nonclass_level ();
989 return b->pseudo_global;
993 set_class_shadows (shadows)
996 class_binding_level->class_shadowed = shadows;
999 /* Enter a new binding level.
1000 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
1001 not for that of tags. */
1004 pushlevel (tag_transparent)
1005 int tag_transparent;
1007 register struct binding_level *newlevel = NULL_BINDING_LEVEL;
1009 /* If this is the top level of a function,
1010 just make sure that NAMED_LABELS is 0.
1011 They should have been set to 0 at the end of the previous function. */
1013 if (current_binding_level == global_binding_level)
1014 my_friendly_assert (named_labels == NULL_TREE, 134);
1016 /* Reuse or create a struct for this binding level. */
1018 #if defined(DEBUG_CP_BINDING_LEVELS)
1020 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1021 if (free_binding_level)
1022 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1024 newlevel = free_binding_level;
1025 free_binding_level = free_binding_level->level_chain;
1029 newlevel = make_binding_level ();
1032 push_binding_level (newlevel, tag_transparent, keep_next_level_flag);
1033 GNU_xref_start_scope ((HOST_WIDE_INT) newlevel);
1034 keep_next_level_flag = 0;
1038 note_level_for_for ()
1040 current_binding_level->is_for_scope = 1;
1044 pushlevel_temporary (tag_transparent)
1045 int tag_transparent;
1047 pushlevel (tag_transparent);
1048 current_binding_level->keep = 2;
1051 /* Note we don't call push_momentary() here. Otherwise, it would cause
1052 cleanups to be allocated on the momentary obstack, and they will be
1053 overwritten by the next statement. */
1055 expand_start_bindings (0);
1058 /* For a binding between a name and an entity at a block scope,
1059 this is the `struct binding_level' for the block. */
1060 #define BINDING_LEVEL(NODE) \
1061 (((struct tree_binding*)NODE)->scope.level)
1063 /* These are currently unused, but permanent, CPLUS_BINDING nodes.
1064 They are kept here because they are allocated from the permanent
1065 obstack and cannot be easily freed. */
1066 static tree free_binding_nodes;
1068 /* Make DECL the innermost binding for ID. The LEVEL is the binding
1069 level at which this declaration is being bound. */
1072 push_binding (id, decl, level)
1075 struct binding_level* level;
1079 if (!free_binding_nodes)
1081 /* There are no free nodes, so we must build one here. */
1082 push_obstacks_nochange ();
1083 end_temporary_allocation ();
1084 binding = make_node (CPLUS_BINDING);
1089 /* There are nodes on the free list. Grab the first one. */
1090 binding = free_binding_nodes;
1092 /* And update the free list. */
1093 free_binding_nodes = TREE_CHAIN (free_binding_nodes);
1096 /* Now, fill in the binding information. */
1097 BINDING_VALUE (binding) = decl;
1098 BINDING_TYPE (binding) = NULL_TREE;
1099 BINDING_LEVEL (binding) = level;
1100 INHERITED_VALUE_BINDING_P (binding) = 0;
1101 LOCAL_BINDING_P (binding) = (level != class_binding_level);
1103 /* And put it on the front of the list of bindings for ID. */
1104 TREE_CHAIN (binding) = IDENTIFIER_BINDING (id);
1105 IDENTIFIER_BINDING (id) = binding;
1108 /* ID is already bound in the current scope. But, DECL is an
1109 additional binding for ID in the same scope. This is the `struct
1110 stat' hack whereby a non-typedef class-name or enum-name can be
1111 bound at the same level as some other kind of entity. It's the
1112 responsibility of the caller to check that inserting this name is
1113 legal here. Returns nonzero if the new binding was successful. */
1115 add_binding (id, decl)
1119 tree binding = IDENTIFIER_BINDING (id);
1122 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
1123 /* The new name is the type name. */
1124 BINDING_TYPE (binding) = decl;
1125 else if (!BINDING_VALUE (binding))
1126 /* This situation arises when push_class_level_binding moves an
1127 inherited type-binding out of the way to make room for a new
1129 BINDING_VALUE (binding) = decl;
1130 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
1131 && DECL_ARTIFICIAL (BINDING_VALUE (binding)))
1133 /* The old binding was a type name. It was placed in
1134 BINDING_VALUE because it was thought, at the point it was
1135 declared, to be the only entity with such a name. Move the
1136 type name into the type slot; it is now hidden by the new
1138 BINDING_TYPE (binding) = BINDING_VALUE (binding);
1139 BINDING_VALUE (binding) = decl;
1140 INHERITED_VALUE_BINDING_P (binding) = 0;
1144 cp_error ("declaration of `%#D'", decl);
1145 cp_error_at ("conflicts with previous declaration `%#D'",
1146 BINDING_VALUE (binding));
1153 /* Bind DECL to ID in the current_binding_level.
1154 If PUSH_USING is set in FLAGS, we know that DECL doesn't really belong
1155 to this binding level, that it got here through a using-declaration. */
1158 push_local_binding (id, decl, flags)
1163 struct binding_level *b;
1165 /* Skip over any local classes. This makes sense if we call
1166 push_local_binding with a friend decl of a local class. */
1167 b = current_binding_level;
1168 while (b->parm_flag == 2)
1171 if (lookup_name_current_level (id))
1173 /* Supplement the existing binding. */
1174 if (!add_binding (id, decl))
1175 /* It didn't work. Something else must be bound at this
1176 level. Do not add DECL to the list of things to pop
1181 /* Create a new binding. */
1182 push_binding (id, decl, b);
1184 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1185 /* We must put the OVERLOAD into a TREE_LIST since the
1186 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1187 decls that got here through a using-declaration. */
1188 decl = build_tree_list (NULL_TREE, decl);
1190 /* And put DECL on the list of things declared by the current
1192 TREE_CHAIN (decl) = b->names;
1196 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1197 binding was successful. */
1200 push_class_binding (id, decl)
1205 tree binding = IDENTIFIER_BINDING (id);
1208 /* Note that we declared this value so that we can issue an error if
1209 this an illegal redeclaration of a name already used for some
1211 note_name_declared_in_class (id, decl);
1213 if (binding && BINDING_LEVEL (binding) == class_binding_level)
1214 /* Supplement the existing binding. */
1215 result = add_binding (id, decl);
1217 /* Create a new binding. */
1218 push_binding (id, decl, class_binding_level);
1220 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1221 class-level declaration. Note that we do not use DECL here
1222 because of the possibility of the `struct stat' hack; if DECL is
1223 a class-name or enum-name we might prefer a field-name, or some
1225 IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id));
1227 /* If this is a binding from a base class, mark it as such. */
1228 binding = IDENTIFIER_BINDING (id);
1229 if (BINDING_VALUE (binding) == decl && TREE_CODE (decl) != TREE_LIST)
1231 if (TREE_CODE (decl) == OVERLOAD)
1232 context = DECL_REAL_CONTEXT (OVL_CURRENT (decl));
1235 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd',
1237 context = DECL_REAL_CONTEXT (decl);
1240 if (is_properly_derived_from (current_class_type, context))
1241 INHERITED_VALUE_BINDING_P (binding) = 1;
1243 INHERITED_VALUE_BINDING_P (binding) = 0;
1245 else if (BINDING_VALUE (binding) == decl)
1246 /* We only encounter a TREE_LIST when push_class_decls detects an
1247 ambiguity. Such an ambiguity can be overridden by a definition
1249 INHERITED_VALUE_BINDING_P (binding) = 1;
1254 /* Remove the binding for DECL which should be the innermost binding
1258 pop_binding (id, decl)
1264 if (id == NULL_TREE)
1265 /* It's easiest to write the loops that call this function without
1266 checking whether or not the entities involved have names. We
1267 get here for such an entity. */
1270 /* Get the innermost binding for ID. */
1271 binding = IDENTIFIER_BINDING (id);
1273 /* The name should be bound. */
1274 my_friendly_assert (binding != NULL_TREE, 0);
1276 /* The DECL will be either the ordinary binding or the type
1277 binding for this identifier. Remove that binding. */
1278 if (BINDING_VALUE (binding) == decl)
1279 BINDING_VALUE (binding) = NULL_TREE;
1280 else if (BINDING_TYPE (binding) == decl)
1281 BINDING_TYPE (binding) = NULL_TREE;
1283 my_friendly_abort (0);
1285 if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding))
1287 /* We're completely done with the innermost binding for this
1288 identifier. Unhook it from the list of bindings. */
1289 IDENTIFIER_BINDING (id) = TREE_CHAIN (binding);
1291 /* And place it on the free list. */
1292 TREE_CHAIN (binding) = free_binding_nodes;
1293 free_binding_nodes = binding;
1297 /* Exit a binding level.
1298 Pop the level off, and restore the state of the identifier-decl mappings
1299 that were in effect when this level was entered.
1301 If KEEP == 1, this level had explicit declarations, so
1302 and create a "block" (a BLOCK node) for the level
1303 to record its declarations and subblocks for symbol table output.
1305 If FUNCTIONBODY is nonzero, this level is the body of a function,
1306 so create a block as if KEEP were set and also clear out all
1309 If REVERSE is nonzero, reverse the order of decls before putting
1310 them into the BLOCK. */
1313 poplevel (keep, reverse, functionbody)
1319 /* The chain of decls was accumulated in reverse order.
1320 Put it into forward order, just for cleanliness. */
1322 int tmp = functionbody;
1323 int real_functionbody = current_binding_level->keep == 2
1324 ? ((functionbody = 0), tmp) : functionbody;
1325 tree tags = functionbody >= 0 ? current_binding_level->tags : 0;
1326 tree subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1327 tree block = NULL_TREE;
1329 int block_previously_created;
1330 int leaving_for_scope;
1332 if (current_binding_level->parm_flag == 2
1333 || current_binding_level->class_shadowed)
1334 /* We should not be using poplevel to pop a class binding level.
1335 Use poplevel_class instead. */
1336 my_friendly_abort (0);
1338 /* We used to use KEEP == 2 to indicate that the new block should go
1339 at the beginning of the list of blocks at this binding level,
1340 rather than the end. This hack is no longer used. */
1341 my_friendly_assert (keep == 0 || keep == 1, 0);
1343 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
1344 (HOST_WIDE_INT) current_binding_level->level_chain,
1345 current_binding_level->parm_flag,
1346 current_binding_level->keep);
1348 if (current_binding_level->keep == 1)
1351 /* Get the decls in the order they were written.
1352 Usually current_binding_level->names is in reverse order.
1353 But parameter decls were previously put in forward order. */
1356 current_binding_level->names
1357 = decls = nreverse (current_binding_level->names);
1359 decls = current_binding_level->names;
1361 /* Output any nested inline functions within this block
1362 if they weren't already output. */
1364 for (decl = decls; decl; decl = TREE_CHAIN (decl))
1365 if (TREE_CODE (decl) == FUNCTION_DECL
1366 && ! TREE_ASM_WRITTEN (decl)
1367 && DECL_INITIAL (decl) != NULL_TREE
1368 && TREE_ADDRESSABLE (decl)
1369 && decl_function_context (decl) == current_function_decl)
1371 /* If this decl was copied from a file-scope decl
1372 on account of a block-scope extern decl,
1373 propagate TREE_ADDRESSABLE to the file-scope decl. */
1374 if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1375 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1378 push_function_context ();
1379 output_inline_function (decl);
1380 pop_function_context ();
1384 /* If there were any declarations or structure tags in that level,
1385 or if this level is a function body,
1386 create a BLOCK to record them for the life of this function. */
1389 block_previously_created = (current_binding_level->this_block != NULL_TREE);
1390 if (block_previously_created)
1391 block = current_binding_level->this_block;
1392 else if (keep == 1 || functionbody)
1393 block = make_node (BLOCK);
1394 if (block != NULL_TREE)
1396 if (block_previously_created)
1398 if (decls || tags || subblocks)
1400 if (BLOCK_VARS (block) || BLOCK_TYPE_TAGS (block))
1401 warning ("internal compiler error: debugging info corrupted");
1403 BLOCK_VARS (block) = decls;
1404 BLOCK_TYPE_TAGS (block) = tags;
1406 /* We can have previous subblocks and new subblocks when
1407 doing fixup_gotos with complex cleanups. We chain the new
1408 subblocks onto the end of any pre-existing subblocks. */
1409 BLOCK_SUBBLOCKS (block) = chainon (BLOCK_SUBBLOCKS (block),
1412 /* If we created the block earlier on, and we are just
1413 diddling it now, then it already should have a proper
1414 BLOCK_END_NOTE value associated with it. */
1418 BLOCK_VARS (block) = decls;
1419 BLOCK_TYPE_TAGS (block) = tags;
1420 BLOCK_SUBBLOCKS (block) = subblocks;
1421 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1423 remember_end_note (block);
1427 /* In each subblock, record that this is its superior. */
1430 for (link = subblocks; link; link = TREE_CHAIN (link))
1431 BLOCK_SUPERCONTEXT (link) = block;
1433 /* We still support the old for-scope rules, whereby the variables
1434 in a for-init statement were in scope after the for-statement
1435 ended. We only use the new rules in flag_new_for_scope is
1438 = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1440 /* Remove declarations for all the DECLs in this level. */
1441 for (link = decls; link; link = TREE_CHAIN (link))
1443 if (leaving_for_scope && TREE_CODE (link) == VAR_DECL)
1446 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1450 ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1452 ns_binding = NULL_TREE;
1455 && (BINDING_LEVEL (outer_binding)
1456 == current_binding_level->level_chain))
1457 /* We have something like:
1462 and we are leaving the `for' scope. There's no reason to
1463 keep the binding of the inner `i' in this case. */
1464 pop_binding (DECL_NAME (link), link);
1465 else if ((outer_binding
1466 && (TREE_CODE (BINDING_VALUE (outer_binding))
1469 && TREE_CODE (ns_binding) == TYPE_DECL))
1470 /* Here, we have something like:
1478 We must pop the for-scope binding so we know what's a
1479 type and what isn't. */
1480 pop_binding (DECL_NAME (link), link);
1483 /* Mark this VAR_DECL as dead so that we can tell we left it
1484 there only for backward compatibility. */
1485 DECL_DEAD_FOR_LOCAL (link) = 1;
1487 /* Keep track of what should of have happenned when we
1488 popped the binding. */
1489 if (outer_binding && BINDING_VALUE (outer_binding))
1490 DECL_SHADOWED_FOR_VAR (link)
1491 = BINDING_VALUE (outer_binding);
1493 /* Add it to the list of dead variables in the next
1494 outermost binding to that we can remove these when we
1495 leave that binding. */
1496 current_binding_level->level_chain->dead_vars_from_for
1497 = tree_cons (NULL_TREE, link,
1498 current_binding_level->level_chain->
1499 dead_vars_from_for);
1501 /* Although we don't pop the CPLUS_BINDING, we do clear
1502 its BINDING_LEVEL since the level is going away now. */
1503 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1509 /* Remove the binding. */
1511 if (TREE_CODE (decl) == TREE_LIST)
1512 decl = TREE_VALUE (decl);
1513 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd')
1514 pop_binding (DECL_NAME (decl), decl);
1515 else if (TREE_CODE (decl) == OVERLOAD)
1516 pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl);
1518 my_friendly_abort (0);
1522 /* Remove declarations for any `for' variables from inner scopes
1523 that we kept around. */
1524 for (link = current_binding_level->dead_vars_from_for;
1525 link; link = TREE_CHAIN (link))
1526 pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1528 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1529 for (link = current_binding_level->type_shadowed;
1530 link; link = TREE_CHAIN (link))
1531 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1533 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1534 list if a `using' declaration put them there. The debugging
1535 back-ends won't understand OVERLOAD, so we remove them here.
1536 Because the BLOCK_VARS are (temporarily) shared with
1537 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1538 popped all the bindings. */
1543 for (d = &BLOCK_VARS (block); *d; )
1545 if (TREE_CODE (*d) == TREE_LIST)
1546 *d = TREE_CHAIN (*d);
1548 d = &TREE_CHAIN (*d);
1552 /* If the level being exited is the top level of a function,
1553 check over all the labels. */
1557 /* If this is the top level block of a function,
1558 the vars are the function's parameters.
1559 Don't leave them in the BLOCK because they are
1560 found in the FUNCTION_DECL instead. */
1562 BLOCK_VARS (block) = 0;
1564 /* Clear out the definitions of all label names,
1565 since their scopes end here. */
1567 for (link = named_labels; link; link = TREE_CHAIN (link))
1569 register tree label = TREE_VALUE (link);
1571 if (DECL_INITIAL (label) == NULL_TREE)
1573 cp_error_at ("label `%D' used but not defined", label);
1574 /* Avoid crashing later. */
1575 define_label (input_filename, 1, DECL_NAME (label));
1577 else if (warn_unused && !TREE_USED (label))
1578 cp_warning_at ("label `%D' defined but not used", label);
1579 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), NULL_TREE);
1581 /* Put the labels into the "variables" of the
1582 top-level block, so debugger can see them. */
1583 TREE_CHAIN (label) = BLOCK_VARS (block);
1584 BLOCK_VARS (block) = label;
1587 named_labels = NULL_TREE;
1590 /* Any uses of undefined labels now operate under constraints
1591 of next binding contour. */
1593 struct binding_level *level_chain;
1594 level_chain = current_binding_level->level_chain;
1597 struct named_label_list *labels;
1598 for (labels = named_label_uses; labels; labels = labels->next)
1599 if (labels->binding_level == current_binding_level)
1601 labels->binding_level = level_chain;
1602 labels->names_in_scope = level_chain->names;
1607 tmp = current_binding_level->keep;
1609 pop_binding_level ();
1611 DECL_INITIAL (current_function_decl) = block;
1614 if (!block_previously_created)
1615 current_binding_level->blocks
1616 = chainon (current_binding_level->blocks, block);
1618 /* If we did not make a block for the level just exited,
1619 any blocks made for inner levels
1620 (since they cannot be recorded as subblocks in that level)
1621 must be carried forward so they will later become subblocks
1622 of something else. */
1624 current_binding_level->blocks
1625 = chainon (current_binding_level->blocks, subblocks);
1627 /* Take care of compiler's internal binding structures. */
1630 expand_end_bindings (getdecls (), keep, 1);
1631 /* Each and every BLOCK node created here in `poplevel' is important
1632 (e.g. for proper debugging information) so if we created one
1633 earlier, mark it as "used". */
1635 TREE_USED (block) = 1;
1636 block = poplevel (keep, reverse, real_functionbody);
1639 /* Each and every BLOCK node created here in `poplevel' is important
1640 (e.g. for proper debugging information) so if we created one
1641 earlier, mark it as "used". */
1643 TREE_USED (block) = 1;
1647 /* Delete the node BLOCK from the current binding level.
1648 This is used for the block inside a stmt expr ({...})
1649 so that the block can be reinserted where appropriate. */
1652 delete_block (block)
1656 if (current_binding_level->blocks == block)
1657 current_binding_level->blocks = TREE_CHAIN (block);
1658 for (t = current_binding_level->blocks; t;)
1660 if (TREE_CHAIN (t) == block)
1661 TREE_CHAIN (t) = TREE_CHAIN (block);
1665 TREE_CHAIN (block) = NULL_TREE;
1666 /* Clear TREE_USED which is always set by poplevel.
1667 The flag is set again if insert_block is called. */
1668 TREE_USED (block) = 0;
1671 /* Insert BLOCK at the end of the list of subblocks of the
1672 current binding level. This is used when a BIND_EXPR is expanded,
1673 to handle the BLOCK node inside the BIND_EXPR. */
1676 insert_block (block)
1679 TREE_USED (block) = 1;
1680 current_binding_level->blocks
1681 = chainon (current_binding_level->blocks, block);
1684 /* Set the BLOCK node for the innermost scope
1685 (the one we are currently in). */
1689 register tree block;
1691 current_binding_level->this_block = block;
1694 /* Do a pushlevel for class declarations. */
1699 register struct binding_level *newlevel;
1701 /* Reuse or create a struct for this binding level. */
1702 #if defined(DEBUG_CP_BINDING_LEVELS)
1704 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1705 if (free_binding_level)
1706 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1708 newlevel = free_binding_level;
1709 free_binding_level = free_binding_level->level_chain;
1712 newlevel = make_binding_level ();
1714 #if defined(DEBUG_CP_BINDING_LEVELS)
1716 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1718 push_binding_level (newlevel, 0, 0);
1720 decl_stack = push_decl_level (decl_stack, &decl_obstack);
1721 class_binding_level = current_binding_level;
1722 class_binding_level->parm_flag = 2;
1725 /* ...and a poplevel for class declarations. FORCE is used to force
1726 clearing out of CLASS_VALUEs after a class definition. */
1729 poplevel_class (force)
1732 register struct binding_level *level = class_binding_level;
1733 tree block = NULL_TREE;
1736 my_friendly_assert (level != 0, 354);
1738 decl_stack = pop_stack_level (decl_stack);
1739 /* If we're leaving a toplevel class, don't bother to do the setting
1740 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1741 shouldn't even be used when current_class_type isn't set, and second,
1742 if we don't touch it here, we're able to use the cache effect if the
1743 next time we're entering a class scope, it is the same class. */
1744 if (current_class_depth != 1 || force)
1746 struct binding_level* b;
1748 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1749 for (shadowed = level->class_shadowed;
1751 shadowed = TREE_CHAIN (shadowed))
1752 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE;
1754 /* Find the next enclosing class, and recreate
1755 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1756 b = level->level_chain;
1757 while (b && b->parm_flag != 2)
1761 for (shadowed = b->class_shadowed;
1763 shadowed = TREE_CHAIN (shadowed))
1767 t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed));
1768 while (t && BINDING_LEVEL (t) != b)
1772 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed))
1773 = BINDING_VALUE (t);
1777 /* Remember to save what IDENTIFIER's were bound in this scope so we
1778 can recover from cache misses. */
1780 previous_class_type = current_class_type;
1781 previous_class_values = class_binding_level->class_shadowed;
1783 for (shadowed = level->type_shadowed;
1785 shadowed = TREE_CHAIN (shadowed))
1786 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1788 /* Remove the bindings for all of the class-level declarations. */
1789 for (shadowed = level->class_shadowed;
1791 shadowed = TREE_CHAIN (shadowed))
1792 pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1794 GNU_xref_end_scope ((HOST_WIDE_INT) class_binding_level,
1795 (HOST_WIDE_INT) class_binding_level->level_chain,
1796 class_binding_level->parm_flag,
1797 class_binding_level->keep);
1799 /* Now, pop out of the binding level which we created up in the
1800 `pushlevel_class' routine. */
1801 #if defined(DEBUG_CP_BINDING_LEVELS)
1803 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1805 pop_binding_level ();
1810 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1811 for any names in enclosing classes. */
1814 clear_identifier_class_values ()
1818 if (!class_binding_level)
1821 for (t = class_binding_level->class_shadowed;
1824 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
1828 /* For debugging. */
1829 static int no_print_functions = 0;
1830 static int no_print_builtins = 0;
1833 print_binding_level (lvl)
1834 struct binding_level *lvl;
1838 fprintf (stderr, " blocks=");
1839 fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks);
1840 fprintf (stderr, " n_incomplete=%d parm_flag=%d keep=%d",
1841 list_length (lvl->incomplete), lvl->parm_flag, lvl->keep);
1842 if (lvl->tag_transparent)
1843 fprintf (stderr, " tag-transparent");
1844 if (lvl->more_cleanups_ok)
1845 fprintf (stderr, " more-cleanups-ok");
1846 if (lvl->have_cleanups)
1847 fprintf (stderr, " have-cleanups");
1848 fprintf (stderr, "\n");
1851 fprintf (stderr, " names:\t");
1852 /* We can probably fit 3 names to a line? */
1853 for (t = lvl->names; t; t = TREE_CHAIN (t))
1855 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
1857 if (no_print_builtins
1858 && (TREE_CODE (t) == TYPE_DECL)
1859 && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
1862 /* Function decls tend to have longer names. */
1863 if (TREE_CODE (t) == FUNCTION_DECL)
1870 fprintf (stderr, "\n\t");
1873 print_node_brief (stderr, "", t, 0);
1874 if (t == error_mark_node)
1878 fprintf (stderr, "\n");
1882 fprintf (stderr, " tags:\t");
1884 for (t = lvl->tags; t; t = TREE_CHAIN (t))
1886 if (TREE_PURPOSE (t) == NULL_TREE)
1888 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1895 fprintf (stderr, "\n\t");
1898 if (TREE_PURPOSE (t) == NULL_TREE)
1900 print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
1901 fprintf (stderr, ">");
1903 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1904 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1907 print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
1908 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1909 fprintf (stderr, ">");
1913 fprintf (stderr, "\n");
1915 if (lvl->class_shadowed)
1917 fprintf (stderr, " class-shadowed:");
1918 for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
1920 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1922 fprintf (stderr, "\n");
1924 if (lvl->type_shadowed)
1926 fprintf (stderr, " type-shadowed:");
1927 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
1929 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1931 fprintf (stderr, "\n");
1936 print_other_binding_stack (stack)
1937 struct binding_level *stack;
1939 struct binding_level *level;
1940 for (level = stack; level != global_binding_level; level = level->level_chain)
1942 fprintf (stderr, "binding level ");
1943 fprintf (stderr, HOST_PTR_PRINTF, level);
1944 fprintf (stderr, "\n");
1945 print_binding_level (level);
1950 print_binding_stack ()
1952 struct binding_level *b;
1953 fprintf (stderr, "current_binding_level=");
1954 fprintf (stderr, HOST_PTR_PRINTF, current_binding_level);
1955 fprintf (stderr, "\nclass_binding_level=");
1956 fprintf (stderr, HOST_PTR_PRINTF, class_binding_level);
1957 fprintf (stderr, "\nglobal_binding_level=");
1958 fprintf (stderr, HOST_PTR_PRINTF, global_binding_level);
1959 fprintf (stderr, "\n");
1960 if (class_binding_level)
1962 for (b = class_binding_level; b; b = b->level_chain)
1963 if (b == current_binding_level)
1966 b = class_binding_level;
1968 b = current_binding_level;
1971 b = current_binding_level;
1972 print_other_binding_stack (b);
1973 fprintf (stderr, "global:\n");
1974 print_binding_level (global_binding_level);
1977 /* Namespace binding access routines: The namespace_bindings field of
1978 the identifier is polymorphic, with three possible values:
1979 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
1980 indicating the BINDING_VALUE of global_namespace. */
1982 /* Check whether the a binding for the name to scope is known.
1983 Assumes that the bindings of the name are already a list
1984 of bindings. Returns the binding found, or NULL_TREE. */
1987 find_binding (name, scope)
1991 tree iter, prev = NULL_TREE;
1993 scope = ORIGINAL_NAMESPACE (scope);
1995 for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
1996 iter = TREE_CHAIN (iter))
1998 my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
1999 if (BINDING_SCOPE (iter) == scope)
2001 /* Move binding found to the fron of the list, so
2002 subsequent lookups will find it faster. */
2005 TREE_CHAIN (prev) = TREE_CHAIN (iter);
2006 TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
2007 IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
2016 /* Always returns a binding for name in scope. If the
2017 namespace_bindings is not a list, convert it to one first.
2018 If no binding is found, make a new one. */
2021 binding_for_name (name, scope)
2025 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2028 scope = ORIGINAL_NAMESPACE (scope);
2030 if (b && TREE_CODE (b) != CPLUS_BINDING)
2032 /* Get rid of optimization for global scope. */
2033 IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
2034 BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
2035 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2037 if (b && (result = find_binding (name, scope)))
2039 /* Not found, make a new permanent one. */
2040 push_obstacks (&permanent_obstack, &permanent_obstack);
2041 result = make_node (CPLUS_BINDING);
2042 TREE_CHAIN (result) = b;
2043 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
2044 BINDING_SCOPE (result) = scope;
2045 BINDING_TYPE (result) = NULL_TREE;
2046 BINDING_VALUE (result) = NULL_TREE;
2051 /* Return the binding value for name in scope, considering that
2052 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2055 namespace_binding (name, scope)
2059 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2062 if (scope == NULL_TREE)
2063 scope = global_namespace;
2064 if (TREE_CODE (b) != CPLUS_BINDING)
2065 return (scope == global_namespace) ? b : NULL_TREE;
2066 name = find_binding (name,scope);
2067 if (name == NULL_TREE)
2069 return BINDING_VALUE (name);
2072 /* Set the binding value for name in scope. If modifying the binding
2073 of global_namespace is attempted, try to optimize it. */
2076 set_namespace_binding (name, scope, val)
2083 if (scope == NULL_TREE)
2084 scope = global_namespace;
2086 if (scope == global_namespace)
2088 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2089 if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
2091 IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
2095 b = binding_for_name (name, scope);
2096 BINDING_VALUE (b) = val;
2099 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2100 select a name that is unique to this compilation unit. */
2103 push_namespace (name)
2108 int implicit_use = 0;
2110 if (!global_namespace)
2112 /* This must be ::. */
2113 my_friendly_assert (name == get_identifier ("::"), 377);
2118 /* The name of anonymous namespace is unique for the translation
2120 if (!anonymous_namespace_name)
2121 anonymous_namespace_name = get_file_function_name ('N');
2122 name = anonymous_namespace_name;
2123 d = IDENTIFIER_NAMESPACE_VALUE (name);
2125 /* Reopening anonymous namespace. */
2129 else if (current_namespace == global_namespace
2130 && name == DECL_NAME (std_node))
2137 /* Check whether this is an extended namespace definition. */
2138 d = IDENTIFIER_NAMESPACE_VALUE (name);
2139 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2142 if (DECL_NAMESPACE_ALIAS (d))
2144 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2145 d, DECL_NAMESPACE_ALIAS (d));
2146 d = DECL_NAMESPACE_ALIAS (d);
2153 /* Make a new namespace, binding the name to it. */
2154 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2155 /* The global namespace is not pushed, and the global binding
2156 level is set elsewhere. */
2161 declare_namespace_level ();
2162 NAMESPACE_LEVEL (d) = current_binding_level;
2166 resume_binding_level (NAMESPACE_LEVEL (d));
2169 do_using_directive (d);
2170 /* Enter the name space. */
2171 current_namespace = d;
2174 /* Pop from the scope of the current namespace. */
2179 if (current_namespace == global_namespace)
2181 my_friendly_assert (in_std>0, 980421);
2185 current_namespace = CP_DECL_CONTEXT (current_namespace);
2186 /* The binding level is not popped, as it might be re-opened later. */
2187 suspend_binding_level ();
2190 /* Concatenate the binding levels of all namespaces. */
2193 cat_namespace_levels()
2197 struct binding_level *b;
2199 last = NAMESPACE_LEVEL (global_namespace) -> names;
2200 /* The nested namespaces appear in the names list of their ancestors. */
2201 for (current = last; current; current = TREE_CHAIN (current))
2203 /* Catch simple infinite loops. */
2204 if (TREE_CHAIN (current) == current)
2205 my_friendly_abort (990126);
2207 if (TREE_CODE (current) != NAMESPACE_DECL
2208 || DECL_NAMESPACE_ALIAS (current))
2210 if (!DECL_LANG_SPECIFIC (current))
2213 my_friendly_assert (current == std_node, 393);
2216 b = NAMESPACE_LEVEL (current);
2217 while (TREE_CHAIN (last))
2218 last = TREE_CHAIN (last);
2219 TREE_CHAIN (last) = NAMESPACE_LEVEL (current) -> names;
2223 /* Subroutines for reverting temporarily to top-level for instantiation
2224 of templates and such. We actually need to clear out the class- and
2225 local-value slots of all identifiers, so that only the global values
2226 are at all visible. Simply setting current_binding_level to the global
2227 scope isn't enough, because more binding levels may be pushed. */
2228 struct saved_scope {
2229 struct binding_level *old_binding_level;
2232 struct saved_scope *prev;
2233 tree class_name, class_type;
2234 tree access_specifier;
2236 struct binding_level *class_bindings;
2237 tree *lang_base, *lang_stack, lang_name;
2239 int minimal_parse_mode;
2240 tree last_function_parms;
2241 tree template_parms;
2242 HOST_WIDE_INT processing_template_decl;
2243 tree previous_class_type, previous_class_values;
2244 int processing_specialization;
2245 int processing_explicit_instantiation;
2247 static struct saved_scope *current_saved_scope;
2249 /* A chain of the binding vecs created by store_bindings. We create a
2250 whole bunch of these during compilation, on permanent_obstack, so we
2251 can't just throw them away. */
2252 static tree free_binding_vecs;
2255 store_bindings (names, old_bindings)
2256 tree names, old_bindings;
2259 for (t = names; t; t = TREE_CHAIN (t))
2261 tree binding, t1, id;
2263 if (TREE_CODE (t) == TREE_LIST)
2264 id = TREE_PURPOSE (t);
2269 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2270 we have no IDENTIFIER_BINDING if we have left the class
2271 scope, but cached the class-level declarations. */
2272 || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2275 for (t1 = old_bindings; t1; t1 = TREE_CHAIN (t1))
2276 if (TREE_VEC_ELT (t1, 0) == id)
2279 if (free_binding_vecs)
2281 binding = free_binding_vecs;
2282 free_binding_vecs = TREE_CHAIN (free_binding_vecs);
2285 binding = make_tree_vec (4);
2289 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2290 TREE_VEC_ELT (binding, 0) = id;
2291 TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2292 TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2293 TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2294 IDENTIFIER_BINDING (id) = NULL_TREE;
2295 IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2297 TREE_CHAIN (binding) = old_bindings;
2298 old_bindings = binding;
2302 return old_bindings;
2306 maybe_push_to_top_level (pseudo)
2309 extern int current_lang_stacksize;
2310 struct saved_scope *s
2311 = (struct saved_scope *) xmalloc (sizeof (struct saved_scope));
2312 struct binding_level *b = current_binding_level;
2313 tree old_bindings = NULL_TREE;
2315 push_cp_function_context (NULL_TREE);
2317 if (previous_class_type)
2318 old_bindings = store_bindings (previous_class_values, old_bindings);
2320 /* Have to include global_binding_level, because class-level decls
2321 aren't listed anywhere useful. */
2322 for (; b; b = b->level_chain)
2326 /* Template IDs are inserted into the global level. If they were
2327 inserted into namespace level, finish_file wouldn't find them
2328 when doing pending instantiations. Therefore, don't stop at
2329 namespace level, but continue until :: . */
2330 if (b == global_binding_level || (pseudo && b->pseudo_global))
2333 old_bindings = store_bindings (b->names, old_bindings);
2334 /* We also need to check class_shadowed to save class-level type
2335 bindings, since pushclass doesn't fill in b->names. */
2336 if (b->parm_flag == 2)
2337 old_bindings = store_bindings (b->class_shadowed, old_bindings);
2339 /* Unwind type-value slots back to top level. */
2340 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2341 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2344 s->old_binding_level = current_binding_level;
2345 current_binding_level = b;
2347 s->old_namespace = current_namespace;
2348 s->class_name = current_class_name;
2349 s->class_type = current_class_type;
2350 s->access_specifier = current_access_specifier;
2351 s->function_decl = current_function_decl;
2352 s->class_bindings = class_binding_level;
2353 s->lang_stack = current_lang_stack;
2354 s->lang_base = current_lang_base;
2355 s->lang_stacksize = current_lang_stacksize;
2356 s->lang_name = current_lang_name;
2357 s->minimal_parse_mode = minimal_parse_mode;
2358 s->last_function_parms = last_function_parms;
2359 s->template_parms = current_template_parms;
2360 s->processing_template_decl = processing_template_decl;
2361 s->previous_class_type = previous_class_type;
2362 s->previous_class_values = previous_class_values;
2363 s->processing_specialization = processing_specialization;
2364 s->processing_explicit_instantiation = processing_explicit_instantiation;
2366 current_class_name = current_class_type = NULL_TREE;
2367 current_function_decl = NULL_TREE;
2368 class_binding_level = (struct binding_level *)0;
2369 current_lang_stacksize = 10;
2370 current_lang_stack = current_lang_base
2371 = (tree *) xmalloc (current_lang_stacksize * sizeof (tree));
2372 current_lang_name = lang_name_cplusplus;
2373 strict_prototype = strict_prototypes_lang_cplusplus;
2374 named_labels = NULL_TREE;
2375 shadowed_labels = NULL_TREE;
2376 minimal_parse_mode = 0;
2377 previous_class_type = previous_class_values = NULL_TREE;
2378 processing_specialization = 0;
2379 processing_explicit_instantiation = 0;
2380 current_template_parms = NULL_TREE;
2381 processing_template_decl = 0;
2382 current_namespace = global_namespace;
2384 s->prev = current_saved_scope;
2385 s->old_bindings = old_bindings;
2386 current_saved_scope = s;
2388 push_obstacks (&permanent_obstack, &permanent_obstack);
2392 push_to_top_level ()
2394 maybe_push_to_top_level (0);
2398 pop_from_top_level ()
2400 extern int current_lang_stacksize;
2401 struct saved_scope *s = current_saved_scope;
2404 /* Clear out class-level bindings cache. */
2405 if (previous_class_type)
2406 invalidate_class_lookup_cache ();
2410 current_binding_level = s->old_binding_level;
2411 current_saved_scope = s->prev;
2412 for (t = s->old_bindings; t; )
2415 tree id = TREE_VEC_ELT (t, 0);
2418 SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2419 IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2420 IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2423 TREE_CHAIN (save) = free_binding_vecs;
2424 free_binding_vecs = save;
2426 current_namespace = s->old_namespace;
2427 current_class_name = s->class_name;
2428 current_class_type = s->class_type;
2429 current_access_specifier = s->access_specifier;
2430 current_function_decl = s->function_decl;
2431 class_binding_level = s->class_bindings;
2432 free (current_lang_base);
2433 current_lang_base = s->lang_base;
2434 current_lang_stack = s->lang_stack;
2435 current_lang_name = s->lang_name;
2436 current_lang_stacksize = s->lang_stacksize;
2437 if (current_lang_name == lang_name_cplusplus)
2438 strict_prototype = strict_prototypes_lang_cplusplus;
2439 else if (current_lang_name == lang_name_c)
2440 strict_prototype = strict_prototypes_lang_c;
2441 minimal_parse_mode = s->minimal_parse_mode;
2442 last_function_parms = s->last_function_parms;
2443 current_template_parms = s->template_parms;
2444 processing_template_decl = s->processing_template_decl;
2445 previous_class_type = s->previous_class_type;
2446 previous_class_values = s->previous_class_values;
2447 processing_specialization = s->processing_specialization;
2448 processing_explicit_instantiation = s->processing_explicit_instantiation;
2452 pop_cp_function_context (NULL_TREE);
2455 /* Push a definition of struct, union or enum tag "name".
2456 into binding_level "b". "type" should be the type node,
2457 We assume that the tag "name" is not already defined.
2459 Note that the definition may really be just a forward reference.
2460 In that case, the TYPE_SIZE will be a NULL_TREE.
2462 C++ gratuitously puts all these tags in the name space. */
2464 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2465 record the shadowed value for this binding contour. TYPE is
2466 the type that ID maps to. */
2469 set_identifier_type_value_with_scope (id, type, b)
2472 struct binding_level *b;
2474 if (!b->namespace_p)
2476 /* Shadow the marker, not the real thing, so that the marker
2477 gets restored later. */
2478 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2480 = tree_cons (id, old_type_value, b->type_shadowed);
2484 tree binding = binding_for_name (id, current_namespace);
2485 BINDING_TYPE (binding) = type;
2486 /* Store marker instead of real type. */
2487 type = global_type_node;
2489 SET_IDENTIFIER_TYPE_VALUE (id, type);
2492 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2495 set_identifier_type_value (id, type)
2499 set_identifier_type_value_with_scope (id, type, current_binding_level);
2502 /* Return the type associated with id. */
2505 identifier_type_value (id)
2508 /* There is no type with that name, anywhere. */
2509 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2511 /* This is not the type marker, but the real thing. */
2512 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2513 return REAL_IDENTIFIER_TYPE_VALUE (id);
2514 /* Have to search for it. It must be on the global level, now.
2515 Ask lookup_name not to return non-types. */
2516 id = lookup_name_real (id, 2, 1, 0);
2518 return TREE_TYPE (id);
2522 /* Pop off extraneous binding levels left over due to syntax errors.
2524 We don't pop past namespaces, as they might be valid. */
2529 #ifdef DEBUG_CP_BINDING_LEVELS
2530 fprintf (stderr, "XXX entering pop_everything ()\n");
2532 while (!toplevel_bindings_p ())
2534 if (current_binding_level->parm_flag == 2)
2535 pop_nested_class (1);
2539 #ifdef DEBUG_CP_BINDING_LEVELS
2540 fprintf (stderr, "XXX leaving pop_everything ()\n");
2544 /* The type TYPE is being declared. If it is a class template, or a
2545 specialization of a class template, do any processing required and
2546 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2547 being declared a friend. B is the binding level at which this TYPE
2550 Returns the TYPE_DECL for TYPE, which may have been altered by this
2554 maybe_process_template_type_declaration (type, globalize, b)
2557 struct binding_level* b;
2559 tree decl = TYPE_NAME (type);
2561 if (processing_template_parmlist)
2562 /* You can't declare a new template type in a template parameter
2563 list. But, you can declare a non-template type:
2565 template <class A*> struct S;
2567 is a forward-declaration of `A'. */
2571 maybe_check_template_type (type);
2573 my_friendly_assert (IS_AGGR_TYPE (type)
2574 || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2577 if (/* If !GLOBALIZE then we are looking at a definition.
2578 It may not be a primary template. (For example, in:
2581 struct S1 { class S2 {}; }
2583 we have to push_template_decl for S2.) */
2584 (processing_template_decl && !globalize)
2585 /* If we are declaring a friend template class, we will
2586 have GLOBALIZE set, since something like:
2594 declares S2 to be at global scope. */
2595 || PROCESSING_REAL_TEMPLATE_DECL_P ())
2597 /* This may change after the call to
2598 push_template_decl_real, but we want the original value. */
2599 tree name = DECL_NAME (decl);
2601 decl = push_template_decl_real (decl, globalize);
2602 /* If the current binding level is the binding level for the
2603 template parameters (see the comment in
2604 begin_template_parm_list) and the enclosing level is a class
2605 scope, and we're not looking at a friend, push the
2606 declaration of the member class into the class scope. In the
2607 friend case, push_template_decl will already have put the
2608 friend into global scope, if appropriate. */
2609 if (TREE_CODE (type) != ENUMERAL_TYPE
2610 && !globalize && b->pseudo_global
2611 && b->level_chain->parm_flag == 2)
2613 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2614 /* Put this tag on the list of tags for the class, since
2615 that won't happen below because B is not the class
2616 binding level, but is instead the pseudo-global level. */
2617 b->level_chain->tags =
2618 saveable_tree_cons (name, type, b->level_chain->tags);
2619 TREE_NONLOCAL_FLAG (type) = 1;
2620 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2621 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2629 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2630 Normally put it into the inner-most non-tag-transparent scope,
2631 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2632 The latter is needed for implicit declarations. */
2635 pushtag (name, type, globalize)
2639 register struct binding_level *b;
2643 b = current_binding_level;
2644 while (b->tag_transparent
2645 || (globalize && b->parm_flag == 2))
2648 if (toplevel_bindings_p ())
2649 b->tags = perm_tree_cons (name, type, b->tags);
2651 b->tags = saveable_tree_cons (name, type, b->tags);
2655 context = type ? TYPE_CONTEXT (type) : NULL_TREE;
2658 tree cs = current_scope ();
2662 else if (cs != NULL_TREE
2663 && TREE_CODE_CLASS (TREE_CODE (cs)) == 't')
2664 /* When declaring a friend class of a local class, we want
2665 to inject the newly named class into the scope
2666 containing the local class, not the namespace scope. */
2667 context = hack_decl_function_context (get_type_decl (cs));
2670 c_decl = TREE_CODE (context) == FUNCTION_DECL
2671 ? context : TYPE_MAIN_DECL (context);
2674 context = current_namespace;
2676 /* Do C++ gratuitous typedefing. */
2677 if (IDENTIFIER_TYPE_VALUE (name) != type)
2679 register tree d = NULL_TREE;
2680 int newdecl = 0, in_class = 0;
2682 if ((b->pseudo_global && b->level_chain->parm_flag == 2)
2683 || b->parm_flag == 2)
2686 d = lookup_nested_type (type, c_decl);
2691 d = build_decl (TYPE_DECL, name, type);
2692 if (current_lang_name == lang_name_java)
2693 TYPE_FOR_JAVA (type) = 1;
2694 SET_DECL_ARTIFICIAL (d);
2696 set_identifier_type_value_with_scope (name, type, b);
2699 d = TYPE_MAIN_DECL (d);
2701 TYPE_NAME (type) = d;
2702 DECL_CONTEXT (d) = FROB_CONTEXT (context);
2704 d = maybe_process_template_type_declaration (type,
2707 if (b->parm_flag == 2)
2709 if (newdecl && !PROCESSING_REAL_TEMPLATE_DECL_P ())
2710 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2711 class. But if it's a member template class, we
2712 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2714 finish_member_declaration (d);
2716 pushdecl_class_level (d);
2719 d = pushdecl_with_scope (d, b);
2723 if (ANON_AGGRNAME_P (name))
2724 DECL_IGNORED_P (d) = 1;
2726 TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2727 DECL_ASSEMBLER_NAME (d) = DECL_NAME (d);
2728 if (!uses_template_parms (type))
2729 DECL_ASSEMBLER_NAME (d)
2730 = get_identifier (build_overload_name (type, 1, 1));
2733 if (b->parm_flag == 2)
2735 TREE_NONLOCAL_FLAG (type) = 1;
2736 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2737 CLASSTYPE_TAGS (current_class_type) = b->tags;
2741 if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2742 /* Use the canonical TYPE_DECL for this node. */
2743 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2746 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2747 will be the tagged type we just added to the current
2748 binding level. This fake NULL-named TYPE_DECL node helps
2749 dwarfout.c to know when it needs to output a
2750 representation of a tagged type, and it also gives us a
2751 convenient place to record the "scope start" address for
2754 tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2755 TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2759 /* Counter used to create anonymous type names. */
2761 static int anon_cnt = 0;
2763 /* Return an IDENTIFIER which can be used as a name for
2764 anonymous structs and unions. */
2771 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2772 return get_identifier (buf);
2775 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2776 This keeps dbxout from getting confused. */
2781 register struct binding_level *b;
2783 static int last_cnt = 0;
2785 /* Fast out if no new anon names were declared. */
2786 if (last_cnt == anon_cnt)
2789 b = current_binding_level;
2790 while (b->tag_transparent)
2795 /* A NULL purpose means we have already processed all tags
2796 from here to the end of the list. */
2797 if (TREE_PURPOSE (tags) == NULL_TREE)
2799 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2800 TREE_PURPOSE (tags) = NULL_TREE;
2801 tags = TREE_CHAIN (tags);
2803 last_cnt = anon_cnt;
2806 /* Subroutine of duplicate_decls: return truthvalue of whether
2807 or not types of these decls match.
2809 For C++, we must compare the parameter list so that `int' can match
2810 `int&' in a parameter position, but `int&' is not confused with
2814 decls_match (newdecl, olddecl)
2815 tree newdecl, olddecl;
2819 if (newdecl == olddecl)
2822 if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
2823 /* If the two DECLs are not even the same kind of thing, we're not
2824 interested in their types. */
2827 if (TREE_CODE (newdecl) == FUNCTION_DECL)
2829 tree f1 = TREE_TYPE (newdecl);
2830 tree f2 = TREE_TYPE (olddecl);
2831 tree p1 = TYPE_ARG_TYPES (f1);
2832 tree p2 = TYPE_ARG_TYPES (f2);
2834 if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl)
2835 && ! (DECL_LANGUAGE (newdecl) == lang_c
2836 && DECL_LANGUAGE (olddecl) == lang_c))
2839 /* When we parse a static member function definition,
2840 we put together a FUNCTION_DECL which thinks its type
2841 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2843 if (TREE_CODE (f1) == METHOD_TYPE && DECL_STATIC_FUNCTION_P (olddecl))
2844 revert_static_member_fn (&newdecl, &f1, &p1);
2845 else if (TREE_CODE (f2) == METHOD_TYPE
2846 && DECL_STATIC_FUNCTION_P (newdecl))
2847 revert_static_member_fn (&olddecl, &f2, &p2);
2849 /* Here we must take care of the case where new default
2850 parameters are specified. Also, warn if an old
2851 declaration becomes ambiguous because default
2852 parameters may cause the two to be ambiguous. */
2853 if (TREE_CODE (f1) != TREE_CODE (f2))
2855 if (TREE_CODE (f1) == OFFSET_TYPE)
2856 cp_compiler_error ("`%D' redeclared as member function", newdecl);
2858 cp_compiler_error ("`%D' redeclared as non-member function", newdecl);
2862 if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
2864 if (! strict_prototypes_lang_c && DECL_LANGUAGE (olddecl) == lang_c
2867 types_match = self_promoting_args_p (p1);
2868 if (p1 == void_list_node)
2869 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2871 else if (!strict_prototypes_lang_c && DECL_LANGUAGE (olddecl)==lang_c
2872 && DECL_LANGUAGE (newdecl) == lang_c && p1 == NULL_TREE)
2874 types_match = self_promoting_args_p (p2);
2875 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2878 types_match = compparms (p1, p2);
2883 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
2885 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
2886 DECL_TEMPLATE_PARMS (olddecl)))
2889 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
2892 types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
2893 DECL_TEMPLATE_RESULT (newdecl));
2897 if (TREE_TYPE (newdecl) == error_mark_node)
2898 types_match = TREE_TYPE (olddecl) == error_mark_node;
2899 else if (TREE_TYPE (olddecl) == NULL_TREE)
2900 types_match = TREE_TYPE (newdecl) == NULL_TREE;
2901 else if (TREE_TYPE (newdecl) == NULL_TREE)
2904 types_match = comptypes (TREE_TYPE (newdecl),
2905 TREE_TYPE (olddecl),
2906 COMPARE_REDECLARATION);
2912 /* If NEWDECL is `static' and an `extern' was seen previously,
2913 warn about it. (OLDDECL may be NULL_TREE; NAME contains
2914 information about previous usage as an `extern'.)
2916 Note that this does not apply to the C++ case of declaring
2917 a variable `extern const' and then later `const'.
2919 Don't complain about built-in functions, since they are beyond
2920 the user's control. */
2923 warn_extern_redeclared_static (newdecl, olddecl)
2924 tree newdecl, olddecl;
2928 static const char *explicit_extern_static_warning
2929 = "`%D' was declared `extern' and later `static'";
2930 static const char *implicit_extern_static_warning
2931 = "`%D' was declared implicitly `extern' and later `static'";
2933 if (TREE_CODE (newdecl) == TYPE_DECL)
2936 name = DECL_ASSEMBLER_NAME (newdecl);
2937 if (TREE_PUBLIC (name) && DECL_THIS_STATIC (newdecl))
2939 /* It's okay to redeclare an ANSI built-in function as static,
2940 or to declare a non-ANSI built-in function as anything. */
2941 if (! (TREE_CODE (newdecl) == FUNCTION_DECL
2942 && olddecl != NULL_TREE
2943 && TREE_CODE (olddecl) == FUNCTION_DECL
2944 && (DECL_BUILT_IN (olddecl)
2945 || DECL_BUILT_IN_NONANSI (olddecl))))
2947 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
2948 ? implicit_extern_static_warning
2949 : explicit_extern_static_warning, newdecl);
2950 if (olddecl != NULL_TREE)
2951 cp_pedwarn_at ("previous declaration of `%D'", olddecl);
2956 /* Handle when a new declaration NEWDECL has the same name as an old
2957 one OLDDECL in the same binding contour. Prints an error message
2960 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2961 Otherwise, return 0. */
2964 duplicate_decls (newdecl, olddecl)
2965 tree newdecl, olddecl;
2967 extern struct obstack permanent_obstack;
2968 unsigned olddecl_uid = DECL_UID (olddecl);
2969 int olddecl_friend = 0, types_match = 0;
2970 int new_defines_function = 0;
2972 if (newdecl == olddecl)
2975 types_match = decls_match (newdecl, olddecl);
2977 /* If either the type of the new decl or the type of the old decl is an
2978 error_mark_node, then that implies that we have already issued an
2979 error (earlier) for some bogus type specification, and in that case,
2980 it is rather pointless to harass the user with yet more error message
2981 about the same declaration, so just pretend the types match here. */
2982 if (TREE_TYPE (newdecl) == error_mark_node
2983 || TREE_TYPE (olddecl) == error_mark_node)
2986 /* Check for redeclaration and other discrepancies. */
2987 if (TREE_CODE (olddecl) == FUNCTION_DECL
2988 && DECL_ARTIFICIAL (olddecl)
2989 && (DECL_BUILT_IN (olddecl) || DECL_BUILT_IN_NONANSI (olddecl)))
2991 /* If you declare a built-in or predefined function name as static,
2992 the old definition is overridden, but optionally warn this was a
2993 bad choice of name. Ditto for overloads. */
2994 if (! TREE_PUBLIC (newdecl)
2995 || (TREE_CODE (newdecl) == FUNCTION_DECL
2996 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl)))
2999 cp_warning ("shadowing %s function `%#D'",
3000 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3002 /* Discard the old built-in function. */
3005 else if (! types_match)
3007 if (TREE_CODE (newdecl) != FUNCTION_DECL)
3009 /* If the built-in is not ansi, then programs can override
3010 it even globally without an error. */
3011 if (! DECL_BUILT_IN (olddecl))
3012 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3016 cp_error ("declaration of `%#D'", newdecl);
3017 cp_error ("conflicts with built-in declaration `%#D'",
3023 cp_warning ("declaration of `%#D'", newdecl);
3024 cp_warning ("conflicts with built-in declaration `%#D'",
3028 else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3030 if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3031 && TREE_CODE (newdecl) != TYPE_DECL
3032 && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3033 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3034 || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3035 && TREE_CODE (olddecl) != TYPE_DECL
3036 && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3037 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3040 /* We do nothing special here, because C++ does such nasty
3041 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3042 get shadowed, and know that if we need to find a TYPE_DECL
3043 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3044 slot of the identifier. */
3048 if ((TREE_CODE (newdecl) == FUNCTION_DECL
3049 && DECL_FUNCTION_TEMPLATE_P (olddecl))
3050 || (TREE_CODE (olddecl) == FUNCTION_DECL
3051 && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3054 cp_error ("`%#D' redeclared as different kind of symbol", newdecl);
3055 if (TREE_CODE (olddecl) == TREE_LIST)
3056 olddecl = TREE_VALUE (olddecl);
3057 cp_error_at ("previous declaration of `%#D'", olddecl);
3059 /* New decl is completely inconsistent with the old one =>
3060 tell caller to replace the old one. */
3064 else if (!types_match)
3066 if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl))
3067 /* These are certainly not duplicate declarations; they're
3068 from different scopes. */
3071 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3073 /* The name of a class template may not be declared to refer to
3074 any other template, class, function, object, namespace, value,
3075 or type in the same scope. */
3076 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3077 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3079 cp_error ("declaration of template `%#D'", newdecl);
3080 cp_error_at ("conflicts with previous declaration `%#D'",
3083 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3084 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3085 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3086 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3087 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3088 DECL_TEMPLATE_PARMS (olddecl)))
3090 cp_error ("new declaration `%#D'", newdecl);
3091 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3095 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3097 if (DECL_LANGUAGE (newdecl) == lang_c
3098 && DECL_LANGUAGE (olddecl) == lang_c)
3100 cp_error ("declaration of C function `%#D' conflicts with",
3102 cp_error_at ("previous declaration `%#D' here", olddecl);
3104 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3105 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3107 cp_error ("new declaration `%#D'", newdecl);
3108 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3114 /* Already complained about this, so don't do so again. */
3115 else if (current_class_type == NULL_TREE
3116 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3118 cp_error ("conflicting types for `%#D'", newdecl);
3119 cp_error_at ("previous declaration as `%#D'", olddecl);
3122 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3123 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3124 && (!DECL_TEMPLATE_INFO (newdecl)
3125 || (DECL_TI_TEMPLATE (newdecl)
3126 != DECL_TI_TEMPLATE (olddecl))))
3127 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3128 && (!DECL_TEMPLATE_INFO (olddecl)
3129 || (DECL_TI_TEMPLATE (olddecl)
3130 != DECL_TI_TEMPLATE (newdecl))))))
3131 /* It's OK to have a template specialization and a non-template
3132 with the same type, or to have specializations of two
3133 different templates with the same type. Note that if one is a
3134 specialization, and the other is an instantiation of the same
3135 template, that we do not exit at this point. That situation
3136 can occur if we instantiate a template class, and then
3137 specialize one of its methods. This situation is legal, but
3138 the declarations must be merged in the usual way. */
3140 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3141 && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3142 && !DECL_USE_TEMPLATE (newdecl))
3143 || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3144 && !DECL_USE_TEMPLATE (olddecl))))
3145 /* One of the declarations is a template instantiation, and the
3146 other is not a template at all. That's OK. */
3148 else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3149 && DECL_NAMESPACE_ALIAS (newdecl)
3150 && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3151 /* Redeclaration of namespace alias, ignore it. */
3155 const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3158 cp_error (errmsg, newdecl);
3159 if (DECL_NAME (olddecl) != NULL_TREE)
3160 cp_error_at ((DECL_INITIAL (olddecl)
3161 && namespace_bindings_p ())
3162 ? "`%#D' previously defined here"
3163 : "`%#D' previously declared here", olddecl);
3165 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3166 && DECL_INITIAL (olddecl) != NULL_TREE
3167 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3168 && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3170 /* Prototype decl follows defn w/o prototype. */
3171 cp_warning_at ("prototype for `%#D'", newdecl);
3172 cp_warning_at ("follows non-prototype definition here", olddecl);
3174 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3175 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3177 /* extern "C" int foo ();
3178 int foo () { bar (); }
3180 if (current_lang_stack == current_lang_base)
3181 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3184 cp_error_at ("previous declaration of `%#D' with %L linkage",
3185 olddecl, DECL_LANGUAGE (olddecl));
3186 cp_error ("conflicts with new declaration with %L linkage",
3187 DECL_LANGUAGE (newdecl));
3191 if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3193 else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3195 tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3196 tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3199 if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3200 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3202 for (; t1 && t1 != void_list_node;
3203 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3204 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3206 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3211 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3213 cp_pedwarn_at ("after previous specification in `%#D'",
3219 cp_error ("default argument given for parameter %d of `%#D'",
3221 cp_error_at ("after previous specification in `%#D'",
3226 if (DECL_THIS_INLINE (newdecl) && ! DECL_THIS_INLINE (olddecl)
3227 && TREE_ADDRESSABLE (olddecl) && warn_inline)
3229 cp_warning ("`%#D' was used before it was declared inline",
3231 cp_warning_at ("previous non-inline declaration here",
3237 /* If new decl is `static' and an `extern' was seen previously,
3239 warn_extern_redeclared_static (newdecl, olddecl);
3241 /* We have committed to returning 1 at this point. */
3242 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3244 /* Now that functions must hold information normally held
3245 by field decls, there is extra work to do so that
3246 declaration information does not get destroyed during
3248 if (DECL_VINDEX (olddecl))
3249 DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3250 if (DECL_CONTEXT (olddecl))
3251 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3252 if (DECL_CLASS_CONTEXT (olddecl))
3253 DECL_CLASS_CONTEXT (newdecl) = DECL_CLASS_CONTEXT (olddecl);
3254 if (DECL_PENDING_INLINE_INFO (newdecl) == (struct pending_inline *)0)
3255 DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3256 DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3257 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3258 DECL_ABSTRACT_VIRTUAL_P (newdecl) |= DECL_ABSTRACT_VIRTUAL_P (olddecl);
3259 DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3260 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3261 new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3263 /* Optionally warn about more than one declaration for the same
3264 name, but don't warn about a function declaration followed by a
3266 if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3267 && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3268 /* Don't warn about extern decl followed by definition. */
3269 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3270 /* Don't warn about friends, let add_friend take care of it. */
3271 && ! DECL_FRIEND_P (newdecl))
3273 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl);
3274 cp_warning_at ("previous declaration of `%D'", olddecl);
3278 /* Deal with C++: must preserve virtual function table size. */
3279 if (TREE_CODE (olddecl) == TYPE_DECL)
3281 register tree newtype = TREE_TYPE (newdecl);
3282 register tree oldtype = TREE_TYPE (olddecl);
3284 if (newtype != error_mark_node && oldtype != error_mark_node
3285 && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3287 CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3288 CLASSTYPE_FRIEND_CLASSES (newtype)
3289 = CLASSTYPE_FRIEND_CLASSES (oldtype);
3293 /* Copy all the DECL_... slots specified in the new decl
3294 except for any that we copy here from the old type. */
3295 DECL_MACHINE_ATTRIBUTES (newdecl)
3296 = merge_machine_decl_attributes (olddecl, newdecl);
3298 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3300 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl),
3301 DECL_TEMPLATE_RESULT (olddecl)))
3302 cp_error ("invalid redeclaration of %D", newdecl);
3303 TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3304 DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3305 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3306 DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3313 /* Automatically handles default parameters. */
3314 tree oldtype = TREE_TYPE (olddecl);
3317 /* Make sure we put the new type in the same obstack as the old one. */
3319 push_obstacks (TYPE_OBSTACK (oldtype), TYPE_OBSTACK (oldtype));
3322 push_obstacks_nochange ();
3323 end_temporary_allocation ();
3326 /* Merge the data types specified in the two decls. */
3327 newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3329 if (TREE_CODE (newdecl) == VAR_DECL)
3330 DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3331 /* Do this after calling `common_type' so that default
3332 parameters don't confuse us. */
3333 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3334 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3335 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3337 TREE_TYPE (newdecl) = build_exception_variant (newtype,
3338 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3339 TREE_TYPE (olddecl) = build_exception_variant (newtype,
3340 TYPE_RAISES_EXCEPTIONS (oldtype));
3342 if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3343 && DECL_SOURCE_LINE (olddecl) != 0
3345 && ! compexcepttypes (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
3347 cp_pedwarn ("declaration of `%D' throws different exceptions",
3349 cp_pedwarn_at ("previous declaration here", olddecl);
3352 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3354 /* Lay the type out, unless already done. */
3355 if (! same_type_p (newtype, oldtype)
3356 && TREE_TYPE (newdecl) != error_mark_node
3357 && !(processing_template_decl && uses_template_parms (newdecl)))
3358 layout_type (TREE_TYPE (newdecl));
3360 if ((TREE_CODE (newdecl) == VAR_DECL
3361 || TREE_CODE (newdecl) == PARM_DECL
3362 || TREE_CODE (newdecl) == RESULT_DECL
3363 || TREE_CODE (newdecl) == FIELD_DECL
3364 || TREE_CODE (newdecl) == TYPE_DECL)
3365 && !(processing_template_decl && uses_template_parms (newdecl)))
3366 layout_decl (newdecl, 0);
3368 /* Merge the type qualifiers. */
3369 if (TREE_READONLY (newdecl))
3370 TREE_READONLY (olddecl) = 1;
3371 if (TREE_THIS_VOLATILE (newdecl))
3372 TREE_THIS_VOLATILE (olddecl) = 1;
3374 /* Merge the initialization information. */
3375 if (DECL_INITIAL (newdecl) == NULL_TREE
3376 && DECL_INITIAL (olddecl) != NULL_TREE)
3378 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3379 DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3380 DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3381 if (DECL_LANG_SPECIFIC (newdecl)
3382 && DECL_LANG_SPECIFIC (olddecl))
3383 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3386 /* Merge the section attribute.
3387 We want to issue an error if the sections conflict but that must be
3388 done later in decl_attributes since we are called before attributes
3390 if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3391 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3393 /* Keep the old rtl since we can safely use it, unless it's the
3394 call to abort() used for abstract virtuals. */
3395 if ((DECL_LANG_SPECIFIC (olddecl)
3396 && !DECL_ABSTRACT_VIRTUAL_P (olddecl))
3397 || DECL_RTL (olddecl) != DECL_RTL (abort_fndecl))
3398 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3402 /* If cannot merge, then use the new type and qualifiers,
3403 and don't preserve the old rtl. */
3406 /* Clean out any memory we had of the old declaration. */
3407 tree oldstatic = value_member (olddecl, static_aggregates);
3409 TREE_VALUE (oldstatic) = error_mark_node;
3411 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3412 TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3413 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3414 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3417 /* Merge the storage class information. */
3418 DECL_WEAK (newdecl) |= DECL_WEAK (olddecl);
3419 DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3420 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3421 TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3422 if (! DECL_EXTERNAL (olddecl))
3423 DECL_EXTERNAL (newdecl) = 0;
3425 if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3427 DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3428 DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3429 DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3430 DECL_TEMPLATE_INSTANTIATED (newdecl)
3431 |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3432 /* Don't really know how much of the language-specific
3433 values we should copy from old to new. */
3434 DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3435 DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3436 DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3437 DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3438 olddecl_friend = DECL_FRIEND_P (olddecl);
3440 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3441 if (TREE_CODE (newdecl) == FUNCTION_DECL
3442 || DECL_FUNCTION_TEMPLATE_P (newdecl))
3443 DECL_BEFRIENDING_CLASSES (newdecl)
3444 = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3445 DECL_BEFRIENDING_CLASSES (olddecl));
3448 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3450 if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3451 && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3453 /* If newdecl is not a specialization, then it is not a
3454 template-related function at all. And that means that we
3455 shoud have exited above, returning 0. */
3456 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3459 if (TREE_USED (olddecl))
3460 /* From [temp.expl.spec]:
3462 If a template, a member template or the member of a class
3463 template is explicitly specialized then that
3464 specialization shall be declared before the first use of
3465 that specialization that would cause an implicit
3466 instantiation to take place, in every translation unit in
3467 which such a use occurs. */
3468 cp_error ("explicit specialization of %D after first use",
3471 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3473 DECL_THIS_INLINE (newdecl) |= DECL_THIS_INLINE (olddecl);
3475 /* If either decl says `inline', this fn is inline, unless its
3476 definition was passed already. */
3477 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3478 DECL_INLINE (olddecl) = 1;
3479 DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3483 DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3484 DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3485 DECL_RTL (olddecl) = DECL_RTL (newdecl);
3487 if (! types_match || new_defines_function)
3489 /* These need to be copied so that the names are available. */
3490 DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3491 DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3493 if (new_defines_function)
3494 /* If defining a function declared with other language
3495 linkage, use the previously declared language linkage. */
3496 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3499 /* If redeclaring a builtin function, and not a definition,
3500 it stays built in. */
3501 if (DECL_BUILT_IN (olddecl))
3503 DECL_BUILT_IN (newdecl) = 1;
3504 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3505 /* If we're keeping the built-in definition, keep the rtl,
3506 regardless of declaration matches. */
3507 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3510 DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
3512 DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3513 if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl)))
3514 /* Previously saved insns go together with
3515 the function's previous definition. */
3516 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3517 /* Don't clear out the arguments if we're redefining a function. */
3518 if (DECL_ARGUMENTS (olddecl))
3519 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3521 if (DECL_LANG_SPECIFIC (olddecl))
3522 DECL_MAIN_VARIANT (newdecl) = DECL_MAIN_VARIANT (olddecl);
3525 if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3527 NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3530 /* Now preserve various other info from the definition. */
3531 TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3532 TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3533 DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3534 DECL_ASSEMBLER_NAME (newdecl) = DECL_ASSEMBLER_NAME (olddecl);
3536 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3539 struct lang_decl *ol = DECL_LANG_SPECIFIC (olddecl);
3540 struct lang_decl *nl = DECL_LANG_SPECIFIC (newdecl);
3542 function_size = sizeof (struct tree_decl);
3544 bcopy ((char *) newdecl + sizeof (struct tree_common),
3545 (char *) olddecl + sizeof (struct tree_common),
3546 function_size - sizeof (struct tree_common));
3548 /* Can we safely free the storage used by newdecl? */
3550 #define ROUND(x) ((x + obstack_alignment_mask (&permanent_obstack)) \
3551 & ~ obstack_alignment_mask (&permanent_obstack))
3553 if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3555 /* If newdecl is a template instantiation, it is possible that
3556 the following sequence of events has occurred:
3558 o A friend function was declared in a class template. The
3559 class template was instantiated.
3561 o The instantiation of the friend declaration was
3562 recorded on the instantiation list, and is newdecl.
3564 o Later, however, instantiate_class_template called pushdecl
3565 on the newdecl to perform name injection. But, pushdecl in
3566 turn called duplicate_decls when it discovered that another
3567 declaration of a global function with the same name already
3570 o Here, in duplicate_decls, we decided to clobber newdecl.
3572 If we're going to do that, we'd better make sure that
3573 olddecl, and not newdecl, is on the list of
3574 instantiations so that if we try to do the instantiation
3575 again we won't get the clobbered declaration. */
3577 tree tmpl = DECL_TI_TEMPLATE (newdecl);
3578 tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3580 for (; decls; decls = TREE_CHAIN (decls))
3581 if (TREE_VALUE (decls) == newdecl)
3582 TREE_VALUE (decls) = olddecl;
3585 if (((char *)newdecl + ROUND (function_size) == (char *)nl
3586 && ((char *)newdecl + ROUND (function_size)
3587 + ROUND (sizeof (struct lang_decl))
3588 == obstack_next_free (&permanent_obstack)))
3589 || ((char *)newdecl + ROUND (function_size)
3590 == obstack_next_free (&permanent_obstack)))
3592 DECL_MAIN_VARIANT (newdecl) = olddecl;
3593 DECL_LANG_SPECIFIC (olddecl) = ol;
3594 bcopy ((char *)nl, (char *)ol, sizeof (struct lang_decl));
3596 obstack_free (&permanent_obstack, newdecl);
3598 else if (LANG_DECL_PERMANENT (ol) && ol != nl)
3600 if (DECL_MAIN_VARIANT (olddecl) == olddecl)
3602 /* Save these lang_decls that would otherwise be lost. */
3603 extern tree free_lang_decl_chain;
3604 tree free_lang_decl = (tree) ol;
3606 if (DECL_LANG_SPECIFIC (olddecl) == ol)
3609 TREE_CHAIN (free_lang_decl) = free_lang_decl_chain;
3610 free_lang_decl_chain = free_lang_decl;
3614 /* Storage leak. */;
3620 bcopy ((char *) newdecl + sizeof (struct tree_common),
3621 (char *) olddecl + sizeof (struct tree_common),
3622 sizeof (struct tree_decl) - sizeof (struct tree_common)
3623 + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3626 DECL_UID (olddecl) = olddecl_uid;
3628 DECL_FRIEND_P (olddecl) = 1;
3630 /* NEWDECL contains the merged attribute lists.
3631 Update OLDDECL to be the same. */
3632 DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl);
3637 /* Record a decl-node X as belonging to the current lexical scope.
3638 Check for errors (such as an incompatible declaration for the same
3639 name already seen in the same scope).
3641 Returns either X or an old decl for the same name.
3642 If an old decl is returned, it may have been smashed
3643 to agree with what X says. */
3650 register tree name = DECL_ASSEMBLER_NAME (x);
3651 int need_new_binding = 1;
3653 if (DECL_TEMPLATE_PARM_P (x))
3654 /* Template parameters have no context; they are not X::T even
3655 when declared within a class or namespace. */
3659 if (current_function_decl && x != current_function_decl
3660 /* A local declaration for a function doesn't constitute
3662 && (TREE_CODE (x) != FUNCTION_DECL || DECL_INITIAL (x))
3663 /* Don't change DECL_CONTEXT of virtual methods. */
3664 && (TREE_CODE (x) != FUNCTION_DECL || !DECL_VIRTUAL_P (x))
3665 && !DECL_CONTEXT (x))
3666 DECL_CONTEXT (x) = current_function_decl;
3667 if (!DECL_CONTEXT (x))
3668 DECL_CONTEXT (x) = FROB_CONTEXT (current_namespace);
3671 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3672 compiler wants to use. */
3673 if (TREE_CODE (x) == TYPE_DECL || TREE_CODE (x) == VAR_DECL
3674 || TREE_CODE (x) == NAMESPACE_DECL)
3675 name = DECL_NAME (x);
3680 /* Not needed...see below. */
3684 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3685 name = TREE_OPERAND (name, 0);
3687 /* Namespace-scoped variables are not found in the current level. */
3688 if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x))
3689 t = namespace_binding (name, DECL_CONTEXT (x));
3691 t = lookup_name_current_level (name);
3692 if (t == error_mark_node)
3694 /* error_mark_node is 0 for a while during initialization! */
3696 cp_error_at ("`%#D' used prior to declaration", x);
3699 else if (t != NULL_TREE)
3702 /* This is turned off until I have time to do it right (bpk). */
3703 /* With the code below that uses it... */
3704 file = DECL_SOURCE_FILE (t);
3705 line = DECL_SOURCE_LINE (t);
3707 if (TREE_CODE (t) == PARM_DECL)
3709 if (DECL_CONTEXT (t) == NULL_TREE)
3710 fatal ("parse errors have confused me too much");
3712 /* Check for duplicate params. */
3713 if (duplicate_decls (x, t))
3716 else if (((TREE_CODE (x) == FUNCTION_DECL && DECL_LANGUAGE (x) == lang_c)
3717 || DECL_FUNCTION_TEMPLATE_P (x))
3718 && is_overloaded_fn (t))
3719 /* Don't do anything just yet. */;
3720 else if (t == wchar_decl_node)
3722 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3723 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x));
3725 /* Throw away the redeclaration. */
3728 else if (TREE_CODE (t) != TREE_CODE (x))
3730 if (duplicate_decls (x, t))
3733 else if (duplicate_decls (x, t))
3736 /* This is turned off until I have time to do it right (bpk). */
3738 /* Also warn if they did a prototype with `static' on it, but
3739 then later left the `static' off. */
3740 if (! TREE_PUBLIC (name) && TREE_PUBLIC (x))
3742 if (DECL_LANG_SPECIFIC (t) && DECL_FRIEND_P (t))
3747 cp_warning ("`static' missing from declaration of `%D'",
3749 warning_with_file_and_line (file, line,
3750 "previous declaration of `%s'",
3751 decl_as_string (t, 0));
3754 /* Now fix things so it'll do what they expect. */
3755 if (current_function_decl)
3756 TREE_PUBLIC (current_function_decl) = 0;
3758 /* Due to interference in memory reclamation (X may be
3759 obstack-deallocated at this point), we must guard against
3760 one really special case. [jason: This should be handled
3761 by start_function] */
3762 if (current_function_decl == x)
3763 current_function_decl = t;
3765 if (TREE_CODE (t) == TYPE_DECL)
3766 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3767 else if (TREE_CODE (t) == FUNCTION_DECL)
3768 check_default_args (t);
3772 else if (DECL_MAIN_P (x))
3774 /* A redeclaration of main, but not a duplicate of the
3779 This function shall not be overloaded. */
3780 cp_error_at ("invalid redeclaration of `%D'", t);
3781 cp_error ("as `%D'", x);
3782 /* We don't try to push this declaration since that
3788 check_template_shadow (x);
3790 /* If this is a function conjured up by the backend, massage it
3791 so it looks friendly. */
3792 if (TREE_CODE (x) == FUNCTION_DECL
3793 && ! DECL_LANG_SPECIFIC (x))
3795 retrofit_lang_decl (x);
3796 DECL_LANGUAGE (x) = lang_c;
3799 if (TREE_CODE (x) == FUNCTION_DECL && ! DECL_FUNCTION_MEMBER_P (x))
3801 t = push_overloaded_decl (x, PUSH_LOCAL);
3802 if (t != x || DECL_LANGUAGE (x) == lang_c)
3804 if (!namespace_bindings_p ())
3805 /* We do not need to create a binding for this name;
3806 push_overloaded_decl will have already done so if
3808 need_new_binding = 0;
3810 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3811 return push_overloaded_decl (x, PUSH_GLOBAL);
3813 /* If declaring a type as a typedef, copy the type (unless we're
3814 at line 0), and install this TYPE_DECL as the new type's typedef
3815 name. See the extensive comment in ../c-decl.c (pushdecl). */
3816 if (TREE_CODE (x) == TYPE_DECL)
3818 tree type = TREE_TYPE (x);
3819 if (DECL_SOURCE_LINE (x) == 0)
3821 if (TYPE_NAME (type) == 0)
3822 TYPE_NAME (type) = x;
3824 else if (type != error_mark_node && TYPE_NAME (type) != x
3825 /* We don't want to copy the type when all we're
3826 doing is making a TYPE_DECL for the purposes of
3828 && (!TYPE_NAME (type)
3829 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
3831 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
3833 DECL_ORIGINAL_TYPE (x) = type;
3834 type = build_type_copy (type);
3835 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
3836 TYPE_NAME (type) = x;
3837 TREE_TYPE (x) = type;
3842 if (type != error_mark_node
3844 && TYPE_IDENTIFIER (type))
3845 set_identifier_type_value_with_scope (DECL_NAME (x), type,
3846 current_binding_level);
3850 /* Multiple external decls of the same identifier ought to match.
3852 We get warnings about inline functions where they are defined.
3853 We get warnings about other functions from push_overloaded_decl.
3855 Avoid duplicate warnings where they are used. */
3856 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
3860 if (IDENTIFIER_NAMESPACE_VALUE (name) != NULL_TREE
3861 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name))
3862 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name))))
3863 decl = IDENTIFIER_NAMESPACE_VALUE (name);
3868 /* If different sort of thing, we already gave an error. */
3869 && TREE_CODE (decl) == TREE_CODE (x)
3870 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
3872 cp_pedwarn ("type mismatch with previous external decl", x);
3873 cp_pedwarn_at ("previous external decl of `%#D'", decl);
3877 /* This name is new in its binding level.
3878 Install the new declaration and return it. */
3879 if (namespace_bindings_p ())
3881 /* Install a global value. */
3883 /* If the first global decl has external linkage,
3884 warn if we later see static one. */
3885 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
3886 TREE_PUBLIC (name) = 1;
3888 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
3891 if (TREE_CODE (x) == FUNCTION_DECL)
3893 ((IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE)
3894 || (IDENTIFIER_GLOBAL_VALUE (name) == x), 378);
3895 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
3898 /* Don't forget if the function was used via an implicit decl. */
3899 if (IDENTIFIER_IMPLICIT_DECL (name)
3900 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
3903 /* Don't forget if its address was taken in that way. */
3904 if (IDENTIFIER_IMPLICIT_DECL (name)
3905 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
3906 TREE_ADDRESSABLE (x) = 1;
3908 /* Warn about mismatches against previous implicit decl. */
3909 if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
3910 /* If this real decl matches the implicit, don't complain. */
3911 && ! (TREE_CODE (x) == FUNCTION_DECL
3912 && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
3914 ("`%D' was previously implicitly declared to return `int'", x);
3916 /* If new decl is `static' and an `extern' was seen previously,
3918 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
3919 warn_extern_redeclared_static (x, t);
3923 /* Here to install a non-global value. */
3924 tree oldlocal = IDENTIFIER_VALUE (name);
3925 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
3927 if (need_new_binding)
3929 push_local_binding (name, x, 0);
3930 /* Because push_local_binding will hook X on to the
3931 current_binding_level's name list, we don't want to
3932 do that again below. */
3933 need_new_binding = 0;
3936 /* If this is a TYPE_DECL, push it into the type value slot. */
3937 if (TREE_CODE (x) == TYPE_DECL)
3938 set_identifier_type_value_with_scope (name, TREE_TYPE (x),
3939 current_binding_level);
3941 /* Clear out any TYPE_DECL shadowed by a namespace so that
3942 we won't think this is a type. The C struct hack doesn't
3943 go through namespaces. */
3944 if (TREE_CODE (x) == NAMESPACE_DECL)
3945 set_identifier_type_value_with_scope (name, NULL_TREE,
3946 current_binding_level);
3948 /* If this is an extern function declaration, see if we
3949 have a global definition or declaration for the function. */
3950 if (oldlocal == NULL_TREE
3951 && DECL_EXTERNAL (x)
3952 && oldglobal != NULL_TREE
3953 && TREE_CODE (x) == FUNCTION_DECL
3954 && TREE_CODE (oldglobal) == FUNCTION_DECL)
3956 /* We have one. Their types must agree. */
3957 if (decls_match (x, oldglobal))
3961 cp_warning ("extern declaration of `%#D' doesn't match", x);
3962 cp_warning_at ("global declaration `%#D'", oldglobal);
3965 /* If we have a local external declaration,
3966 and no file-scope declaration has yet been seen,
3967 then if we later have a file-scope decl it must not be static. */
3968 if (oldlocal == NULL_TREE
3969 && oldglobal == NULL_TREE
3970 && DECL_EXTERNAL (x)
3972 TREE_PUBLIC (name) = 1;
3974 if (DECL_FROM_INLINE (x))
3975 /* Inline decls shadow nothing. */;
3977 /* Warn if shadowing an argument at the top level of the body. */
3978 else if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
3979 && TREE_CODE (oldlocal) == PARM_DECL
3980 && TREE_CODE (x) != PARM_DECL)
3982 /* Go to where the parms should be and see if we
3984 struct binding_level *b = current_binding_level->level_chain;
3990 if (b->parm_flag == 1)
3991 cp_error ("declaration of `%#D' shadows a parameter", name);
3993 else if (warn_shadow && oldlocal != NULL_TREE
3994 && current_binding_level->is_for_scope
3995 && !DECL_DEAD_FOR_LOCAL (oldlocal))
3997 warning ("variable `%s' shadows local",
3998 IDENTIFIER_POINTER (name));
3999 cp_warning_at (" this is the shadowed declaration", oldlocal);
4001 /* Maybe warn if shadowing something else. */
4002 else if (warn_shadow && !DECL_EXTERNAL (x)
4003 /* No shadow warnings for internally generated vars. */
4004 && ! DECL_ARTIFICIAL (x)
4005 /* No shadow warnings for vars made for inlining. */
4006 && ! DECL_FROM_INLINE (x))
4008 const char *warnstring = NULL;
4010 if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL)
4011 warnstring = "declaration of `%s' shadows a parameter";
4012 else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4013 && current_class_ptr
4014 && !TREE_STATIC (name))
4015 warnstring = "declaration of `%s' shadows a member of `this'";
4016 else if (oldlocal != NULL_TREE)
4017 warnstring = "declaration of `%s' shadows previous local";
4018 else if (oldglobal != NULL_TREE)
4019 /* XXX shadow warnings in outer-more namespaces */
4020 warnstring = "declaration of `%s' shadows global declaration";
4023 warning (warnstring, IDENTIFIER_POINTER (name));
4027 if (TREE_CODE (x) == FUNCTION_DECL)
4028 check_default_args (x);
4030 /* Keep count of variables in this level with incomplete type. */
4031 if (TREE_CODE (x) == VAR_DECL
4032 && TREE_TYPE (x) != error_mark_node
4033 && ((TYPE_SIZE (TREE_TYPE (x)) == NULL_TREE
4034 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE))
4035 /* RTTI TD entries are created while defining the type_info. */
4036 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x))
4037 && TYPE_BEING_DEFINED (TREE_TYPE (x)))))
4038 current_binding_level->incomplete
4039 = tree_cons (NULL_TREE, x, current_binding_level->incomplete);
4042 if (need_new_binding)
4044 /* Put decls on list in reverse order.
4045 We will reverse them later if necessary. */
4046 TREE_CHAIN (x) = current_binding_level->names;
4047 current_binding_level->names = x;
4048 if (current_binding_level == global_binding_level
4049 && !TREE_PERMANENT (x))
4050 my_friendly_abort (124);
4056 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4057 caller to set DECL_CONTEXT properly. */
4060 pushdecl_with_scope (x, level)
4062 struct binding_level *level;
4064 register struct binding_level *b;
4065 tree function_decl = current_function_decl;
4067 current_function_decl = NULL_TREE;
4068 if (level->parm_flag == 2)
4070 b = class_binding_level;
4071 class_binding_level = level;
4072 pushdecl_class_level (x);
4073 class_binding_level = b;
4077 b = current_binding_level;
4078 current_binding_level = level;
4080 current_binding_level = b;
4082 current_function_decl = function_decl;
4086 /* Like pushdecl, only it places X in the current namespace,
4090 pushdecl_namespace_level (x)
4093 register struct binding_level *b = current_binding_level;
4096 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4098 /* Now, the type_shadowed stack may screw us. Munge it so it does
4100 if (TREE_CODE (x) == TYPE_DECL)
4102 tree name = DECL_NAME (x);
4104 tree *ptr = (tree *)0;
4105 for (; b != global_binding_level; b = b->level_chain)
4107 tree shadowed = b->type_shadowed;
4108 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4109 if (TREE_PURPOSE (shadowed) == name)
4111 ptr = &TREE_VALUE (shadowed);
4112 /* Can't break out of the loop here because sometimes
4113 a binding level will have duplicate bindings for
4114 PT names. It's gross, but I haven't time to fix it. */
4117 newval = TREE_TYPE (x);
4118 if (ptr == (tree *)0)
4120 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4121 up here if this is changed to an assertion. --KR */
4122 SET_IDENTIFIER_TYPE_VALUE (name, newval);
4132 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4136 pushdecl_top_level (x)
4139 tree cur_namespace = current_namespace;
4140 current_namespace = global_namespace;
4141 x = pushdecl_namespace_level (x);
4142 current_namespace = cur_namespace;
4146 /* Make the declaration of X appear in CLASS scope. */
4149 pushdecl_class_level (x)
4152 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4153 scope looks for the pre-mangled name. */
4156 if (TREE_CODE (x) == OVERLOAD)
4157 x = OVL_CURRENT (x);
4158 name = DECL_NAME (x);
4162 push_class_level_binding (name, x);
4163 if (TREE_CODE (x) == TYPE_DECL)
4164 set_identifier_type_value (name, TREE_TYPE (x));
4166 else if (ANON_UNION_TYPE_P (TREE_TYPE (x)))
4170 for (f = TYPE_FIELDS (TREE_TYPE (x));
4173 pushdecl_class_level (f);
4178 /* This function is used to push the mangled decls for nested types into
4179 the appropriate scope. Previously pushdecl_top_level was used, but that
4180 is incorrect for members of local classes. */
4183 pushdecl_nonclass_level (x)
4186 struct binding_level *b = current_binding_level;
4188 my_friendly_assert (b->parm_flag != 2, 180);
4191 /* Get out of template binding levels */
4192 while (b->pseudo_global)
4196 pushdecl_with_scope (x, b);
4200 /* Make the declaration(s) of X appear in CLASS scope
4201 under the name NAME. */
4204 push_class_level_binding (name, x)
4209 /* The class_binding_level will be NULL if x is a template
4210 parameter name in a member template. */
4211 if (!class_binding_level)
4214 /* Make sure that this new member does not have the same name
4215 as a template parameter. */
4216 if (TYPE_BEING_DEFINED (current_class_type))
4217 check_template_shadow (x);
4219 /* If this declaration shadows a declaration from an enclosing
4220 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4221 we leave this class. Record the shadowed declaration here. */
4222 binding = IDENTIFIER_BINDING (name);
4224 && ((TREE_CODE (x) == OVERLOAD
4225 && BINDING_VALUE (binding)
4226 && is_overloaded_fn (BINDING_VALUE (binding)))
4227 || INHERITED_VALUE_BINDING_P (binding)))
4232 /* If the old binding was from a base class, and was for a tag
4233 name, slide it over to make room for the new binding. The
4234 old binding is still visible if explicitly qualified with a
4236 if (INHERITED_VALUE_BINDING_P (binding)
4237 && BINDING_VALUE (binding)
4238 && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4239 && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4240 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4242 old_decl = BINDING_TYPE (binding);
4243 BINDING_TYPE (binding) = BINDING_VALUE (binding);
4244 BINDING_VALUE (binding) = NULL_TREE;
4245 INHERITED_VALUE_BINDING_P (binding) = 0;
4248 old_decl = BINDING_VALUE (binding);
4250 /* There was already a binding for X containing fewer
4251 functions than are named in X. Find the previous
4252 declaration of X on the class-shadowed list, and update it. */
4253 for (shadow = class_binding_level->class_shadowed;
4255 shadow = TREE_CHAIN (shadow))
4256 if (TREE_PURPOSE (shadow) == name
4257 && TREE_TYPE (shadow) == old_decl)
4259 BINDING_VALUE (binding) = x;
4260 INHERITED_VALUE_BINDING_P (binding) = 0;
4261 TREE_TYPE (shadow) = x;
4266 /* If we didn't replace an existing binding, put the binding on the
4267 stack of bindings for the identifier, and update
4268 IDENTIFIER_CLASS_VALUE. */
4269 if (push_class_binding (name, x))
4271 maybe_push_cache_obstack ();
4272 class_binding_level->class_shadowed
4273 = tree_cons (name, IDENTIFIER_CLASS_VALUE (name),
4274 class_binding_level->class_shadowed);
4276 /* Record the value we are binding NAME to so that we can know
4277 what to pop later. */
4278 TREE_TYPE (class_binding_level->class_shadowed) = x;
4282 /* Insert another USING_DECL into the current binding level,
4283 returning this declaration. If this is a redeclaration,
4284 do nothing and return NULL_TREE. */
4287 push_using_decl (scope, name)
4293 my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4294 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4295 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4296 if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4300 decl = build_lang_decl (USING_DECL, name, void_type_node);
4301 DECL_INITIAL (decl) = scope;
4302 TREE_CHAIN (decl) = current_binding_level->usings;
4303 current_binding_level->usings = decl;
4307 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4308 changed (i.e. there was already a directive), or the fresh
4309 TREE_LIST otherwise. */
4312 push_using_directive (used)
4315 tree ud = current_binding_level->using_directives;
4316 tree iter, ancestor;
4318 /* Check if we already have this. */
4319 if (purpose_member (used, ud) != NULL_TREE)
4322 /* Recursively add all namespaces used. */
4323 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4324 push_using_directive (TREE_PURPOSE (iter));
4326 ancestor = namespace_ancestor (current_decl_namespace (), used);
4327 ud = current_binding_level->using_directives;
4328 ud = perm_tree_cons (used, ancestor, ud);
4329 current_binding_level->using_directives = ud;
4333 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4334 other definitions already in place. We get around this by making
4335 the value of the identifier point to a list of all the things that
4336 want to be referenced by that name. It is then up to the users of
4337 that name to decide what to do with that list.
4339 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4340 slot. It is dealt with the same way.
4342 FLAGS is a bitwise-or of the following values:
4343 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4345 PUSH_USING: DECL is being pushed as the result of a using
4348 The value returned may be a previous declaration if we guessed wrong
4349 about what language DECL should belong to (C or C++). Otherwise,
4350 it's always DECL (and never something that's not a _DECL). */
4353 push_overloaded_decl (decl, flags)
4357 tree name = DECL_NAME (decl);
4360 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4364 old = namespace_binding (name, DECL_CONTEXT (decl));
4365 if (old && TREE_CODE (old) == FUNCTION_DECL
4366 && DECL_ARTIFICIAL (old)
4367 && (DECL_BUILT_IN (old) || DECL_BUILT_IN_NONANSI (old)))
4369 if (duplicate_decls (decl, old))
4375 old = lookup_name_current_level (name);
4379 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4381 tree t = TREE_TYPE (old);
4382 if (IS_AGGR_TYPE (t) && warn_shadow
4383 && (! DECL_IN_SYSTEM_HEADER (decl)
4384 || ! DECL_IN_SYSTEM_HEADER (old)))
4385 cp_warning ("`%#D' hides constructor for `%#T'", decl, t);
4388 else if (is_overloaded_fn (old))
4392 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4394 tree fn = OVL_CURRENT (tmp);
4396 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4397 && !(flags & PUSH_USING)
4398 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4399 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4400 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4403 if (duplicate_decls (decl, fn))
4409 cp_error_at ("previous non-function declaration `%#D'", old);
4410 cp_error ("conflicts with function declaration `%#D'", decl);
4415 if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4417 if (old && TREE_CODE (old) != OVERLOAD)
4418 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4420 new_binding = ovl_cons (decl, old);
4421 if (flags & PUSH_USING)
4422 OVL_USED (new_binding) = 1;
4425 /* NAME is not ambiguous. */
4429 set_namespace_binding (name, current_namespace, new_binding);
4432 /* We only create an OVERLOAD if there was a previous binding at
4433 this level, or if decl is a template. In the former case, we
4434 need to remove the old binding and replace it with the new
4435 binding. We must also run through the NAMES on the binding
4436 level where the name was bound to update the chain. */
4438 if (TREE_CODE (new_binding) == OVERLOAD && old)
4442 for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4444 d = &TREE_CHAIN (*d))
4446 || (TREE_CODE (*d) == TREE_LIST
4447 && TREE_VALUE (*d) == old))
4449 if (TREE_CODE (*d) == TREE_LIST)
4450 /* Just replace the old binding with the new. */
4451 TREE_VALUE (*d) = new_binding;
4453 /* Build a TREE_LIST to wrap the OVERLOAD. */
4454 *d = build_tree_list (NULL_TREE, new_binding);
4456 /* And update the CPLUS_BINDING node. */
4457 BINDING_VALUE (IDENTIFIER_BINDING (name))
4462 /* We should always find a previous binding in this case. */
4463 my_friendly_abort (0);
4466 /* Install the new binding. */
4467 push_local_binding (name, new_binding, flags);
4473 /* Generate an implicit declaration for identifier FUNCTIONID
4474 as a function of type int (). Print a warning if appropriate. */
4477 implicitly_declare (functionid)
4481 int temp = allocation_temporary_p ();
4483 push_obstacks_nochange ();
4485 /* Save the decl permanently so we can warn if definition follows.
4486 In ANSI C, warn_implicit is usually false, so the saves little space.
4487 But in C++, it's usually true, hence the extra code. */
4488 if (temp && (! warn_implicit || toplevel_bindings_p ()))
4489 end_temporary_allocation ();
4491 /* We used to reuse an old implicit decl here,
4492 but this loses with inline functions because it can clobber
4493 the saved decl chains. */
4494 decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4496 DECL_EXTERNAL (decl) = 1;
4497 TREE_PUBLIC (decl) = 1;
4499 /* ANSI standard says implicit declarations are in the innermost block.
4500 So we record the decl in the standard fashion. */
4502 rest_of_decl_compilation (decl, NULL_PTR, 0, 0);
4505 /* Only one warning per identifier. */
4506 && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4508 cp_pedwarn ("implicit declaration of function `%#D'", decl);
4511 SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4518 /* Return zero if the declaration NEWDECL is valid
4519 when the declaration OLDDECL (assumed to be for the same name)
4520 has already been seen.
4521 Otherwise return an error message format string with a %s
4522 where the identifier should go. */
4525 redeclaration_error_message (newdecl, olddecl)
4526 tree newdecl, olddecl;
4528 if (TREE_CODE (newdecl) == TYPE_DECL)
4530 /* Because C++ can put things into name space for free,
4531 constructs like "typedef struct foo { ... } foo"
4532 would look like an erroneous redeclaration. */
4533 if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4536 return "redefinition of `%#D'";
4538 else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4540 /* If this is a pure function, its olddecl will actually be
4541 the original initialization to `0' (which we force to call
4542 abort()). Don't complain about redefinition in this case. */
4543 if (DECL_LANG_SPECIFIC (olddecl) && DECL_ABSTRACT_VIRTUAL_P (olddecl))
4546 /* If both functions come from different namespaces, this is not
4547 a redeclaration - this is a conflict with a used function. */
4548 if (DECL_NAMESPACE_SCOPE_P (olddecl)
4549 && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4550 return "`%D' conflicts with used function";
4552 /* We'll complain about linkage mismatches in
4553 warn_extern_redeclared_static. */
4555 /* Defining the same name twice is no good. */
4556 if (DECL_INITIAL (olddecl) != NULL_TREE
4557 && DECL_INITIAL (newdecl) != NULL_TREE)
4559 if (DECL_NAME (olddecl) == NULL_TREE)
4560 return "`%#D' not declared in class";
4562 return "redefinition of `%#D'";
4566 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4568 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4569 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4570 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4571 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4572 && TYPE_SIZE (TREE_TYPE (newdecl))
4573 && TYPE_SIZE (TREE_TYPE (olddecl))))
4574 return "redefinition of `%#D'";
4577 else if (toplevel_bindings_p ())
4579 /* Objects declared at top level: */
4580 /* If at least one is a reference, it's ok. */
4581 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4583 /* Reject two definitions. */
4584 return "redefinition of `%#D'";
4588 /* Objects declared with block scope: */
4589 /* Reject two definitions, and reject a definition
4590 together with an external reference. */
4591 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4592 return "redeclaration of `%#D'";
4597 /* Get the LABEL_DECL corresponding to identifier ID as a label.
4598 Create one if none exists so far for the current function.
4599 This function is called for both label definitions and label references. */
4605 register tree decl = IDENTIFIER_LABEL_VALUE (id);
4607 if (current_function_decl == NULL_TREE)
4609 error ("label `%s' referenced outside of any function",
4610 IDENTIFIER_POINTER (id));
4614 if ((decl == NULL_TREE
4615 || DECL_SOURCE_LINE (decl) == 0)
4616 && (named_label_uses == NULL
4617 || named_label_uses->names_in_scope != current_binding_level->names
4618 || named_label_uses->label_decl != decl))
4620 struct named_label_list *new_ent;
4622 = (struct named_label_list*)oballoc (sizeof (struct named_label_list));
4623 new_ent->label_decl = decl;
4624 new_ent->names_in_scope = current_binding_level->names;
4625 new_ent->binding_level = current_binding_level;
4626 new_ent->lineno_o_goto = lineno;
4627 new_ent->filename_o_goto = input_filename;
4628 new_ent->next = named_label_uses;
4629 named_label_uses = new_ent;
4632 /* Use a label already defined or ref'd with this name. */
4633 if (decl != NULL_TREE)
4635 /* But not if it is inherited and wasn't declared to be inheritable. */
4636 if (DECL_CONTEXT (decl) != current_function_decl
4637 && ! C_DECLARED_LABEL_FLAG (decl))
4638 return shadow_label (id);
4642 decl = build_decl (LABEL_DECL, id, void_type_node);
4644 /* Make sure every label has an rtx. */
4647 /* A label not explicitly declared must be local to where it's ref'd. */
4648 DECL_CONTEXT (decl) = current_function_decl;
4650 DECL_MODE (decl) = VOIDmode;
4652 /* Say where one reference is to the label,
4653 for the sake of the error if it is not defined. */
4654 DECL_SOURCE_LINE (decl) = lineno;
4655 DECL_SOURCE_FILE (decl) = input_filename;
4657 SET_IDENTIFIER_LABEL_VALUE (id, decl);
4659 named_labels = tree_cons (NULL_TREE, decl, named_labels);
4660 named_label_uses->label_decl = decl;
4665 /* Make a label named NAME in the current function,
4666 shadowing silently any that may be inherited from containing functions
4667 or containing scopes.
4669 Note that valid use, if the label being shadowed
4670 comes from another scope in the same function,
4671 requires calling declare_nonlocal_label right away. */
4677 register tree decl = IDENTIFIER_LABEL_VALUE (name);
4679 if (decl != NULL_TREE)
4681 shadowed_labels = tree_cons (NULL_TREE, decl, shadowed_labels);
4682 SET_IDENTIFIER_LABEL_VALUE (name, NULL_TREE);
4685 return lookup_label (name);
4688 /* Define a label, specifying the location in the source file.
4689 Return the LABEL_DECL node for the label, if the definition is valid.
4690 Otherwise return 0. */
4693 define_label (filename, line, name)
4700 if (minimal_parse_mode)
4702 push_obstacks (&permanent_obstack, &permanent_obstack);
4703 decl = build_decl (LABEL_DECL, name, void_type_node);
4705 DECL_SOURCE_LINE (decl) = line;
4706 DECL_SOURCE_FILE (decl) = filename;
4711 decl = lookup_label (name);
4713 /* After labels, make any new cleanups go into their
4714 own new (temporary) binding contour. */
4715 current_binding_level->more_cleanups_ok = 0;
4717 /* If label with this name is known from an outer context, shadow it. */
4718 if (decl != NULL_TREE && DECL_CONTEXT (decl) != current_function_decl)
4720 shadowed_labels = tree_cons (NULL_TREE, decl, shadowed_labels);
4721 SET_IDENTIFIER_LABEL_VALUE (name, NULL_TREE);
4722 decl = lookup_label (name);
4725 if (name == get_identifier ("wchar_t"))
4726 cp_pedwarn ("label named wchar_t");
4728 if (DECL_INITIAL (decl) != NULL_TREE)
4730 cp_error ("duplicate label `%D'", decl);
4735 struct named_label_list *uses, *prev;
4738 /* Mark label as having been defined. */
4739 DECL_INITIAL (decl) = error_mark_node;
4740 /* Say where in the source. */
4741 DECL_SOURCE_FILE (decl) = filename;
4742 DECL_SOURCE_LINE (decl) = line;
4745 uses = named_label_uses;
4746 while (uses != NULL)
4747 if (uses->label_decl == decl)
4749 struct binding_level *b = current_binding_level;
4752 tree new_decls = b->names;
4753 tree old_decls = (b == uses->binding_level)
4754 ? uses->names_in_scope : NULL_TREE;
4755 while (new_decls != old_decls)
4757 if (TREE_CODE (new_decls) == VAR_DECL
4758 /* Don't complain about crossing initialization
4759 of internal entities. They can't be accessed,
4760 and they should be cleaned up
4761 by the time we get to the label. */
4762 && ! DECL_ARTIFICIAL (new_decls)
4763 && !(DECL_INITIAL (new_decls) == NULL_TREE
4764 && pod_type_p (TREE_TYPE (new_decls))))
4768 cp_error ("jump to label `%D'", decl);
4769 error_with_file_and_line (uses->filename_o_goto,
4770 uses->lineno_o_goto,
4774 if (DECL_INITIAL (new_decls)
4775 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls)))
4776 cp_error_at (" crosses initialization of `%#D'",
4779 cp_error_at (" enters scope of non-POD `%#D'",
4782 new_decls = TREE_CHAIN (new_decls);
4784 if (b == uses->binding_level)
4790 prev->next = uses->next;
4792 named_label_uses = uses->next;
4801 current_function_return_value = NULL_TREE;
4808 struct binding_level *level;
4809 struct cp_switch *next;
4812 static struct cp_switch *switch_stack;
4818 = (struct cp_switch *) oballoc (sizeof (struct cp_switch));
4819 p->level = current_binding_level;
4820 p->next = switch_stack;
4827 switch_stack = switch_stack->next;
4830 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4831 /* XXX Note decl is never actually used. (bpk) */
4834 define_case_label ()
4836 tree cleanup = last_cleanup_this_contour ();
4837 struct binding_level *b = current_binding_level;
4842 static int explained = 0;
4843 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup));
4844 warning ("where case label appears here");
4847 warning ("(enclose actions of previous case statements requiring");
4848 warning ("destructors in their own binding contours.)");
4853 for (; b && b != switch_stack->level; b = b->level_chain)
4855 tree new_decls = b->names;
4856 for (; new_decls; new_decls = TREE_CHAIN (new_decls))
4858 if (TREE_CODE (new_decls) == VAR_DECL
4859 /* Don't complain about crossing initialization
4860 of internal entities. They can't be accessed,
4861 and they should be cleaned up
4862 by the time we get to the label. */
4863 && ! DECL_ARTIFICIAL (new_decls)
4864 && ((DECL_INITIAL (new_decls) != NULL_TREE
4865 && DECL_INITIAL (new_decls) != error_mark_node)
4866 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls))))
4869 error ("jump to case label");
4871 cp_error_at (" crosses initialization of `%#D'",
4877 /* After labels, make any new cleanups go into their
4878 own new (temporary) binding contour. */
4880 current_binding_level->more_cleanups_ok = 0;
4881 current_function_return_value = NULL_TREE;
4884 /* Return the list of declarations of the current level.
4885 Note that this list is in reverse order unless/until
4886 you nreverse it; and when you do nreverse it, you must
4887 store the result back using `storedecls' or you will lose. */
4892 return current_binding_level->names;
4895 /* Return the list of type-tags (for structs, etc) of the current level. */
4900 return current_binding_level->tags;
4903 /* Store the list of declarations of the current level.
4904 This is done for the parameter declarations of a function being defined,
4905 after they are modified in the light of any missing parameters. */
4911 current_binding_level->names = decls;
4914 /* Similarly, store the list of tags of the current level. */
4920 current_binding_level->tags = tags;
4923 /* Given NAME, an IDENTIFIER_NODE,
4924 return the structure (or union or enum) definition for that name.
4925 Searches binding levels from BINDING_LEVEL up to the global level.
4926 If THISLEVEL_ONLY is nonzero, searches only the specified context
4927 (but skips any tag-transparent contexts to find one that is
4928 meaningful for tags).
4929 FORM says which kind of type the caller wants;
4930 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4931 If the wrong kind of type is found, and it's not a template, an error is
4935 lookup_tag (form, name, binding_level, thislevel_only)
4936 enum tree_code form;
4938 struct binding_level *binding_level;
4941 register struct binding_level *level;
4942 /* Non-zero if, we should look past a pseudo-global level, even if
4944 int allow_pseudo_global = 1;
4946 for (level = binding_level; level; level = level->level_chain)
4949 if (ANON_AGGRNAME_P (name))
4950 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
4952 /* There's no need for error checking here, because
4953 anon names are unique throughout the compilation. */
4954 if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
4955 return TREE_VALUE (tail);
4957 else if (level->namespace_p)
4958 /* Do namespace lookup. */
4959 for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
4961 tree old = binding_for_name (name, tail);
4963 /* If we just skipped past a pseudo global level, even
4964 though THISLEVEL_ONLY, and we find a template class
4965 declaration, then we use the _TYPE node for the
4966 template. See the example below. */
4967 if (thislevel_only && !allow_pseudo_global
4968 && old && BINDING_VALUE (old)
4969 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
4970 old = TREE_TYPE (BINDING_VALUE (old));
4972 old = BINDING_TYPE (old);
4974 /* If it has an original type, it is a typedef, and we
4975 should not return it. */
4976 if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old)))
4978 if (old && TREE_CODE (old) != form
4979 && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL))
4981 cp_error ("`%#D' redeclared as %C", old, form);
4986 if (thislevel_only || tail == global_namespace)
4990 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
4992 if (TREE_PURPOSE (tail) == name)
4994 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
4995 /* Should tighten this up; it'll probably permit
4996 UNION_TYPE and a struct template, for example. */
4998 && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL))
5000 /* Definition isn't the kind we were looking for. */
5001 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail),
5005 return TREE_VALUE (tail);
5008 if (thislevel_only && ! level->tag_transparent)
5010 if (level->pseudo_global && allow_pseudo_global)
5012 /* We must deal with cases like this:
5014 template <class T> struct S;
5015 template <class T> struct S {};
5017 When looking up `S', for the second declaration, we
5018 would like to find the first declaration. But, we
5019 are in the pseudo-global level created for the
5020 template parameters, rather than the (surrounding)
5021 namespace level. Thus, we keep going one more level,
5022 even though THISLEVEL_ONLY is non-zero. */
5023 allow_pseudo_global = 0;
5029 if (current_class_type && level->level_chain->namespace_p)
5031 /* Try looking in this class's tags before heading into
5032 global binding level. */
5033 tree context = current_class_type;
5036 switch (TREE_CODE_CLASS (TREE_CODE (context)))
5040 these_tags = CLASSTYPE_TAGS (context);
5041 if (ANON_AGGRNAME_P (name))
5044 if (TYPE_IDENTIFIER (TREE_VALUE (these_tags))
5046 return TREE_VALUE (tail);
5047 these_tags = TREE_CHAIN (these_tags);
5052 if (TREE_PURPOSE (these_tags) == name)
5054 if (TREE_CODE (TREE_VALUE (these_tags)) != form)
5056 cp_error ("`%#D' redeclared as %C in class scope",
5057 TREE_VALUE (tail), form);
5060 return TREE_VALUE (tail);
5062 these_tags = TREE_CHAIN (these_tags);
5064 /* If this type is not yet complete, then don't
5065 look at its context. */
5066 if (TYPE_SIZE (context) == NULL_TREE)
5068 /* Go to next enclosing type, if any. */
5069 context = DECL_CONTEXT (TYPE_MAIN_DECL (context));
5072 context = DECL_CONTEXT (context);
5075 my_friendly_abort (10);
5088 set_current_level_tags_transparency (tags_transparent)
5089 int tags_transparent;
5091 current_binding_level->tag_transparent = tags_transparent;
5095 /* Given a type, find the tag that was defined for it and return the tag name.
5096 Otherwise return 0. However, the value can never be 0
5097 in the cases in which this is used.
5099 C++: If NAME is non-zero, this is the new name to install. This is
5100 done when replacing anonymous tags with real tag names. */
5103 lookup_tag_reverse (type, name)
5107 register struct binding_level *level;
5109 for (level = current_binding_level; level; level = level->level_chain)
5112 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5114 if (TREE_VALUE (tail) == type)
5117 TREE_PURPOSE (tail) = name;
5118 return TREE_PURPOSE (tail);
5125 /* Lookup TYPE in CONTEXT (a chain of nested types or a FUNCTION_DECL).
5126 Return the type value, or NULL_TREE if not found. */
5129 lookup_nested_type (type, context)
5133 if (context == NULL_TREE)
5137 switch (TREE_CODE (context))
5141 tree ctype = TREE_TYPE (context);
5142 tree match = value_member (type, CLASSTYPE_TAGS (ctype));
5144 return TREE_VALUE (match);
5145 context = DECL_CONTEXT (context);
5147 /* When we have a nested class whose member functions have
5148 local types (e.g., a set of enums), we'll arrive here
5149 with the DECL_CONTEXT as the actual RECORD_TYPE node for
5150 the enclosing class. Instead, we want to make sure we
5151 come back in here with the TYPE_DECL, not the RECORD_TYPE. */
5152 if (context && TREE_CODE (context) == RECORD_TYPE)
5153 context = TREE_CHAIN (context);
5157 if (TYPE_NAME (type) && TYPE_IDENTIFIER (type))
5158 return lookup_name (TYPE_IDENTIFIER (type), 1);
5161 my_friendly_abort (12);
5167 /* Look up NAME in the NAMESPACE. */
5170 lookup_namespace_name (namespace, name)
5171 tree namespace, name;
5173 struct tree_binding _b;
5176 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5178 if (TREE_CODE (name) == NAMESPACE_DECL)
5179 /* This happens for A::B<int> when B is a namespace. */
5181 else if (TREE_CODE (name) == TEMPLATE_DECL)
5183 /* This happens for A::B where B is a template, and there are no
5184 template arguments. */
5185 cp_error ("invalid use of `%D'", name);
5186 return error_mark_node;
5189 namespace = ORIGINAL_NAMESPACE (namespace);
5191 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5193 val = binding_init (&_b);
5194 if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5195 return error_mark_node;
5197 if (BINDING_VALUE (val))
5199 val = BINDING_VALUE (val);
5201 /* If we have a single function from a using decl, pull it out. */
5202 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5203 val = OVL_FUNCTION (val);
5207 cp_error ("`%D' undeclared in namespace `%D'", name, namespace);
5208 return error_mark_node;
5211 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5213 static unsigned long
5221 hash = (((unsigned long) TYPE_CONTEXT (t))
5222 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5227 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5230 typename_compare (k1, k2)
5241 d1 = TYPE_NAME (t1);
5242 d2 = TYPE_NAME (t2);
5244 return (DECL_NAME (d1) == DECL_NAME (d2)
5245 && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5246 && ((TREE_TYPE (t1) != NULL_TREE)
5247 == (TREE_TYPE (t2) != NULL_TREE))
5248 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5249 && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5252 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5253 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5254 is non-NULL, this type is being created by the implicit typename
5255 extension, and BASE_TYPE is a type named `t' in some base class of
5256 `T' which depends on template parameters.
5258 Returns the new TYPENAME_TYPE. */
5261 build_typename_type (context, name, fullname, base_type)
5269 struct hash_entry* e;
5271 static struct hash_table ht;
5273 push_obstacks (&permanent_obstack, &permanent_obstack);
5276 && !hash_table_init (&ht, &hash_newfunc, &typename_hash,
5278 fatal ("virtual memory exhausted");
5280 /* Build the TYPENAME_TYPE. */
5281 t = make_lang_type (TYPENAME_TYPE);
5282 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5283 TYPENAME_TYPE_FULLNAME (t) = fullname;
5284 TREE_TYPE (t) = base_type;
5286 /* Build the corresponding TYPE_DECL. */
5287 d = build_decl (TYPE_DECL, name, t);
5288 TYPE_NAME (TREE_TYPE (d)) = d;
5289 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5290 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5291 DECL_ARTIFICIAL (d) = 1;
5293 /* See if we already have this type. */
5294 e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5297 /* This will free not only TREE_TYPE, but the lang-specific data
5298 and the TYPE_DECL as well. */
5299 obstack_free (&permanent_obstack, t);
5303 /* Insert the type into the table. */
5304 hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5312 make_typename_type (context, name)
5318 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
5319 name = TYPE_IDENTIFIER (name);
5320 else if (TREE_CODE (name) == TYPE_DECL)
5321 name = DECL_NAME (name);
5325 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5327 name = TREE_OPERAND (name, 0);
5328 if (TREE_CODE (name) == TEMPLATE_DECL)
5329 name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5331 if (TREE_CODE (name) != IDENTIFIER_NODE)
5332 my_friendly_abort (2000);
5334 if (TREE_CODE (context) == NAMESPACE_DECL)
5336 /* We can get here from typename_sub0 in the explicit_template_type
5337 expansion. Just fail. */
5338 cp_error ("no class template named `%#T' in `%#T'",
5340 return error_mark_node;
5343 if (! uses_template_parms (context)
5344 || currently_open_class (context))
5346 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5348 if (IS_AGGR_TYPE (context))
5349 t = lookup_field (context, name, 0, 0);
5352 cp_error ("no class template named `%#T' in `%#T'",
5354 return error_mark_node;
5357 if (t && DECL_CLASS_TEMPLATE_P (t))
5358 return lookup_template_class (t, TREE_OPERAND (fullname, 1),
5360 /*entering_scope=*/0);
5364 if (IS_AGGR_TYPE (context))
5365 t = lookup_field (context, name, 0, 1);
5368 cp_error ("no type named `%#T' in `%#T'", name, context);
5369 return error_mark_node;
5373 return TREE_TYPE (t);
5377 /* If the CONTEXT is not a template type, then either the field is
5378 there now or its never going to be. */
5379 if (!uses_template_parms (context) && !t)
5381 cp_error ("no type named `%#T' in `%#T'", name, context);
5382 return error_mark_node;
5386 return build_typename_type (context, name, fullname, NULL_TREE);
5389 /* Select the right _DECL from multiple choices. */
5392 select_decl (binding, flags)
5397 val = BINDING_VALUE (binding);
5398 if (LOOKUP_NAMESPACES_ONLY (flags))
5400 /* We are not interested in types. */
5401 if (val && TREE_CODE (val) == NAMESPACE_DECL)
5406 /* If we could have a type and
5407 we have nothing or we need a type and have none. */
5408 if (BINDING_TYPE (binding)
5409 && (!val || ((flags & LOOKUP_PREFER_TYPES)
5410 && TREE_CODE (val) != TYPE_DECL)))
5411 val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5412 /* Don't return non-types if we really prefer types. */
5413 else if (val && LOOKUP_TYPES_ONLY (flags) && TREE_CODE (val) != TYPE_DECL
5414 && (TREE_CODE (val) != TEMPLATE_DECL
5415 || !DECL_CLASS_TEMPLATE_P (val)))
5421 /* Unscoped lookup of a global, iterate over namespaces, considering
5422 using namespace statements. */
5425 unqualified_namespace_lookup (name, flags)
5429 struct tree_binding _binding;
5430 tree b = binding_init (&_binding);
5431 tree initial = current_decl_namespace();
5432 tree scope = initial;
5434 struct binding_level *level;
5435 tree val = NULL_TREE;
5439 val = binding_for_name (name, scope);
5441 /* Initialize binding for this context. */
5442 BINDING_VALUE (b) = BINDING_VALUE (val);
5443 BINDING_TYPE (b) = BINDING_TYPE (val);
5445 /* Add all _DECLs seen through local using-directives. */
5446 for (level = current_binding_level;
5447 !level->namespace_p;
5448 level = level->level_chain)
5449 if (!lookup_using_namespace (name, b, level->using_directives,
5451 /* Give up because of error. */
5452 return error_mark_node;
5454 /* Add all _DECLs seen through global using-directives. */
5455 /* XXX local and global using lists should work equally. */
5459 if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5461 /* Give up because of error. */
5462 return error_mark_node;
5463 if (siter == scope) break;
5464 siter = CP_DECL_CONTEXT (siter);
5467 val = select_decl (b, flags);
5468 if (scope == global_namespace)
5470 scope = CP_DECL_CONTEXT (scope);
5475 /* Combine prefer_type and namespaces_only into flags. */
5478 lookup_flags (prefer_type, namespaces_only)
5479 int prefer_type, namespaces_only;
5481 if (namespaces_only)
5482 return LOOKUP_PREFER_NAMESPACES;
5483 if (prefer_type > 1)
5484 return LOOKUP_PREFER_TYPES;
5485 if (prefer_type > 0)
5486 return LOOKUP_PREFER_BOTH;
5490 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5491 ignore it or not. Subroutine of lookup_name_real. */
5494 qualify_lookup (val, flags)
5498 if (val == NULL_TREE)
5500 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5502 if ((flags & LOOKUP_PREFER_TYPES)
5503 && (TREE_CODE (val) == TYPE_DECL
5504 || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5505 && DECL_CLASS_TEMPLATE_P (val))))
5507 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5512 /* Look up NAME in the current binding level and its superiors in the
5513 namespace of variables, functions and typedefs. Return a ..._DECL
5514 node of some kind representing its definition if there is only one
5515 such declaration, or return a TREE_LIST with all the overloaded
5516 definitions if there are many, or return 0 if it is undefined.
5518 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5519 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5520 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5521 Otherwise we prefer non-TYPE_DECLs.
5523 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5524 using IDENTIFIER_CLASS_VALUE. */
5527 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
5529 int prefer_type, nonclass, namespaces_only;
5533 tree from_obj = NULL_TREE;
5536 /* Hack: copy flag set by parser, if set. */
5537 if (only_namespace_names)
5538 namespaces_only = 1;
5540 if (prefer_type == -2)
5542 extern int looking_for_typename;
5543 tree type = NULL_TREE;
5546 prefer_type = looking_for_typename;
5548 flags = lookup_flags (prefer_type, namespaces_only);
5549 /* If the next thing is '<', class templates are types. */
5550 if (looking_for_template)
5551 flags |= LOOKUP_TEMPLATES_EXPECTED;
5553 /* std:: becomes :: for now. */
5554 if (got_scope == std_node)
5555 got_scope = void_type_node;
5559 else if (got_object != error_mark_node)
5564 if (type == error_mark_node)
5565 return error_mark_node;
5566 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
5567 type = TREE_TYPE (type);
5570 type = complete_type (type);
5572 if (TREE_CODE (type) == VOID_TYPE)
5573 type = global_namespace;
5574 if (TREE_CODE (type) == NAMESPACE_DECL)
5576 struct tree_binding b;
5577 val = binding_init (&b);
5578 if (!qualified_lookup_using_namespace (name, type, val, flags))
5580 val = select_decl (val, flags);
5582 else if (! IS_AGGR_TYPE (type)
5583 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5584 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
5585 || TREE_CODE (type) == TYPENAME_TYPE)
5586 /* Someone else will give an error about this if needed. */
5588 else if (type == current_class_type)
5589 val = IDENTIFIER_CLASS_VALUE (name);
5591 val = lookup_member (type, name, 0, prefer_type);
5598 else if (got_object && val)
5603 flags = lookup_flags (prefer_type, namespaces_only);
5604 /* If we're not parsing, we need to complain. */
5605 flags |= LOOKUP_COMPLAIN;
5608 /* First, look in non-namespace scopes. */
5609 for (val = IDENTIFIER_BINDING (name); val; val = TREE_CHAIN (val))
5611 if (!LOCAL_BINDING_P (val) && nonclass)
5612 /* We're not looking for class-scoped bindings, so keep going. */
5615 /* If this is the kind of thing we're looking for, we're done. */
5616 if (qualify_lookup (BINDING_VALUE (val), flags))
5618 val = BINDING_VALUE (val);
5621 else if ((flags & LOOKUP_PREFER_TYPES)
5622 && qualify_lookup (BINDING_TYPE (val), flags))
5624 val = BINDING_TYPE (val);
5629 /* The name might be from an enclosing class of the current scope. */
5630 if (!val && !nonclass && current_class_type)
5631 val = qualify_lookup (lookup_nested_field (name, !yylex), flags);
5633 /* If we found a type from a dependent base class (using the
5634 implicit typename extension) make sure that there's not some
5635 global name which should be chosen instead. */
5636 if (val && TREE_CODE (val) == TYPE_DECL
5637 && IMPLICIT_TYPENAME_P (TREE_TYPE (val)))
5641 /* Any other name takes precedence over an implicit typename. Warn the
5642 user about this potentially confusing lookup. */
5643 global_val = unqualified_namespace_lookup (name, flags);
5649 /* Only warn when not lexing; we don't want to warn if they
5650 use this name as a declarator. */
5651 subtype = TREE_TYPE (TREE_TYPE (val));
5653 && ! (TREE_CODE (global_val) == TEMPLATE_DECL
5654 && CLASSTYPE_TEMPLATE_INFO (subtype)
5655 && CLASSTYPE_TI_TEMPLATE (subtype) == global_val)
5656 && ! (TREE_CODE (global_val) == TYPE_DECL
5657 && same_type_p (TREE_TYPE (global_val), subtype)))
5659 cp_warning ("lookup of `%D' finds `%#D'", name, global_val);
5660 cp_warning (" instead of `%D' from dependent base class",
5662 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5663 constructor_name (current_class_type), name);
5666 /* Use the global value instead of the implicit typename. */
5671 /* No local, or class-scoped binding. Look for a namespace-scope
5673 val = unqualified_namespace_lookup (name, flags);
5678 /* This should only warn about types used in qualified-ids. */
5679 if (from_obj && from_obj != val)
5681 if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
5682 && TREE_CODE (val) == TYPE_DECL
5683 && TREE_TYPE (from_obj) != TREE_TYPE (val))
5685 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5686 name, got_object, TREE_TYPE (from_obj));
5687 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5691 /* We don't change val to from_obj if got_object depends on
5692 template parms because that breaks implicit typename for
5693 destructor calls. */
5694 if (! uses_template_parms (got_object))
5698 /* If we have a single function from a using decl, pull it out. */
5699 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5700 val = OVL_FUNCTION (val);
5709 lookup_name_nonclass (name)
5712 return lookup_name_real (name, 0, 1, 0);
5716 lookup_function_nonclass (name, args)
5720 return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
5724 lookup_name_namespace_only (name)
5727 /* type-or-namespace, nonclass, namespace_only */
5728 return lookup_name_real (name, 1, 1, 1);
5732 lookup_name (name, prefer_type)
5736 return lookup_name_real (name, prefer_type, 0, 0);
5739 /* Similar to `lookup_name' but look only in the innermost non-class
5743 lookup_name_current_level (name)
5746 struct binding_level *b;
5749 b = current_binding_level;
5750 while (b->parm_flag == 2)
5755 t = IDENTIFIER_NAMESPACE_VALUE (name);
5757 /* extern "C" function() */
5758 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
5761 else if (IDENTIFIER_BINDING (name)
5762 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
5766 if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
5767 return IDENTIFIER_VALUE (name);
5779 /* Like lookup_name_current_level, but for types. */
5782 lookup_type_current_level (name)
5785 register tree t = NULL_TREE;
5787 my_friendly_assert (! current_binding_level->namespace_p, 980716);
5789 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
5790 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
5792 struct binding_level *b = current_binding_level;
5795 if (purpose_member (name, b->type_shadowed))
5796 return REAL_IDENTIFIER_TYPE_VALUE (name);
5808 begin_only_namespace_names ()
5810 only_namespace_names = 1;
5814 end_only_namespace_names ()
5816 only_namespace_names = 0;
5819 /* Arrange for the user to get a source line number, even when the
5820 compiler is going down in flames, so that she at least has a
5821 chance of working around problems in the compiler. We used to
5822 call error(), but that let the segmentation fault continue
5823 through; now, it's much more passive by asking them to send the
5824 maintainers mail about the problem. */
5828 int sig ATTRIBUTE_UNUSED;
5830 signal (SIGSEGV, SIG_DFL);
5832 signal (SIGIOT, SIG_DFL);
5835 signal (SIGILL, SIG_DFL);
5838 signal (SIGABRT, SIG_DFL);
5841 signal (SIGBUS, SIG_DFL);
5843 my_friendly_abort (0);
5847 /* Unused -- brendan 970107 */
5848 /* Array for holding types considered "built-in". These types
5849 are output in the module in which `main' is defined. */
5850 static tree *builtin_type_tdescs_arr;
5851 static int builtin_type_tdescs_len, builtin_type_tdescs_max;
5854 /* Push the declarations of builtin types into the namespace.
5855 RID_INDEX, if < RID_MAX is the index of the builtin type
5856 in the array RID_POINTERS. NAME is the name used when looking
5857 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5860 record_builtin_type (rid_index, name, type)
5865 tree rname = NULL_TREE, tname = NULL_TREE;
5866 tree tdecl = NULL_TREE;
5868 if ((int) rid_index < (int) RID_MAX)
5869 rname = ridpointers[(int) rid_index];
5871 tname = get_identifier (name);
5873 TYPE_BUILT_IN (type) = 1;
5877 tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
5878 set_identifier_type_value (tname, NULL_TREE);
5879 if ((int) rid_index < (int) RID_MAX)
5880 /* Built-in types live in the global namespace. */
5881 SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
5883 if (rname != NULL_TREE)
5885 if (tname != NULL_TREE)
5887 set_identifier_type_value (rname, NULL_TREE);
5888 SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
5892 tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
5893 set_identifier_type_value (rname, NULL_TREE);
5898 /* Record one of the standard Java types.
5899 * Declare it as having the given NAME.
5900 * If SIZE > 0, it is the size of one of the integral types;
5901 * otherwise it is the negative of the size of one of the other types. */
5904 record_builtin_java_type (name, size)
5910 type = make_signed_type (size);
5911 else if (size > -32)
5912 { /* "__java_char" or ""__java_boolean". */
5913 type = make_unsigned_type (-size);
5914 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5917 { /* "__java_float" or ""__java_double". */
5918 type = make_node (REAL_TYPE);
5919 TYPE_PRECISION (type) = - size;
5922 record_builtin_type (RID_MAX, name, type);
5923 decl = TYPE_NAME (type);
5924 DECL_IGNORED_P (decl) = 1;
5925 TYPE_FOR_JAVA (type) = 1;
5929 /* Push a type into the namespace so that the back-ends ignore it. */
5932 record_unknown_type (type, name)
5936 tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
5937 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5938 DECL_IGNORED_P (decl) = 1;
5939 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
5940 TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
5941 TYPE_ALIGN (type) = 1;
5942 TYPE_MODE (type) = TYPE_MODE (void_type_node);
5945 /* Push overloaded decl, in global scope, with one argument so it
5946 can be used as a callback from define_function. */
5949 push_overloaded_decl_1 (x)
5952 push_overloaded_decl (x, PUSH_GLOBAL);
5959 auto_function (name, type, code)
5961 enum built_in_function code;
5963 return define_function
5964 (IDENTIFIER_POINTER (name), type, code, push_overloaded_decl_1,
5965 IDENTIFIER_POINTER (build_decl_overload (name, TYPE_ARG_TYPES (type),
5969 /* Create the predefined scalar types of C,
5970 and some nodes representing standard constants (0, 1, (void *)0).
5971 Initialize the global binding level.
5972 Make definitions for built-in primitive functions. */
5975 init_decl_processing ()
5977 register tree endlink, int_endlink, double_endlink, unsigned_endlink;
5979 /* Data type of memcpy. */
5980 tree memcpy_ftype, strlen_ftype;
5981 int wchar_type_size;
5983 tree array_domain_type;
5984 tree vb_off_identifier = NULL_TREE;
5985 /* Function type `char *(char *, char *)' and similar ones */
5986 tree string_ftype_ptr_ptr, int_ftype_string_string;
5987 tree sizetype_endlink;
5988 tree ptr_ftype, ptr_ftype_unsigned, ptr_ftype_sizetype;
5989 tree void_ftype, void_ftype_int, void_ftype_ptr;
5991 /* Have to make these distinct before we try using them. */
5992 lang_name_cplusplus = get_identifier ("C++");
5993 lang_name_c = get_identifier ("C");
5994 lang_name_java = get_identifier ("Java");
5996 /* Enter the global namespace. */
5997 my_friendly_assert (global_namespace == NULL_TREE, 375);
5998 my_friendly_assert (current_lang_name == NULL_TREE, 375);
5999 current_lang_name = lang_name_cplusplus;
6000 push_namespace (get_identifier ("::"));
6001 global_namespace = current_namespace;
6002 current_lang_name = NULL_TREE;
6004 if (flag_strict_prototype == 2)
6005 flag_strict_prototype = pedantic;
6006 if (! flag_permissive && ! pedantic)
6007 flag_pedantic_errors = 1;
6009 strict_prototypes_lang_c = flag_strict_prototype;
6012 current_lang_name = lang_name_c;
6014 current_function_decl = NULL_TREE;
6015 named_labels = NULL_TREE;
6016 named_label_uses = NULL;
6017 current_binding_level = NULL_BINDING_LEVEL;
6018 free_binding_level = NULL_BINDING_LEVEL;
6020 /* Because most segmentation signals can be traced back into user
6021 code, catch them and at least give the user a chance of working
6022 around compiler bugs. */
6023 signal (SIGSEGV, signal_catch);
6025 /* We will also catch aborts in the back-end through signal_catch and
6026 give the user a chance to see where the error might be, and to defeat
6027 aborts in the back-end when there have been errors previously in their
6030 signal (SIGIOT, signal_catch);
6033 signal (SIGILL, signal_catch);
6036 signal (SIGABRT, signal_catch);
6039 signal (SIGBUS, signal_catch);
6042 gcc_obstack_init (&decl_obstack);
6044 /* Must lay these out before anything else gets laid out. */
6045 error_mark_node = make_node (ERROR_MARK);
6046 TREE_PERMANENT (error_mark_node) = 1;
6047 TREE_TYPE (error_mark_node) = error_mark_node;
6048 error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6049 TREE_TYPE (error_mark_list) = error_mark_node;
6051 /* Make the binding_level structure for global names. */
6053 global_binding_level = current_binding_level;
6054 /* The global level is the namespace level of ::. */
6055 NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6056 declare_namespace_level ();
6058 this_identifier = get_identifier (THIS_NAME);
6059 in_charge_identifier = get_identifier (IN_CHARGE_NAME);
6060 ctor_identifier = get_identifier (CTOR_NAME);
6061 dtor_identifier = get_identifier (DTOR_NAME);
6062 pfn_identifier = get_identifier (VTABLE_PFN_NAME);
6063 index_identifier = get_identifier (VTABLE_INDEX_NAME);
6064 delta_identifier = get_identifier (VTABLE_DELTA_NAME);
6065 delta2_identifier = get_identifier (VTABLE_DELTA2_NAME);
6066 pfn_or_delta2_identifier = get_identifier ("__pfn_or_delta2");
6067 if (flag_handle_signatures)
6069 tag_identifier = get_identifier (SIGTABLE_TAG_NAME);
6070 vb_off_identifier = get_identifier (SIGTABLE_VB_OFF_NAME);
6071 vt_off_identifier = get_identifier (SIGTABLE_VT_OFF_NAME);
6074 /* Define `int' and `char' first so that dbx will output them first. */
6076 integer_type_node = make_signed_type (INT_TYPE_SIZE);
6077 record_builtin_type (RID_INT, NULL_PTR, integer_type_node);
6079 /* Define `char', which is like either `signed char' or `unsigned char'
6080 but not the same as either. */
6084 ? make_signed_type (CHAR_TYPE_SIZE)
6085 : make_unsigned_type (CHAR_TYPE_SIZE));
6086 record_builtin_type (RID_CHAR, "char", char_type_node);
6088 /* `signed' is the same as `int' */
6089 record_builtin_type (RID_SIGNED, NULL_PTR, integer_type_node);
6091 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
6092 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
6094 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
6095 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
6097 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
6098 record_builtin_type (RID_MAX, "long unsigned int", long_unsigned_type_node);
6099 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
6101 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
6102 record_builtin_type (RID_MAX, "long long int", long_long_integer_type_node);
6104 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
6105 record_builtin_type (RID_MAX, "long long unsigned int",
6106 long_long_unsigned_type_node);
6107 record_builtin_type (RID_MAX, "long long unsigned",
6108 long_long_unsigned_type_node);
6110 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
6111 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
6112 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
6113 record_builtin_type (RID_MAX, "short unsigned int", short_unsigned_type_node);
6114 record_builtin_type (RID_MAX, "unsigned short", short_unsigned_type_node);
6116 /* `unsigned long' is the standard type for sizeof.
6117 Note that stddef.h uses `unsigned long',
6118 and this must agree, even if long and int are the same size. */
6120 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE))));
6123 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE)));
6125 /* Define both `signed char' and `unsigned char'. */
6126 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
6127 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
6128 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
6129 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
6131 /* These are types that type_for_size and type_for_mode use. */
6132 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
6133 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
6134 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
6135 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
6136 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
6137 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
6138 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
6139 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
6140 #if HOST_BITS_PER_WIDE_INT >= 64
6141 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
6142 pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node));
6144 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
6145 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
6146 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
6147 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
6148 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
6149 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
6150 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
6151 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
6152 #if HOST_BITS_PER_WIDE_INT >= 64
6153 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
6154 pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node));
6157 float_type_node = make_node (REAL_TYPE);
6158 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6159 record_builtin_type (RID_FLOAT, NULL_PTR, float_type_node);
6160 layout_type (float_type_node);
6162 double_type_node = make_node (REAL_TYPE);
6163 if (flag_short_double)
6164 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6166 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6167 record_builtin_type (RID_DOUBLE, NULL_PTR, double_type_node);
6168 layout_type (double_type_node);
6170 long_double_type_node = make_node (REAL_TYPE);
6171 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6172 record_builtin_type (RID_MAX, "long double", long_double_type_node);
6173 layout_type (long_double_type_node);
6175 complex_integer_type_node = make_node (COMPLEX_TYPE);
6176 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
6177 complex_integer_type_node));
6178 TREE_TYPE (complex_integer_type_node) = integer_type_node;
6179 layout_type (complex_integer_type_node);
6181 complex_float_type_node = make_node (COMPLEX_TYPE);
6182 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
6183 complex_float_type_node));
6184 TREE_TYPE (complex_float_type_node) = float_type_node;
6185 layout_type (complex_float_type_node);
6187 complex_double_type_node = make_node (COMPLEX_TYPE);
6188 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
6189 complex_double_type_node));
6190 TREE_TYPE (complex_double_type_node) = double_type_node;
6191 layout_type (complex_double_type_node);
6193 complex_long_double_type_node = make_node (COMPLEX_TYPE);
6194 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
6195 complex_long_double_type_node));
6196 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
6197 layout_type (complex_long_double_type_node);
6199 java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6200 java_short_type_node = record_builtin_java_type ("__java_short", 16);
6201 java_int_type_node = record_builtin_java_type ("__java_int", 32);
6202 java_long_type_node = record_builtin_java_type ("__java_long", 64);
6203 java_float_type_node = record_builtin_java_type ("__java_float", -32);
6204 java_double_type_node = record_builtin_java_type ("__java_double", -64);
6205 java_char_type_node = record_builtin_java_type ("__java_char", -16);
6206 java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6208 integer_zero_node = build_int_2 (0, 0);
6209 TREE_TYPE (integer_zero_node) = integer_type_node;
6210 integer_one_node = build_int_2 (1, 0);
6211 TREE_TYPE (integer_one_node) = integer_type_node;
6212 integer_two_node = build_int_2 (2, 0);
6213 TREE_TYPE (integer_two_node) = integer_type_node;
6214 integer_three_node = build_int_2 (3, 0);
6215 TREE_TYPE (integer_three_node) = integer_type_node;
6217 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6218 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6219 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6220 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6221 TYPE_PRECISION (boolean_type_node) = 1;
6222 record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6223 boolean_false_node = build_int_2 (0, 0);
6224 TREE_TYPE (boolean_false_node) = boolean_type_node;
6225 boolean_true_node = build_int_2 (1, 0);
6226 TREE_TYPE (boolean_true_node) = boolean_type_node;
6228 /* These are needed by stor-layout.c. */
6229 size_zero_node = size_int (0);
6230 size_one_node = size_int (1);
6232 signed_size_zero_node = build_int_2 (0, 0);
6233 TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6235 void_type_node = make_node (VOID_TYPE);
6236 record_builtin_type (RID_VOID, NULL_PTR, void_type_node);
6237 layout_type (void_type_node); /* Uses integer_zero_node. */
6238 void_list_node = build_tree_list (NULL_TREE, void_type_node);
6239 TREE_PARMLIST (void_list_node) = 1;
6241 null_pointer_node = build_int_2 (0, 0);
6242 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
6243 layout_type (TREE_TYPE (null_pointer_node));
6245 /* Used for expressions that do nothing, but are not errors. */
6246 void_zero_node = build_int_2 (0, 0);
6247 TREE_TYPE (void_zero_node) = void_type_node;
6249 string_type_node = build_pointer_type (char_type_node);
6250 const_string_type_node
6251 = build_pointer_type (build_qualified_type (char_type_node,
6254 record_builtin_type (RID_MAX, NULL_PTR, string_type_node);
6257 /* Make a type to be the domain of a few array types
6258 whose domains don't really matter.
6259 200 is small enough that it always fits in size_t
6260 and large enough that it can hold most function names for the
6261 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6262 array_domain_type = build_index_type (build_int_2 (200, 0));
6264 /* Make a type for arrays of characters.
6265 With luck nothing will ever really depend on the length of this
6267 char_array_type_node
6268 = build_array_type (char_type_node, array_domain_type);
6269 /* Likewise for arrays of ints. */
6271 = build_array_type (integer_type_node, array_domain_type);
6273 /* This is just some anonymous class type. Nobody should ever
6274 need to look inside this envelope. */
6275 class_star_type_node = build_pointer_type (make_lang_type (RECORD_TYPE));
6277 default_function_type
6278 = build_function_type (integer_type_node, NULL_TREE);
6280 ptr_type_node = build_pointer_type (void_type_node);
6282 = build_pointer_type (build_qualified_type (void_type_node,
6285 record_builtin_type (RID_MAX, NULL_PTR, ptr_type_node);
6287 endlink = void_list_node;
6288 int_endlink = tree_cons (NULL_TREE, integer_type_node, endlink);
6289 double_endlink = tree_cons (NULL_TREE, double_type_node, endlink);
6290 unsigned_endlink = tree_cons (NULL_TREE, unsigned_type_node, endlink);
6292 ptr_ftype = build_function_type (ptr_type_node, NULL_TREE);
6293 ptr_ftype_unsigned = build_function_type (ptr_type_node, unsigned_endlink);
6294 sizetype_endlink = tree_cons (NULL_TREE, sizetype, endlink);
6295 /* We realloc here because sizetype could be int or unsigned. S'ok. */
6296 ptr_ftype_sizetype = build_function_type (ptr_type_node, sizetype_endlink);
6298 void_ftype = build_function_type (void_type_node, endlink);
6299 void_ftype_int = build_function_type (void_type_node, int_endlink);
6301 = build_function_type (void_type_node,
6302 tree_cons (NULL_TREE, ptr_type_node, endlink));
6304 = build_exception_variant (void_ftype_ptr,
6305 tree_cons (NULL_TREE, NULL_TREE, NULL_TREE));
6308 = build_function_type (float_type_node,
6309 tree_cons (NULL_TREE, float_type_node, endlink));
6312 = build_function_type (double_type_node, double_endlink);
6314 ldouble_ftype_ldouble
6315 = build_function_type (long_double_type_node,
6316 tree_cons (NULL_TREE, long_double_type_node,
6319 double_ftype_double_double
6320 = build_function_type (double_type_node,
6321 tree_cons (NULL_TREE, double_type_node,
6325 = build_function_type (integer_type_node, int_endlink);
6328 = build_function_type (long_integer_type_node,
6329 tree_cons (NULL_TREE, long_integer_type_node,
6332 int_ftype_cptr_cptr_sizet
6333 = build_function_type (integer_type_node,
6334 tree_cons (NULL_TREE, const_ptr_type_node,
6335 tree_cons (NULL_TREE, const_ptr_type_node,
6336 tree_cons (NULL_TREE,
6340 string_ftype_ptr_ptr /* strcpy prototype */
6341 = build_function_type (string_type_node,
6342 tree_cons (NULL_TREE, string_type_node,
6343 tree_cons (NULL_TREE,
6344 const_string_type_node,
6347 int_ftype_string_string /* strcmp prototype */
6348 = build_function_type (integer_type_node,
6349 tree_cons (NULL_TREE, const_string_type_node,
6350 tree_cons (NULL_TREE,
6351 const_string_type_node,
6354 strlen_ftype /* strlen prototype */
6355 = build_function_type (sizetype,
6356 tree_cons (NULL_TREE, const_string_type_node,
6359 memcpy_ftype /* memcpy prototype */
6360 = build_function_type (ptr_type_node,
6361 tree_cons (NULL_TREE, ptr_type_node,
6362 tree_cons (NULL_TREE, const_ptr_type_node,
6363 sizetype_endlink)));
6365 if (flag_huge_objects)
6366 delta_type_node = long_integer_type_node;
6368 delta_type_node = short_integer_type_node;
6370 builtin_function ("__builtin_constant_p", default_function_type,
6371 BUILT_IN_CONSTANT_P, NULL_PTR);
6373 builtin_return_address_fndecl
6374 = builtin_function ("__builtin_return_address", ptr_ftype_unsigned,
6375 BUILT_IN_RETURN_ADDRESS, NULL_PTR);
6377 builtin_function ("__builtin_frame_address", ptr_ftype_unsigned,
6378 BUILT_IN_FRAME_ADDRESS, NULL_PTR);
6380 builtin_function ("__builtin_alloca", ptr_ftype_sizetype,
6381 BUILT_IN_ALLOCA, "alloca");
6382 builtin_function ("__builtin_ffs", int_ftype_int, BUILT_IN_FFS, NULL_PTR);
6383 /* Define alloca, ffs as builtins.
6384 Declare _exit just to mark it as volatile. */
6385 if (! flag_no_builtin && !flag_no_nonansi_builtin)
6387 temp = builtin_function ("alloca", ptr_ftype_sizetype,
6388 BUILT_IN_ALLOCA, NULL_PTR);
6389 /* Suppress error if redefined as a non-function. */
6390 DECL_BUILT_IN_NONANSI (temp) = 1;
6391 temp = builtin_function ("ffs", int_ftype_int, BUILT_IN_FFS, NULL_PTR);
6392 /* Suppress error if redefined as a non-function. */
6393 DECL_BUILT_IN_NONANSI (temp) = 1;
6394 temp = builtin_function ("_exit", void_ftype_int,
6395 NOT_BUILT_IN, NULL_PTR);
6396 TREE_THIS_VOLATILE (temp) = 1;
6397 TREE_SIDE_EFFECTS (temp) = 1;
6398 /* Suppress error if redefined as a non-function. */
6399 DECL_BUILT_IN_NONANSI (temp) = 1;
6402 builtin_function ("__builtin_abs", int_ftype_int, BUILT_IN_ABS, NULL_PTR);
6403 builtin_function ("__builtin_fabsf", float_ftype_float, BUILT_IN_FABS,
6405 builtin_function ("__builtin_fabs", double_ftype_double, BUILT_IN_FABS,
6407 builtin_function ("__builtin_fabsl", ldouble_ftype_ldouble, BUILT_IN_FABS,
6409 builtin_function ("__builtin_labs", long_ftype_long,
6410 BUILT_IN_LABS, NULL_PTR);
6411 builtin_function ("__builtin_saveregs", ptr_ftype,
6412 BUILT_IN_SAVEREGS, NULL_PTR);
6413 builtin_function ("__builtin_classify_type", default_function_type,
6414 BUILT_IN_CLASSIFY_TYPE, NULL_PTR);
6415 builtin_function ("__builtin_next_arg", ptr_ftype,
6416 BUILT_IN_NEXT_ARG, NULL_PTR);
6417 builtin_function ("__builtin_args_info", int_ftype_int,
6418 BUILT_IN_ARGS_INFO, NULL_PTR);
6419 builtin_function ("__builtin_setjmp",
6420 build_function_type (integer_type_node,
6421 tree_cons (NULL_TREE, ptr_type_node,
6423 BUILT_IN_SETJMP, NULL_PTR);
6424 builtin_function ("__builtin_longjmp",
6425 build_function_type (integer_type_node,
6426 tree_cons (NULL_TREE, ptr_type_node,
6427 tree_cons (NULL_TREE,
6430 BUILT_IN_LONGJMP, NULL_PTR);
6432 /* Untyped call and return. */
6433 builtin_function ("__builtin_apply_args", ptr_ftype,
6434 BUILT_IN_APPLY_ARGS, NULL_PTR);
6436 temp = tree_cons (NULL_TREE,
6437 build_pointer_type (build_function_type (void_type_node,
6439 tree_cons (NULL_TREE, ptr_ftype_sizetype, NULL_TREE));
6440 builtin_function ("__builtin_apply",
6441 build_function_type (ptr_type_node, temp),
6442 BUILT_IN_APPLY, NULL_PTR);
6443 builtin_function ("__builtin_return", void_ftype_ptr,
6444 BUILT_IN_RETURN, NULL_PTR);
6446 /* Currently under experimentation. */
6447 builtin_function ("__builtin_memcpy", memcpy_ftype,
6448 BUILT_IN_MEMCPY, "memcpy");
6449 builtin_function ("__builtin_memcmp", int_ftype_cptr_cptr_sizet,
6450 BUILT_IN_MEMCMP, "memcmp");
6451 builtin_function ("__builtin_strcmp", int_ftype_string_string,
6452 BUILT_IN_STRCMP, "strcmp");
6453 builtin_function ("__builtin_strcpy", string_ftype_ptr_ptr,
6454 BUILT_IN_STRCPY, "strcpy");
6455 builtin_function ("__builtin_strlen", strlen_ftype,
6456 BUILT_IN_STRLEN, "strlen");
6457 builtin_function ("__builtin_sqrtf", float_ftype_float,
6458 BUILT_IN_FSQRT, "sqrtf");
6459 builtin_function ("__builtin_fsqrt", double_ftype_double,
6460 BUILT_IN_FSQRT, NULL_PTR);
6461 builtin_function ("__builtin_sqrtl", ldouble_ftype_ldouble,
6462 BUILT_IN_FSQRT, "sqrtl");
6463 builtin_function ("__builtin_sinf", float_ftype_float,
6464 BUILT_IN_SIN, "sinf");
6465 builtin_function ("__builtin_sin", double_ftype_double,
6466 BUILT_IN_SIN, "sin");
6467 builtin_function ("__builtin_sinl", ldouble_ftype_ldouble,
6468 BUILT_IN_SIN, "sinl");
6469 builtin_function ("__builtin_cosf", float_ftype_float,
6470 BUILT_IN_COS, "cosf");
6471 builtin_function ("__builtin_cos", double_ftype_double,
6472 BUILT_IN_COS, "cos");
6473 builtin_function ("__builtin_cosl", ldouble_ftype_ldouble,
6474 BUILT_IN_COS, "cosl");
6476 if (!flag_no_builtin)
6478 builtin_function ("abs", int_ftype_int, BUILT_IN_ABS, NULL_PTR);
6479 builtin_function ("fabs", double_ftype_double, BUILT_IN_FABS, NULL_PTR);
6480 builtin_function ("labs", long_ftype_long, BUILT_IN_LABS, NULL_PTR);
6481 builtin_function ("fabsf", float_ftype_float, BUILT_IN_FABS, NULL_PTR);
6482 builtin_function ("fabsl", ldouble_ftype_ldouble, BUILT_IN_FABS,
6484 builtin_function ("memcpy", memcpy_ftype, BUILT_IN_MEMCPY, NULL_PTR);
6485 builtin_function ("memcmp", int_ftype_cptr_cptr_sizet, BUILT_IN_MEMCMP,
6487 builtin_function ("strcmp", int_ftype_string_string, BUILT_IN_STRCMP,
6489 builtin_function ("strcpy", string_ftype_ptr_ptr, BUILT_IN_STRCPY,
6491 builtin_function ("strlen", strlen_ftype, BUILT_IN_STRLEN, NULL_PTR);
6492 builtin_function ("sqrtf", float_ftype_float, BUILT_IN_FSQRT, NULL_PTR);
6493 builtin_function ("sqrt", double_ftype_double, BUILT_IN_FSQRT, NULL_PTR);
6494 builtin_function ("sqrtl", ldouble_ftype_ldouble, BUILT_IN_FSQRT,
6496 builtin_function ("sinf", float_ftype_float, BUILT_IN_SIN, NULL_PTR);
6497 builtin_function ("sin", double_ftype_double, BUILT_IN_SIN, NULL_PTR);
6498 builtin_function ("sinl", ldouble_ftype_ldouble, BUILT_IN_SIN, NULL_PTR);
6499 builtin_function ("cosf", float_ftype_float, BUILT_IN_COS, NULL_PTR);
6500 builtin_function ("cos", double_ftype_double, BUILT_IN_COS, NULL_PTR);
6501 builtin_function ("cosl", ldouble_ftype_ldouble, BUILT_IN_COS, NULL_PTR);
6503 /* Declare these functions volatile
6504 to avoid spurious "control drops through" warnings. */
6505 temp = builtin_function ("abort", void_ftype,
6506 NOT_BUILT_IN, NULL_PTR);
6507 TREE_THIS_VOLATILE (temp) = 1;
6508 TREE_SIDE_EFFECTS (temp) = 1;
6509 /* Well, these are actually ANSI, but we can't set DECL_BUILT_IN on
6511 DECL_BUILT_IN_NONANSI (temp) = 1;
6512 temp = builtin_function ("exit", void_ftype_int,
6513 NOT_BUILT_IN, NULL_PTR);
6514 TREE_THIS_VOLATILE (temp) = 1;
6515 TREE_SIDE_EFFECTS (temp) = 1;
6516 DECL_BUILT_IN_NONANSI (temp) = 1;
6520 /* Support for these has not been written in either expand_builtin
6521 or build_function_call. */
6522 builtin_function ("__builtin_div", default_ftype, BUILT_IN_DIV, NULL_PTR);
6523 builtin_function ("__builtin_ldiv", default_ftype, BUILT_IN_LDIV, NULL_PTR);
6524 builtin_function ("__builtin_ffloor", double_ftype_double, BUILT_IN_FFLOOR,
6526 builtin_function ("__builtin_fceil", double_ftype_double, BUILT_IN_FCEIL,
6528 builtin_function ("__builtin_fmod", double_ftype_double_double,
6529 BUILT_IN_FMOD, NULL_PTR);
6530 builtin_function ("__builtin_frem", double_ftype_double_double,
6531 BUILT_IN_FREM, NULL_PTR);
6532 builtin_function ("__builtin_memset", ptr_ftype_ptr_int_int,
6533 BUILT_IN_MEMSET, NULL_PTR);
6534 builtin_function ("__builtin_getexp", double_ftype_double, BUILT_IN_GETEXP,
6536 builtin_function ("__builtin_getman", double_ftype_double, BUILT_IN_GETMAN,
6540 /* C++ extensions */
6542 unknown_type_node = make_node (UNKNOWN_TYPE);
6543 record_unknown_type (unknown_type_node, "unknown type");
6545 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6546 TREE_TYPE (unknown_type_node) = unknown_type_node;
6548 TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0);
6550 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6552 TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6553 TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6555 /* This is for handling opaque types in signatures. */
6556 opaque_type_node = copy_node (ptr_type_node);
6557 TYPE_MAIN_VARIANT (opaque_type_node) = opaque_type_node;
6558 record_builtin_type (RID_MAX, 0, opaque_type_node);
6560 /* This is special for C++ so functions can be overloaded. */
6562 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE)));
6563 wchar_type_size = TYPE_PRECISION (wchar_type_node);
6564 signed_wchar_type_node = make_signed_type (wchar_type_size);
6565 unsigned_wchar_type_node = make_unsigned_type (wchar_type_size);
6567 = TREE_UNSIGNED (wchar_type_node)
6568 ? unsigned_wchar_type_node
6569 : signed_wchar_type_node;
6570 record_builtin_type (RID_WCHAR, "__wchar_t", wchar_type_node);
6572 /* Artificial declaration of wchar_t -- can be bashed */
6573 wchar_decl_node = build_decl (TYPE_DECL, get_identifier ("wchar_t"),
6575 pushdecl (wchar_decl_node);
6577 /* This is for wide string constants. */
6578 wchar_array_type_node
6579 = build_array_type (wchar_type_node, array_domain_type);
6581 if (flag_vtable_thunks)
6583 /* Make sure we get a unique function type, so we can give
6584 its pointer type a name. (This wins for gdb.) */
6585 tree vfunc_type = make_node (FUNCTION_TYPE);
6586 TREE_TYPE (vfunc_type) = integer_type_node;
6587 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6588 layout_type (vfunc_type);
6590 vtable_entry_type = build_pointer_type (vfunc_type);
6594 vtable_entry_type = make_lang_type (RECORD_TYPE);
6595 fields[0] = build_lang_field_decl (FIELD_DECL, delta_identifier,
6597 fields[1] = build_lang_field_decl (FIELD_DECL, index_identifier,
6599 fields[2] = build_lang_field_decl (FIELD_DECL, pfn_identifier,
6601 finish_builtin_type (vtable_entry_type, VTBL_PTR_TYPE, fields, 2,
6604 /* Make this part of an invisible union. */
6605 fields[3] = copy_node (fields[2]);
6606 TREE_TYPE (fields[3]) = delta_type_node;
6607 DECL_NAME (fields[3]) = delta2_identifier;
6608 DECL_MODE (fields[3]) = TYPE_MODE (delta_type_node);
6609 DECL_SIZE (fields[3]) = TYPE_SIZE (delta_type_node);
6610 TREE_UNSIGNED (fields[3]) = 0;
6611 TREE_CHAIN (fields[2]) = fields[3];
6612 vtable_entry_type = build_qualified_type (vtable_entry_type,
6615 record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6618 = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6619 layout_type (vtbl_type_node);
6620 vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6621 record_builtin_type (RID_MAX, NULL_PTR, vtbl_type_node);
6622 vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6623 layout_type (vtbl_ptr_type_node);
6624 record_builtin_type (RID_MAX, NULL_PTR, vtbl_ptr_type_node);
6626 /* Simplify life by making a "sigtable_entry_type". Give its
6627 fields names so that the debugger can use them. */
6629 if (flag_handle_signatures)
6631 sigtable_entry_type = make_lang_type (RECORD_TYPE);
6632 fields[0] = build_lang_field_decl (FIELD_DECL, tag_identifier,
6634 fields[1] = build_lang_field_decl (FIELD_DECL, vb_off_identifier,
6636 fields[2] = build_lang_field_decl (FIELD_DECL, delta_identifier,
6638 fields[3] = build_lang_field_decl (FIELD_DECL, index_identifier,
6640 fields[4] = build_lang_field_decl (FIELD_DECL, pfn_identifier,
6643 /* Set the alignment to the max of the alignment of ptr_type_node and
6644 delta_type_node. Double alignment wastes a word on the Sparc. */
6645 finish_builtin_type (sigtable_entry_type, SIGTABLE_PTR_TYPE, fields, 4,
6646 (TYPE_ALIGN (ptr_type_node) > TYPE_ALIGN (delta_type_node))
6650 /* Make this part of an invisible union. */
6651 fields[5] = copy_node (fields[4]);
6652 TREE_TYPE (fields[5]) = delta_type_node;
6653 DECL_NAME (fields[5]) = vt_off_identifier;
6654 DECL_MODE (fields[5]) = TYPE_MODE (delta_type_node);
6655 DECL_SIZE (fields[5]) = TYPE_SIZE (delta_type_node);
6656 TREE_UNSIGNED (fields[5]) = 0;
6657 TREE_CHAIN (fields[4]) = fields[5];
6659 sigtable_entry_type = build_qualified_type (sigtable_entry_type,
6661 record_builtin_type (RID_MAX, SIGTABLE_PTR_TYPE, sigtable_entry_type);
6664 std_node = build_decl (NAMESPACE_DECL,
6665 get_identifier (flag_honor_std ? "fake std":"std"),
6667 pushdecl (std_node);
6669 global_type_node = make_node (LANG_TYPE);
6670 record_unknown_type (global_type_node, "global type");
6673 current_lang_name = lang_name_cplusplus;
6676 tree bad_alloc_type_node, newtype, deltype;
6678 push_namespace (get_identifier ("std"));
6679 bad_alloc_type_node = xref_tag
6680 (class_type_node, get_identifier ("bad_alloc"), 1);
6683 newtype = build_exception_variant
6684 (ptr_ftype_sizetype, build_tree_list (NULL_TREE, bad_alloc_type_node));
6685 deltype = build_exception_variant
6686 (void_ftype_ptr, build_tree_list (NULL_TREE, NULL_TREE));
6687 auto_function (ansi_opname[(int) NEW_EXPR], newtype, NOT_BUILT_IN);
6688 auto_function (ansi_opname[(int) VEC_NEW_EXPR], newtype, NOT_BUILT_IN);
6689 global_delete_fndecl
6690 = auto_function (ansi_opname[(int) DELETE_EXPR], deltype, NOT_BUILT_IN);
6691 auto_function (ansi_opname[(int) VEC_DELETE_EXPR], deltype, NOT_BUILT_IN);
6695 = define_function ("__pure_virtual", void_ftype,
6696 NOT_BUILT_IN, 0, 0);
6698 /* Perform other language dependent initializations. */
6699 init_class_processing ();
6700 init_init_processing ();
6701 init_search_processing ();
6703 init_rtti_processing ();
6705 if (flag_exceptions)
6706 init_exception_processing ();
6709 flag_inline_functions = 0;
6712 if (! supports_one_only ())
6715 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6716 declare_function_name ();
6718 /* Prepare to check format strings against argument lists. */
6719 init_function_format_info ();
6721 /* Show we use EH for cleanups. */
6722 using_eh_for_cleanups ();
6724 print_error_function = lang_print_error_function;
6725 lang_get_alias_set = &c_get_alias_set;
6727 /* Maintain consistency. Perhaps we should just complain if they
6728 say -fwritable-strings? */
6729 if (flag_writable_strings)
6730 flag_const_strings = 0;
6733 /* Function to print any language-specific context for an error message. */
6736 lang_print_error_function (file)
6739 default_print_error_function (file);
6740 maybe_print_template_context ();
6743 /* Make a definition for a builtin function named NAME and whose data type
6744 is TYPE. TYPE should be a function type with argument types.
6745 FUNCTION_CODE tells later passes how to compile calls to this function.
6746 See tree.h for its possible values.
6748 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6749 the name to be called if we can't opencode the function. */
6752 define_function (name, type, function_code, pfn, library_name)
6755 enum built_in_function function_code;
6756 void (*pfn) PROTO((tree));
6757 const char *library_name;
6759 tree decl = build_lang_decl (FUNCTION_DECL, get_identifier (name), type);
6760 DECL_EXTERNAL (decl) = 1;
6761 TREE_PUBLIC (decl) = 1;
6762 DECL_ARTIFICIAL (decl) = 1;
6764 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392);
6765 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
6767 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6768 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6769 function in the namespace. */
6770 if (pfn) (*pfn) (decl);
6772 DECL_ASSEMBLER_NAME (decl) = get_identifier (library_name);
6773 make_function_rtl (decl);
6774 if (function_code != NOT_BUILT_IN)
6776 DECL_BUILT_IN (decl) = 1;
6777 DECL_FUNCTION_CODE (decl) = function_code;
6782 /* When we call finish_struct for an anonymous union, we create
6783 default copy constructors and such. But, an anonymous union
6784 shouldn't have such things; this function undoes the damage to the
6785 anonymous union type T.
6787 (The reason that we create the synthesized methods is that we don't
6788 distinguish `union { int i; }' from `typedef union { int i; } U'.
6789 The first is an anonymous union; the second is just an ordinary
6793 fixup_anonymous_union (t)
6798 /* Wipe out memory of synthesized methods */
6799 TYPE_HAS_CONSTRUCTOR (t) = 0;
6800 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6801 TYPE_HAS_INIT_REF (t) = 0;
6802 TYPE_HAS_CONST_INIT_REF (t) = 0;
6803 TYPE_HAS_ASSIGN_REF (t) = 0;
6804 TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6806 /* Splice the implicitly generated functions out of the TYPE_METHODS
6808 q = &TYPE_METHODS (t);
6811 if (DECL_ARTIFICIAL (*q))
6812 *q = TREE_CHAIN (*q);
6814 q = &TREE_CHAIN (*q);
6817 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6818 function members. */
6819 if (TYPE_METHODS (t))
6820 error ("an anonymous union cannot have function members");
6823 /* Make sure that a declaration with no declarator is well-formed, i.e.
6824 just defines a tagged type or anonymous union.
6826 Returns the type defined, if any. */
6829 check_tag_decl (declspecs)
6833 tree ob_modifier = NULL_TREE;
6835 register tree t = NULL_TREE;
6837 for (link = declspecs; link; link = TREE_CHAIN (link))
6839 register tree value = TREE_VALUE (link);
6845 if (IS_AGGR_TYPE (value) || TREE_CODE (value) == ENUMERAL_TYPE)
6847 my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
6851 else if (value == ridpointers[(int) RID_FRIEND])
6853 if (current_class_type == NULL_TREE
6854 || current_scope () != current_class_type)
6855 ob_modifier = value;
6857 else if (value == ridpointers[(int) RID_STATIC]
6858 || value == ridpointers[(int) RID_EXTERN]
6859 || value == ridpointers[(int) RID_AUTO]
6860 || value == ridpointers[(int) RID_REGISTER]
6861 || value == ridpointers[(int) RID_INLINE]
6862 || value == ridpointers[(int) RID_VIRTUAL]
6863 || value == ridpointers[(int) RID_CONST]
6864 || value == ridpointers[(int) RID_VOLATILE]
6865 || value == ridpointers[(int) RID_EXPLICIT])
6866 ob_modifier = value;
6870 error ("multiple types in one declaration");
6872 /* Inside a class, we might be in a friend or access declaration.
6873 Until we have a good way of detecting the latter, don't warn. */
6874 if (t == NULL_TREE && ! current_class_type)
6875 pedwarn ("declaration does not declare anything");
6877 /* Check for an anonymous union. We're careful
6878 accessing TYPE_IDENTIFIER because some built-in types, like
6879 pointer-to-member types, do not have TYPE_NAME. */
6880 else if (t && TREE_CODE (t) == UNION_TYPE
6882 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
6884 /* Anonymous unions are objects, so they can have specifiers. */;
6885 SET_ANON_UNION_TYPE_P (t);
6888 else if (ob_modifier)
6890 if (ob_modifier == ridpointers[(int) RID_INLINE]
6891 || ob_modifier == ridpointers[(int) RID_VIRTUAL])
6892 cp_error ("`%D' can only be specified for functions", ob_modifier);
6893 else if (ob_modifier == ridpointers[(int) RID_FRIEND])
6894 cp_error ("`%D' can only be specified inside a class", ob_modifier);
6895 else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
6896 cp_error ("`%D' can only be specified for constructors",
6899 cp_error ("`%D' can only be specified for objects and functions",
6906 /* Called when a declaration is seen that contains no names to declare.
6907 If its type is a reference to a structure, union or enum inherited
6908 from a containing scope, shadow that tag name for the current scope
6909 with a forward reference.
6910 If its type defines a new named structure or union
6911 or defines an enum, it is valid but we need not do anything here.
6912 Otherwise, it is an error.
6914 C++: may have to grok the declspecs to learn about static,
6915 complain for anonymous unions. */
6918 shadow_tag (declspecs)
6921 tree t = check_tag_decl (declspecs);
6924 maybe_process_partial_specialization (t);
6926 /* This is where the variables in an anonymous union are
6927 declared. An anonymous union declaration looks like:
6929 because there is no declarator after the union, the parser
6930 sends that declaration here. */
6931 if (t && ANON_UNION_TYPE_P (t))
6933 fixup_anonymous_union (t);
6935 if (TYPE_FIELDS (t))
6937 tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
6939 finish_anon_union (decl);
6944 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6947 groktypename (typename)
6950 if (TREE_CODE (typename) != TREE_LIST)
6952 return grokdeclarator (TREE_VALUE (typename),
6953 TREE_PURPOSE (typename),
6954 TYPENAME, 0, NULL_TREE);
6957 /* Decode a declarator in an ordinary declaration or data definition.
6958 This is called as soon as the type information and variable name
6959 have been parsed, before parsing the initializer if any.
6960 Here we create the ..._DECL node, fill in its type,
6961 and put it on the list of decls for the current context.
6962 The ..._DECL node is returned as the value.
6964 Exception: for arrays where the length is not specified,
6965 the type is left null, to be filled in by `cp_finish_decl'.
6967 Function definitions do not come here; they go to start_function
6968 instead. However, external and forward declarations of functions
6969 do go through here. Structure field declarations are done by
6970 grokfield and not through here. */
6972 /* Set this to zero to debug not using the temporary obstack
6973 to parse initializers. */
6974 int debug_temp_inits = 1;
6977 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
6978 tree declarator, declspecs;
6980 tree attributes, prefix_attributes;
6983 register tree type, tem;
6985 extern int have_extern_spec;
6986 extern int used_extern_spec;
6990 /* See code below that used this. */
6991 int init_written = initialized;
6994 /* This should only be done once on the top most decl. */
6995 if (have_extern_spec && !used_extern_spec)
6997 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"),
6999 used_extern_spec = 1;
7002 if (attributes || prefix_attributes)
7003 attrlist = build_scratch_list (attributes, prefix_attributes);
7005 attrlist = NULL_TREE;
7007 decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
7010 if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
7013 type = TREE_TYPE (decl);
7015 if (type == error_mark_node)
7018 /* Don't lose if destructors must be executed at file-level. */
7019 if (! processing_template_decl && TREE_STATIC (decl)
7020 && TYPE_NEEDS_DESTRUCTOR (complete_type (type))
7021 && !TREE_PERMANENT (decl))
7023 push_obstacks (&permanent_obstack, &permanent_obstack);
7024 decl = copy_node (decl);
7025 if (TREE_CODE (type) == ARRAY_TYPE)
7027 tree itype = TYPE_DOMAIN (type);
7028 if (itype && ! TREE_PERMANENT (itype))
7030 itype = build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype)));
7031 type = build_cplus_array_type (TREE_TYPE (type), itype);
7032 TREE_TYPE (decl) = type;
7039 = (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
7040 ? DECL_CLASS_CONTEXT (decl)
7041 : DECL_CONTEXT (decl);
7043 if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
7044 && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
7046 /* When parsing the initializer, lookup should use the object's
7048 push_decl_namespace (context);
7051 /* We are only interested in class contexts, later. */
7052 if (context && TREE_CODE (context) == NAMESPACE_DECL)
7053 context = NULL_TREE;
7056 /* Is it valid for this decl to have an initializer at all?
7057 If not, set INITIALIZED to zero, which will indirectly
7058 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7059 switch (TREE_CODE (decl))
7062 /* typedef foo = bar means give foo the same type as bar.
7063 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7064 Any other case of an initialization in a TYPE_DECL is an error. */
7065 if (pedantic || list_length (declspecs) > 1)
7067 cp_error ("typedef `%D' is initialized", decl);
7073 cp_error ("function `%#D' is initialized like a variable", decl);
7078 if (! processing_template_decl)
7080 if (type != error_mark_node)
7082 if (TYPE_SIZE (type) != NULL_TREE
7083 && ! TREE_CONSTANT (TYPE_SIZE (type)))
7086 ("variable-sized object `%D' may not be initialized",
7091 if (TREE_CODE (type) == ARRAY_TYPE
7092 && TYPE_SIZE (complete_type (TREE_TYPE (type))) == NULL_TREE)
7095 ("elements of array `%#D' have incomplete type", decl);
7104 if (! toplevel_bindings_p ()
7105 && DECL_EXTERNAL (decl))
7106 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7108 DECL_EXTERNAL (decl) = 0;
7109 if (toplevel_bindings_p ())
7110 TREE_STATIC (decl) = 1;
7112 /* Tell `pushdecl' this is an initialized decl
7113 even though we don't yet have the initializer expression.
7114 Also tell `cp_finish_decl' it may store the real initializer. */
7115 DECL_INITIAL (decl) = error_mark_node;
7118 if (context && TYPE_SIZE (complete_type (context)) != NULL_TREE)
7120 pushclass (context, 2);
7122 if (TREE_CODE (decl) == VAR_DECL)
7124 tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
7125 if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
7126 cp_error ("`%#D' is not a static member of `%#T'", decl, context);
7129 if (DECL_CONTEXT (field) != context)
7131 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
7132 DECL_CONTEXT (field), DECL_NAME (decl),
7133 context, DECL_NAME (decl));
7134 DECL_CONTEXT (decl) = DECL_CONTEXT (field);
7136 /* Static data member are tricky; an in-class initialization
7137 still doesn't provide a definition, so the in-class
7138 declaration will have DECL_EXTERNAL set, but will have an
7139 initialization. Thus, duplicate_decls won't warn
7140 about this situation, and so we check here. */
7141 if (DECL_INITIAL (decl) && DECL_INITIAL (field))
7142 cp_error ("duplicate initialization of %D", decl);
7143 if (duplicate_decls (decl, field))
7149 tree field = check_classfn (context, decl);
7150 if (field && duplicate_decls (decl, field))
7154 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7155 DECL_IN_AGGR_P (decl) = 0;
7156 if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
7157 || CLASSTYPE_USE_TEMPLATE (context))
7159 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
7160 /* [temp.expl.spec] An explicit specialization of a static data
7161 member of a template is a definition if the declaration
7162 includes an initializer; otherwise, it is a declaration.
7164 We check for processing_specialization so this only applies
7165 to the new specialization syntax. */
7166 if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
7167 DECL_EXTERNAL (decl) = 1;
7170 if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
7171 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7175 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7176 SET_DEFAULT_DECL_ATTRIBUTES (decl, attributes);
7179 /* Set attributes here so if duplicate decl, will have proper attributes. */
7180 cplus_decl_attributes (decl, attributes, prefix_attributes);
7182 /* Add this decl to the current binding level, but not if it
7183 comes from another scope, e.g. a static member variable.
7184 TEM may equal DECL or it may be a previous decl of the same name. */
7186 if ((TREE_CODE (decl) != PARM_DECL && DECL_CONTEXT (decl) != NULL_TREE
7187 /* Definitions of namespace members outside their namespace are
7189 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
7190 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
7191 || TREE_CODE (type) == LANG_TYPE
7192 /* The declaration of template specializations does not affect
7193 the functions available for overload resolution, so we do not
7195 || (TREE_CODE (decl) == FUNCTION_DECL
7196 && DECL_TEMPLATE_SPECIALIZATION (decl)))
7199 tem = pushdecl (decl);
7201 if (processing_template_decl)
7203 if (! current_function_decl)
7204 tem = push_template_decl (tem);
7205 else if (minimal_parse_mode)
7207 = build_min_nt (DECL_STMT, copy_to_permanent (declarator),
7208 copy_to_permanent (declspecs),
7213 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7214 /* Tell the back-end to use or not use .common as appropriate. If we say
7215 -fconserve-space, we want this to save .data space, at the expense of
7216 wrong semantics. If we say -fno-conserve-space, we want this to
7217 produce errors about redefs; to do this we force variables into the
7219 DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
7222 if (! processing_template_decl)
7225 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
7226 push_obstacks_nochange ();
7229 /* We have no way of knowing whether the initializer will need to be
7230 evaluated at run-time or not until we've parsed it, so let's just put
7231 it in the permanent obstack. (jason) */
7233 && ! (TREE_CODE (tem) == PARM_DECL
7234 || (TREE_READONLY (tem)
7235 && (TREE_CODE (tem) == VAR_DECL
7236 || TREE_CODE (tem) == FIELD_DECL))))
7238 /* When parsing and digesting the initializer,
7239 use temporary storage. Do this even if we will ignore the value. */
7240 if (toplevel_bindings_p () && debug_temp_inits)
7242 if (processing_template_decl
7243 || TYPE_NEEDS_CONSTRUCTING (type)
7244 || TREE_CODE (type) == REFERENCE_TYPE)
7245 /* In this case, the initializer must lay down in permanent
7246 storage, since it will be saved until `finish_file' is run. */
7249 temporary_allocation ();
7261 tree type = TREE_TYPE (decl);
7262 int initialized = (DECL_INITIAL (decl) != NULL_TREE);
7264 if (type == error_mark_node)
7267 /* If this type of object needs a cleanup, and control may
7268 jump past it, make a new binding level so that it is cleaned
7269 up only when it is initialized first. */
7270 if (TYPE_NEEDS_DESTRUCTOR (type)
7271 && current_binding_level->more_cleanups_ok == 0)
7272 pushlevel_temporary (1);
7275 /* Is it valid for this decl to have an initializer at all?
7276 If not, set INITIALIZED to zero, which will indirectly
7277 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7279 /* Don't allow initializations for incomplete types except for
7280 arrays which might be completed by the initialization. */
7281 if (TYPE_SIZE (complete_type (type)) != NULL_TREE)
7282 ; /* A complete type is ok. */
7283 else if (TREE_CODE (type) != ARRAY_TYPE)
7285 cp_error ("variable `%#D' has initializer but incomplete type",
7288 type = TREE_TYPE (decl) = error_mark_node;
7290 else if (TYPE_SIZE (complete_type (TREE_TYPE (type))) == NULL_TREE)
7292 if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
7293 cp_error ("elements of array `%#D' have incomplete type", decl);
7294 /* else we already gave an error in start_decl. */
7300 && TREE_CODE (decl) != TYPE_DECL
7301 && TREE_CODE (decl) != TEMPLATE_DECL
7302 && IS_AGGR_TYPE (type) && ! DECL_EXTERNAL (decl))
7304 if ((! processing_template_decl || ! uses_template_parms (type))
7305 && TYPE_SIZE (complete_type (type)) == NULL_TREE)
7307 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7309 /* Change the type so that assemble_variable will give
7310 DECL an rtl we can live with: (mem (const_int 0)). */
7311 type = TREE_TYPE (decl) = error_mark_node;
7315 /* If any base type in the hierarchy of TYPE needs a constructor,
7316 then we set initialized to 1. This way any nodes which are
7317 created for the purposes of initializing this aggregate
7318 will live as long as it does. This is necessary for global
7319 aggregates which do not have their initializers processed until
7320 the end of the file. */
7321 initialized = TYPE_NEEDS_CONSTRUCTING (type);
7326 /* We don't do this yet for GNU C++. */
7327 /* For a local variable, define the RTL now. */
7328 if (! toplevel_bindings_p ()
7329 /* But not if this is a duplicate decl
7330 and we preserved the rtl from the previous one
7331 (which may or may not happen). */
7332 && DECL_RTL (tem) == NULL_RTX)
7334 if (TYPE_SIZE (TREE_TYPE (tem)) != NULL_TREE)
7336 else if (TREE_CODE (TREE_TYPE (tem)) == ARRAY_TYPE
7337 && DECL_INITIAL (tem) != NULL_TREE)
7343 DECL_INITIAL (decl) = NULL_TREE;
7346 /* Handle initialization of references.
7347 These three arguments are from `cp_finish_decl', and have the
7348 same meaning here that they do there.
7350 Quotes on semantics can be found in ARM 8.4.3. */
7353 grok_reference_init (decl, type, init)
7354 tree decl, type, init;
7358 if (init == NULL_TREE)
7360 if ((DECL_LANG_SPECIFIC (decl) == 0
7361 || DECL_IN_AGGR_P (decl) == 0)
7362 && ! DECL_THIS_EXTERN (decl))
7364 cp_error ("`%D' declared as reference but not initialized", decl);
7365 if (TREE_CODE (decl) == VAR_DECL)
7366 SET_DECL_REFERENCE_SLOT (decl, error_mark_node);
7371 if (init == error_mark_node)
7374 if (TREE_CODE (type) == REFERENCE_TYPE
7375 && TREE_CODE (init) == CONSTRUCTOR)
7377 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl);
7381 if (TREE_CODE (init) == TREE_LIST)
7382 init = build_compound_expr (init);
7384 if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
7385 init = convert_from_reference (init);
7387 if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
7388 && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
7390 /* Note: default conversion is only called in very special cases. */
7391 init = default_conversion (init);
7394 tmp = convert_to_reference
7395 (type, init, CONV_IMPLICIT,
7396 LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND, decl);
7398 if (tmp == error_mark_node)
7400 else if (tmp != NULL_TREE)
7403 DECL_INITIAL (decl) = save_expr (init);
7407 cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
7411 /* ?? Can this be optimized in some cases to
7412 hand back the DECL_INITIAL slot?? */
7413 if (TYPE_SIZE (TREE_TYPE (type)))
7415 init = convert_from_reference (decl);
7416 if (TREE_PERMANENT (decl))
7417 init = copy_to_permanent (init);
7418 SET_DECL_REFERENCE_SLOT (decl, init);
7421 if (TREE_STATIC (decl) && ! TREE_CONSTANT (DECL_INITIAL (decl)))
7423 expand_static_init (decl, DECL_INITIAL (decl));
7424 DECL_INITIAL (decl) = NULL_TREE;
7429 if (TREE_CODE (decl) == VAR_DECL)
7430 SET_DECL_REFERENCE_SLOT (decl, error_mark_node);
7434 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7435 mucking with forces it does not comprehend (i.e. initialization with a
7436 constructor). If we are at global scope and won't go into COMMON, fill
7437 it in with a dummy CONSTRUCTOR to force the variable into .data;
7438 otherwise we can use error_mark_node. */
7441 obscure_complex_init (decl, init)
7444 if (! flag_no_inline && TREE_STATIC (decl))
7446 if (extract_init (decl, init))
7450 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7451 if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7452 DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7456 DECL_INITIAL (decl) = error_mark_node;
7461 /* Issue an error message if DECL is an uninitialized const variable. */
7464 check_for_uninitialized_const_var (decl)
7467 tree type = TREE_TYPE (decl);
7469 /* ``Unless explicitly declared extern, a const object does not have
7470 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7472 if (TREE_CODE (decl) == VAR_DECL
7473 && TREE_CODE (type) != REFERENCE_TYPE
7474 && CP_TYPE_CONST_P (type)
7475 && !TYPE_NEEDS_CONSTRUCTING (type)
7476 && !DECL_INITIAL (decl))
7477 cp_error ("uninitialized const `%D'", decl);
7480 /* Finish processing of a declaration;
7481 install its line number and initial value.
7482 If the length of an array type is not known before,
7483 it must be determined now, from the initial value, or it is an error.
7485 Call `pop_obstacks' iff NEED_POP is nonzero.
7487 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7488 for aggregates that have constructors alive on the permanent obstack,
7489 so that the global initializing functions can be written at the end.
7491 INIT0 holds the value of an initializer that should be allowed to escape
7494 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7495 if the (init) syntax was used.
7497 For functions that take default parameters, DECL points to its
7498 "maximal" instantiation. `cp_finish_decl' must then also declared its
7499 subsequently lower and lower forms of instantiation, checking for
7500 ambiguity as it goes. This can be sped up later. */
7503 cp_finish_decl (decl, init, asmspec_tree, need_pop, flags)
7510 tree cleanup = NULL_TREE, ttype = NULL_TREE;
7512 int temporary = allocation_temporary_p ();
7513 char *asmspec = NULL;
7514 int was_readonly = 0;
7515 int already_used = 0;
7517 /* If this is 0, then we did not change obstacks. */
7521 error ("assignment (not initialization) in declaration");
7525 /* If a name was specified, get the string. */
7527 asmspec = TREE_STRING_POINTER (asmspec_tree);
7529 if (init && TREE_CODE (init) == NAMESPACE_DECL)
7531 cp_error ("Cannot initialize `%D' to namespace `%D'",
7536 if (current_class_type
7537 && DECL_REAL_CONTEXT (decl) == current_class_type
7538 && TYPE_BEING_DEFINED (current_class_type)
7539 && (DECL_INITIAL (decl) || init))
7540 DECL_DEFINED_IN_CLASS_P (decl) = 1;
7542 if (TREE_CODE (decl) == VAR_DECL
7543 && DECL_CONTEXT (decl)
7544 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
7545 && DECL_CONTEXT (decl) != current_namespace
7548 /* Leave the namespace of the object. */
7549 pop_decl_namespace ();
7552 /* If the type of the thing we are declaring either has
7553 a constructor, or has a virtual function table pointer,
7554 AND its initialization was accepted by `start_decl',
7555 then we stayed on the permanent obstack through the
7556 declaration, otherwise, changed obstacks as GCC would. */
7558 type = TREE_TYPE (decl);
7560 if (type == error_mark_node)
7562 if (toplevel_bindings_p () && temporary)
7563 end_temporary_allocation ();
7568 if (TYPE_HAS_MUTABLE_P (type))
7569 TREE_READONLY (decl) = 0;
7571 if (processing_template_decl)
7573 if (init && DECL_INITIAL (decl))
7574 DECL_INITIAL (decl) = init;
7575 if (minimal_parse_mode && ! DECL_ARTIFICIAL (decl))
7577 tree stmt = DECL_VINDEX (decl);
7578 /* If the decl is declaring a member of a local class (in a
7579 template function), the DECL_VINDEX will either be NULL,
7580 or it will be an actual virtual function index, not a
7582 if (stmt != NULL_TREE && TREE_CODE (stmt) == DECL_STMT)
7584 DECL_VINDEX (decl) = NULL_TREE;
7585 TREE_OPERAND (stmt, 2) = copy_to_permanent (init);
7592 /* Take care of TYPE_DECLs up front. */
7593 if (TREE_CODE (decl) == TYPE_DECL)
7595 if (init && DECL_INITIAL (decl))
7597 /* typedef foo = bar; store the type of bar as the type of foo. */
7598 TREE_TYPE (decl) = type = TREE_TYPE (init);
7599 DECL_INITIAL (decl) = init = NULL_TREE;
7601 if (type != error_mark_node
7602 && IS_AGGR_TYPE (type) && DECL_NAME (decl))
7604 if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
7605 cp_warning ("shadowing previous type declaration of `%#D'", decl);
7606 set_identifier_type_value (DECL_NAME (decl), type);
7607 CLASSTYPE_GOT_SEMICOLON (type) = 1;
7609 GNU_xref_decl (current_function_decl, decl);
7611 /* If we have installed this as the canonical typedef for this
7612 type, and that type has not been defined yet, delay emitting
7613 the debug information for it, as we will emit it later. */
7614 if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
7615 && TYPE_SIZE (TREE_TYPE (decl)) == NULL_TREE)
7616 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
7618 rest_of_decl_compilation (decl, NULL_PTR,
7619 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
7622 if (TREE_CODE (decl) != FUNCTION_DECL)
7624 ttype = target_type (type);
7627 if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
7628 && TYPE_NEEDS_CONSTRUCTING (type))
7631 /* Currently, GNU C++ puts constants in text space, making them
7632 impossible to initialize. In the future, one would hope for
7633 an operating system which understood the difference between
7634 initialization and the running of a program. */
7636 TREE_READONLY (decl) = 0;
7639 if (TREE_CODE (decl) == FIELD_DECL)
7641 if (init && init != error_mark_node)
7642 my_friendly_assert (TREE_PERMANENT (init), 147);
7646 /* This must override the asm specifier which was placed
7647 by grokclassfn. Lay this out fresh. */
7648 DECL_RTL (TREE_TYPE (decl)) = NULL_RTX;
7649 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7650 make_decl_rtl (decl, asmspec, 0);
7653 /* If `start_decl' didn't like having an initialization, ignore it now. */
7654 else if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7656 else if (DECL_EXTERNAL (decl))
7658 else if (TREE_CODE (type) == REFERENCE_TYPE
7659 || (TYPE_LANG_SPECIFIC (type) && IS_SIGNATURE_REFERENCE (type)))
7661 if (TREE_STATIC (decl))
7662 make_decl_rtl (decl, NULL_PTR,
7663 toplevel_bindings_p ()
7664 || pseudo_global_level_p ());
7665 grok_reference_init (decl, type, init);
7669 GNU_xref_decl (current_function_decl, decl);
7671 if (TREE_CODE (decl) == FIELD_DECL)
7673 else if (TREE_CODE (decl) == CONST_DECL)
7675 my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7677 DECL_INITIAL (decl) = init;
7679 /* This will keep us from needing to worry about our obstacks. */
7680 my_friendly_assert (init != NULL_TREE, 149);
7685 if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7687 if (TREE_CODE (type) == ARRAY_TYPE)
7688 init = digest_init (type, init, (tree *) 0);
7689 else if (TREE_CODE (init) == CONSTRUCTOR
7690 && TREE_HAS_CONSTRUCTOR (init))
7692 if (TYPE_NON_AGGREGATE_CLASS (type))
7694 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7696 init = error_mark_node;
7699 goto dont_use_constructor;
7704 dont_use_constructor:
7705 if (TREE_CODE (init) != TREE_VEC)
7706 init = store_init_value (decl, init);
7710 /* We must hide the initializer so that expand_decl
7711 won't try to do something it does not understand. */
7712 init = obscure_complex_init (decl, init);
7714 else if (DECL_EXTERNAL (decl))
7716 else if (TREE_CODE_CLASS (TREE_CODE (type)) == 't'
7717 && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7720 while (TREE_CODE (ctype) == ARRAY_TYPE)
7721 ctype = TREE_TYPE (ctype);
7722 if (! TYPE_NEEDS_CONSTRUCTING (ctype))
7724 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (ctype))
7725 cp_error ("structure `%D' with uninitialized const members", decl);
7726 if (CLASSTYPE_REF_FIELDS_NEED_INIT (ctype))
7727 cp_error ("structure `%D' with uninitialized reference members",
7731 check_for_uninitialized_const_var (decl);
7733 if (TYPE_SIZE (type) != NULL_TREE
7734 && TYPE_NEEDS_CONSTRUCTING (type))
7735 init = obscure_complex_init (decl, NULL_TREE);
7739 check_for_uninitialized_const_var (decl);
7741 /* For top-level declaration, the initial value was read in
7742 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7743 must go in the permanent obstack; but don't discard the
7744 temporary data yet. */
7746 if (toplevel_bindings_p () && temporary)
7747 end_temporary_allocation ();
7749 /* Deduce size of array from initialization, if not already known. */
7751 if (TREE_CODE (type) == ARRAY_TYPE
7752 && TYPE_DOMAIN (type) == NULL_TREE
7753 && TREE_CODE (decl) != TYPE_DECL)
7756 = (TREE_STATIC (decl)
7757 /* Even if pedantic, an external linkage array
7758 may have incomplete type at first. */
7759 ? pedantic && ! DECL_EXTERNAL (decl)
7760 : !DECL_EXTERNAL (decl));
7761 tree initializer = init ? init : DECL_INITIAL (decl);
7762 int failure = complete_array_type (type, initializer, do_default);
7765 cp_error ("initializer fails to determine size of `%D'", decl);
7770 cp_error ("array size missing in `%D'", decl);
7771 /* If a `static' var's size isn't known, make it extern as
7772 well as static, so it does not get allocated. If it's not
7773 `static', then don't mark it extern; finish_incomplete_decl
7774 will give it a default size and it will get allocated. */
7775 else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7776 DECL_EXTERNAL (decl) = 1;
7779 if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7780 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7782 cp_error ("zero-size array `%D'", decl);
7784 layout_decl (decl, 0);
7787 if (TREE_CODE (decl) == VAR_DECL)
7789 if (DECL_SIZE (decl) == NULL_TREE
7790 && TYPE_SIZE (complete_type (TREE_TYPE (decl))) != NULL_TREE)
7791 layout_decl (decl, 0);
7793 if (TREE_STATIC (decl) && DECL_SIZE (decl) == NULL_TREE)
7795 /* A static variable with an incomplete type:
7796 that is an error if it is initialized.
7797 Otherwise, let it through, but if it is not `extern'
7798 then it may cause an error message later. */
7799 if (DECL_INITIAL (decl) != NULL_TREE)
7800 cp_error ("storage size of `%D' isn't known", decl);
7803 else if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7805 /* An automatic variable with an incomplete type: that is an error.
7806 Don't talk about array types here, since we took care of that
7807 message in grokdeclarator. */
7808 cp_error ("storage size of `%D' isn't known", decl);
7809 TREE_TYPE (decl) = error_mark_node;
7811 else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7812 /* Let debugger know it should output info for this type. */
7813 note_debug_info_needed (ttype);
7815 if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7816 note_debug_info_needed (DECL_CONTEXT (decl));
7818 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7819 && DECL_SIZE (decl) != NULL_TREE
7820 && ! TREE_CONSTANT (DECL_SIZE (decl)))
7822 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7823 constant_expression_warning (DECL_SIZE (decl));
7825 cp_error ("storage size of `%D' isn't constant", decl);
7828 if (! DECL_EXTERNAL (decl) && TYPE_NEEDS_DESTRUCTOR (type)
7829 /* Cleanups for static variables are handled by `finish_file'. */
7830 && ! TREE_STATIC (decl))
7832 int yes = suspend_momentary ();
7833 cleanup = maybe_build_cleanup (decl);
7834 resume_momentary (yes);
7837 /* PARM_DECLs get cleanups, too. */
7838 else if (TREE_CODE (decl) == PARM_DECL && TYPE_NEEDS_DESTRUCTOR (type))
7841 end_temporary_allocation ();
7842 cleanup = maybe_build_cleanup (decl);
7844 resume_temporary_allocation ();
7847 /* Output the assembler code and/or RTL code for variables and functions,
7848 unless the type is an undefined structure or union.
7849 If not, it will get done when the type is completed. */
7851 was_incomplete = (DECL_SIZE (decl) == NULL_TREE);
7853 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
7854 || TREE_CODE (decl) == RESULT_DECL)
7856 /* ??? FIXME: What about nested classes? */
7857 int toplev = toplevel_bindings_p () || pseudo_global_level_p ();
7859 = (TREE_STATIC (decl) && TYPE_NEEDS_DESTRUCTOR (type)
7860 && allocation_temporary_p ());
7863 end_temporary_allocation ();
7865 /* Static data in a function with comdat linkage also has comdat
7867 if (TREE_CODE (decl) == VAR_DECL
7868 && TREE_STATIC (decl)
7869 /* Don't mess with __FUNCTION__. */
7870 && ! TREE_ASM_WRITTEN (decl)
7871 && current_function_decl
7872 && DECL_CONTEXT (decl) == current_function_decl
7873 && (DECL_THIS_INLINE (current_function_decl)
7874 || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7875 && TREE_PUBLIC (current_function_decl))
7877 /* Rather than try to get this right with inlining, we suppress
7878 inlining of such functions. */
7879 current_function_cannot_inline
7880 = "function with static variable cannot be inline";
7882 /* If flag_weak, we don't need to mess with this, as we can just
7883 make the function weak, and let it refer to its unique local
7884 copy. This works because we don't allow the function to be
7888 if (DECL_INTERFACE_KNOWN (current_function_decl))
7890 TREE_PUBLIC (decl) = 1;
7891 DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7893 else if (DECL_INITIAL (decl) == NULL_TREE
7894 || DECL_INITIAL (decl) == error_mark_node)
7896 TREE_PUBLIC (decl) = 1;
7897 DECL_COMMON (decl) = 1;
7899 /* else we lose. We can only do this if we can use common,
7900 which we can't if it has been initialized. */
7902 if (TREE_PUBLIC (decl))
7903 DECL_ASSEMBLER_NAME (decl)
7904 = build_static_name (current_function_decl, DECL_NAME (decl));
7905 else if (! DECL_ARTIFICIAL (decl))
7907 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7908 cp_warning_at (" you can work around this by removing the initializer"), decl;
7913 else if (TREE_CODE (decl) == VAR_DECL
7914 && DECL_LANG_SPECIFIC (decl)
7915 && DECL_COMDAT (decl))
7916 /* Set it up again; we might have set DECL_INITIAL since the
7918 comdat_linkage (decl);
7920 if (TREE_CODE (decl) == VAR_DECL && DECL_VIRTUAL_P (decl))
7921 make_decl_rtl (decl, NULL_PTR, toplev);
7922 else if (TREE_CODE (decl) == VAR_DECL
7923 && TREE_READONLY (decl)
7924 && DECL_INITIAL (decl) != NULL_TREE
7925 && DECL_INITIAL (decl) != error_mark_node
7926 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
7928 DECL_INITIAL (decl) = save_expr (DECL_INITIAL (decl));
7931 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7934 && TREE_STATIC (decl)
7935 && ! TREE_SIDE_EFFECTS (decl)
7936 && ! TREE_PUBLIC (decl)
7937 && ! DECL_EXTERNAL (decl)
7938 && ! TYPE_NEEDS_DESTRUCTOR (type)
7939 && DECL_MODE (decl) != BLKmode)
7941 /* If this variable is really a constant, then fill its DECL_RTL
7942 slot with something which won't take up storage.
7943 If something later should take its address, we can always give
7944 it legitimate RTL at that time. */
7945 DECL_RTL (decl) = gen_reg_rtx (DECL_MODE (decl));
7946 store_expr (DECL_INITIAL (decl), DECL_RTL (decl), 0);
7947 TREE_ASM_WRITTEN (decl) = 1;
7949 else if (toplev && ! TREE_PUBLIC (decl))
7951 /* If this is a static const, change its apparent linkage
7952 if it belongs to a #pragma interface. */
7953 if (!interface_unknown)
7955 TREE_PUBLIC (decl) = 1;
7956 DECL_EXTERNAL (decl) = interface_only;
7958 make_decl_rtl (decl, asmspec, toplev);
7961 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7963 else if (TREE_CODE (decl) == VAR_DECL
7964 && DECL_LANG_SPECIFIC (decl)
7965 && DECL_IN_AGGR_P (decl))
7967 if (TREE_STATIC (decl))
7969 if (init == NULL_TREE
7970 #ifdef DEFAULT_STATIC_DEFS
7971 /* If this code is dead, then users must
7972 explicitly declare static member variables
7973 outside the class def'n as well. */
7974 && TYPE_NEEDS_CONSTRUCTING (type)
7978 DECL_EXTERNAL (decl) = 1;
7979 make_decl_rtl (decl, asmspec, 1);
7982 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7985 /* Just a constant field. Should not need any rtl. */
7989 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7992 resume_temporary_allocation ();
7994 if (type != error_mark_node
7995 && TYPE_LANG_SPECIFIC (type)
7996 && CLASSTYPE_ABSTRACT_VIRTUALS (type))
7997 abstract_virtuals_error (decl, type);
7998 else if ((TREE_CODE (type) == FUNCTION_TYPE
7999 || TREE_CODE (type) == METHOD_TYPE)
8000 && TYPE_LANG_SPECIFIC (TREE_TYPE (type))
8001 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (type)))
8002 abstract_virtuals_error (decl, TREE_TYPE (type));
8004 if (TYPE_LANG_SPECIFIC (type) && IS_SIGNATURE (type))
8005 signature_error (decl, type);
8006 else if ((TREE_CODE (type) == FUNCTION_TYPE
8007 || TREE_CODE (type) == METHOD_TYPE)
8008 && TYPE_LANG_SPECIFIC (TREE_TYPE (type))
8009 && IS_SIGNATURE (TREE_TYPE (type)))
8010 signature_error (decl, TREE_TYPE (type));
8012 if (TREE_CODE (decl) == FUNCTION_DECL)
8014 else if (DECL_EXTERNAL (decl)
8015 && ! (DECL_LANG_SPECIFIC (decl)
8016 && DECL_NOT_REALLY_EXTERN (decl)))
8019 DECL_INITIAL (decl) = init;
8021 else if (TREE_STATIC (decl) && type != error_mark_node)
8023 /* Cleanups for static variables are handled by `finish_file'. */
8024 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
8025 || TYPE_NEEDS_DESTRUCTOR (type))
8026 expand_static_init (decl, init);
8030 /* This is a declared decl which must live until the
8031 end of the binding contour. It may need a cleanup. */
8033 /* Recompute the RTL of a local array now
8034 if it used to be an incomplete type. */
8035 if (was_incomplete && ! TREE_STATIC (decl))
8037 /* If we used it already as memory, it must stay in memory. */
8038 TREE_ADDRESSABLE (decl) = TREE_USED (decl);
8039 /* If it's still incomplete now, no init will save it. */
8040 if (DECL_SIZE (decl) == NULL_TREE)
8041 DECL_INITIAL (decl) = NULL_TREE;
8044 else if (! TREE_ASM_WRITTEN (decl)
8045 && (TYPE_SIZE (type) != NULL_TREE
8046 || TREE_CODE (type) == ARRAY_TYPE))
8048 /* Do this here, because we did not expand this decl's
8049 rtl in start_decl. */
8050 if (DECL_RTL (decl) == NULL_RTX)
8054 /* XXX: Why don't we use decl here? */
8055 /* Ans: Because it was already expanded? */
8056 if (! expand_decl_cleanup (NULL_TREE, cleanup))
8057 cp_error ("parser lost in parsing declaration of `%D'",
8059 /* Cleanup used up here. */
8060 cleanup = NULL_TREE;
8064 if (current_binding_level->is_for_scope)
8066 struct binding_level *outer
8067 = current_binding_level->level_chain;
8069 /* Check to see if the same name is already bound at
8070 the outer level, either because it was directly declared,
8071 or because a dead for-decl got preserved. In either case,
8072 the code would not have been valid under the ARM
8073 scope rules, so clear is_for_scope for the
8074 current_binding_level.
8076 Otherwise, we need to preserve the temp slot for decl
8077 to last into the outer binding level. */
8080 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
8082 if (outer_binding && BINDING_LEVEL (outer_binding) == outer
8083 && (TREE_CODE (BINDING_VALUE (outer_binding))
8085 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
8087 BINDING_VALUE (outer_binding)
8088 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
8089 current_binding_level->is_for_scope = 0;
8091 else if (DECL_IN_MEMORY_P (decl))
8092 preserve_temp_slots (DECL_RTL (decl));
8095 expand_start_target_temps ();
8097 if (DECL_SIZE (decl) && type != error_mark_node)
8099 /* Compute and store the initial value. */
8100 expand_decl_init (decl);
8101 already_used = TREE_USED (decl) || TREE_USED (type);
8103 if (init || TYPE_NEEDS_CONSTRUCTING (type))
8105 emit_line_note (DECL_SOURCE_FILE (decl),
8106 DECL_SOURCE_LINE (decl));
8107 expand_aggr_init (decl, init, flags);
8110 /* Set this to 0 so we can tell whether an aggregate which
8111 was initialized was ever used. Don't do this if it has a
8112 destructor, so we don't complain about the 'resource
8113 allocation is initialization' idiom. */
8114 /* Now set attribute((unused)) on types so decls of
8115 that type will be marked used. (see TREE_USED, above.)
8116 This avoids the warning problems this particular code
8117 tried to work around. */
8119 if (TYPE_NEEDS_CONSTRUCTING (type)
8121 && cleanup == NULL_TREE
8122 && DECL_NAME (decl))
8123 TREE_USED (decl) = 0;
8126 TREE_USED (decl) = 1;
8129 /* Cleanup any temporaries needed for the initial value. */
8130 expand_end_target_temps ();
8132 if (DECL_SIZE (decl) && type != error_mark_node)
8134 /* Store the cleanup, if there was one. */
8137 if (! expand_decl_cleanup (decl, cleanup))
8138 cp_error ("parser lost in parsing declaration of `%D'",
8145 /* Undo call to `pushclass' that was done in `start_decl'
8146 due to initialization of qualified member variable.
8147 I.e., Foo::x = 10; */
8149 tree context = DECL_REAL_CONTEXT (decl);
8151 && TREE_CODE_CLASS (TREE_CODE (context)) == 't'
8152 && (TREE_CODE (decl) == VAR_DECL
8153 /* We also have a pushclass done that we need to undo here
8154 if we're at top level and declare a method. */
8155 || TREE_CODE (decl) == FUNCTION_DECL)
8156 /* If size hasn't been set, we're still defining it,
8157 and therefore inside the class body; don't pop
8158 the binding level.. */
8159 && TYPE_SIZE (context) != NULL_TREE
8160 && context == current_class_type)
8167 /* If requested, warn about definitions of large data objects. */
8169 if (warn_larger_than
8170 && ! processing_template_decl
8171 && (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
8172 && !DECL_EXTERNAL (decl))
8174 register tree decl_size = DECL_SIZE (decl);
8176 if (decl_size && TREE_CODE (decl_size) == INTEGER_CST)
8178 unsigned units = TREE_INT_CST_LOW (decl_size) / BITS_PER_UNIT;
8180 if (units > larger_than_size)
8181 warning_with_decl (decl, "size of `%s' is %u bytes", units);
8187 /* Resume permanent allocation, if not within a function. */
8188 /* The corresponding push_obstacks_nochange is in start_decl,
8189 start_method, groktypename, and in grokfield. */
8194 TREE_READONLY (decl) = 1;
8197 /* This is here for a midend callback from c-common.c */
8200 finish_decl (decl, init, asmspec_tree)
8204 cp_finish_decl (decl, init, asmspec_tree, 1, 0);
8208 expand_static_init (decl, init)
8212 tree oldstatic = value_member (decl, static_aggregates);
8214 /* If at_eof is 2, we're too late. */
8215 my_friendly_assert (at_eof <= 1, 990323);
8219 if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
8220 cp_error ("multiple initializations given for `%D'", decl);
8222 else if (! toplevel_bindings_p () && ! pseudo_global_level_p ())
8224 /* Emit code to perform this initialization but once. */
8227 /* Remember this information until end of file. */
8228 push_obstacks (&permanent_obstack, &permanent_obstack);
8230 /* Emit code to perform this initialization but once. This code
8233 static int temp = 0;
8235 // Do initialization.
8237 // Register variable for destruction at end of program.
8240 Note that the `temp' variable is only set to 1 *after* the
8241 initialization is complete. This ensures that an exception,
8242 thrown during the construction, will cause the variable to
8243 reinitialized when we pass through this code again, as per:
8247 If the initialization exits by throwing an exception, the
8248 initialization is not complete, so it will be tried again
8249 the next time control enters the declaration.
8251 In theory, this process should be thread-safe, too; multiple
8252 threads should not be able to initialize the variable more
8253 than once. We don't yet attempt to ensure thread-safety. */
8254 temp = get_temp_name (integer_type_node, 1);
8255 rest_of_decl_compilation (temp, NULL_PTR, 0, 0);
8257 /* Begin the conditional initialization. */
8258 expand_start_cond (build_binary_op (EQ_EXPR, temp,
8259 integer_zero_node, 1), 0);
8260 expand_start_target_temps ();
8262 /* Do the initialization itself. */
8263 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8264 || (init && TREE_CODE (init) == TREE_LIST))
8266 expand_aggr_init (decl, init, 0);
8267 do_pending_stack_adjust ();
8270 expand_assignment (decl, init, 0, 0);
8272 /* Set TEMP to 1. */
8273 expand_assignment (temp, integer_one_node, 0, 0);
8275 /* Cleanup any temporaries needed for the initial value. If
8276 destroying one of the temporaries causes an exception to be
8277 thrown, then the object itself has still been fully
8279 expand_end_target_temps ();
8281 /* Use atexit to register a function for destroying this static
8283 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl)))
8285 tree cleanup, fcall;
8286 static tree Atexit = 0;
8289 tree atexit_fndecl, PFV, pfvlist;
8290 /* Remember this information until end of file. */
8291 push_obstacks (&permanent_obstack, &permanent_obstack);
8292 PFV = build_pointer_type (build_function_type
8293 (void_type_node, void_list_node));
8295 pfvlist = tree_cons (NULL_TREE, PFV, void_list_node);
8297 push_lang_context (lang_name_c);
8299 = builtin_function ("atexit",
8300 build_function_type (void_type_node,
8302 NOT_BUILT_IN, NULL_PTR);
8303 mark_used (atexit_fndecl);
8304 Atexit = default_conversion (atexit_fndecl);
8305 pop_lang_context ();
8309 /* Call build_cleanup before we enter the anonymous function
8310 so that any access checks will be done relative to the
8311 current scope, rather than the scope of the anonymous
8313 fcall = build_cleanup (decl);
8314 cleanup = start_anon_func ();
8315 expand_expr_stmt (fcall);
8317 mark_addressable (cleanup);
8318 cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
8319 fcall = build_function_call (Atexit, expr_tree_cons (NULL_TREE, cleanup, NULL_TREE));
8320 expand_expr_stmt (fcall);
8324 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl)))
8326 static_aggregates = perm_tree_cons (temp, decl, static_aggregates);
8327 TREE_STATIC (static_aggregates) = 1;
8330 /* Resume old (possibly temporary) allocation. */
8335 /* This code takes into account memory allocation
8336 policy of `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING
8337 does not hold for this object, then we must make permanent
8338 the storage currently in the temporary obstack. */
8339 if (! TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
8340 preserve_initializer ();
8341 static_aggregates = perm_tree_cons (init, decl, static_aggregates);
8345 /* Make TYPE a complete type based on INITIAL_VALUE.
8346 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8347 2 if there was no information (in which case assume 1 if DO_DEFAULT). */
8350 complete_array_type (type, initial_value, do_default)
8351 tree type, initial_value;
8354 register tree maxindex = NULL_TREE;
8359 /* Note MAXINDEX is really the maximum index,
8360 one less than the size. */
8361 if (TREE_CODE (initial_value) == STRING_CST)
8364 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8365 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8368 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8370 tree elts = CONSTRUCTOR_ELTS (initial_value);
8371 maxindex = size_binop (MINUS_EXPR, integer_zero_node, size_one_node);
8372 for (; elts; elts = TREE_CHAIN (elts))
8374 if (TREE_PURPOSE (elts))
8375 maxindex = TREE_PURPOSE (elts);
8377 maxindex = size_binop (PLUS_EXPR, maxindex, size_one_node);
8379 maxindex = copy_node (maxindex);
8383 /* Make an error message unless that happened already. */
8384 if (initial_value != error_mark_node)
8387 initial_value = NULL_TREE;
8389 /* Prevent further error messages. */
8390 maxindex = build_int_2 (0, 0);
8397 maxindex = build_int_2 (0, 0);
8405 TYPE_DOMAIN (type) = build_index_type (maxindex);
8406 if (! TREE_TYPE (maxindex))
8407 TREE_TYPE (maxindex) = TYPE_DOMAIN (type);
8409 itype = TREE_TYPE (initial_value);
8412 if (itype && !TYPE_DOMAIN (itype))
8413 TYPE_DOMAIN (itype) = TYPE_DOMAIN (type);
8414 /* The type of the main variant should never be used for arrays
8415 of different sizes. It should only ever be completed with the
8416 size of the array. */
8417 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8418 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = TYPE_DOMAIN (type);
8421 /* Lay out the type now that we can get the real answer. */
8428 /* Return zero if something is declared to be a member of type
8429 CTYPE when in the context of CUR_TYPE. STRING is the error
8430 message to print in that case. Otherwise, quietly return 1. */
8433 member_function_or_else (ctype, cur_type, string)
8434 tree ctype, cur_type;
8437 if (ctype && ctype != cur_type)
8439 error (string, TYPE_NAME_STRING (ctype));
8445 /* Subroutine of `grokdeclarator'. */
8447 /* Generate errors possibly applicable for a given set of specifiers.
8448 This is for ARM $7.1.2. */
8451 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8454 int virtualp, quals, friendp, raises, inlinep;
8457 cp_error ("`%D' declared as a `virtual' %s", object, type);
8459 cp_error ("`%D' declared as an `inline' %s", object, type);
8461 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8464 cp_error_at ("invalid friend declaration", object);
8466 cp_error_at ("invalid exception specifications", object);
8469 /* CTYPE is class type, or null if non-class.
8470 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8472 DECLARATOR is the function's name.
8473 VIRTUALP is truthvalue of whether the function is virtual or not.
8474 FLAGS are to be passed through to `grokclassfn'.
8475 QUALS are qualifiers indicating whether the function is `const'
8477 RAISES is a list of exceptions that this function can raise.
8478 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8479 not look, and -1 if we should not call `grokclassfn' at all.
8481 Returns `NULL_TREE' if something goes wrong, after issuing
8482 applicable error messages. */
8485 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8486 raises, attrlist, check, friendp, publicp, inlinep, funcdef_flag,
8487 template_count, in_namespace)
8490 tree orig_declarator;
8492 enum overload_flags flags;
8493 tree quals, raises, attrlist;
8494 int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8498 int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8502 cname = TREE_CODE (TYPE_NAME (ctype)) == TYPE_DECL
8503 ? TYPE_IDENTIFIER (ctype) : TYPE_NAME (ctype);
8509 type = build_exception_variant (type, raises);
8512 decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8513 /* Propagate volatile out from type to decl. */
8514 if (TYPE_VOLATILE (type))
8515 TREE_THIS_VOLATILE (decl) = 1;
8517 /* If this decl has namespace scope, set that up. */
8519 set_decl_namespace (decl, in_namespace, friendp);
8520 else if (publicp && ! ctype)
8521 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8523 /* `main' and builtins have implicit 'C' linkage. */
8524 if ((MAIN_NAME_P (declarator)
8525 || (IDENTIFIER_LENGTH (declarator) > 10
8526 && IDENTIFIER_POINTER (declarator)[0] == '_'
8527 && IDENTIFIER_POINTER (declarator)[1] == '_'
8528 && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8529 && current_lang_name == lang_name_cplusplus
8530 && ctype == NULL_TREE
8531 /* NULL_TREE means global namespace. */
8532 && DECL_CONTEXT (decl) == NULL_TREE)
8533 DECL_LANGUAGE (decl) = lang_c;
8535 /* Should probably propagate const out from type to decl I bet (mrs). */
8538 DECL_STATIC_FUNCTION_P (decl) = 1;
8539 DECL_CONTEXT (decl) = ctype;
8543 DECL_CLASS_CONTEXT (decl) = ctype;
8545 if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8547 if (processing_template_decl)
8548 error ("cannot declare `main' to be a template");
8550 error ("cannot declare `main' to be inline");
8552 error ("cannot declare `main' to be static");
8557 /* Members of anonymous types and local classes have no linkage; make
8559 if (ctype && (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype))
8560 || hack_decl_function_context (TYPE_MAIN_DECL (ctype))))
8565 /* [basic.link]: A name with no linkage (notably, the name of a class
8566 or enumeration declared in a local scope) shall not be used to
8567 declare an entity with linkage.
8569 Only check this for public decls for now. */
8570 t = no_linkage_check (TREE_TYPE (decl));
8573 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8575 if (DECL_LANGUAGE (decl) == lang_c)
8576 /* Allow this; it's pretty common in C. */;
8578 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8582 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8587 TREE_PUBLIC (decl) = publicp;
8590 DECL_INTERFACE_KNOWN (decl) = 1;
8591 DECL_NOT_REALLY_EXTERN (decl) = 1;
8595 DECL_THIS_INLINE (decl) = DECL_INLINE (decl) = 1;
8597 DECL_EXTERNAL (decl) = 1;
8598 if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8600 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8601 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8605 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8606 grok_op_properties (decl, virtualp, check < 0);
8608 if (ctype && hack_decl_function_context (decl))
8609 DECL_NO_STATIC_CHAIN (decl) = 1;
8611 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8612 if (TREE_PURPOSE (t)
8613 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8615 add_defarg_fn (decl);
8620 && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8624 ("defining explicit specialization `%D' in friend declaration",
8628 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8630 /* Something like `template <class T> friend void f<T>()'. */
8631 cp_error ("template-id `%D' in declaration of primary template",
8636 /* A friend declaration of the form friend void f<>(). Record
8637 the information in the TEMPLATE_ID_EXPR. */
8638 SET_DECL_IMPLICIT_INSTANTIATION (decl);
8639 DECL_TEMPLATE_INFO (decl)
8640 = perm_tree_cons (TREE_OPERAND (orig_declarator, 0),
8641 TREE_OPERAND (orig_declarator, 1),
8646 /* Plain overloading: will not be grok'd by grokclassfn. */
8647 if (! ctype && ! processing_template_decl
8648 && DECL_LANGUAGE (decl) != lang_c
8649 && (! DECL_USE_TEMPLATE (decl) || name_mangling_version < 1))
8650 set_mangled_name_for_decl (decl);
8653 /* Make the init_value nonzero so pushdecl knows this is not
8654 tentative. error_mark_node is replaced later with the BLOCK. */
8655 DECL_INITIAL (decl) = error_mark_node;
8657 /* Caller will do the rest of this. */
8661 if (check && funcdef_flag)
8662 DECL_INITIAL (decl) = error_mark_node;
8664 if (flags == NO_SPECIAL && ctype && constructor_name (cname) == declarator)
8667 /* Just handle constructors here. We could do this
8668 inside the following if stmt, but I think
8669 that the code is more legible by breaking this
8670 case out. See comments below for what each of
8671 the following calls is supposed to do. */
8672 DECL_CONSTRUCTOR_P (decl) = 1;
8674 grokclassfn (ctype, decl, flags, quals);
8676 decl = check_explicit_specialization (orig_declarator, decl,
8678 2 * (funcdef_flag != 0) +
8679 4 * (friendp != 0));
8680 if (decl == error_mark_node)
8683 if ((! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8686 tmp = check_classfn (ctype, decl);
8688 if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL)
8689 tmp = DECL_TEMPLATE_RESULT(tmp);
8691 if (tmp && DECL_ARTIFICIAL (tmp))
8692 cp_error ("definition of implicitly-declared `%D'", tmp);
8693 if (tmp && duplicate_decls (decl, tmp))
8696 if (! grok_ctor_properties (ctype, decl))
8703 /* Function gets the ugly name, field gets the nice one.
8704 This call may change the type of the function (because
8705 of default parameters)! */
8706 if (ctype != NULL_TREE)
8707 grokclassfn (ctype, decl, flags, quals);
8709 decl = check_explicit_specialization (orig_declarator, decl,
8711 2 * (funcdef_flag != 0) +
8712 4 * (friendp != 0));
8713 if (decl == error_mark_node)
8716 if (ctype != NULL_TREE
8717 && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8720 tmp = check_classfn (ctype, decl);
8722 if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL)
8723 tmp = DECL_TEMPLATE_RESULT (tmp);
8725 if (tmp && DECL_STATIC_FUNCTION_P (tmp)
8726 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
8728 /* Remove the `this' parm added by grokclassfn.
8729 XXX Isn't this done in start_function, too? */
8730 revert_static_member_fn (&decl, NULL, NULL);
8731 last_function_parms = TREE_CHAIN (last_function_parms);
8733 if (tmp && DECL_ARTIFICIAL (tmp))
8734 cp_error ("definition of implicitly-declared `%D'", tmp);
8737 /* Attempt to merge the declarations. This can fail, in
8738 the case of some illegal specialization declarations. */
8739 if (!duplicate_decls (decl, tmp))
8740 cp_error ("no `%#D' member function declared in class `%T'",
8746 if (ctype == NULL_TREE || check)
8750 cplus_decl_attributes (decl, TREE_PURPOSE (attrlist),
8751 TREE_VALUE (attrlist));
8752 make_decl_rtl (decl, NULL_PTR, 1);
8756 DECL_VIRTUAL_P (decl) = 1;
8757 if (DECL_VINDEX (decl) == NULL_TREE)
8758 DECL_VINDEX (decl) = error_mark_node;
8759 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
8766 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
8769 RID_BIT_TYPE *specbits_in;
8775 RID_BIT_TYPE specbits;
8777 specbits = *specbits_in;
8779 if (TREE_CODE (type) == OFFSET_TYPE)
8781 /* If you declare a static member so that it
8782 can be initialized, the code will reach here. */
8783 tree basetype = TYPE_OFFSET_BASETYPE (type);
8784 type = TREE_TYPE (type);
8785 decl = build_lang_field_decl (VAR_DECL, declarator, type);
8786 DECL_CONTEXT (decl) = basetype;
8787 DECL_CLASS_CONTEXT (decl) = basetype;
8788 DECL_ASSEMBLER_NAME (decl) = build_static_name (basetype, declarator);
8795 context = in_namespace;
8796 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
8797 context = current_namespace;
8799 context = NULL_TREE;
8801 decl = build_decl (VAR_DECL, declarator, complete_type (type));
8804 set_decl_namespace (decl, context, 0);
8806 context = DECL_CONTEXT (decl);
8807 if (declarator && context && current_lang_name != lang_name_c)
8808 DECL_ASSEMBLER_NAME (decl) = build_static_name (context, declarator);
8812 set_decl_namespace (decl, in_namespace, 0);
8814 if (RIDBIT_SETP (RID_EXTERN, specbits))
8816 DECL_THIS_EXTERN (decl) = 1;
8817 DECL_EXTERNAL (decl) = !initialized;
8820 /* In class context, static means one per class,
8821 public access, and static storage. */
8822 if (DECL_CLASS_SCOPE_P (decl))
8824 TREE_PUBLIC (decl) = 1;
8825 TREE_STATIC (decl) = 1;
8826 DECL_EXTERNAL (decl) = 0;
8828 /* At top level, either `static' or no s.c. makes a definition
8829 (perhaps tentative), and absence of `static' makes it public. */
8830 else if (toplevel_bindings_p ())
8832 TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
8833 && (DECL_THIS_EXTERN (decl) || ! constp));
8834 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
8836 /* Not at top level, only `static' makes a static definition. */
8839 TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
8840 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
8843 if (TREE_PUBLIC (decl))
8845 /* [basic.link]: A name with no linkage (notably, the name of a class
8846 or enumeration declared in a local scope) shall not be used to
8847 declare an entity with linkage.
8849 Only check this for public decls for now. */
8850 tree t = no_linkage_check (TREE_TYPE (decl));
8853 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8854 /* Ignore for now; `enum { foo } e' is pretty common. */;
8856 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8864 /* Create and return a canonical pointer to member function type, for
8865 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8868 build_ptrmemfunc_type (type)
8875 /* If a canonical type already exists for this type, use it. We use
8876 this method instead of type_hash_canon, because it only does a
8877 simple equality check on the list of field members. */
8879 if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
8882 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
8884 u = make_lang_type (UNION_TYPE);
8885 SET_IS_AGGR_TYPE (u, 0);
8886 fields[0] = build_lang_field_decl (FIELD_DECL, pfn_identifier, type);
8887 fields[1] = build_lang_field_decl (FIELD_DECL, delta2_identifier,
8889 finish_builtin_type (u, "__ptrmemfunc_type", fields, 1, ptr_type_node);
8890 TYPE_NAME (u) = NULL_TREE;
8892 t = make_lang_type (RECORD_TYPE);
8894 /* Let the front-end know this is a pointer to member function... */
8895 TYPE_PTRMEMFUNC_FLAG (t) = 1;
8896 /* ... and not really an aggregate. */
8897 SET_IS_AGGR_TYPE (t, 0);
8899 fields[0] = build_lang_field_decl (FIELD_DECL, delta_identifier,
8901 fields[1] = build_lang_field_decl (FIELD_DECL, index_identifier,
8903 fields[2] = build_lang_field_decl (FIELD_DECL, pfn_or_delta2_identifier, u);
8904 finish_builtin_type (t, "__ptrmemfunc_type", fields, 2, ptr_type_node);
8908 /* Zap out the name so that the back-end will give us the debugging
8909 information for this anonymous RECORD_TYPE. */
8910 TYPE_NAME (t) = NULL_TREE;
8912 TYPE_SET_PTRMEMFUNC_TYPE (type, t);
8914 /* Seems to be wanted. */
8915 CLASSTYPE_GOT_SEMICOLON (t) = 1;
8919 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8920 Check to see that the definition is valid. Issue appropriate error
8921 messages. Return 1 if the definition is particularly bad, or 0
8925 check_static_variable_definition (decl, type)
8929 /* Motion 10 at San Diego: If a static const integral data member is
8930 initialized with an integral constant expression, the initializer
8931 may appear either in the declaration (within the class), or in
8932 the definition, but not both. If it appears in the class, the
8933 member is a member constant. The file-scope definition is always
8935 if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
8937 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8939 /* If we just return the declaration, crashes will sometimes
8940 occur. We therefore return void_type_node, as if this was a
8941 friend declaration, to cause callers to completely ignore
8942 this declaration. */
8945 else if (!CP_TYPE_CONST_P (type))
8946 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8948 else if (pedantic && !INTEGRAL_TYPE_P (type))
8949 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
8954 /* Given declspecs and a declarator,
8955 determine the name and type of the object declared
8956 and construct a ..._DECL node for it.
8957 (In one case we can return a ..._TYPE node instead.
8958 For invalid input we sometimes return 0.)
8960 DECLSPECS is a chain of tree_list nodes whose value fields
8961 are the storage classes and type specifiers.
8963 DECL_CONTEXT says which syntactic context this declaration is in:
8964 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8965 FUNCDEF for a function definition. Like NORMAL but a few different
8966 error messages in each case. Return value may be zero meaning
8967 this definition is too screwy to try to parse.
8968 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8969 handle member functions (which have FIELD context).
8970 Return value may be zero meaning this definition is too screwy to
8972 PARM for a parameter declaration (either within a function prototype
8973 or before a function body). Make a PARM_DECL, or return void_type_node.
8974 CATCHPARM for a parameter declaration before a catch clause.
8975 TYPENAME if for a typename (in a cast or sizeof).
8976 Don't make a DECL node; just return the ..._TYPE node.
8977 FIELD for a struct or union field; make a FIELD_DECL.
8978 BITFIELD for a field with specified width.
8979 INITIALIZED is 1 if the decl has an initializer.
8981 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8982 normal attributes in TREE_PURPOSE, or NULL_TREE.
8984 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8985 It may also be so in the PARM case, for a prototype where the
8986 argument type is specified but not the name.
8988 This function is where the complicated C meanings of `static'
8989 and `extern' are interpreted.
8991 For C++, if there is any monkey business to do, the function which
8992 calls this one must do it, i.e., prepending instance variables,
8993 renaming overloaded function names, etc.
8995 Note that for this C++, it is an error to define a method within a class
8996 which does not belong to that class.
8998 Except in the case where SCOPE_REFs are implicitly known (such as
8999 methods within a class being redundantly qualified),
9000 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9001 (class_name::decl_name). The caller must also deal with this.
9003 If a constructor or destructor is seen, and the context is FIELD,
9004 then the type gains the attribute TREE_HAS_x. If such a declaration
9005 is erroneous, NULL_TREE is returned.
9007 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9008 function, these are the qualifiers to give to the `this' pointer.
9010 May return void_type_node if the declarator turned out to be a friend.
9011 See grokfield for details. */
9013 enum return_types { return_normal, return_ctor, return_dtor, return_conversion };
9016 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
9019 enum decl_context decl_context;
9023 RID_BIT_TYPE specbits;
9026 tree type = NULL_TREE;
9032 int virtualp, explicitp, friendp, inlinep, staticp;
9033 int explicit_int = 0;
9034 int explicit_char = 0;
9035 int defaulted_int = 0;
9036 int opaque_typedef = 0;
9037 tree typedef_decl = NULL_TREE;
9039 tree typedef_type = NULL_TREE;
9040 int funcdef_flag = 0;
9041 enum tree_code innermost_code = ERROR_MARK;
9044 /* See the code below that used this. */
9045 tree decl_machine_attr = NULL_TREE;
9047 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9048 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9049 tree init = NULL_TREE;
9051 /* Keep track of what sort of function is being processed
9052 so that we can warn about default return values, or explicit
9053 return values which do not match prescribed defaults. */
9054 enum return_types return_type = return_normal;
9056 tree dname = NULL_TREE;
9057 tree ctype = current_class_type;
9058 tree ctor_return_type = NULL_TREE;
9059 enum overload_flags flags = NO_SPECIAL;
9060 tree quals = NULL_TREE;
9061 tree raises = NULL_TREE;
9062 int template_count = 0;
9063 tree in_namespace = NULL_TREE;
9067 RIDBIT_RESET_ALL (specbits);
9068 if (decl_context == FUNCDEF)
9069 funcdef_flag = 1, decl_context = NORMAL;
9070 else if (decl_context == MEMFUNCDEF)
9071 funcdef_flag = -1, decl_context = FIELD;
9072 else if (decl_context == BITFIELD)
9073 bitfield = 1, decl_context = FIELD;
9075 /* Look inside a declarator for the name being declared
9076 and get it as a string, for an error message. */
9078 tree *next = &declarator;
9082 while (next && *next)
9085 switch (TREE_CODE (decl))
9088 /* For attributes. */
9089 next = &TREE_VALUE (decl);
9094 next = &TREE_OPERAND (decl, 0);
9097 case BIT_NOT_EXPR: /* For C++ destructors! */
9099 tree name = TREE_OPERAND (decl, 0);
9100 tree rename = NULL_TREE;
9102 my_friendly_assert (flags == NO_SPECIAL, 152);
9104 return_type = return_dtor;
9105 if (TREE_CODE (name) == TYPE_DECL)
9106 TREE_OPERAND (decl, 0) = name = constructor_name (name);
9107 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
9108 if (ctype == NULL_TREE)
9110 if (current_class_type == NULL_TREE)
9112 error ("destructors must be member functions");
9117 tree t = constructor_name (current_class_name);
9124 tree t = constructor_name (ctype);
9131 cp_error ("destructor `%T' must match class name `%T'",
9133 TREE_OPERAND (decl, 0) = rename;
9139 case ADDR_EXPR: /* C++ reference declaration */
9144 innermost_code = TREE_CODE (decl);
9145 next = &TREE_OPERAND (decl, 0);
9149 if (parmlist_is_exprlist (TREE_OPERAND (decl, 1)))
9151 /* This is actually a variable declaration using
9152 constructor syntax. We need to call start_decl and
9153 cp_finish_decl so we can get the variable
9156 tree attributes, prefix_attributes;
9158 *next = TREE_OPERAND (decl, 0);
9159 init = TREE_OPERAND (decl, 1);
9163 attributes = TREE_PURPOSE (attrlist);
9164 prefix_attributes = TREE_VALUE (attrlist);
9168 attributes = NULL_TREE;
9169 prefix_attributes = NULL_TREE;
9172 decl = start_decl (declarator, declspecs, 1,
9173 attributes, prefix_attributes);
9176 /* Look for __unused__ attribute */
9177 if (TREE_USED (TREE_TYPE (decl)))
9178 TREE_USED (decl) = 1;
9179 finish_decl (decl, init, NULL_TREE);
9182 cp_error ("invalid declarator");
9185 innermost_code = TREE_CODE (decl);
9186 if (decl_context == FIELD && ctype == NULL_TREE)
9187 ctype = current_class_type;
9189 && TREE_OPERAND (decl, 0)
9190 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9191 && ((DECL_NAME (TREE_OPERAND (decl, 0))
9192 == constructor_name_full (ctype))
9193 || (DECL_NAME (TREE_OPERAND (decl, 0))
9194 == constructor_name (ctype)))))
9195 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9196 next = &TREE_OPERAND (decl, 0);
9198 if (ctype != NULL_TREE
9199 && decl != NULL_TREE && flags != DTOR_FLAG
9200 && decl == constructor_name (ctype))
9202 return_type = return_ctor;
9203 ctor_return_type = ctype;
9208 case TEMPLATE_ID_EXPR:
9210 tree fns = TREE_OPERAND (decl, 0);
9212 if (TREE_CODE (fns) == LOOKUP_EXPR)
9213 fns = TREE_OPERAND (fns, 0);
9216 if (TREE_CODE (dname) == COMPONENT_REF)
9217 dname = TREE_OPERAND (dname, 1);
9218 if (TREE_CODE (dname) != IDENTIFIER_NODE)
9220 my_friendly_assert (is_overloaded_fn (dname),
9222 dname = DECL_NAME (get_first_fn (dname));
9227 case IDENTIFIER_NODE:
9228 if (TREE_CODE (decl) == IDENTIFIER_NODE)
9235 cp_error ("declarator-id missing; using reserved word `%D'",
9237 name = IDENTIFIER_POINTER (dname);
9239 if (! IDENTIFIER_OPNAME_P (dname)
9240 /* GNU/Linux headers use '__op'. Arrgh. */
9241 || (IDENTIFIER_TYPENAME_P (dname) && ! TREE_TYPE (dname)))
9242 name = IDENTIFIER_POINTER (dname);
9245 if (IDENTIFIER_TYPENAME_P (dname))
9247 my_friendly_assert (flags == NO_SPECIAL, 154);
9248 flags = TYPENAME_FLAG;
9249 ctor_return_type = TREE_TYPE (dname);
9250 return_type = return_conversion;
9252 name = operator_name_string (dname);
9259 /* Perform error checking, and decide on a ctype. */
9260 tree cname = TREE_OPERAND (decl, 0);
9261 if (cname == NULL_TREE)
9263 else if (TREE_CODE (cname) == NAMESPACE_DECL)
9266 in_namespace = TREE_OPERAND (decl, 0);
9267 TREE_OPERAND (decl, 0) = NULL_TREE;
9269 else if (! is_aggr_type (cname, 1))
9270 TREE_OPERAND (decl, 0) = NULL_TREE;
9271 /* Must test TREE_OPERAND (decl, 1), in case user gives
9272 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9273 else if (TREE_OPERAND (decl, 1)
9274 && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9276 else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9277 || TREE_CODE (cname) == TEMPLATE_TEMPLATE_PARM)
9279 cp_error ("`%T::%D' is not a valid declarator", cname,
9280 TREE_OPERAND (decl, 1));
9281 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9282 cname, TREE_OPERAND (decl, 1));
9283 return void_type_node;
9285 else if (ctype == NULL_TREE)
9287 else if (TREE_COMPLEXITY (decl) == current_class_depth)
9288 TREE_OPERAND (decl, 0) = ctype;
9291 if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9293 cp_error ("type `%T' is not derived from type `%T'",
9295 TREE_OPERAND (decl, 0) = NULL_TREE;
9301 if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9302 && ((DECL_NAME (TREE_OPERAND (decl, 1))
9303 == constructor_name_full (ctype))
9304 || (DECL_NAME (TREE_OPERAND (decl, 1))
9305 == constructor_name (ctype))))
9306 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9307 next = &TREE_OPERAND (decl, 1);
9311 if (TREE_CODE (decl) == IDENTIFIER_NODE
9312 && constructor_name (ctype) == decl)
9314 return_type = return_ctor;
9315 ctor_return_type = ctype;
9317 else if (TREE_CODE (decl) == BIT_NOT_EXPR
9318 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9319 && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
9320 || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
9322 return_type = return_dtor;
9323 ctor_return_type = ctype;
9325 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9326 next = &TREE_OPERAND (decl, 0);
9337 /* Parse error puts this typespec where
9338 a declarator should go. */
9339 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl));
9340 if (TREE_TYPE (decl) == current_class_type)
9341 cp_error (" perhaps you want `%T' for a constructor",
9342 current_class_name);
9343 dname = DECL_NAME (decl);
9344 name = IDENTIFIER_POINTER (dname);
9346 /* Avoid giving two errors for this. */
9347 IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9349 declspecs = temp_tree_cons (NULL_TREE, integer_type_node,
9356 cp_compiler_error ("`%D' as declarator", decl);
9357 return 0; /* We used to do a 155 abort here. */
9364 /* A function definition's declarator must have the form of
9365 a function declarator. */
9367 if (funcdef_flag && innermost_code != CALL_EXPR)
9370 if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
9371 && innermost_code != CALL_EXPR
9372 && ! (ctype && declspecs == NULL_TREE))
9374 cp_error ("declaration of `%D' as non-function", dname);
9375 return void_type_node;
9378 /* Anything declared one level down from the top level
9379 must be one of the parameters of a function
9380 (because the body is at least two levels down). */
9382 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9383 by not allowing C++ class definitions to specify their parameters
9384 with xdecls (must be spec.d in the parmlist).
9386 Since we now wait to push a class scope until we are sure that
9387 we are in a legitimate method context, we must set oldcname
9388 explicitly (since current_class_name is not yet alive).
9390 We also want to avoid calling this a PARM if it is in a namespace. */
9392 if (decl_context == NORMAL && ! namespace_bindings_p ()
9393 && ! pseudo_global_level_p ())
9395 struct binding_level *b = current_binding_level;
9396 current_binding_level = b->level_chain;
9397 if (current_binding_level != 0 && toplevel_bindings_p ())
9398 decl_context = PARM;
9399 current_binding_level = b;
9402 /* Look through the decl specs and record which ones appear.
9403 Some typespecs are defined as built-in typenames.
9404 Others, the ones that are modifiers of other types,
9405 are represented by bits in SPECBITS: set the bits for
9406 the modifiers that appear. Storage class keywords are also in SPECBITS.
9408 If there is a typedef name or a type, store the type in TYPE.
9409 This includes builtin typedefs such as `int'.
9411 Set EXPLICIT_INT if the type is `int' or `char' and did not
9412 come from a user typedef.
9414 Set LONGLONG if `long' is mentioned twice.
9416 For C++, constructors and destructors have their own fast treatment. */
9418 for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
9423 /* Certain parse errors slip through. For example,
9424 `int class;' is not caught by the parser. Try
9425 weakly to recover here. */
9426 if (TREE_CODE (spec) != TREE_LIST)
9429 id = TREE_VALUE (spec);
9431 if (TREE_CODE (id) == IDENTIFIER_NODE)
9433 if (id == ridpointers[(int) RID_INT]
9434 || id == ridpointers[(int) RID_CHAR]
9435 || id == ridpointers[(int) RID_BOOL]
9436 || id == ridpointers[(int) RID_WCHAR])
9440 if (id == ridpointers[(int) RID_BOOL])
9441 error ("`bool' is now a keyword");
9443 cp_error ("extraneous `%T' ignored", id);
9447 if (id == ridpointers[(int) RID_INT])
9449 else if (id == ridpointers[(int) RID_CHAR])
9451 type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
9455 /* C++ aggregate types. */
9456 if (IDENTIFIER_HAS_TYPE_VALUE (id))
9459 cp_error ("multiple declarations `%T' and `%T'", type, id);
9461 type = IDENTIFIER_TYPE_VALUE (id);
9465 for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
9467 if (ridpointers[i] == id)
9469 if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
9471 if (pedantic && ! in_system_header && warn_long_long)
9472 pedwarn ("ANSI C++ does not support `long long'");
9474 error ("`long long long' is too long for GCC");
9478 else if (RIDBIT_SETP (i, specbits))
9479 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
9480 RIDBIT_SET (i, specbits);
9485 /* C++ aggregate types. */
9486 else if (TREE_CODE (id) == TYPE_DECL || TREE_CODE (id) == TEMPLATE_DECL)
9489 cp_error ("multiple declarations `%T' and `%T'", type,
9493 type = TREE_TYPE (id);
9494 TREE_VALUE (spec) = type;
9499 error ("two or more data types in declaration of `%s'", name);
9500 else if (TREE_CODE (id) == IDENTIFIER_NODE)
9502 register tree t = lookup_name (id, 1);
9503 if (!t || TREE_CODE (t) != TYPE_DECL)
9504 error ("`%s' fails to be a typedef or built in type",
9505 IDENTIFIER_POINTER (id));
9508 type = TREE_TYPE (t);
9510 /* See the code below that used this. */
9511 decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id);
9516 else if (id != error_mark_node)
9517 /* Can't change CLASS nodes into RECORD nodes here! */
9523 typedef_type = type;
9525 /* No type at all: default to `int', and set DEFAULTED_INT
9526 because it was not a user-defined typedef.
9527 Except when we have a `typedef' inside a signature, in
9528 which case the type defaults to `unknown type' and is
9529 instantiated when assigning to a signature pointer or ref. */
9531 if (type == NULL_TREE
9532 && (RIDBIT_SETP (RID_SIGNED, specbits)
9533 || RIDBIT_SETP (RID_UNSIGNED, specbits)
9534 || RIDBIT_SETP (RID_LONG, specbits)
9535 || RIDBIT_SETP (RID_SHORT, specbits)))
9537 /* These imply 'int'. */
9538 type = integer_type_node;
9542 if (type == NULL_TREE)
9545 if (return_type == return_dtor)
9546 type = void_type_node;
9547 else if (return_type == return_ctor)
9548 type = build_pointer_type (ctor_return_type);
9549 else if (return_type == return_conversion)
9550 type = ctor_return_type;
9551 else if (current_class_type
9552 && IS_SIGNATURE (current_class_type)
9553 && RIDBIT_SETP (RID_TYPEDEF, specbits)
9554 && (decl_context == FIELD || decl_context == NORMAL))
9558 type = copy_node (opaque_type_node);
9562 /* We handle `main' specially here, because 'main () { }' is so
9563 common. With no options, it is allowed. With -Wreturn-type,
9564 it is a warning. It is only an error with -pedantic-errors. */
9565 int is_main = (funcdef_flag
9566 && MAIN_NAME_P (dname)
9567 && ctype == NULL_TREE
9568 && in_namespace == NULL_TREE
9569 && current_namespace == global_namespace);
9571 if (in_system_header)
9572 /* Allow it, sigh. */;
9573 else if (pedantic || ! is_main)
9574 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9576 else if (warn_return_type)
9577 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9580 type = integer_type_node;
9583 else if (return_type == return_dtor)
9585 error ("return type specification for destructor invalid");
9586 type = void_type_node;
9588 else if (return_type == return_ctor)
9590 error ("return type specification for constructor invalid");
9591 type = build_pointer_type (ctor_return_type);
9593 else if (return_type == return_conversion)
9595 if (!same_type_p (type, ctor_return_type))
9596 cp_error ("operator `%T' declared to return `%T'",
9597 ctor_return_type, type);
9599 cp_pedwarn ("return type specified for `operator %T'",
9602 type = ctor_return_type;
9607 /* Now process the modifiers that were specified
9608 and check for invalid combinations. */
9610 /* Long double is a special combination. */
9612 if (RIDBIT_SETP (RID_LONG, specbits)
9613 && TYPE_MAIN_VARIANT (type) == double_type_node)
9615 RIDBIT_RESET (RID_LONG, specbits);
9616 type = build_qualified_type (long_double_type_node,
9617 CP_TYPE_QUALS (type));
9620 /* Check all other uses of type modifiers. */
9622 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9623 || RIDBIT_SETP (RID_SIGNED, specbits)
9624 || RIDBIT_SETP (RID_LONG, specbits)
9625 || RIDBIT_SETP (RID_SHORT, specbits))
9629 if (TREE_CODE (type) == REAL_TYPE)
9630 error ("short, signed or unsigned invalid for `%s'", name);
9631 else if (TREE_CODE (type) != INTEGER_TYPE)
9632 error ("long, short, signed or unsigned invalid for `%s'", name);
9633 else if (RIDBIT_SETP (RID_LONG, specbits)
9634 && RIDBIT_SETP (RID_SHORT, specbits))
9635 error ("long and short specified together for `%s'", name);
9636 else if ((RIDBIT_SETP (RID_LONG, specbits)
9637 || RIDBIT_SETP (RID_SHORT, specbits))
9639 error ("long or short specified with char for `%s'", name);
9640 else if ((RIDBIT_SETP (RID_LONG, specbits)
9641 || RIDBIT_SETP (RID_SHORT, specbits))
9642 && TREE_CODE (type) == REAL_TYPE)
9643 error ("long or short specified with floating type for `%s'", name);
9644 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9645 && RIDBIT_SETP (RID_UNSIGNED, specbits))
9646 error ("signed and unsigned given together for `%s'", name);
9650 if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
9652 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9654 if (flag_pedantic_errors)
9659 /* Discard the type modifiers if they are invalid. */
9662 RIDBIT_RESET (RID_UNSIGNED, specbits);
9663 RIDBIT_RESET (RID_SIGNED, specbits);
9664 RIDBIT_RESET (RID_LONG, specbits);
9665 RIDBIT_RESET (RID_SHORT, specbits);
9670 if (RIDBIT_SETP (RID_COMPLEX, specbits)
9671 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
9673 error ("complex invalid for `%s'", name);
9674 RIDBIT_RESET (RID_COMPLEX, specbits);
9677 /* Decide whether an integer type is signed or not.
9678 Optionally treat bitfields as signed by default. */
9679 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9680 || (bitfield && ! flag_signed_bitfields
9681 && (explicit_int || defaulted_int || explicit_char
9682 /* A typedef for plain `int' without `signed'
9683 can be controlled just like plain `int'. */
9684 || ! (typedef_decl != NULL_TREE
9685 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
9686 && TREE_CODE (type) != ENUMERAL_TYPE
9687 && RIDBIT_NOTSETP (RID_SIGNED, specbits)))
9690 type = long_long_unsigned_type_node;
9691 else if (RIDBIT_SETP (RID_LONG, specbits))
9692 type = long_unsigned_type_node;
9693 else if (RIDBIT_SETP (RID_SHORT, specbits))
9694 type = short_unsigned_type_node;
9695 else if (type == char_type_node)
9696 type = unsigned_char_type_node;
9697 else if (typedef_decl)
9698 type = unsigned_type (type);
9700 type = unsigned_type_node;
9702 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9703 && type == char_type_node)
9704 type = signed_char_type_node;
9706 type = long_long_integer_type_node;
9707 else if (RIDBIT_SETP (RID_LONG, specbits))
9708 type = long_integer_type_node;
9709 else if (RIDBIT_SETP (RID_SHORT, specbits))
9710 type = short_integer_type_node;
9712 if (RIDBIT_SETP (RID_COMPLEX, specbits))
9714 /* If we just have "complex", it is equivalent to
9715 "complex double", but if any modifiers at all are specified it is
9716 the complex form of TYPE. E.g, "complex short" is
9717 "complex short int". */
9719 if (defaulted_int && ! longlong
9720 && ! (RIDBIT_SETP (RID_LONG, specbits)
9721 || RIDBIT_SETP (RID_SHORT, specbits)
9722 || RIDBIT_SETP (RID_SIGNED, specbits)
9723 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
9724 type = complex_double_type_node;
9725 else if (type == integer_type_node)
9726 type = complex_integer_type_node;
9727 else if (type == float_type_node)
9728 type = complex_float_type_node;
9729 else if (type == double_type_node)
9730 type = complex_double_type_node;
9731 else if (type == long_double_type_node)
9732 type = complex_long_double_type_node;
9734 type = build_complex_type (type);
9737 if (return_type == return_conversion
9738 && (RIDBIT_SETP (RID_CONST, specbits)
9739 || RIDBIT_SETP (RID_VOLATILE, specbits)
9740 || RIDBIT_SETP (RID_RESTRICT, specbits)))
9741 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9744 /* Set CONSTP if this declaration is `const', whether by
9745 explicit specification or via a typedef.
9746 Likewise for VOLATILEP. */
9748 constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type);
9750 !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type);
9752 !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type);
9753 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
9754 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
9755 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
9756 type = cp_build_qualified_type (type, type_quals);
9758 inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
9759 virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
9760 RIDBIT_RESET (RID_VIRTUAL, specbits);
9761 explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
9762 RIDBIT_RESET (RID_EXPLICIT, specbits);
9764 if (RIDBIT_SETP (RID_STATIC, specbits))
9765 staticp = 1 + (decl_context == FIELD);
9767 if (virtualp && staticp == 2)
9769 cp_error ("member `%D' cannot be declared both virtual and static",
9773 friendp = RIDBIT_SETP (RID_FRIEND, specbits);
9774 RIDBIT_RESET (RID_FRIEND, specbits);
9776 /* $7.1.2, Function specifiers */
9777 if (friendp && explicitp)
9778 error ("only declarations of constructors can be `explicit'");
9780 if (RIDBIT_SETP (RID_MUTABLE, specbits))
9782 if (decl_context == PARM)
9784 error ("non-member `%s' cannot be declared `mutable'", name);
9785 RIDBIT_RESET (RID_MUTABLE, specbits);
9787 else if (friendp || decl_context == TYPENAME)
9789 error ("non-object member `%s' cannot be declared `mutable'", name);
9790 RIDBIT_RESET (RID_MUTABLE, specbits);
9794 /* Warn if two storage classes are given. Default to `auto'. */
9796 if (RIDBIT_ANY_SET (specbits))
9798 if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
9799 if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++;
9800 if (decl_context == PARM && nclasses > 0)
9801 error ("storage class specifiers invalid in parameter declarations");
9802 if (RIDBIT_SETP (RID_TYPEDEF, specbits))
9804 if (decl_context == PARM)
9805 error ("typedef declaration invalid in parameter declaration");
9808 if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
9809 if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
9812 /* Give error if `virtual' is used outside of class declaration. */
9814 && (current_class_name == NULL_TREE || decl_context != FIELD))
9816 error ("virtual outside class declaration");
9819 if (current_class_name == NULL_TREE && RIDBIT_SETP (RID_MUTABLE, specbits))
9821 error ("only members can be declared mutable");
9822 RIDBIT_RESET (RID_MUTABLE, specbits);
9825 /* Static anonymous unions are dealt with here. */
9826 if (staticp && decl_context == TYPENAME
9827 && TREE_CODE (declspecs) == TREE_LIST
9828 && ANON_UNION_TYPE_P (TREE_VALUE (declspecs)))
9829 decl_context = FIELD;
9831 /* Give error if `const,' `volatile,' `inline,' `friend,' or `virtual'
9832 is used in a signature member function declaration. */
9833 if (decl_context == FIELD
9834 && IS_SIGNATURE (current_class_type)
9835 && RIDBIT_NOTSETP (RID_TYPEDEF, specbits))
9837 if (type_quals != TYPE_UNQUALIFIED)
9839 error ("type qualifiers specified for signature member function `%s'", name);
9840 type_quals = TYPE_UNQUALIFIED;
9844 error ("`inline' specified for signature member function `%s'", name);
9845 /* Later, we'll make signature member functions inline. */
9850 error ("`friend' declaration in signature definition");
9855 error ("`virtual' specified for signature member function `%s'",
9857 /* Later, we'll make signature member functions virtual. */
9862 /* Warn about storage classes that are invalid for certain
9863 kinds of declarations (parameters, typenames, etc.). */
9866 error ("multiple storage classes in declaration of `%s'", name);
9867 else if (decl_context != NORMAL && nclasses > 0)
9869 if ((decl_context == PARM || decl_context == CATCHPARM)
9870 && (RIDBIT_SETP (RID_REGISTER, specbits)
9871 || RIDBIT_SETP (RID_AUTO, specbits)))
9873 else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
9875 else if (decl_context == FIELD
9876 && ! IS_SIGNATURE (current_class_type)
9877 /* C++ allows static class elements */
9878 && RIDBIT_SETP (RID_STATIC, specbits))
9879 /* C++ also allows inlines and signed and unsigned elements,
9880 but in those cases we don't come in here. */
9884 if (decl_context == FIELD)
9886 tree tmp = NULL_TREE;
9887 register int op = 0;
9891 /* Avoid trying to get an operand off an identifier node. */
9892 if (TREE_CODE (declarator) == IDENTIFIER_NODE)
9895 tmp = TREE_OPERAND (declarator, 0);
9896 op = IDENTIFIER_OPNAME_P (tmp);
9898 error ("storage class specified for %s `%s'",
9899 IS_SIGNATURE (current_class_type)
9901 ? "signature member operator"
9902 : "signature member function")
9903 : (op ? "member operator" : "field"),
9904 op ? operator_name_string (tmp) : name);
9907 error (((decl_context == PARM || decl_context == CATCHPARM)
9908 ? "storage class specified for parameter `%s'"
9909 : "storage class specified for typename"), name);
9910 RIDBIT_RESET (RID_REGISTER, specbits);
9911 RIDBIT_RESET (RID_AUTO, specbits);
9912 RIDBIT_RESET (RID_EXTERN, specbits);
9914 if (decl_context == FIELD && IS_SIGNATURE (current_class_type))
9916 RIDBIT_RESET (RID_STATIC, specbits);
9921 else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
9923 if (toplevel_bindings_p ())
9925 /* It's common practice (and completely valid) to have a const
9926 be initialized and declared extern. */
9927 if (!(type_quals & TYPE_QUAL_CONST))
9928 warning ("`%s' initialized and declared `extern'", name);
9931 error ("`%s' has both `extern' and initializer", name);
9933 else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
9934 && ! toplevel_bindings_p ())
9935 error ("nested function `%s' declared `extern'", name);
9936 else if (toplevel_bindings_p ())
9938 if (RIDBIT_SETP (RID_AUTO, specbits))
9939 error ("top-level declaration of `%s' specifies `auto'", name);
9942 if (nclasses > 0 && friendp)
9943 error ("storage class specifiers invalid in friend function declarations");
9945 /* Now figure out the structure of the declarator proper.
9946 Descend through it, creating more complex types, until we reach
9947 the declared identifier (or NULL_TREE, in an absolute declarator). */
9949 inner_attrs = NULL_TREE;
9952 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
9953 && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
9955 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9956 an INDIRECT_REF (for *...),
9957 a CALL_EXPR (for ...(...)),
9958 an identifier (for the name being declared)
9959 or a null pointer (for the place in an absolute declarator
9960 where the name was omitted).
9961 For the last two cases, we have just exited the loop.
9963 For C++ it could also be
9964 a SCOPE_REF (for class :: ...). In this case, we have converted
9965 sensible names to types, and those are the values we use to
9966 qualify the member name.
9967 an ADDR_EXPR (for &...),
9968 a BIT_NOT_EXPR (for destructors)
9970 At this point, TYPE is the type of elements of an array,
9971 or for a function to return, or for a pointer to point to.
9972 After this sequence of ifs, TYPE is the type of the
9973 array or function or pointer, and DECLARATOR has had its
9974 outermost layer removed. */
9976 if (type == error_mark_node)
9978 if (TREE_CODE (declarator) == SCOPE_REF)
9979 declarator = TREE_OPERAND (declarator, 1);
9981 declarator = TREE_OPERAND (declarator, 0);
9984 if (quals != NULL_TREE
9985 && (declarator == NULL_TREE
9986 || TREE_CODE (declarator) != SCOPE_REF))
9988 if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
9989 ctype = TYPE_METHOD_BASETYPE (type);
9990 if (ctype != NULL_TREE)
9992 tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
9993 ctype = grok_method_quals (ctype, dummy, quals);
9994 type = TREE_TYPE (dummy);
9999 /* See the comment for the TREE_LIST case, below. */
10002 else if (inner_attrs)
10004 decl_attributes (type, inner_attrs, NULL_TREE);
10005 inner_attrs = NULL_TREE;
10008 switch (TREE_CODE (declarator))
10012 /* We encode a declarator with embedded attributes using
10013 a TREE_LIST. The attributes apply to the declarator
10014 directly inside them, so we have to skip an iteration
10015 before applying them to the type. If the declarator just
10016 inside is the declarator-id, we apply the attrs to the
10018 inner_attrs = TREE_PURPOSE (declarator);
10020 declarator = TREE_VALUE (declarator);
10026 register tree itype = NULL_TREE;
10027 register tree size = TREE_OPERAND (declarator, 1);
10028 /* The index is a signed object `sizetype' bits wide. */
10029 tree index_type = signed_type (sizetype);
10031 declarator = TREE_OPERAND (declarator, 0);
10033 /* Check for some types that there cannot be arrays of. */
10035 if (TREE_CODE (type) == VOID_TYPE)
10037 cp_error ("declaration of `%D' as array of voids", dname);
10038 type = error_mark_node;
10041 if (TREE_CODE (type) == FUNCTION_TYPE)
10043 cp_error ("declaration of `%D' as array of functions", dname);
10044 type = error_mark_node;
10047 /* ARM $8.4.3: Since you can't have a pointer to a reference,
10048 you can't have arrays of references. If we allowed them,
10049 then we'd be saying x[i] is valid for an array x, but
10050 then you'd have to ask: what does `*(x + i)' mean? */
10051 if (TREE_CODE (type) == REFERENCE_TYPE)
10053 if (decl_context == TYPENAME)
10054 cp_error ("cannot make arrays of references");
10056 cp_error ("declaration of `%D' as array of references",
10058 type = error_mark_node;
10061 if (TREE_CODE (type) == OFFSET_TYPE)
10063 cp_error ("declaration of `%D' as array of data members",
10065 type = error_mark_node;
10068 if (TREE_CODE (type) == METHOD_TYPE)
10070 cp_error ("declaration of `%D' as array of function members",
10072 type = error_mark_node;
10075 if (size == error_mark_node)
10076 type = error_mark_node;
10077 else if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
10081 the constant expressions that specify the bounds of
10082 the arrays can be omitted only for the first member
10083 of the sequence. */
10084 cp_error ("declaration of `%D' as multidimensional array",
10086 cp_error ("must have bounds for all dimensions except the first");
10087 type = error_mark_node;
10090 if (type == error_mark_node)
10093 /* VC++ spells a zero-sized array with []. */
10094 if (size == NULL_TREE && decl_context == FIELD && ! staticp)
10095 size = integer_zero_node;
10099 /* Must suspend_momentary here because the index
10100 type may need to live until the end of the function.
10101 For example, it is used in the declaration of a
10102 variable which requires destructing at the end of
10103 the function; then build_vec_delete will need this
10105 int yes = suspend_momentary ();
10106 /* Might be a cast. */
10107 if (TREE_CODE (size) == NOP_EXPR
10108 && TREE_TYPE (size) == TREE_TYPE (TREE_OPERAND (size, 0)))
10109 size = TREE_OPERAND (size, 0);
10111 /* If this involves a template parameter, it will be a
10112 constant at instantiation time, but we don't know
10113 what the value is yet. Even if no template
10114 parameters are involved, we may an expression that
10115 is not a constant; we don't even simplify `1 + 2'
10116 when processing a template. */
10117 if (processing_template_decl)
10119 /* Resolve a qualified reference to an enumerator or
10120 static const data member of ours. */
10121 if (TREE_CODE (size) == SCOPE_REF
10122 && TREE_OPERAND (size, 0) == current_class_type)
10124 tree t = lookup_field (current_class_type,
10125 TREE_OPERAND (size, 1), 0, 0);
10130 itype = make_node (INTEGER_TYPE);
10131 TYPE_MIN_VALUE (itype) = size_zero_node;
10132 TYPE_MAX_VALUE (itype) = build_min
10133 (MINUS_EXPR, sizetype, size, integer_one_node);
10134 goto dont_grok_size;
10137 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
10138 && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
10139 && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
10141 cp_error ("size of array `%D' has non-integer type",
10143 size = integer_one_node;
10145 if (TREE_READONLY_DECL_P (size))
10146 size = decl_constant_value (size);
10147 if (pedantic && integer_zerop (size))
10148 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname);
10149 if (TREE_CONSTANT (size))
10151 int old_flag_pedantic_errors = flag_pedantic_errors;
10152 int old_pedantic = pedantic;
10153 pedantic = flag_pedantic_errors = 1;
10154 /* Always give overflow errors on array subscripts. */
10155 constant_expression_warning (size);
10156 pedantic = old_pedantic;
10157 flag_pedantic_errors = old_flag_pedantic_errors;
10158 if (INT_CST_LT (size, integer_zero_node))
10160 cp_error ("size of array `%D' is negative", dname);
10161 size = integer_one_node;
10169 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
10172 cp_pedwarn ("ANSI C++ forbids variable-size array");
10177 = fold (build_binary_op (MINUS_EXPR,
10178 cp_convert (index_type, size),
10179 cp_convert (index_type,
10180 integer_one_node), 1));
10181 if (! TREE_CONSTANT (itype))
10182 itype = variable_size (itype);
10183 else if (TREE_OVERFLOW (itype))
10185 error ("overflow in array dimension");
10186 TREE_OVERFLOW (itype) = 0;
10189 /* If we're a parm, we need to have a permanent type so
10190 mangling checks for re-use will work right. If both the
10191 element and index types are permanent, the array type
10193 if (decl_context == PARM
10194 && allocation_temporary_p () && TREE_PERMANENT (type))
10196 push_obstacks (&permanent_obstack, &permanent_obstack);
10197 itype = build_index_type (itype);
10201 itype = build_index_type (itype);
10204 resume_momentary (yes);
10207 type = build_cplus_array_type (type, itype);
10216 tree inner_parms = TREE_OPERAND (declarator, 1);
10217 tree inner_decl = TREE_OPERAND (declarator, 0);
10219 /* Declaring a function type.
10220 Make sure we have a valid type for the function to return. */
10222 /* We now know that the TYPE_QUALS don't apply to the
10223 decl, but to its return type. */
10224 type_quals = TYPE_UNQUALIFIED;
10226 /* Warn about some types functions can't return. */
10228 if (TREE_CODE (type) == FUNCTION_TYPE)
10230 error ("`%s' declared as function returning a function", name);
10231 type = integer_type_node;
10233 if (TREE_CODE (type) == ARRAY_TYPE)
10235 error ("`%s' declared as function returning an array", name);
10236 type = integer_type_node;
10239 if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
10240 inner_decl = TREE_OPERAND (inner_decl, 1);
10242 if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10243 inner_decl = dname;
10245 /* Pick up type qualifiers which should be applied to `this'. */
10246 quals = TREE_OPERAND (declarator, 2);
10248 /* Pick up the exception specifications. */
10249 raises = TREE_TYPE (declarator);
10251 /* Say it's a definition only for the CALL_EXPR
10252 closest to the identifier. */
10255 && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10256 || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10257 || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10259 if (ctype == NULL_TREE
10260 && decl_context == FIELD
10262 && (friendp == 0 || dname == current_class_name))
10263 ctype = current_class_type;
10265 if (ctype && return_type == return_conversion)
10266 TYPE_HAS_CONVERSION (ctype) = 1;
10267 if (ctype && constructor_name (ctype) == dname)
10269 /* We are within a class's scope. If our declarator name
10270 is the same as the class name, and we are defining
10271 a function, then it is a constructor/destructor, and
10272 therefore returns a void type. */
10274 if (flags == DTOR_FLAG)
10276 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10277 not be declared const or volatile. A destructor
10278 may not be static. */
10280 error ("destructor cannot be static member function");
10283 cp_error ("destructors may not be `%s'",
10284 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10287 if (decl_context == FIELD)
10289 if (! member_function_or_else (ctype, current_class_type,
10290 "destructor for alien class `%s' cannot be a member"))
10291 return void_type_node;
10294 else /* It's a constructor. */
10296 if (explicitp == 1)
10298 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10299 not be declared const or volatile. A constructor may
10300 not be virtual. A constructor may not be static. */
10302 error ("constructor cannot be static member function");
10305 pedwarn ("constructors cannot be declared virtual");
10310 cp_error ("constructors may not be `%s'",
10311 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10315 RID_BIT_TYPE tmp_bits;
10316 bcopy ((void*)&specbits, (void*)&tmp_bits, sizeof (RID_BIT_TYPE));
10317 RIDBIT_RESET (RID_INLINE, tmp_bits);
10318 RIDBIT_RESET (RID_STATIC, tmp_bits);
10319 if (RIDBIT_ANY_SET (tmp_bits))
10320 error ("return value type specifier for constructor ignored");
10322 type = build_pointer_type (ctype);
10323 if (decl_context == FIELD
10324 && IS_SIGNATURE (current_class_type))
10326 error ("constructor not allowed in signature");
10327 return void_type_node;
10329 else if (decl_context == FIELD)
10331 if (! member_function_or_else (ctype, current_class_type,
10332 "constructor for alien class `%s' cannot be member"))
10333 return void_type_node;
10334 TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10335 if (return_type != return_ctor)
10339 if (decl_context == FIELD)
10345 error ("can't initialize friend function `%s'", name);
10348 /* Cannot be both friend and virtual. */
10349 error ("virtual functions cannot be friends");
10350 RIDBIT_RESET (RID_FRIEND, specbits);
10353 if (decl_context == NORMAL)
10354 error ("friend declaration not in class definition");
10355 if (current_function_decl && funcdef_flag)
10356 cp_error ("can't define friend function `%s' in a local class definition",
10360 /* Construct the function type and go to the next
10361 inner layer of declarator. */
10363 declarator = TREE_OPERAND (declarator, 0);
10365 /* FIXME: This is where default args should be fully
10368 arg_types = grokparms (inner_parms, funcdecl_p ? funcdef_flag : 0);
10370 if (declarator && flags == DTOR_FLAG)
10372 /* A destructor declared in the body of a class will
10373 be represented as a BIT_NOT_EXPR. But, we just
10374 want the underlying IDENTIFIER. */
10375 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10376 declarator = TREE_OPERAND (declarator, 0);
10378 if (strict_prototype == 0 && arg_types == NULL_TREE)
10379 arg_types = void_list_node;
10380 else if (arg_types == NULL_TREE
10381 || arg_types != void_list_node)
10383 cp_error ("destructors may not have parameters");
10384 arg_types = void_list_node;
10385 last_function_parms = NULL_TREE;
10389 /* ANSI says that `const int foo ();'
10390 does not make the function foo const. */
10391 type = build_function_type (type, arg_types);
10395 for (t = arg_types; t; t = TREE_CHAIN (t))
10396 if (TREE_PURPOSE (t)
10397 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10399 add_defarg_fn (type);
10408 /* Filter out pointers-to-references and references-to-references.
10409 We can get these if a TYPE_DECL is used. */
10411 if (TREE_CODE (type) == REFERENCE_TYPE)
10413 error ("cannot declare %s to references",
10414 TREE_CODE (declarator) == ADDR_EXPR
10415 ? "references" : "pointers");
10416 declarator = TREE_OPERAND (declarator, 0);
10420 if (TREE_CODE (type) == OFFSET_TYPE
10421 && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10422 || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10424 cp_error ("cannot declare pointer to `%#T' member",
10426 type = TREE_TYPE (type);
10429 /* Merge any constancy or volatility into the target type
10430 for the pointer. */
10432 /* We now know that the TYPE_QUALS don't apply to the decl,
10433 but to the target of the pointer. */
10434 type_quals = TYPE_UNQUALIFIED;
10436 if (IS_SIGNATURE (type))
10438 if (TREE_CODE (declarator) == ADDR_EXPR)
10440 if (CLASSTYPE_METHOD_VEC (type) == NULL_TREE
10441 && TYPE_SIZE (type))
10442 cp_warning ("empty signature `%T' used in signature reference declaration",
10445 type = build_signature_reference_type (type);
10447 sorry ("signature reference");
10453 if (CLASSTYPE_METHOD_VEC (type) == NULL_TREE
10454 && TYPE_SIZE (type))
10455 cp_warning ("empty signature `%T' used in signature pointer declaration",
10457 type = build_signature_pointer_type (type);
10460 else if (TREE_CODE (declarator) == ADDR_EXPR)
10462 if (TREE_CODE (type) == VOID_TYPE)
10463 error ("invalid type: `void &'");
10465 type = build_reference_type (type);
10467 else if (TREE_CODE (type) == METHOD_TYPE)
10468 type = build_ptrmemfunc_type (build_pointer_type (type));
10470 type = build_pointer_type (type);
10472 /* Process a list of type modifier keywords (such as
10473 const or volatile) that were given inside the `*' or `&'. */
10475 if (TREE_TYPE (declarator))
10477 register tree typemodlist;
10483 for (typemodlist = TREE_TYPE (declarator); typemodlist;
10484 typemodlist = TREE_CHAIN (typemodlist))
10486 tree qualifier = TREE_VALUE (typemodlist);
10488 if (qualifier == ridpointers[(int) RID_CONST])
10490 else if (qualifier == ridpointers[(int) RID_VOLATILE])
10492 else if (qualifier == ridpointers[(int) RID_RESTRICT])
10497 error ("invalid type modifier within pointer declarator");
10501 pedwarn ("duplicate `const'");
10503 pedwarn ("duplicate `volatile'");
10505 pedwarn ("duplicate `restrict'");
10507 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10508 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10509 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10510 if (TREE_CODE (declarator) == ADDR_EXPR
10511 && (constp || volatilep))
10514 pedwarn ("discarding `const' applied to a reference");
10516 pedwarn ("discarding `volatile' applied to a reference");
10517 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
10519 type = cp_build_qualified_type (type, type_quals);
10521 declarator = TREE_OPERAND (declarator, 0);
10527 /* We have converted type names to NULL_TREE if the
10528 name was bogus, or to a _TYPE node, if not.
10530 The variable CTYPE holds the type we will ultimately
10531 resolve to. The code here just needs to build
10532 up appropriate member types. */
10533 tree sname = TREE_OPERAND (declarator, 1);
10536 /* Destructors can have their visibilities changed as well. */
10537 if (TREE_CODE (sname) == BIT_NOT_EXPR)
10538 sname = TREE_OPERAND (sname, 0);
10540 if (TREE_COMPLEXITY (declarator) == 0)
10541 /* This needs to be here, in case we are called
10542 multiple times. */ ;
10543 else if (TREE_COMPLEXITY (declarator) == -1)
10544 /* Namespace member. */
10545 pop_decl_namespace ();
10546 else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
10547 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10548 else if (! IS_AGGR_TYPE_CODE
10549 (TREE_CODE (TREE_OPERAND (declarator, 0))))
10551 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
10553 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10554 that refer to ctype. They couldn't be resolved earlier
10555 because we hadn't pushed into the class yet.
10556 Example: resolve 'B<T>::type' in
10557 'B<typename B<T>::type> B<T>::f () { }'. */
10558 if (current_template_parms
10559 && uses_template_parms (type)
10560 && uses_template_parms (current_class_type))
10562 tree args = current_template_args ();
10563 type = tsubst (type, args, /*complain=*/1, NULL_TREE);
10566 /* This pop_nested_class corresponds to the
10567 push_nested_class used to push into class scope for
10568 parsing the argument list of a function decl, in
10570 pop_nested_class (1);
10571 TREE_COMPLEXITY (declarator) = current_class_depth;
10574 my_friendly_abort (16);
10576 if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10578 /* We had a reference to a global decl, or
10579 perhaps we were given a non-aggregate typedef,
10580 in which case we cleared this out, and should just
10581 keep going as though it wasn't there. */
10582 declarator = sname;
10585 ctype = TREE_OPERAND (declarator, 0);
10588 while (t != NULL_TREE && CLASS_TYPE_P (t))
10590 if (CLASSTYPE_TEMPLATE_INFO (t) &&
10591 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10592 template_count += 1;
10593 t = TYPE_MAIN_DECL (t);
10594 if (DECL_LANG_SPECIFIC (t))
10595 t = DECL_CLASS_CONTEXT (t);
10600 if (sname == NULL_TREE)
10603 if (TREE_CODE (sname) == IDENTIFIER_NODE)
10605 /* This is the `standard' use of the scoping operator:
10606 basetype :: member . */
10608 if (ctype == current_class_type)
10614 Is this ill-formed? */
10617 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10620 else if (TREE_CODE (type) == FUNCTION_TYPE)
10622 if (current_class_type == NULL_TREE
10624 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10625 TYPE_ARG_TYPES (type));
10628 cp_error ("cannot declare member function `%T::%s' within `%T'",
10629 ctype, name, current_class_type);
10630 return void_type_node;
10633 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
10634 || TYPE_SIZE (complete_type (ctype)) != NULL_TREE)
10636 /* Have to move this code elsewhere in this function.
10637 this code is used for i.e., typedef int A::M; M *pm;
10639 It is? How? jason 10/2/94 */
10641 if (current_class_type)
10643 cp_error ("cannot declare member `%T::%s' within `%T'",
10644 ctype, name, current_class_type);
10645 return void_type_node;
10647 type = build_offset_type (ctype, type);
10649 else if (uses_template_parms (ctype))
10651 if (TREE_CODE (type) == FUNCTION_TYPE)
10653 = build_cplus_method_type (ctype, TREE_TYPE (type),
10654 TYPE_ARG_TYPES (type));
10658 cp_error ("structure `%T' not yet defined", ctype);
10659 return error_mark_node;
10662 declarator = sname;
10664 else if (TREE_CODE (sname) == SCOPE_REF)
10665 my_friendly_abort (17);
10669 declarator = TREE_OPERAND (declarator, 1);
10670 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
10671 /* In this case, we will deal with it later. */
10675 if (TREE_CODE (type) == FUNCTION_TYPE)
10676 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10677 TYPE_ARG_TYPES (type));
10679 type = build_offset_type (ctype, type);
10686 declarator = TREE_OPERAND (declarator, 0);
10691 case ENUMERAL_TYPE:
10692 declarator = NULL_TREE;
10696 declarator = NULL_TREE;
10700 my_friendly_abort (158);
10704 /* See the comment for the TREE_LIST case, above. */
10707 if (! ignore_attrs)
10708 decl_attributes (type, inner_attrs, NULL_TREE);
10710 TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist));
10712 attrlist = build_decl_list (NULL_TREE, inner_attrs);
10715 if (explicitp == 1)
10717 error ("only constructors can be declared `explicit'");
10721 /* Now TYPE has the actual type. */
10723 /* If this is declaring a typedef name, return a TYPE_DECL. */
10725 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10727 if (type_quals & TYPE_QUAL_CONST)
10729 error ("const `%s' cannot be declared `mutable'", name);
10730 RIDBIT_RESET (RID_MUTABLE, specbits);
10734 error ("static `%s' cannot be declared `mutable'", name);
10735 RIDBIT_RESET (RID_MUTABLE, specbits);
10739 if (declarator == NULL_TREE
10740 || TREE_CODE (declarator) == IDENTIFIER_NODE
10741 || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
10742 && (TREE_CODE (type) == FUNCTION_TYPE
10743 || TREE_CODE (type) == METHOD_TYPE)))
10745 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
10747 cp_error ("template-id `%D' used as a declarator", declarator);
10748 declarator = dname;
10751 my_friendly_abort (990210);
10753 if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
10757 /* Note that the grammar rejects storage classes
10758 in typenames, fields or parameters. */
10759 if (current_lang_name == lang_name_java)
10760 TYPE_FOR_JAVA (type) = 1;
10762 if (decl_context == FIELD)
10764 if (declarator == constructor_name (current_class_type))
10765 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10767 decl = build_lang_decl (TYPE_DECL, declarator, type);
10768 if (IS_SIGNATURE (current_class_type) && opaque_typedef)
10769 SIGNATURE_HAS_OPAQUE_TYPEDECLS (current_class_type) = 1;
10773 /* Make sure this typedef lives as long as its type,
10774 since it might be used as a template parameter. */
10775 if (type != error_mark_node)
10776 push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type));
10777 decl = build_decl (TYPE_DECL, declarator, type);
10778 if (type != error_mark_node)
10782 /* If the user declares "struct {...} foo" then `foo' will have
10783 an anonymous name. Fill that name in now. Nothing can
10784 refer to it, so nothing needs know about the name change.
10785 The TYPE_NAME field was filled in by build_struct_xref. */
10786 if (type != error_mark_node
10787 && TYPE_NAME (type)
10788 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
10789 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type)))
10791 /* FIXME: This is bogus; we should not be doing this for
10792 cv-qualified types. */
10794 /* For anonymous structs that are cv-qualified, need to use
10795 TYPE_MAIN_VARIANT so that name will mangle correctly. As
10796 type not referenced after this block, don't bother
10797 resetting type to original type, ie. TREE_TYPE (decl). */
10798 type = TYPE_MAIN_VARIANT (type);
10800 /* Replace the anonymous name with the real name everywhere. */
10801 lookup_tag_reverse (type, declarator);
10802 TYPE_NAME (type) = decl;
10804 if (TYPE_LANG_SPECIFIC (type))
10805 TYPE_WAS_ANONYMOUS (type) = 1;
10807 /* If this is a typedef within a template class, the nested
10808 type is a (non-primary) template. The name for the
10809 template needs updating as well. */
10810 if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
10811 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
10812 = TYPE_IDENTIFIER (type);
10814 /* XXX Temporarily set the scope.
10815 When returning, start_decl expects it as NULL_TREE,
10816 and will then then set it using pushdecl. */
10817 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 980404);
10818 if (current_class_type)
10819 DECL_CONTEXT (decl) = current_class_type;
10821 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
10823 DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
10824 DECL_ASSEMBLER_NAME (decl)
10825 = get_identifier (build_overload_name (type, 1, 1));
10826 DECL_CONTEXT (decl) = NULL_TREE;
10828 /* FIXME remangle member functions; member functions of a
10829 type with external linkage have external linkage. */
10832 if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
10834 cp_error_at ("typedef name may not be class-qualified", decl);
10839 if (ctype == NULL_TREE)
10841 if (TREE_CODE (type) != METHOD_TYPE)
10842 cp_error_at ("invalid type qualifier for non-method type", decl);
10844 ctype = TYPE_METHOD_BASETYPE (type);
10846 if (ctype != NULL_TREE)
10847 grok_method_quals (ctype, decl, quals);
10850 if (RIDBIT_SETP (RID_SIGNED, specbits)
10851 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
10852 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
10854 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10855 error ("non-object member `%s' cannot be declared mutable", name);
10857 bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
10858 inlinep, friendp, raises != NULL_TREE);
10861 error ("typedef declaration includes an initializer");
10866 /* Detect the case of an array type of unspecified size
10867 which came, as such, direct from a typedef name.
10868 We must copy the type, so that each identifier gets
10869 a distinct type, so that each identifier's size can be
10870 controlled separately by its own initializer. */
10872 if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE
10873 && TYPE_DOMAIN (type) == NULL_TREE)
10875 type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type));
10878 /* If this is a type name (such as, in a cast or sizeof),
10879 compute the type and return it now. */
10881 if (decl_context == TYPENAME)
10883 /* Note that the grammar rejects storage classes
10884 in typenames, fields or parameters. */
10885 if (type_quals != TYPE_UNQUALIFIED)
10887 if (IS_SIGNATURE (type))
10888 error ("type qualifiers specified for signature type");
10889 type_quals = TYPE_UNQUALIFIED;
10892 /* Special case: "friend class foo" looks like a TYPENAME context. */
10895 if (type_quals != TYPE_UNQUALIFIED)
10897 cp_error ("type qualifiers specified for friend class declaration");
10898 type_quals = TYPE_UNQUALIFIED;
10902 cp_error ("`inline' specified for friend class declaration");
10906 /* Only try to do this stuff if we didn't already give up. */
10907 if (type != integer_type_node)
10909 /* A friendly class? */
10910 if (current_class_type)
10911 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
10913 error ("trying to make class `%s' a friend of global scope",
10914 TYPE_NAME_STRING (type));
10915 type = void_type_node;
10920 tree dummy = build_decl (TYPE_DECL, declarator, type);
10921 if (ctype == NULL_TREE)
10923 my_friendly_assert (TREE_CODE (type) == METHOD_TYPE, 159);
10924 ctype = TYPE_METHOD_BASETYPE (type);
10926 grok_method_quals (ctype, dummy, quals);
10927 type = TREE_TYPE (dummy);
10932 else if (declarator == NULL_TREE && decl_context != PARM
10933 && decl_context != CATCHPARM
10934 && TREE_CODE (type) != UNION_TYPE
10937 cp_error ("abstract declarator `%T' used as declaration", type);
10938 declarator = make_anon_name ();
10941 /* `void' at top level (not within pointer)
10942 is allowed only in typedefs or type names.
10943 We don't complain about parms either, but that is because
10944 a better error message can be made later. */
10946 if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
10949 error ("unnamed variable or field declared void");
10950 else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10952 if (IDENTIFIER_OPNAME_P (declarator))
10953 my_friendly_abort (356);
10955 error ("variable or field `%s' declared void", name);
10958 error ("variable or field declared void");
10959 type = integer_type_node;
10962 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10963 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10965 if (decl_context == PARM || decl_context == CATCHPARM)
10967 if (ctype || in_namespace)
10968 error ("cannot use `::' in parameter declaration");
10970 /* A parameter declared as an array of T is really a pointer to T.
10971 One declared as a function is really a pointer to a function.
10972 One declared as a member is really a pointer to member. */
10974 if (TREE_CODE (type) == ARRAY_TYPE)
10976 /* Transfer const-ness of array into that of type pointed to. */
10977 type = build_pointer_type (TREE_TYPE (type));
10978 type_quals = TYPE_UNQUALIFIED;
10980 else if (TREE_CODE (type) == FUNCTION_TYPE)
10981 type = build_pointer_type (type);
10982 else if (TREE_CODE (type) == OFFSET_TYPE)
10983 type = build_pointer_type (type);
10984 else if (TREE_CODE (type) == VOID_TYPE && declarator)
10986 error ("declaration of `%s' as void", name);
10992 register tree decl;
10994 if (decl_context == PARM)
10996 decl = build_decl (PARM_DECL, declarator, type);
10998 bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
10999 inlinep, friendp, raises != NULL_TREE);
11000 if (current_class_type
11001 && IS_SIGNATURE (current_class_type))
11004 error ("parameter of signature member function declared `inline'");
11005 if (RIDBIT_SETP (RID_AUTO, specbits))
11006 error ("parameter of signature member function declared `auto'");
11007 if (RIDBIT_SETP (RID_REGISTER, specbits))
11008 error ("parameter of signature member function declared `register'");
11011 /* Compute the type actually passed in the parmlist,
11012 for the case where there is no prototype.
11013 (For example, shorts and chars are passed as ints.)
11014 When there is a prototype, this is overridden later. */
11016 DECL_ARG_TYPE (decl) = type_promotes_to (type);
11018 else if (decl_context == FIELD)
11020 if (type == error_mark_node)
11022 /* Happens when declaring arrays of sizes which
11023 are error_mark_node, for example. */
11026 else if (in_namespace && !friendp)
11028 /* Something like struct S { int N::j; }; */
11029 cp_error ("invalid use of `::'");
11032 else if (TREE_CODE (type) == FUNCTION_TYPE)
11035 tree function_context;
11037 /* We catch the others as conflicts with the builtin
11039 if (friendp && declarator == ridpointers[(int) RID_SIGNED])
11041 cp_error ("function `%D' cannot be declared friend",
11048 if (ctype == NULL_TREE)
11049 ctype = current_class_type;
11051 if (ctype == NULL_TREE)
11053 cp_error ("can't make `%D' into a method -- not in a class",
11055 return void_type_node;
11058 /* ``A union may [ ... ] not [ have ] virtual functions.''
11060 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
11062 cp_error ("function `%D' declared virtual inside a union",
11064 return void_type_node;
11067 if (declarator == ansi_opname[(int) NEW_EXPR]
11068 || declarator == ansi_opname[(int) VEC_NEW_EXPR]
11069 || declarator == ansi_opname[(int) DELETE_EXPR]
11070 || declarator == ansi_opname[(int) VEC_DELETE_EXPR])
11074 cp_error ("`%D' cannot be declared virtual, since it is always static",
11079 else if (staticp < 2)
11080 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11081 TYPE_ARG_TYPES (type));
11084 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11085 function_context = (ctype != NULL_TREE) ?
11086 hack_decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
11087 publicp = (! friendp || ! staticp)
11088 && function_context == NULL_TREE;
11089 decl = grokfndecl (ctype, type,
11090 TREE_CODE (declarator) != TEMPLATE_ID_EXPR
11091 ? declarator : dname,
11093 virtualp, flags, quals, raises, attrlist,
11094 friendp ? -1 : 0, friendp, publicp, inlinep,
11095 funcdef_flag, template_count, in_namespace);
11096 if (decl == NULL_TREE)
11099 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11100 /* The decl and setting of decl_machine_attr is also turned off. */
11101 decl = build_decl_attribute_variant (decl, decl_machine_attr);
11104 /* [class.conv.ctor]
11106 A constructor declared without the function-specifier
11107 explicit that can be called with a single parameter
11108 specifies a conversion from the type of its first
11109 parameter to the type of its class. Such a constructor
11110 is called a converting constructor. */
11111 if (explicitp == 2)
11112 DECL_NONCONVERTING_P (decl) = 1;
11113 else if (DECL_CONSTRUCTOR_P (decl))
11115 /* The constructor can be called with exactly one
11116 parameter if there is at least one parameter, and
11117 any subsequent parameters have default arguments.
11118 We don't look at the first parameter, which is
11119 really just the `this' parameter for the new
11122 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)));
11124 /* Skip the `in_chrg' argument too, if present. */
11125 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl)))
11126 arg_types = TREE_CHAIN (arg_types);
11128 if (arg_types == void_list_node
11130 && TREE_CHAIN (arg_types)
11131 && TREE_CHAIN (arg_types) != void_list_node
11132 && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
11133 DECL_NONCONVERTING_P (decl) = 1;
11136 else if (TREE_CODE (type) == METHOD_TYPE)
11138 /* We only get here for friend declarations of
11139 members of other classes. */
11140 /* All method decls are public, so tell grokfndecl to set
11141 TREE_PUBLIC, also. */
11142 decl = grokfndecl (ctype, type, declarator, declarator,
11143 virtualp, flags, quals, raises, attrlist,
11144 friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
11145 template_count, in_namespace);
11146 if (decl == NULL_TREE)
11149 else if (!staticp && ! processing_template_decl
11150 && TYPE_SIZE (complete_type (type)) == NULL_TREE
11151 && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
11154 cp_error ("field `%D' has incomplete type", declarator);
11156 cp_error ("name `%T' has incomplete type", type);
11158 /* If we're instantiating a template, tell them which
11159 instantiation made the field's type be incomplete. */
11160 if (current_class_type
11161 && TYPE_NAME (current_class_type)
11162 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
11163 && declspecs && TREE_VALUE (declspecs)
11164 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
11165 cp_error (" in instantiation of template `%T'",
11166 current_class_type);
11168 type = error_mark_node;
11175 error ("`%s' is neither function nor method; cannot be declared friend",
11176 IDENTIFIER_POINTER (declarator));
11184 /* Friends are treated specially. */
11185 if (ctype == current_class_type)
11186 warning ("member functions are implicitly friends of their class");
11189 tree t = NULL_TREE;
11190 if (decl && DECL_NAME (decl))
11192 if (template_class_depth (current_class_type) == 0)
11195 = check_explicit_specialization
11197 template_count, 2 * (funcdef_flag != 0) + 4);
11198 if (decl == error_mark_node)
11199 return error_mark_node;
11202 t = do_friend (ctype, declarator, decl,
11203 last_function_parms, flags, quals,
11206 if (t && funcdef_flag)
11209 return void_type_node;
11213 /* Structure field. It may not be a function, except for C++ */
11215 if (decl == NULL_TREE)
11221 /* An attempt is being made to initialize a non-static
11222 member. But, from [class.mem]:
11224 4 A member-declarator can contain a
11225 constant-initializer only if it declares a static
11226 member (_class.static_) of integral or enumeration
11227 type, see _class.static.data_.
11229 This used to be relatively common practice, but
11230 the rest of the compiler does not correctly
11231 handle the initialization unless the member is
11232 static so we make it static below. */
11233 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
11235 cp_pedwarn ("making `%D' static", declarator);
11239 if (uses_template_parms (type))
11240 /* We'll check at instantiation time. */
11242 else if (check_static_variable_definition (declarator,
11244 /* If we just return the declaration, crashes
11245 will sometimes occur. We therefore return
11246 void_type_node, as if this was a friend
11247 declaration, to cause callers to completely
11248 ignore this declaration. */
11249 return void_type_node;
11252 /* 9.2p13 [class.mem] */
11253 if (declarator == constructor_name (current_class_type)
11254 /* Divergence from the standard: In extern "C", we
11255 allow non-static data members here, because C does
11256 and /usr/include/netinet/in.h uses that. */
11257 && (staticp || ! in_system_header))
11258 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
11263 /* C++ allows static class members.
11264 All other work for this is done by grokfield.
11265 This VAR_DCL is built by build_lang_field_decl.
11266 All other VAR_DECLs are built by build_decl. */
11267 decl = build_lang_field_decl (VAR_DECL, declarator, type);
11268 TREE_STATIC (decl) = 1;
11269 /* In class context, 'static' means public access. */
11270 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
11274 decl = build_lang_field_decl (FIELD_DECL, declarator, type);
11275 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11277 DECL_MUTABLE_P (decl) = 1;
11278 RIDBIT_RESET (RID_MUTABLE, specbits);
11282 bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
11283 inlinep, friendp, raises != NULL_TREE);
11286 else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
11288 tree original_name;
11294 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11295 original_name = dname;
11297 original_name = declarator;
11299 if (RIDBIT_SETP (RID_AUTO, specbits))
11300 error ("storage class `auto' invalid for function `%s'", name);
11301 else if (RIDBIT_SETP (RID_REGISTER, specbits))
11302 error ("storage class `register' invalid for function `%s'", name);
11304 /* Function declaration not at top level.
11305 Storage classes other than `extern' are not allowed
11306 and `extern' makes no difference. */
11307 if (! toplevel_bindings_p ()
11308 && (RIDBIT_SETP (RID_STATIC, specbits)
11309 || RIDBIT_SETP (RID_INLINE, specbits))
11312 if (RIDBIT_SETP (RID_STATIC, specbits))
11313 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11315 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11318 if (ctype == NULL_TREE)
11322 error ("virtual non-class function `%s'", name);
11326 else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11327 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11328 TYPE_ARG_TYPES (type));
11330 /* Record presence of `static'. */
11331 publicp = (ctype != NULL_TREE
11332 || RIDBIT_SETP (RID_EXTERN, specbits)
11333 || !RIDBIT_SETP (RID_STATIC, specbits));
11335 decl = grokfndecl (ctype, type, original_name, declarator,
11336 virtualp, flags, quals, raises, attrlist,
11338 publicp, inlinep, funcdef_flag,
11339 template_count, in_namespace);
11340 if (decl == NULL_TREE)
11345 int illegal_static = 0;
11347 /* Don't allow a static member function in a class, and forbid
11348 declaring main to be static. */
11349 if (TREE_CODE (type) == METHOD_TYPE)
11351 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11352 illegal_static = 1;
11354 else if (current_function_decl)
11356 /* FIXME need arm citation */
11357 error ("cannot declare static function inside another function");
11358 illegal_static = 1;
11361 if (illegal_static)
11364 RIDBIT_RESET (RID_STATIC, specbits);
11370 /* It's a variable. */
11372 /* An uninitialized decl with `extern' is a reference. */
11373 decl = grokvardecl (type, declarator, &specbits,
11375 (type_quals & TYPE_QUAL_CONST) != 0,
11377 bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11378 inlinep, friendp, raises != NULL_TREE);
11382 DECL_CONTEXT (decl) = ctype;
11385 cp_pedwarn ("static member `%D' re-declared as static", decl);
11387 RIDBIT_RESET (RID_STATIC, specbits);
11389 if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11391 cp_error ("static member `%D' declared `register'", decl);
11392 RIDBIT_RESET (RID_REGISTER, specbits);
11394 if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11396 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11398 RIDBIT_RESET (RID_EXTERN, specbits);
11403 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11405 error ("`%s' cannot be declared mutable", name);
11408 /* Record `register' declaration for warnings on &
11409 and in case doing stupid register allocation. */
11411 if (RIDBIT_SETP (RID_REGISTER, specbits))
11412 DECL_REGISTER (decl) = 1;
11414 if (RIDBIT_SETP (RID_EXTERN, specbits))
11415 DECL_THIS_EXTERN (decl) = 1;
11417 if (RIDBIT_SETP (RID_STATIC, specbits))
11418 DECL_THIS_STATIC (decl) = 1;
11420 /* Record constancy and volatility. */
11421 /* FIXME: Disallow `restrict' pointer-to-member declarations. */
11422 c_apply_type_quals_to_decl (type_quals, decl);
11428 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11429 An empty exprlist is a parmlist. An exprlist which
11430 contains only identifiers at the global level
11431 is a parmlist. Otherwise, it is an exprlist. */
11434 parmlist_is_exprlist (exprs)
11437 if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11440 if (toplevel_bindings_p ())
11442 /* At the global level, if these are all identifiers,
11443 then it is a parmlist. */
11446 if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11448 exprs = TREE_CHAIN (exprs);
11455 /* Subroutine of start_function. Ensure that each of the parameter
11456 types (as listed in PARMS) is complete, as is required for a
11457 function definition. */
11460 require_complete_types_for_parms (parms)
11465 tree type = TREE_TYPE (parms);
11466 if (TYPE_SIZE (complete_type (type)) == NULL_TREE)
11468 if (DECL_NAME (parms))
11469 error ("parameter `%s' has incomplete type",
11470 IDENTIFIER_POINTER (DECL_NAME (parms)));
11472 error ("parameter has incomplete type");
11473 TREE_TYPE (parms) = error_mark_node;
11476 layout_decl (parms, 0);
11478 parms = TREE_CHAIN (parms);
11482 /* Returns DECL if DECL is a local variable (or parameter). Returns
11483 NULL_TREE otherwise. */
11486 local_variable_p (t)
11489 if ((TREE_CODE (t) == VAR_DECL
11490 /* A VAR_DECL with a context that is a _TYPE is a static data
11492 && !TYPE_P (CP_DECL_CONTEXT (t))
11493 /* Any other non-local variable must be at namespace scope. */
11494 && TREE_CODE (CP_DECL_CONTEXT (t)) != NAMESPACE_DECL)
11495 || (TREE_CODE (t) == PARM_DECL))
11501 /* Check that ARG, which is a default-argument expression for a
11502 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11503 something goes wrong. DECL may also be a _TYPE node, rather than a
11504 DECL, if there is no DECL available. */
11507 check_default_argument (decl, arg)
11514 if (TREE_CODE (arg) == DEFAULT_ARG)
11515 /* We get a DEFAULT_ARG when looking at an in-class declaration
11516 with a default argument. Ignore the argument for now; we'll
11517 deal with it after the class is complete. */
11520 if (processing_template_decl || uses_template_parms (arg))
11521 /* We don't do anything checking until instantiation-time. Note
11522 that there may be uninstantiated arguments even for an
11523 instantiated function, since default arguments are not
11524 instantiated until they are needed. */
11533 decl_type = TREE_TYPE (decl);
11535 if (arg == error_mark_node
11536 || decl == error_mark_node
11537 || TREE_TYPE (arg) == error_mark_node
11538 || decl_type == error_mark_node)
11539 /* Something already went wrong. There's no need to check
11541 return error_mark_node;
11543 /* [dcl.fct.default]
11545 A default argument expression is implicitly converted to the
11547 if (!TREE_TYPE (arg)
11548 || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11551 cp_error ("default argument for `%#D' has type `%T'",
11552 decl, TREE_TYPE (arg));
11554 cp_error ("default argument for paramter of type `%T' has type `%T'",
11555 decl_type, TREE_TYPE (arg));
11557 return error_mark_node;
11560 /* [dcl.fct.default]
11562 Local variables shall not be used in default argument
11565 The keyword `this' shall not be used in a default argument of a
11566 member function. */
11567 var = search_tree (arg, local_variable_p);
11570 cp_error ("default argument `%E' uses local variable `%D'",
11572 return error_mark_node;
11579 /* Decode the list of parameter types for a function type.
11580 Given the list of things declared inside the parens,
11581 return a list of types.
11583 The list we receive can have three kinds of elements:
11584 an IDENTIFIER_NODE for names given without types,
11585 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11586 or void_type_node, to mark the end of an argument list
11587 when additional arguments are not permitted (... was not used).
11589 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11590 a mere declaration. A nonempty identifier-list gets an error message
11591 when FUNCDEF_FLAG is zero.
11592 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11593 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11595 If all elements of the input list contain types,
11596 we return a list of the types.
11597 If all elements contain no type (except perhaps a void_type_node
11598 at the end), we return a null list.
11599 If some have types and some do not, it is an error, and we
11600 return a null list.
11602 Also set last_function_parms to either
11603 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11604 A list of names is converted to a chain of PARM_DECLs
11605 by store_parm_decls so that ultimately it is always a chain of decls.
11607 Note that in C++, parameters can take default values. These default
11608 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11609 an error to specify default values which are followed by parameters
11610 that have no default values, or an ELLIPSES. For simplicities sake,
11611 only parameters which are specified with their types can take on
11615 grokparms (first_parm, funcdef_flag)
11619 tree result = NULL_TREE;
11620 tree decls = NULL_TREE;
11622 if (first_parm != NULL_TREE
11623 && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE)
11625 if (! funcdef_flag)
11626 pedwarn ("parameter names (without types) in function declaration");
11627 last_function_parms = first_parm;
11630 else if (first_parm != NULL_TREE
11631 && TREE_CODE (TREE_VALUE (first_parm)) != TREE_LIST
11632 && TREE_CODE (TREE_VALUE (first_parm)) != VOID_TYPE)
11633 my_friendly_abort (145);
11636 /* Types were specified. This is a list of declarators
11637 each represented as a TREE_LIST node. */
11638 register tree parm, chain;
11639 int any_init = 0, any_error = 0;
11641 if (first_parm != NULL_TREE)
11643 tree last_result = NULL_TREE;
11644 tree last_decl = NULL_TREE;
11646 for (parm = first_parm; parm != NULL_TREE; parm = chain)
11648 tree type = NULL_TREE, list_node = parm;
11649 register tree decl = TREE_VALUE (parm);
11650 tree init = TREE_PURPOSE (parm);
11652 chain = TREE_CHAIN (parm);
11653 /* @@ weak defense against parse errors. */
11654 if (TREE_CODE (decl) != VOID_TYPE
11655 && TREE_CODE (decl) != TREE_LIST)
11657 /* Give various messages as the need arises. */
11658 if (TREE_CODE (decl) == STRING_CST)
11659 cp_error ("invalid string constant `%E'", decl);
11660 else if (TREE_CODE (decl) == INTEGER_CST)
11661 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11665 if (TREE_CODE (decl) != VOID_TYPE)
11667 decl = grokdeclarator (TREE_VALUE (decl),
11668 TREE_PURPOSE (decl),
11669 PARM, init != NULL_TREE,
11671 if (! decl || TREE_TYPE (decl) == error_mark_node)
11674 /* Top-level qualifiers on the parameters are
11675 ignored for function types. */
11676 type = TYPE_MAIN_VARIANT (TREE_TYPE (decl));
11678 if (TREE_CODE (type) == VOID_TYPE)
11679 decl = void_type_node;
11680 else if (TREE_CODE (type) == METHOD_TYPE)
11682 if (DECL_NAME (decl))
11683 /* Cannot use the decl here because
11684 we don't have DECL_CONTEXT set up yet. */
11685 cp_error ("parameter `%D' invalidly declared method type",
11688 error ("parameter invalidly declared method type");
11689 type = build_pointer_type (type);
11690 TREE_TYPE (decl) = type;
11692 else if (TREE_CODE (type) == OFFSET_TYPE)
11694 if (DECL_NAME (decl))
11695 cp_error ("parameter `%D' invalidly declared offset type",
11698 error ("parameter invalidly declared offset type");
11699 type = build_pointer_type (type);
11700 TREE_TYPE (decl) = type;
11702 else if (TREE_CODE (type) == RECORD_TYPE
11703 && TYPE_LANG_SPECIFIC (type)
11704 && CLASSTYPE_ABSTRACT_VIRTUALS (type))
11706 abstract_virtuals_error (decl, type);
11707 any_error = 1; /* Seems like a good idea. */
11709 else if (TREE_CODE (type) == RECORD_TYPE
11710 && TYPE_LANG_SPECIFIC (type)
11711 && IS_SIGNATURE (type))
11713 signature_error (decl, type);
11714 any_error = 1; /* Seems like a good idea. */
11716 else if (POINTER_TYPE_P (type))
11719 while (POINTER_TYPE_P (t)
11720 || (TREE_CODE (t) == ARRAY_TYPE
11721 && TYPE_DOMAIN (t) != NULL_TREE))
11723 if (TREE_CODE (t) == ARRAY_TYPE)
11724 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11726 TYPE_PTR_P (type) ? "pointer" : "reference");
11730 if (TREE_CODE (decl) == VOID_TYPE)
11732 if (result == NULL_TREE)
11734 result = void_list_node;
11735 last_result = result;
11739 TREE_CHAIN (last_result) = void_list_node;
11740 last_result = void_list_node;
11743 && (chain != void_list_node || TREE_CHAIN (chain)))
11744 error ("`void' in parameter list must be entire list");
11748 /* Since there is a prototype, args are passed in their own types. */
11749 DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
11750 #ifdef PROMOTE_PROTOTYPES
11751 if ((TREE_CODE (type) == INTEGER_TYPE
11752 || TREE_CODE (type) == ENUMERAL_TYPE)
11753 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
11754 DECL_ARG_TYPE (decl) = integer_type_node;
11756 if (!any_error && init)
11759 init = check_default_argument (decl, init);
11764 if (decls == NULL_TREE)
11771 TREE_CHAIN (last_decl) = decl;
11774 if (! current_function_decl && TREE_PERMANENT (list_node))
11776 TREE_PURPOSE (list_node) = init;
11777 TREE_VALUE (list_node) = type;
11778 TREE_CHAIN (list_node) = NULL_TREE;
11781 list_node = saveable_tree_cons (init, type, NULL_TREE);
11782 if (result == NULL_TREE)
11784 result = list_node;
11785 last_result = result;
11789 TREE_CHAIN (last_result) = list_node;
11790 last_result = list_node;
11794 TREE_CHAIN (last_result) = NULL_TREE;
11795 /* If there are no parameters, and the function does not end
11796 with `...', then last_decl will be NULL_TREE. */
11797 if (last_decl != NULL_TREE)
11798 TREE_CHAIN (last_decl) = NULL_TREE;
11802 last_function_parms = decls;
11807 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11808 FUNCTION_TYPE with the newly parsed version of its default argument, which
11809 was previously digested as text. See snarf_defarg et al in lex.c. */
11812 replace_defarg (arg, init)
11815 if (! processing_template_decl
11816 && ! can_convert_arg (TREE_VALUE (arg), TREE_TYPE (init), init))
11817 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11818 TREE_TYPE (init), TREE_VALUE (arg));
11819 TREE_PURPOSE (arg) = init;
11826 tree t = FUNCTION_ARG_CHAIN (d);
11827 if (DECL_CONSTRUCTOR_P (d)
11828 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d)))
11829 t = TREE_CHAIN (t);
11830 if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
11831 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t)))
11832 == DECL_CLASS_CONTEXT (d))
11833 && (TREE_CHAIN (t) == NULL_TREE
11834 || TREE_CHAIN (t) == void_list_node
11835 || TREE_PURPOSE (TREE_CHAIN (t))))
11840 /* These memoizing functions keep track of special properties which
11841 a class may have. `grok_ctor_properties' notices whether a class
11842 has a constructor of the form X(X&), and also complains
11843 if the class has a constructor of the form X(X).
11844 `grok_op_properties' takes notice of the various forms of
11845 operator= which are defined, as well as what sorts of type conversion
11846 may apply. Both functions take a FUNCTION_DECL as an argument. */
11849 grok_ctor_properties (ctype, decl)
11852 tree parmtypes = FUNCTION_ARG_CHAIN (decl);
11853 tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
11855 /* When a type has virtual baseclasses, a magical first int argument is
11856 added to any ctor so we can tell if the class has been initialized
11857 yet. This could screw things up in this function, so we deliberately
11858 ignore the leading int if we're in that situation. */
11859 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype))
11861 my_friendly_assert (parmtypes
11862 && TREE_VALUE (parmtypes) == integer_type_node,
11864 parmtypes = TREE_CHAIN (parmtypes);
11865 parmtype = TREE_VALUE (parmtypes);
11870 A non-template constructor for class X is a copy constructor if
11871 its first parameter is of type X&, const X&, volatile X& or const
11872 volatile X&, and either there are no other parameters or else all
11873 other parameters have default arguments. */
11874 if (TREE_CODE (parmtype) == REFERENCE_TYPE
11875 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype
11876 && (TREE_CHAIN (parmtypes) == NULL_TREE
11877 || TREE_CHAIN (parmtypes) == void_list_node
11878 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11879 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11880 && is_member_template (DECL_TI_TEMPLATE (decl))))
11882 TYPE_HAS_INIT_REF (ctype) = 1;
11883 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11884 TYPE_HAS_CONST_INIT_REF (ctype) = 1;
11888 A declaration of a constructor for a class X is ill-formed if its
11889 first parameter is of type (optionally cv-qualified) X and either
11890 there are no other parameters or else all other parameters have
11893 We *don't* complain about member template instantiations that
11894 have this form, though; they can occur as we try to decide what
11895 constructor to use during overload resolution. Since overload
11896 resolution will never prefer such a constructor to the
11897 non-template copy constructor (which is either explicitly or
11898 implicitly defined), there's no need to worry about their
11899 existence. Theoretically, they should never even be
11900 instantiated, but that's hard to forestall. */
11901 else if (TYPE_MAIN_VARIANT (parmtype) == ctype
11902 && (TREE_CHAIN (parmtypes) == NULL_TREE
11903 || TREE_CHAIN (parmtypes) == void_list_node
11904 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11905 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11906 && is_member_template (DECL_TI_TEMPLATE (decl))))
11908 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11910 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
11913 else if (TREE_CODE (parmtype) == VOID_TYPE
11914 || TREE_PURPOSE (parmtypes) != NULL_TREE)
11915 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1;
11920 /* An operator with this name can be either unary or binary. */
11926 return (name == ansi_opname [(int) INDIRECT_REF]
11927 || name == ansi_opname [(int) ADDR_EXPR]
11928 || name == ansi_opname [(int) NEGATE_EXPR]
11929 || name == ansi_opname[(int) POSTINCREMENT_EXPR]
11930 || name == ansi_opname[(int) POSTDECREMENT_EXPR]
11931 || name == ansi_opname [(int) CONVERT_EXPR]);
11934 /* An operator with this name can only be unary. */
11940 return (name == ansi_opname [(int) TRUTH_NOT_EXPR]
11941 || name == ansi_opname [(int) BIT_NOT_EXPR]
11942 || name == ansi_opname [(int) COMPONENT_REF]
11943 || IDENTIFIER_TYPENAME_P (name));
11946 /* Do a little sanity-checking on how they declared their operator. */
11949 grok_op_properties (decl, virtualp, friendp)
11951 int virtualp, friendp;
11953 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
11954 int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
11955 tree name = DECL_NAME (decl);
11957 if (current_class_type == NULL_TREE)
11964 A user-declared copy assignment operator X::operator= is a
11965 non-static non-template member function of class X with
11966 exactly one parameter of type X, X&, const X&, volatile X& or
11967 const volatile X&. */
11968 if (name == ansi_opname[(int) MODIFY_EXPR]
11969 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11970 && is_member_template (DECL_TI_TEMPLATE (decl))))
11972 else if (name == ansi_opname[(int) CALL_EXPR])
11973 TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
11974 else if (name == ansi_opname[(int) ARRAY_REF])
11975 TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
11976 else if (name == ansi_opname[(int) COMPONENT_REF]
11977 || name == ansi_opname[(int) MEMBER_REF])
11978 TYPE_OVERLOADS_ARROW (current_class_type) = 1;
11979 else if (name == ansi_opname[(int) NEW_EXPR])
11980 TYPE_GETS_NEW (current_class_type) |= 1;
11981 else if (name == ansi_opname[(int) DELETE_EXPR])
11982 TYPE_GETS_DELETE (current_class_type) |= 1;
11983 else if (name == ansi_opname[(int) VEC_NEW_EXPR])
11984 TYPE_GETS_NEW (current_class_type) |= 2;
11985 else if (name == ansi_opname[(int) VEC_DELETE_EXPR])
11986 TYPE_GETS_DELETE (current_class_type) |= 2;
11989 if (name == ansi_opname[(int) NEW_EXPR]
11990 || name == ansi_opname[(int) VEC_NEW_EXPR])
11992 /* When the compiler encounters the definition of A::operator new, it
11993 doesn't look at the class declaration to find out if it's static. */
11995 revert_static_member_fn (&decl, NULL, NULL);
11997 /* Take care of function decl if we had syntax errors. */
11998 if (argtypes == NULL_TREE)
12000 = build_function_type (ptr_type_node,
12001 hash_tree_chain (integer_type_node,
12004 TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
12006 else if (name == ansi_opname[(int) DELETE_EXPR]
12007 || name == ansi_opname[(int) VEC_DELETE_EXPR])
12010 revert_static_member_fn (&decl, NULL, NULL);
12012 if (argtypes == NULL_TREE)
12014 = build_function_type (void_type_node,
12015 hash_tree_chain (ptr_type_node,
12019 TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
12021 if (! friendp && name == ansi_opname[(int) VEC_DELETE_EXPR]
12022 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)))
12023 != void_list_node))
12024 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type) = 1;
12029 /* An operator function must either be a non-static member function
12030 or have at least one parameter of a class, a reference to a class,
12031 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12032 if (! methodp || DECL_STATIC_FUNCTION_P (decl))
12034 if (IDENTIFIER_TYPENAME_P (name)
12035 || name == ansi_opname[(int) CALL_EXPR]
12036 || name == ansi_opname[(int) MODIFY_EXPR]
12037 || name == ansi_opname[(int) COMPONENT_REF]
12038 || name == ansi_opname[(int) ARRAY_REF])
12039 cp_error ("`%D' must be a nonstatic member function", decl);
12044 if (DECL_STATIC_FUNCTION_P (decl))
12045 cp_error ("`%D' must be either a non-static member function or a non-member function", decl);
12048 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
12050 tree arg = TREE_VALUE (p);
12051 if (TREE_CODE (arg) == REFERENCE_TYPE)
12052 arg = TREE_TYPE (arg);
12054 /* This lets bad template code slip through. */
12055 if (IS_AGGR_TYPE (arg)
12056 || TREE_CODE (arg) == ENUMERAL_TYPE
12057 || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
12058 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
12062 ("`%D' must have an argument of class or enumerated type",
12069 if (name == ansi_opname[(int) CALL_EXPR])
12070 return; /* No restrictions on args. */
12072 if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
12074 tree t = TREE_TYPE (name);
12075 if (TREE_CODE (t) == VOID_TYPE)
12076 pedwarn ("void is not a valid type conversion operator");
12077 else if (! friendp)
12079 int ref = (TREE_CODE (t) == REFERENCE_TYPE);
12080 const char *what = 0;
12082 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
12084 if (t == current_class_type)
12085 what = "the same type";
12086 /* Don't force t to be complete here. */
12087 else if (IS_AGGR_TYPE (t)
12089 && DERIVED_FROM_P (t, current_class_type))
12090 what = "a base class";
12093 warning ("conversion to %s%s will never use a type conversion operator",
12094 ref ? "a reference to " : "", what);
12098 if (name == ansi_opname[(int) MODIFY_EXPR])
12102 if (list_length (argtypes) != 3 && methodp)
12104 cp_error ("`%D' must take exactly one argument", decl);
12107 parmtype = TREE_VALUE (TREE_CHAIN (argtypes));
12109 if (copy_assignment_arg_p (parmtype, virtualp)
12112 TYPE_HAS_ASSIGN_REF (current_class_type) = 1;
12113 if (TREE_CODE (parmtype) != REFERENCE_TYPE
12114 || CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
12115 TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1;
12118 else if (name == ansi_opname[(int) COND_EXPR])
12121 pedwarn ("ANSI C++ prohibits overloading operator ?:");
12122 if (list_length (argtypes) != 4)
12123 cp_error ("`%D' must take exactly three arguments", decl);
12125 else if (ambi_op_p (name))
12127 if (list_length (argtypes) == 2)
12129 else if (list_length (argtypes) == 3)
12131 if ((name == ansi_opname[(int) POSTINCREMENT_EXPR]
12132 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
12133 && ! processing_template_decl
12134 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
12137 cp_error ("postfix `%D' must take `int' as its argument",
12141 ("postfix `%D' must take `int' as its second argument",
12148 cp_error ("`%D' must take either zero or one argument", decl);
12150 cp_error ("`%D' must take either one or two arguments", decl);
12153 /* More Effective C++ rule 6. */
12155 && (name == ansi_opname[(int) POSTINCREMENT_EXPR]
12156 || name == ansi_opname[(int) POSTDECREMENT_EXPR]))
12158 tree arg = TREE_VALUE (argtypes);
12159 tree ret = TREE_TYPE (TREE_TYPE (decl));
12160 if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
12161 arg = TREE_TYPE (arg);
12162 arg = TYPE_MAIN_VARIANT (arg);
12163 if (list_length (argtypes) == 2)
12165 if (TREE_CODE (ret) != REFERENCE_TYPE
12166 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
12168 cp_warning ("prefix `%D' should return `%T'", decl,
12169 build_reference_type (arg));
12173 if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
12174 cp_warning ("postfix `%D' should return `%T'", decl, arg);
12178 else if (unary_op_p (name))
12180 if (list_length (argtypes) != 2)
12183 cp_error ("`%D' must take `void'", decl);
12185 cp_error ("`%D' must take exactly one argument", decl);
12188 else /* if (binary_op_p (name)) */
12190 if (list_length (argtypes) != 3)
12193 cp_error ("`%D' must take exactly one argument", decl);
12195 cp_error ("`%D' must take exactly two arguments", decl);
12198 /* More Effective C++ rule 7. */
12200 && (name == ansi_opname [TRUTH_ANDIF_EXPR]
12201 || name == ansi_opname [TRUTH_ORIF_EXPR]
12202 || name == ansi_opname [COMPOUND_EXPR]))
12203 cp_warning ("user-defined `%D' always evaluates both arguments",
12207 /* Effective C++ rule 23. */
12209 && list_length (argtypes) == 3
12210 && (name == ansi_opname [PLUS_EXPR]
12211 || name == ansi_opname [MINUS_EXPR]
12212 || name == ansi_opname [TRUNC_DIV_EXPR]
12213 || name == ansi_opname [MULT_EXPR])
12214 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
12215 cp_warning ("`%D' should return by value", decl);
12219 for (; argtypes != void_list_node ; argtypes = TREE_CHAIN (argtypes))
12220 if (TREE_PURPOSE (argtypes))
12222 TREE_PURPOSE (argtypes) = NULL_TREE;
12223 if (name == ansi_opname[(int) POSTINCREMENT_EXPR]
12224 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
12227 cp_pedwarn ("`%D' cannot have default arguments", decl);
12230 cp_error ("`%D' cannot have default arguments", decl);
12235 static const char *
12237 enum tag_types code;
12249 case signature_type:
12250 return "signature";
12252 my_friendly_abort (981122);
12256 /* Get the struct, enum or union (CODE says which) with tag NAME.
12257 Define the tag as a forward-reference if it is not defined.
12259 C++: If a class derivation is given, process it here, and report
12260 an error if multiple derivation declarations are not identical.
12262 If this is a definition, come in through xref_tag and only look in
12263 the current frame for the name (since C++ allows new names in any
12267 xref_tag (code_type_node, name, globalize)
12268 tree code_type_node;
12272 enum tag_types tag_code;
12273 enum tree_code code;
12275 register tree ref, t;
12276 struct binding_level *b = current_binding_level;
12278 tree attributes = NULL_TREE;
12280 /* If we are called from the parser, code_type_node will sometimes be a
12281 TREE_LIST. This indicates that the user wrote
12282 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12284 if (TREE_CODE (code_type_node) == TREE_LIST)
12286 attributes = TREE_PURPOSE (code_type_node);
12287 code_type_node = TREE_VALUE (code_type_node);
12290 tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
12295 case signature_type:
12296 code = RECORD_TYPE;
12302 code = ENUMERAL_TYPE;
12305 my_friendly_abort (18);
12308 /* If a cross reference is requested, look up the type
12309 already defined for this tag and return it. */
12310 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
12313 name = TYPE_IDENTIFIER (t);
12317 t = IDENTIFIER_TYPE_VALUE (name);
12319 if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12320 && TREE_CODE (t) != TEMPLATE_TEMPLATE_PARM)
12325 /* If we know we are defining this tag, only look it up in
12326 this scope and don't try to find it as a type. */
12327 ref = lookup_tag (code, name, b, 1);
12331 if (current_class_type
12332 && template_class_depth (current_class_type)
12333 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12334 /* Since GLOBALIZE is non-zero, we are not looking at a
12335 definition of this tag. Since, in addition, we are currently
12336 processing a (member) template declaration of a template
12337 class, we don't want to do any lookup at all; consider:
12344 { template <class V>
12345 friend struct S1; };
12347 Here, the S2::S1 declaration should not be confused with the
12348 outer declaration. In particular, the inner version should
12349 have a template parameter of level 2, not level 1. This
12350 would be particularly important if the member declaration
12353 template <class V = U> friend struct S1;
12355 say, when we should tsubst into `U' when instantiating S2. */
12361 /* [dcl.type.elab] If the identifier resolves to a
12362 typedef-name or a template type-parameter, the
12363 elaborated-type-specifier is ill-formed. */
12364 if (t != TYPE_MAIN_VARIANT (t)
12365 || (CLASS_TYPE_P (t) && TYPE_WAS_ANONYMOUS (t)))
12366 cp_pedwarn ("using typedef-name `%D' after `%s'",
12367 TYPE_NAME (t), tag_name (tag_code));
12368 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
12369 cp_error ("using template type parameter `%T' after `%s'",
12370 t, tag_name (tag_code));
12375 ref = lookup_tag (code, name, b, 0);
12379 /* Try finding it as a type declaration. If that wins,
12381 ref = lookup_name (name, 1);
12383 if (ref != NULL_TREE
12384 && processing_template_decl
12385 && DECL_CLASS_TEMPLATE_P (ref)
12386 && template_class_depth (current_class_type) == 0)
12387 /* Since GLOBALIZE is true, we're declaring a global
12388 template, so we want this type. */
12389 ref = DECL_RESULT (ref);
12391 if (ref && TREE_CODE (ref) == TYPE_DECL
12392 && TREE_CODE (TREE_TYPE (ref)) == code)
12393 ref = TREE_TYPE (ref);
12400 push_obstacks_nochange ();
12404 /* If no such tag is yet defined, create a forward-reference node
12405 and record it as the "definition".
12406 When a real declaration of this type is found,
12407 the forward-reference will be altered into a real type. */
12409 /* In C++, since these migrate into the global scope, we must
12410 build them on the permanent obstack. */
12412 temp = allocation_temporary_p ();
12414 end_temporary_allocation ();
12416 if (code == ENUMERAL_TYPE)
12418 cp_error ("use of enum `%#D' without previous declaration", name);
12420 ref = make_node (ENUMERAL_TYPE);
12422 /* Give the type a default layout like unsigned int
12423 to avoid crashing if it does not get defined. */
12424 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12425 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12426 TREE_UNSIGNED (ref) = 1;
12427 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12428 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12429 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12431 /* Enable us to recognize when a type is created in class context.
12432 To do nested classes correctly, this should probably be cleared
12433 out when we leave this classes scope. Currently this in only
12434 done in `start_enum'. */
12436 pushtag (name, ref, globalize);
12440 struct binding_level *old_b = class_binding_level;
12442 ref = make_lang_type (code);
12444 if (tag_code == signature_type)
12446 SET_SIGNATURE (ref);
12447 /* Since a signature type will be turned into the type
12448 of signature tables, it's not only an interface. */
12449 CLASSTYPE_INTERFACE_ONLY (ref) = 0;
12450 SET_CLASSTYPE_INTERFACE_KNOWN (ref);
12451 /* A signature doesn't have a vtable. */
12452 CLASSTYPE_VTABLE_NEEDS_WRITING (ref) = 0;
12455 #ifdef NONNESTED_CLASSES
12456 /* Class types don't nest the way enums do. */
12457 class_binding_level = (struct binding_level *)0;
12459 pushtag (name, ref, globalize);
12460 class_binding_level = old_b;
12465 /* If it no longer looks like a nested type, make sure it's
12467 If it is not an IDENTIFIER, this is not a declaration */
12468 if (b->namespace_p && !class_binding_level
12469 && TREE_CODE (name) == IDENTIFIER_NODE)
12471 if (IDENTIFIER_NAMESPACE_VALUE (name) == NULL_TREE)
12472 SET_IDENTIFIER_NAMESPACE_VALUE (name, TYPE_NAME (ref));
12475 if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12476 redeclare_class_template (ref, current_template_parms);
12479 /* Until the type is defined, tentatively accept whatever
12480 structure tag the user hands us. */
12481 if (TYPE_SIZE (ref) == NULL_TREE
12482 && ref != current_class_type
12483 /* Have to check this, in case we have contradictory tag info. */
12484 && IS_AGGR_TYPE_CODE (TREE_CODE (ref)))
12486 if (tag_code == class_type)
12487 CLASSTYPE_DECLARED_CLASS (ref) = 1;
12488 else if (tag_code == record_type || tag_code == signature_type)
12489 CLASSTYPE_DECLARED_CLASS (ref) = 0;
12494 TREE_TYPE (ref) = attributes;
12500 xref_tag_from_type (old, id, globalize)
12504 tree code_type_node;
12506 if (TREE_CODE (old) == RECORD_TYPE)
12507 code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12508 ? class_type_node : record_type_node);
12510 code_type_node = union_type_node;
12512 if (id == NULL_TREE)
12513 id = TYPE_IDENTIFIER (old);
12515 return xref_tag (code_type_node, id, globalize);
12518 /* REF is a type (named NAME), for which we have just seen some
12519 baseclasses. BINFO is a list of those baseclasses; the
12520 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12521 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12522 struct, or union. */
12525 xref_basetypes (code_type_node, name, ref, binfo)
12526 tree code_type_node;
12530 /* In the declaration `A : X, Y, ... Z' we mark all the types
12531 (A, X, Y, ..., Z) so we can check for duplicates. */
12536 enum tag_types tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
12538 if (tag_code == union_type)
12540 cp_error ("derived union `%T' invalid", ref);
12544 len = list_length (binfo);
12545 push_obstacks (TYPE_OBSTACK (ref), TYPE_OBSTACK (ref));
12547 /* First, make sure that any templates in base-classes are
12548 instantiated. This ensures that if we call ourselves recursively
12549 we do not get confused about which classes are marked and which
12551 for (base = binfo; base; base = TREE_CHAIN (base))
12552 complete_type (TREE_VALUE (base));
12554 SET_CLASSTYPE_MARKED (ref);
12555 BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
12557 for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
12559 /* The base of a derived struct is public by default. */
12561 = (TREE_PURPOSE (binfo) == access_public_node
12562 || TREE_PURPOSE (binfo) == access_public_virtual_node
12563 || (tag_code != class_type
12564 && (TREE_PURPOSE (binfo) == access_default_node
12565 || TREE_PURPOSE (binfo) == access_default_virtual_node)));
12567 = (TREE_PURPOSE (binfo) == access_protected_node
12568 || TREE_PURPOSE (binfo) == access_protected_virtual_node);
12570 = (TREE_PURPOSE (binfo) == access_private_virtual_node
12571 || TREE_PURPOSE (binfo) == access_protected_virtual_node
12572 || TREE_PURPOSE (binfo) == access_public_virtual_node
12573 || TREE_PURPOSE (binfo) == access_default_virtual_node);
12574 tree basetype = TREE_VALUE (binfo);
12577 if (basetype && TREE_CODE (basetype) == TYPE_DECL)
12578 basetype = TREE_TYPE (basetype);
12580 || (TREE_CODE (basetype) != RECORD_TYPE
12581 && TREE_CODE (basetype) != TYPENAME_TYPE
12582 && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
12583 && TREE_CODE (basetype) != TEMPLATE_TEMPLATE_PARM))
12585 cp_error ("base type `%T' fails to be a struct or class type",
12586 TREE_VALUE (binfo));
12590 GNU_xref_hier (name, basetype, via_public, via_virtual, 0);
12592 /* This code replaces similar code in layout_basetypes.
12593 We put the complete_type first for implicit `typename'. */
12594 if (TYPE_SIZE (basetype) == NULL_TREE
12595 && ! (current_template_parms && uses_template_parms (basetype)))
12597 cp_error ("base class `%T' has incomplete type", basetype);
12602 if (CLASSTYPE_MARKED (basetype))
12604 if (basetype == ref)
12605 cp_error ("recursive type `%T' undefined", basetype);
12607 cp_error ("duplicate base type `%T' invalid", basetype);
12611 if (TYPE_FOR_JAVA (basetype)
12612 && current_lang_stack == current_lang_base)
12613 TYPE_FOR_JAVA (ref) = 1;
12615 /* Note that the BINFO records which describe individual
12616 inheritances are *not* shared in the lattice! They
12617 cannot be shared because a given baseclass may be
12618 inherited with different `accessibility' by different
12619 derived classes. (Each BINFO record describing an
12620 individual inheritance contains flags which say what
12621 the `accessibility' of that particular inheritance is.) */
12624 = make_binfo (integer_zero_node, basetype,
12625 CLASS_TYPE_P (basetype)
12626 ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
12627 CLASS_TYPE_P (basetype)
12628 ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
12630 TREE_VEC_ELT (binfos, i) = base_binfo;
12631 TREE_VIA_PUBLIC (base_binfo) = via_public;
12632 TREE_VIA_PROTECTED (base_binfo) = via_protected;
12633 TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
12634 BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
12636 /* We need to unshare the binfos now so that lookups during class
12637 definition work. */
12638 unshare_base_binfos (base_binfo);
12640 SET_CLASSTYPE_MARKED (basetype);
12642 /* We are free to modify these bits because they are meaningless
12643 at top level, and BASETYPE is a top-level type. */
12644 if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
12646 TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
12647 TYPE_USES_COMPLEX_INHERITANCE (ref) = 1;
12650 if (CLASS_TYPE_P (basetype))
12652 TYPE_GETS_NEW (ref) |= TYPE_GETS_NEW (basetype);
12653 TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
12660 TREE_VEC_LENGTH (binfos) = i;
12662 BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
12665 TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
12668 tree basetype = BINFO_TYPE (TREE_VEC_ELT (binfos, 0));
12670 if (CLASS_TYPE_P (basetype))
12671 TYPE_USES_MULTIPLE_INHERITANCE (ref)
12672 = TYPE_USES_MULTIPLE_INHERITANCE (basetype);
12675 if (TYPE_USES_MULTIPLE_INHERITANCE (ref))
12676 TYPE_USES_COMPLEX_INHERITANCE (ref) = 1;
12678 /* Unmark all the types. */
12680 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
12681 CLEAR_CLASSTYPE_MARKED (ref);
12683 /* Now that we know all the base-classes, set up the list of virtual
12685 CLASSTYPE_VBASECLASSES (ref) = get_vbase_types (ref);
12691 /* Begin compiling the definition of an enumeration type.
12692 NAME is its name (or null if anonymous).
12693 Returns the type object, as yet incomplete.
12694 Also records info about it so that build_enumerator
12695 may be used to declare the individual values as they are read. */
12701 register tree enumtype = NULL_TREE;
12702 struct binding_level *b = current_binding_level;
12704 /* We are wasting space here and putting these on the permanent_obstack so
12705 that typeid(local enum) will work correctly. */
12706 push_obstacks (&permanent_obstack, &permanent_obstack);
12708 /* If this is the real definition for a previous forward reference,
12709 fill in the contents in the same object that used to be the
12710 forward reference. */
12712 if (name != NULL_TREE)
12713 enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
12715 if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
12716 cp_error ("multiple definition of `%#T'", enumtype);
12719 enumtype = make_node (ENUMERAL_TYPE);
12720 pushtag (name, enumtype, 0);
12723 if (current_class_type)
12724 TREE_ADDRESSABLE (b->tags) = 1;
12726 /* We don't copy this value because build_enumerator needs to do it. */
12727 enum_next_value = integer_zero_node;
12730 GNU_xref_decl (current_function_decl, enumtype);
12734 /* After processing and defining all the values of an enumeration type,
12735 install their decls in the enumeration type and finish it off.
12736 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12737 Returns ENUMTYPE. */
12740 finish_enum (enumtype)
12743 register tree minnode = NULL_TREE, maxnode = NULL_TREE;
12744 /* Calculate the maximum value of any enumerator in this type. */
12746 tree values = TYPE_VALUES (enumtype);
12751 for (pair = values; pair; pair = TREE_CHAIN (pair))
12756 /* The TREE_VALUE is a CONST_DECL for this enumeration
12758 decl = TREE_VALUE (pair);
12760 /* The DECL_INITIAL will be NULL if we are processing a
12761 template declaration and this enumeration constant had no
12762 explicit initializer. */
12763 value = DECL_INITIAL (decl);
12764 if (value && !processing_template_decl)
12766 /* Set the TREE_TYPE for the VALUE as well. That's so
12767 that when we call decl_constant_value we get an
12768 entity of the right type (but with the constant
12769 value). Since we shouldn't ever call
12770 decl_constant_value on a template type, there's no
12771 reason to do that when processing_template_decl.
12772 And, if the expression is something like a
12773 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12774 wreak havoc on the intended type of the expression.
12776 Of course, there's also no point in trying to compute
12777 minimum or maximum values if we're in a template. */
12778 TREE_TYPE (value) = enumtype;
12781 minnode = maxnode = value;
12782 else if (tree_int_cst_lt (maxnode, value))
12784 else if (tree_int_cst_lt (value, minnode))
12788 if (processing_template_decl)
12789 /* If this is just a template, leave the CONST_DECL
12790 alone. That way tsubst_copy will find CONST_DECLs for
12791 CONST_DECLs, and not INTEGER_CSTs. */
12794 /* In the list we're building up, we want the enumeration
12795 values, not the CONST_DECLs. */
12796 TREE_VALUE (pair) = value;
12800 maxnode = minnode = integer_zero_node;
12802 TYPE_VALUES (enumtype) = nreverse (values);
12804 if (processing_template_decl)
12806 tree scope = current_scope ();
12807 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12808 add_tree (build_min (TAG_DEFN, enumtype));
12812 int unsignedp = tree_int_cst_sgn (minnode) >= 0;
12813 int lowprec = min_precision (minnode, unsignedp);
12814 int highprec = min_precision (maxnode, unsignedp);
12815 int precision = MAX (lowprec, highprec);
12818 TYPE_SIZE (enumtype) = NULL_TREE;
12820 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12822 TYPE_PRECISION (enumtype) = precision;
12824 fixup_unsigned_type (enumtype);
12826 fixup_signed_type (enumtype);
12828 if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
12829 /* Use the width of the narrowest normal C type which is wide
12831 TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
12834 TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
12836 TYPE_SIZE (enumtype) = 0;
12837 layout_type (enumtype);
12839 /* Fix up all variant types of this enum type. */
12840 for (tem = TYPE_MAIN_VARIANT (enumtype); tem;
12841 tem = TYPE_NEXT_VARIANT (tem))
12843 TYPE_VALUES (tem) = TYPE_VALUES (enumtype);
12844 TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype);
12845 TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype);
12846 TYPE_SIZE (tem) = TYPE_SIZE (enumtype);
12847 TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype);
12848 TYPE_MODE (tem) = TYPE_MODE (enumtype);
12849 TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype);
12850 TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype);
12851 TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype);
12854 /* Finish debugging output for this type. */
12855 rest_of_type_compilation (enumtype, namespace_bindings_p ());
12858 /* In start_enum we pushed obstacks. Here, we must pop them. */
12864 /* Build and install a CONST_DECL for an enumeration constant of the
12865 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12866 Assignment of sequential values by default is handled here. */
12869 build_enumerator (name, value, type)
12877 /* Remove no-op casts from the value. */
12879 STRIP_TYPE_NOPS (value);
12881 if (! processing_template_decl)
12883 /* Validate and default VALUE. */
12884 if (value != NULL_TREE)
12886 if (TREE_READONLY_DECL_P (value))
12887 value = decl_constant_value (value);
12889 if (TREE_CODE (value) == INTEGER_CST)
12891 value = default_conversion (value);
12892 constant_expression_warning (value);
12896 cp_error ("enumerator value for `%D' not integer constant", name);
12901 /* Default based on previous value. */
12902 if (value == NULL_TREE && ! processing_template_decl)
12904 value = enum_next_value;
12906 cp_error ("overflow in enumeration values at `%D'", name);
12909 /* Remove no-op casts from the value. */
12911 STRIP_TYPE_NOPS (value);
12913 /* To fix MAX_VAL enum consts. (bkoz) */
12914 TREE_TYPE (value) = integer_type_node;
12918 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12919 Even in other cases, we will later (in finish_enum) be setting the
12921 if (value != NULL_TREE)
12922 value = copy_node (value);
12924 /* C++ associates enums with global, function, or class declarations. */
12926 context = current_scope ();
12927 if (context && context == current_class_type)
12928 /* This enum declaration is local to the class. */
12929 decl = build_lang_field_decl (CONST_DECL, name, type);
12931 /* It's a global enum, or it's local to a function. (Note local to
12932 a function could mean local to a class method. */
12933 decl = build_decl (CONST_DECL, name, type);
12935 DECL_CONTEXT (decl) = FROB_CONTEXT (context);
12936 DECL_INITIAL (decl) = value;
12937 TREE_READONLY (decl) = 1;
12939 if (context && context == current_class_type)
12940 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12941 on the TYPE_FIELDS list for `S'. (That's so that you can say
12942 things like `S::i' later.) */
12943 finish_member_declaration (decl);
12947 GNU_xref_decl (current_function_decl, decl);
12950 if (! processing_template_decl)
12952 /* Set basis for default for next value. */
12953 enum_next_value = build_binary_op_nodefault (PLUS_EXPR, value,
12954 integer_one_node, PLUS_EXPR);
12955 enum_overflow = tree_int_cst_lt (enum_next_value, value);
12958 result = saveable_tree_cons (name, decl, NULL_TREE);
12963 static int function_depth;
12965 /* Create the FUNCTION_DECL for a function definition.
12966 DECLSPECS and DECLARATOR are the parts of the declaration;
12967 they describe the function's name and the type it returns,
12968 but twisted together in a fashion that parallels the syntax of C.
12970 If PRE_PARSED_P is non-zero then DECLARATOR is really the DECL for
12971 the function we are about to process; DECLSPECS are ignored. For
12972 example, we set PRE_PARSED_P when processing the definition of
12973 inline function that was defined in-class; the definition is
12974 actually processed when the class is complete. In this case,
12975 PRE_PARSED_P is 2. We also set PRE_PARSED_P when instanting the
12976 body of a template function, and when constructing thunk functions
12977 and such; in these cases PRE_PARSED_P is 1.
12979 This function creates a binding context for the function body
12980 as well as setting up the FUNCTION_DECL in current_function_decl.
12982 Returns 1 on success. If the DECLARATOR is not suitable for a function
12983 (it defines a datum instead), we return 0, which tells
12984 yyparse to report a parse error.
12986 For C++, we must first check whether that datum makes any sense.
12987 For example, "class A local_a(1,2);" means that variable local_a
12988 is an aggregate of type A, which should have a constructor
12989 applied to it with the argument list [1, 2].
12991 @@ There is currently no way to retrieve the storage
12992 @@ allocated to FUNCTION (or all of its parms) if we return
12993 @@ something we had previously. */
12996 start_function (declspecs, declarator, attrs, pre_parsed_p)
12997 tree declspecs, declarator, attrs;
13001 tree ctype = NULL_TREE;
13004 extern int have_extern_spec;
13005 extern int used_extern_spec;
13006 int doing_friend = 0;
13008 /* Sanity check. */
13009 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
13010 my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
13012 /* Assume, until we see it does. */
13013 current_function_returns_value = 0;
13014 current_function_returns_null = 0;
13016 shadowed_labels = 0;
13017 current_function_assigns_this = 0;
13018 current_function_just_assigned_this = 0;
13019 current_function_parms_stored = 0;
13020 original_result_rtx = NULL_RTX;
13021 base_init_expr = NULL_TREE;
13022 current_base_init_list = NULL_TREE;
13023 current_member_init_list = NULL_TREE;
13024 ctor_label = dtor_label = NULL_TREE;
13025 static_labelno = 0;
13027 clear_temp_name ();
13029 /* This should only be done once on the top most decl. */
13030 if (have_extern_spec && !used_extern_spec)
13032 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
13033 used_extern_spec = 1;
13038 decl1 = declarator;
13041 /* What was this testing for, exactly? */
13042 if (! DECL_ARGUMENTS (decl1)
13043 && !DECL_STATIC_FUNCTION_P (decl1)
13044 && !DECL_ARTIFICIAL (decl1)
13045 && DECL_CLASS_SCOPE_P (decl1)
13046 && TYPE_IDENTIFIER (DECL_CONTEXT (decl1))
13047 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (DECL_CONTEXT (decl1))))
13049 tree binding = binding_for_name (DECL_NAME (decl1),
13050 current_namespace);
13051 cp_error ("redeclaration of `%#D'", decl1);
13052 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1)))
13053 cp_error_at ("previous declaration here", IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1)));
13054 else if (BINDING_VALUE (binding))
13055 cp_error_at ("previous declaration here", BINDING_VALUE (binding));
13059 fntype = TREE_TYPE (decl1);
13060 if (TREE_CODE (fntype) == METHOD_TYPE)
13061 ctype = TYPE_METHOD_BASETYPE (fntype);
13063 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
13064 class is in the (lexical) scope of the class in which it is
13066 if (!ctype && DECL_FRIEND_P (decl1))
13068 ctype = DECL_CLASS_CONTEXT (decl1);
13070 /* CTYPE could be null here if we're dealing with a template;
13071 for example, `inline friend float foo()' inside a template
13072 will have no CTYPE set. */
13073 if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
13079 last_function_parms = DECL_ARGUMENTS (decl1);
13080 last_function_parm_tags = NULL_TREE;
13084 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE);
13085 /* If the declarator is not suitable for a function definition,
13086 cause a syntax error. */
13087 if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0;
13089 fntype = TREE_TYPE (decl1);
13091 restype = TREE_TYPE (fntype);
13092 if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
13094 cp_error ("semicolon missing after declaration of `%#T'", restype);
13095 shadow_tag (build_expr_list (NULL_TREE, restype));
13096 CLASSTYPE_GOT_SEMICOLON (restype) = 1;
13097 if (TREE_CODE (fntype) == FUNCTION_TYPE)
13098 fntype = build_function_type (integer_type_node,
13099 TYPE_ARG_TYPES (fntype));
13101 fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
13103 TYPE_ARG_TYPES (fntype));
13104 TREE_TYPE (decl1) = fntype;
13107 if (TREE_CODE (fntype) == METHOD_TYPE)
13108 ctype = TYPE_METHOD_BASETYPE (fntype);
13109 else if (DECL_MAIN_P (decl1))
13111 /* If this doesn't return integer_type, complain. */
13112 if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
13114 if (pedantic || warn_return_type)
13115 pedwarn ("return type for `main' changed to `int'");
13116 TREE_TYPE (decl1) = fntype = default_function_type;
13121 /* Warn if function was previously implicitly declared
13122 (but not if we warned then). */
13123 if (! warn_implicit
13124 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
13125 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
13127 announce_function (decl1);
13129 /* Set up current_class_type, and enter the scope of the class, if
13132 push_nested_class (ctype, 1);
13133 else if (DECL_STATIC_FUNCTION_P (decl1))
13134 push_nested_class (DECL_CONTEXT (decl1), 2);
13136 /* Now that we have entered the scope of the class, we must restore
13137 the bindings for any template parameters surrounding DECL1, if it
13138 is an inline member template. (Order is important; consider the
13139 case where a template parameter has the same name as a field of
13140 the class.) It is not until after this point that
13141 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13142 if (pre_parsed_p == 2)
13143 maybe_begin_member_template_processing (decl1);
13145 /* We are now in the scope of the function being defined. */
13146 current_function_decl = decl1;
13148 /* Save the parm names or decls from this function's declarator
13149 where store_parm_decls will find them. */
13150 current_function_parms = last_function_parms;
13151 current_function_parm_tags = last_function_parm_tags;
13153 if (! processing_template_decl)
13155 /* In a function definition, arg types must be complete. */
13156 require_complete_types_for_parms (current_function_parms);
13158 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype))) == NULL_TREE)
13160 cp_error ("return-type `%#T' is an incomplete type",
13161 TREE_TYPE (fntype));
13163 /* Make it return void instead, but don't change the
13164 type of the DECL_RESULT, in case we have a named return value. */
13167 = build_cplus_method_type (build_type_variant (ctype,
13168 TREE_READONLY (decl1),
13169 TREE_SIDE_EFFECTS (decl1)),
13171 FUNCTION_ARG_CHAIN (decl1));
13174 = build_function_type (void_type_node,
13175 TYPE_ARG_TYPES (TREE_TYPE (decl1)));
13176 DECL_RESULT (decl1)
13177 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype)));
13178 TREE_READONLY (DECL_RESULT (decl1))
13179 = CP_TYPE_CONST_P (TREE_TYPE (fntype));
13180 TREE_THIS_VOLATILE (DECL_RESULT (decl1))
13181 = CP_TYPE_VOLATILE_P (TREE_TYPE (fntype));
13184 if (TYPE_LANG_SPECIFIC (TREE_TYPE (fntype))
13185 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (fntype)))
13186 abstract_virtuals_error (decl1, TREE_TYPE (fntype));
13189 /* Effective C++ rule 15. See also c_expand_return. */
13191 && DECL_NAME (decl1) == ansi_opname[(int) MODIFY_EXPR]
13192 && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
13193 cp_warning ("`operator=' should return a reference to `*this'");
13195 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13196 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13197 DECL_INITIAL (decl1) = error_mark_node;
13199 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13200 SET_DEFAULT_DECL_ATTRIBUTES (decl1, attrs);
13203 /* This function exists in static storage.
13204 (This does not mean `static' in the C sense!) */
13205 TREE_STATIC (decl1) = 1;
13207 /* We must call push_template_decl after current_class_type is set
13208 up. (If we are processing inline definitions after exiting a
13209 class scope, current_class_type will be NULL_TREE until set above
13210 by push_nested_class.) */
13211 if (processing_template_decl)
13212 decl1 = push_template_decl (decl1);
13214 /* Record the decl so that the function name is defined.
13215 If we already have a decl for this name, and it is a FUNCTION_DECL,
13216 use the old decl. */
13217 if (!processing_template_decl && pre_parsed_p == 0)
13219 /* A specialization is not used to guide overload resolution. */
13220 if ((flag_guiding_decls
13221 || !DECL_TEMPLATE_SPECIALIZATION (decl1))
13222 && ! DECL_FUNCTION_MEMBER_P (decl1))
13223 decl1 = pushdecl (decl1);
13226 /* We need to set the DECL_CONTEXT. */
13227 if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
13228 DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
13229 /* And make sure we have enough default args. */
13230 check_default_args (decl1);
13232 DECL_MAIN_VARIANT (decl1) = decl1;
13233 fntype = TREE_TYPE (decl1);
13236 current_function_decl = decl1;
13238 if (DECL_INTERFACE_KNOWN (decl1))
13240 tree ctx = hack_decl_function_context (decl1);
13242 if (DECL_NOT_REALLY_EXTERN (decl1))
13243 DECL_EXTERNAL (decl1) = 0;
13245 if (ctx != NULL_TREE && DECL_THIS_INLINE (ctx)
13246 && TREE_PUBLIC (ctx))
13247 /* This is a function in a local class in an extern inline
13249 comdat_linkage (decl1);
13251 /* If this function belongs to an interface, it is public.
13252 If it belongs to someone else's interface, it is also external.
13253 This only affects inlines and template instantiations. */
13254 else if (interface_unknown == 0
13255 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13256 || flag_alt_external_templates))
13258 if (DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1)
13259 || processing_template_decl)
13261 DECL_EXTERNAL (decl1)
13263 || (DECL_THIS_INLINE (decl1) && ! flag_implement_inlines
13264 && !DECL_VINDEX (decl1)));
13266 /* For WIN32 we also want to put these in linkonce sections. */
13267 maybe_make_one_only (decl1);
13270 DECL_EXTERNAL (decl1) = 0;
13271 DECL_NOT_REALLY_EXTERN (decl1) = 0;
13272 DECL_INTERFACE_KNOWN (decl1) = 1;
13274 else if (interface_unknown && interface_only
13275 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13276 || flag_alt_external_templates))
13278 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13279 interface, we will have interface_only set but not
13280 interface_known. In that case, we don't want to use the normal
13281 heuristics because someone will supply a #pragma implementation
13282 elsewhere, and deducing it here would produce a conflict. */
13283 comdat_linkage (decl1);
13284 DECL_EXTERNAL (decl1) = 0;
13285 DECL_INTERFACE_KNOWN (decl1) = 1;
13286 DECL_DEFER_OUTPUT (decl1) = 1;
13290 /* This is a definition, not a reference.
13291 So clear DECL_EXTERNAL. */
13292 DECL_EXTERNAL (decl1) = 0;
13294 if ((DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1))
13295 && ! DECL_INTERFACE_KNOWN (decl1)
13296 /* Don't try to defer nested functions for now. */
13297 && ! hack_decl_function_context (decl1))
13298 DECL_DEFER_OUTPUT (decl1) = 1;
13300 DECL_INTERFACE_KNOWN (decl1) = 1;
13303 if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1))
13305 if (TREE_CODE (fntype) == METHOD_TYPE)
13306 TREE_TYPE (decl1) = fntype
13307 = build_function_type (TREE_TYPE (fntype),
13308 TREE_CHAIN (TYPE_ARG_TYPES (fntype)));
13309 current_function_parms = TREE_CHAIN (current_function_parms);
13310 DECL_ARGUMENTS (decl1) = current_function_parms;
13313 restype = TREE_TYPE (fntype);
13317 /* If we're compiling a friend function, neither of the variables
13318 current_class_ptr nor current_class_type will have values. */
13319 if (! doing_friend)
13321 /* We know that this was set up by `grokclassfn'.
13322 We do not wait until `store_parm_decls', since evil
13323 parse errors may never get us to that point. Here
13324 we keep the consistency between `current_class_type'
13325 and `current_class_ptr'. */
13326 tree t = current_function_parms;
13328 my_friendly_assert (t != NULL_TREE
13329 && TREE_CODE (t) == PARM_DECL, 162);
13331 if (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE)
13335 if (! hack_decl_function_context (decl1))
13336 temporary_allocation ();
13337 i = suspend_momentary ();
13339 /* Normally, build_indirect_ref returns
13340 current_class_ref whenever current_class_ptr is
13341 dereferenced. This time, however, we want it to
13342 *create* current_class_ref, so we temporarily clear
13343 current_class_ptr to fool it. */
13344 current_class_ptr = NULL_TREE;
13345 current_class_ref = build_indirect_ref (t, NULL_PTR);
13346 current_class_ptr = t;
13348 resume_momentary (i);
13349 if (! hack_decl_function_context (decl1))
13350 end_temporary_allocation ();
13353 /* We're having a signature pointer here. */
13354 current_class_ref = current_class_ptr = t;
13359 current_class_ptr = current_class_ref = NULL_TREE;
13362 current_binding_level->parm_flag = 1;
13364 GNU_xref_function (decl1, current_function_parms);
13367 cplus_decl_attributes (decl1, NULL_TREE, attrs);
13369 make_function_rtl (decl1);
13371 /* Promote the value to int before returning it. */
13372 if (C_PROMOTING_INTEGER_TYPE_P (restype))
13373 restype = type_promotes_to (restype);
13375 /* If this fcn was already referenced via a block-scope `extern' decl
13376 (or an implicit decl), propagate certain information about the usage. */
13377 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1)))
13378 TREE_ADDRESSABLE (decl1) = 1;
13380 if (DECL_RESULT (decl1) == NULL_TREE)
13382 DECL_RESULT (decl1)
13383 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13384 TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype);
13385 TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype);
13388 /* Allocate further tree nodes temporarily during compilation
13389 of this function only. Tiemann moved up here from bottom of fn. */
13390 /* If this is a nested function, then we must continue to allocate RTL
13391 on the permanent obstack in case we need to inline it later. */
13392 if (! hack_decl_function_context (decl1))
13393 temporary_allocation ();
13395 if (processing_template_decl)
13397 ++minimal_parse_mode;
13398 last_tree = DECL_SAVED_TREE (decl1)
13399 = build_nt (EXPR_STMT, void_zero_node);
13404 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1))
13405 && DECL_LANGUAGE (decl1) == lang_cplusplus)
13407 dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13408 ctor_label = NULL_TREE;
13412 dtor_label = NULL_TREE;
13413 if (DECL_CONSTRUCTOR_P (decl1))
13414 ctor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13420 /* Called after store_parm_decls for a function-try-block. We need to update
13421 last_parm_cleanup_insn so that the base initializers for a constructor
13422 are run within this block, not before it. */
13425 expand_start_early_try_stmts ()
13427 expand_start_try_stmts ();
13428 last_parm_cleanup_insn = get_last_insn ();
13431 /* Store the parameter declarations into the current function declaration.
13432 This is called after parsing the parameter declarations, before
13433 digesting the body of the function.
13435 Also install to binding contour return value identifier, if any. */
13438 store_parm_decls ()
13440 register tree fndecl = current_function_decl;
13441 register tree parm;
13442 int parms_have_cleanups = 0;
13443 tree cleanups = NULL_TREE;
13445 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13446 tree specparms = current_function_parms;
13448 /* This is a list of types declared among parms in a prototype. */
13449 tree parmtags = current_function_parm_tags;
13451 /* This is a chain of any other decls that came in among the parm
13452 declarations. If a parm is declared with enum {foo, bar} x;
13453 then CONST_DECLs for foo and bar are put here. */
13454 tree nonparms = NULL_TREE;
13456 if (toplevel_bindings_p ())
13457 fatal ("parse errors have confused me too much");
13459 /* Initialize RTL machinery. */
13460 init_function_start (fndecl, input_filename, lineno);
13462 /* Create a binding level for the parms. */
13463 expand_start_bindings (0);
13465 if (specparms != NULL_TREE)
13467 /* This case is when the function was defined with an ANSI prototype.
13468 The parms already have decls, so we need not do anything here
13469 except record them as in effect
13470 and complain if any redundant old-style parm decls were written. */
13472 register tree next;
13474 /* Must clear this because it might contain TYPE_DECLs declared
13476 storedecls (NULL_TREE);
13478 for (parm = nreverse (specparms); parm; parm = next)
13480 next = TREE_CHAIN (parm);
13481 if (TREE_CODE (parm) == PARM_DECL)
13484 if (DECL_NAME (parm) == NULL_TREE)
13488 else if (TREE_CODE (TREE_TYPE (parm)) == VOID_TYPE)
13489 cp_error ("parameter `%D' declared void", parm);
13492 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
13493 A parameter is assumed not to have any side effects.
13494 If this should change for any reason, then this
13495 will have to wrap the bashed reference type in a save_expr.
13497 Also, if the parameter type is declared to be an X
13498 and there is an X(X&) constructor, we cannot lay it
13499 into the stack (any more), so we make this parameter
13500 look like it is really of reference type. Functions
13501 which pass parameters to this function will know to
13502 create a temporary in their frame, and pass a reference
13505 if (TREE_CODE (TREE_TYPE (parm)) == REFERENCE_TYPE
13506 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm))))
13507 SET_DECL_REFERENCE_SLOT (parm, convert_from_reference (parm));
13511 if (! processing_template_decl
13512 && (cleanup = maybe_build_cleanup (parm), cleanup))
13514 expand_decl (parm);
13515 parms_have_cleanups = 1;
13517 /* Keep track of the cleanups. */
13518 cleanups = tree_cons (parm, cleanup, cleanups);
13523 /* If we find an enum constant or a type tag,
13524 put it aside for the moment. */
13525 TREE_CHAIN (parm) = NULL_TREE;
13526 nonparms = chainon (nonparms, parm);
13530 /* Get the decls in their original chain order
13531 and record in the function. This is all and only the
13532 PARM_DECLs that were pushed into scope by the loop above. */
13533 DECL_ARGUMENTS (fndecl) = getdecls ();
13535 storetags (chainon (parmtags, gettags ()));
13538 DECL_ARGUMENTS (fndecl) = NULL_TREE;
13540 /* Now store the final chain of decls for the arguments
13541 as the decl-chain of the current lexical scope.
13542 Put the enumerators in as well, at the front so that
13543 DECL_ARGUMENTS is not modified. */
13545 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13547 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
13548 declare_function_name ();
13550 /* Initialize the RTL code for the function. */
13551 DECL_SAVED_INSNS (fndecl) = NULL_RTX;
13552 if (! processing_template_decl)
13553 expand_function_start (fndecl, parms_have_cleanups);
13555 current_function_parms_stored = 1;
13557 /* If this function is `main', emit a call to `__main'
13558 to run global initializers, etc. */
13559 if (DECL_MAIN_P (fndecl))
13560 expand_main_function ();
13562 /* Now that we have initialized the parms, we can start their
13563 cleanups. We cannot do this before, since expand_decl_cleanup
13564 should not be called before the parm can be used. */
13566 && ! processing_template_decl)
13568 for (cleanups = nreverse (cleanups); cleanups; cleanups = TREE_CHAIN (cleanups))
13570 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups), TREE_VALUE (cleanups)))
13571 cp_error ("parser lost in parsing declaration of `%D'",
13572 TREE_PURPOSE (cleanups));
13576 /* Create a binding contour which can be used to catch
13577 cleanup-generated temporaries. Also, if the return value needs or
13578 has initialization, deal with that now. */
13579 if (parms_have_cleanups)
13582 expand_start_bindings (0);
13585 if (! processing_template_decl && flag_exceptions)
13587 /* Do the starting of the exception specifications, if we have any. */
13588 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13589 expand_start_eh_spec ();
13592 last_parm_cleanup_insn = get_last_insn ();
13593 last_dtor_insn = get_last_insn ();
13596 /* Bind a name and initialization to the return value of
13597 the current function. */
13600 store_return_init (return_id, init)
13601 tree return_id, init;
13603 tree decl = DECL_RESULT (current_function_decl);
13606 /* Give this error as many times as there are occurrences,
13607 so that users can use Emacs compilation buffers to find
13608 and fix all such places. */
13609 pedwarn ("ANSI C++ does not permit named return values");
13611 if (return_id != NULL_TREE)
13613 if (DECL_NAME (decl) == NULL_TREE)
13615 DECL_NAME (decl) = return_id;
13616 DECL_ASSEMBLER_NAME (decl) = return_id;
13619 cp_error ("return identifier `%D' already in place", decl);
13622 /* Can't let this happen for constructors. */
13623 if (DECL_CONSTRUCTOR_P (current_function_decl))
13625 error ("can't redefine default return value for constructors");
13629 /* If we have a named return value, put that in our scope as well. */
13630 if (DECL_NAME (decl) != NULL_TREE)
13632 /* If this named return value comes in a register,
13633 put it in a pseudo-register. */
13634 if (DECL_REGISTER (decl))
13636 original_result_rtx = DECL_RTL (decl);
13637 DECL_RTL (decl) = gen_reg_rtx (DECL_MODE (decl));
13640 /* Let `cp_finish_decl' know that this initializer is ok. */
13641 DECL_INITIAL (decl) = init;
13644 if (minimal_parse_mode)
13645 add_tree (build_min_nt (RETURN_INIT, return_id,
13646 copy_to_permanent (init)));
13648 cp_finish_decl (decl, init, NULL_TREE, 0, 0);
13653 /* Finish up a function declaration and compile that function
13654 all the way to assembler language output. The free the storage
13655 for the function definition.
13657 This is called after parsing the body of the function definition.
13658 LINENO is the current line number.
13660 FLAGS is a bitwise or of the following values:
13662 An extra call to poplevel (and expand_end_bindings) must be
13663 made to take care of the binding contour for the base
13664 initializers. This is only relevant for constructors.
13666 We just finished processing the body of an in-class inline
13667 function definition. (This processing will have taken place
13668 after the class definition is complete.)
13670 NESTED is nonzero if we were in the middle of compiling another function
13671 when we started on this one. */
13674 finish_function (lineno, flags, nested)
13679 register tree fndecl = current_function_decl;
13680 tree fntype, ctype = NULL_TREE;
13681 rtx last_parm_insn, insns;
13682 /* Label to use if this function is supposed to return a value. */
13683 tree no_return_label = NULL_TREE;
13684 tree decls = NULL_TREE;
13685 int call_poplevel = (flags & 1) != 0;
13686 int inclass_inline = (flags & 2) != 0;
13689 /* When we get some parse errors, we can end up without a
13690 current_function_decl, so cope. */
13691 if (fndecl == NULL_TREE)
13694 if (! nested && function_depth > 1)
13697 fntype = TREE_TYPE (fndecl);
13699 /* TREE_READONLY (fndecl) = 1;
13700 This caused &foo to be of type ptr-to-const-function
13701 which then got a warning when stored in a ptr-to-function variable. */
13703 /* This happens on strange parse errors. */
13704 if (! current_function_parms_stored)
13707 store_parm_decls ();
13710 if (processing_template_decl)
13712 if (DECL_CONSTRUCTOR_P (fndecl) && call_poplevel)
13714 decls = getdecls ();
13715 expand_end_bindings (decls, decls != NULL_TREE, 0);
13716 poplevel (decls != NULL_TREE, 0, 0);
13721 if (write_symbols != NO_DEBUG /*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13723 tree ttype = target_type (fntype);
13726 if (IS_AGGR_TYPE (ttype))
13727 /* Let debugger know it should output info for this type. */
13728 note_debug_info_needed (ttype);
13730 for (parmdecl = DECL_ARGUMENTS (fndecl); parmdecl; parmdecl = TREE_CHAIN (parmdecl))
13732 ttype = target_type (TREE_TYPE (parmdecl));
13733 if (IS_AGGR_TYPE (ttype))
13734 /* Let debugger know it should output info for this type. */
13735 note_debug_info_needed (ttype);
13739 /* Clean house because we will need to reorder insns here. */
13740 do_pending_stack_adjust ();
13744 tree binfo = TYPE_BINFO (current_class_type);
13745 tree cond = integer_one_node;
13747 tree in_charge_node = lookup_name (in_charge_identifier, 0);
13749 int ok_to_optimize_dtor = 0;
13750 int empty_dtor = get_last_insn () == last_dtor_insn;
13752 if (current_function_assigns_this)
13753 cond = build (NE_EXPR, boolean_type_node,
13754 current_class_ptr, integer_zero_node);
13757 int n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
13759 /* If this destructor is empty, then we don't need to check
13760 whether `this' is NULL in some cases. */
13761 if ((flag_this_is_variable & 1) == 0)
13762 ok_to_optimize_dtor = 1;
13763 else if (empty_dtor)
13764 ok_to_optimize_dtor
13765 = (n_baseclasses == 0
13766 || (n_baseclasses == 1
13767 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type, 0))));
13770 /* These initializations might go inline. Protect
13771 the binding level of the parms. */
13773 expand_start_bindings (0);
13775 if (current_function_assigns_this)
13777 current_function_assigns_this = 0;
13778 current_function_just_assigned_this = 0;
13781 /* Generate the code to call destructor on base class.
13782 If this destructor belongs to a class with virtual
13783 functions, then set the virtual function table
13784 pointer to represent the type of our base class. */
13786 /* This side-effect makes call to `build_delete' generate the
13787 code we have to have at the end of this destructor.
13788 `build_delete' will set the flag again. */
13789 TYPE_HAS_DESTRUCTOR (current_class_type) = 0;
13791 /* These are two cases where we cannot delegate deletion. */
13792 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)
13793 || TYPE_GETS_REG_DELETE (current_class_type))
13794 exprstmt = build_delete (current_class_type, current_class_ref, integer_zero_node,
13795 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL, 0);
13797 exprstmt = build_delete (current_class_type, current_class_ref, in_charge_node,
13798 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL, 0);
13800 /* If we did not assign to this, then `this' is non-zero at
13801 the end of a destructor. As a special optimization, don't
13802 emit test if this is an empty destructor. If it does nothing,
13803 it does nothing. If it calls a base destructor, the base
13804 destructor will perform the test. */
13806 if (exprstmt != error_mark_node
13807 && (TREE_CODE (exprstmt) != NOP_EXPR
13808 || TREE_OPERAND (exprstmt, 0) != integer_zero_node
13809 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)))
13811 expand_label (dtor_label);
13812 if (cond != integer_one_node)
13813 expand_start_cond (cond, 0);
13814 if (exprstmt != void_zero_node)
13815 /* Don't call `expand_expr_stmt' if we're not going to do
13816 anything, since -Wall will give a diagnostic. */
13817 expand_expr_stmt (exprstmt);
13819 /* Run destructor on all virtual baseclasses. */
13820 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13822 tree vbases = nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type)));
13823 expand_start_cond (build (BIT_AND_EXPR, integer_type_node,
13824 in_charge_node, integer_two_node), 0);
13827 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases)))
13829 tree vb = get_vbase
13830 (BINFO_TYPE (vbases),
13831 TYPE_BINFO (current_class_type));
13833 (build_scoped_method_call
13834 (current_class_ref, vb, dtor_identifier,
13835 build_expr_list (NULL_TREE, integer_zero_node)));
13837 vbases = TREE_CHAIN (vbases);
13839 expand_end_cond ();
13842 do_pending_stack_adjust ();
13843 if (cond != integer_one_node)
13844 expand_end_cond ();
13847 virtual_size = c_sizeof (current_class_type);
13849 /* At the end, call delete if that's what's requested. */
13851 /* FDIS sez: At the point of definition of a virtual destructor
13852 (including an implicit definition), non-placement operator
13853 delete shall be looked up in the scope of the destructor's
13854 class and if found shall be accessible and unambiguous.
13856 This is somewhat unclear, but I take it to mean that if the
13857 class only defines placement deletes we don't do anything here.
13858 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13859 for us if they ever try to delete one of these. */
13861 if (TYPE_GETS_REG_DELETE (current_class_type)
13862 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13863 exprstmt = build_op_delete_call
13864 (DELETE_EXPR, current_class_ptr, virtual_size,
13865 LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
13867 exprstmt = NULL_TREE;
13871 cond = build (BIT_AND_EXPR, integer_type_node,
13872 in_charge_node, integer_one_node);
13873 expand_start_cond (cond, 0);
13874 expand_expr_stmt (exprstmt);
13875 expand_end_cond ();
13878 /* End of destructor. */
13879 expand_end_bindings (NULL_TREE, getdecls () != NULL_TREE, 0);
13880 poplevel (getdecls () != NULL_TREE, 0, 0);
13882 /* Back to the top of destructor. */
13883 /* Don't execute destructor code if `this' is NULL. */
13887 /* If the dtor is empty, and we know there is not possible way we
13888 could use any vtable entries, before they are possibly set by
13889 a base class dtor, we don't have to setup the vtables, as we
13890 know that any base class dtoring will set up any vtables it
13891 needs. We avoid MI, because one base class dtor can do a
13892 virtual dispatch to an overridden function that would need to
13893 have a non-related vtable set up, we cannot avoid setting up
13894 vtables in that case. We could change this to see if there is
13895 just one vtable. */
13896 if (! empty_dtor || TYPE_USES_COMPLEX_INHERITANCE (current_class_type))
13898 /* Make all virtual function table pointers in non-virtual base
13899 classes point to CURRENT_CLASS_TYPE's virtual function
13901 expand_direct_vtbls_init (binfo, binfo, 1, 0, current_class_ptr);
13903 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13904 expand_indirect_vtbls_init (binfo, current_class_ref, current_class_ptr);
13907 if (! ok_to_optimize_dtor)
13909 cond = build_binary_op (NE_EXPR,
13910 current_class_ptr, integer_zero_node, 1);
13911 expand_start_cond (cond, 0);
13914 insns = get_insns ();
13917 last_parm_insn = get_first_nonparm_insn ();
13918 if (last_parm_insn == NULL_RTX)
13919 last_parm_insn = get_last_insn ();
13921 last_parm_insn = previous_insn (last_parm_insn);
13923 emit_insns_after (insns, last_parm_insn);
13925 if (! ok_to_optimize_dtor)
13926 expand_end_cond ();
13928 else if (current_function_assigns_this)
13930 /* Does not need to call emit_base_init, because
13931 that is done (if needed) just after assignment to this
13934 if (DECL_CONSTRUCTOR_P (current_function_decl))
13936 end_protect_partials ();
13937 expand_label (ctor_label);
13938 ctor_label = NULL_TREE;
13942 decls = getdecls ();
13943 expand_end_bindings (decls, decls != NULL_TREE, 0);
13944 poplevel (decls != NULL_TREE, 0, 0);
13946 /* c_expand_return knows to return 'this' from a constructor. */
13947 c_expand_return (NULL_TREE);
13949 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl))) != VOID_TYPE
13950 && return_label != NULL_RTX)
13951 no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13953 current_function_assigns_this = 0;
13954 current_function_just_assigned_this = 0;
13955 base_init_expr = NULL_TREE;
13957 else if (DECL_CONSTRUCTOR_P (fndecl))
13959 tree cond = NULL_TREE, thenclause = NULL_TREE;
13960 /* Allow constructor for a type to get a new instance of the object
13961 using `build_new'. */
13962 tree abstract_virtuals = CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type);
13963 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type) = NULL_TREE;
13965 DECL_RETURNS_FIRST_ARG (fndecl) = 1;
13967 if (flag_this_is_variable > 0)
13969 cond = build_binary_op (EQ_EXPR,
13970 current_class_ptr, integer_zero_node, 1);
13971 thenclause = build_modify_expr (current_class_ptr, NOP_EXPR,
13972 build_new (NULL_TREE, current_class_type, void_type_node, 0));
13975 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type) = abstract_virtuals;
13979 if (flag_this_is_variable > 0)
13981 expand_start_cond (cond, 0);
13982 expand_expr_stmt (thenclause);
13983 expand_end_cond ();
13986 /* Emit insns from `emit_base_init' which sets up virtual
13987 function table pointer(s). */
13988 if (base_init_expr)
13990 expand_expr_stmt (base_init_expr);
13991 base_init_expr = NULL_TREE;
13994 insns = get_insns ();
13997 /* This is where the body of the constructor begins. */
13999 emit_insns_after (insns, last_parm_cleanup_insn);
14001 end_protect_partials ();
14003 /* This is where the body of the constructor ends. */
14004 expand_label (ctor_label);
14005 ctor_label = NULL_TREE;
14009 decls = getdecls ();
14010 expand_end_bindings (decls, decls != NULL_TREE, 0);
14011 poplevel (decls != NULL_TREE, 1, 0);
14014 /* c_expand_return knows to return 'this' from a constructor. */
14015 c_expand_return (NULL_TREE);
14017 current_function_assigns_this = 0;
14018 current_function_just_assigned_this = 0;
14020 else if (DECL_MAIN_P (fndecl))
14022 /* Make it so that `main' always returns 0 by default. */
14024 c_expand_return (integer_one_node);
14026 c_expand_return (integer_zero_node);
14029 else if (return_label != NULL_RTX
14030 && current_function_return_value == NULL_TREE
14031 && ! DECL_NAME (DECL_RESULT (current_function_decl)))
14032 no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
14034 if (flag_exceptions)
14035 expand_exception_blocks ();
14037 /* If this function is supposed to return a value, ensure that
14038 we do not fall into the cleanups by mistake. The end of our
14039 function will look like this:
14041 user code (may have return stmt somewhere)
14042 goto no_return_label
14047 NOTE_INSN_FUNCTION_END
14051 If the user omits a return stmt in the USER CODE section, we
14052 will have a control path which reaches NOTE_INSN_FUNCTION_END.
14053 Otherwise, we won't. */
14054 if (no_return_label)
14056 DECL_CONTEXT (no_return_label) = fndecl;
14057 DECL_INITIAL (no_return_label) = error_mark_node;
14058 DECL_SOURCE_FILE (no_return_label) = input_filename;
14059 DECL_SOURCE_LINE (no_return_label) = lineno;
14060 expand_goto (no_return_label);
14065 /* Remove the binding contour which is used
14066 to catch cleanup-generated temporaries. */
14067 expand_end_bindings (0, 0, 0);
14068 poplevel (0, 0, 0);
14070 /* Emit label at beginning of cleanup code for parameters. */
14071 emit_label (cleanup_label);
14074 /* Get return value into register if that's where it's supposed to be. */
14075 if (original_result_rtx)
14076 fixup_result_decl (DECL_RESULT (fndecl), original_result_rtx);
14078 /* Finish building code that will trigger warnings if users forget
14079 to make their functions return values. */
14080 if (no_return_label || cleanup_label)
14081 emit_jump (return_label);
14082 if (no_return_label)
14084 /* We don't need to call `expand_*_return' here because we
14085 don't need any cleanups here--this path of code is only
14086 for error checking purposes. */
14087 expand_label (no_return_label);
14090 /* Generate rtl for function exit. */
14091 expand_function_end (input_filename, lineno, 1);
14094 /* If we're processing a template, squirrel away the definition
14095 until we do an instantiation. */
14096 if (processing_template_decl)
14098 --minimal_parse_mode;
14099 DECL_SAVED_TREE (fndecl) = TREE_CHAIN (DECL_SAVED_TREE (fndecl));
14100 /* We have to save this value here in case
14101 maybe_end_member_template_processing decides to pop all the
14102 template parameters. */
14108 /* This must come after expand_function_end because cleanups might
14109 have declarations (from inline functions) that need to go into
14110 this function's blocks. */
14111 if (current_binding_level->parm_flag != 1)
14112 my_friendly_abort (122);
14113 poplevel (1, 0, 1);
14115 /* If this is a in-class inline definition, we may have to pop the
14116 bindings for the template parameters that we added in
14117 maybe_begin_member_template_processing when start_function was
14119 if (inclass_inline)
14120 maybe_end_member_template_processing ();
14122 /* Reset scope for C++: if we were in the scope of a class,
14123 then when we finish this function, we are not longer so.
14124 This cannot be done until we know for sure that no more
14125 class members will ever be referenced in this function
14126 (i.e., calls to destructors). */
14127 if (current_class_name)
14129 ctype = current_class_type;
14130 pop_nested_class (1);
14133 /* Must mark the RESULT_DECL as being in this function. */
14134 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
14136 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14137 to the FUNCTION_DECL node itself. */
14138 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
14142 int saved_flag_keep_inline_functions =
14143 flag_keep_inline_functions;
14145 /* So we can tell if jump_optimize sets it to 1. */
14148 if (DECL_CONTEXT (fndecl) != NULL_TREE
14149 && hack_decl_function_context (fndecl))
14150 /* Trick rest_of_compilation into not deferring output of this
14151 function, even if it is inline, since the rtl_obstack for
14152 this function is the function_obstack of the enclosing
14153 function and will be deallocated when the enclosing
14154 function is gone. See save_tree_status. */
14155 flag_keep_inline_functions = 1;
14157 /* Run the optimizers and output the assembler code for this
14160 if (DECL_ARTIFICIAL (fndecl))
14162 /* Do we really *want* to inline this synthesized method? */
14164 int save_fif = flag_inline_functions;
14165 flag_inline_functions = 1;
14167 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
14168 will check our size. */
14169 DECL_INLINE (fndecl) = 0;
14171 rest_of_compilation (fndecl);
14172 flag_inline_functions = save_fif;
14175 rest_of_compilation (fndecl);
14177 flag_keep_inline_functions = saved_flag_keep_inline_functions;
14179 if (DECL_SAVED_INSNS (fndecl) && ! TREE_ASM_WRITTEN (fndecl))
14181 /* Set DECL_EXTERNAL so that assemble_external will be called as
14182 necessary. We'll clear it again in finish_file. */
14183 if (! DECL_EXTERNAL (fndecl))
14184 DECL_NOT_REALLY_EXTERN (fndecl) = 1;
14185 DECL_EXTERNAL (fndecl) = 1;
14186 mark_inline_for_output (fndecl);
14189 if (ctype && TREE_ASM_WRITTEN (fndecl))
14190 note_debug_info_needed (ctype);
14192 current_function_returns_null |= can_reach_end;
14194 /* Since we don't normally go through c_expand_return for constructors,
14195 this normally gets the wrong value.
14196 Also, named return values have their return codes emitted after
14197 NOTE_INSN_FUNCTION_END, confusing jump.c. */
14198 if (DECL_CONSTRUCTOR_P (fndecl)
14199 || DECL_NAME (DECL_RESULT (fndecl)) != NULL_TREE)
14200 current_function_returns_null = 0;
14202 if (TREE_THIS_VOLATILE (fndecl) && current_function_returns_null)
14203 cp_warning ("`noreturn' function `%D' does return", fndecl);
14204 else if ((warn_return_type || pedantic)
14205 && current_function_returns_null
14206 && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE)
14208 /* If this function returns non-void and control can drop through,
14210 cp_warning ("control reaches end of non-void function `%D'", fndecl);
14212 /* With just -W, complain only if function returns both with
14213 and without a value. */
14214 else if (extra_warnings
14215 && current_function_returns_value && current_function_returns_null)
14216 warning ("this function may return with or without a value");
14221 /* Free all the tree nodes making up this function. */
14222 /* Switch back to allocating nodes permanently
14223 until we start another function. */
14225 permanent_allocation (1);
14227 if (DECL_SAVED_INSNS (fndecl) == NULL_RTX)
14231 /* Stop pointing to the local nodes about to be freed. */
14232 /* But DECL_INITIAL must remain nonzero so we know this
14233 was an actual function definition. */
14234 DECL_INITIAL (fndecl) = error_mark_node;
14235 for (t = DECL_ARGUMENTS (fndecl); t; t = TREE_CHAIN (t))
14236 DECL_RTL (t) = DECL_INCOMING_RTL (t) = NULL_RTX;
14239 if (DECL_STATIC_CONSTRUCTOR (fndecl))
14240 static_ctors = perm_tree_cons (NULL_TREE, fndecl, static_ctors);
14241 if (DECL_STATIC_DESTRUCTOR (fndecl))
14242 static_dtors = perm_tree_cons (NULL_TREE, fndecl, static_dtors);
14246 /* Let the error reporting routines know that we're outside a
14247 function. For a nested function, this value is used in
14248 pop_cp_function_context and then reset via pop_function_context. */
14249 current_function_decl = NULL_TREE;
14252 named_label_uses = NULL;
14253 current_class_ptr = NULL_TREE;
14254 current_class_ref = NULL_TREE;
14257 /* Create the FUNCTION_DECL for a function definition.
14258 DECLSPECS and DECLARATOR are the parts of the declaration;
14259 they describe the return type and the name of the function,
14260 but twisted together in a fashion that parallels the syntax of C.
14262 This function creates a binding context for the function body
14263 as well as setting up the FUNCTION_DECL in current_function_decl.
14265 Returns a FUNCTION_DECL on success.
14267 If the DECLARATOR is not suitable for a function (it defines a datum
14268 instead), we return 0, which tells yyparse to report a parse error.
14270 May return void_type_node indicating that this method is actually
14271 a friend. See grokfield for more details.
14273 Came here with a `.pushlevel' .
14275 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14276 CHANGES TO CODE IN `grokfield'. */
14279 start_method (declspecs, declarator, attrlist)
14280 tree declarator, declspecs, attrlist;
14282 tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
14285 /* Something too ugly to handle. */
14286 if (fndecl == NULL_TREE)
14289 /* Pass friends other than inline friend functions back. */
14290 if (fndecl == void_type_node)
14293 if (TREE_CODE (fndecl) != FUNCTION_DECL)
14294 /* Not a function, tell parser to report parse error. */
14297 if (IS_SIGNATURE (current_class_type))
14298 IS_DEFAULT_IMPLEMENTATION (fndecl) = 1;
14300 if (DECL_IN_AGGR_P (fndecl))
14302 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
14304 if (DECL_CONTEXT (fndecl)
14305 && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
14306 cp_error ("`%D' is already defined in class %s", fndecl,
14307 TYPE_NAME_STRING (DECL_CONTEXT (fndecl)));
14309 return void_type_node;
14312 check_template_shadow (fndecl);
14314 DECL_THIS_INLINE (fndecl) = 1;
14316 if (flag_default_inline)
14317 DECL_INLINE (fndecl) = 1;
14319 /* We process method specializations in finish_struct_1. */
14320 if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
14321 fndecl = push_template_decl (fndecl);
14323 /* We read in the parameters on the maybepermanent_obstack,
14324 but we won't be getting back to them until after we
14325 may have clobbered them. So the call to preserve_data
14326 will keep them safe. */
14329 if (! DECL_FRIEND_P (fndecl))
14331 if (TREE_CHAIN (fndecl))
14333 fndecl = copy_node (fndecl);
14334 TREE_CHAIN (fndecl) = NULL_TREE;
14337 if (DECL_CONSTRUCTOR_P (fndecl))
14339 if (! grok_ctor_properties (current_class_type, fndecl))
14340 return void_type_node;
14342 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl)))
14343 grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0);
14346 cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0, 0);
14348 /* Make a place for the parms */
14350 current_binding_level->parm_flag = 1;
14352 DECL_IN_AGGR_P (fndecl) = 1;
14356 /* Go through the motions of finishing a function definition.
14357 We don't compile this method until after the whole class has
14360 FINISH_METHOD must return something that looks as though it
14361 came from GROKFIELD (since we are defining a method, after all).
14363 This is called after parsing the body of the function definition.
14364 STMTS is the chain of statements that makes up the function body.
14366 DECL is the ..._DECL that `start_method' provided. */
14369 finish_method (decl)
14372 register tree fndecl = decl;
14375 register tree link;
14377 if (decl == void_type_node)
14380 old_initial = DECL_INITIAL (fndecl);
14382 /* Undo the level for the parms (from start_method).
14383 This is like poplevel, but it causes nothing to be
14384 saved. Saving information here confuses symbol-table
14385 output routines. Besides, this information will
14386 be correctly output when this method is actually
14389 /* Clear out the meanings of the local variables of this level;
14390 also record in each decl which block it belongs to. */
14392 for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14394 if (DECL_NAME (link) != NULL_TREE)
14395 pop_binding (DECL_NAME (link), link);
14396 my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14397 DECL_CONTEXT (link) = NULL_TREE;
14400 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
14401 (HOST_WIDE_INT) current_binding_level->level_chain,
14402 current_binding_level->parm_flag,
14403 current_binding_level->keep);
14405 poplevel (0, 0, 0);
14407 DECL_INITIAL (fndecl) = old_initial;
14409 /* We used to check if the context of FNDECL was different from
14410 current_class_type as another way to get inside here. This didn't work
14411 for String.cc in libg++. */
14412 if (DECL_FRIEND_P (fndecl))
14414 CLASSTYPE_INLINE_FRIENDS (current_class_type)
14415 = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14416 decl = void_type_node;
14422 /* Called when a new struct TYPE is defined.
14423 If this structure or union completes the type of any previous
14424 variable declaration, lay it out and output its rtl. */
14427 hack_incomplete_structures (type)
14432 if (current_binding_level->incomplete == NULL_TREE)
14435 if (!type) /* Don't do this for class templates. */
14438 for (list = ¤t_binding_level->incomplete; *list; )
14440 tree decl = TREE_VALUE (*list);
14441 if ((decl && TREE_TYPE (decl) == type)
14442 || (TREE_TYPE (decl)
14443 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14444 && TREE_TYPE (TREE_TYPE (decl)) == type))
14446 int toplevel = toplevel_bindings_p ();
14447 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14448 && TREE_TYPE (TREE_TYPE (decl)) == type)
14449 layout_type (TREE_TYPE (decl));
14450 layout_decl (decl, 0);
14451 rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0);
14455 expand_decl (decl);
14456 cleanup = maybe_build_cleanup (decl);
14457 expand_decl_init (decl);
14458 if (! expand_decl_cleanup (decl, cleanup))
14459 cp_error ("parser lost in parsing declaration of `%D'",
14462 *list = TREE_CHAIN (*list);
14465 list = &TREE_CHAIN (*list);
14469 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14470 See build_delete for information about AUTO_DELETE.
14472 Don't build these on the momentary obstack; they must live
14473 the life of the binding contour. */
14476 maybe_build_cleanup_1 (decl, auto_delete)
14477 tree decl, auto_delete;
14479 tree type = TREE_TYPE (decl);
14480 if (type != error_mark_node && TYPE_NEEDS_DESTRUCTOR (type))
14482 int temp = 0, flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14485 if (TREE_CODE (decl) != PARM_DECL)
14486 temp = suspend_momentary ();
14488 if (TREE_CODE (type) == ARRAY_TYPE)
14492 mark_addressable (decl);
14493 rval = build_unary_op (ADDR_EXPR, decl, 0);
14496 /* Optimize for space over speed here. */
14497 if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14498 || flag_expensive_optimizations)
14499 flags |= LOOKUP_NONVIRTUAL;
14501 rval = build_delete (TREE_TYPE (rval), rval, auto_delete, flags, 0);
14503 if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14504 && ! TYPE_HAS_DESTRUCTOR (type))
14505 rval = build_compound_expr (expr_tree_cons (NULL_TREE, rval,
14506 build_expr_list (NULL_TREE, build_vbase_delete (type, decl))));
14508 if (TREE_CODE (decl) != PARM_DECL)
14509 resume_momentary (temp);
14516 /* If DECL is of a type which needs a cleanup, build that cleanup
14517 here. The cleanup does free the storage with a call to delete. */
14520 maybe_build_cleanup_and_delete (decl)
14523 return maybe_build_cleanup_1 (decl, integer_three_node);
14526 /* If DECL is of a type which needs a cleanup, build that cleanup
14527 here. The cleanup does not free the storage with a call a delete. */
14530 maybe_build_cleanup (decl)
14533 return maybe_build_cleanup_1 (decl, integer_two_node);
14536 /* Expand a C++ expression at the statement level.
14537 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14538 The C++ type checker should get all of these out when
14539 expressions are combined with other, type-providing, expressions,
14540 leaving only orphan expressions, such as:
14542 &class::bar; / / takes its address, but does nothing with it. */
14545 cplus_expand_expr_stmt (exp)
14548 if (processing_template_decl)
14550 add_tree (build_min_nt (EXPR_STMT, exp));
14554 /* Arrange for all temps to disappear. */
14555 expand_start_target_temps ();
14557 exp = require_complete_type_in_void (exp);
14559 if (TREE_CODE (exp) == FUNCTION_DECL)
14561 cp_warning ("reference, not call, to function `%D'", exp);
14562 warning ("at this point in file");
14566 /* We should do this eventually, but right now this causes regex.o from
14567 libg++ to miscompile, and tString to core dump. */
14568 exp = build1 (CLEANUP_POINT_EXPR, TREE_TYPE (exp), exp);
14571 /* Strip unused implicit INDIRECT_REFs of references. */
14572 if (TREE_CODE (exp) == INDIRECT_REF
14573 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == REFERENCE_TYPE)
14574 exp = TREE_OPERAND (exp, 0);
14576 /* If we don't do this, we end up down inside expand_expr
14577 trying to do TYPE_MODE on the ERROR_MARK, and really
14578 go outside the bounds of the type. */
14579 if (exp != error_mark_node)
14580 expand_expr_stmt (break_out_cleanups (exp));
14582 /* Clean up any pending cleanups. This happens when a function call
14583 returns a cleanup-needing value that nobody uses. */
14584 expand_end_target_temps ();
14587 /* When a stmt has been parsed, this function is called.
14589 Currently, this function only does something within a
14590 constructor's scope: if a stmt has just assigned to this,
14591 and we are in a derived class, we call `emit_base_init'. */
14596 extern struct nesting *cond_stack, *loop_stack, *case_stack;
14599 if (current_function_assigns_this
14600 || ! current_function_just_assigned_this)
14602 if (DECL_CONSTRUCTOR_P (current_function_decl))
14604 /* Constructors must wait until we are out of control
14605 zones before calling base constructors. */
14606 if (cond_stack || loop_stack || case_stack)
14608 expand_expr_stmt (base_init_expr);
14609 check_base_init (current_class_type);
14611 current_function_assigns_this = 1;
14614 /* Change a static member function definition into a FUNCTION_TYPE, instead
14615 of the METHOD_TYPE that we create when it's originally parsed.
14617 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14618 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14619 other decls. Either pass the addresses of local variables or NULL. */
14622 revert_static_member_fn (decl, fn, argtypes)
14623 tree *decl, *fn, *argtypes;
14626 tree function = fn ? *fn : TREE_TYPE (*decl);
14627 tree args = argtypes ? *argtypes : TYPE_ARG_TYPES (function);
14629 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args)))
14630 != TYPE_UNQUALIFIED)
14631 cp_error ("static member function `%#D' declared with type qualifiers",
14634 args = TREE_CHAIN (args);
14635 tmp = build_function_type (TREE_TYPE (function), args);
14636 tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function));
14637 tmp = build_exception_variant (tmp,
14638 TYPE_RAISES_EXCEPTIONS (function));
14639 TREE_TYPE (*decl) = tmp;
14640 if (DECL_ARGUMENTS (*decl))
14641 DECL_ARGUMENTS (*decl) = TREE_CHAIN (DECL_ARGUMENTS (*decl));
14642 DECL_STATIC_FUNCTION_P (*decl) = 1;
14654 int just_assigned_this;
14656 int temp_name_counter;
14658 struct named_label_list *named_label_uses;
14659 tree shadowed_labels;
14662 rtx last_dtor_insn;
14663 rtx last_parm_cleanup_insn;
14664 tree base_init_list;
14665 tree member_init_list;
14666 tree base_init_expr;
14667 tree current_class_ptr;
14668 tree current_class_ref;
14670 struct cp_function *next;
14671 struct binding_level *binding_level;
14672 int static_labelno;
14675 static struct cp_function *cp_function_chain;
14677 extern int temp_name_counter;
14679 /* Save and reinitialize the variables
14680 used during compilation of a C++ function. */
14683 push_cp_function_context (context)
14686 struct cp_function *p
14687 = (struct cp_function *) xmalloc (sizeof (struct cp_function));
14689 push_function_context_to (context);
14691 p->next = cp_function_chain;
14692 cp_function_chain = p;
14694 p->named_labels = named_labels;
14695 p->named_label_uses = named_label_uses;
14696 p->shadowed_labels = shadowed_labels;
14697 p->returns_value = current_function_returns_value;
14698 p->returns_null = current_function_returns_null;
14699 p->binding_level = current_binding_level;
14700 p->ctor_label = ctor_label;
14701 p->dtor_label = dtor_label;
14702 p->last_dtor_insn = last_dtor_insn;
14703 p->last_parm_cleanup_insn = last_parm_cleanup_insn;
14704 p->assigns_this = current_function_assigns_this;
14705 p->just_assigned_this = current_function_just_assigned_this;
14706 p->parms_stored = current_function_parms_stored;
14707 p->result_rtx = original_result_rtx;
14708 p->base_init_expr = base_init_expr;
14709 p->temp_name_counter = temp_name_counter;
14710 p->base_init_list = current_base_init_list;
14711 p->member_init_list = current_member_init_list;
14712 p->current_class_ptr = current_class_ptr;
14713 p->current_class_ref = current_class_ref;
14714 p->static_labelno = static_labelno;
14717 /* Restore the variables used during compilation of a C++ function. */
14720 pop_cp_function_context (context)
14723 struct cp_function *p = cp_function_chain;
14726 /* Bring back all the labels that were shadowed. */
14727 for (link = shadowed_labels; link; link = TREE_CHAIN (link))
14728 if (DECL_NAME (TREE_VALUE (link)) != 0)
14729 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link)),
14730 TREE_VALUE (link));
14732 pop_function_context_from (context);
14734 cp_function_chain = p->next;
14736 named_labels = p->named_labels;
14737 named_label_uses = p->named_label_uses;
14738 shadowed_labels = p->shadowed_labels;
14739 current_function_returns_value = p->returns_value;
14740 current_function_returns_null = p->returns_null;
14741 current_binding_level = p->binding_level;
14742 ctor_label = p->ctor_label;
14743 dtor_label = p->dtor_label;
14744 last_dtor_insn = p->last_dtor_insn;
14745 last_parm_cleanup_insn = p->last_parm_cleanup_insn;
14746 current_function_assigns_this = p->assigns_this;
14747 current_function_just_assigned_this = p->just_assigned_this;
14748 current_function_parms_stored = p->parms_stored;
14749 original_result_rtx = p->result_rtx;
14750 base_init_expr = p->base_init_expr;
14751 temp_name_counter = p->temp_name_counter;
14752 current_base_init_list = p->base_init_list;
14753 current_member_init_list = p->member_init_list;
14754 current_class_ptr = p->current_class_ptr;
14755 current_class_ref = p->current_class_ref;
14756 static_labelno = p->static_labelno;
14764 return function_depth != 0;