1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-97, 1998 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
46 #define obstack_chunk_alloc xmalloc
47 #define obstack_chunk_free free
49 extern tree builtin_return_address_fndecl
;
51 extern struct obstack permanent_obstack
;
52 extern struct obstack
* saveable_obstack
;
54 extern int current_class_depth
;
56 extern tree static_ctors
, static_dtors
;
58 extern int static_labelno
;
60 extern tree current_namespace
;
61 extern tree global_namespace
;
63 extern void (*print_error_function
) PROTO((char *));
65 /* Stack of places to restore the search obstack back to. */
67 /* Obstack used for remembering local class declarations (like
68 enums and static (const) members. */
70 struct obstack decl_obstack
;
71 static struct stack_level
*decl_stack
;
73 #ifndef CHAR_TYPE_SIZE
74 #define CHAR_TYPE_SIZE BITS_PER_UNIT
77 #ifndef SHORT_TYPE_SIZE
78 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
82 #define INT_TYPE_SIZE BITS_PER_WORD
85 #ifndef LONG_TYPE_SIZE
86 #define LONG_TYPE_SIZE BITS_PER_WORD
89 #ifndef LONG_LONG_TYPE_SIZE
90 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
93 #ifndef WCHAR_UNSIGNED
94 #define WCHAR_UNSIGNED 0
97 #ifndef FLOAT_TYPE_SIZE
98 #define FLOAT_TYPE_SIZE BITS_PER_WORD
101 #ifndef DOUBLE_TYPE_SIZE
102 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
105 #ifndef LONG_DOUBLE_TYPE_SIZE
106 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
109 #ifndef BOOL_TYPE_SIZE
110 #ifdef SLOW_BYTE_ACCESS
111 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
113 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
117 /* We let tm.h override the types used here, to handle trivial differences
118 such as the choice of unsigned int or long unsigned int for size_t.
119 When machines start needing nontrivial differences in the size type,
120 it would be best to do something here to figure out automatically
121 from other information what type to use. */
124 #define SIZE_TYPE "long unsigned int"
128 #define PTRDIFF_TYPE "long int"
132 #define WCHAR_TYPE "int"
135 static tree grokparms
PROTO((tree
, int));
136 static tree lookup_nested_type
PROTO((tree
, tree
));
137 static char *redeclaration_error_message
PROTO((tree
, tree
));
138 static tree push_overloaded_decl
PROTO((tree
, int));
140 static struct stack_level
*push_decl_level
PROTO((struct stack_level
*,
142 static void push_binding_level
PROTO((struct binding_level
*, int,
144 static void pop_binding_level
PROTO((void));
145 static void suspend_binding_level
PROTO((void));
146 static void resume_binding_level
PROTO((struct binding_level
*));
147 static struct binding_level
*make_binding_level
PROTO((void));
148 static int namespace_bindings_p
PROTO((void));
149 static void declare_namespace_level
PROTO((void));
150 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
151 static void storedecls
PROTO((tree
));
152 static void storetags
PROTO((tree
));
153 static void require_complete_types_for_parms
PROTO((tree
));
154 static void push_overloaded_decl_1
PROTO((tree
));
155 static int ambi_op_p
PROTO((tree
));
156 static int unary_op_p
PROTO((tree
));
157 static tree store_bindings
PROTO((tree
, tree
));
158 static tree lookup_tag_reverse
PROTO((tree
, tree
));
159 static tree obscure_complex_init
PROTO((tree
, tree
));
160 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
161 static tree lookup_name_real
PROTO((tree
, int, int, int));
162 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
163 static void grok_reference_init
PROTO((tree
, tree
, tree
));
164 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
165 enum overload_flags
, tree
,
166 tree
, tree
, int, int, int, int, int, int, tree
));
167 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
168 static tree lookup_tag
PROTO((enum tree_code
, tree
,
169 struct binding_level
*, int));
170 static void set_identifier_type_value_with_scope
171 PROTO((tree
, tree
, struct binding_level
*));
172 static void set_identifier_local_value_with_scope
173 PROTO((tree
, tree
, struct binding_level
*));
174 static void record_builtin_type
PROTO((enum rid
, char *, tree
));
175 static void record_unknown_type
PROTO((tree
, char *));
176 static int member_function_or_else
PROTO((tree
, tree
, char *));
177 static void bad_specifiers
PROTO((tree
, char *, int, int, int, int,
179 static void lang_print_error_function
PROTO((char *));
180 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
181 static void check_for_uninitialized_const_var
PROTO((tree
));
182 static unsigned long typename_hash
PROTO((hash_table_key
));
183 static boolean typename_compare
PROTO((hash_table_key
, hash_table_key
));
185 #if defined (DEBUG_CP_BINDING_LEVELS)
186 static void indent
PROTO((void));
189 /* A node which has tree code ERROR_MARK, and whose type is itself.
190 All erroneous expressions are replaced with this node. All functions
191 that accept nodes as arguments should avoid generating error messages
192 if this node is one of the arguments, since it is undesirable to get
193 multiple error messages from one error in the input. */
195 tree error_mark_node
;
197 /* Erroneous argument lists can use this *IFF* they do not modify it. */
198 tree error_mark_list
;
200 /* INTEGER_TYPE and REAL_TYPE nodes for the standard data types */
202 tree short_integer_type_node
;
203 tree integer_type_node
;
204 tree long_integer_type_node
;
205 tree long_long_integer_type_node
;
207 tree short_unsigned_type_node
;
208 tree unsigned_type_node
;
209 tree long_unsigned_type_node
;
210 tree long_long_unsigned_type_node
;
212 tree ptrdiff_type_node
;
214 tree unsigned_char_type_node
;
215 tree signed_char_type_node
;
217 tree wchar_type_node
;
218 tree signed_wchar_type_node
;
219 tree unsigned_wchar_type_node
;
221 tree wchar_decl_node
;
223 tree float_type_node
;
224 tree double_type_node
;
225 tree long_double_type_node
;
227 tree complex_integer_type_node
;
228 tree complex_float_type_node
;
229 tree complex_double_type_node
;
230 tree complex_long_double_type_node
;
232 tree intQI_type_node
;
233 tree intHI_type_node
;
234 tree intSI_type_node
;
235 tree intDI_type_node
;
236 #if HOST_BITS_PER_WIDE_INT >= 64
237 tree intTI_type_node
;
240 tree unsigned_intQI_type_node
;
241 tree unsigned_intHI_type_node
;
242 tree unsigned_intSI_type_node
;
243 tree unsigned_intDI_type_node
;
244 #if HOST_BITS_PER_WIDE_INT >= 64
245 tree unsigned_intTI_type_node
;
248 tree java_byte_type_node
;
249 tree java_short_type_node
;
250 tree java_int_type_node
;
251 tree java_long_type_node
;
252 tree java_float_type_node
;
253 tree java_double_type_node
;
254 tree java_char_type_node
;
255 tree java_boolean_type_node
;
257 /* A VOID_TYPE node, and the same, packaged in a TREE_LIST. */
259 tree void_type_node
, void_list_node
;
262 /* Nodes for types `void *' and `const void *'. */
265 tree const_ptr_type_node
;
267 /* Nodes for types `char *' and `const char *'. */
269 tree string_type_node
, const_string_type_node
;
271 /* Type `char[256]' or something like it.
272 Used when an array of char is needed and the size is irrelevant. */
274 tree char_array_type_node
;
276 /* Type `int[256]' or something like it.
277 Used when an array of int needed and the size is irrelevant. */
279 tree int_array_type_node
;
281 /* Type `wchar_t[256]' or something like it.
282 Used when a wide string literal is created. */
284 tree wchar_array_type_node
;
286 /* The bool data type, and constants */
287 tree boolean_type_node
, boolean_true_node
, boolean_false_node
;
289 /* Type `int ()' -- used for implicit declaration of functions. */
291 tree default_function_type
;
293 /* Function types `double (double)' and `double (double, double)', etc. */
295 static tree double_ftype_double
, double_ftype_double_double
;
296 static tree int_ftype_int
, long_ftype_long
;
297 static tree float_ftype_float
;
298 static tree ldouble_ftype_ldouble
;
300 /* Function type `int (const void *, const void *, size_t)' */
301 static tree int_ftype_cptr_cptr_sizet
;
304 tree vtable_entry_type
;
305 tree delta_type_node
;
307 /* Old rtti stuff. */
308 tree __baselist_desc_type_node
;
309 tree __i_desc_type_node
, __m_desc_type_node
;
310 tree __t_desc_array_type
, __i_desc_array_type
, __m_desc_array_type
;
312 tree __t_desc_type_node
;
314 tree __tp_desc_type_node
;
316 tree __access_mode_type_node
;
317 tree __bltn_desc_type_node
, __user_desc_type_node
, __class_desc_type_node
;
318 tree __ptr_desc_type_node
, __attr_desc_type_node
, __func_desc_type_node
;
319 tree __ptmf_desc_type_node
, __ptmd_desc_type_node
;
321 /* Not needed yet? May be needed one day? */
322 tree __bltn_desc_array_type
, __user_desc_array_type
, __class_desc_array_type
;
323 tree __ptr_desc_array_type
, __attr_dec_array_type
, __func_desc_array_type
;
324 tree __ptmf_desc_array_type
, __ptmd_desc_array_type
;
327 /* Indicates that there is a type value in some namespace, although
328 that is not necessarily in scope at the moment. */
330 static tree global_type_node
;
332 tree class_star_type_node
;
333 tree class_type_node
, record_type_node
, union_type_node
, enum_type_node
;
334 tree unknown_type_node
;
335 tree opaque_type_node
, signature_type_node
;
336 tree sigtable_entry_type
;
338 /* Array type `vtable_entry_type[]' */
340 tree vtbl_ptr_type_node
;
346 /* Expect only namespace names now. */
347 static int only_namespace_names
;
349 /* In a destructor, the point at which all derived class destroying
350 has been done, just before any base class destroying will be done. */
354 /* In a destructor, the last insn emitted after the start of the
355 function and the parms. */
357 static rtx last_dtor_insn
;
359 /* In a constructor, the last insn emitted after the start of the
360 function and the parms, the exception specification and any
361 function-try-block. The constructor initializers are emitted after
364 static rtx last_parm_cleanup_insn
;
366 /* In a constructor, the point at which we are ready to return
367 the pointer to the initialized object. */
371 /* A FUNCTION_DECL which can call `abort'. Not necessarily the
372 one that the user will declare, but sufficient to be called
373 by routines that want to abort the program. */
377 /* A FUNCTION_DECL for the default `::operator delete'. */
379 tree global_delete_fndecl
;
381 extern rtx cleanup_label
, return_label
;
383 /* If original DECL_RESULT of current function was a register,
384 but due to being an addressable named return value, would up
385 on the stack, this variable holds the named return value's
386 original location. */
387 static rtx original_result_rtx
;
389 /* Sequence of insns which represents base initialization. */
392 /* C++: Keep these around to reduce calls to `get_identifier'.
393 Identifiers for `this' in member functions and the auto-delete
394 parameter for destructors. */
395 tree this_identifier
, in_charge_identifier
;
396 tree ctor_identifier
, dtor_identifier
;
397 /* Used in pointer to member functions, in vtables, and in sigtables. */
398 tree pfn_identifier
, index_identifier
, delta_identifier
, delta2_identifier
;
399 tree pfn_or_delta2_identifier
, tag_identifier
;
400 tree vt_off_identifier
;
402 struct named_label_list
404 struct binding_level
*binding_level
;
407 char *filename_o_goto
;
409 struct named_label_list
*next
;
412 /* A list (chain of TREE_LIST nodes) of named label uses.
413 The TREE_PURPOSE field is the list of variables defined
414 in the label's scope defined at the point of use.
415 The TREE_VALUE field is the LABEL_DECL used.
416 The TREE_TYPE field holds `current_binding_level' at the
417 point of the label's use.
419 BWAHAHAAHAHahhahahahaah. No, no, no, said the little chicken.
421 Look at the pretty struct named_label_list. See the pretty struct
422 with the pretty named fields that describe what they do. See the
423 pretty lack of gratuitous casts. Notice the code got a lot cleaner.
425 Used only for jumps to as-yet undefined labels, since
426 jumps to defined labels can have their validity checked
429 static struct named_label_list
*named_label_uses
= NULL
;
431 /* A list of objects which have constructors or destructors
432 which reside in the global scope. The decl is stored in
433 the TREE_VALUE slot and the initializer is stored
434 in the TREE_PURPOSE slot. */
435 tree static_aggregates
;
439 /* Two expressions that are constants with value zero.
440 The first is of type `int', the second of type `void *'. */
442 tree integer_zero_node
;
443 tree null_pointer_node
;
445 /* The value for __null (NULL), namely, a zero of an integer type with
446 the same number of bits as a pointer. */
449 /* A node for the integer constants 1, 2, and 3. */
451 tree integer_one_node
, integer_two_node
, integer_three_node
;
453 /* While defining an enum type, this is 1 plus the last enumerator
456 static tree enum_next_value
;
458 /* Nonzero means that there was overflow computing enum_next_value. */
460 static int enum_overflow
;
462 /* Parsing a function declarator leaves a list of parameter names
463 or a chain or parameter decls here. */
465 tree last_function_parms
;
467 /* Parsing a function declarator leaves here a chain of structure
468 and enum types declared in the parmlist. */
470 static tree last_function_parm_tags
;
472 /* After parsing the declarator that starts a function definition,
473 `start_function' puts here the list of parameter names or chain of decls.
474 `store_parm_decls' finds it here. */
476 static tree current_function_parms
;
478 /* Similar, for last_function_parm_tags. */
479 static tree current_function_parm_tags
;
481 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
482 that have names. Here so we can clear out their names' definitions
483 at the end of the function. */
485 static tree named_labels
;
487 /* A list of LABEL_DECLs from outer contexts that are currently shadowed. */
489 static tree shadowed_labels
;
491 /* The FUNCTION_DECL for the function currently being compiled,
492 or 0 if between functions. */
493 tree current_function_decl
;
495 /* Set to 0 at beginning of a function definition, set to 1 if
496 a return statement that specifies a return value is seen. */
498 int current_function_returns_value
;
500 /* Set to 0 at beginning of a function definition, set to 1 if
501 a return statement with no argument is seen. */
503 int current_function_returns_null
;
505 /* Set to 0 at beginning of a function definition, and whenever
506 a label (case or named) is defined. Set to value of expression
507 returned from function when that value can be transformed into
508 a named return value. */
510 tree current_function_return_value
;
512 /* Nonzero means give `double' the same size as `float'. */
514 extern int flag_short_double
;
516 /* Nonzero means don't recognize any builtin functions. */
518 extern int flag_no_builtin
;
520 /* Nonzero means don't recognize the non-ANSI builtin functions.
523 extern int flag_no_nonansi_builtin
;
525 /* Nonzero means enable obscure ANSI features and disable GNU extensions
526 that might cause ANSI-compliant code to be miscompiled. */
528 extern int flag_ansi
;
530 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
532 extern int flag_huge_objects
;
534 /* Nonzero if we want to conserve space in the .o files. We do this
535 by putting uninitialized data and runtime initialized data into
536 .common instead of .data at the expense of not flagging multiple
538 extern int flag_conserve_space
;
540 /* Pointers to the base and current top of the language name stack. */
542 extern tree
*current_lang_base
, *current_lang_stack
;
544 /* C and C++ flags are in decl2.c. */
546 /* Set to 0 at beginning of a constructor, set to 1
547 if that function does an allocation before referencing its
548 instance variable. */
549 static int current_function_assigns_this
;
550 int current_function_just_assigned_this
;
552 /* Set to 0 at beginning of a function. Set non-zero when
553 store_parm_decls is called. Don't call store_parm_decls
554 if this flag is non-zero! */
555 int current_function_parms_stored
;
557 /* Flag used when debugging spew.c */
559 extern int spew_debug
;
561 /* This is a copy of the class_shadowed list of the previous class binding
562 contour when at global scope. It's used to reset IDENTIFIER_CLASS_VALUEs
563 when entering another class scope (i.e. a cache miss). */
564 extern tree previous_class_values
;
566 /* A expression of value 0 with the same precision as a sizetype
568 tree signed_size_zero_node
;
570 /* The name of the anonymous namespace, throughout this translation
572 tree anonymous_namespace_name
;
575 /* Allocate a level of searching. */
579 push_decl_level (stack
, obstack
)
580 struct stack_level
*stack
;
581 struct obstack
*obstack
;
583 struct stack_level tem
;
586 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
589 /* For each binding contour we allocate a binding_level structure
590 which records the names defined in that contour.
593 1) one for each function definition,
594 where internal declarations of the parameters appear.
595 2) one for each compound statement,
596 to record its declarations.
598 The current meaning of a name can be found by searching the levels
599 from the current one out to the global one.
601 Off to the side, may be the class_binding_level. This exists only
602 to catch class-local declarations. It is otherwise nonexistent.
604 Also there may be binding levels that catch cleanups that must be
605 run when exceptions occur. */
607 /* Note that the information in the `names' component of the global contour
608 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
612 /* A chain of _DECL nodes for all variables, constants, functions,
613 and typedef types. These are in the reverse of the order
617 /* A list of structure, union and enum definitions, for looking up
619 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
620 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
621 or ENUMERAL_TYPE node.
623 C++: the TREE_VALUE nodes can be simple types for
624 component_bindings. */
627 /* A list of USING_DECL nodes. */
630 /* A list of used namespaces. PURPOSE is the namespace,
631 VALUE the common ancestor with this binding_level's namespace. */
632 tree using_directives
;
634 /* For each level, a list of shadowed outer-level local definitions
635 to be restored when this level is popped.
636 Each link is a TREE_LIST whose TREE_PURPOSE is an identifier and
637 whose TREE_VALUE is its old definition (a kind of ..._DECL node). */
640 /* Same, for IDENTIFIER_CLASS_VALUE. */
643 /* Same, for IDENTIFIER_TYPE_VALUE. */
646 /* For each level (except not the global one),
647 a chain of BLOCK nodes for all the levels
648 that were entered and exited one level down. */
651 /* The BLOCK node for this level, if one has been preallocated.
652 If 0, the BLOCK is allocated (if needed) when the level is popped. */
655 /* The binding level which this one is contained in (inherits from). */
656 struct binding_level
*level_chain
;
658 /* List of decls in `names' that have incomplete
659 structure or union types. */
662 /* List of VAR_DECLS saved from a previous for statement.
663 These would be dead in ANSI-conforming code, but might
664 be referenced in ARM-era code. */
665 tree dead_vars_from_for
;
667 /* 1 for the level that holds the parameters of a function.
668 2 for the level that holds a class declaration.
669 3 for levels that hold parameter declarations. */
670 unsigned parm_flag
: 4;
672 /* 1 means make a BLOCK for this level regardless of all else.
673 2 for temporary binding contours created by the compiler. */
676 /* Nonzero if this level "doesn't exist" for tags. */
677 unsigned tag_transparent
: 1;
679 /* Nonzero if this level can safely have additional
680 cleanup-needing variables added to it. */
681 unsigned more_cleanups_ok
: 1;
682 unsigned have_cleanups
: 1;
684 /* Nonzero if this level is for storing the decls for template
685 parameters and generic decls; these decls will be discarded and
686 replaced with a TEMPLATE_DECL. */
687 unsigned pseudo_global
: 1;
689 /* This is set for a namespace binding level. */
690 unsigned namespace_p
: 1;
692 /* True if this level is that of a for-statement where we need to
693 worry about ambiguous (ARM or ANSI) scope rules. */
694 unsigned is_for_scope
: 1;
696 /* Two bits left for this word. */
698 #if defined(DEBUG_CP_BINDING_LEVELS)
699 /* Binding depth at which this level began. */
700 unsigned binding_depth
;
701 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
704 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
706 /* The (non-class) binding level currently in effect. */
708 static struct binding_level
*current_binding_level
;
710 /* The binding level of the current class, if any. */
712 static struct binding_level
*class_binding_level
;
714 /* The current (class or non-class) binding level currently in effect. */
716 #define inner_binding_level \
717 (class_binding_level ? class_binding_level : current_binding_level)
719 /* A chain of binding_level structures awaiting reuse. */
721 static struct binding_level
*free_binding_level
;
723 /* The outermost binding level, for names of file scope.
724 This is created when the compiler is started and exists
725 through the entire run. */
727 static struct binding_level
*global_binding_level
;
729 /* Binding level structures are initialized by copying this one. */
731 static struct binding_level clear_binding_level
;
733 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
735 static int keep_next_level_flag
;
737 #if defined(DEBUG_CP_BINDING_LEVELS)
738 static int binding_depth
= 0;
739 static int is_class_level
= 0;
746 for (i
= 0; i
< binding_depth
*2; i
++)
749 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
751 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
754 push_binding_level (newlevel
, tag_transparent
, keep
)
755 struct binding_level
*newlevel
;
756 int tag_transparent
, keep
;
758 /* Add this level to the front of the chain (stack) of levels that
760 *newlevel
= clear_binding_level
;
761 if (class_binding_level
)
763 newlevel
->level_chain
= class_binding_level
;
764 class_binding_level
= (struct binding_level
*)0;
768 newlevel
->level_chain
= current_binding_level
;
770 current_binding_level
= newlevel
;
771 newlevel
->tag_transparent
= tag_transparent
;
772 newlevel
->more_cleanups_ok
= 1;
773 newlevel
->keep
= keep
;
774 #if defined(DEBUG_CP_BINDING_LEVELS)
775 newlevel
->binding_depth
= binding_depth
;
777 fprintf (stderr
, "push %s level 0x%08x line %d\n",
778 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
781 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
787 if (class_binding_level
)
788 current_binding_level
= class_binding_level
;
790 if (global_binding_level
)
792 /* Cannot pop a level, if there are none left to pop. */
793 if (current_binding_level
== global_binding_level
)
794 my_friendly_abort (123);
796 /* Pop the current level, and free the structure for reuse. */
797 #if defined(DEBUG_CP_BINDING_LEVELS)
800 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
801 (is_class_level
) ? "class" : "block",
802 current_binding_level
, lineno
);
803 if (is_class_level
!= (current_binding_level
== class_binding_level
))
806 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
809 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
811 register struct binding_level
*level
= current_binding_level
;
812 current_binding_level
= current_binding_level
->level_chain
;
813 level
->level_chain
= free_binding_level
;
814 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
815 if (level
->binding_depth
!= binding_depth
)
817 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
818 free_binding_level
= level
;
820 class_binding_level
= current_binding_level
;
821 if (class_binding_level
->parm_flag
!= 2)
822 class_binding_level
= 0;
823 while (current_binding_level
->parm_flag
== 2)
824 current_binding_level
= current_binding_level
->level_chain
;
829 suspend_binding_level ()
831 if (class_binding_level
)
832 current_binding_level
= class_binding_level
;
834 if (global_binding_level
)
836 /* Cannot suspend a level, if there are none left to suspend. */
837 if (current_binding_level
== global_binding_level
)
838 my_friendly_abort (123);
840 /* Suspend the current level. */
841 #if defined(DEBUG_CP_BINDING_LEVELS)
844 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
845 (is_class_level
) ? "class" : "block",
846 current_binding_level
, lineno
);
847 if (is_class_level
!= (current_binding_level
== class_binding_level
))
850 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
853 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
855 current_binding_level
= current_binding_level
->level_chain
;
856 class_binding_level
= current_binding_level
;
857 if (class_binding_level
->parm_flag
!= 2)
858 class_binding_level
= 0;
859 while (current_binding_level
->parm_flag
== 2)
860 current_binding_level
= current_binding_level
->level_chain
;
865 resume_binding_level (b
)
866 struct binding_level
*b
;
868 /* Resuming binding levels is meant only for namespaces,
869 and those cannot nest into classes. */
870 my_friendly_assert(!class_binding_level
, 386);
871 /* Also, resuming a non-directly nested namespace is a no-no. */
872 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
873 current_binding_level
= b
;
874 #if defined(DEBUG_CP_BINDING_LEVELS)
875 b
->binding_depth
= binding_depth
;
877 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
878 (is_class_level
) ? "class" : "block", b
, lineno
);
881 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
884 /* Create a new `struct binding_level'. */
887 struct binding_level
*
888 make_binding_level ()
891 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
894 /* Nonzero if we are currently in the global binding level. */
899 return current_binding_level
== global_binding_level
;
902 /* Nonzero if we are currently in a toplevel binding level. This
903 means either the global binding level or a namespace in a toplevel
905 Since there are no non-toplevel namespace levels, this really
906 means any namespace or pseudo-global level. */
909 toplevel_bindings_p ()
911 return current_binding_level
->namespace_p
912 || current_binding_level
->pseudo_global
;
915 /* Nonzero if this is a namespace scope. */
918 namespace_bindings_p ()
920 return current_binding_level
->namespace_p
;
926 keep_next_level_flag
= 1;
929 /* Nonzero if the current level needs to have a BLOCK made. */
934 return (current_binding_level
->blocks
!= NULL_TREE
935 || current_binding_level
->keep
936 || current_binding_level
->names
!= NULL_TREE
937 || (current_binding_level
->tags
!= NULL_TREE
938 && !current_binding_level
->tag_transparent
));
941 /* Identify this binding level as a level of parameters. */
944 declare_parm_level ()
946 current_binding_level
->parm_flag
= 1;
950 declare_pseudo_global_level ()
952 current_binding_level
->pseudo_global
= 1;
956 declare_namespace_level ()
958 current_binding_level
->namespace_p
= 1;
962 pseudo_global_level_p ()
964 return current_binding_level
->pseudo_global
;
968 set_class_shadows (shadows
)
971 class_binding_level
->class_shadowed
= shadows
;
974 /* Enter a new binding level.
975 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
976 not for that of tags. */
979 pushlevel (tag_transparent
)
982 register struct binding_level
*newlevel
= NULL_BINDING_LEVEL
;
984 /* If this is the top level of a function,
985 just make sure that NAMED_LABELS is 0.
986 They should have been set to 0 at the end of the previous function. */
988 if (current_binding_level
== global_binding_level
)
989 my_friendly_assert (named_labels
== NULL_TREE
, 134);
991 /* Reuse or create a struct for this binding level. */
993 #if defined(DEBUG_CP_BINDING_LEVELS)
995 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
996 if (free_binding_level
)
997 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
999 newlevel
= free_binding_level
;
1000 free_binding_level
= free_binding_level
->level_chain
;
1004 newlevel
= make_binding_level ();
1007 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
1008 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
1009 keep_next_level_flag
= 0;
1013 note_level_for_for ()
1015 current_binding_level
->is_for_scope
= 1;
1019 pushlevel_temporary (tag_transparent
)
1020 int tag_transparent
;
1022 pushlevel (tag_transparent
);
1023 current_binding_level
->keep
= 2;
1026 /* Note we don't call push_momentary() here. Otherwise, it would cause
1027 cleanups to be allocated on the momentary obstack, and they will be
1028 overwritten by the next statement. */
1030 expand_start_bindings (0);
1033 /* Exit a binding level.
1034 Pop the level off, and restore the state of the identifier-decl mappings
1035 that were in effect when this level was entered.
1037 If KEEP == 1, this level had explicit declarations, so
1038 and create a "block" (a BLOCK node) for the level
1039 to record its declarations and subblocks for symbol table output.
1041 If FUNCTIONBODY is nonzero, this level is the body of a function,
1042 so create a block as if KEEP were set and also clear out all
1045 If REVERSE is nonzero, reverse the order of decls before putting
1046 them into the BLOCK. */
1049 poplevel (keep
, reverse
, functionbody
)
1055 /* The chain of decls was accumulated in reverse order.
1056 Put it into forward order, just for cleanliness. */
1058 int tmp
= functionbody
;
1059 int real_functionbody
= current_binding_level
->keep
== 2
1060 ? ((functionbody
= 0), tmp
) : functionbody
;
1061 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1062 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1063 tree block
= NULL_TREE
;
1065 int block_previously_created
;
1067 /* We used to use KEEP == 2 to indicate that the new block should go
1068 at the beginning of the list of blocks at this binding level,
1069 rather than the end. This hack is no longer used. */
1070 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1072 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1073 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1074 current_binding_level
->parm_flag
,
1075 current_binding_level
->keep
);
1077 if (current_binding_level
->keep
== 1)
1080 /* Get the decls in the order they were written.
1081 Usually current_binding_level->names is in reverse order.
1082 But parameter decls were previously put in forward order. */
1085 current_binding_level
->names
1086 = decls
= nreverse (current_binding_level
->names
);
1088 decls
= current_binding_level
->names
;
1090 /* Output any nested inline functions within this block
1091 if they weren't already output. */
1093 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1094 if (TREE_CODE (decl
) == FUNCTION_DECL
1095 && ! TREE_ASM_WRITTEN (decl
)
1096 && DECL_INITIAL (decl
) != NULL_TREE
1097 && TREE_ADDRESSABLE (decl
)
1098 && decl_function_context (decl
) == current_function_decl
)
1100 /* If this decl was copied from a file-scope decl
1101 on account of a block-scope extern decl,
1102 propagate TREE_ADDRESSABLE to the file-scope decl. */
1103 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1104 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1107 push_function_context ();
1108 output_inline_function (decl
);
1109 pop_function_context ();
1113 /* If there were any declarations or structure tags in that level,
1114 or if this level is a function body,
1115 create a BLOCK to record them for the life of this function. */
1118 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1119 if (block_previously_created
)
1120 block
= current_binding_level
->this_block
;
1121 else if (keep
== 1 || functionbody
)
1122 block
= make_node (BLOCK
);
1123 if (block
!= NULL_TREE
)
1125 if (block_previously_created
)
1127 if (decls
|| tags
|| subblocks
)
1129 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1131 warning ("internal compiler error: debugging info corrupted");
1133 BLOCK_VARS (block
) = decls
;
1134 BLOCK_TYPE_TAGS (block
) = tags
;
1136 /* We can have previous subblocks and new subblocks when
1137 doing fixup_gotos with complex cleanups. We chain the new
1138 subblocks onto the end of any pre-existing subblocks. */
1139 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1142 /* If we created the block earlier on, and we are just
1143 diddling it now, then it already should have a proper
1144 BLOCK_END_NOTE value associated with it. */
1148 BLOCK_VARS (block
) = decls
;
1149 BLOCK_TYPE_TAGS (block
) = tags
;
1150 BLOCK_SUBBLOCKS (block
) = subblocks
;
1151 /* Otherwise, for a new block, install a new BLOCK_END_NOTE value. */
1152 remember_end_note (block
);
1156 /* In each subblock, record that this is its superior. */
1159 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1160 BLOCK_SUPERCONTEXT (link
) = block
;
1162 /* Clear out the meanings of the local variables of this level. */
1164 if (current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1)
1166 struct binding_level
*outer
= current_binding_level
->level_chain
;
1167 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1169 if (TREE_CODE (link
) == VAR_DECL
)
1170 DECL_DEAD_FOR_LOCAL (link
) = 1;
1172 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = NULL_TREE
;
1175 /* Save declarations made in a 'for' statement so we can support pre-ANSI
1176 'for' scoping semantics. */
1178 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
1180 tree id
= TREE_PURPOSE (link
);
1181 tree decl
= IDENTIFIER_LOCAL_VALUE (id
);
1183 if (decl
&& DECL_DEAD_FOR_LOCAL (decl
))
1185 /* In this case keep the dead for-decl visible,
1186 but remember what (if anything) it shadowed. */
1187 DECL_SHADOWED_FOR_VAR (decl
) = TREE_VALUE (link
);
1188 TREE_CHAIN (decl
) = outer
->dead_vars_from_for
;
1189 outer
->dead_vars_from_for
= decl
;
1192 IDENTIFIER_LOCAL_VALUE (id
) = TREE_VALUE (link
);
1195 else /* Not special for scope. */
1197 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1199 if (DECL_NAME (link
) != NULL_TREE
)
1201 /* If the ident. was used or addressed via a local extern decl,
1202 don't forget that fact. */
1203 if (DECL_EXTERNAL (link
))
1205 if (TREE_USED (link
))
1206 TREE_USED (DECL_ASSEMBLER_NAME (link
)) = 1;
1207 if (TREE_ADDRESSABLE (link
))
1208 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (link
)) = 1;
1210 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = NULL_TREE
;
1214 /* Restore all name-meanings of the outer levels
1215 that were shadowed by this level. */
1217 for (link
= current_binding_level
->shadowed
;
1218 link
; link
= TREE_CHAIN (link
))
1219 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1221 /* We first restore the regular decls and *then* the dead_vars_from_for
1222 to handle this case:
1226 for (int i; ; ) { ...} // i#2
1230 In this case, we want remove the binding for i#3, restoring
1231 that of i#2. Then we want to remove the binding for i#2,
1232 and restore that of i#1. */
1234 link
= current_binding_level
->dead_vars_from_for
;
1235 for (; link
!= NULL_TREE
; link
= TREE_CHAIN (link
))
1237 tree id
= DECL_NAME (link
);
1238 if (IDENTIFIER_LOCAL_VALUE (id
) == link
)
1239 IDENTIFIER_LOCAL_VALUE (id
) = DECL_SHADOWED_FOR_VAR (link
);
1242 for (link
= current_binding_level
->class_shadowed
;
1243 link
; link
= TREE_CHAIN (link
))
1244 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1245 for (link
= current_binding_level
->type_shadowed
;
1246 link
; link
= TREE_CHAIN (link
))
1247 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1250 /* If the level being exited is the top level of a function,
1251 check over all the labels. */
1255 /* If this is the top level block of a function,
1256 the vars are the function's parameters.
1257 Don't leave them in the BLOCK because they are
1258 found in the FUNCTION_DECL instead. */
1260 BLOCK_VARS (block
) = 0;
1262 /* Clear out the definitions of all label names,
1263 since their scopes end here. */
1265 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1267 register tree label
= TREE_VALUE (link
);
1269 if (DECL_INITIAL (label
) == NULL_TREE
)
1271 cp_error_at ("label `%D' used but not defined", label
);
1272 /* Avoid crashing later. */
1273 define_label (input_filename
, 1, DECL_NAME (label
));
1275 else if (warn_unused
&& !TREE_USED (label
))
1276 cp_warning_at ("label `%D' defined but not used", label
);
1277 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), NULL_TREE
);
1279 /* Put the labels into the "variables" of the
1280 top-level block, so debugger can see them. */
1281 TREE_CHAIN (label
) = BLOCK_VARS (block
);
1282 BLOCK_VARS (block
) = label
;
1285 named_labels
= NULL_TREE
;
1288 /* Any uses of undefined labels now operate under constraints
1289 of next binding contour. */
1291 struct binding_level
*level_chain
;
1292 level_chain
= current_binding_level
->level_chain
;
1295 struct named_label_list
*labels
;
1296 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1297 if (labels
->binding_level
== current_binding_level
)
1299 labels
->binding_level
= level_chain
;
1300 labels
->names_in_scope
= level_chain
->names
;
1305 tmp
= current_binding_level
->keep
;
1307 pop_binding_level ();
1309 DECL_INITIAL (current_function_decl
) = block
;
1312 if (!block_previously_created
)
1313 current_binding_level
->blocks
1314 = chainon (current_binding_level
->blocks
, block
);
1316 /* If we did not make a block for the level just exited,
1317 any blocks made for inner levels
1318 (since they cannot be recorded as subblocks in that level)
1319 must be carried forward so they will later become subblocks
1320 of something else. */
1322 current_binding_level
->blocks
1323 = chainon (current_binding_level
->blocks
, subblocks
);
1325 /* Take care of compiler's internal binding structures. */
1328 expand_end_bindings (getdecls (), keep
, 1);
1329 /* Each and every BLOCK node created here in `poplevel' is important
1330 (e.g. for proper debugging information) so if we created one
1331 earlier, mark it as "used". */
1333 TREE_USED (block
) = 1;
1334 block
= poplevel (keep
, reverse
, real_functionbody
);
1337 /* Each and every BLOCK node created here in `poplevel' is important
1338 (e.g. for proper debugging information) so if we created one
1339 earlier, mark it as "used". */
1341 TREE_USED (block
) = 1;
1345 /* Delete the node BLOCK from the current binding level.
1346 This is used for the block inside a stmt expr ({...})
1347 so that the block can be reinserted where appropriate. */
1350 delete_block (block
)
1354 if (current_binding_level
->blocks
== block
)
1355 current_binding_level
->blocks
= TREE_CHAIN (block
);
1356 for (t
= current_binding_level
->blocks
; t
;)
1358 if (TREE_CHAIN (t
) == block
)
1359 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1363 TREE_CHAIN (block
) = NULL_TREE
;
1364 /* Clear TREE_USED which is always set by poplevel.
1365 The flag is set again if insert_block is called. */
1366 TREE_USED (block
) = 0;
1369 /* Insert BLOCK at the end of the list of subblocks of the
1370 current binding level. This is used when a BIND_EXPR is expanded,
1371 to handle the BLOCK node inside the BIND_EXPR. */
1374 insert_block (block
)
1377 TREE_USED (block
) = 1;
1378 current_binding_level
->blocks
1379 = chainon (current_binding_level
->blocks
, block
);
1382 /* Set the BLOCK node for the innermost scope
1383 (the one we are currently in). */
1387 register tree block
;
1389 current_binding_level
->this_block
= block
;
1392 /* Do a pushlevel for class declarations. */
1397 register struct binding_level
*newlevel
;
1399 /* Reuse or create a struct for this binding level. */
1400 #if defined(DEBUG_CP_BINDING_LEVELS)
1402 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1403 if (free_binding_level
)
1404 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1406 newlevel
= free_binding_level
;
1407 free_binding_level
= free_binding_level
->level_chain
;
1411 newlevel
= make_binding_level ();
1414 #if defined(DEBUG_CP_BINDING_LEVELS)
1416 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1418 push_binding_level (newlevel
, 0, 0);
1420 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1421 class_binding_level
= current_binding_level
;
1422 class_binding_level
->parm_flag
= 2;
1423 /* We have just pushed into a new binding level. Now, fake out the rest
1424 of the compiler. Set the `current_binding_level' back to point to
1425 the most closely containing non-class binding level. */
1428 current_binding_level
= current_binding_level
->level_chain
;
1430 while (current_binding_level
->parm_flag
== 2);
1433 /* ...and a poplevel for class declarations. FORCE is used to force
1434 clearing out of CLASS_VALUEs after a class definition. */
1437 poplevel_class (force
)
1440 register struct binding_level
*level
= class_binding_level
;
1441 tree block
= NULL_TREE
;
1444 my_friendly_assert (level
!= 0, 354);
1446 decl_stack
= pop_stack_level (decl_stack
);
1447 for (shadowed
= level
->shadowed
; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
1448 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (shadowed
)) = TREE_VALUE (shadowed
);
1449 /* If we're leaving a toplevel class, don't bother to do the setting
1450 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1451 shouldn't even be used when current_class_type isn't set, and second,
1452 if we don't touch it here, we're able to use the cache effect if the
1453 next time we're entering a class scope, it is the same class. */
1454 if (current_class_depth
!= 1 || force
)
1455 for (shadowed
= level
->class_shadowed
;
1457 shadowed
= TREE_CHAIN (shadowed
))
1458 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = TREE_VALUE (shadowed
);
1460 /* Remember to save what IDENTIFIER's were bound in this scope so we
1461 can recover from cache misses. */
1463 previous_class_type
= current_class_type
;
1464 previous_class_values
= class_binding_level
->class_shadowed
;
1466 for (shadowed
= level
->type_shadowed
;
1468 shadowed
= TREE_CHAIN (shadowed
))
1469 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1471 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1472 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1473 class_binding_level
->parm_flag
,
1474 class_binding_level
->keep
);
1476 if (class_binding_level
->parm_flag
!= 2)
1477 class_binding_level
= (struct binding_level
*)0;
1479 /* Now, pop out of the binding level which we created up in the
1480 `pushlevel_class' routine. */
1481 #if defined(DEBUG_CP_BINDING_LEVELS)
1483 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1485 pop_binding_level ();
1490 /* For debugging. */
1491 static int no_print_functions
= 0;
1492 static int no_print_builtins
= 0;
1495 print_binding_level (lvl
)
1496 struct binding_level
*lvl
;
1500 fprintf (stderr
, " blocks=");
1501 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1502 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1503 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1504 if (lvl
->tag_transparent
)
1505 fprintf (stderr
, " tag-transparent");
1506 if (lvl
->more_cleanups_ok
)
1507 fprintf (stderr
, " more-cleanups-ok");
1508 if (lvl
->have_cleanups
)
1509 fprintf (stderr
, " have-cleanups");
1510 fprintf (stderr
, "\n");
1513 fprintf (stderr
, " names:\t");
1514 /* We can probably fit 3 names to a line? */
1515 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1517 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1519 if (no_print_builtins
1520 && (TREE_CODE (t
) == TYPE_DECL
)
1521 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1524 /* Function decls tend to have longer names. */
1525 if (TREE_CODE (t
) == FUNCTION_DECL
)
1532 fprintf (stderr
, "\n\t");
1535 print_node_brief (stderr
, "", t
, 0);
1536 if (t
== error_mark_node
)
1540 fprintf (stderr
, "\n");
1544 fprintf (stderr
, " tags:\t");
1546 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1548 if (TREE_PURPOSE (t
) == NULL_TREE
)
1550 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1557 fprintf (stderr
, "\n\t");
1560 if (TREE_PURPOSE (t
) == NULL_TREE
)
1562 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1563 fprintf (stderr
, ">");
1565 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1566 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1569 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1570 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1571 fprintf (stderr
, ">");
1575 fprintf (stderr
, "\n");
1579 fprintf (stderr
, " shadowed:");
1580 for (t
= lvl
->shadowed
; t
; t
= TREE_CHAIN (t
))
1582 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1584 fprintf (stderr
, "\n");
1586 if (lvl
->class_shadowed
)
1588 fprintf (stderr
, " class-shadowed:");
1589 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1591 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1593 fprintf (stderr
, "\n");
1595 if (lvl
->type_shadowed
)
1597 fprintf (stderr
, " type-shadowed:");
1598 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1600 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1602 fprintf (stderr
, "\n");
1607 print_other_binding_stack (stack
)
1608 struct binding_level
*stack
;
1610 struct binding_level
*level
;
1611 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1613 fprintf (stderr
, "binding level ");
1614 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1615 fprintf (stderr
, "\n");
1616 print_binding_level (level
);
1621 print_binding_stack ()
1623 struct binding_level
*b
;
1624 fprintf (stderr
, "current_binding_level=");
1625 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1626 fprintf (stderr
, "\nclass_binding_level=");
1627 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
1628 fprintf (stderr
, "\nglobal_binding_level=");
1629 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
1630 fprintf (stderr
, "\n");
1631 if (class_binding_level
)
1633 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1634 if (b
== current_binding_level
)
1637 b
= class_binding_level
;
1639 b
= current_binding_level
;
1642 b
= current_binding_level
;
1643 print_other_binding_stack (b
);
1644 fprintf (stderr
, "global:\n");
1645 print_binding_level (global_binding_level
);
1648 /* Namespace binding access routines: The namespace_bindings field of
1649 the identifier is polymorphic, with three possible values:
1650 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
1651 indicating the BINDING_VALUE of global_namespace. */
1653 /* Check whether the a binding for the name to scope is known.
1654 Assumes that the bindings of the name are already a list
1655 of bindings. Returns the binding found, or NULL_TREE. */
1658 find_binding (name
, scope
)
1662 tree iter
, prev
= NULL_TREE
;
1664 scope
= ORIGINAL_NAMESPACE (scope
);
1666 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
1667 iter
= TREE_CHAIN (iter
))
1669 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
1670 if (BINDING_SCOPE (iter
) == scope
)
1672 /* Move binding found to the fron of the list, so
1673 subsequent lookups will find it faster. */
1676 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
1677 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
1678 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
1687 /* Always returns a binding for name in scope. If the
1688 namespace_bindings is not a list, convert it to one first.
1689 If no binding is found, make a new one. */
1692 binding_for_name (name
, scope
)
1696 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1699 scope
= ORIGINAL_NAMESPACE (scope
);
1701 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
1703 /* Get rid of optimization for global scope. */
1704 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
1705 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
1706 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1708 if (b
&& (result
= find_binding (name
, scope
)))
1710 /* Not found, make a new permanent one. */
1711 push_obstacks (&permanent_obstack
, &permanent_obstack
);
1712 result
= make_node (CPLUS_BINDING
);
1713 TREE_CHAIN (result
) = b
;
1714 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
1715 BINDING_SCOPE (result
) = scope
;
1716 BINDING_TYPE (result
) = NULL_TREE
;
1717 BINDING_VALUE (result
) = NULL_TREE
;
1722 /* Return the binding value for name in scope, considering that
1723 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
1726 namespace_binding (name
, scope
)
1730 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1733 if (scope
== NULL_TREE
)
1734 scope
= global_namespace
;
1735 if (TREE_CODE (b
) != CPLUS_BINDING
)
1736 return (scope
== global_namespace
) ? b
: NULL_TREE
;
1737 name
= find_binding (name
,scope
);
1738 if (name
== NULL_TREE
)
1740 return BINDING_VALUE (name
);
1743 /* Set the binding value for name in scope. If modifying the binding
1744 of global_namespace is attempted, try to optimize it. */
1747 set_namespace_binding (name
, scope
, val
)
1754 if (scope
== NULL_TREE
)
1755 scope
= global_namespace
;
1757 if (scope
== global_namespace
)
1759 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1760 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
1762 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
1766 b
= binding_for_name (name
, scope
);
1767 BINDING_VALUE (b
) = val
;
1770 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
1771 select a name that is unique to this compilation unit. */
1774 push_namespace (name
)
1779 int implicit_use
= 0;
1781 if (!global_namespace
)
1783 /* This must be ::. */
1784 my_friendly_assert (name
== get_identifier ("::"), 377);
1789 /* The name of anonymous namespace is unique for the translation
1791 if (!anonymous_namespace_name
)
1792 anonymous_namespace_name
= get_file_function_name ('N');
1793 name
= anonymous_namespace_name
;
1794 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
1796 /* Reopening anonymous namespace. */
1800 else if (current_namespace
== global_namespace
1801 && name
== DECL_NAME (std_node
))
1808 /* Check whether this is an extended namespace definition. */
1809 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
1810 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
1813 if (DECL_NAMESPACE_ALIAS (d
))
1815 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
1816 d
, DECL_NAMESPACE_ALIAS (d
));
1817 d
= DECL_NAMESPACE_ALIAS (d
);
1824 /* Make a new namespace, binding the name to it. */
1825 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
1826 /* The global namespace is not pushed, and the global binding
1827 level is set elsewhere. */
1832 declare_namespace_level ();
1833 NAMESPACE_LEVEL (d
) = current_binding_level
;
1837 resume_binding_level (NAMESPACE_LEVEL (d
));
1840 do_using_directive (d
);
1841 /* Enter the name space. */
1842 current_namespace
= d
;
1845 /* Pop from the scope of the current namespace. */
1850 if (current_namespace
== global_namespace
)
1852 my_friendly_assert (in_std
>0, 980421);
1856 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
1857 /* The binding level is not popped, as it might be re-opened later. */
1858 suspend_binding_level ();
1861 /* Concatenate the binding levels of all namespaces. */
1864 cat_namespace_levels()
1868 struct binding_level
*b
;
1870 last
= NAMESPACE_LEVEL (global_namespace
) -> names
;
1871 /* The nested namespaces appear in the names list of their ancestors. */
1872 for (current
= last
; current
; current
= TREE_CHAIN (current
))
1874 if (TREE_CODE (current
) != NAMESPACE_DECL
1875 || DECL_NAMESPACE_ALIAS (current
))
1877 if (!DECL_LANG_SPECIFIC (current
))
1880 my_friendly_assert (current
== std_node
, 393);
1883 b
= NAMESPACE_LEVEL (current
);
1884 while (TREE_CHAIN (last
))
1885 last
= TREE_CHAIN (last
);
1886 TREE_CHAIN (last
) = NAMESPACE_LEVEL (current
) -> names
;
1890 /* Subroutines for reverting temporarily to top-level for instantiation
1891 of templates and such. We actually need to clear out the class- and
1892 local-value slots of all identifiers, so that only the global values
1893 are at all visible. Simply setting current_binding_level to the global
1894 scope isn't enough, because more binding levels may be pushed. */
1895 struct saved_scope
{
1896 struct binding_level
*old_binding_level
;
1899 struct saved_scope
*prev
;
1900 tree class_name
, class_type
;
1901 tree access_specifier
;
1903 struct binding_level
*class_bindings
;
1904 tree
*lang_base
, *lang_stack
, lang_name
;
1906 int minimal_parse_mode
;
1907 tree last_function_parms
;
1908 tree template_parms
;
1909 HOST_WIDE_INT processing_template_decl
;
1910 tree previous_class_type
, previous_class_values
;
1911 int processing_specialization
;
1912 int processing_explicit_instantiation
;
1914 static struct saved_scope
*current_saved_scope
;
1916 /* A chain of the binding vecs created by store_bindings. We create a
1917 whole bunch of these during compilation, on permanent_obstack, so we
1918 can't just throw them away. */
1919 static tree free_binding_vecs
;
1922 store_bindings (names
, old_bindings
)
1923 tree names
, old_bindings
;
1926 for (t
= names
; t
; t
= TREE_CHAIN (t
))
1928 tree binding
, t1
, id
;
1930 if (TREE_CODE (t
) == TREE_LIST
)
1931 id
= TREE_PURPOSE (t
);
1936 || (!IDENTIFIER_LOCAL_VALUE (id
)
1937 && !IDENTIFIER_CLASS_VALUE (id
)))
1940 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
1941 if (TREE_VEC_ELT (t1
, 0) == id
)
1944 if (free_binding_vecs
)
1946 binding
= free_binding_vecs
;
1947 free_binding_vecs
= TREE_CHAIN (free_binding_vecs
);
1950 binding
= make_tree_vec (4);
1954 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
1955 TREE_VEC_ELT (binding
, 0) = id
;
1956 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
1957 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_LOCAL_VALUE (id
);
1958 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
1959 IDENTIFIER_LOCAL_VALUE (id
) = NULL_TREE
;
1960 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
1962 TREE_CHAIN (binding
) = old_bindings
;
1963 old_bindings
= binding
;
1967 return old_bindings
;
1971 maybe_push_to_top_level (pseudo
)
1974 extern int current_lang_stacksize
;
1975 struct saved_scope
*s
1976 = (struct saved_scope
*) xmalloc (sizeof (struct saved_scope
));
1977 struct binding_level
*b
= inner_binding_level
;
1978 tree old_bindings
= NULL_TREE
;
1980 if (current_function_decl
)
1981 push_cp_function_context (NULL_TREE
);
1983 if (previous_class_type
)
1984 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
1986 /* Have to include global_binding_level, because class-level decls
1987 aren't listed anywhere useful. */
1988 for (; b
; b
= b
->level_chain
)
1992 /* Template IDs are inserted into the global level. If they were
1993 inserted into namespace level, finish_file wouldn't find them
1994 when doing pending instantiations. Therefore, don't stop at
1995 namespace level, but continue until :: . */
1996 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
1999 old_bindings
= store_bindings (b
->names
, old_bindings
);
2000 /* We also need to check class_shadowed to save class-level type
2001 bindings, since pushclass doesn't fill in b->names. */
2002 if (b
->parm_flag
== 2)
2003 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2005 /* Unwind type-value slots back to top level. */
2006 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2007 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2010 s
->old_binding_level
= current_binding_level
;
2011 current_binding_level
= b
;
2013 s
->old_namespace
= current_namespace
;
2014 s
->class_name
= current_class_name
;
2015 s
->class_type
= current_class_type
;
2016 s
->access_specifier
= current_access_specifier
;
2017 s
->function_decl
= current_function_decl
;
2018 s
->class_bindings
= class_binding_level
;
2019 s
->lang_stack
= current_lang_stack
;
2020 s
->lang_base
= current_lang_base
;
2021 s
->lang_stacksize
= current_lang_stacksize
;
2022 s
->lang_name
= current_lang_name
;
2023 s
->minimal_parse_mode
= minimal_parse_mode
;
2024 s
->last_function_parms
= last_function_parms
;
2025 s
->template_parms
= current_template_parms
;
2026 s
->processing_template_decl
= processing_template_decl
;
2027 s
->previous_class_type
= previous_class_type
;
2028 s
->previous_class_values
= previous_class_values
;
2029 s
->processing_specialization
= processing_specialization
;
2030 s
->processing_explicit_instantiation
= processing_explicit_instantiation
;
2032 current_class_name
= current_class_type
= NULL_TREE
;
2033 current_function_decl
= NULL_TREE
;
2034 class_binding_level
= (struct binding_level
*)0;
2035 current_lang_stacksize
= 10;
2036 current_lang_stack
= current_lang_base
2037 = (tree
*) xmalloc (current_lang_stacksize
* sizeof (tree
));
2038 current_lang_name
= lang_name_cplusplus
;
2039 strict_prototype
= strict_prototypes_lang_cplusplus
;
2040 named_labels
= NULL_TREE
;
2041 shadowed_labels
= NULL_TREE
;
2042 minimal_parse_mode
= 0;
2043 previous_class_type
= previous_class_values
= NULL_TREE
;
2044 processing_specialization
= 0;
2045 processing_explicit_instantiation
= 0;
2046 current_template_parms
= NULL_TREE
;
2047 processing_template_decl
= 0;
2048 current_namespace
= global_namespace
;
2050 s
->prev
= current_saved_scope
;
2051 s
->old_bindings
= old_bindings
;
2052 current_saved_scope
= s
;
2054 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2058 push_to_top_level ()
2060 maybe_push_to_top_level (0);
2064 pop_from_top_level ()
2066 extern int current_lang_stacksize
;
2067 struct saved_scope
*s
= current_saved_scope
;
2070 /* Clear out class-level bindings cache. */
2071 if (previous_class_type
)
2074 previous_class_type
= NULL_TREE
;
2079 current_binding_level
= s
->old_binding_level
;
2080 current_saved_scope
= s
->prev
;
2081 for (t
= s
->old_bindings
; t
; )
2084 tree id
= TREE_VEC_ELT (t
, 0);
2087 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2088 IDENTIFIER_LOCAL_VALUE (id
) = TREE_VEC_ELT (t
, 2);
2089 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2092 TREE_CHAIN (save
) = free_binding_vecs
;
2093 free_binding_vecs
= save
;
2095 current_namespace
= s
->old_namespace
;
2096 current_class_name
= s
->class_name
;
2097 current_class_type
= s
->class_type
;
2098 current_access_specifier
= s
->access_specifier
;
2099 current_function_decl
= s
->function_decl
;
2100 class_binding_level
= s
->class_bindings
;
2101 free (current_lang_base
);
2102 current_lang_base
= s
->lang_base
;
2103 current_lang_stack
= s
->lang_stack
;
2104 current_lang_name
= s
->lang_name
;
2105 current_lang_stacksize
= s
->lang_stacksize
;
2106 if (current_lang_name
== lang_name_cplusplus
)
2107 strict_prototype
= strict_prototypes_lang_cplusplus
;
2108 else if (current_lang_name
== lang_name_c
)
2109 strict_prototype
= strict_prototypes_lang_c
;
2110 minimal_parse_mode
= s
->minimal_parse_mode
;
2111 last_function_parms
= s
->last_function_parms
;
2112 current_template_parms
= s
->template_parms
;
2113 processing_template_decl
= s
->processing_template_decl
;
2114 previous_class_type
= s
->previous_class_type
;
2115 previous_class_values
= s
->previous_class_values
;
2116 processing_specialization
= s
->processing_specialization
;
2117 processing_explicit_instantiation
= s
->processing_explicit_instantiation
;
2121 if (current_function_decl
)
2122 pop_cp_function_context (NULL_TREE
);
2125 /* Push a definition of struct, union or enum tag "name".
2126 into binding_level "b". "type" should be the type node,
2127 We assume that the tag "name" is not already defined.
2129 Note that the definition may really be just a forward reference.
2130 In that case, the TYPE_SIZE will be a NULL_TREE.
2132 C++ gratuitously puts all these tags in the name space. */
2134 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2135 record the shadowed value for this binding contour. TYPE is
2136 the type that ID maps to. */
2139 set_identifier_type_value_with_scope (id
, type
, b
)
2142 struct binding_level
*b
;
2144 if (!b
->namespace_p
)
2146 /* Shadow the marker, not the real thing, so that the marker
2147 gets restored later. */
2148 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2150 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2154 tree binding
= binding_for_name (id
, current_namespace
);
2155 BINDING_TYPE (binding
) = type
;
2156 /* Store marker instead of real type. */
2157 type
= global_type_node
;
2159 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2162 /* As set_identifier_type_value_with_scope, but using inner_binding_level. */
2165 set_identifier_type_value (id
, type
)
2169 set_identifier_type_value_with_scope (id
, type
, inner_binding_level
);
2173 set_identifier_local_value_with_scope (id
, val
, b
)
2175 struct binding_level
*b
;
2178 my_friendly_assert (! b
->namespace_p
, 980716);
2180 oldlocal
= IDENTIFIER_LOCAL_VALUE (id
);
2181 b
->shadowed
= tree_cons (id
, oldlocal
, b
->shadowed
);
2182 IDENTIFIER_LOCAL_VALUE (id
) = val
;
2186 set_identifier_local_value (id
, val
)
2189 set_identifier_local_value_with_scope (id
, val
, current_binding_level
);
2192 /* Return the type associated with id. */
2195 identifier_type_value (id
)
2198 /* There is no type with that name, anywhere. */
2199 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2201 /* This is not the type marker, but the real thing. */
2202 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2203 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2204 /* Have to search for it. It must be on the global level, now.
2205 Ask lookup_name not to return non-types. */
2206 id
= lookup_name_real (id
, 2, 1, 0);
2208 return TREE_TYPE (id
);
2212 /* Pop off extraneous binding levels left over due to syntax errors.
2214 We don't pop past namespaces, as they might be valid. */
2219 #ifdef DEBUG_CP_BINDING_LEVELS
2220 fprintf (stderr
, "XXX entering pop_everything ()\n");
2222 while (! toplevel_bindings_p () && ! pseudo_global_level_p ())
2224 if (class_binding_level
)
2225 pop_nested_class (1);
2229 #ifdef DEBUG_CP_BINDING_LEVELS
2230 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2234 /* The type TYPE is being declared. If it is a class template, or a
2235 specialization of a class template, do any processing required and
2236 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2237 being declared a friend. B is the binding level at which this TYPE
2240 Returns the TYPE_DECL for TYPE, which may have been altered by this
2244 maybe_process_template_type_declaration (type
, globalize
, b
)
2247 struct binding_level
* b
;
2249 tree decl
= TYPE_NAME (type
);
2251 if (processing_template_parmlist
)
2252 /* You can't declare a new template type in a template parameter
2253 list. But, you can declare a non-template type:
2255 template <class A*> struct S;
2257 is a forward-declaration of `A'. */
2261 maybe_check_template_type (type
);
2263 my_friendly_assert (IS_AGGR_TYPE (type
)
2264 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2267 if (/* If !GLOBALIZE then we are looking at a definition.
2268 It may not be a primary template. (For example, in:
2271 struct S1 { class S2 {}; }
2273 we have to push_template_decl for S2.) */
2274 (processing_template_decl
&& !globalize
)
2275 /* If we are declaring a friend template class, we will
2276 have GLOBALIZE set, since something like:
2284 declares S2 to be at global scope. */
2285 || PROCESSING_REAL_TEMPLATE_DECL_P ())
2287 /* This may change after the call to
2288 push_template_decl_real, but we want the original value. */
2289 tree name
= DECL_NAME (decl
);
2291 decl
= push_template_decl_real (decl
, globalize
);
2292 /* If the current binding level is the binding level for the
2293 template parameters (see the comment in
2294 begin_template_parm_list) and the enclosing level is a class
2295 scope, and we're not looking at a friend, push the
2296 declaration of the member class into the class scope. In the
2297 friend case, push_template_decl will already have put the
2298 friend into global scope, if appropriate. */
2299 if (TREE_CODE (type
) != ENUMERAL_TYPE
2300 && !globalize
&& b
->pseudo_global
2301 && b
->level_chain
->parm_flag
== 2)
2303 pushdecl_with_scope (CLASSTYPE_TI_TEMPLATE (type
),
2305 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2306 /* Put this tag on the list of tags for the class, since
2307 that won't happen below because B is not the class
2308 binding level, but is instead the pseudo-global level. */
2309 b
->level_chain
->tags
=
2310 saveable_tree_cons (name
, type
, b
->level_chain
->tags
);
2311 TREE_NONLOCAL_FLAG (type
) = 1;
2312 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2313 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2321 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2322 Normally put it into the inner-most non-tag-transparent scope,
2323 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2324 The latter is needed for implicit declarations. */
2327 pushtag (name
, type
, globalize
)
2331 register struct binding_level
*b
;
2335 b
= inner_binding_level
;
2336 while (b
->tag_transparent
2337 || (globalize
&& b
->parm_flag
== 2))
2340 if (toplevel_bindings_p ())
2341 b
->tags
= perm_tree_cons (name
, type
, b
->tags
);
2343 b
->tags
= saveable_tree_cons (name
, type
, b
->tags
);
2347 context
= type
? TYPE_CONTEXT (type
) : NULL_TREE
;
2350 tree cs
= current_scope ();
2354 else if (cs
!= NULL_TREE
2355 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2356 /* When declaring a friend class of a local class, we want
2357 to inject the newly named class into the scope
2358 containing the local class, not the namespace scope. */
2359 context
= hack_decl_function_context (get_type_decl (cs
));
2362 c_decl
= TREE_CODE (context
) == FUNCTION_DECL
2363 ? context
: TYPE_MAIN_DECL (context
);
2366 context
= current_namespace
;
2368 /* Do C++ gratuitous typedefing. */
2369 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2371 register tree d
= NULL_TREE
;
2372 int newdecl
= 0, in_class
= 0;
2374 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2375 || b
->parm_flag
== 2)
2378 d
= lookup_nested_type (type
, c_decl
);
2383 d
= build_decl (TYPE_DECL
, name
, type
);
2384 if (current_lang_name
== lang_name_java
)
2385 TYPE_FOR_JAVA (type
) = 1;
2386 SET_DECL_ARTIFICIAL (d
);
2388 set_identifier_type_value_with_scope (name
, type
, b
);
2391 d
= TYPE_MAIN_DECL (d
);
2393 TYPE_NAME (type
) = d
;
2394 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2396 d
= maybe_process_template_type_declaration (type
,
2399 if (b
->parm_flag
== 2)
2401 pushdecl_class_level (d
);
2402 if (newdecl
&& !PROCESSING_REAL_TEMPLATE_DECL_P ())
2403 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2404 class. But if it's a member template class, we
2405 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2407 finish_member_declaration (d
);
2410 d
= pushdecl_with_scope (d
, b
);
2414 if (ANON_AGGRNAME_P (name
))
2415 DECL_IGNORED_P (d
) = 1;
2417 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2418 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2419 if (!uses_template_parms (type
))
2420 DECL_ASSEMBLER_NAME (d
)
2421 = get_identifier (build_overload_name (type
, 1, 1));
2424 if (b
->parm_flag
== 2)
2426 TREE_NONLOCAL_FLAG (type
) = 1;
2427 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2428 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2432 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2433 /* Use the canonical TYPE_DECL for this node. */
2434 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2437 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2438 will be the tagged type we just added to the current
2439 binding level. This fake NULL-named TYPE_DECL node helps
2440 dwarfout.c to know when it needs to output a
2441 representation of a tagged type, and it also gives us a
2442 convenient place to record the "scope start" address for
2445 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2446 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2450 /* Counter used to create anonymous type names. */
2452 static int anon_cnt
= 0;
2454 /* Return an IDENTIFIER which can be used as a name for
2455 anonymous structs and unions. */
2462 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2463 return get_identifier (buf
);
2466 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2467 This keeps dbxout from getting confused. */
2472 register struct binding_level
*b
;
2474 static int last_cnt
= 0;
2476 /* Fast out if no new anon names were declared. */
2477 if (last_cnt
== anon_cnt
)
2480 b
= current_binding_level
;
2481 while (b
->tag_transparent
)
2486 /* A NULL purpose means we have already processed all tags
2487 from here to the end of the list. */
2488 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2490 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2491 TREE_PURPOSE (tags
) = NULL_TREE
;
2492 tags
= TREE_CHAIN (tags
);
2494 last_cnt
= anon_cnt
;
2497 /* Subroutine of duplicate_decls: return truthvalue of whether
2498 or not types of these decls match.
2500 For C++, we must compare the parameter list so that `int' can match
2501 `int&' in a parameter position, but `int&' is not confused with
2505 decls_match (newdecl
, olddecl
)
2506 tree newdecl
, olddecl
;
2510 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2511 /* If the two DECLs are not even the same kind of thing, we're not
2512 interested in their types. */
2515 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2517 tree f1
= TREE_TYPE (newdecl
);
2518 tree f2
= TREE_TYPE (olddecl
);
2519 tree p1
= TYPE_ARG_TYPES (f1
);
2520 tree p2
= TYPE_ARG_TYPES (f2
);
2522 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2523 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2524 && DECL_LANGUAGE (olddecl
) == lang_c
))
2527 /* When we parse a static member function definition,
2528 we put together a FUNCTION_DECL which thinks its type
2529 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2531 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2532 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2533 else if (TREE_CODE (f2
) == METHOD_TYPE
2534 && DECL_STATIC_FUNCTION_P (newdecl
))
2535 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2537 /* Here we must take care of the case where new default
2538 parameters are specified. Also, warn if an old
2539 declaration becomes ambiguous because default
2540 parameters may cause the two to be ambiguous. */
2541 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2543 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2544 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2546 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2550 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2552 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2555 types_match
= self_promoting_args_p (p1
);
2556 if (p1
== void_list_node
)
2557 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2559 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2560 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2562 types_match
= self_promoting_args_p (p2
);
2563 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2566 types_match
= compparms (p1
, p2
);
2571 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2573 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2574 DECL_TEMPLATE_PARMS (olddecl
)))
2577 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2580 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2581 DECL_TEMPLATE_RESULT (newdecl
));
2585 if (TREE_TYPE (newdecl
) == error_mark_node
)
2586 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2587 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2588 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2589 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2592 types_match
= comptypes (TREE_TYPE (newdecl
),
2593 TREE_TYPE (olddecl
),
2594 COMPARE_REDECLARATION
);
2600 /* If NEWDECL is `static' and an `extern' was seen previously,
2601 warn about it. (OLDDECL may be NULL_TREE; NAME contains
2602 information about previous usage as an `extern'.)
2604 Note that this does not apply to the C++ case of declaring
2605 a variable `extern const' and then later `const'.
2607 Don't complain about built-in functions, since they are beyond
2608 the user's control. */
2611 warn_extern_redeclared_static (newdecl
, olddecl
)
2612 tree newdecl
, olddecl
;
2616 static char *explicit_extern_static_warning
2617 = "`%D' was declared `extern' and later `static'";
2618 static char *implicit_extern_static_warning
2619 = "`%D' was declared implicitly `extern' and later `static'";
2621 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2624 name
= DECL_ASSEMBLER_NAME (newdecl
);
2625 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
2627 /* It's okay to redeclare an ANSI built-in function as static,
2628 or to declare a non-ANSI built-in function as anything. */
2629 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
2630 && olddecl
!= NULL_TREE
2631 && TREE_CODE (olddecl
) == FUNCTION_DECL
2632 && (DECL_BUILT_IN (olddecl
)
2633 || DECL_BUILT_IN_NONANSI (olddecl
))))
2635 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2636 ? implicit_extern_static_warning
2637 : explicit_extern_static_warning
, newdecl
);
2638 if (olddecl
!= NULL_TREE
)
2639 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2644 /* Handle when a new declaration NEWDECL has the same name as an old
2645 one OLDDECL in the same binding contour. Prints an error message
2648 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2649 Otherwise, return 0. */
2652 duplicate_decls (newdecl
, olddecl
)
2653 tree newdecl
, olddecl
;
2655 extern struct obstack permanent_obstack
;
2656 unsigned olddecl_uid
= DECL_UID (olddecl
);
2657 int olddecl_friend
= 0, types_match
= 0;
2658 int new_defines_function
= 0;
2660 if (newdecl
== olddecl
)
2663 types_match
= decls_match (newdecl
, olddecl
);
2665 /* If either the type of the new decl or the type of the old decl is an
2666 error_mark_node, then that implies that we have already issued an
2667 error (earlier) for some bogus type specification, and in that case,
2668 it is rather pointless to harass the user with yet more error message
2669 about the same declaration, so just pretend the types match here. */
2670 if (TREE_TYPE (newdecl
) == error_mark_node
2671 || TREE_TYPE (olddecl
) == error_mark_node
)
2674 /* Check for redeclaration and other discrepancies. */
2675 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2676 && DECL_ARTIFICIAL (olddecl
)
2677 && (DECL_BUILT_IN (olddecl
) || DECL_BUILT_IN_NONANSI (olddecl
)))
2679 /* If you declare a built-in or predefined function name as static,
2680 the old definition is overridden, but optionally warn this was a
2681 bad choice of name. Ditto for overloads. */
2682 if (! TREE_PUBLIC (newdecl
)
2683 || (TREE_CODE (newdecl
) == FUNCTION_DECL
2684 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
)))
2687 cp_warning ("shadowing %s function `%#D'",
2688 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2690 /* Discard the old built-in function. */
2693 else if (! types_match
)
2695 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2697 /* If the built-in is not ansi, then programs can override
2698 it even globally without an error. */
2699 if (! DECL_BUILT_IN (olddecl
))
2700 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2704 cp_error ("declaration of `%#D'", newdecl
);
2705 cp_error ("conflicts with built-in declaration `%#D'",
2711 cp_warning ("declaration of `%#D'", newdecl
);
2712 cp_warning ("conflicts with built-in declaration `%#D'",
2716 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
2718 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
2719 && TREE_CODE (newdecl
) != TYPE_DECL
2720 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
2721 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
2722 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
2723 && TREE_CODE (olddecl
) != TYPE_DECL
2724 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
2725 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
2728 /* We do nothing special here, because C++ does such nasty
2729 things with TYPE_DECLs. Instead, just let the TYPE_DECL
2730 get shadowed, and know that if we need to find a TYPE_DECL
2731 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
2732 slot of the identifier. */
2736 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
2737 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
2738 || (TREE_CODE (olddecl
) == FUNCTION_DECL
2739 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
2742 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
2743 if (TREE_CODE (olddecl
) == TREE_LIST
)
2744 olddecl
= TREE_VALUE (olddecl
);
2745 cp_error_at ("previous declaration of `%#D'", olddecl
);
2747 /* New decl is completely inconsistent with the old one =>
2748 tell caller to replace the old one. */
2752 else if (!types_match
)
2754 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2756 /* The name of a class template may not be declared to refer to
2757 any other template, class, function, object, namespace, value,
2758 or type in the same scope. */
2759 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
2760 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2762 cp_error ("declaration of template `%#D'", newdecl
);
2763 cp_error_at ("conflicts with previous declaration `%#D'",
2766 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
2767 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
2768 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
2769 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
2770 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2771 DECL_TEMPLATE_PARMS (olddecl
)))
2773 cp_error ("new declaration `%#D'", newdecl
);
2774 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
2778 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2780 if (DECL_LANGUAGE (newdecl
) == lang_c
2781 && DECL_LANGUAGE (olddecl
) == lang_c
)
2783 cp_error ("declaration of C function `%#D' conflicts with",
2785 cp_error_at ("previous declaration `%#D' here", olddecl
);
2787 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
2788 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
2790 cp_error ("new declaration `%#D'", newdecl
);
2791 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
2797 /* Already complained about this, so don't do so again. */
2798 else if (current_class_type
== NULL_TREE
2799 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
2801 cp_error ("conflicting types for `%#D'", newdecl
);
2802 cp_error_at ("previous declaration as `%#D'", olddecl
);
2805 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
2806 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
2807 && (!DECL_TEMPLATE_INFO (newdecl
)
2808 || (DECL_TI_TEMPLATE (newdecl
)
2809 != DECL_TI_TEMPLATE (olddecl
))))
2810 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
2811 && (!DECL_TEMPLATE_INFO (olddecl
)
2812 || (DECL_TI_TEMPLATE (olddecl
)
2813 != DECL_TI_TEMPLATE (newdecl
))))))
2814 /* It's OK to have a template specialization and a non-template
2815 with the same type, or to have specializations of two
2816 different templates with the same type. Note that if one is a
2817 specialization, and the other is an instantiation of the same
2818 template, that we do not exit at this point. That situation
2819 can occur if we instantiate a template class, and then
2820 specialize one of its methods. This situation is legal, but
2821 the declarations must be merged in the usual way. */
2823 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
2824 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
2825 && !DECL_USE_TEMPLATE (newdecl
))
2826 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
2827 && !DECL_USE_TEMPLATE (olddecl
))))
2828 /* One of the declarations is a template instantiation, and the
2829 other is not a template at all. That's OK. */
2831 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
2832 && DECL_NAMESPACE_ALIAS (newdecl
)
2833 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
2834 /* Redeclaration of namespace alias, ignore it. */
2838 char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
2841 cp_error (errmsg
, newdecl
);
2842 if (DECL_NAME (olddecl
) != NULL_TREE
)
2843 cp_error_at ((DECL_INITIAL (olddecl
)
2844 && namespace_bindings_p ())
2845 ? "`%#D' previously defined here"
2846 : "`%#D' previously declared here", olddecl
);
2848 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
2849 && DECL_INITIAL (olddecl
) != NULL_TREE
2850 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
2851 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
2853 /* Prototype decl follows defn w/o prototype. */
2854 cp_warning_at ("prototype for `%#D'", newdecl
);
2855 cp_warning_at ("follows non-prototype definition here", olddecl
);
2857 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
2858 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
2860 /* extern "C" int foo ();
2861 int foo () { bar (); }
2863 if (current_lang_stack
== current_lang_base
)
2864 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
2867 cp_error_at ("previous declaration of `%#D' with %L linkage",
2868 olddecl
, DECL_LANGUAGE (olddecl
));
2869 cp_error ("conflicts with new declaration with %L linkage",
2870 DECL_LANGUAGE (newdecl
));
2874 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
2876 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
2878 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
2879 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
2882 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
2883 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
2885 for (; t1
&& t1
!= void_list_node
;
2886 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
2887 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
2889 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
2894 cp_pedwarn ("default argument given for parameter %d of `%#D'",
2896 cp_pedwarn_at ("after previous specification in `%#D'",
2902 cp_error ("default argument given for parameter %d of `%#D'",
2904 cp_error_at ("after previous specification in `%#D'",
2909 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
2910 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
2912 cp_warning ("`%#D' was used before it was declared inline",
2914 cp_warning_at ("previous non-inline declaration here",
2920 /* If new decl is `static' and an `extern' was seen previously,
2922 warn_extern_redeclared_static (newdecl
, olddecl
);
2924 /* We have committed to returning 1 at this point. */
2925 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2927 /* Now that functions must hold information normally held
2928 by field decls, there is extra work to do so that
2929 declaration information does not get destroyed during
2931 if (DECL_VINDEX (olddecl
))
2932 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
2933 if (DECL_CONTEXT (olddecl
))
2934 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
2935 if (DECL_CLASS_CONTEXT (olddecl
))
2936 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
2937 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
2938 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
2939 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
2940 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
2941 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
2942 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
2943 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
2944 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
2946 /* Optionally warn about more than one declaration for the same
2947 name, but don't warn about a function declaration followed by a
2949 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
2950 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
2951 /* Don't warn about extern decl followed by definition. */
2952 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
2953 /* Don't warn about friends, let add_friend take care of it. */
2954 && ! DECL_FRIEND_P (newdecl
))
2956 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
2957 cp_warning_at ("previous declaration of `%D'", olddecl
);
2961 /* Deal with C++: must preserve virtual function table size. */
2962 if (TREE_CODE (olddecl
) == TYPE_DECL
)
2964 register tree newtype
= TREE_TYPE (newdecl
);
2965 register tree oldtype
= TREE_TYPE (olddecl
);
2967 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
2968 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
2970 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
2971 CLASSTYPE_FRIEND_CLASSES (newtype
)
2972 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
2976 /* Copy all the DECL_... slots specified in the new decl
2977 except for any that we copy here from the old type. */
2978 DECL_MACHINE_ATTRIBUTES (newdecl
)
2979 = merge_machine_decl_attributes (olddecl
, newdecl
);
2981 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2983 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
2984 DECL_TEMPLATE_RESULT (olddecl
)))
2985 cp_error ("invalid redeclaration of %D", newdecl
);
2986 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
2987 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
2988 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
2989 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
2996 /* Automatically handles default parameters. */
2997 tree oldtype
= TREE_TYPE (olddecl
);
3000 /* Make sure we put the new type in the same obstack as the old one. */
3002 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3005 push_obstacks_nochange ();
3006 end_temporary_allocation ();
3009 /* Merge the data types specified in the two decls. */
3010 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3012 if (TREE_CODE (newdecl
) == VAR_DECL
)
3013 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3014 /* Do this after calling `common_type' so that default
3015 parameters don't confuse us. */
3016 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3017 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3018 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3020 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3021 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3022 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3023 TYPE_RAISES_EXCEPTIONS (oldtype
));
3025 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3026 && DECL_SOURCE_LINE (olddecl
) != 0
3028 && ! compexcepttypes (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
3030 cp_pedwarn ("declaration of `%D' throws different exceptions",
3032 cp_pedwarn_at ("previous declaration here", olddecl
);
3035 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3037 /* Lay the type out, unless already done. */
3038 if (newtype
!= canonical_type_variant (oldtype
)
3039 && TREE_TYPE (newdecl
) != error_mark_node
3040 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3041 layout_type (TREE_TYPE (newdecl
));
3043 if ((TREE_CODE (newdecl
) == VAR_DECL
3044 || TREE_CODE (newdecl
) == PARM_DECL
3045 || TREE_CODE (newdecl
) == RESULT_DECL
3046 || TREE_CODE (newdecl
) == FIELD_DECL
3047 || TREE_CODE (newdecl
) == TYPE_DECL
)
3048 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3049 layout_decl (newdecl
, 0);
3051 /* Merge the type qualifiers. */
3052 if (TREE_READONLY (newdecl
))
3053 TREE_READONLY (olddecl
) = 1;
3054 if (TREE_THIS_VOLATILE (newdecl
))
3055 TREE_THIS_VOLATILE (olddecl
) = 1;
3057 /* Merge the initialization information. */
3058 if (DECL_INITIAL (newdecl
) == NULL_TREE
3059 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3061 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3062 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3063 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3064 if (DECL_LANG_SPECIFIC (newdecl
)
3065 && DECL_LANG_SPECIFIC (olddecl
))
3066 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3069 /* Merge the section attribute.
3070 We want to issue an error if the sections conflict but that must be
3071 done later in decl_attributes since we are called before attributes
3073 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3074 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3076 /* Keep the old rtl since we can safely use it, unless it's the
3077 call to abort() used for abstract virtuals. */
3078 if ((DECL_LANG_SPECIFIC (olddecl
)
3079 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3080 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
3081 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3085 /* If cannot merge, then use the new type and qualifiers,
3086 and don't preserve the old rtl. */
3089 /* Clean out any memory we had of the old declaration. */
3090 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3092 TREE_VALUE (oldstatic
) = error_mark_node
;
3094 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3095 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3096 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3097 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3100 /* Merge the storage class information. */
3101 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3102 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3103 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3104 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3105 if (! DECL_EXTERNAL (olddecl
))
3106 DECL_EXTERNAL (newdecl
) = 0;
3108 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3110 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3111 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3112 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3113 /* Don't really know how much of the language-specific
3114 values we should copy from old to new. */
3115 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3116 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3117 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3118 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3119 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3122 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3124 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3125 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3127 /* If newdecl is not a specialization, then it is not a
3128 template-related function at all. And that means that we
3129 shoud have exited above, returning 0. */
3130 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3133 if (TREE_USED (olddecl
))
3134 /* From [temp.expl.spec]:
3136 If a template, a member template or the member of a class
3137 template is explicitly specialized then that
3138 specialization shall be declared before the first use of
3139 that specialization that would cause an implicit
3140 instantiation to take place, in every translation unit in
3141 which such a use occurs. */
3142 cp_error ("explicit specialization of %D after first use",
3145 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3147 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3149 /* If either decl says `inline', this fn is inline, unless its
3150 definition was passed already. */
3151 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3152 DECL_INLINE (olddecl
) = 1;
3153 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3157 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3158 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3159 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3161 if (! types_match
|| new_defines_function
)
3163 /* These need to be copied so that the names are available. */
3164 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3165 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3167 if (new_defines_function
)
3168 /* If defining a function declared with other language
3169 linkage, use the previously declared language linkage. */
3170 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3173 /* If redeclaring a builtin function, and not a definition,
3174 it stays built in. */
3175 if (DECL_BUILT_IN (olddecl
))
3177 DECL_BUILT_IN (newdecl
) = 1;
3178 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3179 /* If we're keeping the built-in definition, keep the rtl,
3180 regardless of declaration matches. */
3181 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3184 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3186 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3187 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3188 /* Previously saved insns go together with
3189 the function's previous definition. */
3190 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3191 /* Don't clear out the arguments if we're redefining a function. */
3192 if (DECL_ARGUMENTS (olddecl
))
3193 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3195 if (DECL_LANG_SPECIFIC (olddecl
))
3196 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3199 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3201 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3204 /* Now preserve various other info from the definition. */
3205 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3206 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3207 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3208 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3210 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3213 struct lang_decl
*ol
= DECL_LANG_SPECIFIC (olddecl
);
3214 struct lang_decl
*nl
= DECL_LANG_SPECIFIC (newdecl
);
3216 function_size
= sizeof (struct tree_decl
);
3218 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3219 (char *) olddecl
+ sizeof (struct tree_common
),
3220 function_size
- sizeof (struct tree_common
));
3222 /* Can we safely free the storage used by newdecl? */
3224 #define ROUND(x) ((x + obstack_alignment_mask (&permanent_obstack)) \
3225 & ~ obstack_alignment_mask (&permanent_obstack))
3227 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3229 /* If newdecl is a template instantiation, it is possible that
3230 the following sequence of events has occurred:
3232 o A friend function was declared in a class template. The
3233 class template was instantiated.
3235 o The instantiation of the friend declaration was
3236 recorded on the instantiation list, and is newdecl.
3238 o Later, however, instantiate_class_template called pushdecl
3239 on the newdecl to perform name injection. But, pushdecl in
3240 turn called duplicate_decls when it discovered that another
3241 declaration of a global function with the same name already
3244 o Here, in duplicate_decls, we decided to clobber newdecl.
3246 If we're going to do that, we'd better make sure that
3247 olddecl, and not newdecl, is on the list of
3248 instantiations so that if we try to do the instantiation
3249 again we won't get the clobbered declaration. */
3251 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3252 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3254 for (; decls
; decls
= TREE_CHAIN (decls
))
3255 if (TREE_VALUE (decls
) == newdecl
)
3256 TREE_VALUE (decls
) = olddecl
;
3259 if (((char *)newdecl
+ ROUND (function_size
) == (char *)nl
3260 && ((char *)newdecl
+ ROUND (function_size
)
3261 + ROUND (sizeof (struct lang_decl
))
3262 == obstack_next_free (&permanent_obstack
)))
3263 || ((char *)newdecl
+ ROUND (function_size
)
3264 == obstack_next_free (&permanent_obstack
)))
3266 DECL_MAIN_VARIANT (newdecl
) = olddecl
;
3267 DECL_LANG_SPECIFIC (olddecl
) = ol
;
3268 bcopy ((char *)nl
, (char *)ol
, sizeof (struct lang_decl
));
3270 obstack_free (&permanent_obstack
, newdecl
);
3272 else if (LANG_DECL_PERMANENT (ol
) && ol
!= nl
)
3274 if (DECL_MAIN_VARIANT (olddecl
) == olddecl
)
3276 /* Save these lang_decls that would otherwise be lost. */
3277 extern tree free_lang_decl_chain
;
3278 tree free_lang_decl
= (tree
) ol
;
3280 if (DECL_LANG_SPECIFIC (olddecl
) == ol
)
3283 TREE_CHAIN (free_lang_decl
) = free_lang_decl_chain
;
3284 free_lang_decl_chain
= free_lang_decl
;
3288 /* Storage leak. */;
3294 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3295 (char *) olddecl
+ sizeof (struct tree_common
),
3296 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3297 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3300 DECL_UID (olddecl
) = olddecl_uid
;
3302 DECL_FRIEND_P (olddecl
) = 1;
3304 /* NEWDECL contains the merged attribute lists.
3305 Update OLDDECL to be the same. */
3306 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3311 /* Record a decl-node X as belonging to the current lexical scope.
3312 Check for errors (such as an incompatible declaration for the same
3313 name already seen in the same scope).
3315 Returns either X or an old decl for the same name.
3316 If an old decl is returned, it may have been smashed
3317 to agree with what X says. */
3324 register tree name
= DECL_ASSEMBLER_NAME (x
);
3325 register struct binding_level
*b
= current_binding_level
;
3327 if (current_function_decl
&& x
!= current_function_decl
3328 /* A local declaration for a function doesn't constitute nesting. */
3329 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3330 /* Don't change DECL_CONTEXT of virtual methods. */
3331 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3332 && ! DECL_CONTEXT (x
))
3333 DECL_CONTEXT (x
) = current_function_decl
;
3334 if (!DECL_CONTEXT (x
))
3335 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3337 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3338 compiler wants to use. */
3339 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3340 || TREE_CODE (x
) == NAMESPACE_DECL
|| TREE_CODE (x
) == TEMPLATE_TYPE_PARM
3341 || TREE_CODE (x
) == TEMPLATE_TEMPLATE_PARM
)
3342 name
= DECL_NAME (x
);
3347 /* Not needed...see below. */
3351 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3352 name
= TREE_OPERAND (name
, 0);
3354 /* Namespace-scoped variables are not found in the current level. */
3355 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3356 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3358 t
= lookup_name_current_level (name
);
3359 if (t
== error_mark_node
)
3361 /* error_mark_node is 0 for a while during initialization! */
3363 cp_error_at ("`%#D' used prior to declaration", x
);
3366 else if (t
!= NULL_TREE
)
3369 /* This is turned off until I have time to do it right (bpk). */
3370 /* With the code below that uses it... */
3371 file
= DECL_SOURCE_FILE (t
);
3372 line
= DECL_SOURCE_LINE (t
);
3374 if (TREE_CODE (t
) == PARM_DECL
)
3376 if (DECL_CONTEXT (t
) == NULL_TREE
)
3377 fatal ("parse errors have confused me too much");
3379 /* Check for duplicate params. */
3380 if (duplicate_decls (x
, t
))
3383 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3384 || DECL_FUNCTION_TEMPLATE_P (x
))
3385 && is_overloaded_fn (t
))
3386 /* Don't do anything just yet. */;
3387 else if (t
== wchar_decl_node
)
3389 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3390 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3392 /* Throw away the redeclaration. */
3395 else if (TREE_CODE (t
) != TREE_CODE (x
))
3397 if (duplicate_decls (x
, t
))
3400 else if (duplicate_decls (x
, t
))
3403 /* This is turned off until I have time to do it right (bpk). */
3405 /* Also warn if they did a prototype with `static' on it, but
3406 then later left the `static' off. */
3407 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3409 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3414 cp_warning ("`static' missing from declaration of `%D'",
3416 warning_with_file_and_line (file
, line
,
3417 "previous declaration of `%s'",
3418 decl_as_string (t
, 0));
3421 /* Now fix things so it'll do what they expect. */
3422 if (current_function_decl
)
3423 TREE_PUBLIC (current_function_decl
) = 0;
3425 /* Due to interference in memory reclamation (X may be
3426 obstack-deallocated at this point), we must guard against
3427 one really special case. [jason: This should be handled
3428 by start_function] */
3429 if (current_function_decl
== x
)
3430 current_function_decl
= t
;
3432 if (TREE_CODE (t
) == TYPE_DECL
)
3433 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3434 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3435 check_default_args (t
);
3439 else if (DECL_MAIN_P (x
))
3441 /* A redeclaration of main, but not a duplicate of the
3446 This function shall not be overloaded. */
3447 cp_error_at ("invalid redeclaration of `%D'", t
);
3448 cp_error ("as `%D'", x
);
3449 /* We don't try to push this declaration since that
3455 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3457 t
= push_overloaded_decl (x
, 1);
3458 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3461 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3462 return push_overloaded_decl (x
, 0);
3464 /* If declaring a type as a typedef, copy the type (unless we're
3465 at line 0), and install this TYPE_DECL as the new type's typedef
3466 name. See the extensive comment in ../c-decl.c (pushdecl). */
3467 if (TREE_CODE (x
) == TYPE_DECL
)
3469 tree type
= TREE_TYPE (x
);
3470 if (DECL_SOURCE_LINE (x
) == 0)
3472 if (TYPE_NAME (type
) == 0)
3473 TYPE_NAME (type
) = x
;
3475 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3476 /* We don't want to copy the type when all we're
3477 doing is making a TYPE_DECL for the purposes of
3479 && (!TYPE_NAME (type
)
3480 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3482 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3484 DECL_ORIGINAL_TYPE (x
) = type
;
3485 type
= build_type_copy (type
);
3486 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3487 TYPE_NAME (type
) = x
;
3488 TREE_TYPE (x
) = type
;
3493 if (type
!= error_mark_node
3495 && TYPE_IDENTIFIER (type
))
3496 set_identifier_type_value_with_scope (DECL_NAME (x
), type
, b
);
3499 /* Multiple external decls of the same identifier ought to match.
3501 We get warnings about inline functions where they are defined.
3502 We get warnings about other functions from push_overloaded_decl.
3504 Avoid duplicate warnings where they are used. */
3505 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3509 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3510 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3511 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3512 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3517 /* If different sort of thing, we already gave an error. */
3518 && TREE_CODE (decl
) == TREE_CODE (x
)
3519 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3521 cp_pedwarn ("type mismatch with previous external decl", x
);
3522 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3526 /* This name is new in its binding level.
3527 Install the new declaration and return it. */
3528 if (namespace_bindings_p ())
3530 /* Install a global value. */
3532 /* If the first global decl has external linkage,
3533 warn if we later see static one. */
3534 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3535 TREE_PUBLIC (name
) = 1;
3537 /* Don't install an artificial TYPE_DECL if we already have
3538 another _DECL with that name. */
3539 if (TREE_CODE (x
) != TYPE_DECL
3541 || ! DECL_ARTIFICIAL (x
))
3543 if (TREE_CODE (x
) == FUNCTION_DECL
)
3545 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3546 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3547 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3550 /* Don't forget if the function was used via an implicit decl. */
3551 if (IDENTIFIER_IMPLICIT_DECL (name
)
3552 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3555 /* Don't forget if its address was taken in that way. */
3556 if (IDENTIFIER_IMPLICIT_DECL (name
)
3557 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3558 TREE_ADDRESSABLE (x
) = 1;
3560 /* Warn about mismatches against previous implicit decl. */
3561 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3562 /* If this real decl matches the implicit, don't complain. */
3563 && ! (TREE_CODE (x
) == FUNCTION_DECL
3564 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3566 ("`%D' was previously implicitly declared to return `int'", x
);
3568 /* If new decl is `static' and an `extern' was seen previously,
3570 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3571 warn_extern_redeclared_static (x
, t
);
3575 /* Here to install a non-global value. */
3576 tree oldlocal
= IDENTIFIER_LOCAL_VALUE (name
);
3577 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3579 /* Don't install an artificial TYPE_DECL if we already have
3580 another _DECL with that name. */
3581 if (TREE_CODE (x
) != TYPE_DECL
3583 || ! DECL_ARTIFICIAL (x
))
3584 set_identifier_local_value_with_scope (name
, x
, b
);
3586 /* If this is a TYPE_DECL, push it into the type value slot. */
3587 if (TREE_CODE (x
) == TYPE_DECL
)
3588 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
), b
);
3590 /* Clear out any TYPE_DECL shadowed by a namespace so that
3591 we won't think this is a type. The C struct hack doesn't
3592 go through namespaces. */
3593 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3594 set_identifier_type_value_with_scope (name
, NULL_TREE
, b
);
3596 /* If this is an extern function declaration, see if we
3597 have a global definition or declaration for the function. */
3598 if (oldlocal
== NULL_TREE
3599 && DECL_EXTERNAL (x
)
3600 && oldglobal
!= NULL_TREE
3601 && TREE_CODE (x
) == FUNCTION_DECL
3602 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3604 /* We have one. Their types must agree. */
3605 if (decls_match (x
, oldglobal
))
3609 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3610 cp_warning_at ("global declaration `%#D'", oldglobal
);
3613 /* If we have a local external declaration,
3614 and no file-scope declaration has yet been seen,
3615 then if we later have a file-scope decl it must not be static. */
3616 if (oldlocal
== NULL_TREE
3617 && oldglobal
== NULL_TREE
3618 && DECL_EXTERNAL (x
)
3621 TREE_PUBLIC (name
) = 1;
3624 if (DECL_FROM_INLINE (x
))
3625 /* Inline decls shadow nothing. */;
3627 /* Warn if shadowing an argument at the top level of the body. */
3628 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3629 && TREE_CODE (oldlocal
) == PARM_DECL
3630 && TREE_CODE (x
) != PARM_DECL
)
3632 /* Go to where the parms should be and see if we
3634 struct binding_level
*b
= current_binding_level
->level_chain
;
3640 if (b
->parm_flag
== 1)
3641 cp_error ("declaration of `%#D' shadows a parameter", name
);
3643 else if (warn_shadow
&& oldlocal
!= NULL_TREE
&& b
->is_for_scope
3644 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3646 warning ("variable `%s' shadows local",
3647 IDENTIFIER_POINTER (name
));
3648 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3650 /* Maybe warn if shadowing something else. */
3651 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3652 /* No shadow warnings for internally generated vars. */
3653 && ! DECL_ARTIFICIAL (x
)
3654 /* No shadow warnings for vars made for inlining. */
3655 && ! DECL_FROM_INLINE (x
))
3657 char *warnstring
= NULL
;
3659 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
3660 warnstring
= "declaration of `%s' shadows a parameter";
3661 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
3662 && current_class_ptr
3663 && !TREE_STATIC (name
))
3664 warnstring
= "declaration of `%s' shadows a member of `this'";
3665 else if (oldlocal
!= NULL_TREE
)
3666 warnstring
= "declaration of `%s' shadows previous local";
3667 else if (oldglobal
!= NULL_TREE
)
3668 /* XXX shadow warnings in outer-more namespaces */
3669 warnstring
= "declaration of `%s' shadows global declaration";
3672 warning (warnstring
, IDENTIFIER_POINTER (name
));
3674 /* Check to see if decl redeclares a template parameter. */
3675 if (oldlocal
&& (current_class_type
|| current_function_decl
)
3676 && current_template_parms
)
3678 if (decl_template_parm_p (oldlocal
))
3680 cp_error ("re-using name of template parameter `%T' in this scope", name
);
3681 cp_error_at (" previously declared here `%#D'", oldlocal
);
3686 if (TREE_CODE (x
) == FUNCTION_DECL
)
3687 check_default_args (x
);
3689 /* Keep count of variables in this level with incomplete type. */
3690 if (TREE_CODE (x
) == VAR_DECL
3691 && TREE_TYPE (x
) != error_mark_node
3692 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
3693 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
3694 /* RTTI TD entries are created while defining the type_info. */
3695 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
3696 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
3697 b
->incomplete
= tree_cons (NULL_TREE
, x
, b
->incomplete
);
3700 /* Put decls on list in reverse order.
3701 We will reverse them later if necessary. */
3702 TREE_CHAIN (x
) = b
->names
;
3704 if (! (b
!= global_binding_level
|| TREE_PERMANENT (x
)))
3705 my_friendly_abort (124);
3710 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
3711 caller to set DECL_CONTEXT properly. */
3714 pushdecl_with_scope (x
, level
)
3716 struct binding_level
*level
;
3718 register struct binding_level
*b
;
3719 tree function_decl
= current_function_decl
;
3721 current_function_decl
= NULL_TREE
;
3722 if (level
->parm_flag
== 2)
3724 b
= class_binding_level
;
3725 class_binding_level
= level
;
3726 pushdecl_class_level (x
);
3727 class_binding_level
= b
;
3731 b
= current_binding_level
;
3732 current_binding_level
= level
;
3734 current_binding_level
= b
;
3736 current_function_decl
= function_decl
;
3740 /* Like pushdecl, only it places X in the current namespace,
3744 pushdecl_namespace_level (x
)
3747 register struct binding_level
*b
= inner_binding_level
;
3750 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
3752 /* Now, the type_shadowed stack may screw us. Munge it so it does
3754 if (TREE_CODE (x
) == TYPE_DECL
)
3756 tree name
= DECL_NAME (x
);
3758 tree
*ptr
= (tree
*)0;
3759 for (; b
!= global_binding_level
; b
= b
->level_chain
)
3761 tree shadowed
= b
->type_shadowed
;
3762 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
3763 if (TREE_PURPOSE (shadowed
) == name
)
3765 ptr
= &TREE_VALUE (shadowed
);
3766 /* Can't break out of the loop here because sometimes
3767 a binding level will have duplicate bindings for
3768 PT names. It's gross, but I haven't time to fix it. */
3771 newval
= TREE_TYPE (x
);
3772 if (ptr
== (tree
*)0)
3774 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3775 up here if this is changed to an assertion. --KR */
3776 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
3786 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
3790 pushdecl_top_level (x
)
3793 tree cur_namespace
= current_namespace
;
3794 current_namespace
= global_namespace
;
3795 x
= pushdecl_namespace_level (x
);
3796 current_namespace
= cur_namespace
;
3800 /* Make the declaration of X appear in CLASS scope. */
3803 pushdecl_class_level (x
)
3806 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
3807 scope looks for the pre-mangled name. */
3808 register tree name
= DECL_NAME (x
);
3812 if (TYPE_BEING_DEFINED (current_class_type
))
3814 /* A name N used in a class S shall refer to the same declaration
3815 in its context and when re-evaluated in the completed scope of S.
3816 Types, enums, and static vars are checked here; other
3817 members are checked in finish_struct. */
3818 tree icv
= IDENTIFIER_CLASS_VALUE (name
);
3819 tree ilv
= IDENTIFIER_LOCAL_VALUE (name
);
3822 && flag_optional_diags
3823 /* Don't complain about inherited names. */
3824 && id_in_current_class (name
)
3825 /* Or shadowed tags. */
3826 && !(DECL_DECLARES_TYPE_P (icv
)
3827 && DECL_CONTEXT (icv
) == current_class_type
))
3829 cp_pedwarn ("declaration of identifier `%D' as `%#D'", name
, x
);
3830 cp_pedwarn_at ("conflicts with previous use in class as `%#D'",
3834 /* Check to see if decl redeclares a template parameter. */
3835 if (ilv
&& ! decls_match (ilv
, x
)
3836 && (current_class_type
|| current_function_decl
)
3837 && current_template_parms
)
3839 if (decl_template_parm_p (ilv
))
3841 cp_error ("re-using name of template parameter `%T' in this scope", name
);
3842 cp_error_at (" previously declared here `%#D'", ilv
);
3847 push_class_level_binding (name
, x
);
3848 if (TREE_CODE (x
) == TYPE_DECL
)
3850 set_identifier_type_value (name
, TREE_TYPE (x
));
3856 /* This function is used to push the mangled decls for nested types into
3857 the appropriate scope. Previously pushdecl_top_level was used, but that
3858 is incorrect for members of local classes. */
3861 pushdecl_nonclass_level (x
)
3864 struct binding_level
*b
= current_binding_level
;
3866 my_friendly_assert (b
->parm_flag
!= 2, 180);
3869 /* Get out of template binding levels */
3870 while (b
->pseudo_global
)
3874 pushdecl_with_scope (x
, b
);
3878 /* Make the declaration(s) of X appear in CLASS scope
3879 under the name NAME. */
3882 push_class_level_binding (name
, x
)
3886 /* The class_binding_level will be NULL if x is a template
3887 parameter name in a member template. */
3888 if (!class_binding_level
)
3891 if (TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3892 && purpose_member (name
, class_binding_level
->class_shadowed
))
3895 maybe_push_cache_obstack ();
3896 class_binding_level
->class_shadowed
3897 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
3898 class_binding_level
->class_shadowed
);
3900 IDENTIFIER_CLASS_VALUE (name
) = x
;
3901 obstack_ptr_grow (&decl_obstack
, x
);
3904 /* Insert another USING_DECL into the current binding level,
3905 returning this declaration. If this is a redeclaration,
3906 do nothing and return NULL_TREE. */
3909 push_using_decl (scope
, name
)
3915 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
3916 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
3917 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
3918 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
3922 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
3923 DECL_INITIAL (decl
) = scope
;
3924 TREE_CHAIN (decl
) = current_binding_level
->usings
;
3925 current_binding_level
->usings
= decl
;
3929 /* Add namespace to using_directives. Return NULL_TREE if nothing was
3930 changed (i.e. there was already a directive), or the fresh
3931 TREE_LIST otherwise. */
3934 push_using_directive (used
)
3937 tree ud
= current_binding_level
->using_directives
;
3938 tree iter
, ancestor
;
3940 /* Check if we already have this. */
3941 if (purpose_member (used
, ud
) != NULL_TREE
)
3944 /* Recursively add all namespaces used. */
3945 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
3946 push_using_directive (TREE_PURPOSE (iter
));
3948 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
3949 ud
= current_binding_level
->using_directives
;
3950 ud
= perm_tree_cons (used
, ancestor
, ud
);
3951 current_binding_level
->using_directives
= ud
;
3955 /* DECL is a FUNCTION_DECL which may have other definitions already in
3956 place. We get around this by making the value of the identifier point
3957 to a list of all the things that want to be referenced by that name. It
3958 is then up to the users of that name to decide what to do with that
3961 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
3962 slot. It is dealt with the same way.
3964 The value returned may be a previous declaration if we guessed wrong
3965 about what language DECL should belong to (C or C++). Otherwise,
3966 it's always DECL (and never something that's not a _DECL). */
3969 push_overloaded_decl (decl
, forgettable
)
3973 tree orig_name
= DECL_NAME (decl
);
3975 int doing_global
= (namespace_bindings_p () || ! forgettable
);
3979 old
= namespace_binding (orig_name
, DECL_CONTEXT (decl
));
3980 if (old
&& TREE_CODE (old
) == FUNCTION_DECL
3981 && DECL_ARTIFICIAL (old
)
3982 && (DECL_BUILT_IN (old
) || DECL_BUILT_IN_NONANSI (old
)))
3984 if (duplicate_decls (decl
, old
))
3991 old
= IDENTIFIER_LOCAL_VALUE (orig_name
);
3993 if (! purpose_member (orig_name
, current_binding_level
->shadowed
))
3995 current_binding_level
->shadowed
3996 = tree_cons (orig_name
, old
, current_binding_level
->shadowed
);
4003 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4005 tree t
= TREE_TYPE (old
);
4006 if (IS_AGGR_TYPE (t
) && warn_shadow
4007 && (! DECL_IN_SYSTEM_HEADER (decl
)
4008 || ! DECL_IN_SYSTEM_HEADER (old
)))
4009 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4012 else if (is_overloaded_fn (old
))
4016 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4017 if (decl
== OVL_CURRENT (tmp
)
4018 || duplicate_decls (decl
, OVL_CURRENT (tmp
)))
4019 return OVL_CURRENT (tmp
);
4023 cp_error_at ("previous non-function declaration `%#D'", old
);
4024 cp_error ("conflicts with function declaration `%#D'", decl
);
4029 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4031 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4032 old
= ovl_cons (old
, NULL_TREE
);
4033 old
= ovl_cons (decl
, old
);
4036 /* orig_name is not ambiguous. */
4040 set_namespace_binding (orig_name
, current_namespace
, old
);
4042 IDENTIFIER_LOCAL_VALUE (orig_name
) = old
;
4047 /* Generate an implicit declaration for identifier FUNCTIONID
4048 as a function of type int (). Print a warning if appropriate. */
4051 implicitly_declare (functionid
)
4055 int temp
= allocation_temporary_p ();
4057 push_obstacks_nochange ();
4059 /* Save the decl permanently so we can warn if definition follows.
4060 In ANSI C, warn_implicit is usually false, so the saves little space.
4061 But in C++, it's usually true, hence the extra code. */
4062 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4063 end_temporary_allocation ();
4065 /* We used to reuse an old implicit decl here,
4066 but this loses with inline functions because it can clobber
4067 the saved decl chains. */
4068 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4070 DECL_EXTERNAL (decl
) = 1;
4071 TREE_PUBLIC (decl
) = 1;
4073 /* ANSI standard says implicit declarations are in the innermost block.
4074 So we record the decl in the standard fashion. */
4076 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4079 /* Only one warning per identifier. */
4080 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4082 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4085 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4092 /* Return zero if the declaration NEWDECL is valid
4093 when the declaration OLDDECL (assumed to be for the same name)
4094 has already been seen.
4095 Otherwise return an error message format string with a %s
4096 where the identifier should go. */
4099 redeclaration_error_message (newdecl
, olddecl
)
4100 tree newdecl
, olddecl
;
4102 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4104 /* Because C++ can put things into name space for free,
4105 constructs like "typedef struct foo { ... } foo"
4106 would look like an erroneous redeclaration. */
4107 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4110 return "redefinition of `%#D'";
4112 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4114 /* If this is a pure function, its olddecl will actually be
4115 the original initialization to `0' (which we force to call
4116 abort()). Don't complain about redefinition in this case. */
4117 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4120 /* If both functions come from different namespaces, this is not
4121 a redeclaration - this is a conflict with a used function. */
4122 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4123 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4124 return "`%D' conflicts with used function";
4126 /* We'll complain about linkage mismatches in
4127 warn_extern_redeclared_static. */
4129 /* Defining the same name twice is no good. */
4130 if (DECL_INITIAL (olddecl
) != NULL_TREE
4131 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4133 if (DECL_NAME (olddecl
) == NULL_TREE
)
4134 return "`%#D' not declared in class";
4136 return "redefinition of `%#D'";
4140 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4142 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4143 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4144 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4145 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4146 && TYPE_SIZE (TREE_TYPE (newdecl
))
4147 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4148 return "redefinition of `%#D'";
4151 else if (toplevel_bindings_p ())
4153 /* Objects declared at top level: */
4154 /* If at least one is a reference, it's ok. */
4155 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4157 /* Reject two definitions. */
4158 return "redefinition of `%#D'";
4162 /* Objects declared with block scope: */
4163 /* Reject two definitions, and reject a definition
4164 together with an external reference. */
4165 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4166 return "redeclaration of `%#D'";
4171 /* Get the LABEL_DECL corresponding to identifier ID as a label.
4172 Create one if none exists so far for the current function.
4173 This function is called for both label definitions and label references. */
4179 register tree decl
= IDENTIFIER_LABEL_VALUE (id
);
4181 if (current_function_decl
== NULL_TREE
)
4183 error ("label `%s' referenced outside of any function",
4184 IDENTIFIER_POINTER (id
));
4188 if ((decl
== NULL_TREE
4189 || DECL_SOURCE_LINE (decl
) == 0)
4190 && (named_label_uses
== NULL
4191 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4192 || named_label_uses
->label_decl
!= decl
))
4194 struct named_label_list
*new_ent
;
4196 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4197 new_ent
->label_decl
= decl
;
4198 new_ent
->names_in_scope
= current_binding_level
->names
;
4199 new_ent
->binding_level
= current_binding_level
;
4200 new_ent
->lineno_o_goto
= lineno
;
4201 new_ent
->filename_o_goto
= input_filename
;
4202 new_ent
->next
= named_label_uses
;
4203 named_label_uses
= new_ent
;
4206 /* Use a label already defined or ref'd with this name. */
4207 if (decl
!= NULL_TREE
)
4209 /* But not if it is inherited and wasn't declared to be inheritable. */
4210 if (DECL_CONTEXT (decl
) != current_function_decl
4211 && ! C_DECLARED_LABEL_FLAG (decl
))
4212 return shadow_label (id
);
4216 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4218 /* Make sure every label has an rtx. */
4221 /* A label not explicitly declared must be local to where it's ref'd. */
4222 DECL_CONTEXT (decl
) = current_function_decl
;
4224 DECL_MODE (decl
) = VOIDmode
;
4226 /* Say where one reference is to the label,
4227 for the sake of the error if it is not defined. */
4228 DECL_SOURCE_LINE (decl
) = lineno
;
4229 DECL_SOURCE_FILE (decl
) = input_filename
;
4231 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4233 named_labels
= tree_cons (NULL_TREE
, decl
, named_labels
);
4234 named_label_uses
->label_decl
= decl
;
4239 /* Make a label named NAME in the current function,
4240 shadowing silently any that may be inherited from containing functions
4241 or containing scopes.
4243 Note that valid use, if the label being shadowed
4244 comes from another scope in the same function,
4245 requires calling declare_nonlocal_label right away. */
4251 register tree decl
= IDENTIFIER_LABEL_VALUE (name
);
4253 if (decl
!= NULL_TREE
)
4255 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4256 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4259 return lookup_label (name
);
4262 /* Define a label, specifying the location in the source file.
4263 Return the LABEL_DECL node for the label, if the definition is valid.
4264 Otherwise return 0. */
4267 define_label (filename
, line
, name
)
4274 if (minimal_parse_mode
)
4276 push_obstacks (&permanent_obstack
, &permanent_obstack
);
4277 decl
= build_decl (LABEL_DECL
, name
, void_type_node
);
4279 DECL_SOURCE_LINE (decl
) = line
;
4280 DECL_SOURCE_FILE (decl
) = filename
;
4285 decl
= lookup_label (name
);
4287 /* After labels, make any new cleanups go into their
4288 own new (temporary) binding contour. */
4289 current_binding_level
->more_cleanups_ok
= 0;
4291 /* If label with this name is known from an outer context, shadow it. */
4292 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) != current_function_decl
)
4294 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4295 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4296 decl
= lookup_label (name
);
4299 if (name
== get_identifier ("wchar_t"))
4300 cp_pedwarn ("label named wchar_t");
4302 if (DECL_INITIAL (decl
) != NULL_TREE
)
4304 cp_error ("duplicate label `%D'", decl
);
4309 struct named_label_list
*uses
, *prev
;
4312 /* Mark label as having been defined. */
4313 DECL_INITIAL (decl
) = error_mark_node
;
4314 /* Say where in the source. */
4315 DECL_SOURCE_FILE (decl
) = filename
;
4316 DECL_SOURCE_LINE (decl
) = line
;
4319 uses
= named_label_uses
;
4320 while (uses
!= NULL
)
4321 if (uses
->label_decl
== decl
)
4323 struct binding_level
*b
= current_binding_level
;
4326 tree new_decls
= b
->names
;
4327 tree old_decls
= (b
== uses
->binding_level
)
4328 ? uses
->names_in_scope
: NULL_TREE
;
4329 while (new_decls
!= old_decls
)
4331 if (TREE_CODE (new_decls
) == VAR_DECL
4332 /* Don't complain about crossing initialization
4333 of internal entities. They can't be accessed,
4334 and they should be cleaned up
4335 by the time we get to the label. */
4336 && ! DECL_ARTIFICIAL (new_decls
)
4337 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4338 && pod_type_p (TREE_TYPE (new_decls
))))
4342 cp_error ("jump to label `%D'", decl
);
4343 error_with_file_and_line (uses
->filename_o_goto
,
4344 uses
->lineno_o_goto
,
4348 if (DECL_INITIAL (new_decls
)
4349 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
)))
4350 cp_error_at (" crosses initialization of `%#D'",
4353 cp_error_at (" enters scope of non-POD `%#D'",
4356 new_decls
= TREE_CHAIN (new_decls
);
4358 if (b
== uses
->binding_level
)
4364 prev
->next
= uses
->next
;
4366 named_label_uses
= uses
->next
;
4375 current_function_return_value
= NULL_TREE
;
4382 struct binding_level
*level
;
4383 struct cp_switch
*next
;
4386 static struct cp_switch
*switch_stack
;
4392 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4393 p
->level
= current_binding_level
;
4394 p
->next
= switch_stack
;
4401 switch_stack
= switch_stack
->next
;
4404 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4405 /* XXX Note decl is never actually used. (bpk) */
4408 define_case_label ()
4410 tree cleanup
= last_cleanup_this_contour ();
4411 struct binding_level
*b
= current_binding_level
;
4416 static int explained
= 0;
4417 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4418 warning ("where case label appears here");
4421 warning ("(enclose actions of previous case statements requiring");
4422 warning ("destructors in their own binding contours.)");
4427 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4429 tree new_decls
= b
->names
;
4430 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4432 if (TREE_CODE (new_decls
) == VAR_DECL
4433 /* Don't complain about crossing initialization
4434 of internal entities. They can't be accessed,
4435 and they should be cleaned up
4436 by the time we get to the label. */
4437 && ! DECL_ARTIFICIAL (new_decls
)
4438 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4439 && DECL_INITIAL (new_decls
) != error_mark_node
)
4440 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4443 error ("jump to case label");
4445 cp_error_at (" crosses initialization of `%#D'",
4451 /* After labels, make any new cleanups go into their
4452 own new (temporary) binding contour. */
4454 current_binding_level
->more_cleanups_ok
= 0;
4455 current_function_return_value
= NULL_TREE
;
4458 /* Return the list of declarations of the current level.
4459 Note that this list is in reverse order unless/until
4460 you nreverse it; and when you do nreverse it, you must
4461 store the result back using `storedecls' or you will lose. */
4466 return current_binding_level
->names
;
4469 /* Return the list of type-tags (for structs, etc) of the current level. */
4474 return current_binding_level
->tags
;
4477 /* Store the list of declarations of the current level.
4478 This is done for the parameter declarations of a function being defined,
4479 after they are modified in the light of any missing parameters. */
4485 current_binding_level
->names
= decls
;
4488 /* Similarly, store the list of tags of the current level. */
4494 current_binding_level
->tags
= tags
;
4497 /* Given NAME, an IDENTIFIER_NODE,
4498 return the structure (or union or enum) definition for that name.
4499 Searches binding levels from BINDING_LEVEL up to the global level.
4500 If THISLEVEL_ONLY is nonzero, searches only the specified context
4501 (but skips any tag-transparent contexts to find one that is
4502 meaningful for tags).
4503 FORM says which kind of type the caller wants;
4504 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4505 If the wrong kind of type is found, and it's not a template, an error is
4509 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4510 enum tree_code form
;
4512 struct binding_level
*binding_level
;
4515 register struct binding_level
*level
;
4516 /* Non-zero if, we should look past a pseudo-global level, even if
4518 int allow_pseudo_global
= 1;
4520 for (level
= binding_level
; level
; level
= level
->level_chain
)
4523 if (ANON_AGGRNAME_P (name
))
4524 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4526 /* There's no need for error checking here, because
4527 anon names are unique throughout the compilation. */
4528 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4529 return TREE_VALUE (tail
);
4531 else if (level
->namespace_p
)
4532 /* Do namespace lookup. */
4533 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4535 tree old
= binding_for_name (name
, tail
);
4537 /* If we just skipped past a pseudo global level, even
4538 though THISLEVEL_ONLY, and we find a template class
4539 declaration, then we use the _TYPE node for the
4540 template. See the example below. */
4541 if (thislevel_only
&& !allow_pseudo_global
4542 && old
&& BINDING_VALUE (old
)
4543 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
4544 old
= TREE_TYPE (BINDING_VALUE (old
));
4546 old
= BINDING_TYPE (old
);
4548 /* If it has an original type, it is a typedef, and we
4549 should not return it. */
4550 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
4552 if (old
&& TREE_CODE (old
) != form
4553 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
4555 cp_error ("`%#D' redeclared as %C", old
, form
);
4560 if (thislevel_only
|| tail
== global_namespace
)
4564 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4566 if (TREE_PURPOSE (tail
) == name
)
4568 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
4569 /* Should tighten this up; it'll probably permit
4570 UNION_TYPE and a struct template, for example. */
4572 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
4574 /* Definition isn't the kind we were looking for. */
4575 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
4579 return TREE_VALUE (tail
);
4582 if (thislevel_only
&& ! level
->tag_transparent
)
4584 if (level
->pseudo_global
&& allow_pseudo_global
)
4586 /* We must deal with cases like this:
4588 template <class T> struct S;
4589 template <class T> struct S {};
4591 When looking up `S', for the second declaration, we
4592 would like to find the first declaration. But, we
4593 are in the pseudo-global level created for the
4594 template parameters, rather than the (surrounding)
4595 namespace level. Thus, we keep going one more level,
4596 even though THISLEVEL_ONLY is non-zero. */
4597 allow_pseudo_global
= 0;
4603 if (current_class_type
&& level
->level_chain
->namespace_p
)
4605 /* Try looking in this class's tags before heading into
4606 global binding level. */
4607 tree context
= current_class_type
;
4610 switch (TREE_CODE_CLASS (TREE_CODE (context
)))
4614 these_tags
= CLASSTYPE_TAGS (context
);
4615 if (ANON_AGGRNAME_P (name
))
4618 if (TYPE_IDENTIFIER (TREE_VALUE (these_tags
))
4620 return TREE_VALUE (tail
);
4621 these_tags
= TREE_CHAIN (these_tags
);
4626 if (TREE_PURPOSE (these_tags
) == name
)
4628 if (TREE_CODE (TREE_VALUE (these_tags
)) != form
)
4630 cp_error ("`%#D' redeclared as %C in class scope",
4631 TREE_VALUE (tail
), form
);
4634 return TREE_VALUE (tail
);
4636 these_tags
= TREE_CHAIN (these_tags
);
4638 /* If this type is not yet complete, then don't
4639 look at its context. */
4640 if (TYPE_SIZE (context
) == NULL_TREE
)
4642 /* Go to next enclosing type, if any. */
4643 context
= DECL_CONTEXT (TYPE_MAIN_DECL (context
));
4646 context
= DECL_CONTEXT (context
);
4649 my_friendly_abort (10);
4662 set_current_level_tags_transparency (tags_transparent
)
4663 int tags_transparent
;
4665 current_binding_level
->tag_transparent
= tags_transparent
;
4669 /* Given a type, find the tag that was defined for it and return the tag name.
4670 Otherwise return 0. However, the value can never be 0
4671 in the cases in which this is used.
4673 C++: If NAME is non-zero, this is the new name to install. This is
4674 done when replacing anonymous tags with real tag names. */
4677 lookup_tag_reverse (type
, name
)
4681 register struct binding_level
*level
;
4683 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
4686 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4688 if (TREE_VALUE (tail
) == type
)
4691 TREE_PURPOSE (tail
) = name
;
4692 return TREE_PURPOSE (tail
);
4699 /* Lookup TYPE in CONTEXT (a chain of nested types or a FUNCTION_DECL).
4700 Return the type value, or NULL_TREE if not found. */
4703 lookup_nested_type (type
, context
)
4707 if (context
== NULL_TREE
)
4711 switch (TREE_CODE (context
))
4715 tree ctype
= TREE_TYPE (context
);
4716 tree match
= value_member (type
, CLASSTYPE_TAGS (ctype
));
4718 return TREE_VALUE (match
);
4719 context
= DECL_CONTEXT (context
);
4721 /* When we have a nested class whose member functions have
4722 local types (e.g., a set of enums), we'll arrive here
4723 with the DECL_CONTEXT as the actual RECORD_TYPE node for
4724 the enclosing class. Instead, we want to make sure we
4725 come back in here with the TYPE_DECL, not the RECORD_TYPE. */
4726 if (context
&& TREE_CODE (context
) == RECORD_TYPE
)
4727 context
= TREE_CHAIN (context
);
4731 if (TYPE_NAME (type
) && TYPE_IDENTIFIER (type
))
4732 return lookup_name (TYPE_IDENTIFIER (type
), 1);
4735 my_friendly_abort (12);
4741 /* Look up NAME in the NAMESPACE. */
4744 lookup_namespace_name (namespace, name
)
4745 tree
namespace, name
;
4747 struct tree_binding _b
;
4750 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
4752 /* This happens for A::B<int> when B is a namespace. */
4753 if (TREE_CODE (name
) == NAMESPACE_DECL
)
4756 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
4758 val
= binding_init (&_b
);
4759 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
4760 return error_mark_node
;
4762 if (BINDING_VALUE (val
))
4764 val
= BINDING_VALUE (val
);
4766 /* If we have a single function from a using decl, pull it out. */
4767 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
4768 val
= OVL_FUNCTION (val
);
4772 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
4773 return error_mark_node
;
4776 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
4778 static unsigned long
4786 hash
= (((unsigned long) TYPE_CONTEXT (t
))
4787 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
4792 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
4795 typename_compare (k1
, k2
)
4806 d1
= TYPE_NAME (t1
);
4807 d2
= TYPE_NAME (t2
);
4809 return (DECL_NAME (d1
) == DECL_NAME (d2
)
4810 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
4811 && ((TREE_TYPE (t1
) != NULL_TREE
)
4812 == (TREE_TYPE (t2
) != NULL_TREE
))
4813 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
4814 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
4817 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
4818 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
4819 is non-NULL, this type is being created by the implicit typename
4820 extension, and BASE_TYPE is a type named `t' in some base class of
4821 `T' which depends on template parameters.
4823 Returns the new TYPENAME_TYPE. */
4826 build_typename_type (context
, name
, fullname
, base_type
)
4834 struct hash_entry
* e
;
4836 static struct hash_table ht
;
4838 push_obstacks (&permanent_obstack
, &permanent_obstack
);
4841 && !hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
4843 fatal ("virtual memory exhausted");
4845 /* Build the TYPENAME_TYPE. */
4846 t
= make_lang_type (TYPENAME_TYPE
);
4847 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4848 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
4849 TREE_TYPE (t
) = base_type
;
4851 /* Build the corresponding TYPE_DECL. */
4852 d
= build_decl (TYPE_DECL
, name
, t
);
4853 TYPE_NAME (TREE_TYPE (d
)) = d
;
4854 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
4855 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
4857 /* See if we already have this type. */
4858 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
4861 /* This will free not only TREE_TYPE, but the lang-specific data
4862 and the TYPE_DECL as well. */
4863 obstack_free (&permanent_obstack
, t
);
4867 /* Insert the type into the table. */
4868 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
4876 make_typename_type (context
, name
)
4882 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
4883 name
= TYPE_IDENTIFIER (name
);
4884 else if (TREE_CODE (name
) == TYPE_DECL
)
4885 name
= DECL_NAME (name
);
4889 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
4891 name
= TREE_OPERAND (name
, 0);
4892 if (TREE_CODE (name
) == TEMPLATE_DECL
)
4893 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
4895 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
4896 my_friendly_abort (2000);
4898 if (TREE_CODE (context
) == NAMESPACE_DECL
)
4900 /* We can get here from typename_sub0 in the explicit_template_type
4901 expansion. Just fail. */
4902 cp_error ("no class template named `%#T' in `%#T'",
4904 return error_mark_node
;
4907 if (! uses_template_parms (context
)
4908 || currently_open_class (context
))
4910 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
4912 if (IS_AGGR_TYPE (context
))
4913 t
= lookup_field (context
, name
, 0, 0);
4917 if (t
== NULL_TREE
|| TREE_CODE (t
) != TEMPLATE_DECL
4918 || TREE_CODE (DECL_RESULT (t
)) != TYPE_DECL
)
4920 cp_error ("no class template named `%#T' in `%#T'",
4922 return error_mark_node
;
4925 return lookup_template_class (t
, TREE_OPERAND (fullname
, 1),
4927 /*entering_scope=*/0);
4931 if (IS_AGGR_TYPE (context
))
4932 t
= lookup_field (context
, name
, 0, 1);
4938 cp_error ("no type named `%#T' in `%#T'", name
, context
);
4939 return error_mark_node
;
4942 return TREE_TYPE (t
);
4946 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
4949 /* Select the right _DECL from multiple choices. */
4952 select_decl (binding
, flags
)
4957 val
= BINDING_VALUE (binding
);
4958 if (LOOKUP_NAMESPACES_ONLY (flags
))
4960 /* We are not interested in types. */
4961 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
4966 /* If we could have a type and
4967 we have nothing or we need a type and have none. */
4968 if (BINDING_TYPE (binding
)
4969 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
4970 && TREE_CODE (val
) != TYPE_DECL
)))
4971 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
4972 /* Don't return non-types if we really prefer types. */
4973 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
4974 && (!looking_for_template
|| TREE_CODE (val
) != TEMPLATE_DECL
))
4980 /* Unscoped lookup of a global, iterate over namespaces, considering
4981 using namespace statements. */
4984 unqualified_namespace_lookup (name
, flags
)
4988 struct tree_binding _binding
;
4989 tree b
= binding_init (&_binding
);
4990 tree initial
= current_decl_namespace();
4991 tree scope
= initial
;
4993 struct binding_level
*level
;
4994 tree val
= NULL_TREE
;
4998 val
= binding_for_name (name
, scope
);
5000 /* Initialize binding for this context. */
5001 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5002 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5004 /* Add all _DECLs seen through local using-directives. */
5005 for (level
= current_binding_level
;
5006 !level
->namespace_p
;
5007 level
= level
->level_chain
)
5008 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5010 /* Give up because of error. */
5013 /* Add all _DECLs seen through global using-directives. */
5014 /* XXX local and global using lists should work equally. */
5018 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5020 /* Give up because of error. */
5022 if (siter
== scope
) break;
5023 siter
= CP_DECL_CONTEXT (siter
);
5026 val
= select_decl (b
, flags
);
5027 if (scope
== global_namespace
)
5029 scope
= CP_DECL_CONTEXT (scope
);
5034 /* Combine prefer_type and namespaces_only into flags. */
5037 lookup_flags (prefer_type
, namespaces_only
)
5038 int prefer_type
, namespaces_only
;
5040 if (namespaces_only
)
5041 return LOOKUP_PREFER_NAMESPACES
;
5042 if (prefer_type
> 1)
5043 return LOOKUP_PREFER_TYPES
;
5044 if (prefer_type
> 0)
5045 return LOOKUP_PREFER_BOTH
;
5049 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5050 ignore it or not. Subroutine of lookup_name_real. */
5053 qualify_lookup (val
, flags
)
5057 if (val
== NULL_TREE
)
5059 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5061 if ((flags
& LOOKUP_PREFER_TYPES
)
5062 && (TREE_CODE (val
) == TYPE_DECL
5063 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5064 && DECL_CLASS_TEMPLATE_P (val
))))
5066 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5071 /* Look up NAME in the current binding level and its superiors in the
5072 namespace of variables, functions and typedefs. Return a ..._DECL
5073 node of some kind representing its definition if there is only one
5074 such declaration, or return a TREE_LIST with all the overloaded
5075 definitions if there are many, or return 0 if it is undefined.
5077 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5078 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5079 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5080 Otherwise we prefer non-TYPE_DECLs.
5082 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5083 using IDENTIFIER_CLASS_VALUE. */
5086 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5088 int prefer_type
, nonclass
, namespaces_only
;
5092 tree from_obj
= NULL_TREE
;
5093 tree locval
, classval
;
5096 /* Hack: copy flag set by parser, if set. */
5097 if (only_namespace_names
)
5098 namespaces_only
= 1;
5100 if (prefer_type
== -2)
5102 extern int looking_for_typename
;
5103 tree type
= NULL_TREE
;
5106 prefer_type
= looking_for_typename
;
5108 flags
= lookup_flags (prefer_type
, namespaces_only
);
5109 /* During parsing, we need to complain. */
5110 flags
|= LOOKUP_COMPLAIN
;
5111 /* If the next thing is '<', class templates are types. */
5112 if (looking_for_template
)
5113 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5115 /* std:: becomes :: for now. */
5116 if (got_scope
== std_node
)
5117 got_scope
= void_type_node
;
5121 else if (got_object
!= error_mark_node
)
5126 if (type
== error_mark_node
)
5127 return error_mark_node
;
5128 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5129 type
= TREE_TYPE (type
);
5132 type
= complete_type (type
);
5134 if (TREE_CODE (type
) == VOID_TYPE
)
5135 type
= global_namespace
;
5136 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5138 struct tree_binding b
;
5139 val
= binding_init (&b
);
5140 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5142 val
= select_decl (val
, flags
);
5144 else if (! IS_AGGR_TYPE (type
)
5145 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5146 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5147 || TREE_CODE (type
) == TYPENAME_TYPE
)
5148 /* Someone else will give an error about this if needed. */
5150 else if (TYPE_BEING_DEFINED (type
))
5152 val
= IDENTIFIER_CLASS_VALUE (name
);
5153 if (val
&& DECL_CONTEXT (val
) != type
)
5155 struct binding_level
*b
= class_binding_level
;
5156 for (val
= NULL_TREE
; b
; b
= b
->level_chain
)
5158 tree t
= purpose_member (name
, b
->class_shadowed
);
5159 if (t
&& TREE_VALUE (t
)
5160 && DECL_CONTEXT (TREE_VALUE (t
)) == type
)
5162 val
= TREE_VALUE (t
);
5167 if (val
== NULL_TREE
)
5168 val
= lookup_field (type
, name
, 0, 1);
5170 else if (type
== current_class_type
)
5171 val
= IDENTIFIER_CLASS_VALUE (name
);
5173 val
= lookup_member (type
, name
, 0, prefer_type
);
5180 else if (got_object
&& val
)
5184 flags
= lookup_flags (prefer_type
, namespaces_only
);
5186 locval
= classval
= NULL_TREE
;
5188 if (! namespace_bindings_p ())
5189 locval
= qualify_lookup (IDENTIFIER_LOCAL_VALUE (name
), flags
);
5191 /* In C++ class fields are between local and global scope,
5192 just before the global scope. */
5193 if (current_class_type
&& ! nonclass
)
5195 classval
= IDENTIFIER_CLASS_VALUE (name
);
5196 if (classval
== NULL_TREE
&& TYPE_BEING_DEFINED (current_class_type
))
5197 /* Try to find values from base classes if we are presently
5198 defining a type. We are presently only interested in
5200 classval
= lookup_field (current_class_type
, name
, 0, 1);
5202 /* Add implicit 'typename' to types from template bases. lookup_field
5203 will do this for us. If classval is actually from an enclosing
5204 scope, lookup_nested_field will get it for us. */
5205 else if (processing_template_decl
5206 && classval
&& TREE_CODE (classval
) == TYPE_DECL
5207 && ! currently_open_class (DECL_CONTEXT (classval
))
5208 && uses_template_parms (current_class_type
))
5209 classval
= lookup_field (current_class_type
, name
, 0, 1);
5211 /* yylex() calls this with -2, since we should never start digging for
5212 the nested name at the point where we haven't even, for example,
5213 created the COMPONENT_REF or anything like that. */
5214 if (classval
== NULL_TREE
)
5215 classval
= lookup_nested_field (name
, ! yylex
);
5217 classval
= qualify_lookup (classval
, flags
);
5220 if (locval
&& classval
)
5222 /* We have both a local binding and a class-level binding. This
5223 can happen in two ways:
5225 o We are in a member function of a class.
5226 o We are in a local class within a function.
5228 We need to determine which one of these situations is
5229 occuring, and give the innermost binding. One tricky bit is
5230 that with member templates we can be in the first case
5231 without CURRENT_FUNCTION_DECL being set. Consider
5233 struct A { template <class A> void f(A); };
5235 Here, when we look at the `A' in the parameter declaration
5236 for `f' we have a local binding (the template parameter) and
5237 a class-level binding (the TYPE_DECL for the class).
5238 Fortunately, if LOCVAL is a template parameter it is safe to
5239 take it; nothing within the scope of the template parameter
5240 is allowed to have the same name. */
5242 if (decl_template_parm_p (locval
))
5244 else if (current_scope () == current_function_decl
5245 && ! hack_decl_function_context (current_function_decl
))
5246 /* Not in a nested function. */
5250 /* This is incredibly horrible. The whole concept of
5251 IDENTIFIER_LOCAL_VALUE / IDENTIFIER_CLASS_VALUE /
5252 IDENTIFIER_GLOBAL_VALUE needs to be scrapped for local
5254 tree lctx
= hack_decl_function_context (locval
);
5255 tree cctx
= hack_decl_function_context (classval
);
5257 if (lctx
== current_scope ())
5259 else if (lctx
== cctx
)
5262 /* I don't know which is right; let's just guess for now. */
5271 val
= unqualified_namespace_lookup (name
, flags
);
5273 /* Any other name takes precedence over an implicit typename. Warn the
5274 user about this potentially confusing lookup. */
5275 if (classval
&& TREE_CODE (val
) == TYPE_DECL
5276 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
5277 && TREE_TYPE (TREE_TYPE (val
)))
5279 if (locval
== NULL_TREE
)
5280 locval
= unqualified_namespace_lookup (name
, flags
);
5282 if (locval
&& val
!= locval
)
5288 /* Only warn when not lexing; we don't want to warn if they
5289 use this name as a declarator. */
5290 subtype
= TREE_TYPE (TREE_TYPE (classval
));
5292 && ! (TREE_CODE (locval
) == TEMPLATE_DECL
5293 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5294 && CLASSTYPE_TI_TEMPLATE (subtype
) == locval
)
5295 && ! (TREE_CODE (locval
) == TYPE_DECL
5296 && same_type_p (TREE_TYPE (locval
), subtype
)))
5298 cp_warning ("lookup of `%D' finds `%#D'", name
, locval
);
5299 cp_warning (" instead of `%D' from dependent base class",
5301 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5302 constructor_name (current_class_type
), name
);
5310 /* This should only warn about types used in qualified-ids. */
5311 if (from_obj
&& from_obj
!= val
)
5313 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5314 && TREE_CODE (val
) == TYPE_DECL
5315 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5317 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5318 name
, got_object
, TREE_TYPE (from_obj
));
5319 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5323 /* We don't change val to from_obj if got_object depends on
5324 template parms because that breaks implicit typename for
5325 destructor calls. */
5326 if (! uses_template_parms (got_object
))
5330 if ((TREE_CODE (val
) == TEMPLATE_DECL
&& looking_for_template
)
5331 || TREE_CODE (val
) == TYPE_DECL
|| prefer_type
<= 0)
5333 /* Caller wants a class-or-namespace-name. */
5334 else if (prefer_type
== 1 && TREE_CODE (val
) == NAMESPACE_DECL
)
5336 else if (IDENTIFIER_HAS_TYPE_VALUE (name
))
5337 val
= TYPE_MAIN_DECL (IDENTIFIER_TYPE_VALUE (name
));
5338 else if (TREE_TYPE (val
) == error_mark_node
)
5339 val
= error_mark_node
;
5341 /* If we have a single function from a using decl, pull it out. */
5342 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5343 val
= OVL_FUNCTION (val
);
5352 lookup_name_nonclass (name
)
5355 return lookup_name_real (name
, 0, 1, 0);
5359 lookup_function_nonclass (name
, args
)
5363 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5367 lookup_name_namespace_only (name
)
5370 /* type-or-namespace, nonclass, namespace_only */
5371 return lookup_name_real (name
, 1, 1, 1);
5375 lookup_name (name
, prefer_type
)
5379 return lookup_name_real (name
, prefer_type
, 0, 0);
5382 /* Similar to `lookup_name' but look only at current binding level. */
5385 lookup_name_current_level (name
)
5388 register tree t
= NULL_TREE
;
5390 if (current_binding_level
->namespace_p
)
5392 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5394 /* extern "C" function() */
5395 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5398 else if (IDENTIFIER_LOCAL_VALUE (name
) != NULL_TREE
)
5400 struct binding_level
*b
= current_binding_level
;
5403 if (purpose_member (name
, b
->shadowed
))
5404 return IDENTIFIER_LOCAL_VALUE (name
);
5415 /* Like lookup_name_current_level, but for types. */
5418 lookup_type_current_level (name
)
5421 register tree t
= NULL_TREE
;
5423 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5425 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5426 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5428 struct binding_level
*b
= current_binding_level
;
5431 if (purpose_member (name
, b
->type_shadowed
))
5432 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5444 begin_only_namespace_names ()
5446 only_namespace_names
= 1;
5450 end_only_namespace_names ()
5452 only_namespace_names
= 0;
5455 /* Arrange for the user to get a source line number, even when the
5456 compiler is going down in flames, so that she at least has a
5457 chance of working around problems in the compiler. We used to
5458 call error(), but that let the segmentation fault continue
5459 through; now, it's much more passive by asking them to send the
5460 maintainers mail about the problem. */
5464 int sig ATTRIBUTE_UNUSED
;
5466 signal (SIGSEGV
, SIG_DFL
);
5468 signal (SIGIOT
, SIG_DFL
);
5471 signal (SIGILL
, SIG_DFL
);
5474 signal (SIGABRT
, SIG_DFL
);
5477 signal (SIGBUS
, SIG_DFL
);
5479 my_friendly_abort (0);
5483 /* Unused -- brendan 970107 */
5484 /* Array for holding types considered "built-in". These types
5485 are output in the module in which `main' is defined. */
5486 static tree
*builtin_type_tdescs_arr
;
5487 static int builtin_type_tdescs_len
, builtin_type_tdescs_max
;
5490 /* Push the declarations of builtin types into the namespace.
5491 RID_INDEX, if < RID_MAX is the index of the builtin type
5492 in the array RID_POINTERS. NAME is the name used when looking
5493 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5496 record_builtin_type (rid_index
, name
, type
)
5501 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5502 tree tdecl
= NULL_TREE
;
5504 if ((int) rid_index
< (int) RID_MAX
)
5505 rname
= ridpointers
[(int) rid_index
];
5507 tname
= get_identifier (name
);
5509 TYPE_BUILT_IN (type
) = 1;
5513 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5514 set_identifier_type_value (tname
, NULL_TREE
);
5515 if ((int) rid_index
< (int) RID_MAX
)
5516 /* Built-in types live in the global namespace. */
5517 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5519 if (rname
!= NULL_TREE
)
5521 if (tname
!= NULL_TREE
)
5523 set_identifier_type_value (rname
, NULL_TREE
);
5524 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5528 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5529 set_identifier_type_value (rname
, NULL_TREE
);
5534 /* Record one of the standard Java types.
5535 * Declare it as having the given NAME.
5536 * If SIZE > 0, it is the size of one of the integral types;
5537 * otherwise it is the negative of the size of one of the other types. */
5540 record_builtin_java_type (name
, size
)
5546 type
= make_signed_type (size
);
5547 else if (size
> -32)
5548 { /* "__java_char" or ""__java_boolean". */
5549 type
= make_unsigned_type (-size
);
5550 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5553 { /* "__java_float" or ""__java_double". */
5554 type
= make_node (REAL_TYPE
);
5555 TYPE_PRECISION (type
) = - size
;
5558 record_builtin_type (RID_MAX
, name
, type
);
5559 decl
= TYPE_NAME (type
);
5560 DECL_IGNORED_P (decl
) = 1;
5561 TYPE_FOR_JAVA (type
) = 1;
5565 /* Push a type into the namespace so that the back-ends ignore it. */
5568 record_unknown_type (type
, name
)
5572 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5573 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5574 DECL_IGNORED_P (decl
) = 1;
5575 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5576 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5577 TYPE_ALIGN (type
) = 1;
5578 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5581 /* Push overloaded decl, in global scope, with one argument so it
5582 can be used as a callback from define_function. */
5585 push_overloaded_decl_1 (x
)
5588 push_overloaded_decl (x
, 0);
5595 auto_function (name
, type
, code
)
5597 enum built_in_function code
;
5599 return define_function
5600 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
5601 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5605 /* Create the predefined scalar types of C,
5606 and some nodes representing standard constants (0, 1, (void *)0).
5607 Initialize the global binding level.
5608 Make definitions for built-in primitive functions. */
5611 init_decl_processing ()
5613 register tree endlink
, int_endlink
, double_endlink
, unsigned_endlink
;
5615 /* Data type of memcpy. */
5616 tree memcpy_ftype
, strlen_ftype
;
5617 int wchar_type_size
;
5619 tree array_domain_type
;
5620 tree vb_off_identifier
= NULL_TREE
;
5621 /* Function type `char *(char *, char *)' and similar ones */
5622 tree string_ftype_ptr_ptr
, int_ftype_string_string
;
5623 tree sizetype_endlink
;
5624 tree ptr_ftype
, ptr_ftype_unsigned
, ptr_ftype_sizetype
;
5625 tree void_ftype
, void_ftype_int
, void_ftype_ptr
;
5627 /* Have to make these distinct before we try using them. */
5628 lang_name_cplusplus
= get_identifier ("C++");
5629 lang_name_c
= get_identifier ("C");
5630 lang_name_java
= get_identifier ("Java");
5632 /* Enter the global namespace. */
5633 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5634 my_friendly_assert (current_lang_name
== NULL_TREE
, 375);
5635 current_lang_name
= lang_name_cplusplus
;
5636 push_namespace (get_identifier ("::"));
5637 global_namespace
= current_namespace
;
5638 current_lang_name
= NULL_TREE
;
5640 if (flag_strict_prototype
== 2)
5641 flag_strict_prototype
= pedantic
;
5643 strict_prototypes_lang_c
= flag_strict_prototype
;
5646 current_lang_name
= lang_name_c
;
5648 current_function_decl
= NULL_TREE
;
5649 named_labels
= NULL_TREE
;
5650 named_label_uses
= NULL
;
5651 current_binding_level
= NULL_BINDING_LEVEL
;
5652 free_binding_level
= NULL_BINDING_LEVEL
;
5654 /* Because most segmentation signals can be traced back into user
5655 code, catch them and at least give the user a chance of working
5656 around compiler bugs. */
5657 signal (SIGSEGV
, signal_catch
);
5659 /* We will also catch aborts in the back-end through signal_catch and
5660 give the user a chance to see where the error might be, and to defeat
5661 aborts in the back-end when there have been errors previously in their
5664 signal (SIGIOT
, signal_catch
);
5667 signal (SIGILL
, signal_catch
);
5670 signal (SIGABRT
, signal_catch
);
5673 signal (SIGBUS
, signal_catch
);
5676 gcc_obstack_init (&decl_obstack
);
5678 /* Must lay these out before anything else gets laid out. */
5679 error_mark_node
= make_node (ERROR_MARK
);
5680 TREE_PERMANENT (error_mark_node
) = 1;
5681 TREE_TYPE (error_mark_node
) = error_mark_node
;
5682 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
5683 TREE_TYPE (error_mark_list
) = error_mark_node
;
5685 /* Make the binding_level structure for global names. */
5687 global_binding_level
= current_binding_level
;
5688 /* The global level is the namespace level of ::. */
5689 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
5690 declare_namespace_level ();
5692 this_identifier
= get_identifier (THIS_NAME
);
5693 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
5694 ctor_identifier
= get_identifier (CTOR_NAME
);
5695 dtor_identifier
= get_identifier (DTOR_NAME
);
5696 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
5697 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
5698 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
5699 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
5700 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
5701 if (flag_handle_signatures
)
5703 tag_identifier
= get_identifier (SIGTABLE_TAG_NAME
);
5704 vb_off_identifier
= get_identifier (SIGTABLE_VB_OFF_NAME
);
5705 vt_off_identifier
= get_identifier (SIGTABLE_VT_OFF_NAME
);
5708 /* Define `int' and `char' first so that dbx will output them first. */
5710 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5711 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
5713 /* Define `char', which is like either `signed char' or `unsigned char'
5714 but not the same as either. */
5718 ? make_signed_type (CHAR_TYPE_SIZE
)
5719 : make_unsigned_type (CHAR_TYPE_SIZE
));
5720 record_builtin_type (RID_CHAR
, "char", char_type_node
);
5722 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5723 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
5725 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5726 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
5728 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5729 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
5730 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
5732 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5733 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
5735 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5736 record_builtin_type (RID_MAX
, "long long unsigned int",
5737 long_long_unsigned_type_node
);
5738 record_builtin_type (RID_MAX
, "long long unsigned",
5739 long_long_unsigned_type_node
);
5741 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5742 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
5743 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5744 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
5745 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
5747 /* `unsigned long' is the standard type for sizeof.
5748 Note that stddef.h uses `unsigned long',
5749 and this must agree, even if long and int are the same size. */
5751 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
5754 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
5756 /* Define both `signed char' and `unsigned char'. */
5757 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5758 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
5759 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5760 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
5762 /* These are types that type_for_size and type_for_mode use. */
5763 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
5764 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
5765 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
5766 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
5767 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
5768 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
5769 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
5770 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
5771 #if HOST_BITS_PER_WIDE_INT >= 64
5772 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
5773 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
5775 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
5776 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
5777 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
5778 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
5779 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
5780 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
5781 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
5782 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
5783 #if HOST_BITS_PER_WIDE_INT >= 64
5784 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
5785 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
5788 float_type_node
= make_node (REAL_TYPE
);
5789 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5790 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
5791 layout_type (float_type_node
);
5793 double_type_node
= make_node (REAL_TYPE
);
5794 if (flag_short_double
)
5795 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5797 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5798 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
5799 layout_type (double_type_node
);
5801 long_double_type_node
= make_node (REAL_TYPE
);
5802 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5803 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
5804 layout_type (long_double_type_node
);
5806 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5807 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
5808 complex_integer_type_node
));
5809 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5810 layout_type (complex_integer_type_node
);
5812 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5813 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
5814 complex_float_type_node
));
5815 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5816 layout_type (complex_float_type_node
);
5818 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5819 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
5820 complex_double_type_node
));
5821 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5822 layout_type (complex_double_type_node
);
5824 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5825 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
5826 complex_long_double_type_node
));
5827 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5828 layout_type (complex_long_double_type_node
);
5830 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
5831 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
5832 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
5833 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
5834 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
5835 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
5836 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
5837 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
5839 integer_zero_node
= build_int_2 (0, 0);
5840 TREE_TYPE (integer_zero_node
) = integer_type_node
;
5841 integer_one_node
= build_int_2 (1, 0);
5842 TREE_TYPE (integer_one_node
) = integer_type_node
;
5843 integer_two_node
= build_int_2 (2, 0);
5844 TREE_TYPE (integer_two_node
) = integer_type_node
;
5845 integer_three_node
= build_int_2 (3, 0);
5846 TREE_TYPE (integer_three_node
) = integer_type_node
;
5848 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5849 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5850 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
5851 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
5852 TYPE_PRECISION (boolean_type_node
) = 1;
5853 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
5854 boolean_false_node
= build_int_2 (0, 0);
5855 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
5856 boolean_true_node
= build_int_2 (1, 0);
5857 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
5859 /* These are needed by stor-layout.c. */
5860 size_zero_node
= size_int (0);
5861 size_one_node
= size_int (1);
5863 signed_size_zero_node
= build_int_2 (0, 0);
5864 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
5866 void_type_node
= make_node (VOID_TYPE
);
5867 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
5868 layout_type (void_type_node
); /* Uses integer_zero_node. */
5869 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
5870 TREE_PARMLIST (void_list_node
) = 1;
5872 null_pointer_node
= build_int_2 (0, 0);
5873 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
5874 layout_type (TREE_TYPE (null_pointer_node
));
5876 /* Used for expressions that do nothing, but are not errors. */
5877 void_zero_node
= build_int_2 (0, 0);
5878 TREE_TYPE (void_zero_node
) = void_type_node
;
5880 string_type_node
= build_pointer_type (char_type_node
);
5881 const_string_type_node
5882 = build_pointer_type (build_qualified_type (char_type_node
,
5885 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
5888 /* Make a type to be the domain of a few array types
5889 whose domains don't really matter.
5890 200 is small enough that it always fits in size_t
5891 and large enough that it can hold most function names for the
5892 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5893 array_domain_type
= build_index_type (build_int_2 (200, 0));
5895 /* Make a type for arrays of characters.
5896 With luck nothing will ever really depend on the length of this
5898 char_array_type_node
5899 = build_array_type (char_type_node
, array_domain_type
);
5900 /* Likewise for arrays of ints. */
5902 = build_array_type (integer_type_node
, array_domain_type
);
5904 /* This is just some anonymous class type. Nobody should ever
5905 need to look inside this envelope. */
5906 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
5908 default_function_type
5909 = build_function_type (integer_type_node
, NULL_TREE
);
5911 ptr_type_node
= build_pointer_type (void_type_node
);
5913 = build_pointer_type (build_qualified_type (void_type_node
,
5916 record_builtin_type (RID_MAX
, NULL_PTR
, ptr_type_node
);
5918 endlink
= void_list_node
;
5919 int_endlink
= tree_cons (NULL_TREE
, integer_type_node
, endlink
);
5920 double_endlink
= tree_cons (NULL_TREE
, double_type_node
, endlink
);
5921 unsigned_endlink
= tree_cons (NULL_TREE
, unsigned_type_node
, endlink
);
5923 ptr_ftype
= build_function_type (ptr_type_node
, NULL_TREE
);
5924 ptr_ftype_unsigned
= build_function_type (ptr_type_node
, unsigned_endlink
);
5925 sizetype_endlink
= tree_cons (NULL_TREE
, sizetype
, endlink
);
5926 /* We realloc here because sizetype could be int or unsigned. S'ok. */
5927 ptr_ftype_sizetype
= build_function_type (ptr_type_node
, sizetype_endlink
);
5929 void_ftype
= build_function_type (void_type_node
, endlink
);
5930 void_ftype_int
= build_function_type (void_type_node
, int_endlink
);
5932 = build_function_type (void_type_node
,
5933 tree_cons (NULL_TREE
, ptr_type_node
, endlink
));
5935 = build_exception_variant (void_ftype_ptr
,
5936 tree_cons (NULL_TREE
, NULL_TREE
, NULL_TREE
));
5939 = build_function_type (float_type_node
,
5940 tree_cons (NULL_TREE
, float_type_node
, endlink
));
5943 = build_function_type (double_type_node
, double_endlink
);
5945 ldouble_ftype_ldouble
5946 = build_function_type (long_double_type_node
,
5947 tree_cons (NULL_TREE
, long_double_type_node
,
5950 double_ftype_double_double
5951 = build_function_type (double_type_node
,
5952 tree_cons (NULL_TREE
, double_type_node
,
5956 = build_function_type (integer_type_node
, int_endlink
);
5959 = build_function_type (long_integer_type_node
,
5960 tree_cons (NULL_TREE
, long_integer_type_node
,
5963 int_ftype_cptr_cptr_sizet
5964 = build_function_type (integer_type_node
,
5965 tree_cons (NULL_TREE
, const_ptr_type_node
,
5966 tree_cons (NULL_TREE
, const_ptr_type_node
,
5967 tree_cons (NULL_TREE
,
5971 string_ftype_ptr_ptr
/* strcpy prototype */
5972 = build_function_type (string_type_node
,
5973 tree_cons (NULL_TREE
, string_type_node
,
5974 tree_cons (NULL_TREE
,
5975 const_string_type_node
,
5978 int_ftype_string_string
/* strcmp prototype */
5979 = build_function_type (integer_type_node
,
5980 tree_cons (NULL_TREE
, const_string_type_node
,
5981 tree_cons (NULL_TREE
,
5982 const_string_type_node
,
5985 strlen_ftype
/* strlen prototype */
5986 = build_function_type (sizetype
,
5987 tree_cons (NULL_TREE
, const_string_type_node
,
5990 memcpy_ftype
/* memcpy prototype */
5991 = build_function_type (ptr_type_node
,
5992 tree_cons (NULL_TREE
, ptr_type_node
,
5993 tree_cons (NULL_TREE
, const_ptr_type_node
,
5994 sizetype_endlink
)));
5996 if (flag_huge_objects
)
5997 delta_type_node
= long_integer_type_node
;
5999 delta_type_node
= short_integer_type_node
;
6001 builtin_function ("__builtin_constant_p", default_function_type
,
6002 BUILT_IN_CONSTANT_P
, NULL_PTR
);
6004 builtin_return_address_fndecl
6005 = builtin_function ("__builtin_return_address", ptr_ftype_unsigned
,
6006 BUILT_IN_RETURN_ADDRESS
, NULL_PTR
);
6008 builtin_function ("__builtin_frame_address", ptr_ftype_unsigned
,
6009 BUILT_IN_FRAME_ADDRESS
, NULL_PTR
);
6011 builtin_function ("__builtin_alloca", ptr_ftype_sizetype
,
6012 BUILT_IN_ALLOCA
, "alloca");
6013 builtin_function ("__builtin_ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
6014 /* Define alloca, ffs as builtins.
6015 Declare _exit just to mark it as volatile. */
6016 if (! flag_no_builtin
&& !flag_no_nonansi_builtin
)
6018 temp
= builtin_function ("alloca", ptr_ftype_sizetype
,
6019 BUILT_IN_ALLOCA
, NULL_PTR
);
6020 /* Suppress error if redefined as a non-function. */
6021 DECL_BUILT_IN_NONANSI (temp
) = 1;
6022 temp
= builtin_function ("ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
6023 /* Suppress error if redefined as a non-function. */
6024 DECL_BUILT_IN_NONANSI (temp
) = 1;
6025 temp
= builtin_function ("_exit", void_ftype_int
,
6026 NOT_BUILT_IN
, NULL_PTR
);
6027 TREE_THIS_VOLATILE (temp
) = 1;
6028 TREE_SIDE_EFFECTS (temp
) = 1;
6029 /* Suppress error if redefined as a non-function. */
6030 DECL_BUILT_IN_NONANSI (temp
) = 1;
6033 builtin_function ("__builtin_abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
6034 builtin_function ("__builtin_fabsf", float_ftype_float
, BUILT_IN_FABS
,
6036 builtin_function ("__builtin_fabs", double_ftype_double
, BUILT_IN_FABS
,
6038 builtin_function ("__builtin_fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
6040 builtin_function ("__builtin_labs", long_ftype_long
,
6041 BUILT_IN_LABS
, NULL_PTR
);
6042 builtin_function ("__builtin_saveregs", ptr_ftype
,
6043 BUILT_IN_SAVEREGS
, NULL_PTR
);
6044 builtin_function ("__builtin_classify_type", default_function_type
,
6045 BUILT_IN_CLASSIFY_TYPE
, NULL_PTR
);
6046 builtin_function ("__builtin_next_arg", ptr_ftype
,
6047 BUILT_IN_NEXT_ARG
, NULL_PTR
);
6048 builtin_function ("__builtin_args_info", int_ftype_int
,
6049 BUILT_IN_ARGS_INFO
, NULL_PTR
);
6050 builtin_function ("__builtin_setjmp",
6051 build_function_type (integer_type_node
,
6052 tree_cons (NULL_TREE
, ptr_type_node
,
6054 BUILT_IN_SETJMP
, NULL_PTR
);
6055 builtin_function ("__builtin_longjmp",
6056 build_function_type (integer_type_node
,
6057 tree_cons (NULL_TREE
, ptr_type_node
,
6058 tree_cons (NULL_TREE
,
6061 BUILT_IN_LONGJMP
, NULL_PTR
);
6063 /* Untyped call and return. */
6064 builtin_function ("__builtin_apply_args", ptr_ftype
,
6065 BUILT_IN_APPLY_ARGS
, NULL_PTR
);
6067 temp
= tree_cons (NULL_TREE
,
6068 build_pointer_type (build_function_type (void_type_node
,
6070 tree_cons (NULL_TREE
, ptr_ftype_sizetype
, NULL_TREE
));
6071 builtin_function ("__builtin_apply",
6072 build_function_type (ptr_type_node
, temp
),
6073 BUILT_IN_APPLY
, NULL_PTR
);
6074 builtin_function ("__builtin_return", void_ftype_ptr
,
6075 BUILT_IN_RETURN
, NULL_PTR
);
6077 /* Currently under experimentation. */
6078 builtin_function ("__builtin_memcpy", memcpy_ftype
,
6079 BUILT_IN_MEMCPY
, "memcpy");
6080 builtin_function ("__builtin_memcmp", int_ftype_cptr_cptr_sizet
,
6081 BUILT_IN_MEMCMP
, "memcmp");
6082 builtin_function ("__builtin_strcmp", int_ftype_string_string
,
6083 BUILT_IN_STRCMP
, "strcmp");
6084 builtin_function ("__builtin_strcpy", string_ftype_ptr_ptr
,
6085 BUILT_IN_STRCPY
, "strcpy");
6086 builtin_function ("__builtin_strlen", strlen_ftype
,
6087 BUILT_IN_STRLEN
, "strlen");
6088 builtin_function ("__builtin_sqrtf", float_ftype_float
,
6089 BUILT_IN_FSQRT
, "sqrtf");
6090 builtin_function ("__builtin_fsqrt", double_ftype_double
,
6091 BUILT_IN_FSQRT
, NULL_PTR
);
6092 builtin_function ("__builtin_sqrtl", ldouble_ftype_ldouble
,
6093 BUILT_IN_FSQRT
, "sqrtl");
6094 builtin_function ("__builtin_sinf", float_ftype_float
,
6095 BUILT_IN_SIN
, "sinf");
6096 builtin_function ("__builtin_sin", double_ftype_double
,
6097 BUILT_IN_SIN
, "sin");
6098 builtin_function ("__builtin_sinl", ldouble_ftype_ldouble
,
6099 BUILT_IN_SIN
, "sinl");
6100 builtin_function ("__builtin_cosf", float_ftype_float
,
6101 BUILT_IN_COS
, "cosf");
6102 builtin_function ("__builtin_cos", double_ftype_double
,
6103 BUILT_IN_COS
, "cos");
6104 builtin_function ("__builtin_cosl", ldouble_ftype_ldouble
,
6105 BUILT_IN_COS
, "cosl");
6107 if (!flag_no_builtin
)
6109 builtin_function ("abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
6110 builtin_function ("fabs", double_ftype_double
, BUILT_IN_FABS
, NULL_PTR
);
6111 builtin_function ("labs", long_ftype_long
, BUILT_IN_LABS
, NULL_PTR
);
6112 builtin_function ("fabsf", float_ftype_float
, BUILT_IN_FABS
, NULL_PTR
);
6113 builtin_function ("fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
6115 builtin_function ("memcpy", memcpy_ftype
, BUILT_IN_MEMCPY
, NULL_PTR
);
6116 builtin_function ("memcmp", int_ftype_cptr_cptr_sizet
, BUILT_IN_MEMCMP
,
6118 builtin_function ("strcmp", int_ftype_string_string
, BUILT_IN_STRCMP
,
6120 builtin_function ("strcpy", string_ftype_ptr_ptr
, BUILT_IN_STRCPY
,
6122 builtin_function ("strlen", strlen_ftype
, BUILT_IN_STRLEN
, NULL_PTR
);
6123 builtin_function ("sqrtf", float_ftype_float
, BUILT_IN_FSQRT
, NULL_PTR
);
6124 builtin_function ("sqrt", double_ftype_double
, BUILT_IN_FSQRT
, NULL_PTR
);
6125 builtin_function ("sqrtl", ldouble_ftype_ldouble
, BUILT_IN_FSQRT
,
6127 builtin_function ("sinf", float_ftype_float
, BUILT_IN_SIN
, NULL_PTR
);
6128 builtin_function ("sin", double_ftype_double
, BUILT_IN_SIN
, NULL_PTR
);
6129 builtin_function ("sinl", ldouble_ftype_ldouble
, BUILT_IN_SIN
, NULL_PTR
);
6130 builtin_function ("cosf", float_ftype_float
, BUILT_IN_COS
, NULL_PTR
);
6131 builtin_function ("cos", double_ftype_double
, BUILT_IN_COS
, NULL_PTR
);
6132 builtin_function ("cosl", ldouble_ftype_ldouble
, BUILT_IN_COS
, NULL_PTR
);
6134 /* Declare these functions volatile
6135 to avoid spurious "control drops through" warnings. */
6136 temp
= builtin_function ("abort", void_ftype
,
6137 NOT_BUILT_IN
, NULL_PTR
);
6138 TREE_THIS_VOLATILE (temp
) = 1;
6139 TREE_SIDE_EFFECTS (temp
) = 1;
6140 /* Well, these are actually ANSI, but we can't set DECL_BUILT_IN on
6142 DECL_BUILT_IN_NONANSI (temp
) = 1;
6143 temp
= builtin_function ("exit", void_ftype_int
,
6144 NOT_BUILT_IN
, NULL_PTR
);
6145 TREE_THIS_VOLATILE (temp
) = 1;
6146 TREE_SIDE_EFFECTS (temp
) = 1;
6147 DECL_BUILT_IN_NONANSI (temp
) = 1;
6151 /* Support for these has not been written in either expand_builtin
6152 or build_function_call. */
6153 builtin_function ("__builtin_div", default_ftype
, BUILT_IN_DIV
, NULL_PTR
);
6154 builtin_function ("__builtin_ldiv", default_ftype
, BUILT_IN_LDIV
, NULL_PTR
);
6155 builtin_function ("__builtin_ffloor", double_ftype_double
, BUILT_IN_FFLOOR
,
6157 builtin_function ("__builtin_fceil", double_ftype_double
, BUILT_IN_FCEIL
,
6159 builtin_function ("__builtin_fmod", double_ftype_double_double
,
6160 BUILT_IN_FMOD
, NULL_PTR
);
6161 builtin_function ("__builtin_frem", double_ftype_double_double
,
6162 BUILT_IN_FREM
, NULL_PTR
);
6163 builtin_function ("__builtin_memset", ptr_ftype_ptr_int_int
,
6164 BUILT_IN_MEMSET
, NULL_PTR
);
6165 builtin_function ("__builtin_getexp", double_ftype_double
, BUILT_IN_GETEXP
,
6167 builtin_function ("__builtin_getman", double_ftype_double
, BUILT_IN_GETMAN
,
6171 /* C++ extensions */
6173 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6174 record_unknown_type (unknown_type_node
, "unknown type");
6176 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6177 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6179 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6181 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6183 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6184 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6186 /* This is for handling opaque types in signatures. */
6187 opaque_type_node
= copy_node (ptr_type_node
);
6188 TYPE_MAIN_VARIANT (opaque_type_node
) = opaque_type_node
;
6189 record_builtin_type (RID_MAX
, 0, opaque_type_node
);
6191 /* This is special for C++ so functions can be overloaded. */
6193 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6194 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6195 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6196 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6198 = TREE_UNSIGNED (wchar_type_node
)
6199 ? unsigned_wchar_type_node
6200 : signed_wchar_type_node
;
6201 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6203 /* Artificial declaration of wchar_t -- can be bashed */
6204 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6206 pushdecl (wchar_decl_node
);
6208 /* This is for wide string constants. */
6209 wchar_array_type_node
6210 = build_array_type (wchar_type_node
, array_domain_type
);
6212 if (flag_vtable_thunks
)
6214 /* Make sure we get a unique function type, so we can give
6215 its pointer type a name. (This wins for gdb.) */
6216 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6217 TREE_TYPE (vfunc_type
) = integer_type_node
;
6218 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6219 layout_type (vfunc_type
);
6221 vtable_entry_type
= build_pointer_type (vfunc_type
);
6225 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6226 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
6228 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
6230 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
6232 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6235 /* Make this part of an invisible union. */
6236 fields
[3] = copy_node (fields
[2]);
6237 TREE_TYPE (fields
[3]) = delta_type_node
;
6238 DECL_NAME (fields
[3]) = delta2_identifier
;
6239 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6240 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6241 TREE_UNSIGNED (fields
[3]) = 0;
6242 TREE_CHAIN (fields
[2]) = fields
[3];
6243 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6246 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6249 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6250 layout_type (vtbl_type_node
);
6251 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6252 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6253 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6254 layout_type (vtbl_ptr_type_node
);
6255 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6257 /* Simplify life by making a "sigtable_entry_type". Give its
6258 fields names so that the debugger can use them. */
6260 if (flag_handle_signatures
)
6262 sigtable_entry_type
= make_lang_type (RECORD_TYPE
);
6263 fields
[0] = build_lang_field_decl (FIELD_DECL
, tag_identifier
,
6265 fields
[1] = build_lang_field_decl (FIELD_DECL
, vb_off_identifier
,
6267 fields
[2] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
6269 fields
[3] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
6271 fields
[4] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
6274 /* Set the alignment to the max of the alignment of ptr_type_node and
6275 delta_type_node. Double alignment wastes a word on the Sparc. */
6276 finish_builtin_type (sigtable_entry_type
, SIGTABLE_PTR_TYPE
, fields
, 4,
6277 (TYPE_ALIGN (ptr_type_node
) > TYPE_ALIGN (delta_type_node
))
6281 /* Make this part of an invisible union. */
6282 fields
[5] = copy_node (fields
[4]);
6283 TREE_TYPE (fields
[5]) = delta_type_node
;
6284 DECL_NAME (fields
[5]) = vt_off_identifier
;
6285 DECL_MODE (fields
[5]) = TYPE_MODE (delta_type_node
);
6286 DECL_SIZE (fields
[5]) = TYPE_SIZE (delta_type_node
);
6287 TREE_UNSIGNED (fields
[5]) = 0;
6288 TREE_CHAIN (fields
[4]) = fields
[5];
6290 sigtable_entry_type
= build_qualified_type (sigtable_entry_type
,
6292 record_builtin_type (RID_MAX
, SIGTABLE_PTR_TYPE
, sigtable_entry_type
);
6295 std_node
= build_decl (NAMESPACE_DECL
,
6296 get_identifier (flag_honor_std
? "fake std":"std"),
6298 pushdecl (std_node
);
6300 global_type_node
= make_node (LANG_TYPE
);
6301 record_unknown_type (global_type_node
, "global type");
6304 current_lang_name
= lang_name_cplusplus
;
6307 tree bad_alloc_type_node
, newtype
, deltype
;
6309 push_namespace (get_identifier ("std"));
6310 bad_alloc_type_node
= xref_tag
6311 (class_type_node
, get_identifier ("bad_alloc"), 1);
6314 newtype
= build_exception_variant
6315 (ptr_ftype_sizetype
, build_tree_list (NULL_TREE
, bad_alloc_type_node
));
6316 deltype
= build_exception_variant
6317 (void_ftype_ptr
, build_tree_list (NULL_TREE
, NULL_TREE
));
6318 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6319 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6320 global_delete_fndecl
6321 = auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6322 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6326 = define_function ("__pure_virtual", void_ftype
,
6327 NOT_BUILT_IN
, 0, 0);
6329 /* Perform other language dependent initializations. */
6330 init_class_processing ();
6331 init_init_processing ();
6332 init_search_processing ();
6334 init_rtti_processing ();
6336 if (flag_exceptions
)
6337 init_exception_processing ();
6340 flag_inline_functions
= 0;
6343 if (! supports_one_only ())
6346 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6347 declare_function_name ();
6349 /* Prepare to check format strings against argument lists. */
6350 init_function_format_info ();
6352 /* Show we use EH for cleanups. */
6353 using_eh_for_cleanups ();
6355 print_error_function
= lang_print_error_function
;
6356 lang_get_alias_set
= &c_get_alias_set
;
6358 /* Maintain consistency. Perhaps we should just complain if they
6359 say -fwritable-strings? */
6360 if (flag_writable_strings
)
6361 flag_const_strings
= 0;
6364 /* Function to print any language-specific context for an error message. */
6367 lang_print_error_function (file
)
6370 default_print_error_function (file
);
6371 maybe_print_template_context ();
6374 /* Make a definition for a builtin function named NAME and whose data type
6375 is TYPE. TYPE should be a function type with argument types.
6376 FUNCTION_CODE tells later passes how to compile calls to this function.
6377 See tree.h for its possible values.
6379 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6380 the name to be called if we can't opencode the function. */
6383 define_function (name
, type
, function_code
, pfn
, library_name
)
6386 enum built_in_function function_code
;
6387 void (*pfn
) PROTO((tree
));
6390 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6391 DECL_EXTERNAL (decl
) = 1;
6392 TREE_PUBLIC (decl
) = 1;
6393 DECL_ARTIFICIAL (decl
) = 1;
6395 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6396 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6398 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6399 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6400 function in the namespace. */
6401 if (pfn
) (*pfn
) (decl
);
6403 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6404 make_function_rtl (decl
);
6405 if (function_code
!= NOT_BUILT_IN
)
6407 DECL_BUILT_IN (decl
) = 1;
6408 DECL_FUNCTION_CODE (decl
) = function_code
;
6413 /* When we call finish_struct for an anonymous union, we create
6414 default copy constructors and such. But, an anonymous union
6415 shouldn't have such things; this function undoes the damage to the
6416 anonymous union type T.
6418 (The reason that we create the synthesized methods is that we don't
6419 distinguish `union { int i; }' from `typedef union { int i; } U'.
6420 The first is an anonymous union; the second is just an ordinary
6424 fixup_anonymous_union (t
)
6429 /* Wipe out memory of synthesized methods */
6430 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6431 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6432 TYPE_HAS_INIT_REF (t
) = 0;
6433 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6434 TYPE_HAS_ASSIGN_REF (t
) = 0;
6435 TYPE_HAS_ASSIGNMENT (t
) = 0;
6436 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6438 /* Splice the implicitly generated functions out of the TYPE_METHODS
6440 q
= &TYPE_METHODS (t
);
6443 if (DECL_ARTIFICIAL (*q
))
6444 *q
= TREE_CHAIN (*q
);
6446 q
= &TREE_CHAIN (*q
);
6449 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6450 function members. */
6451 if (TYPE_METHODS (t
))
6452 error ("an anonymous union cannot have function members");
6455 /* Make sure that a declaration with no declarator is well-formed, i.e.
6456 just defines a tagged type or anonymous union.
6458 Returns the type defined, if any. */
6461 check_tag_decl (declspecs
)
6465 tree ob_modifier
= NULL_TREE
;
6467 register tree t
= NULL_TREE
;
6469 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6471 register tree value
= TREE_VALUE (link
);
6477 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6479 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6483 else if (value
== ridpointers
[(int) RID_FRIEND
])
6485 if (current_class_type
== NULL_TREE
6486 || current_scope () != current_class_type
)
6487 ob_modifier
= value
;
6489 else if (value
== ridpointers
[(int) RID_STATIC
]
6490 || value
== ridpointers
[(int) RID_EXTERN
]
6491 || value
== ridpointers
[(int) RID_AUTO
]
6492 || value
== ridpointers
[(int) RID_REGISTER
]
6493 || value
== ridpointers
[(int) RID_INLINE
]
6494 || value
== ridpointers
[(int) RID_VIRTUAL
]
6495 || value
== ridpointers
[(int) RID_CONST
]
6496 || value
== ridpointers
[(int) RID_VOLATILE
]
6497 || value
== ridpointers
[(int) RID_EXPLICIT
])
6498 ob_modifier
= value
;
6502 error ("multiple types in one declaration");
6504 /* Inside a class, we might be in a friend or access declaration.
6505 Until we have a good way of detecting the latter, don't warn. */
6506 if (t
== NULL_TREE
&& ! current_class_type
)
6507 pedwarn ("declaration does not declare anything");
6508 else if (t
&& ANON_UNION_TYPE_P (t
))
6509 /* Anonymous unions are objects, so they can have specifiers. */;
6510 else if (ob_modifier
)
6512 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6513 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6514 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6515 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6516 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6517 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6518 cp_error ("`%D' can only be specified for constructors",
6521 cp_error ("`%D' can only be specified for objects and functions",
6528 /* Called when a declaration is seen that contains no names to declare.
6529 If its type is a reference to a structure, union or enum inherited
6530 from a containing scope, shadow that tag name for the current scope
6531 with a forward reference.
6532 If its type defines a new named structure or union
6533 or defines an enum, it is valid but we need not do anything here.
6534 Otherwise, it is an error.
6536 C++: may have to grok the declspecs to learn about static,
6537 complain for anonymous unions. */
6540 shadow_tag (declspecs
)
6543 tree t
= check_tag_decl (declspecs
);
6546 maybe_process_partial_specialization (t
);
6548 /* This is where the variables in an anonymous union are
6549 declared. An anonymous union declaration looks like:
6551 because there is no declarator after the union, the parser
6552 sends that declaration here. */
6553 if (t
&& ANON_UNION_TYPE_P (t
))
6555 fixup_anonymous_union (t
);
6557 if (TYPE_FIELDS (t
))
6559 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6561 finish_anon_union (decl
);
6566 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6569 groktypename (typename
)
6572 if (TREE_CODE (typename
) != TREE_LIST
)
6574 return grokdeclarator (TREE_VALUE (typename
),
6575 TREE_PURPOSE (typename
),
6576 TYPENAME
, 0, NULL_TREE
);
6579 /* Decode a declarator in an ordinary declaration or data definition.
6580 This is called as soon as the type information and variable name
6581 have been parsed, before parsing the initializer if any.
6582 Here we create the ..._DECL node, fill in its type,
6583 and put it on the list of decls for the current context.
6584 The ..._DECL node is returned as the value.
6586 Exception: for arrays where the length is not specified,
6587 the type is left null, to be filled in by `cp_finish_decl'.
6589 Function definitions do not come here; they go to start_function
6590 instead. However, external and forward declarations of functions
6591 do go through here. Structure field declarations are done by
6592 grokfield and not through here. */
6594 /* Set this to zero to debug not using the temporary obstack
6595 to parse initializers. */
6596 int debug_temp_inits
= 1;
6599 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6600 tree declarator
, declspecs
;
6602 tree attributes
, prefix_attributes
;
6605 register tree type
, tem
;
6607 extern int have_extern_spec
;
6608 extern int used_extern_spec
;
6611 /* See code below that used this. */
6612 int init_written
= initialized
;
6615 /* This should only be done once on the top most decl. */
6616 if (have_extern_spec
&& !used_extern_spec
)
6618 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6620 used_extern_spec
= 1;
6623 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6625 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6628 type
= TREE_TYPE (decl
);
6630 /* Don't lose if destructors must be executed at file-level. */
6631 if (! processing_template_decl
&& TREE_STATIC (decl
)
6632 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6633 && !TREE_PERMANENT (decl
))
6635 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6636 decl
= copy_node (decl
);
6637 if (TREE_CODE (type
) == ARRAY_TYPE
)
6639 tree itype
= TYPE_DOMAIN (type
);
6640 if (itype
&& ! TREE_PERMANENT (itype
))
6642 itype
= build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype
)));
6643 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6644 TREE_TYPE (decl
) = type
;
6651 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6652 ? DECL_CLASS_CONTEXT (decl
)
6653 : DECL_CONTEXT (decl
);
6655 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6656 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6658 /* When parsing the initializer, lookup should use the object's
6660 push_decl_namespace (context
);
6663 /* We are only interested in class contexts, later. */
6664 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6665 context
= NULL_TREE
;
6668 /* Is it valid for this decl to have an initializer at all?
6669 If not, set INITIALIZED to zero, which will indirectly
6670 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6671 switch (TREE_CODE (decl
))
6674 /* typedef foo = bar means give foo the same type as bar.
6675 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6676 Any other case of an initialization in a TYPE_DECL is an error. */
6677 if (pedantic
|| list_length (declspecs
) > 1)
6679 cp_error ("typedef `%D' is initialized", decl
);
6685 cp_error ("function `%#D' is initialized like a variable", decl
);
6690 if (! processing_template_decl
)
6692 if (type
!= error_mark_node
)
6694 if (TYPE_SIZE (type
) != NULL_TREE
6695 && ! TREE_CONSTANT (TYPE_SIZE (type
)))
6698 ("variable-sized object `%D' may not be initialized",
6703 if (TREE_CODE (type
) == ARRAY_TYPE
6704 && TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6707 ("elements of array `%#D' have incomplete type", decl
);
6716 if (! toplevel_bindings_p ()
6717 && DECL_EXTERNAL (decl
))
6718 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6720 DECL_EXTERNAL (decl
) = 0;
6721 if (toplevel_bindings_p ())
6722 TREE_STATIC (decl
) = 1;
6724 /* Tell `pushdecl' this is an initialized decl
6725 even though we don't yet have the initializer expression.
6726 Also tell `cp_finish_decl' it may store the real initializer. */
6727 DECL_INITIAL (decl
) = error_mark_node
;
6730 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6732 pushclass (context
, 2);
6734 if (TREE_CODE (decl
) == VAR_DECL
)
6736 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6737 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6738 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6741 if (DECL_CONTEXT (field
) != context
)
6743 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6744 DECL_CONTEXT (field
), DECL_NAME (decl
),
6745 context
, DECL_NAME (decl
));
6746 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6748 /* Static data member are tricky; an in-class initialization
6749 still doesn't provide a definition, so the in-class
6750 declaration will have DECL_EXTERNAL set, but will have an
6751 initialization. Thus, duplicate_decls won't warn
6752 about this situation, and so we check here. */
6753 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6754 cp_error ("duplicate initialization of %D", decl
);
6755 if (duplicate_decls (decl
, field
))
6761 tree field
= check_classfn (context
, decl
);
6762 if (field
&& duplicate_decls (decl
, field
))
6766 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6767 DECL_IN_AGGR_P (decl
) = 0;
6768 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6769 || CLASSTYPE_USE_TEMPLATE (context
))
6771 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6772 /* [temp.expl.spec] An explicit specialization of a static data
6773 member of a template is a definition if the declaration
6774 includes an initializer; otherwise, it is a declaration.
6776 We check for processing_specialization so this only applies
6777 to the new specialization syntax. */
6778 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6779 DECL_EXTERNAL (decl
) = 1;
6782 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6783 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6787 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6788 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6791 /* Set attributes here so if duplicate decl, will have proper attributes. */
6792 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6794 /* Add this decl to the current binding level, but not if it
6795 comes from another scope, e.g. a static member variable.
6796 TEM may equal DECL or it may be a previous decl of the same name. */
6798 if ((TREE_CODE (decl
) != PARM_DECL
&& DECL_CONTEXT (decl
) != NULL_TREE
6799 /* Definitions of namespace members outside their namespace are
6801 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
6802 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
6803 || TREE_CODE (type
) == LANG_TYPE
6804 /* The declaration of template specializations does not affect
6805 the functions available for overload resolution, so we do not
6807 || (TREE_CODE (decl
) == FUNCTION_DECL
6808 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
6811 tem
= pushdecl (decl
);
6813 if (processing_template_decl
)
6815 if (! current_function_decl
)
6816 tem
= push_template_decl (tem
);
6817 else if (minimal_parse_mode
)
6819 = build_min_nt (DECL_STMT
, copy_to_permanent (declarator
),
6820 copy_to_permanent (declspecs
),
6825 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6826 /* Tell the back-end to use or not use .common as appropriate. If we say
6827 -fconserve-space, we want this to save .data space, at the expense of
6828 wrong semantics. If we say -fno-conserve-space, we want this to
6829 produce errors about redefs; to do this we force variables into the
6831 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6834 if (! processing_template_decl
)
6837 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6838 push_obstacks_nochange ();
6841 /* We have no way of knowing whether the initializer will need to be
6842 evaluated at run-time or not until we've parsed it, so let's just put
6843 it in the permanent obstack. (jason) */
6845 && ! (TREE_CODE (tem
) == PARM_DECL
6846 || (TREE_READONLY (tem
)
6847 && (TREE_CODE (tem
) == VAR_DECL
6848 || TREE_CODE (tem
) == FIELD_DECL
))))
6850 /* When parsing and digesting the initializer,
6851 use temporary storage. Do this even if we will ignore the value. */
6852 if (toplevel_bindings_p () && debug_temp_inits
)
6854 if (processing_template_decl
6855 || TYPE_NEEDS_CONSTRUCTING (type
)
6856 || TREE_CODE (type
) == REFERENCE_TYPE
)
6857 /* In this case, the initializer must lay down in permanent
6858 storage, since it will be saved until `finish_file' is run. */
6861 temporary_allocation ();
6873 tree type
= TREE_TYPE (decl
);
6874 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6876 /* If this type of object needs a cleanup, and control may
6877 jump past it, make a new binding level so that it is cleaned
6878 up only when it is initialized first. */
6879 if (TYPE_NEEDS_DESTRUCTOR (type
)
6880 && current_binding_level
->more_cleanups_ok
== 0)
6881 pushlevel_temporary (1);
6884 /* Is it valid for this decl to have an initializer at all?
6885 If not, set INITIALIZED to zero, which will indirectly
6886 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6888 /* Don't allow initializations for incomplete types except for
6889 arrays which might be completed by the initialization. */
6890 if (type
== error_mark_node
)
6891 ; /* Don't complain again. */
6892 else if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6893 ; /* A complete type is ok. */
6894 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6896 cp_error ("variable `%#D' has initializer but incomplete type",
6899 type
= TREE_TYPE (decl
) = error_mark_node
;
6901 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6903 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6904 cp_error ("elements of array `%#D' have incomplete type", decl
);
6905 /* else we already gave an error in start_decl. */
6911 && TREE_CODE (decl
) != TYPE_DECL
6912 && TREE_CODE (decl
) != TEMPLATE_DECL
6913 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6915 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6916 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6918 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6920 /* Change the type so that assemble_variable will give
6921 DECL an rtl we can live with: (mem (const_int 0)). */
6922 type
= TREE_TYPE (decl
) = error_mark_node
;
6926 /* If any base type in the hierarchy of TYPE needs a constructor,
6927 then we set initialized to 1. This way any nodes which are
6928 created for the purposes of initializing this aggregate
6929 will live as long as it does. This is necessary for global
6930 aggregates which do not have their initializers processed until
6931 the end of the file. */
6932 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6937 /* We don't do this yet for GNU C++. */
6938 /* For a local variable, define the RTL now. */
6939 if (! toplevel_bindings_p ()
6940 /* But not if this is a duplicate decl
6941 and we preserved the rtl from the previous one
6942 (which may or may not happen). */
6943 && DECL_RTL (tem
) == NULL_RTX
)
6945 if (TYPE_SIZE (TREE_TYPE (tem
)) != NULL_TREE
)
6947 else if (TREE_CODE (TREE_TYPE (tem
)) == ARRAY_TYPE
6948 && DECL_INITIAL (tem
) != NULL_TREE
)
6954 DECL_INITIAL (decl
) = NULL_TREE
;
6957 /* Handle initialization of references.
6958 These three arguments are from `cp_finish_decl', and have the
6959 same meaning here that they do there.
6961 Quotes on semantics can be found in ARM 8.4.3. */
6964 grok_reference_init (decl
, type
, init
)
6965 tree decl
, type
, init
;
6969 if (init
== NULL_TREE
)
6971 if ((DECL_LANG_SPECIFIC (decl
) == 0
6972 || DECL_IN_AGGR_P (decl
) == 0)
6973 && ! DECL_THIS_EXTERN (decl
))
6975 cp_error ("`%D' declared as reference but not initialized", decl
);
6976 if (TREE_CODE (decl
) == VAR_DECL
)
6977 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
6982 if (init
== error_mark_node
)
6985 if (TREE_CODE (type
) == REFERENCE_TYPE
6986 && TREE_CODE (init
) == CONSTRUCTOR
)
6988 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6992 if (TREE_CODE (init
) == TREE_LIST
)
6993 init
= build_compound_expr (init
);
6995 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6996 init
= convert_from_reference (init
);
6998 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6999 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7001 /* Note: default conversion is only called in very special cases. */
7002 init
= default_conversion (init
);
7005 tmp
= convert_to_reference
7006 (type
, init
, CONV_IMPLICIT
,
7007 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
7009 if (tmp
== error_mark_node
)
7011 else if (tmp
!= NULL_TREE
)
7014 DECL_INITIAL (decl
) = save_expr (init
);
7018 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7022 /* ?? Can this be optimized in some cases to
7023 hand back the DECL_INITIAL slot?? */
7024 if (TYPE_SIZE (TREE_TYPE (type
)))
7026 init
= convert_from_reference (decl
);
7027 if (TREE_PERMANENT (decl
))
7028 init
= copy_to_permanent (init
);
7029 SET_DECL_REFERENCE_SLOT (decl
, init
);
7032 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7034 expand_static_init (decl
, DECL_INITIAL (decl
));
7035 DECL_INITIAL (decl
) = NULL_TREE
;
7040 if (TREE_CODE (decl
) == VAR_DECL
)
7041 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7045 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7046 mucking with forces it does not comprehend (i.e. initialization with a
7047 constructor). If we are at global scope and won't go into COMMON, fill
7048 it in with a dummy CONSTRUCTOR to force the variable into .data;
7049 otherwise we can use error_mark_node. */
7052 obscure_complex_init (decl
, init
)
7055 if (! flag_no_inline
&& TREE_STATIC (decl
))
7057 if (extract_init (decl
, init
))
7061 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7062 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7063 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7067 DECL_INITIAL (decl
) = error_mark_node
;
7072 /* Issue an error message if DECL is an uninitialized const variable. */
7075 check_for_uninitialized_const_var (decl
)
7078 tree type
= TREE_TYPE (decl
);
7080 /* ``Unless explicitly declared extern, a const object does not have
7081 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7083 if (TREE_CODE (decl
) == VAR_DECL
7084 && TREE_CODE (type
) != REFERENCE_TYPE
7085 && CP_TYPE_CONST_P (type
)
7086 && !TYPE_NEEDS_CONSTRUCTING (type
)
7087 && !DECL_INITIAL (decl
))
7088 cp_error ("uninitialized const `%D'", decl
);
7091 /* Finish processing of a declaration;
7092 install its line number and initial value.
7093 If the length of an array type is not known before,
7094 it must be determined now, from the initial value, or it is an error.
7096 Call `pop_obstacks' iff NEED_POP is nonzero.
7098 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7099 for aggregates that have constructors alive on the permanent obstack,
7100 so that the global initializing functions can be written at the end.
7102 INIT0 holds the value of an initializer that should be allowed to escape
7105 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7106 if the (init) syntax was used.
7108 For functions that take default parameters, DECL points to its
7109 "maximal" instantiation. `cp_finish_decl' must then also declared its
7110 subsequently lower and lower forms of instantiation, checking for
7111 ambiguity as it goes. This can be sped up later. */
7114 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7121 tree cleanup
= NULL_TREE
, ttype
= NULL_TREE
;
7123 int temporary
= allocation_temporary_p ();
7124 char *asmspec
= NULL
;
7125 int was_readonly
= 0;
7126 int already_used
= 0;
7128 /* If this is 0, then we did not change obstacks. */
7132 error ("assignment (not initialization) in declaration");
7136 /* If a name was specified, get the string. */
7138 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7140 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7142 cp_error ("Cannot initialize `%D' to namespace `%D'",
7147 if (current_class_type
7148 && DECL_REAL_CONTEXT (decl
) == current_class_type
7149 && TYPE_BEING_DEFINED (current_class_type
)
7150 && (DECL_INITIAL (decl
) || init
))
7151 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7153 if (TREE_CODE (decl
) == VAR_DECL
7154 && DECL_CONTEXT (decl
)
7155 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7156 && DECL_CONTEXT (decl
) != current_namespace
7159 /* Leave the namespace of the object. */
7160 pop_decl_namespace ();
7163 /* If the type of the thing we are declaring either has
7164 a constructor, or has a virtual function table pointer,
7165 AND its initialization was accepted by `start_decl',
7166 then we stayed on the permanent obstack through the
7167 declaration, otherwise, changed obstacks as GCC would. */
7169 type
= TREE_TYPE (decl
);
7171 if (type
== error_mark_node
)
7173 if (toplevel_bindings_p () && temporary
)
7174 end_temporary_allocation ();
7179 if (processing_template_decl
)
7181 if (init
&& DECL_INITIAL (decl
))
7182 DECL_INITIAL (decl
) = init
;
7183 if (minimal_parse_mode
&& ! DECL_ARTIFICIAL (decl
))
7185 tree stmt
= DECL_VINDEX (decl
);
7186 /* If the decl is declaring a member of a local class (in a
7187 template function), the DECL_VINDEX will either be NULL,
7188 or it will be an actual virtual function index, not a
7190 if (stmt
!= NULL_TREE
&& TREE_CODE (stmt
) == DECL_STMT
)
7192 DECL_VINDEX (decl
) = NULL_TREE
;
7193 TREE_OPERAND (stmt
, 2) = copy_to_permanent (init
);
7200 /* Take care of TYPE_DECLs up front. */
7201 if (TREE_CODE (decl
) == TYPE_DECL
)
7203 if (init
&& DECL_INITIAL (decl
))
7205 /* typedef foo = bar; store the type of bar as the type of foo. */
7206 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7207 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7209 if (type
!= error_mark_node
7210 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7212 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7213 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7214 set_identifier_type_value (DECL_NAME (decl
), type
);
7215 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7217 GNU_xref_decl (current_function_decl
, decl
);
7219 /* If we have installed this as the canonical typedef for this
7220 type, and that type has not been defined yet, delay emitting
7221 the debug information for it, as we will emit it later. */
7222 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7223 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7224 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7226 rest_of_decl_compilation (decl
, NULL_PTR
,
7227 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7230 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7232 ttype
= target_type (type
);
7235 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7236 && TYPE_NEEDS_CONSTRUCTING (type
))
7239 /* Currently, GNU C++ puts constants in text space, making them
7240 impossible to initialize. In the future, one would hope for
7241 an operating system which understood the difference between
7242 initialization and the running of a program. */
7244 TREE_READONLY (decl
) = 0;
7247 if (TREE_CODE (decl
) == FIELD_DECL
)
7249 if (init
&& init
!= error_mark_node
)
7250 my_friendly_assert (TREE_PERMANENT (init
), 147);
7254 /* This must override the asm specifier which was placed
7255 by grokclassfn. Lay this out fresh. */
7256 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7257 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7258 make_decl_rtl (decl
, asmspec
, 0);
7261 /* If `start_decl' didn't like having an initialization, ignore it now. */
7262 else if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7264 else if (DECL_EXTERNAL (decl
))
7266 else if (TREE_CODE (type
) == REFERENCE_TYPE
7267 || (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE_REFERENCE (type
)))
7269 if (TREE_STATIC (decl
))
7270 make_decl_rtl (decl
, NULL_PTR
,
7271 toplevel_bindings_p ()
7272 || pseudo_global_level_p ());
7273 grok_reference_init (decl
, type
, init
);
7277 GNU_xref_decl (current_function_decl
, decl
);
7279 if (TREE_CODE (decl
) == FIELD_DECL
)
7281 else if (TREE_CODE (decl
) == CONST_DECL
)
7283 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7285 DECL_INITIAL (decl
) = init
;
7287 /* This will keep us from needing to worry about our obstacks. */
7288 my_friendly_assert (init
!= NULL_TREE
, 149);
7293 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7295 if (TREE_CODE (type
) == ARRAY_TYPE
)
7296 init
= digest_init (type
, init
, (tree
*) 0);
7297 else if (TREE_CODE (init
) == CONSTRUCTOR
7298 && TREE_HAS_CONSTRUCTOR (init
))
7300 if (TYPE_NON_AGGREGATE_CLASS (type
))
7302 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7304 init
= error_mark_node
;
7307 goto dont_use_constructor
;
7312 dont_use_constructor
:
7313 if (TREE_CODE (init
) != TREE_VEC
)
7314 init
= store_init_value (decl
, init
);
7318 /* We must hide the initializer so that expand_decl
7319 won't try to do something it does not understand. */
7320 init
= obscure_complex_init (decl
, init
);
7322 else if (DECL_EXTERNAL (decl
))
7324 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7325 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7328 while (TREE_CODE (ctype
) == ARRAY_TYPE
)
7329 ctype
= TREE_TYPE (ctype
);
7330 if (! TYPE_NEEDS_CONSTRUCTING (ctype
))
7332 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (ctype
))
7333 cp_error ("structure `%D' with uninitialized const members", decl
);
7334 if (CLASSTYPE_REF_FIELDS_NEED_INIT (ctype
))
7335 cp_error ("structure `%D' with uninitialized reference members",
7339 check_for_uninitialized_const_var (decl
);
7341 if (TYPE_SIZE (type
) != NULL_TREE
7342 && TYPE_NEEDS_CONSTRUCTING (type
))
7343 init
= obscure_complex_init (decl
, NULL_TREE
);
7347 check_for_uninitialized_const_var (decl
);
7349 /* For top-level declaration, the initial value was read in
7350 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7351 must go in the permanent obstack; but don't discard the
7352 temporary data yet. */
7354 if (toplevel_bindings_p () && temporary
)
7355 end_temporary_allocation ();
7357 /* Deduce size of array from initialization, if not already known. */
7359 if (TREE_CODE (type
) == ARRAY_TYPE
7360 && TYPE_DOMAIN (type
) == NULL_TREE
7361 && TREE_CODE (decl
) != TYPE_DECL
)
7364 = (TREE_STATIC (decl
)
7365 /* Even if pedantic, an external linkage array
7366 may have incomplete type at first. */
7367 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7368 : !DECL_EXTERNAL (decl
));
7369 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7370 int failure
= complete_array_type (type
, initializer
, do_default
);
7373 cp_error ("initializer fails to determine size of `%D'", decl
);
7378 cp_error ("array size missing in `%D'", decl
);
7379 /* If a `static' var's size isn't known, make it extern as
7380 well as static, so it does not get allocated. If it's not
7381 `static', then don't mark it extern; finish_incomplete_decl
7382 will give it a default size and it will get allocated. */
7383 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7384 DECL_EXTERNAL (decl
) = 1;
7387 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7388 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7390 cp_error ("zero-size array `%D'", decl
);
7392 layout_decl (decl
, 0);
7395 if (TREE_CODE (decl
) == VAR_DECL
)
7397 if (DECL_SIZE (decl
) == NULL_TREE
7398 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7399 layout_decl (decl
, 0);
7401 if (TREE_STATIC (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7403 /* A static variable with an incomplete type:
7404 that is an error if it is initialized.
7405 Otherwise, let it through, but if it is not `extern'
7406 then it may cause an error message later. */
7407 if (DECL_INITIAL (decl
) != NULL_TREE
)
7408 cp_error ("storage size of `%D' isn't known", decl
);
7411 else if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7413 /* An automatic variable with an incomplete type: that is an error.
7414 Don't talk about array types here, since we took care of that
7415 message in grokdeclarator. */
7416 cp_error ("storage size of `%D' isn't known", decl
);
7417 TREE_TYPE (decl
) = error_mark_node
;
7419 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7420 /* Let debugger know it should output info for this type. */
7421 note_debug_info_needed (ttype
);
7423 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7424 note_debug_info_needed (DECL_CONTEXT (decl
));
7426 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7427 && DECL_SIZE (decl
) != NULL_TREE
7428 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7430 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7431 constant_expression_warning (DECL_SIZE (decl
));
7433 cp_error ("storage size of `%D' isn't constant", decl
);
7436 if (! DECL_EXTERNAL (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7437 /* Cleanups for static variables are handled by `finish_file'. */
7438 && ! TREE_STATIC (decl
))
7440 int yes
= suspend_momentary ();
7441 cleanup
= maybe_build_cleanup (decl
);
7442 resume_momentary (yes
);
7445 /* PARM_DECLs get cleanups, too. */
7446 else if (TREE_CODE (decl
) == PARM_DECL
&& TYPE_NEEDS_DESTRUCTOR (type
))
7449 end_temporary_allocation ();
7450 cleanup
= maybe_build_cleanup (decl
);
7452 resume_temporary_allocation ();
7455 /* Output the assembler code and/or RTL code for variables and functions,
7456 unless the type is an undefined structure or union.
7457 If not, it will get done when the type is completed. */
7459 was_incomplete
= (DECL_SIZE (decl
) == NULL_TREE
);
7461 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7462 || TREE_CODE (decl
) == RESULT_DECL
)
7464 /* ??? FIXME: What about nested classes? */
7465 int toplev
= toplevel_bindings_p () || pseudo_global_level_p ();
7467 = (TREE_STATIC (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7468 && allocation_temporary_p ());
7471 end_temporary_allocation ();
7473 /* Static data in a function with comdat linkage also has comdat
7475 if (TREE_CODE (decl
) == VAR_DECL
7476 && TREE_STATIC (decl
)
7477 /* Don't mess with __FUNCTION__. */
7478 && ! TREE_ASM_WRITTEN (decl
)
7479 && current_function_decl
7480 && DECL_CONTEXT (decl
) == current_function_decl
7481 && (DECL_THIS_INLINE (current_function_decl
)
7482 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7483 && TREE_PUBLIC (current_function_decl
))
7485 /* Rather than try to get this right with inlining, we suppress
7486 inlining of such functions. */
7487 current_function_cannot_inline
7488 = "function with static variable cannot be inline";
7490 /* If flag_weak, we don't need to mess with this, as we can just
7491 make the function weak, and let it refer to its unique local
7492 copy. This works because we don't allow the function to be
7496 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7498 TREE_PUBLIC (decl
) = 1;
7499 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7501 else if (DECL_INITIAL (decl
) == NULL_TREE
7502 || DECL_INITIAL (decl
) == error_mark_node
)
7504 TREE_PUBLIC (decl
) = 1;
7505 DECL_COMMON (decl
) = 1;
7507 /* else we lose. We can only do this if we can use common,
7508 which we can't if it has been initialized. */
7510 if (TREE_PUBLIC (decl
))
7511 DECL_ASSEMBLER_NAME (decl
)
7512 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7513 else if (! DECL_ARTIFICIAL (decl
))
7515 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7516 cp_warning_at (" you can work around this by removing the initializer"), decl
;
7521 else if (TREE_CODE (decl
) == VAR_DECL
7522 && DECL_LANG_SPECIFIC (decl
)
7523 && DECL_COMDAT (decl
))
7525 /* Dynamically initialized vars go into common. */
7526 if (DECL_INITIAL (decl
) == NULL_TREE
7527 || DECL_INITIAL (decl
) == error_mark_node
)
7528 DECL_COMMON (decl
) = 1;
7529 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7531 DECL_COMMON (decl
) = 1;
7532 DECL_INITIAL (decl
) = error_mark_node
;
7536 /* Statically initialized vars are weak or comdat, if
7539 make_decl_one_only (decl
);
7542 /* We can't do anything useful; leave vars for explicit
7544 DECL_EXTERNAL (decl
) = 1;
7545 DECL_NOT_REALLY_EXTERN (decl
) = 0;
7550 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7551 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7552 else if (TREE_CODE (decl
) == VAR_DECL
7553 && TREE_READONLY (decl
)
7554 && DECL_INITIAL (decl
) != NULL_TREE
7555 && DECL_INITIAL (decl
) != error_mark_node
7556 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7558 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7561 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7564 && TREE_STATIC (decl
)
7565 && ! TREE_SIDE_EFFECTS (decl
)
7566 && ! TREE_PUBLIC (decl
)
7567 && ! DECL_EXTERNAL (decl
)
7568 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7569 && DECL_MODE (decl
) != BLKmode
)
7571 /* If this variable is really a constant, then fill its DECL_RTL
7572 slot with something which won't take up storage.
7573 If something later should take its address, we can always give
7574 it legitimate RTL at that time. */
7575 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7576 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7577 TREE_ASM_WRITTEN (decl
) = 1;
7579 else if (toplev
&& ! TREE_PUBLIC (decl
))
7581 /* If this is a static const, change its apparent linkage
7582 if it belongs to a #pragma interface. */
7583 if (!interface_unknown
)
7585 TREE_PUBLIC (decl
) = 1;
7586 DECL_EXTERNAL (decl
) = interface_only
;
7588 make_decl_rtl (decl
, asmspec
, toplev
);
7591 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7593 else if (TREE_CODE (decl
) == VAR_DECL
7594 && DECL_LANG_SPECIFIC (decl
)
7595 && DECL_IN_AGGR_P (decl
))
7597 if (TREE_STATIC (decl
))
7599 if (init
== NULL_TREE
7600 #ifdef DEFAULT_STATIC_DEFS
7601 /* If this code is dead, then users must
7602 explicitly declare static member variables
7603 outside the class def'n as well. */
7604 && TYPE_NEEDS_CONSTRUCTING (type
)
7608 DECL_EXTERNAL (decl
) = 1;
7609 make_decl_rtl (decl
, asmspec
, 1);
7612 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7615 /* Just a constant field. Should not need any rtl. */
7619 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7622 resume_temporary_allocation ();
7624 if (type
!= error_mark_node
7625 && TYPE_LANG_SPECIFIC (type
)
7626 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
7627 abstract_virtuals_error (decl
, type
);
7628 else if ((TREE_CODE (type
) == FUNCTION_TYPE
7629 || TREE_CODE (type
) == METHOD_TYPE
)
7630 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
7631 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (type
)))
7632 abstract_virtuals_error (decl
, TREE_TYPE (type
));
7634 if (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE (type
))
7635 signature_error (decl
, type
);
7636 else if ((TREE_CODE (type
) == FUNCTION_TYPE
7637 || TREE_CODE (type
) == METHOD_TYPE
)
7638 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
7639 && IS_SIGNATURE (TREE_TYPE (type
)))
7640 signature_error (decl
, TREE_TYPE (type
));
7642 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7644 else if (DECL_EXTERNAL (decl
)
7645 && ! (DECL_LANG_SPECIFIC (decl
)
7646 && DECL_NOT_REALLY_EXTERN (decl
)))
7649 DECL_INITIAL (decl
) = init
;
7651 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7653 /* Cleanups for static variables are handled by `finish_file'. */
7654 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7655 || TYPE_NEEDS_DESTRUCTOR (type
))
7656 expand_static_init (decl
, init
);
7660 /* This is a declared decl which must live until the
7661 end of the binding contour. It may need a cleanup. */
7663 /* Recompute the RTL of a local array now
7664 if it used to be an incomplete type. */
7665 if (was_incomplete
&& ! TREE_STATIC (decl
))
7667 /* If we used it already as memory, it must stay in memory. */
7668 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7669 /* If it's still incomplete now, no init will save it. */
7670 if (DECL_SIZE (decl
) == NULL_TREE
)
7671 DECL_INITIAL (decl
) = NULL_TREE
;
7674 else if (! TREE_ASM_WRITTEN (decl
)
7675 && (TYPE_SIZE (type
) != NULL_TREE
7676 || TREE_CODE (type
) == ARRAY_TYPE
))
7678 /* Do this here, because we did not expand this decl's
7679 rtl in start_decl. */
7680 if (DECL_RTL (decl
) == NULL_RTX
)
7684 /* XXX: Why don't we use decl here? */
7685 /* Ans: Because it was already expanded? */
7686 if (! expand_decl_cleanup (NULL_TREE
, cleanup
))
7687 cp_error ("parser lost in parsing declaration of `%D'",
7689 /* Cleanup used up here. */
7690 cleanup
= NULL_TREE
;
7694 if (current_binding_level
->is_for_scope
)
7696 struct binding_level
*outer
= current_binding_level
->level_chain
;
7698 /* Check to see if the same name is already bound at
7699 the outer level, either because it was directly declared,
7700 or because a dead for-decl got preserved. In either case,
7701 the code would not have been valid under the ARM
7702 scope rules, so clear is_for_scope for the
7703 current_binding_level.
7705 Otherwise, we need to preserve the temp slot for decl
7706 to last into the outer binding level. */
7708 int handling_dead_for_vars
= 0;
7709 tree link
= outer
->names
;
7710 for (; ; link
= TREE_CHAIN (link
))
7712 if (link
== NULL
&& handling_dead_for_vars
== 0)
7714 link
= outer
->dead_vars_from_for
;
7715 handling_dead_for_vars
= 1;
7719 if (DECL_IN_MEMORY_P (decl
))
7720 preserve_temp_slots (DECL_RTL (decl
));
7723 if (DECL_NAME (link
) == DECL_NAME (decl
))
7725 if (handling_dead_for_vars
)
7728 = purpose_member (DECL_NAME (decl
),
7729 current_binding_level
->shadowed
);
7730 if (shadowing
&& TREE_VALUE (shadowing
) == link
)
7731 TREE_VALUE (shadowing
)
7732 = DECL_SHADOWED_FOR_VAR (link
);
7734 current_binding_level
->is_for_scope
= 0;
7740 expand_start_target_temps ();
7742 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7744 /* Compute and store the initial value. */
7745 expand_decl_init (decl
);
7746 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7748 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7750 emit_line_note (DECL_SOURCE_FILE (decl
),
7751 DECL_SOURCE_LINE (decl
));
7752 expand_aggr_init (decl
, init
, flags
);
7755 /* Set this to 0 so we can tell whether an aggregate which
7756 was initialized was ever used. Don't do this if it has a
7757 destructor, so we don't complain about the 'resource
7758 allocation is initialization' idiom. */
7759 /* Now set attribute((unused)) on types so decls of
7760 that type will be marked used. (see TREE_USED, above.)
7761 This avoids the warning problems this particular code
7762 tried to work around. */
7764 if (TYPE_NEEDS_CONSTRUCTING (type
)
7766 && cleanup
== NULL_TREE
7767 && DECL_NAME (decl
))
7768 TREE_USED (decl
) = 0;
7771 TREE_USED (decl
) = 1;
7774 /* Cleanup any temporaries needed for the initial value. */
7775 expand_end_target_temps ();
7777 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7779 /* Store the cleanup, if there was one. */
7782 if (! expand_decl_cleanup (decl
, cleanup
))
7783 cp_error ("parser lost in parsing declaration of `%D'",
7790 /* Undo call to `pushclass' that was done in `start_decl'
7791 due to initialization of qualified member variable.
7792 I.e., Foo::x = 10; */
7794 tree context
= DECL_REAL_CONTEXT (decl
);
7796 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7797 && (TREE_CODE (decl
) == VAR_DECL
7798 /* We also have a pushclass done that we need to undo here
7799 if we're at top level and declare a method. */
7800 || TREE_CODE (decl
) == FUNCTION_DECL
)
7801 /* If size hasn't been set, we're still defining it,
7802 and therefore inside the class body; don't pop
7803 the binding level.. */
7804 && TYPE_SIZE (context
) != NULL_TREE
7805 && context
== current_class_type
)
7812 /* If requested, warn about definitions of large data objects. */
7814 if (warn_larger_than
7815 && ! processing_template_decl
7816 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7817 && !DECL_EXTERNAL (decl
))
7819 register tree decl_size
= DECL_SIZE (decl
);
7821 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7823 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7825 if (units
> larger_than_size
)
7826 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7832 /* Resume permanent allocation, if not within a function. */
7833 /* The corresponding push_obstacks_nochange is in start_decl,
7834 start_method, groktypename, and in grokfield. */
7839 TREE_READONLY (decl
) = 1;
7842 /* This is here for a midend callback from c-common.c */
7845 finish_decl (decl
, init
, asmspec_tree
)
7849 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7853 expand_static_init (decl
, init
)
7857 tree oldstatic
= value_member (decl
, static_aggregates
);
7861 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7862 cp_error ("multiple initializations given for `%D'", decl
);
7864 else if (! toplevel_bindings_p () && ! pseudo_global_level_p ())
7866 /* Emit code to perform this initialization but once. */
7869 /* Remember this information until end of file. */
7870 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7872 /* Emit code to perform this initialization but once. This code
7875 static int temp = 0;
7877 // Do initialization.
7879 // Register variable for destruction at end of program.
7882 Note that the `temp' variable is only set to 1 *after* the
7883 initialization is complete. This ensures that an exception,
7884 thrown during the construction, will cause the variable to
7885 reinitialized when we pass through this code again, as per:
7889 If the initialization exits by throwing an exception, the
7890 initialization is not complete, so it will be tried again
7891 the next time control enters the declaration.
7893 In theory, this process should be thread-safe, too; multiple
7894 threads should not be able to initialize the variable more
7895 than once. We don't yet attempt to ensure thread-safety. */
7896 temp
= get_temp_name (integer_type_node
, 1);
7897 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7899 /* Begin the conditional initialization. */
7900 expand_start_cond (build_binary_op (EQ_EXPR
, temp
,
7901 integer_zero_node
, 1), 0);
7902 expand_start_target_temps ();
7904 /* Do the initialization itself. */
7905 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
7906 || (init
&& TREE_CODE (init
) == TREE_LIST
))
7908 expand_aggr_init (decl
, init
, 0);
7909 do_pending_stack_adjust ();
7912 expand_assignment (decl
, init
, 0, 0);
7914 /* Set TEMP to 1. */
7915 expand_assignment (temp
, integer_one_node
, 0, 0);
7917 /* Cleanup any temporaries needed for the initial value. If
7918 destroying one of the temporaries causes an exception to be
7919 thrown, then the object itself has still been fully
7921 expand_end_target_temps ();
7923 /* Use atexit to register a function for destroying this static
7925 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7927 tree cleanup
, fcall
;
7928 static tree Atexit
= 0;
7931 tree atexit_fndecl
, PFV
, pfvlist
;
7932 /* Remember this information until end of file. */
7933 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7934 PFV
= build_pointer_type (build_function_type
7935 (void_type_node
, void_list_node
));
7937 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7939 push_lang_context (lang_name_c
);
7941 = builtin_function ("atexit",
7942 build_function_type (void_type_node
,
7944 NOT_BUILT_IN
, NULL_PTR
);
7945 assemble_external (atexit_fndecl
);
7946 Atexit
= default_conversion (atexit_fndecl
);
7947 pop_lang_context ();
7951 /* Call build_cleanup before we enter the anonymous function
7952 so that any access checks will be done relative to the
7953 current scope, rather than the scope of the anonymous
7955 fcall
= build_cleanup (decl
);
7956 cleanup
= start_anon_func ();
7957 expand_expr_stmt (fcall
);
7959 mark_addressable (cleanup
);
7960 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7961 fcall
= build_function_call (Atexit
, expr_tree_cons (NULL_TREE
, cleanup
, NULL_TREE
));
7962 expand_expr_stmt (fcall
);
7966 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7968 static_aggregates
= perm_tree_cons (temp
, decl
, static_aggregates
);
7969 TREE_STATIC (static_aggregates
) = 1;
7972 /* Resume old (possibly temporary) allocation. */
7977 /* This code takes into account memory allocation
7978 policy of `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING
7979 does not hold for this object, then we must make permanent
7980 the storage currently in the temporary obstack. */
7981 if (! TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
7982 preserve_initializer ();
7983 static_aggregates
= perm_tree_cons (init
, decl
, static_aggregates
);
7987 /* Make TYPE a complete type based on INITIAL_VALUE.
7988 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
7989 2 if there was no information (in which case assume 1 if DO_DEFAULT). */
7992 complete_array_type (type
, initial_value
, do_default
)
7993 tree type
, initial_value
;
7996 register tree maxindex
= NULL_TREE
;
8001 /* Note MAXINDEX is really the maximum index,
8002 one less than the size. */
8003 if (TREE_CODE (initial_value
) == STRING_CST
)
8006 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8007 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8010 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8012 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8013 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8014 for (; elts
; elts
= TREE_CHAIN (elts
))
8016 if (TREE_PURPOSE (elts
))
8017 maxindex
= TREE_PURPOSE (elts
);
8019 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8021 maxindex
= copy_node (maxindex
);
8025 /* Make an error message unless that happened already. */
8026 if (initial_value
!= error_mark_node
)
8029 /* Prevent further error messages. */
8030 maxindex
= build_int_2 (0, 0);
8037 maxindex
= build_int_2 (0, 0);
8045 TYPE_DOMAIN (type
) = build_index_type (maxindex
);
8046 if (! TREE_TYPE (maxindex
))
8047 TREE_TYPE (maxindex
) = TYPE_DOMAIN (type
);
8049 itype
= TREE_TYPE (initial_value
);
8052 if (itype
&& !TYPE_DOMAIN (itype
))
8053 TYPE_DOMAIN (itype
) = TYPE_DOMAIN (type
);
8054 /* The type of the main variant should never be used for arrays
8055 of different sizes. It should only ever be completed with the
8056 size of the array. */
8057 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8058 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = TYPE_DOMAIN (type
);
8061 /* Lay out the type now that we can get the real answer. */
8068 /* Return zero if something is declared to be a member of type
8069 CTYPE when in the context of CUR_TYPE. STRING is the error
8070 message to print in that case. Otherwise, quietly return 1. */
8073 member_function_or_else (ctype
, cur_type
, string
)
8074 tree ctype
, cur_type
;
8077 if (ctype
&& ctype
!= cur_type
)
8079 error (string
, TYPE_NAME_STRING (ctype
));
8085 /* Subroutine of `grokdeclarator'. */
8087 /* Generate errors possibly applicable for a given set of specifiers.
8088 This is for ARM $7.1.2. */
8091 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8094 int virtualp
, quals
, friendp
, raises
, inlinep
;
8097 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8099 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8101 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8104 cp_error_at ("invalid friend declaration", object
);
8106 cp_error_at ("invalid exception specifications", object
);
8109 /* CTYPE is class type, or null if non-class.
8110 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8112 DECLARATOR is the function's name.
8113 VIRTUALP is truthvalue of whether the function is virtual or not.
8114 FLAGS are to be passed through to `grokclassfn'.
8115 QUALS are qualifiers indicating whether the function is `const'
8117 RAISES is a list of exceptions that this function can raise.
8118 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8119 not look, and -1 if we should not call `grokclassfn' at all.
8121 Returns `error_mark_node' if something goes wrong, after issuing
8122 applicable error messages. */
8125 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8126 raises
, attrlist
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8127 template_count
, in_namespace
)
8130 tree orig_declarator
;
8132 enum overload_flags flags
;
8133 tree quals
, raises
, attrlist
;
8134 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8138 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8142 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8143 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8149 type
= build_exception_variant (type
, raises
);
8152 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8153 /* Propagate volatile out from type to decl. */
8154 if (TYPE_VOLATILE (type
))
8155 TREE_THIS_VOLATILE (decl
) = 1;
8157 /* If this decl has namespace scope, set that up. */
8159 set_decl_namespace (decl
, in_namespace
);
8160 else if (publicp
&& ! ctype
)
8161 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8163 /* `main' and builtins have implicit 'C' linkage. */
8164 if ((MAIN_NAME_P (declarator
)
8165 || (IDENTIFIER_LENGTH (declarator
) > 10
8166 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8167 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8168 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8169 && current_lang_name
== lang_name_cplusplus
8170 && ctype
== NULL_TREE
8171 /* NULL_TREE means global namespace. */
8172 && DECL_CONTEXT (decl
) == NULL_TREE
)
8173 DECL_LANGUAGE (decl
) = lang_c
;
8175 /* Should probably propagate const out from type to decl I bet (mrs). */
8178 DECL_STATIC_FUNCTION_P (decl
) = 1;
8179 DECL_CONTEXT (decl
) = ctype
;
8183 DECL_CLASS_CONTEXT (decl
) = ctype
;
8185 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8187 if (processing_template_decl
)
8188 error ("cannot declare `main' to be a template");
8190 error ("cannot declare `main' to be inline");
8192 error ("cannot declare `main' to be static");
8197 /* Members of anonymous types and local classes have no linkage; make
8199 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8200 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8205 /* [basic.link]: A name with no linkage (notably, the name of a class
8206 or enumeration declared in a local scope) shall not be used to
8207 declare an entity with linkage.
8209 Only check this for public decls for now. */
8210 t
= no_linkage_check (TREE_TYPE (decl
));
8213 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8215 if (DECL_LANGUAGE (decl
) == lang_c
)
8216 /* Allow this; it's pretty common in C. */;
8218 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8222 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8227 TREE_PUBLIC (decl
) = publicp
;
8230 DECL_INTERFACE_KNOWN (decl
) = 1;
8231 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8235 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8237 DECL_EXTERNAL (decl
) = 1;
8238 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8240 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8241 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8245 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8246 grok_op_properties (decl
, virtualp
, check
< 0);
8248 if (ctype
&& hack_decl_function_context (decl
))
8249 DECL_NO_STATIC_CHAIN (decl
) = 1;
8251 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8252 if (TREE_PURPOSE (t
)
8253 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8255 add_defarg_fn (decl
);
8260 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8264 ("defining explicit specialization `%D' in friend declaration",
8268 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8270 /* Something like `template <class T> friend void f<T>()'. */
8271 cp_error ("template-id `%D' in declaration of primary template",
8273 return error_mark_node
;
8276 /* A friend declaration of the form friend void f<>(). Record
8277 the information in the TEMPLATE_ID_EXPR. */
8278 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8279 DECL_TEMPLATE_INFO (decl
)
8280 = perm_tree_cons (TREE_OPERAND (orig_declarator
, 0),
8281 TREE_OPERAND (orig_declarator
, 1),
8286 /* Plain overloading: will not be grok'd by grokclassfn. */
8287 if (! ctype
&& ! processing_template_decl
8288 && DECL_LANGUAGE (decl
) != lang_c
8289 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8290 set_mangled_name_for_decl (decl
);
8293 /* Make the init_value nonzero so pushdecl knows this is not
8294 tentative. error_mark_node is replaced later with the BLOCK. */
8295 DECL_INITIAL (decl
) = error_mark_node
;
8297 /* Caller will do the rest of this. */
8301 if (check
&& funcdef_flag
)
8302 DECL_INITIAL (decl
) = error_mark_node
;
8304 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8307 /* Just handle constructors here. We could do this
8308 inside the following if stmt, but I think
8309 that the code is more legible by breaking this
8310 case out. See comments below for what each of
8311 the following calls is supposed to do. */
8312 DECL_CONSTRUCTOR_P (decl
) = 1;
8314 grokclassfn (ctype
, decl
, flags
, quals
);
8316 decl
= check_explicit_specialization (orig_declarator
, decl
,
8318 2 * (funcdef_flag
!= 0) +
8319 4 * (friendp
!= 0));
8320 if (decl
== error_mark_node
)
8321 return error_mark_node
;
8323 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8326 tmp
= check_classfn (ctype
, decl
);
8328 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8329 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8331 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8332 cp_error ("definition of implicitly-declared `%D'", tmp
);
8333 if (tmp
&& duplicate_decls (decl
, tmp
))
8336 if (! grok_ctor_properties (ctype
, decl
))
8337 return error_mark_node
;
8343 /* Function gets the ugly name, field gets the nice one.
8344 This call may change the type of the function (because
8345 of default parameters)! */
8346 if (ctype
!= NULL_TREE
)
8347 grokclassfn (ctype
, decl
, flags
, quals
);
8349 decl
= check_explicit_specialization (orig_declarator
, decl
,
8351 2 * (funcdef_flag
!= 0) +
8352 4 * (friendp
!= 0));
8353 if (decl
== error_mark_node
)
8354 return error_mark_node
;
8356 if (ctype
!= NULL_TREE
8357 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8360 tmp
= check_classfn (ctype
, decl
);
8362 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8363 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8365 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8366 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8368 /* Remove the `this' parm added by grokclassfn.
8369 XXX Isn't this done in start_function, too? */
8370 revert_static_member_fn (&decl
, NULL
, NULL
);
8371 last_function_parms
= TREE_CHAIN (last_function_parms
);
8373 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8374 cp_error ("definition of implicitly-declared `%D'", tmp
);
8377 if (!duplicate_decls (decl
, tmp
))
8378 my_friendly_abort (892);
8383 if (ctype
== NULL_TREE
|| check
)
8387 cplus_decl_attributes (decl
, TREE_PURPOSE (attrlist
),
8388 TREE_VALUE (attrlist
));
8389 make_decl_rtl (decl
, NULL_PTR
, 1);
8393 DECL_VIRTUAL_P (decl
) = 1;
8394 if (DECL_VINDEX (decl
) == NULL_TREE
)
8395 DECL_VINDEX (decl
) = error_mark_node
;
8396 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8403 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8406 RID_BIT_TYPE
*specbits_in
;
8412 RID_BIT_TYPE specbits
;
8414 specbits
= *specbits_in
;
8416 if (TREE_CODE (type
) == OFFSET_TYPE
)
8418 /* If you declare a static member so that it
8419 can be initialized, the code will reach here. */
8420 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8421 type
= TREE_TYPE (type
);
8422 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
8423 DECL_CONTEXT (decl
) = basetype
;
8424 DECL_CLASS_CONTEXT (decl
) = basetype
;
8425 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8432 context
= in_namespace
;
8433 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8434 context
= current_namespace
;
8436 context
= NULL_TREE
;
8438 decl
= build_decl (VAR_DECL
, declarator
, complete_type (type
));
8441 set_decl_namespace (decl
, context
);
8443 context
= DECL_CONTEXT (decl
);
8444 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8445 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8449 set_decl_namespace (decl
, in_namespace
);
8451 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8453 DECL_THIS_EXTERN (decl
) = 1;
8454 DECL_EXTERNAL (decl
) = !initialized
;
8457 /* In class context, static means one per class,
8458 public access, and static storage. */
8459 if (DECL_CLASS_SCOPE_P (decl
))
8461 TREE_PUBLIC (decl
) = 1;
8462 TREE_STATIC (decl
) = 1;
8463 DECL_EXTERNAL (decl
) = 0;
8465 /* At top level, either `static' or no s.c. makes a definition
8466 (perhaps tentative), and absence of `static' makes it public. */
8467 else if (toplevel_bindings_p ())
8469 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8470 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8471 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8473 /* Not at top level, only `static' makes a static definition. */
8476 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8477 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8480 if (TREE_PUBLIC (decl
))
8482 /* [basic.link]: A name with no linkage (notably, the name of a class
8483 or enumeration declared in a local scope) shall not be used to
8484 declare an entity with linkage.
8486 Only check this for public decls for now. */
8487 tree t
= no_linkage_check (TREE_TYPE (decl
));
8490 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8491 /* Ignore for now; `enum { foo } e' is pretty common. */;
8493 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8501 /* Create a canonical pointer to member function type. */
8504 build_ptrmemfunc_type (type
)
8511 /* If a canonical type already exists for this type, use it. We use
8512 this method instead of type_hash_canon, because it only does a
8513 simple equality check on the list of field members. */
8515 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8518 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8520 u
= make_lang_type (UNION_TYPE
);
8521 SET_IS_AGGR_TYPE (u
, 0);
8522 fields
[0] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
, type
);
8523 fields
[1] = build_lang_field_decl (FIELD_DECL
, delta2_identifier
,
8525 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8526 TYPE_NAME (u
) = NULL_TREE
;
8528 t
= make_lang_type (RECORD_TYPE
);
8530 /* Let the front-end know this is a pointer to member function... */
8531 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8532 /* ... and not really an aggregate. */
8533 SET_IS_AGGR_TYPE (t
, 0);
8535 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
8537 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
8539 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8540 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8544 /* Zap out the name so that the back-end will give us the debugging
8545 information for this anonymous RECORD_TYPE. */
8546 TYPE_NAME (t
) = NULL_TREE
;
8548 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8550 /* Seems to be wanted. */
8551 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8555 /* Given declspecs and a declarator,
8556 determine the name and type of the object declared
8557 and construct a ..._DECL node for it.
8558 (In one case we can return a ..._TYPE node instead.
8559 For invalid input we sometimes return 0.)
8561 DECLSPECS is a chain of tree_list nodes whose value fields
8562 are the storage classes and type specifiers.
8564 DECL_CONTEXT says which syntactic context this declaration is in:
8565 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8566 FUNCDEF for a function definition. Like NORMAL but a few different
8567 error messages in each case. Return value may be zero meaning
8568 this definition is too screwy to try to parse.
8569 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8570 handle member functions (which have FIELD context).
8571 Return value may be zero meaning this definition is too screwy to
8573 PARM for a parameter declaration (either within a function prototype
8574 or before a function body). Make a PARM_DECL, or return void_type_node.
8575 CATCHPARM for a parameter declaration before a catch clause.
8576 TYPENAME if for a typename (in a cast or sizeof).
8577 Don't make a DECL node; just return the ..._TYPE node.
8578 FIELD for a struct or union field; make a FIELD_DECL.
8579 BITFIELD for a field with specified width.
8580 INITIALIZED is 1 if the decl has an initializer.
8582 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8583 It may also be so in the PARM case, for a prototype where the
8584 argument type is specified but not the name.
8586 This function is where the complicated C meanings of `static'
8587 and `extern' are interpreted.
8589 For C++, if there is any monkey business to do, the function which
8590 calls this one must do it, i.e., prepending instance variables,
8591 renaming overloaded function names, etc.
8593 Note that for this C++, it is an error to define a method within a class
8594 which does not belong to that class.
8596 Except in the case where SCOPE_REFs are implicitly known (such as
8597 methods within a class being redundantly qualified),
8598 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8599 (class_name::decl_name). The caller must also deal with this.
8601 If a constructor or destructor is seen, and the context is FIELD,
8602 then the type gains the attribute TREE_HAS_x. If such a declaration
8603 is erroneous, NULL_TREE is returned.
8605 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8606 function, these are the qualifiers to give to the `this' pointer.
8608 May return void_type_node if the declarator turned out to be a friend.
8609 See grokfield for details. */
8611 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8613 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8614 Check to see that the definition is valid. Issue appropriate error
8615 messages. Return 1 if the definition is particularly bad, or 0
8619 check_static_variable_definition (decl
, type
)
8623 /* Motion 10 at San Diego: If a static const integral data member is
8624 initialized with an integral constant expression, the initializer
8625 may appear either in the declaration (within the class), or in
8626 the definition, but not both. If it appears in the class, the
8627 member is a member constant. The file-scope definition is always
8629 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8631 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8633 /* If we just return the declaration, crashes will sometimes
8634 occur. We therefore return void_type_node, as if this was a
8635 friend declaration, to cause callers to completely ignore
8636 this declaration. */
8639 else if (!CP_TYPE_CONST_P (type
))
8640 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8642 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8643 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8649 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8652 enum decl_context decl_context
;
8656 RID_BIT_TYPE specbits
;
8659 tree type
= NULL_TREE
;
8665 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8666 int explicit_int
= 0;
8667 int explicit_char
= 0;
8668 int defaulted_int
= 0;
8669 int opaque_typedef
= 0;
8670 tree typedef_decl
= NULL_TREE
;
8672 tree typedef_type
= NULL_TREE
;
8673 int funcdef_flag
= 0;
8674 enum tree_code innermost_code
= ERROR_MARK
;
8677 /* See the code below that used this. */
8678 tree decl_machine_attr
= NULL_TREE
;
8680 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8681 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8682 tree init
= NULL_TREE
;
8684 /* Keep track of what sort of function is being processed
8685 so that we can warn about default return values, or explicit
8686 return values which do not match prescribed defaults. */
8687 enum return_types return_type
= return_normal
;
8689 tree dname
= NULL_TREE
;
8690 tree ctype
= current_class_type
;
8691 tree ctor_return_type
= NULL_TREE
;
8692 enum overload_flags flags
= NO_SPECIAL
;
8693 tree quals
= NULL_TREE
;
8694 tree raises
= NULL_TREE
;
8695 int template_count
= 0;
8696 tree in_namespace
= NULL_TREE
;
8700 RIDBIT_RESET_ALL (specbits
);
8701 if (decl_context
== FUNCDEF
)
8702 funcdef_flag
= 1, decl_context
= NORMAL
;
8703 else if (decl_context
== MEMFUNCDEF
)
8704 funcdef_flag
= -1, decl_context
= FIELD
;
8705 else if (decl_context
== BITFIELD
)
8706 bitfield
= 1, decl_context
= FIELD
;
8708 /* Look inside a declarator for the name being declared
8709 and get it as a string, for an error message. */
8711 tree
*next
= &declarator
;
8715 while (next
&& *next
)
8718 switch (TREE_CODE (decl
))
8721 /* For attributes. */
8722 next
= &TREE_VALUE (decl
);
8727 next
= &TREE_OPERAND (decl
, 0);
8730 case BIT_NOT_EXPR
: /* For C++ destructors! */
8732 tree name
= TREE_OPERAND (decl
, 0);
8733 tree rename
= NULL_TREE
;
8735 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8737 return_type
= return_dtor
;
8738 if (TREE_CODE (name
) == TYPE_DECL
)
8739 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8740 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8741 if (ctype
== NULL_TREE
)
8743 if (current_class_type
== NULL_TREE
)
8745 error ("destructors must be member functions");
8750 tree t
= constructor_name (current_class_name
);
8757 tree t
= constructor_name (ctype
);
8764 cp_error ("destructor `%T' must match class name `%T'",
8766 TREE_OPERAND (decl
, 0) = rename
;
8772 case ADDR_EXPR
: /* C++ reference declaration */
8777 innermost_code
= TREE_CODE (decl
);
8778 next
= &TREE_OPERAND (decl
, 0);
8782 if (parmlist_is_exprlist (TREE_OPERAND (decl
, 1)))
8784 /* This is actually a variable declaration using constructor
8785 syntax. We need to call start_decl and cp_finish_decl so we
8786 can get the variable initialized... */
8788 *next
= TREE_OPERAND (decl
, 0);
8789 init
= TREE_OPERAND (decl
, 1);
8791 decl
= start_decl (declarator
, declspecs
, 1, NULL_TREE
, NULL_TREE
);
8794 /* Look for __unused__ attribute */
8795 if (TREE_USED (TREE_TYPE (decl
)))
8796 TREE_USED (decl
) = 1;
8797 finish_decl (decl
, init
, NULL_TREE
);
8800 cp_error ("invalid declarator");
8803 innermost_code
= TREE_CODE (decl
);
8804 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8805 ctype
= current_class_type
;
8807 && TREE_OPERAND (decl
, 0)
8808 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8809 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8810 == constructor_name_full (ctype
))
8811 || (DECL_NAME (TREE_OPERAND (decl
, 0))
8812 == constructor_name (ctype
)))))
8813 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8814 next
= &TREE_OPERAND (decl
, 0);
8816 if (ctype
!= NULL_TREE
8817 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
8818 && decl
== constructor_name (ctype
))
8820 return_type
= return_ctor
;
8821 ctor_return_type
= ctype
;
8826 case TEMPLATE_ID_EXPR
:
8828 tree fns
= TREE_OPERAND (decl
, 0);
8830 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
8831 fns
= TREE_OPERAND (fns
, 0);
8833 if (TREE_CODE (fns
) == IDENTIFIER_NODE
)
8835 else if (is_overloaded_fn (fns
))
8836 dname
= DECL_NAME (get_first_fn (fns
));
8838 my_friendly_abort (0);
8842 case IDENTIFIER_NODE
:
8843 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
8850 cp_error ("declarator-id missing; using reserved word `%D'",
8852 name
= IDENTIFIER_POINTER (dname
);
8854 if (! IDENTIFIER_OPNAME_P (dname
)
8855 /* GNU/Linux headers use '__op'. Arrgh. */
8856 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
8857 name
= IDENTIFIER_POINTER (dname
);
8860 if (IDENTIFIER_TYPENAME_P (dname
))
8862 my_friendly_assert (flags
== NO_SPECIAL
, 154);
8863 flags
= TYPENAME_FLAG
;
8864 ctor_return_type
= TREE_TYPE (dname
);
8865 return_type
= return_conversion
;
8867 name
= operator_name_string (dname
);
8874 /* Perform error checking, and decide on a ctype. */
8875 tree cname
= TREE_OPERAND (decl
, 0);
8876 if (cname
== NULL_TREE
)
8878 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
8881 in_namespace
= TREE_OPERAND (decl
, 0);
8882 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8884 else if (! is_aggr_type (cname
, 1))
8885 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8886 /* Must test TREE_OPERAND (decl, 1), in case user gives
8887 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
8888 else if (TREE_OPERAND (decl
, 1)
8889 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
8891 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
8892 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
8894 cp_error ("`%T::%D' is not a valid declarator", cname
,
8895 TREE_OPERAND (decl
, 1));
8896 cp_error (" perhaps you want `typename %T::%D' to make it a type",
8897 cname
, TREE_OPERAND (decl
, 1));
8898 return void_type_node
;
8900 else if (ctype
== NULL_TREE
)
8902 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
8903 TREE_OPERAND (decl
, 0) = ctype
;
8906 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
8908 cp_error ("type `%T' is not derived from type `%T'",
8910 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8916 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
8917 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
8918 == constructor_name_full (ctype
))
8919 || (DECL_NAME (TREE_OPERAND (decl
, 1))
8920 == constructor_name (ctype
))))
8921 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
8922 next
= &TREE_OPERAND (decl
, 1);
8926 if (TREE_CODE (decl
) == IDENTIFIER_NODE
8927 && constructor_name (ctype
) == decl
)
8929 return_type
= return_ctor
;
8930 ctor_return_type
= ctype
;
8932 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
8933 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
8934 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
8935 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
8937 return_type
= return_dtor
;
8938 ctor_return_type
= ctype
;
8940 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8941 next
= &TREE_OPERAND (decl
, 0);
8952 /* Parse error puts this typespec where
8953 a declarator should go. */
8954 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
8955 if (TREE_TYPE (decl
) == current_class_type
)
8956 cp_error (" perhaps you want `%T' for a constructor",
8957 current_class_name
);
8958 dname
= DECL_NAME (decl
);
8959 name
= IDENTIFIER_POINTER (dname
);
8961 /* Avoid giving two errors for this. */
8962 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
8964 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
8971 cp_compiler_error ("`%D' as declarator", decl
);
8972 return 0; /* We used to do a 155 abort here. */
8979 /* A function definition's declarator must have the form of
8980 a function declarator. */
8982 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
8985 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
8986 && innermost_code
!= CALL_EXPR
8987 && ! (ctype
&& declspecs
== NULL_TREE
))
8989 cp_error ("declaration of `%D' as non-function", dname
);
8990 return void_type_node
;
8993 /* Anything declared one level down from the top level
8994 must be one of the parameters of a function
8995 (because the body is at least two levels down). */
8997 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
8998 by not allowing C++ class definitions to specify their parameters
8999 with xdecls (must be spec.d in the parmlist).
9001 Since we now wait to push a class scope until we are sure that
9002 we are in a legitimate method context, we must set oldcname
9003 explicitly (since current_class_name is not yet alive).
9005 We also want to avoid calling this a PARM if it is in a namespace. */
9007 if (decl_context
== NORMAL
&& ! namespace_bindings_p ()
9008 && ! pseudo_global_level_p ())
9010 struct binding_level
*b
= current_binding_level
;
9011 current_binding_level
= b
->level_chain
;
9012 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9013 decl_context
= PARM
;
9014 current_binding_level
= b
;
9017 /* Look through the decl specs and record which ones appear.
9018 Some typespecs are defined as built-in typenames.
9019 Others, the ones that are modifiers of other types,
9020 are represented by bits in SPECBITS: set the bits for
9021 the modifiers that appear. Storage class keywords are also in SPECBITS.
9023 If there is a typedef name or a type, store the type in TYPE.
9024 This includes builtin typedefs such as `int'.
9026 Set EXPLICIT_INT if the type is `int' or `char' and did not
9027 come from a user typedef.
9029 Set LONGLONG if `long' is mentioned twice.
9031 For C++, constructors and destructors have their own fast treatment. */
9033 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9038 /* Certain parse errors slip through. For example,
9039 `int class;' is not caught by the parser. Try
9040 weakly to recover here. */
9041 if (TREE_CODE (spec
) != TREE_LIST
)
9044 id
= TREE_VALUE (spec
);
9046 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9048 if (id
== ridpointers
[(int) RID_INT
]
9049 || id
== ridpointers
[(int) RID_CHAR
]
9050 || id
== ridpointers
[(int) RID_BOOL
]
9051 || id
== ridpointers
[(int) RID_WCHAR
])
9055 if (id
== ridpointers
[(int) RID_BOOL
])
9056 error ("`bool' is now a keyword");
9058 cp_error ("extraneous `%T' ignored", id
);
9062 if (id
== ridpointers
[(int) RID_INT
])
9064 else if (id
== ridpointers
[(int) RID_CHAR
])
9066 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9070 /* C++ aggregate types. */
9071 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9074 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9076 type
= IDENTIFIER_TYPE_VALUE (id
);
9080 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9082 if (ridpointers
[i
] == id
)
9084 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9086 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9087 pedwarn ("ANSI C++ does not support `long long'");
9089 error ("`long long long' is too long for GCC");
9093 else if (RIDBIT_SETP (i
, specbits
))
9094 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9095 RIDBIT_SET (i
, specbits
);
9100 /* C++ aggregate types. */
9101 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9104 cp_error ("multiple declarations `%T' and `%T'", type
,
9108 type
= TREE_TYPE (id
);
9109 TREE_VALUE (spec
) = type
;
9114 error ("two or more data types in declaration of `%s'", name
);
9115 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9117 register tree t
= lookup_name (id
, 1);
9118 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9119 error ("`%s' fails to be a typedef or built in type",
9120 IDENTIFIER_POINTER (id
));
9123 type
= TREE_TYPE (t
);
9125 /* See the code below that used this. */
9126 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9131 else if (id
!= error_mark_node
)
9132 /* Can't change CLASS nodes into RECORD nodes here! */
9138 typedef_type
= type
;
9140 /* No type at all: default to `int', and set DEFAULTED_INT
9141 because it was not a user-defined typedef.
9142 Except when we have a `typedef' inside a signature, in
9143 which case the type defaults to `unknown type' and is
9144 instantiated when assigning to a signature pointer or ref. */
9146 if (type
== NULL_TREE
9147 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9148 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9149 || RIDBIT_SETP (RID_LONG
, specbits
)
9150 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9152 /* These imply 'int'. */
9153 type
= integer_type_node
;
9157 if (type
== NULL_TREE
)
9160 if (return_type
== return_dtor
)
9161 type
= void_type_node
;
9162 else if (return_type
== return_ctor
)
9163 type
= build_pointer_type (ctor_return_type
);
9164 else if (return_type
== return_conversion
)
9165 type
= ctor_return_type
;
9166 else if (current_class_type
9167 && IS_SIGNATURE (current_class_type
)
9168 && RIDBIT_SETP (RID_TYPEDEF
, specbits
)
9169 && (decl_context
== FIELD
|| decl_context
== NORMAL
))
9173 type
= copy_node (opaque_type_node
);
9177 if (! pedantic
&& ! warn_return_type
9179 && MAIN_NAME_P (dname
)
9180 && ctype
== NULL_TREE
9181 && in_namespace
== NULL_TREE
9182 && current_namespace
== global_namespace
)
9183 /* Let `main () { }' slide, since it's so common. */;
9185 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9187 type
= integer_type_node
;
9190 else if (return_type
== return_dtor
)
9192 error ("return type specification for destructor invalid");
9193 type
= void_type_node
;
9195 else if (return_type
== return_ctor
)
9197 error ("return type specification for constructor invalid");
9198 type
= build_pointer_type (ctor_return_type
);
9200 else if (return_type
== return_conversion
)
9202 if (!same_type_p (type
, ctor_return_type
))
9203 cp_error ("operator `%T' declared to return `%T'",
9204 ctor_return_type
, type
);
9206 cp_pedwarn ("return type specified for `operator %T'",
9209 type
= ctor_return_type
;
9214 /* Now process the modifiers that were specified
9215 and check for invalid combinations. */
9217 /* Long double is a special combination. */
9219 if (RIDBIT_SETP (RID_LONG
, specbits
)
9220 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9222 RIDBIT_RESET (RID_LONG
, specbits
);
9223 type
= build_qualified_type (long_double_type_node
,
9224 CP_TYPE_QUALS (type
));
9227 /* Check all other uses of type modifiers. */
9229 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9230 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9231 || RIDBIT_SETP (RID_LONG
, specbits
)
9232 || RIDBIT_SETP (RID_SHORT
, specbits
))
9236 if (TREE_CODE (type
) == REAL_TYPE
)
9237 error ("short, signed or unsigned invalid for `%s'", name
);
9238 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9239 error ("long, short, signed or unsigned invalid for `%s'", name
);
9240 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9241 && RIDBIT_SETP (RID_SHORT
, specbits
))
9242 error ("long and short specified together for `%s'", name
);
9243 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9244 || RIDBIT_SETP (RID_SHORT
, specbits
))
9246 error ("long or short specified with char for `%s'", name
);
9247 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9248 || RIDBIT_SETP (RID_SHORT
, specbits
))
9249 && TREE_CODE (type
) == REAL_TYPE
)
9250 error ("long or short specified with floating type for `%s'", name
);
9251 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9252 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9253 error ("signed and unsigned given together for `%s'", name
);
9257 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9259 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9261 if (flag_pedantic_errors
)
9266 /* Discard the type modifiers if they are invalid. */
9269 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9270 RIDBIT_RESET (RID_SIGNED
, specbits
);
9271 RIDBIT_RESET (RID_LONG
, specbits
);
9272 RIDBIT_RESET (RID_SHORT
, specbits
);
9277 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9278 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9280 error ("complex invalid for `%s'", name
);
9281 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9284 /* Decide whether an integer type is signed or not.
9285 Optionally treat bitfields as signed by default. */
9286 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9287 || (bitfield
&& ! flag_signed_bitfields
9288 && (explicit_int
|| defaulted_int
|| explicit_char
9289 /* A typedef for plain `int' without `signed'
9290 can be controlled just like plain `int'. */
9291 || ! (typedef_decl
!= NULL_TREE
9292 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
9293 && TREE_CODE (type
) != ENUMERAL_TYPE
9294 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)))
9297 type
= long_long_unsigned_type_node
;
9298 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9299 type
= long_unsigned_type_node
;
9300 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9301 type
= short_unsigned_type_node
;
9302 else if (type
== char_type_node
)
9303 type
= unsigned_char_type_node
;
9304 else if (typedef_decl
)
9305 type
= unsigned_type (type
);
9307 type
= unsigned_type_node
;
9309 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9310 && type
== char_type_node
)
9311 type
= signed_char_type_node
;
9313 type
= long_long_integer_type_node
;
9314 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9315 type
= long_integer_type_node
;
9316 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9317 type
= short_integer_type_node
;
9319 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9321 /* If we just have "complex", it is equivalent to
9322 "complex double", but if any modifiers at all are specified it is
9323 the complex form of TYPE. E.g, "complex short" is
9324 "complex short int". */
9326 if (defaulted_int
&& ! longlong
9327 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9328 || RIDBIT_SETP (RID_SHORT
, specbits
)
9329 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9330 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9331 type
= complex_double_type_node
;
9332 else if (type
== integer_type_node
)
9333 type
= complex_integer_type_node
;
9334 else if (type
== float_type_node
)
9335 type
= complex_float_type_node
;
9336 else if (type
== double_type_node
)
9337 type
= complex_double_type_node
;
9338 else if (type
== long_double_type_node
)
9339 type
= complex_long_double_type_node
;
9341 type
= build_complex_type (type
);
9344 if (return_type
== return_conversion
9345 && (RIDBIT_SETP (RID_CONST
, specbits
)
9346 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9347 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9348 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9351 /* Set CONSTP if this declaration is `const', whether by
9352 explicit specification or via a typedef.
9353 Likewise for VOLATILEP. */
9355 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9357 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9359 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9360 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9361 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9362 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9363 type
= cp_build_qualified_type (type
, type_quals
);
9365 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9366 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9367 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9368 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9369 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9371 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9372 staticp
= 1 + (decl_context
== FIELD
);
9374 if (virtualp
&& staticp
== 2)
9376 cp_error ("member `%D' cannot be declared both virtual and static",
9380 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9381 RIDBIT_RESET (RID_FRIEND
, specbits
);
9383 /* $7.1.2, Function specifiers */
9384 if (friendp
&& explicitp
)
9385 error ("only declarations of constructors can be `explicit'");
9387 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9389 if (decl_context
== PARM
)
9391 error ("non-member `%s' cannot be declared `mutable'", name
);
9392 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9394 else if (friendp
|| decl_context
== TYPENAME
)
9396 error ("non-object member `%s' cannot be declared `mutable'", name
);
9397 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9401 /* Warn if two storage classes are given. Default to `auto'. */
9403 if (RIDBIT_ANY_SET (specbits
))
9405 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9406 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9407 if (decl_context
== PARM
&& nclasses
> 0)
9408 error ("storage class specifiers invalid in parameter declarations");
9409 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9411 if (decl_context
== PARM
)
9412 error ("typedef declaration invalid in parameter declaration");
9415 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9416 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9419 /* Give error if `virtual' is used outside of class declaration. */
9421 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9423 error ("virtual outside class declaration");
9426 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9428 error ("only members can be declared mutable");
9429 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9432 /* Static anonymous unions are dealt with here. */
9433 if (staticp
&& decl_context
== TYPENAME
9434 && TREE_CODE (declspecs
) == TREE_LIST
9435 && ANON_UNION_TYPE_P (TREE_VALUE (declspecs
)))
9436 decl_context
= FIELD
;
9438 /* Give error if `const,' `volatile,' `inline,' `friend,' or `virtual'
9439 is used in a signature member function declaration. */
9440 if (decl_context
== FIELD
9441 && IS_SIGNATURE (current_class_type
)
9442 && RIDBIT_NOTSETP (RID_TYPEDEF
, specbits
))
9444 if (type_quals
!= TYPE_UNQUALIFIED
)
9446 error ("type qualifiers specified for signature member function `%s'", name
);
9447 type_quals
= TYPE_UNQUALIFIED
;
9451 error ("`inline' specified for signature member function `%s'", name
);
9452 /* Later, we'll make signature member functions inline. */
9457 error ("`friend' declaration in signature definition");
9462 error ("`virtual' specified for signature member function `%s'",
9464 /* Later, we'll make signature member functions virtual. */
9469 /* Warn about storage classes that are invalid for certain
9470 kinds of declarations (parameters, typenames, etc.). */
9473 error ("multiple storage classes in declaration of `%s'", name
);
9474 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9476 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9477 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9478 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9480 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9482 else if (decl_context
== FIELD
9483 && ! IS_SIGNATURE (current_class_type
)
9484 /* C++ allows static class elements */
9485 && RIDBIT_SETP (RID_STATIC
, specbits
))
9486 /* C++ also allows inlines and signed and unsigned elements,
9487 but in those cases we don't come in here. */
9491 if (decl_context
== FIELD
)
9493 tree tmp
= NULL_TREE
;
9494 register int op
= 0;
9498 /* Avoid trying to get an operand off an identifier node. */
9499 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9502 tmp
= TREE_OPERAND (declarator
, 0);
9503 op
= IDENTIFIER_OPNAME_P (tmp
);
9505 error ("storage class specified for %s `%s'",
9506 IS_SIGNATURE (current_class_type
)
9508 ? "signature member operator"
9509 : "signature member function")
9510 : (op
? "member operator" : "field"),
9511 op
? operator_name_string (tmp
) : name
);
9514 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9515 ? "storage class specified for parameter `%s'"
9516 : "storage class specified for typename"), name
);
9517 RIDBIT_RESET (RID_REGISTER
, specbits
);
9518 RIDBIT_RESET (RID_AUTO
, specbits
);
9519 RIDBIT_RESET (RID_EXTERN
, specbits
);
9521 if (decl_context
== FIELD
&& IS_SIGNATURE (current_class_type
))
9523 RIDBIT_RESET (RID_STATIC
, specbits
);
9528 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9530 if (toplevel_bindings_p ())
9532 /* It's common practice (and completely valid) to have a const
9533 be initialized and declared extern. */
9534 if (!(type_quals
& TYPE_QUAL_CONST
))
9535 warning ("`%s' initialized and declared `extern'", name
);
9538 error ("`%s' has both `extern' and initializer", name
);
9540 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9541 && ! toplevel_bindings_p ())
9542 error ("nested function `%s' declared `extern'", name
);
9543 else if (toplevel_bindings_p ())
9545 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9546 error ("top-level declaration of `%s' specifies `auto'", name
);
9549 if (nclasses
> 0 && friendp
)
9550 error ("storage class specifiers invalid in friend function declarations");
9552 /* Now figure out the structure of the declarator proper.
9553 Descend through it, creating more complex types, until we reach
9554 the declared identifier (or NULL_TREE, in an absolute declarator). */
9556 inner_attrs
= NULL_TREE
;
9559 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9560 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9562 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9563 an INDIRECT_REF (for *...),
9564 a CALL_EXPR (for ...(...)),
9565 an identifier (for the name being declared)
9566 or a null pointer (for the place in an absolute declarator
9567 where the name was omitted).
9568 For the last two cases, we have just exited the loop.
9570 For C++ it could also be
9571 a SCOPE_REF (for class :: ...). In this case, we have converted
9572 sensible names to types, and those are the values we use to
9573 qualify the member name.
9574 an ADDR_EXPR (for &...),
9575 a BIT_NOT_EXPR (for destructors)
9577 At this point, TYPE is the type of elements of an array,
9578 or for a function to return, or for a pointer to point to.
9579 After this sequence of ifs, TYPE is the type of the
9580 array or function or pointer, and DECLARATOR has had its
9581 outermost layer removed. */
9583 if (type
== error_mark_node
)
9585 if (TREE_CODE (declarator
) == SCOPE_REF
)
9586 declarator
= TREE_OPERAND (declarator
, 1);
9588 declarator
= TREE_OPERAND (declarator
, 0);
9591 if (quals
!= NULL_TREE
9592 && (declarator
== NULL_TREE
9593 || TREE_CODE (declarator
) != SCOPE_REF
))
9595 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9596 ctype
= TYPE_METHOD_BASETYPE (type
);
9597 if (ctype
!= NULL_TREE
)
9599 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9600 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9601 type
= TREE_TYPE (dummy
);
9606 /* See the comment for the TREE_LIST case, below. */
9609 else if (inner_attrs
)
9611 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9612 inner_attrs
= NULL_TREE
;
9615 switch (TREE_CODE (declarator
))
9619 /* We encode a declarator with embedded attributes using
9620 a TREE_LIST. The attributes apply to the declarator
9621 directly inside them, so we have to skip an iteration
9622 before applying them to the type. If the declarator just
9623 inside is the declarator-id, we apply the attrs to the
9625 inner_attrs
= TREE_PURPOSE (declarator
);
9627 declarator
= TREE_VALUE (declarator
);
9633 register tree itype
= NULL_TREE
;
9634 register tree size
= TREE_OPERAND (declarator
, 1);
9635 /* The index is a signed object `sizetype' bits wide. */
9636 tree index_type
= signed_type (sizetype
);
9638 declarator
= TREE_OPERAND (declarator
, 0);
9640 /* Check for some types that there cannot be arrays of. */
9642 if (TREE_CODE (type
) == VOID_TYPE
)
9644 cp_error ("declaration of `%D' as array of voids", dname
);
9645 type
= error_mark_node
;
9648 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9650 cp_error ("declaration of `%D' as array of functions", dname
);
9651 type
= error_mark_node
;
9654 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9655 you can't have arrays of references. If we allowed them,
9656 then we'd be saying x[i] is valid for an array x, but
9657 then you'd have to ask: what does `*(x + i)' mean? */
9658 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9660 if (decl_context
== TYPENAME
)
9661 cp_error ("cannot make arrays of references");
9663 cp_error ("declaration of `%D' as array of references",
9665 type
= error_mark_node
;
9668 if (TREE_CODE (type
) == OFFSET_TYPE
)
9670 cp_error ("declaration of `%D' as array of data members",
9672 type
= error_mark_node
;
9675 if (TREE_CODE (type
) == METHOD_TYPE
)
9677 cp_error ("declaration of `%D' as array of function members",
9679 type
= error_mark_node
;
9682 if (size
== error_mark_node
)
9683 type
= error_mark_node
;
9684 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9688 the constant expressions that specify the bounds of
9689 the arrays can be omitted only for the first member
9691 cp_error ("declaration of `%D' as multidimensional array",
9693 cp_error ("must have bounds for all dimensions except the first");
9694 type
= error_mark_node
;
9697 if (type
== error_mark_node
)
9702 /* Must suspend_momentary here because the index
9703 type may need to live until the end of the function.
9704 For example, it is used in the declaration of a
9705 variable which requires destructing at the end of
9706 the function; then build_vec_delete will need this
9708 int yes
= suspend_momentary ();
9709 /* Might be a cast. */
9710 if (TREE_CODE (size
) == NOP_EXPR
9711 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9712 size
= TREE_OPERAND (size
, 0);
9714 /* If this involves a template parameter, it'll be
9715 constant, but we don't know what the value is yet. */
9716 if (processing_template_decl
)
9718 /* Resolve a qualified reference to an enumerator or
9719 static const data member of ours. */
9720 if (TREE_CODE (size
) == SCOPE_REF
9721 && TREE_OPERAND (size
, 0) == current_class_type
)
9723 tree t
= lookup_field (current_class_type
,
9724 TREE_OPERAND (size
, 1), 0, 0);
9729 itype
= make_node (INTEGER_TYPE
);
9730 TYPE_MIN_VALUE (itype
) = size_zero_node
;
9731 TYPE_MAX_VALUE (itype
) = build_min
9732 (MINUS_EXPR
, sizetype
, size
, integer_one_node
);
9733 goto dont_grok_size
;
9736 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9737 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9738 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9740 cp_error ("size of array `%D' has non-integer type",
9742 size
= integer_one_node
;
9744 if (TREE_READONLY_DECL_P (size
))
9745 size
= decl_constant_value (size
);
9746 if (pedantic
&& integer_zerop (size
))
9747 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9748 if (TREE_CONSTANT (size
))
9750 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9751 int old_pedantic
= pedantic
;
9752 pedantic
= flag_pedantic_errors
= 1;
9753 /* Always give overflow errors on array subscripts. */
9754 constant_expression_warning (size
);
9755 pedantic
= old_pedantic
;
9756 flag_pedantic_errors
= old_flag_pedantic_errors
;
9757 if (INT_CST_LT (size
, integer_zero_node
))
9759 cp_error ("size of array `%D' is negative", dname
);
9760 size
= integer_one_node
;
9768 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9771 cp_pedwarn ("ANSI C++ forbids variable-size array");
9776 = fold (build_binary_op (MINUS_EXPR
,
9777 cp_convert (index_type
, size
),
9778 cp_convert (index_type
,
9779 integer_one_node
), 1));
9780 if (! TREE_CONSTANT (itype
))
9781 itype
= variable_size (itype
);
9782 else if (TREE_OVERFLOW (itype
))
9784 error ("overflow in array dimension");
9785 TREE_OVERFLOW (itype
) = 0;
9788 /* If we're a parm, we need to have a permanent type so
9789 mangling checks for re-use will work right. If both the
9790 element and index types are permanent, the array type
9792 if (decl_context
== PARM
9793 && allocation_temporary_p () && TREE_PERMANENT (type
))
9795 push_obstacks (&permanent_obstack
, &permanent_obstack
);
9796 itype
= build_index_type (itype
);
9800 itype
= build_index_type (itype
);
9803 resume_momentary (yes
);
9806 type
= build_cplus_array_type (type
, itype
);
9815 tree inner_parms
= TREE_OPERAND (declarator
, 1);
9816 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9818 /* Declaring a function type.
9819 Make sure we have a valid type for the function to return. */
9821 /* We now know that the TYPE_QUALS don't apply to the
9822 decl, but to its return type. */
9823 type_quals
= TYPE_UNQUALIFIED
;
9825 /* Warn about some types functions can't return. */
9827 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9829 error ("`%s' declared as function returning a function", name
);
9830 type
= integer_type_node
;
9832 if (TREE_CODE (type
) == ARRAY_TYPE
)
9834 error ("`%s' declared as function returning an array", name
);
9835 type
= integer_type_node
;
9838 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9839 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9841 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9844 /* Pick up type qualifiers which should be applied to `this'. */
9845 quals
= TREE_OPERAND (declarator
, 2);
9847 /* Pick up the exception specifications. */
9848 raises
= TREE_TYPE (declarator
);
9850 /* Say it's a definition only for the CALL_EXPR
9851 closest to the identifier. */
9854 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9855 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9856 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9858 if (ctype
== NULL_TREE
9859 && decl_context
== FIELD
9861 && (friendp
== 0 || dname
== current_class_name
))
9862 ctype
= current_class_type
;
9864 if (ctype
&& return_type
== return_conversion
)
9865 TYPE_HAS_CONVERSION (ctype
) = 1;
9866 if (ctype
&& constructor_name (ctype
) == dname
)
9868 /* We are within a class's scope. If our declarator name
9869 is the same as the class name, and we are defining
9870 a function, then it is a constructor/destructor, and
9871 therefore returns a void type. */
9873 if (flags
== DTOR_FLAG
)
9875 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9876 not be declared const or volatile. A destructor
9877 may not be static. */
9879 error ("destructor cannot be static member function");
9882 cp_error ("destructors may not be `%s'",
9883 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9886 if (decl_context
== FIELD
)
9888 if (! member_function_or_else (ctype
, current_class_type
,
9889 "destructor for alien class `%s' cannot be a member"))
9890 return void_type_node
;
9893 else /* It's a constructor. */
9897 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
9898 not be declared const or volatile. A constructor may
9899 not be virtual. A constructor may not be static. */
9901 error ("constructor cannot be static member function");
9904 pedwarn ("constructors cannot be declared virtual");
9909 cp_error ("constructors may not be `%s'",
9910 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9914 RID_BIT_TYPE tmp_bits
;
9915 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
9916 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
9917 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
9918 if (RIDBIT_ANY_SET (tmp_bits
))
9919 error ("return value type specifier for constructor ignored");
9921 type
= build_pointer_type (ctype
);
9922 if (decl_context
== FIELD
9923 && IS_SIGNATURE (current_class_type
))
9925 error ("constructor not allowed in signature");
9926 return void_type_node
;
9928 else if (decl_context
== FIELD
)
9930 if (! member_function_or_else (ctype
, current_class_type
,
9931 "constructor for alien class `%s' cannot be member"))
9932 return void_type_node
;
9933 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
9934 if (return_type
!= return_ctor
)
9938 if (decl_context
== FIELD
)
9944 error ("can't initialize friend function `%s'", name
);
9947 /* Cannot be both friend and virtual. */
9948 error ("virtual functions cannot be friends");
9949 RIDBIT_RESET (RID_FRIEND
, specbits
);
9952 if (decl_context
== NORMAL
)
9953 error ("friend declaration not in class definition");
9954 if (current_function_decl
&& funcdef_flag
)
9955 cp_error ("can't define friend function `%s' in a local class definition",
9959 /* Construct the function type and go to the next
9960 inner layer of declarator. */
9962 declarator
= TREE_OPERAND (declarator
, 0);
9964 /* FIXME: This is where default args should be fully
9967 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
9969 if (declarator
&& flags
== DTOR_FLAG
)
9971 /* A destructor declared in the body of a class will
9972 be represented as a BIT_NOT_EXPR. But, we just
9973 want the underlying IDENTIFIER. */
9974 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
9975 declarator
= TREE_OPERAND (declarator
, 0);
9977 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
9978 arg_types
= void_list_node
;
9979 else if (arg_types
== NULL_TREE
9980 || arg_types
!= void_list_node
)
9982 cp_error ("destructors may not have parameters");
9983 arg_types
= void_list_node
;
9984 last_function_parms
= NULL_TREE
;
9988 /* ANSI says that `const int foo ();'
9989 does not make the function foo const. */
9990 type
= build_function_type (type
, arg_types
);
9994 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
9995 if (TREE_PURPOSE (t
)
9996 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
9998 add_defarg_fn (type
);
10007 /* Filter out pointers-to-references and references-to-references.
10008 We can get these if a TYPE_DECL is used. */
10010 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10012 error ("cannot declare %s to references",
10013 TREE_CODE (declarator
) == ADDR_EXPR
10014 ? "references" : "pointers");
10015 declarator
= TREE_OPERAND (declarator
, 0);
10019 if (TREE_CODE (type
) == OFFSET_TYPE
10020 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10021 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10023 cp_error ("cannot declare pointer to `%#T' member",
10025 type
= TREE_TYPE (type
);
10028 /* Merge any constancy or volatility into the target type
10029 for the pointer. */
10031 /* We now know that the TYPE_QUALS don't apply to the decl,
10032 but to the target of the pointer. */
10033 type_quals
= TYPE_UNQUALIFIED
;
10035 if (IS_SIGNATURE (type
))
10037 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10039 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
10040 && TYPE_SIZE (type
))
10041 cp_warning ("empty signature `%T' used in signature reference declaration",
10044 type
= build_signature_reference_type (type
);
10046 sorry ("signature reference");
10052 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
10053 && TYPE_SIZE (type
))
10054 cp_warning ("empty signature `%T' used in signature pointer declaration",
10056 type
= build_signature_pointer_type (type
);
10059 else if (TREE_CODE (declarator
) == ADDR_EXPR
)
10061 if (TREE_CODE (type
) == VOID_TYPE
)
10062 error ("invalid type: `void &'");
10064 type
= build_reference_type (type
);
10066 else if (TREE_CODE (type
) == METHOD_TYPE
)
10068 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10071 type
= build_pointer_type (type
);
10073 /* Process a list of type modifier keywords (such as
10074 const or volatile) that were given inside the `*' or `&'. */
10076 if (TREE_TYPE (declarator
))
10078 register tree typemodlist
;
10084 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10085 typemodlist
= TREE_CHAIN (typemodlist
))
10087 tree qualifier
= TREE_VALUE (typemodlist
);
10089 if (qualifier
== ridpointers
[(int) RID_CONST
])
10091 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10093 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10098 error ("invalid type modifier within pointer declarator");
10102 pedwarn ("duplicate `const'");
10104 pedwarn ("duplicate `volatile'");
10106 pedwarn ("duplicate `restrict'");
10108 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10109 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10110 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10111 if (TREE_CODE (declarator
) == ADDR_EXPR
10112 && (constp
|| volatilep
))
10115 pedwarn ("discarding `const' applied to a reference");
10117 pedwarn ("discarding `volatile' applied to a reference");
10118 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10120 type
= cp_build_qualified_type (type
, type_quals
);
10122 declarator
= TREE_OPERAND (declarator
, 0);
10128 /* We have converted type names to NULL_TREE if the
10129 name was bogus, or to a _TYPE node, if not.
10131 The variable CTYPE holds the type we will ultimately
10132 resolve to. The code here just needs to build
10133 up appropriate member types. */
10134 tree sname
= TREE_OPERAND (declarator
, 1);
10137 /* Destructors can have their visibilities changed as well. */
10138 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10139 sname
= TREE_OPERAND (sname
, 0);
10141 if (TREE_COMPLEXITY (declarator
) == 0)
10142 /* This needs to be here, in case we are called
10143 multiple times. */ ;
10144 else if (TREE_COMPLEXITY (declarator
) == -1)
10145 /* Namespace member. */
10146 pop_decl_namespace ();
10147 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10148 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10149 else if (! IS_AGGR_TYPE_CODE
10150 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10152 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10154 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10155 that refer to ctype. They couldn't be resolved earlier
10156 because we hadn't pushed into the class yet.
10157 Example: resolve 'B<T>::type' in
10158 'B<typename B<T>::type> B<T>::f () { }'. */
10159 if (current_template_parms
10160 && uses_template_parms (type
)
10161 && uses_template_parms (current_class_type
))
10163 tree args
= current_template_args ();
10164 type
= tsubst (type
, args
, NULL_TREE
);
10167 /* This pop_nested_class corresponds to the
10168 push_nested_class used to push into class scope for
10169 parsing the argument list of a function decl, in
10171 pop_nested_class (1);
10172 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10175 my_friendly_abort (16);
10177 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10179 /* We had a reference to a global decl, or
10180 perhaps we were given a non-aggregate typedef,
10181 in which case we cleared this out, and should just
10182 keep going as though it wasn't there. */
10183 declarator
= sname
;
10186 ctype
= TREE_OPERAND (declarator
, 0);
10189 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10191 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10192 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10193 template_count
+= 1;
10194 t
= TYPE_MAIN_DECL (t
);
10195 if (DECL_LANG_SPECIFIC (t
))
10196 t
= DECL_CLASS_CONTEXT (t
);
10201 if (sname
== NULL_TREE
)
10204 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10206 /* This is the `standard' use of the scoping operator:
10207 basetype :: member . */
10209 if (ctype
== current_class_type
)
10215 Is this ill-formed? */
10218 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10221 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10223 if (current_class_type
== NULL_TREE
10225 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10226 TYPE_ARG_TYPES (type
));
10229 cp_error ("cannot declare member function `%T::%s' within `%T'",
10230 ctype
, name
, current_class_type
);
10231 return void_type_node
;
10234 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10235 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10237 /* Have to move this code elsewhere in this function.
10238 this code is used for i.e., typedef int A::M; M *pm;
10240 It is? How? jason 10/2/94 */
10242 if (current_class_type
)
10244 cp_error ("cannot declare member `%T::%s' within `%T'",
10245 ctype
, name
, current_class_type
);
10246 return void_type_node
;
10248 type
= build_offset_type (ctype
, type
);
10250 else if (uses_template_parms (ctype
))
10252 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10254 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10255 TYPE_ARG_TYPES (type
));
10259 cp_error ("structure `%T' not yet defined", ctype
);
10260 return error_mark_node
;
10263 declarator
= sname
;
10265 else if (TREE_CODE (sname
) == SCOPE_REF
)
10266 my_friendly_abort (17);
10270 declarator
= TREE_OPERAND (declarator
, 1);
10271 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10272 /* In this case, we will deal with it later. */
10276 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10277 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10278 TYPE_ARG_TYPES (type
));
10280 type
= build_offset_type (ctype
, type
);
10287 declarator
= TREE_OPERAND (declarator
, 0);
10292 case ENUMERAL_TYPE
:
10293 declarator
= NULL_TREE
;
10297 declarator
= NULL_TREE
;
10301 my_friendly_abort (158);
10305 /* See the comment for the TREE_LIST case, above. */
10308 if (! ignore_attrs
)
10309 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10311 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10313 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10316 if (explicitp
== 1)
10318 error ("only constructors can be declared `explicit'");
10322 /* Now TYPE has the actual type. */
10324 /* If this is declaring a typedef name, return a TYPE_DECL. */
10326 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10328 if (type_quals
& TYPE_QUAL_CONST
)
10330 error ("const `%s' cannot be declared `mutable'", name
);
10331 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10335 error ("static `%s' cannot be declared `mutable'", name
);
10336 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10340 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10344 /* Note that the grammar rejects storage classes
10345 in typenames, fields or parameters. */
10346 if (current_lang_name
== lang_name_java
)
10347 TYPE_FOR_JAVA (type
) = 1;
10349 if (decl_context
== FIELD
)
10351 if (declarator
== constructor_name (current_class_type
))
10352 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10354 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10355 if (IS_SIGNATURE (current_class_type
) && opaque_typedef
)
10356 SIGNATURE_HAS_OPAQUE_TYPEDECLS (current_class_type
) = 1;
10360 /* Make sure this typedef lives as long as its type,
10361 since it might be used as a template parameter. */
10362 if (type
!= error_mark_node
)
10363 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10364 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10365 if (type
!= error_mark_node
)
10369 /* If the user declares "struct {...} foo" then `foo' will have
10370 an anonymous name. Fill that name in now. Nothing can
10371 refer to it, so nothing needs know about the name change.
10372 The TYPE_NAME field was filled in by build_struct_xref. */
10373 if (type
!= error_mark_node
10374 && TYPE_NAME (type
)
10375 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10376 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
)))
10378 /* FIXME: This is bogus; we should not be doing this for
10379 cv-qualified types. */
10381 /* For anonymous structs that are cv-qualified, need to use
10382 TYPE_MAIN_VARIANT so that name will mangle correctly. As
10383 type not referenced after this block, don't bother
10384 resetting type to original type, ie. TREE_TYPE (decl). */
10385 type
= TYPE_MAIN_VARIANT (type
);
10387 /* Replace the anonymous name with the real name everywhere. */
10388 lookup_tag_reverse (type
, declarator
);
10389 TYPE_NAME (type
) = decl
;
10391 if (TYPE_LANG_SPECIFIC (type
))
10392 TYPE_WAS_ANONYMOUS (type
) = 1;
10394 /* XXX Temporarily set the scope.
10395 When returning, start_decl expects it as NULL_TREE,
10396 and will then then set it using pushdecl. */
10397 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10398 if (current_class_type
)
10399 DECL_CONTEXT (decl
) = current_class_type
;
10401 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10403 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10404 DECL_ASSEMBLER_NAME (decl
)
10405 = get_identifier (build_overload_name (type
, 1, 1));
10406 DECL_CONTEXT (decl
) = NULL_TREE
;
10408 /* FIXME remangle member functions; member functions of a
10409 type with external linkage have external linkage. */
10412 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10414 cp_error_at ("typedef name may not be class-qualified", decl
);
10419 if (ctype
== NULL_TREE
)
10421 if (TREE_CODE (type
) != METHOD_TYPE
)
10422 cp_error_at ("invalid type qualifier for non-method type", decl
);
10424 ctype
= TYPE_METHOD_BASETYPE (type
);
10426 if (ctype
!= NULL_TREE
)
10427 grok_method_quals (ctype
, decl
, quals
);
10430 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10431 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10432 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10434 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10435 error ("non-object member `%s' cannot be declared mutable", name
);
10437 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10438 inlinep
, friendp
, raises
!= NULL_TREE
);
10441 error ("typedef declaration includes an initializer");
10446 /* Detect the case of an array type of unspecified size
10447 which came, as such, direct from a typedef name.
10448 We must copy the type, so that each identifier gets
10449 a distinct type, so that each identifier's size can be
10450 controlled separately by its own initializer. */
10452 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10453 && TYPE_DOMAIN (type
) == NULL_TREE
)
10455 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10458 /* If this is a type name (such as, in a cast or sizeof),
10459 compute the type and return it now. */
10461 if (decl_context
== TYPENAME
)
10463 /* Note that the grammar rejects storage classes
10464 in typenames, fields or parameters. */
10465 if (type_quals
!= TYPE_UNQUALIFIED
)
10467 if (IS_SIGNATURE (type
))
10468 error ("type qualifiers specified for signature type");
10469 type_quals
= TYPE_UNQUALIFIED
;
10472 /* Special case: "friend class foo" looks like a TYPENAME context. */
10475 if (type_quals
!= TYPE_UNQUALIFIED
)
10477 cp_error ("type qualifiers specified for friend class declaration");
10478 type_quals
= TYPE_UNQUALIFIED
;
10482 cp_error ("`inline' specified for friend class declaration");
10486 /* Only try to do this stuff if we didn't already give up. */
10487 if (type
!= integer_type_node
)
10489 /* A friendly class? */
10490 if (current_class_type
)
10491 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10493 error ("trying to make class `%s' a friend of global scope",
10494 TYPE_NAME_STRING (type
));
10495 type
= void_type_node
;
10500 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10501 if (ctype
== NULL_TREE
)
10503 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10504 ctype
= TYPE_METHOD_BASETYPE (type
);
10506 grok_method_quals (ctype
, dummy
, quals
);
10507 type
= TREE_TYPE (dummy
);
10512 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10513 && decl_context
!= CATCHPARM
10514 && TREE_CODE (type
) != UNION_TYPE
10517 cp_error ("abstract declarator `%T' used as declaration", type
);
10518 declarator
= make_anon_name ();
10521 /* `void' at top level (not within pointer)
10522 is allowed only in typedefs or type names.
10523 We don't complain about parms either, but that is because
10524 a better error message can be made later. */
10526 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10529 error ("unnamed variable or field declared void");
10530 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10532 if (IDENTIFIER_OPNAME_P (declarator
))
10533 my_friendly_abort (356);
10535 error ("variable or field `%s' declared void", name
);
10538 error ("variable or field declared void");
10539 type
= integer_type_node
;
10542 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10543 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10545 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10547 if (ctype
|| in_namespace
)
10548 error ("cannot use `::' in parameter declaration");
10550 /* A parameter declared as an array of T is really a pointer to T.
10551 One declared as a function is really a pointer to a function.
10552 One declared as a member is really a pointer to member. */
10554 if (TREE_CODE (type
) == ARRAY_TYPE
)
10556 /* Transfer const-ness of array into that of type pointed to. */
10557 type
= build_pointer_type (TREE_TYPE (type
));
10558 type_quals
= TYPE_UNQUALIFIED
;
10560 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10561 type
= build_pointer_type (type
);
10562 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10563 type
= build_pointer_type (type
);
10564 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10566 error ("declaration of `%s' as void", name
);
10572 register tree decl
;
10574 if (decl_context
== PARM
)
10576 decl
= build_decl (PARM_DECL
, declarator
, type
);
10578 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10579 inlinep
, friendp
, raises
!= NULL_TREE
);
10580 if (current_class_type
10581 && IS_SIGNATURE (current_class_type
))
10584 error ("parameter of signature member function declared `inline'");
10585 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10586 error ("parameter of signature member function declared `auto'");
10587 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10588 error ("parameter of signature member function declared `register'");
10591 /* Compute the type actually passed in the parmlist,
10592 for the case where there is no prototype.
10593 (For example, shorts and chars are passed as ints.)
10594 When there is a prototype, this is overridden later. */
10596 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10598 else if (decl_context
== FIELD
)
10600 if (type
== error_mark_node
)
10602 /* Happens when declaring arrays of sizes which
10603 are error_mark_node, for example. */
10606 else if (in_namespace
&& !friendp
)
10608 /* Something like struct S { int N::j; }; */
10609 cp_error ("invalid use of `::'");
10612 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10615 tree function_context
;
10617 /* We catch the others as conflicts with the builtin
10619 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10621 cp_error ("function `%D' cannot be declared friend",
10628 if (ctype
== NULL_TREE
)
10629 ctype
= current_class_type
;
10631 if (ctype
== NULL_TREE
)
10633 cp_error ("can't make `%D' into a method -- not in a class",
10635 return void_type_node
;
10638 /* ``A union may [ ... ] not [ have ] virtual functions.''
10640 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10642 cp_error ("function `%D' declared virtual inside a union",
10644 return void_type_node
;
10647 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10648 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10649 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10650 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10654 cp_error ("`%D' cannot be declared virtual, since it is always static",
10659 else if (staticp
< 2)
10660 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10661 TYPE_ARG_TYPES (type
));
10664 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10665 function_context
= (ctype
!= NULL_TREE
) ?
10666 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10667 publicp
= (! friendp
|| ! staticp
)
10668 && function_context
== NULL_TREE
;
10669 decl
= grokfndecl (ctype
, type
,
10670 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10671 ? declarator
: dname
,
10673 virtualp
, flags
, quals
, raises
, attrlist
,
10674 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10675 funcdef_flag
, template_count
, in_namespace
);
10676 if (decl
== NULL_TREE
|| decl
== error_mark_node
)
10679 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10680 /* The decl and setting of decl_machine_attr is also turned off. */
10681 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10684 /* [class.conv.ctor]
10686 A constructor declared without the function-specifier
10687 explicit that can be called with a single parameter
10688 specifies a conversion from the type of its first
10689 parameter to the type of its class. Such a constructor
10690 is called a converting constructor. */
10691 if (explicitp
== 2)
10692 DECL_NONCONVERTING_P (decl
) = 1;
10693 else if (DECL_CONSTRUCTOR_P (decl
))
10695 /* The constructor can be called with exactly one
10696 parameter if there is at least one parameter, and
10697 any subsequent parameters have default arguments.
10698 We don't look at the first parameter, which is
10699 really just the `this' parameter for the new
10702 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10704 /* Skip the `in_chrg' argument too, if present. */
10705 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10706 arg_types
= TREE_CHAIN (arg_types
);
10708 if (arg_types
== void_list_node
10710 && TREE_CHAIN (arg_types
)
10711 && TREE_CHAIN (arg_types
) != void_list_node
10712 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10713 DECL_NONCONVERTING_P (decl
) = 1;
10716 else if (TREE_CODE (type
) == METHOD_TYPE
)
10718 /* We only get here for friend declarations of
10719 members of other classes. */
10720 /* All method decls are public, so tell grokfndecl to set
10721 TREE_PUBLIC, also. */
10722 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10723 virtualp
, flags
, quals
, raises
, attrlist
,
10724 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10725 template_count
, in_namespace
);
10726 if (decl
== NULL_TREE
)
10729 else if (!staticp
&& ! processing_template_decl
10730 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10731 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10734 cp_error ("field `%D' has incomplete type", declarator
);
10736 cp_error ("name `%T' has incomplete type", type
);
10738 /* If we're instantiating a template, tell them which
10739 instantiation made the field's type be incomplete. */
10740 if (current_class_type
10741 && TYPE_NAME (current_class_type
)
10742 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10743 && declspecs
&& TREE_VALUE (declspecs
)
10744 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10745 cp_error (" in instantiation of template `%T'",
10746 current_class_type
);
10748 type
= error_mark_node
;
10755 error ("`%s' is neither function nor method; cannot be declared friend",
10756 IDENTIFIER_POINTER (declarator
));
10764 /* Friends are treated specially. */
10765 if (ctype
== current_class_type
)
10766 warning ("member functions are implicitly friends of their class");
10769 tree t
= NULL_TREE
;
10770 if (decl
&& DECL_NAME (decl
))
10772 if (template_class_depth (current_class_type
) == 0)
10775 = check_explicit_specialization
10777 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10778 if (decl
== error_mark_node
)
10779 return error_mark_node
;
10782 t
= do_friend (ctype
, declarator
, decl
,
10783 last_function_parms
, flags
, quals
,
10786 if (t
&& funcdef_flag
)
10789 return void_type_node
;
10793 /* Structure field. It may not be a function, except for C++ */
10795 if (decl
== NULL_TREE
)
10801 /* An attempt is being made to initialize a non-static
10802 member. But, from [class.mem]:
10804 4 A member-declarator can contain a
10805 constant-initializer only if it declares a static
10806 member (_class.static_) of integral or enumeration
10807 type, see _class.static.data_.
10809 This used to be relatively common practice, but
10810 the rest of the compiler does not correctly
10811 handle the initialization unless the member is
10812 static so we make it static below. */
10813 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10815 cp_pedwarn ("making `%D' static", declarator
);
10819 if (uses_template_parms (type
))
10820 /* We'll check at instantiation time. */
10822 else if (check_static_variable_definition (declarator
,
10824 /* If we just return the declaration, crashes
10825 will sometimes occur. We therefore return
10826 void_type_node, as if this was a friend
10827 declaration, to cause callers to completely
10828 ignore this declaration. */
10829 return void_type_node
;
10832 /* 9.2p13 [class.mem] */
10833 if (declarator
== constructor_name (current_class_type
))
10834 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10839 /* C++ allows static class members.
10840 All other work for this is done by grokfield.
10841 This VAR_DCL is built by build_lang_field_decl.
10842 All other VAR_DECLs are built by build_decl. */
10843 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
10844 TREE_STATIC (decl
) = 1;
10845 /* In class context, 'static' means public access. */
10846 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10850 decl
= build_lang_field_decl (FIELD_DECL
, declarator
, type
);
10851 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10853 DECL_MUTABLE_P (decl
) = 1;
10854 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10858 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10859 inlinep
, friendp
, raises
!= NULL_TREE
);
10862 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10864 tree original_name
;
10870 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10871 original_name
= dname
;
10873 original_name
= declarator
;
10875 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10876 error ("storage class `auto' invalid for function `%s'", name
);
10877 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10878 error ("storage class `register' invalid for function `%s'", name
);
10880 /* Function declaration not at top level.
10881 Storage classes other than `extern' are not allowed
10882 and `extern' makes no difference. */
10883 if (! toplevel_bindings_p ()
10884 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10885 || RIDBIT_SETP (RID_INLINE
, specbits
))
10888 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10889 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10891 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10894 if (ctype
== NULL_TREE
)
10898 error ("virtual non-class function `%s'", name
);
10902 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
10903 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10904 TYPE_ARG_TYPES (type
));
10906 /* Record presence of `static'. */
10907 publicp
= (ctype
!= NULL_TREE
10908 || RIDBIT_SETP (RID_EXTERN
, specbits
)
10909 || !RIDBIT_SETP (RID_STATIC
, specbits
));
10911 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
10912 virtualp
, flags
, quals
, raises
, attrlist
,
10914 publicp
, inlinep
, funcdef_flag
,
10915 template_count
, in_namespace
);
10916 if (decl
== NULL_TREE
)
10919 /* Among other times, could occur from check_explicit_specialization
10920 returning an error_mark_node. */
10921 if (decl
== error_mark_node
)
10922 return error_mark_node
;
10926 int illegal_static
= 0;
10928 /* Don't allow a static member function in a class, and forbid
10929 declaring main to be static. */
10930 if (TREE_CODE (type
) == METHOD_TYPE
)
10932 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
10933 illegal_static
= 1;
10935 else if (current_function_decl
)
10937 /* FIXME need arm citation */
10938 error ("cannot declare static function inside another function");
10939 illegal_static
= 1;
10942 if (illegal_static
)
10945 RIDBIT_RESET (RID_STATIC
, specbits
);
10951 /* It's a variable. */
10953 /* An uninitialized decl with `extern' is a reference. */
10954 decl
= grokvardecl (type
, declarator
, &specbits
,
10956 (type_quals
& TYPE_QUAL_CONST
) != 0,
10958 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
10959 inlinep
, friendp
, raises
!= NULL_TREE
);
10963 DECL_CONTEXT (decl
) = ctype
;
10966 cp_pedwarn ("static member `%D' re-declared as static", decl
);
10968 RIDBIT_RESET (RID_STATIC
, specbits
);
10970 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
10972 cp_error ("static member `%D' declared `register'", decl
);
10973 RIDBIT_RESET (RID_REGISTER
, specbits
);
10975 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
10977 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
10979 RIDBIT_RESET (RID_EXTERN
, specbits
);
10984 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10986 error ("`%s' cannot be declared mutable", name
);
10989 /* Record `register' declaration for warnings on &
10990 and in case doing stupid register allocation. */
10992 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10993 DECL_REGISTER (decl
) = 1;
10995 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
10996 DECL_THIS_EXTERN (decl
) = 1;
10998 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10999 DECL_THIS_STATIC (decl
) = 1;
11001 /* Record constancy and volatility. */
11002 /* FIXME: Disallow `restrict' pointer-to-member declarations. */
11003 c_apply_type_quals_to_decl (type_quals
, decl
);
11009 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11010 An empty exprlist is a parmlist. An exprlist which
11011 contains only identifiers at the global level
11012 is a parmlist. Otherwise, it is an exprlist. */
11015 parmlist_is_exprlist (exprs
)
11018 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11021 if (toplevel_bindings_p ())
11023 /* At the global level, if these are all identifiers,
11024 then it is a parmlist. */
11027 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11029 exprs
= TREE_CHAIN (exprs
);
11036 /* Subroutine of `grokparms'. In a fcn definition, arg types must
11039 C++: also subroutine of `start_function'. */
11042 require_complete_types_for_parms (parms
)
11045 if (processing_template_decl
)
11050 tree type
= TREE_TYPE (parms
);
11051 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11053 if (DECL_NAME (parms
))
11054 error ("parameter `%s' has incomplete type",
11055 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11057 error ("parameter has incomplete type");
11058 TREE_TYPE (parms
) = error_mark_node
;
11061 layout_decl (parms
, 0);
11063 /* If the arg types are incomplete in a declaration,
11064 they must include undefined tags.
11065 These tags can never be defined in the scope of the declaration,
11066 so the types can never be completed,
11067 and no call can be compiled successfully. */
11068 /* This is not the right behavior for C++, but not having
11069 it is also probably wrong. */
11072 /* Now warn if is a pointer to an incomplete type. */
11073 while (TREE_CODE (type
) == POINTER_TYPE
11074 || TREE_CODE (type
) == REFERENCE_TYPE
)
11075 type
= TREE_TYPE (type
);
11076 type
= TYPE_MAIN_VARIANT (type
);
11077 if (TYPE_SIZE (type
) == NULL_TREE
)
11079 if (DECL_NAME (parm
) != NULL_TREE
)
11080 warning ("parameter `%s' points to incomplete type",
11081 IDENTIFIER_POINTER (DECL_NAME (parm
)));
11083 warning ("parameter points to incomplete type");
11087 parms
= TREE_CHAIN (parms
);
11091 /* Decode the list of parameter types for a function type.
11092 Given the list of things declared inside the parens,
11093 return a list of types.
11095 The list we receive can have three kinds of elements:
11096 an IDENTIFIER_NODE for names given without types,
11097 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11098 or void_type_node, to mark the end of an argument list
11099 when additional arguments are not permitted (... was not used).
11101 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11102 a mere declaration. A nonempty identifier-list gets an error message
11103 when FUNCDEF_FLAG is zero.
11104 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11105 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11107 If all elements of the input list contain types,
11108 we return a list of the types.
11109 If all elements contain no type (except perhaps a void_type_node
11110 at the end), we return a null list.
11111 If some have types and some do not, it is an error, and we
11112 return a null list.
11114 Also set last_function_parms to either
11115 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11116 A list of names is converted to a chain of PARM_DECLs
11117 by store_parm_decls so that ultimately it is always a chain of decls.
11119 Note that in C++, parameters can take default values. These default
11120 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11121 an error to specify default values which are followed by parameters
11122 that have no default values, or an ELLIPSES. For simplicities sake,
11123 only parameters which are specified with their types can take on
11127 grokparms (first_parm
, funcdef_flag
)
11131 tree result
= NULL_TREE
;
11132 tree decls
= NULL_TREE
;
11134 if (first_parm
!= NULL_TREE
11135 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11137 if (! funcdef_flag
)
11138 pedwarn ("parameter names (without types) in function declaration");
11139 last_function_parms
= first_parm
;
11142 else if (first_parm
!= NULL_TREE
11143 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11144 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11145 my_friendly_abort (145);
11148 /* Types were specified. This is a list of declarators
11149 each represented as a TREE_LIST node. */
11150 register tree parm
, chain
;
11151 int any_init
= 0, any_error
= 0;
11153 if (first_parm
!= NULL_TREE
)
11155 tree last_result
= NULL_TREE
;
11156 tree last_decl
= NULL_TREE
;
11158 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11160 tree type
= NULL_TREE
, list_node
= parm
;
11161 register tree decl
= TREE_VALUE (parm
);
11162 tree init
= TREE_PURPOSE (parm
);
11164 chain
= TREE_CHAIN (parm
);
11165 /* @@ weak defense against parse errors. */
11166 if (TREE_CODE (decl
) != VOID_TYPE
11167 && TREE_CODE (decl
) != TREE_LIST
)
11169 /* Give various messages as the need arises. */
11170 if (TREE_CODE (decl
) == STRING_CST
)
11171 cp_error ("invalid string constant `%E'", decl
);
11172 else if (TREE_CODE (decl
) == INTEGER_CST
)
11173 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11177 if (TREE_CODE (decl
) != VOID_TYPE
)
11179 decl
= grokdeclarator (TREE_VALUE (decl
),
11180 TREE_PURPOSE (decl
),
11181 PARM
, init
!= NULL_TREE
,
11183 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11186 /* Top-level qualifiers on the parameters are
11187 ignored for function types. */
11188 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11190 if (TREE_CODE (type
) == VOID_TYPE
)
11191 decl
= void_type_node
;
11192 else if (TREE_CODE (type
) == METHOD_TYPE
)
11194 if (DECL_NAME (decl
))
11195 /* Cannot use the decl here because
11196 we don't have DECL_CONTEXT set up yet. */
11197 cp_error ("parameter `%D' invalidly declared method type",
11200 error ("parameter invalidly declared method type");
11201 type
= build_pointer_type (type
);
11202 TREE_TYPE (decl
) = type
;
11204 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11206 if (DECL_NAME (decl
))
11207 cp_error ("parameter `%D' invalidly declared offset type",
11210 error ("parameter invalidly declared offset type");
11211 type
= build_pointer_type (type
);
11212 TREE_TYPE (decl
) = type
;
11214 else if (TREE_CODE (type
) == RECORD_TYPE
11215 && TYPE_LANG_SPECIFIC (type
)
11216 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
11218 abstract_virtuals_error (decl
, type
);
11219 any_error
= 1; /* Seems like a good idea. */
11221 else if (TREE_CODE (type
) == RECORD_TYPE
11222 && TYPE_LANG_SPECIFIC (type
)
11223 && IS_SIGNATURE (type
))
11225 signature_error (decl
, type
);
11226 any_error
= 1; /* Seems like a good idea. */
11228 else if (POINTER_TYPE_P (type
))
11231 while (POINTER_TYPE_P (t
)
11232 || (TREE_CODE (t
) == ARRAY_TYPE
11233 && TYPE_DOMAIN (t
) != NULL_TREE
))
11235 if (TREE_CODE (t
) == ARRAY_TYPE
)
11236 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11238 TYPE_PTR_P (type
) ? "pointer" : "reference");
11242 if (TREE_CODE (decl
) == VOID_TYPE
)
11244 if (result
== NULL_TREE
)
11246 result
= void_list_node
;
11247 last_result
= result
;
11251 TREE_CHAIN (last_result
) = void_list_node
;
11252 last_result
= void_list_node
;
11255 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11256 error ("`void' in parameter list must be entire list");
11260 /* Since there is a prototype, args are passed in their own types. */
11261 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11262 #ifdef PROMOTE_PROTOTYPES
11263 if ((TREE_CODE (type
) == INTEGER_TYPE
11264 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11265 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11266 DECL_ARG_TYPE (decl
) = integer_type_node
;
11273 if (TREE_CODE (init
) == SAVE_EXPR
)
11274 PARM_DECL_EXPR (init
) = 1;
11275 else if (processing_template_decl
)
11277 /* Unparsed default arg from in-class decl. */
11278 else if (TREE_CODE (init
) == DEFAULT_ARG
)
11280 else if (TREE_CODE (init
) == VAR_DECL
11281 || TREE_CODE (init
) == PARM_DECL
)
11283 if (IDENTIFIER_LOCAL_VALUE (DECL_NAME (init
)))
11285 /* ``Local variables may not be used in default
11286 argument expressions.'' dpANSI C++ 8.2.6 */
11287 /* If extern int i; within a function is not
11288 considered a local variable, then this code is
11290 cp_error ("local variable `%D' may not be used as a default argument", init
);
11293 else if (TREE_READONLY_DECL_P (init
))
11294 init
= decl_constant_value (init
);
11296 else if (TREE_TYPE (init
) == NULL_TREE
)
11298 error ("argument list may not have an initializer list");
11299 init
= error_mark_node
;
11302 if (! processing_template_decl
11303 && init
!= error_mark_node
11304 && TREE_CODE (init
) != DEFAULT_ARG
11305 && ! can_convert_arg (type
, TREE_TYPE (init
), init
))
11306 cp_pedwarn ("invalid type `%T' for default argument to `%#D'",
11307 TREE_TYPE (init
), decl
);
11313 if (decls
== NULL_TREE
)
11320 TREE_CHAIN (last_decl
) = decl
;
11323 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11325 TREE_PURPOSE (list_node
) = init
;
11326 TREE_VALUE (list_node
) = type
;
11327 TREE_CHAIN (list_node
) = NULL_TREE
;
11330 list_node
= saveable_tree_cons (init
, type
, NULL_TREE
);
11331 if (result
== NULL_TREE
)
11333 result
= list_node
;
11334 last_result
= result
;
11338 TREE_CHAIN (last_result
) = list_node
;
11339 last_result
= list_node
;
11343 TREE_CHAIN (last_result
) = NULL_TREE
;
11344 /* If there are no parameters, and the function does not end
11345 with `...', then last_decl will be NULL_TREE. */
11346 if (last_decl
!= NULL_TREE
)
11347 TREE_CHAIN (last_decl
) = NULL_TREE
;
11351 last_function_parms
= decls
;
11353 /* In a fcn definition, arg types must be complete. */
11354 if (funcdef_flag
> 0)
11355 require_complete_types_for_parms (last_function_parms
);
11360 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11361 FUNCTION_TYPE with the newly parsed version of its default argument, which
11362 was previously digested as text. See snarf_defarg et al in lex.c. */
11365 replace_defarg (arg
, init
)
11368 if (! processing_template_decl
11369 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11370 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11371 TREE_TYPE (init
), TREE_VALUE (arg
));
11372 TREE_PURPOSE (arg
) = init
;
11379 tree t
= FUNCTION_ARG_CHAIN (d
);
11380 if (DECL_CONSTRUCTOR_P (d
)
11381 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11382 t
= TREE_CHAIN (t
);
11383 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11384 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11385 == DECL_CLASS_CONTEXT (d
))
11386 && (TREE_CHAIN (t
) == NULL_TREE
11387 || TREE_CHAIN (t
) == void_list_node
11388 || TREE_PURPOSE (TREE_CHAIN (t
))))
11393 /* These memoizing functions keep track of special properties which
11394 a class may have. `grok_ctor_properties' notices whether a class
11395 has a constructor of the form X(X&), and also complains
11396 if the class has a constructor of the form X(X).
11397 `grok_op_properties' takes notice of the various forms of
11398 operator= which are defined, as well as what sorts of type conversion
11399 may apply. Both functions take a FUNCTION_DECL as an argument. */
11402 grok_ctor_properties (ctype
, decl
)
11405 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11406 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11408 /* When a type has virtual baseclasses, a magical first int argument is
11409 added to any ctor so we can tell if the class has been initialized
11410 yet. This could screw things up in this function, so we deliberately
11411 ignore the leading int if we're in that situation. */
11412 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11414 my_friendly_assert (parmtypes
11415 && TREE_VALUE (parmtypes
) == integer_type_node
,
11417 parmtypes
= TREE_CHAIN (parmtypes
);
11418 parmtype
= TREE_VALUE (parmtypes
);
11421 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11422 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11423 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11424 || TREE_CHAIN (parmtypes
) == void_list_node
11425 || TREE_PURPOSE (TREE_CHAIN (parmtypes
))))
11427 TYPE_HAS_INIT_REF (ctype
) = 1;
11428 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11429 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11431 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11432 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11433 || TREE_CHAIN (parmtypes
) == void_list_node
11434 || TREE_PURPOSE (TREE_CHAIN (parmtypes
))))
11436 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11438 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11441 else if (TREE_CODE (parmtype
) == VOID_TYPE
11442 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11443 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11448 /* An operator with this name can be either unary or binary. */
11454 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11455 || name
== ansi_opname
[(int) ADDR_EXPR
]
11456 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11457 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11458 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11459 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11462 /* An operator with this name can only be unary. */
11468 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11469 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11470 || name
== ansi_opname
[(int) COMPONENT_REF
]
11471 || OPERATOR_TYPENAME_P (name
));
11474 /* Do a little sanity-checking on how they declared their operator. */
11477 grok_op_properties (decl
, virtualp
, friendp
)
11479 int virtualp
, friendp
;
11481 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11482 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11483 tree name
= DECL_NAME (decl
);
11485 if (current_class_type
== NULL_TREE
)
11490 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11491 TYPE_HAS_ASSIGNMENT (current_class_type
) = 1;
11492 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11493 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11494 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11495 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11496 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11497 || name
== ansi_opname
[(int) MEMBER_REF
])
11498 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11499 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11500 TYPE_GETS_NEW (current_class_type
) |= 1;
11501 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11502 TYPE_GETS_DELETE (current_class_type
) |= 1;
11503 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11504 TYPE_GETS_NEW (current_class_type
) |= 2;
11505 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11506 TYPE_GETS_DELETE (current_class_type
) |= 2;
11509 if (name
== ansi_opname
[(int) NEW_EXPR
]
11510 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11512 /* When the compiler encounters the definition of A::operator new, it
11513 doesn't look at the class declaration to find out if it's static. */
11515 revert_static_member_fn (&decl
, NULL
, NULL
);
11517 /* Take care of function decl if we had syntax errors. */
11518 if (argtypes
== NULL_TREE
)
11520 = build_function_type (ptr_type_node
,
11521 hash_tree_chain (integer_type_node
,
11524 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11526 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11527 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11530 revert_static_member_fn (&decl
, NULL
, NULL
);
11532 if (argtypes
== NULL_TREE
)
11534 = build_function_type (void_type_node
,
11535 hash_tree_chain (ptr_type_node
,
11539 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11541 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11542 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11543 != void_list_node
))
11544 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11549 /* An operator function must either be a non-static member function
11550 or have at least one parameter of a class, a reference to a class,
11551 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11552 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11554 if (OPERATOR_TYPENAME_P (name
)
11555 || name
== ansi_opname
[(int) CALL_EXPR
]
11556 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11557 || name
== ansi_opname
[(int) COMPONENT_REF
]
11558 || name
== ansi_opname
[(int) ARRAY_REF
])
11559 cp_error ("`%D' must be a nonstatic member function", decl
);
11564 if (DECL_STATIC_FUNCTION_P (decl
))
11565 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11568 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11570 tree arg
= TREE_VALUE (p
);
11571 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11572 arg
= TREE_TYPE (arg
);
11574 /* This lets bad template code slip through. */
11575 if (IS_AGGR_TYPE (arg
)
11576 || TREE_CODE (arg
) == ENUMERAL_TYPE
11577 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11578 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11582 ("`%D' must have an argument of class or enumerated type",
11589 if (name
== ansi_opname
[(int) CALL_EXPR
])
11590 return; /* No restrictions on args. */
11592 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11594 tree t
= TREE_TYPE (name
);
11595 if (TREE_CODE (t
) == VOID_TYPE
)
11596 pedwarn ("void is not a valid type conversion operator");
11597 else if (! friendp
)
11599 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11602 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11604 if (t
== current_class_type
)
11605 what
= "the same type";
11606 /* Don't force t to be complete here. */
11607 else if (IS_AGGR_TYPE (t
)
11609 && DERIVED_FROM_P (t
, current_class_type
))
11610 what
= "a base class";
11613 warning ("conversion to %s%s will never use a type conversion operator",
11614 ref
? "a reference to " : "", what
);
11618 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11622 if (list_length (argtypes
) != 3 && methodp
)
11624 cp_error ("`%D' must take exactly one argument", decl
);
11627 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11629 if (copy_assignment_arg_p (parmtype
, virtualp
)
11632 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11633 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11634 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11635 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11638 else if (name
== ansi_opname
[(int) COND_EXPR
])
11641 pedwarn ("ANSI C++ prohibits overloading operator ?:");
11642 if (list_length (argtypes
) != 4)
11643 cp_error ("`%D' must take exactly three arguments", decl
);
11645 else if (ambi_op_p (name
))
11647 if (list_length (argtypes
) == 2)
11649 else if (list_length (argtypes
) == 3)
11651 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11652 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11653 && ! processing_template_decl
11654 && TREE_VALUE (TREE_CHAIN (argtypes
)) != integer_type_node
)
11657 cp_error ("postfix `%D' must take `int' as its argument",
11661 ("postfix `%D' must take `int' as its second argument",
11668 cp_error ("`%D' must take either zero or one argument", decl
);
11670 cp_error ("`%D' must take either one or two arguments", decl
);
11673 /* More Effective C++ rule 6. */
11675 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11676 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11678 tree arg
= TREE_VALUE (argtypes
);
11679 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11680 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11681 arg
= TREE_TYPE (arg
);
11682 arg
= TYPE_MAIN_VARIANT (arg
);
11683 if (list_length (argtypes
) == 2)
11685 if (TREE_CODE (ret
) != REFERENCE_TYPE
11686 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11688 cp_warning ("prefix `%D' should return `%T'", decl
,
11689 build_reference_type (arg
));
11693 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11694 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11698 else if (unary_op_p (name
))
11700 if (list_length (argtypes
) != 2)
11703 cp_error ("`%D' must take `void'", decl
);
11705 cp_error ("`%D' must take exactly one argument", decl
);
11708 else /* if (binary_op_p (name)) */
11710 if (list_length (argtypes
) != 3)
11713 cp_error ("`%D' must take exactly one argument", decl
);
11715 cp_error ("`%D' must take exactly two arguments", decl
);
11718 /* More Effective C++ rule 7. */
11720 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11721 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11722 || name
== ansi_opname
[COMPOUND_EXPR
]))
11723 cp_warning ("user-defined `%D' always evaluates both arguments",
11727 /* Effective C++ rule 23. */
11729 && list_length (argtypes
) == 3
11730 && (name
== ansi_opname
[PLUS_EXPR
]
11731 || name
== ansi_opname
[MINUS_EXPR
]
11732 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11733 || name
== ansi_opname
[MULT_EXPR
])
11734 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11735 cp_warning ("`%D' should return by value", decl
);
11739 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11740 if (TREE_PURPOSE (argtypes
))
11742 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11743 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11744 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11747 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11750 cp_error ("`%D' cannot have default arguments", decl
);
11757 enum tag_types code
;
11769 case signature_type
:
11770 return "signature";
11772 my_friendly_abort (981122);
11776 /* Get the struct, enum or union (CODE says which) with tag NAME.
11777 Define the tag as a forward-reference if it is not defined.
11779 C++: If a class derivation is given, process it here, and report
11780 an error if multiple derivation declarations are not identical.
11782 If this is a definition, come in through xref_tag and only look in
11783 the current frame for the name (since C++ allows new names in any
11787 xref_tag (code_type_node
, name
, globalize
)
11788 tree code_type_node
;
11792 enum tag_types tag_code
;
11793 enum tree_code code
;
11795 register tree ref
, t
;
11796 struct binding_level
*b
= inner_binding_level
;
11798 tree attributes
= NULL_TREE
;
11800 /* If we are called from the parser, code_type_node will sometimes be a
11801 TREE_LIST. This indicates that the user wrote
11802 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11804 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11806 attributes
= TREE_PURPOSE (code_type_node
);
11807 code_type_node
= TREE_VALUE (code_type_node
);
11810 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11815 case signature_type
:
11816 code
= RECORD_TYPE
;
11822 code
= ENUMERAL_TYPE
;
11825 my_friendly_abort (18);
11828 /* If a cross reference is requested, look up the type
11829 already defined for this tag and return it. */
11830 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11833 name
= TYPE_IDENTIFIER (t
);
11837 t
= IDENTIFIER_TYPE_VALUE (name
);
11839 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11840 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11845 if (t
&& (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
11846 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
))
11848 cp_error ("redeclaration of template type-parameter `%T'", name
);
11849 cp_error_at (" previously declared here `%#D'",
11850 TEMPLATE_TYPE_DECL (t
));
11852 if (t
&& TYPE_CONTEXT (t
) && got_type
)
11855 /* If we know we are defining this tag, only look it up in
11856 this scope and don't try to find it as a type. */
11857 ref
= lookup_tag (code
, name
, b
, 1);
11861 if (current_class_type
11862 && template_class_depth (current_class_type
)
11863 && PROCESSING_REAL_TEMPLATE_DECL_P ())
11864 /* Since GLOBALIZE is non-zero, we are not looking at a
11865 definition of this tag. Since, in addition, we are currently
11866 processing a (member) template declaration of a template
11867 class, we don't want to do any lookup at all; consider:
11874 { template <class V>
11875 friend struct S1; };
11877 Here, the S2::S1 declaration should not be confused with the
11878 outer declaration. In particular, the inner version should
11879 have a template parameter of level 2, not level 1. This
11880 would be particularly important if the member declaration
11883 template <class V = U> friend struct S1;
11885 say, when we should tsubst into `U' when instantiating S2. */
11891 if (t
!= TYPE_MAIN_VARIANT (t
))
11892 cp_pedwarn ("using typedef-name `%D' after `%s'",
11893 TYPE_NAME (t
), tag_name (tag_code
));
11897 ref
= lookup_tag (code
, name
, b
, 0);
11901 /* Try finding it as a type declaration. If that wins,
11903 ref
= lookup_name (name
, 1);
11905 if (ref
!= NULL_TREE
11906 && processing_template_decl
11907 && DECL_CLASS_TEMPLATE_P (ref
)
11908 && template_class_depth (current_class_type
) == 0)
11909 /* Since GLOBALIZE is true, we're declaring a global
11910 template, so we want this type. */
11911 ref
= DECL_RESULT (ref
);
11913 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
11914 && TREE_CODE (TREE_TYPE (ref
)) == code
)
11915 ref
= TREE_TYPE (ref
);
11922 push_obstacks_nochange ();
11926 /* If no such tag is yet defined, create a forward-reference node
11927 and record it as the "definition".
11928 When a real declaration of this type is found,
11929 the forward-reference will be altered into a real type. */
11931 /* In C++, since these migrate into the global scope, we must
11932 build them on the permanent obstack. */
11934 temp
= allocation_temporary_p ();
11936 end_temporary_allocation ();
11938 if (code
== ENUMERAL_TYPE
)
11940 cp_error ("use of enum `%#D' without previous declaration", name
);
11942 ref
= make_node (ENUMERAL_TYPE
);
11944 /* Give the type a default layout like unsigned int
11945 to avoid crashing if it does not get defined. */
11946 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
11947 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
11948 TREE_UNSIGNED (ref
) = 1;
11949 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
11950 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
11951 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
11953 /* Enable us to recognize when a type is created in class context.
11954 To do nested classes correctly, this should probably be cleared
11955 out when we leave this classes scope. Currently this in only
11956 done in `start_enum'. */
11958 pushtag (name
, ref
, globalize
);
11962 struct binding_level
*old_b
= class_binding_level
;
11964 ref
= make_lang_type (code
);
11966 if (tag_code
== signature_type
)
11968 SET_SIGNATURE (ref
);
11969 /* Since a signature type will be turned into the type
11970 of signature tables, it's not only an interface. */
11971 CLASSTYPE_INTERFACE_ONLY (ref
) = 0;
11972 SET_CLASSTYPE_INTERFACE_KNOWN (ref
);
11973 /* A signature doesn't have a vtable. */
11974 CLASSTYPE_VTABLE_NEEDS_WRITING (ref
) = 0;
11977 #ifdef NONNESTED_CLASSES
11978 /* Class types don't nest the way enums do. */
11979 class_binding_level
= (struct binding_level
*)0;
11981 pushtag (name
, ref
, globalize
);
11982 class_binding_level
= old_b
;
11987 /* If it no longer looks like a nested type, make sure it's
11989 If it is not an IDENTIFIER, this is not a declaration */
11990 if (b
->namespace_p
&& !class_binding_level
11991 && TREE_CODE (name
) == IDENTIFIER_NODE
)
11993 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
11994 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
11997 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
11998 redeclare_class_template (ref
, current_template_parms
);
12001 /* Until the type is defined, tentatively accept whatever
12002 structure tag the user hands us. */
12003 if (TYPE_SIZE (ref
) == NULL_TREE
12004 && ref
!= current_class_type
12005 /* Have to check this, in case we have contradictory tag info. */
12006 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12008 if (tag_code
== class_type
)
12009 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12010 else if (tag_code
== record_type
|| tag_code
== signature_type
)
12011 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12016 TREE_TYPE (ref
) = attributes
;
12018 if (ref
&& TYPE_P (ref
))
12022 If the identifier resolves to a typedef-name or a template
12023 type-parameter, the elaborated-type-specifier is
12025 if (TYPE_LANG_SPECIFIC (ref
) && TYPE_WAS_ANONYMOUS (ref
))
12026 cp_error ("`%T' is a typedef name", ref
);
12027 else if (TREE_CODE (ref
) == TEMPLATE_TYPE_PARM
)
12028 cp_error ("`%T' is a template type paramter", ref
);
12035 xref_tag_from_type (old
, id
, globalize
)
12039 tree code_type_node
;
12041 if (TREE_CODE (old
) == RECORD_TYPE
)
12042 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12043 ? class_type_node
: record_type_node
);
12045 code_type_node
= union_type_node
;
12047 if (id
== NULL_TREE
)
12048 id
= TYPE_IDENTIFIER (old
);
12050 return xref_tag (code_type_node
, id
, globalize
);
12054 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12055 tree code_type_node
;
12059 /* In the declaration `A : X, Y, ... Z' we mark all the types
12060 (A, X, Y, ..., Z) so we can check for duplicates. */
12063 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12065 if (tag_code
== union_type
)
12067 cp_error ("derived union `%T' invalid", ref
);
12071 len
= list_length (binfo
);
12072 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12074 SET_CLASSTYPE_MARKED (ref
);
12075 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12077 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12079 /* The base of a derived struct is public by default. */
12081 = (TREE_PURPOSE (binfo
) == access_public_node
12082 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12083 || (tag_code
!= class_type
12084 && (TREE_PURPOSE (binfo
) == access_default_node
12085 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12087 = (TREE_PURPOSE (binfo
) == access_protected_node
12088 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12090 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12091 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12092 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12093 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12094 tree basetype
= TREE_VALUE (binfo
);
12097 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12098 basetype
= TREE_TYPE (basetype
);
12100 || (TREE_CODE (basetype
) != RECORD_TYPE
12101 && TREE_CODE (basetype
) != TYPENAME_TYPE
12102 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12103 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12105 cp_error ("base type `%T' fails to be a struct or class type",
12106 TREE_VALUE (binfo
));
12110 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12113 /* This code replaces similar code in layout_basetypes.
12114 We put the complete_type first for implicit `typename'. */
12115 if (TYPE_SIZE (complete_type (basetype
)) == NULL_TREE
12116 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12118 cp_error ("base class `%T' has incomplete type", basetype
);
12124 if (CLASSTYPE_MARKED (basetype
))
12126 if (basetype
== ref
)
12127 cp_error ("recursive type `%T' undefined", basetype
);
12129 cp_error ("duplicate base type `%T' invalid", basetype
);
12133 if (TYPE_FOR_JAVA (basetype
)
12134 && current_lang_stack
== current_lang_base
)
12135 TYPE_FOR_JAVA (ref
) = 1;
12137 /* Note that the BINFO records which describe individual
12138 inheritances are *not* shared in the lattice! They
12139 cannot be shared because a given baseclass may be
12140 inherited with different `accessibility' by different
12141 derived classes. (Each BINFO record describing an
12142 individual inheritance contains flags which say what
12143 the `accessibility' of that particular inheritance is.) */
12146 = make_binfo (integer_zero_node
, basetype
,
12147 CLASS_TYPE_P (basetype
)
12148 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12149 CLASS_TYPE_P (basetype
)
12150 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12152 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12153 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12154 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12155 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12156 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12158 /* We need to unshare the binfos now so that lookups during class
12159 definition work. */
12160 unshare_base_binfos (base_binfo
);
12162 SET_CLASSTYPE_MARKED (basetype
);
12164 /* We are free to modify these bits because they are meaningless
12165 at top level, and BASETYPE is a top-level type. */
12166 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12168 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12169 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12172 if (CLASS_TYPE_P (basetype
))
12174 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12175 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12182 TREE_VEC_LENGTH (binfos
) = i
;
12184 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12187 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12190 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12192 if (CLASS_TYPE_P (basetype
))
12193 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12194 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12197 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12198 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12200 /* Unmark all the types. */
12202 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12203 CLEAR_CLASSTYPE_MARKED (ref
);
12209 /* Begin compiling the definition of an enumeration type.
12210 NAME is its name (or null if anonymous).
12211 Returns the type object, as yet incomplete.
12212 Also records info about it so that build_enumerator
12213 may be used to declare the individual values as they are read. */
12219 register tree enumtype
= NULL_TREE
;
12220 struct binding_level
*b
= inner_binding_level
;
12222 /* We are wasting space here and putting these on the permanent_obstack so
12223 that typeid(local enum) will work correctly. */
12225 if (processing_template_decl
&& current_function_decl
)
12228 end_temporary_allocation ();
12230 /* If this is the real definition for a previous forward reference,
12231 fill in the contents in the same object that used to be the
12232 forward reference. */
12234 if (name
!= NULL_TREE
)
12235 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12237 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12238 cp_error ("multiple definition of `%#T'", enumtype
);
12241 enumtype
= make_node (ENUMERAL_TYPE
);
12242 pushtag (name
, enumtype
, 0);
12245 if (current_class_type
)
12246 TREE_ADDRESSABLE (b
->tags
) = 1;
12248 /* We don't copy this value because build_enumerator needs to do it. */
12249 enum_next_value
= integer_zero_node
;
12252 GNU_xref_decl (current_function_decl
, enumtype
);
12256 /* After processing and defining all the values of an enumeration type,
12257 install their decls in the enumeration type and finish it off.
12258 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12259 Returns ENUMTYPE. */
12262 finish_enum (enumtype
)
12265 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12266 /* Calculate the maximum value of any enumerator in this type. */
12268 tree values
= TYPE_VALUES (enumtype
);
12273 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12278 /* The TREE_VALUE is a CONST_DECL for this enumeration
12280 decl
= TREE_VALUE (pair
);
12282 /* The DECL_INITIAL will be NULL if we are processing a
12283 template declaration and this enumeration constant had no
12284 explicit initializer. */
12285 value
= DECL_INITIAL (decl
);
12286 if (value
&& !processing_template_decl
)
12288 /* Set the TREE_TYPE for the VALUE as well. That's so
12289 that when we call decl_constant_value we get an
12290 entity of the right type (but with the constant
12291 value). Since we shouldn't ever call
12292 decl_constant_value on a template type, there's no
12293 reason to do that when processing_template_decl.
12294 And, if the expression is something like a
12295 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12296 wreak havoc on the intended type of the expression.
12298 Of course, there's also no point in trying to compute
12299 minimum or maximum values if we're in a template. */
12300 TREE_TYPE (value
) = enumtype
;
12303 minnode
= maxnode
= value
;
12304 else if (tree_int_cst_lt (maxnode
, value
))
12306 else if (tree_int_cst_lt (value
, minnode
))
12310 if (processing_template_decl
)
12311 /* If this is just a template, leave the CONST_DECL
12312 alone. That way tsubst_copy will find CONST_DECLs for
12313 CONST_DECLs, and not INTEGER_CSTs. */
12316 /* In the list we're building up, we want the enumeration
12317 values, not the CONST_DECLs. */
12318 TREE_VALUE (pair
) = value
;
12322 maxnode
= minnode
= integer_zero_node
;
12324 TYPE_VALUES (enumtype
) = nreverse (values
);
12326 if (processing_template_decl
)
12328 tree scope
= current_scope ();
12329 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12331 add_tree (build_min (TAG_DEFN
, enumtype
));
12332 resume_temporary_allocation ();
12338 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12339 int lowprec
= min_precision (minnode
, unsignedp
);
12340 int highprec
= min_precision (maxnode
, unsignedp
);
12341 int precision
= MAX (lowprec
, highprec
);
12343 TYPE_SIZE (enumtype
) = NULL_TREE
;
12345 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12347 TYPE_PRECISION (enumtype
) = precision
;
12349 fixup_unsigned_type (enumtype
);
12351 fixup_signed_type (enumtype
);
12353 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12354 /* Use the width of the narrowest normal C type which is wide enough. */
12355 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12358 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12360 TYPE_SIZE (enumtype
) = 0;
12361 layout_type (enumtype
);
12367 /* Fix up all variant types of this enum type. */
12368 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12369 tem
= TYPE_NEXT_VARIANT (tem
))
12371 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12372 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12373 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12374 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12375 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12376 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12377 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12378 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12379 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12383 /* Finish debugging output for this type. */
12384 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12389 /* Build and install a CONST_DECL for an enumeration constant of the
12390 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12391 Assignment of sequential values by default is handled here. */
12394 build_enumerator (name
, value
, type
)
12402 /* Remove no-op casts from the value. */
12404 STRIP_TYPE_NOPS (value
);
12406 if (! processing_template_decl
)
12408 /* Validate and default VALUE. */
12409 if (value
!= NULL_TREE
)
12411 if (TREE_READONLY_DECL_P (value
))
12412 value
= decl_constant_value (value
);
12414 if (TREE_CODE (value
) == INTEGER_CST
)
12416 value
= default_conversion (value
);
12417 constant_expression_warning (value
);
12421 cp_error ("enumerator value for `%D' not integer constant", name
);
12426 /* Default based on previous value. */
12427 if (value
== NULL_TREE
&& ! processing_template_decl
)
12429 value
= enum_next_value
;
12431 cp_error ("overflow in enumeration values at `%D'", name
);
12434 /* Remove no-op casts from the value. */
12436 STRIP_TYPE_NOPS (value
);
12438 /* To fix MAX_VAL enum consts. (bkoz) */
12439 TREE_TYPE (value
) = integer_type_node
;
12443 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12444 Even in other cases, we will later (in finish_enum) be setting the
12446 if (value
!= NULL_TREE
)
12447 value
= copy_node (value
);
12449 /* C++ associates enums with global, function, or class declarations. */
12451 context
= current_scope ();
12452 if (context
&& context
== current_class_type
)
12453 /* This enum declaration is local to the class. */
12454 decl
= build_lang_field_decl (CONST_DECL
, name
, type
);
12456 /* It's a global enum, or it's local to a function. (Note local to
12457 a function could mean local to a class method. */
12458 decl
= build_decl (CONST_DECL
, name
, type
);
12460 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12461 DECL_INITIAL (decl
) = value
;
12462 TREE_READONLY (decl
) = 1;
12464 if (context
&& context
== current_class_type
)
12466 pushdecl_class_level (decl
);
12467 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12468 on the TYPE_FIELDS list for `S'. (That's so that you can say
12469 things like `S::i' later.) */
12470 finish_member_declaration (decl
);
12475 GNU_xref_decl (current_function_decl
, decl
);
12478 if (! processing_template_decl
)
12480 /* Set basis for default for next value. */
12481 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12482 integer_one_node
, PLUS_EXPR
);
12483 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12486 result
= saveable_tree_cons (name
, decl
, NULL_TREE
);
12491 static int function_depth
;
12493 /* Create the FUNCTION_DECL for a function definition.
12494 DECLSPECS and DECLARATOR are the parts of the declaration;
12495 they describe the function's name and the type it returns,
12496 but twisted together in a fashion that parallels the syntax of C.
12498 This function creates a binding context for the function body
12499 as well as setting up the FUNCTION_DECL in current_function_decl.
12501 Returns 1 on success. If the DECLARATOR is not suitable for a function
12502 (it defines a datum instead), we return 0, which tells
12503 yyparse to report a parse error.
12505 For C++, we must first check whether that datum makes any sense.
12506 For example, "class A local_a(1,2);" means that variable local_a
12507 is an aggregate of type A, which should have a constructor
12508 applied to it with the argument list [1, 2].
12510 @@ There is currently no way to retrieve the storage
12511 @@ allocated to FUNCTION (or all of its parms) if we return
12512 @@ something we had previously. */
12515 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
12516 tree declspecs
, declarator
, attrs
;
12520 tree ctype
= NULL_TREE
;
12523 extern int have_extern_spec
;
12524 extern int used_extern_spec
;
12525 int doing_friend
= 0;
12527 /* Sanity check. */
12528 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12529 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12531 /* Assume, until we see it does. */
12532 current_function_returns_value
= 0;
12533 current_function_returns_null
= 0;
12535 shadowed_labels
= 0;
12536 current_function_assigns_this
= 0;
12537 current_function_just_assigned_this
= 0;
12538 current_function_parms_stored
= 0;
12539 original_result_rtx
= NULL_RTX
;
12540 base_init_expr
= NULL_TREE
;
12541 current_base_init_list
= NULL_TREE
;
12542 current_member_init_list
= NULL_TREE
;
12543 ctor_label
= dtor_label
= NULL_TREE
;
12544 static_labelno
= 0;
12546 clear_temp_name ();
12548 /* This should only be done once on the top most decl. */
12549 if (have_extern_spec
&& !used_extern_spec
)
12551 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12552 used_extern_spec
= 1;
12557 decl1
= declarator
;
12560 /* What was this testing for, exactly? */
12561 if (! DECL_ARGUMENTS (decl1
)
12562 && !DECL_STATIC_FUNCTION_P (decl1
)
12563 && !DECL_ARTIFICIAL (decl1
)
12564 && DECL_CLASS_SCOPE_P (decl1
)
12565 && TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))
12566 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))))
12568 tree binding
= binding_for_name (DECL_NAME (decl1
),
12569 current_namespace
);
12570 cp_error ("redeclaration of `%#D'", decl1
);
12571 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)))
12572 cp_error_at ("previous declaration here", IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)));
12573 else if (BINDING_VALUE (binding
))
12574 cp_error_at ("previous declaration here", BINDING_VALUE (binding
));
12578 fntype
= TREE_TYPE (decl1
);
12579 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12580 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12582 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12583 class is in the (lexical) scope of the class in which it is
12585 if (!ctype
&& DECL_FRIEND_P (decl1
))
12587 ctype
= DECL_CLASS_CONTEXT (decl1
);
12589 /* CTYPE could be null here if we're dealing with a template;
12590 for example, `inline friend float foo()' inside a template
12591 will have no CTYPE set. */
12592 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12598 /* In a fcn definition, arg types must be complete. */
12599 require_complete_types_for_parms (DECL_ARGUMENTS (decl1
));
12601 /* In case some arg types were completed since the declaration was
12602 parsed, fix up the decls. */
12604 tree t
= DECL_ARGUMENTS (decl1
);
12605 for (; t
; t
= TREE_CHAIN (t
))
12606 layout_decl (t
, 0);
12609 last_function_parms
= DECL_ARGUMENTS (decl1
);
12610 last_function_parm_tags
= NULL_TREE
;
12614 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12615 /* If the declarator is not suitable for a function definition,
12616 cause a syntax error. */
12617 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12619 fntype
= TREE_TYPE (decl1
);
12621 restype
= TREE_TYPE (fntype
);
12622 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12624 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12625 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12626 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12627 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12628 fntype
= build_function_type (integer_type_node
,
12629 TYPE_ARG_TYPES (fntype
));
12631 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12633 TYPE_ARG_TYPES (fntype
));
12634 TREE_TYPE (decl1
) = fntype
;
12637 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12638 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12639 else if (DECL_MAIN_P (decl1
))
12641 /* If this doesn't return integer_type, complain. */
12642 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12644 if (pedantic
|| warn_return_type
)
12645 pedwarn ("return type for `main' changed to `int'");
12646 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12651 /* Warn if function was previously implicitly declared
12652 (but not if we warned then). */
12653 if (! warn_implicit
12654 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12655 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12657 current_function_decl
= decl1
;
12658 /* Save the parm names or decls from this function's declarator
12659 where store_parm_decls will find them. */
12660 current_function_parms
= last_function_parms
;
12661 current_function_parm_tags
= last_function_parm_tags
;
12663 announce_function (decl1
);
12665 if (! processing_template_decl
)
12667 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12669 cp_error ("return-type `%#T' is an incomplete type",
12670 TREE_TYPE (fntype
));
12672 /* Make it return void instead, but don't change the
12673 type of the DECL_RESULT, in case we have a named return value. */
12676 = build_cplus_method_type (build_type_variant (ctype
,
12677 TREE_READONLY (decl1
),
12678 TREE_SIDE_EFFECTS (decl1
)),
12680 FUNCTION_ARG_CHAIN (decl1
));
12683 = build_function_type (void_type_node
,
12684 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
12685 DECL_RESULT (decl1
)
12686 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
12687 TREE_READONLY (DECL_RESULT (decl1
))
12688 = CP_TYPE_CONST_P (TREE_TYPE (fntype
));
12689 TREE_THIS_VOLATILE (DECL_RESULT (decl1
))
12690 = CP_TYPE_VOLATILE_P (TREE_TYPE (fntype
));
12693 if (TYPE_LANG_SPECIFIC (TREE_TYPE (fntype
))
12694 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (fntype
)))
12695 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
12698 /* Effective C++ rule 15. See also c_expand_return. */
12700 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12701 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12702 cp_warning ("`operator=' should return a reference to `*this'");
12704 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12705 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12706 DECL_INITIAL (decl1
) = error_mark_node
;
12708 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12709 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12712 /* This function exists in static storage.
12713 (This does not mean `static' in the C sense!) */
12714 TREE_STATIC (decl1
) = 1;
12716 /* Set up current_class_type, and enter the scope of the class, if
12719 push_nested_class (ctype
, 1);
12720 else if (DECL_STATIC_FUNCTION_P (decl1
))
12721 push_nested_class (DECL_CONTEXT (decl1
), 2);
12723 /* We must call push_template_decl after current_class_type is set
12724 up. (If we are processing inline definitions after exiting a
12725 class scope, current_class_type will be NULL_TREE until set above
12726 by push_nested_class.) */
12727 if (processing_template_decl
)
12728 decl1
= push_template_decl (decl1
);
12730 /* Record the decl so that the function name is defined.
12731 If we already have a decl for this name, and it is a FUNCTION_DECL,
12732 use the old decl. */
12733 if (!processing_template_decl
&& pre_parsed_p
== 0)
12735 /* A specialization is not used to guide overload resolution. */
12736 if ((flag_guiding_decls
12737 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12738 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12739 decl1
= pushdecl (decl1
);
12742 /* We need to set the DECL_CONTEXT. */
12743 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12744 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12745 /* And make sure we have enough default args. */
12746 check_default_args (decl1
);
12748 DECL_MAIN_VARIANT (decl1
) = decl1
;
12749 fntype
= TREE_TYPE (decl1
);
12752 current_function_decl
= decl1
;
12754 if (DECL_INTERFACE_KNOWN (decl1
))
12756 tree ctx
= hack_decl_function_context (decl1
);
12758 if (DECL_NOT_REALLY_EXTERN (decl1
))
12759 DECL_EXTERNAL (decl1
) = 0;
12761 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12762 && TREE_PUBLIC (ctx
))
12763 /* This is a function in a local class in an extern inline
12765 comdat_linkage (decl1
);
12767 /* If this function belongs to an interface, it is public.
12768 If it belongs to someone else's interface, it is also external.
12769 It doesn't matter whether it's inline or not. */
12770 else if (interface_unknown
== 0
12771 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12772 || flag_alt_external_templates
))
12774 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12775 || processing_template_decl
)
12776 DECL_EXTERNAL (decl1
)
12778 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
));
12780 DECL_EXTERNAL (decl1
) = 0;
12781 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
12782 DECL_INTERFACE_KNOWN (decl1
) = 1;
12786 /* This is a definition, not a reference.
12787 So clear DECL_EXTERNAL. */
12788 DECL_EXTERNAL (decl1
) = 0;
12790 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
12791 && ! DECL_INTERFACE_KNOWN (decl1
)
12792 /* Don't try to defer nested functions for now. */
12793 && ! hack_decl_function_context (decl1
))
12794 DECL_DEFER_OUTPUT (decl1
) = 1;
12796 DECL_INTERFACE_KNOWN (decl1
) = 1;
12799 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
12801 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12802 TREE_TYPE (decl1
) = fntype
12803 = build_function_type (TREE_TYPE (fntype
),
12804 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
12805 current_function_parms
= TREE_CHAIN (current_function_parms
);
12806 DECL_ARGUMENTS (decl1
) = current_function_parms
;
12809 restype
= TREE_TYPE (fntype
);
12813 /* If we're compiling a friend function, neither of the variables
12814 current_class_ptr nor current_class_type will have values. */
12815 if (! doing_friend
)
12817 /* We know that this was set up by `grokclassfn'.
12818 We do not wait until `store_parm_decls', since evil
12819 parse errors may never get us to that point. Here
12820 we keep the consistency between `current_class_type'
12821 and `current_class_ptr'. */
12822 tree t
= current_function_parms
;
12824 my_friendly_assert (t
!= NULL_TREE
12825 && TREE_CODE (t
) == PARM_DECL
, 162);
12827 if (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
)
12831 if (! hack_decl_function_context (decl1
))
12832 temporary_allocation ();
12833 i
= suspend_momentary ();
12835 /* Normally, build_indirect_ref returns
12836 current_class_ref whenever current_class_ptr is
12837 dereferenced. This time, however, we want it to
12838 *create* current_class_ref, so we temporarily clear
12839 current_class_ptr to fool it. */
12840 current_class_ptr
= NULL_TREE
;
12841 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
12842 current_class_ptr
= t
;
12844 resume_momentary (i
);
12845 if (! hack_decl_function_context (decl1
))
12846 end_temporary_allocation ();
12849 /* We're having a signature pointer here. */
12850 current_class_ref
= current_class_ptr
= t
;
12855 current_class_ptr
= current_class_ref
= NULL_TREE
;
12858 current_binding_level
->parm_flag
= 1;
12860 GNU_xref_function (decl1
, current_function_parms
);
12863 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
12865 make_function_rtl (decl1
);
12867 /* Promote the value to int before returning it. */
12868 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
12869 restype
= type_promotes_to (restype
);
12871 /* If this fcn was already referenced via a block-scope `extern' decl
12872 (or an implicit decl), propagate certain information about the usage. */
12873 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
12874 TREE_ADDRESSABLE (decl1
) = 1;
12876 if (DECL_RESULT (decl1
) == NULL_TREE
)
12878 DECL_RESULT (decl1
)
12879 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12880 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
12881 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
12884 /* Allocate further tree nodes temporarily during compilation
12885 of this function only. Tiemann moved up here from bottom of fn. */
12886 /* If this is a nested function, then we must continue to allocate RTL
12887 on the permanent obstack in case we need to inline it later. */
12888 if (! hack_decl_function_context (decl1
))
12889 temporary_allocation ();
12891 if (processing_template_decl
)
12893 ++minimal_parse_mode
;
12894 last_tree
= DECL_SAVED_TREE (decl1
)
12895 = build_nt (EXPR_STMT
, void_zero_node
);
12900 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
12901 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
12903 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
12904 ctor_label
= NULL_TREE
;
12908 dtor_label
= NULL_TREE
;
12909 if (DECL_CONSTRUCTOR_P (decl1
))
12910 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
12916 /* Called after store_parm_decls for a function-try-block. We need to update
12917 last_parm_cleanup_insn so that the base initializers for a constructor
12918 are run within this block, not before it. */
12921 expand_start_early_try_stmts ()
12923 expand_start_try_stmts ();
12924 last_parm_cleanup_insn
= get_last_insn ();
12927 /* Store the parameter declarations into the current function declaration.
12928 This is called after parsing the parameter declarations, before
12929 digesting the body of the function.
12931 Also install to binding contour return value identifier, if any. */
12934 store_parm_decls ()
12936 register tree fndecl
= current_function_decl
;
12937 register tree parm
;
12938 int parms_have_cleanups
= 0;
12939 tree cleanups
= NULL_TREE
;
12941 /* This is either a chain of PARM_DECLs (when a prototype is used). */
12942 tree specparms
= current_function_parms
;
12944 /* This is a list of types declared among parms in a prototype. */
12945 tree parmtags
= current_function_parm_tags
;
12947 /* This is a chain of any other decls that came in among the parm
12948 declarations. If a parm is declared with enum {foo, bar} x;
12949 then CONST_DECLs for foo and bar are put here. */
12950 tree nonparms
= NULL_TREE
;
12952 if (toplevel_bindings_p ())
12953 fatal ("parse errors have confused me too much");
12955 /* Initialize RTL machinery. */
12956 init_function_start (fndecl
, input_filename
, lineno
);
12958 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
12959 declare_function_name ();
12961 /* Create a binding level for the parms. */
12962 expand_start_bindings (0);
12964 if (specparms
!= NULL_TREE
)
12966 /* This case is when the function was defined with an ANSI prototype.
12967 The parms already have decls, so we need not do anything here
12968 except record them as in effect
12969 and complain if any redundant old-style parm decls were written. */
12971 register tree next
;
12973 /* Must clear this because it might contain TYPE_DECLs declared
12975 storedecls (NULL_TREE
);
12977 for (parm
= nreverse (specparms
); parm
; parm
= next
)
12979 next
= TREE_CHAIN (parm
);
12980 if (TREE_CODE (parm
) == PARM_DECL
)
12983 if (DECL_NAME (parm
) == NULL_TREE
)
12987 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
12988 cp_error ("parameter `%D' declared void", parm
);
12991 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
12992 A parameter is assumed not to have any side effects.
12993 If this should change for any reason, then this
12994 will have to wrap the bashed reference type in a save_expr.
12996 Also, if the parameter type is declared to be an X
12997 and there is an X(X&) constructor, we cannot lay it
12998 into the stack (any more), so we make this parameter
12999 look like it is really of reference type. Functions
13000 which pass parameters to this function will know to
13001 create a temporary in their frame, and pass a reference
13004 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
13005 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
13006 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
13010 if (! processing_template_decl
13011 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13013 expand_decl (parm
);
13014 parms_have_cleanups
= 1;
13016 /* Keep track of the cleanups. */
13017 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13022 /* If we find an enum constant or a type tag,
13023 put it aside for the moment. */
13024 TREE_CHAIN (parm
) = NULL_TREE
;
13025 nonparms
= chainon (nonparms
, parm
);
13029 /* Get the decls in their original chain order
13030 and record in the function. This is all and only the
13031 PARM_DECLs that were pushed into scope by the loop above. */
13032 DECL_ARGUMENTS (fndecl
) = getdecls ();
13034 storetags (chainon (parmtags
, gettags ()));
13037 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13039 /* Now store the final chain of decls for the arguments
13040 as the decl-chain of the current lexical scope.
13041 Put the enumerators in as well, at the front so that
13042 DECL_ARGUMENTS is not modified. */
13044 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13046 /* Initialize the RTL code for the function. */
13047 DECL_SAVED_INSNS (fndecl
) = NULL_RTX
;
13048 if (! processing_template_decl
)
13049 expand_function_start (fndecl
, parms_have_cleanups
);
13051 current_function_parms_stored
= 1;
13053 /* If this function is `main', emit a call to `__main'
13054 to run global initializers, etc. */
13055 if (DECL_MAIN_P (fndecl
))
13056 expand_main_function ();
13058 /* Now that we have initialized the parms, we can start their
13059 cleanups. We cannot do this before, since expand_decl_cleanup
13060 should not be called before the parm can be used. */
13062 && ! processing_template_decl
)
13064 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
13066 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
13067 cp_error ("parser lost in parsing declaration of `%D'",
13068 TREE_PURPOSE (cleanups
));
13072 /* Create a binding contour which can be used to catch
13073 cleanup-generated temporaries. Also, if the return value needs or
13074 has initialization, deal with that now. */
13075 if (parms_have_cleanups
)
13078 expand_start_bindings (0);
13081 if (! processing_template_decl
&& flag_exceptions
)
13083 /* Do the starting of the exception specifications, if we have any. */
13084 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13085 expand_start_eh_spec ();
13088 last_parm_cleanup_insn
= get_last_insn ();
13089 last_dtor_insn
= get_last_insn ();
13092 /* Bind a name and initialization to the return value of
13093 the current function. */
13096 store_return_init (return_id
, init
)
13097 tree return_id
, init
;
13099 tree decl
= DECL_RESULT (current_function_decl
);
13102 /* Give this error as many times as there are occurrences,
13103 so that users can use Emacs compilation buffers to find
13104 and fix all such places. */
13105 pedwarn ("ANSI C++ does not permit named return values");
13107 if (return_id
!= NULL_TREE
)
13109 if (DECL_NAME (decl
) == NULL_TREE
)
13111 DECL_NAME (decl
) = return_id
;
13112 DECL_ASSEMBLER_NAME (decl
) = return_id
;
13115 cp_error ("return identifier `%D' already in place", decl
);
13118 /* Can't let this happen for constructors. */
13119 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13121 error ("can't redefine default return value for constructors");
13125 /* If we have a named return value, put that in our scope as well. */
13126 if (DECL_NAME (decl
) != NULL_TREE
)
13128 /* If this named return value comes in a register,
13129 put it in a pseudo-register. */
13130 if (DECL_REGISTER (decl
))
13132 original_result_rtx
= DECL_RTL (decl
);
13133 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13136 /* Let `cp_finish_decl' know that this initializer is ok. */
13137 DECL_INITIAL (decl
) = init
;
13140 if (minimal_parse_mode
)
13141 add_tree (build_min_nt (RETURN_INIT
, return_id
,
13142 copy_to_permanent (init
)));
13144 cp_finish_decl (decl
, init
, NULL_TREE
, 0, 0);
13149 /* Finish up a function declaration and compile that function
13150 all the way to assembler language output. The free the storage
13151 for the function definition.
13153 This is called after parsing the body of the function definition.
13154 LINENO is the current line number.
13156 C++: CALL_POPLEVEL is non-zero if an extra call to poplevel
13157 (and expand_end_bindings) must be made to take care of the binding
13158 contour for the base initializers. This is only relevant for
13161 NESTED is nonzero if we were in the middle of compiling another function
13162 when we started on this one. */
13165 finish_function (lineno
, call_poplevel
, nested
)
13170 register tree fndecl
= current_function_decl
;
13171 tree fntype
, ctype
= NULL_TREE
;
13172 rtx last_parm_insn
, insns
;
13173 /* Label to use if this function is supposed to return a value. */
13174 tree no_return_label
= NULL_TREE
;
13175 tree decls
= NULL_TREE
;
13177 /* When we get some parse errors, we can end up without a
13178 current_function_decl, so cope. */
13179 if (fndecl
== NULL_TREE
)
13182 if (! nested
&& function_depth
> 1)
13185 fntype
= TREE_TYPE (fndecl
);
13187 /* TREE_READONLY (fndecl) = 1;
13188 This caused &foo to be of type ptr-to-const-function
13189 which then got a warning when stored in a ptr-to-function variable. */
13191 /* This happens on strange parse errors. */
13192 if (! current_function_parms_stored
)
13195 store_parm_decls ();
13198 if (processing_template_decl
)
13200 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13202 decls
= getdecls ();
13203 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13204 poplevel (decls
!= NULL_TREE
, 0, 0);
13209 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13211 tree ttype
= target_type (fntype
);
13214 if (IS_AGGR_TYPE (ttype
))
13215 /* Let debugger know it should output info for this type. */
13216 note_debug_info_needed (ttype
);
13218 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13220 ttype
= target_type (TREE_TYPE (parmdecl
));
13221 if (IS_AGGR_TYPE (ttype
))
13222 /* Let debugger know it should output info for this type. */
13223 note_debug_info_needed (ttype
);
13227 /* Clean house because we will need to reorder insns here. */
13228 do_pending_stack_adjust ();
13232 tree binfo
= TYPE_BINFO (current_class_type
);
13233 tree cond
= integer_one_node
;
13235 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13237 int ok_to_optimize_dtor
= 0;
13238 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13240 if (current_function_assigns_this
)
13241 cond
= build (NE_EXPR
, boolean_type_node
,
13242 current_class_ptr
, integer_zero_node
);
13245 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13247 /* If this destructor is empty, then we don't need to check
13248 whether `this' is NULL in some cases. */
13249 if ((flag_this_is_variable
& 1) == 0)
13250 ok_to_optimize_dtor
= 1;
13251 else if (empty_dtor
)
13252 ok_to_optimize_dtor
13253 = (n_baseclasses
== 0
13254 || (n_baseclasses
== 1
13255 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13258 /* These initializations might go inline. Protect
13259 the binding level of the parms. */
13261 expand_start_bindings (0);
13263 if (current_function_assigns_this
)
13265 current_function_assigns_this
= 0;
13266 current_function_just_assigned_this
= 0;
13269 /* Generate the code to call destructor on base class.
13270 If this destructor belongs to a class with virtual
13271 functions, then set the virtual function table
13272 pointer to represent the type of our base class. */
13274 /* This side-effect makes call to `build_delete' generate the
13275 code we have to have at the end of this destructor.
13276 `build_delete' will set the flag again. */
13277 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13279 /* These are two cases where we cannot delegate deletion. */
13280 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13281 || TYPE_GETS_REG_DELETE (current_class_type
))
13282 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13283 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13285 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13286 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13288 /* If we did not assign to this, then `this' is non-zero at
13289 the end of a destructor. As a special optimization, don't
13290 emit test if this is an empty destructor. If it does nothing,
13291 it does nothing. If it calls a base destructor, the base
13292 destructor will perform the test. */
13294 if (exprstmt
!= error_mark_node
13295 && (TREE_CODE (exprstmt
) != NOP_EXPR
13296 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13297 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13299 expand_label (dtor_label
);
13300 if (cond
!= integer_one_node
)
13301 expand_start_cond (cond
, 0);
13302 if (exprstmt
!= void_zero_node
)
13303 /* Don't call `expand_expr_stmt' if we're not going to do
13304 anything, since -Wall will give a diagnostic. */
13305 expand_expr_stmt (exprstmt
);
13307 /* Run destructor on all virtual baseclasses. */
13308 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13310 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13311 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13312 in_charge_node
, integer_two_node
), 0);
13315 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13317 tree vb
= get_vbase
13318 (BINFO_TYPE (vbases
),
13319 TYPE_BINFO (current_class_type
));
13321 (build_scoped_method_call
13322 (current_class_ref
, vb
, dtor_identifier
,
13323 build_expr_list (NULL_TREE
, integer_zero_node
)));
13325 vbases
= TREE_CHAIN (vbases
);
13327 expand_end_cond ();
13330 do_pending_stack_adjust ();
13331 if (cond
!= integer_one_node
)
13332 expand_end_cond ();
13335 virtual_size
= c_sizeof (current_class_type
);
13337 /* At the end, call delete if that's what's requested. */
13339 /* FDIS sez: At the point of definition of a virtual destructor
13340 (including an implicit definition), non-placement operator
13341 delete shall be looked up in the scope of the destructor's
13342 class and if found shall be accessible and unambiguous.
13344 This is somewhat unclear, but I take it to mean that if the
13345 class only defines placement deletes we don't do anything here.
13346 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13347 for us if they ever try to delete one of these. */
13349 if (TYPE_GETS_REG_DELETE (current_class_type
)
13350 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13351 exprstmt
= build_op_delete_call
13352 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13353 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13355 exprstmt
= NULL_TREE
;
13359 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13360 in_charge_node
, integer_one_node
);
13361 expand_start_cond (cond
, 0);
13362 expand_expr_stmt (exprstmt
);
13363 expand_end_cond ();
13366 /* End of destructor. */
13367 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13368 poplevel (getdecls () != NULL_TREE
, 0, 0);
13370 /* Back to the top of destructor. */
13371 /* Don't execute destructor code if `this' is NULL. */
13375 /* If the dtor is empty, and we know there is not possible way we
13376 could use any vtable entries, before they are possibly set by
13377 a base class dtor, we don't have to setup the vtables, as we
13378 know that any base class dtoring will set up any vtables it
13379 needs. We avoid MI, because one base class dtor can do a
13380 virtual dispatch to an overridden function that would need to
13381 have a non-related vtable set up, we cannot avoid setting up
13382 vtables in that case. We could change this to see if there is
13383 just one vtable. */
13384 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13386 /* Make all virtual function table pointers in non-virtual base
13387 classes point to CURRENT_CLASS_TYPE's virtual function
13389 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13391 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13392 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13395 if (! ok_to_optimize_dtor
)
13397 cond
= build_binary_op (NE_EXPR
,
13398 current_class_ptr
, integer_zero_node
, 1);
13399 expand_start_cond (cond
, 0);
13402 insns
= get_insns ();
13405 last_parm_insn
= get_first_nonparm_insn ();
13406 if (last_parm_insn
== NULL_RTX
)
13407 last_parm_insn
= get_last_insn ();
13409 last_parm_insn
= previous_insn (last_parm_insn
);
13411 emit_insns_after (insns
, last_parm_insn
);
13413 if (! ok_to_optimize_dtor
)
13414 expand_end_cond ();
13416 else if (current_function_assigns_this
)
13418 /* Does not need to call emit_base_init, because
13419 that is done (if needed) just after assignment to this
13422 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13424 end_protect_partials ();
13425 expand_label (ctor_label
);
13426 ctor_label
= NULL_TREE
;
13430 decls
= getdecls ();
13431 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13432 poplevel (decls
!= NULL_TREE
, 0, 0);
13434 /* c_expand_return knows to return 'this' from a constructor. */
13435 c_expand_return (NULL_TREE
);
13437 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13438 && return_label
!= NULL_RTX
)
13439 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13441 current_function_assigns_this
= 0;
13442 current_function_just_assigned_this
= 0;
13443 base_init_expr
= NULL_TREE
;
13445 else if (DECL_CONSTRUCTOR_P (fndecl
))
13447 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13448 /* Allow constructor for a type to get a new instance of the object
13449 using `build_new'. */
13450 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13451 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13453 DECL_RETURNS_FIRST_ARG (fndecl
) = 1;
13455 if (flag_this_is_variable
> 0)
13457 cond
= build_binary_op (EQ_EXPR
,
13458 current_class_ptr
, integer_zero_node
, 1);
13459 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13460 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13463 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13467 if (flag_this_is_variable
> 0)
13469 expand_start_cond (cond
, 0);
13470 expand_expr_stmt (thenclause
);
13471 expand_end_cond ();
13474 /* Emit insns from `emit_base_init' which sets up virtual
13475 function table pointer(s). */
13476 if (base_init_expr
)
13478 expand_expr_stmt (base_init_expr
);
13479 base_init_expr
= NULL_TREE
;
13482 insns
= get_insns ();
13485 /* This is where the body of the constructor begins. */
13487 emit_insns_after (insns
, last_parm_cleanup_insn
);
13489 end_protect_partials ();
13491 /* This is where the body of the constructor ends. */
13492 expand_label (ctor_label
);
13493 ctor_label
= NULL_TREE
;
13497 decls
= getdecls ();
13498 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13499 poplevel (decls
!= NULL_TREE
, 1, 0);
13502 /* c_expand_return knows to return 'this' from a constructor. */
13503 c_expand_return (NULL_TREE
);
13505 current_function_assigns_this
= 0;
13506 current_function_just_assigned_this
= 0;
13508 else if (DECL_MAIN_P (fndecl
))
13510 /* Make it so that `main' always returns 0 by default. */
13512 c_expand_return (integer_one_node
);
13514 c_expand_return (integer_zero_node
);
13517 else if (return_label
!= NULL_RTX
13518 && current_function_return_value
== NULL_TREE
13519 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13520 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13522 if (flag_exceptions
)
13523 expand_exception_blocks ();
13525 /* If this function is supposed to return a value, ensure that
13526 we do not fall into the cleanups by mistake. The end of our
13527 function will look like this:
13529 user code (may have return stmt somewhere)
13530 goto no_return_label
13535 NOTE_INSN_FUNCTION_END
13539 If the user omits a return stmt in the USER CODE section, we
13540 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13541 Otherwise, we won't. */
13542 if (no_return_label
)
13544 DECL_CONTEXT (no_return_label
) = fndecl
;
13545 DECL_INITIAL (no_return_label
) = error_mark_node
;
13546 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13547 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13548 expand_goto (no_return_label
);
13553 /* Remove the binding contour which is used
13554 to catch cleanup-generated temporaries. */
13555 expand_end_bindings (0, 0, 0);
13556 poplevel (0, 0, 0);
13558 /* Emit label at beginning of cleanup code for parameters. */
13559 emit_label (cleanup_label
);
13562 /* Get return value into register if that's where it's supposed to be. */
13563 if (original_result_rtx
)
13564 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13566 /* Finish building code that will trigger warnings if users forget
13567 to make their functions return values. */
13568 if (no_return_label
|| cleanup_label
)
13569 emit_jump (return_label
);
13570 if (no_return_label
)
13572 /* We don't need to call `expand_*_return' here because we
13573 don't need any cleanups here--this path of code is only
13574 for error checking purposes. */
13575 expand_label (no_return_label
);
13578 /* Generate rtl for function exit. */
13579 expand_function_end (input_filename
, lineno
, 1);
13582 /* This must come after expand_function_end because cleanups might
13583 have declarations (from inline functions) that need to go into
13584 this function's blocks. */
13585 if (current_binding_level
->parm_flag
!= 1)
13586 my_friendly_abort (122);
13587 poplevel (1, 0, 1);
13589 /* Reset scope for C++: if we were in the scope of a class,
13590 then when we finish this function, we are not longer so.
13591 This cannot be done until we know for sure that no more
13592 class members will ever be referenced in this function
13593 (i.e., calls to destructors). */
13594 if (current_class_name
)
13596 ctype
= current_class_type
;
13597 pop_nested_class (1);
13600 /* Must mark the RESULT_DECL as being in this function. */
13601 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13603 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13604 to the FUNCTION_DECL node itself. */
13605 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13607 if (! processing_template_decl
)
13609 int saved_flag_keep_inline_functions
=
13610 flag_keep_inline_functions
;
13612 /* So we can tell if jump_optimize sets it to 1. */
13615 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13616 && hack_decl_function_context (fndecl
))
13617 /* Trick rest_of_compilation into not deferring output of this
13618 function, even if it is inline, since the rtl_obstack for
13619 this function is the function_obstack of the enclosing
13620 function and will be deallocated when the enclosing
13621 function is gone. See save_tree_status. */
13622 flag_keep_inline_functions
= 1;
13624 /* Run the optimizers and output the assembler code for this
13627 if (DECL_ARTIFICIAL (fndecl
))
13629 /* Do we really *want* to inline this synthesized method? */
13631 int save_fif
= flag_inline_functions
;
13632 flag_inline_functions
= 1;
13634 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13635 will check our size. */
13636 DECL_INLINE (fndecl
) = 0;
13638 rest_of_compilation (fndecl
);
13639 flag_inline_functions
= save_fif
;
13642 rest_of_compilation (fndecl
);
13644 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13646 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13648 /* Set DECL_EXTERNAL so that assemble_external will be called as
13649 necessary. We'll clear it again in finish_file. */
13650 if (! DECL_EXTERNAL (fndecl
))
13651 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13652 DECL_EXTERNAL (fndecl
) = 1;
13653 mark_inline_for_output (fndecl
);
13656 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13657 note_debug_info_needed (ctype
);
13659 current_function_returns_null
|= can_reach_end
;
13661 /* Since we don't normally go through c_expand_return for constructors,
13662 this normally gets the wrong value.
13663 Also, named return values have their return codes emitted after
13664 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13665 if (DECL_CONSTRUCTOR_P (fndecl
)
13666 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13667 current_function_returns_null
= 0;
13669 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
13670 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13671 else if ((warn_return_type
|| pedantic
)
13672 && current_function_returns_null
13673 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13675 /* If this function returns non-void and control can drop through,
13677 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13679 /* With just -W, complain only if function returns both with
13680 and without a value. */
13681 else if (extra_warnings
13682 && current_function_returns_value
&& current_function_returns_null
)
13683 warning ("this function may return with or without a value");
13688 /* Free all the tree nodes making up this function. */
13689 /* Switch back to allocating nodes permanently
13690 until we start another function. */
13691 if (processing_template_decl
)
13693 --minimal_parse_mode
;
13694 DECL_SAVED_TREE (fndecl
) = TREE_CHAIN (DECL_SAVED_TREE (fndecl
));
13698 permanent_allocation (1);
13700 if (DECL_SAVED_INSNS (fndecl
) == NULL_RTX
)
13704 /* Stop pointing to the local nodes about to be freed. */
13705 /* But DECL_INITIAL must remain nonzero so we know this
13706 was an actual function definition. */
13707 DECL_INITIAL (fndecl
) = error_mark_node
;
13708 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13709 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13712 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13713 static_ctors
= perm_tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13714 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13715 static_dtors
= perm_tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13719 /* Let the error reporting routines know that we're outside a
13720 function. For a nested function, this value is used in
13721 pop_cp_function_context and then reset via pop_function_context. */
13722 current_function_decl
= NULL_TREE
;
13725 named_label_uses
= NULL
;
13726 current_class_ptr
= NULL_TREE
;
13727 current_class_ref
= NULL_TREE
;
13730 /* Create the FUNCTION_DECL for a function definition.
13731 LINE1 is the line number that the definition absolutely begins on.
13732 LINE2 is the line number that the name of the function appears on.
13733 DECLSPECS and DECLARATOR are the parts of the declaration;
13734 they describe the return type and the name of the function,
13735 but twisted together in a fashion that parallels the syntax of C.
13737 This function creates a binding context for the function body
13738 as well as setting up the FUNCTION_DECL in current_function_decl.
13740 Returns a FUNCTION_DECL on success.
13742 If the DECLARATOR is not suitable for a function (it defines a datum
13743 instead), we return 0, which tells yyparse to report a parse error.
13745 May return void_type_node indicating that this method is actually
13746 a friend. See grokfield for more details.
13748 Came here with a `.pushlevel' .
13750 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13751 CHANGES TO CODE IN `grokfield'. */
13754 start_method (declspecs
, declarator
, attrlist
)
13755 tree declarator
, declspecs
, attrlist
;
13757 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13760 /* Something too ugly to handle. */
13761 if (fndecl
== NULL_TREE
)
13764 /* Pass friends other than inline friend functions back. */
13765 if (fndecl
== void_type_node
)
13768 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13769 /* Not a function, tell parser to report parse error. */
13772 if (IS_SIGNATURE (current_class_type
))
13773 IS_DEFAULT_IMPLEMENTATION (fndecl
) = 1;
13775 if (DECL_IN_AGGR_P (fndecl
))
13777 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13779 if (DECL_CONTEXT (fndecl
)
13780 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13781 cp_error ("`%D' is already defined in class %s", fndecl
,
13782 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13784 return void_type_node
;
13787 DECL_THIS_INLINE (fndecl
) = 1;
13789 if (flag_default_inline
)
13790 DECL_INLINE (fndecl
) = 1;
13792 /* We process method specializations in finish_struct_1. */
13793 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13794 fndecl
= push_template_decl (fndecl
);
13796 /* We read in the parameters on the maybepermanent_obstack,
13797 but we won't be getting back to them until after we
13798 may have clobbered them. So the call to preserve_data
13799 will keep them safe. */
13802 if (! DECL_FRIEND_P (fndecl
))
13804 if (TREE_CHAIN (fndecl
))
13806 fndecl
= copy_node (fndecl
);
13807 TREE_CHAIN (fndecl
) = NULL_TREE
;
13810 if (DECL_CONSTRUCTOR_P (fndecl
))
13812 if (! grok_ctor_properties (current_class_type
, fndecl
))
13813 return void_type_node
;
13815 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13816 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13819 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13821 /* Make a place for the parms */
13823 current_binding_level
->parm_flag
= 1;
13825 DECL_IN_AGGR_P (fndecl
) = 1;
13829 /* Go through the motions of finishing a function definition.
13830 We don't compile this method until after the whole class has
13833 FINISH_METHOD must return something that looks as though it
13834 came from GROKFIELD (since we are defining a method, after all).
13836 This is called after parsing the body of the function definition.
13837 STMTS is the chain of statements that makes up the function body.
13839 DECL is the ..._DECL that `start_method' provided. */
13842 finish_method (decl
)
13845 register tree fndecl
= decl
;
13848 register tree link
;
13850 if (decl
== void_type_node
)
13853 old_initial
= DECL_INITIAL (fndecl
);
13855 /* Undo the level for the parms (from start_method).
13856 This is like poplevel, but it causes nothing to be
13857 saved. Saving information here confuses symbol-table
13858 output routines. Besides, this information will
13859 be correctly output when this method is actually
13862 /* Clear out the meanings of the local variables of this level;
13863 also record in each decl which block it belongs to. */
13865 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13867 if (DECL_NAME (link
) != NULL_TREE
)
13868 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = 0;
13869 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13870 DECL_CONTEXT (link
) = NULL_TREE
;
13873 /* Restore all name-meanings of the outer levels
13874 that were shadowed by this level. */
13876 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
13877 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
13878 for (link
= current_binding_level
->class_shadowed
;
13879 link
; link
= TREE_CHAIN (link
))
13880 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
13881 for (link
= current_binding_level
->type_shadowed
;
13882 link
; link
= TREE_CHAIN (link
))
13883 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
13885 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13886 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13887 current_binding_level
->parm_flag
,
13888 current_binding_level
->keep
);
13890 poplevel (0, 0, 0);
13892 DECL_INITIAL (fndecl
) = old_initial
;
13894 /* We used to check if the context of FNDECL was different from
13895 current_class_type as another way to get inside here. This didn't work
13896 for String.cc in libg++. */
13897 if (DECL_FRIEND_P (fndecl
))
13899 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13900 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13901 decl
= void_type_node
;
13907 /* Called when a new struct TYPE is defined.
13908 If this structure or union completes the type of any previous
13909 variable declaration, lay it out and output its rtl. */
13912 hack_incomplete_structures (type
)
13917 if (current_binding_level
->incomplete
== NULL_TREE
)
13920 if (!type
) /* Don't do this for class templates. */
13923 for (list
= ¤t_binding_level
->incomplete
; *list
; )
13925 tree decl
= TREE_VALUE (*list
);
13926 if ((decl
&& TREE_TYPE (decl
) == type
)
13927 || (TREE_TYPE (decl
)
13928 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13929 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
13931 int toplevel
= toplevel_bindings_p ();
13932 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13933 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
13934 layout_type (TREE_TYPE (decl
));
13935 layout_decl (decl
, 0);
13936 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
13940 expand_decl (decl
);
13941 cleanup
= maybe_build_cleanup (decl
);
13942 expand_decl_init (decl
);
13943 if (! expand_decl_cleanup (decl
, cleanup
))
13944 cp_error ("parser lost in parsing declaration of `%D'",
13947 *list
= TREE_CHAIN (*list
);
13950 list
= &TREE_CHAIN (*list
);
13954 /* If DECL is of a type which needs a cleanup, build that cleanup here.
13955 See build_delete for information about AUTO_DELETE.
13957 Don't build these on the momentary obstack; they must live
13958 the life of the binding contour. */
13961 maybe_build_cleanup_1 (decl
, auto_delete
)
13962 tree decl
, auto_delete
;
13964 tree type
= TREE_TYPE (decl
);
13965 if (TYPE_NEEDS_DESTRUCTOR (type
))
13967 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
13970 if (TREE_CODE (decl
) != PARM_DECL
)
13971 temp
= suspend_momentary ();
13973 if (TREE_CODE (type
) == ARRAY_TYPE
)
13977 mark_addressable (decl
);
13978 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
13981 /* Optimize for space over speed here. */
13982 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
13983 || flag_expensive_optimizations
)
13984 flags
|= LOOKUP_NONVIRTUAL
;
13986 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
13988 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
13989 && ! TYPE_HAS_DESTRUCTOR (type
))
13990 rval
= build_compound_expr (expr_tree_cons (NULL_TREE
, rval
,
13991 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
13993 if (TREE_CODE (decl
) != PARM_DECL
)
13994 resume_momentary (temp
);
14001 /* If DECL is of a type which needs a cleanup, build that cleanup
14002 here. The cleanup does free the storage with a call to delete. */
14005 maybe_build_cleanup_and_delete (decl
)
14008 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14011 /* If DECL is of a type which needs a cleanup, build that cleanup
14012 here. The cleanup does not free the storage with a call a delete. */
14015 maybe_build_cleanup (decl
)
14018 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14021 /* Expand a C++ expression at the statement level.
14022 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14023 The C++ type checker should get all of these out when
14024 expressions are combined with other, type-providing, expressions,
14025 leaving only orphan expressions, such as:
14027 &class::bar; / / takes its address, but does nothing with it. */
14030 cplus_expand_expr_stmt (exp
)
14033 if (processing_template_decl
)
14035 add_tree (build_min_nt (EXPR_STMT
, exp
));
14039 /* Arrange for all temps to disappear. */
14040 expand_start_target_temps ();
14042 if (TREE_TYPE (exp
) == unknown_type_node
)
14044 if (TREE_CODE (exp
) == COMPONENT_REF
)
14045 error ("invalid reference to a member function name, did you forget the ()?");
14047 error ("address of overloaded function with no contextual type information");
14051 if (TREE_CODE (exp
) == FUNCTION_DECL
)
14053 cp_warning ("reference, not call, to function `%D'", exp
);
14054 warning ("at this point in file");
14058 /* We should do this eventually, but right now this causes regex.o from
14059 libg++ to miscompile, and tString to core dump. */
14060 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14063 /* Strip unused implicit INDIRECT_REFs of references. */
14064 if (TREE_CODE (exp
) == INDIRECT_REF
14065 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
14066 exp
= TREE_OPERAND (exp
, 0);
14068 /* If we don't do this, we end up down inside expand_expr
14069 trying to do TYPE_MODE on the ERROR_MARK, and really
14070 go outside the bounds of the type. */
14071 if (exp
!= error_mark_node
)
14072 expand_expr_stmt (break_out_cleanups (exp
));
14075 /* Clean up any pending cleanups. This happens when a function call
14076 returns a cleanup-needing value that nobody uses. */
14077 expand_end_target_temps ();
14080 /* When a stmt has been parsed, this function is called.
14082 Currently, this function only does something within a
14083 constructor's scope: if a stmt has just assigned to this,
14084 and we are in a derived class, we call `emit_base_init'. */
14089 extern struct nesting
*cond_stack
, *loop_stack
, *case_stack
;
14092 if (current_function_assigns_this
14093 || ! current_function_just_assigned_this
)
14095 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14097 /* Constructors must wait until we are out of control
14098 zones before calling base constructors. */
14099 if (cond_stack
|| loop_stack
|| case_stack
)
14101 expand_expr_stmt (base_init_expr
);
14102 check_base_init (current_class_type
);
14104 current_function_assigns_this
= 1;
14107 /* Change a static member function definition into a FUNCTION_TYPE, instead
14108 of the METHOD_TYPE that we create when it's originally parsed.
14110 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14111 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14112 other decls. Either pass the addresses of local variables or NULL. */
14115 revert_static_member_fn (decl
, fn
, argtypes
)
14116 tree
*decl
, *fn
, *argtypes
;
14119 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14120 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14122 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14123 != TYPE_UNQUALIFIED
)
14124 cp_error ("static member function `%#D' declared with type qualifiers",
14127 args
= TREE_CHAIN (args
);
14128 tmp
= build_function_type (TREE_TYPE (function
), args
);
14129 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14130 tmp
= build_exception_variant (tmp
,
14131 TYPE_RAISES_EXCEPTIONS (function
));
14132 TREE_TYPE (*decl
) = tmp
;
14133 if (DECL_ARGUMENTS (*decl
))
14134 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14135 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14143 id_in_current_class (id
)
14146 return !!purpose_member (id
, class_binding_level
->class_shadowed
);
14154 int just_assigned_this
;
14156 int temp_name_counter
;
14158 struct named_label_list
*named_label_uses
;
14159 tree shadowed_labels
;
14162 rtx last_dtor_insn
;
14163 rtx last_parm_cleanup_insn
;
14164 tree base_init_list
;
14165 tree member_init_list
;
14166 tree base_init_expr
;
14167 tree current_class_ptr
;
14168 tree current_class_ref
;
14170 struct cp_function
*next
;
14171 struct binding_level
*binding_level
;
14172 int static_labelno
;
14175 static struct cp_function
*cp_function_chain
;
14177 extern int temp_name_counter
;
14179 /* Save and reinitialize the variables
14180 used during compilation of a C++ function. */
14183 push_cp_function_context (context
)
14186 struct cp_function
*p
14187 = (struct cp_function
*) xmalloc (sizeof (struct cp_function
));
14189 push_function_context_to (context
);
14191 p
->next
= cp_function_chain
;
14192 cp_function_chain
= p
;
14194 p
->named_labels
= named_labels
;
14195 p
->named_label_uses
= named_label_uses
;
14196 p
->shadowed_labels
= shadowed_labels
;
14197 p
->returns_value
= current_function_returns_value
;
14198 p
->returns_null
= current_function_returns_null
;
14199 p
->binding_level
= current_binding_level
;
14200 p
->ctor_label
= ctor_label
;
14201 p
->dtor_label
= dtor_label
;
14202 p
->last_dtor_insn
= last_dtor_insn
;
14203 p
->last_parm_cleanup_insn
= last_parm_cleanup_insn
;
14204 p
->assigns_this
= current_function_assigns_this
;
14205 p
->just_assigned_this
= current_function_just_assigned_this
;
14206 p
->parms_stored
= current_function_parms_stored
;
14207 p
->result_rtx
= original_result_rtx
;
14208 p
->base_init_expr
= base_init_expr
;
14209 p
->temp_name_counter
= temp_name_counter
;
14210 p
->base_init_list
= current_base_init_list
;
14211 p
->member_init_list
= current_member_init_list
;
14212 p
->current_class_ptr
= current_class_ptr
;
14213 p
->current_class_ref
= current_class_ref
;
14214 p
->static_labelno
= static_labelno
;
14217 /* Restore the variables used during compilation of a C++ function. */
14220 pop_cp_function_context (context
)
14223 struct cp_function
*p
= cp_function_chain
;
14226 /* Bring back all the labels that were shadowed. */
14227 for (link
= shadowed_labels
; link
; link
= TREE_CHAIN (link
))
14228 if (DECL_NAME (TREE_VALUE (link
)) != 0)
14229 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link
)),
14230 TREE_VALUE (link
));
14232 pop_function_context_from (context
);
14234 cp_function_chain
= p
->next
;
14236 named_labels
= p
->named_labels
;
14237 named_label_uses
= p
->named_label_uses
;
14238 shadowed_labels
= p
->shadowed_labels
;
14239 current_function_returns_value
= p
->returns_value
;
14240 current_function_returns_null
= p
->returns_null
;
14241 current_binding_level
= p
->binding_level
;
14242 ctor_label
= p
->ctor_label
;
14243 dtor_label
= p
->dtor_label
;
14244 last_dtor_insn
= p
->last_dtor_insn
;
14245 last_parm_cleanup_insn
= p
->last_parm_cleanup_insn
;
14246 current_function_assigns_this
= p
->assigns_this
;
14247 current_function_just_assigned_this
= p
->just_assigned_this
;
14248 current_function_parms_stored
= p
->parms_stored
;
14249 original_result_rtx
= p
->result_rtx
;
14250 base_init_expr
= p
->base_init_expr
;
14251 temp_name_counter
= p
->temp_name_counter
;
14252 current_base_init_list
= p
->base_init_list
;
14253 current_member_init_list
= p
->member_init_list
;
14254 current_class_ptr
= p
->current_class_ptr
;
14255 current_class_ref
= p
->current_class_ref
;
14256 static_labelno
= p
->static_labelno
;
14264 return function_depth
!= 0;