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 /* Set to nonzero by `grokdeclarator' for a function
513 whose return type is defaulted, if warnings for this are desired. */
515 static int warn_about_return_type
;
517 /* Nonzero means give `double' the same size as `float'. */
519 extern int flag_short_double
;
521 /* Nonzero means don't recognize any builtin functions. */
523 extern int flag_no_builtin
;
525 /* Nonzero means don't recognize the non-ANSI builtin functions.
528 extern int flag_no_nonansi_builtin
;
530 /* Nonzero means enable obscure ANSI features and disable GNU extensions
531 that might cause ANSI-compliant code to be miscompiled. */
533 extern int flag_ansi
;
535 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
537 extern int flag_huge_objects
;
539 /* Nonzero if we want to conserve space in the .o files. We do this
540 by putting uninitialized data and runtime initialized data into
541 .common instead of .data at the expense of not flagging multiple
543 extern int flag_conserve_space
;
545 /* Pointers to the base and current top of the language name stack. */
547 extern tree
*current_lang_base
, *current_lang_stack
;
549 /* C and C++ flags are in decl2.c. */
551 /* Set to 0 at beginning of a constructor, set to 1
552 if that function does an allocation before referencing its
553 instance variable. */
554 static int current_function_assigns_this
;
555 int current_function_just_assigned_this
;
557 /* Set to 0 at beginning of a function. Set non-zero when
558 store_parm_decls is called. Don't call store_parm_decls
559 if this flag is non-zero! */
560 int current_function_parms_stored
;
562 /* Flag used when debugging spew.c */
564 extern int spew_debug
;
566 /* This is a copy of the class_shadowed list of the previous class binding
567 contour when at global scope. It's used to reset IDENTIFIER_CLASS_VALUEs
568 when entering another class scope (i.e. a cache miss). */
569 extern tree previous_class_values
;
571 /* A expression of value 0 with the same precision as a sizetype
573 tree signed_size_zero_node
;
575 /* The name of the anonymous namespace, throughout this translation
577 tree anonymous_namespace_name
;
580 /* Allocate a level of searching. */
584 push_decl_level (stack
, obstack
)
585 struct stack_level
*stack
;
586 struct obstack
*obstack
;
588 struct stack_level tem
;
591 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
594 /* For each binding contour we allocate a binding_level structure
595 which records the names defined in that contour.
598 1) one for each function definition,
599 where internal declarations of the parameters appear.
600 2) one for each compound statement,
601 to record its declarations.
603 The current meaning of a name can be found by searching the levels
604 from the current one out to the global one.
606 Off to the side, may be the class_binding_level. This exists only
607 to catch class-local declarations. It is otherwise nonexistent.
609 Also there may be binding levels that catch cleanups that must be
610 run when exceptions occur. */
612 /* Note that the information in the `names' component of the global contour
613 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
617 /* A chain of _DECL nodes for all variables, constants, functions,
618 and typedef types. These are in the reverse of the order
622 /* A list of structure, union and enum definitions, for looking up
624 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
625 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
626 or ENUMERAL_TYPE node.
628 C++: the TREE_VALUE nodes can be simple types for
629 component_bindings. */
632 /* A list of USING_DECL nodes. */
635 /* A list of used namespaces. PURPOSE is the namespace,
636 VALUE the common ancestor with this binding_level's namespace. */
637 tree using_directives
;
639 /* For each level, a list of shadowed outer-level local definitions
640 to be restored when this level is popped.
641 Each link is a TREE_LIST whose TREE_PURPOSE is an identifier and
642 whose TREE_VALUE is its old definition (a kind of ..._DECL node). */
645 /* Same, for IDENTIFIER_CLASS_VALUE. */
648 /* Same, for IDENTIFIER_TYPE_VALUE. */
651 /* For each level (except not the global one),
652 a chain of BLOCK nodes for all the levels
653 that were entered and exited one level down. */
656 /* The BLOCK node for this level, if one has been preallocated.
657 If 0, the BLOCK is allocated (if needed) when the level is popped. */
660 /* The binding level which this one is contained in (inherits from). */
661 struct binding_level
*level_chain
;
663 /* List of decls in `names' that have incomplete
664 structure or union types. */
667 /* List of VAR_DECLS saved from a previous for statement.
668 These would be dead in ANSI-conforming code, but might
669 be referenced in ARM-era code. */
670 tree dead_vars_from_for
;
672 /* 1 for the level that holds the parameters of a function.
673 2 for the level that holds a class declaration.
674 3 for levels that hold parameter declarations. */
675 unsigned parm_flag
: 4;
677 /* 1 means make a BLOCK for this level regardless of all else.
678 2 for temporary binding contours created by the compiler. */
681 /* Nonzero if this level "doesn't exist" for tags. */
682 unsigned tag_transparent
: 1;
684 /* Nonzero if this level can safely have additional
685 cleanup-needing variables added to it. */
686 unsigned more_cleanups_ok
: 1;
687 unsigned have_cleanups
: 1;
689 /* Nonzero if this level is for storing the decls for template
690 parameters and generic decls; these decls will be discarded and
691 replaced with a TEMPLATE_DECL. */
692 unsigned pseudo_global
: 1;
694 /* This is set for a namespace binding level. */
695 unsigned namespace_p
: 1;
697 /* True if this level is that of a for-statement where we need to
698 worry about ambiguous (ARM or ANSI) scope rules. */
699 unsigned is_for_scope
: 1;
701 /* Two bits left for this word. */
703 #if defined(DEBUG_CP_BINDING_LEVELS)
704 /* Binding depth at which this level began. */
705 unsigned binding_depth
;
706 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
709 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
711 /* The (non-class) binding level currently in effect. */
713 static struct binding_level
*current_binding_level
;
715 /* The binding level of the current class, if any. */
717 static struct binding_level
*class_binding_level
;
719 /* The current (class or non-class) binding level currently in effect. */
721 #define inner_binding_level \
722 (class_binding_level ? class_binding_level : current_binding_level)
724 /* A chain of binding_level structures awaiting reuse. */
726 static struct binding_level
*free_binding_level
;
728 /* The outermost binding level, for names of file scope.
729 This is created when the compiler is started and exists
730 through the entire run. */
732 static struct binding_level
*global_binding_level
;
734 /* Binding level structures are initialized by copying this one. */
736 static struct binding_level clear_binding_level
;
738 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
740 static int keep_next_level_flag
;
742 #if defined(DEBUG_CP_BINDING_LEVELS)
743 static int binding_depth
= 0;
744 static int is_class_level
= 0;
751 for (i
= 0; i
< binding_depth
*2; i
++)
754 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
756 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
759 push_binding_level (newlevel
, tag_transparent
, keep
)
760 struct binding_level
*newlevel
;
761 int tag_transparent
, keep
;
763 /* Add this level to the front of the chain (stack) of levels that
765 *newlevel
= clear_binding_level
;
766 if (class_binding_level
)
768 newlevel
->level_chain
= class_binding_level
;
769 class_binding_level
= (struct binding_level
*)0;
773 newlevel
->level_chain
= current_binding_level
;
775 current_binding_level
= newlevel
;
776 newlevel
->tag_transparent
= tag_transparent
;
777 newlevel
->more_cleanups_ok
= 1;
778 newlevel
->keep
= keep
;
779 #if defined(DEBUG_CP_BINDING_LEVELS)
780 newlevel
->binding_depth
= binding_depth
;
782 fprintf (stderr
, "push %s level 0x%08x line %d\n",
783 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
786 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
792 if (class_binding_level
)
793 current_binding_level
= class_binding_level
;
795 if (global_binding_level
)
797 /* Cannot pop a level, if there are none left to pop. */
798 if (current_binding_level
== global_binding_level
)
799 my_friendly_abort (123);
801 /* Pop the current level, and free the structure for reuse. */
802 #if defined(DEBUG_CP_BINDING_LEVELS)
805 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
806 (is_class_level
) ? "class" : "block",
807 current_binding_level
, lineno
);
808 if (is_class_level
!= (current_binding_level
== class_binding_level
))
811 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
814 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
816 register struct binding_level
*level
= current_binding_level
;
817 current_binding_level
= current_binding_level
->level_chain
;
818 level
->level_chain
= free_binding_level
;
819 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
820 if (level
->binding_depth
!= binding_depth
)
822 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
823 free_binding_level
= level
;
825 class_binding_level
= current_binding_level
;
826 if (class_binding_level
->parm_flag
!= 2)
827 class_binding_level
= 0;
828 while (current_binding_level
->parm_flag
== 2)
829 current_binding_level
= current_binding_level
->level_chain
;
834 suspend_binding_level ()
836 if (class_binding_level
)
837 current_binding_level
= class_binding_level
;
839 if (global_binding_level
)
841 /* Cannot suspend a level, if there are none left to suspend. */
842 if (current_binding_level
== global_binding_level
)
843 my_friendly_abort (123);
845 /* Suspend the current level. */
846 #if defined(DEBUG_CP_BINDING_LEVELS)
849 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
850 (is_class_level
) ? "class" : "block",
851 current_binding_level
, lineno
);
852 if (is_class_level
!= (current_binding_level
== class_binding_level
))
855 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
858 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
860 current_binding_level
= current_binding_level
->level_chain
;
861 class_binding_level
= current_binding_level
;
862 if (class_binding_level
->parm_flag
!= 2)
863 class_binding_level
= 0;
864 while (current_binding_level
->parm_flag
== 2)
865 current_binding_level
= current_binding_level
->level_chain
;
870 resume_binding_level (b
)
871 struct binding_level
*b
;
873 /* Resuming binding levels is meant only for namespaces,
874 and those cannot nest into classes. */
875 my_friendly_assert(!class_binding_level
, 386);
876 /* Also, resuming a non-directly nested namespace is a no-no. */
877 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
878 current_binding_level
= b
;
879 #if defined(DEBUG_CP_BINDING_LEVELS)
880 b
->binding_depth
= binding_depth
;
882 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
883 (is_class_level
) ? "class" : "block", b
, lineno
);
886 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
889 /* Create a new `struct binding_level'. */
892 struct binding_level
*
893 make_binding_level ()
896 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
899 /* Nonzero if we are currently in the global binding level. */
904 return current_binding_level
== global_binding_level
;
907 /* Nonzero if we are currently in a toplevel binding level. This
908 means either the global binding level or a namespace in a toplevel
910 Since there are no non-toplevel namespace levels, this really
911 means any namespace or pseudo-global level. */
914 toplevel_bindings_p ()
916 return current_binding_level
->namespace_p
917 || current_binding_level
->pseudo_global
;
920 /* Nonzero if this is a namespace scope. */
923 namespace_bindings_p ()
925 return current_binding_level
->namespace_p
;
931 keep_next_level_flag
= 1;
934 /* Nonzero if the current level needs to have a BLOCK made. */
939 return (current_binding_level
->blocks
!= NULL_TREE
940 || current_binding_level
->keep
941 || current_binding_level
->names
!= NULL_TREE
942 || (current_binding_level
->tags
!= NULL_TREE
943 && !current_binding_level
->tag_transparent
));
946 /* Identify this binding level as a level of parameters. */
949 declare_parm_level ()
951 current_binding_level
->parm_flag
= 1;
955 declare_pseudo_global_level ()
957 current_binding_level
->pseudo_global
= 1;
961 declare_namespace_level ()
963 current_binding_level
->namespace_p
= 1;
967 pseudo_global_level_p ()
969 return current_binding_level
->pseudo_global
;
973 set_class_shadows (shadows
)
976 class_binding_level
->class_shadowed
= shadows
;
979 /* Enter a new binding level.
980 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
981 not for that of tags. */
984 pushlevel (tag_transparent
)
987 register struct binding_level
*newlevel
= NULL_BINDING_LEVEL
;
989 /* If this is the top level of a function,
990 just make sure that NAMED_LABELS is 0.
991 They should have been set to 0 at the end of the previous function. */
993 if (current_binding_level
== global_binding_level
)
994 my_friendly_assert (named_labels
== NULL_TREE
, 134);
996 /* Reuse or create a struct for this binding level. */
998 #if defined(DEBUG_CP_BINDING_LEVELS)
1000 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1001 if (free_binding_level
)
1002 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1004 newlevel
= free_binding_level
;
1005 free_binding_level
= free_binding_level
->level_chain
;
1009 newlevel
= make_binding_level ();
1012 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
1013 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
1014 keep_next_level_flag
= 0;
1018 note_level_for_for ()
1020 current_binding_level
->is_for_scope
= 1;
1024 pushlevel_temporary (tag_transparent
)
1025 int tag_transparent
;
1027 pushlevel (tag_transparent
);
1028 current_binding_level
->keep
= 2;
1031 /* Note we don't call push_momentary() here. Otherwise, it would cause
1032 cleanups to be allocated on the momentary obstack, and they will be
1033 overwritten by the next statement. */
1035 expand_start_bindings (0);
1038 /* Exit a binding level.
1039 Pop the level off, and restore the state of the identifier-decl mappings
1040 that were in effect when this level was entered.
1042 If KEEP == 1, this level had explicit declarations, so
1043 and create a "block" (a BLOCK node) for the level
1044 to record its declarations and subblocks for symbol table output.
1046 If KEEP == 2, this level's subblocks go to the front,
1047 not the back of the current binding level. This happens,
1048 for instance, when code for constructors and destructors
1049 need to generate code at the end of a function which must
1050 be moved up to the front of the function.
1052 If FUNCTIONBODY is nonzero, this level is the body of a function,
1053 so create a block as if KEEP were set and also clear out all
1056 If REVERSE is nonzero, reverse the order of decls before putting
1057 them into the BLOCK. */
1060 poplevel (keep
, reverse
, functionbody
)
1066 /* The chain of decls was accumulated in reverse order.
1067 Put it into forward order, just for cleanliness. */
1069 int tmp
= functionbody
;
1070 int real_functionbody
= current_binding_level
->keep
== 2
1071 ? ((functionbody
= 0), tmp
) : functionbody
;
1072 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1073 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1074 tree block
= NULL_TREE
;
1076 int block_previously_created
;
1078 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1079 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1080 current_binding_level
->parm_flag
,
1081 current_binding_level
->keep
);
1083 if (current_binding_level
->keep
== 1)
1086 /* Get the decls in the order they were written.
1087 Usually current_binding_level->names is in reverse order.
1088 But parameter decls were previously put in forward order. */
1091 current_binding_level
->names
1092 = decls
= nreverse (current_binding_level
->names
);
1094 decls
= current_binding_level
->names
;
1096 /* Output any nested inline functions within this block
1097 if they weren't already output. */
1099 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1100 if (TREE_CODE (decl
) == FUNCTION_DECL
1101 && ! TREE_ASM_WRITTEN (decl
)
1102 && DECL_INITIAL (decl
) != NULL_TREE
1103 && TREE_ADDRESSABLE (decl
)
1104 && decl_function_context (decl
) == current_function_decl
)
1106 /* If this decl was copied from a file-scope decl
1107 on account of a block-scope extern decl,
1108 propagate TREE_ADDRESSABLE to the file-scope decl. */
1109 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1110 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1113 push_function_context ();
1114 output_inline_function (decl
);
1115 pop_function_context ();
1119 /* If there were any declarations or structure tags in that level,
1120 or if this level is a function body,
1121 create a BLOCK to record them for the life of this function. */
1124 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1125 if (block_previously_created
)
1126 block
= current_binding_level
->this_block
;
1127 else if (keep
== 1 || functionbody
)
1128 block
= make_node (BLOCK
);
1129 if (block
!= NULL_TREE
)
1131 if (block_previously_created
)
1133 if (decls
|| tags
|| subblocks
)
1135 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1137 warning ("internal compiler error: debugging info corrupted");
1139 BLOCK_VARS (block
) = decls
;
1140 BLOCK_TYPE_TAGS (block
) = tags
;
1142 /* We can have previous subblocks and new subblocks when
1143 doing fixup_gotos with complex cleanups. We chain the new
1144 subblocks onto the end of any pre-existing subblocks. */
1145 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1148 /* If we created the block earlier on, and we are just
1149 diddling it now, then it already should have a proper
1150 BLOCK_END_NOTE value associated with it. */
1154 BLOCK_VARS (block
) = decls
;
1155 BLOCK_TYPE_TAGS (block
) = tags
;
1156 BLOCK_SUBBLOCKS (block
) = subblocks
;
1157 /* Otherwise, for a new block, install a new BLOCK_END_NOTE value. */
1158 remember_end_note (block
);
1162 /* In each subblock, record that this is its superior. */
1165 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1166 BLOCK_SUPERCONTEXT (link
) = block
;
1168 /* Clear out the meanings of the local variables of this level. */
1170 if (current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1)
1172 struct binding_level
*outer
= current_binding_level
->level_chain
;
1173 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1175 if (TREE_CODE (link
) == VAR_DECL
)
1176 DECL_DEAD_FOR_LOCAL (link
) = 1;
1178 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = NULL_TREE
;
1181 /* Save declarations made in a 'for' statement so we can support pre-ANSI
1182 'for' scoping semantics. */
1184 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
1186 tree id
= TREE_PURPOSE (link
);
1187 tree decl
= IDENTIFIER_LOCAL_VALUE (id
);
1189 if (decl
&& DECL_DEAD_FOR_LOCAL (decl
))
1191 /* In this case keep the dead for-decl visible,
1192 but remember what (if anything) it shadowed. */
1193 DECL_SHADOWED_FOR_VAR (decl
) = TREE_VALUE (link
);
1194 TREE_CHAIN (decl
) = outer
->dead_vars_from_for
;
1195 outer
->dead_vars_from_for
= decl
;
1198 IDENTIFIER_LOCAL_VALUE (id
) = TREE_VALUE (link
);
1201 else /* Not special for scope. */
1203 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1205 if (DECL_NAME (link
) != NULL_TREE
)
1207 /* If the ident. was used or addressed via a local extern decl,
1208 don't forget that fact. */
1209 if (DECL_EXTERNAL (link
))
1211 if (TREE_USED (link
))
1212 TREE_USED (DECL_ASSEMBLER_NAME (link
)) = 1;
1213 if (TREE_ADDRESSABLE (link
))
1214 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (link
)) = 1;
1216 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = NULL_TREE
;
1220 /* Restore all name-meanings of the outer levels
1221 that were shadowed by this level. */
1223 for (link
= current_binding_level
->shadowed
;
1224 link
; link
= TREE_CHAIN (link
))
1225 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1227 /* We first restore the regular decls and *then* the dead_vars_from_for
1228 to handle this case:
1232 for (int i; ; ) { ...} // i#2
1236 In this case, we want remove the binding for i#3, restoring
1237 that of i#2. Then we want to remove the binding for i#2,
1238 and restore that of i#1. */
1240 link
= current_binding_level
->dead_vars_from_for
;
1241 for (; link
!= NULL_TREE
; link
= TREE_CHAIN (link
))
1243 tree id
= DECL_NAME (link
);
1244 if (IDENTIFIER_LOCAL_VALUE (id
) == link
)
1245 IDENTIFIER_LOCAL_VALUE (id
) = DECL_SHADOWED_FOR_VAR (link
);
1248 for (link
= current_binding_level
->class_shadowed
;
1249 link
; link
= TREE_CHAIN (link
))
1250 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1251 for (link
= current_binding_level
->type_shadowed
;
1252 link
; link
= TREE_CHAIN (link
))
1253 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1256 /* If the level being exited is the top level of a function,
1257 check over all the labels. */
1261 /* If this is the top level block of a function,
1262 the vars are the function's parameters.
1263 Don't leave them in the BLOCK because they are
1264 found in the FUNCTION_DECL instead. */
1266 BLOCK_VARS (block
) = 0;
1268 /* Clear out the definitions of all label names,
1269 since their scopes end here. */
1271 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1273 register tree label
= TREE_VALUE (link
);
1275 if (DECL_INITIAL (label
) == NULL_TREE
)
1277 cp_error_at ("label `%D' used but not defined", label
);
1278 /* Avoid crashing later. */
1279 define_label (input_filename
, 1, DECL_NAME (label
));
1281 else if (warn_unused
&& !TREE_USED (label
))
1282 cp_warning_at ("label `%D' defined but not used", label
);
1283 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), NULL_TREE
);
1285 /* Put the labels into the "variables" of the
1286 top-level block, so debugger can see them. */
1287 TREE_CHAIN (label
) = BLOCK_VARS (block
);
1288 BLOCK_VARS (block
) = label
;
1291 named_labels
= NULL_TREE
;
1294 /* Any uses of undefined labels now operate under constraints
1295 of next binding contour. */
1297 struct binding_level
*level_chain
;
1298 level_chain
= current_binding_level
->level_chain
;
1301 struct named_label_list
*labels
;
1302 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1303 if (labels
->binding_level
== current_binding_level
)
1305 labels
->binding_level
= level_chain
;
1306 labels
->names_in_scope
= level_chain
->names
;
1311 tmp
= current_binding_level
->keep
;
1313 pop_binding_level ();
1315 DECL_INITIAL (current_function_decl
) = block
;
1318 if (!block_previously_created
)
1319 current_binding_level
->blocks
1320 = chainon (current_binding_level
->blocks
, block
);
1322 /* If we did not make a block for the level just exited,
1323 any blocks made for inner levels
1324 (since they cannot be recorded as subblocks in that level)
1325 must be carried forward so they will later become subblocks
1326 of something else. */
1330 current_binding_level
->blocks
1331 = chainon (subblocks
, current_binding_level
->blocks
);
1333 current_binding_level
->blocks
1334 = chainon (current_binding_level
->blocks
, subblocks
);
1337 /* Take care of compiler's internal binding structures. */
1340 expand_end_bindings (getdecls (), keep
, 1);
1341 /* Each and every BLOCK node created here in `poplevel' is important
1342 (e.g. for proper debugging information) so if we created one
1343 earlier, mark it as "used". */
1345 TREE_USED (block
) = 1;
1346 block
= poplevel (keep
, reverse
, real_functionbody
);
1349 /* Each and every BLOCK node created here in `poplevel' is important
1350 (e.g. for proper debugging information) so if we created one
1351 earlier, mark it as "used". */
1353 TREE_USED (block
) = 1;
1357 /* Delete the node BLOCK from the current binding level.
1358 This is used for the block inside a stmt expr ({...})
1359 so that the block can be reinserted where appropriate. */
1362 delete_block (block
)
1366 if (current_binding_level
->blocks
== block
)
1367 current_binding_level
->blocks
= TREE_CHAIN (block
);
1368 for (t
= current_binding_level
->blocks
; t
;)
1370 if (TREE_CHAIN (t
) == block
)
1371 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1375 TREE_CHAIN (block
) = NULL_TREE
;
1376 /* Clear TREE_USED which is always set by poplevel.
1377 The flag is set again if insert_block is called. */
1378 TREE_USED (block
) = 0;
1381 /* Insert BLOCK at the end of the list of subblocks of the
1382 current binding level. This is used when a BIND_EXPR is expanded,
1383 to handle the BLOCK node inside the BIND_EXPR. */
1386 insert_block (block
)
1389 TREE_USED (block
) = 1;
1390 current_binding_level
->blocks
1391 = chainon (current_binding_level
->blocks
, block
);
1394 /* Set the BLOCK node for the innermost scope
1395 (the one we are currently in). */
1399 register tree block
;
1401 current_binding_level
->this_block
= block
;
1404 /* Do a pushlevel for class declarations. */
1409 register struct binding_level
*newlevel
;
1411 /* Reuse or create a struct for this binding level. */
1412 #if defined(DEBUG_CP_BINDING_LEVELS)
1414 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1415 if (free_binding_level
)
1416 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1418 newlevel
= free_binding_level
;
1419 free_binding_level
= free_binding_level
->level_chain
;
1423 newlevel
= make_binding_level ();
1426 #if defined(DEBUG_CP_BINDING_LEVELS)
1428 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1430 push_binding_level (newlevel
, 0, 0);
1432 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1433 class_binding_level
= current_binding_level
;
1434 class_binding_level
->parm_flag
= 2;
1435 /* We have just pushed into a new binding level. Now, fake out the rest
1436 of the compiler. Set the `current_binding_level' back to point to
1437 the most closely containing non-class binding level. */
1440 current_binding_level
= current_binding_level
->level_chain
;
1442 while (current_binding_level
->parm_flag
== 2);
1445 /* ...and a poplevel for class declarations. FORCE is used to force
1446 clearing out of CLASS_VALUEs after a class definition. */
1449 poplevel_class (force
)
1452 register struct binding_level
*level
= class_binding_level
;
1453 tree block
= NULL_TREE
;
1456 my_friendly_assert (level
!= 0, 354);
1458 decl_stack
= pop_stack_level (decl_stack
);
1459 for (shadowed
= level
->shadowed
; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
1460 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (shadowed
)) = TREE_VALUE (shadowed
);
1461 /* If we're leaving a toplevel class, don't bother to do the setting
1462 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1463 shouldn't even be used when current_class_type isn't set, and second,
1464 if we don't touch it here, we're able to use the cache effect if the
1465 next time we're entering a class scope, it is the same class. */
1466 if (current_class_depth
!= 1 || force
)
1467 for (shadowed
= level
->class_shadowed
;
1469 shadowed
= TREE_CHAIN (shadowed
))
1470 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = TREE_VALUE (shadowed
);
1472 /* Remember to save what IDENTIFIER's were bound in this scope so we
1473 can recover from cache misses. */
1475 previous_class_type
= current_class_type
;
1476 previous_class_values
= class_binding_level
->class_shadowed
;
1478 for (shadowed
= level
->type_shadowed
;
1480 shadowed
= TREE_CHAIN (shadowed
))
1481 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1483 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1484 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1485 class_binding_level
->parm_flag
,
1486 class_binding_level
->keep
);
1488 if (class_binding_level
->parm_flag
!= 2)
1489 class_binding_level
= (struct binding_level
*)0;
1491 /* Now, pop out of the binding level which we created up in the
1492 `pushlevel_class' routine. */
1493 #if defined(DEBUG_CP_BINDING_LEVELS)
1495 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1497 pop_binding_level ();
1502 /* For debugging. */
1503 static int no_print_functions
= 0;
1504 static int no_print_builtins
= 0;
1507 print_binding_level (lvl
)
1508 struct binding_level
*lvl
;
1512 fprintf (stderr
, " blocks=");
1513 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1514 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1515 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1516 if (lvl
->tag_transparent
)
1517 fprintf (stderr
, " tag-transparent");
1518 if (lvl
->more_cleanups_ok
)
1519 fprintf (stderr
, " more-cleanups-ok");
1520 if (lvl
->have_cleanups
)
1521 fprintf (stderr
, " have-cleanups");
1522 fprintf (stderr
, "\n");
1525 fprintf (stderr
, " names:\t");
1526 /* We can probably fit 3 names to a line? */
1527 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1529 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1531 if (no_print_builtins
1532 && (TREE_CODE (t
) == TYPE_DECL
)
1533 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1536 /* Function decls tend to have longer names. */
1537 if (TREE_CODE (t
) == FUNCTION_DECL
)
1544 fprintf (stderr
, "\n\t");
1547 print_node_brief (stderr
, "", t
, 0);
1548 if (t
== error_mark_node
)
1552 fprintf (stderr
, "\n");
1556 fprintf (stderr
, " tags:\t");
1558 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1560 if (TREE_PURPOSE (t
) == NULL_TREE
)
1562 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1569 fprintf (stderr
, "\n\t");
1572 if (TREE_PURPOSE (t
) == NULL_TREE
)
1574 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1575 fprintf (stderr
, ">");
1577 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1578 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1581 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1582 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1583 fprintf (stderr
, ">");
1587 fprintf (stderr
, "\n");
1591 fprintf (stderr
, " shadowed:");
1592 for (t
= lvl
->shadowed
; t
; t
= TREE_CHAIN (t
))
1594 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1596 fprintf (stderr
, "\n");
1598 if (lvl
->class_shadowed
)
1600 fprintf (stderr
, " class-shadowed:");
1601 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1603 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1605 fprintf (stderr
, "\n");
1607 if (lvl
->type_shadowed
)
1609 fprintf (stderr
, " type-shadowed:");
1610 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1612 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1614 fprintf (stderr
, "\n");
1619 print_other_binding_stack (stack
)
1620 struct binding_level
*stack
;
1622 struct binding_level
*level
;
1623 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1625 fprintf (stderr
, "binding level ");
1626 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1627 fprintf (stderr
, "\n");
1628 print_binding_level (level
);
1633 print_binding_stack ()
1635 struct binding_level
*b
;
1636 fprintf (stderr
, "current_binding_level=");
1637 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1638 fprintf (stderr
, "\nclass_binding_level=");
1639 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
1640 fprintf (stderr
, "\nglobal_binding_level=");
1641 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
1642 fprintf (stderr
, "\n");
1643 if (class_binding_level
)
1645 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1646 if (b
== current_binding_level
)
1649 b
= class_binding_level
;
1651 b
= current_binding_level
;
1654 b
= current_binding_level
;
1655 print_other_binding_stack (b
);
1656 fprintf (stderr
, "global:\n");
1657 print_binding_level (global_binding_level
);
1660 /* Namespace binding access routines: The namespace_bindings field of
1661 the identifier is polymorphic, with three possible values:
1662 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
1663 indicating the BINDING_VALUE of global_namespace. */
1665 /* Check whether the a binding for the name to scope is known.
1666 Assumes that the bindings of the name are already a list
1667 of bindings. Returns the binding found, or NULL_TREE. */
1670 find_binding (name
, scope
)
1674 tree iter
, prev
= NULL_TREE
;
1676 scope
= ORIGINAL_NAMESPACE (scope
);
1678 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
1679 iter
= TREE_CHAIN (iter
))
1681 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
1682 if (BINDING_SCOPE (iter
) == scope
)
1684 /* Move binding found to the fron of the list, so
1685 subsequent lookups will find it faster. */
1688 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
1689 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
1690 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
1699 /* Always returns a binding for name in scope. If the
1700 namespace_bindings is not a list, convert it to one first.
1701 If no binding is found, make a new one. */
1704 binding_for_name (name
, scope
)
1708 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1711 scope
= ORIGINAL_NAMESPACE (scope
);
1713 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
1715 /* Get rid of optimization for global scope. */
1716 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
1717 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
1718 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1720 if (b
&& (result
= find_binding (name
, scope
)))
1722 /* Not found, make a new permanent one. */
1723 push_obstacks (&permanent_obstack
, &permanent_obstack
);
1724 result
= make_node (CPLUS_BINDING
);
1725 TREE_CHAIN (result
) = b
;
1726 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
1727 BINDING_SCOPE (result
) = scope
;
1728 BINDING_TYPE (result
) = NULL_TREE
;
1729 BINDING_VALUE (result
) = NULL_TREE
;
1734 /* Return the binding value for name in scope, considering that
1735 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
1738 namespace_binding (name
, scope
)
1742 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1745 if (scope
== NULL_TREE
)
1746 scope
= global_namespace
;
1747 if (TREE_CODE (b
) != CPLUS_BINDING
)
1748 return (scope
== global_namespace
) ? b
: NULL_TREE
;
1749 name
= find_binding (name
,scope
);
1750 if (name
== NULL_TREE
)
1752 return BINDING_VALUE (name
);
1755 /* Set the binding value for name in scope. If modifying the binding
1756 of global_namespace is attempted, try to optimize it. */
1759 set_namespace_binding (name
, scope
, val
)
1766 if (scope
== NULL_TREE
)
1767 scope
= global_namespace
;
1769 if (scope
== global_namespace
)
1771 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1772 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
1774 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
1778 b
= binding_for_name (name
, scope
);
1779 BINDING_VALUE (b
) = val
;
1782 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
1783 select a name that is unique to this compilation unit. */
1786 push_namespace (name
)
1791 int implicit_use
= 0;
1793 if (!global_namespace
)
1795 /* This must be ::. */
1796 my_friendly_assert (name
== get_identifier ("::"), 377);
1801 /* The name of anonymous namespace is unique for the translation
1803 if (!anonymous_namespace_name
)
1804 anonymous_namespace_name
= get_file_function_name ('N');
1805 name
= anonymous_namespace_name
;
1806 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
1808 /* Reopening anonymous namespace. */
1812 else if (current_namespace
== global_namespace
1813 && name
== DECL_NAME (std_node
))
1820 /* Check whether this is an extended namespace definition. */
1821 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
1822 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
1825 if (DECL_NAMESPACE_ALIAS (d
))
1827 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
1828 d
, DECL_NAMESPACE_ALIAS (d
));
1829 d
= DECL_NAMESPACE_ALIAS (d
);
1836 /* Make a new namespace, binding the name to it. */
1837 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
1838 /* The global namespace is not pushed, and the global binding
1839 level is set elsewhere. */
1844 declare_namespace_level ();
1845 NAMESPACE_LEVEL (d
) = current_binding_level
;
1849 resume_binding_level (NAMESPACE_LEVEL (d
));
1852 do_using_directive (d
);
1853 /* Enter the name space. */
1854 current_namespace
= d
;
1857 /* Pop from the scope of the current namespace. */
1862 if (current_namespace
== global_namespace
)
1864 my_friendly_assert (in_std
>0, 980421);
1868 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
1869 /* The binding level is not popped, as it might be re-opened later. */
1870 suspend_binding_level ();
1873 /* Concatenate the binding levels of all namespaces. */
1876 cat_namespace_levels()
1880 struct binding_level
*b
;
1882 last
= NAMESPACE_LEVEL (global_namespace
) -> names
;
1883 /* The nested namespaces appear in the names list of their ancestors. */
1884 for (current
= last
; current
; current
= TREE_CHAIN (current
))
1886 if (TREE_CODE (current
) != NAMESPACE_DECL
1887 || DECL_NAMESPACE_ALIAS (current
))
1889 if (!DECL_LANG_SPECIFIC (current
))
1892 my_friendly_assert (current
== std_node
, 393);
1895 b
= NAMESPACE_LEVEL (current
);
1896 while (TREE_CHAIN (last
))
1897 last
= TREE_CHAIN (last
);
1898 TREE_CHAIN (last
) = NAMESPACE_LEVEL (current
) -> names
;
1902 /* Subroutines for reverting temporarily to top-level for instantiation
1903 of templates and such. We actually need to clear out the class- and
1904 local-value slots of all identifiers, so that only the global values
1905 are at all visible. Simply setting current_binding_level to the global
1906 scope isn't enough, because more binding levels may be pushed. */
1907 struct saved_scope
{
1908 struct binding_level
*old_binding_level
;
1911 struct saved_scope
*prev
;
1912 tree class_name
, class_type
;
1913 tree access_specifier
;
1915 struct binding_level
*class_bindings
;
1916 tree
*lang_base
, *lang_stack
, lang_name
;
1918 int minimal_parse_mode
;
1919 tree last_function_parms
;
1920 tree template_parms
;
1921 HOST_WIDE_INT processing_template_decl
;
1922 tree previous_class_type
, previous_class_values
;
1923 int processing_specialization
;
1924 int processing_explicit_instantiation
;
1926 static struct saved_scope
*current_saved_scope
;
1928 /* A chain of the binding vecs created by store_bindings. We create a
1929 whole bunch of these during compilation, on permanent_obstack, so we
1930 can't just throw them away. */
1931 static tree free_binding_vecs
;
1934 store_bindings (names
, old_bindings
)
1935 tree names
, old_bindings
;
1938 for (t
= names
; t
; t
= TREE_CHAIN (t
))
1940 tree binding
, t1
, id
;
1942 if (TREE_CODE (t
) == TREE_LIST
)
1943 id
= TREE_PURPOSE (t
);
1948 || (!IDENTIFIER_LOCAL_VALUE (id
)
1949 && !IDENTIFIER_CLASS_VALUE (id
)))
1952 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
1953 if (TREE_VEC_ELT (t1
, 0) == id
)
1956 if (free_binding_vecs
)
1958 binding
= free_binding_vecs
;
1959 free_binding_vecs
= TREE_CHAIN (free_binding_vecs
);
1962 binding
= make_tree_vec (4);
1966 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
1967 TREE_VEC_ELT (binding
, 0) = id
;
1968 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
1969 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_LOCAL_VALUE (id
);
1970 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
1971 IDENTIFIER_LOCAL_VALUE (id
) = NULL_TREE
;
1972 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
1974 TREE_CHAIN (binding
) = old_bindings
;
1975 old_bindings
= binding
;
1979 return old_bindings
;
1983 maybe_push_to_top_level (pseudo
)
1986 extern int current_lang_stacksize
;
1987 struct saved_scope
*s
1988 = (struct saved_scope
*) xmalloc (sizeof (struct saved_scope
));
1989 struct binding_level
*b
= inner_binding_level
;
1990 tree old_bindings
= NULL_TREE
;
1992 if (current_function_decl
)
1993 push_cp_function_context (NULL_TREE
);
1995 if (previous_class_type
)
1996 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
1998 /* Have to include global_binding_level, because class-level decls
1999 aren't listed anywhere useful. */
2000 for (; b
; b
= b
->level_chain
)
2004 /* Template IDs are inserted into the global level. If they were
2005 inserted into namespace level, finish_file wouldn't find them
2006 when doing pending instantiations. Therefore, don't stop at
2007 namespace level, but continue until :: . */
2008 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2011 old_bindings
= store_bindings (b
->names
, old_bindings
);
2012 /* We also need to check class_shadowed to save class-level type
2013 bindings, since pushclass doesn't fill in b->names. */
2014 if (b
->parm_flag
== 2)
2015 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2017 /* Unwind type-value slots back to top level. */
2018 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2019 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2022 s
->old_binding_level
= current_binding_level
;
2023 current_binding_level
= b
;
2025 s
->old_namespace
= current_namespace
;
2026 s
->class_name
= current_class_name
;
2027 s
->class_type
= current_class_type
;
2028 s
->access_specifier
= current_access_specifier
;
2029 s
->function_decl
= current_function_decl
;
2030 s
->class_bindings
= class_binding_level
;
2031 s
->lang_stack
= current_lang_stack
;
2032 s
->lang_base
= current_lang_base
;
2033 s
->lang_stacksize
= current_lang_stacksize
;
2034 s
->lang_name
= current_lang_name
;
2035 s
->minimal_parse_mode
= minimal_parse_mode
;
2036 s
->last_function_parms
= last_function_parms
;
2037 s
->template_parms
= current_template_parms
;
2038 s
->processing_template_decl
= processing_template_decl
;
2039 s
->previous_class_type
= previous_class_type
;
2040 s
->previous_class_values
= previous_class_values
;
2041 s
->processing_specialization
= processing_specialization
;
2042 s
->processing_explicit_instantiation
= processing_explicit_instantiation
;
2044 current_class_name
= current_class_type
= NULL_TREE
;
2045 current_function_decl
= NULL_TREE
;
2046 class_binding_level
= (struct binding_level
*)0;
2047 current_lang_stacksize
= 10;
2048 current_lang_stack
= current_lang_base
2049 = (tree
*) xmalloc (current_lang_stacksize
* sizeof (tree
));
2050 current_lang_name
= lang_name_cplusplus
;
2051 strict_prototype
= strict_prototypes_lang_cplusplus
;
2052 named_labels
= NULL_TREE
;
2053 shadowed_labels
= NULL_TREE
;
2054 minimal_parse_mode
= 0;
2055 previous_class_type
= previous_class_values
= NULL_TREE
;
2056 processing_specialization
= 0;
2057 processing_explicit_instantiation
= 0;
2058 current_template_parms
= NULL_TREE
;
2059 processing_template_decl
= 0;
2060 current_namespace
= global_namespace
;
2062 s
->prev
= current_saved_scope
;
2063 s
->old_bindings
= old_bindings
;
2064 current_saved_scope
= s
;
2066 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2070 push_to_top_level ()
2072 maybe_push_to_top_level (0);
2076 pop_from_top_level ()
2078 extern int current_lang_stacksize
;
2079 struct saved_scope
*s
= current_saved_scope
;
2082 /* Clear out class-level bindings cache. */
2083 if (previous_class_type
)
2086 previous_class_type
= NULL_TREE
;
2091 current_binding_level
= s
->old_binding_level
;
2092 current_saved_scope
= s
->prev
;
2093 for (t
= s
->old_bindings
; t
; )
2096 tree id
= TREE_VEC_ELT (t
, 0);
2099 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2100 IDENTIFIER_LOCAL_VALUE (id
) = TREE_VEC_ELT (t
, 2);
2101 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2104 TREE_CHAIN (save
) = free_binding_vecs
;
2105 free_binding_vecs
= save
;
2107 current_namespace
= s
->old_namespace
;
2108 current_class_name
= s
->class_name
;
2109 current_class_type
= s
->class_type
;
2110 current_access_specifier
= s
->access_specifier
;
2111 current_function_decl
= s
->function_decl
;
2112 class_binding_level
= s
->class_bindings
;
2113 free (current_lang_base
);
2114 current_lang_base
= s
->lang_base
;
2115 current_lang_stack
= s
->lang_stack
;
2116 current_lang_name
= s
->lang_name
;
2117 current_lang_stacksize
= s
->lang_stacksize
;
2118 if (current_lang_name
== lang_name_cplusplus
)
2119 strict_prototype
= strict_prototypes_lang_cplusplus
;
2120 else if (current_lang_name
== lang_name_c
)
2121 strict_prototype
= strict_prototypes_lang_c
;
2122 minimal_parse_mode
= s
->minimal_parse_mode
;
2123 last_function_parms
= s
->last_function_parms
;
2124 current_template_parms
= s
->template_parms
;
2125 processing_template_decl
= s
->processing_template_decl
;
2126 previous_class_type
= s
->previous_class_type
;
2127 previous_class_values
= s
->previous_class_values
;
2128 processing_specialization
= s
->processing_specialization
;
2129 processing_explicit_instantiation
= s
->processing_explicit_instantiation
;
2133 if (current_function_decl
)
2134 pop_cp_function_context (NULL_TREE
);
2137 /* Push a definition of struct, union or enum tag "name".
2138 into binding_level "b". "type" should be the type node,
2139 We assume that the tag "name" is not already defined.
2141 Note that the definition may really be just a forward reference.
2142 In that case, the TYPE_SIZE will be a NULL_TREE.
2144 C++ gratuitously puts all these tags in the name space. */
2146 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2147 record the shadowed value for this binding contour. TYPE is
2148 the type that ID maps to. */
2151 set_identifier_type_value_with_scope (id
, type
, b
)
2154 struct binding_level
*b
;
2156 if (!b
->namespace_p
)
2158 /* Shadow the marker, not the real thing, so that the marker
2159 gets restored later. */
2160 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2162 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2166 tree binding
= binding_for_name (id
, current_namespace
);
2167 BINDING_TYPE (binding
) = type
;
2168 /* Store marker instead of real type. */
2169 type
= global_type_node
;
2171 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2174 /* As set_identifier_type_value_with_scope, but using inner_binding_level. */
2177 set_identifier_type_value (id
, type
)
2181 set_identifier_type_value_with_scope (id
, type
, inner_binding_level
);
2185 set_identifier_local_value_with_scope (id
, val
, b
)
2187 struct binding_level
*b
;
2190 my_friendly_assert (! b
->namespace_p
, 980716);
2192 oldlocal
= IDENTIFIER_LOCAL_VALUE (id
);
2193 b
->shadowed
= tree_cons (id
, oldlocal
, b
->shadowed
);
2194 IDENTIFIER_LOCAL_VALUE (id
) = val
;
2198 set_identifier_local_value (id
, val
)
2201 set_identifier_local_value_with_scope (id
, val
, current_binding_level
);
2204 /* Return the type associated with id. */
2207 identifier_type_value (id
)
2210 /* There is no type with that name, anywhere. */
2211 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2213 /* This is not the type marker, but the real thing. */
2214 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2215 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2216 /* Have to search for it. It must be on the global level, now.
2217 Ask lookup_name not to return non-types. */
2218 id
= lookup_name_real (id
, 2, 1, 0);
2220 return TREE_TYPE (id
);
2224 /* Pop off extraneous binding levels left over due to syntax errors.
2226 We don't pop past namespaces, as they might be valid. */
2231 #ifdef DEBUG_CP_BINDING_LEVELS
2232 fprintf (stderr
, "XXX entering pop_everything ()\n");
2234 while (! toplevel_bindings_p () && ! pseudo_global_level_p ())
2236 if (class_binding_level
)
2237 pop_nested_class (1);
2241 #ifdef DEBUG_CP_BINDING_LEVELS
2242 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2246 /* The type TYPE is being declared. If it is a class template, or a
2247 specialization of a class template, do any processing required and
2248 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2249 being declared a friend. B is the binding level at which this TYPE
2252 Returns the TYPE_DECL for TYPE, which may have been altered by this
2256 maybe_process_template_type_declaration (type
, globalize
, b
)
2259 struct binding_level
* b
;
2261 tree decl
= TYPE_NAME (type
);
2263 if (processing_template_parmlist
)
2264 /* You can't declare a new template type in a template parameter
2265 list. But, you can declare a non-template type:
2267 template <class A*> struct S;
2269 is a forward-declaration of `A'. */
2273 maybe_check_template_type (type
);
2275 my_friendly_assert (IS_AGGR_TYPE (type
)
2276 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2279 if (/* If !GLOBALIZE then we are looking at a definition.
2280 It may not be a primary template. (For example, in:
2283 struct S1 { class S2 {}; }
2285 we have to push_template_decl for S2.) */
2286 (processing_template_decl
&& !globalize
)
2287 /* If we are declaring a friend template class, we will
2288 have GLOBALIZE set, since something like:
2296 declares S2 to be at global scope. */
2297 || PROCESSING_REAL_TEMPLATE_DECL_P ())
2299 /* This may change after the call to
2300 push_template_decl_real, but we want the original value. */
2301 tree name
= DECL_NAME (decl
);
2303 decl
= push_template_decl_real (decl
, globalize
);
2304 /* If the current binding level is the binding level for the
2305 template parameters (see the comment in
2306 begin_template_parm_list) and the enclosing level is a class
2307 scope, and we're not looking at a friend, push the
2308 declaration of the member class into the class scope. In the
2309 friend case, push_template_decl will already have put the
2310 friend into global scope, if appropriate. */
2311 if (TREE_CODE (type
) != ENUMERAL_TYPE
2312 && !globalize
&& b
->pseudo_global
2313 && b
->level_chain
->parm_flag
== 2)
2315 pushdecl_with_scope (CLASSTYPE_TI_TEMPLATE (type
),
2317 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2318 /* Put this tag on the list of tags for the class, since
2319 that won't happen below because B is not the class
2320 binding level, but is instead the pseudo-global level. */
2321 b
->level_chain
->tags
=
2322 saveable_tree_cons (name
, type
, b
->level_chain
->tags
);
2323 TREE_NONLOCAL_FLAG (type
) = 1;
2324 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2325 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2333 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2334 Normally put it into the inner-most non-tag-transparent scope,
2335 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2336 The latter is needed for implicit declarations. */
2339 pushtag (name
, type
, globalize
)
2343 register struct binding_level
*b
;
2347 b
= inner_binding_level
;
2348 while (b
->tag_transparent
2349 || (globalize
&& b
->parm_flag
== 2))
2352 if (toplevel_bindings_p ())
2353 b
->tags
= perm_tree_cons (name
, type
, b
->tags
);
2355 b
->tags
= saveable_tree_cons (name
, type
, b
->tags
);
2359 context
= type
? TYPE_CONTEXT (type
) : NULL_TREE
;
2362 tree cs
= current_scope ();
2366 else if (cs
!= NULL_TREE
2367 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2368 /* When declaring a friend class of a local class, we want
2369 to inject the newly named class into the scope
2370 containing the local class, not the namespace scope. */
2371 context
= hack_decl_function_context (get_type_decl (cs
));
2374 c_decl
= TREE_CODE (context
) == FUNCTION_DECL
2375 ? context
: TYPE_MAIN_DECL (context
);
2378 context
= current_namespace
;
2380 /* Do C++ gratuitous typedefing. */
2381 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2383 register tree d
= NULL_TREE
;
2384 int newdecl
= 0, in_class
= 0;
2386 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2387 || b
->parm_flag
== 2)
2390 d
= lookup_nested_type (type
, c_decl
);
2395 d
= build_decl (TYPE_DECL
, name
, type
);
2396 if (current_lang_name
== lang_name_java
)
2397 TYPE_FOR_JAVA (type
) = 1;
2398 SET_DECL_ARTIFICIAL (d
);
2400 set_identifier_type_value_with_scope (name
, type
, b
);
2403 d
= TYPE_MAIN_DECL (d
);
2405 TYPE_NAME (type
) = d
;
2406 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2408 d
= maybe_process_template_type_declaration (type
,
2411 if (b
->parm_flag
== 2)
2413 pushdecl_class_level (d
);
2414 if (newdecl
&& !PROCESSING_REAL_TEMPLATE_DECL_P ())
2415 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2416 class. But if it's a member template class, we
2417 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2419 finish_member_declaration (d
);
2422 d
= pushdecl_with_scope (d
, b
);
2426 if (ANON_AGGRNAME_P (name
))
2427 DECL_IGNORED_P (d
) = 1;
2429 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2430 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2431 if (!uses_template_parms (type
))
2432 DECL_ASSEMBLER_NAME (d
)
2433 = get_identifier (build_overload_name (type
, 1, 1));
2436 if (b
->parm_flag
== 2)
2438 TREE_NONLOCAL_FLAG (type
) = 1;
2439 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2440 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2444 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2445 /* Use the canonical TYPE_DECL for this node. */
2446 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2449 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2450 will be the tagged type we just added to the current
2451 binding level. This fake NULL-named TYPE_DECL node helps
2452 dwarfout.c to know when it needs to output a
2453 representation of a tagged type, and it also gives us a
2454 convenient place to record the "scope start" address for
2457 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2458 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2462 /* Counter used to create anonymous type names. */
2464 static int anon_cnt
= 0;
2466 /* Return an IDENTIFIER which can be used as a name for
2467 anonymous structs and unions. */
2474 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2475 return get_identifier (buf
);
2478 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2479 This keeps dbxout from getting confused. */
2484 register struct binding_level
*b
;
2486 static int last_cnt
= 0;
2488 /* Fast out if no new anon names were declared. */
2489 if (last_cnt
== anon_cnt
)
2492 b
= current_binding_level
;
2493 while (b
->tag_transparent
)
2498 /* A NULL purpose means we have already processed all tags
2499 from here to the end of the list. */
2500 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2502 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2503 TREE_PURPOSE (tags
) = NULL_TREE
;
2504 tags
= TREE_CHAIN (tags
);
2506 last_cnt
= anon_cnt
;
2509 /* Subroutine of duplicate_decls: return truthvalue of whether
2510 or not types of these decls match.
2512 For C++, we must compare the parameter list so that `int' can match
2513 `int&' in a parameter position, but `int&' is not confused with
2517 decls_match (newdecl
, olddecl
)
2518 tree newdecl
, olddecl
;
2522 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2523 /* If the two DECLs are not even the same kind of thing, we're not
2524 interested in their types. */
2527 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2529 tree f1
= TREE_TYPE (newdecl
);
2530 tree f2
= TREE_TYPE (olddecl
);
2531 tree p1
= TYPE_ARG_TYPES (f1
);
2532 tree p2
= TYPE_ARG_TYPES (f2
);
2534 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2535 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2536 && DECL_LANGUAGE (olddecl
) == lang_c
))
2539 /* When we parse a static member function definition,
2540 we put together a FUNCTION_DECL which thinks its type
2541 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2543 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2544 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2545 else if (TREE_CODE (f2
) == METHOD_TYPE
2546 && DECL_STATIC_FUNCTION_P (newdecl
))
2547 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2549 /* Here we must take care of the case where new default
2550 parameters are specified. Also, warn if an old
2551 declaration becomes ambiguous because default
2552 parameters may cause the two to be ambiguous. */
2553 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2555 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2556 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2558 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2562 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2564 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2567 types_match
= self_promoting_args_p (p1
);
2568 if (p1
== void_list_node
)
2569 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2571 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2572 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2574 types_match
= self_promoting_args_p (p2
);
2575 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2578 types_match
= compparms (p1
, p2
);
2583 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2585 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2586 DECL_TEMPLATE_PARMS (olddecl
)))
2589 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2592 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2593 DECL_TEMPLATE_RESULT (newdecl
));
2597 if (TREE_TYPE (newdecl
) == error_mark_node
)
2598 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2599 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2600 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2601 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2604 types_match
= comptypes (TREE_TYPE (newdecl
),
2605 TREE_TYPE (olddecl
),
2606 COMPARE_REDECLARATION
);
2612 /* If NEWDECL is `static' and an `extern' was seen previously,
2613 warn about it. (OLDDECL may be NULL_TREE; NAME contains
2614 information about previous usage as an `extern'.)
2616 Note that this does not apply to the C++ case of declaring
2617 a variable `extern const' and then later `const'.
2619 Don't complain about built-in functions, since they are beyond
2620 the user's control. */
2623 warn_extern_redeclared_static (newdecl
, olddecl
)
2624 tree newdecl
, olddecl
;
2628 static char *explicit_extern_static_warning
2629 = "`%D' was declared `extern' and later `static'";
2630 static char *implicit_extern_static_warning
2631 = "`%D' was declared implicitly `extern' and later `static'";
2633 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2636 name
= DECL_ASSEMBLER_NAME (newdecl
);
2637 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
2639 /* It's okay to redeclare an ANSI built-in function as static,
2640 or to declare a non-ANSI built-in function as anything. */
2641 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
2642 && olddecl
!= NULL_TREE
2643 && TREE_CODE (olddecl
) == FUNCTION_DECL
2644 && (DECL_BUILT_IN (olddecl
)
2645 || DECL_BUILT_IN_NONANSI (olddecl
))))
2647 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2648 ? implicit_extern_static_warning
2649 : explicit_extern_static_warning
, newdecl
);
2650 if (olddecl
!= NULL_TREE
)
2651 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2656 /* Handle when a new declaration NEWDECL has the same name as an old
2657 one OLDDECL in the same binding contour. Prints an error message
2660 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2661 Otherwise, return 0. */
2664 duplicate_decls (newdecl
, olddecl
)
2665 tree newdecl
, olddecl
;
2667 extern struct obstack permanent_obstack
;
2668 unsigned olddecl_uid
= DECL_UID (olddecl
);
2669 int olddecl_friend
= 0, types_match
= 0;
2670 int new_defines_function
= 0;
2672 if (newdecl
== olddecl
)
2675 types_match
= decls_match (newdecl
, olddecl
);
2677 /* If either the type of the new decl or the type of the old decl is an
2678 error_mark_node, then that implies that we have already issued an
2679 error (earlier) for some bogus type specification, and in that case,
2680 it is rather pointless to harass the user with yet more error message
2681 about the same declaration, so just pretend the types match here. */
2682 if (TREE_TYPE (newdecl
) == error_mark_node
2683 || TREE_TYPE (olddecl
) == error_mark_node
)
2686 /* Check for redeclaration and other discrepancies. */
2687 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2688 && DECL_ARTIFICIAL (olddecl
)
2689 && (DECL_BUILT_IN (olddecl
) || DECL_BUILT_IN_NONANSI (olddecl
)))
2691 /* If you declare a built-in or predefined function name as static,
2692 the old definition is overridden, but optionally warn this was a
2693 bad choice of name. Ditto for overloads. */
2694 if (! TREE_PUBLIC (newdecl
)
2695 || (TREE_CODE (newdecl
) == FUNCTION_DECL
2696 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
)))
2699 cp_warning ("shadowing %s function `%#D'",
2700 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2702 /* Discard the old built-in function. */
2705 else if (! types_match
)
2707 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2709 /* If the built-in is not ansi, then programs can override
2710 it even globally without an error. */
2711 if (! DECL_BUILT_IN (olddecl
))
2712 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2716 cp_error ("declaration of `%#D'", newdecl
);
2717 cp_error ("conflicts with built-in declaration `%#D'",
2723 cp_warning ("declaration of `%#D'", newdecl
);
2724 cp_warning ("conflicts with built-in declaration `%#D'",
2728 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
2730 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
2731 && TREE_CODE (newdecl
) != TYPE_DECL
2732 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
2733 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
2734 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
2735 && TREE_CODE (olddecl
) != TYPE_DECL
2736 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
2737 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
2740 /* We do nothing special here, because C++ does such nasty
2741 things with TYPE_DECLs. Instead, just let the TYPE_DECL
2742 get shadowed, and know that if we need to find a TYPE_DECL
2743 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
2744 slot of the identifier. */
2748 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
2749 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
2750 || (TREE_CODE (olddecl
) == FUNCTION_DECL
2751 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
2754 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
2755 if (TREE_CODE (olddecl
) == TREE_LIST
)
2756 olddecl
= TREE_VALUE (olddecl
);
2757 cp_error_at ("previous declaration of `%#D'", olddecl
);
2759 /* New decl is completely inconsistent with the old one =>
2760 tell caller to replace the old one. */
2764 else if (!types_match
)
2766 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2768 /* The name of a class template may not be declared to refer to
2769 any other template, class, function, object, namespace, value,
2770 or type in the same scope. */
2771 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
2772 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2774 cp_error ("declaration of template `%#D'", newdecl
);
2775 cp_error_at ("conflicts with previous declaration `%#D'",
2778 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
2779 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
2780 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
2781 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
2782 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2783 DECL_TEMPLATE_PARMS (olddecl
)))
2785 cp_error ("new declaration `%#D'", newdecl
);
2786 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
2790 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2792 if (DECL_LANGUAGE (newdecl
) == lang_c
2793 && DECL_LANGUAGE (olddecl
) == lang_c
)
2795 cp_error ("declaration of C function `%#D' conflicts with",
2797 cp_error_at ("previous declaration `%#D' here", olddecl
);
2799 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
2800 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
2802 cp_error ("new declaration `%#D'", newdecl
);
2803 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
2809 /* Already complained about this, so don't do so again. */
2810 else if (current_class_type
== NULL_TREE
2811 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
2813 cp_error ("conflicting types for `%#D'", newdecl
);
2814 cp_error_at ("previous declaration as `%#D'", olddecl
);
2817 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
2818 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
2819 && (!DECL_TEMPLATE_INFO (newdecl
)
2820 || (DECL_TI_TEMPLATE (newdecl
)
2821 != DECL_TI_TEMPLATE (olddecl
))))
2822 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
2823 && (!DECL_TEMPLATE_INFO (olddecl
)
2824 || (DECL_TI_TEMPLATE (olddecl
)
2825 != DECL_TI_TEMPLATE (newdecl
))))))
2826 /* It's OK to have a template specialization and a non-template
2827 with the same type, or to have specializations of two
2828 different templates with the same type. Note that if one is a
2829 specialization, and the other is an instantiation of the same
2830 template, that we do not exit at this point. That situation
2831 can occur if we instantiate a template class, and then
2832 specialize one of its methods. This situation is legal, but
2833 the declarations must be merged in the usual way. */
2835 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
2836 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
2837 && !DECL_USE_TEMPLATE (newdecl
))
2838 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
2839 && !DECL_USE_TEMPLATE (olddecl
))))
2840 /* One of the declarations is a template instantiation, and the
2841 other is not a template at all. That's OK. */
2843 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
2844 && DECL_NAMESPACE_ALIAS (newdecl
)
2845 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
2846 /* Redeclaration of namespace alias, ignore it. */
2850 char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
2853 cp_error (errmsg
, newdecl
);
2854 if (DECL_NAME (olddecl
) != NULL_TREE
)
2855 cp_error_at ((DECL_INITIAL (olddecl
)
2856 && namespace_bindings_p ())
2857 ? "`%#D' previously defined here"
2858 : "`%#D' previously declared here", olddecl
);
2860 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
2861 && DECL_INITIAL (olddecl
) != NULL_TREE
2862 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
2863 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
2865 /* Prototype decl follows defn w/o prototype. */
2866 cp_warning_at ("prototype for `%#D'", newdecl
);
2867 cp_warning_at ("follows non-prototype definition here", olddecl
);
2869 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
2870 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
2872 /* extern "C" int foo ();
2873 int foo () { bar (); }
2875 if (current_lang_stack
== current_lang_base
)
2876 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
2879 cp_error_at ("previous declaration of `%#D' with %L linkage",
2880 olddecl
, DECL_LANGUAGE (olddecl
));
2881 cp_error ("conflicts with new declaration with %L linkage",
2882 DECL_LANGUAGE (newdecl
));
2886 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
2888 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
2890 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
2891 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
2894 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
2895 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
2897 for (; t1
&& t1
!= void_list_node
;
2898 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
2899 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
2901 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
2906 cp_pedwarn ("default argument given for parameter %d of `%#D'",
2908 cp_pedwarn_at ("after previous specification in `%#D'",
2914 cp_error ("default argument given for parameter %d of `%#D'",
2916 cp_error_at ("after previous specification in `%#D'",
2921 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
2922 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
2924 cp_warning ("`%#D' was used before it was declared inline",
2926 cp_warning_at ("previous non-inline declaration here",
2932 /* If new decl is `static' and an `extern' was seen previously,
2934 warn_extern_redeclared_static (newdecl
, olddecl
);
2936 /* We have committed to returning 1 at this point. */
2937 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2939 /* Now that functions must hold information normally held
2940 by field decls, there is extra work to do so that
2941 declaration information does not get destroyed during
2943 if (DECL_VINDEX (olddecl
))
2944 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
2945 if (DECL_CONTEXT (olddecl
))
2946 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
2947 if (DECL_CLASS_CONTEXT (olddecl
))
2948 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
2949 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
2950 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
2951 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
2952 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
2953 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
2954 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
2955 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
2956 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
2958 /* Optionally warn about more than one declaration for the same
2959 name, but don't warn about a function declaration followed by a
2961 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
2962 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
2963 /* Don't warn about extern decl followed by definition. */
2964 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
2965 /* Don't warn about friends, let add_friend take care of it. */
2966 && ! DECL_FRIEND_P (newdecl
))
2968 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
2969 cp_warning_at ("previous declaration of `%D'", olddecl
);
2973 /* Deal with C++: must preserve virtual function table size. */
2974 if (TREE_CODE (olddecl
) == TYPE_DECL
)
2976 register tree newtype
= TREE_TYPE (newdecl
);
2977 register tree oldtype
= TREE_TYPE (olddecl
);
2979 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
2980 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
2982 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
2983 CLASSTYPE_FRIEND_CLASSES (newtype
)
2984 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
2988 /* Copy all the DECL_... slots specified in the new decl
2989 except for any that we copy here from the old type. */
2990 DECL_MACHINE_ATTRIBUTES (newdecl
)
2991 = merge_machine_decl_attributes (olddecl
, newdecl
);
2993 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2995 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
2996 DECL_TEMPLATE_RESULT (olddecl
)))
2997 cp_error ("invalid redeclaration of %D", newdecl
);
2998 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
2999 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3000 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3001 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3008 /* Automatically handles default parameters. */
3009 tree oldtype
= TREE_TYPE (olddecl
);
3012 /* Make sure we put the new type in the same obstack as the old one. */
3014 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3017 push_obstacks_nochange ();
3018 end_temporary_allocation ();
3021 /* Merge the data types specified in the two decls. */
3022 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3024 if (TREE_CODE (newdecl
) == VAR_DECL
)
3025 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3026 /* Do this after calling `common_type' so that default
3027 parameters don't confuse us. */
3028 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3029 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3030 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3032 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3033 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3034 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3035 TYPE_RAISES_EXCEPTIONS (oldtype
));
3037 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3038 && DECL_SOURCE_LINE (olddecl
) != 0
3040 && ! compexcepttypes (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
3042 cp_pedwarn ("declaration of `%D' throws different exceptions",
3044 cp_pedwarn_at ("previous declaration here", olddecl
);
3047 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3049 /* Lay the type out, unless already done. */
3050 if (newtype
!= canonical_type_variant (oldtype
)
3051 && TREE_TYPE (newdecl
) != error_mark_node
3052 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3053 layout_type (TREE_TYPE (newdecl
));
3055 if ((TREE_CODE (newdecl
) == VAR_DECL
3056 || TREE_CODE (newdecl
) == PARM_DECL
3057 || TREE_CODE (newdecl
) == RESULT_DECL
3058 || TREE_CODE (newdecl
) == FIELD_DECL
3059 || TREE_CODE (newdecl
) == TYPE_DECL
)
3060 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3061 layout_decl (newdecl
, 0);
3063 /* Merge the type qualifiers. */
3064 if (TREE_READONLY (newdecl
))
3065 TREE_READONLY (olddecl
) = 1;
3066 if (TREE_THIS_VOLATILE (newdecl
))
3067 TREE_THIS_VOLATILE (olddecl
) = 1;
3069 /* Merge the initialization information. */
3070 if (DECL_INITIAL (newdecl
) == NULL_TREE
3071 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3073 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3074 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3075 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3076 if (DECL_LANG_SPECIFIC (newdecl
)
3077 && DECL_LANG_SPECIFIC (olddecl
))
3078 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3081 /* Merge the section attribute.
3082 We want to issue an error if the sections conflict but that must be
3083 done later in decl_attributes since we are called before attributes
3085 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3086 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3088 /* Keep the old rtl since we can safely use it, unless it's the
3089 call to abort() used for abstract virtuals. */
3090 if ((DECL_LANG_SPECIFIC (olddecl
)
3091 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3092 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
3093 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3097 /* If cannot merge, then use the new type and qualifiers,
3098 and don't preserve the old rtl. */
3101 /* Clean out any memory we had of the old declaration. */
3102 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3104 TREE_VALUE (oldstatic
) = error_mark_node
;
3106 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3107 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3108 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3109 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3112 /* Merge the storage class information. */
3113 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3114 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3115 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3116 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3117 if (! DECL_EXTERNAL (olddecl
))
3118 DECL_EXTERNAL (newdecl
) = 0;
3120 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3122 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3123 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3124 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3125 /* Don't really know how much of the language-specific
3126 values we should copy from old to new. */
3127 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3128 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3129 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3130 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3131 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3134 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3136 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3137 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3139 /* If newdecl is not a specialization, then it is not a
3140 template-related function at all. And that means that we
3141 shoud have exited above, returning 0. */
3142 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3145 if (TREE_USED (olddecl
))
3146 /* From [temp.expl.spec]:
3148 If a template, a member template or the member of a class
3149 template is explicitly specialized then that
3150 specialization shall be declared before the first use of
3151 that specialization that would cause an implicit
3152 instantiation to take place, in every translation unit in
3153 which such a use occurs. */
3154 cp_error ("explicit specialization of %D after first use",
3157 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3159 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3161 /* If either decl says `inline', this fn is inline, unless its
3162 definition was passed already. */
3163 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3164 DECL_INLINE (olddecl
) = 1;
3165 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3169 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3170 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3171 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3173 if (! types_match
|| new_defines_function
)
3175 /* These need to be copied so that the names are available. */
3176 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3177 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3179 if (new_defines_function
)
3180 /* If defining a function declared with other language
3181 linkage, use the previously declared language linkage. */
3182 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3185 /* If redeclaring a builtin function, and not a definition,
3186 it stays built in. */
3187 if (DECL_BUILT_IN (olddecl
))
3189 DECL_BUILT_IN (newdecl
) = 1;
3190 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3191 /* If we're keeping the built-in definition, keep the rtl,
3192 regardless of declaration matches. */
3193 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3196 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3198 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3199 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3200 /* Previously saved insns go together with
3201 the function's previous definition. */
3202 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3203 /* Don't clear out the arguments if we're redefining a function. */
3204 if (DECL_ARGUMENTS (olddecl
))
3205 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3207 if (DECL_LANG_SPECIFIC (olddecl
))
3208 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3211 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3213 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3216 /* Now preserve various other info from the definition. */
3217 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3218 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3219 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3220 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3222 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3225 struct lang_decl
*ol
= DECL_LANG_SPECIFIC (olddecl
);
3226 struct lang_decl
*nl
= DECL_LANG_SPECIFIC (newdecl
);
3228 function_size
= sizeof (struct tree_decl
);
3230 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3231 (char *) olddecl
+ sizeof (struct tree_common
),
3232 function_size
- sizeof (struct tree_common
));
3234 /* Can we safely free the storage used by newdecl? */
3236 #define ROUND(x) ((x + obstack_alignment_mask (&permanent_obstack)) \
3237 & ~ obstack_alignment_mask (&permanent_obstack))
3239 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3241 /* If newdecl is a template instantiation, it is possible that
3242 the following sequence of events has occurred:
3244 o A friend function was declared in a class template. The
3245 class template was instantiated.
3247 o The instantiation of the friend declaration was
3248 recorded on the instantiation list, and is newdecl.
3250 o Later, however, instantiate_class_template called pushdecl
3251 on the newdecl to perform name injection. But, pushdecl in
3252 turn called duplicate_decls when it discovered that another
3253 declaration of a global function with the same name already
3256 o Here, in duplicate_decls, we decided to clobber newdecl.
3258 If we're going to do that, we'd better make sure that
3259 olddecl, and not newdecl, is on the list of
3260 instantiations so that if we try to do the instantiation
3261 again we won't get the clobbered declaration. */
3263 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3264 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3266 for (; decls
; decls
= TREE_CHAIN (decls
))
3267 if (TREE_VALUE (decls
) == newdecl
)
3268 TREE_VALUE (decls
) = olddecl
;
3271 if (((char *)newdecl
+ ROUND (function_size
) == (char *)nl
3272 && ((char *)newdecl
+ ROUND (function_size
)
3273 + ROUND (sizeof (struct lang_decl
))
3274 == obstack_next_free (&permanent_obstack
)))
3275 || ((char *)newdecl
+ ROUND (function_size
)
3276 == obstack_next_free (&permanent_obstack
)))
3278 DECL_MAIN_VARIANT (newdecl
) = olddecl
;
3279 DECL_LANG_SPECIFIC (olddecl
) = ol
;
3280 bcopy ((char *)nl
, (char *)ol
, sizeof (struct lang_decl
));
3282 obstack_free (&permanent_obstack
, newdecl
);
3284 else if (LANG_DECL_PERMANENT (ol
) && ol
!= nl
)
3286 if (DECL_MAIN_VARIANT (olddecl
) == olddecl
)
3288 /* Save these lang_decls that would otherwise be lost. */
3289 extern tree free_lang_decl_chain
;
3290 tree free_lang_decl
= (tree
) ol
;
3292 if (DECL_LANG_SPECIFIC (olddecl
) == ol
)
3295 TREE_CHAIN (free_lang_decl
) = free_lang_decl_chain
;
3296 free_lang_decl_chain
= free_lang_decl
;
3300 /* Storage leak. */;
3306 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3307 (char *) olddecl
+ sizeof (struct tree_common
),
3308 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3309 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3312 DECL_UID (olddecl
) = olddecl_uid
;
3314 DECL_FRIEND_P (olddecl
) = 1;
3316 /* NEWDECL contains the merged attribute lists.
3317 Update OLDDECL to be the same. */
3318 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3323 /* Record a decl-node X as belonging to the current lexical scope.
3324 Check for errors (such as an incompatible declaration for the same
3325 name already seen in the same scope).
3327 Returns either X or an old decl for the same name.
3328 If an old decl is returned, it may have been smashed
3329 to agree with what X says. */
3336 register tree name
= DECL_ASSEMBLER_NAME (x
);
3337 register struct binding_level
*b
= current_binding_level
;
3339 if (current_function_decl
&& x
!= current_function_decl
3340 /* A local declaration for a function doesn't constitute nesting. */
3341 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3342 /* Don't change DECL_CONTEXT of virtual methods. */
3343 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3344 && ! DECL_CONTEXT (x
))
3345 DECL_CONTEXT (x
) = current_function_decl
;
3346 if (!DECL_CONTEXT (x
))
3347 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3349 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3350 compiler wants to use. */
3351 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3352 || TREE_CODE (x
) == NAMESPACE_DECL
|| TREE_CODE (x
) == TEMPLATE_TYPE_PARM
3353 || TREE_CODE (x
) == TEMPLATE_TEMPLATE_PARM
)
3354 name
= DECL_NAME (x
);
3359 /* Not needed...see below. */
3363 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3364 name
= TREE_OPERAND (name
, 0);
3366 /* Namespace-scoped variables are not found in the current level. */
3367 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3368 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3370 t
= lookup_name_current_level (name
);
3371 if (t
== error_mark_node
)
3373 /* error_mark_node is 0 for a while during initialization! */
3375 cp_error_at ("`%#D' used prior to declaration", x
);
3378 else if (t
!= NULL_TREE
)
3381 /* This is turned off until I have time to do it right (bpk). */
3382 /* With the code below that uses it... */
3383 file
= DECL_SOURCE_FILE (t
);
3384 line
= DECL_SOURCE_LINE (t
);
3386 if (TREE_CODE (t
) == PARM_DECL
)
3388 if (DECL_CONTEXT (t
) == NULL_TREE
)
3389 fatal ("parse errors have confused me too much");
3391 /* Check for duplicate params. */
3392 if (duplicate_decls (x
, t
))
3395 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3396 || DECL_FUNCTION_TEMPLATE_P (x
))
3397 && is_overloaded_fn (t
))
3398 /* Don't do anything just yet. */;
3399 else if (t
== wchar_decl_node
)
3401 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3402 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3404 /* Throw away the redeclaration. */
3407 else if (TREE_CODE (t
) != TREE_CODE (x
))
3409 if (duplicate_decls (x
, t
))
3412 else if (duplicate_decls (x
, t
))
3415 /* This is turned off until I have time to do it right (bpk). */
3417 /* Also warn if they did a prototype with `static' on it, but
3418 then later left the `static' off. */
3419 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3421 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3426 cp_warning ("`static' missing from declaration of `%D'",
3428 warning_with_file_and_line (file
, line
,
3429 "previous declaration of `%s'",
3430 decl_as_string (t
, 0));
3433 /* Now fix things so it'll do what they expect. */
3434 if (current_function_decl
)
3435 TREE_PUBLIC (current_function_decl
) = 0;
3437 /* Due to interference in memory reclamation (X may be
3438 obstack-deallocated at this point), we must guard against
3439 one really special case. [jason: This should be handled
3440 by start_function] */
3441 if (current_function_decl
== x
)
3442 current_function_decl
= t
;
3444 if (TREE_CODE (t
) == TYPE_DECL
)
3445 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3446 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3447 check_default_args (t
);
3451 else if (DECL_MAIN_P (x
))
3453 /* A redeclaration of main, but not a duplicate of the
3458 This function shall not be overloaded. */
3459 cp_error_at ("invalid redeclaration of `%D'", t
);
3460 cp_error ("as `%D'", x
);
3461 /* We don't try to push this declaration since that
3467 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3469 t
= push_overloaded_decl (x
, 1);
3470 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3473 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3474 return push_overloaded_decl (x
, 0);
3476 /* If declaring a type as a typedef, copy the type (unless we're
3477 at line 0), and install this TYPE_DECL as the new type's typedef
3478 name. See the extensive comment in ../c-decl.c (pushdecl). */
3479 if (TREE_CODE (x
) == TYPE_DECL
)
3481 tree type
= TREE_TYPE (x
);
3482 if (DECL_SOURCE_LINE (x
) == 0)
3484 if (TYPE_NAME (type
) == 0)
3485 TYPE_NAME (type
) = x
;
3487 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3488 /* We don't want to copy the type when all we're
3489 doing is making a TYPE_DECL for the purposes of
3491 && (!TYPE_NAME (type
)
3492 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3494 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3496 DECL_ORIGINAL_TYPE (x
) = type
;
3497 type
= build_type_copy (type
);
3498 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3499 TYPE_NAME (type
) = x
;
3500 TREE_TYPE (x
) = type
;
3505 if (type
!= error_mark_node
3507 && TYPE_IDENTIFIER (type
))
3508 set_identifier_type_value_with_scope (DECL_NAME (x
), type
, b
);
3511 /* Multiple external decls of the same identifier ought to match.
3513 We get warnings about inline functions where they are defined.
3514 We get warnings about other functions from push_overloaded_decl.
3516 Avoid duplicate warnings where they are used. */
3517 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3521 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3522 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3523 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3524 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3529 /* If different sort of thing, we already gave an error. */
3530 && TREE_CODE (decl
) == TREE_CODE (x
)
3531 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3533 cp_pedwarn ("type mismatch with previous external decl", x
);
3534 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3538 /* This name is new in its binding level.
3539 Install the new declaration and return it. */
3540 if (namespace_bindings_p ())
3542 /* Install a global value. */
3544 /* If the first global decl has external linkage,
3545 warn if we later see static one. */
3546 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3547 TREE_PUBLIC (name
) = 1;
3549 /* Don't install an artificial TYPE_DECL if we already have
3550 another _DECL with that name. */
3551 if (TREE_CODE (x
) != TYPE_DECL
3553 || ! DECL_ARTIFICIAL (x
))
3555 if (TREE_CODE (x
) == FUNCTION_DECL
)
3557 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3558 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3559 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3562 /* Don't forget if the function was used via an implicit decl. */
3563 if (IDENTIFIER_IMPLICIT_DECL (name
)
3564 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3567 /* Don't forget if its address was taken in that way. */
3568 if (IDENTIFIER_IMPLICIT_DECL (name
)
3569 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3570 TREE_ADDRESSABLE (x
) = 1;
3572 /* Warn about mismatches against previous implicit decl. */
3573 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3574 /* If this real decl matches the implicit, don't complain. */
3575 && ! (TREE_CODE (x
) == FUNCTION_DECL
3576 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3578 ("`%D' was previously implicitly declared to return `int'", x
);
3580 /* If new decl is `static' and an `extern' was seen previously,
3582 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3583 warn_extern_redeclared_static (x
, t
);
3587 /* Here to install a non-global value. */
3588 tree oldlocal
= IDENTIFIER_LOCAL_VALUE (name
);
3589 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3591 /* Don't install an artificial TYPE_DECL if we already have
3592 another _DECL with that name. */
3593 if (TREE_CODE (x
) != TYPE_DECL
3595 || ! DECL_ARTIFICIAL (x
))
3596 set_identifier_local_value_with_scope (name
, x
, b
);
3598 /* If this is a TYPE_DECL, push it into the type value slot. */
3599 if (TREE_CODE (x
) == TYPE_DECL
)
3600 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
), b
);
3602 /* Clear out any TYPE_DECL shadowed by a namespace so that
3603 we won't think this is a type. The C struct hack doesn't
3604 go through namespaces. */
3605 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3606 set_identifier_type_value_with_scope (name
, NULL_TREE
, b
);
3608 /* If this is an extern function declaration, see if we
3609 have a global definition or declaration for the function. */
3610 if (oldlocal
== NULL_TREE
3611 && DECL_EXTERNAL (x
)
3612 && oldglobal
!= NULL_TREE
3613 && TREE_CODE (x
) == FUNCTION_DECL
3614 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3616 /* We have one. Their types must agree. */
3617 if (decls_match (x
, oldglobal
))
3621 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3622 cp_warning_at ("global declaration `%#D'", oldglobal
);
3625 /* If we have a local external declaration,
3626 and no file-scope declaration has yet been seen,
3627 then if we later have a file-scope decl it must not be static. */
3628 if (oldlocal
== NULL_TREE
3629 && oldglobal
== NULL_TREE
3630 && DECL_EXTERNAL (x
)
3633 TREE_PUBLIC (name
) = 1;
3636 if (DECL_FROM_INLINE (x
))
3637 /* Inline decls shadow nothing. */;
3639 /* Warn if shadowing an argument at the top level of the body. */
3640 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3641 && TREE_CODE (oldlocal
) == PARM_DECL
3642 && TREE_CODE (x
) != PARM_DECL
)
3644 /* Go to where the parms should be and see if we
3646 struct binding_level
*b
= current_binding_level
->level_chain
;
3652 if (b
->parm_flag
== 1)
3653 cp_error ("declaration of `%#D' shadows a parameter", name
);
3655 else if (warn_shadow
&& oldlocal
!= NULL_TREE
&& b
->is_for_scope
3656 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3658 warning ("variable `%s' shadows local",
3659 IDENTIFIER_POINTER (name
));
3660 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3662 /* Maybe warn if shadowing something else. */
3663 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3664 /* No shadow warnings for internally generated vars. */
3665 && ! DECL_ARTIFICIAL (x
)
3666 /* No shadow warnings for vars made for inlining. */
3667 && ! DECL_FROM_INLINE (x
))
3669 char *warnstring
= NULL
;
3671 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
3672 warnstring
= "declaration of `%s' shadows a parameter";
3673 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
3674 && current_class_ptr
3675 && !TREE_STATIC (name
))
3676 warnstring
= "declaration of `%s' shadows a member of `this'";
3677 else if (oldlocal
!= NULL_TREE
)
3678 warnstring
= "declaration of `%s' shadows previous local";
3679 else if (oldglobal
!= NULL_TREE
)
3680 /* XXX shadow warnings in outer-more namespaces */
3681 warnstring
= "declaration of `%s' shadows global declaration";
3684 warning (warnstring
, IDENTIFIER_POINTER (name
));
3686 /* Check to see if decl redeclares a template parameter. */
3687 if (oldlocal
&& (current_class_type
|| current_function_decl
)
3688 && current_template_parms
)
3690 if (decl_template_parm_p (oldlocal
))
3692 cp_error ("re-using name of template parameter `%T' in this scope", name
);
3693 cp_error_at (" previously declared here `%#D'", oldlocal
);
3698 if (TREE_CODE (x
) == FUNCTION_DECL
)
3699 check_default_args (x
);
3701 /* Keep count of variables in this level with incomplete type. */
3702 if (TREE_CODE (x
) == VAR_DECL
3703 && TREE_TYPE (x
) != error_mark_node
3704 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
3705 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
3706 /* RTTI TD entries are created while defining the type_info. */
3707 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
3708 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
3709 b
->incomplete
= tree_cons (NULL_TREE
, x
, b
->incomplete
);
3712 /* Put decls on list in reverse order.
3713 We will reverse them later if necessary. */
3714 TREE_CHAIN (x
) = b
->names
;
3716 if (! (b
!= global_binding_level
|| TREE_PERMANENT (x
)))
3717 my_friendly_abort (124);
3722 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
3723 caller to set DECL_CONTEXT properly. */
3726 pushdecl_with_scope (x
, level
)
3728 struct binding_level
*level
;
3730 register struct binding_level
*b
;
3731 tree function_decl
= current_function_decl
;
3733 current_function_decl
= NULL_TREE
;
3734 if (level
->parm_flag
== 2)
3736 b
= class_binding_level
;
3737 class_binding_level
= level
;
3738 pushdecl_class_level (x
);
3739 class_binding_level
= b
;
3743 b
= current_binding_level
;
3744 current_binding_level
= level
;
3746 current_binding_level
= b
;
3748 current_function_decl
= function_decl
;
3752 /* Like pushdecl, only it places X in the current namespace,
3756 pushdecl_namespace_level (x
)
3759 register struct binding_level
*b
= inner_binding_level
;
3762 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
3764 /* Now, the type_shadowed stack may screw us. Munge it so it does
3766 if (TREE_CODE (x
) == TYPE_DECL
)
3768 tree name
= DECL_NAME (x
);
3770 tree
*ptr
= (tree
*)0;
3771 for (; b
!= global_binding_level
; b
= b
->level_chain
)
3773 tree shadowed
= b
->type_shadowed
;
3774 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
3775 if (TREE_PURPOSE (shadowed
) == name
)
3777 ptr
= &TREE_VALUE (shadowed
);
3778 /* Can't break out of the loop here because sometimes
3779 a binding level will have duplicate bindings for
3780 PT names. It's gross, but I haven't time to fix it. */
3783 newval
= TREE_TYPE (x
);
3784 if (ptr
== (tree
*)0)
3786 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3787 up here if this is changed to an assertion. --KR */
3788 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
3798 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
3802 pushdecl_top_level (x
)
3805 tree cur_namespace
= current_namespace
;
3806 current_namespace
= global_namespace
;
3807 x
= pushdecl_namespace_level (x
);
3808 current_namespace
= cur_namespace
;
3812 /* Make the declaration of X appear in CLASS scope. */
3815 pushdecl_class_level (x
)
3818 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
3819 scope looks for the pre-mangled name. */
3820 register tree name
= DECL_NAME (x
);
3824 if (TYPE_BEING_DEFINED (current_class_type
))
3826 /* A name N used in a class S shall refer to the same declaration
3827 in its context and when re-evaluated in the completed scope of S.
3828 Types, enums, and static vars are checked here; other
3829 members are checked in finish_struct. */
3830 tree icv
= IDENTIFIER_CLASS_VALUE (name
);
3831 tree ilv
= IDENTIFIER_LOCAL_VALUE (name
);
3834 && flag_optional_diags
3835 /* Don't complain about inherited names. */
3836 && id_in_current_class (name
)
3837 /* Or shadowed tags. */
3838 && !(DECL_DECLARES_TYPE_P (icv
)
3839 && DECL_CONTEXT (icv
) == current_class_type
))
3841 cp_pedwarn ("declaration of identifier `%D' as `%#D'", name
, x
);
3842 cp_pedwarn_at ("conflicts with previous use in class as `%#D'",
3846 /* Check to see if decl redeclares a template parameter. */
3847 if (ilv
&& ! decls_match (ilv
, x
)
3848 && (current_class_type
|| current_function_decl
)
3849 && current_template_parms
)
3851 if (decl_template_parm_p (ilv
))
3853 cp_error ("re-using name of template parameter `%T' in this scope", name
);
3854 cp_error_at (" previously declared here `%#D'", ilv
);
3859 push_class_level_binding (name
, x
);
3860 if (TREE_CODE (x
) == TYPE_DECL
)
3862 set_identifier_type_value (name
, TREE_TYPE (x
));
3868 /* This function is used to push the mangled decls for nested types into
3869 the appropriate scope. Previously pushdecl_top_level was used, but that
3870 is incorrect for members of local classes. */
3873 pushdecl_nonclass_level (x
)
3876 struct binding_level
*b
= current_binding_level
;
3878 my_friendly_assert (b
->parm_flag
!= 2, 180);
3881 /* Get out of template binding levels */
3882 while (b
->pseudo_global
)
3886 pushdecl_with_scope (x
, b
);
3890 /* Make the declaration(s) of X appear in CLASS scope
3891 under the name NAME. */
3894 push_class_level_binding (name
, x
)
3898 /* The class_binding_level will be NULL if x is a template
3899 parameter name in a member template. */
3900 if (!class_binding_level
)
3903 if (TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3904 && purpose_member (name
, class_binding_level
->class_shadowed
))
3907 maybe_push_cache_obstack ();
3908 class_binding_level
->class_shadowed
3909 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
3910 class_binding_level
->class_shadowed
);
3912 IDENTIFIER_CLASS_VALUE (name
) = x
;
3913 obstack_ptr_grow (&decl_obstack
, x
);
3916 /* Insert another USING_DECL into the current binding level,
3917 returning this declaration. If this is a redeclaration,
3918 do nothing and return NULL_TREE. */
3921 push_using_decl (scope
, name
)
3927 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
3928 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
3929 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
3930 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
3934 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
3935 DECL_INITIAL (decl
) = scope
;
3936 TREE_CHAIN (decl
) = current_binding_level
->usings
;
3937 current_binding_level
->usings
= decl
;
3941 /* Add namespace to using_directives. Return NULL_TREE if nothing was
3942 changed (i.e. there was already a directive), or the fresh
3943 TREE_LIST otherwise. */
3946 push_using_directive (used
)
3949 tree ud
= current_binding_level
->using_directives
;
3950 tree iter
, ancestor
;
3952 /* Check if we already have this. */
3953 if (purpose_member (used
, ud
) != NULL_TREE
)
3956 /* Recursively add all namespaces used. */
3957 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
3958 push_using_directive (TREE_PURPOSE (iter
));
3960 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
3961 ud
= current_binding_level
->using_directives
;
3962 ud
= perm_tree_cons (used
, ancestor
, ud
);
3963 current_binding_level
->using_directives
= ud
;
3967 /* DECL is a FUNCTION_DECL which may have other definitions already in
3968 place. We get around this by making the value of the identifier point
3969 to a list of all the things that want to be referenced by that name. It
3970 is then up to the users of that name to decide what to do with that
3973 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
3974 slot. It is dealt with the same way.
3976 The value returned may be a previous declaration if we guessed wrong
3977 about what language DECL should belong to (C or C++). Otherwise,
3978 it's always DECL (and never something that's not a _DECL). */
3981 push_overloaded_decl (decl
, forgettable
)
3985 tree orig_name
= DECL_NAME (decl
);
3987 int doing_global
= (namespace_bindings_p () || ! forgettable
);
3991 old
= namespace_binding (orig_name
, DECL_CONTEXT (decl
));
3992 if (old
&& TREE_CODE (old
) == FUNCTION_DECL
3993 && DECL_ARTIFICIAL (old
)
3994 && (DECL_BUILT_IN (old
) || DECL_BUILT_IN_NONANSI (old
)))
3996 if (duplicate_decls (decl
, old
))
4003 old
= IDENTIFIER_LOCAL_VALUE (orig_name
);
4005 if (! purpose_member (orig_name
, current_binding_level
->shadowed
))
4007 current_binding_level
->shadowed
4008 = tree_cons (orig_name
, old
, current_binding_level
->shadowed
);
4015 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4017 tree t
= TREE_TYPE (old
);
4018 if (IS_AGGR_TYPE (t
) && warn_shadow
4019 && (! DECL_IN_SYSTEM_HEADER (decl
)
4020 || ! DECL_IN_SYSTEM_HEADER (old
)))
4021 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4024 else if (is_overloaded_fn (old
))
4028 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4029 if (decl
== OVL_CURRENT (tmp
)
4030 || duplicate_decls (decl
, OVL_CURRENT (tmp
)))
4031 return OVL_CURRENT (tmp
);
4035 cp_error_at ("previous non-function declaration `%#D'", old
);
4036 cp_error ("conflicts with function declaration `%#D'", decl
);
4041 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4043 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4044 old
= ovl_cons (old
, NULL_TREE
);
4045 old
= ovl_cons (decl
, old
);
4048 /* orig_name is not ambiguous. */
4052 set_namespace_binding (orig_name
, current_namespace
, old
);
4054 IDENTIFIER_LOCAL_VALUE (orig_name
) = old
;
4059 /* Generate an implicit declaration for identifier FUNCTIONID
4060 as a function of type int (). Print a warning if appropriate. */
4063 implicitly_declare (functionid
)
4067 int temp
= allocation_temporary_p ();
4069 push_obstacks_nochange ();
4071 /* Save the decl permanently so we can warn if definition follows.
4072 In ANSI C, warn_implicit is usually false, so the saves little space.
4073 But in C++, it's usually true, hence the extra code. */
4074 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4075 end_temporary_allocation ();
4077 /* We used to reuse an old implicit decl here,
4078 but this loses with inline functions because it can clobber
4079 the saved decl chains. */
4080 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4082 DECL_EXTERNAL (decl
) = 1;
4083 TREE_PUBLIC (decl
) = 1;
4085 /* ANSI standard says implicit declarations are in the innermost block.
4086 So we record the decl in the standard fashion. */
4088 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4091 /* Only one warning per identifier. */
4092 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4094 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4097 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4104 /* Return zero if the declaration NEWDECL is valid
4105 when the declaration OLDDECL (assumed to be for the same name)
4106 has already been seen.
4107 Otherwise return an error message format string with a %s
4108 where the identifier should go. */
4111 redeclaration_error_message (newdecl
, olddecl
)
4112 tree newdecl
, olddecl
;
4114 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4116 /* Because C++ can put things into name space for free,
4117 constructs like "typedef struct foo { ... } foo"
4118 would look like an erroneous redeclaration. */
4119 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4122 return "redefinition of `%#D'";
4124 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4126 /* If this is a pure function, its olddecl will actually be
4127 the original initialization to `0' (which we force to call
4128 abort()). Don't complain about redefinition in this case. */
4129 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4132 /* If both functions come from different namespaces, this is not
4133 a redeclaration - this is a conflict with a used function. */
4134 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4135 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4136 return "`%D' conflicts with used function";
4138 /* We'll complain about linkage mismatches in
4139 warn_extern_redeclared_static. */
4141 /* Defining the same name twice is no good. */
4142 if (DECL_INITIAL (olddecl
) != NULL_TREE
4143 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4145 if (DECL_NAME (olddecl
) == NULL_TREE
)
4146 return "`%#D' not declared in class";
4148 return "redefinition of `%#D'";
4152 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4154 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4155 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4156 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4157 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4158 && TYPE_SIZE (TREE_TYPE (newdecl
))
4159 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4160 return "redefinition of `%#D'";
4163 else if (toplevel_bindings_p ())
4165 /* Objects declared at top level: */
4166 /* If at least one is a reference, it's ok. */
4167 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4169 /* Reject two definitions. */
4170 return "redefinition of `%#D'";
4174 /* Objects declared with block scope: */
4175 /* Reject two definitions, and reject a definition
4176 together with an external reference. */
4177 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4178 return "redeclaration of `%#D'";
4183 /* Get the LABEL_DECL corresponding to identifier ID as a label.
4184 Create one if none exists so far for the current function.
4185 This function is called for both label definitions and label references. */
4191 register tree decl
= IDENTIFIER_LABEL_VALUE (id
);
4193 if (current_function_decl
== NULL_TREE
)
4195 error ("label `%s' referenced outside of any function",
4196 IDENTIFIER_POINTER (id
));
4200 if ((decl
== NULL_TREE
4201 || DECL_SOURCE_LINE (decl
) == 0)
4202 && (named_label_uses
== NULL
4203 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4204 || named_label_uses
->label_decl
!= decl
))
4206 struct named_label_list
*new_ent
;
4208 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4209 new_ent
->label_decl
= decl
;
4210 new_ent
->names_in_scope
= current_binding_level
->names
;
4211 new_ent
->binding_level
= current_binding_level
;
4212 new_ent
->lineno_o_goto
= lineno
;
4213 new_ent
->filename_o_goto
= input_filename
;
4214 new_ent
->next
= named_label_uses
;
4215 named_label_uses
= new_ent
;
4218 /* Use a label already defined or ref'd with this name. */
4219 if (decl
!= NULL_TREE
)
4221 /* But not if it is inherited and wasn't declared to be inheritable. */
4222 if (DECL_CONTEXT (decl
) != current_function_decl
4223 && ! C_DECLARED_LABEL_FLAG (decl
))
4224 return shadow_label (id
);
4228 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4230 /* Make sure every label has an rtx. */
4233 /* A label not explicitly declared must be local to where it's ref'd. */
4234 DECL_CONTEXT (decl
) = current_function_decl
;
4236 DECL_MODE (decl
) = VOIDmode
;
4238 /* Say where one reference is to the label,
4239 for the sake of the error if it is not defined. */
4240 DECL_SOURCE_LINE (decl
) = lineno
;
4241 DECL_SOURCE_FILE (decl
) = input_filename
;
4243 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4245 named_labels
= tree_cons (NULL_TREE
, decl
, named_labels
);
4246 named_label_uses
->label_decl
= decl
;
4251 /* Make a label named NAME in the current function,
4252 shadowing silently any that may be inherited from containing functions
4253 or containing scopes.
4255 Note that valid use, if the label being shadowed
4256 comes from another scope in the same function,
4257 requires calling declare_nonlocal_label right away. */
4263 register tree decl
= IDENTIFIER_LABEL_VALUE (name
);
4265 if (decl
!= NULL_TREE
)
4267 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4268 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4271 return lookup_label (name
);
4274 /* Define a label, specifying the location in the source file.
4275 Return the LABEL_DECL node for the label, if the definition is valid.
4276 Otherwise return 0. */
4279 define_label (filename
, line
, name
)
4286 if (minimal_parse_mode
)
4288 push_obstacks (&permanent_obstack
, &permanent_obstack
);
4289 decl
= build_decl (LABEL_DECL
, name
, void_type_node
);
4291 DECL_SOURCE_LINE (decl
) = line
;
4292 DECL_SOURCE_FILE (decl
) = filename
;
4297 decl
= lookup_label (name
);
4299 /* After labels, make any new cleanups go into their
4300 own new (temporary) binding contour. */
4301 current_binding_level
->more_cleanups_ok
= 0;
4303 /* If label with this name is known from an outer context, shadow it. */
4304 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) != current_function_decl
)
4306 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4307 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4308 decl
= lookup_label (name
);
4311 if (name
== get_identifier ("wchar_t"))
4312 cp_pedwarn ("label named wchar_t");
4314 if (DECL_INITIAL (decl
) != NULL_TREE
)
4316 cp_error ("duplicate label `%D'", decl
);
4321 struct named_label_list
*uses
, *prev
;
4324 /* Mark label as having been defined. */
4325 DECL_INITIAL (decl
) = error_mark_node
;
4326 /* Say where in the source. */
4327 DECL_SOURCE_FILE (decl
) = filename
;
4328 DECL_SOURCE_LINE (decl
) = line
;
4331 uses
= named_label_uses
;
4332 while (uses
!= NULL
)
4333 if (uses
->label_decl
== decl
)
4335 struct binding_level
*b
= current_binding_level
;
4338 tree new_decls
= b
->names
;
4339 tree old_decls
= (b
== uses
->binding_level
)
4340 ? uses
->names_in_scope
: NULL_TREE
;
4341 while (new_decls
!= old_decls
)
4343 if (TREE_CODE (new_decls
) == VAR_DECL
4344 /* Don't complain about crossing initialization
4345 of internal entities. They can't be accessed,
4346 and they should be cleaned up
4347 by the time we get to the label. */
4348 && ! DECL_ARTIFICIAL (new_decls
)
4349 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4350 && pod_type_p (TREE_TYPE (new_decls
))))
4354 cp_error ("jump to label `%D'", decl
);
4355 error_with_file_and_line (uses
->filename_o_goto
,
4356 uses
->lineno_o_goto
,
4360 if (DECL_INITIAL (new_decls
)
4361 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
)))
4362 cp_error_at (" crosses initialization of `%#D'",
4365 cp_error_at (" enters scope of non-POD `%#D'",
4368 new_decls
= TREE_CHAIN (new_decls
);
4370 if (b
== uses
->binding_level
)
4376 prev
->next
= uses
->next
;
4378 named_label_uses
= uses
->next
;
4387 current_function_return_value
= NULL_TREE
;
4394 struct binding_level
*level
;
4395 struct cp_switch
*next
;
4398 static struct cp_switch
*switch_stack
;
4404 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4405 p
->level
= current_binding_level
;
4406 p
->next
= switch_stack
;
4413 switch_stack
= switch_stack
->next
;
4416 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4417 /* XXX Note decl is never actually used. (bpk) */
4420 define_case_label ()
4422 tree cleanup
= last_cleanup_this_contour ();
4423 struct binding_level
*b
= current_binding_level
;
4428 static int explained
= 0;
4429 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4430 warning ("where case label appears here");
4433 warning ("(enclose actions of previous case statements requiring");
4434 warning ("destructors in their own binding contours.)");
4439 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4441 tree new_decls
= b
->names
;
4442 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4444 if (TREE_CODE (new_decls
) == VAR_DECL
4445 /* Don't complain about crossing initialization
4446 of internal entities. They can't be accessed,
4447 and they should be cleaned up
4448 by the time we get to the label. */
4449 && ! DECL_ARTIFICIAL (new_decls
)
4450 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4451 && DECL_INITIAL (new_decls
) != error_mark_node
)
4452 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4455 error ("jump to case label");
4457 cp_error_at (" crosses initialization of `%#D'",
4463 /* After labels, make any new cleanups go into their
4464 own new (temporary) binding contour. */
4466 current_binding_level
->more_cleanups_ok
= 0;
4467 current_function_return_value
= NULL_TREE
;
4470 /* Return the list of declarations of the current level.
4471 Note that this list is in reverse order unless/until
4472 you nreverse it; and when you do nreverse it, you must
4473 store the result back using `storedecls' or you will lose. */
4478 return current_binding_level
->names
;
4481 /* Return the list of type-tags (for structs, etc) of the current level. */
4486 return current_binding_level
->tags
;
4489 /* Store the list of declarations of the current level.
4490 This is done for the parameter declarations of a function being defined,
4491 after they are modified in the light of any missing parameters. */
4497 current_binding_level
->names
= decls
;
4500 /* Similarly, store the list of tags of the current level. */
4506 current_binding_level
->tags
= tags
;
4509 /* Given NAME, an IDENTIFIER_NODE,
4510 return the structure (or union or enum) definition for that name.
4511 Searches binding levels from BINDING_LEVEL up to the global level.
4512 If THISLEVEL_ONLY is nonzero, searches only the specified context
4513 (but skips any tag-transparent contexts to find one that is
4514 meaningful for tags).
4515 FORM says which kind of type the caller wants;
4516 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4517 If the wrong kind of type is found, and it's not a template, an error is
4521 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4522 enum tree_code form
;
4524 struct binding_level
*binding_level
;
4527 register struct binding_level
*level
;
4528 /* Non-zero if, we should look past a pseudo-global level, even if
4530 int allow_pseudo_global
= 1;
4532 for (level
= binding_level
; level
; level
= level
->level_chain
)
4535 if (ANON_AGGRNAME_P (name
))
4536 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4538 /* There's no need for error checking here, because
4539 anon names are unique throughout the compilation. */
4540 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4541 return TREE_VALUE (tail
);
4543 else if (level
->namespace_p
)
4544 /* Do namespace lookup. */
4545 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4547 tree old
= binding_for_name (name
, tail
);
4549 /* If we just skipped past a pseudo global level, even
4550 though THISLEVEL_ONLY, and we find a template class
4551 declaration, then we use the _TYPE node for the
4552 template. See the example below. */
4553 if (thislevel_only
&& !allow_pseudo_global
4554 && old
&& BINDING_VALUE (old
)
4555 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
4556 old
= TREE_TYPE (BINDING_VALUE (old
));
4558 old
= BINDING_TYPE (old
);
4560 /* If it has an original type, it is a typedef, and we
4561 should not return it. */
4562 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
4564 if (old
&& TREE_CODE (old
) != form
4565 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
4567 cp_error ("`%#D' redeclared as %C", old
, form
);
4572 if (thislevel_only
|| tail
== global_namespace
)
4576 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4578 if (TREE_PURPOSE (tail
) == name
)
4580 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
4581 /* Should tighten this up; it'll probably permit
4582 UNION_TYPE and a struct template, for example. */
4584 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
4586 /* Definition isn't the kind we were looking for. */
4587 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
4591 return TREE_VALUE (tail
);
4594 if (thislevel_only
&& ! level
->tag_transparent
)
4596 if (level
->pseudo_global
&& allow_pseudo_global
)
4598 /* We must deal with cases like this:
4600 template <class T> struct S;
4601 template <class T> struct S {};
4603 When looking up `S', for the second declaration, we
4604 would like to find the first declaration. But, we
4605 are in the pseudo-global level created for the
4606 template parameters, rather than the (surrounding)
4607 namespace level. Thus, we keep going one more level,
4608 even though THISLEVEL_ONLY is non-zero. */
4609 allow_pseudo_global
= 0;
4615 if (current_class_type
&& level
->level_chain
->namespace_p
)
4617 /* Try looking in this class's tags before heading into
4618 global binding level. */
4619 tree context
= current_class_type
;
4622 switch (TREE_CODE_CLASS (TREE_CODE (context
)))
4626 these_tags
= CLASSTYPE_TAGS (context
);
4627 if (ANON_AGGRNAME_P (name
))
4630 if (TYPE_IDENTIFIER (TREE_VALUE (these_tags
))
4632 return TREE_VALUE (tail
);
4633 these_tags
= TREE_CHAIN (these_tags
);
4638 if (TREE_PURPOSE (these_tags
) == name
)
4640 if (TREE_CODE (TREE_VALUE (these_tags
)) != form
)
4642 cp_error ("`%#D' redeclared as %C in class scope",
4643 TREE_VALUE (tail
), form
);
4646 return TREE_VALUE (tail
);
4648 these_tags
= TREE_CHAIN (these_tags
);
4650 /* If this type is not yet complete, then don't
4651 look at its context. */
4652 if (TYPE_SIZE (context
) == NULL_TREE
)
4654 /* Go to next enclosing type, if any. */
4655 context
= DECL_CONTEXT (TYPE_MAIN_DECL (context
));
4658 context
= DECL_CONTEXT (context
);
4661 my_friendly_abort (10);
4674 set_current_level_tags_transparency (tags_transparent
)
4675 int tags_transparent
;
4677 current_binding_level
->tag_transparent
= tags_transparent
;
4681 /* Given a type, find the tag that was defined for it and return the tag name.
4682 Otherwise return 0. However, the value can never be 0
4683 in the cases in which this is used.
4685 C++: If NAME is non-zero, this is the new name to install. This is
4686 done when replacing anonymous tags with real tag names. */
4689 lookup_tag_reverse (type
, name
)
4693 register struct binding_level
*level
;
4695 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
4698 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4700 if (TREE_VALUE (tail
) == type
)
4703 TREE_PURPOSE (tail
) = name
;
4704 return TREE_PURPOSE (tail
);
4711 /* Lookup TYPE in CONTEXT (a chain of nested types or a FUNCTION_DECL).
4712 Return the type value, or NULL_TREE if not found. */
4715 lookup_nested_type (type
, context
)
4719 if (context
== NULL_TREE
)
4723 switch (TREE_CODE (context
))
4727 tree ctype
= TREE_TYPE (context
);
4728 tree match
= value_member (type
, CLASSTYPE_TAGS (ctype
));
4730 return TREE_VALUE (match
);
4731 context
= DECL_CONTEXT (context
);
4733 /* When we have a nested class whose member functions have
4734 local types (e.g., a set of enums), we'll arrive here
4735 with the DECL_CONTEXT as the actual RECORD_TYPE node for
4736 the enclosing class. Instead, we want to make sure we
4737 come back in here with the TYPE_DECL, not the RECORD_TYPE. */
4738 if (context
&& TREE_CODE (context
) == RECORD_TYPE
)
4739 context
= TREE_CHAIN (context
);
4743 if (TYPE_NAME (type
) && TYPE_IDENTIFIER (type
))
4744 return lookup_name (TYPE_IDENTIFIER (type
), 1);
4747 my_friendly_abort (12);
4753 /* Look up NAME in the NAMESPACE. */
4756 lookup_namespace_name (namespace, name
)
4757 tree
namespace, name
;
4759 struct tree_binding _b
;
4762 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
4764 /* This happens for A::B<int> when B is a namespace. */
4765 if (TREE_CODE (name
) == NAMESPACE_DECL
)
4768 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
4770 val
= binding_init (&_b
);
4771 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
4772 return error_mark_node
;
4774 if (BINDING_VALUE (val
))
4776 val
= BINDING_VALUE (val
);
4778 /* If we have a single function from a using decl, pull it out. */
4779 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
4780 val
= OVL_FUNCTION (val
);
4784 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
4785 return error_mark_node
;
4788 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
4790 static unsigned long
4798 hash
= (((unsigned long) TYPE_CONTEXT (t
))
4799 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
4804 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
4807 typename_compare (k1
, k2
)
4818 d1
= TYPE_NAME (t1
);
4819 d2
= TYPE_NAME (t2
);
4821 return (DECL_NAME (d1
) == DECL_NAME (d2
)
4822 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
4823 && ((TREE_TYPE (t1
) != NULL_TREE
)
4824 == (TREE_TYPE (t2
) != NULL_TREE
))
4825 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
4826 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
4829 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
4830 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
4831 is non-NULL, this type is being created by the implicit typename
4832 extension, and BASE_TYPE is a type named `t' in some base class of
4833 `T' which depends on template parameters.
4835 Returns the new TYPENAME_TYPE. */
4838 build_typename_type (context
, name
, fullname
, base_type
)
4846 struct hash_entry
* e
;
4848 static struct hash_table ht
;
4850 push_obstacks (&permanent_obstack
, &permanent_obstack
);
4853 && !hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
4855 fatal ("virtual memory exhausted");
4857 /* Build the TYPENAME_TYPE. */
4858 t
= make_lang_type (TYPENAME_TYPE
);
4859 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4860 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
4861 TREE_TYPE (t
) = base_type
;
4863 /* Build the corresponding TYPE_DECL. */
4864 d
= build_decl (TYPE_DECL
, name
, t
);
4865 TYPE_NAME (TREE_TYPE (d
)) = d
;
4866 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
4867 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
4869 /* See if we already have this type. */
4870 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
4873 /* This will free not only TREE_TYPE, but the lang-specific data
4874 and the TYPE_DECL as well. */
4875 obstack_free (&permanent_obstack
, t
);
4879 /* Insert the type into the table. */
4880 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
4888 make_typename_type (context
, name
)
4894 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
4895 name
= TYPE_IDENTIFIER (name
);
4896 else if (TREE_CODE (name
) == TYPE_DECL
)
4897 name
= DECL_NAME (name
);
4901 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
4903 name
= TREE_OPERAND (name
, 0);
4904 if (TREE_CODE (name
) == TEMPLATE_DECL
)
4905 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
4907 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
4908 my_friendly_abort (2000);
4910 if (TREE_CODE (context
) == NAMESPACE_DECL
)
4912 /* We can get here from typename_sub0 in the explicit_template_type
4913 expansion. Just fail. */
4914 cp_error ("no class template named `%#T' in `%#T'",
4916 return error_mark_node
;
4919 if (! uses_template_parms (context
)
4920 || currently_open_class (context
))
4922 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
4924 if (IS_AGGR_TYPE (context
))
4925 t
= lookup_field (context
, name
, 0, 0);
4929 if (t
== NULL_TREE
|| TREE_CODE (t
) != TEMPLATE_DECL
4930 || TREE_CODE (DECL_RESULT (t
)) != TYPE_DECL
)
4932 cp_error ("no class template named `%#T' in `%#T'",
4934 return error_mark_node
;
4937 return lookup_template_class (t
, TREE_OPERAND (fullname
, 1),
4939 /*entering_scope=*/0);
4943 if (IS_AGGR_TYPE (context
))
4944 t
= lookup_field (context
, name
, 0, 1);
4950 cp_error ("no type named `%#T' in `%#T'", name
, context
);
4951 return error_mark_node
;
4954 return TREE_TYPE (t
);
4958 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
4961 /* Select the right _DECL from multiple choices. */
4964 select_decl (binding
, flags
)
4969 val
= BINDING_VALUE (binding
);
4970 if (LOOKUP_NAMESPACES_ONLY (flags
))
4972 /* We are not interested in types. */
4973 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
4978 /* If we could have a type and
4979 we have nothing or we need a type and have none. */
4980 if (BINDING_TYPE (binding
)
4981 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
4982 && TREE_CODE (val
) != TYPE_DECL
)))
4983 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
4984 /* Don't return non-types if we really prefer types. */
4985 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
4986 && (!looking_for_template
|| TREE_CODE (val
) != TEMPLATE_DECL
))
4992 /* Unscoped lookup of a global, iterate over namespaces, considering
4993 using namespace statements. */
4996 unqualified_namespace_lookup (name
, flags
)
5000 struct tree_binding _binding
;
5001 tree b
= binding_init (&_binding
);
5002 tree initial
= current_decl_namespace();
5003 tree scope
= initial
;
5005 struct binding_level
*level
;
5006 tree val
= NULL_TREE
;
5010 val
= binding_for_name (name
, scope
);
5012 /* Initialize binding for this context. */
5013 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5014 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5016 /* Add all _DECLs seen through local using-directives. */
5017 for (level
= current_binding_level
;
5018 !level
->namespace_p
;
5019 level
= level
->level_chain
)
5020 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5022 /* Give up because of error. */
5025 /* Add all _DECLs seen through global using-directives. */
5026 /* XXX local and global using lists should work equally. */
5030 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5032 /* Give up because of error. */
5034 if (siter
== scope
) break;
5035 siter
= CP_DECL_CONTEXT (siter
);
5038 val
= select_decl (b
, flags
);
5039 if (scope
== global_namespace
)
5041 scope
= CP_DECL_CONTEXT (scope
);
5046 /* Combine prefer_type and namespaces_only into flags. */
5049 lookup_flags (prefer_type
, namespaces_only
)
5050 int prefer_type
, namespaces_only
;
5052 if (namespaces_only
)
5053 return LOOKUP_PREFER_NAMESPACES
;
5054 if (prefer_type
> 1)
5055 return LOOKUP_PREFER_TYPES
;
5056 if (prefer_type
> 0)
5057 return LOOKUP_PREFER_BOTH
;
5061 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5062 ignore it or not. Subroutine of lookup_name_real. */
5065 qualify_lookup (val
, flags
)
5069 if (val
== NULL_TREE
)
5071 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5073 if ((flags
& LOOKUP_PREFER_TYPES
)
5074 && (TREE_CODE (val
) == TYPE_DECL
5075 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5076 && DECL_CLASS_TEMPLATE_P (val
))))
5078 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5083 /* Look up NAME in the current binding level and its superiors in the
5084 namespace of variables, functions and typedefs. Return a ..._DECL
5085 node of some kind representing its definition if there is only one
5086 such declaration, or return a TREE_LIST with all the overloaded
5087 definitions if there are many, or return 0 if it is undefined.
5089 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5090 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5091 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5092 Otherwise we prefer non-TYPE_DECLs.
5094 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5095 using IDENTIFIER_CLASS_VALUE. */
5098 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5100 int prefer_type
, nonclass
, namespaces_only
;
5104 tree from_obj
= NULL_TREE
;
5105 tree locval
, classval
;
5108 /* Hack: copy flag set by parser, if set. */
5109 if (only_namespace_names
)
5110 namespaces_only
= 1;
5112 if (prefer_type
== -2)
5114 extern int looking_for_typename
;
5115 tree type
= NULL_TREE
;
5118 prefer_type
= looking_for_typename
;
5120 flags
= lookup_flags (prefer_type
, namespaces_only
);
5121 /* During parsing, we need to complain. */
5122 flags
|= LOOKUP_COMPLAIN
;
5123 /* If the next thing is '<', class templates are types. */
5124 if (looking_for_template
)
5125 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5127 /* std:: becomes :: for now. */
5128 if (got_scope
== std_node
)
5129 got_scope
= void_type_node
;
5133 else if (got_object
!= error_mark_node
)
5138 if (type
== error_mark_node
)
5139 return error_mark_node
;
5140 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5141 type
= TREE_TYPE (type
);
5144 type
= complete_type (type
);
5146 if (TREE_CODE (type
) == VOID_TYPE
)
5147 type
= global_namespace
;
5148 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5150 struct tree_binding b
;
5151 val
= binding_init (&b
);
5152 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5154 val
= select_decl (val
, flags
);
5156 else if (! IS_AGGR_TYPE (type
)
5157 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5158 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5159 || TREE_CODE (type
) == TYPENAME_TYPE
)
5160 /* Someone else will give an error about this if needed. */
5162 else if (TYPE_BEING_DEFINED (type
))
5164 val
= IDENTIFIER_CLASS_VALUE (name
);
5165 if (val
&& DECL_CONTEXT (val
) != type
)
5167 struct binding_level
*b
= class_binding_level
;
5168 for (val
= NULL_TREE
; b
; b
= b
->level_chain
)
5170 tree t
= purpose_member (name
, b
->class_shadowed
);
5171 if (t
&& TREE_VALUE (t
)
5172 && DECL_CONTEXT (TREE_VALUE (t
)) == type
)
5174 val
= TREE_VALUE (t
);
5179 if (val
== NULL_TREE
)
5180 val
= lookup_field (type
, name
, 0, 1);
5182 else if (type
== current_class_type
)
5183 val
= IDENTIFIER_CLASS_VALUE (name
);
5185 val
= lookup_member (type
, name
, 0, prefer_type
);
5192 else if (got_object
&& val
)
5196 flags
= lookup_flags (prefer_type
, namespaces_only
);
5198 locval
= classval
= NULL_TREE
;
5200 if (! namespace_bindings_p ())
5201 locval
= qualify_lookup (IDENTIFIER_LOCAL_VALUE (name
), flags
);
5203 /* In C++ class fields are between local and global scope,
5204 just before the global scope. */
5205 if (current_class_type
&& ! nonclass
)
5207 classval
= IDENTIFIER_CLASS_VALUE (name
);
5208 if (classval
== NULL_TREE
&& TYPE_BEING_DEFINED (current_class_type
))
5209 /* Try to find values from base classes if we are presently
5210 defining a type. We are presently only interested in
5212 classval
= lookup_field (current_class_type
, name
, 0, 1);
5214 /* Add implicit 'typename' to types from template bases. lookup_field
5215 will do this for us. If classval is actually from an enclosing
5216 scope, lookup_nested_field will get it for us. */
5217 else if (processing_template_decl
5218 && classval
&& TREE_CODE (classval
) == TYPE_DECL
5219 && ! currently_open_class (DECL_CONTEXT (classval
))
5220 && uses_template_parms (current_class_type
))
5221 classval
= lookup_field (current_class_type
, name
, 0, 1);
5223 /* yylex() calls this with -2, since we should never start digging for
5224 the nested name at the point where we haven't even, for example,
5225 created the COMPONENT_REF or anything like that. */
5226 if (classval
== NULL_TREE
)
5227 classval
= lookup_nested_field (name
, ! yylex
);
5229 classval
= qualify_lookup (classval
, flags
);
5232 if (locval
&& classval
)
5234 /* We have both a local binding and a class-level binding. This
5235 can happen in two ways:
5237 o We are in a member function of a class.
5238 o We are in a local class within a function.
5240 We need to determine which one of these situations is
5241 occuring, and give the innermost binding. One tricky bit is
5242 that with member templates we can be in the first case
5243 without CURRENT_FUNCTION_DECL being set. Consider
5245 struct A { template <class A> void f(A); };
5247 Here, when we look at the `A' in the parameter declaration
5248 for `f' we have a local binding (the template parameter) and
5249 a class-level binding (the TYPE_DECL for the class).
5250 Fortunately, if LOCVAL is a template parameter it is safe to
5251 take it; nothing within the scope of the template parameter
5252 is allowed to have the same name. */
5254 if (decl_template_parm_p (locval
))
5256 else if (current_scope () == current_function_decl
5257 && ! hack_decl_function_context (current_function_decl
))
5258 /* Not in a nested function. */
5262 /* This is incredibly horrible. The whole concept of
5263 IDENTIFIER_LOCAL_VALUE / IDENTIFIER_CLASS_VALUE /
5264 IDENTIFIER_GLOBAL_VALUE needs to be scrapped for local
5266 tree lctx
= hack_decl_function_context (locval
);
5267 tree cctx
= hack_decl_function_context (classval
);
5269 if (lctx
== current_scope ())
5271 else if (lctx
== cctx
)
5274 /* I don't know which is right; let's just guess for now. */
5283 val
= unqualified_namespace_lookup (name
, flags
);
5285 /* Any other name takes precedence over an implicit typename. Warn the
5286 user about this potentially confusing lookup. */
5287 if (classval
&& TREE_CODE (val
) == TYPE_DECL
5288 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
5289 && TREE_TYPE (TREE_TYPE (val
)))
5291 if (locval
== NULL_TREE
)
5292 locval
= unqualified_namespace_lookup (name
, flags
);
5294 if (locval
&& val
!= locval
)
5300 /* Only warn when not lexing; we don't want to warn if they
5301 use this name as a declarator. */
5302 subtype
= TREE_TYPE (TREE_TYPE (classval
));
5304 && ! (TREE_CODE (locval
) == TEMPLATE_DECL
5305 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5306 && CLASSTYPE_TI_TEMPLATE (subtype
) == locval
)
5307 && ! (TREE_CODE (locval
) == TYPE_DECL
5308 && same_type_p (TREE_TYPE (locval
), subtype
)))
5310 cp_warning ("lookup of `%D' finds `%#D'", name
, locval
);
5311 cp_warning (" instead of `%D' from dependent base class",
5313 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5314 constructor_name (current_class_type
), name
);
5322 /* This should only warn about types used in qualified-ids. */
5323 if (from_obj
&& from_obj
!= val
)
5325 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5326 && TREE_CODE (val
) == TYPE_DECL
5327 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5329 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5330 name
, got_object
, TREE_TYPE (from_obj
));
5331 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5335 /* We don't change val to from_obj if got_object depends on
5336 template parms because that breaks implicit typename for
5337 destructor calls. */
5338 if (! uses_template_parms (got_object
))
5342 if ((TREE_CODE (val
) == TEMPLATE_DECL
&& looking_for_template
)
5343 || TREE_CODE (val
) == TYPE_DECL
|| prefer_type
<= 0)
5345 /* Caller wants a class-or-namespace-name. */
5346 else if (prefer_type
== 1 && TREE_CODE (val
) == NAMESPACE_DECL
)
5348 else if (IDENTIFIER_HAS_TYPE_VALUE (name
))
5349 val
= TYPE_MAIN_DECL (IDENTIFIER_TYPE_VALUE (name
));
5350 else if (TREE_TYPE (val
) == error_mark_node
)
5351 val
= error_mark_node
;
5353 /* If we have a single function from a using decl, pull it out. */
5354 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5355 val
= OVL_FUNCTION (val
);
5364 lookup_name_nonclass (name
)
5367 return lookup_name_real (name
, 0, 1, 0);
5371 lookup_function_nonclass (name
, args
)
5375 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5379 lookup_name_namespace_only (name
)
5382 /* type-or-namespace, nonclass, namespace_only */
5383 return lookup_name_real (name
, 1, 1, 1);
5387 lookup_name (name
, prefer_type
)
5391 return lookup_name_real (name
, prefer_type
, 0, 0);
5394 /* Similar to `lookup_name' but look only at current binding level. */
5397 lookup_name_current_level (name
)
5400 register tree t
= NULL_TREE
;
5402 if (current_binding_level
->namespace_p
)
5404 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5406 /* extern "C" function() */
5407 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5410 else if (IDENTIFIER_LOCAL_VALUE (name
) != NULL_TREE
)
5412 struct binding_level
*b
= current_binding_level
;
5415 if (purpose_member (name
, b
->shadowed
))
5416 return IDENTIFIER_LOCAL_VALUE (name
);
5427 /* Like lookup_name_current_level, but for types. */
5430 lookup_type_current_level (name
)
5433 register tree t
= NULL_TREE
;
5435 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5437 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5438 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5440 struct binding_level
*b
= current_binding_level
;
5443 if (purpose_member (name
, b
->type_shadowed
))
5444 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5456 begin_only_namespace_names ()
5458 only_namespace_names
= 1;
5462 end_only_namespace_names ()
5464 only_namespace_names
= 0;
5467 /* Arrange for the user to get a source line number, even when the
5468 compiler is going down in flames, so that she at least has a
5469 chance of working around problems in the compiler. We used to
5470 call error(), but that let the segmentation fault continue
5471 through; now, it's much more passive by asking them to send the
5472 maintainers mail about the problem. */
5476 int sig ATTRIBUTE_UNUSED
;
5478 signal (SIGSEGV
, SIG_DFL
);
5480 signal (SIGIOT
, SIG_DFL
);
5483 signal (SIGILL
, SIG_DFL
);
5486 signal (SIGABRT
, SIG_DFL
);
5489 signal (SIGBUS
, SIG_DFL
);
5491 my_friendly_abort (0);
5495 /* Unused -- brendan 970107 */
5496 /* Array for holding types considered "built-in". These types
5497 are output in the module in which `main' is defined. */
5498 static tree
*builtin_type_tdescs_arr
;
5499 static int builtin_type_tdescs_len
, builtin_type_tdescs_max
;
5502 /* Push the declarations of builtin types into the namespace.
5503 RID_INDEX, if < RID_MAX is the index of the builtin type
5504 in the array RID_POINTERS. NAME is the name used when looking
5505 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5508 record_builtin_type (rid_index
, name
, type
)
5513 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5514 tree tdecl
= NULL_TREE
;
5516 if ((int) rid_index
< (int) RID_MAX
)
5517 rname
= ridpointers
[(int) rid_index
];
5519 tname
= get_identifier (name
);
5521 TYPE_BUILT_IN (type
) = 1;
5525 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5526 set_identifier_type_value (tname
, NULL_TREE
);
5527 if ((int) rid_index
< (int) RID_MAX
)
5528 /* Built-in types live in the global namespace. */
5529 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5531 if (rname
!= NULL_TREE
)
5533 if (tname
!= NULL_TREE
)
5535 set_identifier_type_value (rname
, NULL_TREE
);
5536 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5540 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5541 set_identifier_type_value (rname
, NULL_TREE
);
5546 /* Record one of the standard Java types.
5547 * Declare it as having the given NAME.
5548 * If SIZE > 0, it is the size of one of the integral types;
5549 * otherwise it is the negative of the size of one of the other types. */
5552 record_builtin_java_type (name
, size
)
5558 type
= make_signed_type (size
);
5559 else if (size
> -32)
5560 { /* "__java_char" or ""__java_boolean". */
5561 type
= make_unsigned_type (-size
);
5562 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5565 { /* "__java_float" or ""__java_double". */
5566 type
= make_node (REAL_TYPE
);
5567 TYPE_PRECISION (type
) = - size
;
5570 record_builtin_type (RID_MAX
, name
, type
);
5571 decl
= TYPE_NAME (type
);
5572 DECL_IGNORED_P (decl
) = 1;
5573 TYPE_FOR_JAVA (type
) = 1;
5577 /* Push a type into the namespace so that the back-ends ignore it. */
5580 record_unknown_type (type
, name
)
5584 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5585 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5586 DECL_IGNORED_P (decl
) = 1;
5587 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5588 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5589 TYPE_ALIGN (type
) = 1;
5590 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5593 /* Push overloaded decl, in global scope, with one argument so it
5594 can be used as a callback from define_function. */
5597 push_overloaded_decl_1 (x
)
5600 push_overloaded_decl (x
, 0);
5607 auto_function (name
, type
, code
)
5609 enum built_in_function code
;
5611 return define_function
5612 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
5613 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5617 /* Create the predefined scalar types of C,
5618 and some nodes representing standard constants (0, 1, (void *)0).
5619 Initialize the global binding level.
5620 Make definitions for built-in primitive functions. */
5623 init_decl_processing ()
5625 register tree endlink
, int_endlink
, double_endlink
, unsigned_endlink
;
5627 /* Data type of memcpy. */
5628 tree memcpy_ftype
, strlen_ftype
;
5629 int wchar_type_size
;
5631 tree array_domain_type
;
5632 tree vb_off_identifier
= NULL_TREE
;
5633 /* Function type `char *(char *, char *)' and similar ones */
5634 tree string_ftype_ptr_ptr
, int_ftype_string_string
;
5635 tree sizetype_endlink
;
5636 tree ptr_ftype
, ptr_ftype_unsigned
, ptr_ftype_sizetype
;
5637 tree void_ftype
, void_ftype_int
, void_ftype_ptr
;
5639 /* Have to make these distinct before we try using them. */
5640 lang_name_cplusplus
= get_identifier ("C++");
5641 lang_name_c
= get_identifier ("C");
5642 lang_name_java
= get_identifier ("Java");
5644 /* Enter the global namespace. */
5645 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5646 my_friendly_assert (current_lang_name
== NULL_TREE
, 375);
5647 current_lang_name
= lang_name_cplusplus
;
5648 push_namespace (get_identifier ("::"));
5649 global_namespace
= current_namespace
;
5650 current_lang_name
= NULL_TREE
;
5652 if (flag_strict_prototype
== 2)
5653 flag_strict_prototype
= pedantic
;
5655 strict_prototypes_lang_c
= flag_strict_prototype
;
5658 current_lang_name
= lang_name_c
;
5660 current_function_decl
= NULL_TREE
;
5661 named_labels
= NULL_TREE
;
5662 named_label_uses
= NULL
;
5663 current_binding_level
= NULL_BINDING_LEVEL
;
5664 free_binding_level
= NULL_BINDING_LEVEL
;
5666 /* Because most segmentation signals can be traced back into user
5667 code, catch them and at least give the user a chance of working
5668 around compiler bugs. */
5669 signal (SIGSEGV
, signal_catch
);
5671 /* We will also catch aborts in the back-end through signal_catch and
5672 give the user a chance to see where the error might be, and to defeat
5673 aborts in the back-end when there have been errors previously in their
5676 signal (SIGIOT
, signal_catch
);
5679 signal (SIGILL
, signal_catch
);
5682 signal (SIGABRT
, signal_catch
);
5685 signal (SIGBUS
, signal_catch
);
5688 gcc_obstack_init (&decl_obstack
);
5690 /* Must lay these out before anything else gets laid out. */
5691 error_mark_node
= make_node (ERROR_MARK
);
5692 TREE_PERMANENT (error_mark_node
) = 1;
5693 TREE_TYPE (error_mark_node
) = error_mark_node
;
5694 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
5695 TREE_TYPE (error_mark_list
) = error_mark_node
;
5697 /* Make the binding_level structure for global names. */
5699 global_binding_level
= current_binding_level
;
5700 /* The global level is the namespace level of ::. */
5701 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
5702 declare_namespace_level ();
5704 this_identifier
= get_identifier (THIS_NAME
);
5705 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
5706 ctor_identifier
= get_identifier (CTOR_NAME
);
5707 dtor_identifier
= get_identifier (DTOR_NAME
);
5708 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
5709 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
5710 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
5711 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
5712 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
5713 if (flag_handle_signatures
)
5715 tag_identifier
= get_identifier (SIGTABLE_TAG_NAME
);
5716 vb_off_identifier
= get_identifier (SIGTABLE_VB_OFF_NAME
);
5717 vt_off_identifier
= get_identifier (SIGTABLE_VT_OFF_NAME
);
5720 /* Define `int' and `char' first so that dbx will output them first. */
5722 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5723 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
5725 /* Define `char', which is like either `signed char' or `unsigned char'
5726 but not the same as either. */
5730 ? make_signed_type (CHAR_TYPE_SIZE
)
5731 : make_unsigned_type (CHAR_TYPE_SIZE
));
5732 record_builtin_type (RID_CHAR
, "char", char_type_node
);
5734 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5735 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
5737 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5738 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
5740 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5741 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
5742 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
5744 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5745 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
5747 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5748 record_builtin_type (RID_MAX
, "long long unsigned int",
5749 long_long_unsigned_type_node
);
5750 record_builtin_type (RID_MAX
, "long long unsigned",
5751 long_long_unsigned_type_node
);
5753 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5754 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
5755 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5756 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
5757 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
5759 /* `unsigned long' is the standard type for sizeof.
5760 Note that stddef.h uses `unsigned long',
5761 and this must agree, even if long and int are the same size. */
5763 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
5766 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
5768 /* Define both `signed char' and `unsigned char'. */
5769 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5770 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
5771 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5772 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
5774 /* These are types that type_for_size and type_for_mode use. */
5775 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
5776 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
5777 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
5778 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
5779 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
5780 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
5781 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
5782 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
5783 #if HOST_BITS_PER_WIDE_INT >= 64
5784 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
5785 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intTI_type_node
));
5787 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
5788 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
5789 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
5790 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
5791 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
5792 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
5793 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
5794 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
5795 #if HOST_BITS_PER_WIDE_INT >= 64
5796 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
5797 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intTI_type_node
));
5800 float_type_node
= make_node (REAL_TYPE
);
5801 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5802 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
5803 layout_type (float_type_node
);
5805 double_type_node
= make_node (REAL_TYPE
);
5806 if (flag_short_double
)
5807 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5809 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5810 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
5811 layout_type (double_type_node
);
5813 long_double_type_node
= make_node (REAL_TYPE
);
5814 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5815 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
5816 layout_type (long_double_type_node
);
5818 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5819 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
5820 complex_integer_type_node
));
5821 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5822 layout_type (complex_integer_type_node
);
5824 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5825 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
5826 complex_float_type_node
));
5827 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5828 layout_type (complex_float_type_node
);
5830 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5831 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
5832 complex_double_type_node
));
5833 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5834 layout_type (complex_double_type_node
);
5836 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5837 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
5838 complex_long_double_type_node
));
5839 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5840 layout_type (complex_long_double_type_node
);
5842 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
5843 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
5844 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
5845 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
5846 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
5847 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
5848 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
5849 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
5851 integer_zero_node
= build_int_2 (0, 0);
5852 TREE_TYPE (integer_zero_node
) = integer_type_node
;
5853 integer_one_node
= build_int_2 (1, 0);
5854 TREE_TYPE (integer_one_node
) = integer_type_node
;
5855 integer_two_node
= build_int_2 (2, 0);
5856 TREE_TYPE (integer_two_node
) = integer_type_node
;
5857 integer_three_node
= build_int_2 (3, 0);
5858 TREE_TYPE (integer_three_node
) = integer_type_node
;
5860 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5861 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5862 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
5863 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
5864 TYPE_PRECISION (boolean_type_node
) = 1;
5865 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
5866 boolean_false_node
= build_int_2 (0, 0);
5867 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
5868 boolean_true_node
= build_int_2 (1, 0);
5869 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
5871 /* These are needed by stor-layout.c. */
5872 size_zero_node
= size_int (0);
5873 size_one_node
= size_int (1);
5875 signed_size_zero_node
= build_int_2 (0, 0);
5876 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
5878 void_type_node
= make_node (VOID_TYPE
);
5879 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
5880 layout_type (void_type_node
); /* Uses integer_zero_node. */
5881 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
5882 TREE_PARMLIST (void_list_node
) = 1;
5884 null_pointer_node
= build_int_2 (0, 0);
5885 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
5886 layout_type (TREE_TYPE (null_pointer_node
));
5888 /* Used for expressions that do nothing, but are not errors. */
5889 void_zero_node
= build_int_2 (0, 0);
5890 TREE_TYPE (void_zero_node
) = void_type_node
;
5892 string_type_node
= build_pointer_type (char_type_node
);
5893 const_string_type_node
5894 = build_pointer_type (build_qualified_type (char_type_node
,
5897 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
5900 /* Make a type to be the domain of a few array types
5901 whose domains don't really matter.
5902 200 is small enough that it always fits in size_t
5903 and large enough that it can hold most function names for the
5904 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5905 array_domain_type
= build_index_type (build_int_2 (200, 0));
5907 /* Make a type for arrays of characters.
5908 With luck nothing will ever really depend on the length of this
5910 char_array_type_node
5911 = build_array_type (char_type_node
, array_domain_type
);
5912 /* Likewise for arrays of ints. */
5914 = build_array_type (integer_type_node
, array_domain_type
);
5916 /* This is just some anonymous class type. Nobody should ever
5917 need to look inside this envelope. */
5918 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
5920 default_function_type
5921 = build_function_type (integer_type_node
, NULL_TREE
);
5923 ptr_type_node
= build_pointer_type (void_type_node
);
5925 = build_pointer_type (build_qualified_type (void_type_node
,
5928 record_builtin_type (RID_MAX
, NULL_PTR
, ptr_type_node
);
5930 endlink
= void_list_node
;
5931 int_endlink
= tree_cons (NULL_TREE
, integer_type_node
, endlink
);
5932 double_endlink
= tree_cons (NULL_TREE
, double_type_node
, endlink
);
5933 unsigned_endlink
= tree_cons (NULL_TREE
, unsigned_type_node
, endlink
);
5935 ptr_ftype
= build_function_type (ptr_type_node
, NULL_TREE
);
5936 ptr_ftype_unsigned
= build_function_type (ptr_type_node
, unsigned_endlink
);
5937 sizetype_endlink
= tree_cons (NULL_TREE
, sizetype
, endlink
);
5938 /* We realloc here because sizetype could be int or unsigned. S'ok. */
5939 ptr_ftype_sizetype
= build_function_type (ptr_type_node
, sizetype_endlink
);
5941 void_ftype
= build_function_type (void_type_node
, endlink
);
5942 void_ftype_int
= build_function_type (void_type_node
, int_endlink
);
5944 = build_function_type (void_type_node
,
5945 tree_cons (NULL_TREE
, ptr_type_node
, endlink
));
5947 = build_exception_variant (void_ftype_ptr
,
5948 tree_cons (NULL_TREE
, NULL_TREE
, NULL_TREE
));
5951 = build_function_type (float_type_node
,
5952 tree_cons (NULL_TREE
, float_type_node
, endlink
));
5955 = build_function_type (double_type_node
, double_endlink
);
5957 ldouble_ftype_ldouble
5958 = build_function_type (long_double_type_node
,
5959 tree_cons (NULL_TREE
, long_double_type_node
,
5962 double_ftype_double_double
5963 = build_function_type (double_type_node
,
5964 tree_cons (NULL_TREE
, double_type_node
,
5968 = build_function_type (integer_type_node
, int_endlink
);
5971 = build_function_type (long_integer_type_node
,
5972 tree_cons (NULL_TREE
, long_integer_type_node
,
5975 int_ftype_cptr_cptr_sizet
5976 = build_function_type (integer_type_node
,
5977 tree_cons (NULL_TREE
, const_ptr_type_node
,
5978 tree_cons (NULL_TREE
, const_ptr_type_node
,
5979 tree_cons (NULL_TREE
,
5983 string_ftype_ptr_ptr
/* strcpy prototype */
5984 = build_function_type (string_type_node
,
5985 tree_cons (NULL_TREE
, string_type_node
,
5986 tree_cons (NULL_TREE
,
5987 const_string_type_node
,
5990 int_ftype_string_string
/* strcmp prototype */
5991 = build_function_type (integer_type_node
,
5992 tree_cons (NULL_TREE
, const_string_type_node
,
5993 tree_cons (NULL_TREE
,
5994 const_string_type_node
,
5997 strlen_ftype
/* strlen prototype */
5998 = build_function_type (sizetype
,
5999 tree_cons (NULL_TREE
, const_string_type_node
,
6002 memcpy_ftype
/* memcpy prototype */
6003 = build_function_type (ptr_type_node
,
6004 tree_cons (NULL_TREE
, ptr_type_node
,
6005 tree_cons (NULL_TREE
, const_ptr_type_node
,
6006 sizetype_endlink
)));
6008 if (flag_huge_objects
)
6009 delta_type_node
= long_integer_type_node
;
6011 delta_type_node
= short_integer_type_node
;
6013 builtin_function ("__builtin_constant_p", default_function_type
,
6014 BUILT_IN_CONSTANT_P
, NULL_PTR
);
6016 builtin_return_address_fndecl
6017 = builtin_function ("__builtin_return_address", ptr_ftype_unsigned
,
6018 BUILT_IN_RETURN_ADDRESS
, NULL_PTR
);
6020 builtin_function ("__builtin_frame_address", ptr_ftype_unsigned
,
6021 BUILT_IN_FRAME_ADDRESS
, NULL_PTR
);
6023 builtin_function ("__builtin_alloca", ptr_ftype_sizetype
,
6024 BUILT_IN_ALLOCA
, "alloca");
6025 builtin_function ("__builtin_ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
6026 /* Define alloca, ffs as builtins.
6027 Declare _exit just to mark it as volatile. */
6028 if (! flag_no_builtin
&& !flag_no_nonansi_builtin
)
6030 temp
= builtin_function ("alloca", ptr_ftype_sizetype
,
6031 BUILT_IN_ALLOCA
, NULL_PTR
);
6032 /* Suppress error if redefined as a non-function. */
6033 DECL_BUILT_IN_NONANSI (temp
) = 1;
6034 temp
= builtin_function ("ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
6035 /* Suppress error if redefined as a non-function. */
6036 DECL_BUILT_IN_NONANSI (temp
) = 1;
6037 temp
= builtin_function ("_exit", void_ftype_int
,
6038 NOT_BUILT_IN
, NULL_PTR
);
6039 TREE_THIS_VOLATILE (temp
) = 1;
6040 TREE_SIDE_EFFECTS (temp
) = 1;
6041 /* Suppress error if redefined as a non-function. */
6042 DECL_BUILT_IN_NONANSI (temp
) = 1;
6045 builtin_function ("__builtin_abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
6046 builtin_function ("__builtin_fabsf", float_ftype_float
, BUILT_IN_FABS
,
6048 builtin_function ("__builtin_fabs", double_ftype_double
, BUILT_IN_FABS
,
6050 builtin_function ("__builtin_fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
6052 builtin_function ("__builtin_labs", long_ftype_long
,
6053 BUILT_IN_LABS
, NULL_PTR
);
6054 builtin_function ("__builtin_saveregs", ptr_ftype
,
6055 BUILT_IN_SAVEREGS
, NULL_PTR
);
6056 builtin_function ("__builtin_classify_type", default_function_type
,
6057 BUILT_IN_CLASSIFY_TYPE
, NULL_PTR
);
6058 builtin_function ("__builtin_next_arg", ptr_ftype
,
6059 BUILT_IN_NEXT_ARG
, NULL_PTR
);
6060 builtin_function ("__builtin_args_info", int_ftype_int
,
6061 BUILT_IN_ARGS_INFO
, NULL_PTR
);
6062 builtin_function ("__builtin_setjmp",
6063 build_function_type (integer_type_node
,
6064 tree_cons (NULL_TREE
, ptr_type_node
,
6066 BUILT_IN_SETJMP
, NULL_PTR
);
6067 builtin_function ("__builtin_longjmp",
6068 build_function_type (integer_type_node
,
6069 tree_cons (NULL_TREE
, ptr_type_node
,
6070 tree_cons (NULL_TREE
,
6073 BUILT_IN_LONGJMP
, NULL_PTR
);
6075 /* Untyped call and return. */
6076 builtin_function ("__builtin_apply_args", ptr_ftype
,
6077 BUILT_IN_APPLY_ARGS
, NULL_PTR
);
6079 temp
= tree_cons (NULL_TREE
,
6080 build_pointer_type (build_function_type (void_type_node
,
6082 tree_cons (NULL_TREE
, ptr_ftype_sizetype
, NULL_TREE
));
6083 builtin_function ("__builtin_apply",
6084 build_function_type (ptr_type_node
, temp
),
6085 BUILT_IN_APPLY
, NULL_PTR
);
6086 builtin_function ("__builtin_return", void_ftype_ptr
,
6087 BUILT_IN_RETURN
, NULL_PTR
);
6089 /* Currently under experimentation. */
6090 builtin_function ("__builtin_memcpy", memcpy_ftype
,
6091 BUILT_IN_MEMCPY
, "memcpy");
6092 builtin_function ("__builtin_memcmp", int_ftype_cptr_cptr_sizet
,
6093 BUILT_IN_MEMCMP
, "memcmp");
6094 builtin_function ("__builtin_strcmp", int_ftype_string_string
,
6095 BUILT_IN_STRCMP
, "strcmp");
6096 builtin_function ("__builtin_strcpy", string_ftype_ptr_ptr
,
6097 BUILT_IN_STRCPY
, "strcpy");
6098 builtin_function ("__builtin_strlen", strlen_ftype
,
6099 BUILT_IN_STRLEN
, "strlen");
6100 builtin_function ("__builtin_sqrtf", float_ftype_float
,
6101 BUILT_IN_FSQRT
, "sqrtf");
6102 builtin_function ("__builtin_fsqrt", double_ftype_double
,
6103 BUILT_IN_FSQRT
, NULL_PTR
);
6104 builtin_function ("__builtin_sqrtl", ldouble_ftype_ldouble
,
6105 BUILT_IN_FSQRT
, "sqrtl");
6106 builtin_function ("__builtin_sinf", float_ftype_float
,
6107 BUILT_IN_SIN
, "sinf");
6108 builtin_function ("__builtin_sin", double_ftype_double
,
6109 BUILT_IN_SIN
, "sin");
6110 builtin_function ("__builtin_sinl", ldouble_ftype_ldouble
,
6111 BUILT_IN_SIN
, "sinl");
6112 builtin_function ("__builtin_cosf", float_ftype_float
,
6113 BUILT_IN_COS
, "cosf");
6114 builtin_function ("__builtin_cos", double_ftype_double
,
6115 BUILT_IN_COS
, "cos");
6116 builtin_function ("__builtin_cosl", ldouble_ftype_ldouble
,
6117 BUILT_IN_COS
, "cosl");
6119 if (!flag_no_builtin
)
6121 builtin_function ("abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
6122 builtin_function ("fabs", double_ftype_double
, BUILT_IN_FABS
, NULL_PTR
);
6123 builtin_function ("labs", long_ftype_long
, BUILT_IN_LABS
, NULL_PTR
);
6124 builtin_function ("fabsf", float_ftype_float
, BUILT_IN_FABS
, NULL_PTR
);
6125 builtin_function ("fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
6127 builtin_function ("memcpy", memcpy_ftype
, BUILT_IN_MEMCPY
, NULL_PTR
);
6128 builtin_function ("memcmp", int_ftype_cptr_cptr_sizet
, BUILT_IN_MEMCMP
,
6130 builtin_function ("strcmp", int_ftype_string_string
, BUILT_IN_STRCMP
,
6132 builtin_function ("strcpy", string_ftype_ptr_ptr
, BUILT_IN_STRCPY
,
6134 builtin_function ("strlen", strlen_ftype
, BUILT_IN_STRLEN
, NULL_PTR
);
6135 builtin_function ("sqrtf", float_ftype_float
, BUILT_IN_FSQRT
, NULL_PTR
);
6136 builtin_function ("sqrt", double_ftype_double
, BUILT_IN_FSQRT
, NULL_PTR
);
6137 builtin_function ("sqrtl", ldouble_ftype_ldouble
, BUILT_IN_FSQRT
,
6139 builtin_function ("sinf", float_ftype_float
, BUILT_IN_SIN
, NULL_PTR
);
6140 builtin_function ("sin", double_ftype_double
, BUILT_IN_SIN
, NULL_PTR
);
6141 builtin_function ("sinl", ldouble_ftype_ldouble
, BUILT_IN_SIN
, NULL_PTR
);
6142 builtin_function ("cosf", float_ftype_float
, BUILT_IN_COS
, NULL_PTR
);
6143 builtin_function ("cos", double_ftype_double
, BUILT_IN_COS
, NULL_PTR
);
6144 builtin_function ("cosl", ldouble_ftype_ldouble
, BUILT_IN_COS
, NULL_PTR
);
6146 /* Declare these functions volatile
6147 to avoid spurious "control drops through" warnings. */
6148 temp
= builtin_function ("abort", void_ftype
,
6149 NOT_BUILT_IN
, NULL_PTR
);
6150 TREE_THIS_VOLATILE (temp
) = 1;
6151 TREE_SIDE_EFFECTS (temp
) = 1;
6152 /* Well, these are actually ANSI, but we can't set DECL_BUILT_IN on
6154 DECL_BUILT_IN_NONANSI (temp
) = 1;
6155 temp
= builtin_function ("exit", void_ftype_int
,
6156 NOT_BUILT_IN
, NULL_PTR
);
6157 TREE_THIS_VOLATILE (temp
) = 1;
6158 TREE_SIDE_EFFECTS (temp
) = 1;
6159 DECL_BUILT_IN_NONANSI (temp
) = 1;
6163 /* Support for these has not been written in either expand_builtin
6164 or build_function_call. */
6165 builtin_function ("__builtin_div", default_ftype
, BUILT_IN_DIV
, NULL_PTR
);
6166 builtin_function ("__builtin_ldiv", default_ftype
, BUILT_IN_LDIV
, NULL_PTR
);
6167 builtin_function ("__builtin_ffloor", double_ftype_double
, BUILT_IN_FFLOOR
,
6169 builtin_function ("__builtin_fceil", double_ftype_double
, BUILT_IN_FCEIL
,
6171 builtin_function ("__builtin_fmod", double_ftype_double_double
,
6172 BUILT_IN_FMOD
, NULL_PTR
);
6173 builtin_function ("__builtin_frem", double_ftype_double_double
,
6174 BUILT_IN_FREM
, NULL_PTR
);
6175 builtin_function ("__builtin_memset", ptr_ftype_ptr_int_int
,
6176 BUILT_IN_MEMSET
, NULL_PTR
);
6177 builtin_function ("__builtin_getexp", double_ftype_double
, BUILT_IN_GETEXP
,
6179 builtin_function ("__builtin_getman", double_ftype_double
, BUILT_IN_GETMAN
,
6183 /* C++ extensions */
6185 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6186 record_unknown_type (unknown_type_node
, "unknown type");
6188 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6189 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6191 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6193 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6195 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6196 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6198 /* This is for handling opaque types in signatures. */
6199 opaque_type_node
= copy_node (ptr_type_node
);
6200 TYPE_MAIN_VARIANT (opaque_type_node
) = opaque_type_node
;
6201 record_builtin_type (RID_MAX
, 0, opaque_type_node
);
6203 /* This is special for C++ so functions can be overloaded. */
6205 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6206 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6207 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6208 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6210 = TREE_UNSIGNED (wchar_type_node
)
6211 ? unsigned_wchar_type_node
6212 : signed_wchar_type_node
;
6213 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6215 /* Artificial declaration of wchar_t -- can be bashed */
6216 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6218 pushdecl (wchar_decl_node
);
6220 /* This is for wide string constants. */
6221 wchar_array_type_node
6222 = build_array_type (wchar_type_node
, array_domain_type
);
6224 if (flag_vtable_thunks
)
6226 /* Make sure we get a unique function type, so we can give
6227 its pointer type a name. (This wins for gdb.) */
6228 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6229 TREE_TYPE (vfunc_type
) = integer_type_node
;
6230 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6231 layout_type (vfunc_type
);
6233 vtable_entry_type
= build_pointer_type (vfunc_type
);
6237 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6238 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
6240 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
6242 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
6244 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6247 /* Make this part of an invisible union. */
6248 fields
[3] = copy_node (fields
[2]);
6249 TREE_TYPE (fields
[3]) = delta_type_node
;
6250 DECL_NAME (fields
[3]) = delta2_identifier
;
6251 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6252 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6253 TREE_UNSIGNED (fields
[3]) = 0;
6254 TREE_CHAIN (fields
[2]) = fields
[3];
6255 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6258 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6261 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6262 layout_type (vtbl_type_node
);
6263 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6264 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6265 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6266 layout_type (vtbl_ptr_type_node
);
6267 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6269 /* Simplify life by making a "sigtable_entry_type". Give its
6270 fields names so that the debugger can use them. */
6272 if (flag_handle_signatures
)
6274 sigtable_entry_type
= make_lang_type (RECORD_TYPE
);
6275 fields
[0] = build_lang_field_decl (FIELD_DECL
, tag_identifier
,
6277 fields
[1] = build_lang_field_decl (FIELD_DECL
, vb_off_identifier
,
6279 fields
[2] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
6281 fields
[3] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
6283 fields
[4] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
6286 /* Set the alignment to the max of the alignment of ptr_type_node and
6287 delta_type_node. Double alignment wastes a word on the Sparc. */
6288 finish_builtin_type (sigtable_entry_type
, SIGTABLE_PTR_TYPE
, fields
, 4,
6289 (TYPE_ALIGN (ptr_type_node
) > TYPE_ALIGN (delta_type_node
))
6293 /* Make this part of an invisible union. */
6294 fields
[5] = copy_node (fields
[4]);
6295 TREE_TYPE (fields
[5]) = delta_type_node
;
6296 DECL_NAME (fields
[5]) = vt_off_identifier
;
6297 DECL_MODE (fields
[5]) = TYPE_MODE (delta_type_node
);
6298 DECL_SIZE (fields
[5]) = TYPE_SIZE (delta_type_node
);
6299 TREE_UNSIGNED (fields
[5]) = 0;
6300 TREE_CHAIN (fields
[4]) = fields
[5];
6302 sigtable_entry_type
= build_qualified_type (sigtable_entry_type
,
6304 record_builtin_type (RID_MAX
, SIGTABLE_PTR_TYPE
, sigtable_entry_type
);
6307 std_node
= build_decl (NAMESPACE_DECL
,
6308 get_identifier (flag_honor_std
? "fake std":"std"),
6310 pushdecl (std_node
);
6312 global_type_node
= make_node (LANG_TYPE
);
6313 record_unknown_type (global_type_node
, "global type");
6316 current_lang_name
= lang_name_cplusplus
;
6319 tree bad_alloc_type_node
, newtype
, deltype
;
6321 push_namespace (get_identifier ("std"));
6322 bad_alloc_type_node
= xref_tag
6323 (class_type_node
, get_identifier ("bad_alloc"), 1);
6326 newtype
= build_exception_variant
6327 (ptr_ftype_sizetype
, build_tree_list (NULL_TREE
, bad_alloc_type_node
));
6328 deltype
= build_exception_variant
6329 (void_ftype_ptr
, build_tree_list (NULL_TREE
, NULL_TREE
));
6330 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6331 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6332 global_delete_fndecl
6333 = auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6334 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6338 = define_function ("__pure_virtual", void_ftype
,
6339 NOT_BUILT_IN
, 0, 0);
6341 /* Perform other language dependent initializations. */
6342 init_class_processing ();
6343 init_init_processing ();
6344 init_search_processing ();
6346 init_rtti_processing ();
6348 if (flag_exceptions
)
6349 init_exception_processing ();
6352 flag_inline_functions
= 0;
6355 if (! supports_one_only ())
6358 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6359 declare_function_name ();
6361 /* Prepare to check format strings against argument lists. */
6362 init_function_format_info ();
6364 /* Show we use EH for cleanups. */
6365 using_eh_for_cleanups ();
6367 print_error_function
= lang_print_error_function
;
6368 lang_get_alias_set
= &c_get_alias_set
;
6370 /* Maintain consistency. Perhaps we should just complain if they
6371 say -fwritable-strings? */
6372 if (flag_writable_strings
)
6373 flag_const_strings
= 0;
6376 /* Function to print any language-specific context for an error message. */
6379 lang_print_error_function (file
)
6382 default_print_error_function (file
);
6383 maybe_print_template_context ();
6386 /* Make a definition for a builtin function named NAME and whose data type
6387 is TYPE. TYPE should be a function type with argument types.
6388 FUNCTION_CODE tells later passes how to compile calls to this function.
6389 See tree.h for its possible values.
6391 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6392 the name to be called if we can't opencode the function. */
6395 define_function (name
, type
, function_code
, pfn
, library_name
)
6398 enum built_in_function function_code
;
6399 void (*pfn
) PROTO((tree
));
6402 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6403 DECL_EXTERNAL (decl
) = 1;
6404 TREE_PUBLIC (decl
) = 1;
6405 DECL_ARTIFICIAL (decl
) = 1;
6407 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6408 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6410 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6411 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6412 function in the namespace. */
6413 if (pfn
) (*pfn
) (decl
);
6415 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6416 make_function_rtl (decl
);
6417 if (function_code
!= NOT_BUILT_IN
)
6419 DECL_BUILT_IN (decl
) = 1;
6420 DECL_FUNCTION_CODE (decl
) = function_code
;
6425 /* When we call finish_struct for an anonymous union, we create
6426 default copy constructors and such. But, an anonymous union
6427 shouldn't have such things; this function undoes the damage to the
6428 anonymous union type T.
6430 (The reason that we create the synthesized methods is that we don't
6431 distinguish `union { int i; }' from `typedef union { int i; } U'.
6432 The first is an anonymous union; the second is just an ordinary
6436 fixup_anonymous_union (t
)
6441 /* Wipe out memory of synthesized methods */
6442 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6443 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6444 TYPE_HAS_INIT_REF (t
) = 0;
6445 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6446 TYPE_HAS_ASSIGN_REF (t
) = 0;
6447 TYPE_HAS_ASSIGNMENT (t
) = 0;
6448 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6450 /* Splice the implicitly generated functions out of the TYPE_METHODS
6452 q
= &TYPE_METHODS (t
);
6455 if (DECL_ARTIFICIAL (*q
))
6456 *q
= TREE_CHAIN (*q
);
6458 q
= &TREE_CHAIN (*q
);
6461 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6462 function members. */
6463 if (TYPE_METHODS (t
))
6464 error ("an anonymous union cannot have function members");
6467 /* Called when a declaration is seen that contains no names to declare.
6468 If its type is a reference to a structure, union or enum inherited
6469 from a containing scope, shadow that tag name for the current scope
6470 with a forward reference.
6471 If its type defines a new named structure or union
6472 or defines an enum, it is valid but we need not do anything here.
6473 Otherwise, it is an error.
6475 C++: may have to grok the declspecs to learn about static,
6476 complain for anonymous unions. */
6479 shadow_tag (declspecs
)
6483 tree ob_modifier
= NULL_TREE
;
6485 register enum tree_code code
, ok_code
= ERROR_MARK
;
6486 register tree t
= NULL_TREE
;
6488 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6490 register tree value
= TREE_VALUE (link
);
6492 code
= TREE_CODE (value
);
6493 if (IS_AGGR_TYPE_CODE (code
) || code
== ENUMERAL_TYPE
)
6495 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6497 maybe_process_partial_specialization (value
);
6503 else if (value
== ridpointers
[(int) RID_STATIC
]
6504 || value
== ridpointers
[(int) RID_EXTERN
]
6505 || value
== ridpointers
[(int) RID_AUTO
]
6506 || value
== ridpointers
[(int) RID_REGISTER
]
6507 || value
== ridpointers
[(int) RID_INLINE
]
6508 || value
== ridpointers
[(int) RID_VIRTUAL
]
6509 || value
== ridpointers
[(int) RID_EXPLICIT
])
6510 ob_modifier
= value
;
6513 /* This is where the variables in an anonymous union are
6514 declared. An anonymous union declaration looks like:
6516 because there is no declarator after the union, the parser
6517 sends that declaration here. */
6518 if (ok_code
== UNION_TYPE
6520 && ((TREE_CODE (TYPE_NAME (t
)) == IDENTIFIER_NODE
6521 && ANON_AGGRNAME_P (TYPE_NAME (t
)))
6522 || (TREE_CODE (TYPE_NAME (t
)) == TYPE_DECL
6523 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))))
6525 fixup_anonymous_union (t
);
6527 if (TYPE_FIELDS (t
))
6529 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6531 finish_anon_union (decl
);
6536 /* Anonymous unions are objects, that's why we only check for
6537 inappropriate specifiers in this branch. */
6541 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6542 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6543 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6544 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6545 cp_error ("`%D' can only be specified for constructors",
6548 cp_error ("`%D' can only be specified for objects and functions",
6553 cp_error ("abstract declarator used as declaration");
6554 else if (found_tag
> 1)
6555 pedwarn ("multiple types in one declaration");
6559 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6562 groktypename (typename
)
6565 if (TREE_CODE (typename
) != TREE_LIST
)
6567 return grokdeclarator (TREE_VALUE (typename
),
6568 TREE_PURPOSE (typename
),
6569 TYPENAME
, 0, NULL_TREE
);
6572 /* Decode a declarator in an ordinary declaration or data definition.
6573 This is called as soon as the type information and variable name
6574 have been parsed, before parsing the initializer if any.
6575 Here we create the ..._DECL node, fill in its type,
6576 and put it on the list of decls for the current context.
6577 The ..._DECL node is returned as the value.
6579 Exception: for arrays where the length is not specified,
6580 the type is left null, to be filled in by `cp_finish_decl'.
6582 Function definitions do not come here; they go to start_function
6583 instead. However, external and forward declarations of functions
6584 do go through here. Structure field declarations are done by
6585 grokfield and not through here. */
6587 /* Set this to zero to debug not using the temporary obstack
6588 to parse initializers. */
6589 int debug_temp_inits
= 1;
6592 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6593 tree declarator
, declspecs
;
6595 tree attributes
, prefix_attributes
;
6598 register tree type
, tem
;
6600 extern int have_extern_spec
;
6601 extern int used_extern_spec
;
6604 /* See code below that used this. */
6605 int init_written
= initialized
;
6608 /* This should only be done once on the top most decl. */
6609 if (have_extern_spec
&& !used_extern_spec
)
6611 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6613 used_extern_spec
= 1;
6616 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6618 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6621 type
= TREE_TYPE (decl
);
6623 /* Don't lose if destructors must be executed at file-level. */
6624 if (! processing_template_decl
&& TREE_STATIC (decl
)
6625 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6626 && !TREE_PERMANENT (decl
))
6628 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6629 decl
= copy_node (decl
);
6630 if (TREE_CODE (type
) == ARRAY_TYPE
)
6632 tree itype
= TYPE_DOMAIN (type
);
6633 if (itype
&& ! TREE_PERMANENT (itype
))
6635 itype
= build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype
)));
6636 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6637 TREE_TYPE (decl
) = type
;
6644 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6645 ? DECL_CLASS_CONTEXT (decl
)
6646 : DECL_CONTEXT (decl
);
6648 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6649 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6651 /* When parsing the initializer, lookup should use the object's
6653 push_decl_namespace (context
);
6656 /* We are only interested in class contexts, later. */
6657 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6658 context
= NULL_TREE
;
6661 /* Is it valid for this decl to have an initializer at all?
6662 If not, set INITIALIZED to zero, which will indirectly
6663 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6664 switch (TREE_CODE (decl
))
6667 /* typedef foo = bar means give foo the same type as bar.
6668 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6669 Any other case of an initialization in a TYPE_DECL is an error. */
6670 if (pedantic
|| list_length (declspecs
) > 1)
6672 cp_error ("typedef `%D' is initialized", decl
);
6678 cp_error ("function `%#D' is initialized like a variable", decl
);
6683 if (! processing_template_decl
)
6685 if (type
!= error_mark_node
)
6687 if (TYPE_SIZE (type
) != NULL_TREE
6688 && ! TREE_CONSTANT (TYPE_SIZE (type
)))
6691 ("variable-sized object `%D' may not be initialized",
6696 if (TREE_CODE (type
) == ARRAY_TYPE
6697 && TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6700 ("elements of array `%#D' have incomplete type", decl
);
6709 if (! toplevel_bindings_p ()
6710 && DECL_EXTERNAL (decl
))
6711 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6713 DECL_EXTERNAL (decl
) = 0;
6714 if (toplevel_bindings_p ())
6715 TREE_STATIC (decl
) = 1;
6717 /* Tell `pushdecl' this is an initialized decl
6718 even though we don't yet have the initializer expression.
6719 Also tell `cp_finish_decl' it may store the real initializer. */
6720 DECL_INITIAL (decl
) = error_mark_node
;
6723 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6725 pushclass (context
, 2);
6727 if (TREE_CODE (decl
) == VAR_DECL
)
6729 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6730 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6731 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6734 if (DECL_CONTEXT (field
) != context
)
6736 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6737 DECL_CONTEXT (field
), DECL_NAME (decl
),
6738 context
, DECL_NAME (decl
));
6739 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6741 /* Static data member are tricky; an in-class initialization
6742 still doesn't provide a definition, so the in-class
6743 declaration will have DECL_EXTERNAL set, but will have an
6744 initialization. Thus, duplicate_decls won't warn
6745 about this situation, and so we check here. */
6746 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6747 cp_error ("duplicate initialization of %D", decl
);
6748 if (duplicate_decls (decl
, field
))
6754 tree field
= check_classfn (context
, decl
);
6755 if (field
&& duplicate_decls (decl
, field
))
6759 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6760 DECL_IN_AGGR_P (decl
) = 0;
6761 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6762 || CLASSTYPE_USE_TEMPLATE (context
))
6763 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6765 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6766 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6770 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6771 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6774 /* Set attributes here so if duplicate decl, will have proper attributes. */
6775 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6777 /* Add this decl to the current binding level, but not if it
6778 comes from another scope, e.g. a static member variable.
6779 TEM may equal DECL or it may be a previous decl of the same name. */
6781 if ((TREE_CODE (decl
) != PARM_DECL
&& DECL_CONTEXT (decl
) != NULL_TREE
6782 /* Definitions of namespace members outside their namespace are
6784 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
6785 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
6786 || TREE_CODE (type
) == LANG_TYPE
6787 /* The declaration of template specializations does not affect
6788 the functions available for overload resolution, so we do not
6790 || (TREE_CODE (decl
) == FUNCTION_DECL
6791 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
6794 tem
= pushdecl (decl
);
6796 if (processing_template_decl
)
6798 if (! current_function_decl
)
6799 tem
= push_template_decl (tem
);
6800 else if (minimal_parse_mode
)
6802 = build_min_nt (DECL_STMT
, copy_to_permanent (declarator
),
6803 copy_to_permanent (declspecs
),
6808 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6809 /* Tell the back-end to use or not use .common as appropriate. If we say
6810 -fconserve-space, we want this to save .data space, at the expense of
6811 wrong semantics. If we say -fno-conserve-space, we want this to
6812 produce errors about redefs; to do this we force variables into the
6814 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6817 if (! processing_template_decl
)
6820 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6821 push_obstacks_nochange ();
6824 /* We have no way of knowing whether the initializer will need to be
6825 evaluated at run-time or not until we've parsed it, so let's just put
6826 it in the permanent obstack. (jason) */
6828 && ! (TREE_CODE (tem
) == PARM_DECL
6829 || (TREE_READONLY (tem
)
6830 && (TREE_CODE (tem
) == VAR_DECL
6831 || TREE_CODE (tem
) == FIELD_DECL
))))
6833 /* When parsing and digesting the initializer,
6834 use temporary storage. Do this even if we will ignore the value. */
6835 if (toplevel_bindings_p () && debug_temp_inits
)
6837 if (processing_template_decl
6838 || TYPE_NEEDS_CONSTRUCTING (type
)
6839 || TREE_CODE (type
) == REFERENCE_TYPE
)
6840 /* In this case, the initializer must lay down in permanent
6841 storage, since it will be saved until `finish_file' is run. */
6844 temporary_allocation ();
6856 tree type
= TREE_TYPE (decl
);
6857 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6859 /* If this type of object needs a cleanup, and control may
6860 jump past it, make a new binding level so that it is cleaned
6861 up only when it is initialized first. */
6862 if (TYPE_NEEDS_DESTRUCTOR (type
)
6863 && current_binding_level
->more_cleanups_ok
== 0)
6864 pushlevel_temporary (1);
6867 /* Is it valid for this decl to have an initializer at all?
6868 If not, set INITIALIZED to zero, which will indirectly
6869 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6871 /* Don't allow initializations for incomplete types except for
6872 arrays which might be completed by the initialization. */
6873 if (type
== error_mark_node
)
6874 ; /* Don't complain again. */
6875 else if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6876 ; /* A complete type is ok. */
6877 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6879 cp_error ("variable `%#D' has initializer but incomplete type",
6882 type
= TREE_TYPE (decl
) = error_mark_node
;
6884 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6886 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6887 cp_error ("elements of array `%#D' have incomplete type", decl
);
6888 /* else we already gave an error in start_decl. */
6894 && TREE_CODE (decl
) != TYPE_DECL
6895 && TREE_CODE (decl
) != TEMPLATE_DECL
6896 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6898 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6899 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6901 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6903 /* Change the type so that assemble_variable will give
6904 DECL an rtl we can live with: (mem (const_int 0)). */
6905 type
= TREE_TYPE (decl
) = error_mark_node
;
6909 /* If any base type in the hierarchy of TYPE needs a constructor,
6910 then we set initialized to 1. This way any nodes which are
6911 created for the purposes of initializing this aggregate
6912 will live as long as it does. This is necessary for global
6913 aggregates which do not have their initializers processed until
6914 the end of the file. */
6915 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6920 /* We don't do this yet for GNU C++. */
6921 /* For a local variable, define the RTL now. */
6922 if (! toplevel_bindings_p ()
6923 /* But not if this is a duplicate decl
6924 and we preserved the rtl from the previous one
6925 (which may or may not happen). */
6926 && DECL_RTL (tem
) == NULL_RTX
)
6928 if (TYPE_SIZE (TREE_TYPE (tem
)) != NULL_TREE
)
6930 else if (TREE_CODE (TREE_TYPE (tem
)) == ARRAY_TYPE
6931 && DECL_INITIAL (tem
) != NULL_TREE
)
6937 DECL_INITIAL (decl
) = NULL_TREE
;
6940 /* Handle initialization of references.
6941 These three arguments are from `cp_finish_decl', and have the
6942 same meaning here that they do there.
6944 Quotes on semantics can be found in ARM 8.4.3. */
6947 grok_reference_init (decl
, type
, init
)
6948 tree decl
, type
, init
;
6952 if (init
== NULL_TREE
)
6954 if ((DECL_LANG_SPECIFIC (decl
) == 0
6955 || DECL_IN_AGGR_P (decl
) == 0)
6956 && ! DECL_THIS_EXTERN (decl
))
6958 cp_error ("`%D' declared as reference but not initialized", decl
);
6959 if (TREE_CODE (decl
) == VAR_DECL
)
6960 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
6965 if (init
== error_mark_node
)
6968 if (TREE_CODE (type
) == REFERENCE_TYPE
6969 && TREE_CODE (init
) == CONSTRUCTOR
)
6971 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6975 if (TREE_CODE (init
) == TREE_LIST
)
6976 init
= build_compound_expr (init
);
6978 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6979 init
= convert_from_reference (init
);
6981 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6982 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6984 /* Note: default conversion is only called in very special cases. */
6985 init
= default_conversion (init
);
6988 tmp
= convert_to_reference
6989 (type
, init
, CONV_IMPLICIT
,
6990 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6992 if (tmp
== error_mark_node
)
6994 else if (tmp
!= NULL_TREE
)
6997 DECL_INITIAL (decl
) = save_expr (init
);
7001 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7005 /* ?? Can this be optimized in some cases to
7006 hand back the DECL_INITIAL slot?? */
7007 if (TYPE_SIZE (TREE_TYPE (type
)))
7009 init
= convert_from_reference (decl
);
7010 if (TREE_PERMANENT (decl
))
7011 init
= copy_to_permanent (init
);
7012 SET_DECL_REFERENCE_SLOT (decl
, init
);
7015 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7017 expand_static_init (decl
, DECL_INITIAL (decl
));
7018 DECL_INITIAL (decl
) = NULL_TREE
;
7023 if (TREE_CODE (decl
) == VAR_DECL
)
7024 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7028 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7029 mucking with forces it does not comprehend (i.e. initialization with a
7030 constructor). If we are at global scope and won't go into COMMON, fill
7031 it in with a dummy CONSTRUCTOR to force the variable into .data;
7032 otherwise we can use error_mark_node. */
7035 obscure_complex_init (decl
, init
)
7038 if (! flag_no_inline
&& TREE_STATIC (decl
))
7040 if (extract_init (decl
, init
))
7044 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7045 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7046 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7050 DECL_INITIAL (decl
) = error_mark_node
;
7055 /* Issue an error message if DECL is an uninitialized const variable. */
7058 check_for_uninitialized_const_var (decl
)
7061 tree type
= TREE_TYPE (decl
);
7063 /* ``Unless explicitly declared extern, a const object does not have
7064 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7066 if (TREE_CODE (decl
) == VAR_DECL
7067 && TREE_CODE (type
) != REFERENCE_TYPE
7068 && CP_TYPE_CONST_P (type
)
7069 && !TYPE_NEEDS_CONSTRUCTING (type
)
7070 && !DECL_INITIAL (decl
))
7071 cp_error ("uninitialized const `%D'", decl
);
7074 /* Finish processing of a declaration;
7075 install its line number and initial value.
7076 If the length of an array type is not known before,
7077 it must be determined now, from the initial value, or it is an error.
7079 Call `pop_obstacks' iff NEED_POP is nonzero.
7081 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7082 for aggregates that have constructors alive on the permanent obstack,
7083 so that the global initializing functions can be written at the end.
7085 INIT0 holds the value of an initializer that should be allowed to escape
7088 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7089 if the (init) syntax was used.
7091 For functions that take default parameters, DECL points to its
7092 "maximal" instantiation. `cp_finish_decl' must then also declared its
7093 subsequently lower and lower forms of instantiation, checking for
7094 ambiguity as it goes. This can be sped up later. */
7097 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7104 tree cleanup
= NULL_TREE
, ttype
= NULL_TREE
;
7106 int temporary
= allocation_temporary_p ();
7107 char *asmspec
= NULL
;
7108 int was_readonly
= 0;
7109 int already_used
= 0;
7111 /* If this is 0, then we did not change obstacks. */
7115 error ("assignment (not initialization) in declaration");
7119 /* If a name was specified, get the string. */
7121 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7123 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7125 cp_error ("Cannot initialize `%D' to namespace `%D'",
7130 if (current_class_type
7131 && DECL_REAL_CONTEXT (decl
) == current_class_type
7132 && TYPE_BEING_DEFINED (current_class_type
)
7133 && (DECL_INITIAL (decl
) || init
))
7134 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7136 if (TREE_CODE (decl
) == VAR_DECL
7137 && DECL_CONTEXT (decl
)
7138 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7139 && DECL_CONTEXT (decl
) != current_namespace
7142 /* Leave the namespace of the object. */
7143 pop_decl_namespace ();
7146 /* If the type of the thing we are declaring either has
7147 a constructor, or has a virtual function table pointer,
7148 AND its initialization was accepted by `start_decl',
7149 then we stayed on the permanent obstack through the
7150 declaration, otherwise, changed obstacks as GCC would. */
7152 type
= TREE_TYPE (decl
);
7154 if (type
== error_mark_node
)
7156 if (toplevel_bindings_p () && temporary
)
7157 end_temporary_allocation ();
7162 if (processing_template_decl
)
7164 if (init
&& DECL_INITIAL (decl
))
7165 DECL_INITIAL (decl
) = init
;
7166 if (minimal_parse_mode
&& ! DECL_ARTIFICIAL (decl
))
7168 tree stmt
= DECL_VINDEX (decl
);
7169 /* If the decl is declaring a member of a local class (in a
7170 template function), the DECL_VINDEX will either be NULL,
7171 or it will be an actual virtual function index, not a
7173 if (stmt
!= NULL_TREE
&& TREE_CODE (stmt
) == DECL_STMT
)
7175 DECL_VINDEX (decl
) = NULL_TREE
;
7176 TREE_OPERAND (stmt
, 2) = copy_to_permanent (init
);
7183 /* Take care of TYPE_DECLs up front. */
7184 if (TREE_CODE (decl
) == TYPE_DECL
)
7186 if (init
&& DECL_INITIAL (decl
))
7188 /* typedef foo = bar; store the type of bar as the type of foo. */
7189 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7190 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7192 if (type
!= error_mark_node
7193 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7195 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7196 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7197 set_identifier_type_value (DECL_NAME (decl
), type
);
7198 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7200 GNU_xref_decl (current_function_decl
, decl
);
7202 /* If we have installed this as the canonical typedef for this
7203 type, and that type has not been defined yet, delay emitting
7204 the debug information for it, as we will emit it later. */
7205 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7206 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7207 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7209 rest_of_decl_compilation (decl
, NULL_PTR
,
7210 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7213 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7215 ttype
= target_type (type
);
7218 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7219 && TYPE_NEEDS_CONSTRUCTING (type
))
7222 /* Currently, GNU C++ puts constants in text space, making them
7223 impossible to initialize. In the future, one would hope for
7224 an operating system which understood the difference between
7225 initialization and the running of a program. */
7227 TREE_READONLY (decl
) = 0;
7230 if (TREE_CODE (decl
) == FIELD_DECL
)
7232 if (init
&& init
!= error_mark_node
)
7233 my_friendly_assert (TREE_PERMANENT (init
), 147);
7237 /* This must override the asm specifier which was placed
7238 by grokclassfn. Lay this out fresh. */
7239 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7240 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7241 make_decl_rtl (decl
, asmspec
, 0);
7244 /* If `start_decl' didn't like having an initialization, ignore it now. */
7245 else if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7247 else if (DECL_EXTERNAL (decl
))
7249 else if (TREE_CODE (type
) == REFERENCE_TYPE
7250 || (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE_REFERENCE (type
)))
7252 if (TREE_STATIC (decl
))
7253 make_decl_rtl (decl
, NULL_PTR
,
7254 toplevel_bindings_p ()
7255 || pseudo_global_level_p ());
7256 grok_reference_init (decl
, type
, init
);
7260 GNU_xref_decl (current_function_decl
, decl
);
7262 if (TREE_CODE (decl
) == FIELD_DECL
)
7264 else if (TREE_CODE (decl
) == CONST_DECL
)
7266 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7268 DECL_INITIAL (decl
) = init
;
7270 /* This will keep us from needing to worry about our obstacks. */
7271 my_friendly_assert (init
!= NULL_TREE
, 149);
7276 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7278 if (TREE_CODE (type
) == ARRAY_TYPE
)
7279 init
= digest_init (type
, init
, (tree
*) 0);
7280 else if (TREE_CODE (init
) == CONSTRUCTOR
7281 && TREE_HAS_CONSTRUCTOR (init
))
7283 if (TYPE_NON_AGGREGATE_CLASS (type
))
7285 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7287 init
= error_mark_node
;
7290 goto dont_use_constructor
;
7295 dont_use_constructor
:
7296 if (TREE_CODE (init
) != TREE_VEC
)
7297 init
= store_init_value (decl
, init
);
7301 /* We must hide the initializer so that expand_decl
7302 won't try to do something it does not understand. */
7303 init
= obscure_complex_init (decl
, init
);
7305 else if (DECL_EXTERNAL (decl
))
7307 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7308 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7311 while (TREE_CODE (ctype
) == ARRAY_TYPE
)
7312 ctype
= TREE_TYPE (ctype
);
7313 if (! TYPE_NEEDS_CONSTRUCTING (ctype
))
7315 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (ctype
))
7316 cp_error ("structure `%D' with uninitialized const members", decl
);
7317 if (CLASSTYPE_REF_FIELDS_NEED_INIT (ctype
))
7318 cp_error ("structure `%D' with uninitialized reference members",
7322 check_for_uninitialized_const_var (decl
);
7324 if (TYPE_SIZE (type
) != NULL_TREE
7325 && TYPE_NEEDS_CONSTRUCTING (type
))
7326 init
= obscure_complex_init (decl
, NULL_TREE
);
7330 check_for_uninitialized_const_var (decl
);
7332 /* For top-level declaration, the initial value was read in
7333 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7334 must go in the permanent obstack; but don't discard the
7335 temporary data yet. */
7337 if (toplevel_bindings_p () && temporary
)
7338 end_temporary_allocation ();
7340 /* Deduce size of array from initialization, if not already known. */
7342 if (TREE_CODE (type
) == ARRAY_TYPE
7343 && TYPE_DOMAIN (type
) == NULL_TREE
7344 && TREE_CODE (decl
) != TYPE_DECL
)
7347 = (TREE_STATIC (decl
)
7348 /* Even if pedantic, an external linkage array
7349 may have incomplete type at first. */
7350 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7351 : !DECL_EXTERNAL (decl
));
7352 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7353 int failure
= complete_array_type (type
, initializer
, do_default
);
7356 cp_error ("initializer fails to determine size of `%D'", decl
);
7361 cp_error ("array size missing in `%D'", decl
);
7362 /* If a `static' var's size isn't known, make it extern as
7363 well as static, so it does not get allocated. If it's not
7364 `static', then don't mark it extern; finish_incomplete_decl
7365 will give it a default size and it will get allocated. */
7366 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7367 DECL_EXTERNAL (decl
) = 1;
7370 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7371 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7373 cp_error ("zero-size array `%D'", decl
);
7375 layout_decl (decl
, 0);
7378 if (TREE_CODE (decl
) == VAR_DECL
)
7380 if (DECL_SIZE (decl
) == NULL_TREE
7381 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7382 layout_decl (decl
, 0);
7384 if (TREE_STATIC (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7386 /* A static variable with an incomplete type:
7387 that is an error if it is initialized.
7388 Otherwise, let it through, but if it is not `extern'
7389 then it may cause an error message later. */
7390 if (DECL_INITIAL (decl
) != NULL_TREE
)
7391 cp_error ("storage size of `%D' isn't known", decl
);
7394 else if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7396 /* An automatic variable with an incomplete type: that is an error.
7397 Don't talk about array types here, since we took care of that
7398 message in grokdeclarator. */
7399 cp_error ("storage size of `%D' isn't known", decl
);
7400 TREE_TYPE (decl
) = error_mark_node
;
7402 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7403 /* Let debugger know it should output info for this type. */
7404 note_debug_info_needed (ttype
);
7406 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7407 note_debug_info_needed (DECL_CONTEXT (decl
));
7409 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7410 && DECL_SIZE (decl
) != NULL_TREE
7411 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7413 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7414 constant_expression_warning (DECL_SIZE (decl
));
7416 cp_error ("storage size of `%D' isn't constant", decl
);
7419 if (! DECL_EXTERNAL (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7420 /* Cleanups for static variables are handled by `finish_file'. */
7421 && ! TREE_STATIC (decl
))
7423 int yes
= suspend_momentary ();
7424 cleanup
= maybe_build_cleanup (decl
);
7425 resume_momentary (yes
);
7428 /* PARM_DECLs get cleanups, too. */
7429 else if (TREE_CODE (decl
) == PARM_DECL
&& TYPE_NEEDS_DESTRUCTOR (type
))
7432 end_temporary_allocation ();
7433 cleanup
= maybe_build_cleanup (decl
);
7435 resume_temporary_allocation ();
7438 /* Output the assembler code and/or RTL code for variables and functions,
7439 unless the type is an undefined structure or union.
7440 If not, it will get done when the type is completed. */
7442 was_incomplete
= (DECL_SIZE (decl
) == NULL_TREE
);
7444 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7445 || TREE_CODE (decl
) == RESULT_DECL
)
7447 /* ??? FIXME: What about nested classes? */
7448 int toplev
= toplevel_bindings_p () || pseudo_global_level_p ();
7450 = (TREE_STATIC (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7451 && allocation_temporary_p ());
7454 end_temporary_allocation ();
7456 /* Static data in a function with comdat linkage also has comdat
7458 if (TREE_CODE (decl
) == VAR_DECL
7459 && TREE_STATIC (decl
)
7460 /* Don't mess with __FUNCTION__. */
7461 && ! TREE_ASM_WRITTEN (decl
)
7462 && current_function_decl
7463 && DECL_CONTEXT (decl
) == current_function_decl
7464 && (DECL_THIS_INLINE (current_function_decl
)
7465 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7466 && TREE_PUBLIC (current_function_decl
))
7468 /* Rather than try to get this right with inlining, we suppress
7469 inlining of such functions. */
7470 current_function_cannot_inline
7471 = "function with static variable cannot be inline";
7473 /* If flag_weak, we don't need to mess with this, as we can just
7474 make the function weak, and let it refer to its unique local
7475 copy. This works because we don't allow the function to be
7479 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7481 TREE_PUBLIC (decl
) = 1;
7482 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7484 else if (DECL_INITIAL (decl
) == NULL_TREE
7485 || DECL_INITIAL (decl
) == error_mark_node
)
7487 TREE_PUBLIC (decl
) = 1;
7488 DECL_COMMON (decl
) = 1;
7490 /* else we lose. We can only do this if we can use common,
7491 which we can't if it has been initialized. */
7493 if (TREE_PUBLIC (decl
))
7494 DECL_ASSEMBLER_NAME (decl
)
7495 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7496 else if (! DECL_ARTIFICIAL (decl
))
7498 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7499 cp_warning_at (" you can work around this by removing the initializer"), decl
;
7504 else if (TREE_CODE (decl
) == VAR_DECL
7505 && DECL_LANG_SPECIFIC (decl
)
7506 && DECL_COMDAT (decl
))
7508 /* Dynamically initialized vars go into common. */
7509 if (DECL_INITIAL (decl
) == NULL_TREE
7510 || DECL_INITIAL (decl
) == error_mark_node
)
7511 DECL_COMMON (decl
) = 1;
7512 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7514 DECL_COMMON (decl
) = 1;
7515 DECL_INITIAL (decl
) = error_mark_node
;
7519 /* Statically initialized vars are weak or comdat, if
7522 make_decl_one_only (decl
);
7525 /* We can't do anything useful; leave vars for explicit
7527 DECL_EXTERNAL (decl
) = 1;
7528 DECL_NOT_REALLY_EXTERN (decl
) = 0;
7533 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7534 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7535 else if (TREE_CODE (decl
) == VAR_DECL
7536 && TREE_READONLY (decl
)
7537 && DECL_INITIAL (decl
) != NULL_TREE
7538 && DECL_INITIAL (decl
) != error_mark_node
7539 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7541 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7544 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7547 && TREE_STATIC (decl
)
7548 && ! TREE_SIDE_EFFECTS (decl
)
7549 && ! TREE_PUBLIC (decl
)
7550 && ! DECL_EXTERNAL (decl
)
7551 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7552 && DECL_MODE (decl
) != BLKmode
)
7554 /* If this variable is really a constant, then fill its DECL_RTL
7555 slot with something which won't take up storage.
7556 If something later should take its address, we can always give
7557 it legitimate RTL at that time. */
7558 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7559 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7560 TREE_ASM_WRITTEN (decl
) = 1;
7562 else if (toplev
&& ! TREE_PUBLIC (decl
))
7564 /* If this is a static const, change its apparent linkage
7565 if it belongs to a #pragma interface. */
7566 if (!interface_unknown
)
7568 TREE_PUBLIC (decl
) = 1;
7569 DECL_EXTERNAL (decl
) = interface_only
;
7571 make_decl_rtl (decl
, asmspec
, toplev
);
7574 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7576 else if (TREE_CODE (decl
) == VAR_DECL
7577 && DECL_LANG_SPECIFIC (decl
)
7578 && DECL_IN_AGGR_P (decl
))
7580 if (TREE_STATIC (decl
))
7582 if (init
== NULL_TREE
7583 #ifdef DEFAULT_STATIC_DEFS
7584 /* If this code is dead, then users must
7585 explicitly declare static member variables
7586 outside the class def'n as well. */
7587 && TYPE_NEEDS_CONSTRUCTING (type
)
7591 DECL_EXTERNAL (decl
) = 1;
7592 make_decl_rtl (decl
, asmspec
, 1);
7595 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7598 /* Just a constant field. Should not need any rtl. */
7602 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7605 resume_temporary_allocation ();
7607 if (type
!= error_mark_node
7608 && TYPE_LANG_SPECIFIC (type
)
7609 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
7610 abstract_virtuals_error (decl
, type
);
7611 else if ((TREE_CODE (type
) == FUNCTION_TYPE
7612 || TREE_CODE (type
) == METHOD_TYPE
)
7613 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
7614 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (type
)))
7615 abstract_virtuals_error (decl
, TREE_TYPE (type
));
7617 if (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE (type
))
7618 signature_error (decl
, type
);
7619 else if ((TREE_CODE (type
) == FUNCTION_TYPE
7620 || TREE_CODE (type
) == METHOD_TYPE
)
7621 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
7622 && IS_SIGNATURE (TREE_TYPE (type
)))
7623 signature_error (decl
, TREE_TYPE (type
));
7625 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7627 else if (DECL_EXTERNAL (decl
)
7628 && ! (DECL_LANG_SPECIFIC (decl
)
7629 && DECL_NOT_REALLY_EXTERN (decl
)))
7632 DECL_INITIAL (decl
) = init
;
7634 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7636 /* Cleanups for static variables are handled by `finish_file'. */
7637 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7638 || TYPE_NEEDS_DESTRUCTOR (type
))
7639 expand_static_init (decl
, init
);
7643 /* This is a declared decl which must live until the
7644 end of the binding contour. It may need a cleanup. */
7646 /* Recompute the RTL of a local array now
7647 if it used to be an incomplete type. */
7648 if (was_incomplete
&& ! TREE_STATIC (decl
))
7650 /* If we used it already as memory, it must stay in memory. */
7651 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7652 /* If it's still incomplete now, no init will save it. */
7653 if (DECL_SIZE (decl
) == NULL_TREE
)
7654 DECL_INITIAL (decl
) = NULL_TREE
;
7657 else if (! TREE_ASM_WRITTEN (decl
)
7658 && (TYPE_SIZE (type
) != NULL_TREE
7659 || TREE_CODE (type
) == ARRAY_TYPE
))
7661 /* Do this here, because we did not expand this decl's
7662 rtl in start_decl. */
7663 if (DECL_RTL (decl
) == NULL_RTX
)
7667 /* XXX: Why don't we use decl here? */
7668 /* Ans: Because it was already expanded? */
7669 if (! expand_decl_cleanup (NULL_TREE
, cleanup
))
7670 cp_error ("parser lost in parsing declaration of `%D'",
7672 /* Cleanup used up here. */
7673 cleanup
= NULL_TREE
;
7677 if (current_binding_level
->is_for_scope
)
7679 struct binding_level
*outer
= current_binding_level
->level_chain
;
7681 /* Check to see if the same name is already bound at
7682 the outer level, either because it was directly declared,
7683 or because a dead for-decl got preserved. In either case,
7684 the code would not have been valid under the ARM
7685 scope rules, so clear is_for_scope for the
7686 current_binding_level.
7688 Otherwise, we need to preserve the temp slot for decl
7689 to last into the outer binding level. */
7691 int handling_dead_for_vars
= 0;
7692 tree link
= outer
->names
;
7693 for (; ; link
= TREE_CHAIN (link
))
7695 if (link
== NULL
&& handling_dead_for_vars
== 0)
7697 link
= outer
->dead_vars_from_for
;
7698 handling_dead_for_vars
= 1;
7702 if (DECL_IN_MEMORY_P (decl
))
7703 preserve_temp_slots (DECL_RTL (decl
));
7706 if (DECL_NAME (link
) == DECL_NAME (decl
))
7708 if (handling_dead_for_vars
)
7711 = purpose_member (DECL_NAME (decl
),
7712 current_binding_level
->shadowed
);
7713 if (shadowing
&& TREE_VALUE (shadowing
) == link
)
7714 TREE_VALUE (shadowing
)
7715 = DECL_SHADOWED_FOR_VAR (link
);
7717 current_binding_level
->is_for_scope
= 0;
7723 expand_start_target_temps ();
7725 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7727 /* Compute and store the initial value. */
7728 expand_decl_init (decl
);
7729 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7731 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7733 emit_line_note (DECL_SOURCE_FILE (decl
),
7734 DECL_SOURCE_LINE (decl
));
7735 expand_aggr_init (decl
, init
, flags
);
7738 /* Set this to 0 so we can tell whether an aggregate which
7739 was initialized was ever used. Don't do this if it has a
7740 destructor, so we don't complain about the 'resource
7741 allocation is initialization' idiom. */
7742 /* Now set attribute((unused)) on types so decls of
7743 that type will be marked used. (see TREE_USED, above.)
7744 This avoids the warning problems this particular code
7745 tried to work around. */
7747 if (TYPE_NEEDS_CONSTRUCTING (type
)
7749 && cleanup
== NULL_TREE
7750 && DECL_NAME (decl
))
7751 TREE_USED (decl
) = 0;
7754 TREE_USED (decl
) = 1;
7757 /* Cleanup any temporaries needed for the initial value. */
7758 expand_end_target_temps ();
7760 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7762 /* Store the cleanup, if there was one. */
7765 if (! expand_decl_cleanup (decl
, cleanup
))
7766 cp_error ("parser lost in parsing declaration of `%D'",
7773 /* Undo call to `pushclass' that was done in `start_decl'
7774 due to initialization of qualified member variable.
7775 I.e., Foo::x = 10; */
7777 tree context
= DECL_REAL_CONTEXT (decl
);
7779 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7780 && (TREE_CODE (decl
) == VAR_DECL
7781 /* We also have a pushclass done that we need to undo here
7782 if we're at top level and declare a method. */
7783 || TREE_CODE (decl
) == FUNCTION_DECL
)
7784 /* If size hasn't been set, we're still defining it,
7785 and therefore inside the class body; don't pop
7786 the binding level.. */
7787 && TYPE_SIZE (context
) != NULL_TREE
7788 && context
== current_class_type
)
7795 /* If requested, warn about definitions of large data objects. */
7797 if (warn_larger_than
7798 && ! processing_template_decl
7799 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7800 && !DECL_EXTERNAL (decl
))
7802 register tree decl_size
= DECL_SIZE (decl
);
7804 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7806 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7808 if (units
> larger_than_size
)
7809 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7815 /* Resume permanent allocation, if not within a function. */
7816 /* The corresponding push_obstacks_nochange is in start_decl,
7817 start_method, groktypename, and in grokfield. */
7822 TREE_READONLY (decl
) = 1;
7825 /* This is here for a midend callback from c-common.c */
7828 finish_decl (decl
, init
, asmspec_tree
)
7832 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7836 expand_static_init (decl
, init
)
7840 tree oldstatic
= value_member (decl
, static_aggregates
);
7844 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7845 cp_error ("multiple initializations given for `%D'", decl
);
7847 else if (! toplevel_bindings_p () && ! pseudo_global_level_p ())
7849 /* Emit code to perform this initialization but once. */
7852 /* Remember this information until end of file. */
7853 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7855 /* Emit code to perform this initialization but once. */
7856 temp
= get_temp_name (integer_type_node
, 1);
7857 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7858 expand_start_cond (build_binary_op (EQ_EXPR
, temp
,
7859 integer_zero_node
, 1), 0);
7860 expand_start_target_temps ();
7862 expand_assignment (temp
, integer_one_node
, 0, 0);
7863 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
7864 || (init
&& TREE_CODE (init
) == TREE_LIST
))
7866 expand_aggr_init (decl
, init
, 0);
7867 do_pending_stack_adjust ();
7870 expand_assignment (decl
, init
, 0, 0);
7872 /* Cleanup any temporaries needed for the initial value. */
7873 expand_end_target_temps ();
7875 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7877 tree cleanup
, fcall
;
7878 static tree Atexit
= 0;
7881 tree atexit_fndecl
, PFV
, pfvlist
;
7882 /* Remember this information until end of file. */
7883 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7884 PFV
= build_pointer_type (build_function_type
7885 (void_type_node
, void_list_node
));
7887 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7889 push_lang_context (lang_name_c
);
7891 = builtin_function ("atexit",
7892 build_function_type (void_type_node
,
7894 NOT_BUILT_IN
, NULL_PTR
);
7895 assemble_external (atexit_fndecl
);
7896 Atexit
= default_conversion (atexit_fndecl
);
7897 pop_lang_context ();
7901 /* Call build_cleanup before we enter the anonymous function
7902 so that any access checks will be done relative to the
7903 current scope, rather than the scope of the anonymous
7905 fcall
= build_cleanup (decl
);
7906 cleanup
= start_anon_func ();
7907 expand_expr_stmt (fcall
);
7909 mark_addressable (cleanup
);
7910 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7911 fcall
= build_function_call (Atexit
, expr_tree_cons (NULL_TREE
, cleanup
, NULL_TREE
));
7912 expand_expr_stmt (fcall
);
7916 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7918 static_aggregates
= perm_tree_cons (temp
, decl
, static_aggregates
);
7919 TREE_STATIC (static_aggregates
) = 1;
7922 /* Resume old (possibly temporary) allocation. */
7927 /* This code takes into account memory allocation
7928 policy of `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING
7929 does not hold for this object, then we must make permanent
7930 the storage currently in the temporary obstack. */
7931 if (! TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
7932 preserve_initializer ();
7933 static_aggregates
= perm_tree_cons (init
, decl
, static_aggregates
);
7937 /* Make TYPE a complete type based on INITIAL_VALUE.
7938 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
7939 2 if there was no information (in which case assume 1 if DO_DEFAULT). */
7942 complete_array_type (type
, initial_value
, do_default
)
7943 tree type
, initial_value
;
7946 register tree maxindex
= NULL_TREE
;
7951 /* Note MAXINDEX is really the maximum index,
7952 one less than the size. */
7953 if (TREE_CODE (initial_value
) == STRING_CST
)
7956 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
7957 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
7960 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
7962 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
7963 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
7964 for (; elts
; elts
= TREE_CHAIN (elts
))
7966 if (TREE_PURPOSE (elts
))
7967 maxindex
= TREE_PURPOSE (elts
);
7969 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
7971 maxindex
= copy_node (maxindex
);
7975 /* Make an error message unless that happened already. */
7976 if (initial_value
!= error_mark_node
)
7979 /* Prevent further error messages. */
7980 maxindex
= build_int_2 (0, 0);
7987 maxindex
= build_int_2 (0, 0);
7995 TYPE_DOMAIN (type
) = build_index_type (maxindex
);
7996 if (! TREE_TYPE (maxindex
))
7997 TREE_TYPE (maxindex
) = TYPE_DOMAIN (type
);
7999 itype
= TREE_TYPE (initial_value
);
8002 if (itype
&& !TYPE_DOMAIN (itype
))
8003 TYPE_DOMAIN (itype
) = TYPE_DOMAIN (type
);
8004 /* The type of the main variant should never be used for arrays
8005 of different sizes. It should only ever be completed with the
8006 size of the array. */
8007 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8008 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = TYPE_DOMAIN (type
);
8011 /* Lay out the type now that we can get the real answer. */
8018 /* Return zero if something is declared to be a member of type
8019 CTYPE when in the context of CUR_TYPE. STRING is the error
8020 message to print in that case. Otherwise, quietly return 1. */
8023 member_function_or_else (ctype
, cur_type
, string
)
8024 tree ctype
, cur_type
;
8027 if (ctype
&& ctype
!= cur_type
)
8029 error (string
, TYPE_NAME_STRING (ctype
));
8035 /* Subroutine of `grokdeclarator'. */
8037 /* Generate errors possibly applicable for a given set of specifiers.
8038 This is for ARM $7.1.2. */
8041 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8044 int virtualp
, quals
, friendp
, raises
, inlinep
;
8047 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8049 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8051 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8054 cp_error_at ("invalid friend declaration", object
);
8056 cp_error_at ("invalid exception specifications", object
);
8059 /* CTYPE is class type, or null if non-class.
8060 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8062 DECLARATOR is the function's name.
8063 VIRTUALP is truthvalue of whether the function is virtual or not.
8064 FLAGS are to be passed through to `grokclassfn'.
8065 QUALS are qualifiers indicating whether the function is `const'
8067 RAISES is a list of exceptions that this function can raise.
8068 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8069 not look, and -1 if we should not call `grokclassfn' at all.
8071 Returns `error_mark_node' if something goes wrong, after issuing
8072 applicable error messages. */
8075 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8076 raises
, attrlist
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8077 template_count
, in_namespace
)
8080 tree orig_declarator
;
8082 enum overload_flags flags
;
8083 tree quals
, raises
, attrlist
;
8084 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8088 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8092 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8093 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8099 type
= build_exception_variant (type
, raises
);
8102 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8103 /* Propagate volatile out from type to decl. */
8104 if (TYPE_VOLATILE (type
))
8105 TREE_THIS_VOLATILE (decl
) = 1;
8107 /* If this decl has namespace scope, set that up. */
8109 set_decl_namespace (decl
, in_namespace
);
8110 else if (publicp
&& ! ctype
)
8111 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8113 /* `main' and builtins have implicit 'C' linkage. */
8114 if ((MAIN_NAME_P (declarator
)
8115 || (IDENTIFIER_LENGTH (declarator
) > 10
8116 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8117 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8118 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8119 && current_lang_name
== lang_name_cplusplus
8120 && ctype
== NULL_TREE
8121 /* NULL_TREE means global namespace. */
8122 && DECL_CONTEXT (decl
) == NULL_TREE
)
8123 DECL_LANGUAGE (decl
) = lang_c
;
8125 /* Should probably propagate const out from type to decl I bet (mrs). */
8128 DECL_STATIC_FUNCTION_P (decl
) = 1;
8129 DECL_CONTEXT (decl
) = ctype
;
8133 DECL_CLASS_CONTEXT (decl
) = ctype
;
8135 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8137 if (processing_template_decl
)
8138 error ("cannot declare `main' to be a template");
8140 error ("cannot declare `main' to be inline");
8142 error ("cannot declare `main' to be static");
8147 /* Members of anonymous types and local classes have no linkage; make
8149 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8150 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8155 /* [basic.link]: A name with no linkage (notably, the name of a class
8156 or enumeration declared in a local scope) shall not be used to
8157 declare an entity with linkage.
8159 Only check this for public decls for now. */
8160 t
= no_linkage_check (TREE_TYPE (decl
));
8163 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8165 if (DECL_LANGUAGE (decl
) == lang_c
)
8166 /* Allow this; it's pretty common in C. */;
8168 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8172 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8177 TREE_PUBLIC (decl
) = publicp
;
8180 DECL_INTERFACE_KNOWN (decl
) = 1;
8181 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8185 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8187 DECL_EXTERNAL (decl
) = 1;
8188 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8190 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8191 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8195 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8196 grok_op_properties (decl
, virtualp
, check
< 0);
8198 if (ctype
&& hack_decl_function_context (decl
))
8199 DECL_NO_STATIC_CHAIN (decl
) = 1;
8201 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8202 if (TREE_PURPOSE (t
)
8203 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8205 add_defarg_fn (decl
);
8210 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8214 ("defining explicit specialization `%D' in friend declaration",
8218 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8220 /* Something like `template <class T> friend void f<T>()'. */
8221 cp_error ("template-id `%D' in declaration of primary template",
8223 return error_mark_node
;
8226 /* A friend declaration of the form friend void f<>(). Record
8227 the information in the TEMPLATE_ID_EXPR. */
8228 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8229 DECL_TEMPLATE_INFO (decl
)
8230 = perm_tree_cons (TREE_OPERAND (orig_declarator
, 0),
8231 TREE_OPERAND (orig_declarator
, 1),
8236 /* Plain overloading: will not be grok'd by grokclassfn. */
8237 if (! ctype
&& ! processing_template_decl
8238 && DECL_LANGUAGE (decl
) != lang_c
8239 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8240 set_mangled_name_for_decl (decl
);
8243 /* Make the init_value nonzero so pushdecl knows this is not
8244 tentative. error_mark_node is replaced later with the BLOCK. */
8245 DECL_INITIAL (decl
) = error_mark_node
;
8247 /* Caller will do the rest of this. */
8251 if (check
&& funcdef_flag
)
8252 DECL_INITIAL (decl
) = error_mark_node
;
8254 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8257 /* Just handle constructors here. We could do this
8258 inside the following if stmt, but I think
8259 that the code is more legible by breaking this
8260 case out. See comments below for what each of
8261 the following calls is supposed to do. */
8262 DECL_CONSTRUCTOR_P (decl
) = 1;
8264 grokclassfn (ctype
, decl
, flags
, quals
);
8266 decl
= check_explicit_specialization (orig_declarator
, decl
,
8268 2 * (funcdef_flag
!= 0) +
8269 4 * (friendp
!= 0));
8270 if (decl
== error_mark_node
)
8271 return error_mark_node
;
8273 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8276 tmp
= check_classfn (ctype
, decl
);
8278 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8279 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8281 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8282 cp_error ("definition of implicitly-declared `%D'", tmp
);
8283 if (tmp
&& duplicate_decls (decl
, tmp
))
8286 if (! grok_ctor_properties (ctype
, decl
))
8287 return error_mark_node
;
8293 /* Function gets the ugly name, field gets the nice one.
8294 This call may change the type of the function (because
8295 of default parameters)! */
8296 if (ctype
!= NULL_TREE
)
8297 grokclassfn (ctype
, decl
, flags
, quals
);
8299 decl
= check_explicit_specialization (orig_declarator
, decl
,
8301 2 * (funcdef_flag
!= 0) +
8302 4 * (friendp
!= 0));
8303 if (decl
== error_mark_node
)
8304 return error_mark_node
;
8306 if (ctype
!= NULL_TREE
8307 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8310 tmp
= check_classfn (ctype
, decl
);
8312 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8313 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8315 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8316 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8318 /* Remove the `this' parm added by grokclassfn.
8319 XXX Isn't this done in start_function, too? */
8320 revert_static_member_fn (&decl
, NULL
, NULL
);
8321 last_function_parms
= TREE_CHAIN (last_function_parms
);
8323 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8324 cp_error ("definition of implicitly-declared `%D'", tmp
);
8327 if (!duplicate_decls (decl
, tmp
))
8328 my_friendly_abort (892);
8333 if (ctype
== NULL_TREE
|| check
)
8337 cplus_decl_attributes (decl
, TREE_PURPOSE (attrlist
),
8338 TREE_VALUE (attrlist
));
8339 make_decl_rtl (decl
, NULL_PTR
, 1);
8343 DECL_VIRTUAL_P (decl
) = 1;
8344 if (DECL_VINDEX (decl
) == NULL_TREE
)
8345 DECL_VINDEX (decl
) = error_mark_node
;
8346 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8353 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8356 RID_BIT_TYPE
*specbits_in
;
8362 RID_BIT_TYPE specbits
;
8364 specbits
= *specbits_in
;
8366 if (TREE_CODE (type
) == OFFSET_TYPE
)
8368 /* If you declare a static member so that it
8369 can be initialized, the code will reach here. */
8370 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8371 type
= TREE_TYPE (type
);
8372 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
8373 DECL_CONTEXT (decl
) = basetype
;
8374 DECL_CLASS_CONTEXT (decl
) = basetype
;
8375 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8382 context
= in_namespace
;
8383 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8384 context
= current_namespace
;
8386 context
= NULL_TREE
;
8388 decl
= build_decl (VAR_DECL
, declarator
, complete_type (type
));
8391 set_decl_namespace (decl
, context
);
8393 context
= DECL_CONTEXT (decl
);
8394 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8395 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8399 set_decl_namespace (decl
, in_namespace
);
8401 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8403 DECL_THIS_EXTERN (decl
) = 1;
8404 DECL_EXTERNAL (decl
) = !initialized
;
8407 /* In class context, static means one per class,
8408 public access, and static storage. */
8409 if (DECL_CLASS_SCOPE_P (decl
))
8411 TREE_PUBLIC (decl
) = 1;
8412 TREE_STATIC (decl
) = 1;
8413 DECL_EXTERNAL (decl
) = 0;
8415 /* At top level, either `static' or no s.c. makes a definition
8416 (perhaps tentative), and absence of `static' makes it public. */
8417 else if (toplevel_bindings_p ())
8419 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8420 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8421 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8423 /* Not at top level, only `static' makes a static definition. */
8426 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8427 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8430 if (TREE_PUBLIC (decl
))
8432 /* [basic.link]: A name with no linkage (notably, the name of a class
8433 or enumeration declared in a local scope) shall not be used to
8434 declare an entity with linkage.
8436 Only check this for public decls for now. */
8437 tree t
= no_linkage_check (TREE_TYPE (decl
));
8440 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8441 /* Ignore for now; `enum { foo } e' is pretty common. */;
8443 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8451 /* Create a canonical pointer to member function type. */
8454 build_ptrmemfunc_type (type
)
8461 /* If a canonical type already exists for this type, use it. We use
8462 this method instead of type_hash_canon, because it only does a
8463 simple equality check on the list of field members. */
8465 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8468 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8470 u
= make_lang_type (UNION_TYPE
);
8471 SET_IS_AGGR_TYPE (u
, 0);
8472 fields
[0] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
, type
);
8473 fields
[1] = build_lang_field_decl (FIELD_DECL
, delta2_identifier
,
8475 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8476 TYPE_NAME (u
) = NULL_TREE
;
8478 t
= make_lang_type (RECORD_TYPE
);
8480 /* Let the front-end know this is a pointer to member function... */
8481 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8482 /* ... and not really an aggregate. */
8483 SET_IS_AGGR_TYPE (t
, 0);
8485 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
8487 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
8489 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8490 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8494 /* Zap out the name so that the back-end will give us the debugging
8495 information for this anonymous RECORD_TYPE. */
8496 TYPE_NAME (t
) = NULL_TREE
;
8498 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8500 /* Seems to be wanted. */
8501 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8505 /* Given declspecs and a declarator,
8506 determine the name and type of the object declared
8507 and construct a ..._DECL node for it.
8508 (In one case we can return a ..._TYPE node instead.
8509 For invalid input we sometimes return 0.)
8511 DECLSPECS is a chain of tree_list nodes whose value fields
8512 are the storage classes and type specifiers.
8514 DECL_CONTEXT says which syntactic context this declaration is in:
8515 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8516 FUNCDEF for a function definition. Like NORMAL but a few different
8517 error messages in each case. Return value may be zero meaning
8518 this definition is too screwy to try to parse.
8519 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8520 handle member functions (which have FIELD context).
8521 Return value may be zero meaning this definition is too screwy to
8523 PARM for a parameter declaration (either within a function prototype
8524 or before a function body). Make a PARM_DECL, or return void_type_node.
8525 CATCHPARM for a parameter declaration before a catch clause.
8526 TYPENAME if for a typename (in a cast or sizeof).
8527 Don't make a DECL node; just return the ..._TYPE node.
8528 FIELD for a struct or union field; make a FIELD_DECL.
8529 BITFIELD for a field with specified width.
8530 INITIALIZED is 1 if the decl has an initializer.
8532 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8533 It may also be so in the PARM case, for a prototype where the
8534 argument type is specified but not the name.
8536 This function is where the complicated C meanings of `static'
8537 and `extern' are interpreted.
8539 For C++, if there is any monkey business to do, the function which
8540 calls this one must do it, i.e., prepending instance variables,
8541 renaming overloaded function names, etc.
8543 Note that for this C++, it is an error to define a method within a class
8544 which does not belong to that class.
8546 Except in the case where SCOPE_REFs are implicitly known (such as
8547 methods within a class being redundantly qualified),
8548 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8549 (class_name::decl_name). The caller must also deal with this.
8551 If a constructor or destructor is seen, and the context is FIELD,
8552 then the type gains the attribute TREE_HAS_x. If such a declaration
8553 is erroneous, NULL_TREE is returned.
8555 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8556 function, these are the qualifiers to give to the `this' pointer.
8558 May return void_type_node if the declarator turned out to be a friend.
8559 See grokfield for details. */
8561 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8563 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8564 Check to see that the definition is valid. Issue appropriate error
8565 messages. Return 1 if the definition is particularly bad, or 0
8569 check_static_variable_definition (decl
, type
)
8573 /* Motion 10 at San Diego: If a static const integral data member is
8574 initialized with an integral constant expression, the initializer
8575 may appear either in the declaration (within the class), or in
8576 the definition, but not both. If it appears in the class, the
8577 member is a member constant. The file-scope definition is always
8579 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8581 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8583 /* If we just return the declaration, crashes will sometimes
8584 occur. We therefore return void_type_node, as if this was a
8585 friend declaration, to cause callers to completely ignore
8586 this declaration. */
8589 else if (!CP_TYPE_CONST_P (type
))
8590 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8592 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8593 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8599 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8602 enum decl_context decl_context
;
8606 RID_BIT_TYPE specbits
;
8609 tree type
= NULL_TREE
;
8615 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8616 int explicit_int
= 0;
8617 int explicit_char
= 0;
8618 int defaulted_int
= 0;
8619 int opaque_typedef
= 0;
8620 tree typedef_decl
= NULL_TREE
;
8622 tree typedef_type
= NULL_TREE
;
8623 int funcdef_flag
= 0;
8624 enum tree_code innermost_code
= ERROR_MARK
;
8627 /* See the code below that used this. */
8628 tree decl_machine_attr
= NULL_TREE
;
8630 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8631 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8632 tree init
= NULL_TREE
;
8634 /* Keep track of what sort of function is being processed
8635 so that we can warn about default return values, or explicit
8636 return values which do not match prescribed defaults. */
8637 enum return_types return_type
= return_normal
;
8639 tree dname
= NULL_TREE
;
8640 tree ctype
= current_class_type
;
8641 tree ctor_return_type
= NULL_TREE
;
8642 enum overload_flags flags
= NO_SPECIAL
;
8643 tree quals
= NULL_TREE
;
8644 tree raises
= NULL_TREE
;
8645 int template_count
= 0;
8646 tree in_namespace
= NULL_TREE
;
8650 RIDBIT_RESET_ALL (specbits
);
8651 if (decl_context
== FUNCDEF
)
8652 funcdef_flag
= 1, decl_context
= NORMAL
;
8653 else if (decl_context
== MEMFUNCDEF
)
8654 funcdef_flag
= -1, decl_context
= FIELD
;
8655 else if (decl_context
== BITFIELD
)
8656 bitfield
= 1, decl_context
= FIELD
;
8658 /* Look inside a declarator for the name being declared
8659 and get it as a string, for an error message. */
8661 tree
*next
= &declarator
;
8665 while (next
&& *next
)
8668 switch (TREE_CODE (decl
))
8671 /* For attributes. */
8672 next
= &TREE_VALUE (decl
);
8677 next
= &TREE_OPERAND (decl
, 0);
8680 case BIT_NOT_EXPR
: /* For C++ destructors! */
8682 tree name
= TREE_OPERAND (decl
, 0);
8683 tree rename
= NULL_TREE
;
8685 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8687 return_type
= return_dtor
;
8688 if (TREE_CODE (name
) == TYPE_DECL
)
8689 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8690 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8691 if (ctype
== NULL_TREE
)
8693 if (current_class_type
== NULL_TREE
)
8695 error ("destructors must be member functions");
8700 tree t
= constructor_name (current_class_name
);
8707 tree t
= constructor_name (ctype
);
8714 cp_error ("destructor `%T' must match class name `%T'",
8716 TREE_OPERAND (decl
, 0) = rename
;
8722 case ADDR_EXPR
: /* C++ reference declaration */
8727 innermost_code
= TREE_CODE (decl
);
8728 next
= &TREE_OPERAND (decl
, 0);
8732 if (parmlist_is_exprlist (TREE_OPERAND (decl
, 1)))
8734 /* This is actually a variable declaration using constructor
8735 syntax. We need to call start_decl and cp_finish_decl so we
8736 can get the variable initialized... */
8738 *next
= TREE_OPERAND (decl
, 0);
8739 init
= TREE_OPERAND (decl
, 1);
8741 decl
= start_decl (declarator
, declspecs
, 1, NULL_TREE
, NULL_TREE
);
8744 /* Look for __unused__ attribute */
8745 if (TREE_USED (TREE_TYPE (decl
)))
8746 TREE_USED (decl
) = 1;
8747 finish_decl (decl
, init
, NULL_TREE
);
8750 cp_error ("invalid declarator");
8753 innermost_code
= TREE_CODE (decl
);
8754 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8755 ctype
= current_class_type
;
8757 && TREE_OPERAND (decl
, 0)
8758 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8759 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8760 == constructor_name_full (ctype
))
8761 || (DECL_NAME (TREE_OPERAND (decl
, 0))
8762 == constructor_name (ctype
)))))
8763 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8764 next
= &TREE_OPERAND (decl
, 0);
8766 if (ctype
!= NULL_TREE
8767 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
8768 && decl
== constructor_name (ctype
))
8770 return_type
= return_ctor
;
8771 ctor_return_type
= ctype
;
8776 case TEMPLATE_ID_EXPR
:
8778 tree fns
= TREE_OPERAND (decl
, 0);
8780 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
8781 fns
= TREE_OPERAND (fns
, 0);
8783 if (TREE_CODE (fns
) == IDENTIFIER_NODE
)
8785 else if (is_overloaded_fn (fns
))
8786 dname
= DECL_NAME (get_first_fn (fns
));
8788 my_friendly_abort (0);
8792 case IDENTIFIER_NODE
:
8793 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
8800 cp_error ("declarator-id missing; using reserved word `%D'",
8802 name
= IDENTIFIER_POINTER (dname
);
8804 if (! IDENTIFIER_OPNAME_P (dname
)
8805 /* GNU/Linux headers use '__op'. Arrgh. */
8806 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
8807 name
= IDENTIFIER_POINTER (dname
);
8810 if (IDENTIFIER_TYPENAME_P (dname
))
8812 my_friendly_assert (flags
== NO_SPECIAL
, 154);
8813 flags
= TYPENAME_FLAG
;
8814 ctor_return_type
= TREE_TYPE (dname
);
8815 return_type
= return_conversion
;
8817 name
= operator_name_string (dname
);
8824 /* Perform error checking, and decide on a ctype. */
8825 tree cname
= TREE_OPERAND (decl
, 0);
8826 if (cname
== NULL_TREE
)
8828 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
8831 in_namespace
= TREE_OPERAND (decl
, 0);
8832 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8834 else if (! is_aggr_type (cname
, 1))
8835 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8836 /* Must test TREE_OPERAND (decl, 1), in case user gives
8837 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
8838 else if (TREE_OPERAND (decl
, 1)
8839 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
8841 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
8842 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
8844 cp_error ("`%T::%D' is not a valid declarator", cname
,
8845 TREE_OPERAND (decl
, 1));
8846 cp_error (" perhaps you want `typename %T::%D' to make it a type",
8847 cname
, TREE_OPERAND (decl
, 1));
8848 return void_type_node
;
8850 else if (ctype
== NULL_TREE
)
8852 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
8853 TREE_OPERAND (decl
, 0) = ctype
;
8856 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
8858 cp_error ("type `%T' is not derived from type `%T'",
8860 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8866 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
8867 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
8868 == constructor_name_full (ctype
))
8869 || (DECL_NAME (TREE_OPERAND (decl
, 1))
8870 == constructor_name (ctype
))))
8871 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
8872 next
= &TREE_OPERAND (decl
, 1);
8876 if (TREE_CODE (decl
) == IDENTIFIER_NODE
8877 && constructor_name (ctype
) == decl
)
8879 return_type
= return_ctor
;
8880 ctor_return_type
= ctype
;
8882 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
8883 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
8884 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
8885 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
8887 return_type
= return_dtor
;
8888 ctor_return_type
= ctype
;
8890 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8891 next
= &TREE_OPERAND (decl
, 0);
8902 /* Parse error puts this typespec where
8903 a declarator should go. */
8904 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
8905 if (TREE_TYPE (decl
) == current_class_type
)
8906 cp_error (" perhaps you want `%T' for a constructor",
8907 current_class_name
);
8908 dname
= DECL_NAME (decl
);
8909 name
= IDENTIFIER_POINTER (dname
);
8911 /* Avoid giving two errors for this. */
8912 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
8914 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
8921 cp_compiler_error ("`%D' as declarator", decl
);
8922 return 0; /* We used to do a 155 abort here. */
8929 /* A function definition's declarator must have the form of
8930 a function declarator. */
8932 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
8935 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
8936 && innermost_code
!= CALL_EXPR
8937 && ! (ctype
&& declspecs
== NULL_TREE
))
8939 cp_error ("declaration of `%D' as non-function", dname
);
8940 return void_type_node
;
8943 /* Anything declared one level down from the top level
8944 must be one of the parameters of a function
8945 (because the body is at least two levels down). */
8947 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
8948 by not allowing C++ class definitions to specify their parameters
8949 with xdecls (must be spec.d in the parmlist).
8951 Since we now wait to push a class scope until we are sure that
8952 we are in a legitimate method context, we must set oldcname
8953 explicitly (since current_class_name is not yet alive).
8955 We also want to avoid calling this a PARM if it is in a namespace. */
8957 if (decl_context
== NORMAL
&& ! namespace_bindings_p ()
8958 && ! pseudo_global_level_p ())
8960 struct binding_level
*b
= current_binding_level
;
8961 current_binding_level
= b
->level_chain
;
8962 if (current_binding_level
!= 0 && toplevel_bindings_p ())
8963 decl_context
= PARM
;
8964 current_binding_level
= b
;
8967 /* Look through the decl specs and record which ones appear.
8968 Some typespecs are defined as built-in typenames.
8969 Others, the ones that are modifiers of other types,
8970 are represented by bits in SPECBITS: set the bits for
8971 the modifiers that appear. Storage class keywords are also in SPECBITS.
8973 If there is a typedef name or a type, store the type in TYPE.
8974 This includes builtin typedefs such as `int'.
8976 Set EXPLICIT_INT if the type is `int' or `char' and did not
8977 come from a user typedef.
8979 Set LONGLONG if `long' is mentioned twice.
8981 For C++, constructors and destructors have their own fast treatment. */
8983 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
8988 /* Certain parse errors slip through. For example,
8989 `int class;' is not caught by the parser. Try
8990 weakly to recover here. */
8991 if (TREE_CODE (spec
) != TREE_LIST
)
8994 id
= TREE_VALUE (spec
);
8996 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
8998 if (id
== ridpointers
[(int) RID_INT
]
8999 || id
== ridpointers
[(int) RID_CHAR
]
9000 || id
== ridpointers
[(int) RID_BOOL
]
9001 || id
== ridpointers
[(int) RID_WCHAR
])
9005 if (id
== ridpointers
[(int) RID_BOOL
])
9006 error ("`bool' is now a keyword");
9008 cp_error ("extraneous `%T' ignored", id
);
9012 if (id
== ridpointers
[(int) RID_INT
])
9014 else if (id
== ridpointers
[(int) RID_CHAR
])
9016 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9020 /* C++ aggregate types. */
9021 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9024 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9026 type
= IDENTIFIER_TYPE_VALUE (id
);
9030 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9032 if (ridpointers
[i
] == id
)
9034 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9036 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9037 pedwarn ("ANSI C++ does not support `long long'");
9039 error ("`long long long' is too long for GCC");
9043 else if (RIDBIT_SETP (i
, specbits
))
9044 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9045 RIDBIT_SET (i
, specbits
);
9050 /* C++ aggregate types. */
9051 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9054 cp_error ("multiple declarations `%T' and `%T'", type
,
9058 type
= TREE_TYPE (id
);
9059 TREE_VALUE (spec
) = type
;
9064 error ("two or more data types in declaration of `%s'", name
);
9065 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9067 register tree t
= lookup_name (id
, 1);
9068 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9069 error ("`%s' fails to be a typedef or built in type",
9070 IDENTIFIER_POINTER (id
));
9073 type
= TREE_TYPE (t
);
9075 /* See the code below that used this. */
9076 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9081 else if (id
!= error_mark_node
)
9082 /* Can't change CLASS nodes into RECORD nodes here! */
9088 typedef_type
= type
;
9090 /* No type at all: default to `int', and set DEFAULTED_INT
9091 because it was not a user-defined typedef.
9092 Except when we have a `typedef' inside a signature, in
9093 which case the type defaults to `unknown type' and is
9094 instantiated when assigning to a signature pointer or ref. */
9096 if (type
== NULL_TREE
9097 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9098 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9099 || RIDBIT_SETP (RID_LONG
, specbits
)
9100 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9102 /* These imply 'int'. */
9103 type
= integer_type_node
;
9107 if (type
== NULL_TREE
)
9110 if (return_type
== return_dtor
)
9111 type
= void_type_node
;
9112 else if (return_type
== return_ctor
)
9113 type
= build_pointer_type (ctor_return_type
);
9114 else if (return_type
== return_conversion
)
9115 type
= ctor_return_type
;
9116 else if (current_class_type
9117 && IS_SIGNATURE (current_class_type
)
9118 && RIDBIT_SETP (RID_TYPEDEF
, specbits
)
9119 && (decl_context
== FIELD
|| decl_context
== NORMAL
))
9123 type
= copy_node (opaque_type_node
);
9129 if (warn_return_type
9130 && return_type
== return_normal
)
9131 /* Save warning until we know what is really going on. */
9132 warn_about_return_type
= 1;
9134 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9135 pedwarn ("ANSI C++ forbids typedef which does not specify a type");
9136 else if (innermost_code
!= CALL_EXPR
|| pedantic
9137 || (warn_return_type
&& return_type
== return_normal
))
9139 if (innermost_code
== CALL_EXPR
)
9140 cp_pedwarn ("return-type of `%D' defaults to `int'", dname
);
9142 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9145 type
= integer_type_node
;
9148 else if (return_type
== return_dtor
)
9150 error ("return type specification for destructor invalid");
9151 type
= void_type_node
;
9153 else if (return_type
== return_ctor
)
9155 error ("return type specification for constructor invalid");
9156 type
= build_pointer_type (ctor_return_type
);
9158 else if (return_type
== return_conversion
)
9160 if (!same_type_p (type
, ctor_return_type
))
9161 cp_error ("operator `%T' declared to return `%T'",
9162 ctor_return_type
, type
);
9164 cp_pedwarn ("return type specified for `operator %T'",
9167 type
= ctor_return_type
;
9172 /* Now process the modifiers that were specified
9173 and check for invalid combinations. */
9175 /* Long double is a special combination. */
9177 if (RIDBIT_SETP (RID_LONG
, specbits
)
9178 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9180 RIDBIT_RESET (RID_LONG
, specbits
);
9181 type
= build_qualified_type (long_double_type_node
,
9182 CP_TYPE_QUALS (type
));
9185 /* Check all other uses of type modifiers. */
9187 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9188 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9189 || RIDBIT_SETP (RID_LONG
, specbits
)
9190 || RIDBIT_SETP (RID_SHORT
, specbits
))
9194 if (TREE_CODE (type
) == REAL_TYPE
)
9195 error ("short, signed or unsigned invalid for `%s'", name
);
9196 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9197 error ("long, short, signed or unsigned invalid for `%s'", name
);
9198 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9199 && RIDBIT_SETP (RID_SHORT
, specbits
))
9200 error ("long and short specified together for `%s'", name
);
9201 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9202 || RIDBIT_SETP (RID_SHORT
, specbits
))
9204 error ("long or short specified with char for `%s'", name
);
9205 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9206 || RIDBIT_SETP (RID_SHORT
, specbits
))
9207 && TREE_CODE (type
) == REAL_TYPE
)
9208 error ("long or short specified with floating type for `%s'", name
);
9209 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9210 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9211 error ("signed and unsigned given together for `%s'", name
);
9215 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9217 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9219 if (flag_pedantic_errors
)
9224 /* Discard the type modifiers if they are invalid. */
9227 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9228 RIDBIT_RESET (RID_SIGNED
, specbits
);
9229 RIDBIT_RESET (RID_LONG
, specbits
);
9230 RIDBIT_RESET (RID_SHORT
, specbits
);
9235 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9236 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9238 error ("complex invalid for `%s'", name
);
9239 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9242 /* Decide whether an integer type is signed or not.
9243 Optionally treat bitfields as signed by default. */
9244 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9245 || (bitfield
&& ! flag_signed_bitfields
9246 && (explicit_int
|| defaulted_int
|| explicit_char
9247 /* A typedef for plain `int' without `signed'
9248 can be controlled just like plain `int'. */
9249 || ! (typedef_decl
!= NULL_TREE
9250 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
9251 && TREE_CODE (type
) != ENUMERAL_TYPE
9252 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)))
9255 type
= long_long_unsigned_type_node
;
9256 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9257 type
= long_unsigned_type_node
;
9258 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9259 type
= short_unsigned_type_node
;
9260 else if (type
== char_type_node
)
9261 type
= unsigned_char_type_node
;
9262 else if (typedef_decl
)
9263 type
= unsigned_type (type
);
9265 type
= unsigned_type_node
;
9267 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9268 && type
== char_type_node
)
9269 type
= signed_char_type_node
;
9271 type
= long_long_integer_type_node
;
9272 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9273 type
= long_integer_type_node
;
9274 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9275 type
= short_integer_type_node
;
9277 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9279 /* If we just have "complex", it is equivalent to
9280 "complex double", but if any modifiers at all are specified it is
9281 the complex form of TYPE. E.g, "complex short" is
9282 "complex short int". */
9284 if (defaulted_int
&& ! longlong
9285 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9286 || RIDBIT_SETP (RID_SHORT
, specbits
)
9287 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9288 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9289 type
= complex_double_type_node
;
9290 else if (type
== integer_type_node
)
9291 type
= complex_integer_type_node
;
9292 else if (type
== float_type_node
)
9293 type
= complex_float_type_node
;
9294 else if (type
== double_type_node
)
9295 type
= complex_double_type_node
;
9296 else if (type
== long_double_type_node
)
9297 type
= complex_long_double_type_node
;
9299 type
= build_complex_type (type
);
9302 if (return_type
== return_conversion
9303 && (RIDBIT_SETP (RID_CONST
, specbits
)
9304 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9305 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9306 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9309 /* Set CONSTP if this declaration is `const', whether by
9310 explicit specification or via a typedef.
9311 Likewise for VOLATILEP. */
9313 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9315 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9317 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9318 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9319 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9320 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9321 type
= cp_build_qualified_type (type
, type_quals
);
9323 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9324 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9325 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9326 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9327 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9329 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9330 staticp
= 1 + (decl_context
== FIELD
);
9332 if (virtualp
&& staticp
== 2)
9334 cp_error ("member `%D' cannot be declared both virtual and static",
9338 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9339 RIDBIT_RESET (RID_FRIEND
, specbits
);
9341 /* $7.1.2, Function specifiers */
9342 if (friendp
&& explicitp
)
9343 error ("only declarations of constructors can be `explicit'");
9345 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9347 if (decl_context
== PARM
)
9349 error ("non-member `%s' cannot be declared `mutable'", name
);
9350 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9352 else if (friendp
|| decl_context
== TYPENAME
)
9354 error ("non-object member `%s' cannot be declared `mutable'", name
);
9355 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9359 /* Warn if two storage classes are given. Default to `auto'. */
9361 if (RIDBIT_ANY_SET (specbits
))
9363 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9364 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9365 if (decl_context
== PARM
&& nclasses
> 0)
9366 error ("storage class specifiers invalid in parameter declarations");
9367 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9369 if (decl_context
== PARM
)
9370 error ("typedef declaration invalid in parameter declaration");
9373 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9374 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9377 /* Give error if `virtual' is used outside of class declaration. */
9379 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9381 error ("virtual outside class declaration");
9384 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9386 error ("only members can be declared mutable");
9387 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9390 /* Static anonymous unions are dealt with here. */
9391 if (staticp
&& decl_context
== TYPENAME
9392 && TREE_CODE (declspecs
) == TREE_LIST
9393 && ANON_UNION_TYPE_P (TREE_VALUE (declspecs
)))
9394 decl_context
= FIELD
;
9396 /* Give error if `const,' `volatile,' `inline,' `friend,' or `virtual'
9397 is used in a signature member function declaration. */
9398 if (decl_context
== FIELD
9399 && IS_SIGNATURE (current_class_type
)
9400 && RIDBIT_NOTSETP (RID_TYPEDEF
, specbits
))
9402 if (type_quals
!= TYPE_UNQUALIFIED
)
9404 error ("type qualifiers specified for signature member function `%s'", name
);
9405 type_quals
= TYPE_UNQUALIFIED
;
9409 error ("`inline' specified for signature member function `%s'", name
);
9410 /* Later, we'll make signature member functions inline. */
9415 error ("`friend' declaration in signature definition");
9420 error ("`virtual' specified for signature member function `%s'",
9422 /* Later, we'll make signature member functions virtual. */
9427 /* Warn about storage classes that are invalid for certain
9428 kinds of declarations (parameters, typenames, etc.). */
9431 error ("multiple storage classes in declaration of `%s'", name
);
9432 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9434 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9435 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9436 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9438 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9440 else if (decl_context
== FIELD
9441 && ! IS_SIGNATURE (current_class_type
)
9442 /* C++ allows static class elements */
9443 && RIDBIT_SETP (RID_STATIC
, specbits
))
9444 /* C++ also allows inlines and signed and unsigned elements,
9445 but in those cases we don't come in here. */
9449 if (decl_context
== FIELD
)
9451 tree tmp
= NULL_TREE
;
9452 register int op
= 0;
9456 /* Avoid trying to get an operand off an identifier node. */
9457 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9460 tmp
= TREE_OPERAND (declarator
, 0);
9461 op
= IDENTIFIER_OPNAME_P (tmp
);
9463 error ("storage class specified for %s `%s'",
9464 IS_SIGNATURE (current_class_type
)
9466 ? "signature member operator"
9467 : "signature member function")
9468 : (op
? "member operator" : "field"),
9469 op
? operator_name_string (tmp
) : name
);
9472 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9473 ? "storage class specified for parameter `%s'"
9474 : "storage class specified for typename"), name
);
9475 RIDBIT_RESET (RID_REGISTER
, specbits
);
9476 RIDBIT_RESET (RID_AUTO
, specbits
);
9477 RIDBIT_RESET (RID_EXTERN
, specbits
);
9479 if (decl_context
== FIELD
&& IS_SIGNATURE (current_class_type
))
9481 RIDBIT_RESET (RID_STATIC
, specbits
);
9486 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9488 if (toplevel_bindings_p ())
9490 /* It's common practice (and completely valid) to have a const
9491 be initialized and declared extern. */
9492 if (!(type_quals
& TYPE_QUAL_CONST
))
9493 warning ("`%s' initialized and declared `extern'", name
);
9496 error ("`%s' has both `extern' and initializer", name
);
9498 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9499 && ! toplevel_bindings_p ())
9500 error ("nested function `%s' declared `extern'", name
);
9501 else if (toplevel_bindings_p ())
9503 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9504 error ("top-level declaration of `%s' specifies `auto'", name
);
9507 if (nclasses
> 0 && friendp
)
9508 error ("storage class specifiers invalid in friend function declarations");
9510 /* Now figure out the structure of the declarator proper.
9511 Descend through it, creating more complex types, until we reach
9512 the declared identifier (or NULL_TREE, in an absolute declarator). */
9514 inner_attrs
= NULL_TREE
;
9517 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9518 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9520 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9521 an INDIRECT_REF (for *...),
9522 a CALL_EXPR (for ...(...)),
9523 an identifier (for the name being declared)
9524 or a null pointer (for the place in an absolute declarator
9525 where the name was omitted).
9526 For the last two cases, we have just exited the loop.
9528 For C++ it could also be
9529 a SCOPE_REF (for class :: ...). In this case, we have converted
9530 sensible names to types, and those are the values we use to
9531 qualify the member name.
9532 an ADDR_EXPR (for &...),
9533 a BIT_NOT_EXPR (for destructors)
9535 At this point, TYPE is the type of elements of an array,
9536 or for a function to return, or for a pointer to point to.
9537 After this sequence of ifs, TYPE is the type of the
9538 array or function or pointer, and DECLARATOR has had its
9539 outermost layer removed. */
9541 if (type
== error_mark_node
)
9543 if (TREE_CODE (declarator
) == SCOPE_REF
)
9544 declarator
= TREE_OPERAND (declarator
, 1);
9546 declarator
= TREE_OPERAND (declarator
, 0);
9549 if (quals
!= NULL_TREE
9550 && (declarator
== NULL_TREE
9551 || TREE_CODE (declarator
) != SCOPE_REF
))
9553 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9554 ctype
= TYPE_METHOD_BASETYPE (type
);
9555 if (ctype
!= NULL_TREE
)
9557 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9558 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9559 type
= TREE_TYPE (dummy
);
9564 /* See the comment for the TREE_LIST case, below. */
9567 else if (inner_attrs
)
9569 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9570 inner_attrs
= NULL_TREE
;
9573 switch (TREE_CODE (declarator
))
9577 /* We encode a declarator with embedded attributes using
9578 a TREE_LIST. The attributes apply to the declarator
9579 directly inside them, so we have to skip an iteration
9580 before applying them to the type. If the declarator just
9581 inside is the declarator-id, we apply the attrs to the
9583 inner_attrs
= TREE_PURPOSE (declarator
);
9585 declarator
= TREE_VALUE (declarator
);
9591 register tree itype
= NULL_TREE
;
9592 register tree size
= TREE_OPERAND (declarator
, 1);
9593 /* The index is a signed object `sizetype' bits wide. */
9594 tree index_type
= signed_type (sizetype
);
9596 declarator
= TREE_OPERAND (declarator
, 0);
9598 /* Check for some types that there cannot be arrays of. */
9600 if (TREE_CODE (type
) == VOID_TYPE
)
9602 cp_error ("declaration of `%D' as array of voids", dname
);
9603 type
= error_mark_node
;
9606 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9608 cp_error ("declaration of `%D' as array of functions", dname
);
9609 type
= error_mark_node
;
9612 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9613 you can't have arrays of references. If we allowed them,
9614 then we'd be saying x[i] is valid for an array x, but
9615 then you'd have to ask: what does `*(x + i)' mean? */
9616 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9618 if (decl_context
== TYPENAME
)
9619 cp_error ("cannot make arrays of references");
9621 cp_error ("declaration of `%D' as array of references",
9623 type
= error_mark_node
;
9626 if (TREE_CODE (type
) == OFFSET_TYPE
)
9628 cp_error ("declaration of `%D' as array of data members",
9630 type
= error_mark_node
;
9633 if (TREE_CODE (type
) == METHOD_TYPE
)
9635 cp_error ("declaration of `%D' as array of function members",
9637 type
= error_mark_node
;
9640 if (size
== error_mark_node
)
9641 type
= error_mark_node
;
9642 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9646 the constant expressions that specify the bounds of
9647 the arrays can be omitted only for the first member
9649 cp_error ("declaration of `%D' as multidimensional array",
9651 cp_error ("must have bounds for all dimensions except the first");
9652 type
= error_mark_node
;
9655 if (type
== error_mark_node
)
9660 /* Must suspend_momentary here because the index
9661 type may need to live until the end of the function.
9662 For example, it is used in the declaration of a
9663 variable which requires destructing at the end of
9664 the function; then build_vec_delete will need this
9666 int yes
= suspend_momentary ();
9667 /* Might be a cast. */
9668 if (TREE_CODE (size
) == NOP_EXPR
9669 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9670 size
= TREE_OPERAND (size
, 0);
9672 /* If this involves a template parameter, it'll be
9673 constant, but we don't know what the value is yet. */
9674 if (processing_template_decl
)
9676 /* Resolve a qualified reference to an enumerator or
9677 static const data member of ours. */
9678 if (TREE_CODE (size
) == SCOPE_REF
9679 && TREE_OPERAND (size
, 0) == current_class_type
)
9681 tree t
= lookup_field (current_class_type
,
9682 TREE_OPERAND (size
, 1), 0, 0);
9687 itype
= make_node (INTEGER_TYPE
);
9688 TYPE_MIN_VALUE (itype
) = size_zero_node
;
9689 TYPE_MAX_VALUE (itype
) = build_min
9690 (MINUS_EXPR
, sizetype
, size
, integer_one_node
);
9691 goto dont_grok_size
;
9694 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9695 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
)
9697 cp_error ("size of array `%D' has non-integer type",
9699 size
= integer_one_node
;
9701 if (TREE_READONLY_DECL_P (size
))
9702 size
= decl_constant_value (size
);
9703 if (pedantic
&& integer_zerop (size
))
9704 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9705 if (TREE_CONSTANT (size
))
9707 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9708 int old_pedantic
= pedantic
;
9709 pedantic
= flag_pedantic_errors
= 1;
9710 /* Always give overflow errors on array subscripts. */
9711 constant_expression_warning (size
);
9712 pedantic
= old_pedantic
;
9713 flag_pedantic_errors
= old_flag_pedantic_errors
;
9714 if (INT_CST_LT (size
, integer_zero_node
))
9716 cp_error ("size of array `%D' is negative", dname
);
9717 size
= integer_one_node
;
9725 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9728 cp_pedwarn ("ANSI C++ forbids variable-size array");
9733 = fold (build_binary_op (MINUS_EXPR
,
9734 cp_convert (index_type
, size
),
9735 cp_convert (index_type
,
9736 integer_one_node
), 1));
9737 if (! TREE_CONSTANT (itype
))
9738 itype
= variable_size (itype
);
9739 else if (TREE_OVERFLOW (itype
))
9741 error ("overflow in array dimension");
9742 TREE_OVERFLOW (itype
) = 0;
9745 /* If we're a parm, we need to have a permanent type so
9746 mangling checks for re-use will work right. If both the
9747 element and index types are permanent, the array type
9749 if (decl_context
== PARM
9750 && allocation_temporary_p () && TREE_PERMANENT (type
))
9752 push_obstacks (&permanent_obstack
, &permanent_obstack
);
9753 itype
= build_index_type (itype
);
9757 itype
= build_index_type (itype
);
9760 resume_momentary (yes
);
9763 type
= build_cplus_array_type (type
, itype
);
9772 tree inner_parms
= TREE_OPERAND (declarator
, 1);
9773 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9775 /* Declaring a function type.
9776 Make sure we have a valid type for the function to return. */
9778 /* We now know that the TYPE_QUALS don't apply to the
9779 decl, but to its return type. */
9780 type_quals
= TYPE_UNQUALIFIED
;
9782 /* Warn about some types functions can't return. */
9784 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9786 error ("`%s' declared as function returning a function", name
);
9787 type
= integer_type_node
;
9789 if (TREE_CODE (type
) == ARRAY_TYPE
)
9791 error ("`%s' declared as function returning an array", name
);
9792 type
= integer_type_node
;
9795 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9796 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9798 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9801 /* Pick up type qualifiers which should be applied to `this'. */
9802 quals
= TREE_OPERAND (declarator
, 2);
9804 /* Pick up the exception specifications. */
9805 raises
= TREE_TYPE (declarator
);
9807 /* Say it's a definition only for the CALL_EXPR
9808 closest to the identifier. */
9811 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9812 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9813 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9815 if (ctype
== NULL_TREE
9816 && decl_context
== FIELD
9818 && (friendp
== 0 || dname
== current_class_name
))
9819 ctype
= current_class_type
;
9821 if (ctype
&& return_type
== return_conversion
)
9822 TYPE_HAS_CONVERSION (ctype
) = 1;
9823 if (ctype
&& constructor_name (ctype
) == dname
)
9825 /* We are within a class's scope. If our declarator name
9826 is the same as the class name, and we are defining
9827 a function, then it is a constructor/destructor, and
9828 therefore returns a void type. */
9830 if (flags
== DTOR_FLAG
)
9832 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9833 not be declared const or volatile. A destructor
9834 may not be static. */
9836 error ("destructor cannot be static member function");
9839 cp_error ("destructors may not be `%s'",
9840 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9843 if (decl_context
== FIELD
)
9845 if (! member_function_or_else (ctype
, current_class_type
,
9846 "destructor for alien class `%s' cannot be a member"))
9847 return void_type_node
;
9850 else /* It's a constructor. */
9854 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
9855 not be declared const or volatile. A constructor may
9856 not be virtual. A constructor may not be static. */
9858 error ("constructor cannot be static member function");
9861 pedwarn ("constructors cannot be declared virtual");
9866 cp_error ("constructors may not be `%s'",
9867 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9871 RID_BIT_TYPE tmp_bits
;
9872 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
9873 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
9874 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
9875 if (RIDBIT_ANY_SET (tmp_bits
))
9876 error ("return value type specifier for constructor ignored");
9878 type
= build_pointer_type (ctype
);
9879 if (decl_context
== FIELD
9880 && IS_SIGNATURE (current_class_type
))
9882 error ("constructor not allowed in signature");
9883 return void_type_node
;
9885 else if (decl_context
== FIELD
)
9887 if (! member_function_or_else (ctype
, current_class_type
,
9888 "constructor for alien class `%s' cannot be member"))
9889 return void_type_node
;
9890 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
9891 if (return_type
!= return_ctor
)
9895 if (decl_context
== FIELD
)
9901 error ("can't initialize friend function `%s'", name
);
9904 /* Cannot be both friend and virtual. */
9905 error ("virtual functions cannot be friends");
9906 RIDBIT_RESET (RID_FRIEND
, specbits
);
9909 if (decl_context
== NORMAL
)
9910 error ("friend declaration not in class definition");
9911 if (current_function_decl
&& funcdef_flag
)
9912 cp_error ("can't define friend function `%s' in a local class definition",
9916 /* Construct the function type and go to the next
9917 inner layer of declarator. */
9919 declarator
= TREE_OPERAND (declarator
, 0);
9921 /* FIXME: This is where default args should be fully
9924 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
9926 if (declarator
&& flags
== DTOR_FLAG
)
9928 /* A destructor declared in the body of a class will
9929 be represented as a BIT_NOT_EXPR. But, we just
9930 want the underlying IDENTIFIER. */
9931 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
9932 declarator
= TREE_OPERAND (declarator
, 0);
9934 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
9935 arg_types
= void_list_node
;
9936 else if (arg_types
== NULL_TREE
9937 || arg_types
!= void_list_node
)
9939 cp_error ("destructors may not have parameters");
9940 arg_types
= void_list_node
;
9941 last_function_parms
= NULL_TREE
;
9945 /* ANSI says that `const int foo ();'
9946 does not make the function foo const. */
9947 type
= build_function_type (type
, arg_types
);
9951 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
9952 if (TREE_PURPOSE (t
)
9953 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
9955 add_defarg_fn (type
);
9964 /* Filter out pointers-to-references and references-to-references.
9965 We can get these if a TYPE_DECL is used. */
9967 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9969 error ("cannot declare %s to references",
9970 TREE_CODE (declarator
) == ADDR_EXPR
9971 ? "references" : "pointers");
9972 declarator
= TREE_OPERAND (declarator
, 0);
9976 if (TREE_CODE (type
) == OFFSET_TYPE
9977 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
9978 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
9980 cp_error ("cannot declare pointer to `%#T' member",
9982 type
= TREE_TYPE (type
);
9985 /* Merge any constancy or volatility into the target type
9988 /* We now know that the TYPE_QUALS don't apply to the decl,
9989 but to the target of the pointer. */
9990 type_quals
= TYPE_UNQUALIFIED
;
9992 if (IS_SIGNATURE (type
))
9994 if (TREE_CODE (declarator
) == ADDR_EXPR
)
9996 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
9997 && TYPE_SIZE (type
))
9998 cp_warning ("empty signature `%T' used in signature reference declaration",
10001 type
= build_signature_reference_type (type
);
10003 sorry ("signature reference");
10009 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
10010 && TYPE_SIZE (type
))
10011 cp_warning ("empty signature `%T' used in signature pointer declaration",
10013 type
= build_signature_pointer_type (type
);
10016 else if (TREE_CODE (declarator
) == ADDR_EXPR
)
10018 if (TREE_CODE (type
) == VOID_TYPE
)
10019 error ("invalid type: `void &'");
10021 type
= build_reference_type (type
);
10023 else if (TREE_CODE (type
) == METHOD_TYPE
)
10025 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10028 type
= build_pointer_type (type
);
10030 /* Process a list of type modifier keywords (such as
10031 const or volatile) that were given inside the `*' or `&'. */
10033 if (TREE_TYPE (declarator
))
10035 register tree typemodlist
;
10041 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10042 typemodlist
= TREE_CHAIN (typemodlist
))
10044 tree qualifier
= TREE_VALUE (typemodlist
);
10046 if (qualifier
== ridpointers
[(int) RID_CONST
])
10048 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10050 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10055 error ("invalid type modifier within pointer declarator");
10059 pedwarn ("duplicate `const'");
10061 pedwarn ("duplicate `volatile'");
10063 pedwarn ("duplicate `restrict'");
10065 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10066 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10067 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10068 if (TREE_CODE (declarator
) == ADDR_EXPR
10069 && (constp
|| volatilep
))
10072 pedwarn ("discarding `const' applied to a reference");
10074 pedwarn ("discarding `volatile' applied to a reference");
10075 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10077 type
= cp_build_qualified_type (type
, type_quals
);
10079 declarator
= TREE_OPERAND (declarator
, 0);
10085 /* We have converted type names to NULL_TREE if the
10086 name was bogus, or to a _TYPE node, if not.
10088 The variable CTYPE holds the type we will ultimately
10089 resolve to. The code here just needs to build
10090 up appropriate member types. */
10091 tree sname
= TREE_OPERAND (declarator
, 1);
10094 /* Destructors can have their visibilities changed as well. */
10095 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10096 sname
= TREE_OPERAND (sname
, 0);
10098 if (TREE_COMPLEXITY (declarator
) == 0)
10099 /* This needs to be here, in case we are called
10100 multiple times. */ ;
10101 else if (TREE_COMPLEXITY (declarator
) == -1)
10102 /* Namespace member. */
10103 pop_decl_namespace ();
10104 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10105 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10106 else if (! IS_AGGR_TYPE_CODE
10107 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10109 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10111 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10112 that refer to ctype. They couldn't be resolved earlier
10113 because we hadn't pushed into the class yet.
10114 Example: resolve 'B<T>::type' in
10115 'B<typename B<T>::type> B<T>::f () { }'. */
10116 if (current_template_parms
10117 && uses_template_parms (type
)
10118 && uses_template_parms (current_class_type
))
10120 tree args
= current_template_args ();
10121 type
= tsubst (type
, args
, NULL_TREE
);
10124 /* This pop_nested_class corresponds to the
10125 push_nested_class used to push into class scope for
10126 parsing the argument list of a function decl, in
10128 pop_nested_class (1);
10129 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10132 my_friendly_abort (16);
10134 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10136 /* We had a reference to a global decl, or
10137 perhaps we were given a non-aggregate typedef,
10138 in which case we cleared this out, and should just
10139 keep going as though it wasn't there. */
10140 declarator
= sname
;
10143 ctype
= TREE_OPERAND (declarator
, 0);
10146 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10148 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10149 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10150 template_count
+= 1;
10151 t
= TYPE_MAIN_DECL (t
);
10152 if (DECL_LANG_SPECIFIC (t
))
10153 t
= DECL_CLASS_CONTEXT (t
);
10158 if (sname
== NULL_TREE
)
10161 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10163 /* This is the `standard' use of the scoping operator:
10164 basetype :: member . */
10166 if (ctype
== current_class_type
)
10172 Is this ill-formed? */
10175 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10178 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10180 if (current_class_type
== NULL_TREE
10182 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10183 TYPE_ARG_TYPES (type
));
10186 cp_error ("cannot declare member function `%T::%s' within `%T'",
10187 ctype
, name
, current_class_type
);
10188 return void_type_node
;
10191 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10192 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10194 /* Have to move this code elsewhere in this function.
10195 this code is used for i.e., typedef int A::M; M *pm;
10197 It is? How? jason 10/2/94 */
10199 if (current_class_type
)
10201 cp_error ("cannot declare member `%T::%s' within `%T'",
10202 ctype
, name
, current_class_type
);
10203 return void_type_node
;
10205 type
= build_offset_type (ctype
, type
);
10207 else if (uses_template_parms (ctype
))
10209 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10211 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10212 TYPE_ARG_TYPES (type
));
10216 cp_error ("structure `%T' not yet defined", ctype
);
10217 return error_mark_node
;
10220 declarator
= sname
;
10222 else if (TREE_CODE (sname
) == SCOPE_REF
)
10223 my_friendly_abort (17);
10227 declarator
= TREE_OPERAND (declarator
, 1);
10228 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10229 /* In this case, we will deal with it later. */
10233 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10234 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10235 TYPE_ARG_TYPES (type
));
10237 type
= build_offset_type (ctype
, type
);
10244 declarator
= TREE_OPERAND (declarator
, 0);
10249 case ENUMERAL_TYPE
:
10250 declarator
= NULL_TREE
;
10254 declarator
= NULL_TREE
;
10258 my_friendly_abort (158);
10262 /* See the comment for the TREE_LIST case, above. */
10265 if (! ignore_attrs
)
10266 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10268 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10270 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10273 if (explicitp
== 1)
10275 error ("only constructors can be declared `explicit'");
10279 /* Now TYPE has the actual type. */
10281 /* If this is declaring a typedef name, return a TYPE_DECL. */
10283 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10285 if (type_quals
& TYPE_QUAL_CONST
)
10287 error ("const `%s' cannot be declared `mutable'", name
);
10288 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10292 error ("static `%s' cannot be declared `mutable'", name
);
10293 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10297 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10301 /* Note that the grammar rejects storage classes
10302 in typenames, fields or parameters. */
10303 if (current_lang_name
== lang_name_java
)
10304 TYPE_FOR_JAVA (type
) = 1;
10306 if (decl_context
== FIELD
)
10308 if (declarator
== current_class_name
)
10309 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10311 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10312 if (IS_SIGNATURE (current_class_type
) && opaque_typedef
)
10313 SIGNATURE_HAS_OPAQUE_TYPEDECLS (current_class_type
) = 1;
10317 /* Make sure this typedef lives as long as its type,
10318 since it might be used as a template parameter. */
10319 if (type
!= error_mark_node
)
10320 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10321 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10322 if (type
!= error_mark_node
)
10326 /* If the user declares "struct {...} foo" then `foo' will have
10327 an anonymous name. Fill that name in now. Nothing can
10328 refer to it, so nothing needs know about the name change.
10329 The TYPE_NAME field was filled in by build_struct_xref. */
10330 if (type
!= error_mark_node
10331 && TYPE_NAME (type
)
10332 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10333 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
)))
10335 /* FIXME: This is bogus; we should not be doing this for
10336 cv-qualified types. */
10338 /* For anonymous structs that are cv-qualified, need to use
10339 TYPE_MAIN_VARIANT so that name will mangle correctly. As
10340 type not referenced after this block, don't bother
10341 resetting type to original type, ie. TREE_TYPE (decl). */
10342 type
= TYPE_MAIN_VARIANT (type
);
10344 /* Replace the anonymous name with the real name everywhere. */
10345 lookup_tag_reverse (type
, declarator
);
10346 TYPE_NAME (type
) = decl
;
10348 if (TYPE_LANG_SPECIFIC (type
))
10349 TYPE_WAS_ANONYMOUS (type
) = 1;
10351 /* XXX Temporarily set the scope.
10352 When returning, start_decl expects it as NULL_TREE,
10353 and will then then set it using pushdecl. */
10354 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10355 if (current_class_type
)
10356 DECL_CONTEXT (decl
) = current_class_type
;
10358 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10360 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10361 DECL_ASSEMBLER_NAME (decl
)
10362 = get_identifier (build_overload_name (type
, 1, 1));
10363 DECL_CONTEXT (decl
) = NULL_TREE
;
10365 /* FIXME remangle member functions; member functions of a
10366 type with external linkage have external linkage. */
10369 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10371 cp_error_at ("typedef name may not be class-qualified", decl
);
10376 if (ctype
== NULL_TREE
)
10378 if (TREE_CODE (type
) != METHOD_TYPE
)
10379 cp_error_at ("invalid type qualifier for non-method type", decl
);
10381 ctype
= TYPE_METHOD_BASETYPE (type
);
10383 if (ctype
!= NULL_TREE
)
10384 grok_method_quals (ctype
, decl
, quals
);
10387 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10388 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10389 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10391 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10392 error ("non-object member `%s' cannot be declared mutable", name
);
10394 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10395 inlinep
, friendp
, raises
!= NULL_TREE
);
10398 error ("typedef declaration includes an initializer");
10403 /* Detect the case of an array type of unspecified size
10404 which came, as such, direct from a typedef name.
10405 We must copy the type, so that each identifier gets
10406 a distinct type, so that each identifier's size can be
10407 controlled separately by its own initializer. */
10409 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10410 && TYPE_DOMAIN (type
) == NULL_TREE
)
10412 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10415 /* If this is a type name (such as, in a cast or sizeof),
10416 compute the type and return it now. */
10418 if (decl_context
== TYPENAME
)
10420 /* Note that the grammar rejects storage classes
10421 in typenames, fields or parameters. */
10422 if (type_quals
!= TYPE_UNQUALIFIED
)
10424 if (IS_SIGNATURE (type
))
10425 error ("type qualifiers specified for signature type");
10426 type_quals
= TYPE_UNQUALIFIED
;
10429 /* Special case: "friend class foo" looks like a TYPENAME context. */
10432 if (type_quals
!= TYPE_UNQUALIFIED
)
10434 cp_error ("type qualifiers specified for friend class declaration");
10435 type_quals
= TYPE_UNQUALIFIED
;
10439 cp_error ("`inline' specified for friend class declaration");
10443 /* Only try to do this stuff if we didn't already give up. */
10444 if (type
!= integer_type_node
)
10446 /* A friendly class? */
10447 if (current_class_type
)
10448 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10450 error ("trying to make class `%s' a friend of global scope",
10451 TYPE_NAME_STRING (type
));
10452 type
= void_type_node
;
10457 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10458 if (ctype
== NULL_TREE
)
10460 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10461 ctype
= TYPE_METHOD_BASETYPE (type
);
10463 grok_method_quals (ctype
, dummy
, quals
);
10464 type
= TREE_TYPE (dummy
);
10469 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10470 && decl_context
!= CATCHPARM
10471 && TREE_CODE (type
) != UNION_TYPE
10474 cp_error ("abstract declarator `%T' used as declaration", type
);
10475 declarator
= make_anon_name ();
10478 /* `void' at top level (not within pointer)
10479 is allowed only in typedefs or type names.
10480 We don't complain about parms either, but that is because
10481 a better error message can be made later. */
10483 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10486 error ("unnamed variable or field declared void");
10487 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10489 if (IDENTIFIER_OPNAME_P (declarator
))
10490 my_friendly_abort (356);
10492 error ("variable or field `%s' declared void", name
);
10495 error ("variable or field declared void");
10496 type
= integer_type_node
;
10499 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10500 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10502 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10504 if (ctype
|| in_namespace
)
10505 error ("cannot use `::' in parameter declaration");
10507 /* A parameter declared as an array of T is really a pointer to T.
10508 One declared as a function is really a pointer to a function.
10509 One declared as a member is really a pointer to member. */
10511 if (TREE_CODE (type
) == ARRAY_TYPE
)
10513 /* Transfer const-ness of array into that of type pointed to. */
10514 type
= build_pointer_type (TREE_TYPE (type
));
10515 type_quals
= TYPE_UNQUALIFIED
;
10517 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10518 type
= build_pointer_type (type
);
10519 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10520 type
= build_pointer_type (type
);
10521 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10523 error ("declaration of `%s' as void", name
);
10529 register tree decl
;
10531 if (decl_context
== PARM
)
10533 decl
= build_decl (PARM_DECL
, declarator
, complete_type (type
));
10535 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10536 inlinep
, friendp
, raises
!= NULL_TREE
);
10537 if (current_class_type
10538 && IS_SIGNATURE (current_class_type
))
10541 error ("parameter of signature member function declared `inline'");
10542 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10543 error ("parameter of signature member function declared `auto'");
10544 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10545 error ("parameter of signature member function declared `register'");
10548 /* Compute the type actually passed in the parmlist,
10549 for the case where there is no prototype.
10550 (For example, shorts and chars are passed as ints.)
10551 When there is a prototype, this is overridden later. */
10553 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10555 else if (decl_context
== FIELD
)
10557 if (type
== error_mark_node
)
10559 /* Happens when declaring arrays of sizes which
10560 are error_mark_node, for example. */
10563 else if (in_namespace
&& !friendp
)
10565 /* Something like struct S { int N::j; }; */
10566 cp_error ("invalid use of `::'");
10569 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10572 tree function_context
;
10574 /* We catch the others as conflicts with the builtin
10576 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10578 cp_error ("function `%D' cannot be declared friend",
10585 if (ctype
== NULL_TREE
)
10586 ctype
= current_class_type
;
10588 if (ctype
== NULL_TREE
)
10590 cp_error ("can't make `%D' into a method -- not in a class",
10592 return void_type_node
;
10595 /* ``A union may [ ... ] not [ have ] virtual functions.''
10597 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10599 cp_error ("function `%D' declared virtual inside a union",
10601 return void_type_node
;
10604 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10605 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10606 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10607 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10611 cp_error ("`%D' cannot be declared virtual, since it is always static",
10616 else if (staticp
< 2)
10617 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10618 TYPE_ARG_TYPES (type
));
10621 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10622 function_context
= (ctype
!= NULL_TREE
) ?
10623 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10624 publicp
= (! friendp
|| ! staticp
)
10625 && function_context
== NULL_TREE
;
10626 decl
= grokfndecl (ctype
, type
,
10627 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10628 ? declarator
: dname
,
10630 virtualp
, flags
, quals
, raises
, attrlist
,
10631 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10632 funcdef_flag
, template_count
, in_namespace
);
10633 if (decl
== NULL_TREE
|| decl
== error_mark_node
)
10636 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10637 /* The decl and setting of decl_machine_attr is also turned off. */
10638 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10641 /* [class.conv.ctor]
10643 A constructor declared without the function-specifier
10644 explicit that can be called with a single parameter
10645 specifies a conversion from the type of its first
10646 parameter to the type of its class. Such a constructor
10647 is called a converting constructor. */
10648 if (explicitp
== 2)
10649 DECL_NONCONVERTING_P (decl
) = 1;
10650 else if (DECL_CONSTRUCTOR_P (decl
))
10652 /* The constructor can be called with exactly one
10653 parameter if there is at least one parameter, and
10654 any subsequent parameters have default arguments.
10655 We don't look at the first parameter, which is
10656 really just the `this' parameter for the new
10659 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10661 /* Skip the `in_chrg' argument too, if present. */
10662 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10663 arg_types
= TREE_CHAIN (arg_types
);
10665 if (arg_types
== void_list_node
10667 && TREE_CHAIN (arg_types
)
10668 && TREE_CHAIN (arg_types
) != void_list_node
10669 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10670 DECL_NONCONVERTING_P (decl
) = 1;
10673 else if (TREE_CODE (type
) == METHOD_TYPE
)
10675 /* We only get here for friend declarations of
10676 members of other classes. */
10677 /* All method decls are public, so tell grokfndecl to set
10678 TREE_PUBLIC, also. */
10679 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10680 virtualp
, flags
, quals
, raises
, attrlist
,
10681 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10682 template_count
, in_namespace
);
10683 if (decl
== NULL_TREE
)
10686 else if (!staticp
&& ! processing_template_decl
10687 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10688 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10691 cp_error ("field `%D' has incomplete type", declarator
);
10693 cp_error ("name `%T' has incomplete type", type
);
10695 /* If we're instantiating a template, tell them which
10696 instantiation made the field's type be incomplete. */
10697 if (current_class_type
10698 && TYPE_NAME (current_class_type
)
10699 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10700 && declspecs
&& TREE_VALUE (declspecs
)
10701 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10702 cp_error (" in instantiation of template `%T'",
10703 current_class_type
);
10705 type
= error_mark_node
;
10712 error ("`%s' is neither function nor method; cannot be declared friend",
10713 IDENTIFIER_POINTER (declarator
));
10721 /* Friends are treated specially. */
10722 if (ctype
== current_class_type
)
10723 warning ("member functions are implicitly friends of their class");
10726 tree t
= NULL_TREE
;
10727 if (decl
&& DECL_NAME (decl
))
10729 if (template_class_depth (current_class_type
) == 0)
10732 = check_explicit_specialization
10734 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10735 if (decl
== error_mark_node
)
10736 return error_mark_node
;
10739 t
= do_friend (ctype
, declarator
, decl
,
10740 last_function_parms
, flags
, quals
,
10743 if (t
&& funcdef_flag
)
10746 return void_type_node
;
10750 /* Structure field. It may not be a function, except for C++ */
10752 if (decl
== NULL_TREE
)
10758 /* An attempt is being made to initialize a non-static
10759 member. But, from [class.mem]:
10761 4 A member-declarator can contain a
10762 constant-initializer only if it declares a static
10763 member (_class.static_) of integral or enumeration
10764 type, see _class.static.data_.
10766 This used to be relatively common practice, but
10767 the rest of the compiler does not correctly
10768 handle the initialization unless the member is
10769 static so we make it static below. */
10770 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10772 cp_pedwarn ("making `%D' static", declarator
);
10776 if (uses_template_parms (type
))
10777 /* We'll check at instantiation time. */
10779 else if (check_static_variable_definition (declarator
,
10781 /* If we just return the declaration, crashes
10782 will sometimes occur. We therefore return
10783 void_type_node, as if this was a friend
10784 declaration, to cause callers to completely
10785 ignore this declaration. */
10786 return void_type_node
;
10789 /* 9.2p13 [class.mem] */
10790 if (declarator
== current_class_name
)
10791 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10796 /* C++ allows static class members.
10797 All other work for this is done by grokfield.
10798 This VAR_DCL is built by build_lang_field_decl.
10799 All other VAR_DECLs are built by build_decl. */
10800 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
10801 TREE_STATIC (decl
) = 1;
10802 /* In class context, 'static' means public access. */
10803 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10807 decl
= build_lang_field_decl (FIELD_DECL
, declarator
, type
);
10808 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10810 DECL_MUTABLE_P (decl
) = 1;
10811 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10815 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10816 inlinep
, friendp
, raises
!= NULL_TREE
);
10819 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10821 tree original_name
;
10827 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10828 original_name
= dname
;
10830 original_name
= declarator
;
10832 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10833 error ("storage class `auto' invalid for function `%s'", name
);
10834 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10835 error ("storage class `register' invalid for function `%s'", name
);
10837 /* Function declaration not at top level.
10838 Storage classes other than `extern' are not allowed
10839 and `extern' makes no difference. */
10840 if (! toplevel_bindings_p ()
10841 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10842 || RIDBIT_SETP (RID_INLINE
, specbits
))
10845 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10846 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10848 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10851 if (ctype
== NULL_TREE
)
10855 error ("virtual non-class function `%s'", name
);
10859 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
10860 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10861 TYPE_ARG_TYPES (type
));
10863 /* Record presence of `static'. */
10864 publicp
= (ctype
!= NULL_TREE
10865 || RIDBIT_SETP (RID_EXTERN
, specbits
)
10866 || !RIDBIT_SETP (RID_STATIC
, specbits
));
10868 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
10869 virtualp
, flags
, quals
, raises
, attrlist
,
10871 publicp
, inlinep
, funcdef_flag
,
10872 template_count
, in_namespace
);
10873 if (decl
== NULL_TREE
)
10876 /* Among other times, could occur from check_explicit_specialization
10877 returning an error_mark_node. */
10878 if (decl
== error_mark_node
)
10879 return error_mark_node
;
10883 int illegal_static
= 0;
10885 /* Don't allow a static member function in a class, and forbid
10886 declaring main to be static. */
10887 if (TREE_CODE (type
) == METHOD_TYPE
)
10889 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
10890 illegal_static
= 1;
10892 else if (current_function_decl
)
10894 /* FIXME need arm citation */
10895 error ("cannot declare static function inside another function");
10896 illegal_static
= 1;
10899 if (illegal_static
)
10902 RIDBIT_RESET (RID_STATIC
, specbits
);
10908 /* It's a variable. */
10910 /* An uninitialized decl with `extern' is a reference. */
10911 decl
= grokvardecl (type
, declarator
, &specbits
,
10913 (type_quals
& TYPE_QUAL_CONST
) != 0,
10915 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
10916 inlinep
, friendp
, raises
!= NULL_TREE
);
10920 DECL_CONTEXT (decl
) = ctype
;
10923 cp_pedwarn ("static member `%D' re-declared as static", decl
);
10925 RIDBIT_RESET (RID_STATIC
, specbits
);
10927 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
10929 cp_error ("static member `%D' declared `register'", decl
);
10930 RIDBIT_RESET (RID_REGISTER
, specbits
);
10932 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
10934 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
10936 RIDBIT_RESET (RID_EXTERN
, specbits
);
10941 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10943 error ("`%s' cannot be declared mutable", name
);
10946 /* Record `register' declaration for warnings on &
10947 and in case doing stupid register allocation. */
10949 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10950 DECL_REGISTER (decl
) = 1;
10952 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
10953 DECL_THIS_EXTERN (decl
) = 1;
10955 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10956 DECL_THIS_STATIC (decl
) = 1;
10958 /* Record constancy and volatility. */
10959 /* FIXME: Disallow `restrict' pointer-to-member declarations. */
10960 c_apply_type_quals_to_decl (type_quals
, decl
);
10966 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
10967 An empty exprlist is a parmlist. An exprlist which
10968 contains only identifiers at the global level
10969 is a parmlist. Otherwise, it is an exprlist. */
10972 parmlist_is_exprlist (exprs
)
10975 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
10978 if (toplevel_bindings_p ())
10980 /* At the global level, if these are all identifiers,
10981 then it is a parmlist. */
10984 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
10986 exprs
= TREE_CHAIN (exprs
);
10993 /* Subroutine of `grokparms'. In a fcn definition, arg types must
10996 C++: also subroutine of `start_function'. */
10999 require_complete_types_for_parms (parms
)
11002 if (processing_template_decl
)
11007 tree type
= TREE_TYPE (parms
);
11008 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11010 if (DECL_NAME (parms
))
11011 error ("parameter `%s' has incomplete type",
11012 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11014 error ("parameter has incomplete type");
11015 TREE_TYPE (parms
) = error_mark_node
;
11018 /* If the arg types are incomplete in a declaration,
11019 they must include undefined tags.
11020 These tags can never be defined in the scope of the declaration,
11021 so the types can never be completed,
11022 and no call can be compiled successfully. */
11023 /* This is not the right behavior for C++, but not having
11024 it is also probably wrong. */
11027 /* Now warn if is a pointer to an incomplete type. */
11028 while (TREE_CODE (type
) == POINTER_TYPE
11029 || TREE_CODE (type
) == REFERENCE_TYPE
)
11030 type
= TREE_TYPE (type
);
11031 type
= TYPE_MAIN_VARIANT (type
);
11032 if (TYPE_SIZE (type
) == NULL_TREE
)
11034 if (DECL_NAME (parm
) != NULL_TREE
)
11035 warning ("parameter `%s' points to incomplete type",
11036 IDENTIFIER_POINTER (DECL_NAME (parm
)));
11038 warning ("parameter points to incomplete type");
11042 parms
= TREE_CHAIN (parms
);
11046 /* Decode the list of parameter types for a function type.
11047 Given the list of things declared inside the parens,
11048 return a list of types.
11050 The list we receive can have three kinds of elements:
11051 an IDENTIFIER_NODE for names given without types,
11052 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11053 or void_type_node, to mark the end of an argument list
11054 when additional arguments are not permitted (... was not used).
11056 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11057 a mere declaration. A nonempty identifier-list gets an error message
11058 when FUNCDEF_FLAG is zero.
11059 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11060 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11062 If all elements of the input list contain types,
11063 we return a list of the types.
11064 If all elements contain no type (except perhaps a void_type_node
11065 at the end), we return a null list.
11066 If some have types and some do not, it is an error, and we
11067 return a null list.
11069 Also set last_function_parms to either
11070 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11071 A list of names is converted to a chain of PARM_DECLs
11072 by store_parm_decls so that ultimately it is always a chain of decls.
11074 Note that in C++, parameters can take default values. These default
11075 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11076 an error to specify default values which are followed by parameters
11077 that have no default values, or an ELLIPSES. For simplicities sake,
11078 only parameters which are specified with their types can take on
11082 grokparms (first_parm
, funcdef_flag
)
11086 tree result
= NULL_TREE
;
11087 tree decls
= NULL_TREE
;
11089 if (first_parm
!= NULL_TREE
11090 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11092 if (! funcdef_flag
)
11093 pedwarn ("parameter names (without types) in function declaration");
11094 last_function_parms
= first_parm
;
11097 else if (first_parm
!= NULL_TREE
11098 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11099 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11100 my_friendly_abort (145);
11103 /* Types were specified. This is a list of declarators
11104 each represented as a TREE_LIST node. */
11105 register tree parm
, chain
;
11106 int any_init
= 0, any_error
= 0;
11108 if (first_parm
!= NULL_TREE
)
11110 tree last_result
= NULL_TREE
;
11111 tree last_decl
= NULL_TREE
;
11113 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11115 tree type
= NULL_TREE
, list_node
= parm
;
11116 register tree decl
= TREE_VALUE (parm
);
11117 tree init
= TREE_PURPOSE (parm
);
11119 chain
= TREE_CHAIN (parm
);
11120 /* @@ weak defense against parse errors. */
11121 if (TREE_CODE (decl
) != VOID_TYPE
11122 && TREE_CODE (decl
) != TREE_LIST
)
11124 /* Give various messages as the need arises. */
11125 if (TREE_CODE (decl
) == STRING_CST
)
11126 cp_error ("invalid string constant `%E'", decl
);
11127 else if (TREE_CODE (decl
) == INTEGER_CST
)
11128 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11132 if (TREE_CODE (decl
) != VOID_TYPE
)
11134 decl
= grokdeclarator (TREE_VALUE (decl
),
11135 TREE_PURPOSE (decl
),
11136 PARM
, init
!= NULL_TREE
,
11138 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11141 /* Top-level qualifiers on the parameters are
11142 ignored for function types. */
11143 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11145 if (TREE_CODE (type
) == VOID_TYPE
)
11146 decl
= void_type_node
;
11147 else if (TREE_CODE (type
) == METHOD_TYPE
)
11149 if (DECL_NAME (decl
))
11150 /* Cannot use the decl here because
11151 we don't have DECL_CONTEXT set up yet. */
11152 cp_error ("parameter `%D' invalidly declared method type",
11155 error ("parameter invalidly declared method type");
11156 type
= build_pointer_type (type
);
11157 TREE_TYPE (decl
) = type
;
11159 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11161 if (DECL_NAME (decl
))
11162 cp_error ("parameter `%D' invalidly declared offset type",
11165 error ("parameter invalidly declared offset type");
11166 type
= build_pointer_type (type
);
11167 TREE_TYPE (decl
) = type
;
11169 else if (TREE_CODE (type
) == RECORD_TYPE
11170 && TYPE_LANG_SPECIFIC (type
)
11171 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
11173 abstract_virtuals_error (decl
, type
);
11174 any_error
= 1; /* Seems like a good idea. */
11176 else if (TREE_CODE (type
) == RECORD_TYPE
11177 && TYPE_LANG_SPECIFIC (type
)
11178 && IS_SIGNATURE (type
))
11180 signature_error (decl
, type
);
11181 any_error
= 1; /* Seems like a good idea. */
11183 else if (POINTER_TYPE_P (type
))
11186 while (POINTER_TYPE_P (t
)
11187 || (TREE_CODE (t
) == ARRAY_TYPE
11188 && TYPE_DOMAIN (t
) != NULL_TREE
))
11190 if (TREE_CODE (t
) == ARRAY_TYPE
)
11191 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11193 TYPE_PTR_P (type
) ? "pointer" : "reference");
11197 if (TREE_CODE (decl
) == VOID_TYPE
)
11199 if (result
== NULL_TREE
)
11201 result
= void_list_node
;
11202 last_result
= result
;
11206 TREE_CHAIN (last_result
) = void_list_node
;
11207 last_result
= void_list_node
;
11210 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11211 error ("`void' in parameter list must be entire list");
11215 /* Since there is a prototype, args are passed in their own types. */
11216 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11217 #ifdef PROMOTE_PROTOTYPES
11218 if ((TREE_CODE (type
) == INTEGER_TYPE
11219 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11220 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11221 DECL_ARG_TYPE (decl
) = integer_type_node
;
11228 if (TREE_CODE (init
) == SAVE_EXPR
)
11229 PARM_DECL_EXPR (init
) = 1;
11230 else if (processing_template_decl
)
11232 /* Unparsed default arg from in-class decl. */
11233 else if (TREE_CODE (init
) == DEFAULT_ARG
)
11235 else if (TREE_CODE (init
) == VAR_DECL
11236 || TREE_CODE (init
) == PARM_DECL
)
11238 if (IDENTIFIER_LOCAL_VALUE (DECL_NAME (init
)))
11240 /* ``Local variables may not be used in default
11241 argument expressions.'' dpANSI C++ 8.2.6 */
11242 /* If extern int i; within a function is not
11243 considered a local variable, then this code is
11245 cp_error ("local variable `%D' may not be used as a default argument", init
);
11248 else if (TREE_READONLY_DECL_P (init
))
11249 init
= decl_constant_value (init
);
11251 else if (TREE_TYPE (init
) == NULL_TREE
)
11253 error ("argument list may not have an initializer list");
11254 init
= error_mark_node
;
11257 if (! processing_template_decl
11258 && init
!= error_mark_node
11259 && TREE_CODE (init
) != DEFAULT_ARG
11260 && ! can_convert_arg (type
, TREE_TYPE (init
), init
))
11261 cp_pedwarn ("invalid type `%T' for default argument to `%#D'",
11262 TREE_TYPE (init
), decl
);
11268 if (decls
== NULL_TREE
)
11275 TREE_CHAIN (last_decl
) = decl
;
11278 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11280 TREE_PURPOSE (list_node
) = init
;
11281 TREE_VALUE (list_node
) = type
;
11282 TREE_CHAIN (list_node
) = NULL_TREE
;
11285 list_node
= saveable_tree_cons (init
, type
, NULL_TREE
);
11286 if (result
== NULL_TREE
)
11288 result
= list_node
;
11289 last_result
= result
;
11293 TREE_CHAIN (last_result
) = list_node
;
11294 last_result
= list_node
;
11298 TREE_CHAIN (last_result
) = NULL_TREE
;
11299 /* If there are no parameters, and the function does not end
11300 with `...', then last_decl will be NULL_TREE. */
11301 if (last_decl
!= NULL_TREE
)
11302 TREE_CHAIN (last_decl
) = NULL_TREE
;
11306 last_function_parms
= decls
;
11308 /* In a fcn definition, arg types must be complete. */
11309 if (funcdef_flag
> 0)
11310 require_complete_types_for_parms (last_function_parms
);
11315 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11316 FUNCTION_TYPE with the newly parsed version of its default argument, which
11317 was previously digested as text. See snarf_defarg et al in lex.c. */
11320 replace_defarg (arg
, init
)
11323 if (! processing_template_decl
11324 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11325 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11326 TREE_TYPE (init
), TREE_VALUE (arg
));
11327 TREE_PURPOSE (arg
) = init
;
11334 tree t
= FUNCTION_ARG_CHAIN (d
);
11335 if (DECL_CONSTRUCTOR_P (d
)
11336 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11337 t
= TREE_CHAIN (t
);
11338 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11339 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11340 == DECL_CLASS_CONTEXT (d
))
11341 && (TREE_CHAIN (t
) == NULL_TREE
11342 || TREE_CHAIN (t
) == void_list_node
11343 || TREE_PURPOSE (TREE_CHAIN (t
))))
11348 /* These memoizing functions keep track of special properties which
11349 a class may have. `grok_ctor_properties' notices whether a class
11350 has a constructor of the form X(X&), and also complains
11351 if the class has a constructor of the form X(X).
11352 `grok_op_properties' takes notice of the various forms of
11353 operator= which are defined, as well as what sorts of type conversion
11354 may apply. Both functions take a FUNCTION_DECL as an argument. */
11357 grok_ctor_properties (ctype
, decl
)
11360 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11361 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11363 /* When a type has virtual baseclasses, a magical first int argument is
11364 added to any ctor so we can tell if the class has been initialized
11365 yet. This could screw things up in this function, so we deliberately
11366 ignore the leading int if we're in that situation. */
11367 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11369 my_friendly_assert (parmtypes
11370 && TREE_VALUE (parmtypes
) == integer_type_node
,
11372 parmtypes
= TREE_CHAIN (parmtypes
);
11373 parmtype
= TREE_VALUE (parmtypes
);
11376 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11377 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11378 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11379 || TREE_CHAIN (parmtypes
) == void_list_node
11380 || TREE_PURPOSE (TREE_CHAIN (parmtypes
))))
11382 TYPE_HAS_INIT_REF (ctype
) = 1;
11383 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11384 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11386 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11387 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11388 || TREE_CHAIN (parmtypes
) == void_list_node
11389 || TREE_PURPOSE (TREE_CHAIN (parmtypes
))))
11391 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11393 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11396 else if (TREE_CODE (parmtype
) == VOID_TYPE
11397 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11398 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11403 /* An operator with this name can be either unary or binary. */
11409 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11410 || name
== ansi_opname
[(int) ADDR_EXPR
]
11411 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11412 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11413 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11414 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11417 /* An operator with this name can only be unary. */
11423 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11424 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11425 || name
== ansi_opname
[(int) COMPONENT_REF
]
11426 || OPERATOR_TYPENAME_P (name
));
11429 /* Do a little sanity-checking on how they declared their operator. */
11432 grok_op_properties (decl
, virtualp
, friendp
)
11434 int virtualp
, friendp
;
11436 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11437 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11438 tree name
= DECL_NAME (decl
);
11440 if (current_class_type
== NULL_TREE
)
11445 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11446 TYPE_HAS_ASSIGNMENT (current_class_type
) = 1;
11447 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11448 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11449 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11450 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11451 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11452 || name
== ansi_opname
[(int) MEMBER_REF
])
11453 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11454 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11455 TYPE_GETS_NEW (current_class_type
) |= 1;
11456 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11457 TYPE_GETS_DELETE (current_class_type
) |= 1;
11458 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11459 TYPE_GETS_NEW (current_class_type
) |= 2;
11460 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11461 TYPE_GETS_DELETE (current_class_type
) |= 2;
11464 if (name
== ansi_opname
[(int) NEW_EXPR
]
11465 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11467 /* When the compiler encounters the definition of A::operator new, it
11468 doesn't look at the class declaration to find out if it's static. */
11470 revert_static_member_fn (&decl
, NULL
, NULL
);
11472 /* Take care of function decl if we had syntax errors. */
11473 if (argtypes
== NULL_TREE
)
11475 = build_function_type (ptr_type_node
,
11476 hash_tree_chain (integer_type_node
,
11479 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11481 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11482 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11485 revert_static_member_fn (&decl
, NULL
, NULL
);
11487 if (argtypes
== NULL_TREE
)
11489 = build_function_type (void_type_node
,
11490 hash_tree_chain (ptr_type_node
,
11494 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11496 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11497 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11498 != void_list_node
))
11499 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11504 /* An operator function must either be a non-static member function
11505 or have at least one parameter of a class, a reference to a class,
11506 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11507 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11509 if (OPERATOR_TYPENAME_P (name
)
11510 || name
== ansi_opname
[(int) CALL_EXPR
]
11511 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11512 || name
== ansi_opname
[(int) COMPONENT_REF
]
11513 || name
== ansi_opname
[(int) ARRAY_REF
])
11514 cp_error ("`%D' must be a nonstatic member function", decl
);
11519 if (DECL_STATIC_FUNCTION_P (decl
))
11520 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11523 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11525 tree arg
= TREE_VALUE (p
);
11526 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11527 arg
= TREE_TYPE (arg
);
11529 /* This lets bad template code slip through. */
11530 if (IS_AGGR_TYPE (arg
)
11531 || TREE_CODE (arg
) == ENUMERAL_TYPE
11532 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11533 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11537 ("`%D' must have an argument of class or enumerated type",
11544 if (name
== ansi_opname
[(int) CALL_EXPR
])
11545 return; /* No restrictions on args. */
11547 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11549 tree t
= TREE_TYPE (name
);
11550 if (TREE_CODE (t
) == VOID_TYPE
)
11551 pedwarn ("void is not a valid type conversion operator");
11552 else if (! friendp
)
11554 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11557 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11559 if (t
== current_class_type
)
11560 what
= "the same type";
11561 /* Don't force t to be complete here. */
11562 else if (IS_AGGR_TYPE (t
)
11564 && DERIVED_FROM_P (t
, current_class_type
))
11565 what
= "a base class";
11568 warning ("conversion to %s%s will never use a type conversion operator",
11569 ref
? "a reference to " : "", what
);
11573 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11577 if (list_length (argtypes
) != 3 && methodp
)
11579 cp_error ("`%D' must take exactly one argument", decl
);
11582 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11584 if (copy_assignment_arg_p (parmtype
, virtualp
)
11587 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11588 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11589 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11590 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11593 else if (name
== ansi_opname
[(int) COND_EXPR
])
11596 pedwarn ("ANSI C++ prohibits overloading operator ?:");
11597 if (list_length (argtypes
) != 4)
11598 cp_error ("`%D' must take exactly three arguments", decl
);
11600 else if (ambi_op_p (name
))
11602 if (list_length (argtypes
) == 2)
11604 else if (list_length (argtypes
) == 3)
11606 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11607 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11608 && ! processing_template_decl
11609 && TREE_VALUE (TREE_CHAIN (argtypes
)) != integer_type_node
)
11612 cp_error ("postfix `%D' must take `int' as its argument",
11616 ("postfix `%D' must take `int' as its second argument",
11623 cp_error ("`%D' must take either zero or one argument", decl
);
11625 cp_error ("`%D' must take either one or two arguments", decl
);
11628 /* More Effective C++ rule 6. */
11630 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11631 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11633 tree arg
= TREE_VALUE (argtypes
);
11634 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11635 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11636 arg
= TREE_TYPE (arg
);
11637 arg
= TYPE_MAIN_VARIANT (arg
);
11638 if (list_length (argtypes
) == 2)
11640 if (TREE_CODE (ret
) != REFERENCE_TYPE
11641 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11643 cp_warning ("prefix `%D' should return `%T'", decl
,
11644 build_reference_type (arg
));
11648 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11649 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11653 else if (unary_op_p (name
))
11655 if (list_length (argtypes
) != 2)
11658 cp_error ("`%D' must take `void'", decl
);
11660 cp_error ("`%D' must take exactly one argument", decl
);
11663 else /* if (binary_op_p (name)) */
11665 if (list_length (argtypes
) != 3)
11668 cp_error ("`%D' must take exactly one argument", decl
);
11670 cp_error ("`%D' must take exactly two arguments", decl
);
11673 /* More Effective C++ rule 7. */
11675 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11676 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11677 || name
== ansi_opname
[COMPOUND_EXPR
]))
11678 cp_warning ("user-defined `%D' always evaluates both arguments",
11682 /* Effective C++ rule 23. */
11684 && list_length (argtypes
) == 3
11685 && (name
== ansi_opname
[PLUS_EXPR
]
11686 || name
== ansi_opname
[MINUS_EXPR
]
11687 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11688 || name
== ansi_opname
[MULT_EXPR
])
11689 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11690 cp_warning ("`%D' should return by value", decl
);
11694 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11695 if (TREE_PURPOSE (argtypes
))
11697 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11698 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11699 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11702 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11705 cp_error ("`%D' cannot have default arguments", decl
);
11710 /* Get the struct, enum or union (CODE says which) with tag NAME.
11711 Define the tag as a forward-reference if it is not defined.
11713 C++: If a class derivation is given, process it here, and report
11714 an error if multiple derivation declarations are not identical.
11716 If this is a definition, come in through xref_tag and only look in
11717 the current frame for the name (since C++ allows new names in any
11721 xref_tag (code_type_node
, name
, globalize
)
11722 tree code_type_node
;
11726 enum tag_types tag_code
;
11727 enum tree_code code
;
11729 register tree ref
, t
;
11730 struct binding_level
*b
= inner_binding_level
;
11732 tree attributes
= NULL_TREE
;
11734 /* If we are called from the parser, code_type_node will sometimes be a
11735 TREE_LIST. This indicates that the user wrote
11736 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11738 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11740 attributes
= TREE_PURPOSE (code_type_node
);
11741 code_type_node
= TREE_VALUE (code_type_node
);
11744 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11749 case signature_type
:
11750 code
= RECORD_TYPE
;
11756 code
= ENUMERAL_TYPE
;
11759 my_friendly_abort (18);
11762 /* If a cross reference is requested, look up the type
11763 already defined for this tag and return it. */
11764 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11767 name
= TYPE_IDENTIFIER (t
);
11771 t
= IDENTIFIER_TYPE_VALUE (name
);
11773 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11774 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11779 if (t
&& (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
11780 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
))
11782 cp_error ("redeclaration of template type-parameter `%T'", name
);
11783 cp_error_at (" previously declared here `%#D'",
11784 TEMPLATE_TYPE_DECL (t
));
11786 if (t
&& TYPE_CONTEXT (t
) && got_type
)
11789 /* If we know we are defining this tag, only look it up in
11790 this scope and don't try to find it as a type. */
11791 ref
= lookup_tag (code
, name
, b
, 1);
11795 if (current_class_type
11796 && template_class_depth (current_class_type
)
11797 && PROCESSING_REAL_TEMPLATE_DECL_P ())
11798 /* Since GLOBALIZE is non-zero, we are not looking at a
11799 definition of this tag. Since, in addition, we are currently
11800 processing a (member) template declaration of a template
11801 class, we don't want to do any lookup at all; consider:
11808 { template <class V>
11809 friend struct S1; };
11811 Here, the S2::S1 declaration should not be confused with the
11812 outer declaration. In particular, the inner version should
11813 have a template parameter of level 2, not level 1. This
11814 would be particularly important if the member declaration
11817 template <class V = U> friend struct S1;
11819 say, when we should tsubst into `U' when instantiating S2. */
11826 ref
= lookup_tag (code
, name
, b
, 0);
11830 /* Try finding it as a type declaration. If that wins,
11832 ref
= lookup_name (name
, 1);
11834 if (ref
!= NULL_TREE
11835 && processing_template_decl
11836 && DECL_CLASS_TEMPLATE_P (ref
)
11837 && template_class_depth (current_class_type
) == 0)
11838 /* Since GLOBALIZE is true, we're declaring a global
11839 template, so we want this type. */
11840 ref
= DECL_RESULT (ref
);
11842 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
11843 && TREE_CODE (TREE_TYPE (ref
)) == code
)
11844 ref
= TREE_TYPE (ref
);
11851 push_obstacks_nochange ();
11855 /* If no such tag is yet defined, create a forward-reference node
11856 and record it as the "definition".
11857 When a real declaration of this type is found,
11858 the forward-reference will be altered into a real type. */
11860 /* In C++, since these migrate into the global scope, we must
11861 build them on the permanent obstack. */
11863 temp
= allocation_temporary_p ();
11865 end_temporary_allocation ();
11867 if (code
== ENUMERAL_TYPE
)
11869 cp_error ("use of enum `%#D' without previous declaration", name
);
11871 ref
= make_node (ENUMERAL_TYPE
);
11873 /* Give the type a default layout like unsigned int
11874 to avoid crashing if it does not get defined. */
11875 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
11876 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
11877 TREE_UNSIGNED (ref
) = 1;
11878 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
11879 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
11880 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
11882 /* Enable us to recognize when a type is created in class context.
11883 To do nested classes correctly, this should probably be cleared
11884 out when we leave this classes scope. Currently this in only
11885 done in `start_enum'. */
11887 pushtag (name
, ref
, globalize
);
11891 struct binding_level
*old_b
= class_binding_level
;
11893 ref
= make_lang_type (code
);
11895 if (tag_code
== signature_type
)
11897 SET_SIGNATURE (ref
);
11898 /* Since a signature type will be turned into the type
11899 of signature tables, it's not only an interface. */
11900 CLASSTYPE_INTERFACE_ONLY (ref
) = 0;
11901 SET_CLASSTYPE_INTERFACE_KNOWN (ref
);
11902 /* A signature doesn't have a vtable. */
11903 CLASSTYPE_VTABLE_NEEDS_WRITING (ref
) = 0;
11906 #ifdef NONNESTED_CLASSES
11907 /* Class types don't nest the way enums do. */
11908 class_binding_level
= (struct binding_level
*)0;
11910 pushtag (name
, ref
, globalize
);
11911 class_binding_level
= old_b
;
11916 /* If it no longer looks like a nested type, make sure it's
11918 If it is not an IDENTIFIER, this is not a declaration */
11919 if (b
->namespace_p
&& !class_binding_level
11920 && TREE_CODE (name
) == IDENTIFIER_NODE
)
11922 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
11923 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
11926 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
11927 redeclare_class_template (ref
, current_template_parms
);
11930 /* Until the type is defined, tentatively accept whatever
11931 structure tag the user hands us. */
11932 if (TYPE_SIZE (ref
) == NULL_TREE
11933 && ref
!= current_class_type
11934 /* Have to check this, in case we have contradictory tag info. */
11935 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
11937 if (tag_code
== class_type
)
11938 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
11939 else if (tag_code
== record_type
|| tag_code
== signature_type
)
11940 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
11945 TREE_TYPE (ref
) = attributes
;
11947 if (ref
&& TYPE_P (ref
))
11951 If the identifier resolves to a typedef-name or a template
11952 type-parameter, the elaborated-type-specifier is
11954 if (TYPE_LANG_SPECIFIC (ref
) && TYPE_WAS_ANONYMOUS (ref
))
11955 cp_error ("`%T' is a typedef name", ref
);
11956 else if (TREE_CODE (ref
) == TEMPLATE_TYPE_PARM
)
11957 cp_error ("`%T' is a template type paramter", ref
);
11964 xref_tag_from_type (old
, id
, globalize
)
11968 tree code_type_node
;
11970 if (TREE_CODE (old
) == RECORD_TYPE
)
11971 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
11972 ? class_type_node
: record_type_node
);
11974 code_type_node
= union_type_node
;
11976 if (id
== NULL_TREE
)
11977 id
= TYPE_IDENTIFIER (old
);
11979 return xref_tag (code_type_node
, id
, globalize
);
11983 xref_basetypes (code_type_node
, name
, ref
, binfo
)
11984 tree code_type_node
;
11988 /* In the declaration `A : X, Y, ... Z' we mark all the types
11989 (A, X, Y, ..., Z) so we can check for duplicates. */
11992 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11994 if (tag_code
== union_type
)
11996 cp_error ("derived union `%T' invalid", ref
);
12000 len
= list_length (binfo
);
12001 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12003 SET_CLASSTYPE_MARKED (ref
);
12004 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12006 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12008 /* The base of a derived struct is public by default. */
12010 = (TREE_PURPOSE (binfo
) == access_public_node
12011 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12012 || (tag_code
!= class_type
12013 && (TREE_PURPOSE (binfo
) == access_default_node
12014 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12016 = (TREE_PURPOSE (binfo
) == access_protected_node
12017 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12019 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12020 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12021 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12022 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12023 tree basetype
= TREE_VALUE (binfo
);
12026 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12027 basetype
= TREE_TYPE (basetype
);
12029 || (TREE_CODE (basetype
) != RECORD_TYPE
12030 && TREE_CODE (basetype
) != TYPENAME_TYPE
12031 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12032 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12034 cp_error ("base type `%T' fails to be a struct or class type",
12035 TREE_VALUE (binfo
));
12039 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12042 /* This code replaces similar code in layout_basetypes.
12043 We put the complete_type first for implicit `typename'. */
12044 if (TYPE_SIZE (complete_type (basetype
)) == NULL_TREE
12045 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12047 cp_error ("base class `%T' has incomplete type", basetype
);
12053 if (CLASSTYPE_MARKED (basetype
))
12055 if (basetype
== ref
)
12056 cp_error ("recursive type `%T' undefined", basetype
);
12058 cp_error ("duplicate base type `%T' invalid", basetype
);
12062 if (TYPE_FOR_JAVA (basetype
)
12063 && current_lang_stack
== current_lang_base
)
12064 TYPE_FOR_JAVA (ref
) = 1;
12066 /* Note that the BINFO records which describe individual
12067 inheritances are *not* shared in the lattice! They
12068 cannot be shared because a given baseclass may be
12069 inherited with different `accessibility' by different
12070 derived classes. (Each BINFO record describing an
12071 individual inheritance contains flags which say what
12072 the `accessibility' of that particular inheritance is.) */
12075 = make_binfo (integer_zero_node
, basetype
,
12076 CLASS_TYPE_P (basetype
)
12077 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12078 CLASS_TYPE_P (basetype
)
12079 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12081 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12082 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12083 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12084 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12085 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12087 /* We need to unshare the binfos now so that lookups during class
12088 definition work. */
12089 unshare_base_binfos (base_binfo
);
12091 SET_CLASSTYPE_MARKED (basetype
);
12093 /* We are free to modify these bits because they are meaningless
12094 at top level, and BASETYPE is a top-level type. */
12095 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12097 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12098 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12101 if (CLASS_TYPE_P (basetype
))
12103 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12104 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12111 TREE_VEC_LENGTH (binfos
) = i
;
12113 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12116 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12119 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12121 if (CLASS_TYPE_P (basetype
))
12122 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12123 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12126 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12127 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12129 /* Unmark all the types. */
12131 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12132 CLEAR_CLASSTYPE_MARKED (ref
);
12138 /* Begin compiling the definition of an enumeration type.
12139 NAME is its name (or null if anonymous).
12140 Returns the type object, as yet incomplete.
12141 Also records info about it so that build_enumerator
12142 may be used to declare the individual values as they are read. */
12148 register tree enumtype
= NULL_TREE
;
12149 struct binding_level
*b
= inner_binding_level
;
12151 /* We are wasting space here and putting these on the permanent_obstack so
12152 that typeid(local enum) will work correctly. */
12154 if (processing_template_decl
&& current_function_decl
)
12157 end_temporary_allocation ();
12159 /* If this is the real definition for a previous forward reference,
12160 fill in the contents in the same object that used to be the
12161 forward reference. */
12163 if (name
!= NULL_TREE
)
12164 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12166 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12167 cp_error ("multiple definition of `%#T'", enumtype
);
12170 enumtype
= make_node (ENUMERAL_TYPE
);
12171 pushtag (name
, enumtype
, 0);
12174 if (current_class_type
)
12175 TREE_ADDRESSABLE (b
->tags
) = 1;
12177 /* We don't copy this value because build_enumerator needs to do it. */
12178 enum_next_value
= integer_zero_node
;
12181 GNU_xref_decl (current_function_decl
, enumtype
);
12185 /* After processing and defining all the values of an enumeration type,
12186 install their decls in the enumeration type and finish it off.
12187 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12188 Returns ENUMTYPE. */
12191 finish_enum (enumtype
)
12194 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12195 /* Calculate the maximum value of any enumerator in this type. */
12197 tree values
= TYPE_VALUES (enumtype
);
12202 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12207 /* The TREE_VALUE is a CONST_DECL for this enumeration
12209 decl
= TREE_VALUE (pair
);
12211 /* The DECL_INITIAL will be NULL if we are processing a
12212 template declaration and this enumeration constant had no
12213 explicit initializer. */
12214 value
= DECL_INITIAL (decl
);
12215 if (value
&& !processing_template_decl
)
12217 /* Set the TREE_TYPE for the VALUE as well. That's so
12218 that when we call decl_constant_value we get an
12219 entity of the right type (but with the constant
12220 value). Since we shouldn't ever call
12221 decl_constant_value on a template type, there's no
12222 reason to do that when processing_template_decl.
12223 And, if the expression is something like a
12224 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12225 wreak havoc on the intended type of the expression.
12227 Of course, there's also no point in trying to compute
12228 minimum or maximum values if we're in a template. */
12229 TREE_TYPE (value
) = enumtype
;
12232 minnode
= maxnode
= value
;
12233 else if (tree_int_cst_lt (maxnode
, value
))
12235 else if (tree_int_cst_lt (value
, minnode
))
12239 if (processing_template_decl
)
12240 /* If this is just a template, leave the CONST_DECL
12241 alone. That way tsubst_copy will find CONST_DECLs for
12242 CONST_DECLs, and not INTEGER_CSTs. */
12245 /* In the list we're building up, we want the enumeration
12246 values, not the CONST_DECLs. */
12247 TREE_VALUE (pair
) = value
;
12251 maxnode
= minnode
= integer_zero_node
;
12253 TYPE_VALUES (enumtype
) = nreverse (values
);
12255 if (processing_template_decl
)
12257 tree scope
= current_scope ();
12258 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12260 add_tree (build_min (TAG_DEFN
, enumtype
));
12261 resume_temporary_allocation ();
12267 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12268 int lowprec
= min_precision (minnode
, unsignedp
);
12269 int highprec
= min_precision (maxnode
, unsignedp
);
12270 int precision
= MAX (lowprec
, highprec
);
12272 TYPE_SIZE (enumtype
) = NULL_TREE
;
12274 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12276 TYPE_PRECISION (enumtype
) = precision
;
12278 fixup_unsigned_type (enumtype
);
12280 fixup_signed_type (enumtype
);
12282 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12283 /* Use the width of the narrowest normal C type which is wide enough. */
12284 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12287 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12289 TYPE_SIZE (enumtype
) = 0;
12290 layout_type (enumtype
);
12296 /* Fix up all variant types of this enum type. */
12297 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12298 tem
= TYPE_NEXT_VARIANT (tem
))
12300 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12301 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12302 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12303 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12304 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12305 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12306 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12307 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12308 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12312 /* Finish debugging output for this type. */
12313 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12318 /* Build and install a CONST_DECL for an enumeration constant of the
12319 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12320 Assignment of sequential values by default is handled here. */
12323 build_enumerator (name
, value
, type
)
12331 /* Remove no-op casts from the value. */
12333 STRIP_TYPE_NOPS (value
);
12335 if (! processing_template_decl
)
12337 /* Validate and default VALUE. */
12338 if (value
!= NULL_TREE
)
12340 if (TREE_READONLY_DECL_P (value
))
12341 value
= decl_constant_value (value
);
12343 if (TREE_CODE (value
) == INTEGER_CST
)
12345 value
= default_conversion (value
);
12346 constant_expression_warning (value
);
12350 cp_error ("enumerator value for `%D' not integer constant", name
);
12355 /* Default based on previous value. */
12356 if (value
== NULL_TREE
&& ! processing_template_decl
)
12358 value
= enum_next_value
;
12360 cp_error ("overflow in enumeration values at `%D'", name
);
12363 /* Remove no-op casts from the value. */
12365 STRIP_TYPE_NOPS (value
);
12367 /* To fix MAX_VAL enum consts. (bkoz) */
12368 TREE_TYPE (value
) = integer_type_node
;
12372 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12373 Even in other cases, we will later (in finish_enum) be setting the
12375 if (value
!= NULL_TREE
)
12376 value
= copy_node (value
);
12378 /* C++ associates enums with global, function, or class declarations. */
12380 context
= current_scope ();
12381 if (context
&& context
== current_class_type
)
12382 /* This enum declaration is local to the class. */
12383 decl
= build_lang_field_decl (CONST_DECL
, name
, type
);
12385 /* It's a global enum, or it's local to a function. (Note local to
12386 a function could mean local to a class method. */
12387 decl
= build_decl (CONST_DECL
, name
, type
);
12389 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12390 DECL_INITIAL (decl
) = value
;
12391 TREE_READONLY (decl
) = 1;
12393 if (context
&& context
== current_class_type
)
12395 pushdecl_class_level (decl
);
12396 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12397 on the TYPE_FIELDS list for `S'. (That's so that you can say
12398 things like `S::i' later.) */
12399 finish_member_declaration (decl
);
12404 GNU_xref_decl (current_function_decl
, decl
);
12407 if (! processing_template_decl
)
12409 /* Set basis for default for next value. */
12410 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12411 integer_one_node
, PLUS_EXPR
);
12412 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12415 result
= saveable_tree_cons (name
, decl
, NULL_TREE
);
12420 static int function_depth
;
12422 /* Create the FUNCTION_DECL for a function definition.
12423 DECLSPECS and DECLARATOR are the parts of the declaration;
12424 they describe the function's name and the type it returns,
12425 but twisted together in a fashion that parallels the syntax of C.
12427 This function creates a binding context for the function body
12428 as well as setting up the FUNCTION_DECL in current_function_decl.
12430 Returns 1 on success. If the DECLARATOR is not suitable for a function
12431 (it defines a datum instead), we return 0, which tells
12432 yyparse to report a parse error.
12434 For C++, we must first check whether that datum makes any sense.
12435 For example, "class A local_a(1,2);" means that variable local_a
12436 is an aggregate of type A, which should have a constructor
12437 applied to it with the argument list [1, 2].
12439 @@ There is currently no way to retrieve the storage
12440 @@ allocated to FUNCTION (or all of its parms) if we return
12441 @@ something we had previously. */
12444 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
12445 tree declspecs
, declarator
, attrs
;
12449 tree ctype
= NULL_TREE
;
12452 extern int have_extern_spec
;
12453 extern int used_extern_spec
;
12454 int doing_friend
= 0;
12456 /* Sanity check. */
12457 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12458 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12460 /* Assume, until we see it does. */
12461 current_function_returns_value
= 0;
12462 current_function_returns_null
= 0;
12463 warn_about_return_type
= 0;
12465 shadowed_labels
= 0;
12466 current_function_assigns_this
= 0;
12467 current_function_just_assigned_this
= 0;
12468 current_function_parms_stored
= 0;
12469 original_result_rtx
= NULL_RTX
;
12470 base_init_expr
= NULL_TREE
;
12471 current_base_init_list
= NULL_TREE
;
12472 current_member_init_list
= NULL_TREE
;
12473 ctor_label
= dtor_label
= NULL_TREE
;
12474 static_labelno
= 0;
12476 clear_temp_name ();
12478 /* This should only be done once on the top most decl. */
12479 if (have_extern_spec
&& !used_extern_spec
)
12481 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12482 used_extern_spec
= 1;
12487 decl1
= declarator
;
12490 /* What was this testing for, exactly? */
12491 if (! DECL_ARGUMENTS (decl1
)
12492 && !DECL_STATIC_FUNCTION_P (decl1
)
12493 && !DECL_ARTIFICIAL (decl1
)
12494 && DECL_CLASS_SCOPE_P (decl1
)
12495 && TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))
12496 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))))
12498 tree binding
= binding_for_name (DECL_NAME (decl1
),
12499 current_namespace
);
12500 cp_error ("redeclaration of `%#D'", decl1
);
12501 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)))
12502 cp_error_at ("previous declaration here", IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)));
12503 else if (BINDING_VALUE (binding
))
12504 cp_error_at ("previous declaration here", BINDING_VALUE (binding
));
12508 fntype
= TREE_TYPE (decl1
);
12509 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12510 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12512 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12513 class is in the (lexical) scope of the class in which it is
12515 if (!ctype
&& DECL_FRIEND_P (decl1
))
12517 ctype
= DECL_CLASS_CONTEXT (decl1
);
12519 /* CTYPE could be null here if we're dealing with a template;
12520 for example, `inline friend float foo()' inside a template
12521 will have no CTYPE set. */
12522 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12528 /* In a fcn definition, arg types must be complete. */
12529 require_complete_types_for_parms (DECL_ARGUMENTS (decl1
));
12531 /* In case some arg types were completed since the declaration was
12532 parsed, fix up the decls. */
12534 tree t
= DECL_ARGUMENTS (decl1
);
12535 for (; t
; t
= TREE_CHAIN (t
))
12536 layout_decl (t
, 0);
12539 last_function_parms
= DECL_ARGUMENTS (decl1
);
12540 last_function_parm_tags
= NULL_TREE
;
12544 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12545 /* If the declarator is not suitable for a function definition,
12546 cause a syntax error. */
12547 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12549 fntype
= TREE_TYPE (decl1
);
12551 restype
= TREE_TYPE (fntype
);
12552 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12554 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12555 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12556 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12557 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12558 fntype
= build_function_type (integer_type_node
,
12559 TYPE_ARG_TYPES (fntype
));
12561 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12563 TYPE_ARG_TYPES (fntype
));
12564 TREE_TYPE (decl1
) = fntype
;
12567 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12568 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12569 else if (DECL_MAIN_P (decl1
))
12571 /* If this doesn't return integer_type, complain. */
12572 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12574 if (pedantic
|| warn_return_type
)
12575 pedwarn ("return type for `main' changed to `int'");
12576 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12578 warn_about_return_type
= 0;
12582 /* Warn if function was previously implicitly declared
12583 (but not if we warned then). */
12584 if (! warn_implicit
12585 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12586 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12588 current_function_decl
= decl1
;
12589 /* Save the parm names or decls from this function's declarator
12590 where store_parm_decls will find them. */
12591 current_function_parms
= last_function_parms
;
12592 current_function_parm_tags
= last_function_parm_tags
;
12594 announce_function (decl1
);
12596 if (! processing_template_decl
)
12598 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12600 cp_error ("return-type `%#T' is an incomplete type",
12601 TREE_TYPE (fntype
));
12603 /* Make it return void instead, but don't change the
12604 type of the DECL_RESULT, in case we have a named return value. */
12607 = build_cplus_method_type (build_type_variant (ctype
,
12608 TREE_READONLY (decl1
),
12609 TREE_SIDE_EFFECTS (decl1
)),
12611 FUNCTION_ARG_CHAIN (decl1
));
12614 = build_function_type (void_type_node
,
12615 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
12616 DECL_RESULT (decl1
)
12617 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
12618 TREE_READONLY (DECL_RESULT (decl1
))
12619 = CP_TYPE_CONST_P (TREE_TYPE (fntype
));
12620 TREE_THIS_VOLATILE (DECL_RESULT (decl1
))
12621 = CP_TYPE_VOLATILE_P (TREE_TYPE (fntype
));
12624 if (TYPE_LANG_SPECIFIC (TREE_TYPE (fntype
))
12625 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (fntype
)))
12626 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
12629 if (warn_about_return_type
)
12630 pedwarn ("return-type defaults to `int'");
12632 /* Effective C++ rule 15. See also c_expand_return. */
12634 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12635 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12636 cp_warning ("`operator=' should return a reference to `*this'");
12638 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12639 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12640 DECL_INITIAL (decl1
) = error_mark_node
;
12642 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12643 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12646 /* This function exists in static storage.
12647 (This does not mean `static' in the C sense!) */
12648 TREE_STATIC (decl1
) = 1;
12650 /* Set up current_class_type, and enter the scope of the class, if
12653 push_nested_class (ctype
, 1);
12654 else if (DECL_STATIC_FUNCTION_P (decl1
))
12655 push_nested_class (DECL_CONTEXT (decl1
), 2);
12657 /* We must call push_template_decl after current_class_type is set
12658 up. (If we are processing inline definitions after exiting a
12659 class scope, current_class_type will be NULL_TREE until set above
12660 by push_nested_class.) */
12661 if (processing_template_decl
)
12662 decl1
= push_template_decl (decl1
);
12664 /* Record the decl so that the function name is defined.
12665 If we already have a decl for this name, and it is a FUNCTION_DECL,
12666 use the old decl. */
12667 if (!processing_template_decl
&& pre_parsed_p
== 0)
12669 /* A specialization is not used to guide overload resolution. */
12670 if ((flag_guiding_decls
12671 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12672 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12673 decl1
= pushdecl (decl1
);
12676 /* We need to set the DECL_CONTEXT. */
12677 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12678 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12679 /* And make sure we have enough default args. */
12680 check_default_args (decl1
);
12682 DECL_MAIN_VARIANT (decl1
) = decl1
;
12683 fntype
= TREE_TYPE (decl1
);
12686 current_function_decl
= decl1
;
12688 if (DECL_INTERFACE_KNOWN (decl1
))
12690 tree ctx
= hack_decl_function_context (decl1
);
12692 if (DECL_NOT_REALLY_EXTERN (decl1
))
12693 DECL_EXTERNAL (decl1
) = 0;
12695 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12696 && TREE_PUBLIC (ctx
))
12697 /* This is a function in a local class in an extern inline
12699 comdat_linkage (decl1
);
12701 /* If this function belongs to an interface, it is public.
12702 If it belongs to someone else's interface, it is also external.
12703 It doesn't matter whether it's inline or not. */
12704 else if (interface_unknown
== 0
12705 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12706 || flag_alt_external_templates
))
12708 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12709 || processing_template_decl
)
12710 DECL_EXTERNAL (decl1
)
12712 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
));
12714 DECL_EXTERNAL (decl1
) = 0;
12715 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
12716 DECL_INTERFACE_KNOWN (decl1
) = 1;
12720 /* This is a definition, not a reference.
12721 So clear DECL_EXTERNAL. */
12722 DECL_EXTERNAL (decl1
) = 0;
12724 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
12725 && ! DECL_INTERFACE_KNOWN (decl1
)
12726 /* Don't try to defer nested functions for now. */
12727 && ! hack_decl_function_context (decl1
))
12728 DECL_DEFER_OUTPUT (decl1
) = 1;
12730 DECL_INTERFACE_KNOWN (decl1
) = 1;
12733 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
12735 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12736 TREE_TYPE (decl1
) = fntype
12737 = build_function_type (TREE_TYPE (fntype
),
12738 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
12739 current_function_parms
= TREE_CHAIN (current_function_parms
);
12740 DECL_ARGUMENTS (decl1
) = current_function_parms
;
12743 restype
= TREE_TYPE (fntype
);
12747 /* If we're compiling a friend function, neither of the variables
12748 current_class_ptr nor current_class_type will have values. */
12749 if (! doing_friend
)
12751 /* We know that this was set up by `grokclassfn'.
12752 We do not wait until `store_parm_decls', since evil
12753 parse errors may never get us to that point. Here
12754 we keep the consistency between `current_class_type'
12755 and `current_class_ptr'. */
12756 tree t
= current_function_parms
;
12758 my_friendly_assert (t
!= NULL_TREE
12759 && TREE_CODE (t
) == PARM_DECL
, 162);
12761 if (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
)
12765 if (! hack_decl_function_context (decl1
))
12766 temporary_allocation ();
12767 i
= suspend_momentary ();
12769 /* Normally, build_indirect_ref returns
12770 current_class_ref whenever current_class_ptr is
12771 dereferenced. This time, however, we want it to
12772 *create* current_class_ref, so we temporarily clear
12773 current_class_ptr to fool it. */
12774 current_class_ptr
= NULL_TREE
;
12775 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
12776 current_class_ptr
= t
;
12778 resume_momentary (i
);
12779 if (! hack_decl_function_context (decl1
))
12780 end_temporary_allocation ();
12783 /* We're having a signature pointer here. */
12784 current_class_ref
= current_class_ptr
= t
;
12789 current_class_ptr
= current_class_ref
= NULL_TREE
;
12792 current_binding_level
->parm_flag
= 1;
12794 GNU_xref_function (decl1
, current_function_parms
);
12797 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
12799 make_function_rtl (decl1
);
12801 /* Promote the value to int before returning it. */
12802 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
12803 restype
= type_promotes_to (restype
);
12805 /* If this fcn was already referenced via a block-scope `extern' decl
12806 (or an implicit decl), propagate certain information about the usage. */
12807 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
12808 TREE_ADDRESSABLE (decl1
) = 1;
12810 if (DECL_RESULT (decl1
) == NULL_TREE
)
12812 DECL_RESULT (decl1
)
12813 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12814 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
12815 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
12818 /* Allocate further tree nodes temporarily during compilation
12819 of this function only. Tiemann moved up here from bottom of fn. */
12820 /* If this is a nested function, then we must continue to allocate RTL
12821 on the permanent obstack in case we need to inline it later. */
12822 if (! hack_decl_function_context (decl1
))
12823 temporary_allocation ();
12825 if (processing_template_decl
)
12827 ++minimal_parse_mode
;
12828 last_tree
= DECL_SAVED_TREE (decl1
)
12829 = build_nt (EXPR_STMT
, void_zero_node
);
12834 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
12835 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
12837 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
12838 ctor_label
= NULL_TREE
;
12842 dtor_label
= NULL_TREE
;
12843 if (DECL_CONSTRUCTOR_P (decl1
))
12844 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
12850 /* Called after store_parm_decls for a function-try-block. We need to update
12851 last_parm_cleanup_insn so that the base initializers for a constructor
12852 are run within this block, not before it. */
12855 expand_start_early_try_stmts ()
12857 expand_start_try_stmts ();
12858 last_parm_cleanup_insn
= get_last_insn ();
12861 /* Store the parameter declarations into the current function declaration.
12862 This is called after parsing the parameter declarations, before
12863 digesting the body of the function.
12865 Also install to binding contour return value identifier, if any. */
12868 store_parm_decls ()
12870 register tree fndecl
= current_function_decl
;
12871 register tree parm
;
12872 int parms_have_cleanups
= 0;
12873 tree cleanups
= NULL_TREE
;
12875 /* This is either a chain of PARM_DECLs (when a prototype is used). */
12876 tree specparms
= current_function_parms
;
12878 /* This is a list of types declared among parms in a prototype. */
12879 tree parmtags
= current_function_parm_tags
;
12881 /* This is a chain of any other decls that came in among the parm
12882 declarations. If a parm is declared with enum {foo, bar} x;
12883 then CONST_DECLs for foo and bar are put here. */
12884 tree nonparms
= NULL_TREE
;
12886 if (toplevel_bindings_p ())
12887 fatal ("parse errors have confused me too much");
12889 /* Initialize RTL machinery. */
12890 init_function_start (fndecl
, input_filename
, lineno
);
12892 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
12893 declare_function_name ();
12895 /* Create a binding level for the parms. */
12896 expand_start_bindings (0);
12898 if (specparms
!= NULL_TREE
)
12900 /* This case is when the function was defined with an ANSI prototype.
12901 The parms already have decls, so we need not do anything here
12902 except record them as in effect
12903 and complain if any redundant old-style parm decls were written. */
12905 register tree next
;
12907 /* Must clear this because it might contain TYPE_DECLs declared
12909 storedecls (NULL_TREE
);
12911 for (parm
= nreverse (specparms
); parm
; parm
= next
)
12913 next
= TREE_CHAIN (parm
);
12914 if (TREE_CODE (parm
) == PARM_DECL
)
12917 if (DECL_NAME (parm
) == NULL_TREE
)
12921 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
12922 cp_error ("parameter `%D' declared void", parm
);
12925 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
12926 A parameter is assumed not to have any side effects.
12927 If this should change for any reason, then this
12928 will have to wrap the bashed reference type in a save_expr.
12930 Also, if the parameter type is declared to be an X
12931 and there is an X(X&) constructor, we cannot lay it
12932 into the stack (any more), so we make this parameter
12933 look like it is really of reference type. Functions
12934 which pass parameters to this function will know to
12935 create a temporary in their frame, and pass a reference
12938 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
12939 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
12940 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
12944 if (! processing_template_decl
12945 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
12947 expand_decl (parm
);
12948 parms_have_cleanups
= 1;
12950 /* Keep track of the cleanups. */
12951 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
12956 /* If we find an enum constant or a type tag,
12957 put it aside for the moment. */
12958 TREE_CHAIN (parm
) = NULL_TREE
;
12959 nonparms
= chainon (nonparms
, parm
);
12963 /* Get the decls in their original chain order
12964 and record in the function. This is all and only the
12965 PARM_DECLs that were pushed into scope by the loop above. */
12966 DECL_ARGUMENTS (fndecl
) = getdecls ();
12968 storetags (chainon (parmtags
, gettags ()));
12971 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
12973 /* Now store the final chain of decls for the arguments
12974 as the decl-chain of the current lexical scope.
12975 Put the enumerators in as well, at the front so that
12976 DECL_ARGUMENTS is not modified. */
12978 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
12980 /* Initialize the RTL code for the function. */
12981 DECL_SAVED_INSNS (fndecl
) = NULL_RTX
;
12982 if (! processing_template_decl
)
12983 expand_function_start (fndecl
, parms_have_cleanups
);
12985 current_function_parms_stored
= 1;
12987 /* If this function is `main', emit a call to `__main'
12988 to run global initializers, etc. */
12989 if (DECL_MAIN_P (fndecl
))
12990 expand_main_function ();
12992 /* Now that we have initialized the parms, we can start their
12993 cleanups. We cannot do this before, since expand_decl_cleanup
12994 should not be called before the parm can be used. */
12996 && ! processing_template_decl
)
12998 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
13000 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
13001 cp_error ("parser lost in parsing declaration of `%D'",
13002 TREE_PURPOSE (cleanups
));
13006 /* Create a binding contour which can be used to catch
13007 cleanup-generated temporaries. Also, if the return value needs or
13008 has initialization, deal with that now. */
13009 if (parms_have_cleanups
)
13012 expand_start_bindings (0);
13015 if (! processing_template_decl
&& flag_exceptions
)
13017 /* Do the starting of the exception specifications, if we have any. */
13018 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13019 expand_start_eh_spec ();
13022 last_parm_cleanup_insn
= get_last_insn ();
13023 last_dtor_insn
= get_last_insn ();
13026 /* Bind a name and initialization to the return value of
13027 the current function. */
13030 store_return_init (return_id
, init
)
13031 tree return_id
, init
;
13033 tree decl
= DECL_RESULT (current_function_decl
);
13036 /* Give this error as many times as there are occurrences,
13037 so that users can use Emacs compilation buffers to find
13038 and fix all such places. */
13039 pedwarn ("ANSI C++ does not permit named return values");
13041 if (return_id
!= NULL_TREE
)
13043 if (DECL_NAME (decl
) == NULL_TREE
)
13045 DECL_NAME (decl
) = return_id
;
13046 DECL_ASSEMBLER_NAME (decl
) = return_id
;
13049 cp_error ("return identifier `%D' already in place", decl
);
13052 /* Can't let this happen for constructors. */
13053 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13055 error ("can't redefine default return value for constructors");
13059 /* If we have a named return value, put that in our scope as well. */
13060 if (DECL_NAME (decl
) != NULL_TREE
)
13062 /* If this named return value comes in a register,
13063 put it in a pseudo-register. */
13064 if (DECL_REGISTER (decl
))
13066 original_result_rtx
= DECL_RTL (decl
);
13067 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13070 /* Let `cp_finish_decl' know that this initializer is ok. */
13071 DECL_INITIAL (decl
) = init
;
13074 if (minimal_parse_mode
)
13075 add_tree (build_min_nt (RETURN_INIT
, return_id
,
13076 copy_to_permanent (init
)));
13078 cp_finish_decl (decl
, init
, NULL_TREE
, 0, 0);
13083 /* Finish up a function declaration and compile that function
13084 all the way to assembler language output. The free the storage
13085 for the function definition.
13087 This is called after parsing the body of the function definition.
13088 LINENO is the current line number.
13090 C++: CALL_POPLEVEL is non-zero if an extra call to poplevel
13091 (and expand_end_bindings) must be made to take care of the binding
13092 contour for the base initializers. This is only relevant for
13095 NESTED is nonzero if we were in the middle of compiling another function
13096 when we started on this one. */
13099 finish_function (lineno
, call_poplevel
, nested
)
13104 register tree fndecl
= current_function_decl
;
13105 tree fntype
, ctype
= NULL_TREE
;
13106 rtx last_parm_insn
, insns
;
13107 /* Label to use if this function is supposed to return a value. */
13108 tree no_return_label
= NULL_TREE
;
13109 tree decls
= NULL_TREE
;
13111 /* When we get some parse errors, we can end up without a
13112 current_function_decl, so cope. */
13113 if (fndecl
== NULL_TREE
)
13116 if (! nested
&& function_depth
> 1)
13119 fntype
= TREE_TYPE (fndecl
);
13121 /* TREE_READONLY (fndecl) = 1;
13122 This caused &foo to be of type ptr-to-const-function
13123 which then got a warning when stored in a ptr-to-function variable. */
13125 /* This happens on strange parse errors. */
13126 if (! current_function_parms_stored
)
13129 store_parm_decls ();
13132 if (processing_template_decl
)
13134 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13136 decls
= getdecls ();
13137 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13138 poplevel (decls
!= NULL_TREE
, 0, 0);
13143 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13145 tree ttype
= target_type (fntype
);
13148 if (IS_AGGR_TYPE (ttype
))
13149 /* Let debugger know it should output info for this type. */
13150 note_debug_info_needed (ttype
);
13152 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13154 ttype
= target_type (TREE_TYPE (parmdecl
));
13155 if (IS_AGGR_TYPE (ttype
))
13156 /* Let debugger know it should output info for this type. */
13157 note_debug_info_needed (ttype
);
13161 /* Clean house because we will need to reorder insns here. */
13162 do_pending_stack_adjust ();
13166 tree binfo
= TYPE_BINFO (current_class_type
);
13167 tree cond
= integer_one_node
;
13169 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13171 int ok_to_optimize_dtor
= 0;
13172 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13174 if (current_function_assigns_this
)
13175 cond
= build (NE_EXPR
, boolean_type_node
,
13176 current_class_ptr
, integer_zero_node
);
13179 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13181 /* If this destructor is empty, then we don't need to check
13182 whether `this' is NULL in some cases. */
13183 if ((flag_this_is_variable
& 1) == 0)
13184 ok_to_optimize_dtor
= 1;
13185 else if (empty_dtor
)
13186 ok_to_optimize_dtor
13187 = (n_baseclasses
== 0
13188 || (n_baseclasses
== 1
13189 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13192 /* These initializations might go inline. Protect
13193 the binding level of the parms. */
13195 expand_start_bindings (0);
13197 if (current_function_assigns_this
)
13199 current_function_assigns_this
= 0;
13200 current_function_just_assigned_this
= 0;
13203 /* Generate the code to call destructor on base class.
13204 If this destructor belongs to a class with virtual
13205 functions, then set the virtual function table
13206 pointer to represent the type of our base class. */
13208 /* This side-effect makes call to `build_delete' generate the
13209 code we have to have at the end of this destructor.
13210 `build_delete' will set the flag again. */
13211 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13213 /* These are two cases where we cannot delegate deletion. */
13214 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13215 || TYPE_GETS_REG_DELETE (current_class_type
))
13216 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13217 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13219 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13220 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13222 /* If we did not assign to this, then `this' is non-zero at
13223 the end of a destructor. As a special optimization, don't
13224 emit test if this is an empty destructor. If it does nothing,
13225 it does nothing. If it calls a base destructor, the base
13226 destructor will perform the test. */
13228 if (exprstmt
!= error_mark_node
13229 && (TREE_CODE (exprstmt
) != NOP_EXPR
13230 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13231 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13233 expand_label (dtor_label
);
13234 if (cond
!= integer_one_node
)
13235 expand_start_cond (cond
, 0);
13236 if (exprstmt
!= void_zero_node
)
13237 /* Don't call `expand_expr_stmt' if we're not going to do
13238 anything, since -Wall will give a diagnostic. */
13239 expand_expr_stmt (exprstmt
);
13241 /* Run destructor on all virtual baseclasses. */
13242 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13244 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13245 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13246 in_charge_node
, integer_two_node
), 0);
13249 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13251 tree vb
= get_vbase
13252 (BINFO_TYPE (vbases
),
13253 TYPE_BINFO (current_class_type
));
13255 (build_scoped_method_call
13256 (current_class_ref
, vb
, dtor_identifier
,
13257 build_expr_list (NULL_TREE
, integer_zero_node
)));
13259 vbases
= TREE_CHAIN (vbases
);
13261 expand_end_cond ();
13264 do_pending_stack_adjust ();
13265 if (cond
!= integer_one_node
)
13266 expand_end_cond ();
13269 virtual_size
= c_sizeof (current_class_type
);
13271 /* At the end, call delete if that's what's requested. */
13273 /* FDIS sez: At the point of definition of a virtual destructor
13274 (including an implicit definition), non-placement operator
13275 delete shall be looked up in the scope of the destructor's
13276 class and if found shall be accessible and unambiguous.
13278 This is somewhat unclear, but I take it to mean that if the
13279 class only defines placement deletes we don't do anything here.
13280 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13281 for us if they ever try to delete one of these. */
13283 if (TYPE_GETS_REG_DELETE (current_class_type
)
13284 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13285 exprstmt
= build_op_delete_call
13286 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13287 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13289 exprstmt
= NULL_TREE
;
13293 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13294 in_charge_node
, integer_one_node
);
13295 expand_start_cond (cond
, 0);
13296 expand_expr_stmt (exprstmt
);
13297 expand_end_cond ();
13300 /* End of destructor. */
13301 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13302 poplevel (2, 0, 0); /* XXX change to 1 */
13304 /* Back to the top of destructor. */
13305 /* Don't execute destructor code if `this' is NULL. */
13309 /* If the dtor is empty, and we know there is not possible way we
13310 could use any vtable entries, before they are possibly set by
13311 a base class dtor, we don't have to setup the vtables, as we
13312 know that any base class dtoring will set up any vtables it
13313 needs. We avoid MI, because one base class dtor can do a
13314 virtual dispatch to an overridden function that would need to
13315 have a non-related vtable set up, we cannot avoid setting up
13316 vtables in that case. We could change this to see if there is
13317 just one vtable. */
13318 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13320 /* Make all virtual function table pointers in non-virtual base
13321 classes point to CURRENT_CLASS_TYPE's virtual function
13323 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13325 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13326 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13329 if (! ok_to_optimize_dtor
)
13331 cond
= build_binary_op (NE_EXPR
,
13332 current_class_ptr
, integer_zero_node
, 1);
13333 expand_start_cond (cond
, 0);
13336 insns
= get_insns ();
13339 last_parm_insn
= get_first_nonparm_insn ();
13340 if (last_parm_insn
== NULL_RTX
)
13341 last_parm_insn
= get_last_insn ();
13343 last_parm_insn
= previous_insn (last_parm_insn
);
13345 emit_insns_after (insns
, last_parm_insn
);
13347 if (! ok_to_optimize_dtor
)
13348 expand_end_cond ();
13350 else if (current_function_assigns_this
)
13352 /* Does not need to call emit_base_init, because
13353 that is done (if needed) just after assignment to this
13356 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13358 end_protect_partials ();
13359 expand_label (ctor_label
);
13360 ctor_label
= NULL_TREE
;
13364 decls
= getdecls ();
13365 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13366 poplevel (decls
!= NULL_TREE
, 0, 0);
13368 /* c_expand_return knows to return 'this' from a constructor. */
13369 c_expand_return (NULL_TREE
);
13371 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13372 && return_label
!= NULL_RTX
)
13373 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13375 current_function_assigns_this
= 0;
13376 current_function_just_assigned_this
= 0;
13377 base_init_expr
= NULL_TREE
;
13379 else if (DECL_CONSTRUCTOR_P (fndecl
))
13381 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13382 /* Allow constructor for a type to get a new instance of the object
13383 using `build_new'. */
13384 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13385 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13387 DECL_RETURNS_FIRST_ARG (fndecl
) = 1;
13389 if (flag_this_is_variable
> 0)
13391 cond
= build_binary_op (EQ_EXPR
,
13392 current_class_ptr
, integer_zero_node
, 1);
13393 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13394 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13397 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13401 if (flag_this_is_variable
> 0)
13403 expand_start_cond (cond
, 0);
13404 expand_expr_stmt (thenclause
);
13405 expand_end_cond ();
13408 /* Emit insns from `emit_base_init' which sets up virtual
13409 function table pointer(s). */
13410 if (base_init_expr
)
13412 expand_expr_stmt (base_init_expr
);
13413 base_init_expr
= NULL_TREE
;
13416 insns
= get_insns ();
13419 /* This is where the body of the constructor begins. */
13421 emit_insns_after (insns
, last_parm_cleanup_insn
);
13423 end_protect_partials ();
13425 /* This is where the body of the constructor ends. */
13426 expand_label (ctor_label
);
13427 ctor_label
= NULL_TREE
;
13431 decls
= getdecls ();
13432 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13433 poplevel (decls
!= NULL_TREE
, 1, 0);
13436 /* c_expand_return knows to return 'this' from a constructor. */
13437 c_expand_return (NULL_TREE
);
13439 current_function_assigns_this
= 0;
13440 current_function_just_assigned_this
= 0;
13442 else if (DECL_MAIN_P (fndecl
))
13444 /* Make it so that `main' always returns 0 by default. */
13446 c_expand_return (integer_one_node
);
13448 c_expand_return (integer_zero_node
);
13451 else if (return_label
!= NULL_RTX
13452 && current_function_return_value
== NULL_TREE
13453 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13454 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13456 if (flag_exceptions
)
13457 expand_exception_blocks ();
13459 /* If this function is supposed to return a value, ensure that
13460 we do not fall into the cleanups by mistake. The end of our
13461 function will look like this:
13463 user code (may have return stmt somewhere)
13464 goto no_return_label
13469 NOTE_INSN_FUNCTION_END
13473 If the user omits a return stmt in the USER CODE section, we
13474 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13475 Otherwise, we won't. */
13476 if (no_return_label
)
13478 DECL_CONTEXT (no_return_label
) = fndecl
;
13479 DECL_INITIAL (no_return_label
) = error_mark_node
;
13480 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13481 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13482 expand_goto (no_return_label
);
13487 /* Remove the binding contour which is used
13488 to catch cleanup-generated temporaries. */
13489 expand_end_bindings (0, 0, 0);
13490 poplevel (0, 0, 0);
13492 /* Emit label at beginning of cleanup code for parameters. */
13493 emit_label (cleanup_label
);
13496 /* Get return value into register if that's where it's supposed to be. */
13497 if (original_result_rtx
)
13498 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13500 /* Finish building code that will trigger warnings if users forget
13501 to make their functions return values. */
13502 if (no_return_label
|| cleanup_label
)
13503 emit_jump (return_label
);
13504 if (no_return_label
)
13506 /* We don't need to call `expand_*_return' here because we
13507 don't need any cleanups here--this path of code is only
13508 for error checking purposes. */
13509 expand_label (no_return_label
);
13512 /* Generate rtl for function exit. */
13513 expand_function_end (input_filename
, lineno
, 1);
13516 /* This must come after expand_function_end because cleanups might
13517 have declarations (from inline functions) that need to go into
13518 this function's blocks. */
13519 if (current_binding_level
->parm_flag
!= 1)
13520 my_friendly_abort (122);
13521 poplevel (1, 0, 1);
13523 /* Reset scope for C++: if we were in the scope of a class,
13524 then when we finish this function, we are not longer so.
13525 This cannot be done until we know for sure that no more
13526 class members will ever be referenced in this function
13527 (i.e., calls to destructors). */
13528 if (current_class_name
)
13530 ctype
= current_class_type
;
13531 pop_nested_class (1);
13534 /* Must mark the RESULT_DECL as being in this function. */
13535 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13537 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13538 to the FUNCTION_DECL node itself. */
13539 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13541 if (! processing_template_decl
)
13543 int saved_flag_keep_inline_functions
=
13544 flag_keep_inline_functions
;
13546 /* So we can tell if jump_optimize sets it to 1. */
13549 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13550 && hack_decl_function_context (fndecl
))
13551 /* Trick rest_of_compilation into not deferring output of this
13552 function, even if it is inline, since the rtl_obstack for
13553 this function is the function_obstack of the enclosing
13554 function and will be deallocated when the enclosing
13555 function is gone. See save_tree_status. */
13556 flag_keep_inline_functions
= 1;
13558 /* Run the optimizers and output the assembler code for this
13561 if (DECL_ARTIFICIAL (fndecl
))
13563 /* Do we really *want* to inline this synthesized method? */
13565 int save_fif
= flag_inline_functions
;
13566 flag_inline_functions
= 1;
13568 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13569 will check our size. */
13570 DECL_INLINE (fndecl
) = 0;
13572 rest_of_compilation (fndecl
);
13573 flag_inline_functions
= save_fif
;
13576 rest_of_compilation (fndecl
);
13578 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13580 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13582 /* Set DECL_EXTERNAL so that assemble_external will be called as
13583 necessary. We'll clear it again in finish_file. */
13584 if (! DECL_EXTERNAL (fndecl
))
13585 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13586 DECL_EXTERNAL (fndecl
) = 1;
13587 mark_inline_for_output (fndecl
);
13590 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13591 note_debug_info_needed (ctype
);
13593 current_function_returns_null
|= can_reach_end
;
13595 /* Since we don't normally go through c_expand_return for constructors,
13596 this normally gets the wrong value.
13597 Also, named return values have their return codes emitted after
13598 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13599 if (DECL_CONSTRUCTOR_P (fndecl
)
13600 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13601 current_function_returns_null
= 0;
13603 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
13604 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13605 else if ((warn_return_type
|| pedantic
)
13606 && current_function_returns_null
13607 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13609 /* If this function returns non-void and control can drop through,
13611 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13613 /* With just -W, complain only if function returns both with
13614 and without a value. */
13615 else if (extra_warnings
13616 && current_function_returns_value
&& current_function_returns_null
)
13617 warning ("this function may return with or without a value");
13622 /* Free all the tree nodes making up this function. */
13623 /* Switch back to allocating nodes permanently
13624 until we start another function. */
13625 if (processing_template_decl
)
13627 --minimal_parse_mode
;
13628 DECL_SAVED_TREE (fndecl
) = TREE_CHAIN (DECL_SAVED_TREE (fndecl
));
13632 permanent_allocation (1);
13634 if (DECL_SAVED_INSNS (fndecl
) == NULL_RTX
)
13638 /* Stop pointing to the local nodes about to be freed. */
13639 /* But DECL_INITIAL must remain nonzero so we know this
13640 was an actual function definition. */
13641 DECL_INITIAL (fndecl
) = error_mark_node
;
13642 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13643 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13646 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13647 static_ctors
= perm_tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13648 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13649 static_dtors
= perm_tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13653 /* Let the error reporting routines know that we're outside a
13654 function. For a nested function, this value is used in
13655 pop_cp_function_context and then reset via pop_function_context. */
13656 current_function_decl
= NULL_TREE
;
13659 named_label_uses
= NULL
;
13660 current_class_ptr
= NULL_TREE
;
13661 current_class_ref
= NULL_TREE
;
13664 /* Create the FUNCTION_DECL for a function definition.
13665 LINE1 is the line number that the definition absolutely begins on.
13666 LINE2 is the line number that the name of the function appears on.
13667 DECLSPECS and DECLARATOR are the parts of the declaration;
13668 they describe the return type and the name of the function,
13669 but twisted together in a fashion that parallels the syntax of C.
13671 This function creates a binding context for the function body
13672 as well as setting up the FUNCTION_DECL in current_function_decl.
13674 Returns a FUNCTION_DECL on success.
13676 If the DECLARATOR is not suitable for a function (it defines a datum
13677 instead), we return 0, which tells yyparse to report a parse error.
13679 May return void_type_node indicating that this method is actually
13680 a friend. See grokfield for more details.
13682 Came here with a `.pushlevel' .
13684 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13685 CHANGES TO CODE IN `grokfield'. */
13688 start_method (declspecs
, declarator
, attrlist
)
13689 tree declarator
, declspecs
, attrlist
;
13691 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13694 /* Something too ugly to handle. */
13695 if (fndecl
== NULL_TREE
)
13698 /* Pass friends other than inline friend functions back. */
13699 if (fndecl
== void_type_node
)
13702 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13703 /* Not a function, tell parser to report parse error. */
13706 if (IS_SIGNATURE (current_class_type
))
13707 IS_DEFAULT_IMPLEMENTATION (fndecl
) = 1;
13709 if (DECL_IN_AGGR_P (fndecl
))
13711 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13713 if (DECL_CONTEXT (fndecl
)
13714 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13715 cp_error ("`%D' is already defined in class %s", fndecl
,
13716 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13718 return void_type_node
;
13721 DECL_THIS_INLINE (fndecl
) = 1;
13723 if (flag_default_inline
)
13724 DECL_INLINE (fndecl
) = 1;
13726 /* We process method specializations in finish_struct_1. */
13727 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13728 fndecl
= push_template_decl (fndecl
);
13730 /* We read in the parameters on the maybepermanent_obstack,
13731 but we won't be getting back to them until after we
13732 may have clobbered them. So the call to preserve_data
13733 will keep them safe. */
13736 if (! DECL_FRIEND_P (fndecl
))
13738 if (TREE_CHAIN (fndecl
))
13740 fndecl
= copy_node (fndecl
);
13741 TREE_CHAIN (fndecl
) = NULL_TREE
;
13744 if (DECL_CONSTRUCTOR_P (fndecl
))
13746 if (! grok_ctor_properties (current_class_type
, fndecl
))
13747 return void_type_node
;
13749 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13750 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13753 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13755 /* Make a place for the parms */
13757 current_binding_level
->parm_flag
= 1;
13759 DECL_IN_AGGR_P (fndecl
) = 1;
13763 /* Go through the motions of finishing a function definition.
13764 We don't compile this method until after the whole class has
13767 FINISH_METHOD must return something that looks as though it
13768 came from GROKFIELD (since we are defining a method, after all).
13770 This is called after parsing the body of the function definition.
13771 STMTS is the chain of statements that makes up the function body.
13773 DECL is the ..._DECL that `start_method' provided. */
13776 finish_method (decl
)
13779 register tree fndecl
= decl
;
13782 register tree link
;
13784 if (decl
== void_type_node
)
13787 old_initial
= DECL_INITIAL (fndecl
);
13789 /* Undo the level for the parms (from start_method).
13790 This is like poplevel, but it causes nothing to be
13791 saved. Saving information here confuses symbol-table
13792 output routines. Besides, this information will
13793 be correctly output when this method is actually
13796 /* Clear out the meanings of the local variables of this level;
13797 also record in each decl which block it belongs to. */
13799 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13801 if (DECL_NAME (link
) != NULL_TREE
)
13802 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = 0;
13803 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13804 DECL_CONTEXT (link
) = NULL_TREE
;
13807 /* Restore all name-meanings of the outer levels
13808 that were shadowed by this level. */
13810 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
13811 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
13812 for (link
= current_binding_level
->class_shadowed
;
13813 link
; link
= TREE_CHAIN (link
))
13814 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
13815 for (link
= current_binding_level
->type_shadowed
;
13816 link
; link
= TREE_CHAIN (link
))
13817 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
13819 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13820 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13821 current_binding_level
->parm_flag
,
13822 current_binding_level
->keep
);
13824 poplevel (0, 0, 0);
13826 DECL_INITIAL (fndecl
) = old_initial
;
13828 /* We used to check if the context of FNDECL was different from
13829 current_class_type as another way to get inside here. This didn't work
13830 for String.cc in libg++. */
13831 if (DECL_FRIEND_P (fndecl
))
13833 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13834 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13835 decl
= void_type_node
;
13841 /* Called when a new struct TYPE is defined.
13842 If this structure or union completes the type of any previous
13843 variable declaration, lay it out and output its rtl. */
13846 hack_incomplete_structures (type
)
13851 if (current_binding_level
->incomplete
== NULL_TREE
)
13854 if (!type
) /* Don't do this for class templates. */
13857 for (list
= ¤t_binding_level
->incomplete
; *list
; )
13859 tree decl
= TREE_VALUE (*list
);
13860 if ((decl
&& TREE_TYPE (decl
) == type
)
13861 || (TREE_TYPE (decl
)
13862 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13863 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
13865 int toplevel
= toplevel_bindings_p ();
13866 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13867 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
13868 layout_type (TREE_TYPE (decl
));
13869 layout_decl (decl
, 0);
13870 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
13874 expand_decl (decl
);
13875 cleanup
= maybe_build_cleanup (decl
);
13876 expand_decl_init (decl
);
13877 if (! expand_decl_cleanup (decl
, cleanup
))
13878 cp_error ("parser lost in parsing declaration of `%D'",
13881 *list
= TREE_CHAIN (*list
);
13884 list
= &TREE_CHAIN (*list
);
13888 /* If DECL is of a type which needs a cleanup, build that cleanup here.
13889 See build_delete for information about AUTO_DELETE.
13891 Don't build these on the momentary obstack; they must live
13892 the life of the binding contour. */
13895 maybe_build_cleanup_1 (decl
, auto_delete
)
13896 tree decl
, auto_delete
;
13898 tree type
= TREE_TYPE (decl
);
13899 if (TYPE_NEEDS_DESTRUCTOR (type
))
13901 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
13904 if (TREE_CODE (decl
) != PARM_DECL
)
13905 temp
= suspend_momentary ();
13907 if (TREE_CODE (type
) == ARRAY_TYPE
)
13911 mark_addressable (decl
);
13912 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
13915 /* Optimize for space over speed here. */
13916 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
13917 || flag_expensive_optimizations
)
13918 flags
|= LOOKUP_NONVIRTUAL
;
13920 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
13922 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
13923 && ! TYPE_HAS_DESTRUCTOR (type
))
13924 rval
= build_compound_expr (expr_tree_cons (NULL_TREE
, rval
,
13925 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
13927 if (TREE_CODE (decl
) != PARM_DECL
)
13928 resume_momentary (temp
);
13935 /* If DECL is of a type which needs a cleanup, build that cleanup
13936 here. The cleanup does free the storage with a call to delete. */
13939 maybe_build_cleanup_and_delete (decl
)
13942 return maybe_build_cleanup_1 (decl
, integer_three_node
);
13945 /* If DECL is of a type which needs a cleanup, build that cleanup
13946 here. The cleanup does not free the storage with a call a delete. */
13949 maybe_build_cleanup (decl
)
13952 return maybe_build_cleanup_1 (decl
, integer_two_node
);
13955 /* Expand a C++ expression at the statement level.
13956 This is needed to ferret out nodes which have UNKNOWN_TYPE.
13957 The C++ type checker should get all of these out when
13958 expressions are combined with other, type-providing, expressions,
13959 leaving only orphan expressions, such as:
13961 &class::bar; / / takes its address, but does nothing with it. */
13964 cplus_expand_expr_stmt (exp
)
13967 if (processing_template_decl
)
13969 add_tree (build_min_nt (EXPR_STMT
, exp
));
13973 /* Arrange for all temps to disappear. */
13974 expand_start_target_temps ();
13976 if (TREE_TYPE (exp
) == unknown_type_node
)
13978 if (TREE_CODE (exp
) == COMPONENT_REF
)
13979 error ("invalid reference to a member function name, did you forget the ()?");
13981 error ("address of overloaded function with no contextual type information");
13985 if (TREE_CODE (exp
) == FUNCTION_DECL
)
13987 cp_warning ("reference, not call, to function `%D'", exp
);
13988 warning ("at this point in file");
13992 /* We should do this eventually, but right now this causes regex.o from
13993 libg++ to miscompile, and tString to core dump. */
13994 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
13997 /* Strip unused implicit INDIRECT_REFs of references. */
13998 if (TREE_CODE (exp
) == INDIRECT_REF
13999 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
14000 exp
= TREE_OPERAND (exp
, 0);
14002 /* If we don't do this, we end up down inside expand_expr
14003 trying to do TYPE_MODE on the ERROR_MARK, and really
14004 go outside the bounds of the type. */
14005 if (exp
!= error_mark_node
)
14006 expand_expr_stmt (break_out_cleanups (exp
));
14009 /* Clean up any pending cleanups. This happens when a function call
14010 returns a cleanup-needing value that nobody uses. */
14011 expand_end_target_temps ();
14014 /* When a stmt has been parsed, this function is called.
14016 Currently, this function only does something within a
14017 constructor's scope: if a stmt has just assigned to this,
14018 and we are in a derived class, we call `emit_base_init'. */
14023 extern struct nesting
*cond_stack
, *loop_stack
, *case_stack
;
14026 if (current_function_assigns_this
14027 || ! current_function_just_assigned_this
)
14029 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14031 /* Constructors must wait until we are out of control
14032 zones before calling base constructors. */
14033 if (cond_stack
|| loop_stack
|| case_stack
)
14035 expand_expr_stmt (base_init_expr
);
14036 check_base_init (current_class_type
);
14038 current_function_assigns_this
= 1;
14041 /* Change a static member function definition into a FUNCTION_TYPE, instead
14042 of the METHOD_TYPE that we create when it's originally parsed.
14044 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14045 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14046 other decls. Either pass the addresses of local variables or NULL. */
14049 revert_static_member_fn (decl
, fn
, argtypes
)
14050 tree
*decl
, *fn
, *argtypes
;
14053 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14054 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14056 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14057 != TYPE_UNQUALIFIED
)
14058 cp_error ("static member function `%#D' declared with type qualifiers",
14061 args
= TREE_CHAIN (args
);
14062 tmp
= build_function_type (TREE_TYPE (function
), args
);
14063 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14064 tmp
= build_exception_variant (tmp
,
14065 TYPE_RAISES_EXCEPTIONS (function
));
14066 TREE_TYPE (*decl
) = tmp
;
14067 if (DECL_ARGUMENTS (*decl
))
14068 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14069 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14077 id_in_current_class (id
)
14080 return !!purpose_member (id
, class_binding_level
->class_shadowed
);
14087 int warn_about_return_type
;
14089 int just_assigned_this
;
14091 int temp_name_counter
;
14093 struct named_label_list
*named_label_uses
;
14094 tree shadowed_labels
;
14097 rtx last_dtor_insn
;
14098 rtx last_parm_cleanup_insn
;
14099 tree base_init_list
;
14100 tree member_init_list
;
14101 tree base_init_expr
;
14102 tree current_class_ptr
;
14103 tree current_class_ref
;
14105 struct cp_function
*next
;
14106 struct binding_level
*binding_level
;
14107 int static_labelno
;
14110 static struct cp_function
*cp_function_chain
;
14112 extern int temp_name_counter
;
14114 /* Save and reinitialize the variables
14115 used during compilation of a C++ function. */
14118 push_cp_function_context (context
)
14121 struct cp_function
*p
14122 = (struct cp_function
*) xmalloc (sizeof (struct cp_function
));
14124 push_function_context_to (context
);
14126 p
->next
= cp_function_chain
;
14127 cp_function_chain
= p
;
14129 p
->named_labels
= named_labels
;
14130 p
->named_label_uses
= named_label_uses
;
14131 p
->shadowed_labels
= shadowed_labels
;
14132 p
->returns_value
= current_function_returns_value
;
14133 p
->returns_null
= current_function_returns_null
;
14134 p
->warn_about_return_type
= warn_about_return_type
;
14135 p
->binding_level
= current_binding_level
;
14136 p
->ctor_label
= ctor_label
;
14137 p
->dtor_label
= dtor_label
;
14138 p
->last_dtor_insn
= last_dtor_insn
;
14139 p
->last_parm_cleanup_insn
= last_parm_cleanup_insn
;
14140 p
->assigns_this
= current_function_assigns_this
;
14141 p
->just_assigned_this
= current_function_just_assigned_this
;
14142 p
->parms_stored
= current_function_parms_stored
;
14143 p
->result_rtx
= original_result_rtx
;
14144 p
->base_init_expr
= base_init_expr
;
14145 p
->temp_name_counter
= temp_name_counter
;
14146 p
->base_init_list
= current_base_init_list
;
14147 p
->member_init_list
= current_member_init_list
;
14148 p
->current_class_ptr
= current_class_ptr
;
14149 p
->current_class_ref
= current_class_ref
;
14150 p
->static_labelno
= static_labelno
;
14153 /* Restore the variables used during compilation of a C++ function. */
14156 pop_cp_function_context (context
)
14159 struct cp_function
*p
= cp_function_chain
;
14162 /* Bring back all the labels that were shadowed. */
14163 for (link
= shadowed_labels
; link
; link
= TREE_CHAIN (link
))
14164 if (DECL_NAME (TREE_VALUE (link
)) != 0)
14165 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link
)),
14166 TREE_VALUE (link
));
14168 pop_function_context_from (context
);
14170 cp_function_chain
= p
->next
;
14172 named_labels
= p
->named_labels
;
14173 named_label_uses
= p
->named_label_uses
;
14174 shadowed_labels
= p
->shadowed_labels
;
14175 current_function_returns_value
= p
->returns_value
;
14176 current_function_returns_null
= p
->returns_null
;
14177 warn_about_return_type
= p
->warn_about_return_type
;
14178 current_binding_level
= p
->binding_level
;
14179 ctor_label
= p
->ctor_label
;
14180 dtor_label
= p
->dtor_label
;
14181 last_dtor_insn
= p
->last_dtor_insn
;
14182 last_parm_cleanup_insn
= p
->last_parm_cleanup_insn
;
14183 current_function_assigns_this
= p
->assigns_this
;
14184 current_function_just_assigned_this
= p
->just_assigned_this
;
14185 current_function_parms_stored
= p
->parms_stored
;
14186 original_result_rtx
= p
->result_rtx
;
14187 base_init_expr
= p
->base_init_expr
;
14188 temp_name_counter
= p
->temp_name_counter
;
14189 current_base_init_list
= p
->base_init_list
;
14190 current_member_init_list
= p
->member_init_list
;
14191 current_class_ptr
= p
->current_class_ptr
;
14192 current_class_ref
= p
->current_class_ref
;
14193 static_labelno
= p
->static_labelno
;
14201 return function_depth
!= 0;