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
, NULL_TREE
, 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
, NULL_TREE
, 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 /* Called when a declaration is seen that contains no names to declare.
6456 If its type is a reference to a structure, union or enum inherited
6457 from a containing scope, shadow that tag name for the current scope
6458 with a forward reference.
6459 If its type defines a new named structure or union
6460 or defines an enum, it is valid but we need not do anything here.
6461 Otherwise, it is an error.
6463 C++: may have to grok the declspecs to learn about static,
6464 complain for anonymous unions. */
6467 shadow_tag (declspecs
)
6471 tree ob_modifier
= NULL_TREE
;
6473 register enum tree_code code
, ok_code
= ERROR_MARK
;
6474 register tree t
= NULL_TREE
;
6476 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6478 register tree value
= TREE_VALUE (link
);
6480 code
= TREE_CODE (value
);
6481 if (IS_AGGR_TYPE_CODE (code
) || code
== ENUMERAL_TYPE
)
6483 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6485 maybe_process_partial_specialization (value
);
6491 else if (value
== ridpointers
[(int) RID_STATIC
]
6492 || value
== ridpointers
[(int) RID_EXTERN
]
6493 || value
== ridpointers
[(int) RID_AUTO
]
6494 || value
== ridpointers
[(int) RID_REGISTER
]
6495 || value
== ridpointers
[(int) RID_INLINE
]
6496 || value
== ridpointers
[(int) RID_VIRTUAL
]
6497 || value
== ridpointers
[(int) RID_EXPLICIT
])
6498 ob_modifier
= value
;
6501 /* This is where the variables in an anonymous union are
6502 declared. An anonymous union declaration looks like:
6504 because there is no declarator after the union, the parser
6505 sends that declaration here. */
6506 if (ok_code
== UNION_TYPE
6508 && ((TREE_CODE (TYPE_NAME (t
)) == IDENTIFIER_NODE
6509 && ANON_AGGRNAME_P (TYPE_NAME (t
)))
6510 || (TREE_CODE (TYPE_NAME (t
)) == TYPE_DECL
6511 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))))
6513 fixup_anonymous_union (t
);
6515 if (TYPE_FIELDS (t
))
6517 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6519 finish_anon_union (decl
);
6524 /* Anonymous unions are objects, that's why we only check for
6525 inappropriate specifiers in this branch. */
6529 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6530 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6531 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6532 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6533 cp_error ("`%D' can only be specified for constructors",
6536 cp_error ("`%D' can only be specified for objects and functions",
6541 cp_error ("abstract declarator used as declaration");
6542 else if (found_tag
> 1)
6543 pedwarn ("multiple types in one declaration");
6547 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6550 groktypename (typename
)
6553 if (TREE_CODE (typename
) != TREE_LIST
)
6555 return grokdeclarator (TREE_VALUE (typename
),
6556 TREE_PURPOSE (typename
),
6557 TYPENAME
, 0, NULL_TREE
);
6560 /* Decode a declarator in an ordinary declaration or data definition.
6561 This is called as soon as the type information and variable name
6562 have been parsed, before parsing the initializer if any.
6563 Here we create the ..._DECL node, fill in its type,
6564 and put it on the list of decls for the current context.
6565 The ..._DECL node is returned as the value.
6567 Exception: for arrays where the length is not specified,
6568 the type is left null, to be filled in by `cp_finish_decl'.
6570 Function definitions do not come here; they go to start_function
6571 instead. However, external and forward declarations of functions
6572 do go through here. Structure field declarations are done by
6573 grokfield and not through here. */
6575 /* Set this to zero to debug not using the temporary obstack
6576 to parse initializers. */
6577 int debug_temp_inits
= 1;
6580 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6581 tree declarator
, declspecs
;
6583 tree attributes
, prefix_attributes
;
6586 register tree type
, tem
;
6588 extern int have_extern_spec
;
6589 extern int used_extern_spec
;
6592 /* See code below that used this. */
6593 int init_written
= initialized
;
6596 /* This should only be done once on the top most decl. */
6597 if (have_extern_spec
&& !used_extern_spec
)
6599 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6601 used_extern_spec
= 1;
6604 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6606 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6609 type
= TREE_TYPE (decl
);
6611 /* Don't lose if destructors must be executed at file-level. */
6612 if (! processing_template_decl
&& TREE_STATIC (decl
)
6613 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6614 && !TREE_PERMANENT (decl
))
6616 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6617 decl
= copy_node (decl
);
6618 if (TREE_CODE (type
) == ARRAY_TYPE
)
6620 tree itype
= TYPE_DOMAIN (type
);
6621 if (itype
&& ! TREE_PERMANENT (itype
))
6623 itype
= build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype
)));
6624 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6625 TREE_TYPE (decl
) = type
;
6632 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6633 ? DECL_CLASS_CONTEXT (decl
)
6634 : DECL_CONTEXT (decl
);
6636 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6637 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6639 /* When parsing the initializer, lookup should use the object's
6641 push_decl_namespace (context
);
6644 /* We are only interested in class contexts, later. */
6645 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6646 context
= NULL_TREE
;
6649 /* Is it valid for this decl to have an initializer at all?
6650 If not, set INITIALIZED to zero, which will indirectly
6651 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6652 switch (TREE_CODE (decl
))
6655 /* typedef foo = bar means give foo the same type as bar.
6656 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6657 Any other case of an initialization in a TYPE_DECL is an error. */
6658 if (pedantic
|| list_length (declspecs
) > 1)
6660 cp_error ("typedef `%D' is initialized", decl
);
6666 cp_error ("function `%#D' is initialized like a variable", decl
);
6671 if (! processing_template_decl
)
6673 if (type
!= error_mark_node
)
6675 if (TYPE_SIZE (type
) != NULL_TREE
6676 && ! TREE_CONSTANT (TYPE_SIZE (type
)))
6679 ("variable-sized object `%D' may not be initialized",
6684 if (TREE_CODE (type
) == ARRAY_TYPE
6685 && TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6688 ("elements of array `%#D' have incomplete type", decl
);
6697 if (! toplevel_bindings_p ()
6698 && DECL_EXTERNAL (decl
))
6699 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6701 DECL_EXTERNAL (decl
) = 0;
6702 if (toplevel_bindings_p ())
6703 TREE_STATIC (decl
) = 1;
6705 /* Tell `pushdecl' this is an initialized decl
6706 even though we don't yet have the initializer expression.
6707 Also tell `cp_finish_decl' it may store the real initializer. */
6708 DECL_INITIAL (decl
) = error_mark_node
;
6711 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6713 pushclass (context
, 2);
6715 if (TREE_CODE (decl
) == VAR_DECL
)
6717 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6718 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6719 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6722 if (DECL_CONTEXT (field
) != context
)
6724 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6725 DECL_CONTEXT (field
), DECL_NAME (decl
),
6726 context
, DECL_NAME (decl
));
6727 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6729 /* Static data member are tricky; an in-class initialization
6730 still doesn't provide a definition, so the in-class
6731 declaration will have DECL_EXTERNAL set, but will have an
6732 initialization. Thus, duplicate_decls won't warn
6733 about this situation, and so we check here. */
6734 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6735 cp_error ("duplicate initialization of %D", decl
);
6736 if (duplicate_decls (decl
, field
))
6742 tree field
= check_classfn (context
, decl
);
6743 if (field
&& duplicate_decls (decl
, field
))
6747 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6748 DECL_IN_AGGR_P (decl
) = 0;
6749 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6750 || CLASSTYPE_USE_TEMPLATE (context
))
6751 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6753 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6754 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6758 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6759 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6762 /* Set attributes here so if duplicate decl, will have proper attributes. */
6763 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6765 /* Add this decl to the current binding level, but not if it
6766 comes from another scope, e.g. a static member variable.
6767 TEM may equal DECL or it may be a previous decl of the same name. */
6769 if ((TREE_CODE (decl
) != PARM_DECL
&& DECL_CONTEXT (decl
) != NULL_TREE
6770 /* Definitions of namespace members outside their namespace are
6772 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
6773 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
6774 || TREE_CODE (type
) == LANG_TYPE
6775 /* The declaration of template specializations does not affect
6776 the functions available for overload resolution, so we do not
6778 || (TREE_CODE (decl
) == FUNCTION_DECL
6779 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
6782 tem
= pushdecl (decl
);
6784 if (processing_template_decl
)
6786 if (! current_function_decl
)
6787 tem
= push_template_decl (tem
);
6788 else if (minimal_parse_mode
)
6790 = build_min_nt (DECL_STMT
, copy_to_permanent (declarator
),
6791 copy_to_permanent (declspecs
),
6796 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6797 /* Tell the back-end to use or not use .common as appropriate. If we say
6798 -fconserve-space, we want this to save .data space, at the expense of
6799 wrong semantics. If we say -fno-conserve-space, we want this to
6800 produce errors about redefs; to do this we force variables into the
6802 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6805 if (! processing_template_decl
)
6808 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6809 push_obstacks_nochange ();
6812 /* We have no way of knowing whether the initializer will need to be
6813 evaluated at run-time or not until we've parsed it, so let's just put
6814 it in the permanent obstack. (jason) */
6816 && ! (TREE_CODE (tem
) == PARM_DECL
6817 || (TREE_READONLY (tem
)
6818 && (TREE_CODE (tem
) == VAR_DECL
6819 || TREE_CODE (tem
) == FIELD_DECL
))))
6821 /* When parsing and digesting the initializer,
6822 use temporary storage. Do this even if we will ignore the value. */
6823 if (toplevel_bindings_p () && debug_temp_inits
)
6825 if (processing_template_decl
6826 || TYPE_NEEDS_CONSTRUCTING (type
)
6827 || TREE_CODE (type
) == REFERENCE_TYPE
)
6828 /* In this case, the initializer must lay down in permanent
6829 storage, since it will be saved until `finish_file' is run. */
6832 temporary_allocation ();
6844 tree type
= TREE_TYPE (decl
);
6845 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6847 /* If this type of object needs a cleanup, and control may
6848 jump past it, make a new binding level so that it is cleaned
6849 up only when it is initialized first. */
6850 if (TYPE_NEEDS_DESTRUCTOR (type
)
6851 && current_binding_level
->more_cleanups_ok
== 0)
6852 pushlevel_temporary (1);
6855 /* Is it valid for this decl to have an initializer at all?
6856 If not, set INITIALIZED to zero, which will indirectly
6857 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6859 /* Don't allow initializations for incomplete types except for
6860 arrays which might be completed by the initialization. */
6861 if (type
== error_mark_node
)
6862 ; /* Don't complain again. */
6863 else if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6864 ; /* A complete type is ok. */
6865 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6867 cp_error ("variable `%#D' has initializer but incomplete type",
6870 type
= TREE_TYPE (decl
) = error_mark_node
;
6872 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6874 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6875 cp_error ("elements of array `%#D' have incomplete type", decl
);
6876 /* else we already gave an error in start_decl. */
6882 && TREE_CODE (decl
) != TYPE_DECL
6883 && TREE_CODE (decl
) != TEMPLATE_DECL
6884 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6886 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6887 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6889 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6891 /* Change the type so that assemble_variable will give
6892 DECL an rtl we can live with: (mem (const_int 0)). */
6893 type
= TREE_TYPE (decl
) = error_mark_node
;
6897 /* If any base type in the hierarchy of TYPE needs a constructor,
6898 then we set initialized to 1. This way any nodes which are
6899 created for the purposes of initializing this aggregate
6900 will live as long as it does. This is necessary for global
6901 aggregates which do not have their initializers processed until
6902 the end of the file. */
6903 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6908 /* We don't do this yet for GNU C++. */
6909 /* For a local variable, define the RTL now. */
6910 if (! toplevel_bindings_p ()
6911 /* But not if this is a duplicate decl
6912 and we preserved the rtl from the previous one
6913 (which may or may not happen). */
6914 && DECL_RTL (tem
) == NULL_RTX
)
6916 if (TYPE_SIZE (TREE_TYPE (tem
)) != NULL_TREE
)
6918 else if (TREE_CODE (TREE_TYPE (tem
)) == ARRAY_TYPE
6919 && DECL_INITIAL (tem
) != NULL_TREE
)
6925 DECL_INITIAL (decl
) = NULL_TREE
;
6928 /* Handle initialization of references.
6929 These three arguments are from `cp_finish_decl', and have the
6930 same meaning here that they do there.
6932 Quotes on semantics can be found in ARM 8.4.3. */
6935 grok_reference_init (decl
, type
, init
)
6936 tree decl
, type
, init
;
6940 if (init
== NULL_TREE
)
6942 if ((DECL_LANG_SPECIFIC (decl
) == 0
6943 || DECL_IN_AGGR_P (decl
) == 0)
6944 && ! DECL_THIS_EXTERN (decl
))
6946 cp_error ("`%D' declared as reference but not initialized", decl
);
6947 if (TREE_CODE (decl
) == VAR_DECL
)
6948 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
6953 if (init
== error_mark_node
)
6956 if (TREE_CODE (type
) == REFERENCE_TYPE
6957 && TREE_CODE (init
) == CONSTRUCTOR
)
6959 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6963 if (TREE_CODE (init
) == TREE_LIST
)
6964 init
= build_compound_expr (init
);
6966 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6967 init
= convert_from_reference (init
);
6969 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6970 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6972 /* Note: default conversion is only called in very special cases. */
6973 init
= default_conversion (init
);
6976 tmp
= convert_to_reference
6977 (type
, init
, CONV_IMPLICIT
,
6978 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6980 if (tmp
== error_mark_node
)
6982 else if (tmp
!= NULL_TREE
)
6985 DECL_INITIAL (decl
) = save_expr (init
);
6989 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
6993 /* ?? Can this be optimized in some cases to
6994 hand back the DECL_INITIAL slot?? */
6995 if (TYPE_SIZE (TREE_TYPE (type
)))
6997 init
= convert_from_reference (decl
);
6998 if (TREE_PERMANENT (decl
))
6999 init
= copy_to_permanent (init
);
7000 SET_DECL_REFERENCE_SLOT (decl
, init
);
7003 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7005 expand_static_init (decl
, DECL_INITIAL (decl
));
7006 DECL_INITIAL (decl
) = NULL_TREE
;
7011 if (TREE_CODE (decl
) == VAR_DECL
)
7012 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7016 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7017 mucking with forces it does not comprehend (i.e. initialization with a
7018 constructor). If we are at global scope and won't go into COMMON, fill
7019 it in with a dummy CONSTRUCTOR to force the variable into .data;
7020 otherwise we can use error_mark_node. */
7023 obscure_complex_init (decl
, init
)
7026 if (! flag_no_inline
&& TREE_STATIC (decl
))
7028 if (extract_init (decl
, init
))
7032 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7033 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7034 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7038 DECL_INITIAL (decl
) = error_mark_node
;
7043 /* Issue an error message if DECL is an uninitialized const variable. */
7046 check_for_uninitialized_const_var (decl
)
7049 tree type
= TREE_TYPE (decl
);
7051 /* ``Unless explicitly declared extern, a const object does not have
7052 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7054 if (TREE_CODE (decl
) == VAR_DECL
7055 && TREE_CODE (type
) != REFERENCE_TYPE
7056 && CP_TYPE_CONST_P (type
)
7057 && !TYPE_NEEDS_CONSTRUCTING (type
)
7058 && !DECL_INITIAL (decl
))
7059 cp_error ("uninitialized const `%D'", decl
);
7062 /* Finish processing of a declaration;
7063 install its line number and initial value.
7064 If the length of an array type is not known before,
7065 it must be determined now, from the initial value, or it is an error.
7067 Call `pop_obstacks' iff NEED_POP is nonzero.
7069 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7070 for aggregates that have constructors alive on the permanent obstack,
7071 so that the global initializing functions can be written at the end.
7073 INIT0 holds the value of an initializer that should be allowed to escape
7076 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7077 if the (init) syntax was used.
7079 For functions that take default parameters, DECL points to its
7080 "maximal" instantiation. `cp_finish_decl' must then also declared its
7081 subsequently lower and lower forms of instantiation, checking for
7082 ambiguity as it goes. This can be sped up later. */
7085 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7092 tree cleanup
= NULL_TREE
, ttype
= NULL_TREE
;
7094 int temporary
= allocation_temporary_p ();
7095 char *asmspec
= NULL
;
7096 int was_readonly
= 0;
7097 int already_used
= 0;
7099 /* If this is 0, then we did not change obstacks. */
7103 error ("assignment (not initialization) in declaration");
7107 /* If a name was specified, get the string. */
7109 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7111 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7113 cp_error ("Cannot initialize `%D' to namespace `%D'",
7118 if (current_class_type
7119 && DECL_REAL_CONTEXT (decl
) == current_class_type
7120 && TYPE_BEING_DEFINED (current_class_type
)
7121 && (DECL_INITIAL (decl
) || init
))
7122 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7124 if (TREE_CODE (decl
) == VAR_DECL
7125 && DECL_CONTEXT (decl
)
7126 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7127 && DECL_CONTEXT (decl
) != current_namespace
7130 /* Leave the namespace of the object. */
7131 pop_decl_namespace ();
7134 /* If the type of the thing we are declaring either has
7135 a constructor, or has a virtual function table pointer,
7136 AND its initialization was accepted by `start_decl',
7137 then we stayed on the permanent obstack through the
7138 declaration, otherwise, changed obstacks as GCC would. */
7140 type
= TREE_TYPE (decl
);
7142 if (type
== error_mark_node
)
7144 if (toplevel_bindings_p () && temporary
)
7145 end_temporary_allocation ();
7150 if (processing_template_decl
)
7152 if (init
&& DECL_INITIAL (decl
))
7153 DECL_INITIAL (decl
) = init
;
7154 if (minimal_parse_mode
&& ! DECL_ARTIFICIAL (decl
))
7156 tree stmt
= DECL_VINDEX (decl
);
7157 /* If the decl is declaring a member of a local class (in a
7158 template function), the DECL_VINDEX will either be NULL,
7159 or it will be an actual virtual function index, not a
7161 if (stmt
!= NULL_TREE
&& TREE_CODE (stmt
) == DECL_STMT
)
7163 DECL_VINDEX (decl
) = NULL_TREE
;
7164 TREE_OPERAND (stmt
, 2) = copy_to_permanent (init
);
7171 /* Take care of TYPE_DECLs up front. */
7172 if (TREE_CODE (decl
) == TYPE_DECL
)
7174 if (init
&& DECL_INITIAL (decl
))
7176 /* typedef foo = bar; store the type of bar as the type of foo. */
7177 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7178 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7180 if (type
!= error_mark_node
7181 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7183 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7184 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7185 set_identifier_type_value (DECL_NAME (decl
), type
);
7186 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7188 GNU_xref_decl (current_function_decl
, decl
);
7190 /* If we have installed this as the canonical typedef for this
7191 type, and that type has not been defined yet, delay emitting
7192 the debug information for it, as we will emit it later. */
7193 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7194 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7195 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7197 rest_of_decl_compilation (decl
, NULL_PTR
,
7198 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7201 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7203 ttype
= target_type (type
);
7206 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7207 && TYPE_NEEDS_CONSTRUCTING (type
))
7210 /* Currently, GNU C++ puts constants in text space, making them
7211 impossible to initialize. In the future, one would hope for
7212 an operating system which understood the difference between
7213 initialization and the running of a program. */
7215 TREE_READONLY (decl
) = 0;
7218 if (TREE_CODE (decl
) == FIELD_DECL
)
7220 if (init
&& init
!= error_mark_node
)
7221 my_friendly_assert (TREE_PERMANENT (init
), 147);
7225 /* This must override the asm specifier which was placed
7226 by grokclassfn. Lay this out fresh. */
7227 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7228 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7229 make_decl_rtl (decl
, asmspec
, 0);
7232 /* If `start_decl' didn't like having an initialization, ignore it now. */
7233 else if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7235 else if (DECL_EXTERNAL (decl
))
7237 else if (TREE_CODE (type
) == REFERENCE_TYPE
7238 || (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE_REFERENCE (type
)))
7240 if (TREE_STATIC (decl
))
7241 make_decl_rtl (decl
, NULL_PTR
,
7242 toplevel_bindings_p ()
7243 || pseudo_global_level_p ());
7244 grok_reference_init (decl
, type
, init
);
7248 GNU_xref_decl (current_function_decl
, decl
);
7250 if (TREE_CODE (decl
) == FIELD_DECL
)
7252 else if (TREE_CODE (decl
) == CONST_DECL
)
7254 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7256 DECL_INITIAL (decl
) = init
;
7258 /* This will keep us from needing to worry about our obstacks. */
7259 my_friendly_assert (init
!= NULL_TREE
, 149);
7264 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7266 if (TREE_CODE (type
) == ARRAY_TYPE
)
7267 init
= digest_init (type
, init
, (tree
*) 0);
7268 else if (TREE_CODE (init
) == CONSTRUCTOR
7269 && TREE_HAS_CONSTRUCTOR (init
))
7271 if (TYPE_NON_AGGREGATE_CLASS (type
))
7273 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7275 init
= error_mark_node
;
7278 goto dont_use_constructor
;
7283 dont_use_constructor
:
7284 if (TREE_CODE (init
) != TREE_VEC
)
7285 init
= store_init_value (decl
, init
);
7289 /* We must hide the initializer so that expand_decl
7290 won't try to do something it does not understand. */
7291 init
= obscure_complex_init (decl
, init
);
7293 else if (DECL_EXTERNAL (decl
))
7295 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7296 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7299 while (TREE_CODE (ctype
) == ARRAY_TYPE
)
7300 ctype
= TREE_TYPE (ctype
);
7301 if (! TYPE_NEEDS_CONSTRUCTING (ctype
))
7303 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (ctype
))
7304 cp_error ("structure `%D' with uninitialized const members", decl
);
7305 if (CLASSTYPE_REF_FIELDS_NEED_INIT (ctype
))
7306 cp_error ("structure `%D' with uninitialized reference members",
7310 check_for_uninitialized_const_var (decl
);
7312 if (TYPE_SIZE (type
) != NULL_TREE
7313 && TYPE_NEEDS_CONSTRUCTING (type
))
7314 init
= obscure_complex_init (decl
, NULL_TREE
);
7318 check_for_uninitialized_const_var (decl
);
7320 /* For top-level declaration, the initial value was read in
7321 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7322 must go in the permanent obstack; but don't discard the
7323 temporary data yet. */
7325 if (toplevel_bindings_p () && temporary
)
7326 end_temporary_allocation ();
7328 /* Deduce size of array from initialization, if not already known. */
7330 if (TREE_CODE (type
) == ARRAY_TYPE
7331 && TYPE_DOMAIN (type
) == NULL_TREE
7332 && TREE_CODE (decl
) != TYPE_DECL
)
7335 = (TREE_STATIC (decl
)
7336 /* Even if pedantic, an external linkage array
7337 may have incomplete type at first. */
7338 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7339 : !DECL_EXTERNAL (decl
));
7340 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7341 int failure
= complete_array_type (type
, initializer
, do_default
);
7344 cp_error ("initializer fails to determine size of `%D'", decl
);
7349 cp_error ("array size missing in `%D'", decl
);
7350 /* If a `static' var's size isn't known, make it extern as
7351 well as static, so it does not get allocated. If it's not
7352 `static', then don't mark it extern; finish_incomplete_decl
7353 will give it a default size and it will get allocated. */
7354 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7355 DECL_EXTERNAL (decl
) = 1;
7358 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7359 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7361 cp_error ("zero-size array `%D'", decl
);
7363 layout_decl (decl
, 0);
7366 if (TREE_CODE (decl
) == VAR_DECL
)
7368 if (DECL_SIZE (decl
) == NULL_TREE
7369 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7370 layout_decl (decl
, 0);
7372 if (TREE_STATIC (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7374 /* A static variable with an incomplete type:
7375 that is an error if it is initialized.
7376 Otherwise, let it through, but if it is not `extern'
7377 then it may cause an error message later. */
7378 if (DECL_INITIAL (decl
) != NULL_TREE
)
7379 cp_error ("storage size of `%D' isn't known", decl
);
7382 else if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7384 /* An automatic variable with an incomplete type: that is an error.
7385 Don't talk about array types here, since we took care of that
7386 message in grokdeclarator. */
7387 cp_error ("storage size of `%D' isn't known", decl
);
7388 TREE_TYPE (decl
) = error_mark_node
;
7390 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7391 /* Let debugger know it should output info for this type. */
7392 note_debug_info_needed (ttype
);
7394 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7395 note_debug_info_needed (DECL_CONTEXT (decl
));
7397 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7398 && DECL_SIZE (decl
) != NULL_TREE
7399 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7401 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7402 constant_expression_warning (DECL_SIZE (decl
));
7404 cp_error ("storage size of `%D' isn't constant", decl
);
7407 if (! DECL_EXTERNAL (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7408 /* Cleanups for static variables are handled by `finish_file'. */
7409 && ! TREE_STATIC (decl
))
7411 int yes
= suspend_momentary ();
7412 cleanup
= maybe_build_cleanup (decl
);
7413 resume_momentary (yes
);
7416 /* PARM_DECLs get cleanups, too. */
7417 else if (TREE_CODE (decl
) == PARM_DECL
&& TYPE_NEEDS_DESTRUCTOR (type
))
7420 end_temporary_allocation ();
7421 cleanup
= maybe_build_cleanup (decl
);
7423 resume_temporary_allocation ();
7426 /* Output the assembler code and/or RTL code for variables and functions,
7427 unless the type is an undefined structure or union.
7428 If not, it will get done when the type is completed. */
7430 was_incomplete
= (DECL_SIZE (decl
) == NULL_TREE
);
7432 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7433 || TREE_CODE (decl
) == RESULT_DECL
)
7435 /* ??? FIXME: What about nested classes? */
7436 int toplev
= toplevel_bindings_p () || pseudo_global_level_p ();
7438 = (TREE_STATIC (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7439 && allocation_temporary_p ());
7442 end_temporary_allocation ();
7444 /* Static data in a function with comdat linkage also has comdat
7446 if (TREE_CODE (decl
) == VAR_DECL
7447 && TREE_STATIC (decl
)
7448 /* Don't mess with __FUNCTION__. */
7449 && ! TREE_ASM_WRITTEN (decl
)
7450 && current_function_decl
7451 && DECL_CONTEXT (decl
) == current_function_decl
7452 && (DECL_THIS_INLINE (current_function_decl
)
7453 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7454 && TREE_PUBLIC (current_function_decl
))
7456 /* Rather than try to get this right with inlining, we suppress
7457 inlining of such functions. */
7458 current_function_cannot_inline
7459 = "function with static variable cannot be inline";
7461 /* If flag_weak, we don't need to mess with this, as we can just
7462 make the function weak, and let it refer to its unique local
7463 copy. This works because we don't allow the function to be
7467 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7469 TREE_PUBLIC (decl
) = 1;
7470 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7472 else if (DECL_INITIAL (decl
) == NULL_TREE
7473 || DECL_INITIAL (decl
) == error_mark_node
)
7475 TREE_PUBLIC (decl
) = 1;
7476 DECL_COMMON (decl
) = 1;
7478 /* else we lose. We can only do this if we can use common,
7479 which we can't if it has been initialized. */
7481 if (TREE_PUBLIC (decl
))
7482 DECL_ASSEMBLER_NAME (decl
)
7483 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7484 else if (! DECL_ARTIFICIAL (decl
))
7486 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7487 cp_warning_at (" you can work around this by removing the initializer"), decl
;
7492 else if (TREE_CODE (decl
) == VAR_DECL
7493 && DECL_LANG_SPECIFIC (decl
)
7494 && DECL_COMDAT (decl
))
7496 /* Dynamically initialized vars go into common. */
7497 if (DECL_INITIAL (decl
) == NULL_TREE
7498 || DECL_INITIAL (decl
) == error_mark_node
)
7499 DECL_COMMON (decl
) = 1;
7500 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7502 DECL_COMMON (decl
) = 1;
7503 DECL_INITIAL (decl
) = error_mark_node
;
7507 /* Statically initialized vars are weak or comdat, if
7510 make_decl_one_only (decl
);
7513 /* We can't do anything useful; leave vars for explicit
7515 DECL_EXTERNAL (decl
) = 1;
7516 DECL_NOT_REALLY_EXTERN (decl
) = 0;
7521 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7522 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7523 else if (TREE_CODE (decl
) == VAR_DECL
7524 && TREE_READONLY (decl
)
7525 && DECL_INITIAL (decl
) != NULL_TREE
7526 && DECL_INITIAL (decl
) != error_mark_node
7527 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7529 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7532 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7535 && TREE_STATIC (decl
)
7536 && ! TREE_SIDE_EFFECTS (decl
)
7537 && ! TREE_PUBLIC (decl
)
7538 && ! DECL_EXTERNAL (decl
)
7539 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7540 && DECL_MODE (decl
) != BLKmode
)
7542 /* If this variable is really a constant, then fill its DECL_RTL
7543 slot with something which won't take up storage.
7544 If something later should take its address, we can always give
7545 it legitimate RTL at that time. */
7546 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7547 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7548 TREE_ASM_WRITTEN (decl
) = 1;
7550 else if (toplev
&& ! TREE_PUBLIC (decl
))
7552 /* If this is a static const, change its apparent linkage
7553 if it belongs to a #pragma interface. */
7554 if (!interface_unknown
)
7556 TREE_PUBLIC (decl
) = 1;
7557 DECL_EXTERNAL (decl
) = interface_only
;
7559 make_decl_rtl (decl
, asmspec
, toplev
);
7562 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7564 else if (TREE_CODE (decl
) == VAR_DECL
7565 && DECL_LANG_SPECIFIC (decl
)
7566 && DECL_IN_AGGR_P (decl
))
7568 if (TREE_STATIC (decl
))
7570 if (init
== NULL_TREE
7571 #ifdef DEFAULT_STATIC_DEFS
7572 /* If this code is dead, then users must
7573 explicitly declare static member variables
7574 outside the class def'n as well. */
7575 && TYPE_NEEDS_CONSTRUCTING (type
)
7579 DECL_EXTERNAL (decl
) = 1;
7580 make_decl_rtl (decl
, asmspec
, 1);
7583 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7586 /* Just a constant field. Should not need any rtl. */
7590 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7593 resume_temporary_allocation ();
7595 if (type
!= error_mark_node
7596 && TYPE_LANG_SPECIFIC (type
)
7597 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
7598 abstract_virtuals_error (decl
, type
);
7599 else if ((TREE_CODE (type
) == FUNCTION_TYPE
7600 || TREE_CODE (type
) == METHOD_TYPE
)
7601 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
7602 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (type
)))
7603 abstract_virtuals_error (decl
, TREE_TYPE (type
));
7605 if (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE (type
))
7606 signature_error (decl
, type
);
7607 else if ((TREE_CODE (type
) == FUNCTION_TYPE
7608 || TREE_CODE (type
) == METHOD_TYPE
)
7609 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
7610 && IS_SIGNATURE (TREE_TYPE (type
)))
7611 signature_error (decl
, TREE_TYPE (type
));
7613 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7615 else if (DECL_EXTERNAL (decl
)
7616 && ! (DECL_LANG_SPECIFIC (decl
)
7617 && DECL_NOT_REALLY_EXTERN (decl
)))
7620 DECL_INITIAL (decl
) = init
;
7622 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7624 /* Cleanups for static variables are handled by `finish_file'. */
7625 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7626 || TYPE_NEEDS_DESTRUCTOR (type
))
7627 expand_static_init (decl
, init
);
7631 /* This is a declared decl which must live until the
7632 end of the binding contour. It may need a cleanup. */
7634 /* Recompute the RTL of a local array now
7635 if it used to be an incomplete type. */
7636 if (was_incomplete
&& ! TREE_STATIC (decl
))
7638 /* If we used it already as memory, it must stay in memory. */
7639 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7640 /* If it's still incomplete now, no init will save it. */
7641 if (DECL_SIZE (decl
) == NULL_TREE
)
7642 DECL_INITIAL (decl
) = NULL_TREE
;
7645 else if (! TREE_ASM_WRITTEN (decl
)
7646 && (TYPE_SIZE (type
) != NULL_TREE
7647 || TREE_CODE (type
) == ARRAY_TYPE
))
7649 /* Do this here, because we did not expand this decl's
7650 rtl in start_decl. */
7651 if (DECL_RTL (decl
) == NULL_RTX
)
7655 /* XXX: Why don't we use decl here? */
7656 /* Ans: Because it was already expanded? */
7657 if (! expand_decl_cleanup (NULL_TREE
, cleanup
))
7658 cp_error ("parser lost in parsing declaration of `%D'",
7660 /* Cleanup used up here. */
7661 cleanup
= NULL_TREE
;
7665 if (current_binding_level
->is_for_scope
)
7667 struct binding_level
*outer
= current_binding_level
->level_chain
;
7669 /* Check to see if the same name is already bound at
7670 the outer level, either because it was directly declared,
7671 or because a dead for-decl got preserved. In either case,
7672 the code would not have been valid under the ARM
7673 scope rules, so clear is_for_scope for the
7674 current_binding_level.
7676 Otherwise, we need to preserve the temp slot for decl
7677 to last into the outer binding level. */
7679 int handling_dead_for_vars
= 0;
7680 tree link
= outer
->names
;
7681 for (; ; link
= TREE_CHAIN (link
))
7683 if (link
== NULL
&& handling_dead_for_vars
== 0)
7685 link
= outer
->dead_vars_from_for
;
7686 handling_dead_for_vars
= 1;
7690 if (DECL_IN_MEMORY_P (decl
))
7691 preserve_temp_slots (DECL_RTL (decl
));
7694 if (DECL_NAME (link
) == DECL_NAME (decl
))
7696 if (handling_dead_for_vars
)
7699 = purpose_member (DECL_NAME (decl
),
7700 current_binding_level
->shadowed
);
7701 if (shadowing
&& TREE_VALUE (shadowing
) == link
)
7702 TREE_VALUE (shadowing
)
7703 = DECL_SHADOWED_FOR_VAR (link
);
7705 current_binding_level
->is_for_scope
= 0;
7711 expand_start_target_temps ();
7713 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7715 /* Compute and store the initial value. */
7716 expand_decl_init (decl
);
7717 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7719 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7721 emit_line_note (DECL_SOURCE_FILE (decl
),
7722 DECL_SOURCE_LINE (decl
));
7723 expand_aggr_init (decl
, init
, flags
);
7726 /* Set this to 0 so we can tell whether an aggregate which
7727 was initialized was ever used. Don't do this if it has a
7728 destructor, so we don't complain about the 'resource
7729 allocation is initialization' idiom. */
7730 /* Now set attribute((unused)) on types so decls of
7731 that type will be marked used. (see TREE_USED, above.)
7732 This avoids the warning problems this particular code
7733 tried to work around. */
7735 if (TYPE_NEEDS_CONSTRUCTING (type
)
7737 && cleanup
== NULL_TREE
7738 && DECL_NAME (decl
))
7739 TREE_USED (decl
) = 0;
7742 TREE_USED (decl
) = 1;
7745 /* Cleanup any temporaries needed for the initial value. */
7746 expand_end_target_temps ();
7748 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7750 /* Store the cleanup, if there was one. */
7753 if (! expand_decl_cleanup (decl
, cleanup
))
7754 cp_error ("parser lost in parsing declaration of `%D'",
7761 /* Undo call to `pushclass' that was done in `start_decl'
7762 due to initialization of qualified member variable.
7763 I.e., Foo::x = 10; */
7765 tree context
= DECL_REAL_CONTEXT (decl
);
7767 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7768 && (TREE_CODE (decl
) == VAR_DECL
7769 /* We also have a pushclass done that we need to undo here
7770 if we're at top level and declare a method. */
7771 || TREE_CODE (decl
) == FUNCTION_DECL
)
7772 /* If size hasn't been set, we're still defining it,
7773 and therefore inside the class body; don't pop
7774 the binding level.. */
7775 && TYPE_SIZE (context
) != NULL_TREE
7776 && context
== current_class_type
)
7783 /* If requested, warn about definitions of large data objects. */
7785 if (warn_larger_than
7786 && ! processing_template_decl
7787 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7788 && !DECL_EXTERNAL (decl
))
7790 register tree decl_size
= DECL_SIZE (decl
);
7792 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7794 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7796 if (units
> larger_than_size
)
7797 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7803 /* Resume permanent allocation, if not within a function. */
7804 /* The corresponding push_obstacks_nochange is in start_decl,
7805 start_method, groktypename, and in grokfield. */
7810 TREE_READONLY (decl
) = 1;
7813 /* This is here for a midend callback from c-common.c */
7816 finish_decl (decl
, init
, asmspec_tree
)
7820 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7824 expand_static_init (decl
, init
)
7828 tree oldstatic
= value_member (decl
, static_aggregates
);
7832 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7833 cp_error ("multiple initializations given for `%D'", decl
);
7835 else if (! toplevel_bindings_p () && ! pseudo_global_level_p ())
7837 /* Emit code to perform this initialization but once. */
7840 /* Remember this information until end of file. */
7841 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7843 /* Emit code to perform this initialization but once. */
7844 temp
= get_temp_name (integer_type_node
, 1);
7845 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7846 expand_start_cond (build_binary_op (EQ_EXPR
, temp
,
7847 integer_zero_node
, 1), 0);
7848 expand_start_target_temps ();
7850 expand_assignment (temp
, integer_one_node
, 0, 0);
7851 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
7852 || (init
&& TREE_CODE (init
) == TREE_LIST
))
7854 expand_aggr_init (decl
, init
, 0);
7855 do_pending_stack_adjust ();
7858 expand_assignment (decl
, init
, 0, 0);
7860 /* Cleanup any temporaries needed for the initial value. */
7861 expand_end_target_temps ();
7863 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7865 tree cleanup
, fcall
;
7866 static tree Atexit
= 0;
7869 tree atexit_fndecl
, PFV
, pfvlist
;
7870 /* Remember this information until end of file. */
7871 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7872 PFV
= build_pointer_type (build_function_type
7873 (void_type_node
, void_list_node
));
7875 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7877 push_lang_context (lang_name_c
);
7879 = builtin_function ("atexit",
7880 build_function_type (void_type_node
,
7882 NOT_BUILT_IN
, NULL_PTR
);
7883 assemble_external (atexit_fndecl
);
7884 Atexit
= default_conversion (atexit_fndecl
);
7885 pop_lang_context ();
7889 /* Call build_cleanup before we enter the anonymous function
7890 so that any access checks will be done relative to the
7891 current scope, rather than the scope of the anonymous
7893 fcall
= build_cleanup (decl
);
7894 cleanup
= start_anon_func ();
7895 expand_expr_stmt (fcall
);
7897 mark_addressable (cleanup
);
7898 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7899 fcall
= build_function_call (Atexit
, expr_tree_cons (NULL_TREE
, cleanup
, NULL_TREE
));
7900 expand_expr_stmt (fcall
);
7904 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7906 static_aggregates
= perm_tree_cons (temp
, decl
, static_aggregates
);
7907 TREE_STATIC (static_aggregates
) = 1;
7910 /* Resume old (possibly temporary) allocation. */
7915 /* This code takes into account memory allocation
7916 policy of `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING
7917 does not hold for this object, then we must make permanent
7918 the storage currently in the temporary obstack. */
7919 if (! TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
7920 preserve_initializer ();
7921 static_aggregates
= perm_tree_cons (init
, decl
, static_aggregates
);
7925 /* Make TYPE a complete type based on INITIAL_VALUE.
7926 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
7927 2 if there was no information (in which case assume 1 if DO_DEFAULT). */
7930 complete_array_type (type
, initial_value
, do_default
)
7931 tree type
, initial_value
;
7934 register tree maxindex
= NULL_TREE
;
7939 /* Note MAXINDEX is really the maximum index,
7940 one less than the size. */
7941 if (TREE_CODE (initial_value
) == STRING_CST
)
7944 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
7945 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
7948 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
7950 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
7951 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
7952 for (; elts
; elts
= TREE_CHAIN (elts
))
7954 if (TREE_PURPOSE (elts
))
7955 maxindex
= TREE_PURPOSE (elts
);
7957 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
7959 maxindex
= copy_node (maxindex
);
7963 /* Make an error message unless that happened already. */
7964 if (initial_value
!= error_mark_node
)
7967 /* Prevent further error messages. */
7968 maxindex
= build_int_2 (0, 0);
7975 maxindex
= build_int_2 (0, 0);
7983 TYPE_DOMAIN (type
) = build_index_type (maxindex
);
7984 if (! TREE_TYPE (maxindex
))
7985 TREE_TYPE (maxindex
) = TYPE_DOMAIN (type
);
7987 itype
= TREE_TYPE (initial_value
);
7990 if (itype
&& !TYPE_DOMAIN (itype
))
7991 TYPE_DOMAIN (itype
) = TYPE_DOMAIN (type
);
7992 /* The type of the main variant should never be used for arrays
7993 of different sizes. It should only ever be completed with the
7994 size of the array. */
7995 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
7996 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = TYPE_DOMAIN (type
);
7999 /* Lay out the type now that we can get the real answer. */
8006 /* Return zero if something is declared to be a member of type
8007 CTYPE when in the context of CUR_TYPE. STRING is the error
8008 message to print in that case. Otherwise, quietly return 1. */
8011 member_function_or_else (ctype
, cur_type
, string
)
8012 tree ctype
, cur_type
;
8015 if (ctype
&& ctype
!= cur_type
)
8017 error (string
, TYPE_NAME_STRING (ctype
));
8023 /* Subroutine of `grokdeclarator'. */
8025 /* Generate errors possibly applicable for a given set of specifiers.
8026 This is for ARM $7.1.2. */
8029 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8032 int virtualp
, quals
, friendp
, raises
, inlinep
;
8035 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8037 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8039 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8042 cp_error_at ("invalid friend declaration", object
);
8044 cp_error_at ("invalid exception specifications", object
);
8047 /* CTYPE is class type, or null if non-class.
8048 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8050 DECLARATOR is the function's name.
8051 VIRTUALP is truthvalue of whether the function is virtual or not.
8052 FLAGS are to be passed through to `grokclassfn'.
8053 QUALS are qualifiers indicating whether the function is `const'
8055 RAISES is a list of exceptions that this function can raise.
8056 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8057 not look, and -1 if we should not call `grokclassfn' at all.
8059 Returns `error_mark_node' if something goes wrong, after issuing
8060 applicable error messages. */
8063 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8064 raises
, attrlist
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8065 template_count
, in_namespace
)
8068 tree orig_declarator
;
8070 enum overload_flags flags
;
8071 tree quals
, raises
, attrlist
;
8072 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8076 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8080 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8081 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8087 type
= build_exception_variant (type
, raises
);
8090 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8091 /* Propagate volatile out from type to decl. */
8092 if (TYPE_VOLATILE (type
))
8093 TREE_THIS_VOLATILE (decl
) = 1;
8095 /* If this decl has namespace scope, set that up. */
8097 set_decl_namespace (decl
, in_namespace
);
8098 else if (publicp
&& ! ctype
)
8099 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8101 /* `main' and builtins have implicit 'C' linkage. */
8102 if ((MAIN_NAME_P (declarator
)
8103 || (IDENTIFIER_LENGTH (declarator
) > 10
8104 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8105 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8106 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8107 && current_lang_name
== lang_name_cplusplus
8108 && ctype
== NULL_TREE
8109 /* NULL_TREE means global namespace. */
8110 && DECL_CONTEXT (decl
) == NULL_TREE
)
8111 DECL_LANGUAGE (decl
) = lang_c
;
8113 /* Should probably propagate const out from type to decl I bet (mrs). */
8116 DECL_STATIC_FUNCTION_P (decl
) = 1;
8117 DECL_CONTEXT (decl
) = ctype
;
8121 DECL_CLASS_CONTEXT (decl
) = ctype
;
8123 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8125 if (processing_template_decl
)
8126 error ("cannot declare `main' to be a template");
8128 error ("cannot declare `main' to be inline");
8130 error ("cannot declare `main' to be static");
8135 /* Members of anonymous types and local classes have no linkage; make
8137 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8138 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8143 /* [basic.link]: A name with no linkage (notably, the name of a class
8144 or enumeration declared in a local scope) shall not be used to
8145 declare an entity with linkage.
8147 Only check this for public decls for now. */
8148 t
= no_linkage_check (TREE_TYPE (decl
));
8151 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8153 if (DECL_LANGUAGE (decl
) == lang_c
)
8154 /* Allow this; it's pretty common in C. */;
8156 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8160 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8165 TREE_PUBLIC (decl
) = publicp
;
8168 DECL_INTERFACE_KNOWN (decl
) = 1;
8169 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8173 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8175 DECL_EXTERNAL (decl
) = 1;
8176 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8178 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8179 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8183 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8184 grok_op_properties (decl
, virtualp
, check
< 0);
8186 if (ctype
&& hack_decl_function_context (decl
))
8187 DECL_NO_STATIC_CHAIN (decl
) = 1;
8189 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8190 if (TREE_PURPOSE (t
)
8191 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8193 add_defarg_fn (decl
);
8198 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8202 ("defining explicit specialization `%D' in friend declaration",
8206 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8208 /* Something like `template <class T> friend void f<T>()'. */
8209 cp_error ("template-id `%D' in declaration of primary template",
8211 return error_mark_node
;
8214 /* A friend declaration of the form friend void f<>(). Record
8215 the information in the TEMPLATE_ID_EXPR. */
8216 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8217 DECL_TEMPLATE_INFO (decl
)
8218 = perm_tree_cons (TREE_OPERAND (orig_declarator
, 0),
8219 TREE_OPERAND (orig_declarator
, 1),
8224 /* Plain overloading: will not be grok'd by grokclassfn. */
8225 if (! ctype
&& ! processing_template_decl
8226 && DECL_LANGUAGE (decl
) != lang_c
8227 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8228 set_mangled_name_for_decl (decl
);
8231 /* Make the init_value nonzero so pushdecl knows this is not
8232 tentative. error_mark_node is replaced later with the BLOCK. */
8233 DECL_INITIAL (decl
) = error_mark_node
;
8235 /* Caller will do the rest of this. */
8239 if (check
&& funcdef_flag
)
8240 DECL_INITIAL (decl
) = error_mark_node
;
8242 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8245 /* Just handle constructors here. We could do this
8246 inside the following if stmt, but I think
8247 that the code is more legible by breaking this
8248 case out. See comments below for what each of
8249 the following calls is supposed to do. */
8250 DECL_CONSTRUCTOR_P (decl
) = 1;
8252 grokclassfn (ctype
, decl
, flags
, quals
);
8254 decl
= check_explicit_specialization (orig_declarator
, decl
,
8256 2 * (funcdef_flag
!= 0) +
8257 4 * (friendp
!= 0));
8258 if (decl
== error_mark_node
)
8259 return error_mark_node
;
8261 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8264 tmp
= check_classfn (ctype
, decl
);
8266 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8267 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8269 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8270 cp_error ("definition of implicitly-declared `%D'", tmp
);
8271 if (tmp
&& duplicate_decls (decl
, tmp
))
8274 if (! grok_ctor_properties (ctype
, decl
))
8275 return error_mark_node
;
8281 /* Function gets the ugly name, field gets the nice one.
8282 This call may change the type of the function (because
8283 of default parameters)! */
8284 if (ctype
!= NULL_TREE
)
8285 grokclassfn (ctype
, decl
, flags
, quals
);
8287 decl
= check_explicit_specialization (orig_declarator
, decl
,
8289 2 * (funcdef_flag
!= 0) +
8290 4 * (friendp
!= 0));
8291 if (decl
== error_mark_node
)
8292 return error_mark_node
;
8294 if (ctype
!= NULL_TREE
8295 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8298 tmp
= check_classfn (ctype
, decl
);
8300 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8301 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8303 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8304 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8306 /* Remove the `this' parm added by grokclassfn.
8307 XXX Isn't this done in start_function, too? */
8308 revert_static_member_fn (&decl
, NULL
, NULL
);
8309 last_function_parms
= TREE_CHAIN (last_function_parms
);
8311 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8312 cp_error ("definition of implicitly-declared `%D'", tmp
);
8315 if (!duplicate_decls (decl
, tmp
))
8316 my_friendly_abort (892);
8321 if (ctype
== NULL_TREE
|| check
)
8325 cplus_decl_attributes (decl
, TREE_PURPOSE (attrlist
),
8326 TREE_VALUE (attrlist
));
8327 make_decl_rtl (decl
, NULL_PTR
, 1);
8331 DECL_VIRTUAL_P (decl
) = 1;
8332 if (DECL_VINDEX (decl
) == NULL_TREE
)
8333 DECL_VINDEX (decl
) = error_mark_node
;
8334 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8341 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8344 RID_BIT_TYPE
*specbits_in
;
8350 RID_BIT_TYPE specbits
;
8352 specbits
= *specbits_in
;
8354 if (TREE_CODE (type
) == OFFSET_TYPE
)
8356 /* If you declare a static member so that it
8357 can be initialized, the code will reach here. */
8358 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8359 type
= TREE_TYPE (type
);
8360 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
8361 DECL_CONTEXT (decl
) = basetype
;
8362 DECL_CLASS_CONTEXT (decl
) = basetype
;
8363 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8370 context
= in_namespace
;
8371 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8372 context
= current_namespace
;
8374 context
= NULL_TREE
;
8376 decl
= build_decl (VAR_DECL
, declarator
, complete_type (type
));
8379 set_decl_namespace (decl
, context
);
8381 context
= DECL_CONTEXT (decl
);
8382 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8383 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8387 set_decl_namespace (decl
, in_namespace
);
8389 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8391 DECL_THIS_EXTERN (decl
) = 1;
8392 DECL_EXTERNAL (decl
) = !initialized
;
8395 /* In class context, static means one per class,
8396 public access, and static storage. */
8397 if (DECL_CLASS_SCOPE_P (decl
))
8399 TREE_PUBLIC (decl
) = 1;
8400 TREE_STATIC (decl
) = 1;
8401 DECL_EXTERNAL (decl
) = 0;
8403 /* At top level, either `static' or no s.c. makes a definition
8404 (perhaps tentative), and absence of `static' makes it public. */
8405 else if (toplevel_bindings_p ())
8407 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8408 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8409 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8411 /* Not at top level, only `static' makes a static definition. */
8414 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8415 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8418 if (TREE_PUBLIC (decl
))
8420 /* [basic.link]: A name with no linkage (notably, the name of a class
8421 or enumeration declared in a local scope) shall not be used to
8422 declare an entity with linkage.
8424 Only check this for public decls for now. */
8425 tree t
= no_linkage_check (TREE_TYPE (decl
));
8428 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8429 /* Ignore for now; `enum { foo } e' is pretty common. */;
8431 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8439 /* Create a canonical pointer to member function type. */
8442 build_ptrmemfunc_type (type
)
8449 /* If a canonical type already exists for this type, use it. We use
8450 this method instead of type_hash_canon, because it only does a
8451 simple equality check on the list of field members. */
8453 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8456 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8458 u
= make_lang_type (UNION_TYPE
);
8459 SET_IS_AGGR_TYPE (u
, 0);
8460 fields
[0] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
, type
);
8461 fields
[1] = build_lang_field_decl (FIELD_DECL
, delta2_identifier
,
8463 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8464 TYPE_NAME (u
) = NULL_TREE
;
8466 t
= make_lang_type (RECORD_TYPE
);
8468 /* Let the front-end know this is a pointer to member function... */
8469 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8470 /* ... and not really an aggregate. */
8471 SET_IS_AGGR_TYPE (t
, 0);
8473 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
8475 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
8477 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8478 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8482 /* Zap out the name so that the back-end will give us the debugging
8483 information for this anonymous RECORD_TYPE. */
8484 TYPE_NAME (t
) = NULL_TREE
;
8486 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8488 /* Seems to be wanted. */
8489 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8493 /* Given declspecs and a declarator,
8494 determine the name and type of the object declared
8495 and construct a ..._DECL node for it.
8496 (In one case we can return a ..._TYPE node instead.
8497 For invalid input we sometimes return 0.)
8499 DECLSPECS is a chain of tree_list nodes whose value fields
8500 are the storage classes and type specifiers.
8502 DECL_CONTEXT says which syntactic context this declaration is in:
8503 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8504 FUNCDEF for a function definition. Like NORMAL but a few different
8505 error messages in each case. Return value may be zero meaning
8506 this definition is too screwy to try to parse.
8507 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8508 handle member functions (which have FIELD context).
8509 Return value may be zero meaning this definition is too screwy to
8511 PARM for a parameter declaration (either within a function prototype
8512 or before a function body). Make a PARM_DECL, or return void_type_node.
8513 CATCHPARM for a parameter declaration before a catch clause.
8514 TYPENAME if for a typename (in a cast or sizeof).
8515 Don't make a DECL node; just return the ..._TYPE node.
8516 FIELD for a struct or union field; make a FIELD_DECL.
8517 BITFIELD for a field with specified width.
8518 INITIALIZED is 1 if the decl has an initializer.
8520 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8521 It may also be so in the PARM case, for a prototype where the
8522 argument type is specified but not the name.
8524 This function is where the complicated C meanings of `static'
8525 and `extern' are interpreted.
8527 For C++, if there is any monkey business to do, the function which
8528 calls this one must do it, i.e., prepending instance variables,
8529 renaming overloaded function names, etc.
8531 Note that for this C++, it is an error to define a method within a class
8532 which does not belong to that class.
8534 Except in the case where SCOPE_REFs are implicitly known (such as
8535 methods within a class being redundantly qualified),
8536 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8537 (class_name::decl_name). The caller must also deal with this.
8539 If a constructor or destructor is seen, and the context is FIELD,
8540 then the type gains the attribute TREE_HAS_x. If such a declaration
8541 is erroneous, NULL_TREE is returned.
8543 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8544 function, these are the qualifiers to give to the `this' pointer.
8546 May return void_type_node if the declarator turned out to be a friend.
8547 See grokfield for details. */
8549 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8551 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8552 Check to see that the definition is valid. Issue appropriate error
8553 messages. Return 1 if the definition is particularly bad, or 0
8557 check_static_variable_definition (decl
, type
)
8561 /* Motion 10 at San Diego: If a static const integral data member is
8562 initialized with an integral constant expression, the initializer
8563 may appear either in the declaration (within the class), or in
8564 the definition, but not both. If it appears in the class, the
8565 member is a member constant. The file-scope definition is always
8567 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8569 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8571 /* If we just return the declaration, crashes will sometimes
8572 occur. We therefore return void_type_node, as if this was a
8573 friend declaration, to cause callers to completely ignore
8574 this declaration. */
8577 else if (!CP_TYPE_CONST_P (type
))
8578 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8580 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8581 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8587 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8590 enum decl_context decl_context
;
8594 RID_BIT_TYPE specbits
;
8597 tree type
= NULL_TREE
;
8603 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8604 int explicit_int
= 0;
8605 int explicit_char
= 0;
8606 int defaulted_int
= 0;
8607 int opaque_typedef
= 0;
8608 tree typedef_decl
= NULL_TREE
;
8610 tree typedef_type
= NULL_TREE
;
8611 int funcdef_flag
= 0;
8612 enum tree_code innermost_code
= ERROR_MARK
;
8615 /* See the code below that used this. */
8616 tree decl_machine_attr
= NULL_TREE
;
8618 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8619 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8620 tree init
= NULL_TREE
;
8622 /* Keep track of what sort of function is being processed
8623 so that we can warn about default return values, or explicit
8624 return values which do not match prescribed defaults. */
8625 enum return_types return_type
= return_normal
;
8627 tree dname
= NULL_TREE
;
8628 tree ctype
= current_class_type
;
8629 tree ctor_return_type
= NULL_TREE
;
8630 enum overload_flags flags
= NO_SPECIAL
;
8631 tree quals
= NULL_TREE
;
8632 tree raises
= NULL_TREE
;
8633 int template_count
= 0;
8634 tree in_namespace
= NULL_TREE
;
8638 RIDBIT_RESET_ALL (specbits
);
8639 if (decl_context
== FUNCDEF
)
8640 funcdef_flag
= 1, decl_context
= NORMAL
;
8641 else if (decl_context
== MEMFUNCDEF
)
8642 funcdef_flag
= -1, decl_context
= FIELD
;
8643 else if (decl_context
== BITFIELD
)
8644 bitfield
= 1, decl_context
= FIELD
;
8646 /* Look inside a declarator for the name being declared
8647 and get it as a string, for an error message. */
8649 tree
*next
= &declarator
;
8653 while (next
&& *next
)
8656 switch (TREE_CODE (decl
))
8659 /* For attributes. */
8660 next
= &TREE_VALUE (decl
);
8665 next
= &TREE_OPERAND (decl
, 0);
8668 case BIT_NOT_EXPR
: /* For C++ destructors! */
8670 tree name
= TREE_OPERAND (decl
, 0);
8671 tree rename
= NULL_TREE
;
8673 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8675 return_type
= return_dtor
;
8676 if (TREE_CODE (name
) == TYPE_DECL
)
8677 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8678 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8679 if (ctype
== NULL_TREE
)
8681 if (current_class_type
== NULL_TREE
)
8683 error ("destructors must be member functions");
8688 tree t
= constructor_name (current_class_name
);
8695 tree t
= constructor_name (ctype
);
8702 cp_error ("destructor `%T' must match class name `%T'",
8704 TREE_OPERAND (decl
, 0) = rename
;
8710 case ADDR_EXPR
: /* C++ reference declaration */
8715 innermost_code
= TREE_CODE (decl
);
8716 next
= &TREE_OPERAND (decl
, 0);
8720 if (parmlist_is_exprlist (TREE_OPERAND (decl
, 1)))
8722 /* This is actually a variable declaration using constructor
8723 syntax. We need to call start_decl and cp_finish_decl so we
8724 can get the variable initialized... */
8726 *next
= TREE_OPERAND (decl
, 0);
8727 init
= TREE_OPERAND (decl
, 1);
8729 decl
= start_decl (declarator
, declspecs
, 1, NULL_TREE
, NULL_TREE
);
8732 /* Look for __unused__ attribute */
8733 if (TREE_USED (TREE_TYPE (decl
)))
8734 TREE_USED (decl
) = 1;
8735 finish_decl (decl
, init
, NULL_TREE
);
8738 cp_error ("invalid declarator");
8741 innermost_code
= TREE_CODE (decl
);
8742 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8743 ctype
= current_class_type
;
8745 && TREE_OPERAND (decl
, 0)
8746 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8747 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8748 == constructor_name_full (ctype
))
8749 || (DECL_NAME (TREE_OPERAND (decl
, 0))
8750 == constructor_name (ctype
)))))
8751 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8752 next
= &TREE_OPERAND (decl
, 0);
8754 if (ctype
!= NULL_TREE
8755 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
8756 && decl
== constructor_name (ctype
))
8758 return_type
= return_ctor
;
8759 ctor_return_type
= ctype
;
8764 case TEMPLATE_ID_EXPR
:
8766 tree fns
= TREE_OPERAND (decl
, 0);
8768 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
8769 fns
= TREE_OPERAND (fns
, 0);
8771 if (TREE_CODE (fns
) == IDENTIFIER_NODE
)
8773 else if (is_overloaded_fn (fns
))
8774 dname
= DECL_NAME (get_first_fn (fns
));
8776 my_friendly_abort (0);
8780 case IDENTIFIER_NODE
:
8781 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
8788 cp_error ("declarator-id missing; using reserved word `%D'",
8790 name
= IDENTIFIER_POINTER (dname
);
8792 if (! IDENTIFIER_OPNAME_P (dname
)
8793 /* GNU/Linux headers use '__op'. Arrgh. */
8794 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
8795 name
= IDENTIFIER_POINTER (dname
);
8798 if (IDENTIFIER_TYPENAME_P (dname
))
8800 my_friendly_assert (flags
== NO_SPECIAL
, 154);
8801 flags
= TYPENAME_FLAG
;
8802 ctor_return_type
= TREE_TYPE (dname
);
8803 return_type
= return_conversion
;
8805 name
= operator_name_string (dname
);
8812 /* Perform error checking, and decide on a ctype. */
8813 tree cname
= TREE_OPERAND (decl
, 0);
8814 if (cname
== NULL_TREE
)
8816 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
8819 in_namespace
= TREE_OPERAND (decl
, 0);
8820 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8822 else if (! is_aggr_type (cname
, 1))
8823 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8824 /* Must test TREE_OPERAND (decl, 1), in case user gives
8825 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
8826 else if (TREE_OPERAND (decl
, 1)
8827 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
8829 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
8830 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
8832 cp_error ("`%T::%D' is not a valid declarator", cname
,
8833 TREE_OPERAND (decl
, 1));
8834 cp_error (" perhaps you want `typename %T::%D' to make it a type",
8835 cname
, TREE_OPERAND (decl
, 1));
8836 return void_type_node
;
8838 else if (ctype
== NULL_TREE
)
8840 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
8841 TREE_OPERAND (decl
, 0) = ctype
;
8844 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
8846 cp_error ("type `%T' is not derived from type `%T'",
8848 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8854 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
8855 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
8856 == constructor_name_full (ctype
))
8857 || (DECL_NAME (TREE_OPERAND (decl
, 1))
8858 == constructor_name (ctype
))))
8859 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
8860 next
= &TREE_OPERAND (decl
, 1);
8864 if (TREE_CODE (decl
) == IDENTIFIER_NODE
8865 && constructor_name (ctype
) == decl
)
8867 return_type
= return_ctor
;
8868 ctor_return_type
= ctype
;
8870 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
8871 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
8872 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
8873 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
8875 return_type
= return_dtor
;
8876 ctor_return_type
= ctype
;
8878 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8879 next
= &TREE_OPERAND (decl
, 0);
8890 /* Parse error puts this typespec where
8891 a declarator should go. */
8892 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
8893 if (TREE_TYPE (decl
) == current_class_type
)
8894 cp_error (" perhaps you want `%T' for a constructor",
8895 current_class_name
);
8896 dname
= DECL_NAME (decl
);
8897 name
= IDENTIFIER_POINTER (dname
);
8899 /* Avoid giving two errors for this. */
8900 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
8902 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
8909 cp_compiler_error ("`%D' as declarator", decl
);
8910 return 0; /* We used to do a 155 abort here. */
8917 /* A function definition's declarator must have the form of
8918 a function declarator. */
8920 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
8923 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
8924 && innermost_code
!= CALL_EXPR
8925 && ! (ctype
&& declspecs
== NULL_TREE
))
8927 cp_error ("declaration of `%D' as non-function", dname
);
8928 return void_type_node
;
8931 /* Anything declared one level down from the top level
8932 must be one of the parameters of a function
8933 (because the body is at least two levels down). */
8935 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
8936 by not allowing C++ class definitions to specify their parameters
8937 with xdecls (must be spec.d in the parmlist).
8939 Since we now wait to push a class scope until we are sure that
8940 we are in a legitimate method context, we must set oldcname
8941 explicitly (since current_class_name is not yet alive).
8943 We also want to avoid calling this a PARM if it is in a namespace. */
8945 if (decl_context
== NORMAL
&& ! namespace_bindings_p ()
8946 && ! pseudo_global_level_p ())
8948 struct binding_level
*b
= current_binding_level
;
8949 current_binding_level
= b
->level_chain
;
8950 if (current_binding_level
!= 0 && toplevel_bindings_p ())
8951 decl_context
= PARM
;
8952 current_binding_level
= b
;
8955 /* Look through the decl specs and record which ones appear.
8956 Some typespecs are defined as built-in typenames.
8957 Others, the ones that are modifiers of other types,
8958 are represented by bits in SPECBITS: set the bits for
8959 the modifiers that appear. Storage class keywords are also in SPECBITS.
8961 If there is a typedef name or a type, store the type in TYPE.
8962 This includes builtin typedefs such as `int'.
8964 Set EXPLICIT_INT if the type is `int' or `char' and did not
8965 come from a user typedef.
8967 Set LONGLONG if `long' is mentioned twice.
8969 For C++, constructors and destructors have their own fast treatment. */
8971 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
8976 /* Certain parse errors slip through. For example,
8977 `int class;' is not caught by the parser. Try
8978 weakly to recover here. */
8979 if (TREE_CODE (spec
) != TREE_LIST
)
8982 id
= TREE_VALUE (spec
);
8984 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
8986 if (id
== ridpointers
[(int) RID_INT
]
8987 || id
== ridpointers
[(int) RID_CHAR
]
8988 || id
== ridpointers
[(int) RID_BOOL
]
8989 || id
== ridpointers
[(int) RID_WCHAR
])
8993 if (id
== ridpointers
[(int) RID_BOOL
])
8994 error ("`bool' is now a keyword");
8996 cp_error ("extraneous `%T' ignored", id
);
9000 if (id
== ridpointers
[(int) RID_INT
])
9002 else if (id
== ridpointers
[(int) RID_CHAR
])
9004 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9008 /* C++ aggregate types. */
9009 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9012 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9014 type
= IDENTIFIER_TYPE_VALUE (id
);
9018 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9020 if (ridpointers
[i
] == id
)
9022 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9024 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9025 pedwarn ("ANSI C++ does not support `long long'");
9027 error ("`long long long' is too long for GCC");
9031 else if (RIDBIT_SETP (i
, specbits
))
9032 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9033 RIDBIT_SET (i
, specbits
);
9038 /* C++ aggregate types. */
9039 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9042 cp_error ("multiple declarations `%T' and `%T'", type
,
9046 type
= TREE_TYPE (id
);
9047 TREE_VALUE (spec
) = type
;
9052 error ("two or more data types in declaration of `%s'", name
);
9053 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9055 register tree t
= lookup_name (id
, 1);
9056 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9057 error ("`%s' fails to be a typedef or built in type",
9058 IDENTIFIER_POINTER (id
));
9061 type
= TREE_TYPE (t
);
9063 /* See the code below that used this. */
9064 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9069 else if (id
!= error_mark_node
)
9070 /* Can't change CLASS nodes into RECORD nodes here! */
9076 typedef_type
= type
;
9078 /* No type at all: default to `int', and set DEFAULTED_INT
9079 because it was not a user-defined typedef.
9080 Except when we have a `typedef' inside a signature, in
9081 which case the type defaults to `unknown type' and is
9082 instantiated when assigning to a signature pointer or ref. */
9084 if (type
== NULL_TREE
9085 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9086 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9087 || RIDBIT_SETP (RID_LONG
, specbits
)
9088 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9090 /* These imply 'int'. */
9091 type
= integer_type_node
;
9095 if (type
== NULL_TREE
)
9098 if (return_type
== return_dtor
)
9099 type
= void_type_node
;
9100 else if (return_type
== return_ctor
)
9101 type
= build_pointer_type (ctor_return_type
);
9102 else if (return_type
== return_conversion
)
9103 type
= ctor_return_type
;
9104 else if (current_class_type
9105 && IS_SIGNATURE (current_class_type
)
9106 && RIDBIT_SETP (RID_TYPEDEF
, specbits
)
9107 && (decl_context
== FIELD
|| decl_context
== NORMAL
))
9111 type
= copy_node (opaque_type_node
);
9115 if (! pedantic
&& ! warn_return_type
9117 && MAIN_NAME_P (dname
)
9118 && ctype
== NULL_TREE
9119 && in_namespace
== NULL_TREE
9120 && current_namespace
== global_namespace
)
9121 /* Let `main () { }' slide, since it's so common. */;
9123 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9125 type
= integer_type_node
;
9128 else if (return_type
== return_dtor
)
9130 error ("return type specification for destructor invalid");
9131 type
= void_type_node
;
9133 else if (return_type
== return_ctor
)
9135 error ("return type specification for constructor invalid");
9136 type
= build_pointer_type (ctor_return_type
);
9138 else if (return_type
== return_conversion
)
9140 if (!same_type_p (type
, ctor_return_type
))
9141 cp_error ("operator `%T' declared to return `%T'",
9142 ctor_return_type
, type
);
9144 cp_pedwarn ("return type specified for `operator %T'",
9147 type
= ctor_return_type
;
9152 /* Now process the modifiers that were specified
9153 and check for invalid combinations. */
9155 /* Long double is a special combination. */
9157 if (RIDBIT_SETP (RID_LONG
, specbits
)
9158 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9160 RIDBIT_RESET (RID_LONG
, specbits
);
9161 type
= build_qualified_type (long_double_type_node
,
9162 CP_TYPE_QUALS (type
));
9165 /* Check all other uses of type modifiers. */
9167 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9168 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9169 || RIDBIT_SETP (RID_LONG
, specbits
)
9170 || RIDBIT_SETP (RID_SHORT
, specbits
))
9174 if (TREE_CODE (type
) == REAL_TYPE
)
9175 error ("short, signed or unsigned invalid for `%s'", name
);
9176 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9177 error ("long, short, signed or unsigned invalid for `%s'", name
);
9178 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9179 && RIDBIT_SETP (RID_SHORT
, specbits
))
9180 error ("long and short specified together for `%s'", name
);
9181 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9182 || RIDBIT_SETP (RID_SHORT
, specbits
))
9184 error ("long or short specified with char for `%s'", name
);
9185 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9186 || RIDBIT_SETP (RID_SHORT
, specbits
))
9187 && TREE_CODE (type
) == REAL_TYPE
)
9188 error ("long or short specified with floating type for `%s'", name
);
9189 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9190 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9191 error ("signed and unsigned given together for `%s'", name
);
9195 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9197 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9199 if (flag_pedantic_errors
)
9204 /* Discard the type modifiers if they are invalid. */
9207 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9208 RIDBIT_RESET (RID_SIGNED
, specbits
);
9209 RIDBIT_RESET (RID_LONG
, specbits
);
9210 RIDBIT_RESET (RID_SHORT
, specbits
);
9215 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9216 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9218 error ("complex invalid for `%s'", name
);
9219 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9222 /* Decide whether an integer type is signed or not.
9223 Optionally treat bitfields as signed by default. */
9224 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9225 || (bitfield
&& ! flag_signed_bitfields
9226 && (explicit_int
|| defaulted_int
|| explicit_char
9227 /* A typedef for plain `int' without `signed'
9228 can be controlled just like plain `int'. */
9229 || ! (typedef_decl
!= NULL_TREE
9230 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
9231 && TREE_CODE (type
) != ENUMERAL_TYPE
9232 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)))
9235 type
= long_long_unsigned_type_node
;
9236 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9237 type
= long_unsigned_type_node
;
9238 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9239 type
= short_unsigned_type_node
;
9240 else if (type
== char_type_node
)
9241 type
= unsigned_char_type_node
;
9242 else if (typedef_decl
)
9243 type
= unsigned_type (type
);
9245 type
= unsigned_type_node
;
9247 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9248 && type
== char_type_node
)
9249 type
= signed_char_type_node
;
9251 type
= long_long_integer_type_node
;
9252 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9253 type
= long_integer_type_node
;
9254 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9255 type
= short_integer_type_node
;
9257 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9259 /* If we just have "complex", it is equivalent to
9260 "complex double", but if any modifiers at all are specified it is
9261 the complex form of TYPE. E.g, "complex short" is
9262 "complex short int". */
9264 if (defaulted_int
&& ! longlong
9265 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9266 || RIDBIT_SETP (RID_SHORT
, specbits
)
9267 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9268 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9269 type
= complex_double_type_node
;
9270 else if (type
== integer_type_node
)
9271 type
= complex_integer_type_node
;
9272 else if (type
== float_type_node
)
9273 type
= complex_float_type_node
;
9274 else if (type
== double_type_node
)
9275 type
= complex_double_type_node
;
9276 else if (type
== long_double_type_node
)
9277 type
= complex_long_double_type_node
;
9279 type
= build_complex_type (type
);
9282 if (return_type
== return_conversion
9283 && (RIDBIT_SETP (RID_CONST
, specbits
)
9284 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9285 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9286 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9289 /* Set CONSTP if this declaration is `const', whether by
9290 explicit specification or via a typedef.
9291 Likewise for VOLATILEP. */
9293 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9295 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9297 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9298 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9299 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9300 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9301 type
= cp_build_qualified_type (type
, type_quals
);
9303 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9304 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9305 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9306 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9307 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9309 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9310 staticp
= 1 + (decl_context
== FIELD
);
9312 if (virtualp
&& staticp
== 2)
9314 cp_error ("member `%D' cannot be declared both virtual and static",
9318 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9319 RIDBIT_RESET (RID_FRIEND
, specbits
);
9321 /* $7.1.2, Function specifiers */
9322 if (friendp
&& explicitp
)
9323 error ("only declarations of constructors can be `explicit'");
9325 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9327 if (decl_context
== PARM
)
9329 error ("non-member `%s' cannot be declared `mutable'", name
);
9330 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9332 else if (friendp
|| decl_context
== TYPENAME
)
9334 error ("non-object member `%s' cannot be declared `mutable'", name
);
9335 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9339 /* Warn if two storage classes are given. Default to `auto'. */
9341 if (RIDBIT_ANY_SET (specbits
))
9343 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9344 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9345 if (decl_context
== PARM
&& nclasses
> 0)
9346 error ("storage class specifiers invalid in parameter declarations");
9347 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9349 if (decl_context
== PARM
)
9350 error ("typedef declaration invalid in parameter declaration");
9353 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9354 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9357 /* Give error if `virtual' is used outside of class declaration. */
9359 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9361 error ("virtual outside class declaration");
9364 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9366 error ("only members can be declared mutable");
9367 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9370 /* Static anonymous unions are dealt with here. */
9371 if (staticp
&& decl_context
== TYPENAME
9372 && TREE_CODE (declspecs
) == TREE_LIST
9373 && ANON_UNION_TYPE_P (TREE_VALUE (declspecs
)))
9374 decl_context
= FIELD
;
9376 /* Give error if `const,' `volatile,' `inline,' `friend,' or `virtual'
9377 is used in a signature member function declaration. */
9378 if (decl_context
== FIELD
9379 && IS_SIGNATURE (current_class_type
)
9380 && RIDBIT_NOTSETP (RID_TYPEDEF
, specbits
))
9382 if (type_quals
!= TYPE_UNQUALIFIED
)
9384 error ("type qualifiers specified for signature member function `%s'", name
);
9385 type_quals
= TYPE_UNQUALIFIED
;
9389 error ("`inline' specified for signature member function `%s'", name
);
9390 /* Later, we'll make signature member functions inline. */
9395 error ("`friend' declaration in signature definition");
9400 error ("`virtual' specified for signature member function `%s'",
9402 /* Later, we'll make signature member functions virtual. */
9407 /* Warn about storage classes that are invalid for certain
9408 kinds of declarations (parameters, typenames, etc.). */
9411 error ("multiple storage classes in declaration of `%s'", name
);
9412 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9414 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9415 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9416 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9418 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9420 else if (decl_context
== FIELD
9421 && ! IS_SIGNATURE (current_class_type
)
9422 /* C++ allows static class elements */
9423 && RIDBIT_SETP (RID_STATIC
, specbits
))
9424 /* C++ also allows inlines and signed and unsigned elements,
9425 but in those cases we don't come in here. */
9429 if (decl_context
== FIELD
)
9431 tree tmp
= NULL_TREE
;
9432 register int op
= 0;
9436 /* Avoid trying to get an operand off an identifier node. */
9437 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9440 tmp
= TREE_OPERAND (declarator
, 0);
9441 op
= IDENTIFIER_OPNAME_P (tmp
);
9443 error ("storage class specified for %s `%s'",
9444 IS_SIGNATURE (current_class_type
)
9446 ? "signature member operator"
9447 : "signature member function")
9448 : (op
? "member operator" : "field"),
9449 op
? operator_name_string (tmp
) : name
);
9452 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9453 ? "storage class specified for parameter `%s'"
9454 : "storage class specified for typename"), name
);
9455 RIDBIT_RESET (RID_REGISTER
, specbits
);
9456 RIDBIT_RESET (RID_AUTO
, specbits
);
9457 RIDBIT_RESET (RID_EXTERN
, specbits
);
9459 if (decl_context
== FIELD
&& IS_SIGNATURE (current_class_type
))
9461 RIDBIT_RESET (RID_STATIC
, specbits
);
9466 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9468 if (toplevel_bindings_p ())
9470 /* It's common practice (and completely valid) to have a const
9471 be initialized and declared extern. */
9472 if (!(type_quals
& TYPE_QUAL_CONST
))
9473 warning ("`%s' initialized and declared `extern'", name
);
9476 error ("`%s' has both `extern' and initializer", name
);
9478 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9479 && ! toplevel_bindings_p ())
9480 error ("nested function `%s' declared `extern'", name
);
9481 else if (toplevel_bindings_p ())
9483 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9484 error ("top-level declaration of `%s' specifies `auto'", name
);
9487 if (nclasses
> 0 && friendp
)
9488 error ("storage class specifiers invalid in friend function declarations");
9490 /* Now figure out the structure of the declarator proper.
9491 Descend through it, creating more complex types, until we reach
9492 the declared identifier (or NULL_TREE, in an absolute declarator). */
9494 inner_attrs
= NULL_TREE
;
9497 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9498 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9500 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9501 an INDIRECT_REF (for *...),
9502 a CALL_EXPR (for ...(...)),
9503 an identifier (for the name being declared)
9504 or a null pointer (for the place in an absolute declarator
9505 where the name was omitted).
9506 For the last two cases, we have just exited the loop.
9508 For C++ it could also be
9509 a SCOPE_REF (for class :: ...). In this case, we have converted
9510 sensible names to types, and those are the values we use to
9511 qualify the member name.
9512 an ADDR_EXPR (for &...),
9513 a BIT_NOT_EXPR (for destructors)
9515 At this point, TYPE is the type of elements of an array,
9516 or for a function to return, or for a pointer to point to.
9517 After this sequence of ifs, TYPE is the type of the
9518 array or function or pointer, and DECLARATOR has had its
9519 outermost layer removed. */
9521 if (type
== error_mark_node
)
9523 if (TREE_CODE (declarator
) == SCOPE_REF
)
9524 declarator
= TREE_OPERAND (declarator
, 1);
9526 declarator
= TREE_OPERAND (declarator
, 0);
9529 if (quals
!= NULL_TREE
9530 && (declarator
== NULL_TREE
9531 || TREE_CODE (declarator
) != SCOPE_REF
))
9533 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9534 ctype
= TYPE_METHOD_BASETYPE (type
);
9535 if (ctype
!= NULL_TREE
)
9537 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9538 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9539 type
= TREE_TYPE (dummy
);
9544 /* See the comment for the TREE_LIST case, below. */
9547 else if (inner_attrs
)
9549 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9550 inner_attrs
= NULL_TREE
;
9553 switch (TREE_CODE (declarator
))
9557 /* We encode a declarator with embedded attributes using
9558 a TREE_LIST. The attributes apply to the declarator
9559 directly inside them, so we have to skip an iteration
9560 before applying them to the type. If the declarator just
9561 inside is the declarator-id, we apply the attrs to the
9563 inner_attrs
= TREE_PURPOSE (declarator
);
9565 declarator
= TREE_VALUE (declarator
);
9571 register tree itype
= NULL_TREE
;
9572 register tree size
= TREE_OPERAND (declarator
, 1);
9573 /* The index is a signed object `sizetype' bits wide. */
9574 tree index_type
= signed_type (sizetype
);
9576 declarator
= TREE_OPERAND (declarator
, 0);
9578 /* Check for some types that there cannot be arrays of. */
9580 if (TREE_CODE (type
) == VOID_TYPE
)
9582 cp_error ("declaration of `%D' as array of voids", dname
);
9583 type
= error_mark_node
;
9586 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9588 cp_error ("declaration of `%D' as array of functions", dname
);
9589 type
= error_mark_node
;
9592 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9593 you can't have arrays of references. If we allowed them,
9594 then we'd be saying x[i] is valid for an array x, but
9595 then you'd have to ask: what does `*(x + i)' mean? */
9596 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9598 if (decl_context
== TYPENAME
)
9599 cp_error ("cannot make arrays of references");
9601 cp_error ("declaration of `%D' as array of references",
9603 type
= error_mark_node
;
9606 if (TREE_CODE (type
) == OFFSET_TYPE
)
9608 cp_error ("declaration of `%D' as array of data members",
9610 type
= error_mark_node
;
9613 if (TREE_CODE (type
) == METHOD_TYPE
)
9615 cp_error ("declaration of `%D' as array of function members",
9617 type
= error_mark_node
;
9620 if (size
== error_mark_node
)
9621 type
= error_mark_node
;
9622 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9626 the constant expressions that specify the bounds of
9627 the arrays can be omitted only for the first member
9629 cp_error ("declaration of `%D' as multidimensional array",
9631 cp_error ("must have bounds for all dimensions except the first");
9632 type
= error_mark_node
;
9635 if (type
== error_mark_node
)
9640 /* Must suspend_momentary here because the index
9641 type may need to live until the end of the function.
9642 For example, it is used in the declaration of a
9643 variable which requires destructing at the end of
9644 the function; then build_vec_delete will need this
9646 int yes
= suspend_momentary ();
9647 /* Might be a cast. */
9648 if (TREE_CODE (size
) == NOP_EXPR
9649 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9650 size
= TREE_OPERAND (size
, 0);
9652 /* If this involves a template parameter, it'll be
9653 constant, but we don't know what the value is yet. */
9654 if (processing_template_decl
)
9656 /* Resolve a qualified reference to an enumerator or
9657 static const data member of ours. */
9658 if (TREE_CODE (size
) == SCOPE_REF
9659 && TREE_OPERAND (size
, 0) == current_class_type
)
9661 tree t
= lookup_field (current_class_type
,
9662 TREE_OPERAND (size
, 1), 0, 0);
9667 itype
= make_node (INTEGER_TYPE
);
9668 TYPE_MIN_VALUE (itype
) = size_zero_node
;
9669 TYPE_MAX_VALUE (itype
) = build_min
9670 (MINUS_EXPR
, sizetype
, size
, integer_one_node
);
9671 goto dont_grok_size
;
9674 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9675 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9676 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9678 cp_error ("size of array `%D' has non-integer type",
9680 size
= integer_one_node
;
9682 if (TREE_READONLY_DECL_P (size
))
9683 size
= decl_constant_value (size
);
9684 if (pedantic
&& integer_zerop (size
))
9685 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9686 if (TREE_CONSTANT (size
))
9688 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9689 int old_pedantic
= pedantic
;
9690 pedantic
= flag_pedantic_errors
= 1;
9691 /* Always give overflow errors on array subscripts. */
9692 constant_expression_warning (size
);
9693 pedantic
= old_pedantic
;
9694 flag_pedantic_errors
= old_flag_pedantic_errors
;
9695 if (INT_CST_LT (size
, integer_zero_node
))
9697 cp_error ("size of array `%D' is negative", dname
);
9698 size
= integer_one_node
;
9706 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9709 cp_pedwarn ("ANSI C++ forbids variable-size array");
9714 = fold (build_binary_op (MINUS_EXPR
,
9715 cp_convert (index_type
, size
),
9716 cp_convert (index_type
,
9717 integer_one_node
), 1));
9718 if (! TREE_CONSTANT (itype
))
9719 itype
= variable_size (itype
);
9720 else if (TREE_OVERFLOW (itype
))
9722 error ("overflow in array dimension");
9723 TREE_OVERFLOW (itype
) = 0;
9726 /* If we're a parm, we need to have a permanent type so
9727 mangling checks for re-use will work right. If both the
9728 element and index types are permanent, the array type
9730 if (decl_context
== PARM
9731 && allocation_temporary_p () && TREE_PERMANENT (type
))
9733 push_obstacks (&permanent_obstack
, &permanent_obstack
);
9734 itype
= build_index_type (itype
);
9738 itype
= build_index_type (itype
);
9741 resume_momentary (yes
);
9744 type
= build_cplus_array_type (type
, itype
);
9753 tree inner_parms
= TREE_OPERAND (declarator
, 1);
9754 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9756 /* Declaring a function type.
9757 Make sure we have a valid type for the function to return. */
9759 /* We now know that the TYPE_QUALS don't apply to the
9760 decl, but to its return type. */
9761 type_quals
= TYPE_UNQUALIFIED
;
9763 /* Warn about some types functions can't return. */
9765 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9767 error ("`%s' declared as function returning a function", name
);
9768 type
= integer_type_node
;
9770 if (TREE_CODE (type
) == ARRAY_TYPE
)
9772 error ("`%s' declared as function returning an array", name
);
9773 type
= integer_type_node
;
9776 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9777 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9779 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9782 /* Pick up type qualifiers which should be applied to `this'. */
9783 quals
= TREE_OPERAND (declarator
, 2);
9785 /* Pick up the exception specifications. */
9786 raises
= TREE_TYPE (declarator
);
9788 /* Say it's a definition only for the CALL_EXPR
9789 closest to the identifier. */
9792 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9793 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9794 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9796 if (ctype
== NULL_TREE
9797 && decl_context
== FIELD
9799 && (friendp
== 0 || dname
== current_class_name
))
9800 ctype
= current_class_type
;
9802 if (ctype
&& return_type
== return_conversion
)
9803 TYPE_HAS_CONVERSION (ctype
) = 1;
9804 if (ctype
&& constructor_name (ctype
) == dname
)
9806 /* We are within a class's scope. If our declarator name
9807 is the same as the class name, and we are defining
9808 a function, then it is a constructor/destructor, and
9809 therefore returns a void type. */
9811 if (flags
== DTOR_FLAG
)
9813 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9814 not be declared const or volatile. A destructor
9815 may not be static. */
9817 error ("destructor cannot be static member function");
9820 cp_error ("destructors may not be `%s'",
9821 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9824 if (decl_context
== FIELD
)
9826 if (! member_function_or_else (ctype
, current_class_type
,
9827 "destructor for alien class `%s' cannot be a member"))
9828 return void_type_node
;
9831 else /* It's a constructor. */
9835 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
9836 not be declared const or volatile. A constructor may
9837 not be virtual. A constructor may not be static. */
9839 error ("constructor cannot be static member function");
9842 pedwarn ("constructors cannot be declared virtual");
9847 cp_error ("constructors may not be `%s'",
9848 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9852 RID_BIT_TYPE tmp_bits
;
9853 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
9854 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
9855 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
9856 if (RIDBIT_ANY_SET (tmp_bits
))
9857 error ("return value type specifier for constructor ignored");
9859 type
= build_pointer_type (ctype
);
9860 if (decl_context
== FIELD
9861 && IS_SIGNATURE (current_class_type
))
9863 error ("constructor not allowed in signature");
9864 return void_type_node
;
9866 else if (decl_context
== FIELD
)
9868 if (! member_function_or_else (ctype
, current_class_type
,
9869 "constructor for alien class `%s' cannot be member"))
9870 return void_type_node
;
9871 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
9872 if (return_type
!= return_ctor
)
9876 if (decl_context
== FIELD
)
9882 error ("can't initialize friend function `%s'", name
);
9885 /* Cannot be both friend and virtual. */
9886 error ("virtual functions cannot be friends");
9887 RIDBIT_RESET (RID_FRIEND
, specbits
);
9890 if (decl_context
== NORMAL
)
9891 error ("friend declaration not in class definition");
9892 if (current_function_decl
&& funcdef_flag
)
9893 cp_error ("can't define friend function `%s' in a local class definition",
9897 /* Construct the function type and go to the next
9898 inner layer of declarator. */
9900 declarator
= TREE_OPERAND (declarator
, 0);
9902 /* FIXME: This is where default args should be fully
9905 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
9907 if (declarator
&& flags
== DTOR_FLAG
)
9909 /* A destructor declared in the body of a class will
9910 be represented as a BIT_NOT_EXPR. But, we just
9911 want the underlying IDENTIFIER. */
9912 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
9913 declarator
= TREE_OPERAND (declarator
, 0);
9915 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
9916 arg_types
= void_list_node
;
9917 else if (arg_types
== NULL_TREE
9918 || arg_types
!= void_list_node
)
9920 cp_error ("destructors may not have parameters");
9921 arg_types
= void_list_node
;
9922 last_function_parms
= NULL_TREE
;
9926 /* ANSI says that `const int foo ();'
9927 does not make the function foo const. */
9928 type
= build_function_type (type
, arg_types
);
9932 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
9933 if (TREE_PURPOSE (t
)
9934 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
9936 add_defarg_fn (type
);
9945 /* Filter out pointers-to-references and references-to-references.
9946 We can get these if a TYPE_DECL is used. */
9948 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9950 error ("cannot declare %s to references",
9951 TREE_CODE (declarator
) == ADDR_EXPR
9952 ? "references" : "pointers");
9953 declarator
= TREE_OPERAND (declarator
, 0);
9957 if (TREE_CODE (type
) == OFFSET_TYPE
9958 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
9959 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
9961 cp_error ("cannot declare pointer to `%#T' member",
9963 type
= TREE_TYPE (type
);
9966 /* Merge any constancy or volatility into the target type
9969 /* We now know that the TYPE_QUALS don't apply to the decl,
9970 but to the target of the pointer. */
9971 type_quals
= TYPE_UNQUALIFIED
;
9973 if (IS_SIGNATURE (type
))
9975 if (TREE_CODE (declarator
) == ADDR_EXPR
)
9977 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
9978 && TYPE_SIZE (type
))
9979 cp_warning ("empty signature `%T' used in signature reference declaration",
9982 type
= build_signature_reference_type (type
);
9984 sorry ("signature reference");
9990 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
9991 && TYPE_SIZE (type
))
9992 cp_warning ("empty signature `%T' used in signature pointer declaration",
9994 type
= build_signature_pointer_type (type
);
9997 else if (TREE_CODE (declarator
) == ADDR_EXPR
)
9999 if (TREE_CODE (type
) == VOID_TYPE
)
10000 error ("invalid type: `void &'");
10002 type
= build_reference_type (type
);
10004 else if (TREE_CODE (type
) == METHOD_TYPE
)
10006 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10009 type
= build_pointer_type (type
);
10011 /* Process a list of type modifier keywords (such as
10012 const or volatile) that were given inside the `*' or `&'. */
10014 if (TREE_TYPE (declarator
))
10016 register tree typemodlist
;
10022 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10023 typemodlist
= TREE_CHAIN (typemodlist
))
10025 tree qualifier
= TREE_VALUE (typemodlist
);
10027 if (qualifier
== ridpointers
[(int) RID_CONST
])
10029 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10031 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10036 error ("invalid type modifier within pointer declarator");
10040 pedwarn ("duplicate `const'");
10042 pedwarn ("duplicate `volatile'");
10044 pedwarn ("duplicate `restrict'");
10046 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10047 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10048 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10049 if (TREE_CODE (declarator
) == ADDR_EXPR
10050 && (constp
|| volatilep
))
10053 pedwarn ("discarding `const' applied to a reference");
10055 pedwarn ("discarding `volatile' applied to a reference");
10056 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10058 type
= cp_build_qualified_type (type
, type_quals
);
10060 declarator
= TREE_OPERAND (declarator
, 0);
10066 /* We have converted type names to NULL_TREE if the
10067 name was bogus, or to a _TYPE node, if not.
10069 The variable CTYPE holds the type we will ultimately
10070 resolve to. The code here just needs to build
10071 up appropriate member types. */
10072 tree sname
= TREE_OPERAND (declarator
, 1);
10075 /* Destructors can have their visibilities changed as well. */
10076 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10077 sname
= TREE_OPERAND (sname
, 0);
10079 if (TREE_COMPLEXITY (declarator
) == 0)
10080 /* This needs to be here, in case we are called
10081 multiple times. */ ;
10082 else if (TREE_COMPLEXITY (declarator
) == -1)
10083 /* Namespace member. */
10084 pop_decl_namespace ();
10085 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10086 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10087 else if (! IS_AGGR_TYPE_CODE
10088 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10090 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10092 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10093 that refer to ctype. They couldn't be resolved earlier
10094 because we hadn't pushed into the class yet.
10095 Example: resolve 'B<T>::type' in
10096 'B<typename B<T>::type> B<T>::f () { }'. */
10097 if (current_template_parms
10098 && uses_template_parms (type
)
10099 && uses_template_parms (current_class_type
))
10101 tree args
= current_template_args ();
10102 type
= tsubst (type
, args
, NULL_TREE
);
10105 /* This pop_nested_class corresponds to the
10106 push_nested_class used to push into class scope for
10107 parsing the argument list of a function decl, in
10109 pop_nested_class (1);
10110 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10113 my_friendly_abort (16);
10115 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10117 /* We had a reference to a global decl, or
10118 perhaps we were given a non-aggregate typedef,
10119 in which case we cleared this out, and should just
10120 keep going as though it wasn't there. */
10121 declarator
= sname
;
10124 ctype
= TREE_OPERAND (declarator
, 0);
10127 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10129 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10130 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10131 template_count
+= 1;
10132 t
= TYPE_MAIN_DECL (t
);
10133 if (DECL_LANG_SPECIFIC (t
))
10134 t
= DECL_CLASS_CONTEXT (t
);
10139 if (sname
== NULL_TREE
)
10142 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10144 /* This is the `standard' use of the scoping operator:
10145 basetype :: member . */
10147 if (ctype
== current_class_type
)
10153 Is this ill-formed? */
10156 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10159 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10161 if (current_class_type
== NULL_TREE
10163 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10164 TYPE_ARG_TYPES (type
));
10167 cp_error ("cannot declare member function `%T::%s' within `%T'",
10168 ctype
, name
, current_class_type
);
10169 return void_type_node
;
10172 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10173 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10175 /* Have to move this code elsewhere in this function.
10176 this code is used for i.e., typedef int A::M; M *pm;
10178 It is? How? jason 10/2/94 */
10180 if (current_class_type
)
10182 cp_error ("cannot declare member `%T::%s' within `%T'",
10183 ctype
, name
, current_class_type
);
10184 return void_type_node
;
10186 type
= build_offset_type (ctype
, type
);
10188 else if (uses_template_parms (ctype
))
10190 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10192 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10193 TYPE_ARG_TYPES (type
));
10197 cp_error ("structure `%T' not yet defined", ctype
);
10198 return error_mark_node
;
10201 declarator
= sname
;
10203 else if (TREE_CODE (sname
) == SCOPE_REF
)
10204 my_friendly_abort (17);
10208 declarator
= TREE_OPERAND (declarator
, 1);
10209 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10210 /* In this case, we will deal with it later. */
10214 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10215 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10216 TYPE_ARG_TYPES (type
));
10218 type
= build_offset_type (ctype
, type
);
10225 declarator
= TREE_OPERAND (declarator
, 0);
10230 case ENUMERAL_TYPE
:
10231 declarator
= NULL_TREE
;
10235 declarator
= NULL_TREE
;
10239 my_friendly_abort (158);
10243 /* See the comment for the TREE_LIST case, above. */
10246 if (! ignore_attrs
)
10247 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10249 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10251 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10254 if (explicitp
== 1)
10256 error ("only constructors can be declared `explicit'");
10260 /* Now TYPE has the actual type. */
10262 /* If this is declaring a typedef name, return a TYPE_DECL. */
10264 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10266 if (type_quals
& TYPE_QUAL_CONST
)
10268 error ("const `%s' cannot be declared `mutable'", name
);
10269 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10273 error ("static `%s' cannot be declared `mutable'", name
);
10274 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10278 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10282 /* Note that the grammar rejects storage classes
10283 in typenames, fields or parameters. */
10284 if (current_lang_name
== lang_name_java
)
10285 TYPE_FOR_JAVA (type
) = 1;
10287 if (decl_context
== FIELD
)
10289 if (declarator
== constructor_name (current_class_type
))
10290 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10292 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10293 if (IS_SIGNATURE (current_class_type
) && opaque_typedef
)
10294 SIGNATURE_HAS_OPAQUE_TYPEDECLS (current_class_type
) = 1;
10298 /* Make sure this typedef lives as long as its type,
10299 since it might be used as a template parameter. */
10300 if (type
!= error_mark_node
)
10301 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10302 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10303 if (type
!= error_mark_node
)
10307 /* If the user declares "struct {...} foo" then `foo' will have
10308 an anonymous name. Fill that name in now. Nothing can
10309 refer to it, so nothing needs know about the name change.
10310 The TYPE_NAME field was filled in by build_struct_xref. */
10311 if (type
!= error_mark_node
10312 && TYPE_NAME (type
)
10313 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10314 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
)))
10316 /* FIXME: This is bogus; we should not be doing this for
10317 cv-qualified types. */
10319 /* For anonymous structs that are cv-qualified, need to use
10320 TYPE_MAIN_VARIANT so that name will mangle correctly. As
10321 type not referenced after this block, don't bother
10322 resetting type to original type, ie. TREE_TYPE (decl). */
10323 type
= TYPE_MAIN_VARIANT (type
);
10325 /* Replace the anonymous name with the real name everywhere. */
10326 lookup_tag_reverse (type
, declarator
);
10327 TYPE_NAME (type
) = decl
;
10329 if (TYPE_LANG_SPECIFIC (type
))
10330 TYPE_WAS_ANONYMOUS (type
) = 1;
10332 /* XXX Temporarily set the scope.
10333 When returning, start_decl expects it as NULL_TREE,
10334 and will then then set it using pushdecl. */
10335 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10336 if (current_class_type
)
10337 DECL_CONTEXT (decl
) = current_class_type
;
10339 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10341 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10342 DECL_ASSEMBLER_NAME (decl
)
10343 = get_identifier (build_overload_name (type
, 1, 1));
10344 DECL_CONTEXT (decl
) = NULL_TREE
;
10346 /* FIXME remangle member functions; member functions of a
10347 type with external linkage have external linkage. */
10350 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10352 cp_error_at ("typedef name may not be class-qualified", decl
);
10357 if (ctype
== NULL_TREE
)
10359 if (TREE_CODE (type
) != METHOD_TYPE
)
10360 cp_error_at ("invalid type qualifier for non-method type", decl
);
10362 ctype
= TYPE_METHOD_BASETYPE (type
);
10364 if (ctype
!= NULL_TREE
)
10365 grok_method_quals (ctype
, decl
, quals
);
10368 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10369 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10370 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10372 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10373 error ("non-object member `%s' cannot be declared mutable", name
);
10375 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10376 inlinep
, friendp
, raises
!= NULL_TREE
);
10379 error ("typedef declaration includes an initializer");
10384 /* Detect the case of an array type of unspecified size
10385 which came, as such, direct from a typedef name.
10386 We must copy the type, so that each identifier gets
10387 a distinct type, so that each identifier's size can be
10388 controlled separately by its own initializer. */
10390 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10391 && TYPE_DOMAIN (type
) == NULL_TREE
)
10393 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10396 /* If this is a type name (such as, in a cast or sizeof),
10397 compute the type and return it now. */
10399 if (decl_context
== TYPENAME
)
10401 /* Note that the grammar rejects storage classes
10402 in typenames, fields or parameters. */
10403 if (type_quals
!= TYPE_UNQUALIFIED
)
10405 if (IS_SIGNATURE (type
))
10406 error ("type qualifiers specified for signature type");
10407 type_quals
= TYPE_UNQUALIFIED
;
10410 /* Special case: "friend class foo" looks like a TYPENAME context. */
10413 if (type_quals
!= TYPE_UNQUALIFIED
)
10415 cp_error ("type qualifiers specified for friend class declaration");
10416 type_quals
= TYPE_UNQUALIFIED
;
10420 cp_error ("`inline' specified for friend class declaration");
10424 /* Only try to do this stuff if we didn't already give up. */
10425 if (type
!= integer_type_node
)
10427 /* A friendly class? */
10428 if (current_class_type
)
10429 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10431 error ("trying to make class `%s' a friend of global scope",
10432 TYPE_NAME_STRING (type
));
10433 type
= void_type_node
;
10438 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10439 if (ctype
== NULL_TREE
)
10441 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10442 ctype
= TYPE_METHOD_BASETYPE (type
);
10444 grok_method_quals (ctype
, dummy
, quals
);
10445 type
= TREE_TYPE (dummy
);
10450 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10451 && decl_context
!= CATCHPARM
10452 && TREE_CODE (type
) != UNION_TYPE
10455 cp_error ("abstract declarator `%T' used as declaration", type
);
10456 declarator
= make_anon_name ();
10459 /* `void' at top level (not within pointer)
10460 is allowed only in typedefs or type names.
10461 We don't complain about parms either, but that is because
10462 a better error message can be made later. */
10464 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10467 error ("unnamed variable or field declared void");
10468 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10470 if (IDENTIFIER_OPNAME_P (declarator
))
10471 my_friendly_abort (356);
10473 error ("variable or field `%s' declared void", name
);
10476 error ("variable or field declared void");
10477 type
= integer_type_node
;
10480 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10481 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10483 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10485 if (ctype
|| in_namespace
)
10486 error ("cannot use `::' in parameter declaration");
10488 /* A parameter declared as an array of T is really a pointer to T.
10489 One declared as a function is really a pointer to a function.
10490 One declared as a member is really a pointer to member. */
10492 if (TREE_CODE (type
) == ARRAY_TYPE
)
10494 /* Transfer const-ness of array into that of type pointed to. */
10495 type
= build_pointer_type (TREE_TYPE (type
));
10496 type_quals
= TYPE_UNQUALIFIED
;
10498 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10499 type
= build_pointer_type (type
);
10500 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10501 type
= build_pointer_type (type
);
10502 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10504 error ("declaration of `%s' as void", name
);
10510 register tree decl
;
10512 if (decl_context
== PARM
)
10514 decl
= build_decl (PARM_DECL
, declarator
, type
);
10516 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10517 inlinep
, friendp
, raises
!= NULL_TREE
);
10518 if (current_class_type
10519 && IS_SIGNATURE (current_class_type
))
10522 error ("parameter of signature member function declared `inline'");
10523 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10524 error ("parameter of signature member function declared `auto'");
10525 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10526 error ("parameter of signature member function declared `register'");
10529 /* Compute the type actually passed in the parmlist,
10530 for the case where there is no prototype.
10531 (For example, shorts and chars are passed as ints.)
10532 When there is a prototype, this is overridden later. */
10534 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10536 else if (decl_context
== FIELD
)
10538 if (type
== error_mark_node
)
10540 /* Happens when declaring arrays of sizes which
10541 are error_mark_node, for example. */
10544 else if (in_namespace
&& !friendp
)
10546 /* Something like struct S { int N::j; }; */
10547 cp_error ("invalid use of `::'");
10550 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10553 tree function_context
;
10555 /* We catch the others as conflicts with the builtin
10557 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10559 cp_error ("function `%D' cannot be declared friend",
10566 if (ctype
== NULL_TREE
)
10567 ctype
= current_class_type
;
10569 if (ctype
== NULL_TREE
)
10571 cp_error ("can't make `%D' into a method -- not in a class",
10573 return void_type_node
;
10576 /* ``A union may [ ... ] not [ have ] virtual functions.''
10578 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10580 cp_error ("function `%D' declared virtual inside a union",
10582 return void_type_node
;
10585 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10586 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10587 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10588 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10592 cp_error ("`%D' cannot be declared virtual, since it is always static",
10597 else if (staticp
< 2)
10598 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10599 TYPE_ARG_TYPES (type
));
10602 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10603 function_context
= (ctype
!= NULL_TREE
) ?
10604 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10605 publicp
= (! friendp
|| ! staticp
)
10606 && function_context
== NULL_TREE
;
10607 decl
= grokfndecl (ctype
, type
,
10608 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10609 ? declarator
: dname
,
10611 virtualp
, flags
, quals
, raises
, attrlist
,
10612 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10613 funcdef_flag
, template_count
, in_namespace
);
10614 if (decl
== NULL_TREE
|| decl
== error_mark_node
)
10617 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10618 /* The decl and setting of decl_machine_attr is also turned off. */
10619 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10622 /* [class.conv.ctor]
10624 A constructor declared without the function-specifier
10625 explicit that can be called with a single parameter
10626 specifies a conversion from the type of its first
10627 parameter to the type of its class. Such a constructor
10628 is called a converting constructor. */
10629 if (explicitp
== 2)
10630 DECL_NONCONVERTING_P (decl
) = 1;
10631 else if (DECL_CONSTRUCTOR_P (decl
))
10633 /* The constructor can be called with exactly one
10634 parameter if there is at least one parameter, and
10635 any subsequent parameters have default arguments.
10636 We don't look at the first parameter, which is
10637 really just the `this' parameter for the new
10640 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10642 /* Skip the `in_chrg' argument too, if present. */
10643 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10644 arg_types
= TREE_CHAIN (arg_types
);
10646 if (arg_types
== void_list_node
10648 && TREE_CHAIN (arg_types
)
10649 && TREE_CHAIN (arg_types
) != void_list_node
10650 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10651 DECL_NONCONVERTING_P (decl
) = 1;
10654 else if (TREE_CODE (type
) == METHOD_TYPE
)
10656 /* We only get here for friend declarations of
10657 members of other classes. */
10658 /* All method decls are public, so tell grokfndecl to set
10659 TREE_PUBLIC, also. */
10660 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10661 virtualp
, flags
, quals
, raises
, attrlist
,
10662 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10663 template_count
, in_namespace
);
10664 if (decl
== NULL_TREE
)
10667 else if (!staticp
&& ! processing_template_decl
10668 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10669 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10672 cp_error ("field `%D' has incomplete type", declarator
);
10674 cp_error ("name `%T' has incomplete type", type
);
10676 /* If we're instantiating a template, tell them which
10677 instantiation made the field's type be incomplete. */
10678 if (current_class_type
10679 && TYPE_NAME (current_class_type
)
10680 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10681 && declspecs
&& TREE_VALUE (declspecs
)
10682 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10683 cp_error (" in instantiation of template `%T'",
10684 current_class_type
);
10686 type
= error_mark_node
;
10693 error ("`%s' is neither function nor method; cannot be declared friend",
10694 IDENTIFIER_POINTER (declarator
));
10702 /* Friends are treated specially. */
10703 if (ctype
== current_class_type
)
10704 warning ("member functions are implicitly friends of their class");
10707 tree t
= NULL_TREE
;
10708 if (decl
&& DECL_NAME (decl
))
10710 if (template_class_depth (current_class_type
) == 0)
10713 = check_explicit_specialization
10715 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10716 if (decl
== error_mark_node
)
10717 return error_mark_node
;
10720 t
= do_friend (ctype
, declarator
, decl
,
10721 last_function_parms
, flags
, quals
,
10724 if (t
&& funcdef_flag
)
10727 return void_type_node
;
10731 /* Structure field. It may not be a function, except for C++ */
10733 if (decl
== NULL_TREE
)
10739 /* An attempt is being made to initialize a non-static
10740 member. But, from [class.mem]:
10742 4 A member-declarator can contain a
10743 constant-initializer only if it declares a static
10744 member (_class.static_) of integral or enumeration
10745 type, see _class.static.data_.
10747 This used to be relatively common practice, but
10748 the rest of the compiler does not correctly
10749 handle the initialization unless the member is
10750 static so we make it static below. */
10751 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10753 cp_pedwarn ("making `%D' static", declarator
);
10757 if (uses_template_parms (type
))
10758 /* We'll check at instantiation time. */
10760 else if (check_static_variable_definition (declarator
,
10762 /* If we just return the declaration, crashes
10763 will sometimes occur. We therefore return
10764 void_type_node, as if this was a friend
10765 declaration, to cause callers to completely
10766 ignore this declaration. */
10767 return void_type_node
;
10770 /* 9.2p13 [class.mem] */
10771 if (declarator
== constructor_name (current_class_type
))
10772 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10777 /* C++ allows static class members.
10778 All other work for this is done by grokfield.
10779 This VAR_DCL is built by build_lang_field_decl.
10780 All other VAR_DECLs are built by build_decl. */
10781 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
10782 TREE_STATIC (decl
) = 1;
10783 /* In class context, 'static' means public access. */
10784 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10788 decl
= build_lang_field_decl (FIELD_DECL
, declarator
, type
);
10789 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10791 DECL_MUTABLE_P (decl
) = 1;
10792 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10796 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10797 inlinep
, friendp
, raises
!= NULL_TREE
);
10800 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10802 tree original_name
;
10808 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10809 original_name
= dname
;
10811 original_name
= declarator
;
10813 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10814 error ("storage class `auto' invalid for function `%s'", name
);
10815 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10816 error ("storage class `register' invalid for function `%s'", name
);
10818 /* Function declaration not at top level.
10819 Storage classes other than `extern' are not allowed
10820 and `extern' makes no difference. */
10821 if (! toplevel_bindings_p ()
10822 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10823 || RIDBIT_SETP (RID_INLINE
, specbits
))
10826 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10827 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10829 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10832 if (ctype
== NULL_TREE
)
10836 error ("virtual non-class function `%s'", name
);
10840 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
10841 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10842 TYPE_ARG_TYPES (type
));
10844 /* Record presence of `static'. */
10845 publicp
= (ctype
!= NULL_TREE
10846 || RIDBIT_SETP (RID_EXTERN
, specbits
)
10847 || !RIDBIT_SETP (RID_STATIC
, specbits
));
10849 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
10850 virtualp
, flags
, quals
, raises
, attrlist
,
10852 publicp
, inlinep
, funcdef_flag
,
10853 template_count
, in_namespace
);
10854 if (decl
== NULL_TREE
)
10857 /* Among other times, could occur from check_explicit_specialization
10858 returning an error_mark_node. */
10859 if (decl
== error_mark_node
)
10860 return error_mark_node
;
10864 int illegal_static
= 0;
10866 /* Don't allow a static member function in a class, and forbid
10867 declaring main to be static. */
10868 if (TREE_CODE (type
) == METHOD_TYPE
)
10870 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
10871 illegal_static
= 1;
10873 else if (current_function_decl
)
10875 /* FIXME need arm citation */
10876 error ("cannot declare static function inside another function");
10877 illegal_static
= 1;
10880 if (illegal_static
)
10883 RIDBIT_RESET (RID_STATIC
, specbits
);
10889 /* It's a variable. */
10891 /* An uninitialized decl with `extern' is a reference. */
10892 decl
= grokvardecl (type
, declarator
, &specbits
,
10894 (type_quals
& TYPE_QUAL_CONST
) != 0,
10896 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
10897 inlinep
, friendp
, raises
!= NULL_TREE
);
10901 DECL_CONTEXT (decl
) = ctype
;
10904 cp_pedwarn ("static member `%D' re-declared as static", decl
);
10906 RIDBIT_RESET (RID_STATIC
, specbits
);
10908 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
10910 cp_error ("static member `%D' declared `register'", decl
);
10911 RIDBIT_RESET (RID_REGISTER
, specbits
);
10913 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
10915 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
10917 RIDBIT_RESET (RID_EXTERN
, specbits
);
10922 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10924 error ("`%s' cannot be declared mutable", name
);
10927 /* Record `register' declaration for warnings on &
10928 and in case doing stupid register allocation. */
10930 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10931 DECL_REGISTER (decl
) = 1;
10933 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
10934 DECL_THIS_EXTERN (decl
) = 1;
10936 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10937 DECL_THIS_STATIC (decl
) = 1;
10939 /* Record constancy and volatility. */
10940 /* FIXME: Disallow `restrict' pointer-to-member declarations. */
10941 c_apply_type_quals_to_decl (type_quals
, decl
);
10947 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
10948 An empty exprlist is a parmlist. An exprlist which
10949 contains only identifiers at the global level
10950 is a parmlist. Otherwise, it is an exprlist. */
10953 parmlist_is_exprlist (exprs
)
10956 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
10959 if (toplevel_bindings_p ())
10961 /* At the global level, if these are all identifiers,
10962 then it is a parmlist. */
10965 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
10967 exprs
= TREE_CHAIN (exprs
);
10974 /* Subroutine of `grokparms'. In a fcn definition, arg types must
10977 C++: also subroutine of `start_function'. */
10980 require_complete_types_for_parms (parms
)
10983 if (processing_template_decl
)
10988 tree type
= TREE_TYPE (parms
);
10989 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
10991 if (DECL_NAME (parms
))
10992 error ("parameter `%s' has incomplete type",
10993 IDENTIFIER_POINTER (DECL_NAME (parms
)));
10995 error ("parameter has incomplete type");
10996 TREE_TYPE (parms
) = error_mark_node
;
10999 layout_decl (parms
, 0);
11001 /* If the arg types are incomplete in a declaration,
11002 they must include undefined tags.
11003 These tags can never be defined in the scope of the declaration,
11004 so the types can never be completed,
11005 and no call can be compiled successfully. */
11006 /* This is not the right behavior for C++, but not having
11007 it is also probably wrong. */
11010 /* Now warn if is a pointer to an incomplete type. */
11011 while (TREE_CODE (type
) == POINTER_TYPE
11012 || TREE_CODE (type
) == REFERENCE_TYPE
)
11013 type
= TREE_TYPE (type
);
11014 type
= TYPE_MAIN_VARIANT (type
);
11015 if (TYPE_SIZE (type
) == NULL_TREE
)
11017 if (DECL_NAME (parm
) != NULL_TREE
)
11018 warning ("parameter `%s' points to incomplete type",
11019 IDENTIFIER_POINTER (DECL_NAME (parm
)));
11021 warning ("parameter points to incomplete type");
11025 parms
= TREE_CHAIN (parms
);
11029 /* Decode the list of parameter types for a function type.
11030 Given the list of things declared inside the parens,
11031 return a list of types.
11033 The list we receive can have three kinds of elements:
11034 an IDENTIFIER_NODE for names given without types,
11035 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11036 or void_type_node, to mark the end of an argument list
11037 when additional arguments are not permitted (... was not used).
11039 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11040 a mere declaration. A nonempty identifier-list gets an error message
11041 when FUNCDEF_FLAG is zero.
11042 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11043 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11045 If all elements of the input list contain types,
11046 we return a list of the types.
11047 If all elements contain no type (except perhaps a void_type_node
11048 at the end), we return a null list.
11049 If some have types and some do not, it is an error, and we
11050 return a null list.
11052 Also set last_function_parms to either
11053 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11054 A list of names is converted to a chain of PARM_DECLs
11055 by store_parm_decls so that ultimately it is always a chain of decls.
11057 Note that in C++, parameters can take default values. These default
11058 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11059 an error to specify default values which are followed by parameters
11060 that have no default values, or an ELLIPSES. For simplicities sake,
11061 only parameters which are specified with their types can take on
11065 grokparms (first_parm
, funcdef_flag
)
11069 tree result
= NULL_TREE
;
11070 tree decls
= NULL_TREE
;
11072 if (first_parm
!= NULL_TREE
11073 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11075 if (! funcdef_flag
)
11076 pedwarn ("parameter names (without types) in function declaration");
11077 last_function_parms
= first_parm
;
11080 else if (first_parm
!= NULL_TREE
11081 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11082 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11083 my_friendly_abort (145);
11086 /* Types were specified. This is a list of declarators
11087 each represented as a TREE_LIST node. */
11088 register tree parm
, chain
;
11089 int any_init
= 0, any_error
= 0;
11091 if (first_parm
!= NULL_TREE
)
11093 tree last_result
= NULL_TREE
;
11094 tree last_decl
= NULL_TREE
;
11096 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11098 tree type
= NULL_TREE
, list_node
= parm
;
11099 register tree decl
= TREE_VALUE (parm
);
11100 tree init
= TREE_PURPOSE (parm
);
11102 chain
= TREE_CHAIN (parm
);
11103 /* @@ weak defense against parse errors. */
11104 if (TREE_CODE (decl
) != VOID_TYPE
11105 && TREE_CODE (decl
) != TREE_LIST
)
11107 /* Give various messages as the need arises. */
11108 if (TREE_CODE (decl
) == STRING_CST
)
11109 cp_error ("invalid string constant `%E'", decl
);
11110 else if (TREE_CODE (decl
) == INTEGER_CST
)
11111 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11115 if (TREE_CODE (decl
) != VOID_TYPE
)
11117 decl
= grokdeclarator (TREE_VALUE (decl
),
11118 TREE_PURPOSE (decl
),
11119 PARM
, init
!= NULL_TREE
,
11121 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11124 /* Top-level qualifiers on the parameters are
11125 ignored for function types. */
11126 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11128 if (TREE_CODE (type
) == VOID_TYPE
)
11129 decl
= void_type_node
;
11130 else if (TREE_CODE (type
) == METHOD_TYPE
)
11132 if (DECL_NAME (decl
))
11133 /* Cannot use the decl here because
11134 we don't have DECL_CONTEXT set up yet. */
11135 cp_error ("parameter `%D' invalidly declared method type",
11138 error ("parameter invalidly declared method type");
11139 type
= build_pointer_type (type
);
11140 TREE_TYPE (decl
) = type
;
11142 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11144 if (DECL_NAME (decl
))
11145 cp_error ("parameter `%D' invalidly declared offset type",
11148 error ("parameter invalidly declared offset type");
11149 type
= build_pointer_type (type
);
11150 TREE_TYPE (decl
) = type
;
11152 else if (TREE_CODE (type
) == RECORD_TYPE
11153 && TYPE_LANG_SPECIFIC (type
)
11154 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
11156 abstract_virtuals_error (decl
, type
);
11157 any_error
= 1; /* Seems like a good idea. */
11159 else if (TREE_CODE (type
) == RECORD_TYPE
11160 && TYPE_LANG_SPECIFIC (type
)
11161 && IS_SIGNATURE (type
))
11163 signature_error (decl
, type
);
11164 any_error
= 1; /* Seems like a good idea. */
11166 else if (POINTER_TYPE_P (type
))
11169 while (POINTER_TYPE_P (t
)
11170 || (TREE_CODE (t
) == ARRAY_TYPE
11171 && TYPE_DOMAIN (t
) != NULL_TREE
))
11173 if (TREE_CODE (t
) == ARRAY_TYPE
)
11174 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11176 TYPE_PTR_P (type
) ? "pointer" : "reference");
11180 if (TREE_CODE (decl
) == VOID_TYPE
)
11182 if (result
== NULL_TREE
)
11184 result
= void_list_node
;
11185 last_result
= result
;
11189 TREE_CHAIN (last_result
) = void_list_node
;
11190 last_result
= void_list_node
;
11193 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11194 error ("`void' in parameter list must be entire list");
11198 /* Since there is a prototype, args are passed in their own types. */
11199 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11200 #ifdef PROMOTE_PROTOTYPES
11201 if ((TREE_CODE (type
) == INTEGER_TYPE
11202 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11203 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11204 DECL_ARG_TYPE (decl
) = integer_type_node
;
11211 if (TREE_CODE (init
) == SAVE_EXPR
)
11212 PARM_DECL_EXPR (init
) = 1;
11213 else if (processing_template_decl
)
11215 /* Unparsed default arg from in-class decl. */
11216 else if (TREE_CODE (init
) == DEFAULT_ARG
)
11218 else if (TREE_CODE (init
) == VAR_DECL
11219 || TREE_CODE (init
) == PARM_DECL
)
11221 if (IDENTIFIER_LOCAL_VALUE (DECL_NAME (init
)))
11223 /* ``Local variables may not be used in default
11224 argument expressions.'' dpANSI C++ 8.2.6 */
11225 /* If extern int i; within a function is not
11226 considered a local variable, then this code is
11228 cp_error ("local variable `%D' may not be used as a default argument", init
);
11231 else if (TREE_READONLY_DECL_P (init
))
11232 init
= decl_constant_value (init
);
11234 else if (TREE_TYPE (init
) == NULL_TREE
)
11236 error ("argument list may not have an initializer list");
11237 init
= error_mark_node
;
11240 if (! processing_template_decl
11241 && init
!= error_mark_node
11242 && TREE_CODE (init
) != DEFAULT_ARG
11243 && ! can_convert_arg (type
, TREE_TYPE (init
), init
))
11244 cp_pedwarn ("invalid type `%T' for default argument to `%#D'",
11245 TREE_TYPE (init
), decl
);
11251 if (decls
== NULL_TREE
)
11258 TREE_CHAIN (last_decl
) = decl
;
11261 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11263 TREE_PURPOSE (list_node
) = init
;
11264 TREE_VALUE (list_node
) = type
;
11265 TREE_CHAIN (list_node
) = NULL_TREE
;
11268 list_node
= saveable_tree_cons (init
, type
, NULL_TREE
);
11269 if (result
== NULL_TREE
)
11271 result
= list_node
;
11272 last_result
= result
;
11276 TREE_CHAIN (last_result
) = list_node
;
11277 last_result
= list_node
;
11281 TREE_CHAIN (last_result
) = NULL_TREE
;
11282 /* If there are no parameters, and the function does not end
11283 with `...', then last_decl will be NULL_TREE. */
11284 if (last_decl
!= NULL_TREE
)
11285 TREE_CHAIN (last_decl
) = NULL_TREE
;
11289 last_function_parms
= decls
;
11291 /* In a fcn definition, arg types must be complete. */
11292 if (funcdef_flag
> 0)
11293 require_complete_types_for_parms (last_function_parms
);
11298 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11299 FUNCTION_TYPE with the newly parsed version of its default argument, which
11300 was previously digested as text. See snarf_defarg et al in lex.c. */
11303 replace_defarg (arg
, init
)
11306 if (! processing_template_decl
11307 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11308 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11309 TREE_TYPE (init
), TREE_VALUE (arg
));
11310 TREE_PURPOSE (arg
) = init
;
11317 tree t
= FUNCTION_ARG_CHAIN (d
);
11318 if (DECL_CONSTRUCTOR_P (d
)
11319 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11320 t
= TREE_CHAIN (t
);
11321 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11322 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11323 == DECL_CLASS_CONTEXT (d
))
11324 && (TREE_CHAIN (t
) == NULL_TREE
11325 || TREE_CHAIN (t
) == void_list_node
11326 || TREE_PURPOSE (TREE_CHAIN (t
))))
11331 /* These memoizing functions keep track of special properties which
11332 a class may have. `grok_ctor_properties' notices whether a class
11333 has a constructor of the form X(X&), and also complains
11334 if the class has a constructor of the form X(X).
11335 `grok_op_properties' takes notice of the various forms of
11336 operator= which are defined, as well as what sorts of type conversion
11337 may apply. Both functions take a FUNCTION_DECL as an argument. */
11340 grok_ctor_properties (ctype
, decl
)
11343 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11344 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11346 /* When a type has virtual baseclasses, a magical first int argument is
11347 added to any ctor so we can tell if the class has been initialized
11348 yet. This could screw things up in this function, so we deliberately
11349 ignore the leading int if we're in that situation. */
11350 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11352 my_friendly_assert (parmtypes
11353 && TREE_VALUE (parmtypes
) == integer_type_node
,
11355 parmtypes
= TREE_CHAIN (parmtypes
);
11356 parmtype
= TREE_VALUE (parmtypes
);
11359 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11360 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11361 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11362 || TREE_CHAIN (parmtypes
) == void_list_node
11363 || TREE_PURPOSE (TREE_CHAIN (parmtypes
))))
11365 TYPE_HAS_INIT_REF (ctype
) = 1;
11366 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11367 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11369 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11370 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11371 || TREE_CHAIN (parmtypes
) == void_list_node
11372 || TREE_PURPOSE (TREE_CHAIN (parmtypes
))))
11374 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11376 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11379 else if (TREE_CODE (parmtype
) == VOID_TYPE
11380 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11381 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11386 /* An operator with this name can be either unary or binary. */
11392 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11393 || name
== ansi_opname
[(int) ADDR_EXPR
]
11394 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11395 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11396 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11397 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11400 /* An operator with this name can only be unary. */
11406 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11407 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11408 || name
== ansi_opname
[(int) COMPONENT_REF
]
11409 || OPERATOR_TYPENAME_P (name
));
11412 /* Do a little sanity-checking on how they declared their operator. */
11415 grok_op_properties (decl
, virtualp
, friendp
)
11417 int virtualp
, friendp
;
11419 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11420 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11421 tree name
= DECL_NAME (decl
);
11423 if (current_class_type
== NULL_TREE
)
11428 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11429 TYPE_HAS_ASSIGNMENT (current_class_type
) = 1;
11430 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11431 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11432 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11433 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11434 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11435 || name
== ansi_opname
[(int) MEMBER_REF
])
11436 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11437 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11438 TYPE_GETS_NEW (current_class_type
) |= 1;
11439 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11440 TYPE_GETS_DELETE (current_class_type
) |= 1;
11441 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11442 TYPE_GETS_NEW (current_class_type
) |= 2;
11443 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11444 TYPE_GETS_DELETE (current_class_type
) |= 2;
11447 if (name
== ansi_opname
[(int) NEW_EXPR
]
11448 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11450 /* When the compiler encounters the definition of A::operator new, it
11451 doesn't look at the class declaration to find out if it's static. */
11453 revert_static_member_fn (&decl
, NULL
, NULL
);
11455 /* Take care of function decl if we had syntax errors. */
11456 if (argtypes
== NULL_TREE
)
11458 = build_function_type (ptr_type_node
,
11459 hash_tree_chain (integer_type_node
,
11462 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11464 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11465 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11468 revert_static_member_fn (&decl
, NULL
, NULL
);
11470 if (argtypes
== NULL_TREE
)
11472 = build_function_type (void_type_node
,
11473 hash_tree_chain (ptr_type_node
,
11477 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11479 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11480 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11481 != void_list_node
))
11482 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11487 /* An operator function must either be a non-static member function
11488 or have at least one parameter of a class, a reference to a class,
11489 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11490 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11492 if (OPERATOR_TYPENAME_P (name
)
11493 || name
== ansi_opname
[(int) CALL_EXPR
]
11494 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11495 || name
== ansi_opname
[(int) COMPONENT_REF
]
11496 || name
== ansi_opname
[(int) ARRAY_REF
])
11497 cp_error ("`%D' must be a nonstatic member function", decl
);
11502 if (DECL_STATIC_FUNCTION_P (decl
))
11503 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11506 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11508 tree arg
= TREE_VALUE (p
);
11509 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11510 arg
= TREE_TYPE (arg
);
11512 /* This lets bad template code slip through. */
11513 if (IS_AGGR_TYPE (arg
)
11514 || TREE_CODE (arg
) == ENUMERAL_TYPE
11515 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11516 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11520 ("`%D' must have an argument of class or enumerated type",
11527 if (name
== ansi_opname
[(int) CALL_EXPR
])
11528 return; /* No restrictions on args. */
11530 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11532 tree t
= TREE_TYPE (name
);
11533 if (TREE_CODE (t
) == VOID_TYPE
)
11534 pedwarn ("void is not a valid type conversion operator");
11535 else if (! friendp
)
11537 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11540 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11542 if (t
== current_class_type
)
11543 what
= "the same type";
11544 /* Don't force t to be complete here. */
11545 else if (IS_AGGR_TYPE (t
)
11547 && DERIVED_FROM_P (t
, current_class_type
))
11548 what
= "a base class";
11551 warning ("conversion to %s%s will never use a type conversion operator",
11552 ref
? "a reference to " : "", what
);
11556 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11560 if (list_length (argtypes
) != 3 && methodp
)
11562 cp_error ("`%D' must take exactly one argument", decl
);
11565 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11567 if (copy_assignment_arg_p (parmtype
, virtualp
)
11570 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11571 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11572 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11573 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11576 else if (name
== ansi_opname
[(int) COND_EXPR
])
11579 pedwarn ("ANSI C++ prohibits overloading operator ?:");
11580 if (list_length (argtypes
) != 4)
11581 cp_error ("`%D' must take exactly three arguments", decl
);
11583 else if (ambi_op_p (name
))
11585 if (list_length (argtypes
) == 2)
11587 else if (list_length (argtypes
) == 3)
11589 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11590 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11591 && ! processing_template_decl
11592 && TREE_VALUE (TREE_CHAIN (argtypes
)) != integer_type_node
)
11595 cp_error ("postfix `%D' must take `int' as its argument",
11599 ("postfix `%D' must take `int' as its second argument",
11606 cp_error ("`%D' must take either zero or one argument", decl
);
11608 cp_error ("`%D' must take either one or two arguments", decl
);
11611 /* More Effective C++ rule 6. */
11613 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11614 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11616 tree arg
= TREE_VALUE (argtypes
);
11617 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11618 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11619 arg
= TREE_TYPE (arg
);
11620 arg
= TYPE_MAIN_VARIANT (arg
);
11621 if (list_length (argtypes
) == 2)
11623 if (TREE_CODE (ret
) != REFERENCE_TYPE
11624 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11626 cp_warning ("prefix `%D' should return `%T'", decl
,
11627 build_reference_type (arg
));
11631 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11632 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11636 else if (unary_op_p (name
))
11638 if (list_length (argtypes
) != 2)
11641 cp_error ("`%D' must take `void'", decl
);
11643 cp_error ("`%D' must take exactly one argument", decl
);
11646 else /* if (binary_op_p (name)) */
11648 if (list_length (argtypes
) != 3)
11651 cp_error ("`%D' must take exactly one argument", decl
);
11653 cp_error ("`%D' must take exactly two arguments", decl
);
11656 /* More Effective C++ rule 7. */
11658 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11659 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11660 || name
== ansi_opname
[COMPOUND_EXPR
]))
11661 cp_warning ("user-defined `%D' always evaluates both arguments",
11665 /* Effective C++ rule 23. */
11667 && list_length (argtypes
) == 3
11668 && (name
== ansi_opname
[PLUS_EXPR
]
11669 || name
== ansi_opname
[MINUS_EXPR
]
11670 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11671 || name
== ansi_opname
[MULT_EXPR
])
11672 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11673 cp_warning ("`%D' should return by value", decl
);
11677 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11678 if (TREE_PURPOSE (argtypes
))
11680 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11681 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11682 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11685 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11688 cp_error ("`%D' cannot have default arguments", decl
);
11695 enum tag_types code
;
11707 case signature_type
:
11708 return "signature";
11710 my_friendly_abort (981122);
11714 /* Get the struct, enum or union (CODE says which) with tag NAME.
11715 Define the tag as a forward-reference if it is not defined.
11717 C++: If a class derivation is given, process it here, and report
11718 an error if multiple derivation declarations are not identical.
11720 If this is a definition, come in through xref_tag and only look in
11721 the current frame for the name (since C++ allows new names in any
11725 xref_tag (code_type_node
, name
, globalize
)
11726 tree code_type_node
;
11730 enum tag_types tag_code
;
11731 enum tree_code code
;
11733 register tree ref
, t
;
11734 struct binding_level
*b
= inner_binding_level
;
11736 tree attributes
= NULL_TREE
;
11738 /* If we are called from the parser, code_type_node will sometimes be a
11739 TREE_LIST. This indicates that the user wrote
11740 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11742 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11744 attributes
= TREE_PURPOSE (code_type_node
);
11745 code_type_node
= TREE_VALUE (code_type_node
);
11748 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11753 case signature_type
:
11754 code
= RECORD_TYPE
;
11760 code
= ENUMERAL_TYPE
;
11763 my_friendly_abort (18);
11766 /* If a cross reference is requested, look up the type
11767 already defined for this tag and return it. */
11768 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11771 name
= TYPE_IDENTIFIER (t
);
11775 t
= IDENTIFIER_TYPE_VALUE (name
);
11777 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11778 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11783 if (t
&& (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
11784 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
))
11786 cp_error ("redeclaration of template type-parameter `%T'", name
);
11787 cp_error_at (" previously declared here `%#D'",
11788 TEMPLATE_TYPE_DECL (t
));
11790 if (t
&& TYPE_CONTEXT (t
) && got_type
)
11793 /* If we know we are defining this tag, only look it up in
11794 this scope and don't try to find it as a type. */
11795 ref
= lookup_tag (code
, name
, b
, 1);
11799 if (current_class_type
11800 && template_class_depth (current_class_type
)
11801 && PROCESSING_REAL_TEMPLATE_DECL_P ())
11802 /* Since GLOBALIZE is non-zero, we are not looking at a
11803 definition of this tag. Since, in addition, we are currently
11804 processing a (member) template declaration of a template
11805 class, we don't want to do any lookup at all; consider:
11812 { template <class V>
11813 friend struct S1; };
11815 Here, the S2::S1 declaration should not be confused with the
11816 outer declaration. In particular, the inner version should
11817 have a template parameter of level 2, not level 1. This
11818 would be particularly important if the member declaration
11821 template <class V = U> friend struct S1;
11823 say, when we should tsubst into `U' when instantiating S2. */
11829 if (t
!= TYPE_MAIN_VARIANT (t
))
11830 cp_pedwarn ("using typedef-name `%D' after `%s'",
11831 TYPE_NAME (t
), tag_name (tag_code
));
11835 ref
= lookup_tag (code
, name
, b
, 0);
11839 /* Try finding it as a type declaration. If that wins,
11841 ref
= lookup_name (name
, 1);
11843 if (ref
!= NULL_TREE
11844 && processing_template_decl
11845 && DECL_CLASS_TEMPLATE_P (ref
)
11846 && template_class_depth (current_class_type
) == 0)
11847 /* Since GLOBALIZE is true, we're declaring a global
11848 template, so we want this type. */
11849 ref
= DECL_RESULT (ref
);
11851 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
11852 && TREE_CODE (TREE_TYPE (ref
)) == code
)
11853 ref
= TREE_TYPE (ref
);
11860 push_obstacks_nochange ();
11864 /* If no such tag is yet defined, create a forward-reference node
11865 and record it as the "definition".
11866 When a real declaration of this type is found,
11867 the forward-reference will be altered into a real type. */
11869 /* In C++, since these migrate into the global scope, we must
11870 build them on the permanent obstack. */
11872 temp
= allocation_temporary_p ();
11874 end_temporary_allocation ();
11876 if (code
== ENUMERAL_TYPE
)
11878 cp_error ("use of enum `%#D' without previous declaration", name
);
11880 ref
= make_node (ENUMERAL_TYPE
);
11882 /* Give the type a default layout like unsigned int
11883 to avoid crashing if it does not get defined. */
11884 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
11885 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
11886 TREE_UNSIGNED (ref
) = 1;
11887 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
11888 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
11889 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
11891 /* Enable us to recognize when a type is created in class context.
11892 To do nested classes correctly, this should probably be cleared
11893 out when we leave this classes scope. Currently this in only
11894 done in `start_enum'. */
11896 pushtag (name
, ref
, globalize
);
11900 struct binding_level
*old_b
= class_binding_level
;
11902 ref
= make_lang_type (code
);
11904 if (tag_code
== signature_type
)
11906 SET_SIGNATURE (ref
);
11907 /* Since a signature type will be turned into the type
11908 of signature tables, it's not only an interface. */
11909 CLASSTYPE_INTERFACE_ONLY (ref
) = 0;
11910 SET_CLASSTYPE_INTERFACE_KNOWN (ref
);
11911 /* A signature doesn't have a vtable. */
11912 CLASSTYPE_VTABLE_NEEDS_WRITING (ref
) = 0;
11915 #ifdef NONNESTED_CLASSES
11916 /* Class types don't nest the way enums do. */
11917 class_binding_level
= (struct binding_level
*)0;
11919 pushtag (name
, ref
, globalize
);
11920 class_binding_level
= old_b
;
11925 /* If it no longer looks like a nested type, make sure it's
11927 If it is not an IDENTIFIER, this is not a declaration */
11928 if (b
->namespace_p
&& !class_binding_level
11929 && TREE_CODE (name
) == IDENTIFIER_NODE
)
11931 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
11932 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
11935 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
11936 redeclare_class_template (ref
, current_template_parms
);
11939 /* Until the type is defined, tentatively accept whatever
11940 structure tag the user hands us. */
11941 if (TYPE_SIZE (ref
) == NULL_TREE
11942 && ref
!= current_class_type
11943 /* Have to check this, in case we have contradictory tag info. */
11944 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
11946 if (tag_code
== class_type
)
11947 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
11948 else if (tag_code
== record_type
|| tag_code
== signature_type
)
11949 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
11954 TREE_TYPE (ref
) = attributes
;
11956 if (ref
&& TYPE_P (ref
))
11960 If the identifier resolves to a typedef-name or a template
11961 type-parameter, the elaborated-type-specifier is
11963 if (TYPE_LANG_SPECIFIC (ref
) && TYPE_WAS_ANONYMOUS (ref
))
11964 cp_error ("`%T' is a typedef name", ref
);
11965 else if (TREE_CODE (ref
) == TEMPLATE_TYPE_PARM
)
11966 cp_error ("`%T' is a template type paramter", ref
);
11973 xref_tag_from_type (old
, id
, globalize
)
11977 tree code_type_node
;
11979 if (TREE_CODE (old
) == RECORD_TYPE
)
11980 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
11981 ? class_type_node
: record_type_node
);
11983 code_type_node
= union_type_node
;
11985 if (id
== NULL_TREE
)
11986 id
= TYPE_IDENTIFIER (old
);
11988 return xref_tag (code_type_node
, id
, globalize
);
11992 xref_basetypes (code_type_node
, name
, ref
, binfo
)
11993 tree code_type_node
;
11997 /* In the declaration `A : X, Y, ... Z' we mark all the types
11998 (A, X, Y, ..., Z) so we can check for duplicates. */
12001 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12003 if (tag_code
== union_type
)
12005 cp_error ("derived union `%T' invalid", ref
);
12009 len
= list_length (binfo
);
12010 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12012 SET_CLASSTYPE_MARKED (ref
);
12013 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12015 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12017 /* The base of a derived struct is public by default. */
12019 = (TREE_PURPOSE (binfo
) == access_public_node
12020 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12021 || (tag_code
!= class_type
12022 && (TREE_PURPOSE (binfo
) == access_default_node
12023 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12025 = (TREE_PURPOSE (binfo
) == access_protected_node
12026 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12028 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12029 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12030 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12031 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12032 tree basetype
= TREE_VALUE (binfo
);
12035 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12036 basetype
= TREE_TYPE (basetype
);
12038 || (TREE_CODE (basetype
) != RECORD_TYPE
12039 && TREE_CODE (basetype
) != TYPENAME_TYPE
12040 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12041 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12043 cp_error ("base type `%T' fails to be a struct or class type",
12044 TREE_VALUE (binfo
));
12048 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12051 /* This code replaces similar code in layout_basetypes.
12052 We put the complete_type first for implicit `typename'. */
12053 if (TYPE_SIZE (complete_type (basetype
)) == NULL_TREE
12054 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12056 cp_error ("base class `%T' has incomplete type", basetype
);
12062 if (CLASSTYPE_MARKED (basetype
))
12064 if (basetype
== ref
)
12065 cp_error ("recursive type `%T' undefined", basetype
);
12067 cp_error ("duplicate base type `%T' invalid", basetype
);
12071 if (TYPE_FOR_JAVA (basetype
)
12072 && current_lang_stack
== current_lang_base
)
12073 TYPE_FOR_JAVA (ref
) = 1;
12075 /* Note that the BINFO records which describe individual
12076 inheritances are *not* shared in the lattice! They
12077 cannot be shared because a given baseclass may be
12078 inherited with different `accessibility' by different
12079 derived classes. (Each BINFO record describing an
12080 individual inheritance contains flags which say what
12081 the `accessibility' of that particular inheritance is.) */
12084 = make_binfo (integer_zero_node
, basetype
,
12085 CLASS_TYPE_P (basetype
)
12086 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12087 CLASS_TYPE_P (basetype
)
12088 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12090 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12091 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12092 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12093 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12094 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12096 /* We need to unshare the binfos now so that lookups during class
12097 definition work. */
12098 unshare_base_binfos (base_binfo
);
12100 SET_CLASSTYPE_MARKED (basetype
);
12102 /* We are free to modify these bits because they are meaningless
12103 at top level, and BASETYPE is a top-level type. */
12104 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12106 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12107 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12110 if (CLASS_TYPE_P (basetype
))
12112 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12113 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12120 TREE_VEC_LENGTH (binfos
) = i
;
12122 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12125 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12128 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12130 if (CLASS_TYPE_P (basetype
))
12131 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12132 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12135 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12136 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12138 /* Unmark all the types. */
12140 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12141 CLEAR_CLASSTYPE_MARKED (ref
);
12147 /* Begin compiling the definition of an enumeration type.
12148 NAME is its name (or null if anonymous).
12149 Returns the type object, as yet incomplete.
12150 Also records info about it so that build_enumerator
12151 may be used to declare the individual values as they are read. */
12157 register tree enumtype
= NULL_TREE
;
12158 struct binding_level
*b
= inner_binding_level
;
12160 /* We are wasting space here and putting these on the permanent_obstack so
12161 that typeid(local enum) will work correctly. */
12163 if (processing_template_decl
&& current_function_decl
)
12166 end_temporary_allocation ();
12168 /* If this is the real definition for a previous forward reference,
12169 fill in the contents in the same object that used to be the
12170 forward reference. */
12172 if (name
!= NULL_TREE
)
12173 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12175 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12176 cp_error ("multiple definition of `%#T'", enumtype
);
12179 enumtype
= make_node (ENUMERAL_TYPE
);
12180 pushtag (name
, enumtype
, 0);
12183 if (current_class_type
)
12184 TREE_ADDRESSABLE (b
->tags
) = 1;
12186 /* We don't copy this value because build_enumerator needs to do it. */
12187 enum_next_value
= integer_zero_node
;
12190 GNU_xref_decl (current_function_decl
, enumtype
);
12194 /* After processing and defining all the values of an enumeration type,
12195 install their decls in the enumeration type and finish it off.
12196 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12197 Returns ENUMTYPE. */
12200 finish_enum (enumtype
)
12203 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12204 /* Calculate the maximum value of any enumerator in this type. */
12206 tree values
= TYPE_VALUES (enumtype
);
12211 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12216 /* The TREE_VALUE is a CONST_DECL for this enumeration
12218 decl
= TREE_VALUE (pair
);
12220 /* The DECL_INITIAL will be NULL if we are processing a
12221 template declaration and this enumeration constant had no
12222 explicit initializer. */
12223 value
= DECL_INITIAL (decl
);
12224 if (value
&& !processing_template_decl
)
12226 /* Set the TREE_TYPE for the VALUE as well. That's so
12227 that when we call decl_constant_value we get an
12228 entity of the right type (but with the constant
12229 value). Since we shouldn't ever call
12230 decl_constant_value on a template type, there's no
12231 reason to do that when processing_template_decl.
12232 And, if the expression is something like a
12233 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12234 wreak havoc on the intended type of the expression.
12236 Of course, there's also no point in trying to compute
12237 minimum or maximum values if we're in a template. */
12238 TREE_TYPE (value
) = enumtype
;
12241 minnode
= maxnode
= value
;
12242 else if (tree_int_cst_lt (maxnode
, value
))
12244 else if (tree_int_cst_lt (value
, minnode
))
12248 if (processing_template_decl
)
12249 /* If this is just a template, leave the CONST_DECL
12250 alone. That way tsubst_copy will find CONST_DECLs for
12251 CONST_DECLs, and not INTEGER_CSTs. */
12254 /* In the list we're building up, we want the enumeration
12255 values, not the CONST_DECLs. */
12256 TREE_VALUE (pair
) = value
;
12260 maxnode
= minnode
= integer_zero_node
;
12262 TYPE_VALUES (enumtype
) = nreverse (values
);
12264 if (processing_template_decl
)
12266 tree scope
= current_scope ();
12267 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12269 add_tree (build_min (TAG_DEFN
, enumtype
));
12270 resume_temporary_allocation ();
12276 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12277 int lowprec
= min_precision (minnode
, unsignedp
);
12278 int highprec
= min_precision (maxnode
, unsignedp
);
12279 int precision
= MAX (lowprec
, highprec
);
12281 TYPE_SIZE (enumtype
) = NULL_TREE
;
12283 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12285 TYPE_PRECISION (enumtype
) = precision
;
12287 fixup_unsigned_type (enumtype
);
12289 fixup_signed_type (enumtype
);
12291 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12292 /* Use the width of the narrowest normal C type which is wide enough. */
12293 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12296 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12298 TYPE_SIZE (enumtype
) = 0;
12299 layout_type (enumtype
);
12305 /* Fix up all variant types of this enum type. */
12306 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12307 tem
= TYPE_NEXT_VARIANT (tem
))
12309 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12310 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12311 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12312 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12313 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12314 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12315 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12316 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12317 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12321 /* Finish debugging output for this type. */
12322 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12327 /* Build and install a CONST_DECL for an enumeration constant of the
12328 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12329 Assignment of sequential values by default is handled here. */
12332 build_enumerator (name
, value
, type
)
12340 /* Remove no-op casts from the value. */
12342 STRIP_TYPE_NOPS (value
);
12344 if (! processing_template_decl
)
12346 /* Validate and default VALUE. */
12347 if (value
!= NULL_TREE
)
12349 if (TREE_READONLY_DECL_P (value
))
12350 value
= decl_constant_value (value
);
12352 if (TREE_CODE (value
) == INTEGER_CST
)
12354 value
= default_conversion (value
);
12355 constant_expression_warning (value
);
12359 cp_error ("enumerator value for `%D' not integer constant", name
);
12364 /* Default based on previous value. */
12365 if (value
== NULL_TREE
&& ! processing_template_decl
)
12367 value
= enum_next_value
;
12369 cp_error ("overflow in enumeration values at `%D'", name
);
12372 /* Remove no-op casts from the value. */
12374 STRIP_TYPE_NOPS (value
);
12376 /* To fix MAX_VAL enum consts. (bkoz) */
12377 TREE_TYPE (value
) = integer_type_node
;
12381 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12382 Even in other cases, we will later (in finish_enum) be setting the
12384 if (value
!= NULL_TREE
)
12385 value
= copy_node (value
);
12387 /* C++ associates enums with global, function, or class declarations. */
12389 context
= current_scope ();
12390 if (context
&& context
== current_class_type
)
12391 /* This enum declaration is local to the class. */
12392 decl
= build_lang_field_decl (CONST_DECL
, name
, type
);
12394 /* It's a global enum, or it's local to a function. (Note local to
12395 a function could mean local to a class method. */
12396 decl
= build_decl (CONST_DECL
, name
, type
);
12398 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12399 DECL_INITIAL (decl
) = value
;
12400 TREE_READONLY (decl
) = 1;
12402 if (context
&& context
== current_class_type
)
12404 pushdecl_class_level (decl
);
12405 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12406 on the TYPE_FIELDS list for `S'. (That's so that you can say
12407 things like `S::i' later.) */
12408 finish_member_declaration (decl
);
12413 GNU_xref_decl (current_function_decl
, decl
);
12416 if (! processing_template_decl
)
12418 /* Set basis for default for next value. */
12419 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12420 integer_one_node
, PLUS_EXPR
);
12421 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12424 result
= saveable_tree_cons (name
, decl
, NULL_TREE
);
12429 static int function_depth
;
12431 /* Create the FUNCTION_DECL for a function definition.
12432 DECLSPECS and DECLARATOR are the parts of the declaration;
12433 they describe the function's name and the type it returns,
12434 but twisted together in a fashion that parallels the syntax of C.
12436 This function creates a binding context for the function body
12437 as well as setting up the FUNCTION_DECL in current_function_decl.
12439 Returns 1 on success. If the DECLARATOR is not suitable for a function
12440 (it defines a datum instead), we return 0, which tells
12441 yyparse to report a parse error.
12443 For C++, we must first check whether that datum makes any sense.
12444 For example, "class A local_a(1,2);" means that variable local_a
12445 is an aggregate of type A, which should have a constructor
12446 applied to it with the argument list [1, 2].
12448 @@ There is currently no way to retrieve the storage
12449 @@ allocated to FUNCTION (or all of its parms) if we return
12450 @@ something we had previously. */
12453 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
12454 tree declspecs
, declarator
, attrs
;
12458 tree ctype
= NULL_TREE
;
12461 extern int have_extern_spec
;
12462 extern int used_extern_spec
;
12463 int doing_friend
= 0;
12465 /* Sanity check. */
12466 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12467 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12469 /* Assume, until we see it does. */
12470 current_function_returns_value
= 0;
12471 current_function_returns_null
= 0;
12473 shadowed_labels
= 0;
12474 current_function_assigns_this
= 0;
12475 current_function_just_assigned_this
= 0;
12476 current_function_parms_stored
= 0;
12477 original_result_rtx
= NULL_RTX
;
12478 base_init_expr
= NULL_TREE
;
12479 current_base_init_list
= NULL_TREE
;
12480 current_member_init_list
= NULL_TREE
;
12481 ctor_label
= dtor_label
= NULL_TREE
;
12482 static_labelno
= 0;
12484 clear_temp_name ();
12486 /* This should only be done once on the top most decl. */
12487 if (have_extern_spec
&& !used_extern_spec
)
12489 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12490 used_extern_spec
= 1;
12495 decl1
= declarator
;
12498 /* What was this testing for, exactly? */
12499 if (! DECL_ARGUMENTS (decl1
)
12500 && !DECL_STATIC_FUNCTION_P (decl1
)
12501 && !DECL_ARTIFICIAL (decl1
)
12502 && DECL_CLASS_SCOPE_P (decl1
)
12503 && TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))
12504 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))))
12506 tree binding
= binding_for_name (DECL_NAME (decl1
),
12507 current_namespace
);
12508 cp_error ("redeclaration of `%#D'", decl1
);
12509 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)))
12510 cp_error_at ("previous declaration here", IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)));
12511 else if (BINDING_VALUE (binding
))
12512 cp_error_at ("previous declaration here", BINDING_VALUE (binding
));
12516 fntype
= TREE_TYPE (decl1
);
12517 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12518 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12520 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12521 class is in the (lexical) scope of the class in which it is
12523 if (!ctype
&& DECL_FRIEND_P (decl1
))
12525 ctype
= DECL_CLASS_CONTEXT (decl1
);
12527 /* CTYPE could be null here if we're dealing with a template;
12528 for example, `inline friend float foo()' inside a template
12529 will have no CTYPE set. */
12530 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12536 /* In a fcn definition, arg types must be complete. */
12537 require_complete_types_for_parms (DECL_ARGUMENTS (decl1
));
12539 /* In case some arg types were completed since the declaration was
12540 parsed, fix up the decls. */
12542 tree t
= DECL_ARGUMENTS (decl1
);
12543 for (; t
; t
= TREE_CHAIN (t
))
12544 layout_decl (t
, 0);
12547 last_function_parms
= DECL_ARGUMENTS (decl1
);
12548 last_function_parm_tags
= NULL_TREE
;
12552 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12553 /* If the declarator is not suitable for a function definition,
12554 cause a syntax error. */
12555 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12557 fntype
= TREE_TYPE (decl1
);
12559 restype
= TREE_TYPE (fntype
);
12560 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12562 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12563 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12564 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12565 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12566 fntype
= build_function_type (integer_type_node
,
12567 TYPE_ARG_TYPES (fntype
));
12569 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12571 TYPE_ARG_TYPES (fntype
));
12572 TREE_TYPE (decl1
) = fntype
;
12575 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12576 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12577 else if (DECL_MAIN_P (decl1
))
12579 /* If this doesn't return integer_type, complain. */
12580 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12582 if (pedantic
|| warn_return_type
)
12583 pedwarn ("return type for `main' changed to `int'");
12584 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12589 /* Warn if function was previously implicitly declared
12590 (but not if we warned then). */
12591 if (! warn_implicit
12592 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12593 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12595 current_function_decl
= decl1
;
12596 /* Save the parm names or decls from this function's declarator
12597 where store_parm_decls will find them. */
12598 current_function_parms
= last_function_parms
;
12599 current_function_parm_tags
= last_function_parm_tags
;
12601 announce_function (decl1
);
12603 if (! processing_template_decl
)
12605 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12607 cp_error ("return-type `%#T' is an incomplete type",
12608 TREE_TYPE (fntype
));
12610 /* Make it return void instead, but don't change the
12611 type of the DECL_RESULT, in case we have a named return value. */
12614 = build_cplus_method_type (build_type_variant (ctype
,
12615 TREE_READONLY (decl1
),
12616 TREE_SIDE_EFFECTS (decl1
)),
12618 FUNCTION_ARG_CHAIN (decl1
));
12621 = build_function_type (void_type_node
,
12622 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
12623 DECL_RESULT (decl1
)
12624 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
12625 TREE_READONLY (DECL_RESULT (decl1
))
12626 = CP_TYPE_CONST_P (TREE_TYPE (fntype
));
12627 TREE_THIS_VOLATILE (DECL_RESULT (decl1
))
12628 = CP_TYPE_VOLATILE_P (TREE_TYPE (fntype
));
12631 if (TYPE_LANG_SPECIFIC (TREE_TYPE (fntype
))
12632 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (fntype
)))
12633 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
12636 /* Effective C++ rule 15. See also c_expand_return. */
12638 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12639 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12640 cp_warning ("`operator=' should return a reference to `*this'");
12642 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12643 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12644 DECL_INITIAL (decl1
) = error_mark_node
;
12646 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12647 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12650 /* This function exists in static storage.
12651 (This does not mean `static' in the C sense!) */
12652 TREE_STATIC (decl1
) = 1;
12654 /* Set up current_class_type, and enter the scope of the class, if
12657 push_nested_class (ctype
, 1);
12658 else if (DECL_STATIC_FUNCTION_P (decl1
))
12659 push_nested_class (DECL_CONTEXT (decl1
), 2);
12661 /* We must call push_template_decl after current_class_type is set
12662 up. (If we are processing inline definitions after exiting a
12663 class scope, current_class_type will be NULL_TREE until set above
12664 by push_nested_class.) */
12665 if (processing_template_decl
)
12666 decl1
= push_template_decl (decl1
);
12668 /* Record the decl so that the function name is defined.
12669 If we already have a decl for this name, and it is a FUNCTION_DECL,
12670 use the old decl. */
12671 if (!processing_template_decl
&& pre_parsed_p
== 0)
12673 /* A specialization is not used to guide overload resolution. */
12674 if ((flag_guiding_decls
12675 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12676 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12677 decl1
= pushdecl (decl1
);
12680 /* We need to set the DECL_CONTEXT. */
12681 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12682 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12683 /* And make sure we have enough default args. */
12684 check_default_args (decl1
);
12686 DECL_MAIN_VARIANT (decl1
) = decl1
;
12687 fntype
= TREE_TYPE (decl1
);
12690 current_function_decl
= decl1
;
12692 if (DECL_INTERFACE_KNOWN (decl1
))
12694 tree ctx
= hack_decl_function_context (decl1
);
12696 if (DECL_NOT_REALLY_EXTERN (decl1
))
12697 DECL_EXTERNAL (decl1
) = 0;
12699 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12700 && TREE_PUBLIC (ctx
))
12701 /* This is a function in a local class in an extern inline
12703 comdat_linkage (decl1
);
12705 /* If this function belongs to an interface, it is public.
12706 If it belongs to someone else's interface, it is also external.
12707 It doesn't matter whether it's inline or not. */
12708 else if (interface_unknown
== 0
12709 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12710 || flag_alt_external_templates
))
12712 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12713 || processing_template_decl
)
12714 DECL_EXTERNAL (decl1
)
12716 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
));
12718 DECL_EXTERNAL (decl1
) = 0;
12719 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
12720 DECL_INTERFACE_KNOWN (decl1
) = 1;
12724 /* This is a definition, not a reference.
12725 So clear DECL_EXTERNAL. */
12726 DECL_EXTERNAL (decl1
) = 0;
12728 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
12729 && ! DECL_INTERFACE_KNOWN (decl1
)
12730 /* Don't try to defer nested functions for now. */
12731 && ! hack_decl_function_context (decl1
))
12732 DECL_DEFER_OUTPUT (decl1
) = 1;
12734 DECL_INTERFACE_KNOWN (decl1
) = 1;
12737 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
12739 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12740 TREE_TYPE (decl1
) = fntype
12741 = build_function_type (TREE_TYPE (fntype
),
12742 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
12743 current_function_parms
= TREE_CHAIN (current_function_parms
);
12744 DECL_ARGUMENTS (decl1
) = current_function_parms
;
12747 restype
= TREE_TYPE (fntype
);
12751 /* If we're compiling a friend function, neither of the variables
12752 current_class_ptr nor current_class_type will have values. */
12753 if (! doing_friend
)
12755 /* We know that this was set up by `grokclassfn'.
12756 We do not wait until `store_parm_decls', since evil
12757 parse errors may never get us to that point. Here
12758 we keep the consistency between `current_class_type'
12759 and `current_class_ptr'. */
12760 tree t
= current_function_parms
;
12762 my_friendly_assert (t
!= NULL_TREE
12763 && TREE_CODE (t
) == PARM_DECL
, 162);
12765 if (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
)
12769 if (! hack_decl_function_context (decl1
))
12770 temporary_allocation ();
12771 i
= suspend_momentary ();
12773 /* Normally, build_indirect_ref returns
12774 current_class_ref whenever current_class_ptr is
12775 dereferenced. This time, however, we want it to
12776 *create* current_class_ref, so we temporarily clear
12777 current_class_ptr to fool it. */
12778 current_class_ptr
= NULL_TREE
;
12779 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
12780 current_class_ptr
= t
;
12782 resume_momentary (i
);
12783 if (! hack_decl_function_context (decl1
))
12784 end_temporary_allocation ();
12787 /* We're having a signature pointer here. */
12788 current_class_ref
= current_class_ptr
= t
;
12793 current_class_ptr
= current_class_ref
= NULL_TREE
;
12796 current_binding_level
->parm_flag
= 1;
12798 GNU_xref_function (decl1
, current_function_parms
);
12801 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
12803 make_function_rtl (decl1
);
12805 /* Promote the value to int before returning it. */
12806 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
12807 restype
= type_promotes_to (restype
);
12809 /* If this fcn was already referenced via a block-scope `extern' decl
12810 (or an implicit decl), propagate certain information about the usage. */
12811 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
12812 TREE_ADDRESSABLE (decl1
) = 1;
12814 if (DECL_RESULT (decl1
) == NULL_TREE
)
12816 DECL_RESULT (decl1
)
12817 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12818 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
12819 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
12822 /* Allocate further tree nodes temporarily during compilation
12823 of this function only. Tiemann moved up here from bottom of fn. */
12824 /* If this is a nested function, then we must continue to allocate RTL
12825 on the permanent obstack in case we need to inline it later. */
12826 if (! hack_decl_function_context (decl1
))
12827 temporary_allocation ();
12829 if (processing_template_decl
)
12831 ++minimal_parse_mode
;
12832 last_tree
= DECL_SAVED_TREE (decl1
)
12833 = build_nt (EXPR_STMT
, void_zero_node
);
12838 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
12839 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
12841 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
12842 ctor_label
= NULL_TREE
;
12846 dtor_label
= NULL_TREE
;
12847 if (DECL_CONSTRUCTOR_P (decl1
))
12848 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
12854 /* Called after store_parm_decls for a function-try-block. We need to update
12855 last_parm_cleanup_insn so that the base initializers for a constructor
12856 are run within this block, not before it. */
12859 expand_start_early_try_stmts ()
12861 expand_start_try_stmts ();
12862 last_parm_cleanup_insn
= get_last_insn ();
12865 /* Store the parameter declarations into the current function declaration.
12866 This is called after parsing the parameter declarations, before
12867 digesting the body of the function.
12869 Also install to binding contour return value identifier, if any. */
12872 store_parm_decls ()
12874 register tree fndecl
= current_function_decl
;
12875 register tree parm
;
12876 int parms_have_cleanups
= 0;
12877 tree cleanups
= NULL_TREE
;
12879 /* This is either a chain of PARM_DECLs (when a prototype is used). */
12880 tree specparms
= current_function_parms
;
12882 /* This is a list of types declared among parms in a prototype. */
12883 tree parmtags
= current_function_parm_tags
;
12885 /* This is a chain of any other decls that came in among the parm
12886 declarations. If a parm is declared with enum {foo, bar} x;
12887 then CONST_DECLs for foo and bar are put here. */
12888 tree nonparms
= NULL_TREE
;
12890 if (toplevel_bindings_p ())
12891 fatal ("parse errors have confused me too much");
12893 /* Initialize RTL machinery. */
12894 init_function_start (fndecl
, input_filename
, lineno
);
12896 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
12897 declare_function_name ();
12899 /* Create a binding level for the parms. */
12900 expand_start_bindings (0);
12902 if (specparms
!= NULL_TREE
)
12904 /* This case is when the function was defined with an ANSI prototype.
12905 The parms already have decls, so we need not do anything here
12906 except record them as in effect
12907 and complain if any redundant old-style parm decls were written. */
12909 register tree next
;
12911 /* Must clear this because it might contain TYPE_DECLs declared
12913 storedecls (NULL_TREE
);
12915 for (parm
= nreverse (specparms
); parm
; parm
= next
)
12917 next
= TREE_CHAIN (parm
);
12918 if (TREE_CODE (parm
) == PARM_DECL
)
12921 if (DECL_NAME (parm
) == NULL_TREE
)
12925 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
12926 cp_error ("parameter `%D' declared void", parm
);
12929 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
12930 A parameter is assumed not to have any side effects.
12931 If this should change for any reason, then this
12932 will have to wrap the bashed reference type in a save_expr.
12934 Also, if the parameter type is declared to be an X
12935 and there is an X(X&) constructor, we cannot lay it
12936 into the stack (any more), so we make this parameter
12937 look like it is really of reference type. Functions
12938 which pass parameters to this function will know to
12939 create a temporary in their frame, and pass a reference
12942 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
12943 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
12944 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
12948 if (! processing_template_decl
12949 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
12951 expand_decl (parm
);
12952 parms_have_cleanups
= 1;
12954 /* Keep track of the cleanups. */
12955 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
12960 /* If we find an enum constant or a type tag,
12961 put it aside for the moment. */
12962 TREE_CHAIN (parm
) = NULL_TREE
;
12963 nonparms
= chainon (nonparms
, parm
);
12967 /* Get the decls in their original chain order
12968 and record in the function. This is all and only the
12969 PARM_DECLs that were pushed into scope by the loop above. */
12970 DECL_ARGUMENTS (fndecl
) = getdecls ();
12972 storetags (chainon (parmtags
, gettags ()));
12975 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
12977 /* Now store the final chain of decls for the arguments
12978 as the decl-chain of the current lexical scope.
12979 Put the enumerators in as well, at the front so that
12980 DECL_ARGUMENTS is not modified. */
12982 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
12984 /* Initialize the RTL code for the function. */
12985 DECL_SAVED_INSNS (fndecl
) = NULL_RTX
;
12986 if (! processing_template_decl
)
12987 expand_function_start (fndecl
, parms_have_cleanups
);
12989 current_function_parms_stored
= 1;
12991 /* If this function is `main', emit a call to `__main'
12992 to run global initializers, etc. */
12993 if (DECL_MAIN_P (fndecl
))
12994 expand_main_function ();
12996 /* Now that we have initialized the parms, we can start their
12997 cleanups. We cannot do this before, since expand_decl_cleanup
12998 should not be called before the parm can be used. */
13000 && ! processing_template_decl
)
13002 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
13004 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
13005 cp_error ("parser lost in parsing declaration of `%D'",
13006 TREE_PURPOSE (cleanups
));
13010 /* Create a binding contour which can be used to catch
13011 cleanup-generated temporaries. Also, if the return value needs or
13012 has initialization, deal with that now. */
13013 if (parms_have_cleanups
)
13016 expand_start_bindings (0);
13019 if (! processing_template_decl
&& flag_exceptions
)
13021 /* Do the starting of the exception specifications, if we have any. */
13022 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13023 expand_start_eh_spec ();
13026 last_parm_cleanup_insn
= get_last_insn ();
13027 last_dtor_insn
= get_last_insn ();
13030 /* Bind a name and initialization to the return value of
13031 the current function. */
13034 store_return_init (return_id
, init
)
13035 tree return_id
, init
;
13037 tree decl
= DECL_RESULT (current_function_decl
);
13040 /* Give this error as many times as there are occurrences,
13041 so that users can use Emacs compilation buffers to find
13042 and fix all such places. */
13043 pedwarn ("ANSI C++ does not permit named return values");
13045 if (return_id
!= NULL_TREE
)
13047 if (DECL_NAME (decl
) == NULL_TREE
)
13049 DECL_NAME (decl
) = return_id
;
13050 DECL_ASSEMBLER_NAME (decl
) = return_id
;
13053 cp_error ("return identifier `%D' already in place", decl
);
13056 /* Can't let this happen for constructors. */
13057 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13059 error ("can't redefine default return value for constructors");
13063 /* If we have a named return value, put that in our scope as well. */
13064 if (DECL_NAME (decl
) != NULL_TREE
)
13066 /* If this named return value comes in a register,
13067 put it in a pseudo-register. */
13068 if (DECL_REGISTER (decl
))
13070 original_result_rtx
= DECL_RTL (decl
);
13071 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13074 /* Let `cp_finish_decl' know that this initializer is ok. */
13075 DECL_INITIAL (decl
) = init
;
13078 if (minimal_parse_mode
)
13079 add_tree (build_min_nt (RETURN_INIT
, return_id
,
13080 copy_to_permanent (init
)));
13082 cp_finish_decl (decl
, init
, NULL_TREE
, 0, 0);
13087 /* Finish up a function declaration and compile that function
13088 all the way to assembler language output. The free the storage
13089 for the function definition.
13091 This is called after parsing the body of the function definition.
13092 LINENO is the current line number.
13094 C++: CALL_POPLEVEL is non-zero if an extra call to poplevel
13095 (and expand_end_bindings) must be made to take care of the binding
13096 contour for the base initializers. This is only relevant for
13099 NESTED is nonzero if we were in the middle of compiling another function
13100 when we started on this one. */
13103 finish_function (lineno
, call_poplevel
, nested
)
13108 register tree fndecl
= current_function_decl
;
13109 tree fntype
, ctype
= NULL_TREE
;
13110 rtx last_parm_insn
, insns
;
13111 /* Label to use if this function is supposed to return a value. */
13112 tree no_return_label
= NULL_TREE
;
13113 tree decls
= NULL_TREE
;
13115 /* When we get some parse errors, we can end up without a
13116 current_function_decl, so cope. */
13117 if (fndecl
== NULL_TREE
)
13120 if (! nested
&& function_depth
> 1)
13123 fntype
= TREE_TYPE (fndecl
);
13125 /* TREE_READONLY (fndecl) = 1;
13126 This caused &foo to be of type ptr-to-const-function
13127 which then got a warning when stored in a ptr-to-function variable. */
13129 /* This happens on strange parse errors. */
13130 if (! current_function_parms_stored
)
13133 store_parm_decls ();
13136 if (processing_template_decl
)
13138 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13140 decls
= getdecls ();
13141 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13142 poplevel (decls
!= NULL_TREE
, 0, 0);
13147 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13149 tree ttype
= target_type (fntype
);
13152 if (IS_AGGR_TYPE (ttype
))
13153 /* Let debugger know it should output info for this type. */
13154 note_debug_info_needed (ttype
);
13156 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13158 ttype
= target_type (TREE_TYPE (parmdecl
));
13159 if (IS_AGGR_TYPE (ttype
))
13160 /* Let debugger know it should output info for this type. */
13161 note_debug_info_needed (ttype
);
13165 /* Clean house because we will need to reorder insns here. */
13166 do_pending_stack_adjust ();
13170 tree binfo
= TYPE_BINFO (current_class_type
);
13171 tree cond
= integer_one_node
;
13173 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13175 int ok_to_optimize_dtor
= 0;
13176 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13178 if (current_function_assigns_this
)
13179 cond
= build (NE_EXPR
, boolean_type_node
,
13180 current_class_ptr
, integer_zero_node
);
13183 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13185 /* If this destructor is empty, then we don't need to check
13186 whether `this' is NULL in some cases. */
13187 if ((flag_this_is_variable
& 1) == 0)
13188 ok_to_optimize_dtor
= 1;
13189 else if (empty_dtor
)
13190 ok_to_optimize_dtor
13191 = (n_baseclasses
== 0
13192 || (n_baseclasses
== 1
13193 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13196 /* These initializations might go inline. Protect
13197 the binding level of the parms. */
13199 expand_start_bindings (0);
13201 if (current_function_assigns_this
)
13203 current_function_assigns_this
= 0;
13204 current_function_just_assigned_this
= 0;
13207 /* Generate the code to call destructor on base class.
13208 If this destructor belongs to a class with virtual
13209 functions, then set the virtual function table
13210 pointer to represent the type of our base class. */
13212 /* This side-effect makes call to `build_delete' generate the
13213 code we have to have at the end of this destructor.
13214 `build_delete' will set the flag again. */
13215 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13217 /* These are two cases where we cannot delegate deletion. */
13218 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13219 || TYPE_GETS_REG_DELETE (current_class_type
))
13220 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13221 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13223 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13224 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13226 /* If we did not assign to this, then `this' is non-zero at
13227 the end of a destructor. As a special optimization, don't
13228 emit test if this is an empty destructor. If it does nothing,
13229 it does nothing. If it calls a base destructor, the base
13230 destructor will perform the test. */
13232 if (exprstmt
!= error_mark_node
13233 && (TREE_CODE (exprstmt
) != NOP_EXPR
13234 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13235 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13237 expand_label (dtor_label
);
13238 if (cond
!= integer_one_node
)
13239 expand_start_cond (cond
, 0);
13240 if (exprstmt
!= void_zero_node
)
13241 /* Don't call `expand_expr_stmt' if we're not going to do
13242 anything, since -Wall will give a diagnostic. */
13243 expand_expr_stmt (exprstmt
);
13245 /* Run destructor on all virtual baseclasses. */
13246 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13248 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13249 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13250 in_charge_node
, integer_two_node
), 0);
13253 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13255 tree vb
= get_vbase
13256 (BINFO_TYPE (vbases
),
13257 TYPE_BINFO (current_class_type
));
13259 (build_scoped_method_call
13260 (current_class_ref
, vb
, dtor_identifier
,
13261 build_expr_list (NULL_TREE
, integer_zero_node
)));
13263 vbases
= TREE_CHAIN (vbases
);
13265 expand_end_cond ();
13268 do_pending_stack_adjust ();
13269 if (cond
!= integer_one_node
)
13270 expand_end_cond ();
13273 virtual_size
= c_sizeof (current_class_type
);
13275 /* At the end, call delete if that's what's requested. */
13277 /* FDIS sez: At the point of definition of a virtual destructor
13278 (including an implicit definition), non-placement operator
13279 delete shall be looked up in the scope of the destructor's
13280 class and if found shall be accessible and unambiguous.
13282 This is somewhat unclear, but I take it to mean that if the
13283 class only defines placement deletes we don't do anything here.
13284 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13285 for us if they ever try to delete one of these. */
13287 if (TYPE_GETS_REG_DELETE (current_class_type
)
13288 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13289 exprstmt
= build_op_delete_call
13290 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13291 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13293 exprstmt
= NULL_TREE
;
13297 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13298 in_charge_node
, integer_one_node
);
13299 expand_start_cond (cond
, 0);
13300 expand_expr_stmt (exprstmt
);
13301 expand_end_cond ();
13304 /* End of destructor. */
13305 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13306 poplevel (getdecls () != NULL_TREE
, 0, 0);
13308 /* Back to the top of destructor. */
13309 /* Don't execute destructor code if `this' is NULL. */
13313 /* If the dtor is empty, and we know there is not possible way we
13314 could use any vtable entries, before they are possibly set by
13315 a base class dtor, we don't have to setup the vtables, as we
13316 know that any base class dtoring will set up any vtables it
13317 needs. We avoid MI, because one base class dtor can do a
13318 virtual dispatch to an overridden function that would need to
13319 have a non-related vtable set up, we cannot avoid setting up
13320 vtables in that case. We could change this to see if there is
13321 just one vtable. */
13322 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13324 /* Make all virtual function table pointers in non-virtual base
13325 classes point to CURRENT_CLASS_TYPE's virtual function
13327 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13329 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13330 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13333 if (! ok_to_optimize_dtor
)
13335 cond
= build_binary_op (NE_EXPR
,
13336 current_class_ptr
, integer_zero_node
, 1);
13337 expand_start_cond (cond
, 0);
13340 insns
= get_insns ();
13343 last_parm_insn
= get_first_nonparm_insn ();
13344 if (last_parm_insn
== NULL_RTX
)
13345 last_parm_insn
= get_last_insn ();
13347 last_parm_insn
= previous_insn (last_parm_insn
);
13349 emit_insns_after (insns
, last_parm_insn
);
13351 if (! ok_to_optimize_dtor
)
13352 expand_end_cond ();
13354 else if (current_function_assigns_this
)
13356 /* Does not need to call emit_base_init, because
13357 that is done (if needed) just after assignment to this
13360 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13362 end_protect_partials ();
13363 expand_label (ctor_label
);
13364 ctor_label
= NULL_TREE
;
13368 decls
= getdecls ();
13369 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13370 poplevel (decls
!= NULL_TREE
, 0, 0);
13372 /* c_expand_return knows to return 'this' from a constructor. */
13373 c_expand_return (NULL_TREE
);
13375 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13376 && return_label
!= NULL_RTX
)
13377 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13379 current_function_assigns_this
= 0;
13380 current_function_just_assigned_this
= 0;
13381 base_init_expr
= NULL_TREE
;
13383 else if (DECL_CONSTRUCTOR_P (fndecl
))
13385 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13386 /* Allow constructor for a type to get a new instance of the object
13387 using `build_new'. */
13388 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13389 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13391 DECL_RETURNS_FIRST_ARG (fndecl
) = 1;
13393 if (flag_this_is_variable
> 0)
13395 cond
= build_binary_op (EQ_EXPR
,
13396 current_class_ptr
, integer_zero_node
, 1);
13397 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13398 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13401 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13405 if (flag_this_is_variable
> 0)
13407 expand_start_cond (cond
, 0);
13408 expand_expr_stmt (thenclause
);
13409 expand_end_cond ();
13412 /* Emit insns from `emit_base_init' which sets up virtual
13413 function table pointer(s). */
13414 if (base_init_expr
)
13416 expand_expr_stmt (base_init_expr
);
13417 base_init_expr
= NULL_TREE
;
13420 insns
= get_insns ();
13423 /* This is where the body of the constructor begins. */
13425 emit_insns_after (insns
, last_parm_cleanup_insn
);
13427 end_protect_partials ();
13429 /* This is where the body of the constructor ends. */
13430 expand_label (ctor_label
);
13431 ctor_label
= NULL_TREE
;
13435 decls
= getdecls ();
13436 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13437 poplevel (decls
!= NULL_TREE
, 1, 0);
13440 /* c_expand_return knows to return 'this' from a constructor. */
13441 c_expand_return (NULL_TREE
);
13443 current_function_assigns_this
= 0;
13444 current_function_just_assigned_this
= 0;
13446 else if (DECL_MAIN_P (fndecl
))
13448 /* Make it so that `main' always returns 0 by default. */
13450 c_expand_return (integer_one_node
);
13452 c_expand_return (integer_zero_node
);
13455 else if (return_label
!= NULL_RTX
13456 && current_function_return_value
== NULL_TREE
13457 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13458 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13460 if (flag_exceptions
)
13461 expand_exception_blocks ();
13463 /* If this function is supposed to return a value, ensure that
13464 we do not fall into the cleanups by mistake. The end of our
13465 function will look like this:
13467 user code (may have return stmt somewhere)
13468 goto no_return_label
13473 NOTE_INSN_FUNCTION_END
13477 If the user omits a return stmt in the USER CODE section, we
13478 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13479 Otherwise, we won't. */
13480 if (no_return_label
)
13482 DECL_CONTEXT (no_return_label
) = fndecl
;
13483 DECL_INITIAL (no_return_label
) = error_mark_node
;
13484 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13485 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13486 expand_goto (no_return_label
);
13491 /* Remove the binding contour which is used
13492 to catch cleanup-generated temporaries. */
13493 expand_end_bindings (0, 0, 0);
13494 poplevel (0, 0, 0);
13496 /* Emit label at beginning of cleanup code for parameters. */
13497 emit_label (cleanup_label
);
13500 /* Get return value into register if that's where it's supposed to be. */
13501 if (original_result_rtx
)
13502 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13504 /* Finish building code that will trigger warnings if users forget
13505 to make their functions return values. */
13506 if (no_return_label
|| cleanup_label
)
13507 emit_jump (return_label
);
13508 if (no_return_label
)
13510 /* We don't need to call `expand_*_return' here because we
13511 don't need any cleanups here--this path of code is only
13512 for error checking purposes. */
13513 expand_label (no_return_label
);
13516 /* Generate rtl for function exit. */
13517 expand_function_end (input_filename
, lineno
, 1);
13520 /* This must come after expand_function_end because cleanups might
13521 have declarations (from inline functions) that need to go into
13522 this function's blocks. */
13523 if (current_binding_level
->parm_flag
!= 1)
13524 my_friendly_abort (122);
13525 poplevel (1, 0, 1);
13527 /* Reset scope for C++: if we were in the scope of a class,
13528 then when we finish this function, we are not longer so.
13529 This cannot be done until we know for sure that no more
13530 class members will ever be referenced in this function
13531 (i.e., calls to destructors). */
13532 if (current_class_name
)
13534 ctype
= current_class_type
;
13535 pop_nested_class (1);
13538 /* Must mark the RESULT_DECL as being in this function. */
13539 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13541 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13542 to the FUNCTION_DECL node itself. */
13543 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13545 if (! processing_template_decl
)
13547 int saved_flag_keep_inline_functions
=
13548 flag_keep_inline_functions
;
13550 /* So we can tell if jump_optimize sets it to 1. */
13553 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13554 && hack_decl_function_context (fndecl
))
13555 /* Trick rest_of_compilation into not deferring output of this
13556 function, even if it is inline, since the rtl_obstack for
13557 this function is the function_obstack of the enclosing
13558 function and will be deallocated when the enclosing
13559 function is gone. See save_tree_status. */
13560 flag_keep_inline_functions
= 1;
13562 /* Run the optimizers and output the assembler code for this
13565 if (DECL_ARTIFICIAL (fndecl
))
13567 /* Do we really *want* to inline this synthesized method? */
13569 int save_fif
= flag_inline_functions
;
13570 flag_inline_functions
= 1;
13572 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13573 will check our size. */
13574 DECL_INLINE (fndecl
) = 0;
13576 rest_of_compilation (fndecl
);
13577 flag_inline_functions
= save_fif
;
13580 rest_of_compilation (fndecl
);
13582 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13584 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13586 /* Set DECL_EXTERNAL so that assemble_external will be called as
13587 necessary. We'll clear it again in finish_file. */
13588 if (! DECL_EXTERNAL (fndecl
))
13589 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13590 DECL_EXTERNAL (fndecl
) = 1;
13591 mark_inline_for_output (fndecl
);
13594 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13595 note_debug_info_needed (ctype
);
13597 current_function_returns_null
|= can_reach_end
;
13599 /* Since we don't normally go through c_expand_return for constructors,
13600 this normally gets the wrong value.
13601 Also, named return values have their return codes emitted after
13602 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13603 if (DECL_CONSTRUCTOR_P (fndecl
)
13604 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13605 current_function_returns_null
= 0;
13607 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
13608 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13609 else if ((warn_return_type
|| pedantic
)
13610 && current_function_returns_null
13611 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13613 /* If this function returns non-void and control can drop through,
13615 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13617 /* With just -W, complain only if function returns both with
13618 and without a value. */
13619 else if (extra_warnings
13620 && current_function_returns_value
&& current_function_returns_null
)
13621 warning ("this function may return with or without a value");
13626 /* Free all the tree nodes making up this function. */
13627 /* Switch back to allocating nodes permanently
13628 until we start another function. */
13629 if (processing_template_decl
)
13631 --minimal_parse_mode
;
13632 DECL_SAVED_TREE (fndecl
) = TREE_CHAIN (DECL_SAVED_TREE (fndecl
));
13636 permanent_allocation (1);
13638 if (DECL_SAVED_INSNS (fndecl
) == NULL_RTX
)
13642 /* Stop pointing to the local nodes about to be freed. */
13643 /* But DECL_INITIAL must remain nonzero so we know this
13644 was an actual function definition. */
13645 DECL_INITIAL (fndecl
) = error_mark_node
;
13646 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13647 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13650 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13651 static_ctors
= perm_tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13652 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13653 static_dtors
= perm_tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13657 /* Let the error reporting routines know that we're outside a
13658 function. For a nested function, this value is used in
13659 pop_cp_function_context and then reset via pop_function_context. */
13660 current_function_decl
= NULL_TREE
;
13663 named_label_uses
= NULL
;
13664 current_class_ptr
= NULL_TREE
;
13665 current_class_ref
= NULL_TREE
;
13668 /* Create the FUNCTION_DECL for a function definition.
13669 LINE1 is the line number that the definition absolutely begins on.
13670 LINE2 is the line number that the name of the function appears on.
13671 DECLSPECS and DECLARATOR are the parts of the declaration;
13672 they describe the return type and the name of the function,
13673 but twisted together in a fashion that parallels the syntax of C.
13675 This function creates a binding context for the function body
13676 as well as setting up the FUNCTION_DECL in current_function_decl.
13678 Returns a FUNCTION_DECL on success.
13680 If the DECLARATOR is not suitable for a function (it defines a datum
13681 instead), we return 0, which tells yyparse to report a parse error.
13683 May return void_type_node indicating that this method is actually
13684 a friend. See grokfield for more details.
13686 Came here with a `.pushlevel' .
13688 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13689 CHANGES TO CODE IN `grokfield'. */
13692 start_method (declspecs
, declarator
, attrlist
)
13693 tree declarator
, declspecs
, attrlist
;
13695 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13698 /* Something too ugly to handle. */
13699 if (fndecl
== NULL_TREE
)
13702 /* Pass friends other than inline friend functions back. */
13703 if (fndecl
== void_type_node
)
13706 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13707 /* Not a function, tell parser to report parse error. */
13710 if (IS_SIGNATURE (current_class_type
))
13711 IS_DEFAULT_IMPLEMENTATION (fndecl
) = 1;
13713 if (DECL_IN_AGGR_P (fndecl
))
13715 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13717 if (DECL_CONTEXT (fndecl
)
13718 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13719 cp_error ("`%D' is already defined in class %s", fndecl
,
13720 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13722 return void_type_node
;
13725 DECL_THIS_INLINE (fndecl
) = 1;
13727 if (flag_default_inline
)
13728 DECL_INLINE (fndecl
) = 1;
13730 /* We process method specializations in finish_struct_1. */
13731 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13732 fndecl
= push_template_decl (fndecl
);
13734 /* We read in the parameters on the maybepermanent_obstack,
13735 but we won't be getting back to them until after we
13736 may have clobbered them. So the call to preserve_data
13737 will keep them safe. */
13740 if (! DECL_FRIEND_P (fndecl
))
13742 if (TREE_CHAIN (fndecl
))
13744 fndecl
= copy_node (fndecl
);
13745 TREE_CHAIN (fndecl
) = NULL_TREE
;
13748 if (DECL_CONSTRUCTOR_P (fndecl
))
13750 if (! grok_ctor_properties (current_class_type
, fndecl
))
13751 return void_type_node
;
13753 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13754 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13757 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13759 /* Make a place for the parms */
13761 current_binding_level
->parm_flag
= 1;
13763 DECL_IN_AGGR_P (fndecl
) = 1;
13767 /* Go through the motions of finishing a function definition.
13768 We don't compile this method until after the whole class has
13771 FINISH_METHOD must return something that looks as though it
13772 came from GROKFIELD (since we are defining a method, after all).
13774 This is called after parsing the body of the function definition.
13775 STMTS is the chain of statements that makes up the function body.
13777 DECL is the ..._DECL that `start_method' provided. */
13780 finish_method (decl
)
13783 register tree fndecl
= decl
;
13786 register tree link
;
13788 if (decl
== void_type_node
)
13791 old_initial
= DECL_INITIAL (fndecl
);
13793 /* Undo the level for the parms (from start_method).
13794 This is like poplevel, but it causes nothing to be
13795 saved. Saving information here confuses symbol-table
13796 output routines. Besides, this information will
13797 be correctly output when this method is actually
13800 /* Clear out the meanings of the local variables of this level;
13801 also record in each decl which block it belongs to. */
13803 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13805 if (DECL_NAME (link
) != NULL_TREE
)
13806 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = 0;
13807 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13808 DECL_CONTEXT (link
) = NULL_TREE
;
13811 /* Restore all name-meanings of the outer levels
13812 that were shadowed by this level. */
13814 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
13815 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
13816 for (link
= current_binding_level
->class_shadowed
;
13817 link
; link
= TREE_CHAIN (link
))
13818 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
13819 for (link
= current_binding_level
->type_shadowed
;
13820 link
; link
= TREE_CHAIN (link
))
13821 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
13823 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13824 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13825 current_binding_level
->parm_flag
,
13826 current_binding_level
->keep
);
13828 poplevel (0, 0, 0);
13830 DECL_INITIAL (fndecl
) = old_initial
;
13832 /* We used to check if the context of FNDECL was different from
13833 current_class_type as another way to get inside here. This didn't work
13834 for String.cc in libg++. */
13835 if (DECL_FRIEND_P (fndecl
))
13837 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13838 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13839 decl
= void_type_node
;
13845 /* Called when a new struct TYPE is defined.
13846 If this structure or union completes the type of any previous
13847 variable declaration, lay it out and output its rtl. */
13850 hack_incomplete_structures (type
)
13855 if (current_binding_level
->incomplete
== NULL_TREE
)
13858 if (!type
) /* Don't do this for class templates. */
13861 for (list
= ¤t_binding_level
->incomplete
; *list
; )
13863 tree decl
= TREE_VALUE (*list
);
13864 if ((decl
&& TREE_TYPE (decl
) == type
)
13865 || (TREE_TYPE (decl
)
13866 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13867 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
13869 int toplevel
= toplevel_bindings_p ();
13870 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13871 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
13872 layout_type (TREE_TYPE (decl
));
13873 layout_decl (decl
, 0);
13874 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
13878 expand_decl (decl
);
13879 cleanup
= maybe_build_cleanup (decl
);
13880 expand_decl_init (decl
);
13881 if (! expand_decl_cleanup (decl
, cleanup
))
13882 cp_error ("parser lost in parsing declaration of `%D'",
13885 *list
= TREE_CHAIN (*list
);
13888 list
= &TREE_CHAIN (*list
);
13892 /* If DECL is of a type which needs a cleanup, build that cleanup here.
13893 See build_delete for information about AUTO_DELETE.
13895 Don't build these on the momentary obstack; they must live
13896 the life of the binding contour. */
13899 maybe_build_cleanup_1 (decl
, auto_delete
)
13900 tree decl
, auto_delete
;
13902 tree type
= TREE_TYPE (decl
);
13903 if (TYPE_NEEDS_DESTRUCTOR (type
))
13905 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
13908 if (TREE_CODE (decl
) != PARM_DECL
)
13909 temp
= suspend_momentary ();
13911 if (TREE_CODE (type
) == ARRAY_TYPE
)
13915 mark_addressable (decl
);
13916 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
13919 /* Optimize for space over speed here. */
13920 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
13921 || flag_expensive_optimizations
)
13922 flags
|= LOOKUP_NONVIRTUAL
;
13924 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
13926 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
13927 && ! TYPE_HAS_DESTRUCTOR (type
))
13928 rval
= build_compound_expr (expr_tree_cons (NULL_TREE
, rval
,
13929 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
13931 if (TREE_CODE (decl
) != PARM_DECL
)
13932 resume_momentary (temp
);
13939 /* If DECL is of a type which needs a cleanup, build that cleanup
13940 here. The cleanup does free the storage with a call to delete. */
13943 maybe_build_cleanup_and_delete (decl
)
13946 return maybe_build_cleanup_1 (decl
, integer_three_node
);
13949 /* If DECL is of a type which needs a cleanup, build that cleanup
13950 here. The cleanup does not free the storage with a call a delete. */
13953 maybe_build_cleanup (decl
)
13956 return maybe_build_cleanup_1 (decl
, integer_two_node
);
13959 /* Expand a C++ expression at the statement level.
13960 This is needed to ferret out nodes which have UNKNOWN_TYPE.
13961 The C++ type checker should get all of these out when
13962 expressions are combined with other, type-providing, expressions,
13963 leaving only orphan expressions, such as:
13965 &class::bar; / / takes its address, but does nothing with it. */
13968 cplus_expand_expr_stmt (exp
)
13971 if (processing_template_decl
)
13973 add_tree (build_min_nt (EXPR_STMT
, exp
));
13977 /* Arrange for all temps to disappear. */
13978 expand_start_target_temps ();
13980 if (TREE_TYPE (exp
) == unknown_type_node
)
13982 if (TREE_CODE (exp
) == COMPONENT_REF
)
13983 error ("invalid reference to a member function name, did you forget the ()?");
13985 error ("address of overloaded function with no contextual type information");
13989 if (TREE_CODE (exp
) == FUNCTION_DECL
)
13991 cp_warning ("reference, not call, to function `%D'", exp
);
13992 warning ("at this point in file");
13996 /* We should do this eventually, but right now this causes regex.o from
13997 libg++ to miscompile, and tString to core dump. */
13998 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14001 /* Strip unused implicit INDIRECT_REFs of references. */
14002 if (TREE_CODE (exp
) == INDIRECT_REF
14003 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
14004 exp
= TREE_OPERAND (exp
, 0);
14006 /* If we don't do this, we end up down inside expand_expr
14007 trying to do TYPE_MODE on the ERROR_MARK, and really
14008 go outside the bounds of the type. */
14009 if (exp
!= error_mark_node
)
14010 expand_expr_stmt (break_out_cleanups (exp
));
14013 /* Clean up any pending cleanups. This happens when a function call
14014 returns a cleanup-needing value that nobody uses. */
14015 expand_end_target_temps ();
14018 /* When a stmt has been parsed, this function is called.
14020 Currently, this function only does something within a
14021 constructor's scope: if a stmt has just assigned to this,
14022 and we are in a derived class, we call `emit_base_init'. */
14027 extern struct nesting
*cond_stack
, *loop_stack
, *case_stack
;
14030 if (current_function_assigns_this
14031 || ! current_function_just_assigned_this
)
14033 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14035 /* Constructors must wait until we are out of control
14036 zones before calling base constructors. */
14037 if (cond_stack
|| loop_stack
|| case_stack
)
14039 expand_expr_stmt (base_init_expr
);
14040 check_base_init (current_class_type
);
14042 current_function_assigns_this
= 1;
14045 /* Change a static member function definition into a FUNCTION_TYPE, instead
14046 of the METHOD_TYPE that we create when it's originally parsed.
14048 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14049 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14050 other decls. Either pass the addresses of local variables or NULL. */
14053 revert_static_member_fn (decl
, fn
, argtypes
)
14054 tree
*decl
, *fn
, *argtypes
;
14057 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14058 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14060 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14061 != TYPE_UNQUALIFIED
)
14062 cp_error ("static member function `%#D' declared with type qualifiers",
14065 args
= TREE_CHAIN (args
);
14066 tmp
= build_function_type (TREE_TYPE (function
), args
);
14067 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14068 tmp
= build_exception_variant (tmp
,
14069 TYPE_RAISES_EXCEPTIONS (function
));
14070 TREE_TYPE (*decl
) = tmp
;
14071 if (DECL_ARGUMENTS (*decl
))
14072 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14073 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14081 id_in_current_class (id
)
14084 return !!purpose_member (id
, class_binding_level
->class_shadowed
);
14092 int just_assigned_this
;
14094 int temp_name_counter
;
14096 struct named_label_list
*named_label_uses
;
14097 tree shadowed_labels
;
14100 rtx last_dtor_insn
;
14101 rtx last_parm_cleanup_insn
;
14102 tree base_init_list
;
14103 tree member_init_list
;
14104 tree base_init_expr
;
14105 tree current_class_ptr
;
14106 tree current_class_ref
;
14108 struct cp_function
*next
;
14109 struct binding_level
*binding_level
;
14110 int static_labelno
;
14113 static struct cp_function
*cp_function_chain
;
14115 extern int temp_name_counter
;
14117 /* Save and reinitialize the variables
14118 used during compilation of a C++ function. */
14121 push_cp_function_context (context
)
14124 struct cp_function
*p
14125 = (struct cp_function
*) xmalloc (sizeof (struct cp_function
));
14127 push_function_context_to (context
);
14129 p
->next
= cp_function_chain
;
14130 cp_function_chain
= p
;
14132 p
->named_labels
= named_labels
;
14133 p
->named_label_uses
= named_label_uses
;
14134 p
->shadowed_labels
= shadowed_labels
;
14135 p
->returns_value
= current_function_returns_value
;
14136 p
->returns_null
= current_function_returns_null
;
14137 p
->binding_level
= current_binding_level
;
14138 p
->ctor_label
= ctor_label
;
14139 p
->dtor_label
= dtor_label
;
14140 p
->last_dtor_insn
= last_dtor_insn
;
14141 p
->last_parm_cleanup_insn
= last_parm_cleanup_insn
;
14142 p
->assigns_this
= current_function_assigns_this
;
14143 p
->just_assigned_this
= current_function_just_assigned_this
;
14144 p
->parms_stored
= current_function_parms_stored
;
14145 p
->result_rtx
= original_result_rtx
;
14146 p
->base_init_expr
= base_init_expr
;
14147 p
->temp_name_counter
= temp_name_counter
;
14148 p
->base_init_list
= current_base_init_list
;
14149 p
->member_init_list
= current_member_init_list
;
14150 p
->current_class_ptr
= current_class_ptr
;
14151 p
->current_class_ref
= current_class_ref
;
14152 p
->static_labelno
= static_labelno
;
14155 /* Restore the variables used during compilation of a C++ function. */
14158 pop_cp_function_context (context
)
14161 struct cp_function
*p
= cp_function_chain
;
14164 /* Bring back all the labels that were shadowed. */
14165 for (link
= shadowed_labels
; link
; link
= TREE_CHAIN (link
))
14166 if (DECL_NAME (TREE_VALUE (link
)) != 0)
14167 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link
)),
14168 TREE_VALUE (link
));
14170 pop_function_context_from (context
);
14172 cp_function_chain
= p
->next
;
14174 named_labels
= p
->named_labels
;
14175 named_label_uses
= p
->named_label_uses
;
14176 shadowed_labels
= p
->shadowed_labels
;
14177 current_function_returns_value
= p
->returns_value
;
14178 current_function_returns_null
= p
->returns_null
;
14179 current_binding_level
= p
->binding_level
;
14180 ctor_label
= p
->ctor_label
;
14181 dtor_label
= p
->dtor_label
;
14182 last_dtor_insn
= p
->last_dtor_insn
;
14183 last_parm_cleanup_insn
= p
->last_parm_cleanup_insn
;
14184 current_function_assigns_this
= p
->assigns_this
;
14185 current_function_just_assigned_this
= p
->just_assigned_this
;
14186 current_function_parms_stored
= p
->parms_stored
;
14187 original_result_rtx
= p
->result_rtx
;
14188 base_init_expr
= p
->base_init_expr
;
14189 temp_name_counter
= p
->temp_name_counter
;
14190 current_base_init_list
= p
->base_init_list
;
14191 current_member_init_list
= p
->member_init_list
;
14192 current_class_ptr
= p
->current_class_ptr
;
14193 current_class_ref
= p
->current_class_ref
;
14194 static_labelno
= p
->static_labelno
;
14202 return function_depth
!= 0;